1 /* Process declarations and variables for C compiler.
2 Copyright (C) 1988, 92-98, 1999 Free Software Foundation, Inc.
3 Contributed by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
23 /* Process declarations and symbol lookup for C front end.
24 Also constructs types; the standard scalar types at initialization,
25 and structure, union, array and enum types when they are declared. */
27 /* ??? not all decl nodes are given the most useful possible
28 line numbers. For example, the CONST_DECLs for enum values. */
46 #define obstack_chunk_alloc xmalloc
47 #define obstack_chunk_free free
49 extern tree builtin_return_address_fndecl
;
51 extern struct obstack permanent_obstack
;
52 extern struct obstack
* saveable_obstack
;
54 extern int current_class_depth
;
56 extern tree static_ctors
, static_dtors
;
58 extern int static_labelno
;
60 extern tree current_namespace
;
61 extern tree global_namespace
;
63 extern void (*print_error_function
) PROTO((char *));
64 extern int (*valid_lang_attribute
) PROTO ((tree
, tree
, tree
, tree
));
66 /* Stack of places to restore the search obstack back to. */
68 /* Obstack used for remembering local class declarations (like
69 enums and static (const) members. */
71 struct obstack decl_obstack
;
72 static struct stack_level
*decl_stack
;
74 #ifndef CHAR_TYPE_SIZE
75 #define CHAR_TYPE_SIZE BITS_PER_UNIT
78 #ifndef SHORT_TYPE_SIZE
79 #define SHORT_TYPE_SIZE (BITS_PER_UNIT * MIN ((UNITS_PER_WORD + 1) / 2, 2))
83 #define INT_TYPE_SIZE BITS_PER_WORD
86 #ifndef LONG_TYPE_SIZE
87 #define LONG_TYPE_SIZE BITS_PER_WORD
90 #ifndef LONG_LONG_TYPE_SIZE
91 #define LONG_LONG_TYPE_SIZE (BITS_PER_WORD * 2)
94 #ifndef WCHAR_UNSIGNED
95 #define WCHAR_UNSIGNED 0
98 #ifndef FLOAT_TYPE_SIZE
99 #define FLOAT_TYPE_SIZE BITS_PER_WORD
102 #ifndef DOUBLE_TYPE_SIZE
103 #define DOUBLE_TYPE_SIZE (BITS_PER_WORD * 2)
106 #ifndef LONG_DOUBLE_TYPE_SIZE
107 #define LONG_DOUBLE_TYPE_SIZE (BITS_PER_WORD * 2)
110 #ifndef BOOL_TYPE_SIZE
111 #ifdef SLOW_BYTE_ACCESS
112 #define BOOL_TYPE_SIZE ((SLOW_BYTE_ACCESS) ? (POINTER_SIZE) : (CHAR_TYPE_SIZE))
114 #define BOOL_TYPE_SIZE CHAR_TYPE_SIZE
118 /* We let tm.h override the types used here, to handle trivial differences
119 such as the choice of unsigned int or long unsigned int for size_t.
120 When machines start needing nontrivial differences in the size type,
121 it would be best to do something here to figure out automatically
122 from other information what type to use. */
125 #define SIZE_TYPE "long unsigned int"
129 #define PTRDIFF_TYPE "long int"
133 #define WCHAR_TYPE "int"
136 static tree grokparms
PROTO((tree
, int));
137 static tree lookup_nested_type
PROTO((tree
, tree
));
138 static const char *redeclaration_error_message
PROTO((tree
, tree
));
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 void declare_namespace_level
PROTO((void));
149 static void signal_catch
PROTO((int)) ATTRIBUTE_NORETURN
;
150 static void storedecls
PROTO((tree
));
151 static void require_complete_types_for_parms
PROTO((tree
));
152 static void push_overloaded_decl_1
PROTO((tree
));
153 static int ambi_op_p
PROTO((tree
));
154 static int unary_op_p
PROTO((tree
));
155 static tree store_bindings
PROTO((tree
, tree
));
156 static tree lookup_tag_reverse
PROTO((tree
, tree
));
157 static tree obscure_complex_init
PROTO((tree
, tree
));
158 static tree maybe_build_cleanup_1
PROTO((tree
, tree
));
159 static tree lookup_name_real
PROTO((tree
, int, int, int));
160 static void warn_extern_redeclared_static
PROTO((tree
, tree
));
161 static void grok_reference_init
PROTO((tree
, tree
, tree
));
162 static tree grokfndecl
PROTO((tree
, tree
, tree
, tree
, int,
163 enum overload_flags
, tree
,
164 tree
, int, int, int, int, int, int, tree
));
165 static tree grokvardecl
PROTO((tree
, tree
, RID_BIT_TYPE
*, int, int, tree
));
166 static tree lookup_tag
PROTO((enum tree_code
, tree
,
167 struct binding_level
*, int));
168 static void set_identifier_type_value_with_scope
169 PROTO((tree
, tree
, struct binding_level
*));
170 static void record_builtin_type
PROTO((enum rid
, const char *, tree
));
171 static void record_unknown_type
PROTO((tree
, const char *));
172 static int member_function_or_else
PROTO((tree
, tree
, const char *));
173 static void bad_specifiers
PROTO((tree
, const char *, int, int, int, int,
175 static void lang_print_error_function
PROTO((char *));
176 static tree maybe_process_template_type_declaration
PROTO((tree
, int, struct binding_level
*));
177 static void check_for_uninitialized_const_var
PROTO((tree
));
178 static unsigned long typename_hash
PROTO((hash_table_key
));
179 static boolean typename_compare
PROTO((hash_table_key
, hash_table_key
));
180 static void push_binding
PROTO((tree
, tree
, struct binding_level
*));
181 static int add_binding
PROTO((tree
, tree
));
182 static void pop_binding
PROTO((tree
, tree
));
183 static tree local_variable_p
PROTO((tree
));
184 static tree find_binding
PROTO((tree
, tree
));
185 static tree select_decl
PROTO((tree
, int));
186 static tree unqualified_namespace_lookup
PROTO((tree
, int));
187 static int lookup_flags
PROTO((int, int));
188 static tree qualify_lookup
PROTO((tree
, int));
189 static tree record_builtin_java_type
PROTO((const char *, int));
190 static const char *tag_name
PROTO((enum tag_types code
));
191 static void find_class_binding_level
PROTO((void));
192 static struct binding_level
*innermost_nonclass_level
PROTO((void));
193 static tree poplevel_class
PROTO((void));
194 static void warn_about_implicit_typename_lookup
PROTO((tree
, tree
));
195 static int walk_namespaces_r
PROTO((tree
, walk_namespaces_fn
, void *));
196 static int walk_globals_r
PROTO((tree
, void *));
198 #if defined (DEBUG_CP_BINDING_LEVELS)
199 static void indent
PROTO((void));
202 /* A node which has tree code ERROR_MARK, and whose type is itself.
203 All erroneous expressions are replaced with this node. All functions
204 that accept nodes as arguments should avoid generating error messages
205 if this node is one of the arguments, since it is undesirable to get
206 multiple error messages from one error in the input. */
208 tree error_mark_node
;
210 /* Erroneous argument lists can use this *IFF* they do not modify it. */
211 tree error_mark_list
;
213 /* INTEGER_TYPE and REAL_TYPE nodes for the standard data types */
215 tree short_integer_type_node
;
216 tree integer_type_node
;
217 tree long_integer_type_node
;
218 tree long_long_integer_type_node
;
220 tree short_unsigned_type_node
;
221 tree unsigned_type_node
;
222 tree long_unsigned_type_node
;
223 tree long_long_unsigned_type_node
;
225 tree ptrdiff_type_node
;
227 tree unsigned_char_type_node
;
228 tree signed_char_type_node
;
230 tree wchar_type_node
;
231 tree signed_wchar_type_node
;
232 tree unsigned_wchar_type_node
;
234 tree wchar_decl_node
;
236 tree float_type_node
;
237 tree double_type_node
;
238 tree long_double_type_node
;
240 tree complex_integer_type_node
;
241 tree complex_float_type_node
;
242 tree complex_double_type_node
;
243 tree complex_long_double_type_node
;
245 tree intQI_type_node
;
246 tree intHI_type_node
;
247 tree intSI_type_node
;
248 tree intDI_type_node
;
249 #if HOST_BITS_PER_WIDE_INT >= 64
250 tree intTI_type_node
;
253 tree unsigned_intQI_type_node
;
254 tree unsigned_intHI_type_node
;
255 tree unsigned_intSI_type_node
;
256 tree unsigned_intDI_type_node
;
257 #if HOST_BITS_PER_WIDE_INT >= 64
258 tree unsigned_intTI_type_node
;
261 tree java_byte_type_node
;
262 tree java_short_type_node
;
263 tree java_int_type_node
;
264 tree java_long_type_node
;
265 tree java_float_type_node
;
266 tree java_double_type_node
;
267 tree java_char_type_node
;
268 tree java_boolean_type_node
;
270 /* A VOID_TYPE node, and the same, packaged in a TREE_LIST. */
272 tree void_type_node
, void_list_node
;
275 /* Nodes for types `void *' and `const void *'. */
278 tree const_ptr_type_node
;
280 /* Nodes for types `char *' and `const char *'. */
282 tree string_type_node
, const_string_type_node
;
284 /* Type `char[256]' or something like it.
285 Used when an array of char is needed and the size is irrelevant. */
287 tree char_array_type_node
;
289 /* Type `int[256]' or something like it.
290 Used when an array of int needed and the size is irrelevant. */
292 tree int_array_type_node
;
294 /* Type `wchar_t[256]' or something like it.
295 Used when a wide string literal is created. */
297 tree wchar_array_type_node
;
299 /* The bool data type, and constants */
300 tree boolean_type_node
, boolean_true_node
, boolean_false_node
;
302 /* Type `int ()' -- used for implicit declaration of functions. */
304 tree default_function_type
;
306 /* Function types `double (double)' and `double (double, double)', etc. */
308 static tree double_ftype_double
, double_ftype_double_double
;
309 static tree int_ftype_int
, long_ftype_long
;
310 static tree float_ftype_float
;
311 static tree ldouble_ftype_ldouble
;
313 /* Function type `int (const void *, const void *, size_t)' */
314 static tree int_ftype_cptr_cptr_sizet
;
317 tree vtable_entry_type
;
318 tree delta_type_node
;
320 /* Old rtti stuff. */
321 tree __baselist_desc_type_node
;
322 tree __i_desc_type_node
, __m_desc_type_node
;
323 tree __t_desc_array_type
, __i_desc_array_type
, __m_desc_array_type
;
325 tree __t_desc_type_node
;
327 tree __tp_desc_type_node
;
329 tree __access_mode_type_node
;
330 tree __bltn_desc_type_node
, __user_desc_type_node
, __class_desc_type_node
;
331 tree __ptr_desc_type_node
, __attr_desc_type_node
, __func_desc_type_node
;
332 tree __ptmf_desc_type_node
, __ptmd_desc_type_node
;
334 /* Not needed yet? May be needed one day? */
335 tree __bltn_desc_array_type
, __user_desc_array_type
, __class_desc_array_type
;
336 tree __ptr_desc_array_type
, __attr_dec_array_type
, __func_desc_array_type
;
337 tree __ptmf_desc_array_type
, __ptmd_desc_array_type
;
340 /* Indicates that there is a type value in some namespace, although
341 that is not necessarily in scope at the moment. */
343 static tree global_type_node
;
345 tree class_star_type_node
;
346 tree class_type_node
, record_type_node
, union_type_node
, enum_type_node
;
347 tree unknown_type_node
;
348 tree opaque_type_node
, signature_type_node
;
349 tree sigtable_entry_type
;
351 /* Array type `vtable_entry_type[]' */
353 tree vtbl_ptr_type_node
;
359 /* Expect only namespace names now. */
360 static int only_namespace_names
;
362 /* In a destructor, the point at which all derived class destroying
363 has been done, just before any base class destroying will be done. */
367 /* In a destructor, the last insn emitted after the start of the
368 function and the parms. */
370 static rtx last_dtor_insn
;
372 /* In a constructor, the last insn emitted after the start of the
373 function and the parms, the exception specification and any
374 function-try-block. The constructor initializers are emitted after
377 static rtx last_parm_cleanup_insn
;
379 /* In a constructor, the point at which we are ready to return
380 the pointer to the initialized object. */
384 /* A FUNCTION_DECL which can call `abort'. Not necessarily the
385 one that the user will declare, but sufficient to be called
386 by routines that want to abort the program. */
390 /* A FUNCTION_DECL for the default `::operator delete'. */
392 tree global_delete_fndecl
;
394 extern rtx cleanup_label
, return_label
;
396 /* If original DECL_RESULT of current function was a register,
397 but due to being an addressable named return value, would up
398 on the stack, this variable holds the named return value's
399 original location. */
400 static rtx original_result_rtx
;
402 /* Sequence of insns which represents base initialization. */
405 /* C++: Keep these around to reduce calls to `get_identifier'.
406 Identifiers for `this' in member functions and the auto-delete
407 parameter for destructors. */
408 tree this_identifier
, in_charge_identifier
;
409 tree ctor_identifier
, dtor_identifier
;
410 /* Used in pointer to member functions, in vtables, and in sigtables. */
411 tree pfn_identifier
, index_identifier
, delta_identifier
, delta2_identifier
;
412 tree pfn_or_delta2_identifier
, tag_identifier
;
413 tree vt_off_identifier
;
415 struct named_label_list
417 struct binding_level
*binding_level
;
420 char *filename_o_goto
;
422 struct named_label_list
*next
;
425 /* A list (chain of TREE_LIST nodes) of named label uses.
426 The TREE_PURPOSE field is the list of variables defined
427 in the label's scope defined at the point of use.
428 The TREE_VALUE field is the LABEL_DECL used.
429 The TREE_TYPE field holds `current_binding_level' at the
430 point of the label's use.
432 BWAHAHAAHAHahhahahahaah. No, no, no, said the little chicken.
434 Look at the pretty struct named_label_list. See the pretty struct
435 with the pretty named fields that describe what they do. See the
436 pretty lack of gratuitous casts. Notice the code got a lot cleaner.
438 Used only for jumps to as-yet undefined labels, since
439 jumps to defined labels can have their validity checked
442 static struct named_label_list
*named_label_uses
= NULL
;
444 /* A list of objects which have constructors or destructors
445 which reside in the global scope. The decl is stored in
446 the TREE_VALUE slot and the initializer is stored
447 in the TREE_PURPOSE slot. */
448 tree static_aggregates
;
452 /* Two expressions that are constants with value zero.
453 The first is of type `int', the second of type `void *'. */
455 tree integer_zero_node
;
456 tree null_pointer_node
;
458 /* The value for __null (NULL), namely, a zero of an integer type with
459 the same number of bits as a pointer. */
462 /* A node for the integer constants 1, 2, and 3. */
464 tree integer_one_node
, integer_two_node
, integer_three_node
;
466 /* While defining an enum type, this is 1 plus the last enumerator
469 static tree enum_next_value
;
471 /* Nonzero means that there was overflow computing enum_next_value. */
473 static int enum_overflow
;
475 /* Parsing a function declarator leaves a list of parameter names
476 or a chain or parameter decls here. */
478 tree last_function_parms
;
480 /* Parsing a function declarator leaves here a chain of structure
481 and enum types declared in the parmlist. */
483 static tree last_function_parm_tags
;
485 /* After parsing the declarator that starts a function definition,
486 `start_function' puts here the list of parameter names or chain of decls.
487 `store_parm_decls' finds it here. */
489 static tree current_function_parms
;
491 /* Similar, for last_function_parm_tags. */
492 static tree current_function_parm_tags
;
494 /* A list (chain of TREE_LIST nodes) of all LABEL_DECLs in the function
495 that have names. Here so we can clear out their names' definitions
496 at the end of the function. */
498 static tree named_labels
;
500 /* A list of LABEL_DECLs from outer contexts that are currently shadowed. */
502 static tree shadowed_labels
;
504 /* The FUNCTION_DECL for the function currently being compiled,
505 or 0 if between functions. */
506 tree current_function_decl
;
508 /* Set to 0 at beginning of a function definition, set to 1 if
509 a return statement that specifies a return value is seen. */
511 int current_function_returns_value
;
513 /* Set to 0 at beginning of a function definition, set to 1 if
514 a return statement with no argument is seen. */
516 int current_function_returns_null
;
518 /* Set to 0 at beginning of a function definition, and whenever
519 a label (case or named) is defined. Set to value of expression
520 returned from function when that value can be transformed into
521 a named return value. */
523 tree current_function_return_value
;
525 /* Nonzero means give `double' the same size as `float'. */
527 extern int flag_short_double
;
529 /* Nonzero means don't recognize any builtin functions. */
531 extern int flag_no_builtin
;
533 /* Nonzero means don't recognize the non-ANSI builtin functions.
536 extern int flag_no_nonansi_builtin
;
538 /* Nonzero means enable obscure ANSI features and disable GNU extensions
539 that might cause ANSI-compliant code to be miscompiled. */
541 extern int flag_ansi
;
543 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
545 extern int flag_huge_objects
;
547 /* Nonzero if we want to conserve space in the .o files. We do this
548 by putting uninitialized data and runtime initialized data into
549 .common instead of .data at the expense of not flagging multiple
551 extern int flag_conserve_space
;
553 /* Pointers to the base and current top of the language name stack. */
555 extern tree
*current_lang_base
, *current_lang_stack
;
557 /* C and C++ flags are in decl2.c. */
559 /* Set to 0 at beginning of a constructor, set to 1
560 if that function does an allocation before referencing its
561 instance variable. */
562 static int current_function_assigns_this
;
563 int current_function_just_assigned_this
;
565 /* Set to 0 at beginning of a function. Set non-zero when
566 store_parm_decls is called. Don't call store_parm_decls
567 if this flag is non-zero! */
568 int current_function_parms_stored
;
570 /* Flag used when debugging spew.c */
572 extern int spew_debug
;
574 /* This is a copy of the class_shadowed list of the previous class binding
575 contour when at global scope. It's used to reset IDENTIFIER_CLASS_VALUEs
576 when entering another class scope (i.e. a cache miss). */
577 extern tree previous_class_values
;
579 /* A expression of value 0 with the same precision as a sizetype
581 tree signed_size_zero_node
;
583 /* The name of the anonymous namespace, throughout this translation
585 tree anonymous_namespace_name
;
588 /* Allocate a level of searching. */
592 push_decl_level (stack
, obstack
)
593 struct stack_level
*stack
;
594 struct obstack
*obstack
;
596 struct stack_level tem
;
599 return push_stack_level (obstack
, (char *)&tem
, sizeof (tem
));
602 /* For each binding contour we allocate a binding_level structure
603 which records the names defined in that contour.
606 1) one for each function definition,
607 where internal declarations of the parameters appear.
608 2) one for each compound statement,
609 to record its declarations.
611 The current meaning of a name can be found by searching the levels
612 from the current one out to the global one.
614 Off to the side, may be the class_binding_level. This exists only
615 to catch class-local declarations. It is otherwise nonexistent.
617 Also there may be binding levels that catch cleanups that must be
618 run when exceptions occur. Thus, to see whether a name is bound in
619 the current scope, it is not enough to look in the
620 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
623 /* Note that the information in the `names' component of the global contour
624 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
628 /* A chain of _DECL nodes for all variables, constants, functions,
629 and typedef types. These are in the reverse of the order
630 supplied. There may be OVERLOADs on this list, too, but they
631 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
634 /* A list of structure, union and enum definitions, for looking up
636 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
637 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
638 or ENUMERAL_TYPE node.
640 C++: the TREE_VALUE nodes can be simple types for
641 component_bindings. */
644 /* A list of USING_DECL nodes. */
647 /* A list of used namespaces. PURPOSE is the namespace,
648 VALUE the common ancestor with this binding_level's namespace. */
649 tree using_directives
;
651 /* If this binding level is the binding level for a class, then
652 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
653 is the name of an entity bound in the class; the TREE_VALUE is
654 the IDENTIFIER_CLASS_VALUE before we entered the class. Thus,
655 when leaving class scope, we can restore the
656 IDENTIFIER_CLASS_VALUE by walking this list. The TREE_TYPE is
657 the DECL bound by this name in the class. */
660 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
661 is used for all binding levels. */
664 /* For each level (except not the global one),
665 a chain of BLOCK nodes for all the levels
666 that were entered and exited one level down. */
669 /* The BLOCK node for this level, if one has been preallocated.
670 If 0, the BLOCK is allocated (if needed) when the level is popped. */
673 /* The binding level which this one is contained in (inherits from). */
674 struct binding_level
*level_chain
;
676 /* List of decls in `names' that have incomplete
677 structure or union types. */
680 /* List of VAR_DECLS saved from a previous for statement.
681 These would be dead in ANSI-conforming code, but might
682 be referenced in ARM-era code. These are stored in a
683 TREE_LIST; the TREE_VALUE is the actual declaration. */
684 tree dead_vars_from_for
;
686 /* 1 for the level that holds the parameters of a function.
687 2 for the level that holds a class declaration.
688 3 for levels that hold parameter declarations. */
689 unsigned parm_flag
: 4;
691 /* 1 means make a BLOCK for this level regardless of all else.
692 2 for temporary binding contours created by the compiler. */
695 /* Nonzero if this level "doesn't exist" for tags. */
696 unsigned tag_transparent
: 1;
698 /* Nonzero if this level can safely have additional
699 cleanup-needing variables added to it. */
700 unsigned more_cleanups_ok
: 1;
701 unsigned have_cleanups
: 1;
703 /* Nonzero if this level is for storing the decls for template
704 parameters and generic decls; these decls will be discarded and
705 replaced with a TEMPLATE_DECL. */
706 unsigned pseudo_global
: 1;
708 /* This is set for a namespace binding level. */
709 unsigned namespace_p
: 1;
711 /* True if this level is that of a for-statement where we need to
712 worry about ambiguous (ARM or ANSI) scope rules. */
713 unsigned is_for_scope
: 1;
715 /* Two bits left for this word. */
717 #if defined(DEBUG_CP_BINDING_LEVELS)
718 /* Binding depth at which this level began. */
719 unsigned binding_depth
;
720 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
723 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
725 /* The binding level currently in effect. */
727 static struct binding_level
*current_binding_level
;
729 /* The binding level of the current class, if any. */
731 static struct binding_level
*class_binding_level
;
733 /* A chain of binding_level structures awaiting reuse. */
735 static struct binding_level
*free_binding_level
;
737 /* The outermost binding level, for names of file scope.
738 This is created when the compiler is started and exists
739 through the entire run. */
741 static struct binding_level
*global_binding_level
;
743 /* Binding level structures are initialized by copying this one. */
745 static struct binding_level clear_binding_level
;
747 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
749 static int keep_next_level_flag
;
751 #if defined(DEBUG_CP_BINDING_LEVELS)
752 static int binding_depth
= 0;
753 static int is_class_level
= 0;
760 for (i
= 0; i
< binding_depth
*2; i
++)
763 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
765 static tree pushdecl_with_scope
PROTO((tree
, struct binding_level
*));
768 push_binding_level (newlevel
, tag_transparent
, keep
)
769 struct binding_level
*newlevel
;
770 int tag_transparent
, keep
;
772 /* Add this level to the front of the chain (stack) of levels that
774 *newlevel
= clear_binding_level
;
775 newlevel
->level_chain
= current_binding_level
;
776 current_binding_level
= newlevel
;
777 newlevel
->tag_transparent
= tag_transparent
;
778 newlevel
->more_cleanups_ok
= 1;
779 newlevel
->keep
= keep
;
780 #if defined(DEBUG_CP_BINDING_LEVELS)
781 newlevel
->binding_depth
= binding_depth
;
783 fprintf (stderr
, "push %s level 0x%08x line %d\n",
784 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
787 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
790 /* Find the innermost enclosing class scope, and reset
791 CLASS_BINDING_LEVEL appropriately. */
794 find_class_binding_level ()
796 struct binding_level
*level
= current_binding_level
;
798 while (level
&& level
->parm_flag
!= 2)
799 level
= level
->level_chain
;
800 if (level
&& level
->parm_flag
== 2)
801 class_binding_level
= level
;
803 class_binding_level
= 0;
809 if (global_binding_level
)
811 /* Cannot pop a level, if there are none left to pop. */
812 if (current_binding_level
== global_binding_level
)
813 my_friendly_abort (123);
815 /* Pop the current level, and free the structure for reuse. */
816 #if defined(DEBUG_CP_BINDING_LEVELS)
819 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
820 (is_class_level
) ? "class" : "block",
821 current_binding_level
, lineno
);
822 if (is_class_level
!= (current_binding_level
== class_binding_level
))
825 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
828 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
830 register struct binding_level
*level
= current_binding_level
;
831 current_binding_level
= current_binding_level
->level_chain
;
832 level
->level_chain
= free_binding_level
;
833 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
834 if (level
->binding_depth
!= binding_depth
)
836 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
837 free_binding_level
= level
;
838 find_class_binding_level ();
843 suspend_binding_level ()
845 if (class_binding_level
)
846 current_binding_level
= class_binding_level
;
848 if (global_binding_level
)
850 /* Cannot suspend a level, if there are none left to suspend. */
851 if (current_binding_level
== global_binding_level
)
852 my_friendly_abort (123);
854 /* Suspend the current level. */
855 #if defined(DEBUG_CP_BINDING_LEVELS)
858 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
859 (is_class_level
) ? "class" : "block",
860 current_binding_level
, lineno
);
861 if (is_class_level
!= (current_binding_level
== class_binding_level
))
864 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
867 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
868 current_binding_level
= current_binding_level
->level_chain
;
869 find_class_binding_level ();
873 resume_binding_level (b
)
874 struct binding_level
*b
;
876 /* Resuming binding levels is meant only for namespaces,
877 and those cannot nest into classes. */
878 my_friendly_assert(!class_binding_level
, 386);
879 /* Also, resuming a non-directly nested namespace is a no-no. */
880 my_friendly_assert(b
->level_chain
== current_binding_level
, 386);
881 current_binding_level
= b
;
882 #if defined(DEBUG_CP_BINDING_LEVELS)
883 b
->binding_depth
= binding_depth
;
885 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
886 (is_class_level
) ? "class" : "block", b
, lineno
);
889 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
892 /* Create a new `struct binding_level'. */
895 struct binding_level
*
896 make_binding_level ()
899 return (struct binding_level
*) xmalloc (sizeof (struct binding_level
));
902 /* Nonzero if we are currently in the global binding level. */
907 return current_binding_level
== global_binding_level
;
910 /* Return the innermost binding level that is not for a class scope. */
912 static struct binding_level
*
913 innermost_nonclass_level ()
915 struct binding_level
*b
;
917 b
= current_binding_level
;
918 while (b
->parm_flag
== 2)
924 /* Nonzero if we are currently in a toplevel binding level. This
925 means either the global binding level or a namespace in a toplevel
926 binding level. Since there are no non-toplevel namespace levels,
927 this really means any namespace or pseudo-global level. We also
928 include a class whose context is toplevel. */
931 toplevel_bindings_p ()
933 struct binding_level
*b
= innermost_nonclass_level ();
935 return b
->namespace_p
|| b
->pseudo_global
;
938 /* Nonzero if this is a namespace scope, or if we are defining a class
939 which is itself at namespace scope, or whose enclosing class is
940 such a class, etc. */
943 namespace_bindings_p ()
945 struct binding_level
*b
= innermost_nonclass_level ();
947 return b
->namespace_p
;
953 keep_next_level_flag
= 1;
956 /* Nonzero if the current level needs to have a BLOCK made. */
961 return (current_binding_level
->blocks
!= NULL_TREE
962 || current_binding_level
->keep
963 || current_binding_level
->names
!= NULL_TREE
964 || (current_binding_level
->tags
!= NULL_TREE
965 && !current_binding_level
->tag_transparent
));
968 /* Identify this binding level as a level of parameters. */
971 declare_parm_level ()
973 current_binding_level
->parm_flag
= 1;
977 declare_pseudo_global_level ()
979 current_binding_level
->pseudo_global
= 1;
983 declare_namespace_level ()
985 current_binding_level
->namespace_p
= 1;
989 pseudo_global_level_p ()
991 struct binding_level
*b
= innermost_nonclass_level ();
993 return b
->pseudo_global
;
997 set_class_shadows (shadows
)
1000 class_binding_level
->class_shadowed
= shadows
;
1003 /* Enter a new binding level.
1004 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
1005 not for that of tags. */
1008 pushlevel (tag_transparent
)
1009 int tag_transparent
;
1011 register struct binding_level
*newlevel
= NULL_BINDING_LEVEL
;
1013 /* If this is the top level of a function,
1014 just make sure that NAMED_LABELS is 0.
1015 They should have been set to 0 at the end of the previous function. */
1017 if (current_binding_level
== global_binding_level
)
1018 my_friendly_assert (named_labels
== NULL_TREE
, 134);
1020 /* Reuse or create a struct for this binding level. */
1022 #if defined(DEBUG_CP_BINDING_LEVELS)
1024 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1025 if (free_binding_level
)
1026 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1028 newlevel
= free_binding_level
;
1029 free_binding_level
= free_binding_level
->level_chain
;
1033 newlevel
= make_binding_level ();
1036 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
1037 GNU_xref_start_scope ((HOST_WIDE_INT
) newlevel
);
1038 keep_next_level_flag
= 0;
1042 note_level_for_for ()
1044 current_binding_level
->is_for_scope
= 1;
1048 pushlevel_temporary (tag_transparent
)
1049 int tag_transparent
;
1051 pushlevel (tag_transparent
);
1052 current_binding_level
->keep
= 2;
1055 /* Note we don't call push_momentary() here. Otherwise, it would cause
1056 cleanups to be allocated on the momentary obstack, and they will be
1057 overwritten by the next statement. */
1059 expand_start_bindings (0);
1062 /* For a binding between a name and an entity at a block scope,
1063 this is the `struct binding_level' for the block. */
1064 #define BINDING_LEVEL(NODE) \
1065 (((struct tree_binding*)NODE)->scope.level)
1067 /* These are currently unused, but permanent, CPLUS_BINDING nodes.
1068 They are kept here because they are allocated from the permanent
1069 obstack and cannot be easily freed. */
1070 static tree free_binding_nodes
;
1072 /* Make DECL the innermost binding for ID. The LEVEL is the binding
1073 level at which this declaration is being bound. */
1076 push_binding (id
, decl
, level
)
1079 struct binding_level
* level
;
1083 if (!free_binding_nodes
)
1085 /* There are no free nodes, so we must build one here. */
1086 push_obstacks_nochange ();
1087 end_temporary_allocation ();
1088 binding
= make_node (CPLUS_BINDING
);
1093 /* There are nodes on the free list. Grab the first one. */
1094 binding
= free_binding_nodes
;
1096 /* And update the free list. */
1097 free_binding_nodes
= TREE_CHAIN (free_binding_nodes
);
1100 /* Now, fill in the binding information. */
1101 BINDING_VALUE (binding
) = decl
;
1102 BINDING_TYPE (binding
) = NULL_TREE
;
1103 BINDING_LEVEL (binding
) = level
;
1104 INHERITED_VALUE_BINDING_P (binding
) = 0;
1105 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
1107 /* And put it on the front of the list of bindings for ID. */
1108 TREE_CHAIN (binding
) = IDENTIFIER_BINDING (id
);
1109 IDENTIFIER_BINDING (id
) = binding
;
1112 /* ID is already bound in the current scope. But, DECL is an
1113 additional binding for ID in the same scope. This is the `struct
1114 stat' hack whereby a non-typedef class-name or enum-name can be
1115 bound at the same level as some other kind of entity. It's the
1116 responsibility of the caller to check that inserting this name is
1117 legal here. Returns nonzero if the new binding was successful. */
1119 add_binding (id
, decl
)
1123 tree binding
= IDENTIFIER_BINDING (id
);
1126 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
1127 /* The new name is the type name. */
1128 BINDING_TYPE (binding
) = decl
;
1129 else if (!BINDING_VALUE (binding
))
1130 /* This situation arises when push_class_level_binding moves an
1131 inherited type-binding out of the way to make room for a new
1133 BINDING_VALUE (binding
) = decl
;
1134 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
1135 && DECL_ARTIFICIAL (BINDING_VALUE (binding
)))
1137 /* The old binding was a type name. It was placed in
1138 BINDING_VALUE because it was thought, at the point it was
1139 declared, to be the only entity with such a name. Move the
1140 type name into the type slot; it is now hidden by the new
1142 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
1143 BINDING_VALUE (binding
) = decl
;
1144 INHERITED_VALUE_BINDING_P (binding
) = 0;
1148 cp_error ("declaration of `%#D'", decl
);
1149 cp_error_at ("conflicts with previous declaration `%#D'",
1150 BINDING_VALUE (binding
));
1157 /* Bind DECL to ID in the current_binding_level.
1158 If PUSH_USING is set in FLAGS, we know that DECL doesn't really belong
1159 to this binding level, that it got here through a using-declaration. */
1162 push_local_binding (id
, decl
, flags
)
1167 struct binding_level
*b
;
1169 /* Skip over any local classes. This makes sense if we call
1170 push_local_binding with a friend decl of a local class. */
1171 b
= current_binding_level
;
1172 while (b
->parm_flag
== 2)
1175 if (lookup_name_current_level (id
))
1177 /* Supplement the existing binding. */
1178 if (!add_binding (id
, decl
))
1179 /* It didn't work. Something else must be bound at this
1180 level. Do not add DECL to the list of things to pop
1185 /* Create a new binding. */
1186 push_binding (id
, decl
, b
);
1188 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
1189 /* We must put the OVERLOAD into a TREE_LIST since the
1190 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1191 decls that got here through a using-declaration. */
1192 decl
= build_tree_list (NULL_TREE
, decl
);
1194 /* And put DECL on the list of things declared by the current
1196 TREE_CHAIN (decl
) = b
->names
;
1200 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
1201 binding was successful. */
1204 push_class_binding (id
, decl
)
1209 tree binding
= IDENTIFIER_BINDING (id
);
1212 /* Note that we declared this value so that we can issue an error if
1213 this an illegal redeclaration of a name already used for some
1215 note_name_declared_in_class (id
, decl
);
1217 if (binding
&& BINDING_LEVEL (binding
) == class_binding_level
)
1218 /* Supplement the existing binding. */
1219 result
= add_binding (id
, decl
);
1221 /* Create a new binding. */
1222 push_binding (id
, decl
, class_binding_level
);
1224 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1225 class-level declaration. Note that we do not use DECL here
1226 because of the possibility of the `struct stat' hack; if DECL is
1227 a class-name or enum-name we might prefer a field-name, or some
1229 IDENTIFIER_CLASS_VALUE (id
) = BINDING_VALUE (IDENTIFIER_BINDING (id
));
1231 /* If this is a binding from a base class, mark it as such. */
1232 binding
= IDENTIFIER_BINDING (id
);
1233 if (BINDING_VALUE (binding
) == decl
&& TREE_CODE (decl
) != TREE_LIST
)
1235 /* Any implicit typename must be from a base-class. The
1236 context for an implicit typename declaration is always
1237 the derived class in which the lookup was done, so the checks
1238 based on the context of DECL below will not trigger. */
1239 if (TREE_CODE (decl
) == TYPE_DECL
1240 && IMPLICIT_TYPENAME_P (TREE_TYPE (decl
)))
1241 INHERITED_VALUE_BINDING_P (binding
) = 1;
1244 if (TREE_CODE (decl
) == OVERLOAD
)
1245 context
= DECL_REAL_CONTEXT (OVL_CURRENT (decl
));
1248 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd',
1250 context
= DECL_REAL_CONTEXT (decl
);
1253 if (is_properly_derived_from (current_class_type
, context
))
1254 INHERITED_VALUE_BINDING_P (binding
) = 1;
1256 INHERITED_VALUE_BINDING_P (binding
) = 0;
1259 else if (BINDING_VALUE (binding
) == decl
)
1260 /* We only encounter a TREE_LIST when push_class_decls detects an
1261 ambiguity. Such an ambiguity can be overridden by a definition
1263 INHERITED_VALUE_BINDING_P (binding
) = 1;
1268 /* Remove the binding for DECL which should be the innermost binding
1272 pop_binding (id
, decl
)
1278 if (id
== NULL_TREE
)
1279 /* It's easiest to write the loops that call this function without
1280 checking whether or not the entities involved have names. We
1281 get here for such an entity. */
1284 /* Get the innermost binding for ID. */
1285 binding
= IDENTIFIER_BINDING (id
);
1287 /* The name should be bound. */
1288 my_friendly_assert (binding
!= NULL_TREE
, 0);
1290 /* The DECL will be either the ordinary binding or the type
1291 binding for this identifier. Remove that binding. */
1292 if (BINDING_VALUE (binding
) == decl
)
1293 BINDING_VALUE (binding
) = NULL_TREE
;
1294 else if (BINDING_TYPE (binding
) == decl
)
1295 BINDING_TYPE (binding
) = NULL_TREE
;
1297 my_friendly_abort (0);
1299 if (!BINDING_VALUE (binding
) && !BINDING_TYPE (binding
))
1301 /* We're completely done with the innermost binding for this
1302 identifier. Unhook it from the list of bindings. */
1303 IDENTIFIER_BINDING (id
) = TREE_CHAIN (binding
);
1305 /* And place it on the free list. */
1306 TREE_CHAIN (binding
) = free_binding_nodes
;
1307 free_binding_nodes
= binding
;
1311 /* Exit a binding level.
1312 Pop the level off, and restore the state of the identifier-decl mappings
1313 that were in effect when this level was entered.
1315 If KEEP == 1, this level had explicit declarations, so
1316 and create a "block" (a BLOCK node) for the level
1317 to record its declarations and subblocks for symbol table output.
1319 If FUNCTIONBODY is nonzero, this level is the body of a function,
1320 so create a block as if KEEP were set and also clear out all
1323 If REVERSE is nonzero, reverse the order of decls before putting
1324 them into the BLOCK. */
1327 poplevel (keep
, reverse
, functionbody
)
1333 /* The chain of decls was accumulated in reverse order.
1334 Put it into forward order, just for cleanliness. */
1336 int tmp
= functionbody
;
1337 int real_functionbody
= current_binding_level
->keep
== 2
1338 ? ((functionbody
= 0), tmp
) : functionbody
;
1339 tree tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1340 tree subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1341 tree block
= NULL_TREE
;
1343 int block_previously_created
;
1344 int leaving_for_scope
;
1346 if (current_binding_level
->parm_flag
== 2)
1347 return poplevel_class ();
1349 my_friendly_assert (!current_binding_level
->class_shadowed
,
1352 /* We used to use KEEP == 2 to indicate that the new block should go
1353 at the beginning of the list of blocks at this binding level,
1354 rather than the end. This hack is no longer used. */
1355 my_friendly_assert (keep
== 0 || keep
== 1, 0);
1357 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1358 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1359 current_binding_level
->parm_flag
,
1360 current_binding_level
->keep
);
1362 if (current_binding_level
->keep
== 1)
1365 /* Get the decls in the order they were written.
1366 Usually current_binding_level->names is in reverse order.
1367 But parameter decls were previously put in forward order. */
1370 current_binding_level
->names
1371 = decls
= nreverse (current_binding_level
->names
);
1373 decls
= current_binding_level
->names
;
1375 /* Output any nested inline functions within this block
1376 if they weren't already output. */
1378 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1379 if (TREE_CODE (decl
) == FUNCTION_DECL
1380 && ! TREE_ASM_WRITTEN (decl
)
1381 && DECL_INITIAL (decl
) != NULL_TREE
1382 && TREE_ADDRESSABLE (decl
)
1383 && decl_function_context (decl
) == current_function_decl
)
1385 /* If this decl was copied from a file-scope decl
1386 on account of a block-scope extern decl,
1387 propagate TREE_ADDRESSABLE to the file-scope decl. */
1388 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1389 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1392 push_function_context ();
1393 output_inline_function (decl
);
1394 pop_function_context ();
1398 /* If there were any declarations or structure tags in that level,
1399 or if this level is a function body,
1400 create a BLOCK to record them for the life of this function. */
1403 block_previously_created
= (current_binding_level
->this_block
!= NULL_TREE
);
1404 if (block_previously_created
)
1405 block
= current_binding_level
->this_block
;
1406 else if (keep
== 1 || functionbody
)
1407 block
= make_node (BLOCK
);
1408 if (block
!= NULL_TREE
)
1410 if (block_previously_created
)
1412 if (decls
|| tags
|| subblocks
)
1414 if (BLOCK_VARS (block
) || BLOCK_TYPE_TAGS (block
))
1415 warning ("internal compiler error: debugging info corrupted");
1417 BLOCK_VARS (block
) = decls
;
1418 BLOCK_TYPE_TAGS (block
) = tags
;
1420 /* We can have previous subblocks and new subblocks when
1421 doing fixup_gotos with complex cleanups. We chain the new
1422 subblocks onto the end of any pre-existing subblocks. */
1423 BLOCK_SUBBLOCKS (block
) = chainon (BLOCK_SUBBLOCKS (block
),
1426 /* If we created the block earlier on, and we are just
1427 diddling it now, then it already should have a proper
1428 BLOCK_END_NOTE value associated with it. */
1432 BLOCK_VARS (block
) = decls
;
1433 BLOCK_TYPE_TAGS (block
) = tags
;
1434 BLOCK_SUBBLOCKS (block
) = subblocks
;
1435 /* Otherwise, for a new block, install a new BLOCK_END_NOTE
1437 remember_end_note (block
);
1441 /* In each subblock, record that this is its superior. */
1444 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1445 BLOCK_SUPERCONTEXT (link
) = block
;
1447 /* We still support the old for-scope rules, whereby the variables
1448 in a for-init statement were in scope after the for-statement
1449 ended. We only use the new rules in flag_new_for_scope is
1452 = current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1;
1454 /* Remove declarations for all the DECLs in this level. */
1455 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1457 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
)
1460 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link
)));
1464 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
1466 ns_binding
= NULL_TREE
;
1469 && (BINDING_LEVEL (outer_binding
)
1470 == current_binding_level
->level_chain
))
1471 /* We have something like:
1476 and we are leaving the `for' scope. There's no reason to
1477 keep the binding of the inner `i' in this case. */
1478 pop_binding (DECL_NAME (link
), link
);
1479 else if ((outer_binding
1480 && (TREE_CODE (BINDING_VALUE (outer_binding
))
1483 && TREE_CODE (ns_binding
) == TYPE_DECL
))
1484 /* Here, we have something like:
1492 We must pop the for-scope binding so we know what's a
1493 type and what isn't. */
1494 pop_binding (DECL_NAME (link
), link
);
1497 /* Mark this VAR_DECL as dead so that we can tell we left it
1498 there only for backward compatibility. */
1499 DECL_DEAD_FOR_LOCAL (link
) = 1;
1501 /* Keep track of what should of have happenned when we
1502 popped the binding. */
1503 if (outer_binding
&& BINDING_VALUE (outer_binding
))
1504 DECL_SHADOWED_FOR_VAR (link
)
1505 = BINDING_VALUE (outer_binding
);
1507 /* Add it to the list of dead variables in the next
1508 outermost binding to that we can remove these when we
1509 leave that binding. */
1510 current_binding_level
->level_chain
->dead_vars_from_for
1511 = tree_cons (NULL_TREE
, link
,
1512 current_binding_level
->level_chain
->
1513 dead_vars_from_for
);
1515 /* Although we don't pop the CPLUS_BINDING, we do clear
1516 its BINDING_LEVEL since the level is going away now. */
1517 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link
)))
1523 /* Remove the binding. */
1525 if (TREE_CODE (decl
) == TREE_LIST
)
1526 decl
= TREE_VALUE (decl
);
1527 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd')
1528 pop_binding (DECL_NAME (decl
), decl
);
1529 else if (TREE_CODE (decl
) == OVERLOAD
)
1530 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
1532 my_friendly_abort (0);
1536 /* Remove declarations for any `for' variables from inner scopes
1537 that we kept around. */
1538 for (link
= current_binding_level
->dead_vars_from_for
;
1539 link
; link
= TREE_CHAIN (link
))
1540 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
1542 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1543 for (link
= current_binding_level
->type_shadowed
;
1544 link
; link
= TREE_CHAIN (link
))
1545 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1547 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1548 list if a `using' declaration put them there. The debugging
1549 back-ends won't understand OVERLOAD, so we remove them here.
1550 Because the BLOCK_VARS are (temporarily) shared with
1551 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1552 popped all the bindings. */
1557 for (d
= &BLOCK_VARS (block
); *d
; )
1559 if (TREE_CODE (*d
) == TREE_LIST
)
1560 *d
= TREE_CHAIN (*d
);
1562 d
= &TREE_CHAIN (*d
);
1566 /* If the level being exited is the top level of a function,
1567 check over all the labels. */
1571 /* If this is the top level block of a function,
1572 the vars are the function's parameters.
1573 Don't leave them in the BLOCK because they are
1574 found in the FUNCTION_DECL instead. */
1576 BLOCK_VARS (block
) = 0;
1578 /* Clear out the definitions of all label names,
1579 since their scopes end here. */
1581 for (link
= named_labels
; link
; link
= TREE_CHAIN (link
))
1583 register tree label
= TREE_VALUE (link
);
1585 if (DECL_INITIAL (label
) == NULL_TREE
)
1587 cp_error_at ("label `%D' used but not defined", label
);
1588 /* Avoid crashing later. */
1589 define_label (input_filename
, 1, DECL_NAME (label
));
1591 else if (warn_unused
&& !TREE_USED (label
))
1592 cp_warning_at ("label `%D' defined but not used", label
);
1593 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), NULL_TREE
);
1595 /* Put the labels into the "variables" of the
1596 top-level block, so debugger can see them. */
1597 TREE_CHAIN (label
) = BLOCK_VARS (block
);
1598 BLOCK_VARS (block
) = label
;
1601 named_labels
= NULL_TREE
;
1604 /* Any uses of undefined labels now operate under constraints
1605 of next binding contour. */
1607 struct binding_level
*level_chain
;
1608 level_chain
= current_binding_level
->level_chain
;
1611 struct named_label_list
*labels
;
1612 for (labels
= named_label_uses
; labels
; labels
= labels
->next
)
1613 if (labels
->binding_level
== current_binding_level
)
1615 labels
->binding_level
= level_chain
;
1616 labels
->names_in_scope
= level_chain
->names
;
1621 tmp
= current_binding_level
->keep
;
1623 pop_binding_level ();
1625 DECL_INITIAL (current_function_decl
) = block
;
1628 if (!block_previously_created
)
1629 current_binding_level
->blocks
1630 = chainon (current_binding_level
->blocks
, block
);
1632 /* If we did not make a block for the level just exited,
1633 any blocks made for inner levels
1634 (since they cannot be recorded as subblocks in that level)
1635 must be carried forward so they will later become subblocks
1636 of something else. */
1638 current_binding_level
->blocks
1639 = chainon (current_binding_level
->blocks
, subblocks
);
1641 /* Take care of compiler's internal binding structures. */
1644 expand_end_bindings (getdecls (), keep
, 1);
1645 /* Each and every BLOCK node created here in `poplevel' is important
1646 (e.g. for proper debugging information) so if we created one
1647 earlier, mark it as "used". */
1649 TREE_USED (block
) = 1;
1650 block
= poplevel (keep
, reverse
, real_functionbody
);
1653 /* Each and every BLOCK node created here in `poplevel' is important
1654 (e.g. for proper debugging information) so if we created one
1655 earlier, mark it as "used". */
1657 TREE_USED (block
) = 1;
1661 /* Delete the node BLOCK from the current binding level.
1662 This is used for the block inside a stmt expr ({...})
1663 so that the block can be reinserted where appropriate. */
1666 delete_block (block
)
1670 if (current_binding_level
->blocks
== block
)
1671 current_binding_level
->blocks
= TREE_CHAIN (block
);
1672 for (t
= current_binding_level
->blocks
; t
;)
1674 if (TREE_CHAIN (t
) == block
)
1675 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1679 TREE_CHAIN (block
) = NULL_TREE
;
1680 /* Clear TREE_USED which is always set by poplevel.
1681 The flag is set again if insert_block is called. */
1682 TREE_USED (block
) = 0;
1685 /* Insert BLOCK at the end of the list of subblocks of the
1686 current binding level. This is used when a BIND_EXPR is expanded,
1687 to handle the BLOCK node inside the BIND_EXPR. */
1690 insert_block (block
)
1693 TREE_USED (block
) = 1;
1694 current_binding_level
->blocks
1695 = chainon (current_binding_level
->blocks
, block
);
1698 /* Set the BLOCK node for the innermost scope
1699 (the one we are currently in). */
1703 register tree block
;
1705 current_binding_level
->this_block
= block
;
1708 /* Do a pushlevel for class declarations. */
1713 register struct binding_level
*newlevel
;
1715 /* Reuse or create a struct for this binding level. */
1716 #if defined(DEBUG_CP_BINDING_LEVELS)
1718 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1719 if (free_binding_level
)
1720 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1722 newlevel
= free_binding_level
;
1723 free_binding_level
= free_binding_level
->level_chain
;
1726 newlevel
= make_binding_level ();
1728 #if defined(DEBUG_CP_BINDING_LEVELS)
1730 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1732 push_binding_level (newlevel
, 0, 0);
1734 decl_stack
= push_decl_level (decl_stack
, &decl_obstack
);
1735 class_binding_level
= current_binding_level
;
1736 class_binding_level
->parm_flag
= 2;
1739 /* ...and a poplevel for class declarations. */
1744 register struct binding_level
*level
= class_binding_level
;
1747 my_friendly_assert (level
!= 0, 354);
1749 decl_stack
= pop_stack_level (decl_stack
);
1750 /* If we're leaving a toplevel class, don't bother to do the setting
1751 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1752 shouldn't even be used when current_class_type isn't set, and second,
1753 if we don't touch it here, we're able to use the cache effect if the
1754 next time we're entering a class scope, it is the same class. */
1755 if (current_class_depth
!= 1)
1757 struct binding_level
* b
;
1759 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1760 for (shadowed
= level
->class_shadowed
;
1762 shadowed
= TREE_CHAIN (shadowed
))
1763 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = NULL_TREE
;
1765 /* Find the next enclosing class, and recreate
1766 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1767 b
= level
->level_chain
;
1768 while (b
&& b
->parm_flag
!= 2)
1772 for (shadowed
= b
->class_shadowed
;
1774 shadowed
= TREE_CHAIN (shadowed
))
1778 t
= IDENTIFIER_BINDING (TREE_PURPOSE (shadowed
));
1779 while (t
&& BINDING_LEVEL (t
) != b
)
1783 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
))
1784 = BINDING_VALUE (t
);
1788 /* Remember to save what IDENTIFIER's were bound in this scope so we
1789 can recover from cache misses. */
1791 previous_class_type
= current_class_type
;
1792 previous_class_values
= class_binding_level
->class_shadowed
;
1794 for (shadowed
= level
->type_shadowed
;
1796 shadowed
= TREE_CHAIN (shadowed
))
1797 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1799 /* Remove the bindings for all of the class-level declarations. */
1800 for (shadowed
= level
->class_shadowed
;
1802 shadowed
= TREE_CHAIN (shadowed
))
1803 pop_binding (TREE_PURPOSE (shadowed
), TREE_TYPE (shadowed
));
1805 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1806 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1807 class_binding_level
->parm_flag
,
1808 class_binding_level
->keep
);
1810 /* Now, pop out of the binding level which we created up in the
1811 `pushlevel_class' routine. */
1812 #if defined(DEBUG_CP_BINDING_LEVELS)
1814 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1816 pop_binding_level ();
1821 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1822 for any names in enclosing classes. */
1825 clear_identifier_class_values ()
1829 if (!class_binding_level
)
1832 for (t
= class_binding_level
->class_shadowed
;
1835 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
1838 /* Returns non-zero if T is a virtual function table. */
1841 vtable_decl_p (t
, data
)
1843 void *data ATTRIBUTE_UNUSED
;
1845 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
1848 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1852 vtype_decl_p (t
, data
)
1854 void *data ATTRIBUTE_UNUSED
;
1856 return (TREE_CODE (t
) == TYPE_DECL
1857 && TREE_TYPE (t
) != error_mark_node
1858 && TYPE_LANG_SPECIFIC (TREE_TYPE (t
))
1859 && CLASSTYPE_VSIZE (TREE_TYPE (t
)));
1862 /* Returns non-zero if T is a signature table. */
1865 sigtable_decl_p (t
, data
)
1867 void *data ATTRIBUTE_UNUSED
;
1869 return (TREE_CODE (t
) == VAR_DECL
1870 && TREE_TYPE (t
) != error_mark_node
1871 && IS_SIGNATURE (TREE_TYPE (t
)));
1874 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1875 itself, calling F for each. The DATA is passed to F as well. */
1878 walk_namespaces_r (namespace, f
, data
)
1880 walk_namespaces_fn f
;
1886 result
|= (*f
) (namespace, data
);
1888 for (current
= NAMESPACE_LEVEL (namespace)->names
;
1890 current
= TREE_CHAIN (current
))
1892 if (TREE_CODE (current
) != NAMESPACE_DECL
1893 || DECL_NAMESPACE_ALIAS (current
))
1895 if (!DECL_LANG_SPECIFIC (current
))
1898 my_friendly_assert (current
== std_node
, 393);
1902 /* We found a namespace. */
1903 result
|= walk_namespaces_r (current
, f
, data
);
1909 /* Walk all the namespaces, calling F for each. The DATA is passed to
1913 walk_namespaces (f
, data
)
1914 walk_namespaces_fn f
;
1917 return walk_namespaces_r (global_namespace
, f
, data
);
1920 struct walk_globals_data
{
1921 walk_globals_pred p
;
1926 /* Walk the global declarations in NAMESPACE. Whenever one is found
1927 for which P returns non-zero, call F with its address. If any call
1928 to F returns a non-zero value, return a non-zero value. */
1931 walk_globals_r (namespace, data
)
1935 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1936 walk_globals_pred p
= wgd
->p
;
1937 walk_globals_fn f
= wgd
->f
;
1938 void *d
= wgd
->data
;
1942 t
= &NAMESPACE_LEVEL (namespace)->names
;
1949 result
|= (*f
) (t
, d
);
1951 /* If F changed *T, then *T still points at the next item to
1954 t
= &TREE_CHAIN (*t
);
1960 /* Walk the global declarations. Whenever one is found for which P
1961 returns non-zero, call F with its address. If any call to F
1962 returns a non-zero value, return a non-zero value. */
1965 walk_globals (p
, f
, data
)
1966 walk_globals_pred p
;
1970 struct walk_globals_data wgd
;
1975 return walk_namespaces (walk_globals_r
, &wgd
);
1978 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1979 DATA is non-NULL, this is the last time we will call
1980 wrapup_global_declarations for this NAMESPACE. */
1983 wrapup_globals_for_namespace (namespace, data
)
1987 tree globals
= NAMESPACE_LEVEL (namespace)->names
;
1988 int len
= list_length (globals
);
1989 tree
*vec
= (tree
*) alloca (sizeof (tree
) * len
);
1993 int last_time
= (data
!= 0);
1995 if (last_time
&& namespace == global_namespace
)
1996 /* Let compile_file handle the global namespace. */
1999 /* Process the decls in reverse order--earliest first.
2000 Put them into VEC from back to front, then take out from front. */
2002 for (i
= 0, decl
= globals
; i
< len
; i
++, decl
= TREE_CHAIN (decl
))
2003 vec
[len
- i
- 1] = decl
;
2007 check_global_declarations (vec
, len
);
2011 /* Temporarily mark vtables as external. That prevents
2012 wrapup_global_declarations from writing them out; we must process
2013 them ourselves in finish_vtable_vardecl. */
2014 for (i
= 0; i
< len
; ++i
)
2015 if (vtable_decl_p (vec
[i
], /*data=*/0) && !DECL_EXTERNAL (vec
[i
]))
2017 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 1;
2018 DECL_EXTERNAL (vec
[i
]) = 1;
2021 /* Write out any globals that need to be output. */
2022 result
= wrapup_global_declarations (vec
, len
);
2024 /* Undo the hack to DECL_EXTERNAL above. */
2025 for (i
= 0; i
< len
; ++i
)
2026 if (vtable_decl_p (vec
[i
], /*data=*/0)
2027 && DECL_NOT_REALLY_EXTERN (vec
[i
]))
2029 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 0;
2030 DECL_EXTERNAL (vec
[i
]) = 0;
2037 /* For debugging. */
2038 static int no_print_functions
= 0;
2039 static int no_print_builtins
= 0;
2042 print_binding_level (lvl
)
2043 struct binding_level
*lvl
;
2047 fprintf (stderr
, " blocks=");
2048 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
2049 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
2050 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
2051 if (lvl
->tag_transparent
)
2052 fprintf (stderr
, " tag-transparent");
2053 if (lvl
->more_cleanups_ok
)
2054 fprintf (stderr
, " more-cleanups-ok");
2055 if (lvl
->have_cleanups
)
2056 fprintf (stderr
, " have-cleanups");
2057 fprintf (stderr
, "\n");
2060 fprintf (stderr
, " names:\t");
2061 /* We can probably fit 3 names to a line? */
2062 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
2064 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
2066 if (no_print_builtins
2067 && (TREE_CODE (t
) == TYPE_DECL
)
2068 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
2071 /* Function decls tend to have longer names. */
2072 if (TREE_CODE (t
) == FUNCTION_DECL
)
2079 fprintf (stderr
, "\n\t");
2082 print_node_brief (stderr
, "", t
, 0);
2083 if (t
== error_mark_node
)
2087 fprintf (stderr
, "\n");
2091 fprintf (stderr
, " tags:\t");
2093 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
2095 if (TREE_PURPOSE (t
) == NULL_TREE
)
2097 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2104 fprintf (stderr
, "\n\t");
2107 if (TREE_PURPOSE (t
) == NULL_TREE
)
2109 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
2110 fprintf (stderr
, ">");
2112 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2113 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2116 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
2117 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2118 fprintf (stderr
, ">");
2122 fprintf (stderr
, "\n");
2124 if (lvl
->class_shadowed
)
2126 fprintf (stderr
, " class-shadowed:");
2127 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
2129 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2131 fprintf (stderr
, "\n");
2133 if (lvl
->type_shadowed
)
2135 fprintf (stderr
, " type-shadowed:");
2136 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2138 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2140 fprintf (stderr
, "\n");
2145 print_other_binding_stack (stack
)
2146 struct binding_level
*stack
;
2148 struct binding_level
*level
;
2149 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
2151 fprintf (stderr
, "binding level ");
2152 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
2153 fprintf (stderr
, "\n");
2154 print_binding_level (level
);
2159 print_binding_stack ()
2161 struct binding_level
*b
;
2162 fprintf (stderr
, "current_binding_level=");
2163 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
2164 fprintf (stderr
, "\nclass_binding_level=");
2165 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
2166 fprintf (stderr
, "\nglobal_binding_level=");
2167 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
2168 fprintf (stderr
, "\n");
2169 if (class_binding_level
)
2171 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
2172 if (b
== current_binding_level
)
2175 b
= class_binding_level
;
2177 b
= current_binding_level
;
2180 b
= current_binding_level
;
2181 print_other_binding_stack (b
);
2182 fprintf (stderr
, "global:\n");
2183 print_binding_level (global_binding_level
);
2186 /* Namespace binding access routines: The namespace_bindings field of
2187 the identifier is polymorphic, with three possible values:
2188 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2189 indicating the BINDING_VALUE of global_namespace. */
2191 /* Check whether the a binding for the name to scope is known.
2192 Assumes that the bindings of the name are already a list
2193 of bindings. Returns the binding found, or NULL_TREE. */
2196 find_binding (name
, scope
)
2200 tree iter
, prev
= NULL_TREE
;
2202 scope
= ORIGINAL_NAMESPACE (scope
);
2204 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
2205 iter
= TREE_CHAIN (iter
))
2207 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
2208 if (BINDING_SCOPE (iter
) == scope
)
2210 /* Move binding found to the fron of the list, so
2211 subsequent lookups will find it faster. */
2214 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
2215 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
2216 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
2225 /* Always returns a binding for name in scope. If the
2226 namespace_bindings is not a list, convert it to one first.
2227 If no binding is found, make a new one. */
2230 binding_for_name (name
, scope
)
2234 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2237 scope
= ORIGINAL_NAMESPACE (scope
);
2239 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
2241 /* Get rid of optimization for global scope. */
2242 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
2243 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
2244 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2246 if (b
&& (result
= find_binding (name
, scope
)))
2248 /* Not found, make a new permanent one. */
2249 push_obstacks (&permanent_obstack
, &permanent_obstack
);
2250 result
= make_node (CPLUS_BINDING
);
2251 TREE_CHAIN (result
) = b
;
2252 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2253 BINDING_SCOPE (result
) = scope
;
2254 BINDING_TYPE (result
) = NULL_TREE
;
2255 BINDING_VALUE (result
) = NULL_TREE
;
2260 /* Return the binding value for name in scope, considering that
2261 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2264 namespace_binding (name
, scope
)
2268 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2271 if (scope
== NULL_TREE
)
2272 scope
= global_namespace
;
2273 if (TREE_CODE (b
) != CPLUS_BINDING
)
2274 return (scope
== global_namespace
) ? b
: NULL_TREE
;
2275 name
= find_binding (name
,scope
);
2276 if (name
== NULL_TREE
)
2278 return BINDING_VALUE (name
);
2281 /* Set the binding value for name in scope. If modifying the binding
2282 of global_namespace is attempted, try to optimize it. */
2285 set_namespace_binding (name
, scope
, val
)
2292 if (scope
== NULL_TREE
)
2293 scope
= global_namespace
;
2295 if (scope
== global_namespace
)
2297 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2298 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
2300 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
2304 b
= binding_for_name (name
, scope
);
2305 BINDING_VALUE (b
) = val
;
2308 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2309 select a name that is unique to this compilation unit. */
2312 push_namespace (name
)
2317 int implicit_use
= 0;
2319 if (!global_namespace
)
2321 /* This must be ::. */
2322 my_friendly_assert (name
== get_identifier ("::"), 377);
2327 /* The name of anonymous namespace is unique for the translation
2329 if (!anonymous_namespace_name
)
2330 anonymous_namespace_name
= get_file_function_name ('N');
2331 name
= anonymous_namespace_name
;
2332 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2334 /* Reopening anonymous namespace. */
2338 else if (current_namespace
== global_namespace
2339 && name
== DECL_NAME (std_node
))
2346 /* Check whether this is an extended namespace definition. */
2347 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2348 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
2351 if (DECL_NAMESPACE_ALIAS (d
))
2353 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2354 d
, DECL_NAMESPACE_ALIAS (d
));
2355 d
= DECL_NAMESPACE_ALIAS (d
);
2362 /* Make a new namespace, binding the name to it. */
2363 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
2364 /* The global namespace is not pushed, and the global binding
2365 level is set elsewhere. */
2370 declare_namespace_level ();
2371 NAMESPACE_LEVEL (d
) = current_binding_level
;
2375 resume_binding_level (NAMESPACE_LEVEL (d
));
2378 do_using_directive (d
);
2379 /* Enter the name space. */
2380 current_namespace
= d
;
2383 /* Pop from the scope of the current namespace. */
2388 if (current_namespace
== global_namespace
)
2390 my_friendly_assert (in_std
>0, 980421);
2394 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
2395 /* The binding level is not popped, as it might be re-opened later. */
2396 suspend_binding_level ();
2400 /* Subroutines for reverting temporarily to top-level for instantiation
2401 of templates and such. We actually need to clear out the class- and
2402 local-value slots of all identifiers, so that only the global values
2403 are at all visible. Simply setting current_binding_level to the global
2404 scope isn't enough, because more binding levels may be pushed. */
2405 struct saved_scope
{
2406 struct binding_level
*old_binding_level
;
2409 struct saved_scope
*prev
;
2410 tree class_name
, class_type
;
2411 tree access_specifier
;
2413 struct binding_level
*class_bindings
;
2414 tree
*lang_base
, *lang_stack
, lang_name
;
2416 int minimal_parse_mode
;
2417 tree last_function_parms
;
2418 tree template_parms
;
2419 HOST_WIDE_INT processing_template_decl
;
2420 tree previous_class_type
, previous_class_values
;
2421 int processing_specialization
;
2422 int processing_explicit_instantiation
;
2424 static struct saved_scope
*current_saved_scope
;
2426 /* A chain of the binding vecs created by store_bindings. We create a
2427 whole bunch of these during compilation, on permanent_obstack, so we
2428 can't just throw them away. */
2429 static tree free_binding_vecs
;
2432 store_bindings (names
, old_bindings
)
2433 tree names
, old_bindings
;
2436 for (t
= names
; t
; t
= TREE_CHAIN (t
))
2438 tree binding
, t1
, id
;
2440 if (TREE_CODE (t
) == TREE_LIST
)
2441 id
= TREE_PURPOSE (t
);
2446 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2447 we have no IDENTIFIER_BINDING if we have left the class
2448 scope, but cached the class-level declarations. */
2449 || !(IDENTIFIER_BINDING (id
) || IDENTIFIER_CLASS_VALUE (id
)))
2452 for (t1
= old_bindings
; t1
; t1
= TREE_CHAIN (t1
))
2453 if (TREE_VEC_ELT (t1
, 0) == id
)
2456 if (free_binding_vecs
)
2458 binding
= free_binding_vecs
;
2459 free_binding_vecs
= TREE_CHAIN (free_binding_vecs
);
2462 binding
= make_tree_vec (4);
2466 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
2467 TREE_VEC_ELT (binding
, 0) = id
;
2468 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
2469 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_BINDING (id
);
2470 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
2471 IDENTIFIER_BINDING (id
) = NULL_TREE
;
2472 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
2474 TREE_CHAIN (binding
) = old_bindings
;
2475 old_bindings
= binding
;
2479 return old_bindings
;
2483 maybe_push_to_top_level (pseudo
)
2486 extern int current_lang_stacksize
;
2487 struct saved_scope
*s
2488 = (struct saved_scope
*) xmalloc (sizeof (struct saved_scope
));
2489 struct binding_level
*b
= current_binding_level
;
2490 tree old_bindings
= NULL_TREE
;
2492 push_cp_function_context (NULL_TREE
);
2494 if (previous_class_type
)
2495 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
2497 /* Have to include global_binding_level, because class-level decls
2498 aren't listed anywhere useful. */
2499 for (; b
; b
= b
->level_chain
)
2503 /* Template IDs are inserted into the global level. If they were
2504 inserted into namespace level, finish_file wouldn't find them
2505 when doing pending instantiations. Therefore, don't stop at
2506 namespace level, but continue until :: . */
2507 if (b
== global_binding_level
|| (pseudo
&& b
->pseudo_global
))
2510 old_bindings
= store_bindings (b
->names
, old_bindings
);
2511 /* We also need to check class_shadowed to save class-level type
2512 bindings, since pushclass doesn't fill in b->names. */
2513 if (b
->parm_flag
== 2)
2514 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2516 /* Unwind type-value slots back to top level. */
2517 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2518 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2521 s
->old_binding_level
= current_binding_level
;
2522 current_binding_level
= b
;
2524 s
->old_namespace
= current_namespace
;
2525 s
->class_name
= current_class_name
;
2526 s
->class_type
= current_class_type
;
2527 s
->access_specifier
= current_access_specifier
;
2528 s
->function_decl
= current_function_decl
;
2529 s
->class_bindings
= class_binding_level
;
2530 s
->lang_stack
= current_lang_stack
;
2531 s
->lang_base
= current_lang_base
;
2532 s
->lang_stacksize
= current_lang_stacksize
;
2533 s
->lang_name
= current_lang_name
;
2534 s
->minimal_parse_mode
= minimal_parse_mode
;
2535 s
->last_function_parms
= last_function_parms
;
2536 s
->template_parms
= current_template_parms
;
2537 s
->processing_template_decl
= processing_template_decl
;
2538 s
->previous_class_type
= previous_class_type
;
2539 s
->previous_class_values
= previous_class_values
;
2540 s
->processing_specialization
= processing_specialization
;
2541 s
->processing_explicit_instantiation
= processing_explicit_instantiation
;
2543 current_class_name
= current_class_type
= NULL_TREE
;
2544 current_function_decl
= NULL_TREE
;
2545 class_binding_level
= (struct binding_level
*)0;
2546 current_lang_stacksize
= 10;
2547 current_lang_stack
= current_lang_base
2548 = (tree
*) xmalloc (current_lang_stacksize
* sizeof (tree
));
2549 current_lang_name
= lang_name_cplusplus
;
2550 strict_prototype
= strict_prototypes_lang_cplusplus
;
2551 named_labels
= NULL_TREE
;
2552 shadowed_labels
= NULL_TREE
;
2553 minimal_parse_mode
= 0;
2554 previous_class_type
= previous_class_values
= NULL_TREE
;
2555 processing_specialization
= 0;
2556 processing_explicit_instantiation
= 0;
2557 current_template_parms
= NULL_TREE
;
2558 processing_template_decl
= 0;
2559 current_namespace
= global_namespace
;
2561 s
->prev
= current_saved_scope
;
2562 s
->old_bindings
= old_bindings
;
2563 current_saved_scope
= s
;
2565 push_obstacks (&permanent_obstack
, &permanent_obstack
);
2569 push_to_top_level ()
2571 maybe_push_to_top_level (0);
2575 pop_from_top_level ()
2577 extern int current_lang_stacksize
;
2578 struct saved_scope
*s
= current_saved_scope
;
2581 /* Clear out class-level bindings cache. */
2582 if (previous_class_type
)
2583 invalidate_class_lookup_cache ();
2587 current_binding_level
= s
->old_binding_level
;
2588 current_saved_scope
= s
->prev
;
2589 for (t
= s
->old_bindings
; t
; )
2592 tree id
= TREE_VEC_ELT (t
, 0);
2595 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2596 IDENTIFIER_BINDING (id
) = TREE_VEC_ELT (t
, 2);
2597 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2600 TREE_CHAIN (save
) = free_binding_vecs
;
2601 free_binding_vecs
= save
;
2603 current_namespace
= s
->old_namespace
;
2604 current_class_name
= s
->class_name
;
2605 current_class_type
= s
->class_type
;
2606 current_access_specifier
= s
->access_specifier
;
2607 current_function_decl
= s
->function_decl
;
2608 class_binding_level
= s
->class_bindings
;
2609 free (current_lang_base
);
2610 current_lang_base
= s
->lang_base
;
2611 current_lang_stack
= s
->lang_stack
;
2612 current_lang_name
= s
->lang_name
;
2613 current_lang_stacksize
= s
->lang_stacksize
;
2614 if (current_lang_name
== lang_name_cplusplus
)
2615 strict_prototype
= strict_prototypes_lang_cplusplus
;
2616 else if (current_lang_name
== lang_name_c
)
2617 strict_prototype
= strict_prototypes_lang_c
;
2618 minimal_parse_mode
= s
->minimal_parse_mode
;
2619 last_function_parms
= s
->last_function_parms
;
2620 current_template_parms
= s
->template_parms
;
2621 processing_template_decl
= s
->processing_template_decl
;
2622 previous_class_type
= s
->previous_class_type
;
2623 previous_class_values
= s
->previous_class_values
;
2624 processing_specialization
= s
->processing_specialization
;
2625 processing_explicit_instantiation
= s
->processing_explicit_instantiation
;
2629 pop_cp_function_context (NULL_TREE
);
2632 /* Push a definition of struct, union or enum tag "name".
2633 into binding_level "b". "type" should be the type node,
2634 We assume that the tag "name" is not already defined.
2636 Note that the definition may really be just a forward reference.
2637 In that case, the TYPE_SIZE will be a NULL_TREE.
2639 C++ gratuitously puts all these tags in the name space. */
2641 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2642 record the shadowed value for this binding contour. TYPE is
2643 the type that ID maps to. */
2646 set_identifier_type_value_with_scope (id
, type
, b
)
2649 struct binding_level
*b
;
2651 if (!b
->namespace_p
)
2653 /* Shadow the marker, not the real thing, so that the marker
2654 gets restored later. */
2655 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2657 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2661 tree binding
= binding_for_name (id
, current_namespace
);
2662 BINDING_TYPE (binding
) = type
;
2663 /* Store marker instead of real type. */
2664 type
= global_type_node
;
2666 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2669 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2672 set_identifier_type_value (id
, type
)
2676 set_identifier_type_value_with_scope (id
, type
, current_binding_level
);
2679 /* Return the type associated with id. */
2682 identifier_type_value (id
)
2685 /* There is no type with that name, anywhere. */
2686 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2688 /* This is not the type marker, but the real thing. */
2689 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2690 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2691 /* Have to search for it. It must be on the global level, now.
2692 Ask lookup_name not to return non-types. */
2693 id
= lookup_name_real (id
, 2, 1, 0);
2695 return TREE_TYPE (id
);
2699 /* Pop off extraneous binding levels left over due to syntax errors.
2701 We don't pop past namespaces, as they might be valid. */
2706 #ifdef DEBUG_CP_BINDING_LEVELS
2707 fprintf (stderr
, "XXX entering pop_everything ()\n");
2709 while (!toplevel_bindings_p ())
2711 if (current_binding_level
->parm_flag
== 2)
2712 pop_nested_class ();
2716 #ifdef DEBUG_CP_BINDING_LEVELS
2717 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2721 /* The type TYPE is being declared. If it is a class template, or a
2722 specialization of a class template, do any processing required and
2723 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2724 being declared a friend. B is the binding level at which this TYPE
2727 Returns the TYPE_DECL for TYPE, which may have been altered by this
2731 maybe_process_template_type_declaration (type
, globalize
, b
)
2734 struct binding_level
* b
;
2736 tree decl
= TYPE_NAME (type
);
2738 if (processing_template_parmlist
)
2739 /* You can't declare a new template type in a template parameter
2740 list. But, you can declare a non-template type:
2742 template <class A*> struct S;
2744 is a forward-declaration of `A'. */
2748 maybe_check_template_type (type
);
2750 my_friendly_assert (IS_AGGR_TYPE (type
)
2751 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2754 if (/* If !GLOBALIZE then we are looking at a definition.
2755 It may not be a primary template. (For example, in:
2758 struct S1 { class S2 {}; }
2760 we have to push_template_decl for S2.) */
2761 (processing_template_decl
&& !globalize
)
2762 /* If we are declaring a friend template class, we will
2763 have GLOBALIZE set, since something like:
2771 declares S2 to be at global scope. */
2772 || PROCESSING_REAL_TEMPLATE_DECL_P ())
2774 /* This may change after the call to
2775 push_template_decl_real, but we want the original value. */
2776 tree name
= DECL_NAME (decl
);
2778 decl
= push_template_decl_real (decl
, globalize
);
2779 /* If the current binding level is the binding level for the
2780 template parameters (see the comment in
2781 begin_template_parm_list) and the enclosing level is a class
2782 scope, and we're not looking at a friend, push the
2783 declaration of the member class into the class scope. In the
2784 friend case, push_template_decl will already have put the
2785 friend into global scope, if appropriate. */
2786 if (TREE_CODE (type
) != ENUMERAL_TYPE
2787 && !globalize
&& b
->pseudo_global
2788 && b
->level_chain
->parm_flag
== 2)
2790 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2791 /* Put this tag on the list of tags for the class, since
2792 that won't happen below because B is not the class
2793 binding level, but is instead the pseudo-global level. */
2794 b
->level_chain
->tags
=
2795 saveable_tree_cons (name
, type
, b
->level_chain
->tags
);
2796 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2797 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2805 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2806 Normally put it into the inner-most non-tag-transparent scope,
2807 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2808 The latter is needed for implicit declarations. */
2811 pushtag (name
, type
, globalize
)
2815 register struct binding_level
*b
;
2817 b
= current_binding_level
;
2818 while (b
->tag_transparent
2819 || (globalize
&& b
->parm_flag
== 2))
2822 if (toplevel_bindings_p ())
2823 b
->tags
= perm_tree_cons (name
, type
, b
->tags
);
2825 b
->tags
= saveable_tree_cons (name
, type
, b
->tags
);
2829 /* Do C++ gratuitous typedefing. */
2830 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2832 register tree d
= NULL_TREE
;
2833 int newdecl
= 0, in_class
= 0;
2835 tree c_decl
= NULL_TREE
;
2837 context
= type
? TYPE_CONTEXT (type
) : NULL_TREE
;
2840 tree cs
= current_scope ();
2844 else if (cs
!= NULL_TREE
2845 && TREE_CODE_CLASS (TREE_CODE (cs
)) == 't')
2846 /* When declaring a friend class of a local class, we want
2847 to inject the newly named class into the scope
2848 containing the local class, not the namespace scope. */
2849 context
= hack_decl_function_context (get_type_decl (cs
));
2852 c_decl
= TREE_CODE (context
) == FUNCTION_DECL
2853 ? context
: TYPE_MAIN_DECL (context
);
2856 context
= current_namespace
;
2858 if ((b
->pseudo_global
&& b
->level_chain
->parm_flag
== 2)
2859 || b
->parm_flag
== 2)
2862 d
= lookup_nested_type (type
, c_decl
);
2867 d
= build_decl (TYPE_DECL
, name
, type
);
2868 if (current_lang_name
== lang_name_java
)
2869 TYPE_FOR_JAVA (type
) = 1;
2870 SET_DECL_ARTIFICIAL (d
);
2872 set_identifier_type_value_with_scope (name
, type
, b
);
2875 d
= TYPE_MAIN_DECL (d
);
2877 TYPE_NAME (type
) = d
;
2878 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2880 d
= maybe_process_template_type_declaration (type
,
2883 if (b
->parm_flag
== 2)
2885 if (newdecl
&& !PROCESSING_REAL_TEMPLATE_DECL_P ())
2886 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2887 class. But if it's a member template class, we
2888 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2890 finish_member_declaration (d
);
2892 pushdecl_class_level (d
);
2895 d
= pushdecl_with_scope (d
, b
);
2899 if (ANON_AGGRNAME_P (name
))
2900 DECL_IGNORED_P (d
) = 1;
2902 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2903 DECL_ASSEMBLER_NAME (d
) = DECL_NAME (d
);
2904 if (!uses_template_parms (type
))
2905 DECL_ASSEMBLER_NAME (d
)
2906 = get_identifier (build_overload_name (type
, 1, 1));
2909 if (b
->parm_flag
== 2)
2911 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2912 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2916 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2917 /* Use the canonical TYPE_DECL for this node. */
2918 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2921 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2922 will be the tagged type we just added to the current
2923 binding level. This fake NULL-named TYPE_DECL node helps
2924 dwarfout.c to know when it needs to output a
2925 representation of a tagged type, and it also gives us a
2926 convenient place to record the "scope start" address for
2929 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2930 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2934 /* Counter used to create anonymous type names. */
2936 static int anon_cnt
= 0;
2938 /* Return an IDENTIFIER which can be used as a name for
2939 anonymous structs and unions. */
2946 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2947 return get_identifier (buf
);
2950 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2951 This keeps dbxout from getting confused. */
2956 register struct binding_level
*b
;
2958 static int last_cnt
= 0;
2960 /* Fast out if no new anon names were declared. */
2961 if (last_cnt
== anon_cnt
)
2964 b
= current_binding_level
;
2965 while (b
->tag_transparent
)
2970 /* A NULL purpose means we have already processed all tags
2971 from here to the end of the list. */
2972 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2974 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2975 TREE_PURPOSE (tags
) = NULL_TREE
;
2976 tags
= TREE_CHAIN (tags
);
2978 last_cnt
= anon_cnt
;
2981 /* Subroutine of duplicate_decls: return truthvalue of whether
2982 or not types of these decls match.
2984 For C++, we must compare the parameter list so that `int' can match
2985 `int&' in a parameter position, but `int&' is not confused with
2989 decls_match (newdecl
, olddecl
)
2990 tree newdecl
, olddecl
;
2994 if (newdecl
== olddecl
)
2997 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
2998 /* If the two DECLs are not even the same kind of thing, we're not
2999 interested in their types. */
3002 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3004 tree f1
= TREE_TYPE (newdecl
);
3005 tree f2
= TREE_TYPE (olddecl
);
3006 tree p1
= TYPE_ARG_TYPES (f1
);
3007 tree p2
= TYPE_ARG_TYPES (f2
);
3009 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
)
3010 && ! (DECL_LANGUAGE (newdecl
) == lang_c
3011 && DECL_LANGUAGE (olddecl
) == lang_c
))
3014 /* When we parse a static member function definition,
3015 we put together a FUNCTION_DECL which thinks its type
3016 is METHOD_TYPE. Change that to FUNCTION_TYPE, and
3018 if (TREE_CODE (f1
) == METHOD_TYPE
&& DECL_STATIC_FUNCTION_P (olddecl
))
3019 revert_static_member_fn (&newdecl
, &f1
, &p1
);
3020 else if (TREE_CODE (f2
) == METHOD_TYPE
3021 && DECL_STATIC_FUNCTION_P (newdecl
))
3022 revert_static_member_fn (&olddecl
, &f2
, &p2
);
3024 /* Here we must take care of the case where new default
3025 parameters are specified. Also, warn if an old
3026 declaration becomes ambiguous because default
3027 parameters may cause the two to be ambiguous. */
3028 if (TREE_CODE (f1
) != TREE_CODE (f2
))
3030 if (TREE_CODE (f1
) == OFFSET_TYPE
)
3031 cp_compiler_error ("`%D' redeclared as member function", newdecl
);
3033 cp_compiler_error ("`%D' redeclared as non-member function", newdecl
);
3037 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
3039 if (! strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
) == lang_c
3042 types_match
= self_promoting_args_p (p1
);
3043 if (p1
== void_list_node
)
3044 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
3046 else if (!strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
)==lang_c
3047 && DECL_LANGUAGE (newdecl
) == lang_c
&& p1
== NULL_TREE
)
3049 types_match
= self_promoting_args_p (p2
);
3050 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
3053 types_match
= compparms (p1
, p2
);
3058 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3060 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3061 DECL_TEMPLATE_PARMS (olddecl
)))
3064 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3067 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
3068 DECL_TEMPLATE_RESULT (newdecl
));
3072 if (TREE_TYPE (newdecl
) == error_mark_node
)
3073 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
3074 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
3075 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
3076 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
3079 types_match
= comptypes (TREE_TYPE (newdecl
),
3080 TREE_TYPE (olddecl
),
3081 COMPARE_REDECLARATION
);
3087 /* If NEWDECL is `static' and an `extern' was seen previously,
3088 warn about it. (OLDDECL may be NULL_TREE; NAME contains
3089 information about previous usage as an `extern'.)
3091 Note that this does not apply to the C++ case of declaring
3092 a variable `extern const' and then later `const'.
3094 Don't complain about built-in functions, since they are beyond
3095 the user's control. */
3098 warn_extern_redeclared_static (newdecl
, olddecl
)
3099 tree newdecl
, olddecl
;
3103 static const char *explicit_extern_static_warning
3104 = "`%D' was declared `extern' and later `static'";
3105 static const char *implicit_extern_static_warning
3106 = "`%D' was declared implicitly `extern' and later `static'";
3108 if (TREE_CODE (newdecl
) == TYPE_DECL
)
3111 name
= DECL_ASSEMBLER_NAME (newdecl
);
3112 if (TREE_PUBLIC (name
) && DECL_THIS_STATIC (newdecl
))
3114 /* It's okay to redeclare an ANSI built-in function as static,
3115 or to declare a non-ANSI built-in function as anything. */
3116 if (! (TREE_CODE (newdecl
) == FUNCTION_DECL
3117 && olddecl
!= NULL_TREE
3118 && TREE_CODE (olddecl
) == FUNCTION_DECL
3119 && (DECL_BUILT_IN (olddecl
)
3120 || DECL_BUILT_IN_NONANSI (olddecl
))))
3122 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
3123 ? implicit_extern_static_warning
3124 : explicit_extern_static_warning
, newdecl
);
3125 if (olddecl
!= NULL_TREE
)
3126 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
3131 /* Handle when a new declaration NEWDECL has the same name as an old
3132 one OLDDECL in the same binding contour. Prints an error message
3135 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
3136 Otherwise, return 0. */
3139 duplicate_decls (newdecl
, olddecl
)
3140 tree newdecl
, olddecl
;
3142 extern struct obstack permanent_obstack
;
3143 unsigned olddecl_uid
= DECL_UID (olddecl
);
3144 int olddecl_friend
= 0, types_match
= 0;
3145 int new_defines_function
= 0;
3147 if (newdecl
== olddecl
)
3150 types_match
= decls_match (newdecl
, olddecl
);
3152 /* If either the type of the new decl or the type of the old decl is an
3153 error_mark_node, then that implies that we have already issued an
3154 error (earlier) for some bogus type specification, and in that case,
3155 it is rather pointless to harass the user with yet more error message
3156 about the same declaration, so just pretend the types match here. */
3157 if (TREE_TYPE (newdecl
) == error_mark_node
3158 || TREE_TYPE (olddecl
) == error_mark_node
)
3161 /* Check for redeclaration and other discrepancies. */
3162 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3163 && DECL_ARTIFICIAL (olddecl
)
3164 && (DECL_BUILT_IN (olddecl
) || DECL_BUILT_IN_NONANSI (olddecl
)))
3166 /* If you declare a built-in or predefined function name as static,
3167 the old definition is overridden, but optionally warn this was a
3168 bad choice of name. Ditto for overloads. */
3169 if (! TREE_PUBLIC (newdecl
)
3170 || (TREE_CODE (newdecl
) == FUNCTION_DECL
3171 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
)))
3174 cp_warning ("shadowing %s function `%#D'",
3175 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3177 /* Discard the old built-in function. */
3180 else if (! types_match
)
3182 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
3184 /* If the built-in is not ansi, then programs can override
3185 it even globally without an error. */
3186 if (! DECL_BUILT_IN (olddecl
))
3187 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
3191 cp_error ("declaration of `%#D'", newdecl
);
3192 cp_error ("conflicts with built-in declaration `%#D'",
3198 cp_warning ("declaration of `%#D'", newdecl
);
3199 cp_warning ("conflicts with built-in declaration `%#D'",
3203 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3205 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3206 && TREE_CODE (newdecl
) != TYPE_DECL
3207 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3208 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3209 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3210 && TREE_CODE (olddecl
) != TYPE_DECL
3211 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3212 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3215 /* We do nothing special here, because C++ does such nasty
3216 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3217 get shadowed, and know that if we need to find a TYPE_DECL
3218 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3219 slot of the identifier. */
3223 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3224 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3225 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3226 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3229 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
3230 if (TREE_CODE (olddecl
) == TREE_LIST
)
3231 olddecl
= TREE_VALUE (olddecl
);
3232 cp_error_at ("previous declaration of `%#D'", olddecl
);
3234 /* New decl is completely inconsistent with the old one =>
3235 tell caller to replace the old one. */
3239 else if (!types_match
)
3241 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
))
3242 /* These are certainly not duplicate declarations; they're
3243 from different scopes. */
3246 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3248 /* The name of a class template may not be declared to refer to
3249 any other template, class, function, object, namespace, value,
3250 or type in the same scope. */
3251 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3252 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3254 cp_error ("declaration of template `%#D'", newdecl
);
3255 cp_error_at ("conflicts with previous declaration `%#D'",
3258 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3259 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3260 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3261 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3262 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3263 DECL_TEMPLATE_PARMS (olddecl
)))
3265 cp_error ("new declaration `%#D'", newdecl
);
3266 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3270 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3272 if (DECL_LANGUAGE (newdecl
) == lang_c
3273 && DECL_LANGUAGE (olddecl
) == lang_c
)
3275 cp_error ("declaration of C function `%#D' conflicts with",
3277 cp_error_at ("previous declaration `%#D' here", olddecl
);
3279 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3280 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3282 cp_error ("new declaration `%#D'", newdecl
);
3283 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3289 /* Already complained about this, so don't do so again. */
3290 else if (current_class_type
== NULL_TREE
3291 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3293 cp_error ("conflicting types for `%#D'", newdecl
);
3294 cp_error_at ("previous declaration as `%#D'", olddecl
);
3297 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3298 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3299 && (!DECL_TEMPLATE_INFO (newdecl
)
3300 || (DECL_TI_TEMPLATE (newdecl
)
3301 != DECL_TI_TEMPLATE (olddecl
))))
3302 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3303 && (!DECL_TEMPLATE_INFO (olddecl
)
3304 || (DECL_TI_TEMPLATE (olddecl
)
3305 != DECL_TI_TEMPLATE (newdecl
))))))
3306 /* It's OK to have a template specialization and a non-template
3307 with the same type, or to have specializations of two
3308 different templates with the same type. Note that if one is a
3309 specialization, and the other is an instantiation of the same
3310 template, that we do not exit at this point. That situation
3311 can occur if we instantiate a template class, and then
3312 specialize one of its methods. This situation is legal, but
3313 the declarations must be merged in the usual way. */
3315 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3316 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3317 && !DECL_USE_TEMPLATE (newdecl
))
3318 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3319 && !DECL_USE_TEMPLATE (olddecl
))))
3320 /* One of the declarations is a template instantiation, and the
3321 other is not a template at all. That's OK. */
3323 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3324 && DECL_NAMESPACE_ALIAS (newdecl
)
3325 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3326 /* Redeclaration of namespace alias, ignore it. */
3330 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3333 cp_error (errmsg
, newdecl
);
3334 if (DECL_NAME (olddecl
) != NULL_TREE
)
3335 cp_error_at ((DECL_INITIAL (olddecl
)
3336 && namespace_bindings_p ())
3337 ? "`%#D' previously defined here"
3338 : "`%#D' previously declared here", olddecl
);
3340 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3341 && DECL_INITIAL (olddecl
) != NULL_TREE
3342 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3343 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3345 /* Prototype decl follows defn w/o prototype. */
3346 cp_warning_at ("prototype for `%#D'", newdecl
);
3347 cp_warning_at ("follows non-prototype definition here", olddecl
);
3349 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3350 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3352 /* extern "C" int foo ();
3353 int foo () { bar (); }
3355 if (current_lang_stack
== current_lang_base
)
3356 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3359 cp_error_at ("previous declaration of `%#D' with %L linkage",
3360 olddecl
, DECL_LANGUAGE (olddecl
));
3361 cp_error ("conflicts with new declaration with %L linkage",
3362 DECL_LANGUAGE (newdecl
));
3366 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3368 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3370 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3371 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3374 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3375 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3377 for (; t1
&& t1
!= void_list_node
;
3378 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3379 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3381 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3386 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3388 cp_pedwarn_at ("after previous specification in `%#D'",
3394 cp_error ("default argument given for parameter %d of `%#D'",
3396 cp_error_at ("after previous specification in `%#D'",
3401 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
3402 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3404 cp_warning ("`%#D' was used before it was declared inline",
3406 cp_warning_at ("previous non-inline declaration here",
3412 /* If new decl is `static' and an `extern' was seen previously,
3414 warn_extern_redeclared_static (newdecl
, olddecl
);
3416 /* We have committed to returning 1 at this point. */
3417 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3419 /* Now that functions must hold information normally held
3420 by field decls, there is extra work to do so that
3421 declaration information does not get destroyed during
3423 if (DECL_VINDEX (olddecl
))
3424 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3425 if (DECL_CONTEXT (olddecl
))
3426 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3427 if (DECL_CLASS_CONTEXT (olddecl
))
3428 DECL_CLASS_CONTEXT (newdecl
) = DECL_CLASS_CONTEXT (olddecl
);
3429 if (DECL_PENDING_INLINE_INFO (newdecl
) == (struct pending_inline
*)0)
3430 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3431 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3432 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3433 DECL_ABSTRACT_VIRTUAL_P (newdecl
) |= DECL_ABSTRACT_VIRTUAL_P (olddecl
);
3434 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3435 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3436 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3438 /* Optionally warn about more than one declaration for the same
3439 name, but don't warn about a function declaration followed by a
3441 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3442 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3443 /* Don't warn about extern decl followed by definition. */
3444 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3445 /* Don't warn about friends, let add_friend take care of it. */
3446 && ! DECL_FRIEND_P (newdecl
))
3448 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3449 cp_warning_at ("previous declaration of `%D'", olddecl
);
3453 /* Deal with C++: must preserve virtual function table size. */
3454 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3456 register tree newtype
= TREE_TYPE (newdecl
);
3457 register tree oldtype
= TREE_TYPE (olddecl
);
3459 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3460 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3462 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3463 CLASSTYPE_FRIEND_CLASSES (newtype
)
3464 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3468 /* Copy all the DECL_... slots specified in the new decl
3469 except for any that we copy here from the old type. */
3470 DECL_MACHINE_ATTRIBUTES (newdecl
)
3471 = merge_machine_decl_attributes (olddecl
, newdecl
);
3473 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3475 if (! duplicate_decls (DECL_TEMPLATE_RESULT (newdecl
),
3476 DECL_TEMPLATE_RESULT (olddecl
)))
3477 cp_error ("invalid redeclaration of %D", newdecl
);
3478 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3479 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3480 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3481 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3488 /* Automatically handles default parameters. */
3489 tree oldtype
= TREE_TYPE (olddecl
);
3492 /* Make sure we put the new type in the same obstack as the old one. */
3494 push_obstacks (TYPE_OBSTACK (oldtype
), TYPE_OBSTACK (oldtype
));
3497 push_obstacks_nochange ();
3498 end_temporary_allocation ();
3501 /* Merge the data types specified in the two decls. */
3502 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3504 if (TREE_CODE (newdecl
) == VAR_DECL
)
3505 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3506 /* Do this after calling `common_type' so that default
3507 parameters don't confuse us. */
3508 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3509 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3510 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3512 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3513 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3514 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3515 TYPE_RAISES_EXCEPTIONS (oldtype
));
3517 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3518 && DECL_SOURCE_LINE (olddecl
) != 0
3520 && ! compexcepttypes (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
3522 cp_pedwarn ("declaration of `%D' throws different exceptions",
3524 cp_pedwarn_at ("previous declaration here", olddecl
);
3527 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3529 /* Lay the type out, unless already done. */
3530 if (! same_type_p (newtype
, oldtype
)
3531 && TREE_TYPE (newdecl
) != error_mark_node
3532 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3533 layout_type (TREE_TYPE (newdecl
));
3535 if ((TREE_CODE (newdecl
) == VAR_DECL
3536 || TREE_CODE (newdecl
) == PARM_DECL
3537 || TREE_CODE (newdecl
) == RESULT_DECL
3538 || TREE_CODE (newdecl
) == FIELD_DECL
3539 || TREE_CODE (newdecl
) == TYPE_DECL
)
3540 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3541 layout_decl (newdecl
, 0);
3543 /* Merge the type qualifiers. */
3544 if (TREE_READONLY (newdecl
))
3545 TREE_READONLY (olddecl
) = 1;
3546 if (TREE_THIS_VOLATILE (newdecl
))
3547 TREE_THIS_VOLATILE (olddecl
) = 1;
3549 /* Merge the initialization information. */
3550 if (DECL_INITIAL (newdecl
) == NULL_TREE
3551 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3553 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3554 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3555 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3556 if (DECL_LANG_SPECIFIC (newdecl
)
3557 && DECL_LANG_SPECIFIC (olddecl
))
3558 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3561 /* Merge the section attribute.
3562 We want to issue an error if the sections conflict but that must be
3563 done later in decl_attributes since we are called before attributes
3565 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3566 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3568 /* Keep the old rtl since we can safely use it, unless it's the
3569 call to abort() used for abstract virtuals. */
3570 if ((DECL_LANG_SPECIFIC (olddecl
)
3571 && !DECL_ABSTRACT_VIRTUAL_P (olddecl
))
3572 || DECL_RTL (olddecl
) != DECL_RTL (abort_fndecl
))
3573 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3577 /* If cannot merge, then use the new type and qualifiers,
3578 and don't preserve the old rtl. */
3581 /* Clean out any memory we had of the old declaration. */
3582 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3584 TREE_VALUE (oldstatic
) = error_mark_node
;
3586 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3587 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3588 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3589 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3592 /* Merge the storage class information. */
3593 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3594 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3595 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3596 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3597 if (! DECL_EXTERNAL (olddecl
))
3598 DECL_EXTERNAL (newdecl
) = 0;
3600 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3602 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3603 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3604 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3605 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3606 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3607 /* Don't really know how much of the language-specific
3608 values we should copy from old to new. */
3609 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3610 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3611 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3612 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3613 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3615 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3616 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3617 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3618 DECL_BEFRIENDING_CLASSES (newdecl
)
3619 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3620 DECL_BEFRIENDING_CLASSES (olddecl
));
3623 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3625 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3626 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3628 /* If newdecl is not a specialization, then it is not a
3629 template-related function at all. And that means that we
3630 shoud have exited above, returning 0. */
3631 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3634 if (TREE_USED (olddecl
))
3635 /* From [temp.expl.spec]:
3637 If a template, a member template or the member of a class
3638 template is explicitly specialized then that
3639 specialization shall be declared before the first use of
3640 that specialization that would cause an implicit
3641 instantiation to take place, in every translation unit in
3642 which such a use occurs. */
3643 cp_error ("explicit specialization of %D after first use",
3646 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3648 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3650 /* If either decl says `inline', this fn is inline, unless its
3651 definition was passed already. */
3652 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3653 DECL_INLINE (olddecl
) = 1;
3654 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3658 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3659 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3660 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3662 if (! types_match
|| new_defines_function
)
3664 /* These need to be copied so that the names are available. */
3665 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3666 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3668 if (new_defines_function
)
3669 /* If defining a function declared with other language
3670 linkage, use the previously declared language linkage. */
3671 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3674 /* If redeclaring a builtin function, and not a definition,
3675 it stays built in. */
3676 if (DECL_BUILT_IN (olddecl
))
3678 DECL_BUILT_IN (newdecl
) = 1;
3679 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3680 /* If we're keeping the built-in definition, keep the rtl,
3681 regardless of declaration matches. */
3682 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3685 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3687 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3688 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3689 /* Previously saved insns go together with
3690 the function's previous definition. */
3691 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3692 /* Don't clear out the arguments if we're redefining a function. */
3693 if (DECL_ARGUMENTS (olddecl
))
3694 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3696 if (DECL_LANG_SPECIFIC (olddecl
))
3697 DECL_MAIN_VARIANT (newdecl
) = DECL_MAIN_VARIANT (olddecl
);
3700 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3702 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3705 /* Now preserve various other info from the definition. */
3706 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3707 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3708 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3709 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3711 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3714 struct lang_decl
*ol
= DECL_LANG_SPECIFIC (olddecl
);
3715 struct lang_decl
*nl
= DECL_LANG_SPECIFIC (newdecl
);
3717 function_size
= sizeof (struct tree_decl
);
3719 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3720 (char *) olddecl
+ sizeof (struct tree_common
),
3721 function_size
- sizeof (struct tree_common
));
3723 /* Can we safely free the storage used by newdecl? */
3725 #define ROUND(x) ((x + obstack_alignment_mask (&permanent_obstack)) \
3726 & ~ obstack_alignment_mask (&permanent_obstack))
3728 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3730 /* If newdecl is a template instantiation, it is possible that
3731 the following sequence of events has occurred:
3733 o A friend function was declared in a class template. The
3734 class template was instantiated.
3736 o The instantiation of the friend declaration was
3737 recorded on the instantiation list, and is newdecl.
3739 o Later, however, instantiate_class_template called pushdecl
3740 on the newdecl to perform name injection. But, pushdecl in
3741 turn called duplicate_decls when it discovered that another
3742 declaration of a global function with the same name already
3745 o Here, in duplicate_decls, we decided to clobber newdecl.
3747 If we're going to do that, we'd better make sure that
3748 olddecl, and not newdecl, is on the list of
3749 instantiations so that if we try to do the instantiation
3750 again we won't get the clobbered declaration. */
3752 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3753 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3755 for (; decls
; decls
= TREE_CHAIN (decls
))
3756 if (TREE_VALUE (decls
) == newdecl
)
3757 TREE_VALUE (decls
) = olddecl
;
3760 if (((char *)newdecl
+ ROUND (function_size
) == (char *)nl
3761 && ((char *)newdecl
+ ROUND (function_size
)
3762 + ROUND (sizeof (struct lang_decl
))
3763 == obstack_next_free (&permanent_obstack
)))
3764 || ((char *)newdecl
+ ROUND (function_size
)
3765 == obstack_next_free (&permanent_obstack
)))
3767 DECL_MAIN_VARIANT (newdecl
) = olddecl
;
3768 DECL_LANG_SPECIFIC (olddecl
) = ol
;
3769 bcopy ((char *)nl
, (char *)ol
, sizeof (struct lang_decl
));
3771 obstack_free (&permanent_obstack
, newdecl
);
3773 else if (LANG_DECL_PERMANENT (ol
) && ol
!= nl
)
3775 if (DECL_MAIN_VARIANT (olddecl
) == olddecl
)
3777 /* Save these lang_decls that would otherwise be lost. */
3778 extern tree free_lang_decl_chain
;
3779 tree free_lang_decl
= (tree
) ol
;
3781 if (DECL_LANG_SPECIFIC (olddecl
) == ol
)
3784 TREE_CHAIN (free_lang_decl
) = free_lang_decl_chain
;
3785 free_lang_decl_chain
= free_lang_decl
;
3789 /* Storage leak. */;
3795 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3796 (char *) olddecl
+ sizeof (struct tree_common
),
3797 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3798 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3801 DECL_UID (olddecl
) = olddecl_uid
;
3803 DECL_FRIEND_P (olddecl
) = 1;
3805 /* NEWDECL contains the merged attribute lists.
3806 Update OLDDECL to be the same. */
3807 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3812 /* Record a decl-node X as belonging to the current lexical scope.
3813 Check for errors (such as an incompatible declaration for the same
3814 name already seen in the same scope).
3816 Returns either X or an old decl for the same name.
3817 If an old decl is returned, it may have been smashed
3818 to agree with what X says. */
3825 register tree name
= DECL_ASSEMBLER_NAME (x
);
3826 int need_new_binding
= 1;
3828 if (DECL_TEMPLATE_PARM_P (x
))
3829 /* Template parameters have no context; they are not X::T even
3830 when declared within a class or namespace. */
3834 if (current_function_decl
&& x
!= current_function_decl
3835 /* A local declaration for a function doesn't constitute
3837 && (TREE_CODE (x
) != FUNCTION_DECL
|| DECL_INITIAL (x
))
3838 /* Don't change DECL_CONTEXT of virtual methods. */
3839 && (TREE_CODE (x
) != FUNCTION_DECL
|| !DECL_VIRTUAL_P (x
))
3840 && !DECL_CONTEXT (x
))
3841 DECL_CONTEXT (x
) = current_function_decl
;
3842 if (!DECL_CONTEXT (x
))
3843 DECL_CONTEXT (x
) = FROB_CONTEXT (current_namespace
);
3846 /* Type are looked up using the DECL_NAME, as that is what the rest of the
3847 compiler wants to use. */
3848 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
3849 || TREE_CODE (x
) == NAMESPACE_DECL
)
3850 name
= DECL_NAME (x
);
3855 /* Not needed...see below. */
3859 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3860 name
= TREE_OPERAND (name
, 0);
3862 /* Namespace-scoped variables are not found in the current level. */
3863 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
))
3864 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3866 t
= lookup_name_current_level (name
);
3867 if (t
== error_mark_node
)
3869 /* error_mark_node is 0 for a while during initialization! */
3871 cp_error_at ("`%#D' used prior to declaration", x
);
3874 else if (t
!= NULL_TREE
)
3877 /* This is turned off until I have time to do it right (bpk). */
3878 /* With the code below that uses it... */
3879 file
= DECL_SOURCE_FILE (t
);
3880 line
= DECL_SOURCE_LINE (t
);
3882 if (TREE_CODE (t
) == PARM_DECL
)
3884 if (DECL_CONTEXT (t
) == NULL_TREE
)
3885 fatal ("parse errors have confused me too much");
3887 /* Check for duplicate params. */
3888 if (duplicate_decls (x
, t
))
3891 else if (((TREE_CODE (x
) == FUNCTION_DECL
&& DECL_LANGUAGE (x
) == lang_c
)
3892 || DECL_FUNCTION_TEMPLATE_P (x
))
3893 && is_overloaded_fn (t
))
3894 /* Don't do anything just yet. */;
3895 else if (t
== wchar_decl_node
)
3897 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3898 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3900 /* Throw away the redeclaration. */
3903 else if (TREE_CODE (t
) != TREE_CODE (x
))
3905 if (duplicate_decls (x
, t
))
3908 else if (duplicate_decls (x
, t
))
3911 /* This is turned off until I have time to do it right (bpk). */
3913 /* Also warn if they did a prototype with `static' on it, but
3914 then later left the `static' off. */
3915 if (! TREE_PUBLIC (name
) && TREE_PUBLIC (x
))
3917 if (DECL_LANG_SPECIFIC (t
) && DECL_FRIEND_P (t
))
3922 cp_warning ("`static' missing from declaration of `%D'",
3924 warning_with_file_and_line (file
, line
,
3925 "previous declaration of `%s'",
3926 decl_as_string (t
, 0));
3929 /* Now fix things so it'll do what they expect. */
3930 if (current_function_decl
)
3931 TREE_PUBLIC (current_function_decl
) = 0;
3933 /* Due to interference in memory reclamation (X may be
3934 obstack-deallocated at this point), we must guard against
3935 one really special case. [jason: This should be handled
3936 by start_function] */
3937 if (current_function_decl
== x
)
3938 current_function_decl
= t
;
3940 if (TREE_CODE (t
) == TYPE_DECL
)
3941 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3942 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3943 check_default_args (t
);
3947 else if (DECL_MAIN_P (x
))
3949 /* A redeclaration of main, but not a duplicate of the
3954 This function shall not be overloaded. */
3955 cp_error_at ("invalid redeclaration of `%D'", t
);
3956 cp_error ("as `%D'", x
);
3957 /* We don't try to push this declaration since that
3963 check_template_shadow (x
);
3965 /* If this is a function conjured up by the backend, massage it
3966 so it looks friendly. */
3967 if (TREE_CODE (x
) == FUNCTION_DECL
3968 && ! DECL_LANG_SPECIFIC (x
))
3970 retrofit_lang_decl (x
);
3971 DECL_LANGUAGE (x
) = lang_c
;
3974 if (TREE_CODE (x
) == FUNCTION_DECL
&& ! DECL_FUNCTION_MEMBER_P (x
))
3976 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
3977 if (t
!= x
|| DECL_LANGUAGE (x
) == lang_c
)
3979 if (!namespace_bindings_p ())
3980 /* We do not need to create a binding for this name;
3981 push_overloaded_decl will have already done so if
3983 need_new_binding
= 0;
3985 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3986 return push_overloaded_decl (x
, PUSH_GLOBAL
);
3988 /* If declaring a type as a typedef, copy the type (unless we're
3989 at line 0), and install this TYPE_DECL as the new type's typedef
3990 name. See the extensive comment in ../c-decl.c (pushdecl). */
3991 if (TREE_CODE (x
) == TYPE_DECL
)
3993 tree type
= TREE_TYPE (x
);
3994 if (DECL_SOURCE_LINE (x
) == 0)
3996 if (TYPE_NAME (type
) == 0)
3997 TYPE_NAME (type
) = x
;
3999 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
4000 /* We don't want to copy the type when all we're
4001 doing is making a TYPE_DECL for the purposes of
4003 && (!TYPE_NAME (type
)
4004 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
4006 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
4008 DECL_ORIGINAL_TYPE (x
) = type
;
4009 type
= build_type_copy (type
);
4010 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
4011 TYPE_NAME (type
) = x
;
4012 TREE_TYPE (x
) = type
;
4017 if (type
!= error_mark_node
4019 && TYPE_IDENTIFIER (type
))
4020 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
4021 current_binding_level
);
4025 /* Multiple external decls of the same identifier ought to match.
4027 We get warnings about inline functions where they are defined.
4028 We get warnings about other functions from push_overloaded_decl.
4030 Avoid duplicate warnings where they are used. */
4031 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
4035 if (IDENTIFIER_NAMESPACE_VALUE (name
) != NULL_TREE
4036 && (DECL_EXTERNAL (IDENTIFIER_NAMESPACE_VALUE (name
))
4037 || TREE_PUBLIC (IDENTIFIER_NAMESPACE_VALUE (name
))))
4038 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
4043 /* If different sort of thing, we already gave an error. */
4044 && TREE_CODE (decl
) == TREE_CODE (x
)
4045 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
4047 cp_pedwarn ("type mismatch with previous external decl", x
);
4048 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
4052 /* This name is new in its binding level.
4053 Install the new declaration and return it. */
4054 if (namespace_bindings_p ())
4056 /* Install a global value. */
4058 /* If the first global decl has external linkage,
4059 warn if we later see static one. */
4060 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
4061 TREE_PUBLIC (name
) = 1;
4063 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
4066 if (TREE_CODE (x
) == FUNCTION_DECL
)
4068 ((IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
)
4069 || (IDENTIFIER_GLOBAL_VALUE (name
) == x
), 378);
4070 SET_IDENTIFIER_NAMESPACE_VALUE (name
, x
);
4073 /* Don't forget if the function was used via an implicit decl. */
4074 if (IDENTIFIER_IMPLICIT_DECL (name
)
4075 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
4078 /* Don't forget if its address was taken in that way. */
4079 if (IDENTIFIER_IMPLICIT_DECL (name
)
4080 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
4081 TREE_ADDRESSABLE (x
) = 1;
4083 /* Warn about mismatches against previous implicit decl. */
4084 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
4085 /* If this real decl matches the implicit, don't complain. */
4086 && ! (TREE_CODE (x
) == FUNCTION_DECL
4087 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
4089 ("`%D' was previously implicitly declared to return `int'", x
);
4091 /* If new decl is `static' and an `extern' was seen previously,
4093 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
4094 warn_extern_redeclared_static (x
, t
);
4098 /* Here to install a non-global value. */
4099 tree oldlocal
= IDENTIFIER_VALUE (name
);
4100 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
4102 if (need_new_binding
)
4104 push_local_binding (name
, x
, 0);
4105 /* Because push_local_binding will hook X on to the
4106 current_binding_level's name list, we don't want to
4107 do that again below. */
4108 need_new_binding
= 0;
4111 /* If this is a TYPE_DECL, push it into the type value slot. */
4112 if (TREE_CODE (x
) == TYPE_DECL
)
4113 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
4114 current_binding_level
);
4116 /* Clear out any TYPE_DECL shadowed by a namespace so that
4117 we won't think this is a type. The C struct hack doesn't
4118 go through namespaces. */
4119 if (TREE_CODE (x
) == NAMESPACE_DECL
)
4120 set_identifier_type_value_with_scope (name
, NULL_TREE
,
4121 current_binding_level
);
4123 /* If this is an extern function declaration, see if we
4124 have a global definition or declaration for the function. */
4125 if (oldlocal
== NULL_TREE
4126 && DECL_EXTERNAL (x
)
4127 && oldglobal
!= NULL_TREE
4128 && TREE_CODE (x
) == FUNCTION_DECL
4129 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
4131 /* We have one. Their types must agree. */
4132 if (decls_match (x
, oldglobal
))
4136 cp_warning ("extern declaration of `%#D' doesn't match", x
);
4137 cp_warning_at ("global declaration `%#D'", oldglobal
);
4140 /* If we have a local external declaration,
4141 and no file-scope declaration has yet been seen,
4142 then if we later have a file-scope decl it must not be static. */
4143 if (oldlocal
== NULL_TREE
4144 && oldglobal
== NULL_TREE
4145 && DECL_EXTERNAL (x
)
4147 TREE_PUBLIC (name
) = 1;
4149 if (DECL_FROM_INLINE (x
))
4150 /* Inline decls shadow nothing. */;
4152 /* Warn if shadowing an argument at the top level of the body. */
4153 else if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
4154 && TREE_CODE (oldlocal
) == PARM_DECL
4155 && TREE_CODE (x
) != PARM_DECL
)
4157 /* Go to where the parms should be and see if we
4159 struct binding_level
*b
= current_binding_level
->level_chain
;
4165 if (b
->parm_flag
== 1)
4166 cp_error ("declaration of `%#D' shadows a parameter", name
);
4168 else if (warn_shadow
&& oldlocal
!= NULL_TREE
4169 && current_binding_level
->is_for_scope
4170 && !DECL_DEAD_FOR_LOCAL (oldlocal
))
4172 warning ("variable `%s' shadows local",
4173 IDENTIFIER_POINTER (name
));
4174 cp_warning_at (" this is the shadowed declaration", oldlocal
);
4176 /* Maybe warn if shadowing something else. */
4177 else if (warn_shadow
&& !DECL_EXTERNAL (x
)
4178 /* No shadow warnings for internally generated vars. */
4179 && ! DECL_ARTIFICIAL (x
)
4180 /* No shadow warnings for vars made for inlining. */
4181 && ! DECL_FROM_INLINE (x
))
4183 const char *warnstring
= NULL
;
4185 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
4186 warnstring
= "declaration of `%s' shadows a parameter";
4187 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
4188 && current_class_ptr
4189 && !TREE_STATIC (name
))
4190 warnstring
= "declaration of `%s' shadows a member of `this'";
4191 else if (oldlocal
!= NULL_TREE
)
4192 warnstring
= "declaration of `%s' shadows previous local";
4193 else if (oldglobal
!= NULL_TREE
)
4194 /* XXX shadow warnings in outer-more namespaces */
4195 warnstring
= "declaration of `%s' shadows global declaration";
4198 warning (warnstring
, IDENTIFIER_POINTER (name
));
4202 if (TREE_CODE (x
) == FUNCTION_DECL
)
4203 check_default_args (x
);
4205 /* Keep count of variables in this level with incomplete type. */
4206 if (TREE_CODE (x
) == VAR_DECL
4207 && TREE_TYPE (x
) != error_mark_node
4208 && ((TYPE_SIZE (TREE_TYPE (x
)) == NULL_TREE
4209 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
4210 /* RTTI TD entries are created while defining the type_info. */
4211 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
4212 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
4213 current_binding_level
->incomplete
4214 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4217 if (need_new_binding
)
4219 /* Put decls on list in reverse order.
4220 We will reverse them later if necessary. */
4221 TREE_CHAIN (x
) = current_binding_level
->names
;
4222 current_binding_level
->names
= x
;
4223 if (current_binding_level
== global_binding_level
4224 && !TREE_PERMANENT (x
))
4225 my_friendly_abort (124);
4231 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4232 caller to set DECL_CONTEXT properly. */
4235 pushdecl_with_scope (x
, level
)
4237 struct binding_level
*level
;
4239 register struct binding_level
*b
;
4240 tree function_decl
= current_function_decl
;
4242 current_function_decl
= NULL_TREE
;
4243 if (level
->parm_flag
== 2)
4245 b
= class_binding_level
;
4246 class_binding_level
= level
;
4247 pushdecl_class_level (x
);
4248 class_binding_level
= b
;
4252 b
= current_binding_level
;
4253 current_binding_level
= level
;
4255 current_binding_level
= b
;
4257 current_function_decl
= function_decl
;
4261 /* Like pushdecl, only it places X in the current namespace,
4265 pushdecl_namespace_level (x
)
4268 register struct binding_level
*b
= current_binding_level
;
4271 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4273 /* Now, the type_shadowed stack may screw us. Munge it so it does
4275 if (TREE_CODE (x
) == TYPE_DECL
)
4277 tree name
= DECL_NAME (x
);
4279 tree
*ptr
= (tree
*)0;
4280 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4282 tree shadowed
= b
->type_shadowed
;
4283 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4284 if (TREE_PURPOSE (shadowed
) == name
)
4286 ptr
= &TREE_VALUE (shadowed
);
4287 /* Can't break out of the loop here because sometimes
4288 a binding level will have duplicate bindings for
4289 PT names. It's gross, but I haven't time to fix it. */
4292 newval
= TREE_TYPE (x
);
4293 if (ptr
== (tree
*)0)
4295 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4296 up here if this is changed to an assertion. --KR */
4297 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4307 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4311 pushdecl_top_level (x
)
4314 tree cur_namespace
= current_namespace
;
4315 current_namespace
= global_namespace
;
4316 x
= pushdecl_namespace_level (x
);
4317 current_namespace
= cur_namespace
;
4321 /* Make the declaration of X appear in CLASS scope. */
4324 pushdecl_class_level (x
)
4327 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4328 scope looks for the pre-mangled name. */
4331 if (TREE_CODE (x
) == OVERLOAD
)
4332 x
= OVL_CURRENT (x
);
4333 name
= DECL_NAME (x
);
4337 push_class_level_binding (name
, x
);
4338 if (TREE_CODE (x
) == TYPE_DECL
)
4339 set_identifier_type_value (name
, TREE_TYPE (x
));
4341 else if (ANON_UNION_TYPE_P (TREE_TYPE (x
)))
4345 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4348 pushdecl_class_level (f
);
4353 /* This function is used to push the mangled decls for nested types into
4354 the appropriate scope. Previously pushdecl_top_level was used, but that
4355 is incorrect for members of local classes. */
4358 pushdecl_nonclass_level (x
)
4361 struct binding_level
*b
= current_binding_level
;
4363 my_friendly_assert (b
->parm_flag
!= 2, 180);
4366 /* Get out of template binding levels */
4367 while (b
->pseudo_global
)
4371 pushdecl_with_scope (x
, b
);
4375 /* Make the declaration(s) of X appear in CLASS scope
4376 under the name NAME. */
4379 push_class_level_binding (name
, x
)
4384 /* The class_binding_level will be NULL if x is a template
4385 parameter name in a member template. */
4386 if (!class_binding_level
)
4389 /* Make sure that this new member does not have the same name
4390 as a template parameter. */
4391 if (TYPE_BEING_DEFINED (current_class_type
))
4392 check_template_shadow (x
);
4394 /* If this declaration shadows a declaration from an enclosing
4395 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4396 we leave this class. Record the shadowed declaration here. */
4397 binding
= IDENTIFIER_BINDING (name
);
4399 && ((TREE_CODE (x
) == OVERLOAD
4400 && BINDING_VALUE (binding
)
4401 && is_overloaded_fn (BINDING_VALUE (binding
)))
4402 || INHERITED_VALUE_BINDING_P (binding
)))
4407 /* If the old binding was from a base class, and was for a tag
4408 name, slide it over to make room for the new binding. The
4409 old binding is still visible if explicitly qualified with a
4411 if (INHERITED_VALUE_BINDING_P (binding
)
4412 && BINDING_VALUE (binding
)
4413 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4414 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4415 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4417 old_decl
= BINDING_TYPE (binding
);
4418 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4419 BINDING_VALUE (binding
) = NULL_TREE
;
4420 INHERITED_VALUE_BINDING_P (binding
) = 0;
4423 old_decl
= BINDING_VALUE (binding
);
4425 /* There was already a binding for X containing fewer
4426 functions than are named in X. Find the previous
4427 declaration of X on the class-shadowed list, and update it. */
4428 for (shadow
= class_binding_level
->class_shadowed
;
4430 shadow
= TREE_CHAIN (shadow
))
4431 if (TREE_PURPOSE (shadow
) == name
4432 && TREE_TYPE (shadow
) == old_decl
)
4434 BINDING_VALUE (binding
) = x
;
4435 INHERITED_VALUE_BINDING_P (binding
) = 0;
4436 TREE_TYPE (shadow
) = x
;
4441 /* If we didn't replace an existing binding, put the binding on the
4442 stack of bindings for the identifier, and update
4443 IDENTIFIER_CLASS_VALUE. */
4444 if (push_class_binding (name
, x
))
4446 maybe_push_cache_obstack ();
4447 class_binding_level
->class_shadowed
4448 = tree_cons (name
, IDENTIFIER_CLASS_VALUE (name
),
4449 class_binding_level
->class_shadowed
);
4451 /* Record the value we are binding NAME to so that we can know
4452 what to pop later. */
4453 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4457 /* Insert another USING_DECL into the current binding level,
4458 returning this declaration. If this is a redeclaration,
4459 do nothing and return NULL_TREE. */
4462 push_using_decl (scope
, name
)
4468 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4469 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4470 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4471 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4475 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4476 DECL_INITIAL (decl
) = scope
;
4477 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4478 current_binding_level
->usings
= decl
;
4482 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4483 changed (i.e. there was already a directive), or the fresh
4484 TREE_LIST otherwise. */
4487 push_using_directive (used
)
4490 tree ud
= current_binding_level
->using_directives
;
4491 tree iter
, ancestor
;
4493 /* Check if we already have this. */
4494 if (purpose_member (used
, ud
) != NULL_TREE
)
4497 /* Recursively add all namespaces used. */
4498 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4499 push_using_directive (TREE_PURPOSE (iter
));
4501 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4502 ud
= current_binding_level
->using_directives
;
4503 ud
= perm_tree_cons (used
, ancestor
, ud
);
4504 current_binding_level
->using_directives
= ud
;
4508 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4509 other definitions already in place. We get around this by making
4510 the value of the identifier point to a list of all the things that
4511 want to be referenced by that name. It is then up to the users of
4512 that name to decide what to do with that list.
4514 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its DECL_RESULT
4515 slot. It is dealt with the same way.
4517 FLAGS is a bitwise-or of the following values:
4518 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4520 PUSH_USING: DECL is being pushed as the result of a using
4523 The value returned may be a previous declaration if we guessed wrong
4524 about what language DECL should belong to (C or C++). Otherwise,
4525 it's always DECL (and never something that's not a _DECL). */
4528 push_overloaded_decl (decl
, flags
)
4532 tree name
= DECL_NAME (decl
);
4535 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4539 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4540 if (old
&& TREE_CODE (old
) == FUNCTION_DECL
4541 && DECL_ARTIFICIAL (old
)
4542 && (DECL_BUILT_IN (old
) || DECL_BUILT_IN_NONANSI (old
)))
4544 if (duplicate_decls (decl
, old
))
4550 old
= lookup_name_current_level (name
);
4554 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4556 tree t
= TREE_TYPE (old
);
4557 if (IS_AGGR_TYPE (t
) && warn_shadow
4558 && (! DECL_IN_SYSTEM_HEADER (decl
)
4559 || ! DECL_IN_SYSTEM_HEADER (old
)))
4560 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4563 else if (is_overloaded_fn (old
))
4567 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4569 tree fn
= OVL_CURRENT (tmp
);
4571 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4572 && !(flags
& PUSH_USING
)
4573 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4574 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4575 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4578 if (duplicate_decls (decl
, fn
))
4584 cp_error_at ("previous non-function declaration `%#D'", old
);
4585 cp_error ("conflicts with function declaration `%#D'", decl
);
4590 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4592 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4593 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4595 new_binding
= ovl_cons (decl
, old
);
4596 if (flags
& PUSH_USING
)
4597 OVL_USED (new_binding
) = 1;
4600 /* NAME is not ambiguous. */
4604 set_namespace_binding (name
, current_namespace
, new_binding
);
4607 /* We only create an OVERLOAD if there was a previous binding at
4608 this level, or if decl is a template. In the former case, we
4609 need to remove the old binding and replace it with the new
4610 binding. We must also run through the NAMES on the binding
4611 level where the name was bound to update the chain. */
4613 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4617 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4619 d
= &TREE_CHAIN (*d
))
4621 || (TREE_CODE (*d
) == TREE_LIST
4622 && TREE_VALUE (*d
) == old
))
4624 if (TREE_CODE (*d
) == TREE_LIST
)
4625 /* Just replace the old binding with the new. */
4626 TREE_VALUE (*d
) = new_binding
;
4628 /* Build a TREE_LIST to wrap the OVERLOAD. */
4629 *d
= build_tree_list (NULL_TREE
, new_binding
);
4631 /* And update the CPLUS_BINDING node. */
4632 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4637 /* We should always find a previous binding in this case. */
4638 my_friendly_abort (0);
4641 /* Install the new binding. */
4642 push_local_binding (name
, new_binding
, flags
);
4648 /* Generate an implicit declaration for identifier FUNCTIONID
4649 as a function of type int (). Print a warning if appropriate. */
4652 implicitly_declare (functionid
)
4656 int temp
= allocation_temporary_p ();
4658 push_obstacks_nochange ();
4660 /* Save the decl permanently so we can warn if definition follows.
4661 In ANSI C, warn_implicit is usually false, so the saves little space.
4662 But in C++, it's usually true, hence the extra code. */
4663 if (temp
&& (! warn_implicit
|| toplevel_bindings_p ()))
4664 end_temporary_allocation ();
4666 /* We used to reuse an old implicit decl here,
4667 but this loses with inline functions because it can clobber
4668 the saved decl chains. */
4669 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4671 DECL_EXTERNAL (decl
) = 1;
4672 TREE_PUBLIC (decl
) = 1;
4674 /* ANSI standard says implicit declarations are in the innermost block.
4675 So we record the decl in the standard fashion. */
4677 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4680 /* Only one warning per identifier. */
4681 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4683 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4686 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4693 /* Return zero if the declaration NEWDECL is valid
4694 when the declaration OLDDECL (assumed to be for the same name)
4695 has already been seen.
4696 Otherwise return an error message format string with a %s
4697 where the identifier should go. */
4700 redeclaration_error_message (newdecl
, olddecl
)
4701 tree newdecl
, olddecl
;
4703 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4705 /* Because C++ can put things into name space for free,
4706 constructs like "typedef struct foo { ... } foo"
4707 would look like an erroneous redeclaration. */
4708 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4711 return "redefinition of `%#D'";
4713 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4715 /* If this is a pure function, its olddecl will actually be
4716 the original initialization to `0' (which we force to call
4717 abort()). Don't complain about redefinition in this case. */
4718 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_ABSTRACT_VIRTUAL_P (olddecl
))
4721 /* If both functions come from different namespaces, this is not
4722 a redeclaration - this is a conflict with a used function. */
4723 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4724 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4725 return "`%D' conflicts with used function";
4727 /* We'll complain about linkage mismatches in
4728 warn_extern_redeclared_static. */
4730 /* Defining the same name twice is no good. */
4731 if (DECL_INITIAL (olddecl
) != NULL_TREE
4732 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4734 if (DECL_NAME (olddecl
) == NULL_TREE
)
4735 return "`%#D' not declared in class";
4737 return "redefinition of `%#D'";
4741 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4743 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4744 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4745 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4746 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4747 && TYPE_SIZE (TREE_TYPE (newdecl
))
4748 && TYPE_SIZE (TREE_TYPE (olddecl
))))
4749 return "redefinition of `%#D'";
4752 else if (toplevel_bindings_p ())
4754 /* Objects declared at top level: */
4755 /* If at least one is a reference, it's ok. */
4756 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4758 /* Reject two definitions. */
4759 return "redefinition of `%#D'";
4763 /* Objects declared with block scope: */
4764 /* Reject two definitions, and reject a definition
4765 together with an external reference. */
4766 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4767 return "redeclaration of `%#D'";
4772 /* Get the LABEL_DECL corresponding to identifier ID as a label.
4773 Create one if none exists so far for the current function.
4774 This function is called for both label definitions and label references. */
4780 register tree decl
= IDENTIFIER_LABEL_VALUE (id
);
4782 if (current_function_decl
== NULL_TREE
)
4784 error ("label `%s' referenced outside of any function",
4785 IDENTIFIER_POINTER (id
));
4789 if ((decl
== NULL_TREE
4790 || DECL_SOURCE_LINE (decl
) == 0)
4791 && (named_label_uses
== NULL
4792 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4793 || named_label_uses
->label_decl
!= decl
))
4795 struct named_label_list
*new_ent
;
4797 = (struct named_label_list
*)oballoc (sizeof (struct named_label_list
));
4798 new_ent
->label_decl
= decl
;
4799 new_ent
->names_in_scope
= current_binding_level
->names
;
4800 new_ent
->binding_level
= current_binding_level
;
4801 new_ent
->lineno_o_goto
= lineno
;
4802 new_ent
->filename_o_goto
= input_filename
;
4803 new_ent
->next
= named_label_uses
;
4804 named_label_uses
= new_ent
;
4807 /* Use a label already defined or ref'd with this name. */
4808 if (decl
!= NULL_TREE
)
4810 /* But not if it is inherited and wasn't declared to be inheritable. */
4811 if (DECL_CONTEXT (decl
) != current_function_decl
4812 && ! C_DECLARED_LABEL_FLAG (decl
))
4813 return shadow_label (id
);
4817 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4819 /* Make sure every label has an rtx. */
4822 /* A label not explicitly declared must be local to where it's ref'd. */
4823 DECL_CONTEXT (decl
) = current_function_decl
;
4825 DECL_MODE (decl
) = VOIDmode
;
4827 /* Say where one reference is to the label,
4828 for the sake of the error if it is not defined. */
4829 DECL_SOURCE_LINE (decl
) = lineno
;
4830 DECL_SOURCE_FILE (decl
) = input_filename
;
4832 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4834 named_labels
= tree_cons (NULL_TREE
, decl
, named_labels
);
4835 named_label_uses
->label_decl
= decl
;
4840 /* Make a label named NAME in the current function,
4841 shadowing silently any that may be inherited from containing functions
4842 or containing scopes.
4844 Note that valid use, if the label being shadowed
4845 comes from another scope in the same function,
4846 requires calling declare_nonlocal_label right away. */
4852 register tree decl
= IDENTIFIER_LABEL_VALUE (name
);
4854 if (decl
!= NULL_TREE
)
4856 shadowed_labels
= tree_cons (NULL_TREE
, decl
, shadowed_labels
);
4857 SET_IDENTIFIER_LABEL_VALUE (name
, NULL_TREE
);
4860 return lookup_label (name
);
4863 /* Define a label, specifying the location in the source file.
4864 Return the LABEL_DECL node for the label, if the definition is valid.
4865 Otherwise return 0. */
4868 define_label (filename
, line
, name
)
4875 if (minimal_parse_mode
)
4877 push_obstacks (&permanent_obstack
, &permanent_obstack
);
4878 decl
= build_decl (LABEL_DECL
, name
, void_type_node
);
4880 DECL_SOURCE_LINE (decl
) = line
;
4881 DECL_SOURCE_FILE (decl
) = filename
;
4886 decl
= lookup_label (name
);
4888 /* After labels, make any new cleanups go into their
4889 own new (temporary) binding contour. */
4890 current_binding_level
->more_cleanups_ok
= 0;
4892 /* If label with this name is known from an outer context, shadow it. */
4893 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) != current_function_decl
)
4895 shadowed_labels
= tree_cons (NULL_TREE
, decl
, shadowed_labels
);
4896 SET_IDENTIFIER_LABEL_VALUE (name
, NULL_TREE
);
4897 decl
= lookup_label (name
);
4900 if (name
== get_identifier ("wchar_t"))
4901 cp_pedwarn ("label named wchar_t");
4903 if (DECL_INITIAL (decl
) != NULL_TREE
)
4905 cp_error ("duplicate label `%D'", decl
);
4910 struct named_label_list
*uses
, *prev
;
4913 /* Mark label as having been defined. */
4914 DECL_INITIAL (decl
) = error_mark_node
;
4915 /* Say where in the source. */
4916 DECL_SOURCE_FILE (decl
) = filename
;
4917 DECL_SOURCE_LINE (decl
) = line
;
4920 uses
= named_label_uses
;
4921 while (uses
!= NULL
)
4922 if (uses
->label_decl
== decl
)
4924 struct binding_level
*b
= current_binding_level
;
4927 tree new_decls
= b
->names
;
4928 tree old_decls
= (b
== uses
->binding_level
)
4929 ? uses
->names_in_scope
: NULL_TREE
;
4930 while (new_decls
!= old_decls
)
4932 if (TREE_CODE (new_decls
) == VAR_DECL
4933 /* Don't complain about crossing initialization
4934 of internal entities. They can't be accessed,
4935 and they should be cleaned up
4936 by the time we get to the label. */
4937 && ! DECL_ARTIFICIAL (new_decls
)
4938 && !(DECL_INITIAL (new_decls
) == NULL_TREE
4939 && pod_type_p (TREE_TYPE (new_decls
))))
4941 /* This is really only important if we're crossing
4942 an initialization. The POD stuff is just
4943 pedantry; why should it matter if the class
4944 contains a field of pointer to member type? */
4945 int problem
= (DECL_INITIAL (new_decls
)
4946 || (TYPE_NEEDS_CONSTRUCTING
4947 (TREE_TYPE (new_decls
))));
4953 cp_error ("jump to label `%D'", decl
);
4954 error_with_file_and_line
4955 (uses
->filename_o_goto
,
4956 uses
->lineno_o_goto
, " from here");
4960 cp_pedwarn ("jump to label `%D'", decl
);
4961 pedwarn_with_file_and_line
4962 (uses
->filename_o_goto
,
4963 uses
->lineno_o_goto
, " from here");
4969 cp_error_at (" crosses initialization of `%#D'",
4972 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4975 new_decls
= TREE_CHAIN (new_decls
);
4977 if (b
== uses
->binding_level
)
4983 prev
->next
= uses
->next
;
4985 named_label_uses
= uses
->next
;
4994 current_function_return_value
= NULL_TREE
;
5001 struct binding_level
*level
;
5002 struct cp_switch
*next
;
5005 static struct cp_switch
*switch_stack
;
5011 = (struct cp_switch
*) oballoc (sizeof (struct cp_switch
));
5012 p
->level
= current_binding_level
;
5013 p
->next
= switch_stack
;
5020 switch_stack
= switch_stack
->next
;
5023 /* Same, but for CASE labels. If DECL is NULL_TREE, it's the default. */
5024 /* XXX Note decl is never actually used. (bpk) */
5027 define_case_label ()
5029 tree cleanup
= last_cleanup_this_contour ();
5030 struct binding_level
*b
= current_binding_level
;
5035 static int explained
= 0;
5036 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup
));
5037 warning ("where case label appears here");
5040 warning ("(enclose actions of previous case statements requiring");
5041 warning ("destructors in their own binding contours.)");
5046 for (; b
&& b
!= switch_stack
->level
; b
= b
->level_chain
)
5048 tree new_decls
= b
->names
;
5049 for (; new_decls
; new_decls
= TREE_CHAIN (new_decls
))
5051 if (TREE_CODE (new_decls
) == VAR_DECL
5052 /* Don't complain about crossing initialization
5053 of internal entities. They can't be accessed,
5054 and they should be cleaned up
5055 by the time we get to the label. */
5056 && ! DECL_ARTIFICIAL (new_decls
)
5057 && ((DECL_INITIAL (new_decls
) != NULL_TREE
5058 && DECL_INITIAL (new_decls
) != error_mark_node
)
5059 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls
))))
5062 error ("jump to case label");
5064 cp_error_at (" crosses initialization of `%#D'",
5070 /* After labels, make any new cleanups go into their
5071 own new (temporary) binding contour. */
5073 current_binding_level
->more_cleanups_ok
= 0;
5074 current_function_return_value
= NULL_TREE
;
5077 /* Return the list of declarations of the current level.
5078 Note that this list is in reverse order unless/until
5079 you nreverse it; and when you do nreverse it, you must
5080 store the result back using `storedecls' or you will lose. */
5085 return current_binding_level
->names
;
5088 /* Return the list of type-tags (for structs, etc) of the current level. */
5093 return current_binding_level
->tags
;
5096 /* Store the list of declarations of the current level.
5097 This is done for the parameter declarations of a function being defined,
5098 after they are modified in the light of any missing parameters. */
5104 current_binding_level
->names
= decls
;
5107 /* Similarly, store the list of tags of the current level. */
5113 current_binding_level
->tags
= tags
;
5116 /* Given NAME, an IDENTIFIER_NODE,
5117 return the structure (or union or enum) definition for that name.
5118 Searches binding levels from BINDING_LEVEL up to the global level.
5119 If THISLEVEL_ONLY is nonzero, searches only the specified context
5120 (but skips any tag-transparent contexts to find one that is
5121 meaningful for tags).
5122 FORM says which kind of type the caller wants;
5123 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
5124 If the wrong kind of type is found, and it's not a template, an error is
5128 lookup_tag (form
, name
, binding_level
, thislevel_only
)
5129 enum tree_code form
;
5131 struct binding_level
*binding_level
;
5134 register struct binding_level
*level
;
5135 /* Non-zero if, we should look past a pseudo-global level, even if
5137 int allow_pseudo_global
= 1;
5139 for (level
= binding_level
; level
; level
= level
->level_chain
)
5142 if (ANON_AGGRNAME_P (name
))
5143 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5145 /* There's no need for error checking here, because
5146 anon names are unique throughout the compilation. */
5147 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
5148 return TREE_VALUE (tail
);
5150 else if (level
->namespace_p
)
5151 /* Do namespace lookup. */
5152 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
5154 tree old
= binding_for_name (name
, tail
);
5156 /* If we just skipped past a pseudo global level, even
5157 though THISLEVEL_ONLY, and we find a template class
5158 declaration, then we use the _TYPE node for the
5159 template. See the example below. */
5160 if (thislevel_only
&& !allow_pseudo_global
5161 && old
&& BINDING_VALUE (old
)
5162 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
5163 old
= TREE_TYPE (BINDING_VALUE (old
));
5165 old
= BINDING_TYPE (old
);
5167 /* If it has an original type, it is a typedef, and we
5168 should not return it. */
5169 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
5171 if (old
&& TREE_CODE (old
) != form
5172 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
5174 cp_error ("`%#D' redeclared as %C", old
, form
);
5179 if (thislevel_only
|| tail
== global_namespace
)
5183 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5185 if (TREE_PURPOSE (tail
) == name
)
5187 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
5188 /* Should tighten this up; it'll probably permit
5189 UNION_TYPE and a struct template, for example. */
5191 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
5193 /* Definition isn't the kind we were looking for. */
5194 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
5198 return TREE_VALUE (tail
);
5201 if (thislevel_only
&& ! level
->tag_transparent
)
5203 if (level
->pseudo_global
&& allow_pseudo_global
)
5205 /* We must deal with cases like this:
5207 template <class T> struct S;
5208 template <class T> struct S {};
5210 When looking up `S', for the second declaration, we
5211 would like to find the first declaration. But, we
5212 are in the pseudo-global level created for the
5213 template parameters, rather than the (surrounding)
5214 namespace level. Thus, we keep going one more level,
5215 even though THISLEVEL_ONLY is non-zero. */
5216 allow_pseudo_global
= 0;
5222 if (current_class_type
&& level
->level_chain
->namespace_p
)
5224 /* Try looking in this class's tags before heading into
5225 global binding level. */
5226 tree context
= current_class_type
;
5229 switch (TREE_CODE_CLASS (TREE_CODE (context
)))
5233 these_tags
= CLASSTYPE_TAGS (context
);
5234 if (ANON_AGGRNAME_P (name
))
5237 if (TYPE_IDENTIFIER (TREE_VALUE (these_tags
))
5239 return TREE_VALUE (tail
);
5240 these_tags
= TREE_CHAIN (these_tags
);
5245 if (TREE_PURPOSE (these_tags
) == name
)
5247 if (TREE_CODE (TREE_VALUE (these_tags
)) != form
)
5249 cp_error ("`%#D' redeclared as %C in class scope",
5250 TREE_VALUE (tail
), form
);
5253 return TREE_VALUE (tail
);
5255 these_tags
= TREE_CHAIN (these_tags
);
5257 /* If this type is not yet complete, then don't
5258 look at its context. */
5259 if (TYPE_SIZE (context
) == NULL_TREE
)
5261 /* Go to next enclosing type, if any. */
5262 context
= DECL_CONTEXT (TYPE_MAIN_DECL (context
));
5265 context
= DECL_CONTEXT (context
);
5268 my_friendly_abort (10);
5281 set_current_level_tags_transparency (tags_transparent
)
5282 int tags_transparent
;
5284 current_binding_level
->tag_transparent
= tags_transparent
;
5288 /* Given a type, find the tag that was defined for it and return the tag name.
5289 Otherwise return 0. However, the value can never be 0
5290 in the cases in which this is used.
5292 C++: If NAME is non-zero, this is the new name to install. This is
5293 done when replacing anonymous tags with real tag names. */
5296 lookup_tag_reverse (type
, name
)
5300 register struct binding_level
*level
;
5302 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5305 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5307 if (TREE_VALUE (tail
) == type
)
5310 TREE_PURPOSE (tail
) = name
;
5311 return TREE_PURPOSE (tail
);
5318 /* Lookup TYPE in CONTEXT (a chain of nested types or a FUNCTION_DECL).
5319 Return the type value, or NULL_TREE if not found. */
5322 lookup_nested_type (type
, context
)
5326 if (context
== NULL_TREE
)
5330 switch (TREE_CODE (context
))
5334 tree ctype
= TREE_TYPE (context
);
5335 tree match
= value_member (type
, CLASSTYPE_TAGS (ctype
));
5337 return TREE_VALUE (match
);
5338 context
= DECL_CONTEXT (context
);
5340 /* When we have a nested class whose member functions have
5341 local types (e.g., a set of enums), we'll arrive here
5342 with the DECL_CONTEXT as the actual RECORD_TYPE node for
5343 the enclosing class. Instead, we want to make sure we
5344 come back in here with the TYPE_DECL, not the RECORD_TYPE. */
5345 if (context
&& TREE_CODE (context
) == RECORD_TYPE
)
5346 context
= TREE_CHAIN (context
);
5350 if (TYPE_NAME (type
) && TYPE_IDENTIFIER (type
))
5351 return lookup_name (TYPE_IDENTIFIER (type
), 1);
5354 my_friendly_abort (12);
5360 /* Look up NAME in the NAMESPACE. */
5363 lookup_namespace_name (namespace, name
)
5364 tree
namespace, name
;
5366 struct tree_binding _b
;
5369 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5371 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5372 /* This happens for A::B<int> when B is a namespace. */
5374 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5376 /* This happens for A::B where B is a template, and there are no
5377 template arguments. */
5378 cp_error ("invalid use of `%D'", name
);
5379 return error_mark_node
;
5382 namespace = ORIGINAL_NAMESPACE (namespace);
5384 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5386 val
= binding_init (&_b
);
5387 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5388 return error_mark_node
;
5390 if (BINDING_VALUE (val
))
5392 val
= BINDING_VALUE (val
);
5394 /* If we have a single function from a using decl, pull it out. */
5395 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5396 val
= OVL_FUNCTION (val
);
5400 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5401 return error_mark_node
;
5404 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5406 static unsigned long
5414 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5415 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5420 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5423 typename_compare (k1
, k2
)
5434 d1
= TYPE_NAME (t1
);
5435 d2
= TYPE_NAME (t2
);
5437 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5438 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5439 && ((TREE_TYPE (t1
) != NULL_TREE
)
5440 == (TREE_TYPE (t2
) != NULL_TREE
))
5441 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5442 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5445 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5446 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5447 is non-NULL, this type is being created by the implicit typename
5448 extension, and BASE_TYPE is a type named `t' in some base class of
5449 `T' which depends on template parameters.
5451 Returns the new TYPENAME_TYPE. */
5454 build_typename_type (context
, name
, fullname
, base_type
)
5462 struct hash_entry
* e
;
5464 static struct hash_table ht
;
5466 push_obstacks (&permanent_obstack
, &permanent_obstack
);
5469 && !hash_table_init (&ht
, &hash_newfunc
, &typename_hash
,
5471 fatal ("virtual memory exhausted");
5473 /* The FULLNAME needs to exist for the life of the hash table, i.e.,
5474 for the entire compilation. */
5475 if (!TREE_PERMANENT (fullname
))
5476 fullname
= copy_to_permanent (fullname
);
5478 /* Build the TYPENAME_TYPE. */
5479 t
= make_lang_type (TYPENAME_TYPE
);
5480 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5481 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5482 TREE_TYPE (t
) = base_type
;
5484 /* Build the corresponding TYPE_DECL. */
5485 d
= build_decl (TYPE_DECL
, name
, t
);
5486 TYPE_NAME (TREE_TYPE (d
)) = d
;
5487 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5488 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5489 DECL_ARTIFICIAL (d
) = 1;
5491 /* See if we already have this type. */
5492 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5495 /* This will free not only TREE_TYPE, but the lang-specific data
5496 and the TYPE_DECL as well. */
5497 obstack_free (&permanent_obstack
, t
);
5501 /* Insert the type into the table. */
5502 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5510 make_typename_type (context
, name
)
5516 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
5518 if (!(TYPE_LANG_SPECIFIC (name
)
5519 && (CLASSTYPE_IS_TEMPLATE (name
)
5520 || CLASSTYPE_USE_TEMPLATE (name
))))
5521 name
= TYPE_IDENTIFIER (name
);
5523 /* Create a TEMPLATE_ID_EXPR for the type. */
5524 name
= build_nt (TEMPLATE_ID_EXPR
,
5525 CLASSTYPE_TI_TEMPLATE (name
),
5526 CLASSTYPE_TI_ARGS (name
));
5528 else if (TREE_CODE (name
) == TYPE_DECL
)
5529 name
= DECL_NAME (name
);
5533 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5535 name
= TREE_OPERAND (name
, 0);
5536 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5537 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5539 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5540 my_friendly_abort (2000);
5542 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5544 /* We can get here from typename_sub0 in the explicit_template_type
5545 expansion. Just fail. */
5546 cp_error ("no class template named `%#T' in `%#T'",
5548 return error_mark_node
;
5551 if (! uses_template_parms (context
)
5552 || currently_open_class (context
))
5554 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5556 tree tmpl
= NULL_TREE
;
5557 if (IS_AGGR_TYPE (context
))
5558 tmpl
= lookup_field (context
, name
, 0, 0);
5559 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5561 cp_error ("no class template named `%#T' in `%#T'",
5563 return error_mark_node
;
5566 return lookup_template_class (tmpl
,
5567 TREE_OPERAND (fullname
, 1),
5569 /*entering_scope=*/0);
5573 if (IS_AGGR_TYPE (context
))
5574 t
= lookup_field (context
, name
, 0, 1);
5577 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5578 return error_mark_node
;
5582 return TREE_TYPE (t
);
5586 /* If the CONTEXT is not a template type, then either the field is
5587 there now or its never going to be. */
5588 if (!uses_template_parms (context
) && !t
)
5590 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5591 return error_mark_node
;
5595 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5598 /* Select the right _DECL from multiple choices. */
5601 select_decl (binding
, flags
)
5606 val
= BINDING_VALUE (binding
);
5607 if (LOOKUP_NAMESPACES_ONLY (flags
))
5609 /* We are not interested in types. */
5610 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5615 /* If we could have a type and
5616 we have nothing or we need a type and have none. */
5617 if (BINDING_TYPE (binding
)
5618 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5619 && TREE_CODE (val
) != TYPE_DECL
)))
5620 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5621 /* Don't return non-types if we really prefer types. */
5622 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5623 && (TREE_CODE (val
) != TEMPLATE_DECL
5624 || !DECL_CLASS_TEMPLATE_P (val
)))
5630 /* Unscoped lookup of a global, iterate over namespaces, considering
5631 using namespace statements. */
5634 unqualified_namespace_lookup (name
, flags
)
5638 struct tree_binding _binding
;
5639 tree b
= binding_init (&_binding
);
5640 tree initial
= current_decl_namespace();
5641 tree scope
= initial
;
5643 struct binding_level
*level
;
5644 tree val
= NULL_TREE
;
5648 val
= binding_for_name (name
, scope
);
5650 /* Initialize binding for this context. */
5651 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5652 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5654 /* Add all _DECLs seen through local using-directives. */
5655 for (level
= current_binding_level
;
5656 !level
->namespace_p
;
5657 level
= level
->level_chain
)
5658 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5660 /* Give up because of error. */
5661 return error_mark_node
;
5663 /* Add all _DECLs seen through global using-directives. */
5664 /* XXX local and global using lists should work equally. */
5668 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5670 /* Give up because of error. */
5671 return error_mark_node
;
5672 if (siter
== scope
) break;
5673 siter
= CP_DECL_CONTEXT (siter
);
5676 val
= select_decl (b
, flags
);
5677 if (scope
== global_namespace
)
5679 scope
= CP_DECL_CONTEXT (scope
);
5684 /* Combine prefer_type and namespaces_only into flags. */
5687 lookup_flags (prefer_type
, namespaces_only
)
5688 int prefer_type
, namespaces_only
;
5690 if (namespaces_only
)
5691 return LOOKUP_PREFER_NAMESPACES
;
5692 if (prefer_type
> 1)
5693 return LOOKUP_PREFER_TYPES
;
5694 if (prefer_type
> 0)
5695 return LOOKUP_PREFER_BOTH
;
5699 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5700 ignore it or not. Subroutine of lookup_name_real. */
5703 qualify_lookup (val
, flags
)
5707 if (val
== NULL_TREE
)
5709 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5711 if ((flags
& LOOKUP_PREFER_TYPES
)
5712 && (TREE_CODE (val
) == TYPE_DECL
5713 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5714 && DECL_CLASS_TEMPLATE_P (val
))))
5716 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5721 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5725 warn_about_implicit_typename_lookup (typename
, binding
)
5729 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5730 tree name
= DECL_NAME (typename
);
5732 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5733 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5734 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5735 && ! (TREE_CODE (binding
) == TYPE_DECL
5736 && same_type_p (TREE_TYPE (binding
), subtype
)))
5738 cp_warning ("lookup of `%D' finds `%#D'",
5740 cp_warning (" instead of `%D' from dependent base class",
5742 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5743 constructor_name (current_class_type
), name
);
5747 /* Look up NAME in the current binding level and its superiors in the
5748 namespace of variables, functions and typedefs. Return a ..._DECL
5749 node of some kind representing its definition if there is only one
5750 such declaration, or return a TREE_LIST with all the overloaded
5751 definitions if there are many, or return 0 if it is undefined.
5753 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5754 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5755 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5756 Otherwise we prefer non-TYPE_DECLs.
5758 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5759 using IDENTIFIER_CLASS_VALUE. */
5762 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5764 int prefer_type
, nonclass
, namespaces_only
;
5767 tree val
= NULL_TREE
;
5769 tree from_obj
= NULL_TREE
;
5771 int val_is_implicit_typename
= 0;
5773 /* Hack: copy flag set by parser, if set. */
5774 if (only_namespace_names
)
5775 namespaces_only
= 1;
5777 if (prefer_type
== -2)
5779 extern int looking_for_typename
;
5780 tree type
= NULL_TREE
;
5783 prefer_type
= looking_for_typename
;
5785 flags
= lookup_flags (prefer_type
, namespaces_only
);
5786 /* If the next thing is '<', class templates are types. */
5787 if (looking_for_template
)
5788 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5790 /* std:: becomes :: for now. */
5791 if (got_scope
== std_node
)
5792 got_scope
= void_type_node
;
5796 else if (got_object
!= error_mark_node
)
5801 if (type
== error_mark_node
)
5802 return error_mark_node
;
5803 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5804 type
= TREE_TYPE (type
);
5807 type
= complete_type (type
);
5809 if (TREE_CODE (type
) == VOID_TYPE
)
5810 type
= global_namespace
;
5811 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5813 struct tree_binding b
;
5814 val
= binding_init (&b
);
5815 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5817 val
= select_decl (val
, flags
);
5819 else if (! IS_AGGR_TYPE (type
)
5820 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5821 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5822 || TREE_CODE (type
) == TYPENAME_TYPE
)
5823 /* Someone else will give an error about this if needed. */
5825 else if (type
== current_class_type
)
5826 val
= IDENTIFIER_CLASS_VALUE (name
);
5828 val
= lookup_member (type
, name
, 0, prefer_type
);
5835 else if (got_object
&& val
)
5840 flags
= lookup_flags (prefer_type
, namespaces_only
);
5841 /* If we're not parsing, we need to complain. */
5842 flags
|= LOOKUP_COMPLAIN
;
5845 /* First, look in non-namespace scopes. */
5846 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5850 if (!LOCAL_BINDING_P (t
) && nonclass
)
5851 /* We're not looking for class-scoped bindings, so keep going. */
5854 /* If this is the kind of thing we're looking for, we're done. */
5855 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5856 binding
= BINDING_VALUE (t
);
5857 else if ((flags
& LOOKUP_PREFER_TYPES
)
5858 && qualify_lookup (BINDING_TYPE (t
), flags
))
5859 binding
= BINDING_TYPE (t
);
5861 binding
= NULL_TREE
;
5864 && (!val
|| !(TREE_CODE (binding
) == TYPE_DECL
5865 && IMPLICIT_TYPENAME_P (TREE_TYPE (binding
)))))
5867 if (val_is_implicit_typename
&& !yylex
)
5868 warn_about_implicit_typename_lookup (val
, binding
);
5870 val_is_implicit_typename
5871 = (TREE_CODE (val
) == TYPE_DECL
5872 && IMPLICIT_TYPENAME_P (TREE_TYPE (val
)));
5873 if (!val_is_implicit_typename
)
5878 /* Now lookup in namespace scopes. */
5879 if (!val
|| val_is_implicit_typename
)
5881 t
= unqualified_namespace_lookup (name
, flags
);
5884 if (val_is_implicit_typename
&& !yylex
)
5885 warn_about_implicit_typename_lookup (val
, t
);
5893 /* This should only warn about types used in qualified-ids. */
5894 if (from_obj
&& from_obj
!= val
)
5896 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5897 && TREE_CODE (val
) == TYPE_DECL
5898 && TREE_TYPE (from_obj
) != TREE_TYPE (val
))
5900 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5901 name
, got_object
, TREE_TYPE (from_obj
));
5902 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
5906 /* We don't change val to from_obj if got_object depends on
5907 template parms because that breaks implicit typename for
5908 destructor calls. */
5909 if (! uses_template_parms (got_object
))
5913 /* If we have a single function from a using decl, pull it out. */
5914 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5915 val
= OVL_FUNCTION (val
);
5924 lookup_name_nonclass (name
)
5927 return lookup_name_real (name
, 0, 1, 0);
5931 lookup_function_nonclass (name
, args
)
5935 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
5939 lookup_name_namespace_only (name
)
5942 /* type-or-namespace, nonclass, namespace_only */
5943 return lookup_name_real (name
, 1, 1, 1);
5947 lookup_name (name
, prefer_type
)
5951 return lookup_name_real (name
, prefer_type
, 0, 0);
5954 /* Similar to `lookup_name' but look only in the innermost non-class
5958 lookup_name_current_level (name
)
5961 struct binding_level
*b
;
5964 b
= current_binding_level
;
5965 while (b
->parm_flag
== 2)
5970 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
5972 /* extern "C" function() */
5973 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
5976 else if (IDENTIFIER_BINDING (name
)
5977 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
5981 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
5982 return IDENTIFIER_VALUE (name
);
5994 /* Like lookup_name_current_level, but for types. */
5997 lookup_type_current_level (name
)
6000 register tree t
= NULL_TREE
;
6002 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
6004 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
6005 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
6007 struct binding_level
*b
= current_binding_level
;
6010 if (purpose_member (name
, b
->type_shadowed
))
6011 return REAL_IDENTIFIER_TYPE_VALUE (name
);
6023 begin_only_namespace_names ()
6025 only_namespace_names
= 1;
6029 end_only_namespace_names ()
6031 only_namespace_names
= 0;
6034 /* Arrange for the user to get a source line number, even when the
6035 compiler is going down in flames, so that she at least has a
6036 chance of working around problems in the compiler. We used to
6037 call error(), but that let the segmentation fault continue
6038 through; now, it's much more passive by asking them to send the
6039 maintainers mail about the problem. */
6043 int sig ATTRIBUTE_UNUSED
;
6045 signal (SIGSEGV
, SIG_DFL
);
6047 signal (SIGIOT
, SIG_DFL
);
6050 signal (SIGILL
, SIG_DFL
);
6053 signal (SIGABRT
, SIG_DFL
);
6056 signal (SIGBUS
, SIG_DFL
);
6058 my_friendly_abort (0);
6062 /* Unused -- brendan 970107 */
6063 /* Array for holding types considered "built-in". These types
6064 are output in the module in which `main' is defined. */
6065 static tree
*builtin_type_tdescs_arr
;
6066 static int builtin_type_tdescs_len
, builtin_type_tdescs_max
;
6069 /* Push the declarations of builtin types into the namespace.
6070 RID_INDEX, if < RID_MAX is the index of the builtin type
6071 in the array RID_POINTERS. NAME is the name used when looking
6072 up the builtin type. TYPE is the _TYPE node for the builtin type. */
6075 record_builtin_type (rid_index
, name
, type
)
6080 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
6081 tree tdecl
= NULL_TREE
;
6083 if ((int) rid_index
< (int) RID_MAX
)
6084 rname
= ridpointers
[(int) rid_index
];
6086 tname
= get_identifier (name
);
6088 TYPE_BUILT_IN (type
) = 1;
6092 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
6093 set_identifier_type_value (tname
, NULL_TREE
);
6094 if ((int) rid_index
< (int) RID_MAX
)
6095 /* Built-in types live in the global namespace. */
6096 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
6098 if (rname
!= NULL_TREE
)
6100 if (tname
!= NULL_TREE
)
6102 set_identifier_type_value (rname
, NULL_TREE
);
6103 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
6107 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
6108 set_identifier_type_value (rname
, NULL_TREE
);
6113 /* Record one of the standard Java types.
6114 * Declare it as having the given NAME.
6115 * If SIZE > 0, it is the size of one of the integral types;
6116 * otherwise it is the negative of the size of one of the other types. */
6119 record_builtin_java_type (name
, size
)
6125 type
= make_signed_type (size
);
6126 else if (size
> -32)
6127 { /* "__java_char" or ""__java_boolean". */
6128 type
= make_unsigned_type (-size
);
6129 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
6132 { /* "__java_float" or ""__java_double". */
6133 type
= make_node (REAL_TYPE
);
6134 TYPE_PRECISION (type
) = - size
;
6137 record_builtin_type (RID_MAX
, name
, type
);
6138 decl
= TYPE_NAME (type
);
6140 /* Suppress generate debug symbol entries for these types,
6141 since for normal C++ they are just clutter.
6142 However, push_lang_context undoes this if extern "Java" is seen. */
6143 DECL_IGNORED_P (decl
) = 1;
6145 TYPE_FOR_JAVA (type
) = 1;
6149 /* Push a type into the namespace so that the back-ends ignore it. */
6152 record_unknown_type (type
, name
)
6156 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
6157 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
6158 DECL_IGNORED_P (decl
) = 1;
6159 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
6160 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
6161 TYPE_ALIGN (type
) = 1;
6162 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
6165 /* Push overloaded decl, in global scope, with one argument so it
6166 can be used as a callback from define_function. */
6169 push_overloaded_decl_1 (x
)
6172 push_overloaded_decl (x
, PUSH_GLOBAL
);
6179 auto_function (name
, type
, code
)
6181 enum built_in_function code
;
6183 return define_function
6184 (IDENTIFIER_POINTER (name
), type
, code
, push_overloaded_decl_1
,
6185 IDENTIFIER_POINTER (build_decl_overload (name
, TYPE_ARG_TYPES (type
),
6189 /* Create the predefined scalar types of C,
6190 and some nodes representing standard constants (0, 1, (void *)0).
6191 Initialize the global binding level.
6192 Make definitions for built-in primitive functions. */
6195 init_decl_processing ()
6197 register tree endlink
, int_endlink
, double_endlink
, unsigned_endlink
;
6199 /* Data type of memcpy. */
6200 tree memcpy_ftype
, strlen_ftype
;
6201 int wchar_type_size
;
6203 tree array_domain_type
;
6204 tree vb_off_identifier
= NULL_TREE
;
6205 /* Function type `char *(char *, char *)' and similar ones */
6206 tree string_ftype_ptr_ptr
, int_ftype_string_string
;
6207 tree sizetype_endlink
;
6208 tree ptr_ftype
, ptr_ftype_unsigned
, ptr_ftype_sizetype
;
6209 tree void_ftype
, void_ftype_int
, void_ftype_ptr
;
6211 /* Have to make these distinct before we try using them. */
6212 lang_name_cplusplus
= get_identifier ("C++");
6213 lang_name_c
= get_identifier ("C");
6214 lang_name_java
= get_identifier ("Java");
6216 /* Enter the global namespace. */
6217 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
6218 my_friendly_assert (current_lang_name
== NULL_TREE
, 375);
6219 current_lang_name
= lang_name_cplusplus
;
6220 push_namespace (get_identifier ("::"));
6221 global_namespace
= current_namespace
;
6222 current_lang_name
= NULL_TREE
;
6224 if (flag_strict_prototype
== 2)
6225 flag_strict_prototype
= pedantic
;
6226 if (! flag_permissive
&& ! pedantic
)
6227 flag_pedantic_errors
= 1;
6229 strict_prototypes_lang_c
= flag_strict_prototype
;
6232 current_lang_name
= lang_name_c
;
6234 current_function_decl
= NULL_TREE
;
6235 named_labels
= NULL_TREE
;
6236 named_label_uses
= NULL
;
6237 current_binding_level
= NULL_BINDING_LEVEL
;
6238 free_binding_level
= NULL_BINDING_LEVEL
;
6240 /* Because most segmentation signals can be traced back into user
6241 code, catch them and at least give the user a chance of working
6242 around compiler bugs. */
6243 signal (SIGSEGV
, signal_catch
);
6245 /* We will also catch aborts in the back-end through signal_catch and
6246 give the user a chance to see where the error might be, and to defeat
6247 aborts in the back-end when there have been errors previously in their
6250 signal (SIGIOT
, signal_catch
);
6253 signal (SIGILL
, signal_catch
);
6256 signal (SIGABRT
, signal_catch
);
6259 signal (SIGBUS
, signal_catch
);
6262 gcc_obstack_init (&decl_obstack
);
6264 /* Must lay these out before anything else gets laid out. */
6265 error_mark_node
= make_node (ERROR_MARK
);
6266 TREE_PERMANENT (error_mark_node
) = 1;
6267 TREE_TYPE (error_mark_node
) = error_mark_node
;
6268 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6269 TREE_TYPE (error_mark_list
) = error_mark_node
;
6271 /* Make the binding_level structure for global names. */
6273 global_binding_level
= current_binding_level
;
6274 /* The global level is the namespace level of ::. */
6275 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6276 declare_namespace_level ();
6278 this_identifier
= get_identifier (THIS_NAME
);
6279 in_charge_identifier
= get_identifier (IN_CHARGE_NAME
);
6280 ctor_identifier
= get_identifier (CTOR_NAME
);
6281 dtor_identifier
= get_identifier (DTOR_NAME
);
6282 pfn_identifier
= get_identifier (VTABLE_PFN_NAME
);
6283 index_identifier
= get_identifier (VTABLE_INDEX_NAME
);
6284 delta_identifier
= get_identifier (VTABLE_DELTA_NAME
);
6285 delta2_identifier
= get_identifier (VTABLE_DELTA2_NAME
);
6286 pfn_or_delta2_identifier
= get_identifier ("__pfn_or_delta2");
6287 if (flag_handle_signatures
)
6289 tag_identifier
= get_identifier (SIGTABLE_TAG_NAME
);
6290 vb_off_identifier
= get_identifier (SIGTABLE_VB_OFF_NAME
);
6291 vt_off_identifier
= get_identifier (SIGTABLE_VT_OFF_NAME
);
6294 /* Define `int' and `char' first so that dbx will output them first. */
6296 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
6297 record_builtin_type (RID_INT
, NULL_PTR
, integer_type_node
);
6299 /* Define `char', which is like either `signed char' or `unsigned char'
6300 but not the same as either. */
6304 ? make_signed_type (CHAR_TYPE_SIZE
)
6305 : make_unsigned_type (CHAR_TYPE_SIZE
));
6306 record_builtin_type (RID_CHAR
, "char", char_type_node
);
6308 /* `signed' is the same as `int' */
6309 record_builtin_type (RID_SIGNED
, NULL_PTR
, integer_type_node
);
6311 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
6312 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
6314 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
6315 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
6317 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
6318 record_builtin_type (RID_MAX
, "long unsigned int", long_unsigned_type_node
);
6319 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
6321 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
6322 record_builtin_type (RID_MAX
, "long long int", long_long_integer_type_node
);
6324 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
6325 record_builtin_type (RID_MAX
, "long long unsigned int",
6326 long_long_unsigned_type_node
);
6327 record_builtin_type (RID_MAX
, "long long unsigned",
6328 long_long_unsigned_type_node
);
6330 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
6331 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
6332 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
6333 record_builtin_type (RID_MAX
, "short unsigned int", short_unsigned_type_node
);
6334 record_builtin_type (RID_MAX
, "unsigned short", short_unsigned_type_node
);
6336 /* `unsigned long' is the standard type for sizeof.
6337 Note that stddef.h uses `unsigned long',
6338 and this must agree, even if long and int are the same size. */
6340 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE
))));
6343 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE
)));
6345 /* Define both `signed char' and `unsigned char'. */
6346 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
6347 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
6348 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
6349 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
6351 /* These are types that type_for_size and type_for_mode use. */
6352 intQI_type_node
= make_signed_type (GET_MODE_BITSIZE (QImode
));
6353 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intQI_type_node
));
6354 intHI_type_node
= make_signed_type (GET_MODE_BITSIZE (HImode
));
6355 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intHI_type_node
));
6356 intSI_type_node
= make_signed_type (GET_MODE_BITSIZE (SImode
));
6357 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intSI_type_node
));
6358 intDI_type_node
= make_signed_type (GET_MODE_BITSIZE (DImode
));
6359 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intDI_type_node
));
6360 #if HOST_BITS_PER_WIDE_INT >= 64
6361 intTI_type_node
= make_signed_type (GET_MODE_BITSIZE (TImode
));
6362 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__int128_t"), intTI_type_node
));
6364 unsigned_intQI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (QImode
));
6365 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intQI_type_node
));
6366 unsigned_intHI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (HImode
));
6367 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intHI_type_node
));
6368 unsigned_intSI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (SImode
));
6369 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intSI_type_node
));
6370 unsigned_intDI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (DImode
));
6371 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intDI_type_node
));
6372 #if HOST_BITS_PER_WIDE_INT >= 64
6373 unsigned_intTI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (TImode
));
6374 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__uint128_t"), unsigned_intTI_type_node
));
6377 float_type_node
= make_node (REAL_TYPE
);
6378 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
6379 record_builtin_type (RID_FLOAT
, NULL_PTR
, float_type_node
);
6380 layout_type (float_type_node
);
6382 double_type_node
= make_node (REAL_TYPE
);
6383 if (flag_short_double
)
6384 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
6386 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
6387 record_builtin_type (RID_DOUBLE
, NULL_PTR
, double_type_node
);
6388 layout_type (double_type_node
);
6390 long_double_type_node
= make_node (REAL_TYPE
);
6391 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
6392 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
6393 layout_type (long_double_type_node
);
6395 complex_integer_type_node
= make_node (COMPLEX_TYPE
);
6396 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex int"),
6397 complex_integer_type_node
));
6398 TREE_TYPE (complex_integer_type_node
) = integer_type_node
;
6399 layout_type (complex_integer_type_node
);
6401 complex_float_type_node
= make_node (COMPLEX_TYPE
);
6402 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex float"),
6403 complex_float_type_node
));
6404 TREE_TYPE (complex_float_type_node
) = float_type_node
;
6405 layout_type (complex_float_type_node
);
6407 complex_double_type_node
= make_node (COMPLEX_TYPE
);
6408 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex double"),
6409 complex_double_type_node
));
6410 TREE_TYPE (complex_double_type_node
) = double_type_node
;
6411 layout_type (complex_double_type_node
);
6413 complex_long_double_type_node
= make_node (COMPLEX_TYPE
);
6414 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
6415 complex_long_double_type_node
));
6416 TREE_TYPE (complex_long_double_type_node
) = long_double_type_node
;
6417 layout_type (complex_long_double_type_node
);
6419 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6420 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6421 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6422 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6423 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6424 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6425 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6426 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6428 integer_zero_node
= build_int_2 (0, 0);
6429 TREE_TYPE (integer_zero_node
) = integer_type_node
;
6430 integer_one_node
= build_int_2 (1, 0);
6431 TREE_TYPE (integer_one_node
) = integer_type_node
;
6432 integer_two_node
= build_int_2 (2, 0);
6433 TREE_TYPE (integer_two_node
) = integer_type_node
;
6434 integer_three_node
= build_int_2 (3, 0);
6435 TREE_TYPE (integer_three_node
) = integer_type_node
;
6437 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6438 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6439 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6440 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6441 TYPE_PRECISION (boolean_type_node
) = 1;
6442 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6443 boolean_false_node
= build_int_2 (0, 0);
6444 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6445 boolean_true_node
= build_int_2 (1, 0);
6446 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6448 /* These are needed by stor-layout.c. */
6449 size_zero_node
= size_int (0);
6450 size_one_node
= size_int (1);
6452 signed_size_zero_node
= build_int_2 (0, 0);
6453 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6455 void_type_node
= make_node (VOID_TYPE
);
6456 record_builtin_type (RID_VOID
, NULL_PTR
, void_type_node
);
6457 layout_type (void_type_node
); /* Uses integer_zero_node. */
6458 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
6459 TREE_PARMLIST (void_list_node
) = 1;
6461 null_pointer_node
= build_int_2 (0, 0);
6462 TREE_TYPE (null_pointer_node
) = build_pointer_type (void_type_node
);
6463 layout_type (TREE_TYPE (null_pointer_node
));
6465 /* Used for expressions that do nothing, but are not errors. */
6466 void_zero_node
= build_int_2 (0, 0);
6467 TREE_TYPE (void_zero_node
) = void_type_node
;
6469 string_type_node
= build_pointer_type (char_type_node
);
6470 const_string_type_node
6471 = build_pointer_type (build_qualified_type (char_type_node
,
6474 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
6477 /* Make a type to be the domain of a few array types
6478 whose domains don't really matter.
6479 200 is small enough that it always fits in size_t
6480 and large enough that it can hold most function names for the
6481 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
6482 array_domain_type
= build_index_type (build_int_2 (200, 0));
6484 /* Make a type for arrays of characters.
6485 With luck nothing will ever really depend on the length of this
6487 char_array_type_node
6488 = build_array_type (char_type_node
, array_domain_type
);
6489 /* Likewise for arrays of ints. */
6491 = build_array_type (integer_type_node
, array_domain_type
);
6493 /* This is just some anonymous class type. Nobody should ever
6494 need to look inside this envelope. */
6495 class_star_type_node
= build_pointer_type (make_lang_type (RECORD_TYPE
));
6497 default_function_type
6498 = build_function_type (integer_type_node
, NULL_TREE
);
6500 ptr_type_node
= build_pointer_type (void_type_node
);
6502 = build_pointer_type (build_qualified_type (void_type_node
,
6505 record_builtin_type (RID_MAX
, NULL_PTR
, ptr_type_node
);
6507 endlink
= void_list_node
;
6508 int_endlink
= tree_cons (NULL_TREE
, integer_type_node
, endlink
);
6509 double_endlink
= tree_cons (NULL_TREE
, double_type_node
, endlink
);
6510 unsigned_endlink
= tree_cons (NULL_TREE
, unsigned_type_node
, endlink
);
6512 ptr_ftype
= build_function_type (ptr_type_node
, NULL_TREE
);
6513 ptr_ftype_unsigned
= build_function_type (ptr_type_node
, unsigned_endlink
);
6514 sizetype_endlink
= tree_cons (NULL_TREE
, sizetype
, endlink
);
6515 /* We realloc here because sizetype could be int or unsigned. S'ok. */
6516 ptr_ftype_sizetype
= build_function_type (ptr_type_node
, sizetype_endlink
);
6518 void_ftype
= build_function_type (void_type_node
, endlink
);
6519 void_ftype_int
= build_function_type (void_type_node
, int_endlink
);
6521 = build_function_type (void_type_node
,
6522 tree_cons (NULL_TREE
, ptr_type_node
, endlink
));
6524 = build_exception_variant (void_ftype_ptr
,
6525 tree_cons (NULL_TREE
, NULL_TREE
, NULL_TREE
));
6528 = build_function_type (float_type_node
,
6529 tree_cons (NULL_TREE
, float_type_node
, endlink
));
6532 = build_function_type (double_type_node
, double_endlink
);
6534 ldouble_ftype_ldouble
6535 = build_function_type (long_double_type_node
,
6536 tree_cons (NULL_TREE
, long_double_type_node
,
6539 double_ftype_double_double
6540 = build_function_type (double_type_node
,
6541 tree_cons (NULL_TREE
, double_type_node
,
6545 = build_function_type (integer_type_node
, int_endlink
);
6548 = build_function_type (long_integer_type_node
,
6549 tree_cons (NULL_TREE
, long_integer_type_node
,
6552 int_ftype_cptr_cptr_sizet
6553 = build_function_type (integer_type_node
,
6554 tree_cons (NULL_TREE
, const_ptr_type_node
,
6555 tree_cons (NULL_TREE
, const_ptr_type_node
,
6556 tree_cons (NULL_TREE
,
6560 string_ftype_ptr_ptr
/* strcpy prototype */
6561 = build_function_type (string_type_node
,
6562 tree_cons (NULL_TREE
, string_type_node
,
6563 tree_cons (NULL_TREE
,
6564 const_string_type_node
,
6567 int_ftype_string_string
/* strcmp prototype */
6568 = build_function_type (integer_type_node
,
6569 tree_cons (NULL_TREE
, const_string_type_node
,
6570 tree_cons (NULL_TREE
,
6571 const_string_type_node
,
6574 strlen_ftype
/* strlen prototype */
6575 = build_function_type (sizetype
,
6576 tree_cons (NULL_TREE
, const_string_type_node
,
6579 memcpy_ftype
/* memcpy prototype */
6580 = build_function_type (ptr_type_node
,
6581 tree_cons (NULL_TREE
, ptr_type_node
,
6582 tree_cons (NULL_TREE
, const_ptr_type_node
,
6583 sizetype_endlink
)));
6585 if (flag_huge_objects
)
6586 delta_type_node
= long_integer_type_node
;
6588 delta_type_node
= short_integer_type_node
;
6590 builtin_function ("__builtin_constant_p", default_function_type
,
6591 BUILT_IN_CONSTANT_P
, NULL_PTR
);
6593 builtin_return_address_fndecl
6594 = builtin_function ("__builtin_return_address", ptr_ftype_unsigned
,
6595 BUILT_IN_RETURN_ADDRESS
, NULL_PTR
);
6597 builtin_function ("__builtin_frame_address", ptr_ftype_unsigned
,
6598 BUILT_IN_FRAME_ADDRESS
, NULL_PTR
);
6600 builtin_function ("__builtin_alloca", ptr_ftype_sizetype
,
6601 BUILT_IN_ALLOCA
, "alloca");
6602 builtin_function ("__builtin_ffs", int_ftype_int
, BUILT_IN_FFS
, NULL_PTR
);
6603 /* Define alloca, ffs as builtins.
6604 Declare _exit just to mark it as volatile. */
6605 if (! flag_no_builtin
&& !flag_no_nonansi_builtin
)
6607 temp
= builtin_function ("alloca", ptr_ftype_sizetype
,
6608 BUILT_IN_ALLOCA
, NULL_PTR
);
6609 /* Suppress error if redefined as a non-function. */
6610 DECL_BUILT_IN_NONANSI (temp
) = 1;
6611 temp
= builtin_function ("ffs", int_ftype_int
, BUILT_IN_FFS
, NULL_PTR
);
6612 /* Suppress error if redefined as a non-function. */
6613 DECL_BUILT_IN_NONANSI (temp
) = 1;
6614 temp
= builtin_function ("_exit", void_ftype_int
,
6615 NOT_BUILT_IN
, NULL_PTR
);
6616 TREE_THIS_VOLATILE (temp
) = 1;
6617 TREE_SIDE_EFFECTS (temp
) = 1;
6618 /* Suppress error if redefined as a non-function. */
6619 DECL_BUILT_IN_NONANSI (temp
) = 1;
6622 builtin_function ("__builtin_abs", int_ftype_int
, BUILT_IN_ABS
, NULL_PTR
);
6623 builtin_function ("__builtin_fabsf", float_ftype_float
, BUILT_IN_FABS
,
6625 builtin_function ("__builtin_fabs", double_ftype_double
, BUILT_IN_FABS
,
6627 builtin_function ("__builtin_fabsl", ldouble_ftype_ldouble
, BUILT_IN_FABS
,
6629 builtin_function ("__builtin_labs", long_ftype_long
,
6630 BUILT_IN_LABS
, NULL_PTR
);
6631 builtin_function ("__builtin_saveregs", ptr_ftype
,
6632 BUILT_IN_SAVEREGS
, NULL_PTR
);
6633 builtin_function ("__builtin_classify_type", default_function_type
,
6634 BUILT_IN_CLASSIFY_TYPE
, NULL_PTR
);
6635 builtin_function ("__builtin_next_arg", ptr_ftype
,
6636 BUILT_IN_NEXT_ARG
, NULL_PTR
);
6637 builtin_function ("__builtin_args_info", int_ftype_int
,
6638 BUILT_IN_ARGS_INFO
, NULL_PTR
);
6639 builtin_function ("__builtin_setjmp",
6640 build_function_type (integer_type_node
,
6641 tree_cons (NULL_TREE
, ptr_type_node
,
6643 BUILT_IN_SETJMP
, NULL_PTR
);
6644 builtin_function ("__builtin_longjmp",
6645 build_function_type (integer_type_node
,
6646 tree_cons (NULL_TREE
, ptr_type_node
,
6647 tree_cons (NULL_TREE
,
6650 BUILT_IN_LONGJMP
, NULL_PTR
);
6652 /* Untyped call and return. */
6653 builtin_function ("__builtin_apply_args", ptr_ftype
,
6654 BUILT_IN_APPLY_ARGS
, NULL_PTR
);
6656 temp
= tree_cons (NULL_TREE
,
6657 build_pointer_type (build_function_type (void_type_node
,
6659 tree_cons (NULL_TREE
, ptr_ftype_sizetype
, NULL_TREE
));
6660 builtin_function ("__builtin_apply",
6661 build_function_type (ptr_type_node
, temp
),
6662 BUILT_IN_APPLY
, NULL_PTR
);
6663 builtin_function ("__builtin_return", void_ftype_ptr
,
6664 BUILT_IN_RETURN
, NULL_PTR
);
6666 /* Currently under experimentation. */
6667 builtin_function ("__builtin_memcpy", memcpy_ftype
,
6668 BUILT_IN_MEMCPY
, "memcpy");
6669 builtin_function ("__builtin_memcmp", int_ftype_cptr_cptr_sizet
,
6670 BUILT_IN_MEMCMP
, "memcmp");
6671 builtin_function ("__builtin_strcmp", int_ftype_string_string
,
6672 BUILT_IN_STRCMP
, "strcmp");
6673 builtin_function ("__builtin_strcpy", string_ftype_ptr_ptr
,
6674 BUILT_IN_STRCPY
, "strcpy");
6675 builtin_function ("__builtin_strlen", strlen_ftype
,
6676 BUILT_IN_STRLEN
, "strlen");
6677 builtin_function ("__builtin_sqrtf", float_ftype_float
,
6678 BUILT_IN_FSQRT
, "sqrtf");
6679 builtin_function ("__builtin_fsqrt", double_ftype_double
,
6680 BUILT_IN_FSQRT
, NULL_PTR
);
6681 builtin_function ("__builtin_sqrtl", ldouble_ftype_ldouble
,
6682 BUILT_IN_FSQRT
, "sqrtl");
6683 builtin_function ("__builtin_sinf", float_ftype_float
,
6684 BUILT_IN_SIN
, "sinf");
6685 builtin_function ("__builtin_sin", double_ftype_double
,
6686 BUILT_IN_SIN
, "sin");
6687 builtin_function ("__builtin_sinl", ldouble_ftype_ldouble
,
6688 BUILT_IN_SIN
, "sinl");
6689 builtin_function ("__builtin_cosf", float_ftype_float
,
6690 BUILT_IN_COS
, "cosf");
6691 builtin_function ("__builtin_cos", double_ftype_double
,
6692 BUILT_IN_COS
, "cos");
6693 builtin_function ("__builtin_cosl", ldouble_ftype_ldouble
,
6694 BUILT_IN_COS
, "cosl");
6696 if (!flag_no_builtin
)
6698 builtin_function ("abs", int_ftype_int
, BUILT_IN_ABS
, NULL_PTR
);
6699 builtin_function ("fabs", double_ftype_double
, BUILT_IN_FABS
, NULL_PTR
);
6700 builtin_function ("labs", long_ftype_long
, BUILT_IN_LABS
, NULL_PTR
);
6701 builtin_function ("fabsf", float_ftype_float
, BUILT_IN_FABS
, NULL_PTR
);
6702 builtin_function ("fabsl", ldouble_ftype_ldouble
, BUILT_IN_FABS
,
6704 builtin_function ("memcpy", memcpy_ftype
, BUILT_IN_MEMCPY
, NULL_PTR
);
6705 builtin_function ("memcmp", int_ftype_cptr_cptr_sizet
, BUILT_IN_MEMCMP
,
6707 builtin_function ("strcmp", int_ftype_string_string
, BUILT_IN_STRCMP
,
6709 builtin_function ("strcpy", string_ftype_ptr_ptr
, BUILT_IN_STRCPY
,
6711 builtin_function ("strlen", strlen_ftype
, BUILT_IN_STRLEN
, NULL_PTR
);
6712 builtin_function ("sqrtf", float_ftype_float
, BUILT_IN_FSQRT
, NULL_PTR
);
6713 builtin_function ("sqrt", double_ftype_double
, BUILT_IN_FSQRT
, NULL_PTR
);
6714 builtin_function ("sqrtl", ldouble_ftype_ldouble
, BUILT_IN_FSQRT
,
6716 builtin_function ("sinf", float_ftype_float
, BUILT_IN_SIN
, NULL_PTR
);
6717 builtin_function ("sin", double_ftype_double
, BUILT_IN_SIN
, NULL_PTR
);
6718 builtin_function ("sinl", ldouble_ftype_ldouble
, BUILT_IN_SIN
, NULL_PTR
);
6719 builtin_function ("cosf", float_ftype_float
, BUILT_IN_COS
, NULL_PTR
);
6720 builtin_function ("cos", double_ftype_double
, BUILT_IN_COS
, NULL_PTR
);
6721 builtin_function ("cosl", ldouble_ftype_ldouble
, BUILT_IN_COS
, NULL_PTR
);
6723 /* Declare these functions volatile
6724 to avoid spurious "control drops through" warnings. */
6725 temp
= builtin_function ("abort", void_ftype
,
6726 NOT_BUILT_IN
, NULL_PTR
);
6727 TREE_THIS_VOLATILE (temp
) = 1;
6728 TREE_SIDE_EFFECTS (temp
) = 1;
6729 /* Well, these are actually ANSI, but we can't set DECL_BUILT_IN on
6731 DECL_BUILT_IN_NONANSI (temp
) = 1;
6732 temp
= builtin_function ("exit", void_ftype_int
,
6733 NOT_BUILT_IN
, NULL_PTR
);
6734 TREE_THIS_VOLATILE (temp
) = 1;
6735 TREE_SIDE_EFFECTS (temp
) = 1;
6736 DECL_BUILT_IN_NONANSI (temp
) = 1;
6740 /* Support for these has not been written in either expand_builtin
6741 or build_function_call. */
6742 builtin_function ("__builtin_div", default_ftype
, BUILT_IN_DIV
, NULL_PTR
);
6743 builtin_function ("__builtin_ldiv", default_ftype
, BUILT_IN_LDIV
, NULL_PTR
);
6744 builtin_function ("__builtin_ffloor", double_ftype_double
, BUILT_IN_FFLOOR
,
6746 builtin_function ("__builtin_fceil", double_ftype_double
, BUILT_IN_FCEIL
,
6748 builtin_function ("__builtin_fmod", double_ftype_double_double
,
6749 BUILT_IN_FMOD
, NULL_PTR
);
6750 builtin_function ("__builtin_frem", double_ftype_double_double
,
6751 BUILT_IN_FREM
, NULL_PTR
);
6752 builtin_function ("__builtin_memset", ptr_ftype_ptr_int_int
,
6753 BUILT_IN_MEMSET
, NULL_PTR
);
6754 builtin_function ("__builtin_getexp", double_ftype_double
, BUILT_IN_GETEXP
,
6756 builtin_function ("__builtin_getman", double_ftype_double
, BUILT_IN_GETMAN
,
6760 /* C++ extensions */
6762 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6763 record_unknown_type (unknown_type_node
, "unknown type");
6765 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6766 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6768 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6770 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6772 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6773 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6775 /* This is for handling opaque types in signatures. */
6776 opaque_type_node
= copy_node (ptr_type_node
);
6777 TYPE_MAIN_VARIANT (opaque_type_node
) = opaque_type_node
;
6778 record_builtin_type (RID_MAX
, 0, opaque_type_node
);
6780 /* This is special for C++ so functions can be overloaded. */
6782 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (WCHAR_TYPE
)));
6783 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
6784 signed_wchar_type_node
= make_signed_type (wchar_type_size
);
6785 unsigned_wchar_type_node
= make_unsigned_type (wchar_type_size
);
6787 = TREE_UNSIGNED (wchar_type_node
)
6788 ? unsigned_wchar_type_node
6789 : signed_wchar_type_node
;
6790 record_builtin_type (RID_WCHAR
, "__wchar_t", wchar_type_node
);
6792 /* Artificial declaration of wchar_t -- can be bashed */
6793 wchar_decl_node
= build_decl (TYPE_DECL
, get_identifier ("wchar_t"),
6795 pushdecl (wchar_decl_node
);
6797 /* This is for wide string constants. */
6798 wchar_array_type_node
6799 = build_array_type (wchar_type_node
, array_domain_type
);
6801 if (flag_vtable_thunks
)
6803 /* Make sure we get a unique function type, so we can give
6804 its pointer type a name. (This wins for gdb.) */
6805 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6806 TREE_TYPE (vfunc_type
) = integer_type_node
;
6807 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6808 layout_type (vfunc_type
);
6810 vtable_entry_type
= build_pointer_type (vfunc_type
);
6814 vtable_entry_type
= make_lang_type (RECORD_TYPE
);
6815 fields
[0] = build_lang_field_decl (FIELD_DECL
, delta_identifier
,
6817 fields
[1] = build_lang_field_decl (FIELD_DECL
, index_identifier
,
6819 fields
[2] = build_lang_field_decl (FIELD_DECL
, pfn_identifier
,
6821 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6824 /* Make this part of an invisible union. */
6825 fields
[3] = copy_node (fields
[2]);
6826 TREE_TYPE (fields
[3]) = delta_type_node
;
6827 DECL_NAME (fields
[3]) = delta2_identifier
;
6828 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6829 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6830 TREE_UNSIGNED (fields
[3]) = 0;
6831 TREE_CHAIN (fields
[2]) = fields
[3];
6832 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6835 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6838 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6839 layout_type (vtbl_type_node
);
6840 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6841 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6842 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6843 layout_type (vtbl_ptr_type_node
);
6844 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6846 /* Simplify life by making a "sigtable_entry_type". Give its
6847 fields names so that the debugger can use them. */
6849 if (flag_handle_signatures
)
6851 sigtable_entry_type
= make_lang_type (RECORD_TYPE
);
6852 fields
[0] = build_lang_field_decl (FIELD_DECL
, tag_identifier
,
6854 fields
[1] = build_lang_field_decl (FIELD_DECL
, vb_off_identifier
,
6856 fields
[2] = build_lang_field_decl (FIELD_DECL
, delta_identifier
,
6858 fields
[3] = build_lang_field_decl (FIELD_DECL
, index_identifier
,
6860 fields
[4] = build_lang_field_decl (FIELD_DECL
, pfn_identifier
,
6863 /* Set the alignment to the max of the alignment of ptr_type_node and
6864 delta_type_node. Double alignment wastes a word on the Sparc. */
6865 finish_builtin_type (sigtable_entry_type
, SIGTABLE_PTR_TYPE
, fields
, 4,
6866 (TYPE_ALIGN (ptr_type_node
) > TYPE_ALIGN (delta_type_node
))
6870 /* Make this part of an invisible union. */
6871 fields
[5] = copy_node (fields
[4]);
6872 TREE_TYPE (fields
[5]) = delta_type_node
;
6873 DECL_NAME (fields
[5]) = vt_off_identifier
;
6874 DECL_MODE (fields
[5]) = TYPE_MODE (delta_type_node
);
6875 DECL_SIZE (fields
[5]) = TYPE_SIZE (delta_type_node
);
6876 TREE_UNSIGNED (fields
[5]) = 0;
6877 TREE_CHAIN (fields
[4]) = fields
[5];
6879 sigtable_entry_type
= build_qualified_type (sigtable_entry_type
,
6881 record_builtin_type (RID_MAX
, SIGTABLE_PTR_TYPE
, sigtable_entry_type
);
6884 std_node
= build_decl (NAMESPACE_DECL
,
6885 get_identifier (flag_honor_std
? "fake std":"std"),
6887 pushdecl (std_node
);
6889 global_type_node
= make_node (LANG_TYPE
);
6890 record_unknown_type (global_type_node
, "global type");
6893 current_lang_name
= lang_name_cplusplus
;
6896 tree bad_alloc_type_node
, newtype
, deltype
;
6898 push_namespace (get_identifier ("std"));
6899 bad_alloc_type_node
= xref_tag
6900 (class_type_node
, get_identifier ("bad_alloc"), 1);
6903 newtype
= build_exception_variant
6904 (ptr_ftype_sizetype
, build_tree_list (NULL_TREE
, bad_alloc_type_node
));
6905 deltype
= build_exception_variant
6906 (void_ftype_ptr
, build_tree_list (NULL_TREE
, NULL_TREE
));
6907 auto_function (ansi_opname
[(int) NEW_EXPR
], newtype
, NOT_BUILT_IN
);
6908 auto_function (ansi_opname
[(int) VEC_NEW_EXPR
], newtype
, NOT_BUILT_IN
);
6909 global_delete_fndecl
6910 = auto_function (ansi_opname
[(int) DELETE_EXPR
], deltype
, NOT_BUILT_IN
);
6911 auto_function (ansi_opname
[(int) VEC_DELETE_EXPR
], deltype
, NOT_BUILT_IN
);
6915 = define_function ("__pure_virtual", void_ftype
,
6916 NOT_BUILT_IN
, 0, 0);
6918 /* Perform other language dependent initializations. */
6919 init_class_processing ();
6920 init_init_processing ();
6921 init_search_processing ();
6923 init_rtti_processing ();
6925 if (flag_exceptions
)
6926 init_exception_processing ();
6929 flag_inline_functions
= 0;
6932 if (! supports_one_only ())
6935 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6936 declare_function_name ();
6938 /* Prepare to check format strings against argument lists. */
6939 init_function_format_info ();
6941 /* Show we use EH for cleanups. */
6942 using_eh_for_cleanups ();
6944 print_error_function
= lang_print_error_function
;
6945 lang_get_alias_set
= &c_get_alias_set
;
6946 valid_lang_attribute
= cp_valid_lang_attribute
;
6948 /* Maintain consistency. Perhaps we should just complain if they
6949 say -fwritable-strings? */
6950 if (flag_writable_strings
)
6951 flag_const_strings
= 0;
6954 /* Function to print any language-specific context for an error message. */
6957 lang_print_error_function (file
)
6960 default_print_error_function (file
);
6961 maybe_print_template_context ();
6964 /* Make a definition for a builtin function named NAME and whose data type
6965 is TYPE. TYPE should be a function type with argument types.
6966 FUNCTION_CODE tells later passes how to compile calls to this function.
6967 See tree.h for its possible values.
6969 If LIBRARY_NAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6970 the name to be called if we can't opencode the function. */
6973 define_function (name
, type
, function_code
, pfn
, library_name
)
6976 enum built_in_function function_code
;
6977 void (*pfn
) PROTO((tree
));
6978 const char *library_name
;
6980 tree decl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), type
);
6981 DECL_EXTERNAL (decl
) = 1;
6982 TREE_PUBLIC (decl
) = 1;
6983 DECL_ARTIFICIAL (decl
) = 1;
6985 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6986 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
6988 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6989 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6990 function in the namespace. */
6991 if (pfn
) (*pfn
) (decl
);
6993 DECL_ASSEMBLER_NAME (decl
) = get_identifier (library_name
);
6994 make_function_rtl (decl
);
6995 if (function_code
!= NOT_BUILT_IN
)
6997 DECL_BUILT_IN (decl
) = 1;
6998 DECL_FUNCTION_CODE (decl
) = function_code
;
7003 /* When we call finish_struct for an anonymous union, we create
7004 default copy constructors and such. But, an anonymous union
7005 shouldn't have such things; this function undoes the damage to the
7006 anonymous union type T.
7008 (The reason that we create the synthesized methods is that we don't
7009 distinguish `union { int i; }' from `typedef union { int i; } U'.
7010 The first is an anonymous union; the second is just an ordinary
7014 fixup_anonymous_union (t
)
7019 /* Wipe out memory of synthesized methods */
7020 TYPE_HAS_CONSTRUCTOR (t
) = 0;
7021 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
7022 TYPE_HAS_INIT_REF (t
) = 0;
7023 TYPE_HAS_CONST_INIT_REF (t
) = 0;
7024 TYPE_HAS_ASSIGN_REF (t
) = 0;
7025 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
7027 /* Splice the implicitly generated functions out of the TYPE_METHODS
7029 q
= &TYPE_METHODS (t
);
7032 if (DECL_ARTIFICIAL (*q
))
7033 *q
= TREE_CHAIN (*q
);
7035 q
= &TREE_CHAIN (*q
);
7038 /* ANSI C++ June 5 1992 WP 9.5.3. Anonymous unions may not have
7039 function members. */
7040 if (TYPE_METHODS (t
))
7041 error ("an anonymous union cannot have function members");
7044 /* Make sure that a declaration with no declarator is well-formed, i.e.
7045 just defines a tagged type or anonymous union.
7047 Returns the type defined, if any. */
7050 check_tag_decl (declspecs
)
7054 tree ob_modifier
= NULL_TREE
;
7056 register tree t
= NULL_TREE
;
7058 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
7060 register tree value
= TREE_VALUE (link
);
7066 if (IS_AGGR_TYPE (value
) || TREE_CODE (value
) == ENUMERAL_TYPE
)
7068 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
7072 else if (value
== ridpointers
[(int) RID_FRIEND
])
7074 if (current_class_type
== NULL_TREE
7075 || current_scope () != current_class_type
)
7076 ob_modifier
= value
;
7078 else if (value
== ridpointers
[(int) RID_STATIC
]
7079 || value
== ridpointers
[(int) RID_EXTERN
]
7080 || value
== ridpointers
[(int) RID_AUTO
]
7081 || value
== ridpointers
[(int) RID_REGISTER
]
7082 || value
== ridpointers
[(int) RID_INLINE
]
7083 || value
== ridpointers
[(int) RID_VIRTUAL
]
7084 || value
== ridpointers
[(int) RID_CONST
]
7085 || value
== ridpointers
[(int) RID_VOLATILE
]
7086 || value
== ridpointers
[(int) RID_EXPLICIT
])
7087 ob_modifier
= value
;
7091 error ("multiple types in one declaration");
7093 /* Inside a class, we might be in a friend or access declaration.
7094 Until we have a good way of detecting the latter, don't warn. */
7095 if (t
== NULL_TREE
&& ! current_class_type
)
7096 pedwarn ("declaration does not declare anything");
7098 /* Check for an anonymous union. We're careful
7099 accessing TYPE_IDENTIFIER because some built-in types, like
7100 pointer-to-member types, do not have TYPE_NAME. */
7101 else if (t
&& TREE_CODE (t
) == UNION_TYPE
7103 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
7105 /* Anonymous unions are objects, so they can have specifiers. */;
7106 SET_ANON_UNION_TYPE_P (t
);
7109 else if (ob_modifier
)
7111 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
7112 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
7113 cp_error ("`%D' can only be specified for functions", ob_modifier
);
7114 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
7115 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
7116 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
7117 cp_error ("`%D' can only be specified for constructors",
7120 cp_error ("`%D' can only be specified for objects and functions",
7127 /* Called when a declaration is seen that contains no names to declare.
7128 If its type is a reference to a structure, union or enum inherited
7129 from a containing scope, shadow that tag name for the current scope
7130 with a forward reference.
7131 If its type defines a new named structure or union
7132 or defines an enum, it is valid but we need not do anything here.
7133 Otherwise, it is an error.
7135 C++: may have to grok the declspecs to learn about static,
7136 complain for anonymous unions. */
7139 shadow_tag (declspecs
)
7142 tree t
= check_tag_decl (declspecs
);
7145 maybe_process_partial_specialization (t
);
7147 /* This is where the variables in an anonymous union are
7148 declared. An anonymous union declaration looks like:
7150 because there is no declarator after the union, the parser
7151 sends that declaration here. */
7152 if (t
&& ANON_UNION_TYPE_P (t
))
7154 fixup_anonymous_union (t
);
7156 if (TYPE_FIELDS (t
))
7158 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
7160 finish_anon_union (decl
);
7165 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
7168 groktypename (typename
)
7171 if (TREE_CODE (typename
) != TREE_LIST
)
7173 return grokdeclarator (TREE_VALUE (typename
),
7174 TREE_PURPOSE (typename
),
7175 TYPENAME
, 0, NULL_TREE
);
7178 /* Decode a declarator in an ordinary declaration or data definition.
7179 This is called as soon as the type information and variable name
7180 have been parsed, before parsing the initializer if any.
7181 Here we create the ..._DECL node, fill in its type,
7182 and put it on the list of decls for the current context.
7183 The ..._DECL node is returned as the value.
7185 Exception: for arrays where the length is not specified,
7186 the type is left null, to be filled in by `cp_finish_decl'.
7188 Function definitions do not come here; they go to start_function
7189 instead. However, external and forward declarations of functions
7190 do go through here. Structure field declarations are done by
7191 grokfield and not through here. */
7193 /* Set this to zero to debug not using the temporary obstack
7194 to parse initializers. */
7195 int debug_temp_inits
= 1;
7198 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
7199 tree declarator
, declspecs
;
7201 tree attributes
, prefix_attributes
;
7204 register tree type
, tem
;
7206 extern int have_extern_spec
;
7207 extern int used_extern_spec
;
7211 /* See code below that used this. */
7212 int init_written
= initialized
;
7215 /* This should only be done once on the top most decl. */
7216 if (have_extern_spec
&& !used_extern_spec
)
7218 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"),
7220 used_extern_spec
= 1;
7223 if (attributes
|| prefix_attributes
)
7224 attrlist
= build_scratch_list (attributes
, prefix_attributes
);
7226 attrlist
= NULL_TREE
;
7228 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
7231 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
7234 type
= TREE_TYPE (decl
);
7236 if (type
== error_mark_node
)
7239 /* Don't lose if destructors must be executed at file-level. */
7240 if (! processing_template_decl
&& TREE_STATIC (decl
)
7241 && TYPE_NEEDS_DESTRUCTOR (complete_type (type
))
7242 && !TREE_PERMANENT (decl
))
7244 push_obstacks (&permanent_obstack
, &permanent_obstack
);
7245 decl
= copy_node (decl
);
7246 if (TREE_CODE (type
) == ARRAY_TYPE
)
7248 tree itype
= TYPE_DOMAIN (type
);
7249 if (itype
&& ! TREE_PERMANENT (itype
))
7251 itype
= build_index_type (copy_to_permanent (TYPE_MAX_VALUE (itype
)));
7252 type
= build_cplus_array_type (TREE_TYPE (type
), itype
);
7253 TREE_TYPE (decl
) = type
;
7260 = (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
7261 ? DECL_CLASS_CONTEXT (decl
)
7262 : DECL_CONTEXT (decl
);
7264 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
7265 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
7267 /* When parsing the initializer, lookup should use the object's
7269 push_decl_namespace (context
);
7272 /* We are only interested in class contexts, later. */
7273 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
7274 context
= NULL_TREE
;
7277 /* Is it valid for this decl to have an initializer at all?
7278 If not, set INITIALIZED to zero, which will indirectly
7279 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7280 switch (TREE_CODE (decl
))
7283 /* typedef foo = bar means give foo the same type as bar.
7284 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
7285 Any other case of an initialization in a TYPE_DECL is an error. */
7286 if (pedantic
|| list_length (declspecs
) > 1)
7288 cp_error ("typedef `%D' is initialized", decl
);
7294 cp_error ("function `%#D' is initialized like a variable", decl
);
7299 if (! processing_template_decl
)
7301 if (type
!= error_mark_node
)
7303 if (TYPE_SIZE (type
) != NULL_TREE
7304 && ! TREE_CONSTANT (TYPE_SIZE (type
)))
7307 ("variable-sized object `%D' may not be initialized",
7312 if (TREE_CODE (type
) == ARRAY_TYPE
7313 && TYPE_SIZE (complete_type (TREE_TYPE (type
))) == NULL_TREE
)
7316 ("elements of array `%#D' have incomplete type", decl
);
7325 if (! toplevel_bindings_p ()
7326 && DECL_EXTERNAL (decl
))
7327 cp_warning ("declaration of `%#D' has `extern' and is initialized",
7329 DECL_EXTERNAL (decl
) = 0;
7330 if (toplevel_bindings_p ())
7331 TREE_STATIC (decl
) = 1;
7333 /* Tell `pushdecl' this is an initialized decl
7334 even though we don't yet have the initializer expression.
7335 Also tell `cp_finish_decl' it may store the real initializer. */
7336 DECL_INITIAL (decl
) = error_mark_node
;
7339 if (context
&& TYPE_SIZE (complete_type (context
)) != NULL_TREE
)
7341 push_nested_class (context
, 2);
7343 if (TREE_CODE (decl
) == VAR_DECL
)
7345 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
7346 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
7347 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
7350 if (DECL_CONTEXT (field
) != context
)
7352 cp_pedwarn ("ANSI C++ does not permit `%T::%D' to be defined as `%T::%D'",
7353 DECL_CONTEXT (field
), DECL_NAME (decl
),
7354 context
, DECL_NAME (decl
));
7355 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
7357 /* Static data member are tricky; an in-class initialization
7358 still doesn't provide a definition, so the in-class
7359 declaration will have DECL_EXTERNAL set, but will have an
7360 initialization. Thus, duplicate_decls won't warn
7361 about this situation, and so we check here. */
7362 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
7363 cp_error ("duplicate initialization of %D", decl
);
7364 if (duplicate_decls (decl
, field
))
7370 tree field
= check_classfn (context
, decl
);
7371 if (field
&& duplicate_decls (decl
, field
))
7375 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
7376 DECL_IN_AGGR_P (decl
) = 0;
7377 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
7378 || CLASSTYPE_USE_TEMPLATE (context
))
7380 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
7381 /* [temp.expl.spec] An explicit specialization of a static data
7382 member of a template is a definition if the declaration
7383 includes an initializer; otherwise, it is a declaration.
7385 We check for processing_specialization so this only applies
7386 to the new specialization syntax. */
7387 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
7388 DECL_EXTERNAL (decl
) = 1;
7391 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
7392 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
7396 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
7397 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
7400 /* Set attributes here so if duplicate decl, will have proper attributes. */
7401 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
7403 /* Add this decl to the current binding level, but not if it
7404 comes from another scope, e.g. a static member variable.
7405 TEM may equal DECL or it may be a previous decl of the same name. */
7407 if ((TREE_CODE (decl
) != PARM_DECL
&& DECL_CONTEXT (decl
) != NULL_TREE
7408 /* Definitions of namespace members outside their namespace are
7410 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
7411 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
7412 || TREE_CODE (type
) == LANG_TYPE
7413 /* The declaration of template specializations does not affect
7414 the functions available for overload resolution, so we do not
7416 || (TREE_CODE (decl
) == FUNCTION_DECL
7417 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
7420 tem
= pushdecl (decl
);
7422 if (processing_template_decl
)
7424 if (! current_function_decl
)
7425 tem
= push_template_decl (tem
);
7426 else if (minimal_parse_mode
)
7428 = build_min_nt (DECL_STMT
, copy_to_permanent (declarator
),
7429 copy_to_permanent (declspecs
),
7434 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7435 /* Tell the back-end to use or not use .common as appropriate. If we say
7436 -fconserve-space, we want this to save .data space, at the expense of
7437 wrong semantics. If we say -fno-conserve-space, we want this to
7438 produce errors about redefs; to do this we force variables into the
7440 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
7443 if (! processing_template_decl
)
7446 /* Corresponding pop_obstacks is done in `cp_finish_decl'. */
7447 push_obstacks_nochange ();
7450 /* We have no way of knowing whether the initializer will need to be
7451 evaluated at run-time or not until we've parsed it, so let's just put
7452 it in the permanent obstack. (jason) */
7454 && ! (TREE_CODE (tem
) == PARM_DECL
7455 || (TREE_READONLY (tem
)
7456 && (TREE_CODE (tem
) == VAR_DECL
7457 || TREE_CODE (tem
) == FIELD_DECL
))))
7459 /* When parsing and digesting the initializer,
7460 use temporary storage. Do this even if we will ignore the value. */
7461 if (toplevel_bindings_p () && debug_temp_inits
)
7463 if (processing_template_decl
7464 || TYPE_NEEDS_CONSTRUCTING (type
)
7465 || TREE_CODE (type
) == REFERENCE_TYPE
)
7466 /* In this case, the initializer must lay down in permanent
7467 storage, since it will be saved until `finish_file' is run. */
7470 temporary_allocation ();
7482 tree type
= TREE_TYPE (decl
);
7483 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
7485 if (type
== error_mark_node
)
7488 /* If this type of object needs a cleanup, and control may
7489 jump past it, make a new binding level so that it is cleaned
7490 up only when it is initialized first. */
7491 if (TYPE_NEEDS_DESTRUCTOR (type
)
7492 && current_binding_level
->more_cleanups_ok
== 0)
7493 pushlevel_temporary (1);
7496 /* Is it valid for this decl to have an initializer at all?
7497 If not, set INITIALIZED to zero, which will indirectly
7498 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7500 /* Don't allow initializations for incomplete types except for
7501 arrays which might be completed by the initialization. */
7502 if (TYPE_SIZE (complete_type (type
)) != NULL_TREE
)
7503 ; /* A complete type is ok. */
7504 else if (TREE_CODE (type
) != ARRAY_TYPE
)
7506 cp_error ("variable `%#D' has initializer but incomplete type",
7509 type
= TREE_TYPE (decl
) = error_mark_node
;
7511 else if (TYPE_SIZE (complete_type (TREE_TYPE (type
))) == NULL_TREE
)
7513 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
7514 cp_error ("elements of array `%#D' have incomplete type", decl
);
7515 /* else we already gave an error in start_decl. */
7521 && TREE_CODE (decl
) != TYPE_DECL
7522 && TREE_CODE (decl
) != TEMPLATE_DECL
7523 && IS_AGGR_TYPE (type
) && ! DECL_EXTERNAL (decl
))
7525 if ((! processing_template_decl
|| ! uses_template_parms (type
))
7526 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
7528 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
7530 /* Change the type so that assemble_variable will give
7531 DECL an rtl we can live with: (mem (const_int 0)). */
7532 type
= TREE_TYPE (decl
) = error_mark_node
;
7536 /* If any base type in the hierarchy of TYPE needs a constructor,
7537 then we set initialized to 1. This way any nodes which are
7538 created for the purposes of initializing this aggregate
7539 will live as long as it does. This is necessary for global
7540 aggregates which do not have their initializers processed until
7541 the end of the file. */
7542 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
7547 /* We don't do this yet for GNU C++. */
7548 /* For a local variable, define the RTL now. */
7549 if (! toplevel_bindings_p ()
7550 /* But not if this is a duplicate decl
7551 and we preserved the rtl from the previous one
7552 (which may or may not happen). */
7553 && DECL_RTL (tem
) == NULL_RTX
)
7555 if (TYPE_SIZE (TREE_TYPE (tem
)) != NULL_TREE
)
7557 else if (TREE_CODE (TREE_TYPE (tem
)) == ARRAY_TYPE
7558 && DECL_INITIAL (tem
) != NULL_TREE
)
7564 DECL_INITIAL (decl
) = NULL_TREE
;
7567 /* Handle initialization of references.
7568 These three arguments are from `cp_finish_decl', and have the
7569 same meaning here that they do there.
7571 Quotes on semantics can be found in ARM 8.4.3. */
7574 grok_reference_init (decl
, type
, init
)
7575 tree decl
, type
, init
;
7579 if (init
== NULL_TREE
)
7581 if ((DECL_LANG_SPECIFIC (decl
) == 0
7582 || DECL_IN_AGGR_P (decl
) == 0)
7583 && ! DECL_THIS_EXTERN (decl
))
7585 cp_error ("`%D' declared as reference but not initialized", decl
);
7586 if (TREE_CODE (decl
) == VAR_DECL
)
7587 SET_DECL_REFERENCE_SLOT (decl
, error_mark_node
);
7592 if (init
== error_mark_node
)
7595 if (TREE_CODE (type
) == REFERENCE_TYPE
7596 && TREE_CODE (init
) == CONSTRUCTOR
)
7598 cp_error ("ANSI C++ forbids use of initializer list to initialize reference `%D'", decl
);
7602 if (TREE_CODE (init
) == TREE_LIST
)
7603 init
= build_compound_expr (init
);
7605 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
7606 init
= convert_from_reference (init
);
7608 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
7609 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
7611 /* Note: default conversion is only called in very special cases. */
7612 init
= default_conversion (init
);
7615 tmp
= convert_to_reference
7616 (type
, init
, CONV_IMPLICIT
,
7617 LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
, decl
);
7619 if (tmp
== error_mark_node
)
7621 else if (tmp
!= NULL_TREE
)
7624 DECL_INITIAL (decl
) = save_expr (init
);
7628 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7632 /* ?? Can this be optimized in some cases to
7633 hand back the DECL_INITIAL slot?? */
7634 if (TYPE_SIZE (TREE_TYPE (type
)))
7636 init
= convert_from_reference (decl
);
7637 if (TREE_PERMANENT (decl
))
7638 init
= copy_to_permanent (init
);
7639 SET_DECL_REFERENCE_SLOT (decl
, init
);
7642 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
7644 expand_static_init (decl
, DECL_INITIAL (decl
));
7645 DECL_INITIAL (decl
) = NULL_TREE
;
7650 if (TREE_CODE (decl
) == VAR_DECL
)
7651 SET_DECL_REFERENCE_SLOT (decl
, error_mark_node
);
7655 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7656 mucking with forces it does not comprehend (i.e. initialization with a
7657 constructor). If we are at global scope and won't go into COMMON, fill
7658 it in with a dummy CONSTRUCTOR to force the variable into .data;
7659 otherwise we can use error_mark_node. */
7662 obscure_complex_init (decl
, init
)
7665 if (! flag_no_inline
&& TREE_STATIC (decl
))
7667 if (extract_init (decl
, init
))
7671 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7672 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7673 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7677 DECL_INITIAL (decl
) = error_mark_node
;
7682 /* Issue an error message if DECL is an uninitialized const variable. */
7685 check_for_uninitialized_const_var (decl
)
7688 tree type
= TREE_TYPE (decl
);
7690 /* ``Unless explicitly declared extern, a const object does not have
7691 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7693 if (TREE_CODE (decl
) == VAR_DECL
7694 && TREE_CODE (type
) != REFERENCE_TYPE
7695 && CP_TYPE_CONST_P (type
)
7696 && !TYPE_NEEDS_CONSTRUCTING (type
)
7697 && !DECL_INITIAL (decl
))
7698 cp_error ("uninitialized const `%D'", decl
);
7701 /* Finish processing of a declaration;
7702 install its line number and initial value.
7703 If the length of an array type is not known before,
7704 it must be determined now, from the initial value, or it is an error.
7706 Call `pop_obstacks' iff NEED_POP is nonzero.
7708 For C++, `cp_finish_decl' must be fairly evasive: it must keep initializers
7709 for aggregates that have constructors alive on the permanent obstack,
7710 so that the global initializing functions can be written at the end.
7712 INIT0 holds the value of an initializer that should be allowed to escape
7715 FLAGS is LOOKUP_ONLYCONVERTING is the = init syntax was used, else 0
7716 if the (init) syntax was used.
7718 For functions that take default parameters, DECL points to its
7719 "maximal" instantiation. `cp_finish_decl' must then also declared its
7720 subsequently lower and lower forms of instantiation, checking for
7721 ambiguity as it goes. This can be sped up later. */
7724 cp_finish_decl (decl
, init
, asmspec_tree
, need_pop
, flags
)
7731 tree cleanup
= NULL_TREE
, ttype
= NULL_TREE
;
7733 int temporary
= allocation_temporary_p ();
7734 char *asmspec
= NULL
;
7735 int was_readonly
= 0;
7736 int already_used
= 0;
7739 /* If this is 0, then we did not change obstacks. */
7743 error ("assignment (not initialization) in declaration");
7747 /* If a name was specified, get the string. */
7749 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
7751 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
7753 cp_error ("Cannot initialize `%D' to namespace `%D'",
7758 if (current_class_type
7759 && DECL_REAL_CONTEXT (decl
) == current_class_type
7760 && TYPE_BEING_DEFINED (current_class_type
)
7761 && (DECL_INITIAL (decl
) || init
))
7762 DECL_DEFINED_IN_CLASS_P (decl
) = 1;
7764 if (TREE_CODE (decl
) == VAR_DECL
7765 && DECL_CONTEXT (decl
)
7766 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7767 && DECL_CONTEXT (decl
) != current_namespace
7770 /* Leave the namespace of the object. */
7771 pop_decl_namespace ();
7774 /* If the type of the thing we are declaring either has
7775 a constructor, or has a virtual function table pointer,
7776 AND its initialization was accepted by `start_decl',
7777 then we stayed on the permanent obstack through the
7778 declaration, otherwise, changed obstacks as GCC would. */
7780 type
= TREE_TYPE (decl
);
7782 if (type
== error_mark_node
)
7784 if (toplevel_bindings_p () && temporary
)
7785 end_temporary_allocation ();
7790 if (TYPE_HAS_MUTABLE_P (type
))
7791 TREE_READONLY (decl
) = 0;
7793 if (processing_template_decl
)
7795 if (init
&& DECL_INITIAL (decl
))
7796 DECL_INITIAL (decl
) = init
;
7797 if (minimal_parse_mode
&& ! DECL_ARTIFICIAL (decl
))
7799 tree stmt
= DECL_VINDEX (decl
);
7800 /* If the decl is declaring a member of a local class (in a
7801 template function), the DECL_VINDEX will either be NULL,
7802 or it will be an actual virtual function index, not a
7804 if (stmt
!= NULL_TREE
&& TREE_CODE (stmt
) == DECL_STMT
)
7806 DECL_VINDEX (decl
) = NULL_TREE
;
7807 TREE_OPERAND (stmt
, 2) = copy_to_permanent (init
);
7814 /* Take care of TYPE_DECLs up front. */
7815 if (TREE_CODE (decl
) == TYPE_DECL
)
7817 if (init
&& DECL_INITIAL (decl
))
7819 /* typedef foo = bar; store the type of bar as the type of foo. */
7820 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
7821 DECL_INITIAL (decl
) = init
= NULL_TREE
;
7823 if (type
!= error_mark_node
7824 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
7826 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
7827 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
7828 set_identifier_type_value (DECL_NAME (decl
), type
);
7829 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
7831 GNU_xref_decl (current_function_decl
, decl
);
7833 /* If we have installed this as the canonical typedef for this
7834 type, and that type has not been defined yet, delay emitting
7835 the debug information for it, as we will emit it later. */
7836 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
7837 && TYPE_SIZE (TREE_TYPE (decl
)) == NULL_TREE
)
7838 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
7840 rest_of_decl_compilation (decl
, NULL_PTR
,
7841 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
7844 if (TREE_CODE (decl
) != FUNCTION_DECL
)
7846 ttype
= target_type (type
);
7849 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
7850 && TYPE_NEEDS_CONSTRUCTING (type
))
7853 /* Currently, GNU C++ puts constants in text space, making them
7854 impossible to initialize. In the future, one would hope for
7855 an operating system which understood the difference between
7856 initialization and the running of a program. */
7858 TREE_READONLY (decl
) = 0;
7861 if (TREE_CODE (decl
) == FIELD_DECL
)
7863 if (init
&& init
!= error_mark_node
)
7864 my_friendly_assert (TREE_PERMANENT (init
), 147);
7868 /* This must override the asm specifier which was placed
7869 by grokclassfn. Lay this out fresh. */
7870 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
7871 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7872 make_decl_rtl (decl
, asmspec
, 0);
7875 /* If `start_decl' didn't like having an initialization, ignore it now. */
7876 else if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7878 else if (DECL_EXTERNAL (decl
))
7880 else if (TREE_CODE (type
) == REFERENCE_TYPE
7881 || (TYPE_LANG_SPECIFIC (type
) && IS_SIGNATURE_REFERENCE (type
)))
7883 if (TREE_STATIC (decl
))
7884 make_decl_rtl (decl
, NULL_PTR
,
7885 toplevel_bindings_p ()
7886 || pseudo_global_level_p ());
7887 grok_reference_init (decl
, type
, init
);
7891 GNU_xref_decl (current_function_decl
, decl
);
7894 while (TREE_CODE (core_type
) == ARRAY_TYPE
)
7895 core_type
= TREE_TYPE (core_type
);
7897 if (TREE_CODE (decl
) == FIELD_DECL
)
7899 else if (TREE_CODE (decl
) == CONST_DECL
)
7901 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7903 DECL_INITIAL (decl
) = init
;
7905 /* This will keep us from needing to worry about our obstacks. */
7906 my_friendly_assert (init
!= NULL_TREE
, 149);
7911 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7913 if (TREE_CODE (type
) == ARRAY_TYPE
)
7914 init
= digest_init (type
, init
, (tree
*) 0);
7915 else if (TREE_CODE (init
) == CONSTRUCTOR
7916 && TREE_HAS_CONSTRUCTOR (init
))
7918 if (TYPE_NON_AGGREGATE_CLASS (type
))
7920 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7922 init
= error_mark_node
;
7925 goto dont_use_constructor
;
7930 dont_use_constructor
:
7931 if (TREE_CODE (init
) != TREE_VEC
)
7932 init
= store_init_value (decl
, init
);
7936 /* We must hide the initializer so that expand_decl
7937 won't try to do something it does not understand. */
7938 init
= obscure_complex_init (decl
, init
);
7940 else if (DECL_EXTERNAL (decl
))
7942 else if (TREE_CODE_CLASS (TREE_CODE (type
)) == 't'
7943 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7945 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7947 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7948 cp_error ("structure `%D' with uninitialized const members", decl
);
7949 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7950 cp_error ("structure `%D' with uninitialized reference members",
7954 check_for_uninitialized_const_var (decl
);
7956 if (TYPE_SIZE (type
) != NULL_TREE
7957 && TYPE_NEEDS_CONSTRUCTING (type
))
7958 init
= obscure_complex_init (decl
, NULL_TREE
);
7962 check_for_uninitialized_const_var (decl
);
7964 /* For top-level declaration, the initial value was read in
7965 the temporary obstack. MAXINDEX, rtl, etc. to be made below
7966 must go in the permanent obstack; but don't discard the
7967 temporary data yet. */
7969 if (toplevel_bindings_p () && temporary
)
7970 end_temporary_allocation ();
7972 /* Deduce size of array from initialization, if not already known. */
7974 if (TREE_CODE (type
) == ARRAY_TYPE
7975 && TYPE_DOMAIN (type
) == NULL_TREE
7976 && TREE_CODE (decl
) != TYPE_DECL
)
7979 = (TREE_STATIC (decl
)
7980 /* Even if pedantic, an external linkage array
7981 may have incomplete type at first. */
7982 ? pedantic
&& ! DECL_EXTERNAL (decl
)
7983 : !DECL_EXTERNAL (decl
));
7984 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7985 int failure
= complete_array_type (type
, initializer
, do_default
);
7988 cp_error ("initializer fails to determine size of `%D'", decl
);
7993 cp_error ("array size missing in `%D'", decl
);
7994 /* If a `static' var's size isn't known, make it extern as
7995 well as static, so it does not get allocated. If it's not
7996 `static', then don't mark it extern; finish_incomplete_decl
7997 will give it a default size and it will get allocated. */
7998 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7999 DECL_EXTERNAL (decl
) = 1;
8002 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
8003 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
8005 cp_error ("zero-size array `%D'", decl
);
8007 layout_decl (decl
, 0);
8010 if (TREE_CODE (decl
) == VAR_DECL
)
8012 if (DECL_SIZE (decl
) == NULL_TREE
8013 && TYPE_SIZE (complete_type (TREE_TYPE (decl
))) != NULL_TREE
)
8014 layout_decl (decl
, 0);
8016 if (TREE_STATIC (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
8018 /* A static variable with an incomplete type:
8019 that is an error if it is initialized.
8020 Otherwise, let it through, but if it is not `extern'
8021 then it may cause an error message later. */
8022 if (DECL_INITIAL (decl
) != NULL_TREE
)
8023 cp_error ("storage size of `%D' isn't known", decl
);
8026 else if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
8028 /* An automatic variable with an incomplete type: that is an error.
8029 Don't talk about array types here, since we took care of that
8030 message in grokdeclarator. */
8031 cp_error ("storage size of `%D' isn't known", decl
);
8032 TREE_TYPE (decl
) = error_mark_node
;
8034 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
8035 /* Let debugger know it should output info for this type. */
8036 note_debug_info_needed (ttype
);
8038 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
8039 note_debug_info_needed (DECL_CONTEXT (decl
));
8041 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
8042 && DECL_SIZE (decl
) != NULL_TREE
8043 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
8045 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
8046 constant_expression_warning (DECL_SIZE (decl
));
8048 cp_error ("storage size of `%D' isn't constant", decl
);
8051 if (! DECL_EXTERNAL (decl
) && TYPE_NEEDS_DESTRUCTOR (type
)
8052 /* Cleanups for static variables are handled by `finish_file'. */
8053 && ! TREE_STATIC (decl
))
8055 int yes
= suspend_momentary ();
8056 cleanup
= maybe_build_cleanup (decl
);
8057 resume_momentary (yes
);
8060 /* PARM_DECLs get cleanups, too. */
8061 else if (TREE_CODE (decl
) == PARM_DECL
&& TYPE_NEEDS_DESTRUCTOR (type
))
8064 end_temporary_allocation ();
8065 cleanup
= maybe_build_cleanup (decl
);
8067 resume_temporary_allocation ();
8070 /* Output the assembler code and/or RTL code for variables and functions,
8071 unless the type is an undefined structure or union.
8072 If not, it will get done when the type is completed. */
8074 was_incomplete
= (DECL_SIZE (decl
) == NULL_TREE
);
8076 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
8077 || TREE_CODE (decl
) == RESULT_DECL
)
8079 /* ??? FIXME: What about nested classes? */
8080 int toplev
= toplevel_bindings_p () || pseudo_global_level_p ();
8082 = (TREE_STATIC (decl
) && TYPE_NEEDS_DESTRUCTOR (type
)
8083 && allocation_temporary_p ());
8086 end_temporary_allocation ();
8088 /* Static data in a function with comdat linkage also has comdat
8090 if (TREE_CODE (decl
) == VAR_DECL
8091 && TREE_STATIC (decl
)
8092 /* Don't mess with __FUNCTION__. */
8093 && ! TREE_ASM_WRITTEN (decl
)
8094 && current_function_decl
8095 && DECL_CONTEXT (decl
) == current_function_decl
8096 && (DECL_THIS_INLINE (current_function_decl
)
8097 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
8098 && TREE_PUBLIC (current_function_decl
))
8100 /* Rather than try to get this right with inlining, we suppress
8101 inlining of such functions. */
8102 current_function_cannot_inline
8103 = "function with static variable cannot be inline";
8105 /* If flag_weak, we don't need to mess with this, as we can just
8106 make the function weak, and let it refer to its unique local
8107 copy. This works because we don't allow the function to be
8111 if (DECL_INTERFACE_KNOWN (current_function_decl
))
8113 TREE_PUBLIC (decl
) = 1;
8114 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
8116 else if (DECL_INITIAL (decl
) == NULL_TREE
8117 || DECL_INITIAL (decl
) == error_mark_node
)
8119 TREE_PUBLIC (decl
) = 1;
8120 DECL_COMMON (decl
) = 1;
8122 /* else we lose. We can only do this if we can use common,
8123 which we can't if it has been initialized. */
8125 if (TREE_PUBLIC (decl
))
8126 DECL_ASSEMBLER_NAME (decl
)
8127 = build_static_name (current_function_decl
, DECL_NAME (decl
));
8128 else if (! DECL_ARTIFICIAL (decl
))
8130 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
8131 cp_warning_at (" you can work around this by removing the initializer"), decl
;
8136 else if (TREE_CODE (decl
) == VAR_DECL
8137 && DECL_LANG_SPECIFIC (decl
)
8138 && DECL_COMDAT (decl
))
8139 /* Set it up again; we might have set DECL_INITIAL since the
8141 comdat_linkage (decl
);
8143 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_VIRTUAL_P (decl
))
8144 make_decl_rtl (decl
, NULL_PTR
, toplev
);
8145 else if (TREE_CODE (decl
) == VAR_DECL
8146 && TREE_READONLY (decl
)
8147 && DECL_INITIAL (decl
) != NULL_TREE
8148 && DECL_INITIAL (decl
) != error_mark_node
8149 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
8151 DECL_INITIAL (decl
) = save_expr (DECL_INITIAL (decl
));
8154 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
8157 && TREE_STATIC (decl
)
8158 && ! TREE_SIDE_EFFECTS (decl
)
8159 && ! TREE_PUBLIC (decl
)
8160 && ! DECL_EXTERNAL (decl
)
8161 && ! TYPE_NEEDS_DESTRUCTOR (type
)
8162 && DECL_MODE (decl
) != BLKmode
)
8164 /* If this variable is really a constant, then fill its DECL_RTL
8165 slot with something which won't take up storage.
8166 If something later should take its address, we can always give
8167 it legitimate RTL at that time. */
8168 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
8169 store_expr (DECL_INITIAL (decl
), DECL_RTL (decl
), 0);
8170 TREE_ASM_WRITTEN (decl
) = 1;
8172 else if (toplev
&& ! TREE_PUBLIC (decl
))
8174 /* If this is a static const, change its apparent linkage
8175 if it belongs to a #pragma interface. */
8176 if (!interface_unknown
)
8178 TREE_PUBLIC (decl
) = 1;
8179 DECL_EXTERNAL (decl
) = interface_only
;
8181 make_decl_rtl (decl
, asmspec
, toplev
);
8184 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
8186 else if (TREE_CODE (decl
) == VAR_DECL
8187 && DECL_LANG_SPECIFIC (decl
)
8188 && DECL_IN_AGGR_P (decl
))
8190 if (TREE_STATIC (decl
))
8192 if (init
== NULL_TREE
8193 #ifdef DEFAULT_STATIC_DEFS
8194 /* If this code is dead, then users must
8195 explicitly declare static member variables
8196 outside the class def'n as well. */
8197 && TYPE_NEEDS_CONSTRUCTING (type
)
8201 DECL_EXTERNAL (decl
) = 1;
8202 make_decl_rtl (decl
, asmspec
, 1);
8205 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
8208 /* Just a constant field. Should not need any rtl. */
8212 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
8215 resume_temporary_allocation ();
8217 if (type
!= error_mark_node
8218 && TYPE_LANG_SPECIFIC (core_type
)
8219 && CLASSTYPE_ABSTRACT_VIRTUALS (core_type
))
8220 abstract_virtuals_error (decl
, core_type
);
8221 else if ((TREE_CODE (type
) == FUNCTION_TYPE
8222 || TREE_CODE (type
) == METHOD_TYPE
)
8223 && TYPE_LANG_SPECIFIC (TREE_TYPE (type
))
8224 && CLASSTYPE_ABSTRACT_VIRTUALS (TREE_TYPE (type
)))
8225 abstract_virtuals_error (decl
, TREE_TYPE (type
));
8227 if (TYPE_LANG_SPECIFIC (core_type
) && IS_SIGNATURE (core_type
))
8228 signature_error (decl
, core_type
);
8229 else if ((TREE_CODE (type
) == FUNCTION_TYPE
8230 || TREE_CODE (type
) == METHOD_TYPE
)
8231 && TYPE_LANG_SPECIFIC (TREE_TYPE (type
))
8232 && IS_SIGNATURE (TREE_TYPE (type
)))
8233 signature_error (decl
, TREE_TYPE (type
));
8235 if (TREE_CODE (decl
) == FUNCTION_DECL
)
8237 else if (DECL_EXTERNAL (decl
)
8238 && ! (DECL_LANG_SPECIFIC (decl
)
8239 && DECL_NOT_REALLY_EXTERN (decl
)))
8242 DECL_INITIAL (decl
) = init
;
8244 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
8246 /* Cleanups for static variables are handled by `finish_file'. */
8247 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
8248 || TYPE_NEEDS_DESTRUCTOR (type
))
8249 expand_static_init (decl
, init
);
8253 /* This is a declared decl which must live until the
8254 end of the binding contour. It may need a cleanup. */
8256 /* Recompute the RTL of a local array now
8257 if it used to be an incomplete type. */
8258 if (was_incomplete
&& ! TREE_STATIC (decl
))
8260 /* If we used it already as memory, it must stay in memory. */
8261 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
8262 /* If it's still incomplete now, no init will save it. */
8263 if (DECL_SIZE (decl
) == NULL_TREE
)
8264 DECL_INITIAL (decl
) = NULL_TREE
;
8267 else if (! TREE_ASM_WRITTEN (decl
)
8268 && (TYPE_SIZE (type
) != NULL_TREE
8269 || TREE_CODE (type
) == ARRAY_TYPE
))
8271 /* Do this here, because we did not expand this decl's
8272 rtl in start_decl. */
8273 if (DECL_RTL (decl
) == NULL_RTX
)
8277 /* XXX: Why don't we use decl here? */
8278 /* Ans: Because it was already expanded? */
8279 if (! expand_decl_cleanup (NULL_TREE
, cleanup
))
8280 cp_error ("parser lost in parsing declaration of `%D'",
8282 /* Cleanup used up here. */
8283 cleanup
= NULL_TREE
;
8287 if (current_binding_level
->is_for_scope
)
8289 struct binding_level
*outer
8290 = current_binding_level
->level_chain
;
8292 /* Check to see if the same name is already bound at
8293 the outer level, either because it was directly declared,
8294 or because a dead for-decl got preserved. In either case,
8295 the code would not have been valid under the ARM
8296 scope rules, so clear is_for_scope for the
8297 current_binding_level.
8299 Otherwise, we need to preserve the temp slot for decl
8300 to last into the outer binding level. */
8303 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
8305 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
8306 && (TREE_CODE (BINDING_VALUE (outer_binding
))
8308 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
8310 BINDING_VALUE (outer_binding
)
8311 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
8312 current_binding_level
->is_for_scope
= 0;
8314 else if (DECL_IN_MEMORY_P (decl
))
8315 preserve_temp_slots (DECL_RTL (decl
));
8318 expand_start_target_temps ();
8320 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
8322 /* Compute and store the initial value. */
8323 expand_decl_init (decl
);
8324 already_used
= TREE_USED (decl
) || TREE_USED (type
);
8326 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
8328 emit_line_note (DECL_SOURCE_FILE (decl
),
8329 DECL_SOURCE_LINE (decl
));
8330 expand_aggr_init (decl
, init
, flags
);
8333 /* Set this to 0 so we can tell whether an aggregate which
8334 was initialized was ever used. Don't do this if it has a
8335 destructor, so we don't complain about the 'resource
8336 allocation is initialization' idiom. */
8337 /* Now set attribute((unused)) on types so decls of
8338 that type will be marked used. (see TREE_USED, above.)
8339 This avoids the warning problems this particular code
8340 tried to work around. */
8342 if (TYPE_NEEDS_CONSTRUCTING (type
)
8344 && cleanup
== NULL_TREE
8345 && DECL_NAME (decl
))
8346 TREE_USED (decl
) = 0;
8349 TREE_USED (decl
) = 1;
8352 /* Cleanup any temporaries needed for the initial value. */
8353 expand_end_target_temps ();
8355 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
8357 /* Store the cleanup, if there was one. */
8360 if (! expand_decl_cleanup (decl
, cleanup
))
8361 cp_error ("parser lost in parsing declaration of `%D'",
8368 /* Undo call to `pushclass' that was done in `start_decl'
8369 due to initialization of qualified member variable.
8370 I.e., Foo::x = 10; */
8372 tree context
= DECL_REAL_CONTEXT (decl
);
8374 && TREE_CODE_CLASS (TREE_CODE (context
)) == 't'
8375 && (TREE_CODE (decl
) == VAR_DECL
8376 /* We also have a pushclass done that we need to undo here
8377 if we're at top level and declare a method. */
8378 || TREE_CODE (decl
) == FUNCTION_DECL
)
8379 /* If size hasn't been set, we're still defining it,
8380 and therefore inside the class body; don't pop
8381 the binding level.. */
8382 && TYPE_SIZE (context
) != NULL_TREE
8383 && context
== current_class_type
)
8384 pop_nested_class ();
8390 /* If requested, warn about definitions of large data objects. */
8392 if (warn_larger_than
8393 && ! processing_template_decl
8394 && (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
8395 && !DECL_EXTERNAL (decl
))
8397 register tree decl_size
= DECL_SIZE (decl
);
8399 if (decl_size
&& TREE_CODE (decl_size
) == INTEGER_CST
)
8401 unsigned units
= TREE_INT_CST_LOW (decl_size
) / BITS_PER_UNIT
;
8403 if (units
> larger_than_size
)
8404 warning_with_decl (decl
, "size of `%s' is %u bytes", units
);
8410 /* Resume permanent allocation, if not within a function. */
8411 /* The corresponding push_obstacks_nochange is in start_decl,
8412 start_method, groktypename, and in grokfield. */
8417 TREE_READONLY (decl
) = 1;
8420 /* This is here for a midend callback from c-common.c */
8423 finish_decl (decl
, init
, asmspec_tree
)
8427 cp_finish_decl (decl
, init
, asmspec_tree
, 1, 0);
8431 expand_static_init (decl
, init
)
8435 tree oldstatic
= value_member (decl
, static_aggregates
);
8439 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
8440 cp_error ("multiple initializations given for `%D'", decl
);
8442 else if (! toplevel_bindings_p ())
8444 /* Emit code to perform this initialization but once. */
8447 /* Remember this information until end of file. */
8448 push_obstacks (&permanent_obstack
, &permanent_obstack
);
8450 /* Emit code to perform this initialization but once. This code
8453 static int temp = 0;
8455 // Do initialization.
8457 // Register variable for destruction at end of program.
8460 Note that the `temp' variable is only set to 1 *after* the
8461 initialization is complete. This ensures that an exception,
8462 thrown during the construction, will cause the variable to
8463 reinitialized when we pass through this code again, as per:
8467 If the initialization exits by throwing an exception, the
8468 initialization is not complete, so it will be tried again
8469 the next time control enters the declaration.
8471 In theory, this process should be thread-safe, too; multiple
8472 threads should not be able to initialize the variable more
8473 than once. We don't yet attempt to ensure thread-safety. */
8474 temp
= get_temp_name (integer_type_node
, 1);
8475 rest_of_decl_compilation (temp
, NULL_PTR
, 0, 0);
8477 /* Begin the conditional initialization. */
8478 expand_start_cond (build_binary_op (EQ_EXPR
, temp
,
8479 integer_zero_node
), 0);
8480 expand_start_target_temps ();
8482 /* Do the initialization itself. */
8483 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
8484 || (init
&& TREE_CODE (init
) == TREE_LIST
))
8486 expand_aggr_init (decl
, init
, 0);
8487 do_pending_stack_adjust ();
8490 expand_assignment (decl
, init
, 0, 0);
8492 /* Set TEMP to 1. */
8493 expand_assignment (temp
, integer_one_node
, 0, 0);
8495 /* Cleanup any temporaries needed for the initial value. If
8496 destroying one of the temporaries causes an exception to be
8497 thrown, then the object itself has still been fully
8499 expand_end_target_temps ();
8501 /* Use atexit to register a function for destroying this static
8503 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
8505 tree cleanup
, fcall
;
8506 static tree Atexit
= 0;
8509 tree atexit_fndecl
, PFV
, pfvlist
;
8510 /* Remember this information until end of file. */
8511 push_obstacks (&permanent_obstack
, &permanent_obstack
);
8512 PFV
= build_pointer_type (build_function_type
8513 (void_type_node
, void_list_node
));
8515 pfvlist
= tree_cons (NULL_TREE
, PFV
, void_list_node
);
8517 push_lang_context (lang_name_c
);
8519 = builtin_function ("atexit",
8520 build_function_type (void_type_node
,
8522 NOT_BUILT_IN
, NULL_PTR
);
8523 mark_used (atexit_fndecl
);
8524 Atexit
= default_conversion (atexit_fndecl
);
8525 pop_lang_context ();
8529 /* Call build_cleanup before we enter the anonymous function
8530 so that any access checks will be done relative to the
8531 current scope, rather than the scope of the anonymous
8533 fcall
= build_cleanup (decl
);
8534 cleanup
= start_anon_func ();
8535 expand_expr_stmt (fcall
);
8537 mark_addressable (cleanup
);
8538 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
8539 fcall
= build_function_call (Atexit
, expr_tree_cons (NULL_TREE
, cleanup
, NULL_TREE
));
8540 expand_expr_stmt (fcall
);
8544 /* Resume old (possibly temporary) allocation. */
8549 /* This code takes into account memory allocation policy of
8550 `start_decl'. Namely, if TYPE_NEEDS_CONSTRUCTING does not
8551 hold for this object, then we must make permanent the storage
8552 currently in the temporary obstack. */
8553 if (!TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
8554 preserve_initializer ();
8555 static_aggregates
= perm_tree_cons (init
, decl
, static_aggregates
);
8559 /* Make TYPE a complete type based on INITIAL_VALUE.
8560 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8561 2 if there was no information (in which case assume 1 if DO_DEFAULT). */
8564 complete_array_type (type
, initial_value
, do_default
)
8565 tree type
, initial_value
;
8568 register tree maxindex
= NULL_TREE
;
8573 /* Note MAXINDEX is really the maximum index,
8574 one less than the size. */
8575 if (TREE_CODE (initial_value
) == STRING_CST
)
8578 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8579 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8582 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8584 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8585 maxindex
= size_binop (MINUS_EXPR
, integer_zero_node
, size_one_node
);
8586 for (; elts
; elts
= TREE_CHAIN (elts
))
8588 if (TREE_PURPOSE (elts
))
8589 maxindex
= TREE_PURPOSE (elts
);
8591 maxindex
= size_binop (PLUS_EXPR
, maxindex
, size_one_node
);
8593 maxindex
= copy_node (maxindex
);
8597 /* Make an error message unless that happened already. */
8598 if (initial_value
!= error_mark_node
)
8601 initial_value
= NULL_TREE
;
8603 /* Prevent further error messages. */
8604 maxindex
= build_int_2 (0, 0);
8611 maxindex
= build_int_2 (0, 0);
8619 TYPE_DOMAIN (type
) = build_index_type (maxindex
);
8620 if (! TREE_TYPE (maxindex
))
8621 TREE_TYPE (maxindex
) = TYPE_DOMAIN (type
);
8623 itype
= TREE_TYPE (initial_value
);
8626 if (itype
&& !TYPE_DOMAIN (itype
))
8627 TYPE_DOMAIN (itype
) = TYPE_DOMAIN (type
);
8628 /* The type of the main variant should never be used for arrays
8629 of different sizes. It should only ever be completed with the
8630 size of the array. */
8631 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8632 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = TYPE_DOMAIN (type
);
8635 /* Lay out the type now that we can get the real answer. */
8642 /* Return zero if something is declared to be a member of type
8643 CTYPE when in the context of CUR_TYPE. STRING is the error
8644 message to print in that case. Otherwise, quietly return 1. */
8647 member_function_or_else (ctype
, cur_type
, string
)
8648 tree ctype
, cur_type
;
8651 if (ctype
&& ctype
!= cur_type
)
8653 error (string
, TYPE_NAME_STRING (ctype
));
8659 /* Subroutine of `grokdeclarator'. */
8661 /* Generate errors possibly applicable for a given set of specifiers.
8662 This is for ARM $7.1.2. */
8665 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8668 int virtualp
, quals
, friendp
, raises
, inlinep
;
8671 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8673 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8675 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8678 cp_error_at ("invalid friend declaration", object
);
8680 cp_error_at ("invalid exception specifications", object
);
8683 /* CTYPE is class type, or null if non-class.
8684 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8686 DECLARATOR is the function's name.
8687 VIRTUALP is truthvalue of whether the function is virtual or not.
8688 FLAGS are to be passed through to `grokclassfn'.
8689 QUALS are qualifiers indicating whether the function is `const'
8691 RAISES is a list of exceptions that this function can raise.
8692 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8693 not look, and -1 if we should not call `grokclassfn' at all.
8695 Returns `NULL_TREE' if something goes wrong, after issuing
8696 applicable error messages. */
8699 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8700 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8701 template_count
, in_namespace
)
8704 tree orig_declarator
;
8706 enum overload_flags flags
;
8708 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8712 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8716 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8717 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8723 type
= build_exception_variant (type
, raises
);
8726 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8727 /* Propagate volatile out from type to decl. */
8728 if (TYPE_VOLATILE (type
))
8729 TREE_THIS_VOLATILE (decl
) = 1;
8731 /* If this decl has namespace scope, set that up. */
8733 set_decl_namespace (decl
, in_namespace
, friendp
);
8734 else if (publicp
&& ! ctype
)
8735 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8737 /* `main' and builtins have implicit 'C' linkage. */
8738 if ((MAIN_NAME_P (declarator
)
8739 || (IDENTIFIER_LENGTH (declarator
) > 10
8740 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8741 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8742 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8743 && current_lang_name
== lang_name_cplusplus
8744 && ctype
== NULL_TREE
8745 /* NULL_TREE means global namespace. */
8746 && DECL_CONTEXT (decl
) == NULL_TREE
)
8747 DECL_LANGUAGE (decl
) = lang_c
;
8749 /* Should probably propagate const out from type to decl I bet (mrs). */
8752 DECL_STATIC_FUNCTION_P (decl
) = 1;
8753 DECL_CONTEXT (decl
) = ctype
;
8757 DECL_CLASS_CONTEXT (decl
) = ctype
;
8759 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8761 if (processing_template_decl
)
8762 error ("cannot declare `main' to be a template");
8764 error ("cannot declare `main' to be inline");
8766 error ("cannot declare `main' to be static");
8771 /* Members of anonymous types and local classes have no linkage; make
8773 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8774 || hack_decl_function_context (TYPE_MAIN_DECL (ctype
))))
8779 /* [basic.link]: A name with no linkage (notably, the name of a class
8780 or enumeration declared in a local scope) shall not be used to
8781 declare an entity with linkage.
8783 Only check this for public decls for now. */
8784 t
= no_linkage_check (TREE_TYPE (decl
));
8787 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8789 if (DECL_LANGUAGE (decl
) == lang_c
)
8790 /* Allow this; it's pretty common in C. */;
8792 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8796 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8801 TREE_PUBLIC (decl
) = publicp
;
8804 DECL_INTERFACE_KNOWN (decl
) = 1;
8805 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8809 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8811 DECL_EXTERNAL (decl
) = 1;
8812 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8814 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8815 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8819 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8820 grok_op_properties (decl
, virtualp
, check
< 0);
8822 if (ctype
&& hack_decl_function_context (decl
))
8823 DECL_NO_STATIC_CHAIN (decl
) = 1;
8825 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8826 if (TREE_PURPOSE (t
)
8827 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8829 add_defarg_fn (decl
);
8834 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8838 ("defining explicit specialization `%D' in friend declaration",
8842 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8844 /* Something like `template <class T> friend void f<T>()'. */
8845 cp_error ("template-id `%D' in declaration of primary template",
8850 /* A friend declaration of the form friend void f<>(). Record
8851 the information in the TEMPLATE_ID_EXPR. */
8852 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8853 DECL_TEMPLATE_INFO (decl
)
8854 = perm_tree_cons (TREE_OPERAND (orig_declarator
, 0),
8855 TREE_OPERAND (orig_declarator
, 1),
8860 /* Plain overloading: will not be grok'd by grokclassfn. */
8861 if (! ctype
&& ! processing_template_decl
8862 && DECL_LANGUAGE (decl
) != lang_c
8863 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8864 set_mangled_name_for_decl (decl
);
8867 /* Make the init_value nonzero so pushdecl knows this is not
8868 tentative. error_mark_node is replaced later with the BLOCK. */
8869 DECL_INITIAL (decl
) = error_mark_node
;
8871 /* Caller will do the rest of this. */
8875 if (check
&& funcdef_flag
)
8876 DECL_INITIAL (decl
) = error_mark_node
;
8878 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8881 /* Just handle constructors here. We could do this
8882 inside the following if stmt, but I think
8883 that the code is more legible by breaking this
8884 case out. See comments below for what each of
8885 the following calls is supposed to do. */
8886 DECL_CONSTRUCTOR_P (decl
) = 1;
8888 grokclassfn (ctype
, decl
, flags
, quals
);
8890 decl
= check_explicit_specialization (orig_declarator
, decl
,
8892 2 * (funcdef_flag
!= 0) +
8893 4 * (friendp
!= 0));
8894 if (decl
== error_mark_node
)
8897 if ((! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8900 tmp
= check_classfn (ctype
, decl
);
8902 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8903 tmp
= DECL_TEMPLATE_RESULT(tmp
);
8905 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8906 cp_error ("definition of implicitly-declared `%D'", tmp
);
8907 if (tmp
&& duplicate_decls (decl
, tmp
))
8910 if (! grok_ctor_properties (ctype
, decl
))
8917 /* Function gets the ugly name, field gets the nice one.
8918 This call may change the type of the function (because
8919 of default parameters)! */
8920 if (ctype
!= NULL_TREE
)
8921 grokclassfn (ctype
, decl
, flags
, quals
);
8923 decl
= check_explicit_specialization (orig_declarator
, decl
,
8925 2 * (funcdef_flag
!= 0) +
8926 4 * (friendp
!= 0));
8927 if (decl
== error_mark_node
)
8930 if (ctype
!= NULL_TREE
8931 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8934 tmp
= check_classfn (ctype
, decl
);
8936 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8937 tmp
= DECL_TEMPLATE_RESULT (tmp
);
8939 if (tmp
&& DECL_STATIC_FUNCTION_P (tmp
)
8940 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8942 /* Remove the `this' parm added by grokclassfn.
8943 XXX Isn't this done in start_function, too? */
8944 revert_static_member_fn (&decl
, NULL
, NULL
);
8945 last_function_parms
= TREE_CHAIN (last_function_parms
);
8947 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8948 cp_error ("definition of implicitly-declared `%D'", tmp
);
8951 /* Attempt to merge the declarations. This can fail, in
8952 the case of some illegal specialization declarations. */
8953 if (!duplicate_decls (decl
, tmp
))
8954 cp_error ("no `%#D' member function declared in class `%T'",
8960 if (ctype
== NULL_TREE
|| check
)
8965 DECL_VIRTUAL_P (decl
) = 1;
8966 if (DECL_VINDEX (decl
) == NULL_TREE
)
8967 DECL_VINDEX (decl
) = error_mark_node
;
8968 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
8975 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
8978 RID_BIT_TYPE
*specbits_in
;
8984 RID_BIT_TYPE specbits
;
8986 specbits
= *specbits_in
;
8988 if (TREE_CODE (type
) == OFFSET_TYPE
)
8990 /* If you declare a static member so that it
8991 can be initialized, the code will reach here. */
8992 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
8993 type
= TREE_TYPE (type
);
8994 decl
= build_lang_field_decl (VAR_DECL
, declarator
, type
);
8995 DECL_CONTEXT (decl
) = basetype
;
8996 DECL_CLASS_CONTEXT (decl
) = basetype
;
8997 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
, declarator
);
9004 context
= in_namespace
;
9005 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
9006 context
= current_namespace
;
9008 context
= NULL_TREE
;
9010 decl
= build_decl (VAR_DECL
, declarator
, complete_type (type
));
9013 set_decl_namespace (decl
, context
, 0);
9015 context
= DECL_CONTEXT (decl
);
9016 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
9017 DECL_ASSEMBLER_NAME (decl
) = build_static_name (context
, declarator
);
9021 set_decl_namespace (decl
, in_namespace
, 0);
9023 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
9025 DECL_THIS_EXTERN (decl
) = 1;
9026 DECL_EXTERNAL (decl
) = !initialized
;
9029 /* In class context, static means one per class,
9030 public access, and static storage. */
9031 if (DECL_CLASS_SCOPE_P (decl
))
9033 TREE_PUBLIC (decl
) = 1;
9034 TREE_STATIC (decl
) = 1;
9035 DECL_EXTERNAL (decl
) = 0;
9037 /* At top level, either `static' or no s.c. makes a definition
9038 (perhaps tentative), and absence of `static' makes it public. */
9039 else if (toplevel_bindings_p ())
9041 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
9042 && (DECL_THIS_EXTERN (decl
) || ! constp
));
9043 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
9045 /* Not at top level, only `static' makes a static definition. */
9048 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
9049 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
9052 if (TREE_PUBLIC (decl
))
9054 /* [basic.link]: A name with no linkage (notably, the name of a class
9055 or enumeration declared in a local scope) shall not be used to
9056 declare an entity with linkage.
9058 Only check this for public decls for now. */
9059 tree t
= no_linkage_check (TREE_TYPE (decl
));
9062 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
9063 /* Ignore for now; `enum { foo } e' is pretty common. */;
9065 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
9073 /* Create and return a canonical pointer to member function type, for
9074 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
9077 build_ptrmemfunc_type (type
)
9084 /* If a canonical type already exists for this type, use it. We use
9085 this method instead of type_hash_canon, because it only does a
9086 simple equality check on the list of field members. */
9088 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
9091 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
9093 u
= make_lang_type (UNION_TYPE
);
9094 SET_IS_AGGR_TYPE (u
, 0);
9095 fields
[0] = build_lang_field_decl (FIELD_DECL
, pfn_identifier
, type
);
9096 fields
[1] = build_lang_field_decl (FIELD_DECL
, delta2_identifier
,
9098 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9099 TYPE_NAME (u
) = NULL_TREE
;
9101 t
= make_lang_type (RECORD_TYPE
);
9103 /* Let the front-end know this is a pointer to member function... */
9104 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
9105 /* ... and not really an aggregate. */
9106 SET_IS_AGGR_TYPE (t
, 0);
9108 fields
[0] = build_lang_field_decl (FIELD_DECL
, delta_identifier
,
9110 fields
[1] = build_lang_field_decl (FIELD_DECL
, index_identifier
,
9112 fields
[2] = build_lang_field_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
9113 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
9117 /* Zap out the name so that the back-end will give us the debugging
9118 information for this anonymous RECORD_TYPE. */
9119 TYPE_NAME (t
) = NULL_TREE
;
9121 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
9123 /* Seems to be wanted. */
9124 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
9128 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
9129 Check to see that the definition is valid. Issue appropriate error
9130 messages. Return 1 if the definition is particularly bad, or 0
9134 check_static_variable_definition (decl
, type
)
9138 /* Motion 10 at San Diego: If a static const integral data member is
9139 initialized with an integral constant expression, the initializer
9140 may appear either in the declaration (within the class), or in
9141 the definition, but not both. If it appears in the class, the
9142 member is a member constant. The file-scope definition is always
9144 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
9146 cp_error ("in-class initialization of static data member of non-integral type `%T'",
9148 /* If we just return the declaration, crashes will sometimes
9149 occur. We therefore return void_type_node, as if this was a
9150 friend declaration, to cause callers to completely ignore
9151 this declaration. */
9154 else if (!CP_TYPE_CONST_P (type
))
9155 cp_error ("ANSI C++ forbids in-class initialization of non-const static member `%D'",
9157 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
9158 cp_pedwarn ("ANSI C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
9163 /* Given declspecs and a declarator,
9164 determine the name and type of the object declared
9165 and construct a ..._DECL node for it.
9166 (In one case we can return a ..._TYPE node instead.
9167 For invalid input we sometimes return 0.)
9169 DECLSPECS is a chain of tree_list nodes whose value fields
9170 are the storage classes and type specifiers.
9172 DECL_CONTEXT says which syntactic context this declaration is in:
9173 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
9174 FUNCDEF for a function definition. Like NORMAL but a few different
9175 error messages in each case. Return value may be zero meaning
9176 this definition is too screwy to try to parse.
9177 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
9178 handle member functions (which have FIELD context).
9179 Return value may be zero meaning this definition is too screwy to
9181 PARM for a parameter declaration (either within a function prototype
9182 or before a function body). Make a PARM_DECL, or return void_type_node.
9183 CATCHPARM for a parameter declaration before a catch clause.
9184 TYPENAME if for a typename (in a cast or sizeof).
9185 Don't make a DECL node; just return the ..._TYPE node.
9186 FIELD for a struct or union field; make a FIELD_DECL.
9187 BITFIELD for a field with specified width.
9188 INITIALIZED is 1 if the decl has an initializer.
9190 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
9191 normal attributes in TREE_PURPOSE, or NULL_TREE.
9193 In the TYPENAME case, DECLARATOR is really an absolute declarator.
9194 It may also be so in the PARM case, for a prototype where the
9195 argument type is specified but not the name.
9197 This function is where the complicated C meanings of `static'
9198 and `extern' are interpreted.
9200 For C++, if there is any monkey business to do, the function which
9201 calls this one must do it, i.e., prepending instance variables,
9202 renaming overloaded function names, etc.
9204 Note that for this C++, it is an error to define a method within a class
9205 which does not belong to that class.
9207 Except in the case where SCOPE_REFs are implicitly known (such as
9208 methods within a class being redundantly qualified),
9209 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
9210 (class_name::decl_name). The caller must also deal with this.
9212 If a constructor or destructor is seen, and the context is FIELD,
9213 then the type gains the attribute TREE_HAS_x. If such a declaration
9214 is erroneous, NULL_TREE is returned.
9216 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
9217 function, these are the qualifiers to give to the `this' pointer.
9219 May return void_type_node if the declarator turned out to be a friend.
9220 See grokfield for details. */
9222 enum return_types
{ return_normal
, return_ctor
, return_dtor
, return_conversion
};
9225 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
9228 enum decl_context decl_context
;
9232 RID_BIT_TYPE specbits
;
9235 tree type
= NULL_TREE
;
9241 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
9242 int explicit_int
= 0;
9243 int explicit_char
= 0;
9244 int defaulted_int
= 0;
9245 int opaque_typedef
= 0;
9246 tree typedef_decl
= NULL_TREE
;
9248 tree typedef_type
= NULL_TREE
;
9249 int funcdef_flag
= 0;
9250 enum tree_code innermost_code
= ERROR_MARK
;
9253 /* See the code below that used this. */
9254 tree decl_machine_attr
= NULL_TREE
;
9256 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
9257 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
9258 tree init
= NULL_TREE
;
9260 /* Keep track of what sort of function is being processed
9261 so that we can warn about default return values, or explicit
9262 return values which do not match prescribed defaults. */
9263 enum return_types return_type
= return_normal
;
9265 tree dname
= NULL_TREE
;
9266 tree ctype
= current_class_type
;
9267 tree ctor_return_type
= NULL_TREE
;
9268 enum overload_flags flags
= NO_SPECIAL
;
9269 tree quals
= NULL_TREE
;
9270 tree raises
= NULL_TREE
;
9271 int template_count
= 0;
9272 tree in_namespace
= NULL_TREE
;
9276 RIDBIT_RESET_ALL (specbits
);
9277 if (decl_context
== FUNCDEF
)
9278 funcdef_flag
= 1, decl_context
= NORMAL
;
9279 else if (decl_context
== MEMFUNCDEF
)
9280 funcdef_flag
= -1, decl_context
= FIELD
;
9281 else if (decl_context
== BITFIELD
)
9282 bitfield
= 1, decl_context
= FIELD
;
9284 /* Look inside a declarator for the name being declared
9285 and get it as a string, for an error message. */
9287 tree
*next
= &declarator
;
9291 while (next
&& *next
)
9294 switch (TREE_CODE (decl
))
9297 /* For attributes. */
9298 next
= &TREE_VALUE (decl
);
9303 next
= &TREE_OPERAND (decl
, 0);
9306 case BIT_NOT_EXPR
: /* For C++ destructors! */
9308 tree name
= TREE_OPERAND (decl
, 0);
9309 tree rename
= NULL_TREE
;
9311 my_friendly_assert (flags
== NO_SPECIAL
, 152);
9313 return_type
= return_dtor
;
9314 if (TREE_CODE (name
) == TYPE_DECL
)
9315 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
9316 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
9317 if (ctype
== NULL_TREE
)
9319 if (current_class_type
== NULL_TREE
)
9321 error ("destructors must be member functions");
9326 tree t
= constructor_name (current_class_name
);
9333 tree t
= constructor_name (ctype
);
9340 cp_error ("destructor `%T' must match class name `%T'",
9342 TREE_OPERAND (decl
, 0) = rename
;
9348 case ADDR_EXPR
: /* C++ reference declaration */
9353 innermost_code
= TREE_CODE (decl
);
9354 next
= &TREE_OPERAND (decl
, 0);
9358 if (parmlist_is_exprlist (TREE_OPERAND (decl
, 1)))
9360 /* This is actually a variable declaration using
9361 constructor syntax. We need to call start_decl and
9362 cp_finish_decl so we can get the variable
9365 tree attributes
, prefix_attributes
;
9367 *next
= TREE_OPERAND (decl
, 0);
9368 init
= TREE_OPERAND (decl
, 1);
9372 attributes
= TREE_PURPOSE (attrlist
);
9373 prefix_attributes
= TREE_VALUE (attrlist
);
9377 attributes
= NULL_TREE
;
9378 prefix_attributes
= NULL_TREE
;
9381 decl
= start_decl (declarator
, declspecs
, 1,
9382 attributes
, prefix_attributes
);
9385 /* Look for __unused__ attribute */
9386 if (TREE_USED (TREE_TYPE (decl
)))
9387 TREE_USED (decl
) = 1;
9388 finish_decl (decl
, init
, NULL_TREE
);
9391 cp_error ("invalid declarator");
9394 innermost_code
= TREE_CODE (decl
);
9395 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
9396 ctype
= current_class_type
;
9398 && TREE_OPERAND (decl
, 0)
9399 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
9400 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
9401 == constructor_name_full (ctype
))
9402 || (DECL_NAME (TREE_OPERAND (decl
, 0))
9403 == constructor_name (ctype
)))))
9404 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9405 next
= &TREE_OPERAND (decl
, 0);
9407 if (ctype
!= NULL_TREE
9408 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
9409 && decl
== constructor_name (ctype
))
9411 return_type
= return_ctor
;
9412 ctor_return_type
= ctype
;
9417 case TEMPLATE_ID_EXPR
:
9419 tree fns
= TREE_OPERAND (decl
, 0);
9421 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9422 fns
= TREE_OPERAND (fns
, 0);
9425 if (TREE_CODE (dname
) == COMPONENT_REF
)
9426 dname
= TREE_OPERAND (dname
, 1);
9427 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9429 my_friendly_assert (is_overloaded_fn (dname
),
9431 dname
= DECL_NAME (get_first_fn (dname
));
9436 case IDENTIFIER_NODE
:
9437 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9444 cp_error ("declarator-id missing; using reserved word `%D'",
9446 name
= IDENTIFIER_POINTER (dname
);
9448 if (! IDENTIFIER_OPNAME_P (dname
)
9449 /* GNU/Linux headers use '__op'. Arrgh. */
9450 || (IDENTIFIER_TYPENAME_P (dname
) && ! TREE_TYPE (dname
)))
9451 name
= IDENTIFIER_POINTER (dname
);
9454 if (IDENTIFIER_TYPENAME_P (dname
))
9456 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9457 flags
= TYPENAME_FLAG
;
9458 ctor_return_type
= TREE_TYPE (dname
);
9459 return_type
= return_conversion
;
9461 name
= operator_name_string (dname
);
9468 /* Perform error checking, and decide on a ctype. */
9469 tree cname
= TREE_OPERAND (decl
, 0);
9470 if (cname
== NULL_TREE
)
9472 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9475 in_namespace
= TREE_OPERAND (decl
, 0);
9476 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9478 else if (! is_aggr_type (cname
, 1))
9479 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9480 /* Must test TREE_OPERAND (decl, 1), in case user gives
9481 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9482 else if (TREE_OPERAND (decl
, 1)
9483 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9485 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9486 || TREE_CODE (cname
) == TEMPLATE_TEMPLATE_PARM
)
9488 cp_error ("`%T::%D' is not a valid declarator", cname
,
9489 TREE_OPERAND (decl
, 1));
9490 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9491 cname
, TREE_OPERAND (decl
, 1));
9492 return void_type_node
;
9494 else if (ctype
== NULL_TREE
)
9496 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9497 TREE_OPERAND (decl
, 0) = ctype
;
9500 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9502 cp_error ("type `%T' is not derived from type `%T'",
9504 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9510 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9511 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9512 == constructor_name_full (ctype
))
9513 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9514 == constructor_name (ctype
))))
9515 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9516 next
= &TREE_OPERAND (decl
, 1);
9520 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9521 && constructor_name (ctype
) == decl
)
9523 return_type
= return_ctor
;
9524 ctor_return_type
= ctype
;
9526 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9527 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9528 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9529 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9531 return_type
= return_dtor
;
9532 ctor_return_type
= ctype
;
9534 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9535 next
= &TREE_OPERAND (decl
, 0);
9546 /* Parse error puts this typespec where
9547 a declarator should go. */
9548 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9549 if (TREE_TYPE (decl
) == current_class_type
)
9550 cp_error (" perhaps you want `%T' for a constructor",
9551 current_class_name
);
9552 dname
= DECL_NAME (decl
);
9553 name
= IDENTIFIER_POINTER (dname
);
9555 /* Avoid giving two errors for this. */
9556 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9558 declspecs
= temp_tree_cons (NULL_TREE
, integer_type_node
,
9565 cp_compiler_error ("`%D' as declarator", decl
);
9566 return 0; /* We used to do a 155 abort here. */
9573 /* A function definition's declarator must have the form of
9574 a function declarator. */
9576 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9579 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9580 && innermost_code
!= CALL_EXPR
9581 && ! (ctype
&& declspecs
== NULL_TREE
))
9583 cp_error ("declaration of `%D' as non-function", dname
);
9584 return void_type_node
;
9587 /* Anything declared one level down from the top level
9588 must be one of the parameters of a function
9589 (because the body is at least two levels down). */
9591 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9592 by not allowing C++ class definitions to specify their parameters
9593 with xdecls (must be spec.d in the parmlist).
9595 Since we now wait to push a class scope until we are sure that
9596 we are in a legitimate method context, we must set oldcname
9597 explicitly (since current_class_name is not yet alive).
9599 We also want to avoid calling this a PARM if it is in a namespace. */
9601 if (decl_context
== NORMAL
&& ! namespace_bindings_p ()
9602 && ! pseudo_global_level_p ())
9604 struct binding_level
*b
= current_binding_level
;
9605 current_binding_level
= b
->level_chain
;
9606 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9607 decl_context
= PARM
;
9608 current_binding_level
= b
;
9611 /* Look through the decl specs and record which ones appear.
9612 Some typespecs are defined as built-in typenames.
9613 Others, the ones that are modifiers of other types,
9614 are represented by bits in SPECBITS: set the bits for
9615 the modifiers that appear. Storage class keywords are also in SPECBITS.
9617 If there is a typedef name or a type, store the type in TYPE.
9618 This includes builtin typedefs such as `int'.
9620 Set EXPLICIT_INT if the type is `int' or `char' and did not
9621 come from a user typedef.
9623 Set LONGLONG if `long' is mentioned twice.
9625 For C++, constructors and destructors have their own fast treatment. */
9627 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
9632 /* Certain parse errors slip through. For example,
9633 `int class;' is not caught by the parser. Try
9634 weakly to recover here. */
9635 if (TREE_CODE (spec
) != TREE_LIST
)
9638 id
= TREE_VALUE (spec
);
9640 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9642 if (id
== ridpointers
[(int) RID_INT
]
9643 || id
== ridpointers
[(int) RID_CHAR
]
9644 || id
== ridpointers
[(int) RID_BOOL
]
9645 || id
== ridpointers
[(int) RID_WCHAR
])
9649 if (id
== ridpointers
[(int) RID_BOOL
])
9650 error ("`bool' is now a keyword");
9652 cp_error ("extraneous `%T' ignored", id
);
9656 if (id
== ridpointers
[(int) RID_INT
])
9658 else if (id
== ridpointers
[(int) RID_CHAR
])
9660 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
9664 /* C++ aggregate types. */
9665 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
9668 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
9670 type
= IDENTIFIER_TYPE_VALUE (id
);
9674 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
9676 if (ridpointers
[i
] == id
)
9678 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
9680 if (pedantic
&& ! in_system_header
&& warn_long_long
)
9681 pedwarn ("ANSI C++ does not support `long long'");
9683 error ("`long long long' is too long for GCC");
9687 else if (RIDBIT_SETP (i
, specbits
))
9688 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
9689 RIDBIT_SET (i
, specbits
);
9694 /* C++ aggregate types. */
9695 else if (TREE_CODE (id
) == TYPE_DECL
|| TREE_CODE (id
) == TEMPLATE_DECL
)
9698 cp_error ("multiple declarations `%T' and `%T'", type
,
9702 type
= TREE_TYPE (id
);
9703 TREE_VALUE (spec
) = type
;
9708 error ("two or more data types in declaration of `%s'", name
);
9709 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9711 register tree t
= lookup_name (id
, 1);
9712 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
9713 error ("`%s' fails to be a typedef or built in type",
9714 IDENTIFIER_POINTER (id
));
9717 type
= TREE_TYPE (t
);
9719 /* See the code below that used this. */
9720 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
9725 else if (id
!= error_mark_node
)
9726 /* Can't change CLASS nodes into RECORD nodes here! */
9732 typedef_type
= type
;
9734 /* No type at all: default to `int', and set DEFAULTED_INT
9735 because it was not a user-defined typedef.
9736 Except when we have a `typedef' inside a signature, in
9737 which case the type defaults to `unknown type' and is
9738 instantiated when assigning to a signature pointer or ref. */
9740 if (type
== NULL_TREE
9741 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
9742 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9743 || RIDBIT_SETP (RID_LONG
, specbits
)
9744 || RIDBIT_SETP (RID_SHORT
, specbits
)))
9746 /* These imply 'int'. */
9747 type
= integer_type_node
;
9751 if (type
== NULL_TREE
)
9754 if (return_type
== return_dtor
)
9755 type
= void_type_node
;
9756 else if (return_type
== return_ctor
)
9757 type
= build_pointer_type (ctor_return_type
);
9758 else if (return_type
== return_conversion
)
9759 type
= ctor_return_type
;
9760 else if (current_class_type
9761 && IS_SIGNATURE (current_class_type
)
9762 && RIDBIT_SETP (RID_TYPEDEF
, specbits
)
9763 && (decl_context
== FIELD
|| decl_context
== NORMAL
))
9767 type
= copy_node (opaque_type_node
);
9771 /* We handle `main' specially here, because 'main () { }' is so
9772 common. With no options, it is allowed. With -Wreturn-type,
9773 it is a warning. It is only an error with -pedantic-errors. */
9774 int is_main
= (funcdef_flag
9775 && MAIN_NAME_P (dname
)
9776 && ctype
== NULL_TREE
9777 && in_namespace
== NULL_TREE
9778 && current_namespace
== global_namespace
);
9780 if (in_system_header
)
9781 /* Allow it, sigh. */;
9782 else if (pedantic
|| ! is_main
)
9783 cp_pedwarn ("ANSI C++ forbids declaration `%D' with no type",
9785 else if (warn_return_type
)
9786 cp_warning ("ANSI C++ forbids declaration `%D' with no type",
9789 type
= integer_type_node
;
9792 else if (return_type
== return_dtor
)
9794 error ("return type specification for destructor invalid");
9795 type
= void_type_node
;
9797 else if (return_type
== return_ctor
)
9799 error ("return type specification for constructor invalid");
9800 type
= build_pointer_type (ctor_return_type
);
9802 else if (return_type
== return_conversion
)
9804 if (!same_type_p (type
, ctor_return_type
))
9805 cp_error ("operator `%T' declared to return `%T'",
9806 ctor_return_type
, type
);
9808 cp_pedwarn ("return type specified for `operator %T'",
9811 type
= ctor_return_type
;
9816 /* Now process the modifiers that were specified
9817 and check for invalid combinations. */
9819 /* Long double is a special combination. */
9821 if (RIDBIT_SETP (RID_LONG
, specbits
)
9822 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
9824 RIDBIT_RESET (RID_LONG
, specbits
);
9825 type
= build_qualified_type (long_double_type_node
,
9826 CP_TYPE_QUALS (type
));
9829 /* Check all other uses of type modifiers. */
9831 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9832 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9833 || RIDBIT_SETP (RID_LONG
, specbits
)
9834 || RIDBIT_SETP (RID_SHORT
, specbits
))
9838 if (TREE_CODE (type
) == REAL_TYPE
)
9839 error ("short, signed or unsigned invalid for `%s'", name
);
9840 else if (TREE_CODE (type
) != INTEGER_TYPE
)
9841 error ("long, short, signed or unsigned invalid for `%s'", name
);
9842 else if (RIDBIT_SETP (RID_LONG
, specbits
)
9843 && RIDBIT_SETP (RID_SHORT
, specbits
))
9844 error ("long and short specified together for `%s'", name
);
9845 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9846 || RIDBIT_SETP (RID_SHORT
, specbits
))
9848 error ("long or short specified with char for `%s'", name
);
9849 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9850 || RIDBIT_SETP (RID_SHORT
, specbits
))
9851 && TREE_CODE (type
) == REAL_TYPE
)
9852 error ("long or short specified with floating type for `%s'", name
);
9853 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9854 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
9855 error ("signed and unsigned given together for `%s'", name
);
9859 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
9861 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
9863 if (flag_pedantic_errors
)
9868 /* Discard the type modifiers if they are invalid. */
9871 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
9872 RIDBIT_RESET (RID_SIGNED
, specbits
);
9873 RIDBIT_RESET (RID_LONG
, specbits
);
9874 RIDBIT_RESET (RID_SHORT
, specbits
);
9879 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
9880 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
9882 error ("complex invalid for `%s'", name
);
9883 RIDBIT_RESET (RID_COMPLEX
, specbits
);
9886 /* Decide whether an integer type is signed or not.
9887 Optionally treat bitfields as signed by default. */
9888 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9889 || (bitfield
&& ! flag_signed_bitfields
9890 && (explicit_int
|| defaulted_int
|| explicit_char
9891 /* A typedef for plain `int' without `signed'
9892 can be controlled just like plain `int'. */
9893 || ! (typedef_decl
!= NULL_TREE
9894 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
9895 && TREE_CODE (type
) != ENUMERAL_TYPE
9896 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)))
9899 type
= long_long_unsigned_type_node
;
9900 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9901 type
= long_unsigned_type_node
;
9902 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9903 type
= short_unsigned_type_node
;
9904 else if (type
== char_type_node
)
9905 type
= unsigned_char_type_node
;
9906 else if (typedef_decl
)
9907 type
= unsigned_type (type
);
9909 type
= unsigned_type_node
;
9911 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9912 && type
== char_type_node
)
9913 type
= signed_char_type_node
;
9915 type
= long_long_integer_type_node
;
9916 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9917 type
= long_integer_type_node
;
9918 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9919 type
= short_integer_type_node
;
9921 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
9923 /* If we just have "complex", it is equivalent to
9924 "complex double", but if any modifiers at all are specified it is
9925 the complex form of TYPE. E.g, "complex short" is
9926 "complex short int". */
9928 if (defaulted_int
&& ! longlong
9929 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
9930 || RIDBIT_SETP (RID_SHORT
, specbits
)
9931 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9932 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
9933 type
= complex_double_type_node
;
9934 else if (type
== integer_type_node
)
9935 type
= complex_integer_type_node
;
9936 else if (type
== float_type_node
)
9937 type
= complex_float_type_node
;
9938 else if (type
== double_type_node
)
9939 type
= complex_double_type_node
;
9940 else if (type
== long_double_type_node
)
9941 type
= complex_long_double_type_node
;
9943 type
= build_complex_type (type
);
9946 if (return_type
== return_conversion
9947 && (RIDBIT_SETP (RID_CONST
, specbits
)
9948 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
9949 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
9950 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
9953 /* Set CONSTP if this declaration is `const', whether by
9954 explicit specification or via a typedef.
9955 Likewise for VOLATILEP. */
9957 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
9959 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
9961 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
9962 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
9963 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
9964 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
9965 type
= cp_build_qualified_type (type
, type_quals
);
9967 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
9968 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
9969 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
9970 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
9971 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
9973 if (RIDBIT_SETP (RID_STATIC
, specbits
))
9974 staticp
= 1 + (decl_context
== FIELD
);
9976 if (virtualp
&& staticp
== 2)
9978 cp_error ("member `%D' cannot be declared both virtual and static",
9982 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
9983 RIDBIT_RESET (RID_FRIEND
, specbits
);
9985 /* $7.1.2, Function specifiers */
9986 if (friendp
&& explicitp
)
9987 error ("only declarations of constructors can be `explicit'");
9989 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
9991 if (decl_context
== PARM
)
9993 error ("non-member `%s' cannot be declared `mutable'", name
);
9994 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9996 else if (friendp
|| decl_context
== TYPENAME
)
9998 error ("non-object member `%s' cannot be declared `mutable'", name
);
9999 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10003 /* Warn if two storage classes are given. Default to `auto'. */
10005 if (RIDBIT_ANY_SET (specbits
))
10007 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
10008 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
10009 if (decl_context
== PARM
&& nclasses
> 0)
10010 error ("storage class specifiers invalid in parameter declarations");
10011 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10013 if (decl_context
== PARM
)
10014 error ("typedef declaration invalid in parameter declaration");
10017 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
10018 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
10021 /* Give error if `virtual' is used outside of class declaration. */
10023 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
10025 error ("virtual outside class declaration");
10028 if (current_class_name
== NULL_TREE
&& RIDBIT_SETP (RID_MUTABLE
, specbits
))
10030 error ("only members can be declared mutable");
10031 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10034 /* Static anonymous unions are dealt with here. */
10035 if (staticp
&& decl_context
== TYPENAME
10036 && TREE_CODE (declspecs
) == TREE_LIST
10037 && ANON_UNION_TYPE_P (TREE_VALUE (declspecs
)))
10038 decl_context
= FIELD
;
10040 /* Give error if `const,' `volatile,' `inline,' `friend,' or `virtual'
10041 is used in a signature member function declaration. */
10042 if (decl_context
== FIELD
10043 && IS_SIGNATURE (current_class_type
)
10044 && RIDBIT_NOTSETP (RID_TYPEDEF
, specbits
))
10046 if (type_quals
!= TYPE_UNQUALIFIED
)
10048 error ("type qualifiers specified for signature member function `%s'", name
);
10049 type_quals
= TYPE_UNQUALIFIED
;
10053 error ("`inline' specified for signature member function `%s'", name
);
10054 /* Later, we'll make signature member functions inline. */
10059 error ("`friend' declaration in signature definition");
10064 error ("`virtual' specified for signature member function `%s'",
10066 /* Later, we'll make signature member functions virtual. */
10071 /* Warn about storage classes that are invalid for certain
10072 kinds of declarations (parameters, typenames, etc.). */
10075 error ("multiple storage classes in declaration of `%s'", name
);
10076 else if (decl_context
!= NORMAL
&& nclasses
> 0)
10078 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
10079 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
10080 || RIDBIT_SETP (RID_AUTO
, specbits
)))
10082 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10084 else if (decl_context
== FIELD
10085 && ! IS_SIGNATURE (current_class_type
)
10086 /* C++ allows static class elements */
10087 && RIDBIT_SETP (RID_STATIC
, specbits
))
10088 /* C++ also allows inlines and signed and unsigned elements,
10089 but in those cases we don't come in here. */
10093 if (decl_context
== FIELD
)
10095 tree tmp
= NULL_TREE
;
10096 register int op
= 0;
10100 /* Avoid trying to get an operand off an identifier node. */
10101 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10104 tmp
= TREE_OPERAND (declarator
, 0);
10105 op
= IDENTIFIER_OPNAME_P (tmp
);
10107 error ("storage class specified for %s `%s'",
10108 IS_SIGNATURE (current_class_type
)
10110 ? "signature member operator"
10111 : "signature member function")
10112 : (op
? "member operator" : "field"),
10113 op
? operator_name_string (tmp
) : name
);
10116 error (((decl_context
== PARM
|| decl_context
== CATCHPARM
)
10117 ? "storage class specified for parameter `%s'"
10118 : "storage class specified for typename"), name
);
10119 RIDBIT_RESET (RID_REGISTER
, specbits
);
10120 RIDBIT_RESET (RID_AUTO
, specbits
);
10121 RIDBIT_RESET (RID_EXTERN
, specbits
);
10123 if (decl_context
== FIELD
&& IS_SIGNATURE (current_class_type
))
10125 RIDBIT_RESET (RID_STATIC
, specbits
);
10130 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
10132 if (toplevel_bindings_p ())
10134 /* It's common practice (and completely valid) to have a const
10135 be initialized and declared extern. */
10136 if (!(type_quals
& TYPE_QUAL_CONST
))
10137 warning ("`%s' initialized and declared `extern'", name
);
10140 error ("`%s' has both `extern' and initializer", name
);
10142 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
10143 && ! toplevel_bindings_p ())
10144 error ("nested function `%s' declared `extern'", name
);
10145 else if (toplevel_bindings_p ())
10147 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10148 error ("top-level declaration of `%s' specifies `auto'", name
);
10151 if (nclasses
> 0 && friendp
)
10152 error ("storage class specifiers invalid in friend function declarations");
10154 /* Now figure out the structure of the declarator proper.
10155 Descend through it, creating more complex types, until we reach
10156 the declared identifier (or NULL_TREE, in an absolute declarator). */
10158 inner_attrs
= NULL_TREE
;
10161 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
10162 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
10164 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
10165 an INDIRECT_REF (for *...),
10166 a CALL_EXPR (for ...(...)),
10167 an identifier (for the name being declared)
10168 or a null pointer (for the place in an absolute declarator
10169 where the name was omitted).
10170 For the last two cases, we have just exited the loop.
10172 For C++ it could also be
10173 a SCOPE_REF (for class :: ...). In this case, we have converted
10174 sensible names to types, and those are the values we use to
10175 qualify the member name.
10176 an ADDR_EXPR (for &...),
10177 a BIT_NOT_EXPR (for destructors)
10179 At this point, TYPE is the type of elements of an array,
10180 or for a function to return, or for a pointer to point to.
10181 After this sequence of ifs, TYPE is the type of the
10182 array or function or pointer, and DECLARATOR has had its
10183 outermost layer removed. */
10185 if (type
== error_mark_node
)
10187 if (TREE_CODE (declarator
) == SCOPE_REF
)
10188 declarator
= TREE_OPERAND (declarator
, 1);
10190 declarator
= TREE_OPERAND (declarator
, 0);
10193 if (quals
!= NULL_TREE
10194 && (declarator
== NULL_TREE
10195 || TREE_CODE (declarator
) != SCOPE_REF
))
10197 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
10198 ctype
= TYPE_METHOD_BASETYPE (type
);
10199 if (ctype
!= NULL_TREE
)
10201 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
10202 ctype
= grok_method_quals (ctype
, dummy
, quals
);
10203 type
= TREE_TYPE (dummy
);
10208 /* See the comment for the TREE_LIST case, below. */
10211 else if (inner_attrs
)
10213 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10214 inner_attrs
= NULL_TREE
;
10217 switch (TREE_CODE (declarator
))
10221 /* We encode a declarator with embedded attributes using
10222 a TREE_LIST. The attributes apply to the declarator
10223 directly inside them, so we have to skip an iteration
10224 before applying them to the type. If the declarator just
10225 inside is the declarator-id, we apply the attrs to the
10227 inner_attrs
= TREE_PURPOSE (declarator
);
10229 declarator
= TREE_VALUE (declarator
);
10235 register tree itype
= NULL_TREE
;
10236 register tree size
= TREE_OPERAND (declarator
, 1);
10237 /* The index is a signed object `sizetype' bits wide. */
10238 tree index_type
= signed_type (sizetype
);
10240 declarator
= TREE_OPERAND (declarator
, 0);
10242 /* Check for some types that there cannot be arrays of. */
10244 if (TREE_CODE (type
) == VOID_TYPE
)
10246 cp_error ("declaration of `%D' as array of voids", dname
);
10247 type
= error_mark_node
;
10250 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10252 cp_error ("declaration of `%D' as array of functions", dname
);
10253 type
= error_mark_node
;
10256 /* ARM $8.4.3: Since you can't have a pointer to a reference,
10257 you can't have arrays of references. If we allowed them,
10258 then we'd be saying x[i] is valid for an array x, but
10259 then you'd have to ask: what does `*(x + i)' mean? */
10260 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10262 if (decl_context
== TYPENAME
)
10263 cp_error ("cannot make arrays of references");
10265 cp_error ("declaration of `%D' as array of references",
10267 type
= error_mark_node
;
10270 if (TREE_CODE (type
) == OFFSET_TYPE
)
10272 cp_error ("declaration of `%D' as array of data members",
10274 type
= error_mark_node
;
10277 if (TREE_CODE (type
) == METHOD_TYPE
)
10279 cp_error ("declaration of `%D' as array of function members",
10281 type
= error_mark_node
;
10284 if (size
== error_mark_node
)
10285 type
= error_mark_node
;
10286 else if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
10290 the constant expressions that specify the bounds of
10291 the arrays can be omitted only for the first member
10292 of the sequence. */
10293 cp_error ("declaration of `%D' as multidimensional array",
10295 cp_error ("must have bounds for all dimensions except the first");
10296 type
= error_mark_node
;
10299 if (type
== error_mark_node
)
10302 /* VC++ spells a zero-sized array with []. */
10303 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
)
10304 size
= integer_zero_node
;
10308 /* Must suspend_momentary here because the index
10309 type may need to live until the end of the function.
10310 For example, it is used in the declaration of a
10311 variable which requires destructing at the end of
10312 the function; then build_vec_delete will need this
10314 int yes
= suspend_momentary ();
10315 /* Might be a cast. */
10316 if (TREE_CODE (size
) == NOP_EXPR
10317 && TREE_TYPE (size
) == TREE_TYPE (TREE_OPERAND (size
, 0)))
10318 size
= TREE_OPERAND (size
, 0);
10320 /* If this involves a template parameter, it will be a
10321 constant at instantiation time, but we don't know
10322 what the value is yet. Even if no template
10323 parameters are involved, we may an expression that
10324 is not a constant; we don't even simplify `1 + 2'
10325 when processing a template. */
10326 if (processing_template_decl
)
10328 /* Resolve a qualified reference to an enumerator or
10329 static const data member of ours. */
10330 if (TREE_CODE (size
) == SCOPE_REF
10331 && TREE_OPERAND (size
, 0) == current_class_type
)
10333 tree t
= lookup_field (current_class_type
,
10334 TREE_OPERAND (size
, 1), 0, 0);
10339 itype
= make_node (INTEGER_TYPE
);
10340 TYPE_MIN_VALUE (itype
) = size_zero_node
;
10341 TYPE_MAX_VALUE (itype
) = build_min
10342 (MINUS_EXPR
, sizetype
, size
, integer_one_node
);
10343 goto dont_grok_size
;
10346 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
10347 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
10348 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
10350 cp_error ("size of array `%D' has non-integer type",
10352 size
= integer_one_node
;
10354 if (TREE_READONLY_DECL_P (size
))
10355 size
= decl_constant_value (size
);
10356 if (pedantic
&& integer_zerop (size
))
10357 cp_pedwarn ("ANSI C++ forbids zero-size array `%D'", dname
);
10358 if (TREE_CONSTANT (size
))
10360 int old_flag_pedantic_errors
= flag_pedantic_errors
;
10361 int old_pedantic
= pedantic
;
10362 pedantic
= flag_pedantic_errors
= 1;
10363 /* Always give overflow errors on array subscripts. */
10364 constant_expression_warning (size
);
10365 pedantic
= old_pedantic
;
10366 flag_pedantic_errors
= old_flag_pedantic_errors
;
10367 if (INT_CST_LT (size
, integer_zero_node
))
10369 cp_error ("size of array `%D' is negative", dname
);
10370 size
= integer_one_node
;
10378 cp_pedwarn ("ANSI C++ forbids variable-size array `%D'",
10381 cp_pedwarn ("ANSI C++ forbids variable-size array");
10386 = fold (build_binary_op (MINUS_EXPR
,
10387 cp_convert (index_type
, size
),
10388 cp_convert (index_type
,
10389 integer_one_node
)));
10390 if (! TREE_CONSTANT (itype
))
10391 itype
= variable_size (itype
);
10392 else if (TREE_OVERFLOW (itype
))
10394 error ("overflow in array dimension");
10395 TREE_OVERFLOW (itype
) = 0;
10398 /* If we're a parm, we need to have a permanent type so
10399 mangling checks for re-use will work right. If both the
10400 element and index types are permanent, the array type
10402 if (decl_context
== PARM
10403 && allocation_temporary_p () && TREE_PERMANENT (type
))
10405 push_obstacks (&permanent_obstack
, &permanent_obstack
);
10406 itype
= build_index_type (itype
);
10410 itype
= build_index_type (itype
);
10413 resume_momentary (yes
);
10416 type
= build_cplus_array_type (type
, itype
);
10425 tree inner_parms
= TREE_OPERAND (declarator
, 1);
10426 tree inner_decl
= TREE_OPERAND (declarator
, 0);
10428 /* Declaring a function type.
10429 Make sure we have a valid type for the function to return. */
10431 /* We now know that the TYPE_QUALS don't apply to the
10432 decl, but to its return type. */
10433 type_quals
= TYPE_UNQUALIFIED
;
10435 /* Warn about some types functions can't return. */
10437 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10439 error ("`%s' declared as function returning a function", name
);
10440 type
= integer_type_node
;
10442 if (TREE_CODE (type
) == ARRAY_TYPE
)
10444 error ("`%s' declared as function returning an array", name
);
10445 type
= integer_type_node
;
10448 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
10449 inner_decl
= TREE_OPERAND (inner_decl
, 1);
10451 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
10452 inner_decl
= dname
;
10454 /* Pick up type qualifiers which should be applied to `this'. */
10455 quals
= TREE_OPERAND (declarator
, 2);
10457 /* Pick up the exception specifications. */
10458 raises
= TREE_TYPE (declarator
);
10460 /* Say it's a definition only for the CALL_EXPR
10461 closest to the identifier. */
10464 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
10465 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
10466 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
10468 if (ctype
== NULL_TREE
10469 && decl_context
== FIELD
10471 && (friendp
== 0 || dname
== current_class_name
))
10472 ctype
= current_class_type
;
10474 if (ctype
&& return_type
== return_conversion
)
10475 TYPE_HAS_CONVERSION (ctype
) = 1;
10476 if (ctype
&& constructor_name (ctype
) == dname
)
10478 /* We are within a class's scope. If our declarator name
10479 is the same as the class name, and we are defining
10480 a function, then it is a constructor/destructor, and
10481 therefore returns a void type. */
10483 if (flags
== DTOR_FLAG
)
10485 /* ANSI C++ June 5 1992 WP 12.4.1. A destructor may
10486 not be declared const or volatile. A destructor
10487 may not be static. */
10489 error ("destructor cannot be static member function");
10492 cp_error ("destructors may not be `%s'",
10493 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10496 if (decl_context
== FIELD
)
10498 if (! member_function_or_else (ctype
, current_class_type
,
10499 "destructor for alien class `%s' cannot be a member"))
10500 return void_type_node
;
10503 else /* It's a constructor. */
10505 if (explicitp
== 1)
10507 /* ANSI C++ June 5 1992 WP 12.1.2. A constructor may
10508 not be declared const or volatile. A constructor may
10509 not be virtual. A constructor may not be static. */
10511 error ("constructor cannot be static member function");
10514 pedwarn ("constructors cannot be declared virtual");
10519 cp_error ("constructors may not be `%s'",
10520 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10524 RID_BIT_TYPE tmp_bits
;
10525 bcopy ((void*)&specbits
, (void*)&tmp_bits
, sizeof (RID_BIT_TYPE
));
10526 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10527 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10528 if (RIDBIT_ANY_SET (tmp_bits
))
10529 error ("return value type specifier for constructor ignored");
10531 type
= build_pointer_type (ctype
);
10532 if (decl_context
== FIELD
10533 && IS_SIGNATURE (current_class_type
))
10535 error ("constructor not allowed in signature");
10536 return void_type_node
;
10538 else if (decl_context
== FIELD
)
10540 if (! member_function_or_else (ctype
, current_class_type
,
10541 "constructor for alien class `%s' cannot be member"))
10542 return void_type_node
;
10543 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10544 if (return_type
!= return_ctor
)
10548 if (decl_context
== FIELD
)
10554 error ("can't initialize friend function `%s'", name
);
10557 /* Cannot be both friend and virtual. */
10558 error ("virtual functions cannot be friends");
10559 RIDBIT_RESET (RID_FRIEND
, specbits
);
10562 if (decl_context
== NORMAL
)
10563 error ("friend declaration not in class definition");
10564 if (current_function_decl
&& funcdef_flag
)
10565 cp_error ("can't define friend function `%s' in a local class definition",
10569 /* Construct the function type and go to the next
10570 inner layer of declarator. */
10572 declarator
= TREE_OPERAND (declarator
, 0);
10574 /* FIXME: This is where default args should be fully
10577 arg_types
= grokparms (inner_parms
, funcdecl_p
? funcdef_flag
: 0);
10579 if (declarator
&& flags
== DTOR_FLAG
)
10581 /* A destructor declared in the body of a class will
10582 be represented as a BIT_NOT_EXPR. But, we just
10583 want the underlying IDENTIFIER. */
10584 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10585 declarator
= TREE_OPERAND (declarator
, 0);
10587 if (strict_prototype
== 0 && arg_types
== NULL_TREE
)
10588 arg_types
= void_list_node
;
10589 else if (arg_types
== NULL_TREE
10590 || arg_types
!= void_list_node
)
10592 cp_error ("destructors may not have parameters");
10593 arg_types
= void_list_node
;
10594 last_function_parms
= NULL_TREE
;
10598 /* ANSI says that `const int foo ();'
10599 does not make the function foo const. */
10600 type
= build_function_type (type
, arg_types
);
10604 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10605 if (TREE_PURPOSE (t
)
10606 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10608 add_defarg_fn (type
);
10617 /* Filter out pointers-to-references and references-to-references.
10618 We can get these if a TYPE_DECL is used. */
10620 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10622 error ("cannot declare %s to references",
10623 TREE_CODE (declarator
) == ADDR_EXPR
10624 ? "references" : "pointers");
10625 declarator
= TREE_OPERAND (declarator
, 0);
10629 if (TREE_CODE (type
) == OFFSET_TYPE
10630 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10631 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10633 cp_error ("cannot declare pointer to `%#T' member",
10635 type
= TREE_TYPE (type
);
10638 /* Merge any constancy or volatility into the target type
10639 for the pointer. */
10641 /* We now know that the TYPE_QUALS don't apply to the decl,
10642 but to the target of the pointer. */
10643 type_quals
= TYPE_UNQUALIFIED
;
10645 if (IS_SIGNATURE (type
))
10647 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10649 if (CLASSTYPE_METHOD_VEC (type
) == NULL_TREE
10650 && TYPE_SIZE (type
))
10651 cp_warning ("empty signature `%T' used in signature reference declaration",
10654 type
= build_signature_reference_type (type
);
10656 sorry ("signature reference");
10662 if (CLASSTYPE_METHOD_VEC (type
) == NULL_TREE
10663 && TYPE_SIZE (type
))
10664 cp_warning ("empty signature `%T' used in signature pointer declaration",
10666 type
= build_signature_pointer_type (type
);
10669 else if (TREE_CODE (declarator
) == ADDR_EXPR
)
10671 if (TREE_CODE (type
) == VOID_TYPE
)
10672 error ("invalid type: `void &'");
10674 type
= build_reference_type (type
);
10676 else if (TREE_CODE (type
) == METHOD_TYPE
)
10677 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10679 type
= build_pointer_type (type
);
10681 /* Process a list of type modifier keywords (such as
10682 const or volatile) that were given inside the `*' or `&'. */
10684 if (TREE_TYPE (declarator
))
10686 register tree typemodlist
;
10692 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10693 typemodlist
= TREE_CHAIN (typemodlist
))
10695 tree qualifier
= TREE_VALUE (typemodlist
);
10697 if (qualifier
== ridpointers
[(int) RID_CONST
])
10699 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10701 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10706 error ("invalid type modifier within pointer declarator");
10710 pedwarn ("duplicate `const'");
10712 pedwarn ("duplicate `volatile'");
10714 pedwarn ("duplicate `restrict'");
10716 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10717 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10718 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10719 if (TREE_CODE (declarator
) == ADDR_EXPR
10720 && (constp
|| volatilep
))
10723 pedwarn ("discarding `const' applied to a reference");
10725 pedwarn ("discarding `volatile' applied to a reference");
10726 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10728 type
= cp_build_qualified_type (type
, type_quals
);
10730 declarator
= TREE_OPERAND (declarator
, 0);
10736 /* We have converted type names to NULL_TREE if the
10737 name was bogus, or to a _TYPE node, if not.
10739 The variable CTYPE holds the type we will ultimately
10740 resolve to. The code here just needs to build
10741 up appropriate member types. */
10742 tree sname
= TREE_OPERAND (declarator
, 1);
10745 /* Destructors can have their visibilities changed as well. */
10746 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10747 sname
= TREE_OPERAND (sname
, 0);
10749 if (TREE_COMPLEXITY (declarator
) == 0)
10750 /* This needs to be here, in case we are called
10751 multiple times. */ ;
10752 else if (TREE_COMPLEXITY (declarator
) == -1)
10753 /* Namespace member. */
10754 pop_decl_namespace ();
10755 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10756 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10757 else if (! IS_AGGR_TYPE_CODE
10758 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10760 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10762 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10763 that refer to ctype. They couldn't be resolved earlier
10764 because we hadn't pushed into the class yet.
10765 Example: resolve 'B<T>::type' in
10766 'B<typename B<T>::type> B<T>::f () { }'. */
10767 if (current_template_parms
10768 && uses_template_parms (type
)
10769 && uses_template_parms (current_class_type
))
10771 tree args
= current_template_args ();
10772 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10775 /* This pop_nested_class corresponds to the
10776 push_nested_class used to push into class scope for
10777 parsing the argument list of a function decl, in
10779 pop_nested_class ();
10780 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10783 my_friendly_abort (16);
10785 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10787 /* We had a reference to a global decl, or
10788 perhaps we were given a non-aggregate typedef,
10789 in which case we cleared this out, and should just
10790 keep going as though it wasn't there. */
10791 declarator
= sname
;
10794 ctype
= TREE_OPERAND (declarator
, 0);
10797 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10799 if (CLASSTYPE_TEMPLATE_INFO (t
) &&
10800 !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
10801 template_count
+= 1;
10802 t
= TYPE_MAIN_DECL (t
);
10803 if (DECL_LANG_SPECIFIC (t
))
10804 t
= DECL_CLASS_CONTEXT (t
);
10809 if (sname
== NULL_TREE
)
10812 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10814 /* This is the `standard' use of the scoping operator:
10815 basetype :: member . */
10817 if (ctype
== current_class_type
)
10823 Is this ill-formed? */
10826 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10829 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10831 if (current_class_type
== NULL_TREE
10833 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10834 TYPE_ARG_TYPES (type
));
10837 cp_error ("cannot declare member function `%T::%s' within `%T'",
10838 ctype
, name
, current_class_type
);
10839 return void_type_node
;
10842 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10843 || TYPE_SIZE (complete_type (ctype
)) != NULL_TREE
)
10845 /* Have to move this code elsewhere in this function.
10846 this code is used for i.e., typedef int A::M; M *pm;
10848 It is? How? jason 10/2/94 */
10850 if (current_class_type
)
10852 cp_error ("cannot declare member `%T::%s' within `%T'",
10853 ctype
, name
, current_class_type
);
10854 return void_type_node
;
10856 type
= build_offset_type (ctype
, type
);
10858 else if (uses_template_parms (ctype
))
10860 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10862 = build_cplus_method_type (ctype
, TREE_TYPE (type
),
10863 TYPE_ARG_TYPES (type
));
10867 cp_error ("structure `%T' not yet defined", ctype
);
10868 return error_mark_node
;
10871 declarator
= sname
;
10873 else if (TREE_CODE (sname
) == SCOPE_REF
)
10874 my_friendly_abort (17);
10878 declarator
= TREE_OPERAND (declarator
, 1);
10879 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10880 /* In this case, we will deal with it later. */
10884 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10885 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10886 TYPE_ARG_TYPES (type
));
10888 type
= build_offset_type (ctype
, type
);
10895 declarator
= TREE_OPERAND (declarator
, 0);
10900 case ENUMERAL_TYPE
:
10901 declarator
= NULL_TREE
;
10905 declarator
= NULL_TREE
;
10909 my_friendly_abort (158);
10913 /* See the comment for the TREE_LIST case, above. */
10916 if (! ignore_attrs
)
10917 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10919 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
10921 attrlist
= build_decl_list (NULL_TREE
, inner_attrs
);
10924 /* Now TYPE has the actual type. */
10926 if (explicitp
== 1)
10928 error ("only constructors can be declared `explicit'");
10932 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10934 if (type_quals
& TYPE_QUAL_CONST
)
10936 error ("const `%s' cannot be declared `mutable'", name
);
10937 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10941 error ("static `%s' cannot be declared `mutable'", name
);
10942 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10946 if (declarator
== NULL_TREE
10947 || TREE_CODE (declarator
) == IDENTIFIER_NODE
10948 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
10949 && (TREE_CODE (type
) == FUNCTION_TYPE
10950 || TREE_CODE (type
) == METHOD_TYPE
)))
10952 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10954 cp_error ("template-id `%D' used as a declarator", declarator
);
10955 declarator
= dname
;
10958 /* Unexpected declarator format. */
10959 my_friendly_abort (990210);
10961 /* If this is declaring a typedef name, return a TYPE_DECL. */
10963 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
10967 /* Note that the grammar rejects storage classes
10968 in typenames, fields or parameters. */
10969 if (current_lang_name
== lang_name_java
)
10970 TYPE_FOR_JAVA (type
) = 1;
10972 if (decl_context
== FIELD
)
10974 if (declarator
== constructor_name (current_class_type
))
10975 cp_pedwarn ("ANSI C++ forbids nested type `%D' with same name as enclosing class",
10977 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10978 if (IS_SIGNATURE (current_class_type
) && opaque_typedef
)
10979 SIGNATURE_HAS_OPAQUE_TYPEDECLS (current_class_type
) = 1;
10983 /* Make sure this typedef lives as long as its type,
10984 since it might be used as a template parameter. */
10985 if (type
!= error_mark_node
)
10986 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
10987 decl
= build_decl (TYPE_DECL
, declarator
, type
);
10988 if (type
!= error_mark_node
)
10992 /* If the user declares "struct {...} foo" then `foo' will have
10993 an anonymous name. Fill that name in now. Nothing can
10994 refer to it, so nothing needs know about the name change.
10995 The TYPE_NAME field was filled in by build_struct_xref. */
10996 if (type
!= error_mark_node
10997 && TYPE_NAME (type
)
10998 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
10999 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
)))
11001 /* FIXME: This is bogus; we should not be doing this for
11002 cv-qualified types. */
11004 /* For anonymous structs that are cv-qualified, need to use
11005 TYPE_MAIN_VARIANT so that name will mangle correctly. As
11006 type not referenced after this block, don't bother
11007 resetting type to original type, ie. TREE_TYPE (decl). */
11008 type
= TYPE_MAIN_VARIANT (type
);
11010 /* Replace the anonymous name with the real name everywhere. */
11011 lookup_tag_reverse (type
, declarator
);
11012 TYPE_NAME (type
) = decl
;
11014 if (TYPE_LANG_SPECIFIC (type
))
11015 TYPE_WAS_ANONYMOUS (type
) = 1;
11017 /* If this is a typedef within a template class, the nested
11018 type is a (non-primary) template. The name for the
11019 template needs updating as well. */
11020 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
11021 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
11022 = TYPE_IDENTIFIER (type
);
11024 /* XXX Temporarily set the scope.
11025 When returning, start_decl expects it as NULL_TREE,
11026 and will then then set it using pushdecl. */
11027 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
11028 if (current_class_type
)
11029 DECL_CONTEXT (decl
) = current_class_type
;
11031 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
11033 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
11034 DECL_ASSEMBLER_NAME (decl
)
11035 = get_identifier (build_overload_name (type
, 1, 1));
11036 DECL_CONTEXT (decl
) = NULL_TREE
;
11038 /* FIXME remangle member functions; member functions of a
11039 type with external linkage have external linkage. */
11042 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11044 cp_error_at ("typedef name may not be class-qualified", decl
);
11049 if (ctype
== NULL_TREE
)
11051 if (TREE_CODE (type
) != METHOD_TYPE
)
11052 cp_error_at ("invalid type qualifier for non-method type", decl
);
11054 ctype
= TYPE_METHOD_BASETYPE (type
);
11056 if (ctype
!= NULL_TREE
)
11057 grok_method_quals (ctype
, decl
, quals
);
11060 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
11061 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
11062 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
11064 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11065 error ("non-object member `%s' cannot be declared mutable", name
);
11067 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
11068 inlinep
, friendp
, raises
!= NULL_TREE
);
11071 error ("typedef declaration includes an initializer");
11076 /* Detect the case of an array type of unspecified size
11077 which came, as such, direct from a typedef name.
11078 We must copy the type, so that each identifier gets
11079 a distinct type, so that each identifier's size can be
11080 controlled separately by its own initializer. */
11082 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
11083 && TYPE_DOMAIN (type
) == NULL_TREE
)
11085 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
11088 /* If this is a type name (such as, in a cast or sizeof),
11089 compute the type and return it now. */
11091 if (decl_context
== TYPENAME
)
11093 /* Note that the grammar rejects storage classes
11094 in typenames, fields or parameters. */
11095 if (type_quals
!= TYPE_UNQUALIFIED
)
11097 if (IS_SIGNATURE (type
))
11098 error ("type qualifiers specified for signature type");
11099 type_quals
= TYPE_UNQUALIFIED
;
11102 /* Special case: "friend class foo" looks like a TYPENAME context. */
11105 if (type_quals
!= TYPE_UNQUALIFIED
)
11107 cp_error ("type qualifiers specified for friend class declaration");
11108 type_quals
= TYPE_UNQUALIFIED
;
11112 cp_error ("`inline' specified for friend class declaration");
11116 /* Only try to do this stuff if we didn't already give up. */
11117 if (type
!= integer_type_node
)
11119 /* A friendly class? */
11120 if (current_class_type
)
11121 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
11123 error ("trying to make class `%s' a friend of global scope",
11124 TYPE_NAME_STRING (type
));
11125 type
= void_type_node
;
11130 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
11131 if (ctype
== NULL_TREE
)
11133 my_friendly_assert (TREE_CODE (type
) == METHOD_TYPE
, 159);
11134 ctype
= TYPE_METHOD_BASETYPE (type
);
11136 grok_method_quals (ctype
, dummy
, quals
);
11137 type
= TREE_TYPE (dummy
);
11142 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
11143 && decl_context
!= CATCHPARM
11144 && TREE_CODE (type
) != UNION_TYPE
11147 cp_error ("abstract declarator `%T' used as declaration", type
);
11148 declarator
= make_anon_name ();
11151 /* `void' at top level (not within pointer)
11152 is allowed only in typedefs or type names.
11153 We don't complain about parms either, but that is because
11154 a better error message can be made later. */
11156 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
11159 error ("unnamed variable or field declared void");
11160 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
11162 if (IDENTIFIER_OPNAME_P (declarator
))
11163 my_friendly_abort (356);
11165 error ("variable or field `%s' declared void", name
);
11168 error ("variable or field declared void");
11169 type
= integer_type_node
;
11172 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
11173 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
11175 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
11177 if (ctype
|| in_namespace
)
11178 error ("cannot use `::' in parameter declaration");
11180 /* A parameter declared as an array of T is really a pointer to T.
11181 One declared as a function is really a pointer to a function.
11182 One declared as a member is really a pointer to member. */
11184 if (TREE_CODE (type
) == ARRAY_TYPE
)
11186 /* Transfer const-ness of array into that of type pointed to. */
11187 type
= build_pointer_type (TREE_TYPE (type
));
11188 type_quals
= TYPE_UNQUALIFIED
;
11190 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11191 type
= build_pointer_type (type
);
11192 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11193 type
= build_pointer_type (type
);
11194 else if (TREE_CODE (type
) == VOID_TYPE
&& declarator
)
11196 error ("declaration of `%s' as void", name
);
11202 register tree decl
;
11204 if (decl_context
== PARM
)
11206 decl
= build_decl (PARM_DECL
, declarator
, type
);
11208 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
11209 inlinep
, friendp
, raises
!= NULL_TREE
);
11210 if (current_class_type
11211 && IS_SIGNATURE (current_class_type
))
11214 error ("parameter of signature member function declared `inline'");
11215 if (RIDBIT_SETP (RID_AUTO
, specbits
))
11216 error ("parameter of signature member function declared `auto'");
11217 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11218 error ("parameter of signature member function declared `register'");
11221 /* Compute the type actually passed in the parmlist,
11222 for the case where there is no prototype.
11223 (For example, shorts and chars are passed as ints.)
11224 When there is a prototype, this is overridden later. */
11226 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
11228 else if (decl_context
== FIELD
)
11230 if (type
== error_mark_node
)
11232 /* Happens when declaring arrays of sizes which
11233 are error_mark_node, for example. */
11236 else if (in_namespace
&& !friendp
)
11238 /* Something like struct S { int N::j; }; */
11239 cp_error ("invalid use of `::'");
11242 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11245 tree function_context
;
11247 /* We catch the others as conflicts with the builtin
11249 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
11251 cp_error ("function `%D' cannot be declared friend",
11258 if (ctype
== NULL_TREE
)
11259 ctype
= current_class_type
;
11261 if (ctype
== NULL_TREE
)
11263 cp_error ("can't make `%D' into a method -- not in a class",
11265 return void_type_node
;
11268 /* ``A union may [ ... ] not [ have ] virtual functions.''
11270 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
11272 cp_error ("function `%D' declared virtual inside a union",
11274 return void_type_node
;
11277 if (declarator
== ansi_opname
[(int) NEW_EXPR
]
11278 || declarator
== ansi_opname
[(int) VEC_NEW_EXPR
]
11279 || declarator
== ansi_opname
[(int) DELETE_EXPR
]
11280 || declarator
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11284 cp_error ("`%D' cannot be declared virtual, since it is always static",
11289 else if (staticp
< 2)
11290 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11291 TYPE_ARG_TYPES (type
));
11294 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
11295 function_context
= (ctype
!= NULL_TREE
) ?
11296 hack_decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
11297 publicp
= (! friendp
|| ! staticp
)
11298 && function_context
== NULL_TREE
;
11299 decl
= grokfndecl (ctype
, type
,
11300 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
11301 ? declarator
: dname
,
11303 virtualp
, flags
, quals
, raises
,
11304 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
11305 funcdef_flag
, template_count
, in_namespace
);
11306 if (decl
== NULL_TREE
)
11309 /* This clobbers the attrs stored in `decl' from `attrlist'. */
11310 /* The decl and setting of decl_machine_attr is also turned off. */
11311 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
11314 /* [class.conv.ctor]
11316 A constructor declared without the function-specifier
11317 explicit that can be called with a single parameter
11318 specifies a conversion from the type of its first
11319 parameter to the type of its class. Such a constructor
11320 is called a converting constructor. */
11321 if (explicitp
== 2)
11322 DECL_NONCONVERTING_P (decl
) = 1;
11323 else if (DECL_CONSTRUCTOR_P (decl
))
11325 /* The constructor can be called with exactly one
11326 parameter if there is at least one parameter, and
11327 any subsequent parameters have default arguments.
11328 We don't look at the first parameter, which is
11329 really just the `this' parameter for the new
11332 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
11334 /* Skip the `in_chrg' argument too, if present. */
11335 if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (decl
)))
11336 arg_types
= TREE_CHAIN (arg_types
);
11338 if (arg_types
== void_list_node
11340 && TREE_CHAIN (arg_types
)
11341 && TREE_CHAIN (arg_types
) != void_list_node
11342 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
11343 DECL_NONCONVERTING_P (decl
) = 1;
11346 else if (TREE_CODE (type
) == METHOD_TYPE
)
11348 /* We only get here for friend declarations of
11349 members of other classes. */
11350 /* All method decls are public, so tell grokfndecl to set
11351 TREE_PUBLIC, also. */
11352 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
11353 virtualp
, flags
, quals
, raises
,
11354 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
11355 template_count
, in_namespace
);
11356 if (decl
== NULL_TREE
)
11359 else if (!staticp
&& ! processing_template_decl
11360 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
11361 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
11364 cp_error ("field `%D' has incomplete type", declarator
);
11366 cp_error ("name `%T' has incomplete type", type
);
11368 /* If we're instantiating a template, tell them which
11369 instantiation made the field's type be incomplete. */
11370 if (current_class_type
11371 && TYPE_NAME (current_class_type
)
11372 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
11373 && declspecs
&& TREE_VALUE (declspecs
)
11374 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
11375 cp_error (" in instantiation of template `%T'",
11376 current_class_type
);
11378 type
= error_mark_node
;
11385 error ("`%s' is neither function nor method; cannot be declared friend",
11386 IDENTIFIER_POINTER (declarator
));
11394 /* Friends are treated specially. */
11395 if (ctype
== current_class_type
)
11396 warning ("member functions are implicitly friends of their class");
11399 tree t
= NULL_TREE
;
11400 if (decl
&& DECL_NAME (decl
))
11402 if (template_class_depth (current_class_type
) == 0)
11405 = check_explicit_specialization
11407 template_count
, 2 * (funcdef_flag
!= 0) + 4);
11408 if (decl
== error_mark_node
)
11409 return error_mark_node
;
11412 t
= do_friend (ctype
, declarator
, decl
,
11413 last_function_parms
, attrlist
, flags
, quals
,
11416 if (t
&& funcdef_flag
)
11419 return void_type_node
;
11423 /* Structure field. It may not be a function, except for C++ */
11425 if (decl
== NULL_TREE
)
11431 /* An attempt is being made to initialize a non-static
11432 member. But, from [class.mem]:
11434 4 A member-declarator can contain a
11435 constant-initializer only if it declares a static
11436 member (_class.static_) of integral or enumeration
11437 type, see _class.static.data_.
11439 This used to be relatively common practice, but
11440 the rest of the compiler does not correctly
11441 handle the initialization unless the member is
11442 static so we make it static below. */
11443 cp_pedwarn ("ANSI C++ forbids initialization of member `%D'",
11445 cp_pedwarn ("making `%D' static", declarator
);
11449 if (uses_template_parms (type
))
11450 /* We'll check at instantiation time. */
11452 else if (check_static_variable_definition (declarator
,
11454 /* If we just return the declaration, crashes
11455 will sometimes occur. We therefore return
11456 void_type_node, as if this was a friend
11457 declaration, to cause callers to completely
11458 ignore this declaration. */
11459 return void_type_node
;
11462 /* 9.2p13 [class.mem] */
11463 if (declarator
== constructor_name (current_class_type
)
11464 /* Divergence from the standard: In extern "C", we
11465 allow non-static data members here, because C does
11466 and /usr/include/netinet/in.h uses that. */
11467 && (staticp
|| ! in_system_header
))
11468 cp_pedwarn ("ANSI C++ forbids data member `%D' with same name as enclosing class",
11473 /* C++ allows static class members.
11474 All other work for this is done by grokfield.
11475 This VAR_DCL is built by build_lang_field_decl.
11476 All other VAR_DECLs are built by build_decl. */
11477 decl
= build_lang_field_decl (VAR_DECL
, declarator
, type
);
11478 TREE_STATIC (decl
) = 1;
11479 /* In class context, 'static' means public access. */
11480 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
11484 decl
= build_lang_field_decl (FIELD_DECL
, declarator
, type
);
11485 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11487 DECL_MUTABLE_P (decl
) = 1;
11488 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11492 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
11493 inlinep
, friendp
, raises
!= NULL_TREE
);
11496 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11498 tree original_name
;
11504 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11505 original_name
= dname
;
11507 original_name
= declarator
;
11509 if (RIDBIT_SETP (RID_AUTO
, specbits
))
11510 error ("storage class `auto' invalid for function `%s'", name
);
11511 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11512 error ("storage class `register' invalid for function `%s'", name
);
11514 /* Function declaration not at top level.
11515 Storage classes other than `extern' are not allowed
11516 and `extern' makes no difference. */
11517 if (! toplevel_bindings_p ()
11518 && (RIDBIT_SETP (RID_STATIC
, specbits
)
11519 || RIDBIT_SETP (RID_INLINE
, specbits
))
11522 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11523 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
11525 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
11528 if (ctype
== NULL_TREE
)
11532 error ("virtual non-class function `%s'", name
);
11536 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
11537 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11538 TYPE_ARG_TYPES (type
));
11540 /* Record presence of `static'. */
11541 publicp
= (ctype
!= NULL_TREE
11542 || RIDBIT_SETP (RID_EXTERN
, specbits
)
11543 || !RIDBIT_SETP (RID_STATIC
, specbits
));
11545 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
11546 virtualp
, flags
, quals
, raises
,
11548 publicp
, inlinep
, funcdef_flag
,
11549 template_count
, in_namespace
);
11550 if (decl
== NULL_TREE
)
11555 int illegal_static
= 0;
11557 /* Don't allow a static member function in a class, and forbid
11558 declaring main to be static. */
11559 if (TREE_CODE (type
) == METHOD_TYPE
)
11561 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11562 illegal_static
= 1;
11564 else if (current_function_decl
)
11566 /* FIXME need arm citation */
11567 error ("cannot declare static function inside another function");
11568 illegal_static
= 1;
11571 if (illegal_static
)
11574 RIDBIT_RESET (RID_STATIC
, specbits
);
11580 /* It's a variable. */
11582 /* An uninitialized decl with `extern' is a reference. */
11583 decl
= grokvardecl (type
, declarator
, &specbits
,
11585 (type_quals
& TYPE_QUAL_CONST
) != 0,
11587 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11588 inlinep
, friendp
, raises
!= NULL_TREE
);
11592 DECL_CONTEXT (decl
) = ctype
;
11595 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11597 RIDBIT_RESET (RID_STATIC
, specbits
);
11599 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11601 cp_error ("static member `%D' declared `register'", decl
);
11602 RIDBIT_RESET (RID_REGISTER
, specbits
);
11604 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11606 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11608 RIDBIT_RESET (RID_EXTERN
, specbits
);
11613 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11615 error ("`%s' cannot be declared mutable", name
);
11618 /* Record `register' declaration for warnings on &
11619 and in case doing stupid register allocation. */
11621 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11622 DECL_REGISTER (decl
) = 1;
11624 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11625 DECL_THIS_EXTERN (decl
) = 1;
11627 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11628 DECL_THIS_STATIC (decl
) = 1;
11630 /* Record constancy and volatility. */
11631 /* FIXME: Disallow `restrict' pointer-to-member declarations. */
11632 c_apply_type_quals_to_decl (type_quals
, decl
);
11638 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11639 An empty exprlist is a parmlist. An exprlist which
11640 contains only identifiers at the global level
11641 is a parmlist. Otherwise, it is an exprlist. */
11644 parmlist_is_exprlist (exprs
)
11647 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11650 if (toplevel_bindings_p ())
11652 /* At the global level, if these are all identifiers,
11653 then it is a parmlist. */
11656 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11658 exprs
= TREE_CHAIN (exprs
);
11665 /* Subroutine of start_function. Ensure that each of the parameter
11666 types (as listed in PARMS) is complete, as is required for a
11667 function definition. */
11670 require_complete_types_for_parms (parms
)
11675 tree type
= TREE_TYPE (parms
);
11676 if (TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
11678 if (DECL_NAME (parms
))
11679 error ("parameter `%s' has incomplete type",
11680 IDENTIFIER_POINTER (DECL_NAME (parms
)));
11682 error ("parameter has incomplete type");
11683 TREE_TYPE (parms
) = error_mark_node
;
11686 layout_decl (parms
, 0);
11688 parms
= TREE_CHAIN (parms
);
11692 /* Returns DECL if DECL is a local variable (or parameter). Returns
11693 NULL_TREE otherwise. */
11696 local_variable_p (t
)
11699 if ((TREE_CODE (t
) == VAR_DECL
11700 /* A VAR_DECL with a context that is a _TYPE is a static data
11702 && !TYPE_P (CP_DECL_CONTEXT (t
))
11703 /* Any other non-local variable must be at namespace scope. */
11704 && TREE_CODE (CP_DECL_CONTEXT (t
)) != NAMESPACE_DECL
)
11705 || (TREE_CODE (t
) == PARM_DECL
))
11711 /* Check that ARG, which is a default-argument expression for a
11712 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11713 something goes wrong. DECL may also be a _TYPE node, rather than a
11714 DECL, if there is no DECL available. */
11717 check_default_argument (decl
, arg
)
11724 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11725 /* We get a DEFAULT_ARG when looking at an in-class declaration
11726 with a default argument. Ignore the argument for now; we'll
11727 deal with it after the class is complete. */
11730 if (processing_template_decl
|| uses_template_parms (arg
))
11731 /* We don't do anything checking until instantiation-time. Note
11732 that there may be uninstantiated arguments even for an
11733 instantiated function, since default arguments are not
11734 instantiated until they are needed. */
11743 decl_type
= TREE_TYPE (decl
);
11745 if (arg
== error_mark_node
11746 || decl
== error_mark_node
11747 || TREE_TYPE (arg
) == error_mark_node
11748 || decl_type
== error_mark_node
)
11749 /* Something already went wrong. There's no need to check
11751 return error_mark_node
;
11753 /* [dcl.fct.default]
11755 A default argument expression is implicitly converted to the
11757 if (!TREE_TYPE (arg
)
11758 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11761 cp_error ("default argument for `%#D' has type `%T'",
11762 decl
, TREE_TYPE (arg
));
11764 cp_error ("default argument for paramter of type `%T' has type `%T'",
11765 decl_type
, TREE_TYPE (arg
));
11767 return error_mark_node
;
11770 /* [dcl.fct.default]
11772 Local variables shall not be used in default argument
11775 The keyword `this' shall not be used in a default argument of a
11776 member function. */
11777 var
= search_tree (arg
, local_variable_p
);
11780 cp_error ("default argument `%E' uses local variable `%D'",
11782 return error_mark_node
;
11789 /* Decode the list of parameter types for a function type.
11790 Given the list of things declared inside the parens,
11791 return a list of types.
11793 The list we receive can have three kinds of elements:
11794 an IDENTIFIER_NODE for names given without types,
11795 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11796 or void_type_node, to mark the end of an argument list
11797 when additional arguments are not permitted (... was not used).
11799 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11800 a mere declaration. A nonempty identifier-list gets an error message
11801 when FUNCDEF_FLAG is zero.
11802 If FUNCDEF_FLAG is 1, then parameter types must be complete.
11803 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11805 If all elements of the input list contain types,
11806 we return a list of the types.
11807 If all elements contain no type (except perhaps a void_type_node
11808 at the end), we return a null list.
11809 If some have types and some do not, it is an error, and we
11810 return a null list.
11812 Also set last_function_parms to either
11813 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11814 A list of names is converted to a chain of PARM_DECLs
11815 by store_parm_decls so that ultimately it is always a chain of decls.
11817 Note that in C++, parameters can take default values. These default
11818 values are in the TREE_PURPOSE field of the TREE_LIST. It is
11819 an error to specify default values which are followed by parameters
11820 that have no default values, or an ELLIPSES. For simplicities sake,
11821 only parameters which are specified with their types can take on
11825 grokparms (first_parm
, funcdef_flag
)
11829 tree result
= NULL_TREE
;
11830 tree decls
= NULL_TREE
;
11832 if (first_parm
!= NULL_TREE
11833 && TREE_CODE (TREE_VALUE (first_parm
)) == IDENTIFIER_NODE
)
11835 if (! funcdef_flag
)
11836 pedwarn ("parameter names (without types) in function declaration");
11837 last_function_parms
= first_parm
;
11840 else if (first_parm
!= NULL_TREE
11841 && TREE_CODE (TREE_VALUE (first_parm
)) != TREE_LIST
11842 && TREE_CODE (TREE_VALUE (first_parm
)) != VOID_TYPE
)
11843 my_friendly_abort (145);
11846 /* Types were specified. This is a list of declarators
11847 each represented as a TREE_LIST node. */
11848 register tree parm
, chain
;
11849 int any_init
= 0, any_error
= 0;
11851 if (first_parm
!= NULL_TREE
)
11853 tree last_result
= NULL_TREE
;
11854 tree last_decl
= NULL_TREE
;
11856 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11858 tree type
= NULL_TREE
, list_node
= parm
;
11859 register tree decl
= TREE_VALUE (parm
);
11860 tree init
= TREE_PURPOSE (parm
);
11862 chain
= TREE_CHAIN (parm
);
11863 /* @@ weak defense against parse errors. */
11864 if (TREE_CODE (decl
) != VOID_TYPE
11865 && TREE_CODE (decl
) != TREE_LIST
)
11867 /* Give various messages as the need arises. */
11868 if (TREE_CODE (decl
) == STRING_CST
)
11869 cp_error ("invalid string constant `%E'", decl
);
11870 else if (TREE_CODE (decl
) == INTEGER_CST
)
11871 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11875 if (TREE_CODE (decl
) != VOID_TYPE
)
11877 decl
= grokdeclarator (TREE_VALUE (decl
),
11878 TREE_PURPOSE (decl
),
11879 PARM
, init
!= NULL_TREE
,
11881 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
11884 /* Top-level qualifiers on the parameters are
11885 ignored for function types. */
11886 type
= TYPE_MAIN_VARIANT (TREE_TYPE (decl
));
11888 if (TREE_CODE (type
) == VOID_TYPE
)
11889 decl
= void_type_node
;
11890 else if (TREE_CODE (type
) == METHOD_TYPE
)
11892 if (DECL_NAME (decl
))
11893 /* Cannot use the decl here because
11894 we don't have DECL_CONTEXT set up yet. */
11895 cp_error ("parameter `%D' invalidly declared method type",
11898 error ("parameter invalidly declared method type");
11899 type
= build_pointer_type (type
);
11900 TREE_TYPE (decl
) = type
;
11902 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11904 if (DECL_NAME (decl
))
11905 cp_error ("parameter `%D' invalidly declared offset type",
11908 error ("parameter invalidly declared offset type");
11909 type
= build_pointer_type (type
);
11910 TREE_TYPE (decl
) = type
;
11912 else if (TREE_CODE (type
) == RECORD_TYPE
11913 && TYPE_LANG_SPECIFIC (type
)
11914 && CLASSTYPE_ABSTRACT_VIRTUALS (type
))
11916 abstract_virtuals_error (decl
, type
);
11917 any_error
= 1; /* Seems like a good idea. */
11919 else if (TREE_CODE (type
) == RECORD_TYPE
11920 && TYPE_LANG_SPECIFIC (type
)
11921 && IS_SIGNATURE (type
))
11923 signature_error (decl
, type
);
11924 any_error
= 1; /* Seems like a good idea. */
11926 else if (POINTER_TYPE_P (type
))
11929 while (POINTER_TYPE_P (t
)
11930 || (TREE_CODE (t
) == ARRAY_TYPE
11931 && TYPE_DOMAIN (t
) != NULL_TREE
))
11933 if (TREE_CODE (t
) == ARRAY_TYPE
)
11934 cp_error ("parameter type `%T' includes %s to array of unknown bound",
11936 TYPE_PTR_P (type
) ? "pointer" : "reference");
11940 if (TREE_CODE (decl
) == VOID_TYPE
)
11942 if (result
== NULL_TREE
)
11944 result
= void_list_node
;
11945 last_result
= result
;
11949 TREE_CHAIN (last_result
) = void_list_node
;
11950 last_result
= void_list_node
;
11953 && (chain
!= void_list_node
|| TREE_CHAIN (chain
)))
11954 error ("`void' in parameter list must be entire list");
11958 /* Since there is a prototype, args are passed in their own types. */
11959 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
11960 #ifdef PROMOTE_PROTOTYPES
11961 if ((TREE_CODE (type
) == INTEGER_TYPE
11962 || TREE_CODE (type
) == ENUMERAL_TYPE
)
11963 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
11964 DECL_ARG_TYPE (decl
) = integer_type_node
;
11966 if (!any_error
&& init
)
11969 init
= check_default_argument (decl
, init
);
11974 if (decls
== NULL_TREE
)
11981 TREE_CHAIN (last_decl
) = decl
;
11984 if (! current_function_decl
&& TREE_PERMANENT (list_node
))
11986 TREE_PURPOSE (list_node
) = init
;
11987 TREE_VALUE (list_node
) = type
;
11988 TREE_CHAIN (list_node
) = NULL_TREE
;
11991 list_node
= saveable_tree_cons (init
, type
, NULL_TREE
);
11992 if (result
== NULL_TREE
)
11994 result
= list_node
;
11995 last_result
= result
;
11999 TREE_CHAIN (last_result
) = list_node
;
12000 last_result
= list_node
;
12004 TREE_CHAIN (last_result
) = NULL_TREE
;
12005 /* If there are no parameters, and the function does not end
12006 with `...', then last_decl will be NULL_TREE. */
12007 if (last_decl
!= NULL_TREE
)
12008 TREE_CHAIN (last_decl
) = NULL_TREE
;
12012 last_function_parms
= decls
;
12017 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
12018 FUNCTION_TYPE with the newly parsed version of its default argument, which
12019 was previously digested as text. See snarf_defarg et al in lex.c. */
12022 replace_defarg (arg
, init
)
12025 if (! processing_template_decl
12026 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
12027 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
12028 TREE_TYPE (init
), TREE_VALUE (arg
));
12029 TREE_PURPOSE (arg
) = init
;
12036 tree t
= FUNCTION_ARG_CHAIN (d
);
12037 if (DECL_CONSTRUCTOR_P (d
)
12038 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (d
)))
12039 t
= TREE_CHAIN (t
);
12040 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
12041 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
12042 == DECL_CLASS_CONTEXT (d
))
12043 && (TREE_CHAIN (t
) == NULL_TREE
12044 || TREE_CHAIN (t
) == void_list_node
12045 || TREE_PURPOSE (TREE_CHAIN (t
))))
12050 /* These memoizing functions keep track of special properties which
12051 a class may have. `grok_ctor_properties' notices whether a class
12052 has a constructor of the form X(X&), and also complains
12053 if the class has a constructor of the form X(X).
12054 `grok_op_properties' takes notice of the various forms of
12055 operator= which are defined, as well as what sorts of type conversion
12056 may apply. Both functions take a FUNCTION_DECL as an argument. */
12059 grok_ctor_properties (ctype
, decl
)
12062 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
12063 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
12065 /* When a type has virtual baseclasses, a magical first int argument is
12066 added to any ctor so we can tell if the class has been initialized
12067 yet. This could screw things up in this function, so we deliberately
12068 ignore the leading int if we're in that situation. */
12069 if (TYPE_USES_VIRTUAL_BASECLASSES (ctype
))
12071 my_friendly_assert (parmtypes
12072 && TREE_VALUE (parmtypes
) == integer_type_node
,
12074 parmtypes
= TREE_CHAIN (parmtypes
);
12075 parmtype
= TREE_VALUE (parmtypes
);
12080 A non-template constructor for class X is a copy constructor if
12081 its first parameter is of type X&, const X&, volatile X& or const
12082 volatile X&, and either there are no other parameters or else all
12083 other parameters have default arguments. */
12084 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
12085 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
12086 && (TREE_CHAIN (parmtypes
) == NULL_TREE
12087 || TREE_CHAIN (parmtypes
) == void_list_node
12088 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
12089 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12090 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12092 TYPE_HAS_INIT_REF (ctype
) = 1;
12093 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12094 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
12098 A declaration of a constructor for a class X is ill-formed if its
12099 first parameter is of type (optionally cv-qualified) X and either
12100 there are no other parameters or else all other parameters have
12103 We *don't* complain about member template instantiations that
12104 have this form, though; they can occur as we try to decide what
12105 constructor to use during overload resolution. Since overload
12106 resolution will never prefer such a constructor to the
12107 non-template copy constructor (which is either explicitly or
12108 implicitly defined), there's no need to worry about their
12109 existence. Theoretically, they should never even be
12110 instantiated, but that's hard to forestall. */
12111 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
12112 && (TREE_CHAIN (parmtypes
) == NULL_TREE
12113 || TREE_CHAIN (parmtypes
) == void_list_node
12114 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
12115 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12116 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12118 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
12120 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
12123 else if (TREE_CODE (parmtype
) == VOID_TYPE
12124 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
12125 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
12130 /* An operator with this name can be either unary or binary. */
12136 return (name
== ansi_opname
[(int) INDIRECT_REF
]
12137 || name
== ansi_opname
[(int) ADDR_EXPR
]
12138 || name
== ansi_opname
[(int) NEGATE_EXPR
]
12139 || name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
12140 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]
12141 || name
== ansi_opname
[(int) CONVERT_EXPR
]);
12144 /* An operator with this name can only be unary. */
12150 return (name
== ansi_opname
[(int) TRUTH_NOT_EXPR
]
12151 || name
== ansi_opname
[(int) BIT_NOT_EXPR
]
12152 || name
== ansi_opname
[(int) COMPONENT_REF
]
12153 || IDENTIFIER_TYPENAME_P (name
));
12156 /* Do a little sanity-checking on how they declared their operator. */
12159 grok_op_properties (decl
, virtualp
, friendp
)
12161 int virtualp
, friendp
;
12163 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
12164 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
12165 tree name
= DECL_NAME (decl
);
12167 if (current_class_type
== NULL_TREE
)
12174 A user-declared copy assignment operator X::operator= is a
12175 non-static non-template member function of class X with
12176 exactly one parameter of type X, X&, const X&, volatile X& or
12177 const volatile X&. */
12178 if (name
== ansi_opname
[(int) MODIFY_EXPR
]
12179 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12180 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12182 else if (name
== ansi_opname
[(int) CALL_EXPR
])
12183 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
12184 else if (name
== ansi_opname
[(int) ARRAY_REF
])
12185 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
12186 else if (name
== ansi_opname
[(int) COMPONENT_REF
]
12187 || name
== ansi_opname
[(int) MEMBER_REF
])
12188 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
12189 else if (name
== ansi_opname
[(int) NEW_EXPR
])
12190 TYPE_GETS_NEW (current_class_type
) |= 1;
12191 else if (name
== ansi_opname
[(int) DELETE_EXPR
])
12192 TYPE_GETS_DELETE (current_class_type
) |= 1;
12193 else if (name
== ansi_opname
[(int) VEC_NEW_EXPR
])
12194 TYPE_GETS_NEW (current_class_type
) |= 2;
12195 else if (name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
12196 TYPE_GETS_DELETE (current_class_type
) |= 2;
12199 if (name
== ansi_opname
[(int) NEW_EXPR
]
12200 || name
== ansi_opname
[(int) VEC_NEW_EXPR
])
12202 /* When the compiler encounters the definition of A::operator new, it
12203 doesn't look at the class declaration to find out if it's static. */
12205 revert_static_member_fn (&decl
, NULL
, NULL
);
12207 /* Take care of function decl if we had syntax errors. */
12208 if (argtypes
== NULL_TREE
)
12210 = build_function_type (ptr_type_node
,
12211 hash_tree_chain (integer_type_node
,
12214 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
12216 else if (name
== ansi_opname
[(int) DELETE_EXPR
]
12217 || name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
12220 revert_static_member_fn (&decl
, NULL
, NULL
);
12222 if (argtypes
== NULL_TREE
)
12224 = build_function_type (void_type_node
,
12225 hash_tree_chain (ptr_type_node
,
12229 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
12231 if (! friendp
&& name
== ansi_opname
[(int) VEC_DELETE_EXPR
]
12232 && (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
12233 != void_list_node
))
12234 TYPE_VEC_DELETE_TAKES_SIZE (current_class_type
) = 1;
12239 /* An operator function must either be a non-static member function
12240 or have at least one parameter of a class, a reference to a class,
12241 an enumeration, or a reference to an enumeration. 13.4.0.6 */
12242 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
12244 if (IDENTIFIER_TYPENAME_P (name
)
12245 || name
== ansi_opname
[(int) CALL_EXPR
]
12246 || name
== ansi_opname
[(int) MODIFY_EXPR
]
12247 || name
== ansi_opname
[(int) COMPONENT_REF
]
12248 || name
== ansi_opname
[(int) ARRAY_REF
])
12249 cp_error ("`%D' must be a nonstatic member function", decl
);
12254 if (DECL_STATIC_FUNCTION_P (decl
))
12255 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
12258 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
12260 tree arg
= TREE_VALUE (p
);
12261 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
12262 arg
= TREE_TYPE (arg
);
12264 /* This lets bad template code slip through. */
12265 if (IS_AGGR_TYPE (arg
)
12266 || TREE_CODE (arg
) == ENUMERAL_TYPE
12267 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
12268 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
12272 ("`%D' must have an argument of class or enumerated type",
12279 if (name
== ansi_opname
[(int) CALL_EXPR
])
12280 return; /* No restrictions on args. */
12282 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
12284 tree t
= TREE_TYPE (name
);
12285 if (TREE_CODE (t
) == VOID_TYPE
)
12286 pedwarn ("void is not a valid type conversion operator");
12287 else if (! friendp
)
12289 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
12290 const char *what
= 0;
12292 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
12294 if (t
== current_class_type
)
12295 what
= "the same type";
12296 /* Don't force t to be complete here. */
12297 else if (IS_AGGR_TYPE (t
)
12299 && DERIVED_FROM_P (t
, current_class_type
))
12300 what
= "a base class";
12303 warning ("conversion to %s%s will never use a type conversion operator",
12304 ref
? "a reference to " : "", what
);
12308 if (name
== ansi_opname
[(int) MODIFY_EXPR
])
12312 if (list_length (argtypes
) != 3 && methodp
)
12314 cp_error ("`%D' must take exactly one argument", decl
);
12317 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
12319 if (copy_assignment_arg_p (parmtype
, virtualp
)
12322 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
12323 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
12324 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12325 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
12328 else if (name
== ansi_opname
[(int) COND_EXPR
])
12331 pedwarn ("ANSI C++ prohibits overloading operator ?:");
12332 if (list_length (argtypes
) != 4)
12333 cp_error ("`%D' must take exactly three arguments", decl
);
12335 else if (ambi_op_p (name
))
12337 if (list_length (argtypes
) == 2)
12339 else if (list_length (argtypes
) == 3)
12341 if ((name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
12342 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
12343 && ! processing_template_decl
12344 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
12347 cp_error ("postfix `%D' must take `int' as its argument",
12351 ("postfix `%D' must take `int' as its second argument",
12358 cp_error ("`%D' must take either zero or one argument", decl
);
12360 cp_error ("`%D' must take either one or two arguments", decl
);
12363 /* More Effective C++ rule 6. */
12365 && (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
12366 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]))
12368 tree arg
= TREE_VALUE (argtypes
);
12369 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
12370 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
12371 arg
= TREE_TYPE (arg
);
12372 arg
= TYPE_MAIN_VARIANT (arg
);
12373 if (list_length (argtypes
) == 2)
12375 if (TREE_CODE (ret
) != REFERENCE_TYPE
12376 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
12378 cp_warning ("prefix `%D' should return `%T'", decl
,
12379 build_reference_type (arg
));
12383 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
12384 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
12388 else if (unary_op_p (name
))
12390 if (list_length (argtypes
) != 2)
12393 cp_error ("`%D' must take `void'", decl
);
12395 cp_error ("`%D' must take exactly one argument", decl
);
12398 else /* if (binary_op_p (name)) */
12400 if (list_length (argtypes
) != 3)
12403 cp_error ("`%D' must take exactly one argument", decl
);
12405 cp_error ("`%D' must take exactly two arguments", decl
);
12408 /* More Effective C++ rule 7. */
12410 && (name
== ansi_opname
[TRUTH_ANDIF_EXPR
]
12411 || name
== ansi_opname
[TRUTH_ORIF_EXPR
]
12412 || name
== ansi_opname
[COMPOUND_EXPR
]))
12413 cp_warning ("user-defined `%D' always evaluates both arguments",
12417 /* Effective C++ rule 23. */
12419 && list_length (argtypes
) == 3
12420 && (name
== ansi_opname
[PLUS_EXPR
]
12421 || name
== ansi_opname
[MINUS_EXPR
]
12422 || name
== ansi_opname
[TRUNC_DIV_EXPR
]
12423 || name
== ansi_opname
[MULT_EXPR
])
12424 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
12425 cp_warning ("`%D' should return by value", decl
);
12429 for (; argtypes
!= void_list_node
; argtypes
= TREE_CHAIN (argtypes
))
12430 if (TREE_PURPOSE (argtypes
))
12432 TREE_PURPOSE (argtypes
) = NULL_TREE
;
12433 if (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
12434 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
12437 cp_pedwarn ("`%D' cannot have default arguments", decl
);
12440 cp_error ("`%D' cannot have default arguments", decl
);
12445 static const char *
12447 enum tag_types code
;
12459 case signature_type
:
12460 return "signature";
12462 my_friendly_abort (981122);
12466 /* Get the struct, enum or union (CODE says which) with tag NAME.
12467 Define the tag as a forward-reference if it is not defined.
12469 C++: If a class derivation is given, process it here, and report
12470 an error if multiple derivation declarations are not identical.
12472 If this is a definition, come in through xref_tag and only look in
12473 the current frame for the name (since C++ allows new names in any
12477 xref_tag (code_type_node
, name
, globalize
)
12478 tree code_type_node
;
12482 enum tag_types tag_code
;
12483 enum tree_code code
;
12485 register tree ref
, t
;
12486 struct binding_level
*b
= current_binding_level
;
12488 tree attributes
= NULL_TREE
;
12489 tree context
= NULL_TREE
;
12491 /* If we are called from the parser, code_type_node will sometimes be a
12492 TREE_LIST. This indicates that the user wrote
12493 "class __attribute__ ((foo)) bar". Extract the attributes so we can
12495 if (TREE_CODE (code_type_node
) == TREE_LIST
)
12497 attributes
= TREE_PURPOSE (code_type_node
);
12498 code_type_node
= TREE_VALUE (code_type_node
);
12501 tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
12506 case signature_type
:
12507 code
= RECORD_TYPE
;
12513 code
= ENUMERAL_TYPE
;
12516 my_friendly_abort (18);
12519 /* If a cross reference is requested, look up the type
12520 already defined for this tag and return it. */
12521 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
12524 name
= TYPE_IDENTIFIER (t
);
12528 t
= IDENTIFIER_TYPE_VALUE (name
);
12530 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
12531 && TREE_CODE (t
) != TEMPLATE_TEMPLATE_PARM
)
12536 /* If we know we are defining this tag, only look it up in
12537 this scope and don't try to find it as a type. */
12538 ref
= lookup_tag (code
, name
, b
, 1);
12544 /* [dcl.type.elab] If the identifier resolves to a
12545 typedef-name or a template type-parameter, the
12546 elaborated-type-specifier is ill-formed. */
12547 if (t
!= TYPE_MAIN_VARIANT (t
)
12548 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
12549 cp_pedwarn ("using typedef-name `%D' after `%s'",
12550 TYPE_NAME (t
), tag_name (tag_code
));
12551 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12552 cp_error ("using template type parameter `%T' after `%s'",
12553 t
, tag_name (tag_code
));
12558 ref
= lookup_tag (code
, name
, b
, 0);
12562 /* Try finding it as a type declaration. If that wins,
12564 ref
= lookup_name (name
, 1);
12566 if (ref
!= NULL_TREE
12567 && processing_template_decl
12568 && DECL_CLASS_TEMPLATE_P (ref
)
12569 && template_class_depth (current_class_type
) == 0)
12570 /* Since GLOBALIZE is true, we're declaring a global
12571 template, so we want this type. */
12572 ref
= DECL_RESULT (ref
);
12574 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12575 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12576 ref
= TREE_TYPE (ref
);
12581 if (ref
&& current_class_type
12582 && template_class_depth (current_class_type
)
12583 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12585 /* Since GLOBALIZE is non-zero, we are not looking at a
12586 definition of this tag. Since, in addition, we are currently
12587 processing a (member) template declaration of a template
12588 class, we must be very careful; consider:
12595 { template <class V>
12596 friend struct S1; };
12598 Here, the S2::S1 declaration should not be confused with the
12599 outer declaration. In particular, the inner version should
12600 have a template parameter of level 2, not level 1. This
12601 would be particularly important if the member declaration
12604 template <class V = U> friend struct S1;
12606 say, when we should tsubst into `U' when instantiating
12607 S2. On the other hand, when presented with:
12617 we must find the inner binding eventually. We
12618 accomplish this by making sure that the new type we
12619 create to represent this declaration has the right
12621 context
= TYPE_CONTEXT (ref
);
12626 push_obstacks_nochange ();
12630 /* If no such tag is yet defined, create a forward-reference node
12631 and record it as the "definition".
12632 When a real declaration of this type is found,
12633 the forward-reference will be altered into a real type. */
12635 /* In C++, since these migrate into the global scope, we must
12636 build them on the permanent obstack. */
12638 temp
= allocation_temporary_p ();
12640 end_temporary_allocation ();
12642 if (code
== ENUMERAL_TYPE
)
12644 cp_error ("use of enum `%#D' without previous declaration", name
);
12646 ref
= make_node (ENUMERAL_TYPE
);
12648 /* Give the type a default layout like unsigned int
12649 to avoid crashing if it does not get defined. */
12650 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12651 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12652 TREE_UNSIGNED (ref
) = 1;
12653 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12654 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12655 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12657 /* Enable us to recognize when a type is created in class context.
12658 To do nested classes correctly, this should probably be cleared
12659 out when we leave this classes scope. Currently this in only
12660 done in `start_enum'. */
12662 pushtag (name
, ref
, globalize
);
12666 struct binding_level
*old_b
= class_binding_level
;
12668 ref
= make_lang_type (code
);
12669 TYPE_CONTEXT (ref
) = context
;
12671 if (tag_code
== signature_type
)
12673 SET_SIGNATURE (ref
);
12674 /* Since a signature type will be turned into the type
12675 of signature tables, it's not only an interface. */
12676 CLASSTYPE_INTERFACE_ONLY (ref
) = 0;
12677 SET_CLASSTYPE_INTERFACE_KNOWN (ref
);
12678 /* A signature doesn't have a vtable. */
12679 CLASSTYPE_VTABLE_NEEDS_WRITING (ref
) = 0;
12682 #ifdef NONNESTED_CLASSES
12683 /* Class types don't nest the way enums do. */
12684 class_binding_level
= (struct binding_level
*)0;
12686 pushtag (name
, ref
, globalize
);
12687 class_binding_level
= old_b
;
12692 /* If it no longer looks like a nested type, make sure it's
12694 If it is not an IDENTIFIER, this is not a declaration */
12695 if (b
->namespace_p
&& !class_binding_level
12696 && TREE_CODE (name
) == IDENTIFIER_NODE
)
12698 if (IDENTIFIER_NAMESPACE_VALUE (name
) == NULL_TREE
)
12699 SET_IDENTIFIER_NAMESPACE_VALUE (name
, TYPE_NAME (ref
));
12702 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12703 redeclare_class_template (ref
, current_template_parms
);
12706 /* Until the type is defined, tentatively accept whatever
12707 structure tag the user hands us. */
12708 if (TYPE_SIZE (ref
) == NULL_TREE
12709 && ref
!= current_class_type
12710 /* Have to check this, in case we have contradictory tag info. */
12711 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12713 if (tag_code
== class_type
)
12714 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12715 else if (tag_code
== record_type
|| tag_code
== signature_type
)
12716 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12721 TREE_TYPE (ref
) = attributes
;
12727 xref_tag_from_type (old
, id
, globalize
)
12731 tree code_type_node
;
12733 if (TREE_CODE (old
) == RECORD_TYPE
)
12734 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12735 ? class_type_node
: record_type_node
);
12737 code_type_node
= union_type_node
;
12739 if (id
== NULL_TREE
)
12740 id
= TYPE_IDENTIFIER (old
);
12742 return xref_tag (code_type_node
, id
, globalize
);
12745 /* REF is a type (named NAME), for which we have just seen some
12746 baseclasses. BINFO is a list of those baseclasses; the
12747 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12748 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12749 struct, or union. */
12752 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12753 tree code_type_node
;
12757 /* In the declaration `A : X, Y, ... Z' we mark all the types
12758 (A, X, Y, ..., Z) so we can check for duplicates. */
12763 enum tag_types tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
12765 if (tag_code
== union_type
)
12767 cp_error ("derived union `%T' invalid", ref
);
12771 len
= list_length (binfo
);
12772 push_obstacks (TYPE_OBSTACK (ref
), TYPE_OBSTACK (ref
));
12774 /* First, make sure that any templates in base-classes are
12775 instantiated. This ensures that if we call ourselves recursively
12776 we do not get confused about which classes are marked and which
12778 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12779 complete_type (TREE_VALUE (base
));
12781 SET_CLASSTYPE_MARKED (ref
);
12782 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12784 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12786 /* The base of a derived struct is public by default. */
12788 = (TREE_PURPOSE (binfo
) == access_public_node
12789 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12790 || (tag_code
!= class_type
12791 && (TREE_PURPOSE (binfo
) == access_default_node
12792 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12794 = (TREE_PURPOSE (binfo
) == access_protected_node
12795 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12797 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12798 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12799 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12800 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12801 tree basetype
= TREE_VALUE (binfo
);
12804 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12805 basetype
= TREE_TYPE (basetype
);
12807 || (TREE_CODE (basetype
) != RECORD_TYPE
12808 && TREE_CODE (basetype
) != TYPENAME_TYPE
12809 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12810 && TREE_CODE (basetype
) != TEMPLATE_TEMPLATE_PARM
))
12812 cp_error ("base type `%T' fails to be a struct or class type",
12813 TREE_VALUE (binfo
));
12817 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12819 /* This code replaces similar code in layout_basetypes.
12820 We put the complete_type first for implicit `typename'. */
12821 if (TYPE_SIZE (basetype
) == NULL_TREE
12822 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12824 cp_error ("base class `%T' has incomplete type", basetype
);
12829 if (CLASSTYPE_MARKED (basetype
))
12831 if (basetype
== ref
)
12832 cp_error ("recursive type `%T' undefined", basetype
);
12834 cp_error ("duplicate base type `%T' invalid", basetype
);
12838 if (TYPE_FOR_JAVA (basetype
)
12839 && current_lang_stack
== current_lang_base
)
12840 TYPE_FOR_JAVA (ref
) = 1;
12842 /* Note that the BINFO records which describe individual
12843 inheritances are *not* shared in the lattice! They
12844 cannot be shared because a given baseclass may be
12845 inherited with different `accessibility' by different
12846 derived classes. (Each BINFO record describing an
12847 individual inheritance contains flags which say what
12848 the `accessibility' of that particular inheritance is.) */
12851 = make_binfo (integer_zero_node
, basetype
,
12852 CLASS_TYPE_P (basetype
)
12853 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
12854 CLASS_TYPE_P (basetype
)
12855 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
12857 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
12858 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
12859 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
12860 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
12861 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
12863 /* We need to unshare the binfos now so that lookups during class
12864 definition work. */
12865 unshare_base_binfos (base_binfo
);
12867 SET_CLASSTYPE_MARKED (basetype
);
12869 /* We are free to modify these bits because they are meaningless
12870 at top level, and BASETYPE is a top-level type. */
12871 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
12873 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
12874 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12877 if (CLASS_TYPE_P (basetype
))
12879 TYPE_GETS_NEW (ref
) |= TYPE_GETS_NEW (basetype
);
12880 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
12887 TREE_VEC_LENGTH (binfos
) = i
;
12889 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
12892 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
12895 tree basetype
= BINFO_TYPE (TREE_VEC_ELT (binfos
, 0));
12897 if (CLASS_TYPE_P (basetype
))
12898 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
12899 = TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
12902 if (TYPE_USES_MULTIPLE_INHERITANCE (ref
))
12903 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12905 /* Unmark all the types. */
12907 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
12908 CLEAR_CLASSTYPE_MARKED (ref
);
12910 /* Now that we know all the base-classes, set up the list of virtual
12912 CLASSTYPE_VBASECLASSES (ref
) = get_vbase_types (ref
);
12918 /* Begin compiling the definition of an enumeration type.
12919 NAME is its name (or null if anonymous).
12920 Returns the type object, as yet incomplete.
12921 Also records info about it so that build_enumerator
12922 may be used to declare the individual values as they are read. */
12928 register tree enumtype
= NULL_TREE
;
12929 struct binding_level
*b
= current_binding_level
;
12931 /* We are wasting space here and putting these on the permanent_obstack so
12932 that typeid(local enum) will work correctly. */
12933 push_obstacks (&permanent_obstack
, &permanent_obstack
);
12935 /* If this is the real definition for a previous forward reference,
12936 fill in the contents in the same object that used to be the
12937 forward reference. */
12939 if (name
!= NULL_TREE
)
12940 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
12942 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
12943 cp_error ("multiple definition of `%#T'", enumtype
);
12946 enumtype
= make_node (ENUMERAL_TYPE
);
12947 pushtag (name
, enumtype
, 0);
12950 if (current_class_type
)
12951 TREE_ADDRESSABLE (b
->tags
) = 1;
12953 /* We don't copy this value because build_enumerator needs to do it. */
12954 enum_next_value
= integer_zero_node
;
12957 GNU_xref_decl (current_function_decl
, enumtype
);
12961 /* After processing and defining all the values of an enumeration type,
12962 install their decls in the enumeration type and finish it off.
12963 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12964 Returns ENUMTYPE. */
12967 finish_enum (enumtype
)
12970 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
12971 /* Calculate the maximum value of any enumerator in this type. */
12973 tree values
= TYPE_VALUES (enumtype
);
12978 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
12983 /* The TREE_VALUE is a CONST_DECL for this enumeration
12985 decl
= TREE_VALUE (pair
);
12987 /* The DECL_INITIAL will be NULL if we are processing a
12988 template declaration and this enumeration constant had no
12989 explicit initializer. */
12990 value
= DECL_INITIAL (decl
);
12991 if (value
&& !processing_template_decl
)
12993 /* Set the TREE_TYPE for the VALUE as well. That's so
12994 that when we call decl_constant_value we get an
12995 entity of the right type (but with the constant
12996 value). Since we shouldn't ever call
12997 decl_constant_value on a template type, there's no
12998 reason to do that when processing_template_decl.
12999 And, if the expression is something like a
13000 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
13001 wreak havoc on the intended type of the expression.
13003 Of course, there's also no point in trying to compute
13004 minimum or maximum values if we're in a template. */
13005 TREE_TYPE (value
) = enumtype
;
13008 minnode
= maxnode
= value
;
13009 else if (tree_int_cst_lt (maxnode
, value
))
13011 else if (tree_int_cst_lt (value
, minnode
))
13015 if (processing_template_decl
)
13016 /* If this is just a template, leave the CONST_DECL
13017 alone. That way tsubst_copy will find CONST_DECLs for
13018 CONST_DECLs, and not INTEGER_CSTs. */
13021 /* In the list we're building up, we want the enumeration
13022 values, not the CONST_DECLs. */
13023 TREE_VALUE (pair
) = value
;
13027 maxnode
= minnode
= integer_zero_node
;
13029 TYPE_VALUES (enumtype
) = nreverse (values
);
13031 if (processing_template_decl
)
13033 tree scope
= current_scope ();
13034 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
13035 add_tree (build_min (TAG_DEFN
, enumtype
));
13039 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
13040 int lowprec
= min_precision (minnode
, unsignedp
);
13041 int highprec
= min_precision (maxnode
, unsignedp
);
13042 int precision
= MAX (lowprec
, highprec
);
13045 TYPE_SIZE (enumtype
) = NULL_TREE
;
13047 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
13049 TYPE_PRECISION (enumtype
) = precision
;
13051 fixup_unsigned_type (enumtype
);
13053 fixup_signed_type (enumtype
);
13055 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
13056 /* Use the width of the narrowest normal C type which is wide
13058 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
13061 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
13063 TYPE_SIZE (enumtype
) = 0;
13064 layout_type (enumtype
);
13066 /* Fix up all variant types of this enum type. */
13067 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
13068 tem
= TYPE_NEXT_VARIANT (tem
))
13070 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
13071 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
13072 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
13073 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
13074 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
13075 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
13076 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
13077 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
13078 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
13081 /* Finish debugging output for this type. */
13082 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
13085 /* In start_enum we pushed obstacks. Here, we must pop them. */
13091 /* Build and install a CONST_DECL for an enumeration constant of the
13092 enumeration type TYPE whose NAME and VALUE (if any) are provided.
13093 Assignment of sequential values by default is handled here. */
13096 build_enumerator (name
, value
, type
)
13104 /* Remove no-op casts from the value. */
13106 STRIP_TYPE_NOPS (value
);
13108 if (! processing_template_decl
)
13110 /* Validate and default VALUE. */
13111 if (value
!= NULL_TREE
)
13113 if (TREE_READONLY_DECL_P (value
))
13114 value
= decl_constant_value (value
);
13116 if (TREE_CODE (value
) == INTEGER_CST
)
13118 value
= default_conversion (value
);
13119 constant_expression_warning (value
);
13123 cp_error ("enumerator value for `%D' not integer constant", name
);
13128 /* Default based on previous value. */
13129 if (value
== NULL_TREE
&& ! processing_template_decl
)
13131 value
= enum_next_value
;
13133 cp_error ("overflow in enumeration values at `%D'", name
);
13136 /* Remove no-op casts from the value. */
13138 STRIP_TYPE_NOPS (value
);
13140 /* To fix MAX_VAL enum consts. (bkoz) */
13141 TREE_TYPE (value
) = integer_type_node
;
13145 /* We always have to copy here; not all INTEGER_CSTs are unshared.
13146 Even in other cases, we will later (in finish_enum) be setting the
13148 if (value
!= NULL_TREE
)
13149 value
= copy_node (value
);
13151 /* C++ associates enums with global, function, or class declarations. */
13153 context
= current_scope ();
13154 if (context
&& context
== current_class_type
)
13155 /* This enum declaration is local to the class. */
13156 decl
= build_lang_field_decl (CONST_DECL
, name
, type
);
13158 /* It's a global enum, or it's local to a function. (Note local to
13159 a function could mean local to a class method. */
13160 decl
= build_decl (CONST_DECL
, name
, type
);
13162 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
13163 DECL_INITIAL (decl
) = value
;
13164 TREE_READONLY (decl
) = 1;
13166 if (context
&& context
== current_class_type
)
13167 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
13168 on the TYPE_FIELDS list for `S'. (That's so that you can say
13169 things like `S::i' later.) */
13170 finish_member_declaration (decl
);
13174 GNU_xref_decl (current_function_decl
, decl
);
13177 if (! processing_template_decl
)
13179 /* Set basis for default for next value. */
13180 enum_next_value
= build_binary_op_nodefault (PLUS_EXPR
, value
,
13181 integer_one_node
, PLUS_EXPR
);
13182 enum_overflow
= tree_int_cst_lt (enum_next_value
, value
);
13185 result
= saveable_tree_cons (name
, decl
, NULL_TREE
);
13190 static int function_depth
;
13192 /* Create the FUNCTION_DECL for a function definition.
13193 DECLSPECS and DECLARATOR are the parts of the declaration;
13194 they describe the function's name and the type it returns,
13195 but twisted together in a fashion that parallels the syntax of C.
13197 If PRE_PARSED_P is non-zero then DECLARATOR is really the DECL for
13198 the function we are about to process; DECLSPECS are ignored. For
13199 example, we set PRE_PARSED_P when processing the definition of
13200 inline function that was defined in-class; the definition is
13201 actually processed when the class is complete. In this case,
13202 PRE_PARSED_P is 2. We also set PRE_PARSED_P when instanting the
13203 body of a template function, and when constructing thunk functions
13204 and such; in these cases PRE_PARSED_P is 1.
13206 This function creates a binding context for the function body
13207 as well as setting up the FUNCTION_DECL in current_function_decl.
13209 Returns 1 on success. If the DECLARATOR is not suitable for a function
13210 (it defines a datum instead), we return 0, which tells
13211 yyparse to report a parse error.
13213 For C++, we must first check whether that datum makes any sense.
13214 For example, "class A local_a(1,2);" means that variable local_a
13215 is an aggregate of type A, which should have a constructor
13216 applied to it with the argument list [1, 2].
13218 @@ There is currently no way to retrieve the storage
13219 @@ allocated to FUNCTION (or all of its parms) if we return
13220 @@ something we had previously. */
13223 start_function (declspecs
, declarator
, attrs
, pre_parsed_p
)
13224 tree declspecs
, declarator
, attrs
;
13228 tree ctype
= NULL_TREE
;
13231 extern int have_extern_spec
;
13232 extern int used_extern_spec
;
13233 int doing_friend
= 0;
13235 /* Sanity check. */
13236 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
13237 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
13239 /* Assume, until we see it does. */
13240 current_function_returns_value
= 0;
13241 current_function_returns_null
= 0;
13243 shadowed_labels
= 0;
13244 current_function_assigns_this
= 0;
13245 current_function_just_assigned_this
= 0;
13246 current_function_parms_stored
= 0;
13247 original_result_rtx
= NULL_RTX
;
13248 base_init_expr
= NULL_TREE
;
13249 current_base_init_list
= NULL_TREE
;
13250 current_member_init_list
= NULL_TREE
;
13251 ctor_label
= dtor_label
= NULL_TREE
;
13252 static_labelno
= 0;
13254 clear_temp_name ();
13256 /* This should only be done once on the top most decl. */
13257 if (have_extern_spec
&& !used_extern_spec
)
13259 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
13260 used_extern_spec
= 1;
13265 decl1
= declarator
;
13268 /* What was this testing for, exactly? */
13269 if (! DECL_ARGUMENTS (decl1
)
13270 && !DECL_STATIC_FUNCTION_P (decl1
)
13271 && !DECL_ARTIFICIAL (decl1
)
13272 && DECL_CLASS_SCOPE_P (decl1
)
13273 && TYPE_IDENTIFIER (DECL_CONTEXT (decl1
))
13274 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (DECL_CONTEXT (decl1
))))
13276 tree binding
= binding_for_name (DECL_NAME (decl1
),
13277 current_namespace
);
13278 cp_error ("redeclaration of `%#D'", decl1
);
13279 if (IDENTIFIER_CLASS_VALUE (DECL_NAME (decl1
)))
13280 cp_error_at ("previous declaration here", IDENTIFIER_CLASS_VALUE (DECL_NAME (decl1
)));
13281 else if (BINDING_VALUE (binding
))
13282 cp_error_at ("previous declaration here", BINDING_VALUE (binding
));
13286 fntype
= TREE_TYPE (decl1
);
13287 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13288 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13290 /* ANSI C++ June 5 1992 WP 11.4.5. A friend function defined in a
13291 class is in the (lexical) scope of the class in which it is
13293 if (!ctype
&& DECL_FRIEND_P (decl1
))
13295 ctype
= DECL_CLASS_CONTEXT (decl1
);
13297 /* CTYPE could be null here if we're dealing with a template;
13298 for example, `inline friend float foo()' inside a template
13299 will have no CTYPE set. */
13300 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
13306 last_function_parms
= DECL_ARGUMENTS (decl1
);
13307 last_function_parm_tags
= NULL_TREE
;
13311 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
13312 /* If the declarator is not suitable for a function definition,
13313 cause a syntax error. */
13314 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
13316 fntype
= TREE_TYPE (decl1
);
13318 restype
= TREE_TYPE (fntype
);
13319 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
13321 cp_error ("semicolon missing after declaration of `%#T'", restype
);
13322 shadow_tag (build_expr_list (NULL_TREE
, restype
));
13323 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
13324 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
13325 fntype
= build_function_type (integer_type_node
,
13326 TYPE_ARG_TYPES (fntype
));
13328 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
13330 TYPE_ARG_TYPES (fntype
));
13331 TREE_TYPE (decl1
) = fntype
;
13334 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13335 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13336 else if (DECL_MAIN_P (decl1
))
13338 /* If this doesn't return integer_type, complain. */
13339 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
13341 if (pedantic
|| warn_return_type
)
13342 pedwarn ("return type for `main' changed to `int'");
13343 TREE_TYPE (decl1
) = fntype
= default_function_type
;
13348 /* Warn if function was previously implicitly declared
13349 (but not if we warned then). */
13350 if (! warn_implicit
13351 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
13352 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
13354 announce_function (decl1
);
13356 /* Set up current_class_type, and enter the scope of the class, if
13359 push_nested_class (ctype
, 1);
13360 else if (DECL_STATIC_FUNCTION_P (decl1
))
13361 push_nested_class (DECL_CONTEXT (decl1
), 2);
13363 /* Now that we have entered the scope of the class, we must restore
13364 the bindings for any template parameters surrounding DECL1, if it
13365 is an inline member template. (Order is important; consider the
13366 case where a template parameter has the same name as a field of
13367 the class.) It is not until after this point that
13368 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
13369 if (pre_parsed_p
== 2)
13370 maybe_begin_member_template_processing (decl1
);
13372 /* We are now in the scope of the function being defined. */
13373 current_function_decl
= decl1
;
13375 /* Save the parm names or decls from this function's declarator
13376 where store_parm_decls will find them. */
13377 current_function_parms
= last_function_parms
;
13378 current_function_parm_tags
= last_function_parm_tags
;
13380 if (! processing_template_decl
)
13382 /* In a function definition, arg types must be complete. */
13383 require_complete_types_for_parms (current_function_parms
);
13385 if (TYPE_SIZE (complete_type (TREE_TYPE (fntype
))) == NULL_TREE
)
13387 cp_error ("return-type `%#T' is an incomplete type",
13388 TREE_TYPE (fntype
));
13390 /* Make it return void instead, but don't change the
13391 type of the DECL_RESULT, in case we have a named return value. */
13394 = build_cplus_method_type (build_type_variant (ctype
,
13395 TREE_READONLY (decl1
),
13396 TREE_SIDE_EFFECTS (decl1
)),
13398 FUNCTION_ARG_CHAIN (decl1
));
13401 = build_function_type (void_type_node
,
13402 TYPE_ARG_TYPES (TREE_TYPE (decl1
)));
13403 DECL_RESULT (decl1
)
13404 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (TREE_TYPE (fntype
)));
13405 TREE_READONLY (DECL_RESULT (decl1
))
13406 = CP_TYPE_CONST_P (TREE_TYPE (fntype
));
13407 TREE_THIS_VOLATILE (DECL_RESULT (decl1
))
13408 = CP_TYPE_VOLATILE_P (TREE_TYPE (fntype
));
13411 if (TYPE_LANG_SPECIFIC (TREE_TYPE (fntype
))
13412 && CLASSTYPE_ABSTRACT_VIRTUALS (TREE_TYPE (fntype
)))
13413 abstract_virtuals_error (decl1
, TREE_TYPE (fntype
));
13416 /* Effective C++ rule 15. See also c_expand_return. */
13418 && DECL_NAME (decl1
) == ansi_opname
[(int) MODIFY_EXPR
]
13419 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
13420 cp_warning ("`operator=' should return a reference to `*this'");
13422 /* Make the init_value nonzero so pushdecl knows this is not tentative.
13423 error_mark_node is replaced below (in poplevel) with the BLOCK. */
13424 DECL_INITIAL (decl1
) = error_mark_node
;
13426 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
13427 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
13430 /* This function exists in static storage.
13431 (This does not mean `static' in the C sense!) */
13432 TREE_STATIC (decl1
) = 1;
13434 /* We must call push_template_decl after current_class_type is set
13435 up. (If we are processing inline definitions after exiting a
13436 class scope, current_class_type will be NULL_TREE until set above
13437 by push_nested_class.) */
13438 if (processing_template_decl
)
13439 decl1
= push_template_decl (decl1
);
13441 /* Record the decl so that the function name is defined.
13442 If we already have a decl for this name, and it is a FUNCTION_DECL,
13443 use the old decl. */
13444 if (!processing_template_decl
&& pre_parsed_p
== 0)
13446 /* A specialization is not used to guide overload resolution. */
13447 if ((flag_guiding_decls
13448 || !DECL_TEMPLATE_SPECIALIZATION (decl1
))
13449 && ! DECL_FUNCTION_MEMBER_P (decl1
))
13450 decl1
= pushdecl (decl1
);
13453 /* We need to set the DECL_CONTEXT. */
13454 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
13455 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
13456 /* And make sure we have enough default args. */
13457 check_default_args (decl1
);
13459 DECL_MAIN_VARIANT (decl1
) = decl1
;
13460 fntype
= TREE_TYPE (decl1
);
13463 current_function_decl
= decl1
;
13465 if (DECL_INTERFACE_KNOWN (decl1
))
13467 tree ctx
= hack_decl_function_context (decl1
);
13469 if (DECL_NOT_REALLY_EXTERN (decl1
))
13470 DECL_EXTERNAL (decl1
) = 0;
13472 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
13473 && TREE_PUBLIC (ctx
))
13474 /* This is a function in a local class in an extern inline
13476 comdat_linkage (decl1
);
13478 /* If this function belongs to an interface, it is public.
13479 If it belongs to someone else's interface, it is also external.
13480 This only affects inlines and template instantiations. */
13481 else if (interface_unknown
== 0
13482 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13483 || flag_alt_external_templates
))
13485 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
13486 || processing_template_decl
)
13488 DECL_EXTERNAL (decl1
)
13490 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
13491 && !DECL_VINDEX (decl1
)));
13493 /* For WIN32 we also want to put these in linkonce sections. */
13494 maybe_make_one_only (decl1
);
13497 DECL_EXTERNAL (decl1
) = 0;
13498 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
13499 DECL_INTERFACE_KNOWN (decl1
) = 1;
13501 else if (interface_unknown
&& interface_only
13502 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13503 || flag_alt_external_templates
))
13505 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13506 interface, we will have interface_only set but not
13507 interface_known. In that case, we don't want to use the normal
13508 heuristics because someone will supply a #pragma implementation
13509 elsewhere, and deducing it here would produce a conflict. */
13510 comdat_linkage (decl1
);
13511 DECL_EXTERNAL (decl1
) = 0;
13512 DECL_INTERFACE_KNOWN (decl1
) = 1;
13513 DECL_DEFER_OUTPUT (decl1
) = 1;
13517 /* This is a definition, not a reference.
13518 So clear DECL_EXTERNAL. */
13519 DECL_EXTERNAL (decl1
) = 0;
13521 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
13522 && ! DECL_INTERFACE_KNOWN (decl1
)
13523 /* Don't try to defer nested functions for now. */
13524 && ! hack_decl_function_context (decl1
))
13525 DECL_DEFER_OUTPUT (decl1
) = 1;
13527 DECL_INTERFACE_KNOWN (decl1
) = 1;
13530 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
))
13532 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13533 TREE_TYPE (decl1
) = fntype
13534 = build_function_type (TREE_TYPE (fntype
),
13535 TREE_CHAIN (TYPE_ARG_TYPES (fntype
)));
13536 current_function_parms
= TREE_CHAIN (current_function_parms
);
13537 DECL_ARGUMENTS (decl1
) = current_function_parms
;
13540 restype
= TREE_TYPE (fntype
);
13544 /* If we're compiling a friend function, neither of the variables
13545 current_class_ptr nor current_class_type will have values. */
13546 if (! doing_friend
)
13548 /* We know that this was set up by `grokclassfn'.
13549 We do not wait until `store_parm_decls', since evil
13550 parse errors may never get us to that point. Here
13551 we keep the consistency between `current_class_type'
13552 and `current_class_ptr'. */
13553 tree t
= current_function_parms
;
13555 my_friendly_assert (t
!= NULL_TREE
13556 && TREE_CODE (t
) == PARM_DECL
, 162);
13558 if (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
)
13562 if (! hack_decl_function_context (decl1
))
13563 temporary_allocation ();
13564 i
= suspend_momentary ();
13566 /* Normally, build_indirect_ref returns
13567 current_class_ref whenever current_class_ptr is
13568 dereferenced. This time, however, we want it to
13569 *create* current_class_ref, so we temporarily clear
13570 current_class_ptr to fool it. */
13571 current_class_ptr
= NULL_TREE
;
13572 current_class_ref
= build_indirect_ref (t
, NULL_PTR
);
13573 current_class_ptr
= t
;
13575 resume_momentary (i
);
13576 if (! hack_decl_function_context (decl1
))
13577 end_temporary_allocation ();
13580 /* We're having a signature pointer here. */
13581 current_class_ref
= current_class_ptr
= t
;
13586 current_class_ptr
= current_class_ref
= NULL_TREE
;
13589 current_binding_level
->parm_flag
= 1;
13591 GNU_xref_function (decl1
, current_function_parms
);
13594 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13596 make_function_rtl (decl1
);
13598 /* Promote the value to int before returning it. */
13599 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13600 restype
= type_promotes_to (restype
);
13602 /* If this fcn was already referenced via a block-scope `extern' decl
13603 (or an implicit decl), propagate certain information about the usage. */
13604 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13605 TREE_ADDRESSABLE (decl1
) = 1;
13607 if (DECL_RESULT (decl1
) == NULL_TREE
)
13609 DECL_RESULT (decl1
)
13610 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13611 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13612 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13615 /* Allocate further tree nodes temporarily during compilation
13616 of this function only. Tiemann moved up here from bottom of fn. */
13617 /* If this is a nested function, then we must continue to allocate RTL
13618 on the permanent obstack in case we need to inline it later. */
13619 if (! hack_decl_function_context (decl1
))
13620 temporary_allocation ();
13622 if (processing_template_decl
)
13624 ++minimal_parse_mode
;
13625 last_tree
= DECL_SAVED_TREE (decl1
)
13626 = build_nt (EXPR_STMT
, void_zero_node
);
13631 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl1
))
13632 && DECL_LANGUAGE (decl1
) == lang_cplusplus
)
13634 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13635 ctor_label
= NULL_TREE
;
13639 dtor_label
= NULL_TREE
;
13640 if (DECL_CONSTRUCTOR_P (decl1
))
13641 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13647 /* Called after store_parm_decls for a function-try-block. We need to update
13648 last_parm_cleanup_insn so that the base initializers for a constructor
13649 are run within this block, not before it. */
13652 expand_start_early_try_stmts ()
13654 expand_start_try_stmts ();
13655 last_parm_cleanup_insn
= get_last_insn ();
13658 /* Store the parameter declarations into the current function declaration.
13659 This is called after parsing the parameter declarations, before
13660 digesting the body of the function.
13662 Also install to binding contour return value identifier, if any. */
13665 store_parm_decls ()
13667 register tree fndecl
= current_function_decl
;
13668 register tree parm
;
13669 int parms_have_cleanups
= 0;
13670 tree cleanups
= NULL_TREE
;
13672 /* This is either a chain of PARM_DECLs (when a prototype is used). */
13673 tree specparms
= current_function_parms
;
13675 /* This is a list of types declared among parms in a prototype. */
13676 tree parmtags
= current_function_parm_tags
;
13678 /* This is a chain of any other decls that came in among the parm
13679 declarations. If a parm is declared with enum {foo, bar} x;
13680 then CONST_DECLs for foo and bar are put here. */
13681 tree nonparms
= NULL_TREE
;
13683 if (toplevel_bindings_p ())
13684 fatal ("parse errors have confused me too much");
13686 /* Initialize RTL machinery. */
13687 init_function_start (fndecl
, input_filename
, lineno
);
13689 /* Create a binding level for the parms. */
13690 expand_start_bindings (0);
13692 if (specparms
!= NULL_TREE
)
13694 /* This case is when the function was defined with an ANSI prototype.
13695 The parms already have decls, so we need not do anything here
13696 except record them as in effect
13697 and complain if any redundant old-style parm decls were written. */
13699 register tree next
;
13701 /* Must clear this because it might contain TYPE_DECLs declared
13703 storedecls (NULL_TREE
);
13705 for (parm
= nreverse (specparms
); parm
; parm
= next
)
13707 next
= TREE_CHAIN (parm
);
13708 if (TREE_CODE (parm
) == PARM_DECL
)
13711 if (DECL_NAME (parm
) == NULL_TREE
)
13715 else if (TREE_CODE (TREE_TYPE (parm
)) == VOID_TYPE
)
13716 cp_error ("parameter `%D' declared void", parm
);
13719 /* Now fill in DECL_REFERENCE_SLOT for any of the parm decls.
13720 A parameter is assumed not to have any side effects.
13721 If this should change for any reason, then this
13722 will have to wrap the bashed reference type in a save_expr.
13724 Also, if the parameter type is declared to be an X
13725 and there is an X(X&) constructor, we cannot lay it
13726 into the stack (any more), so we make this parameter
13727 look like it is really of reference type. Functions
13728 which pass parameters to this function will know to
13729 create a temporary in their frame, and pass a reference
13732 if (TREE_CODE (TREE_TYPE (parm
)) == REFERENCE_TYPE
13733 && TYPE_SIZE (TREE_TYPE (TREE_TYPE (parm
))))
13734 SET_DECL_REFERENCE_SLOT (parm
, convert_from_reference (parm
));
13738 if (! processing_template_decl
13739 && (cleanup
= maybe_build_cleanup (parm
), cleanup
))
13741 expand_decl (parm
);
13742 parms_have_cleanups
= 1;
13744 /* Keep track of the cleanups. */
13745 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13750 /* If we find an enum constant or a type tag,
13751 put it aside for the moment. */
13752 TREE_CHAIN (parm
) = NULL_TREE
;
13753 nonparms
= chainon (nonparms
, parm
);
13757 /* Get the decls in their original chain order
13758 and record in the function. This is all and only the
13759 PARM_DECLs that were pushed into scope by the loop above. */
13760 DECL_ARGUMENTS (fndecl
) = getdecls ();
13762 storetags (chainon (parmtags
, gettags ()));
13765 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13767 /* Now store the final chain of decls for the arguments
13768 as the decl-chain of the current lexical scope.
13769 Put the enumerators in as well, at the front so that
13770 DECL_ARGUMENTS is not modified. */
13772 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13774 /* Declare __FUNCTION__ and __PRETTY_FUNCTION__ for this function. */
13775 declare_function_name ();
13777 /* Initialize the RTL code for the function. */
13778 DECL_SAVED_INSNS (fndecl
) = NULL_RTX
;
13779 if (! processing_template_decl
)
13780 expand_function_start (fndecl
, parms_have_cleanups
);
13782 current_function_parms_stored
= 1;
13784 /* If this function is `main', emit a call to `__main'
13785 to run global initializers, etc. */
13786 if (DECL_MAIN_P (fndecl
))
13787 expand_main_function ();
13789 /* Now that we have initialized the parms, we can start their
13790 cleanups. We cannot do this before, since expand_decl_cleanup
13791 should not be called before the parm can be used. */
13793 && ! processing_template_decl
)
13795 for (cleanups
= nreverse (cleanups
); cleanups
; cleanups
= TREE_CHAIN (cleanups
))
13797 if (! expand_decl_cleanup (TREE_PURPOSE (cleanups
), TREE_VALUE (cleanups
)))
13798 cp_error ("parser lost in parsing declaration of `%D'",
13799 TREE_PURPOSE (cleanups
));
13803 /* Create a binding contour which can be used to catch
13804 cleanup-generated temporaries. Also, if the return value needs or
13805 has initialization, deal with that now. */
13806 if (parms_have_cleanups
)
13809 expand_start_bindings (0);
13812 if (! processing_template_decl
&& flag_exceptions
)
13814 /* Do the starting of the exception specifications, if we have any. */
13815 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13816 expand_start_eh_spec ();
13819 last_parm_cleanup_insn
= get_last_insn ();
13820 last_dtor_insn
= get_last_insn ();
13823 /* Bind a name and initialization to the return value of
13824 the current function. */
13827 store_return_init (return_id
, init
)
13828 tree return_id
, init
;
13830 tree decl
= DECL_RESULT (current_function_decl
);
13833 /* Give this error as many times as there are occurrences,
13834 so that users can use Emacs compilation buffers to find
13835 and fix all such places. */
13836 pedwarn ("ANSI C++ does not permit named return values");
13838 if (return_id
!= NULL_TREE
)
13840 if (DECL_NAME (decl
) == NULL_TREE
)
13842 DECL_NAME (decl
) = return_id
;
13843 DECL_ASSEMBLER_NAME (decl
) = return_id
;
13846 cp_error ("return identifier `%D' already in place", decl
);
13849 /* Can't let this happen for constructors. */
13850 if (DECL_CONSTRUCTOR_P (current_function_decl
))
13852 error ("can't redefine default return value for constructors");
13856 /* If we have a named return value, put that in our scope as well. */
13857 if (DECL_NAME (decl
) != NULL_TREE
)
13859 /* If this named return value comes in a register,
13860 put it in a pseudo-register. */
13861 if (DECL_REGISTER (decl
))
13863 original_result_rtx
= DECL_RTL (decl
);
13864 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
13867 /* Let `cp_finish_decl' know that this initializer is ok. */
13868 DECL_INITIAL (decl
) = init
;
13871 if (minimal_parse_mode
)
13872 add_tree (build_min_nt (RETURN_INIT
, return_id
,
13873 copy_to_permanent (init
)));
13875 cp_finish_decl (decl
, init
, NULL_TREE
, 0, 0);
13880 /* Finish up a function declaration and compile that function
13881 all the way to assembler language output. The free the storage
13882 for the function definition.
13884 This is called after parsing the body of the function definition.
13885 LINENO is the current line number.
13887 FLAGS is a bitwise or of the following values:
13889 An extra call to poplevel (and expand_end_bindings) must be
13890 made to take care of the binding contour for the base
13891 initializers. This is only relevant for constructors.
13893 We just finished processing the body of an in-class inline
13894 function definition. (This processing will have taken place
13895 after the class definition is complete.)
13897 NESTED is nonzero if we were in the middle of compiling another function
13898 when we started on this one. */
13901 finish_function (lineno
, flags
, nested
)
13906 register tree fndecl
= current_function_decl
;
13907 tree fntype
, ctype
= NULL_TREE
;
13908 rtx last_parm_insn
, insns
;
13909 /* Label to use if this function is supposed to return a value. */
13910 tree no_return_label
= NULL_TREE
;
13911 tree decls
= NULL_TREE
;
13912 int call_poplevel
= (flags
& 1) != 0;
13913 int inclass_inline
= (flags
& 2) != 0;
13916 /* When we get some parse errors, we can end up without a
13917 current_function_decl, so cope. */
13918 if (fndecl
== NULL_TREE
)
13921 if (function_depth
> 1)
13924 fntype
= TREE_TYPE (fndecl
);
13926 /* TREE_READONLY (fndecl) = 1;
13927 This caused &foo to be of type ptr-to-const-function
13928 which then got a warning when stored in a ptr-to-function variable. */
13930 /* This happens on strange parse errors. */
13931 if (! current_function_parms_stored
)
13934 store_parm_decls ();
13937 if (processing_template_decl
)
13939 if (DECL_CONSTRUCTOR_P (fndecl
) && call_poplevel
)
13941 decls
= getdecls ();
13942 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13943 poplevel (decls
!= NULL_TREE
, 0, 0);
13948 if (write_symbols
!= NO_DEBUG
/*&& TREE_CODE (fntype) != METHOD_TYPE*/)
13950 tree ttype
= target_type (fntype
);
13953 if (IS_AGGR_TYPE (ttype
))
13954 /* Let debugger know it should output info for this type. */
13955 note_debug_info_needed (ttype
);
13957 for (parmdecl
= DECL_ARGUMENTS (fndecl
); parmdecl
; parmdecl
= TREE_CHAIN (parmdecl
))
13959 ttype
= target_type (TREE_TYPE (parmdecl
));
13960 if (IS_AGGR_TYPE (ttype
))
13961 /* Let debugger know it should output info for this type. */
13962 note_debug_info_needed (ttype
);
13966 /* Clean house because we will need to reorder insns here. */
13967 do_pending_stack_adjust ();
13971 tree binfo
= TYPE_BINFO (current_class_type
);
13972 tree cond
= integer_one_node
;
13974 tree in_charge_node
= lookup_name (in_charge_identifier
, 0);
13976 int ok_to_optimize_dtor
= 0;
13977 int empty_dtor
= get_last_insn () == last_dtor_insn
;
13979 if (current_function_assigns_this
)
13980 cond
= build (NE_EXPR
, boolean_type_node
,
13981 current_class_ptr
, integer_zero_node
);
13984 int n_baseclasses
= CLASSTYPE_N_BASECLASSES (current_class_type
);
13986 /* If this destructor is empty, then we don't need to check
13987 whether `this' is NULL in some cases. */
13988 if ((flag_this_is_variable
& 1) == 0)
13989 ok_to_optimize_dtor
= 1;
13990 else if (empty_dtor
)
13991 ok_to_optimize_dtor
13992 = (n_baseclasses
== 0
13993 || (n_baseclasses
== 1
13994 && TYPE_HAS_DESTRUCTOR (TYPE_BINFO_BASETYPE (current_class_type
, 0))));
13997 /* These initializations might go inline. Protect
13998 the binding level of the parms. */
14000 expand_start_bindings (0);
14002 if (current_function_assigns_this
)
14004 current_function_assigns_this
= 0;
14005 current_function_just_assigned_this
= 0;
14008 /* Generate the code to call destructor on base class.
14009 If this destructor belongs to a class with virtual
14010 functions, then set the virtual function table
14011 pointer to represent the type of our base class. */
14013 /* This side-effect makes call to `build_delete' generate the
14014 code we have to have at the end of this destructor.
14015 `build_delete' will set the flag again. */
14016 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
14018 /* These are two cases where we cannot delegate deletion. */
14019 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)
14020 || TYPE_GETS_REG_DELETE (current_class_type
))
14021 exprstmt
= build_delete (current_class_type
, current_class_ref
, integer_zero_node
,
14022 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
, 0);
14024 exprstmt
= build_delete (current_class_type
, current_class_ref
, in_charge_node
,
14025 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
, 0);
14027 /* If we did not assign to this, then `this' is non-zero at
14028 the end of a destructor. As a special optimization, don't
14029 emit test if this is an empty destructor. If it does nothing,
14030 it does nothing. If it calls a base destructor, the base
14031 destructor will perform the test. */
14033 if (exprstmt
!= error_mark_node
14034 && (TREE_CODE (exprstmt
) != NOP_EXPR
14035 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
14036 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
14038 expand_label (dtor_label
);
14039 if (cond
!= integer_one_node
)
14040 expand_start_cond (cond
, 0);
14041 if (exprstmt
!= void_zero_node
)
14042 /* Don't call `expand_expr_stmt' if we're not going to do
14043 anything, since -Wall will give a diagnostic. */
14044 expand_expr_stmt (exprstmt
);
14046 /* Run destructor on all virtual baseclasses. */
14047 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
14049 tree vbases
= nreverse (copy_list (CLASSTYPE_VBASECLASSES (current_class_type
)));
14050 expand_start_cond (build (BIT_AND_EXPR
, integer_type_node
,
14051 in_charge_node
, integer_two_node
), 0);
14054 if (TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (vbases
)))
14056 tree vb
= get_vbase
14057 (BINFO_TYPE (vbases
),
14058 TYPE_BINFO (current_class_type
));
14060 (build_scoped_method_call
14061 (current_class_ref
, vb
, dtor_identifier
,
14062 build_expr_list (NULL_TREE
, integer_zero_node
)));
14064 vbases
= TREE_CHAIN (vbases
);
14066 expand_end_cond ();
14069 do_pending_stack_adjust ();
14070 if (cond
!= integer_one_node
)
14071 expand_end_cond ();
14074 virtual_size
= c_sizeof (current_class_type
);
14076 /* At the end, call delete if that's what's requested. */
14078 /* FDIS sez: At the point of definition of a virtual destructor
14079 (including an implicit definition), non-placement operator
14080 delete shall be looked up in the scope of the destructor's
14081 class and if found shall be accessible and unambiguous.
14083 This is somewhat unclear, but I take it to mean that if the
14084 class only defines placement deletes we don't do anything here.
14085 So we pass LOOKUP_SPECULATIVELY; delete_sanity will complain
14086 for us if they ever try to delete one of these. */
14088 if (TYPE_GETS_REG_DELETE (current_class_type
)
14089 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
14090 exprstmt
= build_op_delete_call
14091 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
14092 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
14094 exprstmt
= NULL_TREE
;
14098 cond
= build (BIT_AND_EXPR
, integer_type_node
,
14099 in_charge_node
, integer_one_node
);
14100 expand_start_cond (cond
, 0);
14101 expand_expr_stmt (exprstmt
);
14102 expand_end_cond ();
14105 /* End of destructor. */
14106 expand_end_bindings (NULL_TREE
, getdecls () != NULL_TREE
, 0);
14107 poplevel (getdecls () != NULL_TREE
, 0, 0);
14109 /* Back to the top of destructor. */
14110 /* Don't execute destructor code if `this' is NULL. */
14114 /* If the dtor is empty, and we know there is not possible way we
14115 could use any vtable entries, before they are possibly set by
14116 a base class dtor, we don't have to setup the vtables, as we
14117 know that any base class dtoring will set up any vtables it
14118 needs. We avoid MI, because one base class dtor can do a
14119 virtual dispatch to an overridden function that would need to
14120 have a non-related vtable set up, we cannot avoid setting up
14121 vtables in that case. We could change this to see if there is
14122 just one vtable. */
14123 if (! empty_dtor
|| TYPE_USES_COMPLEX_INHERITANCE (current_class_type
))
14125 /* Make all virtual function table pointers in non-virtual base
14126 classes point to CURRENT_CLASS_TYPE's virtual function
14128 expand_direct_vtbls_init (binfo
, binfo
, 1, 0, current_class_ptr
);
14130 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
14131 expand_indirect_vtbls_init (binfo
, current_class_ref
, current_class_ptr
);
14134 if (! ok_to_optimize_dtor
)
14136 cond
= build_binary_op (NE_EXPR
,
14137 current_class_ptr
, integer_zero_node
);
14138 expand_start_cond (cond
, 0);
14141 insns
= get_insns ();
14144 last_parm_insn
= get_first_nonparm_insn ();
14145 if (last_parm_insn
== NULL_RTX
)
14146 last_parm_insn
= get_last_insn ();
14148 last_parm_insn
= previous_insn (last_parm_insn
);
14150 emit_insns_after (insns
, last_parm_insn
);
14152 if (! ok_to_optimize_dtor
)
14153 expand_end_cond ();
14155 else if (current_function_assigns_this
)
14157 /* Does not need to call emit_base_init, because
14158 that is done (if needed) just after assignment to this
14161 if (DECL_CONSTRUCTOR_P (current_function_decl
))
14163 end_protect_partials ();
14164 expand_label (ctor_label
);
14165 ctor_label
= NULL_TREE
;
14169 decls
= getdecls ();
14170 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
14171 poplevel (decls
!= NULL_TREE
, 0, 0);
14173 /* c_expand_return knows to return 'this' from a constructor. */
14174 c_expand_return (NULL_TREE
);
14176 else if (TREE_CODE (TREE_TYPE (DECL_RESULT (current_function_decl
))) != VOID_TYPE
14177 && return_label
!= NULL_RTX
)
14178 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
14180 current_function_assigns_this
= 0;
14181 current_function_just_assigned_this
= 0;
14182 base_init_expr
= NULL_TREE
;
14184 else if (DECL_CONSTRUCTOR_P (fndecl
))
14186 tree cond
= NULL_TREE
, thenclause
= NULL_TREE
;
14187 /* Allow constructor for a type to get a new instance of the object
14188 using `build_new'. */
14189 tree abstract_virtuals
= CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
);
14190 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
) = NULL_TREE
;
14192 if (flag_this_is_variable
> 0)
14194 cond
= build_binary_op (EQ_EXPR
,
14195 current_class_ptr
, integer_zero_node
);
14196 thenclause
= build_modify_expr (current_class_ptr
, NOP_EXPR
,
14197 build_new (NULL_TREE
, current_class_type
, void_type_node
, 0));
14200 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
) = abstract_virtuals
;
14204 if (flag_this_is_variable
> 0)
14206 expand_start_cond (cond
, 0);
14207 expand_expr_stmt (thenclause
);
14208 expand_end_cond ();
14211 /* Emit insns from `emit_base_init' which sets up virtual
14212 function table pointer(s). */
14213 if (base_init_expr
)
14215 expand_expr_stmt (base_init_expr
);
14216 base_init_expr
= NULL_TREE
;
14219 insns
= get_insns ();
14222 /* This is where the body of the constructor begins. */
14224 emit_insns_after (insns
, last_parm_cleanup_insn
);
14226 end_protect_partials ();
14228 /* This is where the body of the constructor ends. */
14229 expand_label (ctor_label
);
14230 ctor_label
= NULL_TREE
;
14234 decls
= getdecls ();
14235 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
14236 poplevel (decls
!= NULL_TREE
, 1, 0);
14239 /* c_expand_return knows to return 'this' from a constructor. */
14240 c_expand_return (NULL_TREE
);
14242 current_function_assigns_this
= 0;
14243 current_function_just_assigned_this
= 0;
14245 else if (DECL_MAIN_P (fndecl
))
14247 /* Make it so that `main' always returns 0 by default. */
14249 c_expand_return (integer_one_node
);
14251 c_expand_return (integer_zero_node
);
14254 else if (return_label
!= NULL_RTX
14255 && current_function_return_value
== NULL_TREE
14256 && ! DECL_NAME (DECL_RESULT (current_function_decl
)))
14257 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
14259 if (flag_exceptions
)
14260 expand_exception_blocks ();
14262 /* If this function is supposed to return a value, ensure that
14263 we do not fall into the cleanups by mistake. The end of our
14264 function will look like this:
14266 user code (may have return stmt somewhere)
14267 goto no_return_label
14272 NOTE_INSN_FUNCTION_END
14276 If the user omits a return stmt in the USER CODE section, we
14277 will have a control path which reaches NOTE_INSN_FUNCTION_END.
14278 Otherwise, we won't. */
14279 if (no_return_label
)
14281 DECL_CONTEXT (no_return_label
) = fndecl
;
14282 DECL_INITIAL (no_return_label
) = error_mark_node
;
14283 DECL_SOURCE_FILE (no_return_label
) = input_filename
;
14284 DECL_SOURCE_LINE (no_return_label
) = lineno
;
14285 expand_goto (no_return_label
);
14290 /* Remove the binding contour which is used
14291 to catch cleanup-generated temporaries. */
14292 expand_end_bindings (0, 0, 0);
14293 poplevel (0, 0, 0);
14295 /* Emit label at beginning of cleanup code for parameters. */
14296 emit_label (cleanup_label
);
14299 /* Get return value into register if that's where it's supposed to be. */
14300 if (original_result_rtx
)
14301 fixup_result_decl (DECL_RESULT (fndecl
), original_result_rtx
);
14303 /* Finish building code that will trigger warnings if users forget
14304 to make their functions return values. */
14305 if (no_return_label
|| cleanup_label
)
14306 emit_jump (return_label
);
14307 if (no_return_label
)
14309 /* We don't need to call `expand_*_return' here because we
14310 don't need any cleanups here--this path of code is only
14311 for error checking purposes. */
14312 expand_label (no_return_label
);
14315 /* Generate rtl for function exit. */
14316 expand_function_end (input_filename
, lineno
, 1);
14319 /* If we're processing a template, squirrel away the definition
14320 until we do an instantiation. */
14321 if (processing_template_decl
)
14323 --minimal_parse_mode
;
14324 DECL_SAVED_TREE (fndecl
) = TREE_CHAIN (DECL_SAVED_TREE (fndecl
));
14325 /* We have to save this value here in case
14326 maybe_end_member_template_processing decides to pop all the
14327 template parameters. */
14333 /* This must come after expand_function_end because cleanups might
14334 have declarations (from inline functions) that need to go into
14335 this function's blocks. */
14336 if (current_binding_level
->parm_flag
!= 1)
14337 my_friendly_abort (122);
14338 poplevel (1, 0, 1);
14340 /* If this is a in-class inline definition, we may have to pop the
14341 bindings for the template parameters that we added in
14342 maybe_begin_member_template_processing when start_function was
14344 if (inclass_inline
)
14345 maybe_end_member_template_processing ();
14347 /* Reset scope for C++: if we were in the scope of a class,
14348 then when we finish this function, we are not longer so.
14349 This cannot be done until we know for sure that no more
14350 class members will ever be referenced in this function
14351 (i.e., calls to destructors). */
14352 if (current_class_name
)
14354 ctype
= current_class_type
;
14355 pop_nested_class ();
14358 /* Must mark the RESULT_DECL as being in this function. */
14359 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
14361 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
14362 to the FUNCTION_DECL node itself. */
14363 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
14367 int saved_flag_keep_inline_functions
=
14368 flag_keep_inline_functions
;
14370 /* So we can tell if jump_optimize sets it to 1. */
14373 if (DECL_CONTEXT (fndecl
) != NULL_TREE
14374 && hack_decl_function_context (fndecl
))
14375 /* Trick rest_of_compilation into not deferring output of this
14376 function, even if it is inline, since the rtl_obstack for
14377 this function is the function_obstack of the enclosing
14378 function and will be deallocated when the enclosing
14379 function is gone. See save_tree_status. */
14380 flag_keep_inline_functions
= 1;
14382 /* Run the optimizers and output the assembler code for this
14385 if (DECL_ARTIFICIAL (fndecl
))
14387 /* Do we really *want* to inline this synthesized method? */
14389 int save_fif
= flag_inline_functions
;
14390 flag_inline_functions
= 1;
14392 /* Turn off DECL_INLINE for the moment so function_cannot_inline_p
14393 will check our size. */
14394 DECL_INLINE (fndecl
) = 0;
14396 rest_of_compilation (fndecl
);
14397 flag_inline_functions
= save_fif
;
14400 rest_of_compilation (fndecl
);
14402 flag_keep_inline_functions
= saved_flag_keep_inline_functions
;
14404 if (DECL_SAVED_INSNS (fndecl
) && ! TREE_ASM_WRITTEN (fndecl
))
14406 /* Set DECL_EXTERNAL so that assemble_external will be called as
14407 necessary. We'll clear it again in finish_file. */
14408 if (! DECL_EXTERNAL (fndecl
))
14409 DECL_NOT_REALLY_EXTERN (fndecl
) = 1;
14410 DECL_EXTERNAL (fndecl
) = 1;
14411 mark_inline_for_output (fndecl
);
14414 if (ctype
&& TREE_ASM_WRITTEN (fndecl
))
14415 note_debug_info_needed (ctype
);
14417 current_function_returns_null
|= can_reach_end
;
14419 /* Since we don't normally go through c_expand_return for constructors,
14420 this normally gets the wrong value.
14421 Also, named return values have their return codes emitted after
14422 NOTE_INSN_FUNCTION_END, confusing jump.c. */
14423 if (DECL_CONSTRUCTOR_P (fndecl
)
14424 || DECL_NAME (DECL_RESULT (fndecl
)) != NULL_TREE
)
14425 current_function_returns_null
= 0;
14427 if (TREE_THIS_VOLATILE (fndecl
) && current_function_returns_null
)
14428 cp_warning ("`noreturn' function `%D' does return", fndecl
);
14429 else if ((warn_return_type
|| pedantic
)
14430 && current_function_returns_null
14431 && TREE_CODE (TREE_TYPE (fntype
)) != VOID_TYPE
)
14433 /* If this function returns non-void and control can drop through,
14435 cp_warning ("control reaches end of non-void function `%D'", fndecl
);
14437 /* With just -W, complain only if function returns both with
14438 and without a value. */
14439 else if (extra_warnings
14440 && current_function_returns_value
&& current_function_returns_null
)
14441 warning ("this function may return with or without a value");
14446 /* Free all the tree nodes making up this function. */
14447 /* Switch back to allocating nodes permanently
14448 until we start another function. */
14450 permanent_allocation (1);
14452 if (DECL_SAVED_INSNS (fndecl
) == NULL_RTX
)
14456 /* Stop pointing to the local nodes about to be freed. */
14457 /* But DECL_INITIAL must remain nonzero so we know this
14458 was an actual function definition. */
14459 DECL_INITIAL (fndecl
) = error_mark_node
;
14460 for (t
= DECL_ARGUMENTS (fndecl
); t
; t
= TREE_CHAIN (t
))
14461 DECL_RTL (t
) = DECL_INCOMING_RTL (t
) = NULL_RTX
;
14464 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
14465 static_ctors
= perm_tree_cons (NULL_TREE
, fndecl
, static_ctors
);
14466 if (DECL_STATIC_DESTRUCTOR (fndecl
))
14467 static_dtors
= perm_tree_cons (NULL_TREE
, fndecl
, static_dtors
);
14471 /* Let the error reporting routines know that we're outside a
14472 function. For a nested function, this value is used in
14473 pop_cp_function_context and then reset via pop_function_context. */
14474 current_function_decl
= NULL_TREE
;
14477 named_label_uses
= NULL
;
14478 current_class_ptr
= NULL_TREE
;
14479 current_class_ref
= NULL_TREE
;
14482 /* Create the FUNCTION_DECL for a function definition.
14483 DECLSPECS and DECLARATOR are the parts of the declaration;
14484 they describe the return type and the name of the function,
14485 but twisted together in a fashion that parallels the syntax of C.
14487 This function creates a binding context for the function body
14488 as well as setting up the FUNCTION_DECL in current_function_decl.
14490 Returns a FUNCTION_DECL on success.
14492 If the DECLARATOR is not suitable for a function (it defines a datum
14493 instead), we return 0, which tells yyparse to report a parse error.
14495 May return void_type_node indicating that this method is actually
14496 a friend. See grokfield for more details.
14498 Came here with a `.pushlevel' .
14500 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14501 CHANGES TO CODE IN `grokfield'. */
14504 start_method (declspecs
, declarator
, attrlist
)
14505 tree declarator
, declspecs
, attrlist
;
14507 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
14510 /* Something too ugly to handle. */
14511 if (fndecl
== NULL_TREE
)
14514 /* Pass friends other than inline friend functions back. */
14515 if (fndecl
== void_type_node
)
14518 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
14519 /* Not a function, tell parser to report parse error. */
14522 if (IS_SIGNATURE (current_class_type
))
14523 IS_DEFAULT_IMPLEMENTATION (fndecl
) = 1;
14525 if (DECL_IN_AGGR_P (fndecl
))
14527 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
14529 if (DECL_CONTEXT (fndecl
)
14530 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
14531 cp_error ("`%D' is already defined in class %s", fndecl
,
14532 TYPE_NAME_STRING (DECL_CONTEXT (fndecl
)));
14534 return void_type_node
;
14537 check_template_shadow (fndecl
);
14539 DECL_THIS_INLINE (fndecl
) = 1;
14541 if (flag_default_inline
)
14542 DECL_INLINE (fndecl
) = 1;
14544 /* We process method specializations in finish_struct_1. */
14545 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
14546 fndecl
= push_template_decl (fndecl
);
14548 /* We read in the parameters on the maybepermanent_obstack,
14549 but we won't be getting back to them until after we
14550 may have clobbered them. So the call to preserve_data
14551 will keep them safe. */
14554 if (! DECL_FRIEND_P (fndecl
))
14556 if (TREE_CHAIN (fndecl
))
14558 fndecl
= copy_node (fndecl
);
14559 TREE_CHAIN (fndecl
) = NULL_TREE
;
14562 if (DECL_CONSTRUCTOR_P (fndecl
))
14564 if (! grok_ctor_properties (current_class_type
, fndecl
))
14565 return void_type_node
;
14567 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
14568 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
14571 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0, 0);
14573 /* Make a place for the parms */
14575 current_binding_level
->parm_flag
= 1;
14577 DECL_IN_AGGR_P (fndecl
) = 1;
14581 /* Go through the motions of finishing a function definition.
14582 We don't compile this method until after the whole class has
14585 FINISH_METHOD must return something that looks as though it
14586 came from GROKFIELD (since we are defining a method, after all).
14588 This is called after parsing the body of the function definition.
14589 STMTS is the chain of statements that makes up the function body.
14591 DECL is the ..._DECL that `start_method' provided. */
14594 finish_method (decl
)
14597 register tree fndecl
= decl
;
14600 register tree link
;
14602 if (decl
== void_type_node
)
14605 old_initial
= DECL_INITIAL (fndecl
);
14607 /* Undo the level for the parms (from start_method).
14608 This is like poplevel, but it causes nothing to be
14609 saved. Saving information here confuses symbol-table
14610 output routines. Besides, this information will
14611 be correctly output when this method is actually
14614 /* Clear out the meanings of the local variables of this level;
14615 also record in each decl which block it belongs to. */
14617 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
14619 if (DECL_NAME (link
) != NULL_TREE
)
14620 pop_binding (DECL_NAME (link
), link
);
14621 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
14622 DECL_CONTEXT (link
) = NULL_TREE
;
14625 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
14626 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
14627 current_binding_level
->parm_flag
,
14628 current_binding_level
->keep
);
14630 poplevel (0, 0, 0);
14632 DECL_INITIAL (fndecl
) = old_initial
;
14634 /* We used to check if the context of FNDECL was different from
14635 current_class_type as another way to get inside here. This didn't work
14636 for String.cc in libg++. */
14637 if (DECL_FRIEND_P (fndecl
))
14639 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
14640 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
14641 decl
= void_type_node
;
14647 /* Called when a new struct TYPE is defined.
14648 If this structure or union completes the type of any previous
14649 variable declaration, lay it out and output its rtl. */
14652 hack_incomplete_structures (type
)
14657 if (current_binding_level
->incomplete
== NULL_TREE
)
14660 if (!type
) /* Don't do this for class templates. */
14663 for (list
= ¤t_binding_level
->incomplete
; *list
; )
14665 tree decl
= TREE_VALUE (*list
);
14666 if ((decl
&& TREE_TYPE (decl
) == type
)
14667 || (TREE_TYPE (decl
)
14668 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14669 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
14671 int toplevel
= toplevel_bindings_p ();
14672 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14673 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
14674 layout_type (TREE_TYPE (decl
));
14675 layout_decl (decl
, 0);
14676 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
14680 expand_decl (decl
);
14681 cleanup
= maybe_build_cleanup (decl
);
14682 expand_decl_init (decl
);
14683 if (! expand_decl_cleanup (decl
, cleanup
))
14684 cp_error ("parser lost in parsing declaration of `%D'",
14687 *list
= TREE_CHAIN (*list
);
14690 list
= &TREE_CHAIN (*list
);
14694 /* If DECL is of a type which needs a cleanup, build that cleanup here.
14695 See build_delete for information about AUTO_DELETE.
14697 Don't build these on the momentary obstack; they must live
14698 the life of the binding contour. */
14701 maybe_build_cleanup_1 (decl
, auto_delete
)
14702 tree decl
, auto_delete
;
14704 tree type
= TREE_TYPE (decl
);
14705 if (type
!= error_mark_node
&& TYPE_NEEDS_DESTRUCTOR (type
))
14707 int temp
= 0, flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14710 if (TREE_CODE (decl
) != PARM_DECL
)
14711 temp
= suspend_momentary ();
14713 if (TREE_CODE (type
) == ARRAY_TYPE
)
14717 mark_addressable (decl
);
14718 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14721 /* Optimize for space over speed here. */
14722 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14723 || flag_expensive_optimizations
)
14724 flags
|= LOOKUP_NONVIRTUAL
;
14726 rval
= build_delete (TREE_TYPE (rval
), rval
, auto_delete
, flags
, 0);
14728 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14729 && ! TYPE_HAS_DESTRUCTOR (type
))
14730 rval
= build_compound_expr (expr_tree_cons (NULL_TREE
, rval
,
14731 build_expr_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14733 if (TREE_CODE (decl
) != PARM_DECL
)
14734 resume_momentary (temp
);
14741 /* If DECL is of a type which needs a cleanup, build that cleanup
14742 here. The cleanup does free the storage with a call to delete. */
14745 maybe_build_cleanup_and_delete (decl
)
14748 return maybe_build_cleanup_1 (decl
, integer_three_node
);
14751 /* If DECL is of a type which needs a cleanup, build that cleanup
14752 here. The cleanup does not free the storage with a call a delete. */
14755 maybe_build_cleanup (decl
)
14758 return maybe_build_cleanup_1 (decl
, integer_two_node
);
14761 /* Expand a C++ expression at the statement level.
14762 This is needed to ferret out nodes which have UNKNOWN_TYPE.
14763 The C++ type checker should get all of these out when
14764 expressions are combined with other, type-providing, expressions,
14765 leaving only orphan expressions, such as:
14767 &class::bar; / / takes its address, but does nothing with it. */
14770 cplus_expand_expr_stmt (exp
)
14773 if (processing_template_decl
)
14775 add_tree (build_min_nt (EXPR_STMT
, exp
));
14779 /* Arrange for all temps to disappear. */
14780 expand_start_target_temps ();
14782 exp
= require_complete_type_in_void (exp
);
14784 if (TREE_CODE (exp
) == FUNCTION_DECL
)
14786 cp_warning ("reference, not call, to function `%D'", exp
);
14787 warning ("at this point in file");
14791 /* We should do this eventually, but right now this causes regex.o from
14792 libg++ to miscompile, and tString to core dump. */
14793 exp
= build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (exp
), exp
);
14796 /* Strip unused implicit INDIRECT_REFs of references. */
14797 if (TREE_CODE (exp
) == INDIRECT_REF
14798 && TREE_CODE (TREE_TYPE (TREE_OPERAND (exp
, 0))) == REFERENCE_TYPE
)
14799 exp
= TREE_OPERAND (exp
, 0);
14801 /* If we don't do this, we end up down inside expand_expr
14802 trying to do TYPE_MODE on the ERROR_MARK, and really
14803 go outside the bounds of the type. */
14804 if (exp
!= error_mark_node
)
14805 expand_expr_stmt (break_out_cleanups (exp
));
14807 /* Clean up any pending cleanups. This happens when a function call
14808 returns a cleanup-needing value that nobody uses. */
14809 expand_end_target_temps ();
14812 /* When a stmt has been parsed, this function is called.
14814 Currently, this function only does something within a
14815 constructor's scope: if a stmt has just assigned to this,
14816 and we are in a derived class, we call `emit_base_init'. */
14821 extern struct nesting
*cond_stack
, *loop_stack
, *case_stack
;
14824 if (current_function_assigns_this
14825 || ! current_function_just_assigned_this
)
14827 if (DECL_CONSTRUCTOR_P (current_function_decl
))
14829 /* Constructors must wait until we are out of control
14830 zones before calling base constructors. */
14831 if (cond_stack
|| loop_stack
|| case_stack
)
14833 expand_expr_stmt (base_init_expr
);
14834 check_base_init (current_class_type
);
14836 current_function_assigns_this
= 1;
14839 /* Change a static member function definition into a FUNCTION_TYPE, instead
14840 of the METHOD_TYPE that we create when it's originally parsed.
14842 WARNING: DO NOT pass &TREE_TYPE (decl) to FN or &TYPE_ARG_TYPES
14843 (TREE_TYPE (decl)) to ARGTYPES, as doing so will corrupt the types of
14844 other decls. Either pass the addresses of local variables or NULL. */
14847 revert_static_member_fn (decl
, fn
, argtypes
)
14848 tree
*decl
, *fn
, *argtypes
;
14851 tree function
= fn
? *fn
: TREE_TYPE (*decl
);
14852 tree args
= argtypes
? *argtypes
: TYPE_ARG_TYPES (function
);
14854 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14855 != TYPE_UNQUALIFIED
)
14856 cp_error ("static member function `%#D' declared with type qualifiers",
14859 args
= TREE_CHAIN (args
);
14860 tmp
= build_function_type (TREE_TYPE (function
), args
);
14861 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14862 tmp
= build_exception_variant (tmp
,
14863 TYPE_RAISES_EXCEPTIONS (function
));
14864 TREE_TYPE (*decl
) = tmp
;
14865 if (DECL_ARGUMENTS (*decl
))
14866 DECL_ARGUMENTS (*decl
) = TREE_CHAIN (DECL_ARGUMENTS (*decl
));
14867 DECL_STATIC_FUNCTION_P (*decl
) = 1;
14879 int just_assigned_this
;
14881 int temp_name_counter
;
14883 struct named_label_list
*named_label_uses
;
14884 tree shadowed_labels
;
14887 rtx last_dtor_insn
;
14888 rtx last_parm_cleanup_insn
;
14889 tree base_init_list
;
14890 tree member_init_list
;
14891 tree base_init_expr
;
14892 tree current_class_ptr
;
14893 tree current_class_ref
;
14895 struct cp_function
*next
;
14896 struct binding_level
*binding_level
;
14897 int static_labelno
;
14900 static struct cp_function
*cp_function_chain
;
14902 extern int temp_name_counter
;
14904 /* Save and reinitialize the variables
14905 used during compilation of a C++ function. */
14908 push_cp_function_context (context
)
14911 struct cp_function
*p
14912 = (struct cp_function
*) xmalloc (sizeof (struct cp_function
));
14914 push_function_context_to (context
);
14916 p
->next
= cp_function_chain
;
14917 cp_function_chain
= p
;
14919 p
->named_labels
= named_labels
;
14920 p
->named_label_uses
= named_label_uses
;
14921 p
->shadowed_labels
= shadowed_labels
;
14922 p
->returns_value
= current_function_returns_value
;
14923 p
->returns_null
= current_function_returns_null
;
14924 p
->binding_level
= current_binding_level
;
14925 p
->ctor_label
= ctor_label
;
14926 p
->dtor_label
= dtor_label
;
14927 p
->last_dtor_insn
= last_dtor_insn
;
14928 p
->last_parm_cleanup_insn
= last_parm_cleanup_insn
;
14929 p
->assigns_this
= current_function_assigns_this
;
14930 p
->just_assigned_this
= current_function_just_assigned_this
;
14931 p
->parms_stored
= current_function_parms_stored
;
14932 p
->result_rtx
= original_result_rtx
;
14933 p
->base_init_expr
= base_init_expr
;
14934 p
->temp_name_counter
= temp_name_counter
;
14935 p
->base_init_list
= current_base_init_list
;
14936 p
->member_init_list
= current_member_init_list
;
14937 p
->current_class_ptr
= current_class_ptr
;
14938 p
->current_class_ref
= current_class_ref
;
14939 p
->static_labelno
= static_labelno
;
14942 /* Restore the variables used during compilation of a C++ function. */
14945 pop_cp_function_context (context
)
14948 struct cp_function
*p
= cp_function_chain
;
14951 /* Bring back all the labels that were shadowed. */
14952 for (link
= shadowed_labels
; link
; link
= TREE_CHAIN (link
))
14953 if (DECL_NAME (TREE_VALUE (link
)) != 0)
14954 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (TREE_VALUE (link
)),
14955 TREE_VALUE (link
));
14957 pop_function_context_from (context
);
14959 cp_function_chain
= p
->next
;
14961 named_labels
= p
->named_labels
;
14962 named_label_uses
= p
->named_label_uses
;
14963 shadowed_labels
= p
->shadowed_labels
;
14964 current_function_returns_value
= p
->returns_value
;
14965 current_function_returns_null
= p
->returns_null
;
14966 current_binding_level
= p
->binding_level
;
14967 ctor_label
= p
->ctor_label
;
14968 dtor_label
= p
->dtor_label
;
14969 last_dtor_insn
= p
->last_dtor_insn
;
14970 last_parm_cleanup_insn
= p
->last_parm_cleanup_insn
;
14971 current_function_assigns_this
= p
->assigns_this
;
14972 current_function_just_assigned_this
= p
->just_assigned_this
;
14973 current_function_parms_stored
= p
->parms_stored
;
14974 original_result_rtx
= p
->result_rtx
;
14975 base_init_expr
= p
->base_init_expr
;
14976 temp_name_counter
= p
->temp_name_counter
;
14977 current_base_init_list
= p
->base_init_list
;
14978 current_member_init_list
= p
->member_init_list
;
14979 current_class_ptr
= p
->current_class_ptr
;
14980 current_class_ref
= p
->current_class_ref
;
14981 static_labelno
= p
->static_labelno
;
14989 return function_depth
!= 0;