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. */
48 #define obstack_chunk_alloc xmalloc
49 #define obstack_chunk_free free
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 int (*valid_lang_attribute
) PROTO ((tree
, tree
, tree
, tree
));
65 /* Obstack used for remembering local class declarations (like
66 enums and static (const) members. */
68 struct obstack decl_obstack
;
69 static struct stack_level
*decl_stack
;
71 #ifndef CHAR_TYPE_SIZE
72 #define CHAR_TYPE_SIZE BITS_PER_UNIT
75 #ifndef SHORT_TYPE_SIZE
76 #define SHORT_TYPE_SIZE (BITS_PER_UNIT * MIN ((UNITS_PER_WORD + 1) / 2, 2))
80 #define INT_TYPE_SIZE BITS_PER_WORD
83 #ifndef LONG_TYPE_SIZE
84 #define LONG_TYPE_SIZE BITS_PER_WORD
87 #ifndef LONG_LONG_TYPE_SIZE
88 #define LONG_LONG_TYPE_SIZE (BITS_PER_WORD * 2)
91 #ifndef WCHAR_UNSIGNED
92 #define WCHAR_UNSIGNED 0
95 #ifndef FLOAT_TYPE_SIZE
96 #define FLOAT_TYPE_SIZE BITS_PER_WORD
99 #ifndef DOUBLE_TYPE_SIZE
100 #define DOUBLE_TYPE_SIZE (BITS_PER_WORD * 2)
103 #ifndef LONG_DOUBLE_TYPE_SIZE
104 #define LONG_DOUBLE_TYPE_SIZE (BITS_PER_WORD * 2)
107 #ifndef BOOL_TYPE_SIZE
108 #ifdef SLOW_BYTE_ACCESS
109 #define BOOL_TYPE_SIZE ((SLOW_BYTE_ACCESS) ? (POINTER_SIZE) : (CHAR_TYPE_SIZE))
111 #define BOOL_TYPE_SIZE CHAR_TYPE_SIZE
115 /* We let tm.h override the types used here, to handle trivial differences
116 such as the choice of unsigned int or long unsigned int for size_t.
117 When machines start needing nontrivial differences in the size type,
118 it would be best to do something here to figure out automatically
119 from other information what type to use. */
122 #define SIZE_TYPE "long unsigned int"
126 #define PTRDIFF_TYPE "long int"
130 #define WCHAR_TYPE "int"
133 static tree grokparms
PROTO((tree
, int));
134 static const char *redeclaration_error_message
PROTO((tree
, tree
));
136 static struct stack_level
*push_decl_level
PROTO((struct stack_level
*,
138 static void push_binding_level
PROTO((struct binding_level
*, int,
140 static void pop_binding_level
PROTO((void));
141 static void suspend_binding_level
PROTO((void));
142 static void resume_binding_level
PROTO((struct binding_level
*));
143 static struct binding_level
*make_binding_level
PROTO((void));
144 static void declare_namespace_level
PROTO((void));
145 static void signal_catch
PROTO((int)) ATTRIBUTE_NORETURN
;
146 static void storedecls
PROTO((tree
));
147 static void require_complete_types_for_parms
PROTO((tree
));
148 static void push_overloaded_decl_1
PROTO((tree
));
149 static int ambi_op_p
PROTO((tree
));
150 static int unary_op_p
PROTO((tree
));
151 static tree store_bindings
PROTO((tree
, tree
));
152 static tree lookup_tag_reverse
PROTO((tree
, tree
));
153 static tree obscure_complex_init
PROTO((tree
, tree
));
154 static tree maybe_build_cleanup_1
PROTO((tree
, tree
));
155 static tree lookup_name_real
PROTO((tree
, int, int, int));
156 static void warn_extern_redeclared_static
PROTO((tree
, tree
));
157 static void grok_reference_init
PROTO((tree
, tree
, tree
));
158 static tree grokfndecl
PROTO((tree
, tree
, tree
, tree
, int,
159 enum overload_flags
, tree
,
160 tree
, int, int, int, int, int, int, tree
));
161 static tree grokvardecl
PROTO((tree
, tree
, RID_BIT_TYPE
*, int, int, tree
));
162 static tree lookup_tag
PROTO((enum tree_code
, tree
,
163 struct binding_level
*, int));
164 static void set_identifier_type_value_with_scope
165 PROTO((tree
, tree
, struct binding_level
*));
166 static void record_builtin_type
PROTO((enum rid
, const char *, tree
));
167 static void record_unknown_type
PROTO((tree
, const char *));
168 static int member_function_or_else
PROTO((tree
, tree
, const char *));
169 static void bad_specifiers
PROTO((tree
, const char *, int, int, int, int,
171 static void lang_print_error_function
PROTO((const char *));
172 static tree maybe_process_template_type_declaration
PROTO((tree
, int, struct binding_level
*));
173 static void check_for_uninitialized_const_var
PROTO((tree
));
174 static unsigned long typename_hash
PROTO((hash_table_key
));
175 static boolean typename_compare
PROTO((hash_table_key
, hash_table_key
));
176 static void push_binding
PROTO((tree
, tree
, struct binding_level
*));
177 static int add_binding
PROTO((tree
, tree
));
178 static void pop_binding
PROTO((tree
, tree
));
179 static tree local_variable_p
PROTO((tree
));
180 static tree find_binding
PROTO((tree
, tree
));
181 static tree select_decl
PROTO((tree
, int));
182 static int lookup_flags
PROTO((int, int));
183 static tree qualify_lookup
PROTO((tree
, int));
184 static tree record_builtin_java_type
PROTO((const char *, int));
185 static const char *tag_name
PROTO((enum tag_types code
));
186 static void find_class_binding_level
PROTO((void));
187 static struct binding_level
*innermost_nonclass_level
PROTO((void));
188 static tree poplevel_class
PROTO((void));
189 static void warn_about_implicit_typename_lookup
PROTO((tree
, tree
));
190 static int walk_namespaces_r
PROTO((tree
, walk_namespaces_fn
, void *));
191 static int walk_globals_r
PROTO((tree
, void *));
192 static void add_decl_to_level
PROTO((tree
, struct binding_level
*));
193 static tree make_label_decl
PROTO((tree
, int));
194 static void pop_label
PROTO((tree
));
195 static void pop_labels
PROTO((tree
));
197 #if defined (DEBUG_CP_BINDING_LEVELS)
198 static void indent
PROTO((void));
201 /* A node which has tree code ERROR_MARK, and whose type is itself.
202 All erroneous expressions are replaced with this node. All functions
203 that accept nodes as arguments should avoid generating error messages
204 if this node is one of the arguments, since it is undesirable to get
205 multiple error messages from one error in the input. */
207 tree error_mark_node
;
209 /* Erroneous argument lists can use this *IFF* they do not modify it. */
210 tree error_mark_list
;
212 /* The following symbols are subsumed in the cp_global_trees array, and
213 listed here individually for documentation purposes.
216 tree wchar_decl_node;
219 tree vtable_entry_type;
220 tree delta_type_node;
223 tree __baselist_desc_type_node;
224 tree __i_desc_type_node, __m_desc_type_node;
225 tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type;
227 tree __t_desc_type_node;
229 tree __tp_desc_type_node;
231 tree __access_mode_type_node;
232 tree __bltn_desc_type_node, __user_desc_type_node, __class_desc_type_node;
233 tree __ptr_desc_type_node, __attr_desc_type_node, __func_desc_type_node;
234 tree __ptmf_desc_type_node, __ptmd_desc_type_node;
236 Not needed yet? May be needed one day?
237 tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type;
238 tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type;
239 tree __ptmf_desc_array_type, __ptmd_desc_array_type;
242 tree class_star_type_node;
243 tree class_type_node, record_type_node, union_type_node, enum_type_node;
244 tree unknown_type_node;
246 Array type `vtable_entry_type[]'
249 tree vtbl_ptr_type_node;
255 A FUNCTION_DECL which can call `abort'. Not necessarily the
256 one that the user will declare, but sufficient to be called
257 by routines that want to abort the program.
261 The FUNCTION_DECL for the default `::operator delete'.
263 tree global_delete_fndecl;
266 tree type_info_type_node, tinfo_fn_id, tinfo_fn_type;
270 tree cp_global_trees
[CPTI_MAX
];
272 /* These can't be part of the above array, since they are declared
273 individually in tree.h, and used by the debug output routines. */
277 tree integer_type_node
;
278 tree unsigned_type_node
;
280 /* These can't be part of the above array, since they are declared
281 individially in tree.h and used by the target routines. */
284 tree va_list_type_node
;
286 /* Indicates that there is a type value in some namespace, although
287 that is not necessarily in scope at the moment. */
289 static tree global_type_node
;
294 /* Expect only namespace names now. */
295 static int only_namespace_names
;
297 /* In a destructor, the point at which all derived class destroying
298 has been done, just before any base class destroying will be done. */
302 /* In a destructor, the last insn emitted after the start of the
303 function and the parms. */
305 static rtx last_dtor_insn
;
307 /* In a constructor, the last insn emitted after the start of the
308 function and the parms, the exception specification and any
309 function-try-block. The constructor initializers are emitted after
312 static rtx last_parm_cleanup_insn
;
314 /* In a constructor, the point at which we are ready to return
315 the pointer to the initialized object. */
319 /* If original DECL_RESULT of current function was a register,
320 but due to being an addressable named return value, would up
321 on the stack, this variable holds the named return value's
322 original location. */
323 static rtx original_result_rtx
;
325 /* Sequence of insns which represents base initialization. */
328 /* C++: Keep these around to reduce calls to `get_identifier'.
329 Identifiers for `this' in member functions and the auto-delete
330 parameter for destructors. */
331 tree this_identifier
, in_charge_identifier
;
332 tree ctor_identifier
, dtor_identifier
;
333 /* Used in pointer to member functions, in vtables, and in sigtables. */
334 tree pfn_identifier
, index_identifier
, delta_identifier
, delta2_identifier
;
335 tree pfn_or_delta2_identifier
, tag_identifier
;
336 tree vt_off_identifier
;
338 /* Exception specifier used for throw(). */
339 tree empty_except_spec
;
341 /* Nonzero if we're in a handler for a function-try-block. */
342 int in_function_try_handler
;
344 struct named_label_list
346 struct binding_level
*binding_level
;
349 const char *filename_o_goto
;
351 struct named_label_list
*next
;
354 /* A list (chain of TREE_LIST nodes) of named label uses.
355 The TREE_PURPOSE field is the list of variables defined
356 in the label's scope defined at the point of use.
357 The TREE_VALUE field is the LABEL_DECL used.
358 The TREE_TYPE field holds `current_binding_level' at the
359 point of the label's use.
361 BWAHAHAAHAHahhahahahaah. No, no, no, said the little chicken.
363 Look at the pretty struct named_label_list. See the pretty struct
364 with the pretty named fields that describe what they do. See the
365 pretty lack of gratuitous casts. Notice the code got a lot cleaner.
367 Used only for jumps to as-yet undefined labels, since
368 jumps to defined labels can have their validity checked
371 static struct named_label_list
*named_label_uses
= NULL
;
373 /* A list of objects which have constructors or destructors
374 which reside in the global scope. The decl is stored in
375 the TREE_VALUE slot and the initializer is stored
376 in the TREE_PURPOSE slot. */
377 tree static_aggregates
;
381 /* Two expressions that are constants with value zero.
382 The first is of type `int', the second of type `void *'. */
384 tree integer_zero_node
;
385 tree null_pointer_node
;
387 /* The value for __null (NULL), namely, a zero of an integer type with
388 the same number of bits as a pointer. */
391 /* A node for the integer constants 1, 2, and 3. */
393 tree integer_one_node
, integer_two_node
, integer_three_node
;
395 /* While defining an enum type, this is 1 plus the last enumerator
398 static tree enum_next_value
;
400 /* Nonzero means that there was overflow computing enum_next_value. */
402 static int enum_overflow
;
404 /* Parsing a function declarator leaves a list of parameter names
405 or a chain or parameter decls here. */
407 tree last_function_parms
;
409 /* Parsing a function declarator leaves here a chain of structure
410 and enum types declared in the parmlist. */
412 static tree last_function_parm_tags
;
414 /* After parsing the declarator that starts a function definition,
415 `start_function' puts here the list of parameter names or chain of decls.
416 `store_parm_decls' finds it here. */
418 static tree current_function_parms
;
420 /* Similar, for last_function_parm_tags. */
421 static tree current_function_parm_tags
;
423 /* A list (chain of TREE_LIST nodes) of all LABEL_DECLs in the function
424 that have names. Here so we can clear out their names' definitions
425 at the end of the function. The TREE_VALUE is a LABEL_DECL; the
426 TREE_PURPOSE is the previous binding of the label. */
428 static tree named_labels
;
430 /* The FUNCTION_DECL for the function currently being compiled,
431 or 0 if between functions. */
432 tree current_function_decl
;
434 /* Set to 0 at beginning of a function definition, set to 1 if
435 a return statement that specifies a return value is seen. */
437 int current_function_returns_value
;
439 /* Set to 0 at beginning of a function definition, set to 1 if
440 a return statement with no argument is seen. */
442 int current_function_returns_null
;
444 /* Set to 0 at beginning of a function definition, and whenever
445 a label (case or named) is defined. Set to value of expression
446 returned from function when that value can be transformed into
447 a named return value. */
449 tree current_function_return_value
;
451 /* Nonzero means give `double' the same size as `float'. */
453 extern int flag_short_double
;
455 /* Nonzero means don't recognize any builtin functions. */
457 extern int flag_no_builtin
;
459 /* Nonzero means don't recognize the non-ANSI builtin functions.
462 extern int flag_no_nonansi_builtin
;
464 /* Nonzero means enable obscure ANSI features and disable GNU extensions
465 that might cause ANSI-compliant code to be miscompiled. */
467 extern int flag_ansi
;
469 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
471 extern int flag_huge_objects
;
473 /* Nonzero if we want to conserve space in the .o files. We do this
474 by putting uninitialized data and runtime initialized data into
475 .common instead of .data at the expense of not flagging multiple
477 extern int flag_conserve_space
;
479 /* Pointers to the base and current top of the language name stack. */
481 extern tree
*current_lang_base
, *current_lang_stack
;
483 /* C and C++ flags are in decl2.c. */
485 /* Set to 0 at beginning of a constructor, set to 1
486 if that function does an allocation before referencing its
487 instance variable. */
488 static int current_function_assigns_this
;
489 int current_function_just_assigned_this
;
491 /* Set to 0 at beginning of a function. Set non-zero when
492 store_parm_decls is called. Don't call store_parm_decls
493 if this flag is non-zero! */
494 int current_function_parms_stored
;
496 /* Flag used when debugging spew.c */
498 extern int spew_debug
;
500 /* This is a copy of the class_shadowed list of the previous class binding
501 contour when at global scope. It's used to reset IDENTIFIER_CLASS_VALUEs
502 when entering another class scope (i.e. a cache miss). */
503 extern tree previous_class_values
;
505 /* A expression of value 0 with the same precision as a sizetype
507 tree signed_size_zero_node
;
509 /* The name of the anonymous namespace, throughout this translation
511 tree anonymous_namespace_name
;
514 /* Allocate a level of searching. */
518 push_decl_level (stack
, obstack
)
519 struct stack_level
*stack
;
520 struct obstack
*obstack
;
522 struct stack_level tem
;
525 return push_stack_level (obstack
, (char *)&tem
, sizeof (tem
));
528 /* For each binding contour we allocate a binding_level structure
529 which records the names defined in that contour.
532 1) one for each function definition,
533 where internal declarations of the parameters appear.
534 2) one for each compound statement,
535 to record its declarations.
537 The current meaning of a name can be found by searching the levels
538 from the current one out to the global one.
540 Off to the side, may be the class_binding_level. This exists only
541 to catch class-local declarations. It is otherwise nonexistent.
543 Also there may be binding levels that catch cleanups that must be
544 run when exceptions occur. Thus, to see whether a name is bound in
545 the current scope, it is not enough to look in the
546 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
549 /* Note that the information in the `names' component of the global contour
550 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
554 /* A chain of _DECL nodes for all variables, constants, functions,
555 and typedef types. These are in the reverse of the order
556 supplied. There may be OVERLOADs on this list, too, but they
557 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
560 /* A list of structure, union and enum definitions, for looking up
562 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
563 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
564 or ENUMERAL_TYPE node.
566 C++: the TREE_VALUE nodes can be simple types for
567 component_bindings. */
570 /* A list of USING_DECL nodes. */
573 /* A list of used namespaces. PURPOSE is the namespace,
574 VALUE the common ancestor with this binding_level's namespace. */
575 tree using_directives
;
577 /* If this binding level is the binding level for a class, then
578 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
579 is the name of an entity bound in the class; the TREE_VALUE is
580 the IDENTIFIER_CLASS_VALUE before we entered the class. Thus,
581 when leaving class scope, we can restore the
582 IDENTIFIER_CLASS_VALUE by walking this list. The TREE_TYPE is
583 the DECL bound by this name in the class. */
586 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
587 is used for all binding levels. */
590 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
591 label in this scope. The TREE_PURPOSE is the previous value of
592 the IDENTIFIER_LABEL VALUE. */
593 tree shadowed_labels
;
595 /* For each level (except not the global one),
596 a chain of BLOCK nodes for all the levels
597 that were entered and exited one level down. */
600 /* The BLOCK node for this level, if one has been preallocated.
601 If 0, the BLOCK is allocated (if needed) when the level is popped. */
604 /* The binding level which this one is contained in (inherits from). */
605 struct binding_level
*level_chain
;
607 /* List of decls in `names' that have incomplete
608 structure or union types. */
611 /* List of VAR_DECLS saved from a previous for statement.
612 These would be dead in ANSI-conforming code, but might
613 be referenced in ARM-era code. These are stored in a
614 TREE_LIST; the TREE_VALUE is the actual declaration. */
615 tree dead_vars_from_for
;
617 /* 1 for the level that holds the parameters of a function.
618 2 for the level that holds a class declaration.
619 3 for levels that hold parameter declarations. */
620 unsigned parm_flag
: 4;
622 /* 1 means make a BLOCK for this level regardless of all else.
623 2 for temporary binding contours created by the compiler. */
626 /* Nonzero if this level "doesn't exist" for tags. */
627 unsigned tag_transparent
: 1;
629 /* Nonzero if this level can safely have additional
630 cleanup-needing variables added to it. */
631 unsigned more_cleanups_ok
: 1;
632 unsigned have_cleanups
: 1;
634 /* Nonzero if this level is for storing the decls for template
635 parameters and generic decls; these decls will be discarded and
636 replaced with a TEMPLATE_DECL. */
637 unsigned pseudo_global
: 1;
639 /* This is set for a namespace binding level. */
640 unsigned namespace_p
: 1;
642 /* True if this level is that of a for-statement where we need to
643 worry about ambiguous (ARM or ANSI) scope rules. */
644 unsigned is_for_scope
: 1;
646 /* True if this level corresponds to an EH region, as for a try block. */
647 unsigned eh_region
: 1;
649 /* One bit left for this word. */
651 #if defined(DEBUG_CP_BINDING_LEVELS)
652 /* Binding depth at which this level began. */
653 unsigned binding_depth
;
654 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
657 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
659 /* The binding level currently in effect. */
661 static struct binding_level
*current_binding_level
;
663 /* The binding level of the current class, if any. */
665 static struct binding_level
*class_binding_level
;
667 /* A chain of binding_level structures awaiting reuse. */
669 static struct binding_level
*free_binding_level
;
671 /* The outermost binding level, for names of file scope.
672 This is created when the compiler is started and exists
673 through the entire run. */
675 static struct binding_level
*global_binding_level
;
677 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
679 static int keep_next_level_flag
;
681 #if defined(DEBUG_CP_BINDING_LEVELS)
682 static int binding_depth
= 0;
683 static int is_class_level
= 0;
690 for (i
= 0; i
< binding_depth
*2; i
++)
693 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
695 static tree pushdecl_with_scope
PROTO((tree
, struct binding_level
*));
698 push_binding_level (newlevel
, tag_transparent
, keep
)
699 struct binding_level
*newlevel
;
700 int tag_transparent
, keep
;
702 /* Add this level to the front of the chain (stack) of levels that
704 bzero ((char*) newlevel
, sizeof (struct binding_level
));
705 newlevel
->level_chain
= current_binding_level
;
706 current_binding_level
= newlevel
;
707 newlevel
->tag_transparent
= tag_transparent
;
708 newlevel
->more_cleanups_ok
= 1;
710 /* We are called before expand_start_bindings, but after
711 expand_eh_region_start for a try block; so we check this now,
712 before the EH block is covered up. */
713 newlevel
->eh_region
= is_eh_region ();
715 newlevel
->keep
= keep
;
716 #if defined(DEBUG_CP_BINDING_LEVELS)
717 newlevel
->binding_depth
= binding_depth
;
719 fprintf (stderr
, "push %s level 0x%08x line %d\n",
720 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
723 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
726 /* Find the innermost enclosing class scope, and reset
727 CLASS_BINDING_LEVEL appropriately. */
730 find_class_binding_level ()
732 struct binding_level
*level
= current_binding_level
;
734 while (level
&& level
->parm_flag
!= 2)
735 level
= level
->level_chain
;
736 if (level
&& level
->parm_flag
== 2)
737 class_binding_level
= level
;
739 class_binding_level
= 0;
745 if (global_binding_level
)
747 /* Cannot pop a level, if there are none left to pop. */
748 if (current_binding_level
== global_binding_level
)
749 my_friendly_abort (123);
751 /* Pop the current level, and free the structure for reuse. */
752 #if defined(DEBUG_CP_BINDING_LEVELS)
755 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
756 (is_class_level
) ? "class" : "block",
757 current_binding_level
, lineno
);
758 if (is_class_level
!= (current_binding_level
== class_binding_level
))
761 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
764 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
766 register struct binding_level
*level
= current_binding_level
;
767 current_binding_level
= current_binding_level
->level_chain
;
768 level
->level_chain
= free_binding_level
;
769 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
770 if (level
->binding_depth
!= binding_depth
)
772 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
773 free_binding_level
= level
;
774 find_class_binding_level ();
779 suspend_binding_level ()
781 if (class_binding_level
)
782 current_binding_level
= class_binding_level
;
784 if (global_binding_level
)
786 /* Cannot suspend a level, if there are none left to suspend. */
787 if (current_binding_level
== global_binding_level
)
788 my_friendly_abort (123);
790 /* Suspend the current level. */
791 #if defined(DEBUG_CP_BINDING_LEVELS)
794 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
795 (is_class_level
) ? "class" : "block",
796 current_binding_level
, lineno
);
797 if (is_class_level
!= (current_binding_level
== class_binding_level
))
800 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
803 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
804 current_binding_level
= current_binding_level
->level_chain
;
805 find_class_binding_level ();
809 resume_binding_level (b
)
810 struct binding_level
*b
;
812 /* Resuming binding levels is meant only for namespaces,
813 and those cannot nest into classes. */
814 my_friendly_assert(!class_binding_level
, 386);
815 /* Also, resuming a non-directly nested namespace is a no-no. */
816 my_friendly_assert(b
->level_chain
== current_binding_level
, 386);
817 current_binding_level
= b
;
818 #if defined(DEBUG_CP_BINDING_LEVELS)
819 b
->binding_depth
= binding_depth
;
821 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
822 (is_class_level
) ? "class" : "block", b
, lineno
);
825 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
828 /* Create a new `struct binding_level'. */
831 struct binding_level
*
832 make_binding_level ()
835 return (struct binding_level
*) xmalloc (sizeof (struct binding_level
));
838 /* Nonzero if we are currently in the global binding level. */
843 return current_binding_level
== global_binding_level
;
846 /* Return the innermost binding level that is not for a class scope. */
848 static struct binding_level
*
849 innermost_nonclass_level ()
851 struct binding_level
*b
;
853 b
= current_binding_level
;
854 while (b
->parm_flag
== 2)
860 /* Nonzero if we are currently in a toplevel binding level. This
861 means either the global binding level or a namespace in a toplevel
862 binding level. Since there are no non-toplevel namespace levels,
863 this really means any namespace or pseudo-global level. We also
864 include a class whose context is toplevel. */
867 toplevel_bindings_p ()
869 struct binding_level
*b
= innermost_nonclass_level ();
871 return b
->namespace_p
|| b
->pseudo_global
;
874 /* Nonzero if this is a namespace scope, or if we are defining a class
875 which is itself at namespace scope, or whose enclosing class is
876 such a class, etc. */
879 namespace_bindings_p ()
881 struct binding_level
*b
= innermost_nonclass_level ();
883 return b
->namespace_p
;
886 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
887 unconditionally. Otherwise, use the normal logic to decide whether
888 or not to create a BLOCK. */
891 keep_next_level (keep
)
894 keep_next_level_flag
= keep
;
897 /* Nonzero if the current level needs to have a BLOCK made. */
902 return (current_binding_level
->blocks
!= NULL_TREE
903 || current_binding_level
->keep
904 || current_binding_level
->names
!= NULL_TREE
905 || (current_binding_level
->tags
!= NULL_TREE
906 && !current_binding_level
->tag_transparent
));
909 /* Identify this binding level as a level of parameters. */
912 declare_parm_level ()
914 current_binding_level
->parm_flag
= 1;
918 declare_pseudo_global_level ()
920 current_binding_level
->pseudo_global
= 1;
924 declare_namespace_level ()
926 current_binding_level
->namespace_p
= 1;
930 pseudo_global_level_p ()
932 return current_binding_level
->pseudo_global
;
936 set_class_shadows (shadows
)
939 class_binding_level
->class_shadowed
= shadows
;
942 /* Enter a new binding level.
943 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
944 not for that of tags. */
947 pushlevel (tag_transparent
)
950 register struct binding_level
*newlevel
= NULL_BINDING_LEVEL
;
952 /* If this is the top level of a function,
953 just make sure that NAMED_LABELS is 0.
954 They should have been set to 0 at the end of the previous function. */
956 if (current_binding_level
== global_binding_level
)
957 my_friendly_assert (named_labels
== NULL_TREE
, 134);
959 /* Reuse or create a struct for this binding level. */
961 #if defined(DEBUG_CP_BINDING_LEVELS)
963 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
964 if (free_binding_level
)
965 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
967 newlevel
= free_binding_level
;
968 free_binding_level
= free_binding_level
->level_chain
;
971 newlevel
= make_binding_level ();
973 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
974 GNU_xref_start_scope ((HOST_WIDE_INT
) newlevel
);
975 keep_next_level_flag
= 0;
979 note_level_for_for ()
981 current_binding_level
->is_for_scope
= 1;
985 pushlevel_temporary (tag_transparent
)
988 pushlevel (tag_transparent
);
989 current_binding_level
->keep
= 2;
992 /* Note we don't call push_momentary() here. Otherwise, it would cause
993 cleanups to be allocated on the momentary obstack, and they will be
994 overwritten by the next statement. */
996 expand_start_bindings (0);
999 /* For a binding between a name and an entity at a block scope,
1000 this is the `struct binding_level' for the block. */
1001 #define BINDING_LEVEL(NODE) \
1002 (((struct tree_binding*)NODE)->scope.level)
1004 /* These are currently unused, but permanent, CPLUS_BINDING nodes.
1005 They are kept here because they are allocated from the permanent
1006 obstack and cannot be easily freed. */
1007 static tree free_binding_nodes
;
1009 /* Make DECL the innermost binding for ID. The LEVEL is the binding
1010 level at which this declaration is being bound. */
1013 push_binding (id
, decl
, level
)
1016 struct binding_level
* level
;
1020 if (!free_binding_nodes
)
1022 /* There are no free nodes, so we must build one here. */
1023 push_permanent_obstack ();
1024 binding
= make_node (CPLUS_BINDING
);
1029 /* There are nodes on the free list. Grab the first one. */
1030 binding
= free_binding_nodes
;
1032 /* And update the free list. */
1033 free_binding_nodes
= TREE_CHAIN (free_binding_nodes
);
1036 /* Now, fill in the binding information. */
1037 BINDING_VALUE (binding
) = decl
;
1038 BINDING_TYPE (binding
) = NULL_TREE
;
1039 BINDING_LEVEL (binding
) = level
;
1040 INHERITED_VALUE_BINDING_P (binding
) = 0;
1041 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
1043 /* And put it on the front of the list of bindings for ID. */
1044 TREE_CHAIN (binding
) = IDENTIFIER_BINDING (id
);
1045 IDENTIFIER_BINDING (id
) = binding
;
1048 /* ID is already bound in the current scope. But, DECL is an
1049 additional binding for ID in the same scope. This is the `struct
1050 stat' hack whereby a non-typedef class-name or enum-name can be
1051 bound at the same level as some other kind of entity. It's the
1052 responsibility of the caller to check that inserting this name is
1053 legal here. Returns nonzero if the new binding was successful. */
1055 add_binding (id
, decl
)
1059 tree binding
= IDENTIFIER_BINDING (id
);
1062 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
1063 /* The new name is the type name. */
1064 BINDING_TYPE (binding
) = decl
;
1065 else if (!BINDING_VALUE (binding
))
1066 /* This situation arises when push_class_level_binding moves an
1067 inherited type-binding out of the way to make room for a new
1069 BINDING_VALUE (binding
) = decl
;
1070 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
1071 && DECL_ARTIFICIAL (BINDING_VALUE (binding
)))
1073 /* The old binding was a type name. It was placed in
1074 BINDING_VALUE because it was thought, at the point it was
1075 declared, to be the only entity with such a name. Move the
1076 type name into the type slot; it is now hidden by the new
1078 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
1079 BINDING_VALUE (binding
) = decl
;
1080 INHERITED_VALUE_BINDING_P (binding
) = 0;
1082 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
1083 && TREE_CODE (decl
) == TYPE_DECL
1084 && DECL_NAME (decl
) == DECL_NAME (BINDING_VALUE (binding
))
1085 && same_type_p (TREE_TYPE (decl
),
1086 TREE_TYPE (BINDING_VALUE (binding
))))
1087 /* We have two typedef-names, both naming the same type to have
1088 the same name. This is OK because of:
1092 In a given scope, a typedef specifier can be used to redefine
1093 the name of any type declared in that scope to refer to the
1094 type to which it already refers. */
1098 cp_error ("declaration of `%#D'", decl
);
1099 cp_error_at ("conflicts with previous declaration `%#D'",
1100 BINDING_VALUE (binding
));
1107 /* Add DECL to the list of things declared in B. */
1110 add_decl_to_level (decl
, b
)
1112 struct binding_level
*b
;
1114 /* Only things that will live forever should go in the global
1116 my_friendly_assert (!(b
== global_binding_level
1117 && !TREE_PERMANENT (decl
)),
1120 /* We build up the list in reverse order, and reverse it later if
1122 TREE_CHAIN (decl
) = b
->names
;
1126 /* Bind DECL to ID in the current_binding_level, assumed to be a local
1127 binding level. If PUSH_USING is set in FLAGS, we know that DECL
1128 doesn't really belong to this binding level, that it got here
1129 through a using-declaration. */
1132 push_local_binding (id
, decl
, flags
)
1137 struct binding_level
*b
;
1139 /* Skip over any local classes. This makes sense if we call
1140 push_local_binding with a friend decl of a local class. */
1141 b
= current_binding_level
;
1142 while (b
->parm_flag
== 2)
1145 if (lookup_name_current_level (id
))
1147 /* Supplement the existing binding. */
1148 if (!add_binding (id
, decl
))
1149 /* It didn't work. Something else must be bound at this
1150 level. Do not add DECL to the list of things to pop
1155 /* Create a new binding. */
1156 push_binding (id
, decl
, b
);
1158 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
1159 /* We must put the OVERLOAD into a TREE_LIST since the
1160 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1161 decls that got here through a using-declaration. */
1162 decl
= build_tree_list (NULL_TREE
, decl
);
1164 /* And put DECL on the list of things declared by the current
1166 add_decl_to_level (decl
, b
);
1169 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
1170 binding was successful. */
1173 push_class_binding (id
, decl
)
1178 tree binding
= IDENTIFIER_BINDING (id
);
1181 /* Note that we declared this value so that we can issue an error if
1182 this an illegal redeclaration of a name already used for some
1184 note_name_declared_in_class (id
, decl
);
1186 if (binding
&& BINDING_LEVEL (binding
) == class_binding_level
)
1187 /* Supplement the existing binding. */
1188 result
= add_binding (id
, decl
);
1190 /* Create a new binding. */
1191 push_binding (id
, decl
, class_binding_level
);
1193 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1194 class-level declaration. Note that we do not use DECL here
1195 because of the possibility of the `struct stat' hack; if DECL is
1196 a class-name or enum-name we might prefer a field-name, or some
1198 IDENTIFIER_CLASS_VALUE (id
) = BINDING_VALUE (IDENTIFIER_BINDING (id
));
1200 /* If this is a binding from a base class, mark it as such. */
1201 binding
= IDENTIFIER_BINDING (id
);
1202 if (BINDING_VALUE (binding
) == decl
&& TREE_CODE (decl
) != TREE_LIST
)
1204 /* Any implicit typename must be from a base-class. The
1205 context for an implicit typename declaration is always
1206 the derived class in which the lookup was done, so the checks
1207 based on the context of DECL below will not trigger. */
1208 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl
))
1209 INHERITED_VALUE_BINDING_P (binding
) = 1;
1212 if (TREE_CODE (decl
) == OVERLOAD
)
1213 context
= DECL_REAL_CONTEXT (OVL_CURRENT (decl
));
1216 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd',
1218 context
= DECL_REAL_CONTEXT (decl
);
1221 if (is_properly_derived_from (current_class_type
, context
))
1222 INHERITED_VALUE_BINDING_P (binding
) = 1;
1224 INHERITED_VALUE_BINDING_P (binding
) = 0;
1227 else if (BINDING_VALUE (binding
) == decl
)
1228 /* We only encounter a TREE_LIST when push_class_decls detects an
1229 ambiguity. Such an ambiguity can be overridden by a definition
1231 INHERITED_VALUE_BINDING_P (binding
) = 1;
1236 /* Remove the binding for DECL which should be the innermost binding
1240 pop_binding (id
, decl
)
1246 if (id
== NULL_TREE
)
1247 /* It's easiest to write the loops that call this function without
1248 checking whether or not the entities involved have names. We
1249 get here for such an entity. */
1252 /* Get the innermost binding for ID. */
1253 binding
= IDENTIFIER_BINDING (id
);
1255 /* The name should be bound. */
1256 my_friendly_assert (binding
!= NULL_TREE
, 0);
1258 /* The DECL will be either the ordinary binding or the type
1259 binding for this identifier. Remove that binding. */
1260 if (BINDING_VALUE (binding
) == decl
)
1261 BINDING_VALUE (binding
) = NULL_TREE
;
1262 else if (BINDING_TYPE (binding
) == decl
)
1263 BINDING_TYPE (binding
) = NULL_TREE
;
1265 my_friendly_abort (0);
1267 if (!BINDING_VALUE (binding
) && !BINDING_TYPE (binding
))
1269 /* We're completely done with the innermost binding for this
1270 identifier. Unhook it from the list of bindings. */
1271 IDENTIFIER_BINDING (id
) = TREE_CHAIN (binding
);
1273 /* And place it on the free list. */
1274 TREE_CHAIN (binding
) = free_binding_nodes
;
1275 free_binding_nodes
= binding
;
1279 /* When a label goes out of scope, check to see if that label was used
1280 in a valid manner, and issue any appropriate warnings or errors. */
1286 tree label
= TREE_VALUE (link
);
1288 if (DECL_INITIAL (label
) == NULL_TREE
)
1290 cp_error_at ("label `%D' used but not defined", label
);
1291 /* Avoid crashing later. */
1292 define_label (input_filename
, 1, DECL_NAME (label
));
1294 else if (warn_unused
&& !TREE_USED (label
))
1295 cp_warning_at ("label `%D' defined but not used", label
);
1297 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), TREE_PURPOSE (link
));
1300 /* At the end of a function, all labels declared within the fucntion
1301 go out of scope. BLOCK is the top-level block for the
1310 /* Clear out the definitions of all label names, since their scopes
1312 for (link
= named_labels
; link
; link
= TREE_CHAIN (link
))
1315 /* Put the labels into the "variables" of the top-level block,
1316 so debugger can see them. */
1317 TREE_CHAIN (TREE_VALUE (link
)) = BLOCK_VARS (block
);
1318 BLOCK_VARS (block
) = TREE_VALUE (link
);
1321 named_labels
= NULL_TREE
;
1324 /* Exit a binding level.
1325 Pop the level off, and restore the state of the identifier-decl mappings
1326 that were in effect when this level was entered.
1328 If KEEP == 1, this level had explicit declarations, so
1329 and create a "block" (a BLOCK node) for the level
1330 to record its declarations and subblocks for symbol table output.
1332 If FUNCTIONBODY is nonzero, this level is the body of a function,
1333 so create a block as if KEEP were set and also clear out all
1336 If REVERSE is nonzero, reverse the order of decls before putting
1337 them into the BLOCK. */
1340 poplevel (keep
, reverse
, functionbody
)
1346 /* The chain of decls was accumulated in reverse order.
1347 Put it into forward order, just for cleanliness. */
1349 int tmp
= functionbody
;
1350 int real_functionbody
= current_binding_level
->keep
== 2
1351 ? ((functionbody
= 0), tmp
) : functionbody
;
1352 tree tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1353 tree subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1354 tree block
= NULL_TREE
;
1356 int block_previously_created
;
1357 int leaving_for_scope
;
1359 if (current_binding_level
->parm_flag
== 2)
1360 return poplevel_class ();
1362 my_friendly_assert (!current_binding_level
->class_shadowed
,
1365 /* We used to use KEEP == 2 to indicate that the new block should go
1366 at the beginning of the list of blocks at this binding level,
1367 rather than the end. This hack is no longer used. */
1368 my_friendly_assert (keep
== 0 || keep
== 1, 0);
1370 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1371 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1372 current_binding_level
->parm_flag
,
1373 current_binding_level
->keep
);
1375 if (current_binding_level
->keep
== 1)
1378 /* Get the decls in the order they were written.
1379 Usually current_binding_level->names is in reverse order.
1380 But parameter decls were previously put in forward order. */
1383 current_binding_level
->names
1384 = decls
= nreverse (current_binding_level
->names
);
1386 decls
= current_binding_level
->names
;
1388 /* Output any nested inline functions within this block
1389 if they weren't already output. */
1391 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1392 if (TREE_CODE (decl
) == FUNCTION_DECL
1393 && ! TREE_ASM_WRITTEN (decl
)
1394 && DECL_INITIAL (decl
) != NULL_TREE
1395 && TREE_ADDRESSABLE (decl
)
1396 && decl_function_context (decl
) == current_function_decl
)
1398 /* If this decl was copied from a file-scope decl
1399 on account of a block-scope extern decl,
1400 propagate TREE_ADDRESSABLE to the file-scope decl. */
1401 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1402 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1405 push_function_context ();
1406 output_inline_function (decl
);
1407 pop_function_context ();
1411 /* If there were any declarations or structure tags in that level,
1412 or if this level is a function body,
1413 create a BLOCK to record them for the life of this function. */
1416 block_previously_created
= (current_binding_level
->this_block
!= NULL_TREE
);
1417 if (block_previously_created
)
1418 block
= current_binding_level
->this_block
;
1419 else if (keep
== 1 || functionbody
)
1420 block
= make_node (BLOCK
);
1421 if (block
!= NULL_TREE
)
1423 if (block_previously_created
)
1425 if (decls
|| tags
|| subblocks
)
1427 if (BLOCK_VARS (block
) || BLOCK_TYPE_TAGS (block
))
1428 warning ("internal compiler error: debugging info corrupted");
1430 BLOCK_VARS (block
) = decls
;
1431 BLOCK_TYPE_TAGS (block
) = tags
;
1433 /* We can have previous subblocks and new subblocks when
1434 doing fixup_gotos with complex cleanups. We chain the new
1435 subblocks onto the end of any pre-existing subblocks. */
1436 BLOCK_SUBBLOCKS (block
) = chainon (BLOCK_SUBBLOCKS (block
),
1439 /* If we created the block earlier on, and we are just
1440 diddling it now, then it already should have a proper
1441 BLOCK_END_NOTE value associated with it. */
1445 BLOCK_VARS (block
) = decls
;
1446 BLOCK_TYPE_TAGS (block
) = tags
;
1447 BLOCK_SUBBLOCKS (block
) = subblocks
;
1448 /* Otherwise, for a new block, install a new BLOCK_END_NOTE
1450 remember_end_note (block
);
1454 /* In each subblock, record that this is its superior. */
1457 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1458 BLOCK_SUPERCONTEXT (link
) = block
;
1460 /* We still support the old for-scope rules, whereby the variables
1461 in a for-init statement were in scope after the for-statement
1462 ended. We only use the new rules in flag_new_for_scope is
1465 = current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1;
1467 /* Remove declarations for all the DECLs in this level. */
1468 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1470 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
)
1473 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link
)));
1477 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
1479 ns_binding
= NULL_TREE
;
1482 && (BINDING_LEVEL (outer_binding
)
1483 == current_binding_level
->level_chain
))
1484 /* We have something like:
1489 and we are leaving the `for' scope. There's no reason to
1490 keep the binding of the inner `i' in this case. */
1491 pop_binding (DECL_NAME (link
), link
);
1492 else if ((outer_binding
1493 && (TREE_CODE (BINDING_VALUE (outer_binding
))
1496 && TREE_CODE (ns_binding
) == TYPE_DECL
))
1497 /* Here, we have something like:
1505 We must pop the for-scope binding so we know what's a
1506 type and what isn't. */
1507 pop_binding (DECL_NAME (link
), link
);
1510 /* Mark this VAR_DECL as dead so that we can tell we left it
1511 there only for backward compatibility. */
1512 DECL_DEAD_FOR_LOCAL (link
) = 1;
1514 /* Keep track of what should of have happenned when we
1515 popped the binding. */
1516 if (outer_binding
&& BINDING_VALUE (outer_binding
))
1517 DECL_SHADOWED_FOR_VAR (link
)
1518 = BINDING_VALUE (outer_binding
);
1520 /* Add it to the list of dead variables in the next
1521 outermost binding to that we can remove these when we
1522 leave that binding. */
1523 current_binding_level
->level_chain
->dead_vars_from_for
1524 = tree_cons (NULL_TREE
, link
,
1525 current_binding_level
->level_chain
->
1526 dead_vars_from_for
);
1528 /* Although we don't pop the CPLUS_BINDING, we do clear
1529 its BINDING_LEVEL since the level is going away now. */
1530 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link
)))
1536 /* Remove the binding. */
1538 if (TREE_CODE (decl
) == TREE_LIST
)
1539 decl
= TREE_VALUE (decl
);
1540 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd')
1541 pop_binding (DECL_NAME (decl
), decl
);
1542 else if (TREE_CODE (decl
) == OVERLOAD
)
1543 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
1545 my_friendly_abort (0);
1549 /* Remove declarations for any `for' variables from inner scopes
1550 that we kept around. */
1551 for (link
= current_binding_level
->dead_vars_from_for
;
1552 link
; link
= TREE_CHAIN (link
))
1553 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
1555 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1556 for (link
= current_binding_level
->type_shadowed
;
1557 link
; link
= TREE_CHAIN (link
))
1558 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1560 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1561 for (link
= current_binding_level
->shadowed_labels
;
1563 link
= TREE_CHAIN (link
))
1566 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1567 list if a `using' declaration put them there. The debugging
1568 back-ends won't understand OVERLOAD, so we remove them here.
1569 Because the BLOCK_VARS are (temporarily) shared with
1570 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1571 popped all the bindings. */
1576 for (d
= &BLOCK_VARS (block
); *d
; )
1578 if (TREE_CODE (*d
) == TREE_LIST
)
1579 *d
= TREE_CHAIN (*d
);
1581 d
= &TREE_CHAIN (*d
);
1585 /* If the level being exited is the top level of a function,
1586 check over all the labels. */
1589 /* Since this is the top level block of a function, the vars are
1590 the function's parameters. Don't leave them in the BLOCK
1591 because they are found in the FUNCTION_DECL instead. */
1592 BLOCK_VARS (block
) = 0;
1596 /* Any uses of undefined labels now operate under constraints
1597 of next binding contour. */
1599 struct binding_level
*level_chain
;
1600 level_chain
= current_binding_level
->level_chain
;
1603 struct named_label_list
*labels
;
1604 for (labels
= named_label_uses
; labels
; labels
= labels
->next
)
1605 if (labels
->binding_level
== current_binding_level
)
1607 labels
->binding_level
= level_chain
;
1608 labels
->names_in_scope
= level_chain
->names
;
1613 tmp
= current_binding_level
->keep
;
1615 pop_binding_level ();
1617 DECL_INITIAL (current_function_decl
) = block
;
1620 if (!block_previously_created
)
1621 current_binding_level
->blocks
1622 = chainon (current_binding_level
->blocks
, block
);
1624 /* If we did not make a block for the level just exited,
1625 any blocks made for inner levels
1626 (since they cannot be recorded as subblocks in that level)
1627 must be carried forward so they will later become subblocks
1628 of something else. */
1630 current_binding_level
->blocks
1631 = chainon (current_binding_level
->blocks
, subblocks
);
1633 /* Take care of compiler's internal binding structures. */
1636 expand_end_bindings (getdecls (), keep
, 1);
1637 /* Each and every BLOCK node created here in `poplevel' is important
1638 (e.g. for proper debugging information) so if we created one
1639 earlier, mark it as "used". */
1641 TREE_USED (block
) = 1;
1642 block
= poplevel (keep
, reverse
, real_functionbody
);
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;
1653 /* Delete the node BLOCK from the current binding level.
1654 This is used for the block inside a stmt expr ({...})
1655 so that the block can be reinserted where appropriate. */
1658 delete_block (block
)
1662 if (current_binding_level
->blocks
== block
)
1663 current_binding_level
->blocks
= TREE_CHAIN (block
);
1664 for (t
= current_binding_level
->blocks
; t
;)
1666 if (TREE_CHAIN (t
) == block
)
1667 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1671 TREE_CHAIN (block
) = NULL_TREE
;
1672 /* Clear TREE_USED which is always set by poplevel.
1673 The flag is set again if insert_block is called. */
1674 TREE_USED (block
) = 0;
1677 /* Insert BLOCK at the end of the list of subblocks of the
1678 current binding level. This is used when a BIND_EXPR is expanded,
1679 to handle the BLOCK node inside the BIND_EXPR. */
1682 insert_block (block
)
1685 TREE_USED (block
) = 1;
1686 current_binding_level
->blocks
1687 = chainon (current_binding_level
->blocks
, block
);
1690 /* Set the BLOCK node for the innermost scope
1691 (the one we are currently in). */
1695 register tree block
;
1697 current_binding_level
->this_block
= block
;
1700 /* Do a pushlevel for class declarations. */
1705 register struct binding_level
*newlevel
;
1707 /* Reuse or create a struct for this binding level. */
1708 #if defined(DEBUG_CP_BINDING_LEVELS)
1710 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1711 if (free_binding_level
)
1712 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1714 newlevel
= free_binding_level
;
1715 free_binding_level
= free_binding_level
->level_chain
;
1718 newlevel
= make_binding_level ();
1720 #if defined(DEBUG_CP_BINDING_LEVELS)
1722 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1724 push_binding_level (newlevel
, 0, 0);
1726 decl_stack
= push_decl_level (decl_stack
, &decl_obstack
);
1727 class_binding_level
= current_binding_level
;
1728 class_binding_level
->parm_flag
= 2;
1731 /* ...and a poplevel for class declarations. */
1736 register struct binding_level
*level
= class_binding_level
;
1739 my_friendly_assert (level
!= 0, 354);
1741 decl_stack
= pop_stack_level (decl_stack
);
1742 /* If we're leaving a toplevel class, don't bother to do the setting
1743 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1744 shouldn't even be used when current_class_type isn't set, and second,
1745 if we don't touch it here, we're able to use the cache effect if the
1746 next time we're entering a class scope, it is the same class. */
1747 if (current_class_depth
!= 1)
1749 struct binding_level
* b
;
1751 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1752 for (shadowed
= level
->class_shadowed
;
1754 shadowed
= TREE_CHAIN (shadowed
))
1755 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = NULL_TREE
;
1757 /* Find the next enclosing class, and recreate
1758 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1759 b
= level
->level_chain
;
1760 while (b
&& b
->parm_flag
!= 2)
1764 for (shadowed
= b
->class_shadowed
;
1766 shadowed
= TREE_CHAIN (shadowed
))
1770 t
= IDENTIFIER_BINDING (TREE_PURPOSE (shadowed
));
1771 while (t
&& BINDING_LEVEL (t
) != b
)
1775 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
))
1776 = BINDING_VALUE (t
);
1780 /* Remember to save what IDENTIFIER's were bound in this scope so we
1781 can recover from cache misses. */
1783 previous_class_type
= current_class_type
;
1784 previous_class_values
= class_binding_level
->class_shadowed
;
1786 for (shadowed
= level
->type_shadowed
;
1788 shadowed
= TREE_CHAIN (shadowed
))
1789 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1791 /* Remove the bindings for all of the class-level declarations. */
1792 for (shadowed
= level
->class_shadowed
;
1794 shadowed
= TREE_CHAIN (shadowed
))
1795 pop_binding (TREE_PURPOSE (shadowed
), TREE_TYPE (shadowed
));
1797 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1798 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1799 class_binding_level
->parm_flag
,
1800 class_binding_level
->keep
);
1802 /* Now, pop out of the binding level which we created up in the
1803 `pushlevel_class' routine. */
1804 #if defined(DEBUG_CP_BINDING_LEVELS)
1806 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1808 pop_binding_level ();
1813 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1814 for any names in enclosing classes. */
1817 clear_identifier_class_values ()
1821 if (!class_binding_level
)
1824 for (t
= class_binding_level
->class_shadowed
;
1827 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
1830 /* Returns non-zero if T is a virtual function table. */
1833 vtable_decl_p (t
, data
)
1835 void *data ATTRIBUTE_UNUSED
;
1837 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
1840 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1844 vtype_decl_p (t
, data
)
1846 void *data ATTRIBUTE_UNUSED
;
1848 return (TREE_CODE (t
) == TYPE_DECL
1849 && TREE_TYPE (t
) != error_mark_node
1850 && TYPE_LANG_SPECIFIC (TREE_TYPE (t
))
1851 && CLASSTYPE_VSIZE (TREE_TYPE (t
)));
1854 /* Return the declarations that are members of the namespace NS. */
1857 cp_namespace_decls (ns
)
1860 return NAMESPACE_LEVEL (ns
)->names
;
1863 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1864 itself, calling F for each. The DATA is passed to F as well. */
1867 walk_namespaces_r (namespace, f
, data
)
1869 walk_namespaces_fn f
;
1875 result
|= (*f
) (namespace, data
);
1877 for (current
= cp_namespace_decls (namespace);
1879 current
= TREE_CHAIN (current
))
1881 if (TREE_CODE (current
) != NAMESPACE_DECL
1882 || DECL_NAMESPACE_ALIAS (current
))
1884 if (!DECL_LANG_SPECIFIC (current
))
1887 my_friendly_assert (current
== std_node
, 393);
1891 /* We found a namespace. */
1892 result
|= walk_namespaces_r (current
, f
, data
);
1898 /* Walk all the namespaces, calling F for each. The DATA is passed to
1902 walk_namespaces (f
, data
)
1903 walk_namespaces_fn f
;
1906 return walk_namespaces_r (global_namespace
, f
, data
);
1909 struct walk_globals_data
{
1910 walk_globals_pred p
;
1915 /* Walk the global declarations in NAMESPACE. Whenever one is found
1916 for which P returns non-zero, call F with its address. If any call
1917 to F returns a non-zero value, return a non-zero value. */
1920 walk_globals_r (namespace, data
)
1924 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1925 walk_globals_pred p
= wgd
->p
;
1926 walk_globals_fn f
= wgd
->f
;
1927 void *d
= wgd
->data
;
1931 t
= &NAMESPACE_LEVEL (namespace)->names
;
1938 result
|= (*f
) (t
, d
);
1940 /* If F changed *T, then *T still points at the next item to
1943 t
= &TREE_CHAIN (*t
);
1949 /* Walk the global declarations. Whenever one is found for which P
1950 returns non-zero, call F with its address. If any call to F
1951 returns a non-zero value, return a non-zero value. */
1954 walk_globals (p
, f
, data
)
1955 walk_globals_pred p
;
1959 struct walk_globals_data wgd
;
1964 return walk_namespaces (walk_globals_r
, &wgd
);
1967 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1968 DATA is non-NULL, this is the last time we will call
1969 wrapup_global_declarations for this NAMESPACE. */
1972 wrapup_globals_for_namespace (namespace, data
)
1976 tree globals
= cp_namespace_decls (namespace);
1977 int len
= list_length (globals
);
1978 tree
*vec
= (tree
*) alloca (sizeof (tree
) * len
);
1982 int last_time
= (data
!= 0);
1984 if (last_time
&& namespace == global_namespace
)
1985 /* Let compile_file handle the global namespace. */
1988 /* Process the decls in reverse order--earliest first.
1989 Put them into VEC from back to front, then take out from front. */
1991 for (i
= 0, decl
= globals
; i
< len
; i
++, decl
= TREE_CHAIN (decl
))
1992 vec
[len
- i
- 1] = decl
;
1996 check_global_declarations (vec
, len
);
2000 /* Temporarily mark vtables as external. That prevents
2001 wrapup_global_declarations from writing them out; we must process
2002 them ourselves in finish_vtable_vardecl. */
2003 for (i
= 0; i
< len
; ++i
)
2004 if (vtable_decl_p (vec
[i
], /*data=*/0) && !DECL_EXTERNAL (vec
[i
]))
2006 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 1;
2007 DECL_EXTERNAL (vec
[i
]) = 1;
2010 /* Write out any globals that need to be output. */
2011 result
= wrapup_global_declarations (vec
, len
);
2013 /* Undo the hack to DECL_EXTERNAL above. */
2014 for (i
= 0; i
< len
; ++i
)
2015 if (vtable_decl_p (vec
[i
], /*data=*/0)
2016 && DECL_NOT_REALLY_EXTERN (vec
[i
]))
2018 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 0;
2019 DECL_EXTERNAL (vec
[i
]) = 0;
2026 /* For debugging. */
2027 static int no_print_functions
= 0;
2028 static int no_print_builtins
= 0;
2031 print_binding_level (lvl
)
2032 struct binding_level
*lvl
;
2036 fprintf (stderr
, " blocks=");
2037 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
2038 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
2039 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
2040 if (lvl
->tag_transparent
)
2041 fprintf (stderr
, " tag-transparent");
2042 if (lvl
->more_cleanups_ok
)
2043 fprintf (stderr
, " more-cleanups-ok");
2044 if (lvl
->have_cleanups
)
2045 fprintf (stderr
, " have-cleanups");
2046 fprintf (stderr
, "\n");
2049 fprintf (stderr
, " names:\t");
2050 /* We can probably fit 3 names to a line? */
2051 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
2053 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
2055 if (no_print_builtins
2056 && (TREE_CODE (t
) == TYPE_DECL
)
2057 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
2060 /* Function decls tend to have longer names. */
2061 if (TREE_CODE (t
) == FUNCTION_DECL
)
2068 fprintf (stderr
, "\n\t");
2071 print_node_brief (stderr
, "", t
, 0);
2072 if (t
== error_mark_node
)
2076 fprintf (stderr
, "\n");
2080 fprintf (stderr
, " tags:\t");
2082 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
2084 if (TREE_PURPOSE (t
) == NULL_TREE
)
2086 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2093 fprintf (stderr
, "\n\t");
2096 if (TREE_PURPOSE (t
) == NULL_TREE
)
2098 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
2099 fprintf (stderr
, ">");
2101 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2102 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2105 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
2106 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2107 fprintf (stderr
, ">");
2111 fprintf (stderr
, "\n");
2113 if (lvl
->class_shadowed
)
2115 fprintf (stderr
, " class-shadowed:");
2116 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
2118 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2120 fprintf (stderr
, "\n");
2122 if (lvl
->type_shadowed
)
2124 fprintf (stderr
, " type-shadowed:");
2125 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2127 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2129 fprintf (stderr
, "\n");
2134 print_other_binding_stack (stack
)
2135 struct binding_level
*stack
;
2137 struct binding_level
*level
;
2138 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
2140 fprintf (stderr
, "binding level ");
2141 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
2142 fprintf (stderr
, "\n");
2143 print_binding_level (level
);
2148 print_binding_stack ()
2150 struct binding_level
*b
;
2151 fprintf (stderr
, "current_binding_level=");
2152 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
2153 fprintf (stderr
, "\nclass_binding_level=");
2154 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
2155 fprintf (stderr
, "\nglobal_binding_level=");
2156 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
2157 fprintf (stderr
, "\n");
2158 if (class_binding_level
)
2160 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
2161 if (b
== current_binding_level
)
2164 b
= class_binding_level
;
2166 b
= current_binding_level
;
2169 b
= current_binding_level
;
2170 print_other_binding_stack (b
);
2171 fprintf (stderr
, "global:\n");
2172 print_binding_level (global_binding_level
);
2175 /* Namespace binding access routines: The namespace_bindings field of
2176 the identifier is polymorphic, with three possible values:
2177 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2178 indicating the BINDING_VALUE of global_namespace. */
2180 /* Check whether the a binding for the name to scope is known.
2181 Assumes that the bindings of the name are already a list
2182 of bindings. Returns the binding found, or NULL_TREE. */
2185 find_binding (name
, scope
)
2189 tree iter
, prev
= NULL_TREE
;
2191 scope
= ORIGINAL_NAMESPACE (scope
);
2193 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
2194 iter
= TREE_CHAIN (iter
))
2196 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
2197 if (BINDING_SCOPE (iter
) == scope
)
2199 /* Move binding found to the front of the list, so
2200 subsequent lookups will find it faster. */
2203 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
2204 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
2205 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
2214 /* Always returns a binding for name in scope. If the
2215 namespace_bindings is not a list, convert it to one first.
2216 If no binding is found, make a new one. */
2219 binding_for_name (name
, scope
)
2223 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2226 scope
= ORIGINAL_NAMESPACE (scope
);
2228 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
2230 /* Get rid of optimization for global scope. */
2231 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
2232 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
2233 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2235 if (b
&& (result
= find_binding (name
, scope
)))
2237 /* Not found, make a new permanent one. */
2238 push_obstacks (&permanent_obstack
, &permanent_obstack
);
2239 result
= make_node (CPLUS_BINDING
);
2240 TREE_CHAIN (result
) = b
;
2241 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2242 BINDING_SCOPE (result
) = scope
;
2243 BINDING_TYPE (result
) = NULL_TREE
;
2244 BINDING_VALUE (result
) = NULL_TREE
;
2249 /* Return the binding value for name in scope, considering that
2250 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2253 namespace_binding (name
, scope
)
2257 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2260 if (scope
== NULL_TREE
)
2261 scope
= global_namespace
;
2262 if (TREE_CODE (b
) != CPLUS_BINDING
)
2263 return (scope
== global_namespace
) ? b
: NULL_TREE
;
2264 name
= find_binding (name
,scope
);
2265 if (name
== NULL_TREE
)
2267 return BINDING_VALUE (name
);
2270 /* Set the binding value for name in scope. If modifying the binding
2271 of global_namespace is attempted, try to optimize it. */
2274 set_namespace_binding (name
, scope
, val
)
2281 if (scope
== NULL_TREE
)
2282 scope
= global_namespace
;
2284 if (scope
== global_namespace
)
2286 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2287 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
2289 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
2293 b
= binding_for_name (name
, scope
);
2294 BINDING_VALUE (b
) = val
;
2297 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2298 select a name that is unique to this compilation unit. */
2301 push_namespace (name
)
2306 int implicit_use
= 0;
2308 if (!global_namespace
)
2310 /* This must be ::. */
2311 my_friendly_assert (name
== get_identifier ("::"), 377);
2316 /* The name of anonymous namespace is unique for the translation
2318 if (!anonymous_namespace_name
)
2319 anonymous_namespace_name
= get_file_function_name ('N');
2320 name
= anonymous_namespace_name
;
2321 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2323 /* Reopening anonymous namespace. */
2327 else if (current_namespace
== global_namespace
2328 && name
== DECL_NAME (std_node
))
2335 /* Check whether this is an extended namespace definition. */
2336 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2337 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
2340 if (DECL_NAMESPACE_ALIAS (d
))
2342 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2343 d
, DECL_NAMESPACE_ALIAS (d
));
2344 d
= DECL_NAMESPACE_ALIAS (d
);
2351 /* Make a new namespace, binding the name to it. */
2352 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
2353 /* The global namespace is not pushed, and the global binding
2354 level is set elsewhere. */
2359 declare_namespace_level ();
2360 NAMESPACE_LEVEL (d
) = current_binding_level
;
2364 resume_binding_level (NAMESPACE_LEVEL (d
));
2367 do_using_directive (d
);
2368 /* Enter the name space. */
2369 current_namespace
= d
;
2372 /* Pop from the scope of the current namespace. */
2377 if (current_namespace
== global_namespace
)
2379 my_friendly_assert (in_std
>0, 980421);
2383 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
2384 /* The binding level is not popped, as it might be re-opened later. */
2385 suspend_binding_level ();
2388 /* Push into the scope of the namespace NS, even if it is deeply
2389 nested within another namespace. */
2392 push_nested_namespace (ns
)
2395 if (ns
== global_namespace
)
2396 push_to_top_level ();
2399 push_nested_namespace (CP_DECL_CONTEXT (ns
));
2400 push_namespace (DECL_NAME (ns
));
2404 /* Pop back from the scope of the namespace NS, which was previously
2405 entered with push_nested_namespace. */
2408 pop_nested_namespace (ns
)
2411 while (ns
!= global_namespace
)
2414 ns
= CP_DECL_CONTEXT (ns
);
2417 pop_from_top_level ();
2421 /* Subroutines for reverting temporarily to top-level for instantiation
2422 of templates and such. We actually need to clear out the class- and
2423 local-value slots of all identifiers, so that only the global values
2424 are at all visible. Simply setting current_binding_level to the global
2425 scope isn't enough, because more binding levels may be pushed. */
2426 struct saved_scope
{
2427 struct binding_level
*old_binding_level
;
2430 struct saved_scope
*prev
;
2431 tree class_name
, class_type
;
2432 tree access_specifier
;
2434 struct binding_level
*class_bindings
;
2435 tree
*lang_base
, *lang_stack
, lang_name
;
2437 tree last_function_parms
;
2438 tree template_parms
;
2439 HOST_WIDE_INT processing_template_decl
;
2440 tree previous_class_type
, previous_class_values
;
2441 int processing_specialization
;
2442 int processing_explicit_instantiation
;
2443 char *class_cache_firstobj
;
2445 static struct saved_scope
*current_saved_scope
;
2447 /* A chain of the binding vecs created by store_bindings. We create a
2448 whole bunch of these during compilation, on permanent_obstack, so we
2449 can't just throw them away. */
2450 static tree free_binding_vecs
;
2453 store_bindings (names
, old_bindings
)
2454 tree names
, old_bindings
;
2457 for (t
= names
; t
; t
= TREE_CHAIN (t
))
2459 tree binding
, t1
, id
;
2461 if (TREE_CODE (t
) == TREE_LIST
)
2462 id
= TREE_PURPOSE (t
);
2467 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2468 we have no IDENTIFIER_BINDING if we have left the class
2469 scope, but cached the class-level declarations. */
2470 || !(IDENTIFIER_BINDING (id
) || IDENTIFIER_CLASS_VALUE (id
)))
2473 for (t1
= old_bindings
; t1
; t1
= TREE_CHAIN (t1
))
2474 if (TREE_VEC_ELT (t1
, 0) == id
)
2477 if (free_binding_vecs
)
2479 binding
= free_binding_vecs
;
2480 free_binding_vecs
= TREE_CHAIN (free_binding_vecs
);
2483 binding
= make_tree_vec (4);
2487 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
2488 TREE_VEC_ELT (binding
, 0) = id
;
2489 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
2490 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_BINDING (id
);
2491 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
2492 IDENTIFIER_BINDING (id
) = NULL_TREE
;
2493 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
2495 TREE_CHAIN (binding
) = old_bindings
;
2496 old_bindings
= binding
;
2500 return old_bindings
;
2504 maybe_push_to_top_level (pseudo
)
2507 extern int current_lang_stacksize
;
2508 struct saved_scope
*s
2509 = (struct saved_scope
*) xmalloc (sizeof (struct saved_scope
));
2510 struct binding_level
*b
= current_binding_level
;
2511 tree old_bindings
= NULL_TREE
;
2513 push_cp_function_context (NULL_TREE
);
2515 if (previous_class_type
)
2516 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
2518 /* Have to include global_binding_level, because class-level decls
2519 aren't listed anywhere useful. */
2520 for (; b
; b
= b
->level_chain
)
2524 /* Template IDs are inserted into the global level. If they were
2525 inserted into namespace level, finish_file wouldn't find them
2526 when doing pending instantiations. Therefore, don't stop at
2527 namespace level, but continue until :: . */
2528 if (b
== global_binding_level
|| (pseudo
&& b
->pseudo_global
))
2531 old_bindings
= store_bindings (b
->names
, old_bindings
);
2532 /* We also need to check class_shadowed to save class-level type
2533 bindings, since pushclass doesn't fill in b->names. */
2534 if (b
->parm_flag
== 2)
2535 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2537 /* Unwind type-value slots back to top level. */
2538 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2539 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2542 s
->old_binding_level
= current_binding_level
;
2543 current_binding_level
= b
;
2545 s
->old_namespace
= current_namespace
;
2546 s
->class_name
= current_class_name
;
2547 s
->class_type
= current_class_type
;
2548 s
->access_specifier
= current_access_specifier
;
2549 s
->function_decl
= current_function_decl
;
2550 s
->class_bindings
= class_binding_level
;
2551 s
->lang_stack
= current_lang_stack
;
2552 s
->lang_base
= current_lang_base
;
2553 s
->lang_stacksize
= current_lang_stacksize
;
2554 s
->lang_name
= current_lang_name
;
2555 s
->last_function_parms
= last_function_parms
;
2556 s
->template_parms
= current_template_parms
;
2557 s
->processing_template_decl
= processing_template_decl
;
2558 s
->previous_class_type
= previous_class_type
;
2559 s
->previous_class_values
= previous_class_values
;
2560 s
->class_cache_firstobj
= class_cache_firstobj
;
2561 s
->processing_specialization
= processing_specialization
;
2562 s
->processing_explicit_instantiation
= processing_explicit_instantiation
;
2564 current_class_name
= current_class_type
= NULL_TREE
;
2565 current_function_decl
= NULL_TREE
;
2566 class_binding_level
= (struct binding_level
*)0;
2567 current_lang_stacksize
= 10;
2568 current_lang_stack
= current_lang_base
2569 = (tree
*) xmalloc (current_lang_stacksize
* sizeof (tree
));
2570 current_lang_name
= lang_name_cplusplus
;
2571 strict_prototype
= strict_prototypes_lang_cplusplus
;
2572 named_labels
= NULL_TREE
;
2573 previous_class_type
= previous_class_values
= NULL_TREE
;
2574 class_cache_firstobj
= 0;
2575 processing_specialization
= 0;
2576 processing_explicit_instantiation
= 0;
2577 current_template_parms
= NULL_TREE
;
2578 processing_template_decl
= 0;
2579 current_namespace
= global_namespace
;
2581 s
->prev
= current_saved_scope
;
2582 s
->old_bindings
= old_bindings
;
2583 current_saved_scope
= s
;
2585 push_obstacks (&permanent_obstack
, &permanent_obstack
);
2589 push_to_top_level ()
2591 maybe_push_to_top_level (0);
2595 pop_from_top_level ()
2597 extern int current_lang_stacksize
;
2598 struct saved_scope
*s
= current_saved_scope
;
2601 /* Clear out class-level bindings cache. */
2602 if (previous_class_type
)
2603 invalidate_class_lookup_cache ();
2607 current_binding_level
= s
->old_binding_level
;
2608 current_saved_scope
= s
->prev
;
2609 for (t
= s
->old_bindings
; t
; )
2612 tree id
= TREE_VEC_ELT (t
, 0);
2615 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2616 IDENTIFIER_BINDING (id
) = TREE_VEC_ELT (t
, 2);
2617 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2620 TREE_CHAIN (save
) = free_binding_vecs
;
2621 free_binding_vecs
= save
;
2623 current_namespace
= s
->old_namespace
;
2624 current_class_name
= s
->class_name
;
2625 current_class_type
= s
->class_type
;
2626 current_access_specifier
= s
->access_specifier
;
2627 current_function_decl
= s
->function_decl
;
2628 class_binding_level
= s
->class_bindings
;
2629 free (current_lang_base
);
2630 current_lang_base
= s
->lang_base
;
2631 current_lang_stack
= s
->lang_stack
;
2632 current_lang_name
= s
->lang_name
;
2633 current_lang_stacksize
= s
->lang_stacksize
;
2634 if (current_lang_name
== lang_name_cplusplus
)
2635 strict_prototype
= strict_prototypes_lang_cplusplus
;
2636 else if (current_lang_name
== lang_name_c
)
2637 strict_prototype
= strict_prototypes_lang_c
;
2638 last_function_parms
= s
->last_function_parms
;
2639 current_template_parms
= s
->template_parms
;
2640 processing_template_decl
= s
->processing_template_decl
;
2641 previous_class_type
= s
->previous_class_type
;
2642 previous_class_values
= s
->previous_class_values
;
2643 processing_specialization
= s
->processing_specialization
;
2644 processing_explicit_instantiation
= s
->processing_explicit_instantiation
;
2645 class_cache_firstobj
= s
->class_cache_firstobj
;
2649 pop_cp_function_context (NULL_TREE
);
2652 /* Push a definition of struct, union or enum tag "name".
2653 into binding_level "b". "type" should be the type node,
2654 We assume that the tag "name" is not already defined.
2656 Note that the definition may really be just a forward reference.
2657 In that case, the TYPE_SIZE will be a NULL_TREE.
2659 C++ gratuitously puts all these tags in the name space. */
2661 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2662 record the shadowed value for this binding contour. TYPE is
2663 the type that ID maps to. */
2666 set_identifier_type_value_with_scope (id
, type
, b
)
2669 struct binding_level
*b
;
2671 if (!b
->namespace_p
)
2673 /* Shadow the marker, not the real thing, so that the marker
2674 gets restored later. */
2675 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2677 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2681 tree binding
= binding_for_name (id
, current_namespace
);
2682 BINDING_TYPE (binding
) = type
;
2683 /* Store marker instead of real type. */
2684 type
= global_type_node
;
2686 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2689 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2692 set_identifier_type_value (id
, type
)
2696 set_identifier_type_value_with_scope (id
, type
, current_binding_level
);
2699 /* Return the type associated with id. */
2702 identifier_type_value (id
)
2705 /* There is no type with that name, anywhere. */
2706 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2708 /* This is not the type marker, but the real thing. */
2709 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2710 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2711 /* Have to search for it. It must be on the global level, now.
2712 Ask lookup_name not to return non-types. */
2713 id
= lookup_name_real (id
, 2, 1, 0);
2715 return TREE_TYPE (id
);
2719 /* Pop off extraneous binding levels left over due to syntax errors.
2721 We don't pop past namespaces, as they might be valid. */
2726 #ifdef DEBUG_CP_BINDING_LEVELS
2727 fprintf (stderr
, "XXX entering pop_everything ()\n");
2729 while (!toplevel_bindings_p ())
2731 if (current_binding_level
->parm_flag
== 2)
2732 pop_nested_class ();
2736 #ifdef DEBUG_CP_BINDING_LEVELS
2737 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2741 /* The type TYPE is being declared. If it is a class template, or a
2742 specialization of a class template, do any processing required and
2743 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2744 being declared a friend. B is the binding level at which this TYPE
2747 Returns the TYPE_DECL for TYPE, which may have been altered by this
2751 maybe_process_template_type_declaration (type
, globalize
, b
)
2754 struct binding_level
* b
;
2756 tree decl
= TYPE_NAME (type
);
2758 if (processing_template_parmlist
)
2759 /* You can't declare a new template type in a template parameter
2760 list. But, you can declare a non-template type:
2762 template <class A*> struct S;
2764 is a forward-declaration of `A'. */
2768 maybe_check_template_type (type
);
2770 my_friendly_assert (IS_AGGR_TYPE (type
)
2771 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2774 if (processing_template_decl
)
2776 /* This may change after the call to
2777 push_template_decl_real, but we want the original value. */
2778 tree name
= DECL_NAME (decl
);
2780 decl
= push_template_decl_real (decl
, globalize
);
2781 /* If the current binding level is the binding level for the
2782 template parameters (see the comment in
2783 begin_template_parm_list) and the enclosing level is a class
2784 scope, and we're not looking at a friend, push the
2785 declaration of the member class into the class scope. In the
2786 friend case, push_template_decl will already have put the
2787 friend into global scope, if appropriate. */
2788 if (TREE_CODE (type
) != ENUMERAL_TYPE
2789 && !globalize
&& b
->pseudo_global
2790 && b
->level_chain
->parm_flag
== 2)
2792 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2793 /* Put this tag on the list of tags for the class, since
2794 that won't happen below because B is not the class
2795 binding level, but is instead the pseudo-global level. */
2796 b
->level_chain
->tags
=
2797 saveable_tree_cons (name
, type
, b
->level_chain
->tags
);
2798 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2799 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2807 /* In C++, you don't have to write `struct S' to refer to `S'; you
2808 can just use `S'. We accomplish this by creating a TYPE_DECL as
2809 if the user had written `typedef struct S S'. Create and return
2810 the TYPE_DECL for TYPE. */
2813 create_implicit_typedef (name
, type
)
2819 decl
= build_decl (TYPE_DECL
, name
, type
);
2820 SET_DECL_ARTIFICIAL (decl
);
2821 /* There are other implicit type declarations, like the one *within*
2822 a class that allows you to write `S::S'. We must distinguish
2824 SET_DECL_IMPLICIT_TYPEDEF_P (decl
);
2825 TYPE_NAME (type
) = decl
;
2830 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2831 Normally put it into the inner-most non-tag-transparent scope,
2832 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2833 The latter is needed for implicit declarations. */
2836 pushtag (name
, type
, globalize
)
2840 register struct binding_level
*b
;
2842 b
= current_binding_level
;
2843 while (b
->tag_transparent
2844 || (globalize
&& b
->parm_flag
== 2))
2847 if (toplevel_bindings_p ())
2848 b
->tags
= perm_tree_cons (name
, type
, b
->tags
);
2850 b
->tags
= saveable_tree_cons (name
, type
, b
->tags
);
2854 /* Do C++ gratuitous typedefing. */
2855 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2857 register tree d
= NULL_TREE
;
2859 tree context
= TYPE_CONTEXT (type
);
2863 tree cs
= current_scope ();
2867 else if (cs
!= NULL_TREE
2868 && TREE_CODE_CLASS (TREE_CODE (cs
)) == 't')
2869 /* When declaring a friend class of a local class, we want
2870 to inject the newly named class into the scope
2871 containing the local class, not the namespace scope. */
2872 context
= hack_decl_function_context (get_type_decl (cs
));
2875 context
= current_namespace
;
2877 if ((b
->pseudo_global
&& b
->level_chain
->parm_flag
== 2)
2878 || b
->parm_flag
== 2)
2881 if (current_lang_name
== lang_name_java
)
2882 TYPE_FOR_JAVA (type
) = 1;
2884 d
= create_implicit_typedef (name
, type
);
2885 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2887 set_identifier_type_value_with_scope (name
, type
, b
);
2889 d
= maybe_process_template_type_declaration (type
,
2892 if (b
->parm_flag
== 2)
2894 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2895 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2896 class. But if it's a member template class, we
2897 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2899 finish_member_declaration (d
);
2901 pushdecl_class_level (d
);
2904 d
= pushdecl_with_scope (d
, b
);
2906 if (ANON_AGGRNAME_P (name
))
2907 DECL_IGNORED_P (d
) = 1;
2909 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2910 DECL_ASSEMBLER_NAME (d
) = DECL_NAME (d
);
2911 if (!uses_template_parms (type
))
2912 DECL_ASSEMBLER_NAME (d
)
2913 = get_identifier (build_overload_name (type
, 1, 1));
2915 if (b
->parm_flag
== 2)
2917 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2918 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2922 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2923 /* Use the canonical TYPE_DECL for this node. */
2924 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2927 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2928 will be the tagged type we just added to the current
2929 binding level. This fake NULL-named TYPE_DECL node helps
2930 dwarfout.c to know when it needs to output a
2931 representation of a tagged type, and it also gives us a
2932 convenient place to record the "scope start" address for
2935 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2936 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2940 /* Counter used to create anonymous type names. */
2942 static int anon_cnt
= 0;
2944 /* Return an IDENTIFIER which can be used as a name for
2945 anonymous structs and unions. */
2952 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2953 return get_identifier (buf
);
2956 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2957 This keeps dbxout from getting confused. */
2962 register struct binding_level
*b
;
2964 static int last_cnt
= 0;
2966 /* Fast out if no new anon names were declared. */
2967 if (last_cnt
== anon_cnt
)
2970 b
= current_binding_level
;
2971 while (b
->tag_transparent
)
2976 /* A NULL purpose means we have already processed all tags
2977 from here to the end of the list. */
2978 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2980 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2981 TREE_PURPOSE (tags
) = NULL_TREE
;
2982 tags
= TREE_CHAIN (tags
);
2984 last_cnt
= anon_cnt
;
2987 /* Subroutine of duplicate_decls: return truthvalue of whether
2988 or not types of these decls match.
2990 For C++, we must compare the parameter list so that `int' can match
2991 `int&' in a parameter position, but `int&' is not confused with
2995 decls_match (newdecl
, olddecl
)
2996 tree newdecl
, olddecl
;
3000 if (newdecl
== olddecl
)
3003 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
3004 /* If the two DECLs are not even the same kind of thing, we're not
3005 interested in their types. */
3008 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3010 tree f1
= TREE_TYPE (newdecl
);
3011 tree f2
= TREE_TYPE (olddecl
);
3012 tree p1
= TYPE_ARG_TYPES (f1
);
3013 tree p2
= TYPE_ARG_TYPES (f2
);
3015 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
)
3016 && ! (DECL_LANGUAGE (newdecl
) == lang_c
3017 && DECL_LANGUAGE (olddecl
) == lang_c
))
3020 /* When we parse a static member function definition,
3021 we put together a FUNCTION_DECL which thinks its type
3022 is METHOD_TYPE. Change that to FUNCTION_TYPE, and
3024 if (TREE_CODE (f1
) == METHOD_TYPE
&& DECL_STATIC_FUNCTION_P (olddecl
))
3025 revert_static_member_fn (&newdecl
, &f1
, &p1
);
3026 else if (TREE_CODE (f2
) == METHOD_TYPE
3027 && DECL_STATIC_FUNCTION_P (newdecl
))
3028 revert_static_member_fn (&olddecl
, &f2
, &p2
);
3030 /* Here we must take care of the case where new default
3031 parameters are specified. Also, warn if an old
3032 declaration becomes ambiguous because default
3033 parameters may cause the two to be ambiguous. */
3034 if (TREE_CODE (f1
) != TREE_CODE (f2
))
3036 if (TREE_CODE (f1
) == OFFSET_TYPE
)
3037 cp_compiler_error ("`%D' redeclared as member function", newdecl
);
3039 cp_compiler_error ("`%D' redeclared as non-member function", newdecl
);
3043 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
3045 if (! strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
) == lang_c
3048 types_match
= self_promoting_args_p (p1
);
3049 if (p1
== void_list_node
)
3050 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
3052 else if (!strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
)==lang_c
3053 && DECL_LANGUAGE (newdecl
) == lang_c
&& p1
== NULL_TREE
)
3055 types_match
= self_promoting_args_p (p2
);
3056 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
3059 types_match
= compparms (p1
, p2
);
3064 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3066 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3067 DECL_TEMPLATE_PARMS (olddecl
)))
3070 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3073 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
3074 DECL_TEMPLATE_RESULT (newdecl
));
3078 if (TREE_TYPE (newdecl
) == error_mark_node
)
3079 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
3080 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
3081 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
3082 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
3085 types_match
= comptypes (TREE_TYPE (newdecl
),
3086 TREE_TYPE (olddecl
),
3087 COMPARE_REDECLARATION
);
3093 /* If NEWDECL is `static' and an `extern' was seen previously,
3094 warn about it. (OLDDECL may be NULL_TREE; NAME contains
3095 information about previous usage as an `extern'.)
3097 Note that this does not apply to the C++ case of declaring
3098 a variable `extern const' and then later `const'.
3100 Don't complain about built-in functions, since they are beyond
3101 the user's control. */
3104 warn_extern_redeclared_static (newdecl
, olddecl
)
3105 tree newdecl
, olddecl
;
3109 static const char *explicit_extern_static_warning
3110 = "`%D' was declared `extern' and later `static'";
3111 static const char *implicit_extern_static_warning
3112 = "`%D' was declared implicitly `extern' and later `static'";
3114 if (TREE_CODE (newdecl
) == TYPE_DECL
)
3117 name
= DECL_ASSEMBLER_NAME (newdecl
);
3118 if (TREE_PUBLIC (name
) && DECL_THIS_STATIC (newdecl
))
3120 /* It's okay to redeclare an ANSI built-in function as static,
3121 or to declare a non-ANSI built-in function as anything. */
3122 if (! (TREE_CODE (newdecl
) == FUNCTION_DECL
3123 && olddecl
!= NULL_TREE
3124 && TREE_CODE (olddecl
) == FUNCTION_DECL
3125 && DECL_ARTIFICIAL (olddecl
)))
3127 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
3128 ? implicit_extern_static_warning
3129 : explicit_extern_static_warning
, newdecl
);
3130 if (olddecl
!= NULL_TREE
)
3131 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
3136 /* Handle when a new declaration NEWDECL has the same name as an old
3137 one OLDDECL in the same binding contour. Prints an error message
3140 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
3141 Otherwise, return 0. */
3144 duplicate_decls (newdecl
, olddecl
)
3145 tree newdecl
, olddecl
;
3147 extern struct obstack permanent_obstack
;
3148 unsigned olddecl_uid
= DECL_UID (olddecl
);
3149 int olddecl_friend
= 0, types_match
= 0;
3150 int new_defines_function
= 0;
3152 if (newdecl
== olddecl
)
3155 types_match
= decls_match (newdecl
, olddecl
);
3157 /* If either the type of the new decl or the type of the old decl is an
3158 error_mark_node, then that implies that we have already issued an
3159 error (earlier) for some bogus type specification, and in that case,
3160 it is rather pointless to harass the user with yet more error message
3161 about the same declaration, so just pretend the types match here. */
3162 if (TREE_TYPE (newdecl
) == error_mark_node
3163 || TREE_TYPE (olddecl
) == error_mark_node
)
3166 /* Check for redeclaration and other discrepancies. */
3167 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3168 && DECL_ARTIFICIAL (olddecl
))
3170 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
3172 /* If you declare a built-in or predefined function name as static,
3173 the old definition is overridden, but optionally warn this was a
3174 bad choice of name. */
3175 if (! TREE_PUBLIC (newdecl
))
3178 cp_warning ("shadowing %s function `%#D'",
3179 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3181 /* Discard the old built-in function. */
3184 /* If the built-in is not ansi, then programs can override
3185 it even globally without an error. */
3186 else 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'",
3197 else if (!types_match
)
3199 if ((DECL_LANGUAGE (newdecl
) == lang_c
3200 && DECL_LANGUAGE (olddecl
) == lang_c
)
3201 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3202 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3204 /* A near match; override the builtin. */
3206 if (TREE_PUBLIC (newdecl
))
3208 cp_warning ("new declaration `%#D'", newdecl
);
3209 cp_warning ("ambiguates built-in declaration `%#D'",
3212 else if (warn_shadow
)
3213 cp_warning ("shadowing %s function `%#D'",
3214 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3218 /* Discard the old built-in function. */
3222 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3224 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3225 && TREE_CODE (newdecl
) != TYPE_DECL
3226 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3227 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3228 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3229 && TREE_CODE (olddecl
) != TYPE_DECL
3230 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3231 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3234 /* We do nothing special here, because C++ does such nasty
3235 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3236 get shadowed, and know that if we need to find a TYPE_DECL
3237 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3238 slot of the identifier. */
3242 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3243 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3244 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3245 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3248 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
3249 if (TREE_CODE (olddecl
) == TREE_LIST
)
3250 olddecl
= TREE_VALUE (olddecl
);
3251 cp_error_at ("previous declaration of `%#D'", olddecl
);
3253 /* New decl is completely inconsistent with the old one =>
3254 tell caller to replace the old one. */
3258 else if (!types_match
)
3260 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
))
3261 /* These are certainly not duplicate declarations; they're
3262 from different scopes. */
3265 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3267 /* The name of a class template may not be declared to refer to
3268 any other template, class, function, object, namespace, value,
3269 or type in the same scope. */
3270 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3271 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3273 cp_error ("declaration of template `%#D'", newdecl
);
3274 cp_error_at ("conflicts with previous declaration `%#D'",
3277 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3278 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3279 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3280 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3281 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3282 DECL_TEMPLATE_PARMS (olddecl
)))
3284 cp_error ("new declaration `%#D'", newdecl
);
3285 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3289 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3291 if (DECL_LANGUAGE (newdecl
) == lang_c
3292 && DECL_LANGUAGE (olddecl
) == lang_c
)
3294 cp_error ("declaration of C function `%#D' conflicts with",
3296 cp_error_at ("previous declaration `%#D' here", olddecl
);
3298 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3299 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3301 cp_error ("new declaration `%#D'", newdecl
);
3302 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3308 /* Already complained about this, so don't do so again. */
3309 else if (current_class_type
== NULL_TREE
3310 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3312 cp_error ("conflicting types for `%#D'", newdecl
);
3313 cp_error_at ("previous declaration as `%#D'", olddecl
);
3316 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3317 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3318 && (!DECL_TEMPLATE_INFO (newdecl
)
3319 || (DECL_TI_TEMPLATE (newdecl
)
3320 != DECL_TI_TEMPLATE (olddecl
))))
3321 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3322 && (!DECL_TEMPLATE_INFO (olddecl
)
3323 || (DECL_TI_TEMPLATE (olddecl
)
3324 != DECL_TI_TEMPLATE (newdecl
))))))
3325 /* It's OK to have a template specialization and a non-template
3326 with the same type, or to have specializations of two
3327 different templates with the same type. Note that if one is a
3328 specialization, and the other is an instantiation of the same
3329 template, that we do not exit at this point. That situation
3330 can occur if we instantiate a template class, and then
3331 specialize one of its methods. This situation is legal, but
3332 the declarations must be merged in the usual way. */
3334 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3335 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3336 && !DECL_USE_TEMPLATE (newdecl
))
3337 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3338 && !DECL_USE_TEMPLATE (olddecl
))))
3339 /* One of the declarations is a template instantiation, and the
3340 other is not a template at all. That's OK. */
3342 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3343 && DECL_NAMESPACE_ALIAS (newdecl
)
3344 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3345 /* Redeclaration of namespace alias, ignore it. */
3349 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3352 cp_error (errmsg
, newdecl
);
3353 if (DECL_NAME (olddecl
) != NULL_TREE
)
3354 cp_error_at ((DECL_INITIAL (olddecl
)
3355 && namespace_bindings_p ())
3356 ? "`%#D' previously defined here"
3357 : "`%#D' previously declared here", olddecl
);
3359 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3360 && DECL_INITIAL (olddecl
) != NULL_TREE
3361 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3362 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3364 /* Prototype decl follows defn w/o prototype. */
3365 cp_warning_at ("prototype for `%#D'", newdecl
);
3366 cp_warning_at ("follows non-prototype definition here", olddecl
);
3368 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3369 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3371 /* extern "C" int foo ();
3372 int foo () { bar (); }
3374 if (current_lang_stack
== current_lang_base
)
3375 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3378 cp_error_at ("previous declaration of `%#D' with %L linkage",
3379 olddecl
, DECL_LANGUAGE (olddecl
));
3380 cp_error ("conflicts with new declaration with %L linkage",
3381 DECL_LANGUAGE (newdecl
));
3385 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3387 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3389 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3390 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3393 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3394 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3396 for (; t1
&& t1
!= void_list_node
;
3397 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3398 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3400 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3405 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3407 cp_pedwarn_at ("after previous specification in `%#D'",
3413 cp_error ("default argument given for parameter %d of `%#D'",
3415 cp_error_at ("after previous specification in `%#D'",
3420 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
3421 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3423 cp_warning ("`%#D' was used before it was declared inline",
3425 cp_warning_at ("previous non-inline declaration here",
3431 /* If new decl is `static' and an `extern' was seen previously,
3433 warn_extern_redeclared_static (newdecl
, olddecl
);
3435 /* We have committed to returning 1 at this point. */
3436 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3438 /* Now that functions must hold information normally held
3439 by field decls, there is extra work to do so that
3440 declaration information does not get destroyed during
3442 if (DECL_VINDEX (olddecl
))
3443 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3444 if (DECL_CONTEXT (olddecl
))
3445 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3446 if (DECL_CLASS_CONTEXT (olddecl
))
3447 DECL_CLASS_CONTEXT (newdecl
) = DECL_CLASS_CONTEXT (olddecl
);
3448 if (DECL_PENDING_INLINE_INFO (newdecl
) == (struct pending_inline
*)0)
3449 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3450 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3451 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3452 DECL_ABSTRACT_VIRTUAL_P (newdecl
) |= DECL_ABSTRACT_VIRTUAL_P (olddecl
);
3453 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3454 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3455 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3457 /* Optionally warn about more than one declaration for the same
3458 name, but don't warn about a function declaration followed by a
3460 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3461 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3462 /* Don't warn about extern decl followed by definition. */
3463 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3464 /* Don't warn about friends, let add_friend take care of it. */
3465 && ! DECL_FRIEND_P (newdecl
))
3467 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3468 cp_warning_at ("previous declaration of `%D'", olddecl
);
3472 /* Deal with C++: must preserve virtual function table size. */
3473 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3475 register tree newtype
= TREE_TYPE (newdecl
);
3476 register tree oldtype
= TREE_TYPE (olddecl
);
3478 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3479 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3481 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3482 CLASSTYPE_FRIEND_CLASSES (newtype
)
3483 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3487 /* Copy all the DECL_... slots specified in the new decl
3488 except for any that we copy here from the old type. */
3489 DECL_MACHINE_ATTRIBUTES (newdecl
)
3490 = merge_machine_decl_attributes (olddecl
, newdecl
);
3492 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3494 if (! duplicate_decls (DECL_TEMPLATE_RESULT (newdecl
),
3495 DECL_TEMPLATE_RESULT (olddecl
)))
3496 cp_error ("invalid redeclaration of %D", newdecl
);
3497 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3498 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3499 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3500 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3507 /* Automatically handles default parameters. */
3508 tree oldtype
= TREE_TYPE (olddecl
);
3511 /* Make sure we put the new type in the same obstack as the old one. */
3513 push_obstacks (TYPE_OBSTACK (oldtype
), TYPE_OBSTACK (oldtype
));
3515 push_permanent_obstack ();
3517 /* Merge the data types specified in the two decls. */
3518 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3520 if (TREE_CODE (newdecl
) == VAR_DECL
)
3521 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3522 /* Do this after calling `common_type' so that default
3523 parameters don't confuse us. */
3524 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3525 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3526 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3528 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3529 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3530 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3531 TYPE_RAISES_EXCEPTIONS (oldtype
));
3533 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3534 && DECL_SOURCE_LINE (olddecl
) != 0
3536 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
3537 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
3539 cp_error ("declaration of `%F' throws different exceptions",
3541 cp_error_at ("to previous declaration `%F'", olddecl
);
3544 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3546 /* Lay the type out, unless already done. */
3547 if (! same_type_p (newtype
, oldtype
)
3548 && TREE_TYPE (newdecl
) != error_mark_node
3549 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3550 layout_type (TREE_TYPE (newdecl
));
3552 if ((TREE_CODE (newdecl
) == VAR_DECL
3553 || TREE_CODE (newdecl
) == PARM_DECL
3554 || TREE_CODE (newdecl
) == RESULT_DECL
3555 || TREE_CODE (newdecl
) == FIELD_DECL
3556 || TREE_CODE (newdecl
) == TYPE_DECL
)
3557 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3558 layout_decl (newdecl
, 0);
3560 /* Merge the type qualifiers. */
3561 if (TREE_READONLY (newdecl
))
3562 TREE_READONLY (olddecl
) = 1;
3563 if (TREE_THIS_VOLATILE (newdecl
))
3564 TREE_THIS_VOLATILE (olddecl
) = 1;
3566 /* Merge the initialization information. */
3567 if (DECL_INITIAL (newdecl
) == NULL_TREE
3568 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3570 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3571 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3572 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3573 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
3574 && DECL_LANG_SPECIFIC (newdecl
)
3575 && DECL_LANG_SPECIFIC (olddecl
))
3576 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3579 /* Merge the section attribute.
3580 We want to issue an error if the sections conflict but that must be
3581 done later in decl_attributes since we are called before attributes
3583 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3584 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3586 /* Keep the old rtl since we can safely use it, unless it's the
3587 call to abort() used for abstract virtuals. */
3588 if ((DECL_LANG_SPECIFIC (olddecl
)
3589 && !DECL_ABSTRACT_VIRTUAL_P (olddecl
))
3590 || DECL_RTL (olddecl
) != DECL_RTL (abort_fndecl
))
3591 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3595 /* If cannot merge, then use the new type and qualifiers,
3596 and don't preserve the old rtl. */
3599 /* Clean out any memory we had of the old declaration. */
3600 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3602 TREE_VALUE (oldstatic
) = error_mark_node
;
3604 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3605 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3606 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3607 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3610 /* Merge the storage class information. */
3611 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3612 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3613 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3614 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3615 if (! DECL_EXTERNAL (olddecl
))
3616 DECL_EXTERNAL (newdecl
) = 0;
3618 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3620 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3621 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3622 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3623 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3624 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3625 /* Don't really know how much of the language-specific
3626 values we should copy from old to new. */
3627 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3628 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3629 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3630 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3631 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3633 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3634 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3635 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3636 DECL_BEFRIENDING_CLASSES (newdecl
)
3637 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3638 DECL_BEFRIENDING_CLASSES (olddecl
));
3641 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3643 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3644 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3646 /* If newdecl is not a specialization, then it is not a
3647 template-related function at all. And that means that we
3648 shoud have exited above, returning 0. */
3649 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3652 if (TREE_USED (olddecl
))
3653 /* From [temp.expl.spec]:
3655 If a template, a member template or the member of a class
3656 template is explicitly specialized then that
3657 specialization shall be declared before the first use of
3658 that specialization that would cause an implicit
3659 instantiation to take place, in every translation unit in
3660 which such a use occurs. */
3661 cp_error ("explicit specialization of %D after first use",
3664 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3666 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3668 /* If either decl says `inline', this fn is inline, unless its
3669 definition was passed already. */
3670 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3671 DECL_INLINE (olddecl
) = 1;
3672 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3676 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3677 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3678 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3680 if (! types_match
|| new_defines_function
)
3682 /* These need to be copied so that the names are available.
3683 Note that if the types do match, we'll preserve inline
3684 info and other bits, but if not, we won't. */
3685 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3686 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3688 if (new_defines_function
)
3689 /* If defining a function declared with other language
3690 linkage, use the previously declared language linkage. */
3691 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3692 else if (types_match
)
3694 /* If redeclaring a builtin function, and not a definition,
3695 it stays built in. */
3696 if (DECL_BUILT_IN (olddecl
))
3698 DECL_BUILT_IN (newdecl
) = 1;
3699 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3700 /* If we're keeping the built-in definition, keep the rtl,
3701 regardless of declaration matches. */
3702 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3705 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3707 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3708 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3709 /* Previously saved insns go together with
3710 the function's previous definition. */
3711 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3712 /* Don't clear out the arguments if we're redefining a function. */
3713 if (DECL_ARGUMENTS (olddecl
))
3714 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3716 if (DECL_LANG_SPECIFIC (olddecl
))
3717 DECL_MAIN_VARIANT (newdecl
) = DECL_MAIN_VARIANT (olddecl
);
3720 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3722 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3725 /* Now preserve various other info from the definition. */
3726 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3727 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3728 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3729 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3731 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3734 struct lang_decl
*ol
= DECL_LANG_SPECIFIC (olddecl
);
3735 struct lang_decl
*nl
= DECL_LANG_SPECIFIC (newdecl
);
3737 function_size
= sizeof (struct tree_decl
);
3739 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3740 (char *) olddecl
+ sizeof (struct tree_common
),
3741 function_size
- sizeof (struct tree_common
));
3743 /* Can we safely free the storage used by newdecl? */
3745 #define ROUND(x) ((x + obstack_alignment_mask (&permanent_obstack)) \
3746 & ~ obstack_alignment_mask (&permanent_obstack))
3748 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3750 /* If newdecl is a template instantiation, it is possible that
3751 the following sequence of events has occurred:
3753 o A friend function was declared in a class template. The
3754 class template was instantiated.
3756 o The instantiation of the friend declaration was
3757 recorded on the instantiation list, and is newdecl.
3759 o Later, however, instantiate_class_template called pushdecl
3760 on the newdecl to perform name injection. But, pushdecl in
3761 turn called duplicate_decls when it discovered that another
3762 declaration of a global function with the same name already
3765 o Here, in duplicate_decls, we decided to clobber newdecl.
3767 If we're going to do that, we'd better make sure that
3768 olddecl, and not newdecl, is on the list of
3769 instantiations so that if we try to do the instantiation
3770 again we won't get the clobbered declaration. */
3772 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3773 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3775 for (; decls
; decls
= TREE_CHAIN (decls
))
3776 if (TREE_VALUE (decls
) == newdecl
)
3777 TREE_VALUE (decls
) = olddecl
;
3780 if (((char *)newdecl
+ ROUND (function_size
) == (char *)nl
3781 && ((char *)newdecl
+ ROUND (function_size
)
3782 + ROUND (sizeof (struct lang_decl
))
3783 == obstack_next_free (&permanent_obstack
)))
3784 || ((char *)newdecl
+ ROUND (function_size
)
3785 == obstack_next_free (&permanent_obstack
)))
3787 DECL_MAIN_VARIANT (newdecl
) = olddecl
;
3788 DECL_LANG_SPECIFIC (olddecl
) = ol
;
3789 bcopy ((char *)nl
, (char *)ol
, sizeof (struct lang_decl
));
3791 obstack_free (&permanent_obstack
, newdecl
);
3793 else if (LANG_DECL_PERMANENT (ol
) && ol
!= nl
)
3795 if (DECL_MAIN_VARIANT (olddecl
) == olddecl
)
3797 struct lang_decl
*free_lang_decl
= ol
;
3799 /* Save these lang_decls that would otherwise be lost. */
3800 if (DECL_LANG_SPECIFIC (olddecl
) == ol
)
3803 free_lang_decl
->u
.next
= free_lang_decl_chain
;
3804 free_lang_decl_chain
= free_lang_decl
;
3808 /* Storage leak. */;
3814 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3815 (char *) olddecl
+ sizeof (struct tree_common
),
3816 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3817 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3820 DECL_UID (olddecl
) = olddecl_uid
;
3822 DECL_FRIEND_P (olddecl
) = 1;
3824 /* NEWDECL contains the merged attribute lists.
3825 Update OLDDECL to be the same. */
3826 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3831 /* Record a decl-node X as belonging to the current lexical scope.
3832 Check for errors (such as an incompatible declaration for the same
3833 name already seen in the same scope).
3835 Returns either X or an old decl for the same name.
3836 If an old decl is returned, it may have been smashed
3837 to agree with what X says. */
3844 register tree name
= DECL_ASSEMBLER_NAME (x
);
3845 int need_new_binding
= 1;
3847 if (DECL_TEMPLATE_PARM_P (x
))
3848 /* Template parameters have no context; they are not X::T even
3849 when declared within a class or namespace. */
3853 if (current_function_decl
&& x
!= current_function_decl
3854 /* A local declaration for a function doesn't constitute
3856 && (TREE_CODE (x
) != FUNCTION_DECL
|| DECL_INITIAL (x
))
3857 /* Don't change DECL_CONTEXT of virtual methods. */
3858 && (TREE_CODE (x
) != FUNCTION_DECL
|| !DECL_VIRTUAL_P (x
))
3859 && !DECL_CONTEXT (x
))
3860 DECL_CONTEXT (x
) = current_function_decl
;
3861 if (!DECL_CONTEXT (x
))
3862 DECL_CONTEXT (x
) = FROB_CONTEXT (current_namespace
);
3865 /* Type are looked up using the DECL_NAME, as that is what the rest of the
3866 compiler wants to use. */
3867 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
3868 || TREE_CODE (x
) == NAMESPACE_DECL
)
3869 name
= DECL_NAME (x
);
3874 /* Not needed...see below. */
3878 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3879 name
= TREE_OPERAND (name
, 0);
3881 /* Namespace-scoped variables are not found in the current level. */
3882 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
))
3883 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3885 t
= lookup_name_current_level (name
);
3886 if (t
== error_mark_node
)
3888 /* error_mark_node is 0 for a while during initialization! */
3890 cp_error_at ("`%#D' used prior to declaration", x
);
3893 else if (t
!= NULL_TREE
)
3896 /* This is turned off until I have time to do it right (bpk). */
3897 /* With the code below that uses it... */
3898 file
= DECL_SOURCE_FILE (t
);
3899 line
= DECL_SOURCE_LINE (t
);
3901 if (TREE_CODE (t
) == PARM_DECL
)
3903 if (DECL_CONTEXT (t
) == NULL_TREE
)
3904 fatal ("parse errors have confused me too much");
3906 /* Check for duplicate params. */
3907 if (duplicate_decls (x
, t
))
3910 else if (((TREE_CODE (x
) == FUNCTION_DECL
&& DECL_LANGUAGE (x
) == lang_c
)
3911 || DECL_FUNCTION_TEMPLATE_P (x
))
3912 && is_overloaded_fn (t
))
3913 /* Don't do anything just yet. */;
3914 else if (t
== wchar_decl_node
)
3916 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3917 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3919 /* Throw away the redeclaration. */
3922 else if (TREE_CODE (t
) != TREE_CODE (x
))
3924 if (duplicate_decls (x
, t
))
3927 else if (duplicate_decls (x
, t
))
3930 /* This is turned off until I have time to do it right (bpk). */
3932 /* Also warn if they did a prototype with `static' on it, but
3933 then later left the `static' off. */
3934 if (! TREE_PUBLIC (name
) && TREE_PUBLIC (x
))
3936 if (DECL_LANG_SPECIFIC (t
) && DECL_FRIEND_P (t
))
3941 cp_warning ("`static' missing from declaration of `%D'",
3943 warning_with_file_and_line (file
, line
,
3944 "previous declaration of `%s'",
3945 decl_as_string (t
, 0));
3948 /* Now fix things so it'll do what they expect. */
3949 if (current_function_decl
)
3950 TREE_PUBLIC (current_function_decl
) = 0;
3952 /* Due to interference in memory reclamation (X may be
3953 obstack-deallocated at this point), we must guard against
3954 one really special case. [jason: This should be handled
3955 by start_function] */
3956 if (current_function_decl
== x
)
3957 current_function_decl
= t
;
3959 if (TREE_CODE (t
) == TYPE_DECL
)
3960 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3961 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3962 check_default_args (t
);
3966 else if (DECL_MAIN_P (x
))
3968 /* A redeclaration of main, but not a duplicate of the
3973 This function shall not be overloaded. */
3974 cp_error_at ("invalid redeclaration of `%D'", t
);
3975 cp_error ("as `%D'", x
);
3976 /* We don't try to push this declaration since that
3982 check_template_shadow (x
);
3984 /* If this is a function conjured up by the backend, massage it
3985 so it looks friendly. */
3986 if (TREE_CODE (x
) == FUNCTION_DECL
3987 && ! DECL_LANG_SPECIFIC (x
))
3989 retrofit_lang_decl (x
);
3990 DECL_LANGUAGE (x
) = lang_c
;
3993 if (TREE_CODE (x
) == FUNCTION_DECL
&& ! DECL_FUNCTION_MEMBER_P (x
))
3995 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
3996 if (t
!= x
|| DECL_LANGUAGE (x
) == lang_c
)
3998 if (!namespace_bindings_p ())
3999 /* We do not need to create a binding for this name;
4000 push_overloaded_decl will have already done so if
4002 need_new_binding
= 0;
4004 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
4006 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
4008 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
4012 /* If declaring a type as a typedef, copy the type (unless we're
4013 at line 0), and install this TYPE_DECL as the new type's typedef
4014 name. See the extensive comment in ../c-decl.c (pushdecl). */
4015 if (TREE_CODE (x
) == TYPE_DECL
)
4017 tree type
= TREE_TYPE (x
);
4018 if (DECL_SOURCE_LINE (x
) == 0)
4020 if (TYPE_NAME (type
) == 0)
4021 TYPE_NAME (type
) = x
;
4023 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
4024 /* We don't want to copy the type when all we're
4025 doing is making a TYPE_DECL for the purposes of
4027 && (!TYPE_NAME (type
)
4028 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
4030 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
4032 DECL_ORIGINAL_TYPE (x
) = type
;
4033 type
= build_type_copy (type
);
4034 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
4035 TYPE_NAME (type
) = x
;
4036 TREE_TYPE (x
) = type
;
4041 if (type
!= error_mark_node
4043 && TYPE_IDENTIFIER (type
))
4044 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
4045 current_binding_level
);
4049 /* Multiple external decls of the same identifier ought to match.
4051 We get warnings about inline functions where they are defined.
4052 We get warnings about other functions from push_overloaded_decl.
4054 Avoid duplicate warnings where they are used. */
4055 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
4059 if (IDENTIFIER_NAMESPACE_VALUE (name
) != NULL_TREE
4060 && (DECL_EXTERNAL (IDENTIFIER_NAMESPACE_VALUE (name
))
4061 || TREE_PUBLIC (IDENTIFIER_NAMESPACE_VALUE (name
))))
4062 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
4067 /* If different sort of thing, we already gave an error. */
4068 && TREE_CODE (decl
) == TREE_CODE (x
)
4069 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
4071 cp_pedwarn ("type mismatch with previous external decl", x
);
4072 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
4076 /* This name is new in its binding level.
4077 Install the new declaration and return it. */
4078 if (namespace_bindings_p ())
4080 /* Install a global value. */
4082 /* If the first global decl has external linkage,
4083 warn if we later see static one. */
4084 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
4085 TREE_PUBLIC (name
) = 1;
4087 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
4090 if (TREE_CODE (x
) == FUNCTION_DECL
)
4092 ((IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
)
4093 || (IDENTIFIER_GLOBAL_VALUE (name
) == x
), 378);
4094 SET_IDENTIFIER_NAMESPACE_VALUE (name
, x
);
4097 /* Don't forget if the function was used via an implicit decl. */
4098 if (IDENTIFIER_IMPLICIT_DECL (name
)
4099 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
4102 /* Don't forget if its address was taken in that way. */
4103 if (IDENTIFIER_IMPLICIT_DECL (name
)
4104 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
4105 TREE_ADDRESSABLE (x
) = 1;
4107 /* Warn about mismatches against previous implicit decl. */
4108 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
4109 /* If this real decl matches the implicit, don't complain. */
4110 && ! (TREE_CODE (x
) == FUNCTION_DECL
4111 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
4113 ("`%D' was previously implicitly declared to return `int'", x
);
4115 /* If new decl is `static' and an `extern' was seen previously,
4117 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
4118 warn_extern_redeclared_static (x
, t
);
4122 /* Here to install a non-global value. */
4123 tree oldlocal
= IDENTIFIER_VALUE (name
);
4124 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
4126 if (need_new_binding
)
4128 push_local_binding (name
, x
, 0);
4129 /* Because push_local_binding will hook X on to the
4130 current_binding_level's name list, we don't want to
4131 do that again below. */
4132 need_new_binding
= 0;
4135 /* If this is a TYPE_DECL, push it into the type value slot. */
4136 if (TREE_CODE (x
) == TYPE_DECL
)
4137 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
4138 current_binding_level
);
4140 /* Clear out any TYPE_DECL shadowed by a namespace so that
4141 we won't think this is a type. The C struct hack doesn't
4142 go through namespaces. */
4143 if (TREE_CODE (x
) == NAMESPACE_DECL
)
4144 set_identifier_type_value_with_scope (name
, NULL_TREE
,
4145 current_binding_level
);
4147 /* If this is an extern function declaration, see if we
4148 have a global definition or declaration for the function. */
4149 if (oldlocal
== NULL_TREE
4150 && DECL_EXTERNAL (x
)
4151 && oldglobal
!= NULL_TREE
4152 && TREE_CODE (x
) == FUNCTION_DECL
4153 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
4155 /* We have one. Their types must agree. */
4156 if (decls_match (x
, oldglobal
))
4160 cp_warning ("extern declaration of `%#D' doesn't match", x
);
4161 cp_warning_at ("global declaration `%#D'", oldglobal
);
4164 /* If we have a local external declaration,
4165 and no file-scope declaration has yet been seen,
4166 then if we later have a file-scope decl it must not be static. */
4167 if (oldlocal
== NULL_TREE
4168 && oldglobal
== NULL_TREE
4169 && DECL_EXTERNAL (x
)
4171 TREE_PUBLIC (name
) = 1;
4173 if (DECL_FROM_INLINE (x
))
4174 /* Inline decls shadow nothing. */;
4176 /* Warn if shadowing an argument at the top level of the body. */
4177 else if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
4178 && TREE_CODE (oldlocal
) == PARM_DECL
4179 /* Don't complain if it's from an enclosing function. */
4180 && DECL_CONTEXT (oldlocal
) == current_function_decl
4181 && TREE_CODE (x
) != PARM_DECL
)
4183 /* Go to where the parms should be and see if we
4185 struct binding_level
*b
= current_binding_level
->level_chain
;
4191 if (b
->parm_flag
== 1)
4192 cp_error ("declaration of `%#D' shadows a parameter", name
);
4194 else if (warn_shadow
&& oldlocal
!= NULL_TREE
4195 && current_binding_level
->is_for_scope
4196 && !DECL_DEAD_FOR_LOCAL (oldlocal
))
4198 warning ("variable `%s' shadows local",
4199 IDENTIFIER_POINTER (name
));
4200 cp_warning_at (" this is the shadowed declaration", oldlocal
);
4202 /* Maybe warn if shadowing something else. */
4203 else if (warn_shadow
&& !DECL_EXTERNAL (x
)
4204 /* No shadow warnings for internally generated vars. */
4205 && ! DECL_ARTIFICIAL (x
)
4206 /* No shadow warnings for vars made for inlining. */
4207 && ! DECL_FROM_INLINE (x
))
4209 const char *warnstring
= NULL
;
4211 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
4212 warnstring
= "declaration of `%s' shadows a parameter";
4213 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
4214 && current_class_ptr
4215 && !TREE_STATIC (name
))
4216 warnstring
= "declaration of `%s' shadows a member of `this'";
4217 else if (oldlocal
!= NULL_TREE
)
4218 warnstring
= "declaration of `%s' shadows previous local";
4219 else if (oldglobal
!= NULL_TREE
)
4220 /* XXX shadow warnings in outer-more namespaces */
4221 warnstring
= "declaration of `%s' shadows global declaration";
4224 warning (warnstring
, IDENTIFIER_POINTER (name
));
4228 if (TREE_CODE (x
) == FUNCTION_DECL
)
4229 check_default_args (x
);
4231 /* Keep count of variables in this level with incomplete type. */
4232 if (TREE_CODE (x
) == VAR_DECL
4233 && TREE_TYPE (x
) != error_mark_node
4234 && ((TYPE_SIZE (TREE_TYPE (x
)) == NULL_TREE
4235 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
4236 /* RTTI TD entries are created while defining the type_info. */
4237 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
4238 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
4239 current_binding_level
->incomplete
4240 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4243 if (need_new_binding
)
4244 add_decl_to_level (x
, current_binding_level
);
4249 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4250 caller to set DECL_CONTEXT properly. */
4253 pushdecl_with_scope (x
, level
)
4255 struct binding_level
*level
;
4257 register struct binding_level
*b
;
4258 tree function_decl
= current_function_decl
;
4260 current_function_decl
= NULL_TREE
;
4261 if (level
->parm_flag
== 2)
4263 b
= class_binding_level
;
4264 class_binding_level
= level
;
4265 pushdecl_class_level (x
);
4266 class_binding_level
= b
;
4270 b
= current_binding_level
;
4271 current_binding_level
= level
;
4273 current_binding_level
= b
;
4275 current_function_decl
= function_decl
;
4279 /* Like pushdecl, only it places X in the current namespace,
4283 pushdecl_namespace_level (x
)
4286 register struct binding_level
*b
= current_binding_level
;
4289 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4291 /* Now, the type_shadowed stack may screw us. Munge it so it does
4293 if (TREE_CODE (x
) == TYPE_DECL
)
4295 tree name
= DECL_NAME (x
);
4297 tree
*ptr
= (tree
*)0;
4298 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4300 tree shadowed
= b
->type_shadowed
;
4301 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4302 if (TREE_PURPOSE (shadowed
) == name
)
4304 ptr
= &TREE_VALUE (shadowed
);
4305 /* Can't break out of the loop here because sometimes
4306 a binding level will have duplicate bindings for
4307 PT names. It's gross, but I haven't time to fix it. */
4310 newval
= TREE_TYPE (x
);
4311 if (ptr
== (tree
*)0)
4313 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4314 up here if this is changed to an assertion. --KR */
4315 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4325 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4329 pushdecl_top_level (x
)
4332 tree cur_namespace
= current_namespace
;
4333 current_namespace
= global_namespace
;
4334 x
= pushdecl_namespace_level (x
);
4335 current_namespace
= cur_namespace
;
4339 /* Make the declaration of X appear in CLASS scope. */
4342 pushdecl_class_level (x
)
4345 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4346 scope looks for the pre-mangled name. */
4349 if (TREE_CODE (x
) == OVERLOAD
)
4350 x
= OVL_CURRENT (x
);
4351 name
= DECL_NAME (x
);
4355 push_class_level_binding (name
, x
);
4356 if (TREE_CODE (x
) == TYPE_DECL
)
4357 set_identifier_type_value (name
, TREE_TYPE (x
));
4359 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4363 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4366 pushdecl_class_level (f
);
4370 /* Enter DECL into the symbol table, if that's appropriate. Returns
4371 DECL, or a modified version thereof. */
4374 maybe_push_decl (decl
)
4377 tree type
= TREE_TYPE (decl
);
4379 /* Add this decl to the current binding level, but not if it comes
4380 from another scope, e.g. a static member variable. TEM may equal
4381 DECL or it may be a previous decl of the same name. */
4382 if ((TREE_CODE (decl
) != PARM_DECL
4383 && DECL_CONTEXT (decl
) != NULL_TREE
4384 /* Definitions of namespace members outside their namespace are
4386 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4387 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4388 || TREE_CODE (type
) == UNKNOWN_TYPE
4389 /* The declaration of a template specialization does not affect
4390 the functions available for overload resolution, so we do not
4392 || (TREE_CODE (decl
) == FUNCTION_DECL
4393 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4396 return pushdecl (decl
);
4400 /* This function is used to push the mangled decls for nested types into
4401 the appropriate scope. Previously pushdecl_top_level was used, but that
4402 is incorrect for members of local classes. */
4405 pushdecl_nonclass_level (x
)
4408 struct binding_level
*b
= current_binding_level
;
4410 my_friendly_assert (b
->parm_flag
!= 2, 180);
4413 /* Get out of template binding levels */
4414 while (b
->pseudo_global
)
4418 pushdecl_with_scope (x
, b
);
4422 /* Make the declaration(s) of X appear in CLASS scope
4423 under the name NAME. */
4426 push_class_level_binding (name
, x
)
4431 /* The class_binding_level will be NULL if x is a template
4432 parameter name in a member template. */
4433 if (!class_binding_level
)
4436 /* Make sure that this new member does not have the same name
4437 as a template parameter. */
4438 if (TYPE_BEING_DEFINED (current_class_type
))
4439 check_template_shadow (x
);
4441 /* If this declaration shadows a declaration from an enclosing
4442 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4443 we leave this class. Record the shadowed declaration here. */
4444 binding
= IDENTIFIER_BINDING (name
);
4446 && ((TREE_CODE (x
) == OVERLOAD
4447 && BINDING_VALUE (binding
)
4448 && is_overloaded_fn (BINDING_VALUE (binding
)))
4449 || INHERITED_VALUE_BINDING_P (binding
)))
4454 /* If the old binding was from a base class, and was for a tag
4455 name, slide it over to make room for the new binding. The
4456 old binding is still visible if explicitly qualified with a
4458 if (INHERITED_VALUE_BINDING_P (binding
)
4459 && BINDING_VALUE (binding
)
4460 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4461 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4462 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4464 old_decl
= BINDING_TYPE (binding
);
4465 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4466 BINDING_VALUE (binding
) = NULL_TREE
;
4467 INHERITED_VALUE_BINDING_P (binding
) = 0;
4470 old_decl
= BINDING_VALUE (binding
);
4472 /* There was already a binding for X containing fewer
4473 functions than are named in X. Find the previous
4474 declaration of X on the class-shadowed list, and update it. */
4475 for (shadow
= class_binding_level
->class_shadowed
;
4477 shadow
= TREE_CHAIN (shadow
))
4478 if (TREE_PURPOSE (shadow
) == name
4479 && TREE_TYPE (shadow
) == old_decl
)
4481 BINDING_VALUE (binding
) = x
;
4482 INHERITED_VALUE_BINDING_P (binding
) = 0;
4483 TREE_TYPE (shadow
) = x
;
4488 /* If we didn't replace an existing binding, put the binding on the
4489 stack of bindings for the identifier, and update
4490 IDENTIFIER_CLASS_VALUE. */
4491 if (push_class_binding (name
, x
))
4493 push_cache_obstack ();
4494 class_binding_level
->class_shadowed
4495 = tree_cons (name
, IDENTIFIER_CLASS_VALUE (name
),
4496 class_binding_level
->class_shadowed
);
4498 /* Record the value we are binding NAME to so that we can know
4499 what to pop later. */
4500 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4504 /* Insert another USING_DECL into the current binding level,
4505 returning this declaration. If this is a redeclaration,
4506 do nothing and return NULL_TREE. */
4509 push_using_decl (scope
, name
)
4515 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4516 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4517 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4518 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4522 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4523 DECL_INITIAL (decl
) = scope
;
4524 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4525 current_binding_level
->usings
= decl
;
4529 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4530 changed (i.e. there was already a directive), or the fresh
4531 TREE_LIST otherwise. */
4534 push_using_directive (used
)
4537 tree ud
= current_binding_level
->using_directives
;
4538 tree iter
, ancestor
;
4540 /* Check if we already have this. */
4541 if (purpose_member (used
, ud
) != NULL_TREE
)
4544 /* Recursively add all namespaces used. */
4545 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4546 push_using_directive (TREE_PURPOSE (iter
));
4548 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4549 ud
= current_binding_level
->using_directives
;
4550 ud
= perm_tree_cons (used
, ancestor
, ud
);
4551 current_binding_level
->using_directives
= ud
;
4555 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4556 other definitions already in place. We get around this by making
4557 the value of the identifier point to a list of all the things that
4558 want to be referenced by that name. It is then up to the users of
4559 that name to decide what to do with that list.
4561 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its DECL_RESULT
4562 slot. It is dealt with the same way.
4564 FLAGS is a bitwise-or of the following values:
4565 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4567 PUSH_USING: DECL is being pushed as the result of a using
4570 The value returned may be a previous declaration if we guessed wrong
4571 about what language DECL should belong to (C or C++). Otherwise,
4572 it's always DECL (and never something that's not a _DECL). */
4575 push_overloaded_decl (decl
, flags
)
4579 tree name
= DECL_NAME (decl
);
4582 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4585 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4587 old
= lookup_name_current_level (name
);
4591 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4593 tree t
= TREE_TYPE (old
);
4594 if (IS_AGGR_TYPE (t
) && warn_shadow
4595 && (! DECL_IN_SYSTEM_HEADER (decl
)
4596 || ! DECL_IN_SYSTEM_HEADER (old
)))
4597 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4600 else if (is_overloaded_fn (old
))
4604 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4606 tree fn
= OVL_CURRENT (tmp
);
4608 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4609 && !(flags
& PUSH_USING
)
4610 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4611 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4612 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4615 if (duplicate_decls (decl
, fn
))
4621 cp_error_at ("previous non-function declaration `%#D'", old
);
4622 cp_error ("conflicts with function declaration `%#D'", decl
);
4627 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4629 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4630 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4632 new_binding
= ovl_cons (decl
, old
);
4633 if (flags
& PUSH_USING
)
4634 OVL_USED (new_binding
) = 1;
4637 /* NAME is not ambiguous. */
4641 set_namespace_binding (name
, current_namespace
, new_binding
);
4644 /* We only create an OVERLOAD if there was a previous binding at
4645 this level, or if decl is a template. In the former case, we
4646 need to remove the old binding and replace it with the new
4647 binding. We must also run through the NAMES on the binding
4648 level where the name was bound to update the chain. */
4650 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4654 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4656 d
= &TREE_CHAIN (*d
))
4658 || (TREE_CODE (*d
) == TREE_LIST
4659 && TREE_VALUE (*d
) == old
))
4661 if (TREE_CODE (*d
) == TREE_LIST
)
4662 /* Just replace the old binding with the new. */
4663 TREE_VALUE (*d
) = new_binding
;
4665 /* Build a TREE_LIST to wrap the OVERLOAD. */
4666 *d
= build_tree_list (NULL_TREE
, new_binding
);
4668 /* And update the CPLUS_BINDING node. */
4669 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4674 /* We should always find a previous binding in this case. */
4675 my_friendly_abort (0);
4678 /* Install the new binding. */
4679 push_local_binding (name
, new_binding
, flags
);
4685 /* Generate an implicit declaration for identifier FUNCTIONID
4686 as a function of type int (). Print a warning if appropriate. */
4689 implicitly_declare (functionid
)
4693 int temp
= allocation_temporary_p ();
4695 push_obstacks_nochange ();
4697 /* Save the decl permanently so we can warn if definition follows.
4698 In ANSI C, warn_implicit is usually false, so the saves little space.
4699 But in C++, it's usually true, hence the extra code. */
4700 if (temp
&& (! warn_implicit
|| toplevel_bindings_p ()))
4701 end_temporary_allocation ();
4703 /* We used to reuse an old implicit decl here,
4704 but this loses with inline functions because it can clobber
4705 the saved decl chains. */
4706 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4708 DECL_EXTERNAL (decl
) = 1;
4709 TREE_PUBLIC (decl
) = 1;
4711 /* ANSI standard says implicit declarations are in the innermost block.
4712 So we record the decl in the standard fashion. */
4714 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4717 /* Only one warning per identifier. */
4718 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4720 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4723 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4730 /* Return zero if the declaration NEWDECL is valid
4731 when the declaration OLDDECL (assumed to be for the same name)
4732 has already been seen.
4733 Otherwise return an error message format string with a %s
4734 where the identifier should go. */
4737 redeclaration_error_message (newdecl
, olddecl
)
4738 tree newdecl
, olddecl
;
4740 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4742 /* Because C++ can put things into name space for free,
4743 constructs like "typedef struct foo { ... } foo"
4744 would look like an erroneous redeclaration. */
4745 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4748 return "redefinition of `%#D'";
4750 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4752 /* If this is a pure function, its olddecl will actually be
4753 the original initialization to `0' (which we force to call
4754 abort()). Don't complain about redefinition in this case. */
4755 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_ABSTRACT_VIRTUAL_P (olddecl
))
4758 /* If both functions come from different namespaces, this is not
4759 a redeclaration - this is a conflict with a used function. */
4760 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4761 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4762 return "`%D' conflicts with used function";
4764 /* We'll complain about linkage mismatches in
4765 warn_extern_redeclared_static. */
4767 /* Defining the same name twice is no good. */
4768 if (DECL_INITIAL (olddecl
) != NULL_TREE
4769 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4771 if (DECL_NAME (olddecl
) == NULL_TREE
)
4772 return "`%#D' not declared in class";
4774 return "redefinition of `%#D'";
4778 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4780 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4781 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4782 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4783 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4784 && TYPE_SIZE (TREE_TYPE (newdecl
))
4785 && TYPE_SIZE (TREE_TYPE (olddecl
))))
4786 return "redefinition of `%#D'";
4789 else if (toplevel_bindings_p ())
4791 /* Objects declared at top level: */
4792 /* If at least one is a reference, it's ok. */
4793 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4795 /* Reject two definitions. */
4796 return "redefinition of `%#D'";
4800 /* Objects declared with block scope: */
4801 /* Reject two definitions, and reject a definition
4802 together with an external reference. */
4803 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4804 return "redeclaration of `%#D'";
4809 /* Create a new label, named ID. */
4812 make_label_decl (id
, local_p
)
4818 if (building_stmt_tree ())
4819 push_permanent_obstack ();
4820 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4821 if (building_stmt_tree ())
4824 /* Make sure every label has an rtx. */
4827 DECL_CONTEXT (decl
) = current_function_decl
;
4828 DECL_MODE (decl
) = VOIDmode
;
4829 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
4831 /* Say where one reference is to the label, for the sake of the
4832 error if it is not defined. */
4833 DECL_SOURCE_LINE (decl
) = lineno
;
4834 DECL_SOURCE_FILE (decl
) = input_filename
;
4836 /* Record the fact that this identifier is bound to this label. */
4837 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4839 /* Record this label on the list of used labels so that we can check
4840 at the end of the function to see whether or not the label was
4841 actually defined. */
4842 if ((named_label_uses
== NULL
|| named_label_uses
->label_decl
!= decl
)
4843 && (named_label_uses
== NULL
4844 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4845 || named_label_uses
->label_decl
!= decl
))
4847 struct named_label_list
*new_ent
;
4849 = (struct named_label_list
*)oballoc (sizeof (struct named_label_list
));
4850 new_ent
->label_decl
= decl
;
4851 new_ent
->names_in_scope
= current_binding_level
->names
;
4852 new_ent
->binding_level
= current_binding_level
;
4853 new_ent
->lineno_o_goto
= lineno
;
4854 new_ent
->filename_o_goto
= input_filename
;
4855 new_ent
->next
= named_label_uses
;
4856 named_label_uses
= new_ent
;
4862 /* Look for a label named ID in the current function. If one cannot
4863 be found, create one. (We keep track of used, but undefined,
4864 labels, and complain about them at the end of a function.) */
4872 /* You can't use labels at global scope. */
4873 if (current_function_decl
== NULL_TREE
)
4875 error ("label `%s' referenced outside of any function",
4876 IDENTIFIER_POINTER (id
));
4880 /* See if we've already got this label. */
4881 decl
= IDENTIFIER_LABEL_VALUE (id
);
4882 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
4885 /* Record this label on the list of labels used in this function.
4886 We do this before calling make_label_decl so that we get the
4887 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4888 named_labels
= tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4890 /* We need a new label. */
4891 decl
= make_label_decl (id
, /*local_p=*/0);
4892 /* Now fill in the information we didn't have before. */
4893 TREE_VALUE (named_labels
) = decl
;
4898 /* Declare a local label named ID. */
4901 declare_local_label (id
)
4906 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4907 this scope we can restore the old value of
4908 IDENTIFIER_TYPE_VALUE. */
4909 current_binding_level
->shadowed_labels
4910 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4911 current_binding_level
->shadowed_labels
);
4912 /* Look for the label. */
4913 decl
= make_label_decl (id
, /*local_p=*/1);
4914 /* Now fill in the information we didn't have before. */
4915 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
4920 /* Define a label, specifying the location in the source file.
4921 Return the LABEL_DECL node for the label, if the definition is valid.
4922 Otherwise return 0. */
4925 define_label (filename
, line
, name
)
4930 tree decl
= lookup_label (name
);
4932 /* After labels, make any new cleanups go into their
4933 own new (temporary) binding contour. */
4934 current_binding_level
->more_cleanups_ok
= 0;
4936 if (name
== get_identifier ("wchar_t"))
4937 cp_pedwarn ("label named wchar_t");
4939 if (DECL_INITIAL (decl
) != NULL_TREE
)
4941 cp_error ("duplicate label `%D'", decl
);
4946 struct named_label_list
*uses
, *prev
;
4950 /* Mark label as having been defined. */
4951 DECL_INITIAL (decl
) = error_mark_node
;
4952 /* Say where in the source. */
4953 DECL_SOURCE_FILE (decl
) = filename
;
4954 DECL_SOURCE_LINE (decl
) = line
;
4957 uses
= named_label_uses
;
4958 while (uses
!= NULL
)
4959 if (uses
->label_decl
== decl
)
4961 struct binding_level
*b
= current_binding_level
;
4964 tree new_decls
= b
->names
;
4965 tree old_decls
= (b
== uses
->binding_level
)
4966 ? uses
->names_in_scope
: NULL_TREE
;
4967 while (new_decls
!= old_decls
)
4969 if (TREE_CODE (new_decls
) == VAR_DECL
4970 /* Don't complain about crossing initialization
4971 of internal entities. They can't be accessed,
4972 and they should be cleaned up
4973 by the time we get to the label. */
4974 && ! DECL_ARTIFICIAL (new_decls
)
4975 && !(DECL_INITIAL (new_decls
) == NULL_TREE
4976 && pod_type_p (TREE_TYPE (new_decls
))))
4978 /* This is really only important if we're crossing
4979 an initialization. The POD stuff is just
4980 pedantry; why should it matter if the class
4981 contains a field of pointer to member type? */
4982 int problem
= (DECL_INITIAL (new_decls
)
4983 || (TYPE_NEEDS_CONSTRUCTING
4984 (TREE_TYPE (new_decls
))));
4990 cp_error ("jump to label `%D'", decl
);
4991 error_with_file_and_line
4992 (uses
->filename_o_goto
,
4993 uses
->lineno_o_goto
, " from here");
4997 cp_pedwarn ("jump to label `%D'", decl
);
4998 pedwarn_with_file_and_line
4999 (uses
->filename_o_goto
,
5000 uses
->lineno_o_goto
, " from here");
5006 cp_error_at (" crosses initialization of `%#D'",
5009 cp_pedwarn_at (" enters scope of non-POD `%#D'",
5012 new_decls
= TREE_CHAIN (new_decls
);
5014 if (b
== uses
->binding_level
)
5016 if (b
->eh_region
&& ! saw_eh
)
5020 cp_error ("jump to label `%D'", decl
);
5021 error_with_file_and_line
5022 (uses
->filename_o_goto
,
5023 uses
->lineno_o_goto
, " from here");
5026 error (" enters exception handling block");
5033 prev
->next
= uses
->next
;
5035 named_label_uses
= uses
->next
;
5044 current_function_return_value
= NULL_TREE
;
5051 struct binding_level
*level
;
5052 struct cp_switch
*next
;
5055 static struct cp_switch
*switch_stack
;
5061 = (struct cp_switch
*) oballoc (sizeof (struct cp_switch
));
5062 p
->level
= current_binding_level
;
5063 p
->next
= switch_stack
;
5070 switch_stack
= switch_stack
->next
;
5073 /* Same, but for CASE labels. If DECL is NULL_TREE, it's the default. */
5074 /* XXX Note decl is never actually used. (bpk) */
5077 define_case_label ()
5079 tree cleanup
= last_cleanup_this_contour ();
5080 struct binding_level
*b
= current_binding_level
;
5085 static int explained
= 0;
5086 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup
));
5087 warning ("where case label appears here");
5090 warning ("(enclose actions of previous case statements requiring");
5091 warning ("destructors in their own binding contours.)");
5096 for (; b
&& b
!= switch_stack
->level
; b
= b
->level_chain
)
5098 tree new_decls
= b
->names
;
5099 for (; new_decls
; new_decls
= TREE_CHAIN (new_decls
))
5101 if (TREE_CODE (new_decls
) == VAR_DECL
5102 /* Don't complain about crossing initialization
5103 of internal entities. They can't be accessed,
5104 and they should be cleaned up
5105 by the time we get to the label. */
5106 && ! DECL_ARTIFICIAL (new_decls
)
5107 && ((DECL_INITIAL (new_decls
) != NULL_TREE
5108 && DECL_INITIAL (new_decls
) != error_mark_node
)
5109 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls
))))
5112 error ("jump to case label");
5114 cp_error_at (" crosses initialization of `%#D'",
5120 /* After labels, make any new cleanups go into their
5121 own new (temporary) binding contour. */
5123 current_binding_level
->more_cleanups_ok
= 0;
5124 current_function_return_value
= NULL_TREE
;
5127 /* Return the list of declarations of the current level.
5128 Note that this list is in reverse order unless/until
5129 you nreverse it; and when you do nreverse it, you must
5130 store the result back using `storedecls' or you will lose. */
5135 return current_binding_level
->names
;
5138 /* Return the list of type-tags (for structs, etc) of the current level. */
5143 return current_binding_level
->tags
;
5146 /* Store the list of declarations of the current level.
5147 This is done for the parameter declarations of a function being defined,
5148 after they are modified in the light of any missing parameters. */
5154 current_binding_level
->names
= decls
;
5157 /* Similarly, store the list of tags of the current level. */
5163 current_binding_level
->tags
= tags
;
5166 /* Given NAME, an IDENTIFIER_NODE,
5167 return the structure (or union or enum) definition for that name.
5168 Searches binding levels from BINDING_LEVEL up to the global level.
5169 If THISLEVEL_ONLY is nonzero, searches only the specified context
5170 (but skips any tag-transparent contexts to find one that is
5171 meaningful for tags).
5172 FORM says which kind of type the caller wants;
5173 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
5174 If the wrong kind of type is found, and it's not a template, an error is
5178 lookup_tag (form
, name
, binding_level
, thislevel_only
)
5179 enum tree_code form
;
5181 struct binding_level
*binding_level
;
5184 register struct binding_level
*level
;
5185 /* Non-zero if, we should look past a pseudo-global level, even if
5187 int allow_pseudo_global
= 1;
5189 for (level
= binding_level
; level
; level
= level
->level_chain
)
5192 if (ANON_AGGRNAME_P (name
))
5193 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5195 /* There's no need for error checking here, because
5196 anon names are unique throughout the compilation. */
5197 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
5198 return TREE_VALUE (tail
);
5200 else if (level
->namespace_p
)
5201 /* Do namespace lookup. */
5202 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
5204 tree old
= binding_for_name (name
, tail
);
5206 /* If we just skipped past a pseudo global level, even
5207 though THISLEVEL_ONLY, and we find a template class
5208 declaration, then we use the _TYPE node for the
5209 template. See the example below. */
5210 if (thislevel_only
&& !allow_pseudo_global
5211 && old
&& BINDING_VALUE (old
)
5212 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
5213 old
= TREE_TYPE (BINDING_VALUE (old
));
5215 old
= BINDING_TYPE (old
);
5217 /* If it has an original type, it is a typedef, and we
5218 should not return it. */
5219 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
5221 if (old
&& TREE_CODE (old
) != form
5222 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
5224 cp_error ("`%#D' redeclared as %C", old
, form
);
5229 if (thislevel_only
|| tail
== global_namespace
)
5233 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5235 if (TREE_PURPOSE (tail
) == name
)
5237 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
5238 /* Should tighten this up; it'll probably permit
5239 UNION_TYPE and a struct template, for example. */
5241 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
5243 /* Definition isn't the kind we were looking for. */
5244 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
5248 return TREE_VALUE (tail
);
5251 if (thislevel_only
&& ! level
->tag_transparent
)
5253 if (level
->pseudo_global
&& allow_pseudo_global
)
5255 /* We must deal with cases like this:
5257 template <class T> struct S;
5258 template <class T> struct S {};
5260 When looking up `S', for the second declaration, we
5261 would like to find the first declaration. But, we
5262 are in the pseudo-global level created for the
5263 template parameters, rather than the (surrounding)
5264 namespace level. Thus, we keep going one more level,
5265 even though THISLEVEL_ONLY is non-zero. */
5266 allow_pseudo_global
= 0;
5278 set_current_level_tags_transparency (tags_transparent
)
5279 int tags_transparent
;
5281 current_binding_level
->tag_transparent
= tags_transparent
;
5285 /* Given a type, find the tag that was defined for it and return the tag name.
5286 Otherwise return 0. However, the value can never be 0
5287 in the cases in which this is used.
5289 C++: If NAME is non-zero, this is the new name to install. This is
5290 done when replacing anonymous tags with real tag names. */
5293 lookup_tag_reverse (type
, name
)
5297 register struct binding_level
*level
;
5299 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5302 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5304 if (TREE_VALUE (tail
) == type
)
5307 TREE_PURPOSE (tail
) = name
;
5308 return TREE_PURPOSE (tail
);
5315 /* Look up NAME in the NAMESPACE. */
5318 lookup_namespace_name (namespace, name
)
5319 tree
namespace, name
;
5321 struct tree_binding _b
;
5323 tree template_id
= NULL_TREE
;
5325 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5327 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5328 /* This happens for A::B<int> when B is a namespace. */
5330 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5332 /* This happens for A::B where B is a template, and there are no
5333 template arguments. */
5334 cp_error ("invalid use of `%D'", name
);
5335 return error_mark_node
;
5338 namespace = ORIGINAL_NAMESPACE (namespace);
5340 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5343 name
= TREE_OPERAND (name
, 0);
5344 if (TREE_CODE (name
) == OVERLOAD
)
5345 name
= DECL_NAME (OVL_CURRENT (name
));
5346 else if (TREE_CODE_CLASS (TREE_CODE (name
)) == 'd')
5347 name
= DECL_NAME (name
);
5350 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5352 val
= binding_init (&_b
);
5353 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5354 return error_mark_node
;
5356 if (BINDING_VALUE (val
))
5358 val
= BINDING_VALUE (val
);
5362 if (DECL_CLASS_TEMPLATE_P (val
))
5363 val
= lookup_template_class (val
,
5364 TREE_OPERAND (template_id
, 1),
5365 /*in_decl=*/NULL_TREE
,
5366 /*context=*/NULL_TREE
,
5367 /*entering_scope=*/0);
5368 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5369 || TREE_CODE (val
) == OVERLOAD
)
5370 val
= lookup_template_function (val
,
5371 TREE_OPERAND (template_id
, 1));
5374 cp_error ("`%D::%D' is not a template",
5376 return error_mark_node
;
5380 /* If we have a single function from a using decl, pull it out. */
5381 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5382 val
= OVL_FUNCTION (val
);
5386 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5387 return error_mark_node
;
5390 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5392 static unsigned long
5400 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5401 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5406 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5409 typename_compare (k1
, k2
)
5420 d1
= TYPE_NAME (t1
);
5421 d2
= TYPE_NAME (t2
);
5423 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5424 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5425 && ((TREE_TYPE (t1
) != NULL_TREE
)
5426 == (TREE_TYPE (t2
) != NULL_TREE
))
5427 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5428 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5431 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5432 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5433 is non-NULL, this type is being created by the implicit typename
5434 extension, and BASE_TYPE is a type named `t' in some base class of
5435 `T' which depends on template parameters.
5437 Returns the new TYPENAME_TYPE. */
5440 build_typename_type (context
, name
, fullname
, base_type
)
5448 struct hash_entry
* e
;
5450 static struct hash_table ht
;
5452 push_obstacks (&permanent_obstack
, &permanent_obstack
);
5455 && !hash_table_init (&ht
, &hash_newfunc
, &typename_hash
,
5457 fatal ("virtual memory exhausted");
5459 /* The FULLNAME needs to exist for the life of the hash table, i.e.,
5460 for the entire compilation. */
5461 if (!TREE_PERMANENT (fullname
))
5462 fullname
= copy_to_permanent (fullname
);
5464 /* Build the TYPENAME_TYPE. */
5465 t
= make_lang_type (TYPENAME_TYPE
);
5466 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5467 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5468 TREE_TYPE (t
) = base_type
;
5470 /* Build the corresponding TYPE_DECL. */
5471 d
= build_decl (TYPE_DECL
, name
, t
);
5472 TYPE_NAME (TREE_TYPE (d
)) = d
;
5473 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5474 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5475 DECL_ARTIFICIAL (d
) = 1;
5477 /* See if we already have this type. */
5478 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5481 /* This will free not only TREE_TYPE, but the lang-specific data
5482 and the TYPE_DECL as well. */
5483 obstack_free (&permanent_obstack
, t
);
5487 /* Insert the type into the table. */
5488 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5496 make_typename_type (context
, name
)
5501 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
5503 if (!(TYPE_LANG_SPECIFIC (name
)
5504 && (CLASSTYPE_IS_TEMPLATE (name
)
5505 || CLASSTYPE_USE_TEMPLATE (name
))))
5506 name
= TYPE_IDENTIFIER (name
);
5508 /* Create a TEMPLATE_ID_EXPR for the type. */
5509 name
= build_nt (TEMPLATE_ID_EXPR
,
5510 CLASSTYPE_TI_TEMPLATE (name
),
5511 CLASSTYPE_TI_ARGS (name
));
5513 else if (TREE_CODE (name
) == TYPE_DECL
)
5514 name
= DECL_NAME (name
);
5518 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5520 name
= TREE_OPERAND (name
, 0);
5521 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5522 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5524 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5525 my_friendly_abort (2000);
5527 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5529 /* We can get here from typename_sub0 in the explicit_template_type
5530 expansion. Just fail. */
5531 cp_error ("no class template named `%#T' in `%#T'",
5533 return error_mark_node
;
5536 if (! uses_template_parms (context
)
5537 || currently_open_class (context
))
5539 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5541 tree tmpl
= NULL_TREE
;
5542 if (IS_AGGR_TYPE (context
))
5543 tmpl
= lookup_field (context
, name
, 0, 0);
5544 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5546 cp_error ("no class template named `%#T' in `%#T'",
5548 return error_mark_node
;
5551 return lookup_template_class (tmpl
,
5552 TREE_OPERAND (fullname
, 1),
5554 /*entering_scope=*/0);
5560 if (!IS_AGGR_TYPE (context
))
5562 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5563 return error_mark_node
;
5566 t
= lookup_field (context
, name
, 0, 1);
5568 return TREE_TYPE (t
);
5572 /* If the CONTEXT is not a template type, then either the field is
5573 there now or its never going to be. */
5574 if (!uses_template_parms (context
))
5576 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5577 return error_mark_node
;
5581 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5584 /* Select the right _DECL from multiple choices. */
5587 select_decl (binding
, flags
)
5592 val
= BINDING_VALUE (binding
);
5593 if (LOOKUP_NAMESPACES_ONLY (flags
))
5595 /* We are not interested in types. */
5596 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5601 /* If we could have a type and
5602 we have nothing or we need a type and have none. */
5603 if (BINDING_TYPE (binding
)
5604 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5605 && TREE_CODE (val
) != TYPE_DECL
)))
5606 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5607 /* Don't return non-types if we really prefer types. */
5608 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5609 && (TREE_CODE (val
) != TEMPLATE_DECL
5610 || !DECL_CLASS_TEMPLATE_P (val
)))
5616 /* Unscoped lookup of a global: iterate over current namespaces,
5617 considering using-directives. If SPACESP is non-NULL, store a list
5618 of the namespaces we've considered in it. */
5621 unqualified_namespace_lookup (name
, flags
, spacesp
)
5626 struct tree_binding _binding
;
5627 tree b
= binding_init (&_binding
);
5628 tree initial
= current_decl_namespace();
5629 tree scope
= initial
;
5631 struct binding_level
*level
;
5632 tree val
= NULL_TREE
;
5635 *spacesp
= NULL_TREE
;
5637 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5640 *spacesp
= scratch_tree_cons (scope
, NULL_TREE
, *spacesp
);
5641 val
= binding_for_name (name
, scope
);
5643 /* Initialize binding for this context. */
5644 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5645 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5647 /* Add all _DECLs seen through local using-directives. */
5648 for (level
= current_binding_level
;
5649 !level
->namespace_p
;
5650 level
= level
->level_chain
)
5651 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5652 scope
, flags
, spacesp
))
5653 /* Give up because of error. */
5654 return error_mark_node
;
5656 /* Add all _DECLs seen through global using-directives. */
5657 /* XXX local and global using lists should work equally. */
5661 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5662 scope
, flags
, spacesp
))
5663 /* Give up because of error. */
5664 return error_mark_node
;
5665 if (siter
== scope
) break;
5666 siter
= CP_DECL_CONTEXT (siter
);
5669 val
= select_decl (b
, flags
);
5670 if (scope
== global_namespace
)
5676 /* Combine prefer_type and namespaces_only into flags. */
5679 lookup_flags (prefer_type
, namespaces_only
)
5680 int prefer_type
, namespaces_only
;
5682 if (namespaces_only
)
5683 return LOOKUP_PREFER_NAMESPACES
;
5684 if (prefer_type
> 1)
5685 return LOOKUP_PREFER_TYPES
;
5686 if (prefer_type
> 0)
5687 return LOOKUP_PREFER_BOTH
;
5691 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5692 ignore it or not. Subroutine of lookup_name_real. */
5695 qualify_lookup (val
, flags
)
5699 if (val
== NULL_TREE
)
5701 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5703 if ((flags
& LOOKUP_PREFER_TYPES
)
5704 && (TREE_CODE (val
) == TYPE_DECL
5705 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5706 && DECL_CLASS_TEMPLATE_P (val
))))
5708 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5713 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5717 warn_about_implicit_typename_lookup (typename
, binding
)
5721 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5722 tree name
= DECL_NAME (typename
);
5724 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5725 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5726 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5727 && ! (TREE_CODE (binding
) == TYPE_DECL
5728 && same_type_p (TREE_TYPE (binding
), subtype
)))
5730 cp_warning ("lookup of `%D' finds `%#D'",
5732 cp_warning (" instead of `%D' from dependent base class",
5734 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5735 constructor_name (current_class_type
), name
);
5739 /* Look up NAME in the current binding level and its superiors in the
5740 namespace of variables, functions and typedefs. Return a ..._DECL
5741 node of some kind representing its definition if there is only one
5742 such declaration, or return a TREE_LIST with all the overloaded
5743 definitions if there are many, or return 0 if it is undefined.
5745 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5746 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5747 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5748 Otherwise we prefer non-TYPE_DECLs.
5750 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5751 using IDENTIFIER_CLASS_VALUE. */
5754 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5756 int prefer_type
, nonclass
, namespaces_only
;
5759 tree val
= NULL_TREE
;
5761 tree from_obj
= NULL_TREE
;
5763 int val_is_implicit_typename
= 0;
5765 /* Hack: copy flag set by parser, if set. */
5766 if (only_namespace_names
)
5767 namespaces_only
= 1;
5769 if (prefer_type
== -2)
5771 extern int looking_for_typename
;
5772 tree type
= NULL_TREE
;
5775 prefer_type
= looking_for_typename
;
5777 flags
= lookup_flags (prefer_type
, namespaces_only
);
5778 /* If the next thing is '<', class templates are types. */
5779 if (looking_for_template
)
5780 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5782 /* std:: becomes :: for now. */
5783 if (got_scope
== std_node
)
5784 got_scope
= void_type_node
;
5788 else if (got_object
!= error_mark_node
)
5793 if (type
== error_mark_node
)
5794 return error_mark_node
;
5795 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5796 type
= TREE_TYPE (type
);
5799 type
= complete_type (type
);
5801 if (TREE_CODE (type
) == VOID_TYPE
)
5802 type
= global_namespace
;
5803 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5805 struct tree_binding b
;
5806 val
= binding_init (&b
);
5807 flags
|= LOOKUP_COMPLAIN
;
5808 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5810 val
= select_decl (val
, flags
);
5812 else if (! IS_AGGR_TYPE (type
)
5813 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5814 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5815 || TREE_CODE (type
) == TYPENAME_TYPE
)
5816 /* Someone else will give an error about this if needed. */
5818 else if (type
== current_class_type
)
5819 val
= IDENTIFIER_CLASS_VALUE (name
);
5821 val
= lookup_member (type
, name
, 0, prefer_type
);
5828 else if (got_object
&& val
)
5833 flags
= lookup_flags (prefer_type
, namespaces_only
);
5834 /* If we're not parsing, we need to complain. */
5835 flags
|= LOOKUP_COMPLAIN
;
5838 /* First, look in non-namespace scopes. */
5840 if (current_class_type
== NULL_TREE
)
5843 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5847 if (!LOCAL_BINDING_P (t
) && nonclass
)
5848 /* We're not looking for class-scoped bindings, so keep going. */
5851 /* If this is the kind of thing we're looking for, we're done. */
5852 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5853 binding
= BINDING_VALUE (t
);
5854 else if ((flags
& LOOKUP_PREFER_TYPES
)
5855 && qualify_lookup (BINDING_TYPE (t
), flags
))
5856 binding
= BINDING_TYPE (t
);
5858 binding
= NULL_TREE
;
5861 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5863 if (val_is_implicit_typename
&& !yylex
)
5864 warn_about_implicit_typename_lookup (val
, binding
);
5866 val_is_implicit_typename
5867 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5868 if (!val_is_implicit_typename
)
5873 /* Now lookup in namespace scopes. */
5874 if (!val
|| val_is_implicit_typename
)
5876 t
= unqualified_namespace_lookup (name
, flags
, 0);
5879 if (val_is_implicit_typename
&& !yylex
)
5880 warn_about_implicit_typename_lookup (val
, t
);
5888 /* This should only warn about types used in qualified-ids. */
5889 if (from_obj
&& from_obj
!= val
)
5891 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5892 && TREE_CODE (val
) == TYPE_DECL
5893 && TREE_TYPE (from_obj
) != TREE_TYPE (val
))
5895 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5896 name
, got_object
, TREE_TYPE (from_obj
));
5897 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
5901 /* We don't change val to from_obj if got_object depends on
5902 template parms because that breaks implicit typename for
5903 destructor calls. */
5904 if (! uses_template_parms (got_object
))
5908 /* If we have a single function from a using decl, pull it out. */
5909 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5910 val
= OVL_FUNCTION (val
);
5919 lookup_name_nonclass (name
)
5922 return lookup_name_real (name
, 0, 1, 0);
5926 lookup_function_nonclass (name
, args
)
5930 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
5934 lookup_name_namespace_only (name
)
5937 /* type-or-namespace, nonclass, namespace_only */
5938 return lookup_name_real (name
, 1, 1, 1);
5942 lookup_name (name
, prefer_type
)
5946 return lookup_name_real (name
, prefer_type
, 0, 0);
5949 /* Similar to `lookup_name' but look only in the innermost non-class
5953 lookup_name_current_level (name
)
5956 struct binding_level
*b
;
5959 b
= current_binding_level
;
5960 while (b
->parm_flag
== 2)
5965 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
5967 /* extern "C" function() */
5968 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
5971 else if (IDENTIFIER_BINDING (name
)
5972 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
5976 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
5977 return IDENTIFIER_VALUE (name
);
5989 /* Like lookup_name_current_level, but for types. */
5992 lookup_type_current_level (name
)
5995 register tree t
= NULL_TREE
;
5997 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
5999 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
6000 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
6002 struct binding_level
*b
= current_binding_level
;
6005 if (purpose_member (name
, b
->type_shadowed
))
6006 return REAL_IDENTIFIER_TYPE_VALUE (name
);
6018 begin_only_namespace_names ()
6020 only_namespace_names
= 1;
6024 end_only_namespace_names ()
6026 only_namespace_names
= 0;
6029 /* Arrange for the user to get a source line number, even when the
6030 compiler is going down in flames, so that she at least has a
6031 chance of working around problems in the compiler. We used to
6032 call error(), but that let the segmentation fault continue
6033 through; now, it's much more passive by asking them to send the
6034 maintainers mail about the problem. */
6038 int sig ATTRIBUTE_UNUSED
;
6040 signal (SIGSEGV
, SIG_DFL
);
6042 signal (SIGIOT
, SIG_DFL
);
6045 signal (SIGILL
, SIG_DFL
);
6048 signal (SIGABRT
, SIG_DFL
);
6051 signal (SIGBUS
, SIG_DFL
);
6053 my_friendly_abort (0);
6057 /* Unused -- brendan 970107 */
6058 /* Array for holding types considered "built-in". These types
6059 are output in the module in which `main' is defined. */
6060 static tree
*builtin_type_tdescs_arr
;
6061 static int builtin_type_tdescs_len
, builtin_type_tdescs_max
;
6064 /* Push the declarations of builtin types into the namespace.
6065 RID_INDEX, if < RID_MAX is the index of the builtin type
6066 in the array RID_POINTERS. NAME is the name used when looking
6067 up the builtin type. TYPE is the _TYPE node for the builtin type. */
6070 record_builtin_type (rid_index
, name
, type
)
6075 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
6076 tree tdecl
= NULL_TREE
;
6078 if ((int) rid_index
< (int) RID_MAX
)
6079 rname
= ridpointers
[(int) rid_index
];
6081 tname
= get_identifier (name
);
6083 TYPE_BUILT_IN (type
) = 1;
6087 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
6088 set_identifier_type_value (tname
, NULL_TREE
);
6089 if ((int) rid_index
< (int) RID_MAX
)
6090 /* Built-in types live in the global namespace. */
6091 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
6093 if (rname
!= NULL_TREE
)
6095 if (tname
!= NULL_TREE
)
6097 set_identifier_type_value (rname
, NULL_TREE
);
6098 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
6102 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
6103 set_identifier_type_value (rname
, NULL_TREE
);
6108 /* Record one of the standard Java types.
6109 * Declare it as having the given NAME.
6110 * If SIZE > 0, it is the size of one of the integral types;
6111 * otherwise it is the negative of the size of one of the other types. */
6114 record_builtin_java_type (name
, size
)
6120 type
= make_signed_type (size
);
6121 else if (size
> -32)
6122 { /* "__java_char" or ""__java_boolean". */
6123 type
= make_unsigned_type (-size
);
6124 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
6127 { /* "__java_float" or ""__java_double". */
6128 type
= make_node (REAL_TYPE
);
6129 TYPE_PRECISION (type
) = - size
;
6132 record_builtin_type (RID_MAX
, name
, type
);
6133 decl
= TYPE_NAME (type
);
6135 /* Suppress generate debug symbol entries for these types,
6136 since for normal C++ they are just clutter.
6137 However, push_lang_context undoes this if extern "Java" is seen. */
6138 DECL_IGNORED_P (decl
) = 1;
6140 TYPE_FOR_JAVA (type
) = 1;
6144 /* Push a type into the namespace so that the back-ends ignore it. */
6147 record_unknown_type (type
, name
)
6151 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
6152 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
6153 DECL_IGNORED_P (decl
) = 1;
6154 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
6155 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
6156 TYPE_ALIGN (type
) = 1;
6157 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
6160 /* Push overloaded decl, in global scope, with one argument so it
6161 can be used as a callback from define_function. */
6164 push_overloaded_decl_1 (x
)
6167 push_overloaded_decl (x
, PUSH_GLOBAL
);
6174 auto_function (name
, type
, code
)
6176 enum built_in_function code
;
6178 return define_function
6179 (IDENTIFIER_POINTER (name
), type
, code
, push_overloaded_decl_1
,
6180 IDENTIFIER_POINTER (build_decl_overload (name
, TYPE_ARG_TYPES (type
),
6184 /* Create the predefined scalar types of C,
6185 and some nodes representing standard constants (0, 1, (void *)0).
6186 Initialize the global binding level.
6187 Make definitions for built-in primitive functions. */
6190 init_decl_processing ()
6193 int wchar_type_size
;
6194 tree array_domain_type
;
6196 /* Have to make these distinct before we try using them. */
6197 lang_name_cplusplus
= get_identifier ("C++");
6198 lang_name_c
= get_identifier ("C");
6199 lang_name_java
= get_identifier ("Java");
6201 /* Enter the global namespace. */
6202 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
6203 my_friendly_assert (current_lang_name
== NULL_TREE
, 375);
6204 current_lang_name
= lang_name_cplusplus
;
6205 push_namespace (get_identifier ("::"));
6206 global_namespace
= current_namespace
;
6207 current_lang_name
= NULL_TREE
;
6209 if (flag_strict_prototype
== 2)
6210 flag_strict_prototype
= pedantic
;
6211 if (! flag_permissive
&& ! pedantic
)
6212 flag_pedantic_errors
= 1;
6214 strict_prototypes_lang_c
= flag_strict_prototype
;
6217 current_lang_name
= lang_name_c
;
6219 current_function_decl
= NULL_TREE
;
6220 named_labels
= NULL_TREE
;
6221 named_label_uses
= NULL
;
6222 current_binding_level
= NULL_BINDING_LEVEL
;
6223 free_binding_level
= NULL_BINDING_LEVEL
;
6225 /* Because most segmentation signals can be traced back into user
6226 code, catch them and at least give the user a chance of working
6227 around compiler bugs. */
6228 signal (SIGSEGV
, signal_catch
);
6230 /* We will also catch aborts in the back-end through signal_catch and
6231 give the user a chance to see where the error might be, and to defeat
6232 aborts in the back-end when there have been errors previously in their
6235 signal (SIGIOT
, signal_catch
);
6238 signal (SIGILL
, signal_catch
);
6241 signal (SIGABRT
, signal_catch
);
6244 signal (SIGBUS
, signal_catch
);
6247 gcc_obstack_init (&decl_obstack
);
6249 /* Must lay these out before anything else gets laid out. */
6250 error_mark_node
= make_node (ERROR_MARK
);
6251 TREE_PERMANENT (error_mark_node
) = 1;
6252 TREE_TYPE (error_mark_node
) = error_mark_node
;
6253 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6254 TREE_TYPE (error_mark_list
) = error_mark_node
;
6256 /* Make the binding_level structure for global names. */
6258 global_binding_level
= current_binding_level
;
6259 /* The global level is the namespace level of ::. */
6260 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6261 declare_namespace_level ();
6263 this_identifier
= get_identifier (THIS_NAME
);
6264 in_charge_identifier
= get_identifier (IN_CHARGE_NAME
);
6265 ctor_identifier
= get_identifier (CTOR_NAME
);
6266 dtor_identifier
= get_identifier (DTOR_NAME
);
6267 pfn_identifier
= get_identifier (VTABLE_PFN_NAME
);
6268 index_identifier
= get_identifier (VTABLE_INDEX_NAME
);
6269 delta_identifier
= get_identifier (VTABLE_DELTA_NAME
);
6270 delta2_identifier
= get_identifier (VTABLE_DELTA2_NAME
);
6271 pfn_or_delta2_identifier
= get_identifier ("__pfn_or_delta2");
6273 /* Define `int' and `char' first so that dbx will output them first. */
6275 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
6276 record_builtin_type (RID_INT
, NULL_PTR
, integer_type_node
);
6278 /* Define `char', which is like either `signed char' or `unsigned char'
6279 but not the same as either. */
6283 ? make_signed_type (CHAR_TYPE_SIZE
)
6284 : make_unsigned_type (CHAR_TYPE_SIZE
));
6285 record_builtin_type (RID_CHAR
, "char", char_type_node
);
6287 /* `signed' is the same as `int' */
6288 record_builtin_type (RID_SIGNED
, NULL_PTR
, integer_type_node
);
6290 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
6291 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
6293 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
6294 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
6296 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
6297 record_builtin_type (RID_MAX
, "long unsigned int", long_unsigned_type_node
);
6298 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
6300 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
6301 record_builtin_type (RID_MAX
, "long long int", long_long_integer_type_node
);
6303 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
6304 record_builtin_type (RID_MAX
, "long long unsigned int",
6305 long_long_unsigned_type_node
);
6306 record_builtin_type (RID_MAX
, "long long unsigned",
6307 long_long_unsigned_type_node
);
6309 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
6310 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
6311 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
6312 record_builtin_type (RID_MAX
, "short unsigned int", short_unsigned_type_node
);
6313 record_builtin_type (RID_MAX
, "unsigned short", short_unsigned_type_node
);
6315 /* `unsigned long' is the standard type for sizeof.
6316 Note that stddef.h uses `unsigned long',
6317 and this must agree, even if long and int are the same size. */
6319 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE
))));
6322 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE
)));
6324 /* Define both `signed char' and `unsigned char'. */
6325 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
6326 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
6327 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
6328 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
6330 /* Create the widest literal types. */
6331 widest_integer_literal_type_node
= make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
6332 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6333 widest_integer_literal_type_node
));
6335 widest_unsigned_literal_type_node
= make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
6336 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6337 widest_unsigned_literal_type_node
));
6339 /* These are types that type_for_size and type_for_mode use. */
6340 intQI_type_node
= make_signed_type (GET_MODE_BITSIZE (QImode
));
6341 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intQI_type_node
));
6342 intHI_type_node
= make_signed_type (GET_MODE_BITSIZE (HImode
));
6343 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intHI_type_node
));
6344 intSI_type_node
= make_signed_type (GET_MODE_BITSIZE (SImode
));
6345 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intSI_type_node
));
6346 intDI_type_node
= make_signed_type (GET_MODE_BITSIZE (DImode
));
6347 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intDI_type_node
));
6348 #if HOST_BITS_PER_WIDE_INT >= 64
6349 intTI_type_node
= make_signed_type (GET_MODE_BITSIZE (TImode
));
6350 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__int128_t"), intTI_type_node
));
6352 unsigned_intQI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (QImode
));
6353 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intQI_type_node
));
6354 unsigned_intHI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (HImode
));
6355 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intHI_type_node
));
6356 unsigned_intSI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (SImode
));
6357 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intSI_type_node
));
6358 unsigned_intDI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (DImode
));
6359 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intDI_type_node
));
6360 #if HOST_BITS_PER_WIDE_INT >= 64
6361 unsigned_intTI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (TImode
));
6362 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__uint128_t"), unsigned_intTI_type_node
));
6365 float_type_node
= make_node (REAL_TYPE
);
6366 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
6367 record_builtin_type (RID_FLOAT
, NULL_PTR
, float_type_node
);
6368 layout_type (float_type_node
);
6370 double_type_node
= make_node (REAL_TYPE
);
6371 if (flag_short_double
)
6372 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
6374 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
6375 record_builtin_type (RID_DOUBLE
, NULL_PTR
, double_type_node
);
6376 layout_type (double_type_node
);
6378 long_double_type_node
= make_node (REAL_TYPE
);
6379 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
6380 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
6381 layout_type (long_double_type_node
);
6383 complex_integer_type_node
= make_node (COMPLEX_TYPE
);
6384 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex int"),
6385 complex_integer_type_node
));
6386 TREE_TYPE (complex_integer_type_node
) = integer_type_node
;
6387 layout_type (complex_integer_type_node
);
6389 complex_float_type_node
= make_node (COMPLEX_TYPE
);
6390 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex float"),
6391 complex_float_type_node
));
6392 TREE_TYPE (complex_float_type_node
) = float_type_node
;
6393 layout_type (complex_float_type_node
);
6395 complex_double_type_node
= make_node (COMPLEX_TYPE
);
6396 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex double"),
6397 complex_double_type_node
));
6398 TREE_TYPE (complex_double_type_node
) = double_type_node
;
6399 layout_type (complex_double_type_node
);
6401 complex_long_double_type_node
= make_node (COMPLEX_TYPE
);
6402 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
6403 complex_long_double_type_node
));
6404 TREE_TYPE (complex_long_double_type_node
) = long_double_type_node
;
6405 layout_type (complex_long_double_type_node
);
6407 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6408 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6409 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6410 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6411 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6412 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6413 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6414 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6416 integer_zero_node
= build_int_2 (0, 0);
6417 TREE_TYPE (integer_zero_node
) = integer_type_node
;
6418 integer_one_node
= build_int_2 (1, 0);
6419 TREE_TYPE (integer_one_node
) = integer_type_node
;
6420 integer_two_node
= build_int_2 (2, 0);
6421 TREE_TYPE (integer_two_node
) = integer_type_node
;
6422 integer_three_node
= build_int_2 (3, 0);
6423 TREE_TYPE (integer_three_node
) = integer_type_node
;
6425 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6426 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6427 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6428 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6429 TYPE_PRECISION (boolean_type_node
) = 1;
6430 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6431 boolean_false_node
= build_int_2 (0, 0);
6432 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6433 boolean_true_node
= build_int_2 (1, 0);
6434 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6436 /* These are needed by stor-layout.c. */
6437 size_zero_node
= size_int (0);
6438 size_one_node
= size_int (1);
6440 signed_size_zero_node
= build_int_2 (0, 0);
6441 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6443 void_type_node
= make_node (VOID_TYPE
);
6444 record_builtin_type (RID_VOID
, NULL_PTR
, void_type_node
);
6445 layout_type (void_type_node
); /* Uses integer_zero_node. */
6446 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
6447 TREE_PARMLIST (void_list_node
) = 1;
6449 null_pointer_node
= build_int_2 (0, 0);
6450 TREE_TYPE (null_pointer_node
) = build_pointer_type (void_type_node
);
6451 layout_type (TREE_TYPE (null_pointer_node
));
6453 /* Used for expressions that do nothing, but are not errors. */
6454 void_zero_node
= build_int_2 (0, 0);
6455 TREE_TYPE (void_zero_node
) = void_type_node
;
6457 string_type_node
= build_pointer_type (char_type_node
);
6458 const_string_type_node
6459 = build_pointer_type (build_qualified_type (char_type_node
,
6461 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6463 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
6466 /* Make a type to be the domain of a few array types
6467 whose domains don't really matter.
6468 200 is small enough that it always fits in size_t
6469 and large enough that it can hold most function names for the
6470 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
6471 array_domain_type
= build_index_type (build_int_2 (200, 0));
6473 /* Make a type for arrays of characters.
6474 With luck nothing will ever really depend on the length of this
6476 char_array_type_node
6477 = build_array_type (char_type_node
, array_domain_type
);
6478 /* Likewise for arrays of ints. */
6480 = build_array_type (integer_type_node
, array_domain_type
);
6482 /* This is just some anonymous class type. Nobody should ever
6483 need to look inside this envelope. */
6484 class_star_type_node
= build_pointer_type (make_lang_type (RECORD_TYPE
));
6486 if (flag_huge_objects
)
6487 delta_type_node
= long_integer_type_node
;
6489 delta_type_node
= short_integer_type_node
;
6491 default_function_type
6492 = build_function_type (integer_type_node
, NULL_TREE
);
6494 ptr_type_node
= build_pointer_type (void_type_node
);
6496 = build_pointer_type (build_qualified_type (void_type_node
,
6498 c_common_nodes_and_builtins (1, flag_no_builtin
, flag_no_nonansi_builtin
);
6501 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6503 /* C++ extensions */
6505 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6506 record_unknown_type (unknown_type_node
, "unknown type");
6508 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6509 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6511 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6513 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6515 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6516 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6518 /* This is special for C++ so functions can be overloaded. */
6520 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (WCHAR_TYPE
)));
6521 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
6522 signed_wchar_type_node
= make_signed_type (wchar_type_size
);
6523 unsigned_wchar_type_node
= make_unsigned_type (wchar_type_size
);
6525 = TREE_UNSIGNED (wchar_type_node
)
6526 ? unsigned_wchar_type_node
6527 : signed_wchar_type_node
;
6528 record_builtin_type (RID_WCHAR
, "__wchar_t", wchar_type_node
);
6530 /* Artificial declaration of wchar_t -- can be bashed */
6531 wchar_decl_node
= build_decl (TYPE_DECL
, get_identifier ("wchar_t"),
6533 pushdecl (wchar_decl_node
);
6535 /* This is for wide string constants. */
6536 wchar_array_type_node
6537 = build_array_type (wchar_type_node
, array_domain_type
);
6539 if (flag_vtable_thunks
)
6541 /* Make sure we get a unique function type, so we can give
6542 its pointer type a name. (This wins for gdb.) */
6543 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6544 TREE_TYPE (vfunc_type
) = integer_type_node
;
6545 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6546 layout_type (vfunc_type
);
6548 vtable_entry_type
= build_pointer_type (vfunc_type
);
6552 vtable_entry_type
= make_lang_type (RECORD_TYPE
);
6553 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
6555 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
6557 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_identifier
,
6559 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6562 /* Make this part of an invisible union. */
6563 fields
[3] = copy_node (fields
[2]);
6564 TREE_TYPE (fields
[3]) = delta_type_node
;
6565 DECL_NAME (fields
[3]) = delta2_identifier
;
6566 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6567 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6568 TREE_UNSIGNED (fields
[3]) = 0;
6569 TREE_CHAIN (fields
[2]) = fields
[3];
6570 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6573 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6576 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6577 layout_type (vtbl_type_node
);
6578 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6579 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6580 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6581 layout_type (vtbl_ptr_type_node
);
6582 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6584 std_node
= build_decl (NAMESPACE_DECL
,
6585 get_identifier (flag_honor_std
? "fake std":"std"),
6587 pushdecl (std_node
);
6589 global_type_node
= make_node (LANG_TYPE
);
6590 record_unknown_type (global_type_node
, "global type");
6593 current_lang_name
= lang_name_cplusplus
;
6596 tree bad_alloc_type_node
, newtype
, deltype
;
6598 push_namespace (get_identifier ("std"));
6599 bad_alloc_type_node
= xref_tag
6600 (class_type_node
, get_identifier ("bad_alloc"), 1);
6603 newtype
= build_exception_variant
6604 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6605 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6606 auto_function (ansi_opname
[(int) NEW_EXPR
], newtype
, NOT_BUILT_IN
);
6607 auto_function (ansi_opname
[(int) VEC_NEW_EXPR
], newtype
, NOT_BUILT_IN
);
6608 global_delete_fndecl
6609 = auto_function (ansi_opname
[(int) DELETE_EXPR
], deltype
, NOT_BUILT_IN
);
6610 auto_function (ansi_opname
[(int) VEC_DELETE_EXPR
], deltype
, NOT_BUILT_IN
);
6614 = define_function ("__pure_virtual", void_ftype
,
6615 NOT_BUILT_IN
, 0, 0);
6617 /* Perform other language dependent initializations. */
6618 init_class_processing ();
6619 init_init_processing ();
6620 init_search_processing ();
6622 init_rtti_processing ();
6624 if (flag_exceptions
)
6625 init_exception_processing ();
6628 flag_inline_functions
= 0;
6631 if (! supports_one_only ())
6634 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6635 declare_function_name ();
6637 /* Prepare to check format strings against argument lists. */
6638 init_function_format_info ();
6640 /* Show we use EH for cleanups. */
6641 using_eh_for_cleanups ();
6643 print_error_function
= lang_print_error_function
;
6644 lang_get_alias_set
= &c_get_alias_set
;
6645 valid_lang_attribute
= cp_valid_lang_attribute
;
6647 /* Maintain consistency. Perhaps we should just complain if they
6648 say -fwritable-strings? */
6649 if (flag_writable_strings
)
6650 flag_const_strings
= 0;
6653 /* Function to print any language-specific context for an error message. */
6656 lang_print_error_function (file
)
6659 default_print_error_function (file
);
6660 maybe_print_template_context ();
6663 /* Make a definition for a builtin function named NAME and whose data type
6664 is TYPE. TYPE should be a function type with argument types.
6665 FUNCTION_CODE tells later passes how to compile calls to this function.
6666 See tree.h for its possible values.
6668 If LIBRARY_NAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6669 the name to be called if we can't opencode the function. */
6672 define_function (name
, type
, function_code
, pfn
, library_name
)
6675 enum built_in_function function_code
;
6676 void (*pfn
) PROTO((tree
));
6677 const char *library_name
;
6679 tree decl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), type
);
6680 DECL_EXTERNAL (decl
) = 1;
6681 TREE_PUBLIC (decl
) = 1;
6682 DECL_ARTIFICIAL (decl
) = 1;
6684 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6685 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
6687 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6688 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6689 function in the namespace. */
6690 if (pfn
) (*pfn
) (decl
);
6692 DECL_ASSEMBLER_NAME (decl
) = get_identifier (library_name
);
6693 make_function_rtl (decl
);
6694 if (function_code
!= NOT_BUILT_IN
)
6696 DECL_BUILT_IN (decl
) = 1;
6697 DECL_FUNCTION_CODE (decl
) = function_code
;
6703 builtin_function (name
, type
, code
, libname
)
6706 enum built_in_function code
;
6707 const char *libname
;
6709 return define_function (name
, type
, code
, (void (*) PROTO((tree
)))pushdecl
, libname
);
6712 /* When we call finish_struct for an anonymous union, we create
6713 default copy constructors and such. But, an anonymous union
6714 shouldn't have such things; this function undoes the damage to the
6715 anonymous union type T.
6717 (The reason that we create the synthesized methods is that we don't
6718 distinguish `union { int i; }' from `typedef union { int i; } U'.
6719 The first is an anonymous union; the second is just an ordinary
6723 fixup_anonymous_aggr (t
)
6728 /* Wipe out memory of synthesized methods */
6729 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6730 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6731 TYPE_HAS_INIT_REF (t
) = 0;
6732 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6733 TYPE_HAS_ASSIGN_REF (t
) = 0;
6734 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6736 /* Splice the implicitly generated functions out of the TYPE_METHODS
6738 q
= &TYPE_METHODS (t
);
6741 if (DECL_ARTIFICIAL (*q
))
6742 *q
= TREE_CHAIN (*q
);
6744 q
= &TREE_CHAIN (*q
);
6747 /* ANSI C++ June 5 1992 WP 9.5.3. Anonymous unions may not have
6748 function members. */
6749 if (TYPE_METHODS (t
))
6750 error ("an anonymous union cannot have function members");
6753 /* Make sure that a declaration with no declarator is well-formed, i.e.
6754 just defines a tagged type or anonymous union.
6756 Returns the type defined, if any. */
6759 check_tag_decl (declspecs
)
6763 tree ob_modifier
= NULL_TREE
;
6765 register tree t
= NULL_TREE
;
6767 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6769 register tree value
= TREE_VALUE (link
);
6775 if (IS_AGGR_TYPE (value
) || TREE_CODE (value
) == ENUMERAL_TYPE
)
6777 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6781 else if (value
== ridpointers
[(int) RID_FRIEND
])
6783 if (current_class_type
== NULL_TREE
6784 || current_scope () != current_class_type
)
6785 ob_modifier
= value
;
6787 else if (value
== ridpointers
[(int) RID_STATIC
]
6788 || value
== ridpointers
[(int) RID_EXTERN
]
6789 || value
== ridpointers
[(int) RID_AUTO
]
6790 || value
== ridpointers
[(int) RID_REGISTER
]
6791 || value
== ridpointers
[(int) RID_INLINE
]
6792 || value
== ridpointers
[(int) RID_VIRTUAL
]
6793 || value
== ridpointers
[(int) RID_CONST
]
6794 || value
== ridpointers
[(int) RID_VOLATILE
]
6795 || value
== ridpointers
[(int) RID_EXPLICIT
])
6796 ob_modifier
= value
;
6800 error ("multiple types in one declaration");
6802 /* Inside a class, we might be in a friend or access declaration.
6803 Until we have a good way of detecting the latter, don't warn. */
6804 if (t
== NULL_TREE
&& ! current_class_type
)
6805 pedwarn ("declaration does not declare anything");
6807 /* Check for an anonymous union. We're careful
6808 accessing TYPE_IDENTIFIER because some built-in types, like
6809 pointer-to-member types, do not have TYPE_NAME. */
6810 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
6812 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
6814 /* Anonymous unions are objects, so they can have specifiers. */;
6815 SET_ANON_AGGR_TYPE_P (t
);
6817 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
6818 pedwarn ("ISO C++ prohibits anonymous structs");
6821 else if (ob_modifier
)
6823 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
6824 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
6825 cp_error ("`%D' can only be specified for functions", ob_modifier
);
6826 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
6827 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
6828 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
6829 cp_error ("`%D' can only be specified for constructors",
6832 cp_error ("`%D' can only be specified for objects and functions",
6839 /* Called when a declaration is seen that contains no names to declare.
6840 If its type is a reference to a structure, union or enum inherited
6841 from a containing scope, shadow that tag name for the current scope
6842 with a forward reference.
6843 If its type defines a new named structure or union
6844 or defines an enum, it is valid but we need not do anything here.
6845 Otherwise, it is an error.
6847 C++: may have to grok the declspecs to learn about static,
6848 complain for anonymous unions. */
6851 shadow_tag (declspecs
)
6854 tree t
= check_tag_decl (declspecs
);
6857 maybe_process_partial_specialization (t
);
6859 /* This is where the variables in an anonymous union are
6860 declared. An anonymous union declaration looks like:
6862 because there is no declarator after the union, the parser
6863 sends that declaration here. */
6864 if (t
&& ANON_AGGR_TYPE_P (t
))
6866 fixup_anonymous_aggr (t
);
6868 if (TYPE_FIELDS (t
))
6870 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
6872 finish_anon_union (decl
);
6877 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6880 groktypename (typename
)
6883 if (TREE_CODE (typename
) != TREE_LIST
)
6885 return grokdeclarator (TREE_VALUE (typename
),
6886 TREE_PURPOSE (typename
),
6887 TYPENAME
, 0, NULL_TREE
);
6890 /* Decode a declarator in an ordinary declaration or data definition.
6891 This is called as soon as the type information and variable name
6892 have been parsed, before parsing the initializer if any.
6893 Here we create the ..._DECL node, fill in its type,
6894 and put it on the list of decls for the current context.
6895 The ..._DECL node is returned as the value.
6897 Exception: for arrays where the length is not specified,
6898 the type is left null, to be filled in by `cp_finish_decl'.
6900 Function definitions do not come here; they go to start_function
6901 instead. However, external and forward declarations of functions
6902 do go through here. Structure field declarations are done by
6903 grokfield and not through here. */
6905 /* Set this to zero to debug not using the temporary obstack
6906 to parse initializers. */
6907 int debug_temp_inits
= 1;
6910 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
6911 tree declarator
, declspecs
;
6913 tree attributes
, prefix_attributes
;
6916 register tree type
, tem
;
6918 extern int have_extern_spec
;
6919 extern int used_extern_spec
;
6923 /* See code below that used this. */
6924 int init_written
= initialized
;
6927 /* This should only be done once on the top most decl. */
6928 if (have_extern_spec
&& !used_extern_spec
)
6930 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"),
6932 used_extern_spec
= 1;
6935 if (attributes
|| prefix_attributes
)
6936 attrlist
= build_scratch_list (attributes
, prefix_attributes
);
6938 attrlist
= NULL_TREE
;
6940 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
6943 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
6946 type
= TREE_TYPE (decl
);
6948 if (type
== error_mark_node
)
6951 /* Don't lose if destructors must be executed at file-level. */
6952 if (! processing_template_decl
&& TREE_STATIC (decl
)
6953 && TYPE_NEEDS_DESTRUCTOR (complete_type (type
))
6954 && !TREE_PERMANENT (decl
))
6956 push_obstacks (&permanent_obstack
, &permanent_obstack
);
6957 decl
= copy_node (decl
);
6958 if (TREE_CODE (type
) == ARRAY_TYPE
)
6960 tree itype
= TYPE_DOMAIN (type
);
6961 if (itype
&& ! TREE_PERMANENT (itype
))
6963 itype
= build_index_type (copy_to_permanent (TYPE_MAX_VALUE (itype
)));
6964 type
= build_cplus_array_type (TREE_TYPE (type
), itype
);
6965 TREE_TYPE (decl
) = type
;
6972 = (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
6973 ? DECL_CLASS_CONTEXT (decl
)
6974 : DECL_CONTEXT (decl
);
6976 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
6977 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
6979 /* When parsing the initializer, lookup should use the object's
6981 push_decl_namespace (context
);
6984 /* We are only interested in class contexts, later. */
6985 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
6986 context
= NULL_TREE
;
6989 /* Is it valid for this decl to have an initializer at all?
6990 If not, set INITIALIZED to zero, which will indirectly
6991 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6992 switch (TREE_CODE (decl
))
6995 /* typedef foo = bar means give foo the same type as bar.
6996 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
6997 Any other case of an initialization in a TYPE_DECL is an error. */
6998 if (pedantic
|| list_length (declspecs
) > 1)
7000 cp_error ("typedef `%D' is initialized", decl
);
7006 cp_error ("function `%#D' is initialized like a variable", decl
);
7016 if (! toplevel_bindings_p ()
7017 && DECL_EXTERNAL (decl
))
7018 cp_warning ("declaration of `%#D' has `extern' and is initialized",
7020 DECL_EXTERNAL (decl
) = 0;
7021 if (toplevel_bindings_p ())
7022 TREE_STATIC (decl
) = 1;
7024 /* Tell `pushdecl' this is an initialized decl
7025 even though we don't yet have the initializer expression.
7026 Also tell `cp_finish_decl' it may store the real initializer. */
7027 DECL_INITIAL (decl
) = error_mark_node
;
7030 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
7031 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
7034 /* Set attributes here so if duplicate decl, will have proper attributes. */
7035 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
7037 if (context
&& TYPE_SIZE (complete_type (context
)) != NULL_TREE
)
7039 push_nested_class (context
, 2);
7041 if (TREE_CODE (decl
) == VAR_DECL
)
7043 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
7044 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
7045 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
7048 if (DECL_CONTEXT (field
) != context
)
7050 cp_pedwarn ("ANSI C++ does not permit `%T::%D' to be defined as `%T::%D'",
7051 DECL_CONTEXT (field
), DECL_NAME (decl
),
7052 context
, DECL_NAME (decl
));
7053 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
7055 /* Static data member are tricky; an in-class initialization
7056 still doesn't provide a definition, so the in-class
7057 declaration will have DECL_EXTERNAL set, but will have an
7058 initialization. Thus, duplicate_decls won't warn
7059 about this situation, and so we check here. */
7060 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
7061 cp_error ("duplicate initialization of %D", decl
);
7062 if (duplicate_decls (decl
, field
))
7068 tree field
= check_classfn (context
, decl
);
7069 if (field
&& duplicate_decls (decl
, field
))
7073 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
7074 DECL_IN_AGGR_P (decl
) = 0;
7075 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
7076 || CLASSTYPE_USE_TEMPLATE (context
))
7078 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
7079 /* [temp.expl.spec] An explicit specialization of a static data
7080 member of a template is a definition if the declaration
7081 includes an initializer; otherwise, it is a declaration.
7083 We check for processing_specialization so this only applies
7084 to the new specialization syntax. */
7085 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
7086 DECL_EXTERNAL (decl
) = 1;
7089 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
7090 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
7094 /* Enter this declaration into the symbol table. */
7095 tem
= maybe_push_decl (decl
);
7097 if (processing_template_decl
)
7099 if (at_function_scope_p ())
7100 push_permanent_obstack ();
7102 tem
= push_template_decl (tem
);
7103 /* In a a local scope, add a representation of this declaration
7104 to the statement tree. */
7105 if (at_function_scope_p ())
7107 add_decl_stmt (decl
);
7113 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7114 /* Tell the back-end to use or not use .common as appropriate. If we say
7115 -fconserve-space, we want this to save .data space, at the expense of
7116 wrong semantics. If we say -fno-conserve-space, we want this to
7117 produce errors about redefs; to do this we force variables into the
7119 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
7122 if (! processing_template_decl
)
7125 /* Corresponding pop_obstacks is done in `cp_finish_decl'. */
7126 push_obstacks_nochange ();
7135 tree type
= TREE_TYPE (decl
);
7136 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
7138 if (type
== error_mark_node
)
7141 /* If this type of object needs a cleanup, and control may
7142 jump past it, make a new binding level so that it is cleaned
7143 up only when it is initialized first. */
7144 if (TYPE_NEEDS_DESTRUCTOR (type
)
7145 && current_binding_level
->more_cleanups_ok
== 0)
7146 pushlevel_temporary (1);
7149 /* Is it valid for this decl to have an initializer at all?
7150 If not, set INITIALIZED to zero, which will indirectly
7151 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7153 /* Don't allow initializations for incomplete types except for
7154 arrays which might be completed by the initialization. */
7155 if (TYPE_SIZE (complete_type (type
)) != NULL_TREE
)
7156 ; /* A complete type is ok. */
7157 else if (TREE_CODE (type
) != ARRAY_TYPE
)
7159 cp_error ("variable `%#D' has initializer but incomplete type",
7162 type
= TREE_TYPE (decl
) = error_mark_node
;
7164 else if (TYPE_SIZE (complete_type (TREE_TYPE (type
))) == NULL_TREE
)
7166 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
7167 cp_error ("elements of array `%#D' have incomplete type", decl
);
7168 /* else we already gave an error in start_decl. */
7174 && TREE_CODE (decl
) != TYPE_DECL
7175 && TREE_CODE (decl
) != TEMPLATE_DECL
7176 && IS_AGGR_TYPE (type
) && ! DECL_EXTERNAL (decl
))
7178 if ((! processing_template_decl
|| ! uses_template_parms (type
))
7179 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
7181 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
7183 /* Change the type so that assemble_variable will give
7184 DECL an rtl we can live with: (mem (const_int 0)). */
7185 type
= TREE_TYPE (decl
) = error_mark_node
;
7189 /* If any base type in the hierarchy of TYPE needs a constructor,
7190 then we set initialized to 1. This way any nodes which are
7191 created for the purposes of initializing this aggregate
7192 will live as long as it does. This is necessary for global
7193 aggregates which do not have their initializers processed until
7194 the end of the file. */
7195 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
7200 DECL_INITIAL (decl
) = NULL_TREE
;
7203 /* Handle initialization of references.
7204 These three arguments are from `cp_finish_decl', and have the
7205 same meaning here that they do there.
7207 Quotes on semantics can be found in ARM 8.4.3. */
7210 grok_reference_init (decl
, type
, init
)
7211 tree decl
, type
, init
;
7215 if (init
== NULL_TREE
)
7217 if ((DECL_LANG_SPECIFIC (decl
) == 0
7218 || DECL_IN_AGGR_P (decl
) == 0)
7219 && ! DECL_THIS_EXTERN (decl
))
7221 cp_error ("`%D' declared as reference but not initialized", decl
);
7222 if (TREE_CODE (decl
) == VAR_DECL
)
7223 SET_DECL_REFERENCE_SLOT (decl
, error_mark_node
);
7228 if (init
== error_mark_node
)
7231 if (TREE_CODE (type
) == REFERENCE_TYPE
7232 && TREE_CODE (init
) == CONSTRUCTOR
)
7234 cp_error ("ANSI C++ forbids use of initializer list to initialize reference `%D'", decl
);
7238 if (TREE_CODE (init
) == TREE_LIST
)
7239 init
= build_compound_expr (init
);
7241 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
7242 init
= convert_from_reference (init
);
7244 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
7245 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
7247 /* Note: default conversion is only called in very special cases. */
7248 init
= default_conversion (init
);
7251 tmp
= convert_to_reference
7252 (type
, init
, CONV_IMPLICIT
,
7253 LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
, decl
);
7255 if (tmp
== error_mark_node
)
7257 else if (tmp
!= NULL_TREE
)
7260 DECL_INITIAL (decl
) = save_expr (init
);
7264 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7268 /* ?? Can this be optimized in some cases to
7269 hand back the DECL_INITIAL slot?? */
7270 if (TYPE_SIZE (TREE_TYPE (type
)))
7272 init
= convert_from_reference (decl
);
7273 if (TREE_PERMANENT (decl
))
7274 init
= copy_to_permanent (init
);
7275 SET_DECL_REFERENCE_SLOT (decl
, init
);
7278 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
7280 expand_static_init (decl
, DECL_INITIAL (decl
));
7281 DECL_INITIAL (decl
) = NULL_TREE
;
7286 if (TREE_CODE (decl
) == VAR_DECL
)
7287 SET_DECL_REFERENCE_SLOT (decl
, error_mark_node
);
7291 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7292 mucking with forces it does not comprehend (i.e. initialization with a
7293 constructor). If we are at global scope and won't go into COMMON, fill
7294 it in with a dummy CONSTRUCTOR to force the variable into .data;
7295 otherwise we can use error_mark_node. */
7298 obscure_complex_init (decl
, init
)
7301 if (! flag_no_inline
&& TREE_STATIC (decl
))
7303 if (extract_init (decl
, init
))
7307 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7308 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7309 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7313 DECL_INITIAL (decl
) = error_mark_node
;
7318 /* Issue an error message if DECL is an uninitialized const variable. */
7321 check_for_uninitialized_const_var (decl
)
7324 tree type
= TREE_TYPE (decl
);
7326 /* ``Unless explicitly declared extern, a const object does not have
7327 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7329 if (TREE_CODE (decl
) == VAR_DECL
7330 && TREE_CODE (type
) != REFERENCE_TYPE
7331 && CP_TYPE_CONST_P (type
)
7332 && !TYPE_NEEDS_CONSTRUCTING (type
)
7333 && !DECL_INITIAL (decl
))
7334 cp_error ("uninitialized const `%D'", decl
);
7337 /* Finish processing of a declaration;
7338 install its line number and initial value.
7339 If the length of an array type is not known before,
7340 it must be determined now, from the initial value, or it is an error.
7342 Call `pop_obstacks' iff NEED_POP is nonzero.
7344 For C++, `cp_finish_decl' must be fairly evasive: it must keep initializers
7345 for aggregates that have constructors alive on the permanent obstack,
7346 so that the global initializing functions can be written at the end.
7348 INIT0 holds the value of an initializer that should be allowed to escape
7351 FLAGS is LOOKUP_ONLYCONVERTING is the = init syntax was used, else 0
7352 if the (init) syntax was used.
7354 For functions that take default parameters, DECL points to its
7355 "maximal" instantiation. `cp_finish_decl' must then also declared its
7356 subsequently lower and lower forms of instantiation, checking for
7357 ambiguity as it goes. This can be sped up later. */
7360 cp_finish_decl (decl
, init
, asmspec_tree
, need_pop
, flags
)
7367 tree cleanup
= NULL_TREE
, ttype
= NULL_TREE
;
7369 int temporary
= allocation_temporary_p ();
7370 const char *asmspec
= NULL
;
7371 int was_readonly
= 0;
7372 int already_used
= 0;
7375 /* If this is 0, then we did not change obstacks. */
7379 error ("assignment (not initialization) in declaration");
7383 /* If a name was specified, get the string. */
7385 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
7387 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
7389 cp_error ("Cannot initialize `%D' to namespace `%D'",
7394 if (current_class_type
7395 && DECL_REAL_CONTEXT (decl
) == current_class_type
7396 && TYPE_BEING_DEFINED (current_class_type
)
7397 && (DECL_INITIAL (decl
) || init
))
7398 DECL_DEFINED_IN_CLASS_P (decl
) = 1;
7400 if (TREE_CODE (decl
) == VAR_DECL
7401 && DECL_CONTEXT (decl
)
7402 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7403 && DECL_CONTEXT (decl
) != current_namespace
7406 /* Leave the namespace of the object. */
7407 pop_decl_namespace ();
7410 /* If the type of the thing we are declaring either has
7411 a constructor, or has a virtual function table pointer,
7412 AND its initialization was accepted by `start_decl',
7413 then we stayed on the permanent obstack through the
7414 declaration, otherwise, changed obstacks as GCC would. */
7416 type
= TREE_TYPE (decl
);
7418 if (type
== error_mark_node
)
7420 if (toplevel_bindings_p () && temporary
)
7421 end_temporary_allocation ();
7426 if (TYPE_HAS_MUTABLE_P (type
))
7427 TREE_READONLY (decl
) = 0;
7429 if (processing_template_decl
)
7431 if (init
&& DECL_INITIAL (decl
))
7432 DECL_INITIAL (decl
) = copy_to_permanent (init
);
7436 /* Take care of TYPE_DECLs up front. */
7437 if (TREE_CODE (decl
) == TYPE_DECL
)
7439 if (init
&& DECL_INITIAL (decl
))
7441 /* typedef foo = bar; store the type of bar as the type of foo. */
7442 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
7443 DECL_INITIAL (decl
) = init
= NULL_TREE
;
7445 if (type
!= error_mark_node
7446 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
7448 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
7449 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
7450 set_identifier_type_value (DECL_NAME (decl
), type
);
7451 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
7453 GNU_xref_decl (current_function_decl
, decl
);
7455 /* If we have installed this as the canonical typedef for this
7456 type, and that type has not been defined yet, delay emitting
7457 the debug information for it, as we will emit it later. */
7458 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
7459 && TYPE_SIZE (TREE_TYPE (decl
)) == NULL_TREE
)
7460 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
7462 rest_of_decl_compilation (decl
, NULL_PTR
,
7463 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
7467 if (TREE_CODE (decl
) != FUNCTION_DECL
)
7468 ttype
= target_type (type
);
7470 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
7471 && TYPE_NEEDS_CONSTRUCTING (type
))
7473 /* Currently, GNU C++ puts constants in text space, making them
7474 impossible to initialize. In the future, one would hope for
7475 an operating system which understood the difference between
7476 initialization and the running of a program. */
7478 TREE_READONLY (decl
) = 0;
7481 if (TREE_CODE (decl
) == FIELD_DECL
)
7483 if (init
&& init
!= error_mark_node
)
7484 my_friendly_assert (TREE_PERMANENT (init
), 147);
7488 /* This must override the asm specifier which was placed
7489 by grokclassfn. Lay this out fresh. */
7490 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
7491 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7492 make_decl_rtl (decl
, asmspec
, 0);
7495 /* If `start_decl' didn't like having an initialization, ignore it now. */
7496 else if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7498 else if (DECL_EXTERNAL (decl
))
7500 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
7502 if (TREE_STATIC (decl
))
7503 make_decl_rtl (decl
, NULL_PTR
, toplevel_bindings_p ());
7504 grok_reference_init (decl
, type
, init
);
7508 /* Check for certain invalid initializations. */
7511 if (TYPE_SIZE (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7513 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7516 if (TREE_CODE (type
) == ARRAY_TYPE
7517 && !TYPE_SIZE (complete_type (TREE_TYPE (type
))))
7519 cp_error ("elements of array `%#D' have incomplete type", decl
);
7524 GNU_xref_decl (current_function_decl
, decl
);
7527 while (TREE_CODE (core_type
) == ARRAY_TYPE
)
7528 core_type
= TREE_TYPE (core_type
);
7530 if (TREE_CODE (decl
) == FIELD_DECL
)
7532 else if (TREE_CODE (decl
) == CONST_DECL
)
7534 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7536 DECL_INITIAL (decl
) = init
;
7538 /* This will keep us from needing to worry about our obstacks. */
7539 my_friendly_assert (init
!= NULL_TREE
, 149);
7544 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7546 if (TREE_CODE (type
) == ARRAY_TYPE
)
7547 init
= digest_init (type
, init
, (tree
*) 0);
7548 else if (TREE_CODE (init
) == CONSTRUCTOR
7549 && TREE_HAS_CONSTRUCTOR (init
))
7551 if (TYPE_NON_AGGREGATE_CLASS (type
))
7553 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7555 init
= error_mark_node
;
7558 goto dont_use_constructor
;
7563 dont_use_constructor
:
7564 if (TREE_CODE (init
) != TREE_VEC
)
7565 init
= store_init_value (decl
, init
);
7569 /* We must hide the initializer so that expand_decl
7570 won't try to do something it does not understand. */
7571 init
= obscure_complex_init (decl
, init
);
7573 else if (DECL_EXTERNAL (decl
))
7575 else if (TREE_CODE_CLASS (TREE_CODE (type
)) == 't'
7576 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7578 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7580 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7581 cp_error ("structure `%D' with uninitialized const members", decl
);
7582 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7583 cp_error ("structure `%D' with uninitialized reference members",
7587 check_for_uninitialized_const_var (decl
);
7589 if (TYPE_SIZE (type
) != NULL_TREE
7590 && TYPE_NEEDS_CONSTRUCTING (type
))
7591 init
= obscure_complex_init (decl
, NULL_TREE
);
7595 check_for_uninitialized_const_var (decl
);
7597 /* For top-level declaration, the initial value was read in
7598 the temporary obstack. MAXINDEX, rtl, etc. to be made below
7599 must go in the permanent obstack; but don't discard the
7600 temporary data yet. */
7602 if (toplevel_bindings_p () && temporary
)
7603 end_temporary_allocation ();
7605 /* Deduce size of array from initialization, if not already known. */
7607 if (TREE_CODE (type
) == ARRAY_TYPE
7608 && TYPE_DOMAIN (type
) == NULL_TREE
7609 && TREE_CODE (decl
) != TYPE_DECL
)
7612 = (TREE_STATIC (decl
)
7613 /* Even if pedantic, an external linkage array
7614 may have incomplete type at first. */
7615 ? pedantic
&& ! DECL_EXTERNAL (decl
)
7616 : !DECL_EXTERNAL (decl
));
7617 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7618 int failure
= complete_array_type (type
, initializer
, do_default
);
7621 cp_error ("initializer fails to determine size of `%D'", decl
);
7626 cp_error ("array size missing in `%D'", decl
);
7627 /* If a `static' var's size isn't known, make it extern as
7628 well as static, so it does not get allocated. If it's not
7629 `static', then don't mark it extern; finish_incomplete_decl
7630 will give it a default size and it will get allocated. */
7631 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7632 DECL_EXTERNAL (decl
) = 1;
7635 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7636 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7638 cp_error ("zero-size array `%D'", decl
);
7640 layout_decl (decl
, 0);
7643 if (TREE_CODE (decl
) == VAR_DECL
)
7645 if (DECL_SIZE (decl
) == NULL_TREE
7646 && TYPE_SIZE (complete_type (TREE_TYPE (decl
))) != NULL_TREE
)
7647 layout_decl (decl
, 0);
7649 if (TREE_STATIC (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7651 /* A static variable with an incomplete type:
7652 that is an error if it is initialized.
7653 Otherwise, let it through, but if it is not `extern'
7654 then it may cause an error message later. */
7655 if (DECL_INITIAL (decl
) != NULL_TREE
)
7656 cp_error ("storage size of `%D' isn't known", decl
);
7659 else if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7661 /* An automatic variable with an incomplete type: that is an error.
7662 Don't talk about array types here, since we took care of that
7663 message in grokdeclarator. */
7664 cp_error ("storage size of `%D' isn't known", decl
);
7665 TREE_TYPE (decl
) = error_mark_node
;
7667 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7668 /* Let debugger know it should output info for this type. */
7669 note_debug_info_needed (ttype
);
7671 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7672 note_debug_info_needed (DECL_CONTEXT (decl
));
7674 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7675 && DECL_SIZE (decl
) != NULL_TREE
7676 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7678 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7679 constant_expression_warning (DECL_SIZE (decl
));
7681 cp_error ("storage size of `%D' isn't constant", decl
);
7684 if (! DECL_EXTERNAL (decl
) && TYPE_NEEDS_DESTRUCTOR (type
)
7685 /* Cleanups for static variables are handled by `finish_file'. */
7686 && ! TREE_STATIC (decl
))
7688 int yes
= suspend_momentary ();
7689 cleanup
= maybe_build_cleanup (decl
);
7690 resume_momentary (yes
);
7693 /* PARM_DECLs get cleanups, too. */
7694 else if (TREE_CODE (decl
) == PARM_DECL
&& TYPE_NEEDS_DESTRUCTOR (type
))
7697 end_temporary_allocation ();
7698 cleanup
= maybe_build_cleanup (decl
);
7700 resume_temporary_allocation ();
7703 /* Output the assembler code and/or RTL code for variables and functions,
7704 unless the type is an undefined structure or union.
7705 If not, it will get done when the type is completed. */
7707 was_incomplete
= (DECL_SIZE (decl
) == NULL_TREE
);
7709 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
7710 || TREE_CODE (decl
) == RESULT_DECL
)
7712 /* ??? FIXME: What about nested classes? */
7713 int toplev
= toplevel_bindings_p ();
7715 = (TREE_STATIC (decl
) && TYPE_NEEDS_DESTRUCTOR (type
)
7716 && allocation_temporary_p ());
7719 end_temporary_allocation ();
7721 /* Static data in a function with comdat linkage also has comdat
7723 if (TREE_CODE (decl
) == VAR_DECL
7724 && TREE_STATIC (decl
)
7725 /* Don't mess with __FUNCTION__. */
7726 && ! TREE_ASM_WRITTEN (decl
)
7727 && current_function_decl
7728 && DECL_CONTEXT (decl
) == current_function_decl
7729 && (DECL_THIS_INLINE (current_function_decl
)
7730 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7731 && TREE_PUBLIC (current_function_decl
))
7733 /* Rather than try to get this right with inlining, we suppress
7734 inlining of such functions. */
7735 current_function_cannot_inline
7736 = "function with static variable cannot be inline";
7738 /* If flag_weak, we don't need to mess with this, as we can just
7739 make the function weak, and let it refer to its unique local
7740 copy. This works because we don't allow the function to be
7744 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7746 TREE_PUBLIC (decl
) = 1;
7747 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7749 else if (DECL_INITIAL (decl
) == NULL_TREE
7750 || DECL_INITIAL (decl
) == error_mark_node
)
7752 TREE_PUBLIC (decl
) = 1;
7753 DECL_COMMON (decl
) = 1;
7755 /* else we lose. We can only do this if we can use common,
7756 which we can't if it has been initialized. */
7758 if (TREE_PUBLIC (decl
))
7759 DECL_ASSEMBLER_NAME (decl
)
7760 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7761 else if (! DECL_ARTIFICIAL (decl
))
7763 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7764 cp_warning_at (" you can work around this by removing the initializer", decl
);
7769 else if (TREE_CODE (decl
) == VAR_DECL
7770 && DECL_LANG_SPECIFIC (decl
)
7771 && DECL_COMDAT (decl
))
7772 /* Set it up again; we might have set DECL_INITIAL since the
7774 comdat_linkage (decl
);
7776 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_VIRTUAL_P (decl
))
7777 make_decl_rtl (decl
, NULL_PTR
, toplev
);
7778 else if (TREE_CODE (decl
) == VAR_DECL
7779 && TREE_READONLY (decl
)
7780 && DECL_INITIAL (decl
) != NULL_TREE
7781 && DECL_INITIAL (decl
) != error_mark_node
7782 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
7784 DECL_INITIAL (decl
) = save_expr (DECL_INITIAL (decl
));
7787 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7790 && TREE_STATIC (decl
)
7791 && ! TREE_SIDE_EFFECTS (decl
)
7792 && ! TREE_PUBLIC (decl
)
7793 && ! DECL_EXTERNAL (decl
)
7794 && ! TYPE_NEEDS_DESTRUCTOR (type
)
7795 && DECL_MODE (decl
) != BLKmode
)
7797 /* If this variable is really a constant, then fill its DECL_RTL
7798 slot with something which won't take up storage.
7799 If something later should take its address, we can always give
7800 it legitimate RTL at that time. */
7801 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
7802 store_expr (DECL_INITIAL (decl
), DECL_RTL (decl
), 0);
7803 TREE_ASM_WRITTEN (decl
) = 1;
7805 else if (toplev
&& ! TREE_PUBLIC (decl
))
7807 /* If this is a static const, change its apparent linkage
7808 if it belongs to a #pragma interface. */
7809 if (!interface_unknown
)
7811 TREE_PUBLIC (decl
) = 1;
7812 DECL_EXTERNAL (decl
) = interface_only
;
7814 make_decl_rtl (decl
, asmspec
, toplev
);
7817 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7819 else if (TREE_CODE (decl
) == VAR_DECL
7820 && DECL_LANG_SPECIFIC (decl
)
7821 && DECL_IN_AGGR_P (decl
))
7823 if (TREE_STATIC (decl
))
7825 if (init
== NULL_TREE
7826 #ifdef DEFAULT_STATIC_DEFS
7827 /* If this code is dead, then users must
7828 explicitly declare static member variables
7829 outside the class def'n as well. */
7830 && TYPE_NEEDS_CONSTRUCTING (type
)
7834 DECL_EXTERNAL (decl
) = 1;
7835 make_decl_rtl (decl
, asmspec
, 1);
7838 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7841 /* Just a constant field. Should not need any rtl. */
7845 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7848 resume_temporary_allocation ();
7850 if (!abstract_virtuals_error (decl
, core_type
)
7851 && (TREE_CODE (type
) == FUNCTION_TYPE
7852 || TREE_CODE (type
) == METHOD_TYPE
))
7853 abstract_virtuals_error (decl
, TREE_TYPE (type
));
7855 if (TREE_CODE (decl
) == FUNCTION_DECL
)
7857 else if (DECL_EXTERNAL (decl
)
7858 && ! (DECL_LANG_SPECIFIC (decl
)
7859 && DECL_NOT_REALLY_EXTERN (decl
)))
7862 DECL_INITIAL (decl
) = init
;
7864 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
7866 /* Cleanups for static variables are handled by `finish_file'. */
7867 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7868 || TYPE_NEEDS_DESTRUCTOR (type
))
7869 expand_static_init (decl
, init
);
7873 /* This is a declared decl which must live until the
7874 end of the binding contour. It may need a cleanup. */
7876 /* Recompute the RTL of a local array now
7877 if it used to be an incomplete type. */
7878 if (was_incomplete
&& ! TREE_STATIC (decl
))
7880 /* If we used it already as memory, it must stay in memory. */
7881 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7882 /* If it's still incomplete now, no init will save it. */
7883 if (DECL_SIZE (decl
) == NULL_TREE
)
7884 DECL_INITIAL (decl
) = NULL_TREE
;
7887 else if (! TREE_ASM_WRITTEN (decl
)
7888 && (TYPE_SIZE (type
) != NULL_TREE
7889 || TREE_CODE (type
) == ARRAY_TYPE
))
7891 /* Do this here, because we did not expand this decl's
7892 rtl in start_decl. */
7893 if (DECL_RTL (decl
) == NULL_RTX
)
7897 /* XXX: Why don't we use decl here? */
7898 /* Ans: Because it was already expanded? */
7899 if (! expand_decl_cleanup (NULL_TREE
, cleanup
))
7900 cp_error ("parser lost in parsing declaration of `%D'",
7902 /* Cleanup used up here. */
7903 cleanup
= NULL_TREE
;
7907 if (current_binding_level
->is_for_scope
)
7909 struct binding_level
*outer
7910 = current_binding_level
->level_chain
;
7912 /* Check to see if the same name is already bound at
7913 the outer level, either because it was directly declared,
7914 or because a dead for-decl got preserved. In either case,
7915 the code would not have been valid under the ARM
7916 scope rules, so clear is_for_scope for the
7917 current_binding_level.
7919 Otherwise, we need to preserve the temp slot for decl
7920 to last into the outer binding level. */
7923 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7925 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7926 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7928 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7930 BINDING_VALUE (outer_binding
)
7931 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7932 current_binding_level
->is_for_scope
= 0;
7934 else if (DECL_IN_MEMORY_P (decl
))
7935 preserve_temp_slots (DECL_RTL (decl
));
7938 expand_start_target_temps ();
7940 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7942 /* Compute and store the initial value. */
7943 expand_decl_init (decl
);
7944 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7946 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7948 emit_line_note (DECL_SOURCE_FILE (decl
),
7949 DECL_SOURCE_LINE (decl
));
7950 /* We call push_momentary here so that when
7951 finish_expr_stmt clears the momentary obstack it
7952 doesn't destory any momentary expressions we may
7953 have lying around. Although cp_finish_decl is
7954 usually called at the end of a declaration
7955 statement, it may also be called for a temporary
7956 object in the middle of an expression. */
7958 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7962 /* Set this to 0 so we can tell whether an aggregate which
7963 was initialized was ever used. Don't do this if it has a
7964 destructor, so we don't complain about the 'resource
7965 allocation is initialization' idiom. */
7966 /* Now set attribute((unused)) on types so decls of
7967 that type will be marked used. (see TREE_USED, above.)
7968 This avoids the warning problems this particular code
7969 tried to work around. */
7971 if (TYPE_NEEDS_CONSTRUCTING (type
)
7973 && cleanup
== NULL_TREE
7974 && DECL_NAME (decl
))
7975 TREE_USED (decl
) = 0;
7978 TREE_USED (decl
) = 1;
7981 /* Cleanup any temporaries needed for the initial value. */
7982 expand_end_target_temps ();
7984 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7986 /* Store the cleanup, if there was one. */
7989 if (! expand_decl_cleanup (decl
, cleanup
))
7990 cp_error ("parser lost in parsing declaration of `%D'",
7997 /* Undo call to `pushclass' that was done in `start_decl'
7998 due to initialization of qualified member variable.
7999 I.e., Foo::x = 10; */
8001 tree context
= DECL_REAL_CONTEXT (decl
);
8003 && TREE_CODE_CLASS (TREE_CODE (context
)) == 't'
8004 && (TREE_CODE (decl
) == VAR_DECL
8005 /* We also have a pushclass done that we need to undo here
8006 if we're at top level and declare a method. */
8007 || TREE_CODE (decl
) == FUNCTION_DECL
)
8008 /* If size hasn't been set, we're still defining it,
8009 and therefore inside the class body; don't pop
8010 the binding level.. */
8011 && TYPE_SIZE (context
) != NULL_TREE
8012 && context
== current_class_type
)
8013 pop_nested_class ();
8019 /* If requested, warn about definitions of large data objects. */
8021 if (warn_larger_than
8022 && ! processing_template_decl
8023 && (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
8024 && !DECL_EXTERNAL (decl
))
8026 register tree decl_size
= DECL_SIZE (decl
);
8028 if (decl_size
&& TREE_CODE (decl_size
) == INTEGER_CST
)
8030 unsigned units
= TREE_INT_CST_LOW (decl_size
) / BITS_PER_UNIT
;
8032 if (units
> larger_than_size
)
8033 warning_with_decl (decl
, "size of `%s' is %u bytes", units
);
8039 /* Resume permanent allocation, if not within a function. */
8040 /* The corresponding push_obstacks_nochange is in start_decl,
8041 start_method, groktypename, and in grokfield. */
8046 TREE_READONLY (decl
) = 1;
8049 /* This is here for a midend callback from c-common.c */
8052 finish_decl (decl
, init
, asmspec_tree
)
8056 cp_finish_decl (decl
, init
, asmspec_tree
, 1, 0);
8060 expand_static_init (decl
, init
)
8064 tree oldstatic
= value_member (decl
, static_aggregates
);
8068 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
8069 cp_error ("multiple initializations given for `%D'", decl
);
8071 else if (! toplevel_bindings_p ())
8073 /* Emit code to perform this initialization but once. */
8078 /* Remember this information until end of file. */
8079 push_obstacks (&permanent_obstack
, &permanent_obstack
);
8081 /* Emit code to perform this initialization but once. This code
8084 static int temp = 0;
8086 // Do initialization.
8088 // Register variable for destruction at end of program.
8091 Note that the `temp' variable is only set to 1 *after* the
8092 initialization is complete. This ensures that an exception,
8093 thrown during the construction, will cause the variable to
8094 reinitialized when we pass through this code again, as per:
8098 If the initialization exits by throwing an exception, the
8099 initialization is not complete, so it will be tried again
8100 the next time control enters the declaration.
8102 In theory, this process should be thread-safe, too; multiple
8103 threads should not be able to initialize the variable more
8104 than once. We don't yet attempt to ensure thread-safety. */
8105 temp
= get_temp_name (integer_type_node
, 1);
8106 rest_of_decl_compilation (temp
, NULL_PTR
, 0, 0);
8108 /* Begin the conditional initialization. */
8109 expand_start_cond (build_binary_op (EQ_EXPR
, temp
,
8110 integer_zero_node
), 0);
8112 /* Do the initialization itself. */
8113 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
8114 || (init
&& TREE_CODE (init
) == TREE_LIST
))
8115 assignment
= build_aggr_init (decl
, init
, 0);
8117 assignment
= build_modify_expr (decl
, NOP_EXPR
, init
);
8119 assignment
= NULL_TREE
;
8121 /* Once the assignment is complete, set TEMP to 1. Since the
8122 construction of the static object is complete at this point,
8123 we want to make sure TEMP is set to 1 even if a temporary
8124 constructed during the initialization throws an exception
8125 when it is destroyed. So, we combine the initialization and
8126 the assignment to TEMP into a single expression, ensuring
8127 that when we call finish_expr_stmt the cleanups will not be
8128 run until after TEMP is set to 1. */
8129 temp_init
= build_modify_expr (temp
, NOP_EXPR
, integer_one_node
);
8132 assignment
= tree_cons (NULL_TREE
, assignment
,
8133 build_tree_list (NULL_TREE
,
8135 assignment
= build_compound_expr (assignment
);
8138 assignment
= temp_init
;
8139 finish_expr_stmt (assignment
);
8141 /* Use atexit to register a function for destroying this static
8143 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
8145 tree cleanup
, fcall
;
8146 static tree Atexit
= 0;
8147 int saved_flag_access_control
;
8151 tree atexit_fndecl
, PFV
, pfvlist
;
8152 /* Remember this information until end of file. */
8153 push_obstacks (&permanent_obstack
, &permanent_obstack
);
8154 PFV
= build_pointer_type (build_function_type
8155 (void_type_node
, void_list_node
));
8157 pfvlist
= tree_cons (NULL_TREE
, PFV
, void_list_node
);
8159 push_lang_context (lang_name_c
);
8160 /* Note that we do not call pushdecl for this function;
8161 there's no reason that this declaration should be
8162 accessible to anyone. */
8164 = define_function ("atexit",
8165 build_function_type (void_type_node
,
8170 mark_used (atexit_fndecl
);
8171 Atexit
= default_conversion (atexit_fndecl
);
8172 pop_lang_context ();
8176 /* Call build_cleanup before we enter the anonymous function
8177 so that any access checks will be done relative to the
8178 current scope, rather than the scope of the anonymous
8180 build_cleanup (decl
);
8182 /* Now start the function. */
8183 cleanup
= start_anon_func ();
8185 /* Now, recompute the cleanup. It may contain SAVE_EXPRs
8186 that refer to the original function, rather than the
8187 anonymous one. That will make the back-end think that
8188 nested functions are in use, which causes confusion. */
8189 saved_flag_access_control
= flag_access_control
;
8190 flag_access_control
= 0;
8191 fcall
= build_cleanup (decl
);
8192 flag_access_control
= saved_flag_access_control
;
8194 /* Finish off the function. */
8195 expand_expr_stmt (fcall
);
8198 /* Call atexit with the cleanup function. */
8199 mark_addressable (cleanup
);
8200 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
8201 fcall
= build_function_call (Atexit
,
8202 expr_tree_cons (NULL_TREE
,
8205 expand_expr_stmt (fcall
);
8209 /* Resume old (possibly temporary) allocation. */
8214 /* This code takes into account memory allocation policy of
8215 `start_decl'. Namely, if TYPE_NEEDS_CONSTRUCTING does not
8216 hold for this object, then we must make permanent the storage
8217 currently in the temporary obstack. */
8218 if (!TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
8219 preserve_initializer ();
8220 static_aggregates
= perm_tree_cons (init
, decl
, static_aggregates
);
8224 /* Make TYPE a complete type based on INITIAL_VALUE.
8225 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8226 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8229 complete_array_type (type
, initial_value
, do_default
)
8230 tree type
, initial_value
;
8233 register tree maxindex
= NULL_TREE
;
8236 /* Allocate on the same obstack as TYPE. */
8237 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
8241 /* Note MAXINDEX is really the maximum index,
8242 one less than the size. */
8243 if (TREE_CODE (initial_value
) == STRING_CST
)
8246 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8247 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8250 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8252 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8253 maxindex
= size_binop (MINUS_EXPR
, integer_zero_node
, size_one_node
);
8254 for (; elts
; elts
= TREE_CHAIN (elts
))
8256 if (TREE_PURPOSE (elts
))
8257 maxindex
= TREE_PURPOSE (elts
);
8259 maxindex
= size_binop (PLUS_EXPR
, maxindex
, size_one_node
);
8261 maxindex
= copy_node (maxindex
);
8265 /* Make an error message unless that happened already. */
8266 if (initial_value
!= error_mark_node
)
8269 initial_value
= NULL_TREE
;
8271 /* Prevent further error messages. */
8272 maxindex
= build_int_2 (0, 0);
8279 maxindex
= build_int_2 (0, 0);
8288 domain
= build_index_type (maxindex
);
8289 TYPE_DOMAIN (type
) = domain
;
8291 if (! TREE_TYPE (maxindex
))
8292 TREE_TYPE (maxindex
) = domain
;
8294 itype
= TREE_TYPE (initial_value
);
8297 if (itype
&& !TYPE_DOMAIN (itype
))
8298 TYPE_DOMAIN (itype
) = domain
;
8299 /* The type of the main variant should never be used for arrays
8300 of different sizes. It should only ever be completed with the
8301 size of the array. */
8302 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8303 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8308 /* Lay out the type now that we can get the real answer. */
8315 /* Return zero if something is declared to be a member of type
8316 CTYPE when in the context of CUR_TYPE. STRING is the error
8317 message to print in that case. Otherwise, quietly return 1. */
8320 member_function_or_else (ctype
, cur_type
, string
)
8321 tree ctype
, cur_type
;
8324 if (ctype
&& ctype
!= cur_type
)
8326 error (string
, TYPE_NAME_STRING (ctype
));
8332 /* Subroutine of `grokdeclarator'. */
8334 /* Generate errors possibly applicable for a given set of specifiers.
8335 This is for ARM $7.1.2. */
8338 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8341 int virtualp
, quals
, friendp
, raises
, inlinep
;
8344 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8346 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8348 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8351 cp_error_at ("`%D' declared as a friend", object
);
8353 cp_error_at ("`%D' declared with an exception specification", object
);
8356 /* CTYPE is class type, or null if non-class.
8357 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8359 DECLARATOR is the function's name.
8360 VIRTUALP is truthvalue of whether the function is virtual or not.
8361 FLAGS are to be passed through to `grokclassfn'.
8362 QUALS are qualifiers indicating whether the function is `const'
8364 RAISES is a list of exceptions that this function can raise.
8365 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8366 not look, and -1 if we should not call `grokclassfn' at all.
8368 Returns `NULL_TREE' if something goes wrong, after issuing
8369 applicable error messages. */
8372 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8373 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8374 template_count
, in_namespace
)
8377 tree orig_declarator
;
8379 enum overload_flags flags
;
8381 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8385 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8386 int has_default_arg
= 0;
8390 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8391 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8397 type
= build_exception_variant (type
, raises
);
8400 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8401 /* Propagate volatile out from type to decl. */
8402 if (TYPE_VOLATILE (type
))
8403 TREE_THIS_VOLATILE (decl
) = 1;
8405 /* If this decl has namespace scope, set that up. */
8407 set_decl_namespace (decl
, in_namespace
, friendp
);
8408 else if (publicp
&& ! ctype
)
8409 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8411 /* `main' and builtins have implicit 'C' linkage. */
8412 if ((MAIN_NAME_P (declarator
)
8413 || (IDENTIFIER_LENGTH (declarator
) > 10
8414 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8415 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8416 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8417 && current_lang_name
== lang_name_cplusplus
8418 && ctype
== NULL_TREE
8419 /* NULL_TREE means global namespace. */
8420 && DECL_CONTEXT (decl
) == NULL_TREE
)
8421 DECL_LANGUAGE (decl
) = lang_c
;
8423 /* Should probably propagate const out from type to decl I bet (mrs). */
8426 DECL_STATIC_FUNCTION_P (decl
) = 1;
8427 DECL_CONTEXT (decl
) = ctype
;
8431 DECL_CLASS_CONTEXT (decl
) = ctype
;
8433 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8435 if (processing_template_decl
)
8436 error ("cannot declare `main' to be a template");
8438 error ("cannot declare `main' to be inline");
8440 error ("cannot declare `main' to be static");
8445 /* Members of anonymous types and local classes have no linkage; make
8447 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8448 || hack_decl_function_context (TYPE_MAIN_DECL (ctype
))))
8453 /* [basic.link]: A name with no linkage (notably, the name of a class
8454 or enumeration declared in a local scope) shall not be used to
8455 declare an entity with linkage.
8457 Only check this for public decls for now. */
8458 t
= no_linkage_check (TREE_TYPE (decl
));
8461 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8463 if (DECL_LANGUAGE (decl
) == lang_c
)
8464 /* Allow this; it's pretty common in C. */;
8466 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8470 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8475 TREE_PUBLIC (decl
) = publicp
;
8478 DECL_INTERFACE_KNOWN (decl
) = 1;
8479 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8483 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8485 DECL_EXTERNAL (decl
) = 1;
8486 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8488 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8489 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8493 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8494 grok_op_properties (decl
, virtualp
, check
< 0);
8496 if (ctype
&& hack_decl_function_context (decl
))
8497 DECL_NO_STATIC_CHAIN (decl
) = 1;
8499 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8500 if (TREE_PURPOSE (t
)
8501 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8503 has_default_arg
= 1;
8508 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8512 ("defining explicit specialization `%D' in friend declaration",
8516 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8518 /* Something like `template <class T> friend void f<T>()'. */
8519 cp_error ("template-id `%D' in declaration of primary template",
8525 /* A friend declaration of the form friend void f<>(). Record
8526 the information in the TEMPLATE_ID_EXPR. */
8527 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8528 DECL_TEMPLATE_INFO (decl
)
8529 = perm_tree_cons (TREE_OPERAND (orig_declarator
, 0),
8530 TREE_OPERAND (orig_declarator
, 1),
8533 if (has_default_arg
)
8535 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8542 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8549 if (has_default_arg
)
8550 add_defarg_fn (decl
);
8552 /* Plain overloading: will not be grok'd by grokclassfn. */
8553 if (! ctype
&& ! processing_template_decl
8554 && DECL_LANGUAGE (decl
) != lang_c
8555 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8556 set_mangled_name_for_decl (decl
);
8559 /* Make the init_value nonzero so pushdecl knows this is not
8560 tentative. error_mark_node is replaced later with the BLOCK. */
8561 DECL_INITIAL (decl
) = error_mark_node
;
8563 /* Caller will do the rest of this. */
8567 if (check
&& funcdef_flag
)
8568 DECL_INITIAL (decl
) = error_mark_node
;
8570 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8573 /* Just handle constructors here. We could do this
8574 inside the following if stmt, but I think
8575 that the code is more legible by breaking this
8576 case out. See comments below for what each of
8577 the following calls is supposed to do. */
8578 DECL_CONSTRUCTOR_P (decl
) = 1;
8580 grokclassfn (ctype
, decl
, flags
, quals
);
8582 decl
= check_explicit_specialization (orig_declarator
, decl
,
8584 2 * (funcdef_flag
!= 0) +
8585 4 * (friendp
!= 0));
8586 if (decl
== error_mark_node
)
8589 if ((! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8592 tmp
= check_classfn (ctype
, decl
);
8594 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8595 tmp
= DECL_TEMPLATE_RESULT(tmp
);
8597 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8598 cp_error ("definition of implicitly-declared `%D'", tmp
);
8599 if (tmp
&& duplicate_decls (decl
, tmp
))
8602 if (! grok_ctor_properties (ctype
, decl
))
8609 /* Function gets the ugly name, field gets the nice one.
8610 This call may change the type of the function (because
8611 of default parameters)! */
8612 if (ctype
!= NULL_TREE
)
8613 grokclassfn (ctype
, decl
, flags
, quals
);
8615 decl
= check_explicit_specialization (orig_declarator
, decl
,
8617 2 * (funcdef_flag
!= 0) +
8618 4 * (friendp
!= 0));
8619 if (decl
== error_mark_node
)
8622 if (ctype
!= NULL_TREE
8623 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8626 tmp
= check_classfn (ctype
, decl
);
8628 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8629 tmp
= DECL_TEMPLATE_RESULT (tmp
);
8631 if (tmp
&& DECL_STATIC_FUNCTION_P (tmp
)
8632 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8634 /* Remove the `this' parm added by grokclassfn.
8635 XXX Isn't this done in start_function, too? */
8636 revert_static_member_fn (&decl
, NULL
, NULL
);
8637 last_function_parms
= TREE_CHAIN (last_function_parms
);
8639 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8640 cp_error ("definition of implicitly-declared `%D'", tmp
);
8643 /* Attempt to merge the declarations. This can fail, in
8644 the case of some illegal specialization declarations. */
8645 if (!duplicate_decls (decl
, tmp
))
8646 cp_error ("no `%#D' member function declared in class `%T'",
8652 if (ctype
== NULL_TREE
|| check
)
8657 DECL_VIRTUAL_P (decl
) = 1;
8658 if (DECL_VINDEX (decl
) == NULL_TREE
)
8659 DECL_VINDEX (decl
) = error_mark_node
;
8660 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
8667 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
8670 RID_BIT_TYPE
*specbits_in
;
8676 RID_BIT_TYPE specbits
;
8678 specbits
= *specbits_in
;
8680 if (TREE_CODE (type
) == OFFSET_TYPE
)
8682 /* If you declare a static member so that it
8683 can be initialized, the code will reach here. */
8684 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
8685 type
= TREE_TYPE (type
);
8686 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8687 DECL_CONTEXT (decl
) = basetype
;
8688 DECL_CLASS_CONTEXT (decl
) = basetype
;
8689 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
, declarator
);
8696 context
= in_namespace
;
8697 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
8698 context
= current_namespace
;
8700 context
= NULL_TREE
;
8702 if (processing_template_decl
)
8704 /* If we're in a template, we need DECL_LANG_SPECIFIC so that
8705 we can call push_template_decl. */
8706 push_permanent_obstack ();
8707 decl
= build_lang_decl (VAR_DECL
, declarator
,
8708 complete_type (type
));
8712 decl
= build_decl (VAR_DECL
, declarator
, complete_type (type
));
8715 set_decl_namespace (decl
, context
, 0);
8717 context
= DECL_CONTEXT (decl
);
8718 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
8719 DECL_ASSEMBLER_NAME (decl
) = build_static_name (context
, declarator
);
8723 set_decl_namespace (decl
, in_namespace
, 0);
8725 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
8727 DECL_THIS_EXTERN (decl
) = 1;
8728 DECL_EXTERNAL (decl
) = !initialized
;
8731 /* In class context, static means one per class,
8732 public access, and static storage. */
8733 if (DECL_CLASS_SCOPE_P (decl
))
8735 TREE_PUBLIC (decl
) = 1;
8736 TREE_STATIC (decl
) = 1;
8737 DECL_EXTERNAL (decl
) = 0;
8739 /* At top level, either `static' or no s.c. makes a definition
8740 (perhaps tentative), and absence of `static' makes it public. */
8741 else if (toplevel_bindings_p ())
8743 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
8744 && (DECL_THIS_EXTERN (decl
) || ! constp
));
8745 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
8747 /* Not at top level, only `static' makes a static definition. */
8750 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
8751 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
8754 if (TREE_PUBLIC (decl
))
8756 /* [basic.link]: A name with no linkage (notably, the name of a class
8757 or enumeration declared in a local scope) shall not be used to
8758 declare an entity with linkage.
8760 Only check this for public decls for now. */
8761 tree t
= no_linkage_check (TREE_TYPE (decl
));
8764 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8765 /* Ignore for now; `enum { foo } e' is pretty common. */;
8767 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
8775 /* Create and return a canonical pointer to member function type, for
8776 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
8779 build_ptrmemfunc_type (type
)
8785 tree unqualified_variant
= NULL_TREE
;
8787 /* If a canonical type already exists for this type, use it. We use
8788 this method instead of type_hash_canon, because it only does a
8789 simple equality check on the list of field members. */
8791 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
8794 /* Make sure that we always have the unqualified pointer-to-member
8796 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8798 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
8800 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
8802 u
= make_lang_type (UNION_TYPE
);
8803 SET_IS_AGGR_TYPE (u
, 0);
8804 fields
[0] = build_lang_decl (FIELD_DECL
, pfn_identifier
, type
);
8805 fields
[1] = build_lang_decl (FIELD_DECL
, delta2_identifier
,
8807 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
8808 TYPE_NAME (u
) = NULL_TREE
;
8810 t
= make_lang_type (RECORD_TYPE
);
8812 /* Let the front-end know this is a pointer to member function... */
8813 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
8814 /* ... and not really an aggregate. */
8815 SET_IS_AGGR_TYPE (t
, 0);
8817 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
8819 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
8821 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
8822 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
8826 /* Zap out the name so that the back-end will give us the debugging
8827 information for this anonymous RECORD_TYPE. */
8828 TYPE_NAME (t
) = NULL_TREE
;
8830 /* If this is not the unqualified form of this pointer-to-member
8831 type, set the TYPE_MAIN_VARIANT for this type to be the
8832 unqualified type. Since they are actually RECORD_TYPEs that are
8833 not variants of each other, we must do this manually. */
8834 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8836 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
8837 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
8838 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
8839 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
8842 /* Cache this pointer-to-member type so that we can find it again
8844 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
8846 /* Seems to be wanted. */
8847 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
8852 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
8853 Check to see that the definition is valid. Issue appropriate error
8854 messages. Return 1 if the definition is particularly bad, or 0
8858 check_static_variable_definition (decl
, type
)
8862 /* Motion 10 at San Diego: If a static const integral data member is
8863 initialized with an integral constant expression, the initializer
8864 may appear either in the declaration (within the class), or in
8865 the definition, but not both. If it appears in the class, the
8866 member is a member constant. The file-scope definition is always
8868 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
8870 cp_error ("in-class initialization of static data member of non-integral type `%T'",
8872 /* If we just return the declaration, crashes will sometimes
8873 occur. We therefore return void_type_node, as if this was a
8874 friend declaration, to cause callers to completely ignore
8875 this declaration. */
8878 else if (!CP_TYPE_CONST_P (type
))
8879 cp_error ("ANSI C++ forbids in-class initialization of non-const static member `%D'",
8881 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
8882 cp_pedwarn ("ANSI C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
8887 /* Given declspecs and a declarator,
8888 determine the name and type of the object declared
8889 and construct a ..._DECL node for it.
8890 (In one case we can return a ..._TYPE node instead.
8891 For invalid input we sometimes return 0.)
8893 DECLSPECS is a chain of tree_list nodes whose value fields
8894 are the storage classes and type specifiers.
8896 DECL_CONTEXT says which syntactic context this declaration is in:
8897 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
8898 FUNCDEF for a function definition. Like NORMAL but a few different
8899 error messages in each case. Return value may be zero meaning
8900 this definition is too screwy to try to parse.
8901 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
8902 handle member functions (which have FIELD context).
8903 Return value may be zero meaning this definition is too screwy to
8905 PARM for a parameter declaration (either within a function prototype
8906 or before a function body). Make a PARM_DECL, or return void_type_node.
8907 CATCHPARM for a parameter declaration before a catch clause.
8908 TYPENAME if for a typename (in a cast or sizeof).
8909 Don't make a DECL node; just return the ..._TYPE node.
8910 FIELD for a struct or union field; make a FIELD_DECL.
8911 BITFIELD for a field with specified width.
8912 INITIALIZED is 1 if the decl has an initializer.
8914 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
8915 normal attributes in TREE_PURPOSE, or NULL_TREE.
8917 In the TYPENAME case, DECLARATOR is really an absolute declarator.
8918 It may also be so in the PARM case, for a prototype where the
8919 argument type is specified but not the name.
8921 This function is where the complicated C meanings of `static'
8922 and `extern' are interpreted.
8924 For C++, if there is any monkey business to do, the function which
8925 calls this one must do it, i.e., prepending instance variables,
8926 renaming overloaded function names, etc.
8928 Note that for this C++, it is an error to define a method within a class
8929 which does not belong to that class.
8931 Except in the case where SCOPE_REFs are implicitly known (such as
8932 methods within a class being redundantly qualified),
8933 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
8934 (class_name::decl_name). The caller must also deal with this.
8936 If a constructor or destructor is seen, and the context is FIELD,
8937 then the type gains the attribute TREE_HAS_x. If such a declaration
8938 is erroneous, NULL_TREE is returned.
8940 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
8941 function, these are the qualifiers to give to the `this' pointer.
8943 May return void_type_node if the declarator turned out to be a friend.
8944 See grokfield for details. */
8946 enum return_types
{ return_normal
, return_ctor
, return_dtor
, return_conversion
};
8949 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
8952 enum decl_context decl_context
;
8956 RID_BIT_TYPE specbits
;
8959 tree type
= NULL_TREE
;
8965 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
8966 int explicit_int
= 0;
8967 int explicit_char
= 0;
8968 int defaulted_int
= 0;
8969 tree typedef_decl
= NULL_TREE
;
8971 tree typedef_type
= NULL_TREE
;
8972 int funcdef_flag
= 0;
8973 enum tree_code innermost_code
= ERROR_MARK
;
8976 /* See the code below that used this. */
8977 tree decl_machine_attr
= NULL_TREE
;
8979 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
8980 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
8981 tree init
= NULL_TREE
;
8983 /* Keep track of what sort of function is being processed
8984 so that we can warn about default return values, or explicit
8985 return values which do not match prescribed defaults. */
8986 enum return_types return_type
= return_normal
;
8988 tree dname
= NULL_TREE
;
8989 tree ctype
= current_class_type
;
8990 tree ctor_return_type
= NULL_TREE
;
8991 enum overload_flags flags
= NO_SPECIAL
;
8992 tree quals
= NULL_TREE
;
8993 tree raises
= NULL_TREE
;
8994 int template_count
= 0;
8995 tree in_namespace
= NULL_TREE
;
8999 RIDBIT_RESET_ALL (specbits
);
9000 if (decl_context
== FUNCDEF
)
9001 funcdef_flag
= 1, decl_context
= NORMAL
;
9002 else if (decl_context
== MEMFUNCDEF
)
9003 funcdef_flag
= -1, decl_context
= FIELD
;
9004 else if (decl_context
== BITFIELD
)
9005 bitfield
= 1, decl_context
= FIELD
;
9007 /* Look inside a declarator for the name being declared
9008 and get it as a string, for an error message. */
9010 tree
*next
= &declarator
;
9014 while (next
&& *next
)
9017 switch (TREE_CODE (decl
))
9020 /* For attributes. */
9021 next
= &TREE_VALUE (decl
);
9026 next
= &TREE_OPERAND (decl
, 0);
9029 case BIT_NOT_EXPR
: /* For C++ destructors! */
9031 tree name
= TREE_OPERAND (decl
, 0);
9032 tree rename
= NULL_TREE
;
9034 my_friendly_assert (flags
== NO_SPECIAL
, 152);
9036 return_type
= return_dtor
;
9037 if (TREE_CODE (name
) == TYPE_DECL
)
9038 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
9039 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
9040 if (ctype
== NULL_TREE
)
9042 if (current_class_type
== NULL_TREE
)
9044 error ("destructors must be member functions");
9049 tree t
= constructor_name (current_class_name
);
9056 tree t
= constructor_name (ctype
);
9063 cp_error ("destructor `%T' must match class name `%T'",
9065 TREE_OPERAND (decl
, 0) = rename
;
9071 case ADDR_EXPR
: /* C++ reference declaration */
9076 innermost_code
= TREE_CODE (decl
);
9077 next
= &TREE_OPERAND (decl
, 0);
9081 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
9083 /* This is actually a variable declaration using
9084 constructor syntax. We need to call start_decl and
9085 cp_finish_decl so we can get the variable
9088 tree attributes
, prefix_attributes
;
9090 *next
= TREE_OPERAND (decl
, 0);
9091 init
= CALL_DECLARATOR_PARMS (decl
);
9095 attributes
= TREE_PURPOSE (attrlist
);
9096 prefix_attributes
= TREE_VALUE (attrlist
);
9100 attributes
= NULL_TREE
;
9101 prefix_attributes
= NULL_TREE
;
9104 decl
= start_decl (declarator
, declspecs
, 1,
9105 attributes
, prefix_attributes
);
9108 /* Look for __unused__ attribute */
9109 if (TREE_USED (TREE_TYPE (decl
)))
9110 TREE_USED (decl
) = 1;
9111 finish_decl (decl
, init
, NULL_TREE
);
9114 cp_error ("invalid declarator");
9117 innermost_code
= TREE_CODE (decl
);
9118 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
9119 ctype
= current_class_type
;
9121 && TREE_OPERAND (decl
, 0)
9122 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
9123 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
9124 == constructor_name_full (ctype
))
9125 || (DECL_NAME (TREE_OPERAND (decl
, 0))
9126 == constructor_name (ctype
)))))
9127 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9128 next
= &TREE_OPERAND (decl
, 0);
9130 if (ctype
!= NULL_TREE
9131 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
9132 && decl
== constructor_name (ctype
))
9134 return_type
= return_ctor
;
9135 ctor_return_type
= ctype
;
9140 case TEMPLATE_ID_EXPR
:
9142 tree fns
= TREE_OPERAND (decl
, 0);
9144 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9145 fns
= TREE_OPERAND (fns
, 0);
9148 if (TREE_CODE (dname
) == COMPONENT_REF
)
9149 dname
= TREE_OPERAND (dname
, 1);
9150 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9152 my_friendly_assert (is_overloaded_fn (dname
),
9154 dname
= DECL_NAME (get_first_fn (dname
));
9159 case IDENTIFIER_NODE
:
9160 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9167 cp_error ("declarator-id missing; using reserved word `%D'",
9169 name
= IDENTIFIER_POINTER (dname
);
9171 if (! IDENTIFIER_OPNAME_P (dname
)
9172 /* GNU/Linux headers use '__op'. Arrgh. */
9173 || (IDENTIFIER_TYPENAME_P (dname
) && ! TREE_TYPE (dname
)))
9174 name
= IDENTIFIER_POINTER (dname
);
9177 if (IDENTIFIER_TYPENAME_P (dname
))
9179 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9180 flags
= TYPENAME_FLAG
;
9181 ctor_return_type
= TREE_TYPE (dname
);
9182 return_type
= return_conversion
;
9184 name
= operator_name_string (dname
);
9191 /* Perform error checking, and decide on a ctype. */
9192 tree cname
= TREE_OPERAND (decl
, 0);
9193 if (cname
== NULL_TREE
)
9195 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9198 in_namespace
= TREE_OPERAND (decl
, 0);
9199 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9201 else if (! is_aggr_type (cname
, 1))
9202 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9203 /* Must test TREE_OPERAND (decl, 1), in case user gives
9204 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9205 else if (TREE_OPERAND (decl
, 1)
9206 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9208 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9209 || TREE_CODE (cname
) == TEMPLATE_TEMPLATE_PARM
)
9211 cp_error ("`%T::%D' is not a valid declarator", cname
,
9212 TREE_OPERAND (decl
, 1));
9213 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9214 cname
, TREE_OPERAND (decl
, 1));
9215 return void_type_node
;
9217 else if (ctype
== NULL_TREE
)
9219 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9220 TREE_OPERAND (decl
, 0) = ctype
;
9223 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9225 cp_error ("type `%T' is not derived from type `%T'",
9227 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9233 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9234 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9235 == constructor_name_full (ctype
))
9236 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9237 == constructor_name (ctype
))))
9238 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9239 next
= &TREE_OPERAND (decl
, 1);
9243 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9244 && constructor_name (ctype
) == decl
)
9246 return_type
= return_ctor
;
9247 ctor_return_type
= ctype
;
9249 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9250 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9251 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9252 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9254 return_type
= return_dtor
;
9255 ctor_return_type
= ctype
;
9257 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9258 next
= &TREE_OPERAND (decl
, 0);
9269 /* Parse error puts this typespec where
9270 a declarator should go. */
9271 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9272 if (TREE_TYPE (decl
) == current_class_type
)
9273 cp_error (" perhaps you want `%T' for a constructor",
9274 current_class_name
);
9275 dname
= DECL_NAME (decl
);
9276 name
= IDENTIFIER_POINTER (dname
);
9278 /* Avoid giving two errors for this. */
9279 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9281 declspecs
= temp_tree_cons (NULL_TREE
, integer_type_node
,
9288 cp_compiler_error ("`%D' as declarator", decl
);
9289 return 0; /* We used to do a 155 abort here. */
9296 /* A function definition's declarator must have the form of
9297 a function declarator. */
9299 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9302 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9303 && innermost_code
!= CALL_EXPR
9304 && ! (ctype
&& declspecs
== NULL_TREE
))
9306 cp_error ("declaration of `%D' as non-function", dname
);
9307 return void_type_node
;
9310 /* Anything declared one level down from the top level
9311 must be one of the parameters of a function
9312 (because the body is at least two levels down). */
9314 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9315 by not allowing C++ class definitions to specify their parameters
9316 with xdecls (must be spec.d in the parmlist).
9318 Since we now wait to push a class scope until we are sure that
9319 we are in a legitimate method context, we must set oldcname
9320 explicitly (since current_class_name is not yet alive).
9322 We also want to avoid calling this a PARM if it is in a namespace. */
9324 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
9326 struct binding_level
*b
= current_binding_level
;
9327 current_binding_level
= b
->level_chain
;
9328 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9329 decl_context
= PARM
;
9330 current_binding_level
= b
;
9333 /* Look through the decl specs and record which ones appear.
9334 Some typespecs are defined as built-in typenames.
9335 Others, the ones that are modifiers of other types,
9336 are represented by bits in SPECBITS: set the bits for
9337 the modifiers that appear. Storage class keywords are also in SPECBITS.
9339 If there is a typedef name or a type, store the type in TYPE.
9340 This includes builtin typedefs such as `int'.
9342 Set EXPLICIT_INT if the type is `int' or `char' and did not
9343 come from a user typedef.
9345 Set LONGLONG if `long' is mentioned twice.
9347 For C++, constructors and destructors have their own fast treatment. */
9349 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
9354 /* Certain parse errors slip through. For example,
9355 `int class;' is not caught by the parser. Try
9356 weakly to recover here. */
9357 if (TREE_CODE (spec
) != TREE_LIST
)
9360 id
= TREE_VALUE (spec
);
9362 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9364 if (id
== ridpointers
[(int) RID_INT
]
9365 || id
== ridpointers
[(int) RID_CHAR
]
9366 || id
== ridpointers
[(int) RID_BOOL
]
9367 || id
== ridpointers
[(int) RID_WCHAR
])
9371 if (id
== ridpointers
[(int) RID_BOOL
])
9372 error ("`bool' is now a keyword");
9374 cp_error ("extraneous `%T' ignored", id
);
9378 if (id
== ridpointers
[(int) RID_INT
])
9380 else if (id
== ridpointers
[(int) RID_CHAR
])
9382 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
9386 /* C++ aggregate types. */
9387 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
9390 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
9392 type
= IDENTIFIER_TYPE_VALUE (id
);
9396 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
9398 if (ridpointers
[i
] == id
)
9400 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
9402 if (pedantic
&& ! in_system_header
&& warn_long_long
)
9403 pedwarn ("ANSI C++ does not support `long long'");
9405 error ("`long long long' is too long for GCC");
9409 else if (RIDBIT_SETP (i
, specbits
))
9410 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
9411 RIDBIT_SET (i
, specbits
);
9416 /* C++ aggregate types. */
9417 else if (TREE_CODE (id
) == TYPE_DECL
|| TREE_CODE (id
) == TEMPLATE_DECL
)
9420 cp_error ("multiple declarations `%T' and `%T'", type
,
9424 type
= TREE_TYPE (id
);
9425 TREE_VALUE (spec
) = type
;
9430 error ("two or more data types in declaration of `%s'", name
);
9431 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9433 register tree t
= lookup_name (id
, 1);
9434 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
9435 error ("`%s' fails to be a typedef or built in type",
9436 IDENTIFIER_POINTER (id
));
9439 type
= TREE_TYPE (t
);
9441 /* See the code below that used this. */
9442 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
9447 else if (id
!= error_mark_node
)
9448 /* Can't change CLASS nodes into RECORD nodes here! */
9454 typedef_type
= type
;
9456 /* No type at all: default to `int', and set DEFAULTED_INT
9457 because it was not a user-defined typedef. */
9459 if (type
== NULL_TREE
9460 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
9461 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9462 || RIDBIT_SETP (RID_LONG
, specbits
)
9463 || RIDBIT_SETP (RID_SHORT
, specbits
)))
9465 /* These imply 'int'. */
9466 type
= integer_type_node
;
9470 if (type
== NULL_TREE
)
9473 if (return_type
== return_dtor
)
9474 type
= void_type_node
;
9475 else if (return_type
== return_ctor
)
9476 type
= build_pointer_type (ctor_return_type
);
9477 else if (return_type
== return_conversion
)
9478 type
= ctor_return_type
;
9481 /* We handle `main' specially here, because 'main () { }' is so
9482 common. With no options, it is allowed. With -Wreturn-type,
9483 it is a warning. It is only an error with -pedantic-errors. */
9484 int is_main
= (funcdef_flag
9485 && MAIN_NAME_P (dname
)
9486 && ctype
== NULL_TREE
9487 && in_namespace
== NULL_TREE
9488 && current_namespace
== global_namespace
);
9490 if (in_system_header
|| flag_ms_extensions
)
9491 /* Allow it, sigh. */;
9492 else if (pedantic
|| ! is_main
)
9493 cp_pedwarn ("ANSI C++ forbids declaration `%D' with no type",
9495 else if (warn_return_type
)
9496 cp_warning ("ANSI C++ forbids declaration `%D' with no type",
9499 type
= integer_type_node
;
9502 else if (return_type
== return_dtor
)
9504 error ("return type specification for destructor invalid");
9505 type
= void_type_node
;
9507 else if (return_type
== return_ctor
)
9509 error ("return type specification for constructor invalid");
9510 type
= build_pointer_type (ctor_return_type
);
9512 else if (return_type
== return_conversion
)
9514 if (!same_type_p (type
, ctor_return_type
))
9515 cp_error ("operator `%T' declared to return `%T'",
9516 ctor_return_type
, type
);
9518 cp_pedwarn ("return type specified for `operator %T'",
9521 type
= ctor_return_type
;
9526 /* Now process the modifiers that were specified
9527 and check for invalid combinations. */
9529 /* Long double is a special combination. */
9531 if (RIDBIT_SETP (RID_LONG
, specbits
)
9532 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
9534 RIDBIT_RESET (RID_LONG
, specbits
);
9535 type
= build_qualified_type (long_double_type_node
,
9536 CP_TYPE_QUALS (type
));
9539 /* Check all other uses of type modifiers. */
9541 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9542 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9543 || RIDBIT_SETP (RID_LONG
, specbits
)
9544 || RIDBIT_SETP (RID_SHORT
, specbits
))
9548 if (TREE_CODE (type
) == REAL_TYPE
)
9549 error ("short, signed or unsigned invalid for `%s'", name
);
9550 else if (TREE_CODE (type
) != INTEGER_TYPE
)
9551 error ("long, short, signed or unsigned invalid for `%s'", name
);
9552 else if (RIDBIT_SETP (RID_LONG
, specbits
)
9553 && RIDBIT_SETP (RID_SHORT
, specbits
))
9554 error ("long and short specified together for `%s'", name
);
9555 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9556 || RIDBIT_SETP (RID_SHORT
, specbits
))
9558 error ("long or short specified with char for `%s'", name
);
9559 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9560 || RIDBIT_SETP (RID_SHORT
, specbits
))
9561 && TREE_CODE (type
) == REAL_TYPE
)
9562 error ("long or short specified with floating type for `%s'", name
);
9563 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9564 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
9565 error ("signed and unsigned given together for `%s'", name
);
9569 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
9571 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
9573 if (flag_pedantic_errors
)
9578 /* Discard the type modifiers if they are invalid. */
9581 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
9582 RIDBIT_RESET (RID_SIGNED
, specbits
);
9583 RIDBIT_RESET (RID_LONG
, specbits
);
9584 RIDBIT_RESET (RID_SHORT
, specbits
);
9589 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
9590 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
9592 error ("complex invalid for `%s'", name
);
9593 RIDBIT_RESET (RID_COMPLEX
, specbits
);
9596 /* Decide whether an integer type is signed or not.
9597 Optionally treat bitfields as signed by default. */
9598 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9601 It is implementation-defined whether a plain (neither
9602 explicitly signed or unsigned) char, short, int, or long
9603 bit-field is signed or unsigned.
9605 Naturally, we extend this to long long as well. Note that
9606 this does not include wchar_t. */
9607 || (bitfield
&& !flag_signed_bitfields
9608 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
9609 /* A typedef for plain `int' without `signed' can be
9610 controlled just like plain `int', but a typedef for
9611 `signed int' cannot be so controlled. */
9613 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
9614 && (TREE_CODE (type
) == INTEGER_TYPE
9615 || TREE_CODE (type
) == CHAR_TYPE
)
9616 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
9619 type
= long_long_unsigned_type_node
;
9620 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9621 type
= long_unsigned_type_node
;
9622 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9623 type
= short_unsigned_type_node
;
9624 else if (type
== char_type_node
)
9625 type
= unsigned_char_type_node
;
9626 else if (typedef_decl
)
9627 type
= unsigned_type (type
);
9629 type
= unsigned_type_node
;
9631 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9632 && type
== char_type_node
)
9633 type
= signed_char_type_node
;
9635 type
= long_long_integer_type_node
;
9636 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9637 type
= long_integer_type_node
;
9638 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9639 type
= short_integer_type_node
;
9641 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
9643 /* If we just have "complex", it is equivalent to
9644 "complex double", but if any modifiers at all are specified it is
9645 the complex form of TYPE. E.g, "complex short" is
9646 "complex short int". */
9648 if (defaulted_int
&& ! longlong
9649 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
9650 || RIDBIT_SETP (RID_SHORT
, specbits
)
9651 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9652 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
9653 type
= complex_double_type_node
;
9654 else if (type
== integer_type_node
)
9655 type
= complex_integer_type_node
;
9656 else if (type
== float_type_node
)
9657 type
= complex_float_type_node
;
9658 else if (type
== double_type_node
)
9659 type
= complex_double_type_node
;
9660 else if (type
== long_double_type_node
)
9661 type
= complex_long_double_type_node
;
9663 type
= build_complex_type (type
);
9666 if (return_type
== return_conversion
9667 && (RIDBIT_SETP (RID_CONST
, specbits
)
9668 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
9669 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
9670 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
9673 /* Set CONSTP if this declaration is `const', whether by
9674 explicit specification or via a typedef.
9675 Likewise for VOLATILEP. */
9677 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
9679 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
9681 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
9682 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
9683 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
9684 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
9685 type
= cp_build_qualified_type (type
, type_quals
);
9687 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
9688 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
9689 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
9690 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
9691 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
9693 if (RIDBIT_SETP (RID_STATIC
, specbits
))
9694 staticp
= 1 + (decl_context
== FIELD
);
9696 if (virtualp
&& staticp
== 2)
9698 cp_error ("member `%D' cannot be declared both virtual and static",
9702 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
9703 RIDBIT_RESET (RID_FRIEND
, specbits
);
9705 /* $7.1.2, Function specifiers */
9706 if (friendp
&& explicitp
)
9707 error ("only declarations of constructors can be `explicit'");
9709 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
9711 if (decl_context
== PARM
)
9713 error ("non-member `%s' cannot be declared `mutable'", name
);
9714 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9716 else if (friendp
|| decl_context
== TYPENAME
)
9718 error ("non-object member `%s' cannot be declared `mutable'", name
);
9719 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9723 /* Warn if two storage classes are given. Default to `auto'. */
9725 if (RIDBIT_ANY_SET (specbits
))
9727 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
9728 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
9729 if (decl_context
== PARM
&& nclasses
> 0)
9730 error ("storage class specifiers invalid in parameter declarations");
9731 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9733 if (decl_context
== PARM
)
9734 error ("typedef declaration invalid in parameter declaration");
9737 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
9738 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
9741 /* Give error if `virtual' is used outside of class declaration. */
9743 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
9745 error ("virtual outside class declaration");
9748 if (current_class_name
== NULL_TREE
&& RIDBIT_SETP (RID_MUTABLE
, specbits
))
9750 error ("only members can be declared mutable");
9751 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9754 /* Static anonymous unions are dealt with here. */
9755 if (staticp
&& decl_context
== TYPENAME
9756 && TREE_CODE (declspecs
) == TREE_LIST
9757 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
9758 decl_context
= FIELD
;
9760 /* Warn about storage classes that are invalid for certain
9761 kinds of declarations (parameters, typenames, etc.). */
9764 error ("multiple storage classes in declaration of `%s'", name
);
9765 else if (decl_context
!= NORMAL
&& nclasses
> 0)
9767 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9768 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
9769 || RIDBIT_SETP (RID_AUTO
, specbits
)))
9771 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9773 else if (decl_context
== FIELD
9774 /* C++ allows static class elements */
9775 && RIDBIT_SETP (RID_STATIC
, specbits
))
9776 /* C++ also allows inlines and signed and unsigned elements,
9777 but in those cases we don't come in here. */
9781 if (decl_context
== FIELD
)
9783 tree tmp
= NULL_TREE
;
9784 register int op
= 0;
9788 /* Avoid trying to get an operand off an identifier node. */
9789 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
9792 tmp
= TREE_OPERAND (declarator
, 0);
9793 op
= IDENTIFIER_OPNAME_P (tmp
);
9795 error ("storage class specified for %s `%s'",
9796 op
? "member operator" : "field",
9797 op
? operator_name_string (tmp
) : name
);
9800 error (((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9801 ? "storage class specified for parameter `%s'"
9802 : "storage class specified for typename"), name
);
9803 RIDBIT_RESET (RID_REGISTER
, specbits
);
9804 RIDBIT_RESET (RID_AUTO
, specbits
);
9805 RIDBIT_RESET (RID_EXTERN
, specbits
);
9808 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
9810 if (toplevel_bindings_p ())
9812 /* It's common practice (and completely valid) to have a const
9813 be initialized and declared extern. */
9814 if (!(type_quals
& TYPE_QUAL_CONST
))
9815 warning ("`%s' initialized and declared `extern'", name
);
9818 error ("`%s' has both `extern' and initializer", name
);
9820 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
9821 && ! toplevel_bindings_p ())
9822 error ("nested function `%s' declared `extern'", name
);
9823 else if (toplevel_bindings_p ())
9825 if (RIDBIT_SETP (RID_AUTO
, specbits
))
9826 error ("top-level declaration of `%s' specifies `auto'", name
);
9829 if (nclasses
> 0 && friendp
)
9830 error ("storage class specifiers invalid in friend function declarations");
9832 /* Now figure out the structure of the declarator proper.
9833 Descend through it, creating more complex types, until we reach
9834 the declared identifier (or NULL_TREE, in an absolute declarator). */
9836 inner_attrs
= NULL_TREE
;
9839 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
9840 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
9842 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
9843 an INDIRECT_REF (for *...),
9844 a CALL_EXPR (for ...(...)),
9845 an identifier (for the name being declared)
9846 or a null pointer (for the place in an absolute declarator
9847 where the name was omitted).
9848 For the last two cases, we have just exited the loop.
9850 For C++ it could also be
9851 a SCOPE_REF (for class :: ...). In this case, we have converted
9852 sensible names to types, and those are the values we use to
9853 qualify the member name.
9854 an ADDR_EXPR (for &...),
9855 a BIT_NOT_EXPR (for destructors)
9857 At this point, TYPE is the type of elements of an array,
9858 or for a function to return, or for a pointer to point to.
9859 After this sequence of ifs, TYPE is the type of the
9860 array or function or pointer, and DECLARATOR has had its
9861 outermost layer removed. */
9863 if (type
== error_mark_node
)
9865 if (TREE_CODE (declarator
) == SCOPE_REF
)
9866 declarator
= TREE_OPERAND (declarator
, 1);
9868 declarator
= TREE_OPERAND (declarator
, 0);
9871 if (quals
!= NULL_TREE
9872 && (declarator
== NULL_TREE
9873 || TREE_CODE (declarator
) != SCOPE_REF
))
9875 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
9876 ctype
= TYPE_METHOD_BASETYPE (type
);
9877 if (ctype
!= NULL_TREE
)
9879 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
9880 ctype
= grok_method_quals (ctype
, dummy
, quals
);
9881 type
= TREE_TYPE (dummy
);
9886 /* See the comment for the TREE_LIST case, below. */
9889 else if (inner_attrs
)
9891 decl_attributes (type
, inner_attrs
, NULL_TREE
);
9892 inner_attrs
= NULL_TREE
;
9895 switch (TREE_CODE (declarator
))
9899 /* We encode a declarator with embedded attributes using
9900 a TREE_LIST. The attributes apply to the declarator
9901 directly inside them, so we have to skip an iteration
9902 before applying them to the type. If the declarator just
9903 inside is the declarator-id, we apply the attrs to the
9905 inner_attrs
= TREE_PURPOSE (declarator
);
9907 declarator
= TREE_VALUE (declarator
);
9913 register tree itype
= NULL_TREE
;
9914 register tree size
= TREE_OPERAND (declarator
, 1);
9915 /* The index is a signed object `sizetype' bits wide. */
9916 tree index_type
= signed_type (sizetype
);
9918 declarator
= TREE_OPERAND (declarator
, 0);
9920 /* Check for some types that there cannot be arrays of. */
9922 if (TREE_CODE (type
) == VOID_TYPE
)
9924 cp_error ("declaration of `%D' as array of voids", dname
);
9925 type
= error_mark_node
;
9928 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9930 cp_error ("declaration of `%D' as array of functions", dname
);
9931 type
= error_mark_node
;
9934 /* ARM $8.4.3: Since you can't have a pointer to a reference,
9935 you can't have arrays of references. If we allowed them,
9936 then we'd be saying x[i] is valid for an array x, but
9937 then you'd have to ask: what does `*(x + i)' mean? */
9938 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9940 if (decl_context
== TYPENAME
)
9941 cp_error ("cannot make arrays of references");
9943 cp_error ("declaration of `%D' as array of references",
9945 type
= error_mark_node
;
9948 if (TREE_CODE (type
) == OFFSET_TYPE
)
9950 cp_error ("declaration of `%D' as array of data members",
9952 type
= error_mark_node
;
9955 if (TREE_CODE (type
) == METHOD_TYPE
)
9957 cp_error ("declaration of `%D' as array of function members",
9959 type
= error_mark_node
;
9962 if (size
== error_mark_node
)
9963 type
= error_mark_node
;
9964 else if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9968 the constant expressions that specify the bounds of
9969 the arrays can be omitted only for the first member
9971 cp_error ("declaration of `%D' as multidimensional array",
9973 cp_error ("must have bounds for all dimensions except the first");
9974 type
= error_mark_node
;
9977 if (type
== error_mark_node
)
9980 /* VC++ spells a zero-sized array with []. */
9981 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
9982 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9983 size
= integer_zero_node
;
9987 /* Must suspend_momentary here because the index
9988 type may need to live until the end of the function.
9989 For example, it is used in the declaration of a
9990 variable which requires destructing at the end of
9991 the function; then build_vec_delete will need this
9993 int yes
= suspend_momentary ();
9994 /* Might be a cast. */
9995 if (TREE_CODE (size
) == NOP_EXPR
9996 && TREE_TYPE (size
) == TREE_TYPE (TREE_OPERAND (size
, 0)))
9997 size
= TREE_OPERAND (size
, 0);
9998 if (TREE_READONLY_DECL_P (size
))
9999 size
= decl_constant_value (size
);
10001 /* If this involves a template parameter, it will be a
10002 constant at instantiation time, but we don't know
10003 what the value is yet. Even if no template
10004 parameters are involved, we may an expression that
10005 is not a constant; we don't even simplify `1 + 2'
10006 when processing a template. */
10007 if (processing_template_decl
)
10009 /* Resolve a qualified reference to an enumerator or
10010 static const data member of ours. */
10011 if (TREE_CODE (size
) == SCOPE_REF
10012 && TREE_OPERAND (size
, 0) == current_class_type
)
10014 tree t
= lookup_field (current_class_type
,
10015 TREE_OPERAND (size
, 1), 0, 0);
10020 itype
= build_index_type (build_min
10021 (MINUS_EXPR
, sizetype
, size
, integer_one_node
));
10022 goto dont_grok_size
;
10025 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
10026 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
10027 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
10029 cp_error ("size of array `%D' has non-integer type",
10031 size
= integer_one_node
;
10033 if (pedantic
&& integer_zerop (size
))
10034 cp_pedwarn ("ANSI C++ forbids zero-size array `%D'", dname
);
10035 if (TREE_CONSTANT (size
))
10037 int old_flag_pedantic_errors
= flag_pedantic_errors
;
10038 int old_pedantic
= pedantic
;
10039 pedantic
= flag_pedantic_errors
= 1;
10040 /* Always give overflow errors on array subscripts. */
10041 constant_expression_warning (size
);
10042 pedantic
= old_pedantic
;
10043 flag_pedantic_errors
= old_flag_pedantic_errors
;
10044 if (INT_CST_LT (size
, integer_zero_node
))
10046 cp_error ("size of array `%D' is negative", dname
);
10047 size
= integer_one_node
;
10055 cp_pedwarn ("ANSI C++ forbids variable-size array `%D'",
10058 cp_pedwarn ("ANSI C++ forbids variable-size array");
10063 = fold (build_binary_op (MINUS_EXPR
,
10064 cp_convert (index_type
, size
),
10065 cp_convert (index_type
,
10066 integer_one_node
)));
10067 if (! TREE_CONSTANT (itype
))
10068 itype
= variable_size (itype
);
10069 else if (TREE_OVERFLOW (itype
))
10071 error ("overflow in array dimension");
10072 TREE_OVERFLOW (itype
) = 0;
10075 /* If we're a parm, we need to have a permanent type so
10076 mangling checks for re-use will work right. If both the
10077 element and index types are permanent, the array type
10079 if (decl_context
== PARM
10080 && allocation_temporary_p () && TREE_PERMANENT (type
))
10082 push_obstacks (&permanent_obstack
, &permanent_obstack
);
10083 itype
= build_index_type (itype
);
10087 itype
= build_index_type (itype
);
10090 resume_momentary (yes
);
10093 type
= build_cplus_array_type (type
, itype
);
10102 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
10103 tree inner_decl
= TREE_OPERAND (declarator
, 0);
10105 /* Declaring a function type.
10106 Make sure we have a valid type for the function to return. */
10108 /* We now know that the TYPE_QUALS don't apply to the
10109 decl, but to its return type. */
10110 type_quals
= TYPE_UNQUALIFIED
;
10112 /* Warn about some types functions can't return. */
10114 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10116 error ("`%s' declared as function returning a function", name
);
10117 type
= integer_type_node
;
10119 if (TREE_CODE (type
) == ARRAY_TYPE
)
10121 error ("`%s' declared as function returning an array", name
);
10122 type
= integer_type_node
;
10125 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
10126 inner_decl
= TREE_OPERAND (inner_decl
, 1);
10128 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
10129 inner_decl
= dname
;
10131 /* Pick up type qualifiers which should be applied to `this'. */
10132 quals
= CALL_DECLARATOR_QUALS (declarator
);
10134 /* Pick up the exception specifications. */
10135 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
10137 /* Say it's a definition only for the CALL_EXPR
10138 closest to the identifier. */
10141 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
10142 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
10143 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
10145 if (ctype
== NULL_TREE
10146 && decl_context
== FIELD
10148 && (friendp
== 0 || dname
== current_class_name
))
10149 ctype
= current_class_type
;
10151 if (ctype
&& return_type
== return_conversion
)
10152 TYPE_HAS_CONVERSION (ctype
) = 1;
10153 if (ctype
&& constructor_name (ctype
) == dname
)
10155 /* We are within a class's scope. If our declarator name
10156 is the same as the class name, and we are defining
10157 a function, then it is a constructor/destructor, and
10158 therefore returns a void type. */
10160 if (flags
== DTOR_FLAG
)
10162 /* ANSI C++ June 5 1992 WP 12.4.1. A destructor may
10163 not be declared const or volatile. A destructor
10164 may not be static. */
10166 error ("destructor cannot be static member function");
10169 cp_error ("destructors may not be `%s'",
10170 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10173 if (decl_context
== FIELD
)
10175 if (! member_function_or_else (ctype
, current_class_type
,
10176 "destructor for alien class `%s' cannot be a member"))
10177 return void_type_node
;
10180 else /* It's a constructor. */
10182 if (explicitp
== 1)
10184 /* ANSI C++ June 5 1992 WP 12.1.2. A constructor may
10185 not be declared const or volatile. A constructor may
10186 not be virtual. A constructor may not be static. */
10188 error ("constructor cannot be static member function");
10191 pedwarn ("constructors cannot be declared virtual");
10196 cp_error ("constructors may not be `%s'",
10197 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10201 RID_BIT_TYPE tmp_bits
;
10202 bcopy ((void*)&specbits
, (void*)&tmp_bits
, sizeof (RID_BIT_TYPE
));
10203 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10204 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10205 if (RIDBIT_ANY_SET (tmp_bits
))
10206 error ("return value type specifier for constructor ignored");
10208 type
= build_pointer_type (ctype
);
10209 if (decl_context
== FIELD
)
10211 if (! member_function_or_else (ctype
, current_class_type
,
10212 "constructor for alien class `%s' cannot be member"))
10213 return void_type_node
;
10214 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10215 if (return_type
!= return_ctor
)
10219 if (decl_context
== FIELD
)
10225 error ("can't initialize friend function `%s'", name
);
10228 /* Cannot be both friend and virtual. */
10229 error ("virtual functions cannot be friends");
10230 RIDBIT_RESET (RID_FRIEND
, specbits
);
10233 if (decl_context
== NORMAL
)
10234 error ("friend declaration not in class definition");
10235 if (current_function_decl
&& funcdef_flag
)
10236 cp_error ("can't define friend function `%s' in a local class definition",
10240 /* Construct the function type and go to the next
10241 inner layer of declarator. */
10243 declarator
= TREE_OPERAND (declarator
, 0);
10245 /* FIXME: This is where default args should be fully
10248 arg_types
= grokparms (inner_parms
, funcdecl_p
? funcdef_flag
: 0);
10250 if (declarator
&& flags
== DTOR_FLAG
)
10252 /* A destructor declared in the body of a class will
10253 be represented as a BIT_NOT_EXPR. But, we just
10254 want the underlying IDENTIFIER. */
10255 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10256 declarator
= TREE_OPERAND (declarator
, 0);
10258 if (strict_prototype
== 0 && arg_types
== NULL_TREE
)
10259 arg_types
= void_list_node
;
10260 else if (arg_types
== NULL_TREE
10261 || arg_types
!= void_list_node
)
10263 cp_error ("destructors may not have parameters");
10264 arg_types
= void_list_node
;
10265 last_function_parms
= NULL_TREE
;
10269 /* ANSI says that `const int foo ();'
10270 does not make the function foo const. */
10271 type
= build_function_type (type
, arg_types
);
10275 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10276 if (TREE_PURPOSE (t
)
10277 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10279 add_defarg_fn (type
);
10288 /* Filter out pointers-to-references and references-to-references.
10289 We can get these if a TYPE_DECL is used. */
10291 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10293 error ("cannot declare %s to references",
10294 TREE_CODE (declarator
) == ADDR_EXPR
10295 ? "references" : "pointers");
10296 declarator
= TREE_OPERAND (declarator
, 0);
10300 if (TREE_CODE (type
) == OFFSET_TYPE
10301 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10302 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10304 cp_error ("cannot declare pointer to `%#T' member",
10306 type
= TREE_TYPE (type
);
10309 /* Merge any constancy or volatility into the target type
10310 for the pointer. */
10312 /* We now know that the TYPE_QUALS don't apply to the decl,
10313 but to the target of the pointer. */
10314 type_quals
= TYPE_UNQUALIFIED
;
10316 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10318 if (TREE_CODE (type
) == VOID_TYPE
)
10319 error ("invalid type: `void &'");
10321 type
= build_reference_type (type
);
10323 else if (TREE_CODE (type
) == METHOD_TYPE
)
10324 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10326 type
= build_pointer_type (type
);
10328 /* Process a list of type modifier keywords (such as
10329 const or volatile) that were given inside the `*' or `&'. */
10331 if (TREE_TYPE (declarator
))
10333 register tree typemodlist
;
10339 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10340 typemodlist
= TREE_CHAIN (typemodlist
))
10342 tree qualifier
= TREE_VALUE (typemodlist
);
10344 if (qualifier
== ridpointers
[(int) RID_CONST
])
10346 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10348 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10353 error ("invalid type modifier within pointer declarator");
10357 pedwarn ("duplicate `const'");
10359 pedwarn ("duplicate `volatile'");
10361 pedwarn ("duplicate `restrict'");
10363 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10364 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10365 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10366 if (TREE_CODE (declarator
) == ADDR_EXPR
10367 && (constp
|| volatilep
))
10370 pedwarn ("discarding `const' applied to a reference");
10372 pedwarn ("discarding `volatile' applied to a reference");
10373 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10375 type
= cp_build_qualified_type (type
, type_quals
);
10377 declarator
= TREE_OPERAND (declarator
, 0);
10383 /* We have converted type names to NULL_TREE if the
10384 name was bogus, or to a _TYPE node, if not.
10386 The variable CTYPE holds the type we will ultimately
10387 resolve to. The code here just needs to build
10388 up appropriate member types. */
10389 tree sname
= TREE_OPERAND (declarator
, 1);
10392 /* Destructors can have their visibilities changed as well. */
10393 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10394 sname
= TREE_OPERAND (sname
, 0);
10396 if (TREE_COMPLEXITY (declarator
) == 0)
10397 /* This needs to be here, in case we are called
10398 multiple times. */ ;
10399 else if (TREE_COMPLEXITY (declarator
) == -1)
10400 /* Namespace member. */
10401 pop_decl_namespace ();
10402 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10403 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10404 else if (! IS_AGGR_TYPE_CODE
10405 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10407 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10409 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10410 that refer to ctype. They couldn't be resolved earlier
10411 because we hadn't pushed into the class yet.
10412 Example: resolve 'B<T>::type' in
10413 'B<typename B<T>::type> B<T>::f () { }'. */
10414 if (current_template_parms
10415 && uses_template_parms (type
)
10416 && uses_template_parms (current_class_type
))
10418 tree args
= current_template_args ();
10419 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10422 /* This pop_nested_class corresponds to the
10423 push_nested_class used to push into class scope for
10424 parsing the argument list of a function decl, in
10426 pop_nested_class ();
10427 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10430 my_friendly_abort (16);
10432 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10434 /* We had a reference to a global decl, or
10435 perhaps we were given a non-aggregate typedef,
10436 in which case we cleared this out, and should just
10437 keep going as though it wasn't there. */
10438 declarator
= sname
;
10441 ctype
= TREE_OPERAND (declarator
, 0);
10444 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10446 if (CLASSTYPE_TEMPLATE_INFO (t
) &&
10447 !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
10448 template_count
+= 1;
10449 t
= TYPE_MAIN_DECL (t
);
10450 if (DECL_LANG_SPECIFIC (t
))
10451 t
= DECL_CLASS_CONTEXT (t
);
10456 if (sname
== NULL_TREE
)
10459 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10461 /* This is the `standard' use of the scoping operator:
10462 basetype :: member . */
10464 if (ctype
== current_class_type
)
10470 Is this ill-formed? */
10473 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10476 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10478 if (current_class_type
== NULL_TREE
10480 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10481 TYPE_ARG_TYPES (type
));
10484 cp_error ("cannot declare member function `%T::%s' within `%T'",
10485 ctype
, name
, current_class_type
);
10486 return void_type_node
;
10489 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10490 || TYPE_SIZE (complete_type (ctype
)) != NULL_TREE
)
10492 /* Have to move this code elsewhere in this function.
10493 this code is used for i.e., typedef int A::M; M *pm;
10495 It is? How? jason 10/2/94 */
10497 if (current_class_type
)
10499 cp_error ("cannot declare member `%T::%s' within `%T'",
10500 ctype
, name
, current_class_type
);
10501 return void_type_node
;
10503 type
= build_offset_type (ctype
, type
);
10505 else if (uses_template_parms (ctype
))
10507 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10509 = build_cplus_method_type (ctype
, TREE_TYPE (type
),
10510 TYPE_ARG_TYPES (type
));
10514 cp_error ("structure `%T' not yet defined", ctype
);
10515 return error_mark_node
;
10518 declarator
= sname
;
10520 else if (TREE_CODE (sname
) == SCOPE_REF
)
10521 my_friendly_abort (17);
10525 declarator
= TREE_OPERAND (declarator
, 1);
10526 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10527 /* In this case, we will deal with it later. */
10531 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10532 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10533 TYPE_ARG_TYPES (type
));
10535 type
= build_offset_type (ctype
, type
);
10542 declarator
= TREE_OPERAND (declarator
, 0);
10547 case ENUMERAL_TYPE
:
10548 declarator
= NULL_TREE
;
10552 declarator
= NULL_TREE
;
10556 my_friendly_abort (158);
10560 /* See the comment for the TREE_LIST case, above. */
10563 if (! ignore_attrs
)
10564 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10566 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
10568 attrlist
= build_decl_list (NULL_TREE
, inner_attrs
);
10571 /* Now TYPE has the actual type. */
10573 if (explicitp
== 1)
10575 error ("only constructors can be declared `explicit'");
10579 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10581 if (type_quals
& TYPE_QUAL_CONST
)
10583 error ("const `%s' cannot be declared `mutable'", name
);
10584 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10588 error ("static `%s' cannot be declared `mutable'", name
);
10589 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10593 if (declarator
== NULL_TREE
10594 || TREE_CODE (declarator
) == IDENTIFIER_NODE
10595 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
10596 && (TREE_CODE (type
) == FUNCTION_TYPE
10597 || TREE_CODE (type
) == METHOD_TYPE
)))
10599 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10601 cp_error ("template-id `%D' used as a declarator", declarator
);
10602 declarator
= dname
;
10605 /* Unexpected declarator format. */
10606 my_friendly_abort (990210);
10608 /* If this is declaring a typedef name, return a TYPE_DECL. */
10610 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
10614 /* Note that the grammar rejects storage classes
10615 in typenames, fields or parameters. */
10616 if (current_lang_name
== lang_name_java
)
10617 TYPE_FOR_JAVA (type
) = 1;
10619 if (decl_context
== FIELD
)
10621 if (declarator
== constructor_name (current_class_type
))
10622 cp_pedwarn ("ANSI C++ forbids nested type `%D' with same name as enclosing class",
10624 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10628 /* Make sure this typedef lives as long as its type,
10629 since it might be used as a template parameter. */
10630 if (type
!= error_mark_node
)
10631 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
10632 if (processing_template_decl
)
10633 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10635 decl
= build_decl (TYPE_DECL
, declarator
, type
);
10636 if (type
!= error_mark_node
)
10640 /* If the user declares "typedef struct {...} foo" then the
10641 struct will have an anonymous name. Fill that name in now.
10642 Nothing can refer to it, so nothing needs know about the name
10644 if (type
!= error_mark_node
10645 && TYPE_NAME (type
)
10646 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
10647 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
10648 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
10650 tree oldname
= TYPE_NAME (type
);
10653 /* Replace the anonymous name with the real name everywhere. */
10654 lookup_tag_reverse (type
, declarator
);
10655 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
10656 if (TYPE_NAME (t
) == oldname
)
10657 TYPE_NAME (t
) = decl
;
10659 if (TYPE_LANG_SPECIFIC (type
))
10660 TYPE_WAS_ANONYMOUS (type
) = 1;
10662 /* If this is a typedef within a template class, the nested
10663 type is a (non-primary) template. The name for the
10664 template needs updating as well. */
10665 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
10666 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
10667 = TYPE_IDENTIFIER (type
);
10669 /* XXX Temporarily set the scope.
10670 When returning, start_decl expects it as NULL_TREE,
10671 and will then then set it using pushdecl. */
10672 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
10673 if (current_class_type
)
10674 DECL_CONTEXT (decl
) = current_class_type
;
10676 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
10678 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
10679 DECL_ASSEMBLER_NAME (decl
)
10680 = get_identifier (build_overload_name (type
, 1, 1));
10681 DECL_CONTEXT (decl
) = NULL_TREE
;
10683 /* FIXME remangle member functions; member functions of a
10684 type with external linkage have external linkage. */
10687 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10689 cp_error_at ("typedef name may not be class-qualified", decl
);
10694 if (ctype
== NULL_TREE
)
10696 if (TREE_CODE (type
) != METHOD_TYPE
)
10697 cp_error_at ("invalid type qualifier for non-method type", decl
);
10699 ctype
= TYPE_METHOD_BASETYPE (type
);
10701 if (ctype
!= NULL_TREE
)
10702 grok_method_quals (ctype
, decl
, quals
);
10705 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10706 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
10707 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
10709 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10710 error ("non-object member `%s' cannot be declared mutable", name
);
10712 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
10713 inlinep
, friendp
, raises
!= NULL_TREE
);
10716 error ("typedef declaration includes an initializer");
10721 /* Detect the case of an array type of unspecified size
10722 which came, as such, direct from a typedef name.
10723 We must copy the type, so that each identifier gets
10724 a distinct type, so that each identifier's size can be
10725 controlled separately by its own initializer. */
10727 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
10728 && TYPE_DOMAIN (type
) == NULL_TREE
)
10730 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
10733 /* If this is a type name (such as, in a cast or sizeof),
10734 compute the type and return it now. */
10736 if (decl_context
== TYPENAME
)
10738 /* Note that the grammar rejects storage classes
10739 in typenames, fields or parameters. */
10740 if (type_quals
!= TYPE_UNQUALIFIED
)
10741 type_quals
= TYPE_UNQUALIFIED
;
10743 /* Special case: "friend class foo" looks like a TYPENAME context. */
10746 if (type_quals
!= TYPE_UNQUALIFIED
)
10748 cp_error ("type qualifiers specified for friend class declaration");
10749 type_quals
= TYPE_UNQUALIFIED
;
10753 cp_error ("`inline' specified for friend class declaration");
10757 /* Only try to do this stuff if we didn't already give up. */
10758 if (type
!= integer_type_node
)
10760 /* A friendly class? */
10761 if (current_class_type
)
10762 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
10764 error ("trying to make class `%s' a friend of global scope",
10765 TYPE_NAME_STRING (type
));
10766 type
= void_type_node
;
10771 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
10772 if (ctype
== NULL_TREE
)
10774 my_friendly_assert (TREE_CODE (type
) == METHOD_TYPE
, 159);
10775 ctype
= TYPE_METHOD_BASETYPE (type
);
10777 grok_method_quals (ctype
, dummy
, quals
);
10778 type
= TREE_TYPE (dummy
);
10783 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
10784 && decl_context
!= CATCHPARM
10785 && TREE_CODE (type
) != UNION_TYPE
10788 cp_error ("abstract declarator `%T' used as declaration", type
);
10789 declarator
= make_anon_name ();
10792 /* `void' at top level (not within pointer)
10793 is allowed only in typedefs or type names.
10794 We don't complain about parms either, but that is because
10795 a better error message can be made later. */
10797 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
10800 error ("unnamed variable or field declared void");
10801 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10803 if (IDENTIFIER_OPNAME_P (declarator
))
10804 my_friendly_abort (356);
10806 error ("variable or field `%s' declared void", name
);
10809 error ("variable or field declared void");
10810 type
= integer_type_node
;
10813 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
10814 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
10816 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10818 if (ctype
|| in_namespace
)
10819 error ("cannot use `::' in parameter declaration");
10821 /* A parameter declared as an array of T is really a pointer to T.
10822 One declared as a function is really a pointer to a function.
10823 One declared as a member is really a pointer to member. */
10825 if (TREE_CODE (type
) == ARRAY_TYPE
)
10827 /* Transfer const-ness of array into that of type pointed to. */
10828 type
= build_pointer_type (TREE_TYPE (type
));
10829 type_quals
= TYPE_UNQUALIFIED
;
10831 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10832 type
= build_pointer_type (type
);
10833 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10834 type
= build_pointer_type (type
);
10835 else if (TREE_CODE (type
) == VOID_TYPE
&& declarator
)
10837 error ("declaration of `%s' as void", name
);
10843 register tree decl
;
10845 if (decl_context
== PARM
)
10847 decl
= build_decl (PARM_DECL
, declarator
, type
);
10849 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
10850 inlinep
, friendp
, raises
!= NULL_TREE
);
10852 /* Compute the type actually passed in the parmlist,
10853 for the case where there is no prototype.
10854 (For example, shorts and chars are passed as ints.)
10855 When there is a prototype, this is overridden later. */
10857 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
10859 else if (decl_context
== FIELD
)
10861 if (type
== error_mark_node
)
10863 /* Happens when declaring arrays of sizes which
10864 are error_mark_node, for example. */
10867 else if (in_namespace
&& !friendp
)
10869 /* Something like struct S { int N::j; }; */
10870 cp_error ("invalid use of `::'");
10873 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10876 tree function_context
;
10878 /* We catch the others as conflicts with the builtin
10880 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
10882 cp_error ("function `%D' cannot be declared friend",
10889 if (ctype
== NULL_TREE
)
10890 ctype
= current_class_type
;
10892 if (ctype
== NULL_TREE
)
10894 cp_error ("can't make `%D' into a method -- not in a class",
10896 return void_type_node
;
10899 /* ``A union may [ ... ] not [ have ] virtual functions.''
10901 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
10903 cp_error ("function `%D' declared virtual inside a union",
10905 return void_type_node
;
10908 if (declarator
== ansi_opname
[(int) NEW_EXPR
]
10909 || declarator
== ansi_opname
[(int) VEC_NEW_EXPR
]
10910 || declarator
== ansi_opname
[(int) DELETE_EXPR
]
10911 || declarator
== ansi_opname
[(int) VEC_DELETE_EXPR
])
10915 cp_error ("`%D' cannot be declared virtual, since it is always static",
10920 else if (staticp
< 2)
10921 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10922 TYPE_ARG_TYPES (type
));
10925 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
10926 function_context
= (ctype
!= NULL_TREE
) ?
10927 hack_decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
10928 publicp
= (! friendp
|| ! staticp
)
10929 && function_context
== NULL_TREE
;
10930 decl
= grokfndecl (ctype
, type
,
10931 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
10932 ? declarator
: dname
,
10934 virtualp
, flags
, quals
, raises
,
10935 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
10936 funcdef_flag
, template_count
, in_namespace
);
10937 if (decl
== NULL_TREE
)
10940 /* This clobbers the attrs stored in `decl' from `attrlist'. */
10941 /* The decl and setting of decl_machine_attr is also turned off. */
10942 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
10945 /* [class.conv.ctor]
10947 A constructor declared without the function-specifier
10948 explicit that can be called with a single parameter
10949 specifies a conversion from the type of its first
10950 parameter to the type of its class. Such a constructor
10951 is called a converting constructor. */
10952 if (explicitp
== 2)
10953 DECL_NONCONVERTING_P (decl
) = 1;
10954 else if (DECL_CONSTRUCTOR_P (decl
))
10956 /* The constructor can be called with exactly one
10957 parameter if there is at least one parameter, and
10958 any subsequent parameters have default arguments.
10959 We don't look at the first parameter, which is
10960 really just the `this' parameter for the new
10963 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
10965 /* Skip the `in_chrg' argument too, if present. */
10966 if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (decl
)))
10967 arg_types
= TREE_CHAIN (arg_types
);
10969 if (arg_types
== void_list_node
10971 && TREE_CHAIN (arg_types
)
10972 && TREE_CHAIN (arg_types
) != void_list_node
10973 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
10974 DECL_NONCONVERTING_P (decl
) = 1;
10977 else if (TREE_CODE (type
) == METHOD_TYPE
)
10979 /* We only get here for friend declarations of
10980 members of other classes. */
10981 /* All method decls are public, so tell grokfndecl to set
10982 TREE_PUBLIC, also. */
10983 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
10984 virtualp
, flags
, quals
, raises
,
10985 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
10986 template_count
, in_namespace
);
10987 if (decl
== NULL_TREE
)
10990 else if (!staticp
&& ! processing_template_decl
10991 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
10992 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
10995 cp_error ("field `%D' has incomplete type", declarator
);
10997 cp_error ("name `%T' has incomplete type", type
);
10999 /* If we're instantiating a template, tell them which
11000 instantiation made the field's type be incomplete. */
11001 if (current_class_type
11002 && TYPE_NAME (current_class_type
)
11003 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
11004 && declspecs
&& TREE_VALUE (declspecs
)
11005 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
11006 cp_error (" in instantiation of template `%T'",
11007 current_class_type
);
11009 type
= error_mark_node
;
11016 error ("`%s' is neither function nor method; cannot be declared friend",
11017 IDENTIFIER_POINTER (declarator
));
11025 /* Friends are treated specially. */
11026 if (ctype
== current_class_type
)
11027 warning ("member functions are implicitly friends of their class");
11030 tree t
= NULL_TREE
;
11031 if (decl
&& DECL_NAME (decl
))
11033 if (template_class_depth (current_class_type
) == 0)
11036 = check_explicit_specialization
11038 template_count
, 2 * (funcdef_flag
!= 0) + 4);
11039 if (decl
== error_mark_node
)
11040 return error_mark_node
;
11043 t
= do_friend (ctype
, declarator
, decl
,
11044 last_function_parms
, attrlist
, flags
, quals
,
11047 if (t
&& funcdef_flag
)
11050 return void_type_node
;
11054 /* Structure field. It may not be a function, except for C++ */
11056 if (decl
== NULL_TREE
)
11062 /* An attempt is being made to initialize a non-static
11063 member. But, from [class.mem]:
11065 4 A member-declarator can contain a
11066 constant-initializer only if it declares a static
11067 member (_class.static_) of integral or enumeration
11068 type, see _class.static.data_.
11070 This used to be relatively common practice, but
11071 the rest of the compiler does not correctly
11072 handle the initialization unless the member is
11073 static so we make it static below. */
11074 cp_pedwarn ("ANSI C++ forbids initialization of member `%D'",
11076 cp_pedwarn ("making `%D' static", declarator
);
11080 if (uses_template_parms (type
))
11081 /* We'll check at instantiation time. */
11083 else if (check_static_variable_definition (declarator
,
11085 /* If we just return the declaration, crashes
11086 will sometimes occur. We therefore return
11087 void_type_node, as if this was a friend
11088 declaration, to cause callers to completely
11089 ignore this declaration. */
11090 return void_type_node
;
11093 /* 9.2p13 [class.mem] */
11094 if (declarator
== constructor_name (current_class_type
)
11095 /* Divergence from the standard: In extern "C", we
11096 allow non-static data members here, because C does
11097 and /usr/include/netinet/in.h uses that. */
11098 && (staticp
|| ! in_system_header
))
11099 cp_pedwarn ("ANSI C++ forbids data member `%D' with same name as enclosing class",
11104 /* C++ allows static class members. All other work
11105 for this is done by grokfield. */
11106 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
11107 TREE_STATIC (decl
) = 1;
11108 /* In class context, 'static' means public access. */
11109 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
11113 decl
= build_lang_decl (FIELD_DECL
, declarator
, type
);
11114 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11116 DECL_MUTABLE_P (decl
) = 1;
11117 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11121 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
11122 inlinep
, friendp
, raises
!= NULL_TREE
);
11125 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11127 tree original_name
;
11133 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11134 original_name
= dname
;
11136 original_name
= declarator
;
11138 if (RIDBIT_SETP (RID_AUTO
, specbits
))
11139 error ("storage class `auto' invalid for function `%s'", name
);
11140 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11141 error ("storage class `register' invalid for function `%s'", name
);
11143 /* Function declaration not at top level.
11144 Storage classes other than `extern' are not allowed
11145 and `extern' makes no difference. */
11146 if (! toplevel_bindings_p ()
11147 && (RIDBIT_SETP (RID_STATIC
, specbits
)
11148 || RIDBIT_SETP (RID_INLINE
, specbits
))
11151 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11152 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
11154 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
11157 if (ctype
== NULL_TREE
)
11161 error ("virtual non-class function `%s'", name
);
11165 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
11166 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11167 TYPE_ARG_TYPES (type
));
11169 /* Record presence of `static'. */
11170 publicp
= (ctype
!= NULL_TREE
11171 || RIDBIT_SETP (RID_EXTERN
, specbits
)
11172 || !RIDBIT_SETP (RID_STATIC
, specbits
));
11174 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
11175 virtualp
, flags
, quals
, raises
,
11177 publicp
, inlinep
, funcdef_flag
,
11178 template_count
, in_namespace
);
11179 if (decl
== NULL_TREE
)
11184 int illegal_static
= 0;
11186 /* Don't allow a static member function in a class, and forbid
11187 declaring main to be static. */
11188 if (TREE_CODE (type
) == METHOD_TYPE
)
11190 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11191 illegal_static
= 1;
11193 else if (current_function_decl
)
11195 /* FIXME need arm citation */
11196 error ("cannot declare static function inside another function");
11197 illegal_static
= 1;
11200 if (illegal_static
)
11203 RIDBIT_RESET (RID_STATIC
, specbits
);
11209 /* It's a variable. */
11211 /* An uninitialized decl with `extern' is a reference. */
11212 decl
= grokvardecl (type
, declarator
, &specbits
,
11214 (type_quals
& TYPE_QUAL_CONST
) != 0,
11216 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11217 inlinep
, friendp
, raises
!= NULL_TREE
);
11221 DECL_CONTEXT (decl
) = ctype
;
11224 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11226 RIDBIT_RESET (RID_STATIC
, specbits
);
11228 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11230 cp_error ("static member `%D' declared `register'", decl
);
11231 RIDBIT_RESET (RID_REGISTER
, specbits
);
11233 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11235 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11237 RIDBIT_RESET (RID_EXTERN
, specbits
);
11242 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11244 error ("`%s' cannot be declared mutable", name
);
11247 /* Record `register' declaration for warnings on &
11248 and in case doing stupid register allocation. */
11250 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11251 DECL_REGISTER (decl
) = 1;
11253 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11254 DECL_THIS_EXTERN (decl
) = 1;
11256 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11257 DECL_THIS_STATIC (decl
) = 1;
11259 /* Record constancy and volatility. There's no need to do this
11260 when processing a template; we'll do this for the instantiated
11261 declaration based on the type of DECL. */
11262 if (!processing_template_decl
)
11263 c_apply_type_quals_to_decl (type_quals
, decl
);
11269 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11270 An empty exprlist is a parmlist. An exprlist which
11271 contains only identifiers at the global level
11272 is a parmlist. Otherwise, it is an exprlist. */
11275 parmlist_is_exprlist (exprs
)
11278 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11281 if (toplevel_bindings_p ())
11283 /* At the global level, if these are all identifiers,
11284 then it is a parmlist. */
11287 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11289 exprs
= TREE_CHAIN (exprs
);
11296 /* Subroutine of start_function. Ensure that each of the parameter
11297 types (as listed in PARMS) is complete, as is required for a
11298 function definition. */
11301 require_complete_types_for_parms (parms
)
11306 tree type
= TREE_TYPE (parms
);
11307 if (TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
11309 if (DECL_NAME (parms
))
11310 error ("parameter `%s' has incomplete type",
11311 IDENTIFIER_POINTER (DECL_NAME (parms
)));
11313 error ("parameter has incomplete type");
11314 TREE_TYPE (parms
) = error_mark_node
;
11317 layout_decl (parms
, 0);
11319 parms
= TREE_CHAIN (parms
);
11323 /* Returns DECL if DECL is a local variable (or parameter). Returns
11324 NULL_TREE otherwise. */
11327 local_variable_p (t
)
11330 if ((TREE_CODE (t
) == VAR_DECL
11331 /* A VAR_DECL with a context that is a _TYPE is a static data
11333 && !TYPE_P (CP_DECL_CONTEXT (t
))
11334 /* Any other non-local variable must be at namespace scope. */
11335 && TREE_CODE (CP_DECL_CONTEXT (t
)) != NAMESPACE_DECL
)
11336 || (TREE_CODE (t
) == PARM_DECL
))
11342 /* Check that ARG, which is a default-argument expression for a
11343 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11344 something goes wrong. DECL may also be a _TYPE node, rather than a
11345 DECL, if there is no DECL available. */
11348 check_default_argument (decl
, arg
)
11355 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11356 /* We get a DEFAULT_ARG when looking at an in-class declaration
11357 with a default argument. Ignore the argument for now; we'll
11358 deal with it after the class is complete. */
11361 if (processing_template_decl
|| uses_template_parms (arg
))
11362 /* We don't do anything checking until instantiation-time. Note
11363 that there may be uninstantiated arguments even for an
11364 instantiated function, since default arguments are not
11365 instantiated until they are needed. */
11374 decl_type
= TREE_TYPE (decl
);
11376 if (arg
== error_mark_node
11377 || decl
== error_mark_node
11378 || TREE_TYPE (arg
) == error_mark_node
11379 || decl_type
== error_mark_node
)
11380 /* Something already went wrong. There's no need to check
11382 return error_mark_node
;
11384 /* [dcl.fct.default]
11386 A default argument expression is implicitly converted to the
11388 if (!TREE_TYPE (arg
)
11389 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11392 cp_error ("default argument for `%#D' has type `%T'",
11393 decl
, TREE_TYPE (arg
));
11395 cp_error ("default argument for parameter of type `%T' has type `%T'",
11396 decl_type
, TREE_TYPE (arg
));
11398 return error_mark_node
;
11401 /* [dcl.fct.default]
11403 Local variables shall not be used in default argument
11406 The keyword `this' shall not be used in a default argument of a
11407 member function. */
11408 var
= search_tree (arg
, local_variable_p
);
11411 cp_error ("default argument `%E' uses local variable `%D'",
11413 return error_mark_node
;
11420 /* Decode the list of parameter types for a function type.
11421 Given the list of things declared inside the parens,
11422 return a list of types.
11424 The list we receive can have three kinds of elements:
11425 an IDENTIFIER_NODE for names given without types,
11426 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11427 or void_type_node, to mark the end of an argument list
11428 when additional arguments are not permitted (... was not used).
11430 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11431 a mere declaration. A nonempty identifier-list gets an error message
11432 when FUNCDEF_FLAG is zero.
11433 If FUNCDEF_FLAG is 1, then parameter types must be complete.
11434 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11436 If all elements of the input list contain types,
11437 we return a list of the types.
11438 If all elements contain no type (except perhaps a void_type_node
11439 at the end), we return a null list.
11440 If some have types and some do not, it is an error, and we
11441 return a null list.
11443 Also set last_function_parms to either
11444 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11445 A list of names is converted to a chain of PARM_DECLs
11446 by store_parm_decls so that ultimately it is always a chain of decls.
11448 Note that in C++, parameters can take default values. These default
11449 values are in the TREE_PURPOSE field of the TREE_LIST. It is
11450 an error to specify default values which are followed by parameters
11451 that have no default values, or an ELLIPSES. For simplicities sake,
11452 only parameters which are specified with their types can take on
11456 grokparms (first_parm
, funcdef_flag
)
11460 tree result
= NULL_TREE
;
11461 tree decls
= NULL_TREE
;
11463 if (first_parm
!= NULL_TREE
11464 && TREE_CODE (TREE_VALUE (first_parm
)) == IDENTIFIER_NODE
)
11466 if (! funcdef_flag
)
11467 pedwarn ("parameter names (without types) in function declaration");
11468 last_function_parms
= first_parm
;
11471 else if (first_parm
!= NULL_TREE
11472 && TREE_CODE (TREE_VALUE (first_parm
)) != TREE_LIST
11473 && TREE_CODE (TREE_VALUE (first_parm
)) != VOID_TYPE
)
11474 my_friendly_abort (145);
11477 /* Types were specified. This is a list of declarators
11478 each represented as a TREE_LIST node. */
11479 register tree parm
, chain
;
11480 int any_init
= 0, any_error
= 0;
11482 if (first_parm
!= NULL_TREE
)
11484 tree last_result
= NULL_TREE
;
11485 tree last_decl
= NULL_TREE
;
11487 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11489 tree type
= NULL_TREE
, list_node
= parm
;
11490 register tree decl
= TREE_VALUE (parm
);
11491 tree init
= TREE_PURPOSE (parm
);
11493 chain
= TREE_CHAIN (parm
);
11494 /* @@ weak defense against parse errors. */
11495 if (TREE_CODE (decl
) != VOID_TYPE
11496 && TREE_CODE (decl
) != TREE_LIST
)
11498 /* Give various messages as the need arises. */
11499 if (TREE_CODE (decl
) == STRING_CST
)
11500 cp_error ("invalid string constant `%E'", decl
);
11501 else if (TREE_CODE (decl
) == INTEGER_CST
)
11502 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11506 if (TREE_CODE (decl
) != VOID_TYPE
)
11508 decl
= grokdeclarator (TREE_VALUE (decl
),
11509 TREE_PURPOSE (decl
),
11510 PARM
, init
!= NULL_TREE
,
11512 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
11515 /* Top-level qualifiers on the parameters are
11516 ignored for function types. */
11517 type
= TYPE_MAIN_VARIANT (TREE_TYPE (decl
));
11519 if (TREE_CODE (type
) == VOID_TYPE
)
11520 decl
= void_type_node
;
11521 else if (TREE_CODE (type
) == METHOD_TYPE
)
11523 if (DECL_NAME (decl
))
11524 /* Cannot use the decl here because
11525 we don't have DECL_CONTEXT set up yet. */
11526 cp_error ("parameter `%D' invalidly declared method type",
11529 error ("parameter invalidly declared method type");
11530 type
= build_pointer_type (type
);
11531 TREE_TYPE (decl
) = type
;
11533 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11535 if (DECL_NAME (decl
))
11536 cp_error ("parameter `%D' invalidly declared offset type",
11539 error ("parameter invalidly declared offset type");
11540 type
= build_pointer_type (type
);
11541 TREE_TYPE (decl
) = type
;
11543 else if (abstract_virtuals_error (decl
, type
))
11544 any_error
= 1; /* Seems like a good idea. */
11545 else if (POINTER_TYPE_P (type
))
11548 while (POINTER_TYPE_P (t
)
11549 || (TREE_CODE (t
) == ARRAY_TYPE
11550 && TYPE_DOMAIN (t
) != NULL_TREE
))
11552 if (TREE_CODE (t
) == ARRAY_TYPE
)
11553 cp_error ("parameter type `%T' includes %s to array of unknown bound",
11555 TYPE_PTR_P (type
) ? "pointer" : "reference");
11559 if (TREE_CODE (decl
) == VOID_TYPE
)
11561 if (result
== NULL_TREE
)
11563 result
= void_list_node
;
11564 last_result
= result
;
11568 TREE_CHAIN (last_result
) = void_list_node
;
11569 last_result
= void_list_node
;
11572 && (chain
!= void_list_node
|| TREE_CHAIN (chain
)))
11573 error ("`void' in parameter list must be entire list");
11577 /* Since there is a prototype, args are passed in their own types. */
11578 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
11579 if (PROMOTE_PROTOTYPES
11580 && (TREE_CODE (type
) == INTEGER_TYPE
11581 || TREE_CODE (type
) == ENUMERAL_TYPE
)
11582 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
11583 DECL_ARG_TYPE (decl
) = integer_type_node
;
11584 if (!any_error
&& init
)
11587 init
= check_default_argument (decl
, init
);
11592 if (decls
== NULL_TREE
)
11599 TREE_CHAIN (last_decl
) = decl
;
11602 if (! current_function_decl
&& TREE_PERMANENT (list_node
))
11604 TREE_PURPOSE (list_node
) = init
;
11605 TREE_VALUE (list_node
) = type
;
11606 TREE_CHAIN (list_node
) = NULL_TREE
;
11609 list_node
= saveable_tree_cons (init
, type
, NULL_TREE
);
11610 if (result
== NULL_TREE
)
11612 result
= list_node
;
11613 last_result
= result
;
11617 TREE_CHAIN (last_result
) = list_node
;
11618 last_result
= list_node
;
11622 TREE_CHAIN (last_result
) = NULL_TREE
;
11623 /* If there are no parameters, and the function does not end
11624 with `...', then last_decl will be NULL_TREE. */
11625 if (last_decl
!= NULL_TREE
)
11626 TREE_CHAIN (last_decl
) = NULL_TREE
;
11630 last_function_parms
= decls
;
11635 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
11636 FUNCTION_TYPE with the newly parsed version of its default argument, which
11637 was previously digested as text. See snarf_defarg et al in lex.c. */
11640 replace_defarg (arg
, init
)
11643 if (! processing_template_decl
11644 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
11645 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
11646 TREE_TYPE (init
), TREE_VALUE (arg
));
11647 TREE_PURPOSE (arg
) = init
;
11654 tree t
= FUNCTION_ARG_CHAIN (d
);
11655 if (DECL_CONSTRUCTOR_P (d
)
11656 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (d
)))
11657 t
= TREE_CHAIN (t
);
11658 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
11659 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
11660 == DECL_CLASS_CONTEXT (d
))
11661 && (TREE_CHAIN (t
) == NULL_TREE
11662 || TREE_CHAIN (t
) == void_list_node
11663 || TREE_PURPOSE (TREE_CHAIN (t
))))
11668 /* These memoizing functions keep track of special properties which
11669 a class may have. `grok_ctor_properties' notices whether a class
11670 has a constructor of the form X(X&), and also complains
11671 if the class has a constructor of the form X(X).
11672 `grok_op_properties' takes notice of the various forms of
11673 operator= which are defined, as well as what sorts of type conversion
11674 may apply. Both functions take a FUNCTION_DECL as an argument. */
11677 grok_ctor_properties (ctype
, decl
)
11680 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
11681 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
11683 /* When a type has virtual baseclasses, a magical first int argument is
11684 added to any ctor so we can tell if the class has been initialized
11685 yet. This could screw things up in this function, so we deliberately
11686 ignore the leading int if we're in that situation. */
11687 if (TYPE_USES_VIRTUAL_BASECLASSES (ctype
))
11689 my_friendly_assert (parmtypes
11690 && TREE_VALUE (parmtypes
) == integer_type_node
,
11692 parmtypes
= TREE_CHAIN (parmtypes
);
11693 parmtype
= TREE_VALUE (parmtypes
);
11698 A non-template constructor for class X is a copy constructor if
11699 its first parameter is of type X&, const X&, volatile X& or const
11700 volatile X&, and either there are no other parameters or else all
11701 other parameters have default arguments. */
11702 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
11703 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
11704 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11705 || TREE_CHAIN (parmtypes
) == void_list_node
11706 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11707 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11708 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11710 TYPE_HAS_INIT_REF (ctype
) = 1;
11711 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11712 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
11716 A declaration of a constructor for a class X is ill-formed if its
11717 first parameter is of type (optionally cv-qualified) X and either
11718 there are no other parameters or else all other parameters have
11721 We *don't* complain about member template instantiations that
11722 have this form, though; they can occur as we try to decide what
11723 constructor to use during overload resolution. Since overload
11724 resolution will never prefer such a constructor to the
11725 non-template copy constructor (which is either explicitly or
11726 implicitly defined), there's no need to worry about their
11727 existence. Theoretically, they should never even be
11728 instantiated, but that's hard to forestall. */
11729 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
11730 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11731 || TREE_CHAIN (parmtypes
) == void_list_node
11732 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11733 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11734 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11736 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
11738 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
11741 else if (TREE_CODE (parmtype
) == VOID_TYPE
11742 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
11743 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
11748 /* An operator with this name can be either unary or binary. */
11754 return (name
== ansi_opname
[(int) INDIRECT_REF
]
11755 || name
== ansi_opname
[(int) ADDR_EXPR
]
11756 || name
== ansi_opname
[(int) NEGATE_EXPR
]
11757 || name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11758 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]
11759 || name
== ansi_opname
[(int) CONVERT_EXPR
]);
11762 /* An operator with this name can only be unary. */
11768 return (name
== ansi_opname
[(int) TRUTH_NOT_EXPR
]
11769 || name
== ansi_opname
[(int) BIT_NOT_EXPR
]
11770 || name
== ansi_opname
[(int) COMPONENT_REF
]
11771 || IDENTIFIER_TYPENAME_P (name
));
11774 /* Do a little sanity-checking on how they declared their operator. */
11777 grok_op_properties (decl
, virtualp
, friendp
)
11779 int virtualp
, friendp
;
11781 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
11782 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
11783 tree name
= DECL_NAME (decl
);
11785 if (current_class_type
== NULL_TREE
)
11792 A user-declared copy assignment operator X::operator= is a
11793 non-static non-template member function of class X with
11794 exactly one parameter of type X, X&, const X&, volatile X& or
11795 const volatile X&. */
11796 if (name
== ansi_opname
[(int) MODIFY_EXPR
]
11797 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11798 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11800 else if (name
== ansi_opname
[(int) CALL_EXPR
])
11801 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
11802 else if (name
== ansi_opname
[(int) ARRAY_REF
])
11803 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
11804 else if (name
== ansi_opname
[(int) COMPONENT_REF
]
11805 || name
== ansi_opname
[(int) MEMBER_REF
])
11806 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
11807 else if (name
== ansi_opname
[(int) NEW_EXPR
])
11808 TYPE_GETS_NEW (current_class_type
) |= 1;
11809 else if (name
== ansi_opname
[(int) DELETE_EXPR
])
11810 TYPE_GETS_DELETE (current_class_type
) |= 1;
11811 else if (name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11812 TYPE_GETS_NEW (current_class_type
) |= 2;
11813 else if (name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11814 TYPE_GETS_DELETE (current_class_type
) |= 2;
11817 if (name
== ansi_opname
[(int) NEW_EXPR
]
11818 || name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11820 /* When the compiler encounters the definition of A::operator new, it
11821 doesn't look at the class declaration to find out if it's static. */
11823 revert_static_member_fn (&decl
, NULL
, NULL
);
11825 /* Take care of function decl if we had syntax errors. */
11826 if (argtypes
== NULL_TREE
)
11828 = build_function_type (ptr_type_node
,
11829 hash_tree_chain (integer_type_node
,
11832 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
11834 else if (name
== ansi_opname
[(int) DELETE_EXPR
]
11835 || name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11838 revert_static_member_fn (&decl
, NULL
, NULL
);
11840 if (argtypes
== NULL_TREE
)
11842 = build_function_type (void_type_node
,
11843 hash_tree_chain (ptr_type_node
,
11847 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
11849 if (! friendp
&& name
== ansi_opname
[(int) VEC_DELETE_EXPR
]
11850 && (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
11851 != void_list_node
))
11852 TYPE_VEC_DELETE_TAKES_SIZE (current_class_type
) = 1;
11857 /* An operator function must either be a non-static member function
11858 or have at least one parameter of a class, a reference to a class,
11859 an enumeration, or a reference to an enumeration. 13.4.0.6 */
11860 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
11862 if (IDENTIFIER_TYPENAME_P (name
)
11863 || name
== ansi_opname
[(int) CALL_EXPR
]
11864 || name
== ansi_opname
[(int) MODIFY_EXPR
]
11865 || name
== ansi_opname
[(int) COMPONENT_REF
]
11866 || name
== ansi_opname
[(int) ARRAY_REF
])
11867 cp_error ("`%D' must be a nonstatic member function", decl
);
11872 if (DECL_STATIC_FUNCTION_P (decl
))
11873 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
11876 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
11878 tree arg
= TREE_VALUE (p
);
11879 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
11880 arg
= TREE_TYPE (arg
);
11882 /* This lets bad template code slip through. */
11883 if (IS_AGGR_TYPE (arg
)
11884 || TREE_CODE (arg
) == ENUMERAL_TYPE
11885 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
11886 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11890 ("`%D' must have an argument of class or enumerated type",
11897 if (name
== ansi_opname
[(int) CALL_EXPR
])
11898 return; /* No restrictions on args. */
11900 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
11902 tree t
= TREE_TYPE (name
);
11903 if (TREE_CODE (t
) == VOID_TYPE
)
11904 pedwarn ("void is not a valid type conversion operator");
11905 else if (! friendp
)
11907 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
11908 const char *what
= 0;
11910 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
11912 if (t
== current_class_type
)
11913 what
= "the same type";
11914 /* Don't force t to be complete here. */
11915 else if (IS_AGGR_TYPE (t
)
11917 && DERIVED_FROM_P (t
, current_class_type
))
11918 what
= "a base class";
11921 warning ("conversion to %s%s will never use a type conversion operator",
11922 ref
? "a reference to " : "", what
);
11926 if (name
== ansi_opname
[(int) MODIFY_EXPR
])
11930 if (list_length (argtypes
) != 3 && methodp
)
11932 cp_error ("`%D' must take exactly one argument", decl
);
11935 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
11937 if (copy_assignment_arg_p (parmtype
, virtualp
)
11940 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
11941 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
11942 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11943 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
11946 else if (name
== ansi_opname
[(int) COND_EXPR
])
11949 cp_error ("ANSI C++ prohibits overloading operator ?:");
11951 else if (ambi_op_p (name
))
11953 if (list_length (argtypes
) == 2)
11955 else if (list_length (argtypes
) == 3)
11957 if ((name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11958 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11959 && ! processing_template_decl
11960 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
11963 cp_error ("postfix `%D' must take `int' as its argument",
11967 ("postfix `%D' must take `int' as its second argument",
11974 cp_error ("`%D' must take either zero or one argument", decl
);
11976 cp_error ("`%D' must take either one or two arguments", decl
);
11979 /* More Effective C++ rule 6. */
11981 && (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11982 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]))
11984 tree arg
= TREE_VALUE (argtypes
);
11985 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
11986 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
11987 arg
= TREE_TYPE (arg
);
11988 arg
= TYPE_MAIN_VARIANT (arg
);
11989 if (list_length (argtypes
) == 2)
11991 if (TREE_CODE (ret
) != REFERENCE_TYPE
11992 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
11994 cp_warning ("prefix `%D' should return `%T'", decl
,
11995 build_reference_type (arg
));
11999 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
12000 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
12004 else if (unary_op_p (name
))
12006 if (list_length (argtypes
) != 2)
12009 cp_error ("`%D' must take `void'", decl
);
12011 cp_error ("`%D' must take exactly one argument", decl
);
12014 else /* if (binary_op_p (name)) */
12016 if (list_length (argtypes
) != 3)
12019 cp_error ("`%D' must take exactly one argument", decl
);
12021 cp_error ("`%D' must take exactly two arguments", decl
);
12024 /* More Effective C++ rule 7. */
12026 && (name
== ansi_opname
[TRUTH_ANDIF_EXPR
]
12027 || name
== ansi_opname
[TRUTH_ORIF_EXPR
]
12028 || name
== ansi_opname
[COMPOUND_EXPR
]))
12029 cp_warning ("user-defined `%D' always evaluates both arguments",
12033 /* Effective C++ rule 23. */
12035 && list_length (argtypes
) == 3
12036 && (name
== ansi_opname
[PLUS_EXPR
]
12037 || name
== ansi_opname
[MINUS_EXPR
]
12038 || name
== ansi_opname
[TRUNC_DIV_EXPR
]
12039 || name
== ansi_opname
[MULT_EXPR
])
12040 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
12041 cp_warning ("`%D' should return by value", decl
);
12045 for (; argtypes
!= void_list_node
; argtypes
= TREE_CHAIN (argtypes
))
12046 if (TREE_PURPOSE (argtypes
))
12048 TREE_PURPOSE (argtypes
) = NULL_TREE
;
12049 if (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
12050 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
12053 cp_pedwarn ("`%D' cannot have default arguments", decl
);
12056 cp_error ("`%D' cannot have default arguments", decl
);
12061 static const char *
12063 enum tag_types code
;
12076 my_friendly_abort (981122);
12080 /* Get the struct, enum or union (CODE says which) with tag NAME.
12081 Define the tag as a forward-reference if it is not defined.
12083 C++: If a class derivation is given, process it here, and report
12084 an error if multiple derivation declarations are not identical.
12086 If this is a definition, come in through xref_tag and only look in
12087 the current frame for the name (since C++ allows new names in any
12091 xref_tag (code_type_node
, name
, globalize
)
12092 tree code_type_node
;
12096 enum tag_types tag_code
;
12097 enum tree_code code
;
12099 register tree ref
, t
;
12100 struct binding_level
*b
= current_binding_level
;
12102 tree attributes
= NULL_TREE
;
12103 tree context
= NULL_TREE
;
12105 /* If we are called from the parser, code_type_node will sometimes be a
12106 TREE_LIST. This indicates that the user wrote
12107 "class __attribute__ ((foo)) bar". Extract the attributes so we can
12109 if (TREE_CODE (code_type_node
) == TREE_LIST
)
12111 attributes
= TREE_PURPOSE (code_type_node
);
12112 code_type_node
= TREE_VALUE (code_type_node
);
12115 tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
12120 code
= RECORD_TYPE
;
12126 code
= ENUMERAL_TYPE
;
12129 my_friendly_abort (18);
12132 /* If a cross reference is requested, look up the type
12133 already defined for this tag and return it. */
12134 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
12137 name
= TYPE_IDENTIFIER (t
);
12141 t
= IDENTIFIER_TYPE_VALUE (name
);
12143 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
12144 && TREE_CODE (t
) != TEMPLATE_TEMPLATE_PARM
)
12149 /* If we know we are defining this tag, only look it up in
12150 this scope and don't try to find it as a type. */
12151 ref
= lookup_tag (code
, name
, b
, 1);
12157 /* [dcl.type.elab] If the identifier resolves to a
12158 typedef-name or a template type-parameter, the
12159 elaborated-type-specifier is ill-formed. */
12160 if (t
!= TYPE_MAIN_VARIANT (t
)
12161 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
12162 cp_pedwarn ("using typedef-name `%D' after `%s'",
12163 TYPE_NAME (t
), tag_name (tag_code
));
12164 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12165 cp_error ("using template type parameter `%T' after `%s'",
12166 t
, tag_name (tag_code
));
12171 ref
= lookup_tag (code
, name
, b
, 0);
12175 /* Try finding it as a type declaration. If that wins,
12177 ref
= lookup_name (name
, 1);
12179 if (ref
!= NULL_TREE
12180 && processing_template_decl
12181 && DECL_CLASS_TEMPLATE_P (ref
)
12182 && template_class_depth (current_class_type
) == 0)
12183 /* Since GLOBALIZE is true, we're declaring a global
12184 template, so we want this type. */
12185 ref
= DECL_RESULT (ref
);
12187 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12188 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12189 ref
= TREE_TYPE (ref
);
12194 if (ref
&& current_class_type
12195 && template_class_depth (current_class_type
)
12196 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12198 /* Since GLOBALIZE is non-zero, we are not looking at a
12199 definition of this tag. Since, in addition, we are currently
12200 processing a (member) template declaration of a template
12201 class, we must be very careful; consider:
12208 { template <class V>
12209 friend struct S1; };
12211 Here, the S2::S1 declaration should not be confused with the
12212 outer declaration. In particular, the inner version should
12213 have a template parameter of level 2, not level 1. This
12214 would be particularly important if the member declaration
12217 template <class V = U> friend struct S1;
12219 say, when we should tsubst into `U' when instantiating
12220 S2. On the other hand, when presented with:
12230 we must find the inner binding eventually. We
12231 accomplish this by making sure that the new type we
12232 create to represent this declaration has the right
12234 context
= TYPE_CONTEXT (ref
);
12239 push_obstacks_nochange ();
12243 /* If no such tag is yet defined, create a forward-reference node
12244 and record it as the "definition".
12245 When a real declaration of this type is found,
12246 the forward-reference will be altered into a real type. */
12248 /* In C++, since these migrate into the global scope, we must
12249 build them on the permanent obstack. */
12251 temp
= allocation_temporary_p ();
12253 end_temporary_allocation ();
12255 if (code
== ENUMERAL_TYPE
)
12257 cp_error ("use of enum `%#D' without previous declaration", name
);
12259 ref
= make_node (ENUMERAL_TYPE
);
12261 /* Give the type a default layout like unsigned int
12262 to avoid crashing if it does not get defined. */
12263 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12264 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12265 TREE_UNSIGNED (ref
) = 1;
12266 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12267 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12268 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12270 /* Enable us to recognize when a type is created in class context.
12271 To do nested classes correctly, this should probably be cleared
12272 out when we leave this classes scope. Currently this in only
12273 done in `start_enum'. */
12275 pushtag (name
, ref
, globalize
);
12279 struct binding_level
*old_b
= class_binding_level
;
12281 ref
= make_lang_type (code
);
12282 TYPE_CONTEXT (ref
) = context
;
12284 #ifdef NONNESTED_CLASSES
12285 /* Class types don't nest the way enums do. */
12286 class_binding_level
= (struct binding_level
*)0;
12288 pushtag (name
, ref
, globalize
);
12289 class_binding_level
= old_b
;
12294 /* If it no longer looks like a nested type, make sure it's
12296 If it is not an IDENTIFIER, this is not a declaration */
12297 if (b
->namespace_p
&& !class_binding_level
12298 && TREE_CODE (name
) == IDENTIFIER_NODE
)
12300 if (IDENTIFIER_NAMESPACE_VALUE (name
) == NULL_TREE
)
12301 SET_IDENTIFIER_NAMESPACE_VALUE (name
, TYPE_NAME (ref
));
12304 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12305 redeclare_class_template (ref
, current_template_parms
);
12308 /* Until the type is defined, tentatively accept whatever
12309 structure tag the user hands us. */
12310 if (TYPE_SIZE (ref
) == NULL_TREE
12311 && ref
!= current_class_type
12312 /* Have to check this, in case we have contradictory tag info. */
12313 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12315 if (tag_code
== class_type
)
12316 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12317 else if (tag_code
== record_type
)
12318 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12323 TREE_TYPE (ref
) = attributes
;
12329 xref_tag_from_type (old
, id
, globalize
)
12333 tree code_type_node
;
12335 if (TREE_CODE (old
) == RECORD_TYPE
)
12336 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12337 ? class_type_node
: record_type_node
);
12339 code_type_node
= union_type_node
;
12341 if (id
== NULL_TREE
)
12342 id
= TYPE_IDENTIFIER (old
);
12344 return xref_tag (code_type_node
, id
, globalize
);
12347 /* REF is a type (named NAME), for which we have just seen some
12348 baseclasses. BINFO is a list of those baseclasses; the
12349 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12350 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12351 struct, or union. */
12354 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12355 tree code_type_node
;
12359 /* In the declaration `A : X, Y, ... Z' we mark all the types
12360 (A, X, Y, ..., Z) so we can check for duplicates. */
12365 enum tag_types tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
12367 if (tag_code
== union_type
)
12369 cp_error ("derived union `%T' invalid", ref
);
12373 len
= list_length (binfo
);
12374 push_obstacks (TYPE_OBSTACK (ref
), TYPE_OBSTACK (ref
));
12376 /* First, make sure that any templates in base-classes are
12377 instantiated. This ensures that if we call ourselves recursively
12378 we do not get confused about which classes are marked and which
12380 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12381 complete_type (TREE_VALUE (base
));
12383 SET_CLASSTYPE_MARKED (ref
);
12384 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12386 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12388 /* The base of a derived struct is public by default. */
12390 = (TREE_PURPOSE (binfo
) == access_public_node
12391 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12392 || (tag_code
!= class_type
12393 && (TREE_PURPOSE (binfo
) == access_default_node
12394 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12396 = (TREE_PURPOSE (binfo
) == access_protected_node
12397 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12399 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12400 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12401 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12402 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12403 tree basetype
= TREE_VALUE (binfo
);
12406 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12407 basetype
= TREE_TYPE (basetype
);
12409 || (TREE_CODE (basetype
) != RECORD_TYPE
12410 && TREE_CODE (basetype
) != TYPENAME_TYPE
12411 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12412 && TREE_CODE (basetype
) != TEMPLATE_TEMPLATE_PARM
))
12414 cp_error ("base type `%T' fails to be a struct or class type",
12415 TREE_VALUE (binfo
));
12419 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12421 /* This code replaces similar code in layout_basetypes.
12422 We put the complete_type first for implicit `typename'. */
12423 if (TYPE_SIZE (basetype
) == NULL_TREE
12424 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12426 cp_error ("base class `%T' has incomplete type", basetype
);
12431 if (CLASSTYPE_MARKED (basetype
))
12433 if (basetype
== ref
)
12434 cp_error ("recursive type `%T' undefined", basetype
);
12436 cp_error ("duplicate base type `%T' invalid", basetype
);
12440 if (TYPE_FOR_JAVA (basetype
)
12441 && current_lang_stack
== current_lang_base
)
12442 TYPE_FOR_JAVA (ref
) = 1;
12444 /* Note that the BINFO records which describe individual
12445 inheritances are *not* shared in the lattice! They
12446 cannot be shared because a given baseclass may be
12447 inherited with different `accessibility' by different
12448 derived classes. (Each BINFO record describing an
12449 individual inheritance contains flags which say what
12450 the `accessibility' of that particular inheritance is.) */
12453 = make_binfo (integer_zero_node
, basetype
,
12454 CLASS_TYPE_P (basetype
)
12455 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
12456 CLASS_TYPE_P (basetype
)
12457 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
12459 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
12460 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
12461 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
12462 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
12463 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
12465 /* We need to unshare the binfos now so that lookups during class
12466 definition work. */
12467 unshare_base_binfos (base_binfo
);
12469 SET_CLASSTYPE_MARKED (basetype
);
12471 /* We are free to modify these bits because they are meaningless
12472 at top level, and BASETYPE is a top-level type. */
12473 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
12475 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
12476 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12479 if (CLASS_TYPE_P (basetype
))
12481 TYPE_GETS_NEW (ref
) |= TYPE_GETS_NEW (basetype
);
12482 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
12489 TREE_VEC_LENGTH (binfos
) = i
;
12491 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
12494 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
12497 tree basetype
= BINFO_TYPE (TREE_VEC_ELT (binfos
, 0));
12499 if (CLASS_TYPE_P (basetype
))
12500 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
12501 = TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
12504 if (TYPE_USES_MULTIPLE_INHERITANCE (ref
))
12505 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12507 /* Unmark all the types. */
12509 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
12510 CLEAR_CLASSTYPE_MARKED (ref
);
12512 /* Now that we know all the base-classes, set up the list of virtual
12514 CLASSTYPE_VBASECLASSES (ref
) = get_vbase_types (ref
);
12520 /* Begin compiling the definition of an enumeration type.
12521 NAME is its name (or null if anonymous).
12522 Returns the type object, as yet incomplete.
12523 Also records info about it so that build_enumerator
12524 may be used to declare the individual values as they are read. */
12530 register tree enumtype
= NULL_TREE
;
12531 struct binding_level
*b
= current_binding_level
;
12533 /* We are wasting space here and putting these on the permanent_obstack so
12534 that typeid(local enum) will work correctly. */
12535 push_obstacks (&permanent_obstack
, &permanent_obstack
);
12537 /* If this is the real definition for a previous forward reference,
12538 fill in the contents in the same object that used to be the
12539 forward reference. */
12541 if (name
!= NULL_TREE
)
12542 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
12544 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
12546 cp_error ("multiple definition of `%#T'", enumtype
);
12547 cp_error_at ("previous definition here", enumtype
);
12551 enumtype
= make_node (ENUMERAL_TYPE
);
12552 pushtag (name
, enumtype
, 0);
12555 if (current_class_type
)
12556 TREE_ADDRESSABLE (b
->tags
) = 1;
12558 /* We don't copy this value because build_enumerator needs to do it. */
12559 enum_next_value
= integer_zero_node
;
12562 GNU_xref_decl (current_function_decl
, enumtype
);
12566 /* After processing and defining all the values of an enumeration type,
12567 install their decls in the enumeration type and finish it off.
12568 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12569 Returns ENUMTYPE. */
12572 finish_enum (enumtype
)
12575 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
12576 /* Calculate the maximum value of any enumerator in this type. */
12578 tree values
= TYPE_VALUES (enumtype
);
12583 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
12588 /* The TREE_VALUE is a CONST_DECL for this enumeration
12590 decl
= TREE_VALUE (pair
);
12592 /* The DECL_INITIAL will be NULL if we are processing a
12593 template declaration and this enumeration constant had no
12594 explicit initializer. */
12595 value
= DECL_INITIAL (decl
);
12596 if (value
&& !processing_template_decl
)
12598 /* Set the TREE_TYPE for the VALUE as well. That's so
12599 that when we call decl_constant_value we get an
12600 entity of the right type (but with the constant
12601 value). Since we shouldn't ever call
12602 decl_constant_value on a template type, there's no
12603 reason to do that when processing_template_decl.
12604 And, if the expression is something like a
12605 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12606 wreak havoc on the intended type of the expression.
12608 Of course, there's also no point in trying to compute
12609 minimum or maximum values if we're in a template. */
12610 TREE_TYPE (value
) = enumtype
;
12613 minnode
= maxnode
= value
;
12614 else if (tree_int_cst_lt (maxnode
, value
))
12616 else if (tree_int_cst_lt (value
, minnode
))
12620 if (processing_template_decl
)
12621 /* If this is just a template, leave the CONST_DECL
12622 alone. That way tsubst_copy will find CONST_DECLs for
12623 CONST_DECLs, and not INTEGER_CSTs. */
12626 /* In the list we're building up, we want the enumeration
12627 values, not the CONST_DECLs. */
12628 TREE_VALUE (pair
) = value
;
12632 maxnode
= minnode
= integer_zero_node
;
12634 TYPE_VALUES (enumtype
) = nreverse (values
);
12636 if (processing_template_decl
)
12638 tree scope
= current_scope ();
12639 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
12640 add_tree (build_min (TAG_DEFN
, enumtype
));
12644 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
12645 int lowprec
= min_precision (minnode
, unsignedp
);
12646 int highprec
= min_precision (maxnode
, unsignedp
);
12647 int precision
= MAX (lowprec
, highprec
);
12650 TYPE_SIZE (enumtype
) = NULL_TREE
;
12652 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
12654 TYPE_PRECISION (enumtype
) = precision
;
12656 fixup_unsigned_type (enumtype
);
12658 fixup_signed_type (enumtype
);
12660 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
12661 /* Use the width of the narrowest normal C type which is wide
12663 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
12666 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
12668 TYPE_SIZE (enumtype
) = 0;
12669 layout_type (enumtype
);
12671 /* Fix up all variant types of this enum type. */
12672 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
12673 tem
= TYPE_NEXT_VARIANT (tem
))
12675 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
12676 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
12677 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
12678 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
12679 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
12680 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
12681 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
12682 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
12683 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
12686 /* Finish debugging output for this type. */
12687 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
12690 /* In start_enum we pushed obstacks. Here, we must pop them. */
12696 /* Build and install a CONST_DECL for an enumeration constant of the
12697 enumeration type TYPE whose NAME and VALUE (if any) are provided.
12698 Assignment of sequential values by default is handled here. */
12701 build_enumerator (name
, value
, type
)
12709 /* Remove no-op casts from the value. */
12711 STRIP_TYPE_NOPS (value
);
12713 if (! processing_template_decl
)
12715 /* Validate and default VALUE. */
12716 if (value
!= NULL_TREE
)
12718 if (TREE_READONLY_DECL_P (value
))
12719 value
= decl_constant_value (value
);
12721 if (TREE_CODE (value
) == INTEGER_CST
)
12723 value
= default_conversion (value
);
12724 constant_expression_warning (value
);
12728 cp_error ("enumerator value for `%D' not integer constant", name
);
12733 /* Default based on previous value. */
12734 if (value
== NULL_TREE
&& ! processing_template_decl
)
12736 value
= enum_next_value
;
12738 cp_error ("overflow in enumeration values at `%D'", name
);
12741 /* Remove no-op casts from the value. */
12743 STRIP_TYPE_NOPS (value
);
12745 /* To fix MAX_VAL enum consts. (bkoz) */
12746 TREE_TYPE (value
) = integer_type_node
;
12750 /* We always have to copy here; not all INTEGER_CSTs are unshared.
12751 Even in other cases, we will later (in finish_enum) be setting the
12753 if (value
!= NULL_TREE
)
12754 value
= copy_node (value
);
12756 /* C++ associates enums with global, function, or class declarations. */
12758 context
= current_scope ();
12759 if (context
&& context
== current_class_type
)
12760 /* This enum declaration is local to the class. */
12761 decl
= build_lang_decl (CONST_DECL
, name
, type
);
12763 /* It's a global enum, or it's local to a function. (Note local to
12764 a function could mean local to a class method. */
12765 decl
= build_decl (CONST_DECL
, name
, type
);
12767 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
12768 DECL_INITIAL (decl
) = value
;
12769 TREE_READONLY (decl
) = 1;
12771 if (context
&& context
== current_class_type
)
12772 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
12773 on the TYPE_FIELDS list for `S'. (That's so that you can say
12774 things like `S::i' later.) */
12775 finish_member_declaration (decl
);
12779 GNU_xref_decl (current_function_decl
, decl
);
12782 if (! processing_template_decl
)
12784 /* Set basis for default for next value. */
12785 enum_next_value
= build_binary_op_nodefault (PLUS_EXPR
, value
,
12786 integer_one_node
, PLUS_EXPR
);
12787 enum_overflow
= tree_int_cst_lt (enum_next_value
, value
);
12790 result
= saveable_tree_cons (name
, decl
, NULL_TREE
);
12795 static int function_depth
;
12797 /* Create the FUNCTION_DECL for a function definition.
12798 DECLSPECS and DECLARATOR are the parts of the declaration;
12799 they describe the function's name and the type it returns,
12800 but twisted together in a fashion that parallels the syntax of C.
12802 If PRE_PARSED_P is non-zero then DECLARATOR is really the DECL for
12803 the function we are about to process; DECLSPECS are ignored. For
12804 example, we set PRE_PARSED_P when processing the definition of
12805 inline function that was defined in-class; the definition is
12806 actually processed when the class is complete. In this case,
12807 PRE_PARSED_P is 2. We also set PRE_PARSED_P when instanting the
12808 body of a template function, and when constructing thunk functions
12809 and such; in these cases PRE_PARSED_P is 1.
12811 This function creates a binding context for the function body
12812 as well as setting up the FUNCTION_DECL in current_function_decl.
12814 Returns 1 on success. If the DECLARATOR is not suitable for a function
12815 (it defines a datum instead), we return 0, which tells
12816 yyparse to report a parse error.
12818 For C++, we must first check whether that datum makes any sense.
12819 For example, "class A local_a(1,2);" means that variable local_a
12820 is an aggregate of type A, which should have a constructor
12821 applied to it with the argument list [1, 2].
12823 @@ There is currently no way to retrieve the storage
12824 @@ allocated to FUNCTION (or all of its parms) if we return
12825 @@ something we had previously. */
12828 start_function (declspecs
, declarator
, attrs
, pre_parsed_p
)
12829 tree declspecs
, declarator
, attrs
;
12833 tree ctype
= NULL_TREE
;
12836 extern int have_extern_spec
;
12837 extern int used_extern_spec
;
12838 int doing_friend
= 0;
12840 /* Sanity check. */
12841 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
12842 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
12844 /* Assume, until we see it does. */
12845 current_function_returns_value
= 0;
12846 current_function_returns_null
= 0;
12848 current_function_assigns_this
= 0;
12849 current_function_just_assigned_this
= 0;
12850 current_function_parms_stored
= 0;
12851 original_result_rtx
= NULL_RTX
;
12852 base_init_expr
= NULL_TREE
;
12853 current_base_init_list
= NULL_TREE
;
12854 current_member_init_list
= NULL_TREE
;
12855 ctor_label
= dtor_label
= NULL_TREE
;
12856 static_labelno
= 0;
12857 in_function_try_handler
= 0;
12859 clear_temp_name ();
12861 /* This should only be done once on the top most decl. */
12862 if (have_extern_spec
&& !used_extern_spec
)
12864 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
12865 used_extern_spec
= 1;
12870 decl1
= declarator
;
12872 fntype
= TREE_TYPE (decl1
);
12873 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12874 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12876 /* ANSI C++ June 5 1992 WP 11.4.5. A friend function defined in a
12877 class is in the (lexical) scope of the class in which it is
12879 if (!ctype
&& DECL_FRIEND_P (decl1
))
12881 ctype
= DECL_CLASS_CONTEXT (decl1
);
12883 /* CTYPE could be null here if we're dealing with a template;
12884 for example, `inline friend float foo()' inside a template
12885 will have no CTYPE set. */
12886 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
12892 last_function_parms
= DECL_ARGUMENTS (decl1
);
12893 last_function_parm_tags
= NULL_TREE
;
12897 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
12898 /* If the declarator is not suitable for a function definition,
12899 cause a syntax error. */
12900 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
12902 fntype
= TREE_TYPE (decl1
);
12904 restype
= TREE_TYPE (fntype
);
12905 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
12907 cp_error ("semicolon missing after declaration of `%#T'", restype
);
12908 shadow_tag (build_expr_list (NULL_TREE
, restype
));
12909 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
12910 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
12911 fntype
= build_function_type (integer_type_node
,
12912 TYPE_ARG_TYPES (fntype
));
12914 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
12916 TYPE_ARG_TYPES (fntype
));
12917 TREE_TYPE (decl1
) = fntype
;
12920 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12921 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12922 else if (DECL_MAIN_P (decl1
))
12924 /* If this doesn't return integer_type, complain. */
12925 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
12927 if (pedantic
|| warn_return_type
)
12928 pedwarn ("return type for `main' changed to `int'");
12929 TREE_TYPE (decl1
) = fntype
= default_function_type
;
12934 /* Warn if function was previously implicitly declared
12935 (but not if we warned then). */
12936 if (! warn_implicit
12937 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
12938 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
12940 if (!building_stmt_tree ())
12941 announce_function (decl1
);
12943 /* Set up current_class_type, and enter the scope of the class, if
12946 push_nested_class (ctype
, 1);
12947 else if (DECL_STATIC_FUNCTION_P (decl1
))
12948 push_nested_class (DECL_CONTEXT (decl1
), 2);
12950 /* Now that we have entered the scope of the class, we must restore
12951 the bindings for any template parameters surrounding DECL1, if it
12952 is an inline member template. (Order is important; consider the
12953 case where a template parameter has the same name as a field of
12954 the class.) It is not until after this point that
12955 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
12956 if (pre_parsed_p
== 2)
12957 maybe_begin_member_template_processing (decl1
);
12959 /* Effective C++ rule 15. See also c_expand_return. */
12961 && DECL_NAME (decl1
) == ansi_opname
[(int) MODIFY_EXPR
]
12962 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
12963 cp_warning ("`operator=' should return a reference to `*this'");
12965 /* Make the init_value nonzero so pushdecl knows this is not tentative.
12966 error_mark_node is replaced below (in poplevel) with the BLOCK. */
12967 DECL_INITIAL (decl1
) = error_mark_node
;
12969 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
12970 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
12973 /* This function exists in static storage.
12974 (This does not mean `static' in the C sense!) */
12975 TREE_STATIC (decl1
) = 1;
12977 /* We must call push_template_decl after current_class_type is set
12978 up. (If we are processing inline definitions after exiting a
12979 class scope, current_class_type will be NULL_TREE until set above
12980 by push_nested_class.) */
12981 if (processing_template_decl
)
12982 decl1
= push_template_decl (decl1
);
12984 /* We are now in the scope of the function being defined. */
12985 current_function_decl
= decl1
;
12987 /* Save the parm names or decls from this function's declarator
12988 where store_parm_decls will find them. */
12989 current_function_parms
= last_function_parms
;
12990 current_function_parm_tags
= last_function_parm_tags
;
12992 if (! processing_template_decl
)
12994 /* In a function definition, arg types must be complete. */
12995 require_complete_types_for_parms (current_function_parms
);
12997 if (TYPE_SIZE (complete_type (TREE_TYPE (fntype
))) == NULL_TREE
)
12999 cp_error ("return-type `%#T' is an incomplete type",
13000 TREE_TYPE (fntype
));
13002 /* Make it return void instead, but don't change the
13003 type of the DECL_RESULT, in case we have a named return value. */
13006 = build_cplus_method_type (build_type_variant (ctype
,
13007 TREE_READONLY (decl1
),
13008 TREE_SIDE_EFFECTS (decl1
)),
13010 FUNCTION_ARG_CHAIN (decl1
));
13013 = build_function_type (void_type_node
,
13014 TYPE_ARG_TYPES (TREE_TYPE (decl1
)));
13015 DECL_RESULT (decl1
)
13016 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (TREE_TYPE (fntype
)));
13017 TREE_READONLY (DECL_RESULT (decl1
))
13018 = CP_TYPE_CONST_P (TREE_TYPE (fntype
));
13019 TREE_THIS_VOLATILE (DECL_RESULT (decl1
))
13020 = CP_TYPE_VOLATILE_P (TREE_TYPE (fntype
));
13023 abstract_virtuals_error (decl1
, TREE_TYPE (fntype
));
13026 /* Record the decl so that the function name is defined.
13027 If we already have a decl for this name, and it is a FUNCTION_DECL,
13028 use the old decl. */
13029 if (!processing_template_decl
&& pre_parsed_p
== 0)
13031 /* A specialization is not used to guide overload resolution. */
13032 if ((flag_guiding_decls
13033 || !DECL_TEMPLATE_SPECIALIZATION (decl1
))
13034 && ! DECL_FUNCTION_MEMBER_P (decl1
))
13035 decl1
= pushdecl (decl1
);
13038 /* We need to set the DECL_CONTEXT. */
13039 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
13040 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
13041 /* And make sure we have enough default args. */
13042 check_default_args (decl1
);
13044 DECL_MAIN_VARIANT (decl1
) = decl1
;
13045 fntype
= TREE_TYPE (decl1
);
13048 current_function_decl
= decl1
;
13050 if (DECL_INTERFACE_KNOWN (decl1
))
13052 tree ctx
= hack_decl_function_context (decl1
);
13054 if (DECL_NOT_REALLY_EXTERN (decl1
))
13055 DECL_EXTERNAL (decl1
) = 0;
13057 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
13058 && TREE_PUBLIC (ctx
))
13059 /* This is a function in a local class in an extern inline
13061 comdat_linkage (decl1
);
13063 /* If this function belongs to an interface, it is public.
13064 If it belongs to someone else's interface, it is also external.
13065 This only affects inlines and template instantiations. */
13066 else if (interface_unknown
== 0
13067 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13068 || flag_alt_external_templates
))
13070 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
13071 || processing_template_decl
)
13073 DECL_EXTERNAL (decl1
)
13075 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
13076 && !DECL_VINDEX (decl1
)));
13078 /* For WIN32 we also want to put these in linkonce sections. */
13079 maybe_make_one_only (decl1
);
13082 DECL_EXTERNAL (decl1
) = 0;
13083 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
13084 DECL_INTERFACE_KNOWN (decl1
) = 1;
13086 else if (interface_unknown
&& interface_only
13087 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13088 || flag_alt_external_templates
))
13090 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13091 interface, we will have interface_only set but not
13092 interface_known. In that case, we don't want to use the normal
13093 heuristics because someone will supply a #pragma implementation
13094 elsewhere, and deducing it here would produce a conflict. */
13095 comdat_linkage (decl1
);
13096 DECL_EXTERNAL (decl1
) = 0;
13097 DECL_INTERFACE_KNOWN (decl1
) = 1;
13098 DECL_DEFER_OUTPUT (decl1
) = 1;
13102 /* This is a definition, not a reference.
13103 So clear DECL_EXTERNAL. */
13104 DECL_EXTERNAL (decl1
) = 0;
13106 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
13107 && ! DECL_INTERFACE_KNOWN (decl1
)
13108 /* Don't try to defer nested functions for now. */
13109 && ! hack_decl_function_context (decl1
))
13110 DECL_DEFER_OUTPUT (decl1
) = 1;
13112 DECL_INTERFACE_KNOWN (decl1
) = 1;
13115 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
))
13117 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13118 TREE_TYPE (decl1
) = fntype
13119 = build_function_type (TREE_TYPE (fntype
),
13120 TREE_CHAIN (TYPE_ARG_TYPES (fntype
)));
13121 current_function_parms
= TREE_CHAIN (current_function_parms
);
13122 DECL_ARGUMENTS (decl1
) = current_function_parms
;
13125 restype
= TREE_TYPE (fntype
);
13129 /* If we're compiling a friend function, neither of the variables
13130 current_class_ptr nor current_class_type will have values. */
13131 if (! doing_friend
)
13133 /* We know that this was set up by `grokclassfn'.
13134 We do not wait until `store_parm_decls', since evil
13135 parse errors may never get us to that point. Here
13136 we keep the consistency between `current_class_type'
13137 and `current_class_ptr'. */
13138 tree t
= current_function_parms
;
13141 my_friendly_assert (t
!= NULL_TREE
13142 && TREE_CODE (t
) == PARM_DECL
, 162);
13143 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
13146 if (! hack_decl_function_context (decl1
))
13147 temporary_allocation ();
13148 i
= suspend_momentary ();
13150 /* Normally, build_indirect_ref returns current_class_ref
13151 whenever current_class_ptr is dereferenced. This time,
13152 however, we want it to *create* current_class_ref, so we
13153 temporarily clear current_class_ptr to fool it. */
13154 current_class_ptr
= NULL_TREE
;
13155 current_class_ref
= build_indirect_ref (t
, NULL_PTR
);
13156 current_class_ptr
= t
;
13158 resume_momentary (i
);
13159 if (! hack_decl_function_context (decl1
))
13160 end_temporary_allocation ();
13164 current_class_ptr
= current_class_ref
= NULL_TREE
;
13167 current_binding_level
->parm_flag
= 1;
13170 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13172 if (!building_stmt_tree ())
13174 GNU_xref_function (decl1
, current_function_parms
);
13175 make_function_rtl (decl1
);
13178 /* Promote the value to int before returning it. */
13179 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13180 restype
= type_promotes_to (restype
);
13182 /* If this fcn was already referenced via a block-scope `extern' decl
13183 (or an implicit decl), propagate certain information about the usage. */
13184 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13185 TREE_ADDRESSABLE (decl1
) = 1;
13187 if (DECL_RESULT (decl1
) == NULL_TREE
)
13189 DECL_RESULT (decl1
)
13190 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13191 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13192 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13195 /* Allocate further tree nodes temporarily during compilation
13196 of this function only. Tiemann moved up here from bottom of fn. */
13197 /* If this is a nested function, then we must continue to allocate RTL
13198 on the permanent obstack in case we need to inline it later. */
13199 if (! hack_decl_function_context (decl1
))
13200 temporary_allocation ();
13202 /* Make sure that we always have a momntary obstack while we're in a
13206 if (building_stmt_tree ())
13207 begin_stmt_tree (decl1
);
13211 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl1
))
13212 && DECL_LANGUAGE (decl1
) == lang_cplusplus
)
13214 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13215 ctor_label
= NULL_TREE
;
13219 dtor_label
= NULL_TREE
;
13220 if (DECL_CONSTRUCTOR_P (decl1
))
13221 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13227 /* Called after store_parm_decls for a function-try-block. We need to update
13228 last_parm_cleanup_insn so that the base initializers for a constructor
13229 are run within this block, not before it. */
13232 expand_start_early_try_stmts ()
13234 expand_start_try_stmts ();
13235 last_parm_cleanup_insn
= get_last_insn ();
13238 /* Store the parameter declarations into the current function declaration.
13239 This is called after parsing the parameter declarations, before
13240 digesting the body of the function.
13242 Also install to binding contour return value identifier, if any. */
13245 store_parm_decls ()
13247 register tree fndecl
= current_function_decl
;
13248 register tree parm
;
13249 int parms_have_cleanups
= 0;
13250 tree cleanups
= NULL_TREE
;
13252 /* This is either a chain of PARM_DECLs (when a prototype is used). */
13253 tree specparms
= current_function_parms
;
13255 /* This is a list of types declared among parms in a prototype. */
13256 tree parmtags
= current_function_parm_tags
;
13258 /* This is a chain of any other decls that came in among the parm
13259 declarations. If a parm is declared with enum {foo, bar} x;
13260 then CONST_DECLs for foo and bar are put here. */
13261 tree nonparms
= NULL_TREE
;
13263 if (toplevel_bindings_p ())
13264 fatal ("parse errors have confused me too much");
13266 /* Initialize RTL machinery. */
13267 init_function_start (fndecl
, input_filename
, lineno
);
13268 /* Even though we're inside a function body, we still don't want to
13269 call expand_expr to calculate the size of a variable-sized array.
13270 We haven't necessarily assigned RTL to all variables yet, so it's
13271 not safe to try to expand expressions involving them. */
13272 immediate_size_expand
= 0;
13273 get_pending_sizes ();
13275 /* Create a binding level for the parms. */
13276 expand_start_bindings (0);
13278 if (specparms
!= NULL_TREE
)
13280 /* This case is when the function was defined with an ANSI prototype.
13281 The parms already have decls, so we need not do anything here
13282 except record them as in effect
13283 and complain if any redundant old-style parm decls were written. */
13285 register tree next
;
13287 /* Must clear this because it might contain TYPE_DECLs declared
13289 storedecls (NULL_TREE
);
13291 for (parm
= nreverse (specparms
); parm
; parm
= next
)
13293 next
= TREE_CHAIN (parm
);
13294 if (TREE_CODE (parm
) == PARM_DECL
)
13297 if (DECL_NAME (parm
) == NULL_TREE
)
13301 else if (TREE_CODE (TREE_TYPE (parm
)) == VOID_TYPE
)
13302 cp_error ("parameter `%D' declared void", parm
);
13305 /* Now fill in DECL_REFERENCE_SLOT for any of the parm decls.
13306 A parameter is assumed not to have any side effects.
13307 If this should change for any reason, then this
13308 will have to wrap the bashed reference type in a save_expr.
13310 Also, if the parameter type is declared to be an X
13311 and there is an X(X&) constructor, we cannot lay it
13312 into the stack (any more), so we make this parameter
13313 look like it is really of reference type. Functions
13314 which pass parameters to this function will know to
13315 create a temporary in their frame, and pass a reference
13318 if (TREE_CODE (TREE_TYPE (parm
)) == REFERENCE_TYPE
13319 && TYPE_SIZE (TREE_TYPE (TREE_TYPE (parm
))))
13320 SET_DECL_REFERENCE_SLOT (parm
, convert_from_reference (parm
));
13324 if (! building_stmt_tree ()
13325 && (cleanup
= maybe_build_cleanup (parm
), cleanup
))
13327 expand_decl (parm
);
13328 parms_have_cleanups
= 1;
13330 /* Keep track of the cleanups. */
13331 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13336 /* If we find an enum constant or a type tag,
13337 put it aside for the moment. */
13338 TREE_CHAIN (parm
) = NULL_TREE
;
13339 nonparms
= chainon (nonparms
, parm
);
13343 /* Get the decls in their original chain order
13344 and record in the function. This is all and only the
13345 PARM_DECLs that were pushed into scope by the loop above. */
13346 DECL_ARGUMENTS (fndecl
) = getdecls ();
13348 storetags (chainon (parmtags
, gettags ()));
13351 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13353 /* Now store the final chain of decls for the arguments
13354 as the decl-chain of the current lexical scope.
13355 Put the enumerators in as well, at the front so that
13356 DECL_ARGUMENTS is not modified. */
13358 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13360 /* Declare __FUNCTION__ and __PRETTY_FUNCTION__ for this function. */
13361 declare_function_name ();
13363 /* Initialize the RTL code for the function. */
13364 DECL_SAVED_INSNS (fndecl
) = 0;
13365 if (! building_stmt_tree ())
13366 expand_function_start (fndecl
, parms_have_cleanups
);
13368 current_function_parms_stored
= 1;
13370 /* If this function is `main', emit a call to `__main'
13371 to run global initializers, etc. */
13372 if (DECL_MAIN_P (fndecl
) && !building_stmt_tree ())
13373 expand_main_function ();
13375 /* Now that we have initialized the parms, we can start their
13376 cleanups. We cannot do this before, since expand_decl_cleanup
13377 should not be called before the parm can be used. */
13378 if (cleanups
&& !building_stmt_tree ())
13380 for (cleanups
= nreverse (cleanups
); cleanups
; cleanups
= TREE_CHAIN (cleanups
))
13382 if (! expand_decl_cleanup (TREE_PURPOSE (cleanups
), TREE_VALUE (cleanups
)))
13383 cp_error ("parser lost in parsing declaration of `%D'",
13384 TREE_PURPOSE (cleanups
));
13388 /* Create a binding contour which can be used to catch
13389 cleanup-generated temporaries. Also, if the return value needs or
13390 has initialization, deal with that now. */
13391 if (parms_have_cleanups
)
13394 if (!building_stmt_tree ())
13395 expand_start_bindings (0);
13398 if (! building_stmt_tree () && flag_exceptions
)
13400 /* Do the starting of the exception specifications, if we have any. */
13401 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13402 expand_start_eh_spec ();
13405 last_parm_cleanup_insn
= get_last_insn ();
13406 last_dtor_insn
= get_last_insn ();
13409 /* Bind a name and initialization to the return value of
13410 the current function. */
13413 store_return_init (decl
)
13416 /* If this named return value comes in a register, put it in a
13417 pseudo-register. */
13418 if (DECL_REGISTER (decl
))
13420 original_result_rtx
= DECL_RTL (decl
);
13421 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
13426 /* Finish up a function declaration and compile that function
13427 all the way to assembler language output. The free the storage
13428 for the function definition.
13430 This is called after parsing the body of the function definition.
13431 LINENO is the current line number.
13433 FLAGS is a bitwise or of the following values:
13435 An extra call to poplevel (and expand_end_bindings) must be
13436 made to take care of the binding contour for the base
13437 initializers. This is only relevant for constructors.
13439 We just finished processing the body of an in-class inline
13440 function definition. (This processing will have taken place
13441 after the class definition is complete.)
13443 NESTED is nonzero if we were in the middle of compiling another function
13444 when we started on this one. */
13447 finish_function (lineno
, flags
, nested
)
13452 register tree fndecl
= current_function_decl
;
13453 tree fntype
, ctype
= NULL_TREE
;
13454 rtx fn_last_parm_insn
, insns
;
13455 /* Label to use if this function is supposed to return a value. */
13456 tree no_return_label
= NULL_TREE
;
13457 tree decls
= NULL_TREE
;
13458 int call_poplevel
= (flags
& 1) != 0;
13459 int inclass_inline
= (flags
& 2) != 0;
13462 /* When we get some parse errors, we can end up without a
13463 current_function_decl, so cope. */
13464 if (fndecl
== NULL_TREE
)
13467 if (function_depth
> 1)
13470 fntype
= TREE_TYPE (fndecl
);
13472 /* TREE_READONLY (fndecl) = 1;
13473 This caused &foo to be of type ptr-to-const-function
13474 which then got a warning when stored in a ptr-to-function variable. */
13476 /* This happens on strange parse errors. */
13477 if (! current_function_parms_stored
)
13480 store_parm_decls ();
13483 if (building_stmt_tree ())
13485 if (DECL_CONSTRUCTOR_P (fndecl
) && call_poplevel
)
13487 decls
= getdecls ();
13488 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13489 poplevel (decls
!= NULL_TREE
, 0, 0);
13494 if (write_symbols
!= NO_DEBUG
/*&& TREE_CODE (fntype) != METHOD_TYPE*/)
13496 tree ttype
= target_type (fntype
);
13499 if (IS_AGGR_TYPE (ttype
))
13500 /* Let debugger know it should output info for this type. */
13501 note_debug_info_needed (ttype
);
13503 for (parmdecl
= DECL_ARGUMENTS (fndecl
); parmdecl
; parmdecl
= TREE_CHAIN (parmdecl
))
13505 ttype
= target_type (TREE_TYPE (parmdecl
));
13506 if (IS_AGGR_TYPE (ttype
))
13507 /* Let debugger know it should output info for this type. */
13508 note_debug_info_needed (ttype
);
13512 /* Clean house because we will need to reorder insns here. */
13513 do_pending_stack_adjust ();
13517 tree binfo
= TYPE_BINFO (current_class_type
);
13518 tree cond
= integer_one_node
;
13520 tree in_charge_node
= lookup_name (in_charge_identifier
, 0);
13522 int ok_to_optimize_dtor
= 0;
13523 int empty_dtor
= get_last_insn () == last_dtor_insn
;
13525 if (current_function_assigns_this
)
13526 cond
= build (NE_EXPR
, boolean_type_node
,
13527 current_class_ptr
, integer_zero_node
);
13530 int n_baseclasses
= CLASSTYPE_N_BASECLASSES (current_class_type
);
13532 /* If this destructor is empty, then we don't need to check
13533 whether `this' is NULL in some cases. */
13534 if ((flag_this_is_variable
& 1) == 0)
13535 ok_to_optimize_dtor
= 1;
13536 else if (empty_dtor
)
13537 ok_to_optimize_dtor
13538 = (n_baseclasses
== 0
13539 || (n_baseclasses
== 1
13540 && TYPE_HAS_DESTRUCTOR (TYPE_BINFO_BASETYPE (current_class_type
, 0))));
13543 /* These initializations might go inline. Protect
13544 the binding level of the parms. */
13546 expand_start_bindings (0);
13548 if (current_function_assigns_this
)
13550 current_function_assigns_this
= 0;
13551 current_function_just_assigned_this
= 0;
13554 /* Generate the code to call destructor on base class.
13555 If this destructor belongs to a class with virtual
13556 functions, then set the virtual function table
13557 pointer to represent the type of our base class. */
13559 /* This side-effect makes call to `build_delete' generate the
13560 code we have to have at the end of this destructor.
13561 `build_delete' will set the flag again. */
13562 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
13564 /* These are two cases where we cannot delegate deletion. */
13565 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)
13566 || TYPE_GETS_REG_DELETE (current_class_type
))
13567 exprstmt
= build_delete (current_class_type
, current_class_ref
, integer_zero_node
,
13568 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
, 0);
13570 exprstmt
= build_delete (current_class_type
, current_class_ref
, in_charge_node
,
13571 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
, 0);
13573 /* If we did not assign to this, then `this' is non-zero at
13574 the end of a destructor. As a special optimization, don't
13575 emit test if this is an empty destructor. If it does nothing,
13576 it does nothing. If it calls a base destructor, the base
13577 destructor will perform the test. */
13579 if (exprstmt
!= error_mark_node
13580 && (TREE_CODE (exprstmt
) != NOP_EXPR
13581 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
13582 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
13584 expand_label (dtor_label
);
13585 if (cond
!= integer_one_node
)
13586 expand_start_cond (cond
, 0);
13587 if (exprstmt
!= void_zero_node
)
13588 /* Don't call `expand_expr_stmt' if we're not going to do
13589 anything, since -Wall will give a diagnostic. */
13590 expand_expr_stmt (exprstmt
);
13592 /* Run destructor on all virtual baseclasses. */
13593 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13595 tree vbases
= nreverse (copy_list (CLASSTYPE_VBASECLASSES (current_class_type
)));
13596 expand_start_cond (build (BIT_AND_EXPR
, integer_type_node
,
13597 in_charge_node
, integer_two_node
), 0);
13600 if (TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (vbases
)))
13602 tree vb
= get_vbase
13603 (BINFO_TYPE (vbases
),
13604 TYPE_BINFO (current_class_type
));
13606 (build_scoped_method_call
13607 (current_class_ref
, vb
, dtor_identifier
,
13608 build_expr_list (NULL_TREE
, integer_zero_node
)));
13610 vbases
= TREE_CHAIN (vbases
);
13612 expand_end_cond ();
13615 do_pending_stack_adjust ();
13616 if (cond
!= integer_one_node
)
13617 expand_end_cond ();
13620 virtual_size
= c_sizeof (current_class_type
);
13622 /* At the end, call delete if that's what's requested. */
13624 /* FDIS sez: At the point of definition of a virtual destructor
13625 (including an implicit definition), non-placement operator
13626 delete shall be looked up in the scope of the destructor's
13627 class and if found shall be accessible and unambiguous.
13629 This is somewhat unclear, but I take it to mean that if the
13630 class only defines placement deletes we don't do anything here.
13631 So we pass LOOKUP_SPECULATIVELY; delete_sanity will complain
13632 for us if they ever try to delete one of these. */
13634 if (TYPE_GETS_REG_DELETE (current_class_type
)
13635 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13636 exprstmt
= build_op_delete_call
13637 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
13638 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
13640 exprstmt
= NULL_TREE
;
13644 cond
= build (BIT_AND_EXPR
, integer_type_node
,
13645 in_charge_node
, integer_one_node
);
13646 expand_start_cond (cond
, 0);
13647 expand_expr_stmt (exprstmt
);
13648 expand_end_cond ();
13651 /* End of destructor. */
13652 expand_end_bindings (NULL_TREE
, getdecls () != NULL_TREE
, 0);
13653 poplevel (getdecls () != NULL_TREE
, 0, 0);
13655 /* Back to the top of destructor. */
13656 /* Don't execute destructor code if `this' is NULL. */
13660 /* If the dtor is empty, and we know there is not possible way we
13661 could use any vtable entries, before they are possibly set by
13662 a base class dtor, we don't have to setup the vtables, as we
13663 know that any base class dtoring will set up any vtables it
13664 needs. We avoid MI, because one base class dtor can do a
13665 virtual dispatch to an overridden function that would need to
13666 have a non-related vtable set up, we cannot avoid setting up
13667 vtables in that case. We could change this to see if there is
13668 just one vtable. */
13669 if (! empty_dtor
|| TYPE_USES_COMPLEX_INHERITANCE (current_class_type
))
13671 /* Make all virtual function table pointers in non-virtual base
13672 classes point to CURRENT_CLASS_TYPE's virtual function
13674 expand_direct_vtbls_init (binfo
, binfo
, 1, 0, current_class_ptr
);
13676 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13677 expand_indirect_vtbls_init (binfo
, current_class_ref
, current_class_ptr
);
13680 if (! ok_to_optimize_dtor
)
13682 cond
= build_binary_op (NE_EXPR
,
13683 current_class_ptr
, integer_zero_node
);
13684 expand_start_cond (cond
, 0);
13687 insns
= get_insns ();
13690 fn_last_parm_insn
= get_first_nonparm_insn ();
13691 if (fn_last_parm_insn
== NULL_RTX
)
13692 fn_last_parm_insn
= get_last_insn ();
13694 fn_last_parm_insn
= previous_insn (fn_last_parm_insn
);
13696 emit_insns_after (insns
, fn_last_parm_insn
);
13698 if (! ok_to_optimize_dtor
)
13699 expand_end_cond ();
13701 else if (current_function_assigns_this
)
13703 /* Does not need to call emit_base_init, because
13704 that is done (if needed) just after assignment to this
13707 if (DECL_CONSTRUCTOR_P (current_function_decl
))
13709 end_protect_partials ();
13710 expand_label (ctor_label
);
13711 ctor_label
= NULL_TREE
;
13715 decls
= getdecls ();
13716 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13717 poplevel (decls
!= NULL_TREE
, 0, 0);
13719 /* c_expand_return knows to return 'this' from a constructor. */
13720 c_expand_return (NULL_TREE
);
13722 else if (TREE_CODE (TREE_TYPE (DECL_RESULT (current_function_decl
))) != VOID_TYPE
13723 && return_label
!= NULL_RTX
)
13724 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13726 current_function_assigns_this
= 0;
13727 current_function_just_assigned_this
= 0;
13728 base_init_expr
= NULL_TREE
;
13730 else if (DECL_CONSTRUCTOR_P (fndecl
))
13732 tree cond
= NULL_TREE
, thenclause
= NULL_TREE
;
13733 /* Allow constructor for a type to get a new instance of the object
13734 using `build_new'. */
13735 tree abstract_virtuals
= CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
);
13736 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
) = NULL_TREE
;
13738 if (flag_this_is_variable
> 0)
13740 cond
= build_binary_op (EQ_EXPR
,
13741 current_class_ptr
, integer_zero_node
);
13742 thenclause
= build_modify_expr (current_class_ptr
, NOP_EXPR
,
13743 build_new (NULL_TREE
, current_class_type
, void_type_node
, 0));
13746 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
) = abstract_virtuals
;
13750 if (flag_this_is_variable
> 0)
13752 expand_start_cond (cond
, 0);
13753 expand_expr_stmt (thenclause
);
13754 expand_end_cond ();
13757 /* Emit insns from `emit_base_init' which sets up virtual
13758 function table pointer(s). */
13759 if (base_init_expr
)
13761 expand_expr_stmt (base_init_expr
);
13762 base_init_expr
= NULL_TREE
;
13765 insns
= get_insns ();
13768 /* This is where the body of the constructor begins. */
13770 emit_insns_after (insns
, last_parm_cleanup_insn
);
13772 end_protect_partials ();
13774 /* This is where the body of the constructor ends. */
13775 expand_label (ctor_label
);
13776 ctor_label
= NULL_TREE
;
13780 decls
= getdecls ();
13781 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13782 poplevel (decls
!= NULL_TREE
, 1, 0);
13785 /* c_expand_return knows to return 'this' from a constructor. */
13786 c_expand_return (NULL_TREE
);
13788 current_function_assigns_this
= 0;
13789 current_function_just_assigned_this
= 0;
13791 else if (DECL_MAIN_P (fndecl
))
13793 /* Make it so that `main' always returns 0 by default. */
13795 c_expand_return (integer_one_node
);
13797 c_expand_return (integer_zero_node
);
13800 else if (return_label
!= NULL_RTX
13801 && current_function_return_value
== NULL_TREE
13802 && ! DECL_NAME (DECL_RESULT (current_function_decl
)))
13803 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13805 if (flag_exceptions
)
13806 expand_exception_blocks ();
13808 /* If this function is supposed to return a value, ensure that
13809 we do not fall into the cleanups by mistake. The end of our
13810 function will look like this:
13812 user code (may have return stmt somewhere)
13813 goto no_return_label
13818 NOTE_INSN_FUNCTION_END
13822 If the user omits a return stmt in the USER CODE section, we
13823 will have a control path which reaches NOTE_INSN_FUNCTION_END.
13824 Otherwise, we won't. */
13825 if (no_return_label
)
13827 DECL_CONTEXT (no_return_label
) = fndecl
;
13828 DECL_INITIAL (no_return_label
) = error_mark_node
;
13829 DECL_SOURCE_FILE (no_return_label
) = input_filename
;
13830 DECL_SOURCE_LINE (no_return_label
) = lineno
;
13831 expand_goto (no_return_label
);
13836 /* Remove the binding contour which is used
13837 to catch cleanup-generated temporaries. */
13838 expand_end_bindings (0, 0, 0);
13839 poplevel (0, 0, 0);
13841 /* Emit label at beginning of cleanup code for parameters. */
13842 emit_label (cleanup_label
);
13845 /* Get return value into register if that's where it's supposed to be. */
13846 if (original_result_rtx
)
13847 fixup_result_decl (DECL_RESULT (fndecl
), original_result_rtx
);
13849 /* Finish building code that will trigger warnings if users forget
13850 to make their functions return values. */
13851 if (no_return_label
|| cleanup_label
)
13852 emit_jump (return_label
);
13853 if (no_return_label
)
13855 /* We don't need to call `expand_*_return' here because we
13856 don't need any cleanups here--this path of code is only
13857 for error checking purposes. */
13858 expand_label (no_return_label
);
13861 /* We hard-wired immediate_size_expand to zero in
13862 start_function. Expand_function_end will decrement this
13863 variable. So, we set the variable to one here, so that after
13864 the decrement it will remain zero. */
13865 immediate_size_expand
= 1;
13867 /* Generate rtl for function exit. */
13868 expand_function_end (input_filename
, lineno
, 1);
13871 /* We have to save this value here in case
13872 maybe_end_member_template_processing decides to pop all the
13873 template parameters. */
13874 expand_p
= !building_stmt_tree ();
13876 /* If we're saving up tree structure, tie off the function now. */
13878 finish_stmt_tree (fndecl
);
13880 /* This must come after expand_function_end because cleanups might
13881 have declarations (from inline functions) that need to go into
13882 this function's blocks. */
13883 if (current_binding_level
->parm_flag
!= 1)
13884 my_friendly_abort (122);
13885 poplevel (1, 0, 1);
13887 /* If this is a in-class inline definition, we may have to pop the
13888 bindings for the template parameters that we added in
13889 maybe_begin_member_template_processing when start_function was
13891 if (inclass_inline
)
13892 maybe_end_member_template_processing ();
13894 /* Reset scope for C++: if we were in the scope of a class,
13895 then when we finish this function, we are not longer so.
13896 This cannot be done until we know for sure that no more
13897 class members will ever be referenced in this function
13898 (i.e., calls to destructors). */
13899 if (current_class_name
)
13901 ctype
= current_class_type
;
13902 pop_nested_class ();
13905 /* Must mark the RESULT_DECL as being in this function. */
13906 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
13908 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
13909 to the FUNCTION_DECL node itself. */
13910 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
13912 /* Undo the call to push_momentary in start_function. */
13917 int saved_flag_keep_inline_functions
=
13918 flag_keep_inline_functions
;
13920 /* So we can tell if jump_optimize sets it to 1. */
13923 if (DECL_CONTEXT (fndecl
) != NULL_TREE
13924 && hack_decl_function_context (fndecl
))
13925 /* Trick rest_of_compilation into not deferring output of this
13926 function, even if it is inline, since the rtl_obstack for
13927 this function is the function_obstack of the enclosing
13928 function and will be deallocated when the enclosing
13929 function is gone. See save_tree_status. */
13930 flag_keep_inline_functions
= 1;
13932 /* Run the optimizers and output the assembler code for this
13935 if (DECL_ARTIFICIAL (fndecl
))
13937 /* Do we really *want* to inline this synthesized method? */
13939 int save_fif
= flag_inline_functions
;
13940 flag_inline_functions
= 1;
13942 /* Turn off DECL_INLINE for the moment so function_cannot_inline_p
13943 will check our size. */
13944 DECL_INLINE (fndecl
) = 0;
13946 rest_of_compilation (fndecl
);
13947 flag_inline_functions
= save_fif
;
13950 rest_of_compilation (fndecl
);
13952 flag_keep_inline_functions
= saved_flag_keep_inline_functions
;
13954 if (DECL_SAVED_INSNS (fndecl
) && ! TREE_ASM_WRITTEN (fndecl
))
13956 /* Set DECL_EXTERNAL so that assemble_external will be called as
13957 necessary. We'll clear it again in finish_file. */
13958 if (! DECL_EXTERNAL (fndecl
))
13959 DECL_NOT_REALLY_EXTERN (fndecl
) = 1;
13960 DECL_EXTERNAL (fndecl
) = 1;
13961 mark_inline_for_output (fndecl
);
13964 if (ctype
&& TREE_ASM_WRITTEN (fndecl
))
13965 note_debug_info_needed (ctype
);
13967 current_function_returns_null
|= can_reach_end
;
13969 /* Since we don't normally go through c_expand_return for constructors,
13970 this normally gets the wrong value.
13971 Also, named return values have their return codes emitted after
13972 NOTE_INSN_FUNCTION_END, confusing jump.c. */
13973 if (DECL_CONSTRUCTOR_P (fndecl
)
13974 || DECL_NAME (DECL_RESULT (fndecl
)) != NULL_TREE
)
13975 current_function_returns_null
= 0;
13977 if (TREE_THIS_VOLATILE (fndecl
) && current_function_returns_null
)
13978 cp_warning ("`noreturn' function `%D' does return", fndecl
);
13979 else if ((warn_return_type
|| pedantic
)
13980 && current_function_returns_null
13981 && TREE_CODE (TREE_TYPE (fntype
)) != VOID_TYPE
)
13983 /* If this function returns non-void and control can drop through,
13985 cp_warning ("control reaches end of non-void function `%D'", fndecl
);
13987 /* With just -W, complain only if function returns both with
13988 and without a value. */
13989 else if (extra_warnings
13990 && current_function_returns_value
&& current_function_returns_null
)
13991 warning ("this function may return with or without a value");
13996 /* Free all the tree nodes making up this function. */
13997 /* Switch back to allocating nodes permanently
13998 until we start another function. */
14000 permanent_allocation (1);
14002 if (DECL_SAVED_INSNS (fndecl
) == 0)
14006 /* Stop pointing to the local nodes about to be freed. */
14007 /* But DECL_INITIAL must remain nonzero so we know this
14008 was an actual function definition. */
14009 DECL_INITIAL (fndecl
) = error_mark_node
;
14010 for (t
= DECL_ARGUMENTS (fndecl
); t
; t
= TREE_CHAIN (t
))
14011 DECL_RTL (t
) = DECL_INCOMING_RTL (t
) = NULL_RTX
;
14014 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
14015 static_ctors
= perm_tree_cons (NULL_TREE
, fndecl
, static_ctors
);
14016 if (DECL_STATIC_DESTRUCTOR (fndecl
))
14017 static_dtors
= perm_tree_cons (NULL_TREE
, fndecl
, static_dtors
);
14021 /* Let the error reporting routines know that we're outside a
14022 function. For a nested function, this value is used in
14023 pop_cp_function_context and then reset via pop_function_context. */
14024 current_function_decl
= NULL_TREE
;
14027 named_label_uses
= NULL
;
14028 current_class_ptr
= NULL_TREE
;
14029 current_class_ref
= NULL_TREE
;
14032 /* Create the FUNCTION_DECL for a function definition.
14033 DECLSPECS and DECLARATOR are the parts of the declaration;
14034 they describe the return type and the name of the function,
14035 but twisted together in a fashion that parallels the syntax of C.
14037 This function creates a binding context for the function body
14038 as well as setting up the FUNCTION_DECL in current_function_decl.
14040 Returns a FUNCTION_DECL on success.
14042 If the DECLARATOR is not suitable for a function (it defines a datum
14043 instead), we return 0, which tells yyparse to report a parse error.
14045 May return void_type_node indicating that this method is actually
14046 a friend. See grokfield for more details.
14048 Came here with a `.pushlevel' .
14050 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14051 CHANGES TO CODE IN `grokfield'. */
14054 start_method (declspecs
, declarator
, attrlist
)
14055 tree declarator
, declspecs
, attrlist
;
14057 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
14060 /* Something too ugly to handle. */
14061 if (fndecl
== NULL_TREE
)
14064 /* Pass friends other than inline friend functions back. */
14065 if (fndecl
== void_type_node
)
14068 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
14069 /* Not a function, tell parser to report parse error. */
14072 if (DECL_IN_AGGR_P (fndecl
))
14074 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
14076 if (DECL_CONTEXT (fndecl
)
14077 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
14078 cp_error ("`%D' is already defined in class %s", fndecl
,
14079 TYPE_NAME_STRING (DECL_CONTEXT (fndecl
)));
14081 return void_type_node
;
14084 check_template_shadow (fndecl
);
14086 DECL_THIS_INLINE (fndecl
) = 1;
14088 if (flag_default_inline
)
14089 DECL_INLINE (fndecl
) = 1;
14091 /* We process method specializations in finish_struct_1. */
14092 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
14093 fndecl
= push_template_decl (fndecl
);
14095 /* We read in the parameters on the maybepermanent_obstack,
14096 but we won't be getting back to them until after we
14097 may have clobbered them. So the call to preserve_data
14098 will keep them safe. */
14101 if (! DECL_FRIEND_P (fndecl
))
14103 if (TREE_CHAIN (fndecl
))
14105 fndecl
= copy_node (fndecl
);
14106 TREE_CHAIN (fndecl
) = NULL_TREE
;
14109 if (DECL_CONSTRUCTOR_P (fndecl
))
14111 if (! grok_ctor_properties (current_class_type
, fndecl
))
14112 return void_type_node
;
14114 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
14115 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
14118 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0, 0);
14120 /* Make a place for the parms */
14122 current_binding_level
->parm_flag
= 1;
14124 DECL_IN_AGGR_P (fndecl
) = 1;
14128 /* Go through the motions of finishing a function definition.
14129 We don't compile this method until after the whole class has
14132 FINISH_METHOD must return something that looks as though it
14133 came from GROKFIELD (since we are defining a method, after all).
14135 This is called after parsing the body of the function definition.
14136 STMTS is the chain of statements that makes up the function body.
14138 DECL is the ..._DECL that `start_method' provided. */
14141 finish_method (decl
)
14144 register tree fndecl
= decl
;
14147 register tree link
;
14149 if (decl
== void_type_node
)
14152 old_initial
= DECL_INITIAL (fndecl
);
14154 /* Undo the level for the parms (from start_method).
14155 This is like poplevel, but it causes nothing to be
14156 saved. Saving information here confuses symbol-table
14157 output routines. Besides, this information will
14158 be correctly output when this method is actually
14161 /* Clear out the meanings of the local variables of this level;
14162 also record in each decl which block it belongs to. */
14164 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
14166 if (DECL_NAME (link
) != NULL_TREE
)
14167 pop_binding (DECL_NAME (link
), link
);
14168 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
14169 DECL_CONTEXT (link
) = NULL_TREE
;
14172 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
14173 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
14174 current_binding_level
->parm_flag
,
14175 current_binding_level
->keep
);
14177 poplevel (0, 0, 0);
14179 DECL_INITIAL (fndecl
) = old_initial
;
14181 /* We used to check if the context of FNDECL was different from
14182 current_class_type as another way to get inside here. This didn't work
14183 for String.cc in libg++. */
14184 if (DECL_FRIEND_P (fndecl
))
14186 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
14187 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
14188 decl
= void_type_node
;
14194 /* Called when a new struct TYPE is defined.
14195 If this structure or union completes the type of any previous
14196 variable declaration, lay it out and output its rtl. */
14199 hack_incomplete_structures (type
)
14204 if (current_binding_level
->incomplete
== NULL_TREE
)
14207 if (!type
) /* Don't do this for class templates. */
14210 for (list
= ¤t_binding_level
->incomplete
; *list
; )
14212 tree decl
= TREE_VALUE (*list
);
14213 if ((decl
&& TREE_TYPE (decl
) == type
)
14214 || (TREE_TYPE (decl
)
14215 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14216 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
14218 int toplevel
= toplevel_bindings_p ();
14219 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14220 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
14221 layout_type (TREE_TYPE (decl
));
14222 layout_decl (decl
, 0);
14223 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
14227 expand_decl (decl
);
14228 cleanup
= maybe_build_cleanup (decl
);
14229 expand_decl_init (decl
);
14230 if (! expand_decl_cleanup (decl
, cleanup
))
14231 cp_error ("parser lost in parsing declaration of `%D'",
14234 *list
= TREE_CHAIN (*list
);
14237 list
= &TREE_CHAIN (*list
);
14241 /* If DECL is of a type which needs a cleanup, build that cleanup here.
14242 See build_delete for information about AUTO_DELETE.
14244 Don't build these on the momentary obstack; they must live
14245 the life of the binding contour. */
14248 maybe_build_cleanup_1 (decl
, auto_delete
)
14249 tree decl
, auto_delete
;
14251 tree type
= TREE_TYPE (decl
);
14252 if (type
!= error_mark_node
&& TYPE_NEEDS_DESTRUCTOR (type
))
14254 int temp
= 0, flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14257 if (TREE_CODE (decl
) != PARM_DECL
)
14258 temp
= suspend_momentary ();
14260 if (TREE_CODE (type
) == ARRAY_TYPE
)
14264 mark_addressable (decl
);
14265 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14268 /* Optimize for space over speed here. */
14269 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14270 || flag_expensive_optimizations
)
14271 flags
|= LOOKUP_NONVIRTUAL
;
14273 rval
= build_delete (TREE_TYPE (rval
), rval
, auto_delete
, flags
, 0);
14275 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14276 && ! TYPE_HAS_DESTRUCTOR (type
))
14277 rval
= build_compound_expr (expr_tree_cons (NULL_TREE
, rval
,
14278 build_expr_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14280 if (TREE_CODE (decl
) != PARM_DECL
)
14281 resume_momentary (temp
);
14288 /* If DECL is of a type which needs a cleanup, build that cleanup
14289 here. The cleanup does free the storage with a call to delete. */
14292 maybe_build_cleanup_and_delete (decl
)
14295 return maybe_build_cleanup_1 (decl
, integer_three_node
);
14298 /* If DECL is of a type which needs a cleanup, build that cleanup
14299 here. The cleanup does not free the storage with a call a delete. */
14302 maybe_build_cleanup (decl
)
14305 return maybe_build_cleanup_1 (decl
, integer_two_node
);
14308 /* Expand a C++ expression at the statement level.
14309 This is needed to ferret out nodes which have UNKNOWN_TYPE.
14310 The C++ type checker should get all of these out when
14311 expressions are combined with other, type-providing, expressions,
14312 leaving only orphan expressions, such as:
14314 &class::bar; / / takes its address, but does nothing with it. */
14317 cplus_expand_expr_stmt (exp
)
14320 exp
= require_complete_type_in_void (exp
);
14322 if (TREE_CODE (exp
) == FUNCTION_DECL
)
14324 cp_warning ("reference, not call, to function `%D'", exp
);
14325 warning ("at this point in file");
14329 /* We should do this eventually, but right now this causes regex.o from
14330 libg++ to miscompile, and tString to core dump. */
14331 exp
= build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (exp
), exp
);
14334 /* Strip unused implicit INDIRECT_REFs of references. */
14335 if (TREE_CODE (exp
) == INDIRECT_REF
14336 && TREE_CODE (TREE_TYPE (TREE_OPERAND (exp
, 0))) == REFERENCE_TYPE
)
14337 exp
= TREE_OPERAND (exp
, 0);
14339 /* If we don't do this, we end up down inside expand_expr
14340 trying to do TYPE_MODE on the ERROR_MARK, and really
14341 go outside the bounds of the type. */
14342 if (exp
!= error_mark_node
)
14343 expand_expr_stmt (break_out_cleanups (exp
));
14346 /* When a stmt has been parsed, this function is called. */
14351 if (!current_function_assigns_this
14352 && current_function_just_assigned_this
)
14354 if (DECL_CONSTRUCTOR_P (current_function_decl
))
14356 /* Constructors must wait until we are out of control
14357 zones before calling base constructors. */
14358 if (in_control_zone_p ())
14360 expand_expr_stmt (base_init_expr
);
14361 check_base_init (current_class_type
);
14363 current_function_assigns_this
= 1;
14366 /* Always assume this statement was not an expression statement. If
14367 it actually was an expression statement, its our callers
14368 responsibility to fix this up. */
14369 last_expr_type
= NULL_TREE
;
14372 /* Change a static member function definition into a FUNCTION_TYPE, instead
14373 of the METHOD_TYPE that we create when it's originally parsed.
14375 WARNING: DO NOT pass &TREE_TYPE (decl) to FN or &TYPE_ARG_TYPES
14376 (TREE_TYPE (decl)) to ARGTYPES, as doing so will corrupt the types of
14377 other decls. Either pass the addresses of local variables or NULL. */
14380 revert_static_member_fn (decl
, fn
, argtypes
)
14381 tree
*decl
, *fn
, *argtypes
;
14384 tree function
= fn
? *fn
: TREE_TYPE (*decl
);
14385 tree args
= argtypes
? *argtypes
: TYPE_ARG_TYPES (function
);
14387 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14388 != TYPE_UNQUALIFIED
)
14389 cp_error ("static member function `%#D' declared with type qualifiers",
14392 args
= TREE_CHAIN (args
);
14393 tmp
= build_function_type (TREE_TYPE (function
), args
);
14394 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14395 tmp
= build_exception_variant (tmp
,
14396 TYPE_RAISES_EXCEPTIONS (function
));
14397 TREE_TYPE (*decl
) = tmp
;
14398 if (DECL_ARGUMENTS (*decl
))
14399 DECL_ARGUMENTS (*decl
) = TREE_CHAIN (DECL_ARGUMENTS (*decl
));
14400 DECL_STATIC_FUNCTION_P (*decl
) = 1;
14412 int just_assigned_this
;
14414 int temp_name_counter
;
14416 struct named_label_list
*named_label_uses
;
14419 rtx last_dtor_insn
;
14420 rtx last_parm_cleanup_insn
;
14421 tree base_init_list
;
14422 tree member_init_list
;
14423 tree base_init_expr
;
14424 tree current_class_ptr
;
14425 tree current_class_ref
;
14427 struct cp_function
*next
;
14428 struct binding_level
*binding_level
;
14429 int static_labelno
;
14430 int in_function_try_handler
;
14432 int stmts_are_full_exprs_p
;
14434 tree last_expr_type
;
14437 static struct cp_function
*cp_function_chain
;
14439 extern int temp_name_counter
;
14441 /* Save and reinitialize the variables
14442 used during compilation of a C++ function. */
14445 push_cp_function_context (context
)
14448 struct cp_function
*p
14449 = (struct cp_function
*) xmalloc (sizeof (struct cp_function
));
14451 push_function_context_to (context
);
14453 p
->next
= cp_function_chain
;
14454 cp_function_chain
= p
;
14456 p
->named_labels
= named_labels
;
14457 p
->named_label_uses
= named_label_uses
;
14458 p
->returns_value
= current_function_returns_value
;
14459 p
->returns_null
= current_function_returns_null
;
14460 p
->binding_level
= current_binding_level
;
14461 p
->ctor_label
= ctor_label
;
14462 p
->dtor_label
= dtor_label
;
14463 p
->last_dtor_insn
= last_dtor_insn
;
14464 p
->last_parm_cleanup_insn
= last_parm_cleanup_insn
;
14465 p
->assigns_this
= current_function_assigns_this
;
14466 p
->just_assigned_this
= current_function_just_assigned_this
;
14467 p
->parms_stored
= current_function_parms_stored
;
14468 p
->result_rtx
= original_result_rtx
;
14469 p
->base_init_expr
= base_init_expr
;
14470 p
->temp_name_counter
= temp_name_counter
;
14471 p
->base_init_list
= current_base_init_list
;
14472 p
->member_init_list
= current_member_init_list
;
14473 p
->current_class_ptr
= current_class_ptr
;
14474 p
->current_class_ref
= current_class_ref
;
14475 p
->static_labelno
= static_labelno
;
14476 p
->in_function_try_handler
= in_function_try_handler
;
14477 p
->last_tree
= last_tree
;
14478 p
->last_expr_type
= last_expr_type
;
14479 p
->expanding_p
= expanding_p
;
14480 p
->stmts_are_full_exprs_p
= stmts_are_full_exprs_p
;
14482 /* For now, we always assume we're expanding all the way to RTL
14483 unless we're explicitly doing otherwise. */
14486 /* Whenever we start a new function, we destroy temporaries in the
14488 stmts_are_full_exprs_p
= 1;
14491 /* Restore the variables used during compilation of a C++ function. */
14494 pop_cp_function_context (context
)
14497 struct cp_function
*p
= cp_function_chain
;
14499 pop_function_context_from (context
);
14501 cp_function_chain
= p
->next
;
14503 named_labels
= p
->named_labels
;
14504 named_label_uses
= p
->named_label_uses
;
14505 current_function_returns_value
= p
->returns_value
;
14506 current_function_returns_null
= p
->returns_null
;
14507 current_binding_level
= p
->binding_level
;
14508 ctor_label
= p
->ctor_label
;
14509 dtor_label
= p
->dtor_label
;
14510 last_dtor_insn
= p
->last_dtor_insn
;
14511 last_parm_cleanup_insn
= p
->last_parm_cleanup_insn
;
14512 current_function_assigns_this
= p
->assigns_this
;
14513 current_function_just_assigned_this
= p
->just_assigned_this
;
14514 current_function_parms_stored
= p
->parms_stored
;
14515 original_result_rtx
= p
->result_rtx
;
14516 base_init_expr
= p
->base_init_expr
;
14517 temp_name_counter
= p
->temp_name_counter
;
14518 current_base_init_list
= p
->base_init_list
;
14519 current_member_init_list
= p
->member_init_list
;
14520 current_class_ptr
= p
->current_class_ptr
;
14521 current_class_ref
= p
->current_class_ref
;
14522 static_labelno
= p
->static_labelno
;
14523 in_function_try_handler
= p
->in_function_try_handler
;
14524 last_tree
= p
->last_tree
;
14525 last_expr_type
= p
->last_expr_type
;
14526 expanding_p
= p
->expanding_p
;
14527 stmts_are_full_exprs_p
= p
->stmts_are_full_exprs_p
;
14535 return function_depth
!= 0;