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
*));
194 #if defined (DEBUG_CP_BINDING_LEVELS)
195 static void indent
PROTO((void));
198 /* A node which has tree code ERROR_MARK, and whose type is itself.
199 All erroneous expressions are replaced with this node. All functions
200 that accept nodes as arguments should avoid generating error messages
201 if this node is one of the arguments, since it is undesirable to get
202 multiple error messages from one error in the input. */
204 tree error_mark_node
;
206 /* Erroneous argument lists can use this *IFF* they do not modify it. */
207 tree error_mark_list
;
209 /* The following symbols are subsumed in the cp_global_trees array, and
210 listed here individually for documentation purposes.
213 tree wchar_decl_node;
216 tree vtable_entry_type;
217 tree delta_type_node;
220 tree __baselist_desc_type_node;
221 tree __i_desc_type_node, __m_desc_type_node;
222 tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type;
224 tree __t_desc_type_node;
226 tree __tp_desc_type_node;
228 tree __access_mode_type_node;
229 tree __bltn_desc_type_node, __user_desc_type_node, __class_desc_type_node;
230 tree __ptr_desc_type_node, __attr_desc_type_node, __func_desc_type_node;
231 tree __ptmf_desc_type_node, __ptmd_desc_type_node;
233 Not needed yet? May be needed one day?
234 tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type;
235 tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type;
236 tree __ptmf_desc_array_type, __ptmd_desc_array_type;
239 tree class_star_type_node;
240 tree class_type_node, record_type_node, union_type_node, enum_type_node;
241 tree unknown_type_node;
243 Array type `vtable_entry_type[]'
246 tree vtbl_ptr_type_node;
252 A FUNCTION_DECL which can call `abort'. Not necessarily the
253 one that the user will declare, but sufficient to be called
254 by routines that want to abort the program.
258 The FUNCTION_DECL for the default `::operator delete'.
260 tree global_delete_fndecl;
263 tree type_info_type_node, tinfo_fn_id, tinfo_fn_type;
267 tree cp_global_trees
[CPTI_MAX
];
269 /* These can't be part of the above array, since they are declared
270 individually in tree.h, and used by the debug output routines. */
274 tree integer_type_node
;
275 tree unsigned_type_node
;
277 /* These can't be part of the above array, since they are declared
278 individially in tree.h and used by the target routines. */
281 tree va_list_type_node
;
283 /* Indicates that there is a type value in some namespace, although
284 that is not necessarily in scope at the moment. */
286 static tree global_type_node
;
291 /* Expect only namespace names now. */
292 static int only_namespace_names
;
294 /* In a destructor, the point at which all derived class destroying
295 has been done, just before any base class destroying will be done. */
299 /* In a destructor, the last insn emitted after the start of the
300 function and the parms. */
302 static rtx last_dtor_insn
;
304 /* In a constructor, the last insn emitted after the start of the
305 function and the parms, the exception specification and any
306 function-try-block. The constructor initializers are emitted after
309 static rtx last_parm_cleanup_insn
;
311 /* In a constructor, the point at which we are ready to return
312 the pointer to the initialized object. */
316 /* If original DECL_RESULT of current function was a register,
317 but due to being an addressable named return value, would up
318 on the stack, this variable holds the named return value's
319 original location. */
320 static rtx original_result_rtx
;
322 /* Sequence of insns which represents base initialization. */
325 /* C++: Keep these around to reduce calls to `get_identifier'.
326 Identifiers for `this' in member functions and the auto-delete
327 parameter for destructors. */
328 tree this_identifier
, in_charge_identifier
;
329 tree ctor_identifier
, dtor_identifier
;
330 /* Used in pointer to member functions, in vtables, and in sigtables. */
331 tree pfn_identifier
, index_identifier
, delta_identifier
, delta2_identifier
;
332 tree pfn_or_delta2_identifier
, tag_identifier
;
333 tree vt_off_identifier
;
335 /* Exception specifier used for throw(). */
336 tree empty_except_spec
;
338 /* Nonzero if we're in a handler for a function-try-block. */
339 int in_function_try_handler
;
341 struct named_label_list
343 struct binding_level
*binding_level
;
346 const char *filename_o_goto
;
348 struct named_label_list
*next
;
351 /* A list (chain of TREE_LIST nodes) of named label uses.
352 The TREE_PURPOSE field is the list of variables defined
353 in the label's scope defined at the point of use.
354 The TREE_VALUE field is the LABEL_DECL used.
355 The TREE_TYPE field holds `current_binding_level' at the
356 point of the label's use.
358 BWAHAHAAHAHahhahahahaah. No, no, no, said the little chicken.
360 Look at the pretty struct named_label_list. See the pretty struct
361 with the pretty named fields that describe what they do. See the
362 pretty lack of gratuitous casts. Notice the code got a lot cleaner.
364 Used only for jumps to as-yet undefined labels, since
365 jumps to defined labels can have their validity checked
368 static struct named_label_list
*named_label_uses
= NULL
;
370 /* A list of objects which have constructors or destructors
371 which reside in the global scope. The decl is stored in
372 the TREE_VALUE slot and the initializer is stored
373 in the TREE_PURPOSE slot. */
374 tree static_aggregates
;
378 /* Two expressions that are constants with value zero.
379 The first is of type `int', the second of type `void *'. */
381 tree integer_zero_node
;
382 tree null_pointer_node
;
384 /* The value for __null (NULL), namely, a zero of an integer type with
385 the same number of bits as a pointer. */
388 /* A node for the integer constants 1, 2, and 3. */
390 tree integer_one_node
, integer_two_node
, integer_three_node
;
392 /* While defining an enum type, this is 1 plus the last enumerator
395 static tree enum_next_value
;
397 /* Nonzero means that there was overflow computing enum_next_value. */
399 static int enum_overflow
;
401 /* Parsing a function declarator leaves a list of parameter names
402 or a chain or parameter decls here. */
404 tree last_function_parms
;
406 /* Parsing a function declarator leaves here a chain of structure
407 and enum types declared in the parmlist. */
409 static tree last_function_parm_tags
;
411 /* After parsing the declarator that starts a function definition,
412 `start_function' puts here the list of parameter names or chain of decls.
413 `store_parm_decls' finds it here. */
415 static tree current_function_parms
;
417 /* Similar, for last_function_parm_tags. */
418 static tree current_function_parm_tags
;
420 /* A list (chain of TREE_LIST nodes) of all LABEL_DECLs in the function
421 that have names. Here so we can clear out their names' definitions
422 at the end of the function. */
424 static tree named_labels
;
426 /* A list of LABEL_DECLs from outer contexts that are currently shadowed. */
428 static tree shadowed_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 /* For each level (except not the global one),
591 a chain of BLOCK nodes for all the levels
592 that were entered and exited one level down. */
595 /* The BLOCK node for this level, if one has been preallocated.
596 If 0, the BLOCK is allocated (if needed) when the level is popped. */
599 /* The binding level which this one is contained in (inherits from). */
600 struct binding_level
*level_chain
;
602 /* List of decls in `names' that have incomplete
603 structure or union types. */
606 /* List of VAR_DECLS saved from a previous for statement.
607 These would be dead in ANSI-conforming code, but might
608 be referenced in ARM-era code. These are stored in a
609 TREE_LIST; the TREE_VALUE is the actual declaration. */
610 tree dead_vars_from_for
;
612 /* 1 for the level that holds the parameters of a function.
613 2 for the level that holds a class declaration.
614 3 for levels that hold parameter declarations. */
615 unsigned parm_flag
: 4;
617 /* 1 means make a BLOCK for this level regardless of all else.
618 2 for temporary binding contours created by the compiler. */
621 /* Nonzero if this level "doesn't exist" for tags. */
622 unsigned tag_transparent
: 1;
624 /* Nonzero if this level can safely have additional
625 cleanup-needing variables added to it. */
626 unsigned more_cleanups_ok
: 1;
627 unsigned have_cleanups
: 1;
629 /* Nonzero if this level is for storing the decls for template
630 parameters and generic decls; these decls will be discarded and
631 replaced with a TEMPLATE_DECL. */
632 unsigned pseudo_global
: 1;
634 /* This is set for a namespace binding level. */
635 unsigned namespace_p
: 1;
637 /* True if this level is that of a for-statement where we need to
638 worry about ambiguous (ARM or ANSI) scope rules. */
639 unsigned is_for_scope
: 1;
641 /* True if this level corresponds to an EH region, as for a try block. */
642 unsigned eh_region
: 1;
644 /* One bit left for this word. */
646 #if defined(DEBUG_CP_BINDING_LEVELS)
647 /* Binding depth at which this level began. */
648 unsigned binding_depth
;
649 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
652 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
654 /* The binding level currently in effect. */
656 static struct binding_level
*current_binding_level
;
658 /* The binding level of the current class, if any. */
660 static struct binding_level
*class_binding_level
;
662 /* A chain of binding_level structures awaiting reuse. */
664 static struct binding_level
*free_binding_level
;
666 /* The outermost binding level, for names of file scope.
667 This is created when the compiler is started and exists
668 through the entire run. */
670 static struct binding_level
*global_binding_level
;
672 /* Binding level structures are initialized by copying this one. */
674 static struct binding_level clear_binding_level
;
676 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
678 static int keep_next_level_flag
;
680 #if defined(DEBUG_CP_BINDING_LEVELS)
681 static int binding_depth
= 0;
682 static int is_class_level
= 0;
689 for (i
= 0; i
< binding_depth
*2; i
++)
692 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
694 static tree pushdecl_with_scope
PROTO((tree
, struct binding_level
*));
697 push_binding_level (newlevel
, tag_transparent
, keep
)
698 struct binding_level
*newlevel
;
699 int tag_transparent
, keep
;
701 /* Add this level to the front of the chain (stack) of levels that
703 *newlevel
= clear_binding_level
;
704 newlevel
->level_chain
= current_binding_level
;
705 current_binding_level
= newlevel
;
706 newlevel
->tag_transparent
= tag_transparent
;
707 newlevel
->more_cleanups_ok
= 1;
709 /* We are called before expand_start_bindings, but after
710 expand_eh_region_start for a try block; so we check this now,
711 before the EH block is covered up. */
712 newlevel
->eh_region
= is_eh_region ();
714 newlevel
->keep
= keep
;
715 #if defined(DEBUG_CP_BINDING_LEVELS)
716 newlevel
->binding_depth
= binding_depth
;
718 fprintf (stderr
, "push %s level 0x%08x line %d\n",
719 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
722 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
725 /* Find the innermost enclosing class scope, and reset
726 CLASS_BINDING_LEVEL appropriately. */
729 find_class_binding_level ()
731 struct binding_level
*level
= current_binding_level
;
733 while (level
&& level
->parm_flag
!= 2)
734 level
= level
->level_chain
;
735 if (level
&& level
->parm_flag
== 2)
736 class_binding_level
= level
;
738 class_binding_level
= 0;
744 if (global_binding_level
)
746 /* Cannot pop a level, if there are none left to pop. */
747 if (current_binding_level
== global_binding_level
)
748 my_friendly_abort (123);
750 /* Pop the current level, and free the structure for reuse. */
751 #if defined(DEBUG_CP_BINDING_LEVELS)
754 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
755 (is_class_level
) ? "class" : "block",
756 current_binding_level
, lineno
);
757 if (is_class_level
!= (current_binding_level
== class_binding_level
))
760 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
763 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
765 register struct binding_level
*level
= current_binding_level
;
766 current_binding_level
= current_binding_level
->level_chain
;
767 level
->level_chain
= free_binding_level
;
768 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
769 if (level
->binding_depth
!= binding_depth
)
771 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
772 free_binding_level
= level
;
773 find_class_binding_level ();
778 suspend_binding_level ()
780 if (class_binding_level
)
781 current_binding_level
= class_binding_level
;
783 if (global_binding_level
)
785 /* Cannot suspend a level, if there are none left to suspend. */
786 if (current_binding_level
== global_binding_level
)
787 my_friendly_abort (123);
789 /* Suspend the current level. */
790 #if defined(DEBUG_CP_BINDING_LEVELS)
793 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
794 (is_class_level
) ? "class" : "block",
795 current_binding_level
, lineno
);
796 if (is_class_level
!= (current_binding_level
== class_binding_level
))
799 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
802 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
803 current_binding_level
= current_binding_level
->level_chain
;
804 find_class_binding_level ();
808 resume_binding_level (b
)
809 struct binding_level
*b
;
811 /* Resuming binding levels is meant only for namespaces,
812 and those cannot nest into classes. */
813 my_friendly_assert(!class_binding_level
, 386);
814 /* Also, resuming a non-directly nested namespace is a no-no. */
815 my_friendly_assert(b
->level_chain
== current_binding_level
, 386);
816 current_binding_level
= b
;
817 #if defined(DEBUG_CP_BINDING_LEVELS)
818 b
->binding_depth
= binding_depth
;
820 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
821 (is_class_level
) ? "class" : "block", b
, lineno
);
824 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
827 /* Create a new `struct binding_level'. */
830 struct binding_level
*
831 make_binding_level ()
834 return (struct binding_level
*) xmalloc (sizeof (struct binding_level
));
837 /* Nonzero if we are currently in the global binding level. */
842 return current_binding_level
== global_binding_level
;
845 /* Return the innermost binding level that is not for a class scope. */
847 static struct binding_level
*
848 innermost_nonclass_level ()
850 struct binding_level
*b
;
852 b
= current_binding_level
;
853 while (b
->parm_flag
== 2)
859 /* Nonzero if we are currently in a toplevel binding level. This
860 means either the global binding level or a namespace in a toplevel
861 binding level. Since there are no non-toplevel namespace levels,
862 this really means any namespace or pseudo-global level. We also
863 include a class whose context is toplevel. */
866 toplevel_bindings_p ()
868 struct binding_level
*b
= innermost_nonclass_level ();
870 return b
->namespace_p
|| b
->pseudo_global
;
873 /* Nonzero if this is a namespace scope, or if we are defining a class
874 which is itself at namespace scope, or whose enclosing class is
875 such a class, etc. */
878 namespace_bindings_p ()
880 struct binding_level
*b
= innermost_nonclass_level ();
882 return b
->namespace_p
;
885 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
886 unconditionally. Otherwise, use the normal logic to decide whether
887 or not to create a BLOCK. */
890 keep_next_level (keep
)
893 keep_next_level_flag
= keep
;
896 /* Nonzero if the current level needs to have a BLOCK made. */
901 return (current_binding_level
->blocks
!= NULL_TREE
902 || current_binding_level
->keep
903 || current_binding_level
->names
!= NULL_TREE
904 || (current_binding_level
->tags
!= NULL_TREE
905 && !current_binding_level
->tag_transparent
));
908 /* Identify this binding level as a level of parameters. */
911 declare_parm_level ()
913 current_binding_level
->parm_flag
= 1;
917 declare_pseudo_global_level ()
919 current_binding_level
->pseudo_global
= 1;
923 declare_namespace_level ()
925 current_binding_level
->namespace_p
= 1;
929 pseudo_global_level_p ()
931 return current_binding_level
->pseudo_global
;
935 set_class_shadows (shadows
)
938 class_binding_level
->class_shadowed
= shadows
;
941 /* Enter a new binding level.
942 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
943 not for that of tags. */
946 pushlevel (tag_transparent
)
949 register struct binding_level
*newlevel
= NULL_BINDING_LEVEL
;
951 /* If this is the top level of a function,
952 just make sure that NAMED_LABELS is 0.
953 They should have been set to 0 at the end of the previous function. */
955 if (current_binding_level
== global_binding_level
)
956 my_friendly_assert (named_labels
== NULL_TREE
, 134);
958 /* Reuse or create a struct for this binding level. */
960 #if defined(DEBUG_CP_BINDING_LEVELS)
962 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
963 if (free_binding_level
)
964 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
966 newlevel
= free_binding_level
;
967 free_binding_level
= free_binding_level
->level_chain
;
971 newlevel
= make_binding_level ();
974 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
975 GNU_xref_start_scope ((HOST_WIDE_INT
) newlevel
);
976 keep_next_level_flag
= 0;
980 note_level_for_for ()
982 current_binding_level
->is_for_scope
= 1;
986 pushlevel_temporary (tag_transparent
)
989 pushlevel (tag_transparent
);
990 current_binding_level
->keep
= 2;
993 /* Note we don't call push_momentary() here. Otherwise, it would cause
994 cleanups to be allocated on the momentary obstack, and they will be
995 overwritten by the next statement. */
997 expand_start_bindings (0);
1000 /* For a binding between a name and an entity at a block scope,
1001 this is the `struct binding_level' for the block. */
1002 #define BINDING_LEVEL(NODE) \
1003 (((struct tree_binding*)NODE)->scope.level)
1005 /* These are currently unused, but permanent, CPLUS_BINDING nodes.
1006 They are kept here because they are allocated from the permanent
1007 obstack and cannot be easily freed. */
1008 static tree free_binding_nodes
;
1010 /* Make DECL the innermost binding for ID. The LEVEL is the binding
1011 level at which this declaration is being bound. */
1014 push_binding (id
, decl
, level
)
1017 struct binding_level
* level
;
1021 if (!free_binding_nodes
)
1023 /* There are no free nodes, so we must build one here. */
1024 push_permanent_obstack ();
1025 binding
= make_node (CPLUS_BINDING
);
1030 /* There are nodes on the free list. Grab the first one. */
1031 binding
= free_binding_nodes
;
1033 /* And update the free list. */
1034 free_binding_nodes
= TREE_CHAIN (free_binding_nodes
);
1037 /* Now, fill in the binding information. */
1038 BINDING_VALUE (binding
) = decl
;
1039 BINDING_TYPE (binding
) = NULL_TREE
;
1040 BINDING_LEVEL (binding
) = level
;
1041 INHERITED_VALUE_BINDING_P (binding
) = 0;
1042 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
1044 /* And put it on the front of the list of bindings for ID. */
1045 TREE_CHAIN (binding
) = IDENTIFIER_BINDING (id
);
1046 IDENTIFIER_BINDING (id
) = binding
;
1049 /* ID is already bound in the current scope. But, DECL is an
1050 additional binding for ID in the same scope. This is the `struct
1051 stat' hack whereby a non-typedef class-name or enum-name can be
1052 bound at the same level as some other kind of entity. It's the
1053 responsibility of the caller to check that inserting this name is
1054 legal here. Returns nonzero if the new binding was successful. */
1056 add_binding (id
, decl
)
1060 tree binding
= IDENTIFIER_BINDING (id
);
1063 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
1064 /* The new name is the type name. */
1065 BINDING_TYPE (binding
) = decl
;
1066 else if (!BINDING_VALUE (binding
))
1067 /* This situation arises when push_class_level_binding moves an
1068 inherited type-binding out of the way to make room for a new
1070 BINDING_VALUE (binding
) = decl
;
1071 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
1072 && DECL_ARTIFICIAL (BINDING_VALUE (binding
)))
1074 /* The old binding was a type name. It was placed in
1075 BINDING_VALUE because it was thought, at the point it was
1076 declared, to be the only entity with such a name. Move the
1077 type name into the type slot; it is now hidden by the new
1079 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
1080 BINDING_VALUE (binding
) = decl
;
1081 INHERITED_VALUE_BINDING_P (binding
) = 0;
1083 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
1084 && TREE_CODE (decl
) == TYPE_DECL
1085 && DECL_NAME (decl
) == DECL_NAME (BINDING_VALUE (binding
))
1086 && same_type_p (TREE_TYPE (decl
),
1087 TREE_TYPE (BINDING_VALUE (binding
))))
1088 /* We have two typedef-names, both naming the same type to have
1089 the same name. This is OK because of:
1093 In a given scope, a typedef specifier can be used to redefine
1094 the name of any type declared in that scope to refer to the
1095 type to which it already refers. */
1099 cp_error ("declaration of `%#D'", decl
);
1100 cp_error_at ("conflicts with previous declaration `%#D'",
1101 BINDING_VALUE (binding
));
1108 /* Add DECL to the list of things declared in B. */
1111 add_decl_to_level (decl
, b
)
1113 struct binding_level
*b
;
1115 /* Only things that will live forever should go in the global
1117 my_friendly_assert (!(b
== global_binding_level
1118 && !TREE_PERMANENT (decl
)),
1121 /* We build up the list in reverse order, and reverse it later if
1123 TREE_CHAIN (decl
) = b
->names
;
1127 /* Bind DECL to ID in the current_binding_level, assumed to be a local
1128 binding level. If PUSH_USING is set in FLAGS, we know that DECL
1129 doesn't really belong to this binding level, that it got here
1130 through a using-declaration. */
1133 push_local_binding (id
, decl
, flags
)
1138 struct binding_level
*b
;
1140 /* Skip over any local classes. This makes sense if we call
1141 push_local_binding with a friend decl of a local class. */
1142 b
= current_binding_level
;
1143 while (b
->parm_flag
== 2)
1146 if (lookup_name_current_level (id
))
1148 /* Supplement the existing binding. */
1149 if (!add_binding (id
, decl
))
1150 /* It didn't work. Something else must be bound at this
1151 level. Do not add DECL to the list of things to pop
1156 /* Create a new binding. */
1157 push_binding (id
, decl
, b
);
1159 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
1160 /* We must put the OVERLOAD into a TREE_LIST since the
1161 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1162 decls that got here through a using-declaration. */
1163 decl
= build_tree_list (NULL_TREE
, decl
);
1165 /* And put DECL on the list of things declared by the current
1167 add_decl_to_level (decl
, b
);
1170 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
1171 binding was successful. */
1174 push_class_binding (id
, decl
)
1179 tree binding
= IDENTIFIER_BINDING (id
);
1182 /* Note that we declared this value so that we can issue an error if
1183 this an illegal redeclaration of a name already used for some
1185 note_name_declared_in_class (id
, decl
);
1187 if (binding
&& BINDING_LEVEL (binding
) == class_binding_level
)
1188 /* Supplement the existing binding. */
1189 result
= add_binding (id
, decl
);
1191 /* Create a new binding. */
1192 push_binding (id
, decl
, class_binding_level
);
1194 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1195 class-level declaration. Note that we do not use DECL here
1196 because of the possibility of the `struct stat' hack; if DECL is
1197 a class-name or enum-name we might prefer a field-name, or some
1199 IDENTIFIER_CLASS_VALUE (id
) = BINDING_VALUE (IDENTIFIER_BINDING (id
));
1201 /* If this is a binding from a base class, mark it as such. */
1202 binding
= IDENTIFIER_BINDING (id
);
1203 if (BINDING_VALUE (binding
) == decl
&& TREE_CODE (decl
) != TREE_LIST
)
1205 /* Any implicit typename must be from a base-class. The
1206 context for an implicit typename declaration is always
1207 the derived class in which the lookup was done, so the checks
1208 based on the context of DECL below will not trigger. */
1209 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl
))
1210 INHERITED_VALUE_BINDING_P (binding
) = 1;
1213 if (TREE_CODE (decl
) == OVERLOAD
)
1214 context
= DECL_REAL_CONTEXT (OVL_CURRENT (decl
));
1217 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd',
1219 context
= DECL_REAL_CONTEXT (decl
);
1222 if (is_properly_derived_from (current_class_type
, context
))
1223 INHERITED_VALUE_BINDING_P (binding
) = 1;
1225 INHERITED_VALUE_BINDING_P (binding
) = 0;
1228 else if (BINDING_VALUE (binding
) == decl
)
1229 /* We only encounter a TREE_LIST when push_class_decls detects an
1230 ambiguity. Such an ambiguity can be overridden by a definition
1232 INHERITED_VALUE_BINDING_P (binding
) = 1;
1237 /* Remove the binding for DECL which should be the innermost binding
1241 pop_binding (id
, decl
)
1247 if (id
== NULL_TREE
)
1248 /* It's easiest to write the loops that call this function without
1249 checking whether or not the entities involved have names. We
1250 get here for such an entity. */
1253 /* Get the innermost binding for ID. */
1254 binding
= IDENTIFIER_BINDING (id
);
1256 /* The name should be bound. */
1257 my_friendly_assert (binding
!= NULL_TREE
, 0);
1259 /* The DECL will be either the ordinary binding or the type
1260 binding for this identifier. Remove that binding. */
1261 if (BINDING_VALUE (binding
) == decl
)
1262 BINDING_VALUE (binding
) = NULL_TREE
;
1263 else if (BINDING_TYPE (binding
) == decl
)
1264 BINDING_TYPE (binding
) = NULL_TREE
;
1266 my_friendly_abort (0);
1268 if (!BINDING_VALUE (binding
) && !BINDING_TYPE (binding
))
1270 /* We're completely done with the innermost binding for this
1271 identifier. Unhook it from the list of bindings. */
1272 IDENTIFIER_BINDING (id
) = TREE_CHAIN (binding
);
1274 /* And place it on the free list. */
1275 TREE_CHAIN (binding
) = free_binding_nodes
;
1276 free_binding_nodes
= binding
;
1280 /* Exit a binding level.
1281 Pop the level off, and restore the state of the identifier-decl mappings
1282 that were in effect when this level was entered.
1284 If KEEP == 1, this level had explicit declarations, so
1285 and create a "block" (a BLOCK node) for the level
1286 to record its declarations and subblocks for symbol table output.
1288 If FUNCTIONBODY is nonzero, this level is the body of a function,
1289 so create a block as if KEEP were set and also clear out all
1292 If REVERSE is nonzero, reverse the order of decls before putting
1293 them into the BLOCK. */
1296 poplevel (keep
, reverse
, functionbody
)
1302 /* The chain of decls was accumulated in reverse order.
1303 Put it into forward order, just for cleanliness. */
1305 int tmp
= functionbody
;
1306 int real_functionbody
= current_binding_level
->keep
== 2
1307 ? ((functionbody
= 0), tmp
) : functionbody
;
1308 tree tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1309 tree subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1310 tree block
= NULL_TREE
;
1312 int block_previously_created
;
1313 int leaving_for_scope
;
1315 if (current_binding_level
->parm_flag
== 2)
1316 return poplevel_class ();
1318 my_friendly_assert (!current_binding_level
->class_shadowed
,
1321 /* We used to use KEEP == 2 to indicate that the new block should go
1322 at the beginning of the list of blocks at this binding level,
1323 rather than the end. This hack is no longer used. */
1324 my_friendly_assert (keep
== 0 || keep
== 1, 0);
1326 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1327 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1328 current_binding_level
->parm_flag
,
1329 current_binding_level
->keep
);
1331 if (current_binding_level
->keep
== 1)
1334 /* Get the decls in the order they were written.
1335 Usually current_binding_level->names is in reverse order.
1336 But parameter decls were previously put in forward order. */
1339 current_binding_level
->names
1340 = decls
= nreverse (current_binding_level
->names
);
1342 decls
= current_binding_level
->names
;
1344 /* Output any nested inline functions within this block
1345 if they weren't already output. */
1347 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1348 if (TREE_CODE (decl
) == FUNCTION_DECL
1349 && ! TREE_ASM_WRITTEN (decl
)
1350 && DECL_INITIAL (decl
) != NULL_TREE
1351 && TREE_ADDRESSABLE (decl
)
1352 && decl_function_context (decl
) == current_function_decl
)
1354 /* If this decl was copied from a file-scope decl
1355 on account of a block-scope extern decl,
1356 propagate TREE_ADDRESSABLE to the file-scope decl. */
1357 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1358 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1361 push_function_context ();
1362 output_inline_function (decl
);
1363 pop_function_context ();
1367 /* If there were any declarations or structure tags in that level,
1368 or if this level is a function body,
1369 create a BLOCK to record them for the life of this function. */
1372 block_previously_created
= (current_binding_level
->this_block
!= NULL_TREE
);
1373 if (block_previously_created
)
1374 block
= current_binding_level
->this_block
;
1375 else if (keep
== 1 || functionbody
)
1376 block
= make_node (BLOCK
);
1377 if (block
!= NULL_TREE
)
1379 if (block_previously_created
)
1381 if (decls
|| tags
|| subblocks
)
1383 if (BLOCK_VARS (block
) || BLOCK_TYPE_TAGS (block
))
1384 warning ("internal compiler error: debugging info corrupted");
1386 BLOCK_VARS (block
) = decls
;
1387 BLOCK_TYPE_TAGS (block
) = tags
;
1389 /* We can have previous subblocks and new subblocks when
1390 doing fixup_gotos with complex cleanups. We chain the new
1391 subblocks onto the end of any pre-existing subblocks. */
1392 BLOCK_SUBBLOCKS (block
) = chainon (BLOCK_SUBBLOCKS (block
),
1395 /* If we created the block earlier on, and we are just
1396 diddling it now, then it already should have a proper
1397 BLOCK_END_NOTE value associated with it. */
1401 BLOCK_VARS (block
) = decls
;
1402 BLOCK_TYPE_TAGS (block
) = tags
;
1403 BLOCK_SUBBLOCKS (block
) = subblocks
;
1404 /* Otherwise, for a new block, install a new BLOCK_END_NOTE
1406 remember_end_note (block
);
1410 /* In each subblock, record that this is its superior. */
1413 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1414 BLOCK_SUPERCONTEXT (link
) = block
;
1416 /* We still support the old for-scope rules, whereby the variables
1417 in a for-init statement were in scope after the for-statement
1418 ended. We only use the new rules in flag_new_for_scope is
1421 = current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1;
1423 /* Remove declarations for all the DECLs in this level. */
1424 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1426 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
)
1429 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link
)));
1433 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
1435 ns_binding
= NULL_TREE
;
1438 && (BINDING_LEVEL (outer_binding
)
1439 == current_binding_level
->level_chain
))
1440 /* We have something like:
1445 and we are leaving the `for' scope. There's no reason to
1446 keep the binding of the inner `i' in this case. */
1447 pop_binding (DECL_NAME (link
), link
);
1448 else if ((outer_binding
1449 && (TREE_CODE (BINDING_VALUE (outer_binding
))
1452 && TREE_CODE (ns_binding
) == TYPE_DECL
))
1453 /* Here, we have something like:
1461 We must pop the for-scope binding so we know what's a
1462 type and what isn't. */
1463 pop_binding (DECL_NAME (link
), link
);
1466 /* Mark this VAR_DECL as dead so that we can tell we left it
1467 there only for backward compatibility. */
1468 DECL_DEAD_FOR_LOCAL (link
) = 1;
1470 /* Keep track of what should of have happenned when we
1471 popped the binding. */
1472 if (outer_binding
&& BINDING_VALUE (outer_binding
))
1473 DECL_SHADOWED_FOR_VAR (link
)
1474 = BINDING_VALUE (outer_binding
);
1476 /* Add it to the list of dead variables in the next
1477 outermost binding to that we can remove these when we
1478 leave that binding. */
1479 current_binding_level
->level_chain
->dead_vars_from_for
1480 = tree_cons (NULL_TREE
, link
,
1481 current_binding_level
->level_chain
->
1482 dead_vars_from_for
);
1484 /* Although we don't pop the CPLUS_BINDING, we do clear
1485 its BINDING_LEVEL since the level is going away now. */
1486 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link
)))
1492 /* Remove the binding. */
1494 if (TREE_CODE (decl
) == TREE_LIST
)
1495 decl
= TREE_VALUE (decl
);
1496 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd')
1497 pop_binding (DECL_NAME (decl
), decl
);
1498 else if (TREE_CODE (decl
) == OVERLOAD
)
1499 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
1501 my_friendly_abort (0);
1505 /* Remove declarations for any `for' variables from inner scopes
1506 that we kept around. */
1507 for (link
= current_binding_level
->dead_vars_from_for
;
1508 link
; link
= TREE_CHAIN (link
))
1509 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
1511 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1512 for (link
= current_binding_level
->type_shadowed
;
1513 link
; link
= TREE_CHAIN (link
))
1514 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1516 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1517 list if a `using' declaration put them there. The debugging
1518 back-ends won't understand OVERLOAD, so we remove them here.
1519 Because the BLOCK_VARS are (temporarily) shared with
1520 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1521 popped all the bindings. */
1526 for (d
= &BLOCK_VARS (block
); *d
; )
1528 if (TREE_CODE (*d
) == TREE_LIST
)
1529 *d
= TREE_CHAIN (*d
);
1531 d
= &TREE_CHAIN (*d
);
1535 /* If the level being exited is the top level of a function,
1536 check over all the labels. */
1540 /* If this is the top level block of a function,
1541 the vars are the function's parameters.
1542 Don't leave them in the BLOCK because they are
1543 found in the FUNCTION_DECL instead. */
1545 BLOCK_VARS (block
) = 0;
1547 /* Clear out the definitions of all label names,
1548 since their scopes end here. */
1550 for (link
= named_labels
; link
; link
= TREE_CHAIN (link
))
1552 register tree label
= TREE_VALUE (link
);
1554 if (DECL_INITIAL (label
) == NULL_TREE
)
1556 cp_error_at ("label `%D' used but not defined", label
);
1557 /* Avoid crashing later. */
1558 define_label (input_filename
, 1, DECL_NAME (label
));
1560 else if (warn_unused
&& !TREE_USED (label
))
1561 cp_warning_at ("label `%D' defined but not used", label
);
1562 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), NULL_TREE
);
1564 /* Put the labels into the "variables" of the
1565 top-level block, so debugger can see them. */
1566 TREE_CHAIN (label
) = BLOCK_VARS (block
);
1567 BLOCK_VARS (block
) = label
;
1570 named_labels
= NULL_TREE
;
1573 /* Any uses of undefined labels now operate under constraints
1574 of next binding contour. */
1576 struct binding_level
*level_chain
;
1577 level_chain
= current_binding_level
->level_chain
;
1580 struct named_label_list
*labels
;
1581 for (labels
= named_label_uses
; labels
; labels
= labels
->next
)
1582 if (labels
->binding_level
== current_binding_level
)
1584 labels
->binding_level
= level_chain
;
1585 labels
->names_in_scope
= level_chain
->names
;
1590 tmp
= current_binding_level
->keep
;
1592 pop_binding_level ();
1594 DECL_INITIAL (current_function_decl
) = block
;
1597 if (!block_previously_created
)
1598 current_binding_level
->blocks
1599 = chainon (current_binding_level
->blocks
, block
);
1601 /* If we did not make a block for the level just exited,
1602 any blocks made for inner levels
1603 (since they cannot be recorded as subblocks in that level)
1604 must be carried forward so they will later become subblocks
1605 of something else. */
1607 current_binding_level
->blocks
1608 = chainon (current_binding_level
->blocks
, subblocks
);
1610 /* Take care of compiler's internal binding structures. */
1613 expand_end_bindings (getdecls (), keep
, 1);
1614 /* Each and every BLOCK node created here in `poplevel' is important
1615 (e.g. for proper debugging information) so if we created one
1616 earlier, mark it as "used". */
1618 TREE_USED (block
) = 1;
1619 block
= poplevel (keep
, reverse
, real_functionbody
);
1622 /* Each and every BLOCK node created here in `poplevel' is important
1623 (e.g. for proper debugging information) so if we created one
1624 earlier, mark it as "used". */
1626 TREE_USED (block
) = 1;
1630 /* Delete the node BLOCK from the current binding level.
1631 This is used for the block inside a stmt expr ({...})
1632 so that the block can be reinserted where appropriate. */
1635 delete_block (block
)
1639 if (current_binding_level
->blocks
== block
)
1640 current_binding_level
->blocks
= TREE_CHAIN (block
);
1641 for (t
= current_binding_level
->blocks
; t
;)
1643 if (TREE_CHAIN (t
) == block
)
1644 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1648 TREE_CHAIN (block
) = NULL_TREE
;
1649 /* Clear TREE_USED which is always set by poplevel.
1650 The flag is set again if insert_block is called. */
1651 TREE_USED (block
) = 0;
1654 /* Insert BLOCK at the end of the list of subblocks of the
1655 current binding level. This is used when a BIND_EXPR is expanded,
1656 to handle the BLOCK node inside the BIND_EXPR. */
1659 insert_block (block
)
1662 TREE_USED (block
) = 1;
1663 current_binding_level
->blocks
1664 = chainon (current_binding_level
->blocks
, block
);
1667 /* Set the BLOCK node for the innermost scope
1668 (the one we are currently in). */
1672 register tree block
;
1674 current_binding_level
->this_block
= block
;
1677 /* Do a pushlevel for class declarations. */
1682 register struct binding_level
*newlevel
;
1684 /* Reuse or create a struct for this binding level. */
1685 #if defined(DEBUG_CP_BINDING_LEVELS)
1687 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1688 if (free_binding_level
)
1689 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1691 newlevel
= free_binding_level
;
1692 free_binding_level
= free_binding_level
->level_chain
;
1695 newlevel
= make_binding_level ();
1697 #if defined(DEBUG_CP_BINDING_LEVELS)
1699 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1701 push_binding_level (newlevel
, 0, 0);
1703 decl_stack
= push_decl_level (decl_stack
, &decl_obstack
);
1704 class_binding_level
= current_binding_level
;
1705 class_binding_level
->parm_flag
= 2;
1708 /* ...and a poplevel for class declarations. */
1713 register struct binding_level
*level
= class_binding_level
;
1716 my_friendly_assert (level
!= 0, 354);
1718 decl_stack
= pop_stack_level (decl_stack
);
1719 /* If we're leaving a toplevel class, don't bother to do the setting
1720 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1721 shouldn't even be used when current_class_type isn't set, and second,
1722 if we don't touch it here, we're able to use the cache effect if the
1723 next time we're entering a class scope, it is the same class. */
1724 if (current_class_depth
!= 1)
1726 struct binding_level
* b
;
1728 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1729 for (shadowed
= level
->class_shadowed
;
1731 shadowed
= TREE_CHAIN (shadowed
))
1732 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = NULL_TREE
;
1734 /* Find the next enclosing class, and recreate
1735 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1736 b
= level
->level_chain
;
1737 while (b
&& b
->parm_flag
!= 2)
1741 for (shadowed
= b
->class_shadowed
;
1743 shadowed
= TREE_CHAIN (shadowed
))
1747 t
= IDENTIFIER_BINDING (TREE_PURPOSE (shadowed
));
1748 while (t
&& BINDING_LEVEL (t
) != b
)
1752 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
))
1753 = BINDING_VALUE (t
);
1757 /* Remember to save what IDENTIFIER's were bound in this scope so we
1758 can recover from cache misses. */
1760 previous_class_type
= current_class_type
;
1761 previous_class_values
= class_binding_level
->class_shadowed
;
1763 for (shadowed
= level
->type_shadowed
;
1765 shadowed
= TREE_CHAIN (shadowed
))
1766 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1768 /* Remove the bindings for all of the class-level declarations. */
1769 for (shadowed
= level
->class_shadowed
;
1771 shadowed
= TREE_CHAIN (shadowed
))
1772 pop_binding (TREE_PURPOSE (shadowed
), TREE_TYPE (shadowed
));
1774 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1775 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1776 class_binding_level
->parm_flag
,
1777 class_binding_level
->keep
);
1779 /* Now, pop out of the binding level which we created up in the
1780 `pushlevel_class' routine. */
1781 #if defined(DEBUG_CP_BINDING_LEVELS)
1783 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1785 pop_binding_level ();
1790 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1791 for any names in enclosing classes. */
1794 clear_identifier_class_values ()
1798 if (!class_binding_level
)
1801 for (t
= class_binding_level
->class_shadowed
;
1804 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
1807 /* Returns non-zero if T is a virtual function table. */
1810 vtable_decl_p (t
, data
)
1812 void *data ATTRIBUTE_UNUSED
;
1814 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
1817 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1821 vtype_decl_p (t
, data
)
1823 void *data ATTRIBUTE_UNUSED
;
1825 return (TREE_CODE (t
) == TYPE_DECL
1826 && TREE_TYPE (t
) != error_mark_node
1827 && TYPE_LANG_SPECIFIC (TREE_TYPE (t
))
1828 && CLASSTYPE_VSIZE (TREE_TYPE (t
)));
1831 /* Return the declarations that are members of the namespace NS. */
1834 cp_namespace_decls (ns
)
1837 return NAMESPACE_LEVEL (ns
)->names
;
1840 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1841 itself, calling F for each. The DATA is passed to F as well. */
1844 walk_namespaces_r (namespace, f
, data
)
1846 walk_namespaces_fn f
;
1852 result
|= (*f
) (namespace, data
);
1854 for (current
= cp_namespace_decls (namespace);
1856 current
= TREE_CHAIN (current
))
1858 if (TREE_CODE (current
) != NAMESPACE_DECL
1859 || DECL_NAMESPACE_ALIAS (current
))
1861 if (!DECL_LANG_SPECIFIC (current
))
1864 my_friendly_assert (current
== std_node
, 393);
1868 /* We found a namespace. */
1869 result
|= walk_namespaces_r (current
, f
, data
);
1875 /* Walk all the namespaces, calling F for each. The DATA is passed to
1879 walk_namespaces (f
, data
)
1880 walk_namespaces_fn f
;
1883 return walk_namespaces_r (global_namespace
, f
, data
);
1886 struct walk_globals_data
{
1887 walk_globals_pred p
;
1892 /* Walk the global declarations in NAMESPACE. Whenever one is found
1893 for which P returns non-zero, call F with its address. If any call
1894 to F returns a non-zero value, return a non-zero value. */
1897 walk_globals_r (namespace, data
)
1901 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1902 walk_globals_pred p
= wgd
->p
;
1903 walk_globals_fn f
= wgd
->f
;
1904 void *d
= wgd
->data
;
1908 t
= &NAMESPACE_LEVEL (namespace)->names
;
1915 result
|= (*f
) (t
, d
);
1917 /* If F changed *T, then *T still points at the next item to
1920 t
= &TREE_CHAIN (*t
);
1926 /* Walk the global declarations. Whenever one is found for which P
1927 returns non-zero, call F with its address. If any call to F
1928 returns a non-zero value, return a non-zero value. */
1931 walk_globals (p
, f
, data
)
1932 walk_globals_pred p
;
1936 struct walk_globals_data wgd
;
1941 return walk_namespaces (walk_globals_r
, &wgd
);
1944 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1945 DATA is non-NULL, this is the last time we will call
1946 wrapup_global_declarations for this NAMESPACE. */
1949 wrapup_globals_for_namespace (namespace, data
)
1953 tree globals
= cp_namespace_decls (namespace);
1954 int len
= list_length (globals
);
1955 tree
*vec
= (tree
*) alloca (sizeof (tree
) * len
);
1959 int last_time
= (data
!= 0);
1961 if (last_time
&& namespace == global_namespace
)
1962 /* Let compile_file handle the global namespace. */
1965 /* Process the decls in reverse order--earliest first.
1966 Put them into VEC from back to front, then take out from front. */
1968 for (i
= 0, decl
= globals
; i
< len
; i
++, decl
= TREE_CHAIN (decl
))
1969 vec
[len
- i
- 1] = decl
;
1973 check_global_declarations (vec
, len
);
1977 /* Temporarily mark vtables as external. That prevents
1978 wrapup_global_declarations from writing them out; we must process
1979 them ourselves in finish_vtable_vardecl. */
1980 for (i
= 0; i
< len
; ++i
)
1981 if (vtable_decl_p (vec
[i
], /*data=*/0) && !DECL_EXTERNAL (vec
[i
]))
1983 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 1;
1984 DECL_EXTERNAL (vec
[i
]) = 1;
1987 /* Write out any globals that need to be output. */
1988 result
= wrapup_global_declarations (vec
, len
);
1990 /* Undo the hack to DECL_EXTERNAL above. */
1991 for (i
= 0; i
< len
; ++i
)
1992 if (vtable_decl_p (vec
[i
], /*data=*/0)
1993 && DECL_NOT_REALLY_EXTERN (vec
[i
]))
1995 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 0;
1996 DECL_EXTERNAL (vec
[i
]) = 0;
2003 /* For debugging. */
2004 static int no_print_functions
= 0;
2005 static int no_print_builtins
= 0;
2008 print_binding_level (lvl
)
2009 struct binding_level
*lvl
;
2013 fprintf (stderr
, " blocks=");
2014 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
2015 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
2016 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
2017 if (lvl
->tag_transparent
)
2018 fprintf (stderr
, " tag-transparent");
2019 if (lvl
->more_cleanups_ok
)
2020 fprintf (stderr
, " more-cleanups-ok");
2021 if (lvl
->have_cleanups
)
2022 fprintf (stderr
, " have-cleanups");
2023 fprintf (stderr
, "\n");
2026 fprintf (stderr
, " names:\t");
2027 /* We can probably fit 3 names to a line? */
2028 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
2030 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
2032 if (no_print_builtins
2033 && (TREE_CODE (t
) == TYPE_DECL
)
2034 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
2037 /* Function decls tend to have longer names. */
2038 if (TREE_CODE (t
) == FUNCTION_DECL
)
2045 fprintf (stderr
, "\n\t");
2048 print_node_brief (stderr
, "", t
, 0);
2049 if (t
== error_mark_node
)
2053 fprintf (stderr
, "\n");
2057 fprintf (stderr
, " tags:\t");
2059 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
2061 if (TREE_PURPOSE (t
) == NULL_TREE
)
2063 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2070 fprintf (stderr
, "\n\t");
2073 if (TREE_PURPOSE (t
) == NULL_TREE
)
2075 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
2076 fprintf (stderr
, ">");
2078 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2079 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2082 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
2083 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2084 fprintf (stderr
, ">");
2088 fprintf (stderr
, "\n");
2090 if (lvl
->class_shadowed
)
2092 fprintf (stderr
, " class-shadowed:");
2093 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
2095 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2097 fprintf (stderr
, "\n");
2099 if (lvl
->type_shadowed
)
2101 fprintf (stderr
, " type-shadowed:");
2102 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2104 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2106 fprintf (stderr
, "\n");
2111 print_other_binding_stack (stack
)
2112 struct binding_level
*stack
;
2114 struct binding_level
*level
;
2115 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
2117 fprintf (stderr
, "binding level ");
2118 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
2119 fprintf (stderr
, "\n");
2120 print_binding_level (level
);
2125 print_binding_stack ()
2127 struct binding_level
*b
;
2128 fprintf (stderr
, "current_binding_level=");
2129 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
2130 fprintf (stderr
, "\nclass_binding_level=");
2131 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
2132 fprintf (stderr
, "\nglobal_binding_level=");
2133 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
2134 fprintf (stderr
, "\n");
2135 if (class_binding_level
)
2137 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
2138 if (b
== current_binding_level
)
2141 b
= class_binding_level
;
2143 b
= current_binding_level
;
2146 b
= current_binding_level
;
2147 print_other_binding_stack (b
);
2148 fprintf (stderr
, "global:\n");
2149 print_binding_level (global_binding_level
);
2152 /* Namespace binding access routines: The namespace_bindings field of
2153 the identifier is polymorphic, with three possible values:
2154 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2155 indicating the BINDING_VALUE of global_namespace. */
2157 /* Check whether the a binding for the name to scope is known.
2158 Assumes that the bindings of the name are already a list
2159 of bindings. Returns the binding found, or NULL_TREE. */
2162 find_binding (name
, scope
)
2166 tree iter
, prev
= NULL_TREE
;
2168 scope
= ORIGINAL_NAMESPACE (scope
);
2170 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
2171 iter
= TREE_CHAIN (iter
))
2173 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
2174 if (BINDING_SCOPE (iter
) == scope
)
2176 /* Move binding found to the front of the list, so
2177 subsequent lookups will find it faster. */
2180 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
2181 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
2182 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
2191 /* Always returns a binding for name in scope. If the
2192 namespace_bindings is not a list, convert it to one first.
2193 If no binding is found, make a new one. */
2196 binding_for_name (name
, scope
)
2200 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2203 scope
= ORIGINAL_NAMESPACE (scope
);
2205 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
2207 /* Get rid of optimization for global scope. */
2208 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
2209 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
2210 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2212 if (b
&& (result
= find_binding (name
, scope
)))
2214 /* Not found, make a new permanent one. */
2215 push_obstacks (&permanent_obstack
, &permanent_obstack
);
2216 result
= make_node (CPLUS_BINDING
);
2217 TREE_CHAIN (result
) = b
;
2218 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2219 BINDING_SCOPE (result
) = scope
;
2220 BINDING_TYPE (result
) = NULL_TREE
;
2221 BINDING_VALUE (result
) = NULL_TREE
;
2226 /* Return the binding value for name in scope, considering that
2227 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2230 namespace_binding (name
, scope
)
2234 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2237 if (scope
== NULL_TREE
)
2238 scope
= global_namespace
;
2239 if (TREE_CODE (b
) != CPLUS_BINDING
)
2240 return (scope
== global_namespace
) ? b
: NULL_TREE
;
2241 name
= find_binding (name
,scope
);
2242 if (name
== NULL_TREE
)
2244 return BINDING_VALUE (name
);
2247 /* Set the binding value for name in scope. If modifying the binding
2248 of global_namespace is attempted, try to optimize it. */
2251 set_namespace_binding (name
, scope
, val
)
2258 if (scope
== NULL_TREE
)
2259 scope
= global_namespace
;
2261 if (scope
== global_namespace
)
2263 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2264 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
2266 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
2270 b
= binding_for_name (name
, scope
);
2271 BINDING_VALUE (b
) = val
;
2274 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2275 select a name that is unique to this compilation unit. */
2278 push_namespace (name
)
2283 int implicit_use
= 0;
2285 if (!global_namespace
)
2287 /* This must be ::. */
2288 my_friendly_assert (name
== get_identifier ("::"), 377);
2293 /* The name of anonymous namespace is unique for the translation
2295 if (!anonymous_namespace_name
)
2296 anonymous_namespace_name
= get_file_function_name ('N');
2297 name
= anonymous_namespace_name
;
2298 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2300 /* Reopening anonymous namespace. */
2304 else if (current_namespace
== global_namespace
2305 && name
== DECL_NAME (std_node
))
2312 /* Check whether this is an extended namespace definition. */
2313 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2314 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
2317 if (DECL_NAMESPACE_ALIAS (d
))
2319 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2320 d
, DECL_NAMESPACE_ALIAS (d
));
2321 d
= DECL_NAMESPACE_ALIAS (d
);
2328 /* Make a new namespace, binding the name to it. */
2329 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
2330 /* The global namespace is not pushed, and the global binding
2331 level is set elsewhere. */
2336 declare_namespace_level ();
2337 NAMESPACE_LEVEL (d
) = current_binding_level
;
2341 resume_binding_level (NAMESPACE_LEVEL (d
));
2344 do_using_directive (d
);
2345 /* Enter the name space. */
2346 current_namespace
= d
;
2349 /* Pop from the scope of the current namespace. */
2354 if (current_namespace
== global_namespace
)
2356 my_friendly_assert (in_std
>0, 980421);
2360 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
2361 /* The binding level is not popped, as it might be re-opened later. */
2362 suspend_binding_level ();
2365 /* Push into the scope of the namespace NS, even if it is deeply
2366 nested within another namespace. */
2369 push_nested_namespace (ns
)
2372 if (ns
== global_namespace
)
2373 push_to_top_level ();
2376 push_nested_namespace (CP_DECL_CONTEXT (ns
));
2377 push_namespace (DECL_NAME (ns
));
2381 /* Pop back from the scope of the namespace NS, which was previously
2382 entered with push_nested_namespace. */
2385 pop_nested_namespace (ns
)
2388 while (ns
!= global_namespace
)
2391 ns
= CP_DECL_CONTEXT (ns
);
2394 pop_from_top_level ();
2398 /* Subroutines for reverting temporarily to top-level for instantiation
2399 of templates and such. We actually need to clear out the class- and
2400 local-value slots of all identifiers, so that only the global values
2401 are at all visible. Simply setting current_binding_level to the global
2402 scope isn't enough, because more binding levels may be pushed. */
2403 struct saved_scope
{
2404 struct binding_level
*old_binding_level
;
2407 struct saved_scope
*prev
;
2408 tree class_name
, class_type
;
2409 tree access_specifier
;
2411 struct binding_level
*class_bindings
;
2412 tree
*lang_base
, *lang_stack
, lang_name
;
2414 tree last_function_parms
;
2415 tree template_parms
;
2416 HOST_WIDE_INT processing_template_decl
;
2417 tree previous_class_type
, previous_class_values
;
2418 int processing_specialization
;
2419 int processing_explicit_instantiation
;
2420 char *class_cache_firstobj
;
2422 static struct saved_scope
*current_saved_scope
;
2424 /* A chain of the binding vecs created by store_bindings. We create a
2425 whole bunch of these during compilation, on permanent_obstack, so we
2426 can't just throw them away. */
2427 static tree free_binding_vecs
;
2430 store_bindings (names
, old_bindings
)
2431 tree names
, old_bindings
;
2434 for (t
= names
; t
; t
= TREE_CHAIN (t
))
2436 tree binding
, t1
, id
;
2438 if (TREE_CODE (t
) == TREE_LIST
)
2439 id
= TREE_PURPOSE (t
);
2444 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2445 we have no IDENTIFIER_BINDING if we have left the class
2446 scope, but cached the class-level declarations. */
2447 || !(IDENTIFIER_BINDING (id
) || IDENTIFIER_CLASS_VALUE (id
)))
2450 for (t1
= old_bindings
; t1
; t1
= TREE_CHAIN (t1
))
2451 if (TREE_VEC_ELT (t1
, 0) == id
)
2454 if (free_binding_vecs
)
2456 binding
= free_binding_vecs
;
2457 free_binding_vecs
= TREE_CHAIN (free_binding_vecs
);
2460 binding
= make_tree_vec (4);
2464 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
2465 TREE_VEC_ELT (binding
, 0) = id
;
2466 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
2467 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_BINDING (id
);
2468 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
2469 IDENTIFIER_BINDING (id
) = NULL_TREE
;
2470 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
2472 TREE_CHAIN (binding
) = old_bindings
;
2473 old_bindings
= binding
;
2477 return old_bindings
;
2481 maybe_push_to_top_level (pseudo
)
2484 extern int current_lang_stacksize
;
2485 struct saved_scope
*s
2486 = (struct saved_scope
*) xmalloc (sizeof (struct saved_scope
));
2487 struct binding_level
*b
= current_binding_level
;
2488 tree old_bindings
= NULL_TREE
;
2490 push_cp_function_context (NULL_TREE
);
2492 if (previous_class_type
)
2493 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
2495 /* Have to include global_binding_level, because class-level decls
2496 aren't listed anywhere useful. */
2497 for (; b
; b
= b
->level_chain
)
2501 /* Template IDs are inserted into the global level. If they were
2502 inserted into namespace level, finish_file wouldn't find them
2503 when doing pending instantiations. Therefore, don't stop at
2504 namespace level, but continue until :: . */
2505 if (b
== global_binding_level
|| (pseudo
&& b
->pseudo_global
))
2508 old_bindings
= store_bindings (b
->names
, old_bindings
);
2509 /* We also need to check class_shadowed to save class-level type
2510 bindings, since pushclass doesn't fill in b->names. */
2511 if (b
->parm_flag
== 2)
2512 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2514 /* Unwind type-value slots back to top level. */
2515 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2516 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2519 s
->old_binding_level
= current_binding_level
;
2520 current_binding_level
= b
;
2522 s
->old_namespace
= current_namespace
;
2523 s
->class_name
= current_class_name
;
2524 s
->class_type
= current_class_type
;
2525 s
->access_specifier
= current_access_specifier
;
2526 s
->function_decl
= current_function_decl
;
2527 s
->class_bindings
= class_binding_level
;
2528 s
->lang_stack
= current_lang_stack
;
2529 s
->lang_base
= current_lang_base
;
2530 s
->lang_stacksize
= current_lang_stacksize
;
2531 s
->lang_name
= current_lang_name
;
2532 s
->last_function_parms
= last_function_parms
;
2533 s
->template_parms
= current_template_parms
;
2534 s
->processing_template_decl
= processing_template_decl
;
2535 s
->previous_class_type
= previous_class_type
;
2536 s
->previous_class_values
= previous_class_values
;
2537 s
->class_cache_firstobj
= class_cache_firstobj
;
2538 s
->processing_specialization
= processing_specialization
;
2539 s
->processing_explicit_instantiation
= processing_explicit_instantiation
;
2541 current_class_name
= current_class_type
= NULL_TREE
;
2542 current_function_decl
= NULL_TREE
;
2543 class_binding_level
= (struct binding_level
*)0;
2544 current_lang_stacksize
= 10;
2545 current_lang_stack
= current_lang_base
2546 = (tree
*) xmalloc (current_lang_stacksize
* sizeof (tree
));
2547 current_lang_name
= lang_name_cplusplus
;
2548 strict_prototype
= strict_prototypes_lang_cplusplus
;
2549 named_labels
= NULL_TREE
;
2550 shadowed_labels
= NULL_TREE
;
2551 previous_class_type
= previous_class_values
= NULL_TREE
;
2552 class_cache_firstobj
= 0;
2553 processing_specialization
= 0;
2554 processing_explicit_instantiation
= 0;
2555 current_template_parms
= NULL_TREE
;
2556 processing_template_decl
= 0;
2557 current_namespace
= global_namespace
;
2559 s
->prev
= current_saved_scope
;
2560 s
->old_bindings
= old_bindings
;
2561 current_saved_scope
= s
;
2563 push_obstacks (&permanent_obstack
, &permanent_obstack
);
2567 push_to_top_level ()
2569 maybe_push_to_top_level (0);
2573 pop_from_top_level ()
2575 extern int current_lang_stacksize
;
2576 struct saved_scope
*s
= current_saved_scope
;
2579 /* Clear out class-level bindings cache. */
2580 if (previous_class_type
)
2581 invalidate_class_lookup_cache ();
2585 current_binding_level
= s
->old_binding_level
;
2586 current_saved_scope
= s
->prev
;
2587 for (t
= s
->old_bindings
; t
; )
2590 tree id
= TREE_VEC_ELT (t
, 0);
2593 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2594 IDENTIFIER_BINDING (id
) = TREE_VEC_ELT (t
, 2);
2595 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2598 TREE_CHAIN (save
) = free_binding_vecs
;
2599 free_binding_vecs
= save
;
2601 current_namespace
= s
->old_namespace
;
2602 current_class_name
= s
->class_name
;
2603 current_class_type
= s
->class_type
;
2604 current_access_specifier
= s
->access_specifier
;
2605 current_function_decl
= s
->function_decl
;
2606 class_binding_level
= s
->class_bindings
;
2607 free (current_lang_base
);
2608 current_lang_base
= s
->lang_base
;
2609 current_lang_stack
= s
->lang_stack
;
2610 current_lang_name
= s
->lang_name
;
2611 current_lang_stacksize
= s
->lang_stacksize
;
2612 if (current_lang_name
== lang_name_cplusplus
)
2613 strict_prototype
= strict_prototypes_lang_cplusplus
;
2614 else if (current_lang_name
== lang_name_c
)
2615 strict_prototype
= strict_prototypes_lang_c
;
2616 last_function_parms
= s
->last_function_parms
;
2617 current_template_parms
= s
->template_parms
;
2618 processing_template_decl
= s
->processing_template_decl
;
2619 previous_class_type
= s
->previous_class_type
;
2620 previous_class_values
= s
->previous_class_values
;
2621 processing_specialization
= s
->processing_specialization
;
2622 processing_explicit_instantiation
= s
->processing_explicit_instantiation
;
2623 class_cache_firstobj
= s
->class_cache_firstobj
;
2627 pop_cp_function_context (NULL_TREE
);
2630 /* Push a definition of struct, union or enum tag "name".
2631 into binding_level "b". "type" should be the type node,
2632 We assume that the tag "name" is not already defined.
2634 Note that the definition may really be just a forward reference.
2635 In that case, the TYPE_SIZE will be a NULL_TREE.
2637 C++ gratuitously puts all these tags in the name space. */
2639 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2640 record the shadowed value for this binding contour. TYPE is
2641 the type that ID maps to. */
2644 set_identifier_type_value_with_scope (id
, type
, b
)
2647 struct binding_level
*b
;
2649 if (!b
->namespace_p
)
2651 /* Shadow the marker, not the real thing, so that the marker
2652 gets restored later. */
2653 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2655 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2659 tree binding
= binding_for_name (id
, current_namespace
);
2660 BINDING_TYPE (binding
) = type
;
2661 /* Store marker instead of real type. */
2662 type
= global_type_node
;
2664 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2667 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2670 set_identifier_type_value (id
, type
)
2674 set_identifier_type_value_with_scope (id
, type
, current_binding_level
);
2677 /* Return the type associated with id. */
2680 identifier_type_value (id
)
2683 /* There is no type with that name, anywhere. */
2684 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2686 /* This is not the type marker, but the real thing. */
2687 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2688 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2689 /* Have to search for it. It must be on the global level, now.
2690 Ask lookup_name not to return non-types. */
2691 id
= lookup_name_real (id
, 2, 1, 0);
2693 return TREE_TYPE (id
);
2697 /* Pop off extraneous binding levels left over due to syntax errors.
2699 We don't pop past namespaces, as they might be valid. */
2704 #ifdef DEBUG_CP_BINDING_LEVELS
2705 fprintf (stderr
, "XXX entering pop_everything ()\n");
2707 while (!toplevel_bindings_p ())
2709 if (current_binding_level
->parm_flag
== 2)
2710 pop_nested_class ();
2714 #ifdef DEBUG_CP_BINDING_LEVELS
2715 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2719 /* The type TYPE is being declared. If it is a class template, or a
2720 specialization of a class template, do any processing required and
2721 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2722 being declared a friend. B is the binding level at which this TYPE
2725 Returns the TYPE_DECL for TYPE, which may have been altered by this
2729 maybe_process_template_type_declaration (type
, globalize
, b
)
2732 struct binding_level
* b
;
2734 tree decl
= TYPE_NAME (type
);
2736 if (processing_template_parmlist
)
2737 /* You can't declare a new template type in a template parameter
2738 list. But, you can declare a non-template type:
2740 template <class A*> struct S;
2742 is a forward-declaration of `A'. */
2746 maybe_check_template_type (type
);
2748 my_friendly_assert (IS_AGGR_TYPE (type
)
2749 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2752 if (processing_template_decl
)
2754 /* This may change after the call to
2755 push_template_decl_real, but we want the original value. */
2756 tree name
= DECL_NAME (decl
);
2758 decl
= push_template_decl_real (decl
, globalize
);
2759 /* If the current binding level is the binding level for the
2760 template parameters (see the comment in
2761 begin_template_parm_list) and the enclosing level is a class
2762 scope, and we're not looking at a friend, push the
2763 declaration of the member class into the class scope. In the
2764 friend case, push_template_decl will already have put the
2765 friend into global scope, if appropriate. */
2766 if (TREE_CODE (type
) != ENUMERAL_TYPE
2767 && !globalize
&& b
->pseudo_global
2768 && b
->level_chain
->parm_flag
== 2)
2770 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2771 /* Put this tag on the list of tags for the class, since
2772 that won't happen below because B is not the class
2773 binding level, but is instead the pseudo-global level. */
2774 b
->level_chain
->tags
=
2775 saveable_tree_cons (name
, type
, b
->level_chain
->tags
);
2776 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2777 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2785 /* In C++, you don't have to write `struct S' to refer to `S'; you
2786 can just use `S'. We accomplish this by creating a TYPE_DECL as
2787 if the user had written `typedef struct S S'. Create and return
2788 the TYPE_DECL for TYPE. */
2791 create_implicit_typedef (name
, type
)
2797 decl
= build_decl (TYPE_DECL
, name
, type
);
2798 SET_DECL_ARTIFICIAL (decl
);
2799 /* There are other implicit type declarations, like the one *within*
2800 a class that allows you to write `S::S'. We must distinguish
2802 SET_DECL_IMPLICIT_TYPEDEF_P (decl
);
2803 TYPE_NAME (type
) = decl
;
2808 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2809 Normally put it into the inner-most non-tag-transparent scope,
2810 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2811 The latter is needed for implicit declarations. */
2814 pushtag (name
, type
, globalize
)
2818 register struct binding_level
*b
;
2820 b
= current_binding_level
;
2821 while (b
->tag_transparent
2822 || (globalize
&& b
->parm_flag
== 2))
2825 if (toplevel_bindings_p ())
2826 b
->tags
= perm_tree_cons (name
, type
, b
->tags
);
2828 b
->tags
= saveable_tree_cons (name
, type
, b
->tags
);
2832 /* Do C++ gratuitous typedefing. */
2833 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2835 register tree d
= NULL_TREE
;
2837 tree context
= TYPE_CONTEXT (type
);
2841 tree cs
= current_scope ();
2845 else if (cs
!= NULL_TREE
2846 && TREE_CODE_CLASS (TREE_CODE (cs
)) == 't')
2847 /* When declaring a friend class of a local class, we want
2848 to inject the newly named class into the scope
2849 containing the local class, not the namespace scope. */
2850 context
= hack_decl_function_context (get_type_decl (cs
));
2853 context
= current_namespace
;
2855 if ((b
->pseudo_global
&& b
->level_chain
->parm_flag
== 2)
2856 || b
->parm_flag
== 2)
2859 if (current_lang_name
== lang_name_java
)
2860 TYPE_FOR_JAVA (type
) = 1;
2862 d
= create_implicit_typedef (name
, type
);
2863 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2865 set_identifier_type_value_with_scope (name
, type
, b
);
2867 d
= maybe_process_template_type_declaration (type
,
2870 if (b
->parm_flag
== 2)
2872 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2873 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2874 class. But if it's a member template class, we
2875 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2877 finish_member_declaration (d
);
2879 pushdecl_class_level (d
);
2882 d
= pushdecl_with_scope (d
, b
);
2884 if (ANON_AGGRNAME_P (name
))
2885 DECL_IGNORED_P (d
) = 1;
2887 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2888 DECL_ASSEMBLER_NAME (d
) = DECL_NAME (d
);
2889 if (!uses_template_parms (type
))
2890 DECL_ASSEMBLER_NAME (d
)
2891 = get_identifier (build_overload_name (type
, 1, 1));
2893 if (b
->parm_flag
== 2)
2895 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2896 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2900 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2901 /* Use the canonical TYPE_DECL for this node. */
2902 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2905 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2906 will be the tagged type we just added to the current
2907 binding level. This fake NULL-named TYPE_DECL node helps
2908 dwarfout.c to know when it needs to output a
2909 representation of a tagged type, and it also gives us a
2910 convenient place to record the "scope start" address for
2913 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2914 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2918 /* Counter used to create anonymous type names. */
2920 static int anon_cnt
= 0;
2922 /* Return an IDENTIFIER which can be used as a name for
2923 anonymous structs and unions. */
2930 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2931 return get_identifier (buf
);
2934 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2935 This keeps dbxout from getting confused. */
2940 register struct binding_level
*b
;
2942 static int last_cnt
= 0;
2944 /* Fast out if no new anon names were declared. */
2945 if (last_cnt
== anon_cnt
)
2948 b
= current_binding_level
;
2949 while (b
->tag_transparent
)
2954 /* A NULL purpose means we have already processed all tags
2955 from here to the end of the list. */
2956 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2958 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2959 TREE_PURPOSE (tags
) = NULL_TREE
;
2960 tags
= TREE_CHAIN (tags
);
2962 last_cnt
= anon_cnt
;
2965 /* Subroutine of duplicate_decls: return truthvalue of whether
2966 or not types of these decls match.
2968 For C++, we must compare the parameter list so that `int' can match
2969 `int&' in a parameter position, but `int&' is not confused with
2973 decls_match (newdecl
, olddecl
)
2974 tree newdecl
, olddecl
;
2978 if (newdecl
== olddecl
)
2981 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
2982 /* If the two DECLs are not even the same kind of thing, we're not
2983 interested in their types. */
2986 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2988 tree f1
= TREE_TYPE (newdecl
);
2989 tree f2
= TREE_TYPE (olddecl
);
2990 tree p1
= TYPE_ARG_TYPES (f1
);
2991 tree p2
= TYPE_ARG_TYPES (f2
);
2993 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
)
2994 && ! (DECL_LANGUAGE (newdecl
) == lang_c
2995 && DECL_LANGUAGE (olddecl
) == lang_c
))
2998 /* When we parse a static member function definition,
2999 we put together a FUNCTION_DECL which thinks its type
3000 is METHOD_TYPE. Change that to FUNCTION_TYPE, and
3002 if (TREE_CODE (f1
) == METHOD_TYPE
&& DECL_STATIC_FUNCTION_P (olddecl
))
3003 revert_static_member_fn (&newdecl
, &f1
, &p1
);
3004 else if (TREE_CODE (f2
) == METHOD_TYPE
3005 && DECL_STATIC_FUNCTION_P (newdecl
))
3006 revert_static_member_fn (&olddecl
, &f2
, &p2
);
3008 /* Here we must take care of the case where new default
3009 parameters are specified. Also, warn if an old
3010 declaration becomes ambiguous because default
3011 parameters may cause the two to be ambiguous. */
3012 if (TREE_CODE (f1
) != TREE_CODE (f2
))
3014 if (TREE_CODE (f1
) == OFFSET_TYPE
)
3015 cp_compiler_error ("`%D' redeclared as member function", newdecl
);
3017 cp_compiler_error ("`%D' redeclared as non-member function", newdecl
);
3021 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
3023 if (! strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
) == lang_c
3026 types_match
= self_promoting_args_p (p1
);
3027 if (p1
== void_list_node
)
3028 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
3030 else if (!strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
)==lang_c
3031 && DECL_LANGUAGE (newdecl
) == lang_c
&& p1
== NULL_TREE
)
3033 types_match
= self_promoting_args_p (p2
);
3034 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
3037 types_match
= compparms (p1
, p2
);
3042 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3044 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3045 DECL_TEMPLATE_PARMS (olddecl
)))
3048 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3051 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
3052 DECL_TEMPLATE_RESULT (newdecl
));
3056 if (TREE_TYPE (newdecl
) == error_mark_node
)
3057 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
3058 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
3059 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
3060 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
3063 types_match
= comptypes (TREE_TYPE (newdecl
),
3064 TREE_TYPE (olddecl
),
3065 COMPARE_REDECLARATION
);
3071 /* If NEWDECL is `static' and an `extern' was seen previously,
3072 warn about it. (OLDDECL may be NULL_TREE; NAME contains
3073 information about previous usage as an `extern'.)
3075 Note that this does not apply to the C++ case of declaring
3076 a variable `extern const' and then later `const'.
3078 Don't complain about built-in functions, since they are beyond
3079 the user's control. */
3082 warn_extern_redeclared_static (newdecl
, olddecl
)
3083 tree newdecl
, olddecl
;
3087 static const char *explicit_extern_static_warning
3088 = "`%D' was declared `extern' and later `static'";
3089 static const char *implicit_extern_static_warning
3090 = "`%D' was declared implicitly `extern' and later `static'";
3092 if (TREE_CODE (newdecl
) == TYPE_DECL
)
3095 name
= DECL_ASSEMBLER_NAME (newdecl
);
3096 if (TREE_PUBLIC (name
) && DECL_THIS_STATIC (newdecl
))
3098 /* It's okay to redeclare an ANSI built-in function as static,
3099 or to declare a non-ANSI built-in function as anything. */
3100 if (! (TREE_CODE (newdecl
) == FUNCTION_DECL
3101 && olddecl
!= NULL_TREE
3102 && TREE_CODE (olddecl
) == FUNCTION_DECL
3103 && DECL_ARTIFICIAL (olddecl
)))
3105 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
3106 ? implicit_extern_static_warning
3107 : explicit_extern_static_warning
, newdecl
);
3108 if (olddecl
!= NULL_TREE
)
3109 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
3114 /* Handle when a new declaration NEWDECL has the same name as an old
3115 one OLDDECL in the same binding contour. Prints an error message
3118 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
3119 Otherwise, return 0. */
3122 duplicate_decls (newdecl
, olddecl
)
3123 tree newdecl
, olddecl
;
3125 extern struct obstack permanent_obstack
;
3126 unsigned olddecl_uid
= DECL_UID (olddecl
);
3127 int olddecl_friend
= 0, types_match
= 0;
3128 int new_defines_function
= 0;
3130 if (newdecl
== olddecl
)
3133 types_match
= decls_match (newdecl
, olddecl
);
3135 /* If either the type of the new decl or the type of the old decl is an
3136 error_mark_node, then that implies that we have already issued an
3137 error (earlier) for some bogus type specification, and in that case,
3138 it is rather pointless to harass the user with yet more error message
3139 about the same declaration, so just pretend the types match here. */
3140 if (TREE_TYPE (newdecl
) == error_mark_node
3141 || TREE_TYPE (olddecl
) == error_mark_node
)
3144 /* Check for redeclaration and other discrepancies. */
3145 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3146 && DECL_ARTIFICIAL (olddecl
))
3148 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
3150 /* If you declare a built-in or predefined function name as static,
3151 the old definition is overridden, but optionally warn this was a
3152 bad choice of name. */
3153 if (! TREE_PUBLIC (newdecl
))
3156 cp_warning ("shadowing %s function `%#D'",
3157 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3159 /* Discard the old built-in function. */
3162 /* If the built-in is not ansi, then programs can override
3163 it even globally without an error. */
3164 else if (! DECL_BUILT_IN (olddecl
))
3165 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
3169 cp_error ("declaration of `%#D'", newdecl
);
3170 cp_error ("conflicts with built-in declaration `%#D'",
3175 else if (!types_match
)
3177 if ((DECL_LANGUAGE (newdecl
) == lang_c
3178 && DECL_LANGUAGE (olddecl
) == lang_c
)
3179 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3180 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3182 /* A near match; override the builtin. */
3184 if (TREE_PUBLIC (newdecl
))
3186 cp_warning ("new declaration `%#D'", newdecl
);
3187 cp_warning ("ambiguates built-in declaration `%#D'",
3190 else if (warn_shadow
)
3191 cp_warning ("shadowing %s function `%#D'",
3192 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3196 /* Discard the old built-in function. */
3200 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3202 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3203 && TREE_CODE (newdecl
) != TYPE_DECL
3204 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3205 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3206 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3207 && TREE_CODE (olddecl
) != TYPE_DECL
3208 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3209 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3212 /* We do nothing special here, because C++ does such nasty
3213 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3214 get shadowed, and know that if we need to find a TYPE_DECL
3215 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3216 slot of the identifier. */
3220 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3221 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3222 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3223 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3226 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
3227 if (TREE_CODE (olddecl
) == TREE_LIST
)
3228 olddecl
= TREE_VALUE (olddecl
);
3229 cp_error_at ("previous declaration of `%#D'", olddecl
);
3231 /* New decl is completely inconsistent with the old one =>
3232 tell caller to replace the old one. */
3236 else if (!types_match
)
3238 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
))
3239 /* These are certainly not duplicate declarations; they're
3240 from different scopes. */
3243 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3245 /* The name of a class template may not be declared to refer to
3246 any other template, class, function, object, namespace, value,
3247 or type in the same scope. */
3248 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3249 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3251 cp_error ("declaration of template `%#D'", newdecl
);
3252 cp_error_at ("conflicts with previous declaration `%#D'",
3255 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3256 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3257 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3258 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3259 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3260 DECL_TEMPLATE_PARMS (olddecl
)))
3262 cp_error ("new declaration `%#D'", newdecl
);
3263 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3267 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3269 if (DECL_LANGUAGE (newdecl
) == lang_c
3270 && DECL_LANGUAGE (olddecl
) == lang_c
)
3272 cp_error ("declaration of C function `%#D' conflicts with",
3274 cp_error_at ("previous declaration `%#D' here", olddecl
);
3276 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3277 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3279 cp_error ("new declaration `%#D'", newdecl
);
3280 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3286 /* Already complained about this, so don't do so again. */
3287 else if (current_class_type
== NULL_TREE
3288 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3290 cp_error ("conflicting types for `%#D'", newdecl
);
3291 cp_error_at ("previous declaration as `%#D'", olddecl
);
3294 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3295 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3296 && (!DECL_TEMPLATE_INFO (newdecl
)
3297 || (DECL_TI_TEMPLATE (newdecl
)
3298 != DECL_TI_TEMPLATE (olddecl
))))
3299 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3300 && (!DECL_TEMPLATE_INFO (olddecl
)
3301 || (DECL_TI_TEMPLATE (olddecl
)
3302 != DECL_TI_TEMPLATE (newdecl
))))))
3303 /* It's OK to have a template specialization and a non-template
3304 with the same type, or to have specializations of two
3305 different templates with the same type. Note that if one is a
3306 specialization, and the other is an instantiation of the same
3307 template, that we do not exit at this point. That situation
3308 can occur if we instantiate a template class, and then
3309 specialize one of its methods. This situation is legal, but
3310 the declarations must be merged in the usual way. */
3312 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3313 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3314 && !DECL_USE_TEMPLATE (newdecl
))
3315 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3316 && !DECL_USE_TEMPLATE (olddecl
))))
3317 /* One of the declarations is a template instantiation, and the
3318 other is not a template at all. That's OK. */
3320 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3321 && DECL_NAMESPACE_ALIAS (newdecl
)
3322 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3323 /* Redeclaration of namespace alias, ignore it. */
3327 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3330 cp_error (errmsg
, newdecl
);
3331 if (DECL_NAME (olddecl
) != NULL_TREE
)
3332 cp_error_at ((DECL_INITIAL (olddecl
)
3333 && namespace_bindings_p ())
3334 ? "`%#D' previously defined here"
3335 : "`%#D' previously declared here", olddecl
);
3337 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3338 && DECL_INITIAL (olddecl
) != NULL_TREE
3339 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3340 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3342 /* Prototype decl follows defn w/o prototype. */
3343 cp_warning_at ("prototype for `%#D'", newdecl
);
3344 cp_warning_at ("follows non-prototype definition here", olddecl
);
3346 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3347 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3349 /* extern "C" int foo ();
3350 int foo () { bar (); }
3352 if (current_lang_stack
== current_lang_base
)
3353 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3356 cp_error_at ("previous declaration of `%#D' with %L linkage",
3357 olddecl
, DECL_LANGUAGE (olddecl
));
3358 cp_error ("conflicts with new declaration with %L linkage",
3359 DECL_LANGUAGE (newdecl
));
3363 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3365 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3367 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3368 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3371 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3372 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3374 for (; t1
&& t1
!= void_list_node
;
3375 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3376 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3378 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3383 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3385 cp_pedwarn_at ("after previous specification in `%#D'",
3391 cp_error ("default argument given for parameter %d of `%#D'",
3393 cp_error_at ("after previous specification in `%#D'",
3398 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
3399 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3401 cp_warning ("`%#D' was used before it was declared inline",
3403 cp_warning_at ("previous non-inline declaration here",
3409 /* If new decl is `static' and an `extern' was seen previously,
3411 warn_extern_redeclared_static (newdecl
, olddecl
);
3413 /* We have committed to returning 1 at this point. */
3414 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3416 /* Now that functions must hold information normally held
3417 by field decls, there is extra work to do so that
3418 declaration information does not get destroyed during
3420 if (DECL_VINDEX (olddecl
))
3421 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3422 if (DECL_CONTEXT (olddecl
))
3423 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3424 if (DECL_CLASS_CONTEXT (olddecl
))
3425 DECL_CLASS_CONTEXT (newdecl
) = DECL_CLASS_CONTEXT (olddecl
);
3426 if (DECL_PENDING_INLINE_INFO (newdecl
) == (struct pending_inline
*)0)
3427 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3428 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3429 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3430 DECL_ABSTRACT_VIRTUAL_P (newdecl
) |= DECL_ABSTRACT_VIRTUAL_P (olddecl
);
3431 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3432 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3433 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3435 /* Optionally warn about more than one declaration for the same
3436 name, but don't warn about a function declaration followed by a
3438 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3439 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3440 /* Don't warn about extern decl followed by definition. */
3441 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3442 /* Don't warn about friends, let add_friend take care of it. */
3443 && ! DECL_FRIEND_P (newdecl
))
3445 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3446 cp_warning_at ("previous declaration of `%D'", olddecl
);
3450 /* Deal with C++: must preserve virtual function table size. */
3451 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3453 register tree newtype
= TREE_TYPE (newdecl
);
3454 register tree oldtype
= TREE_TYPE (olddecl
);
3456 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3457 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3459 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3460 CLASSTYPE_FRIEND_CLASSES (newtype
)
3461 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3465 /* Copy all the DECL_... slots specified in the new decl
3466 except for any that we copy here from the old type. */
3467 DECL_MACHINE_ATTRIBUTES (newdecl
)
3468 = merge_machine_decl_attributes (olddecl
, newdecl
);
3470 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3472 if (! duplicate_decls (DECL_TEMPLATE_RESULT (newdecl
),
3473 DECL_TEMPLATE_RESULT (olddecl
)))
3474 cp_error ("invalid redeclaration of %D", newdecl
);
3475 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3476 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3477 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3478 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3485 /* Automatically handles default parameters. */
3486 tree oldtype
= TREE_TYPE (olddecl
);
3489 /* Make sure we put the new type in the same obstack as the old one. */
3491 push_obstacks (TYPE_OBSTACK (oldtype
), TYPE_OBSTACK (oldtype
));
3493 push_permanent_obstack ();
3495 /* Merge the data types specified in the two decls. */
3496 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3498 if (TREE_CODE (newdecl
) == VAR_DECL
)
3499 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3500 /* Do this after calling `common_type' so that default
3501 parameters don't confuse us. */
3502 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3503 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3504 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3506 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3507 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3508 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3509 TYPE_RAISES_EXCEPTIONS (oldtype
));
3511 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3512 && DECL_SOURCE_LINE (olddecl
) != 0
3514 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
3515 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
3517 cp_error ("declaration of `%F' throws different exceptions",
3519 cp_error_at ("to previous declaration `%F'", olddecl
);
3522 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3524 /* Lay the type out, unless already done. */
3525 if (! same_type_p (newtype
, oldtype
)
3526 && TREE_TYPE (newdecl
) != error_mark_node
3527 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3528 layout_type (TREE_TYPE (newdecl
));
3530 if ((TREE_CODE (newdecl
) == VAR_DECL
3531 || TREE_CODE (newdecl
) == PARM_DECL
3532 || TREE_CODE (newdecl
) == RESULT_DECL
3533 || TREE_CODE (newdecl
) == FIELD_DECL
3534 || TREE_CODE (newdecl
) == TYPE_DECL
)
3535 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3536 layout_decl (newdecl
, 0);
3538 /* Merge the type qualifiers. */
3539 if (TREE_READONLY (newdecl
))
3540 TREE_READONLY (olddecl
) = 1;
3541 if (TREE_THIS_VOLATILE (newdecl
))
3542 TREE_THIS_VOLATILE (olddecl
) = 1;
3544 /* Merge the initialization information. */
3545 if (DECL_INITIAL (newdecl
) == NULL_TREE
3546 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3548 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3549 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3550 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3551 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
3552 && DECL_LANG_SPECIFIC (newdecl
)
3553 && DECL_LANG_SPECIFIC (olddecl
))
3554 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3557 /* Merge the section attribute.
3558 We want to issue an error if the sections conflict but that must be
3559 done later in decl_attributes since we are called before attributes
3561 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3562 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3564 /* Keep the old rtl since we can safely use it, unless it's the
3565 call to abort() used for abstract virtuals. */
3566 if ((DECL_LANG_SPECIFIC (olddecl
)
3567 && !DECL_ABSTRACT_VIRTUAL_P (olddecl
))
3568 || DECL_RTL (olddecl
) != DECL_RTL (abort_fndecl
))
3569 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3573 /* If cannot merge, then use the new type and qualifiers,
3574 and don't preserve the old rtl. */
3577 /* Clean out any memory we had of the old declaration. */
3578 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3580 TREE_VALUE (oldstatic
) = error_mark_node
;
3582 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3583 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3584 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3585 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3588 /* Merge the storage class information. */
3589 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3590 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3591 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3592 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3593 if (! DECL_EXTERNAL (olddecl
))
3594 DECL_EXTERNAL (newdecl
) = 0;
3596 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3598 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3599 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3600 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3601 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3602 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3603 /* Don't really know how much of the language-specific
3604 values we should copy from old to new. */
3605 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3606 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3607 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3608 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3609 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3611 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3612 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3613 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3614 DECL_BEFRIENDING_CLASSES (newdecl
)
3615 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3616 DECL_BEFRIENDING_CLASSES (olddecl
));
3619 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3621 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3622 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3624 /* If newdecl is not a specialization, then it is not a
3625 template-related function at all. And that means that we
3626 shoud have exited above, returning 0. */
3627 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3630 if (TREE_USED (olddecl
))
3631 /* From [temp.expl.spec]:
3633 If a template, a member template or the member of a class
3634 template is explicitly specialized then that
3635 specialization shall be declared before the first use of
3636 that specialization that would cause an implicit
3637 instantiation to take place, in every translation unit in
3638 which such a use occurs. */
3639 cp_error ("explicit specialization of %D after first use",
3642 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3644 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3646 /* If either decl says `inline', this fn is inline, unless its
3647 definition was passed already. */
3648 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3649 DECL_INLINE (olddecl
) = 1;
3650 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3654 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3655 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3656 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3658 if (! types_match
|| new_defines_function
)
3660 /* These need to be copied so that the names are available.
3661 Note that if the types do match, we'll preserve inline
3662 info and other bits, but if not, we won't. */
3663 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3664 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3666 if (new_defines_function
)
3667 /* If defining a function declared with other language
3668 linkage, use the previously declared language linkage. */
3669 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3670 else if (types_match
)
3672 /* If redeclaring a builtin function, and not a definition,
3673 it stays built in. */
3674 if (DECL_BUILT_IN (olddecl
))
3676 DECL_BUILT_IN (newdecl
) = 1;
3677 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3678 /* If we're keeping the built-in definition, keep the rtl,
3679 regardless of declaration matches. */
3680 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3683 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3685 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3686 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3687 /* Previously saved insns go together with
3688 the function's previous definition. */
3689 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3690 /* Don't clear out the arguments if we're redefining a function. */
3691 if (DECL_ARGUMENTS (olddecl
))
3692 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3694 if (DECL_LANG_SPECIFIC (olddecl
))
3695 DECL_MAIN_VARIANT (newdecl
) = DECL_MAIN_VARIANT (olddecl
);
3698 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3700 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3703 /* Now preserve various other info from the definition. */
3704 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3705 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3706 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3707 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3709 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3712 struct lang_decl
*ol
= DECL_LANG_SPECIFIC (olddecl
);
3713 struct lang_decl
*nl
= DECL_LANG_SPECIFIC (newdecl
);
3715 function_size
= sizeof (struct tree_decl
);
3717 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3718 (char *) olddecl
+ sizeof (struct tree_common
),
3719 function_size
- sizeof (struct tree_common
));
3721 /* Can we safely free the storage used by newdecl? */
3723 #define ROUND(x) ((x + obstack_alignment_mask (&permanent_obstack)) \
3724 & ~ obstack_alignment_mask (&permanent_obstack))
3726 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3728 /* If newdecl is a template instantiation, it is possible that
3729 the following sequence of events has occurred:
3731 o A friend function was declared in a class template. The
3732 class template was instantiated.
3734 o The instantiation of the friend declaration was
3735 recorded on the instantiation list, and is newdecl.
3737 o Later, however, instantiate_class_template called pushdecl
3738 on the newdecl to perform name injection. But, pushdecl in
3739 turn called duplicate_decls when it discovered that another
3740 declaration of a global function with the same name already
3743 o Here, in duplicate_decls, we decided to clobber newdecl.
3745 If we're going to do that, we'd better make sure that
3746 olddecl, and not newdecl, is on the list of
3747 instantiations so that if we try to do the instantiation
3748 again we won't get the clobbered declaration. */
3750 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3751 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3753 for (; decls
; decls
= TREE_CHAIN (decls
))
3754 if (TREE_VALUE (decls
) == newdecl
)
3755 TREE_VALUE (decls
) = olddecl
;
3758 if (((char *)newdecl
+ ROUND (function_size
) == (char *)nl
3759 && ((char *)newdecl
+ ROUND (function_size
)
3760 + ROUND (sizeof (struct lang_decl
))
3761 == obstack_next_free (&permanent_obstack
)))
3762 || ((char *)newdecl
+ ROUND (function_size
)
3763 == obstack_next_free (&permanent_obstack
)))
3765 DECL_MAIN_VARIANT (newdecl
) = olddecl
;
3766 DECL_LANG_SPECIFIC (olddecl
) = ol
;
3767 bcopy ((char *)nl
, (char *)ol
, sizeof (struct lang_decl
));
3769 obstack_free (&permanent_obstack
, newdecl
);
3771 else if (LANG_DECL_PERMANENT (ol
) && ol
!= nl
)
3773 if (DECL_MAIN_VARIANT (olddecl
) == olddecl
)
3775 struct lang_decl
*free_lang_decl
= ol
;
3777 /* Save these lang_decls that would otherwise be lost. */
3778 if (DECL_LANG_SPECIFIC (olddecl
) == ol
)
3781 free_lang_decl
->u
.next
= free_lang_decl_chain
;
3782 free_lang_decl_chain
= free_lang_decl
;
3786 /* Storage leak. */;
3792 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3793 (char *) olddecl
+ sizeof (struct tree_common
),
3794 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3795 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3798 DECL_UID (olddecl
) = olddecl_uid
;
3800 DECL_FRIEND_P (olddecl
) = 1;
3802 /* NEWDECL contains the merged attribute lists.
3803 Update OLDDECL to be the same. */
3804 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3809 /* Record a decl-node X as belonging to the current lexical scope.
3810 Check for errors (such as an incompatible declaration for the same
3811 name already seen in the same scope).
3813 Returns either X or an old decl for the same name.
3814 If an old decl is returned, it may have been smashed
3815 to agree with what X says. */
3822 register tree name
= DECL_ASSEMBLER_NAME (x
);
3823 int need_new_binding
= 1;
3825 if (DECL_TEMPLATE_PARM_P (x
))
3826 /* Template parameters have no context; they are not X::T even
3827 when declared within a class or namespace. */
3831 if (current_function_decl
&& x
!= current_function_decl
3832 /* A local declaration for a function doesn't constitute
3834 && (TREE_CODE (x
) != FUNCTION_DECL
|| DECL_INITIAL (x
))
3835 /* Don't change DECL_CONTEXT of virtual methods. */
3836 && (TREE_CODE (x
) != FUNCTION_DECL
|| !DECL_VIRTUAL_P (x
))
3837 && !DECL_CONTEXT (x
))
3838 DECL_CONTEXT (x
) = current_function_decl
;
3839 if (!DECL_CONTEXT (x
))
3840 DECL_CONTEXT (x
) = FROB_CONTEXT (current_namespace
);
3843 /* Type are looked up using the DECL_NAME, as that is what the rest of the
3844 compiler wants to use. */
3845 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
3846 || TREE_CODE (x
) == NAMESPACE_DECL
)
3847 name
= DECL_NAME (x
);
3852 /* Not needed...see below. */
3856 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3857 name
= TREE_OPERAND (name
, 0);
3859 /* Namespace-scoped variables are not found in the current level. */
3860 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
))
3861 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3863 t
= lookup_name_current_level (name
);
3864 if (t
== error_mark_node
)
3866 /* error_mark_node is 0 for a while during initialization! */
3868 cp_error_at ("`%#D' used prior to declaration", x
);
3871 else if (t
!= NULL_TREE
)
3874 /* This is turned off until I have time to do it right (bpk). */
3875 /* With the code below that uses it... */
3876 file
= DECL_SOURCE_FILE (t
);
3877 line
= DECL_SOURCE_LINE (t
);
3879 if (TREE_CODE (t
) == PARM_DECL
)
3881 if (DECL_CONTEXT (t
) == NULL_TREE
)
3882 fatal ("parse errors have confused me too much");
3884 /* Check for duplicate params. */
3885 if (duplicate_decls (x
, t
))
3888 else if (((TREE_CODE (x
) == FUNCTION_DECL
&& DECL_LANGUAGE (x
) == lang_c
)
3889 || DECL_FUNCTION_TEMPLATE_P (x
))
3890 && is_overloaded_fn (t
))
3891 /* Don't do anything just yet. */;
3892 else if (t
== wchar_decl_node
)
3894 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3895 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3897 /* Throw away the redeclaration. */
3900 else if (TREE_CODE (t
) != TREE_CODE (x
))
3902 if (duplicate_decls (x
, t
))
3905 else if (duplicate_decls (x
, t
))
3908 /* This is turned off until I have time to do it right (bpk). */
3910 /* Also warn if they did a prototype with `static' on it, but
3911 then later left the `static' off. */
3912 if (! TREE_PUBLIC (name
) && TREE_PUBLIC (x
))
3914 if (DECL_LANG_SPECIFIC (t
) && DECL_FRIEND_P (t
))
3919 cp_warning ("`static' missing from declaration of `%D'",
3921 warning_with_file_and_line (file
, line
,
3922 "previous declaration of `%s'",
3923 decl_as_string (t
, 0));
3926 /* Now fix things so it'll do what they expect. */
3927 if (current_function_decl
)
3928 TREE_PUBLIC (current_function_decl
) = 0;
3930 /* Due to interference in memory reclamation (X may be
3931 obstack-deallocated at this point), we must guard against
3932 one really special case. [jason: This should be handled
3933 by start_function] */
3934 if (current_function_decl
== x
)
3935 current_function_decl
= t
;
3937 if (TREE_CODE (t
) == TYPE_DECL
)
3938 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3939 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3940 check_default_args (t
);
3944 else if (DECL_MAIN_P (x
))
3946 /* A redeclaration of main, but not a duplicate of the
3951 This function shall not be overloaded. */
3952 cp_error_at ("invalid redeclaration of `%D'", t
);
3953 cp_error ("as `%D'", x
);
3954 /* We don't try to push this declaration since that
3960 check_template_shadow (x
);
3962 /* If this is a function conjured up by the backend, massage it
3963 so it looks friendly. */
3964 if (TREE_CODE (x
) == FUNCTION_DECL
3965 && ! DECL_LANG_SPECIFIC (x
))
3967 retrofit_lang_decl (x
);
3968 DECL_LANGUAGE (x
) = lang_c
;
3971 if (TREE_CODE (x
) == FUNCTION_DECL
&& ! DECL_FUNCTION_MEMBER_P (x
))
3973 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
3974 if (t
!= x
|| DECL_LANGUAGE (x
) == lang_c
)
3976 if (!namespace_bindings_p ())
3977 /* We do not need to create a binding for this name;
3978 push_overloaded_decl will have already done so if
3980 need_new_binding
= 0;
3982 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3984 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
3986 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
3990 /* If declaring a type as a typedef, copy the type (unless we're
3991 at line 0), and install this TYPE_DECL as the new type's typedef
3992 name. See the extensive comment in ../c-decl.c (pushdecl). */
3993 if (TREE_CODE (x
) == TYPE_DECL
)
3995 tree type
= TREE_TYPE (x
);
3996 if (DECL_SOURCE_LINE (x
) == 0)
3998 if (TYPE_NAME (type
) == 0)
3999 TYPE_NAME (type
) = x
;
4001 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
4002 /* We don't want to copy the type when all we're
4003 doing is making a TYPE_DECL for the purposes of
4005 && (!TYPE_NAME (type
)
4006 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
4008 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
4010 DECL_ORIGINAL_TYPE (x
) = type
;
4011 type
= build_type_copy (type
);
4012 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
4013 TYPE_NAME (type
) = x
;
4014 TREE_TYPE (x
) = type
;
4019 if (type
!= error_mark_node
4021 && TYPE_IDENTIFIER (type
))
4022 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
4023 current_binding_level
);
4027 /* Multiple external decls of the same identifier ought to match.
4029 We get warnings about inline functions where they are defined.
4030 We get warnings about other functions from push_overloaded_decl.
4032 Avoid duplicate warnings where they are used. */
4033 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
4037 if (IDENTIFIER_NAMESPACE_VALUE (name
) != NULL_TREE
4038 && (DECL_EXTERNAL (IDENTIFIER_NAMESPACE_VALUE (name
))
4039 || TREE_PUBLIC (IDENTIFIER_NAMESPACE_VALUE (name
))))
4040 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
4045 /* If different sort of thing, we already gave an error. */
4046 && TREE_CODE (decl
) == TREE_CODE (x
)
4047 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
4049 cp_pedwarn ("type mismatch with previous external decl", x
);
4050 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
4054 /* This name is new in its binding level.
4055 Install the new declaration and return it. */
4056 if (namespace_bindings_p ())
4058 /* Install a global value. */
4060 /* If the first global decl has external linkage,
4061 warn if we later see static one. */
4062 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
4063 TREE_PUBLIC (name
) = 1;
4065 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
4068 if (TREE_CODE (x
) == FUNCTION_DECL
)
4070 ((IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
)
4071 || (IDENTIFIER_GLOBAL_VALUE (name
) == x
), 378);
4072 SET_IDENTIFIER_NAMESPACE_VALUE (name
, x
);
4075 /* Don't forget if the function was used via an implicit decl. */
4076 if (IDENTIFIER_IMPLICIT_DECL (name
)
4077 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
4080 /* Don't forget if its address was taken in that way. */
4081 if (IDENTIFIER_IMPLICIT_DECL (name
)
4082 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
4083 TREE_ADDRESSABLE (x
) = 1;
4085 /* Warn about mismatches against previous implicit decl. */
4086 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
4087 /* If this real decl matches the implicit, don't complain. */
4088 && ! (TREE_CODE (x
) == FUNCTION_DECL
4089 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
4091 ("`%D' was previously implicitly declared to return `int'", x
);
4093 /* If new decl is `static' and an `extern' was seen previously,
4095 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
4096 warn_extern_redeclared_static (x
, t
);
4100 /* Here to install a non-global value. */
4101 tree oldlocal
= IDENTIFIER_VALUE (name
);
4102 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
4104 if (need_new_binding
)
4106 push_local_binding (name
, x
, 0);
4107 /* Because push_local_binding will hook X on to the
4108 current_binding_level's name list, we don't want to
4109 do that again below. */
4110 need_new_binding
= 0;
4113 /* If this is a TYPE_DECL, push it into the type value slot. */
4114 if (TREE_CODE (x
) == TYPE_DECL
)
4115 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
4116 current_binding_level
);
4118 /* Clear out any TYPE_DECL shadowed by a namespace so that
4119 we won't think this is a type. The C struct hack doesn't
4120 go through namespaces. */
4121 if (TREE_CODE (x
) == NAMESPACE_DECL
)
4122 set_identifier_type_value_with_scope (name
, NULL_TREE
,
4123 current_binding_level
);
4125 /* If this is an extern function declaration, see if we
4126 have a global definition or declaration for the function. */
4127 if (oldlocal
== NULL_TREE
4128 && DECL_EXTERNAL (x
)
4129 && oldglobal
!= NULL_TREE
4130 && TREE_CODE (x
) == FUNCTION_DECL
4131 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
4133 /* We have one. Their types must agree. */
4134 if (decls_match (x
, oldglobal
))
4138 cp_warning ("extern declaration of `%#D' doesn't match", x
);
4139 cp_warning_at ("global declaration `%#D'", oldglobal
);
4142 /* If we have a local external declaration,
4143 and no file-scope declaration has yet been seen,
4144 then if we later have a file-scope decl it must not be static. */
4145 if (oldlocal
== NULL_TREE
4146 && oldglobal
== NULL_TREE
4147 && DECL_EXTERNAL (x
)
4149 TREE_PUBLIC (name
) = 1;
4151 if (DECL_FROM_INLINE (x
))
4152 /* Inline decls shadow nothing. */;
4154 /* Warn if shadowing an argument at the top level of the body. */
4155 else if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
4156 && TREE_CODE (oldlocal
) == PARM_DECL
4157 /* Don't complain if it's from an enclosing function. */
4158 && DECL_CONTEXT (oldlocal
) == current_function_decl
4159 && TREE_CODE (x
) != PARM_DECL
)
4161 /* Go to where the parms should be and see if we
4163 struct binding_level
*b
= current_binding_level
->level_chain
;
4169 if (b
->parm_flag
== 1)
4170 cp_error ("declaration of `%#D' shadows a parameter", name
);
4172 else if (warn_shadow
&& oldlocal
!= NULL_TREE
4173 && current_binding_level
->is_for_scope
4174 && !DECL_DEAD_FOR_LOCAL (oldlocal
))
4176 warning ("variable `%s' shadows local",
4177 IDENTIFIER_POINTER (name
));
4178 cp_warning_at (" this is the shadowed declaration", oldlocal
);
4180 /* Maybe warn if shadowing something else. */
4181 else if (warn_shadow
&& !DECL_EXTERNAL (x
)
4182 /* No shadow warnings for internally generated vars. */
4183 && ! DECL_ARTIFICIAL (x
)
4184 /* No shadow warnings for vars made for inlining. */
4185 && ! DECL_FROM_INLINE (x
))
4187 const char *warnstring
= NULL
;
4189 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
4190 warnstring
= "declaration of `%s' shadows a parameter";
4191 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
4192 && current_class_ptr
4193 && !TREE_STATIC (name
))
4194 warnstring
= "declaration of `%s' shadows a member of `this'";
4195 else if (oldlocal
!= NULL_TREE
)
4196 warnstring
= "declaration of `%s' shadows previous local";
4197 else if (oldglobal
!= NULL_TREE
)
4198 /* XXX shadow warnings in outer-more namespaces */
4199 warnstring
= "declaration of `%s' shadows global declaration";
4202 warning (warnstring
, IDENTIFIER_POINTER (name
));
4206 if (TREE_CODE (x
) == FUNCTION_DECL
)
4207 check_default_args (x
);
4209 /* Keep count of variables in this level with incomplete type. */
4210 if (TREE_CODE (x
) == VAR_DECL
4211 && TREE_TYPE (x
) != error_mark_node
4212 && ((TYPE_SIZE (TREE_TYPE (x
)) == NULL_TREE
4213 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
4214 /* RTTI TD entries are created while defining the type_info. */
4215 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
4216 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
4217 current_binding_level
->incomplete
4218 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4221 if (need_new_binding
)
4222 add_decl_to_level (x
, current_binding_level
);
4227 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4228 caller to set DECL_CONTEXT properly. */
4231 pushdecl_with_scope (x
, level
)
4233 struct binding_level
*level
;
4235 register struct binding_level
*b
;
4236 tree function_decl
= current_function_decl
;
4238 current_function_decl
= NULL_TREE
;
4239 if (level
->parm_flag
== 2)
4241 b
= class_binding_level
;
4242 class_binding_level
= level
;
4243 pushdecl_class_level (x
);
4244 class_binding_level
= b
;
4248 b
= current_binding_level
;
4249 current_binding_level
= level
;
4251 current_binding_level
= b
;
4253 current_function_decl
= function_decl
;
4257 /* Like pushdecl, only it places X in the current namespace,
4261 pushdecl_namespace_level (x
)
4264 register struct binding_level
*b
= current_binding_level
;
4267 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4269 /* Now, the type_shadowed stack may screw us. Munge it so it does
4271 if (TREE_CODE (x
) == TYPE_DECL
)
4273 tree name
= DECL_NAME (x
);
4275 tree
*ptr
= (tree
*)0;
4276 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4278 tree shadowed
= b
->type_shadowed
;
4279 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4280 if (TREE_PURPOSE (shadowed
) == name
)
4282 ptr
= &TREE_VALUE (shadowed
);
4283 /* Can't break out of the loop here because sometimes
4284 a binding level will have duplicate bindings for
4285 PT names. It's gross, but I haven't time to fix it. */
4288 newval
= TREE_TYPE (x
);
4289 if (ptr
== (tree
*)0)
4291 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4292 up here if this is changed to an assertion. --KR */
4293 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4303 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4307 pushdecl_top_level (x
)
4310 tree cur_namespace
= current_namespace
;
4311 current_namespace
= global_namespace
;
4312 x
= pushdecl_namespace_level (x
);
4313 current_namespace
= cur_namespace
;
4317 /* Make the declaration of X appear in CLASS scope. */
4320 pushdecl_class_level (x
)
4323 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4324 scope looks for the pre-mangled name. */
4327 if (TREE_CODE (x
) == OVERLOAD
)
4328 x
= OVL_CURRENT (x
);
4329 name
= DECL_NAME (x
);
4333 push_class_level_binding (name
, x
);
4334 if (TREE_CODE (x
) == TYPE_DECL
)
4335 set_identifier_type_value (name
, TREE_TYPE (x
));
4337 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4341 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4344 pushdecl_class_level (f
);
4348 /* Enter DECL into the symbol table, if that's appropriate. Returns
4349 DECL, or a modified version thereof. */
4352 maybe_push_decl (decl
)
4355 tree type
= TREE_TYPE (decl
);
4357 /* Add this decl to the current binding level, but not if it comes
4358 from another scope, e.g. a static member variable. TEM may equal
4359 DECL or it may be a previous decl of the same name. */
4360 if ((TREE_CODE (decl
) != PARM_DECL
4361 && DECL_CONTEXT (decl
) != NULL_TREE
4362 /* Definitions of namespace members outside their namespace are
4364 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4365 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4366 || TREE_CODE (type
) == UNKNOWN_TYPE
4367 /* The declaration of a template specialization does not affect
4368 the functions available for overload resolution, so we do not
4370 || (TREE_CODE (decl
) == FUNCTION_DECL
4371 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4374 return pushdecl (decl
);
4378 /* This function is used to push the mangled decls for nested types into
4379 the appropriate scope. Previously pushdecl_top_level was used, but that
4380 is incorrect for members of local classes. */
4383 pushdecl_nonclass_level (x
)
4386 struct binding_level
*b
= current_binding_level
;
4388 my_friendly_assert (b
->parm_flag
!= 2, 180);
4391 /* Get out of template binding levels */
4392 while (b
->pseudo_global
)
4396 pushdecl_with_scope (x
, b
);
4400 /* Make the declaration(s) of X appear in CLASS scope
4401 under the name NAME. */
4404 push_class_level_binding (name
, x
)
4409 /* The class_binding_level will be NULL if x is a template
4410 parameter name in a member template. */
4411 if (!class_binding_level
)
4414 /* Make sure that this new member does not have the same name
4415 as a template parameter. */
4416 if (TYPE_BEING_DEFINED (current_class_type
))
4417 check_template_shadow (x
);
4419 /* If this declaration shadows a declaration from an enclosing
4420 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4421 we leave this class. Record the shadowed declaration here. */
4422 binding
= IDENTIFIER_BINDING (name
);
4424 && ((TREE_CODE (x
) == OVERLOAD
4425 && BINDING_VALUE (binding
)
4426 && is_overloaded_fn (BINDING_VALUE (binding
)))
4427 || INHERITED_VALUE_BINDING_P (binding
)))
4432 /* If the old binding was from a base class, and was for a tag
4433 name, slide it over to make room for the new binding. The
4434 old binding is still visible if explicitly qualified with a
4436 if (INHERITED_VALUE_BINDING_P (binding
)
4437 && BINDING_VALUE (binding
)
4438 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4439 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4440 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4442 old_decl
= BINDING_TYPE (binding
);
4443 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4444 BINDING_VALUE (binding
) = NULL_TREE
;
4445 INHERITED_VALUE_BINDING_P (binding
) = 0;
4448 old_decl
= BINDING_VALUE (binding
);
4450 /* There was already a binding for X containing fewer
4451 functions than are named in X. Find the previous
4452 declaration of X on the class-shadowed list, and update it. */
4453 for (shadow
= class_binding_level
->class_shadowed
;
4455 shadow
= TREE_CHAIN (shadow
))
4456 if (TREE_PURPOSE (shadow
) == name
4457 && TREE_TYPE (shadow
) == old_decl
)
4459 BINDING_VALUE (binding
) = x
;
4460 INHERITED_VALUE_BINDING_P (binding
) = 0;
4461 TREE_TYPE (shadow
) = x
;
4466 /* If we didn't replace an existing binding, put the binding on the
4467 stack of bindings for the identifier, and update
4468 IDENTIFIER_CLASS_VALUE. */
4469 if (push_class_binding (name
, x
))
4471 push_cache_obstack ();
4472 class_binding_level
->class_shadowed
4473 = tree_cons (name
, IDENTIFIER_CLASS_VALUE (name
),
4474 class_binding_level
->class_shadowed
);
4476 /* Record the value we are binding NAME to so that we can know
4477 what to pop later. */
4478 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4482 /* Insert another USING_DECL into the current binding level,
4483 returning this declaration. If this is a redeclaration,
4484 do nothing and return NULL_TREE. */
4487 push_using_decl (scope
, name
)
4493 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4494 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4495 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4496 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4500 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4501 DECL_INITIAL (decl
) = scope
;
4502 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4503 current_binding_level
->usings
= decl
;
4507 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4508 changed (i.e. there was already a directive), or the fresh
4509 TREE_LIST otherwise. */
4512 push_using_directive (used
)
4515 tree ud
= current_binding_level
->using_directives
;
4516 tree iter
, ancestor
;
4518 /* Check if we already have this. */
4519 if (purpose_member (used
, ud
) != NULL_TREE
)
4522 /* Recursively add all namespaces used. */
4523 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4524 push_using_directive (TREE_PURPOSE (iter
));
4526 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4527 ud
= current_binding_level
->using_directives
;
4528 ud
= perm_tree_cons (used
, ancestor
, ud
);
4529 current_binding_level
->using_directives
= ud
;
4533 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4534 other definitions already in place. We get around this by making
4535 the value of the identifier point to a list of all the things that
4536 want to be referenced by that name. It is then up to the users of
4537 that name to decide what to do with that list.
4539 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its DECL_RESULT
4540 slot. It is dealt with the same way.
4542 FLAGS is a bitwise-or of the following values:
4543 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4545 PUSH_USING: DECL is being pushed as the result of a using
4548 The value returned may be a previous declaration if we guessed wrong
4549 about what language DECL should belong to (C or C++). Otherwise,
4550 it's always DECL (and never something that's not a _DECL). */
4553 push_overloaded_decl (decl
, flags
)
4557 tree name
= DECL_NAME (decl
);
4560 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4563 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4565 old
= lookup_name_current_level (name
);
4569 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4571 tree t
= TREE_TYPE (old
);
4572 if (IS_AGGR_TYPE (t
) && warn_shadow
4573 && (! DECL_IN_SYSTEM_HEADER (decl
)
4574 || ! DECL_IN_SYSTEM_HEADER (old
)))
4575 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4578 else if (is_overloaded_fn (old
))
4582 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4584 tree fn
= OVL_CURRENT (tmp
);
4586 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4587 && !(flags
& PUSH_USING
)
4588 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4589 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4590 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4593 if (duplicate_decls (decl
, fn
))
4599 cp_error_at ("previous non-function declaration `%#D'", old
);
4600 cp_error ("conflicts with function declaration `%#D'", decl
);
4605 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4607 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4608 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4610 new_binding
= ovl_cons (decl
, old
);
4611 if (flags
& PUSH_USING
)
4612 OVL_USED (new_binding
) = 1;
4615 /* NAME is not ambiguous. */
4619 set_namespace_binding (name
, current_namespace
, new_binding
);
4622 /* We only create an OVERLOAD if there was a previous binding at
4623 this level, or if decl is a template. In the former case, we
4624 need to remove the old binding and replace it with the new
4625 binding. We must also run through the NAMES on the binding
4626 level where the name was bound to update the chain. */
4628 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4632 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4634 d
= &TREE_CHAIN (*d
))
4636 || (TREE_CODE (*d
) == TREE_LIST
4637 && TREE_VALUE (*d
) == old
))
4639 if (TREE_CODE (*d
) == TREE_LIST
)
4640 /* Just replace the old binding with the new. */
4641 TREE_VALUE (*d
) = new_binding
;
4643 /* Build a TREE_LIST to wrap the OVERLOAD. */
4644 *d
= build_tree_list (NULL_TREE
, new_binding
);
4646 /* And update the CPLUS_BINDING node. */
4647 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4652 /* We should always find a previous binding in this case. */
4653 my_friendly_abort (0);
4656 /* Install the new binding. */
4657 push_local_binding (name
, new_binding
, flags
);
4663 /* Generate an implicit declaration for identifier FUNCTIONID
4664 as a function of type int (). Print a warning if appropriate. */
4667 implicitly_declare (functionid
)
4671 int temp
= allocation_temporary_p ();
4673 push_obstacks_nochange ();
4675 /* Save the decl permanently so we can warn if definition follows.
4676 In ANSI C, warn_implicit is usually false, so the saves little space.
4677 But in C++, it's usually true, hence the extra code. */
4678 if (temp
&& (! warn_implicit
|| toplevel_bindings_p ()))
4679 end_temporary_allocation ();
4681 /* We used to reuse an old implicit decl here,
4682 but this loses with inline functions because it can clobber
4683 the saved decl chains. */
4684 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4686 DECL_EXTERNAL (decl
) = 1;
4687 TREE_PUBLIC (decl
) = 1;
4689 /* ANSI standard says implicit declarations are in the innermost block.
4690 So we record the decl in the standard fashion. */
4692 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4695 /* Only one warning per identifier. */
4696 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4698 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4701 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4708 /* Return zero if the declaration NEWDECL is valid
4709 when the declaration OLDDECL (assumed to be for the same name)
4710 has already been seen.
4711 Otherwise return an error message format string with a %s
4712 where the identifier should go. */
4715 redeclaration_error_message (newdecl
, olddecl
)
4716 tree newdecl
, olddecl
;
4718 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4720 /* Because C++ can put things into name space for free,
4721 constructs like "typedef struct foo { ... } foo"
4722 would look like an erroneous redeclaration. */
4723 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4726 return "redefinition of `%#D'";
4728 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4730 /* If this is a pure function, its olddecl will actually be
4731 the original initialization to `0' (which we force to call
4732 abort()). Don't complain about redefinition in this case. */
4733 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_ABSTRACT_VIRTUAL_P (olddecl
))
4736 /* If both functions come from different namespaces, this is not
4737 a redeclaration - this is a conflict with a used function. */
4738 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4739 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4740 return "`%D' conflicts with used function";
4742 /* We'll complain about linkage mismatches in
4743 warn_extern_redeclared_static. */
4745 /* Defining the same name twice is no good. */
4746 if (DECL_INITIAL (olddecl
) != NULL_TREE
4747 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4749 if (DECL_NAME (olddecl
) == NULL_TREE
)
4750 return "`%#D' not declared in class";
4752 return "redefinition of `%#D'";
4756 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4758 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4759 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4760 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4761 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4762 && TYPE_SIZE (TREE_TYPE (newdecl
))
4763 && TYPE_SIZE (TREE_TYPE (olddecl
))))
4764 return "redefinition of `%#D'";
4767 else if (toplevel_bindings_p ())
4769 /* Objects declared at top level: */
4770 /* If at least one is a reference, it's ok. */
4771 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4773 /* Reject two definitions. */
4774 return "redefinition of `%#D'";
4778 /* Objects declared with block scope: */
4779 /* Reject two definitions, and reject a definition
4780 together with an external reference. */
4781 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4782 return "redeclaration of `%#D'";
4787 /* Get the LABEL_DECL corresponding to identifier ID as a label.
4788 Create one if none exists so far for the current function.
4789 This function is called for both label definitions and label references. */
4795 register tree decl
= IDENTIFIER_LABEL_VALUE (id
);
4797 if (current_function_decl
== NULL_TREE
)
4799 error ("label `%s' referenced outside of any function",
4800 IDENTIFIER_POINTER (id
));
4804 if ((decl
== NULL_TREE
4805 || DECL_SOURCE_LINE (decl
) == 0)
4806 && (named_label_uses
== NULL
4807 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4808 || named_label_uses
->label_decl
!= decl
))
4810 struct named_label_list
*new_ent
;
4812 = (struct named_label_list
*)oballoc (sizeof (struct named_label_list
));
4813 new_ent
->label_decl
= decl
;
4814 new_ent
->names_in_scope
= current_binding_level
->names
;
4815 new_ent
->binding_level
= current_binding_level
;
4816 new_ent
->lineno_o_goto
= lineno
;
4817 new_ent
->filename_o_goto
= input_filename
;
4818 new_ent
->next
= named_label_uses
;
4819 named_label_uses
= new_ent
;
4822 /* Use a label already defined or ref'd with this name. */
4823 if (decl
!= NULL_TREE
)
4825 /* But not if it is inherited and wasn't declared to be inheritable. */
4826 if (DECL_CONTEXT (decl
) != current_function_decl
4827 && ! C_DECLARED_LABEL_FLAG (decl
))
4828 return shadow_label (id
);
4832 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4834 /* Make sure every label has an rtx. */
4837 /* A label not explicitly declared must be local to where it's ref'd. */
4838 DECL_CONTEXT (decl
) = current_function_decl
;
4840 DECL_MODE (decl
) = VOIDmode
;
4842 /* Say where one reference is to the label,
4843 for the sake of the error if it is not defined. */
4844 DECL_SOURCE_LINE (decl
) = lineno
;
4845 DECL_SOURCE_FILE (decl
) = input_filename
;
4847 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4849 named_labels
= tree_cons (NULL_TREE
, decl
, named_labels
);
4850 named_label_uses
->label_decl
= decl
;
4855 /* Make a label named NAME in the current function,
4856 shadowing silently any that may be inherited from containing functions
4857 or containing scopes.
4859 Note that valid use, if the label being shadowed
4860 comes from another scope in the same function,
4861 requires calling declare_nonlocal_label right away. */
4867 register tree decl
= IDENTIFIER_LABEL_VALUE (name
);
4869 if (decl
!= NULL_TREE
)
4871 shadowed_labels
= tree_cons (NULL_TREE
, decl
, shadowed_labels
);
4872 SET_IDENTIFIER_LABEL_VALUE (name
, NULL_TREE
);
4875 return lookup_label (name
);
4878 /* Define a label, specifying the location in the source file.
4879 Return the LABEL_DECL node for the label, if the definition is valid.
4880 Otherwise return 0. */
4883 define_label (filename
, line
, name
)
4888 tree decl
= lookup_label (name
);
4890 /* After labels, make any new cleanups go into their
4891 own new (temporary) binding contour. */
4892 current_binding_level
->more_cleanups_ok
= 0;
4894 /* If label with this name is known from an outer context, shadow it. */
4895 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) != current_function_decl
)
4897 shadowed_labels
= tree_cons (NULL_TREE
, decl
, shadowed_labels
);
4898 SET_IDENTIFIER_LABEL_VALUE (name
, NULL_TREE
);
4899 decl
= lookup_label (name
);
4902 if (name
== get_identifier ("wchar_t"))
4903 cp_pedwarn ("label named wchar_t");
4905 if (DECL_INITIAL (decl
) != NULL_TREE
)
4907 cp_error ("duplicate label `%D'", decl
);
4912 struct named_label_list
*uses
, *prev
;
4916 /* Mark label as having been defined. */
4917 DECL_INITIAL (decl
) = error_mark_node
;
4918 /* Say where in the source. */
4919 DECL_SOURCE_FILE (decl
) = filename
;
4920 DECL_SOURCE_LINE (decl
) = line
;
4923 uses
= named_label_uses
;
4924 while (uses
!= NULL
)
4925 if (uses
->label_decl
== decl
)
4927 struct binding_level
*b
= current_binding_level
;
4930 tree new_decls
= b
->names
;
4931 tree old_decls
= (b
== uses
->binding_level
)
4932 ? uses
->names_in_scope
: NULL_TREE
;
4933 while (new_decls
!= old_decls
)
4935 if (TREE_CODE (new_decls
) == VAR_DECL
4936 /* Don't complain about crossing initialization
4937 of internal entities. They can't be accessed,
4938 and they should be cleaned up
4939 by the time we get to the label. */
4940 && ! DECL_ARTIFICIAL (new_decls
)
4941 && !(DECL_INITIAL (new_decls
) == NULL_TREE
4942 && pod_type_p (TREE_TYPE (new_decls
))))
4944 /* This is really only important if we're crossing
4945 an initialization. The POD stuff is just
4946 pedantry; why should it matter if the class
4947 contains a field of pointer to member type? */
4948 int problem
= (DECL_INITIAL (new_decls
)
4949 || (TYPE_NEEDS_CONSTRUCTING
4950 (TREE_TYPE (new_decls
))));
4956 cp_error ("jump to label `%D'", decl
);
4957 error_with_file_and_line
4958 (uses
->filename_o_goto
,
4959 uses
->lineno_o_goto
, " from here");
4963 cp_pedwarn ("jump to label `%D'", decl
);
4964 pedwarn_with_file_and_line
4965 (uses
->filename_o_goto
,
4966 uses
->lineno_o_goto
, " from here");
4972 cp_error_at (" crosses initialization of `%#D'",
4975 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4978 new_decls
= TREE_CHAIN (new_decls
);
4980 if (b
== uses
->binding_level
)
4982 if (b
->eh_region
&& ! saw_eh
)
4986 cp_error ("jump to label `%D'", decl
);
4987 error_with_file_and_line
4988 (uses
->filename_o_goto
,
4989 uses
->lineno_o_goto
, " from here");
4992 error (" enters exception handling block");
4999 prev
->next
= uses
->next
;
5001 named_label_uses
= uses
->next
;
5010 current_function_return_value
= NULL_TREE
;
5017 struct binding_level
*level
;
5018 struct cp_switch
*next
;
5021 static struct cp_switch
*switch_stack
;
5027 = (struct cp_switch
*) oballoc (sizeof (struct cp_switch
));
5028 p
->level
= current_binding_level
;
5029 p
->next
= switch_stack
;
5036 switch_stack
= switch_stack
->next
;
5039 /* Same, but for CASE labels. If DECL is NULL_TREE, it's the default. */
5040 /* XXX Note decl is never actually used. (bpk) */
5043 define_case_label ()
5045 tree cleanup
= last_cleanup_this_contour ();
5046 struct binding_level
*b
= current_binding_level
;
5051 static int explained
= 0;
5052 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup
));
5053 warning ("where case label appears here");
5056 warning ("(enclose actions of previous case statements requiring");
5057 warning ("destructors in their own binding contours.)");
5062 for (; b
&& b
!= switch_stack
->level
; b
= b
->level_chain
)
5064 tree new_decls
= b
->names
;
5065 for (; new_decls
; new_decls
= TREE_CHAIN (new_decls
))
5067 if (TREE_CODE (new_decls
) == VAR_DECL
5068 /* Don't complain about crossing initialization
5069 of internal entities. They can't be accessed,
5070 and they should be cleaned up
5071 by the time we get to the label. */
5072 && ! DECL_ARTIFICIAL (new_decls
)
5073 && ((DECL_INITIAL (new_decls
) != NULL_TREE
5074 && DECL_INITIAL (new_decls
) != error_mark_node
)
5075 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls
))))
5078 error ("jump to case label");
5080 cp_error_at (" crosses initialization of `%#D'",
5086 /* After labels, make any new cleanups go into their
5087 own new (temporary) binding contour. */
5089 current_binding_level
->more_cleanups_ok
= 0;
5090 current_function_return_value
= NULL_TREE
;
5093 /* Return the list of declarations of the current level.
5094 Note that this list is in reverse order unless/until
5095 you nreverse it; and when you do nreverse it, you must
5096 store the result back using `storedecls' or you will lose. */
5101 return current_binding_level
->names
;
5104 /* Return the list of type-tags (for structs, etc) of the current level. */
5109 return current_binding_level
->tags
;
5112 /* Store the list of declarations of the current level.
5113 This is done for the parameter declarations of a function being defined,
5114 after they are modified in the light of any missing parameters. */
5120 current_binding_level
->names
= decls
;
5123 /* Similarly, store the list of tags of the current level. */
5129 current_binding_level
->tags
= tags
;
5132 /* Given NAME, an IDENTIFIER_NODE,
5133 return the structure (or union or enum) definition for that name.
5134 Searches binding levels from BINDING_LEVEL up to the global level.
5135 If THISLEVEL_ONLY is nonzero, searches only the specified context
5136 (but skips any tag-transparent contexts to find one that is
5137 meaningful for tags).
5138 FORM says which kind of type the caller wants;
5139 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
5140 If the wrong kind of type is found, and it's not a template, an error is
5144 lookup_tag (form
, name
, binding_level
, thislevel_only
)
5145 enum tree_code form
;
5147 struct binding_level
*binding_level
;
5150 register struct binding_level
*level
;
5151 /* Non-zero if, we should look past a pseudo-global level, even if
5153 int allow_pseudo_global
= 1;
5155 for (level
= binding_level
; level
; level
= level
->level_chain
)
5158 if (ANON_AGGRNAME_P (name
))
5159 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5161 /* There's no need for error checking here, because
5162 anon names are unique throughout the compilation. */
5163 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
5164 return TREE_VALUE (tail
);
5166 else if (level
->namespace_p
)
5167 /* Do namespace lookup. */
5168 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
5170 tree old
= binding_for_name (name
, tail
);
5172 /* If we just skipped past a pseudo global level, even
5173 though THISLEVEL_ONLY, and we find a template class
5174 declaration, then we use the _TYPE node for the
5175 template. See the example below. */
5176 if (thislevel_only
&& !allow_pseudo_global
5177 && old
&& BINDING_VALUE (old
)
5178 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
5179 old
= TREE_TYPE (BINDING_VALUE (old
));
5181 old
= BINDING_TYPE (old
);
5183 /* If it has an original type, it is a typedef, and we
5184 should not return it. */
5185 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
5187 if (old
&& TREE_CODE (old
) != form
5188 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
5190 cp_error ("`%#D' redeclared as %C", old
, form
);
5195 if (thislevel_only
|| tail
== global_namespace
)
5199 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5201 if (TREE_PURPOSE (tail
) == name
)
5203 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
5204 /* Should tighten this up; it'll probably permit
5205 UNION_TYPE and a struct template, for example. */
5207 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
5209 /* Definition isn't the kind we were looking for. */
5210 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
5214 return TREE_VALUE (tail
);
5217 if (thislevel_only
&& ! level
->tag_transparent
)
5219 if (level
->pseudo_global
&& allow_pseudo_global
)
5221 /* We must deal with cases like this:
5223 template <class T> struct S;
5224 template <class T> struct S {};
5226 When looking up `S', for the second declaration, we
5227 would like to find the first declaration. But, we
5228 are in the pseudo-global level created for the
5229 template parameters, rather than the (surrounding)
5230 namespace level. Thus, we keep going one more level,
5231 even though THISLEVEL_ONLY is non-zero. */
5232 allow_pseudo_global
= 0;
5244 set_current_level_tags_transparency (tags_transparent
)
5245 int tags_transparent
;
5247 current_binding_level
->tag_transparent
= tags_transparent
;
5251 /* Given a type, find the tag that was defined for it and return the tag name.
5252 Otherwise return 0. However, the value can never be 0
5253 in the cases in which this is used.
5255 C++: If NAME is non-zero, this is the new name to install. This is
5256 done when replacing anonymous tags with real tag names. */
5259 lookup_tag_reverse (type
, name
)
5263 register struct binding_level
*level
;
5265 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5268 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5270 if (TREE_VALUE (tail
) == type
)
5273 TREE_PURPOSE (tail
) = name
;
5274 return TREE_PURPOSE (tail
);
5281 /* Look up NAME in the NAMESPACE. */
5284 lookup_namespace_name (namespace, name
)
5285 tree
namespace, name
;
5287 struct tree_binding _b
;
5289 tree template_id
= NULL_TREE
;
5291 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5293 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5294 /* This happens for A::B<int> when B is a namespace. */
5296 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5298 /* This happens for A::B where B is a template, and there are no
5299 template arguments. */
5300 cp_error ("invalid use of `%D'", name
);
5301 return error_mark_node
;
5304 namespace = ORIGINAL_NAMESPACE (namespace);
5306 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5309 name
= TREE_OPERAND (name
, 0);
5310 if (TREE_CODE (name
) == OVERLOAD
)
5311 name
= DECL_NAME (OVL_CURRENT (name
));
5312 else if (TREE_CODE_CLASS (TREE_CODE (name
)) == 'd')
5313 name
= DECL_NAME (name
);
5316 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5318 val
= binding_init (&_b
);
5319 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5320 return error_mark_node
;
5322 if (BINDING_VALUE (val
))
5324 val
= BINDING_VALUE (val
);
5328 if (DECL_CLASS_TEMPLATE_P (val
))
5329 val
= lookup_template_class (val
,
5330 TREE_OPERAND (template_id
, 1),
5331 /*in_decl=*/NULL_TREE
,
5332 /*context=*/NULL_TREE
,
5333 /*entering_scope=*/0);
5334 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5335 || TREE_CODE (val
) == OVERLOAD
)
5336 val
= lookup_template_function (val
,
5337 TREE_OPERAND (template_id
, 1));
5340 cp_error ("`%D::%D' is not a template",
5342 return error_mark_node
;
5346 /* If we have a single function from a using decl, pull it out. */
5347 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5348 val
= OVL_FUNCTION (val
);
5352 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5353 return error_mark_node
;
5356 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5358 static unsigned long
5366 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5367 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5372 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5375 typename_compare (k1
, k2
)
5386 d1
= TYPE_NAME (t1
);
5387 d2
= TYPE_NAME (t2
);
5389 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5390 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5391 && ((TREE_TYPE (t1
) != NULL_TREE
)
5392 == (TREE_TYPE (t2
) != NULL_TREE
))
5393 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5394 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5397 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5398 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5399 is non-NULL, this type is being created by the implicit typename
5400 extension, and BASE_TYPE is a type named `t' in some base class of
5401 `T' which depends on template parameters.
5403 Returns the new TYPENAME_TYPE. */
5406 build_typename_type (context
, name
, fullname
, base_type
)
5414 struct hash_entry
* e
;
5416 static struct hash_table ht
;
5418 push_obstacks (&permanent_obstack
, &permanent_obstack
);
5421 && !hash_table_init (&ht
, &hash_newfunc
, &typename_hash
,
5423 fatal ("virtual memory exhausted");
5425 /* The FULLNAME needs to exist for the life of the hash table, i.e.,
5426 for the entire compilation. */
5427 if (!TREE_PERMANENT (fullname
))
5428 fullname
= copy_to_permanent (fullname
);
5430 /* Build the TYPENAME_TYPE. */
5431 t
= make_lang_type (TYPENAME_TYPE
);
5432 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5433 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5434 TREE_TYPE (t
) = base_type
;
5436 /* Build the corresponding TYPE_DECL. */
5437 d
= build_decl (TYPE_DECL
, name
, t
);
5438 TYPE_NAME (TREE_TYPE (d
)) = d
;
5439 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5440 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5441 DECL_ARTIFICIAL (d
) = 1;
5443 /* See if we already have this type. */
5444 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5447 /* This will free not only TREE_TYPE, but the lang-specific data
5448 and the TYPE_DECL as well. */
5449 obstack_free (&permanent_obstack
, t
);
5453 /* Insert the type into the table. */
5454 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5462 make_typename_type (context
, name
)
5467 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
5469 if (!(TYPE_LANG_SPECIFIC (name
)
5470 && (CLASSTYPE_IS_TEMPLATE (name
)
5471 || CLASSTYPE_USE_TEMPLATE (name
))))
5472 name
= TYPE_IDENTIFIER (name
);
5474 /* Create a TEMPLATE_ID_EXPR for the type. */
5475 name
= build_nt (TEMPLATE_ID_EXPR
,
5476 CLASSTYPE_TI_TEMPLATE (name
),
5477 CLASSTYPE_TI_ARGS (name
));
5479 else if (TREE_CODE (name
) == TYPE_DECL
)
5480 name
= DECL_NAME (name
);
5484 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5486 name
= TREE_OPERAND (name
, 0);
5487 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5488 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5490 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5491 my_friendly_abort (2000);
5493 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5495 /* We can get here from typename_sub0 in the explicit_template_type
5496 expansion. Just fail. */
5497 cp_error ("no class template named `%#T' in `%#T'",
5499 return error_mark_node
;
5502 if (! uses_template_parms (context
)
5503 || currently_open_class (context
))
5505 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5507 tree tmpl
= NULL_TREE
;
5508 if (IS_AGGR_TYPE (context
))
5509 tmpl
= lookup_field (context
, name
, 0, 0);
5510 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5512 cp_error ("no class template named `%#T' in `%#T'",
5514 return error_mark_node
;
5517 return lookup_template_class (tmpl
,
5518 TREE_OPERAND (fullname
, 1),
5520 /*entering_scope=*/0);
5526 if (!IS_AGGR_TYPE (context
))
5528 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5529 return error_mark_node
;
5532 t
= lookup_field (context
, name
, 0, 1);
5534 return TREE_TYPE (t
);
5538 /* If the CONTEXT is not a template type, then either the field is
5539 there now or its never going to be. */
5540 if (!uses_template_parms (context
))
5542 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5543 return error_mark_node
;
5547 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5550 /* Select the right _DECL from multiple choices. */
5553 select_decl (binding
, flags
)
5558 val
= BINDING_VALUE (binding
);
5559 if (LOOKUP_NAMESPACES_ONLY (flags
))
5561 /* We are not interested in types. */
5562 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5567 /* If we could have a type and
5568 we have nothing or we need a type and have none. */
5569 if (BINDING_TYPE (binding
)
5570 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5571 && TREE_CODE (val
) != TYPE_DECL
)))
5572 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5573 /* Don't return non-types if we really prefer types. */
5574 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5575 && (TREE_CODE (val
) != TEMPLATE_DECL
5576 || !DECL_CLASS_TEMPLATE_P (val
)))
5582 /* Unscoped lookup of a global: iterate over current namespaces,
5583 considering using-directives. If SPACESP is non-NULL, store a list
5584 of the namespaces we've considered in it. */
5587 unqualified_namespace_lookup (name
, flags
, spacesp
)
5592 struct tree_binding _binding
;
5593 tree b
= binding_init (&_binding
);
5594 tree initial
= current_decl_namespace();
5595 tree scope
= initial
;
5597 struct binding_level
*level
;
5598 tree val
= NULL_TREE
;
5601 *spacesp
= NULL_TREE
;
5603 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5606 *spacesp
= scratch_tree_cons (scope
, NULL_TREE
, *spacesp
);
5607 val
= binding_for_name (name
, scope
);
5609 /* Initialize binding for this context. */
5610 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5611 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5613 /* Add all _DECLs seen through local using-directives. */
5614 for (level
= current_binding_level
;
5615 !level
->namespace_p
;
5616 level
= level
->level_chain
)
5617 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5618 scope
, flags
, spacesp
))
5619 /* Give up because of error. */
5620 return error_mark_node
;
5622 /* Add all _DECLs seen through global using-directives. */
5623 /* XXX local and global using lists should work equally. */
5627 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5628 scope
, flags
, spacesp
))
5629 /* Give up because of error. */
5630 return error_mark_node
;
5631 if (siter
== scope
) break;
5632 siter
= CP_DECL_CONTEXT (siter
);
5635 val
= select_decl (b
, flags
);
5636 if (scope
== global_namespace
)
5642 /* Combine prefer_type and namespaces_only into flags. */
5645 lookup_flags (prefer_type
, namespaces_only
)
5646 int prefer_type
, namespaces_only
;
5648 if (namespaces_only
)
5649 return LOOKUP_PREFER_NAMESPACES
;
5650 if (prefer_type
> 1)
5651 return LOOKUP_PREFER_TYPES
;
5652 if (prefer_type
> 0)
5653 return LOOKUP_PREFER_BOTH
;
5657 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5658 ignore it or not. Subroutine of lookup_name_real. */
5661 qualify_lookup (val
, flags
)
5665 if (val
== NULL_TREE
)
5667 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5669 if ((flags
& LOOKUP_PREFER_TYPES
)
5670 && (TREE_CODE (val
) == TYPE_DECL
5671 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5672 && DECL_CLASS_TEMPLATE_P (val
))))
5674 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5679 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5683 warn_about_implicit_typename_lookup (typename
, binding
)
5687 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5688 tree name
= DECL_NAME (typename
);
5690 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5691 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5692 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5693 && ! (TREE_CODE (binding
) == TYPE_DECL
5694 && same_type_p (TREE_TYPE (binding
), subtype
)))
5696 cp_warning ("lookup of `%D' finds `%#D'",
5698 cp_warning (" instead of `%D' from dependent base class",
5700 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5701 constructor_name (current_class_type
), name
);
5705 /* Look up NAME in the current binding level and its superiors in the
5706 namespace of variables, functions and typedefs. Return a ..._DECL
5707 node of some kind representing its definition if there is only one
5708 such declaration, or return a TREE_LIST with all the overloaded
5709 definitions if there are many, or return 0 if it is undefined.
5711 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5712 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5713 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5714 Otherwise we prefer non-TYPE_DECLs.
5716 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5717 using IDENTIFIER_CLASS_VALUE. */
5720 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5722 int prefer_type
, nonclass
, namespaces_only
;
5725 tree val
= NULL_TREE
;
5727 tree from_obj
= NULL_TREE
;
5729 int val_is_implicit_typename
= 0;
5731 /* Hack: copy flag set by parser, if set. */
5732 if (only_namespace_names
)
5733 namespaces_only
= 1;
5735 if (prefer_type
== -2)
5737 extern int looking_for_typename
;
5738 tree type
= NULL_TREE
;
5741 prefer_type
= looking_for_typename
;
5743 flags
= lookup_flags (prefer_type
, namespaces_only
);
5744 /* If the next thing is '<', class templates are types. */
5745 if (looking_for_template
)
5746 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5748 /* std:: becomes :: for now. */
5749 if (got_scope
== std_node
)
5750 got_scope
= void_type_node
;
5754 else if (got_object
!= error_mark_node
)
5759 if (type
== error_mark_node
)
5760 return error_mark_node
;
5761 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5762 type
= TREE_TYPE (type
);
5765 type
= complete_type (type
);
5767 if (TREE_CODE (type
) == VOID_TYPE
)
5768 type
= global_namespace
;
5769 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5771 struct tree_binding b
;
5772 val
= binding_init (&b
);
5773 flags
|= LOOKUP_COMPLAIN
;
5774 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5776 val
= select_decl (val
, flags
);
5778 else if (! IS_AGGR_TYPE (type
)
5779 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5780 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5781 || TREE_CODE (type
) == TYPENAME_TYPE
)
5782 /* Someone else will give an error about this if needed. */
5784 else if (type
== current_class_type
)
5785 val
= IDENTIFIER_CLASS_VALUE (name
);
5787 val
= lookup_member (type
, name
, 0, prefer_type
);
5794 else if (got_object
&& val
)
5799 flags
= lookup_flags (prefer_type
, namespaces_only
);
5800 /* If we're not parsing, we need to complain. */
5801 flags
|= LOOKUP_COMPLAIN
;
5804 /* First, look in non-namespace scopes. */
5806 if (current_class_type
== NULL_TREE
)
5809 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5813 if (!LOCAL_BINDING_P (t
) && nonclass
)
5814 /* We're not looking for class-scoped bindings, so keep going. */
5817 /* If this is the kind of thing we're looking for, we're done. */
5818 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5819 binding
= BINDING_VALUE (t
);
5820 else if ((flags
& LOOKUP_PREFER_TYPES
)
5821 && qualify_lookup (BINDING_TYPE (t
), flags
))
5822 binding
= BINDING_TYPE (t
);
5824 binding
= NULL_TREE
;
5827 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5829 if (val_is_implicit_typename
&& !yylex
)
5830 warn_about_implicit_typename_lookup (val
, binding
);
5832 val_is_implicit_typename
5833 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5834 if (!val_is_implicit_typename
)
5839 /* Now lookup in namespace scopes. */
5840 if (!val
|| val_is_implicit_typename
)
5842 t
= unqualified_namespace_lookup (name
, flags
, 0);
5845 if (val_is_implicit_typename
&& !yylex
)
5846 warn_about_implicit_typename_lookup (val
, t
);
5854 /* This should only warn about types used in qualified-ids. */
5855 if (from_obj
&& from_obj
!= val
)
5857 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5858 && TREE_CODE (val
) == TYPE_DECL
5859 && TREE_TYPE (from_obj
) != TREE_TYPE (val
))
5861 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5862 name
, got_object
, TREE_TYPE (from_obj
));
5863 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
5867 /* We don't change val to from_obj if got_object depends on
5868 template parms because that breaks implicit typename for
5869 destructor calls. */
5870 if (! uses_template_parms (got_object
))
5874 /* If we have a single function from a using decl, pull it out. */
5875 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5876 val
= OVL_FUNCTION (val
);
5885 lookup_name_nonclass (name
)
5888 return lookup_name_real (name
, 0, 1, 0);
5892 lookup_function_nonclass (name
, args
)
5896 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
5900 lookup_name_namespace_only (name
)
5903 /* type-or-namespace, nonclass, namespace_only */
5904 return lookup_name_real (name
, 1, 1, 1);
5908 lookup_name (name
, prefer_type
)
5912 return lookup_name_real (name
, prefer_type
, 0, 0);
5915 /* Similar to `lookup_name' but look only in the innermost non-class
5919 lookup_name_current_level (name
)
5922 struct binding_level
*b
;
5925 b
= current_binding_level
;
5926 while (b
->parm_flag
== 2)
5931 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
5933 /* extern "C" function() */
5934 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
5937 else if (IDENTIFIER_BINDING (name
)
5938 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
5942 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
5943 return IDENTIFIER_VALUE (name
);
5955 /* Like lookup_name_current_level, but for types. */
5958 lookup_type_current_level (name
)
5961 register tree t
= NULL_TREE
;
5963 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
5965 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
5966 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
5968 struct binding_level
*b
= current_binding_level
;
5971 if (purpose_member (name
, b
->type_shadowed
))
5972 return REAL_IDENTIFIER_TYPE_VALUE (name
);
5984 begin_only_namespace_names ()
5986 only_namespace_names
= 1;
5990 end_only_namespace_names ()
5992 only_namespace_names
= 0;
5995 /* Arrange for the user to get a source line number, even when the
5996 compiler is going down in flames, so that she at least has a
5997 chance of working around problems in the compiler. We used to
5998 call error(), but that let the segmentation fault continue
5999 through; now, it's much more passive by asking them to send the
6000 maintainers mail about the problem. */
6004 int sig ATTRIBUTE_UNUSED
;
6006 signal (SIGSEGV
, SIG_DFL
);
6008 signal (SIGIOT
, SIG_DFL
);
6011 signal (SIGILL
, SIG_DFL
);
6014 signal (SIGABRT
, SIG_DFL
);
6017 signal (SIGBUS
, SIG_DFL
);
6019 my_friendly_abort (0);
6023 /* Unused -- brendan 970107 */
6024 /* Array for holding types considered "built-in". These types
6025 are output in the module in which `main' is defined. */
6026 static tree
*builtin_type_tdescs_arr
;
6027 static int builtin_type_tdescs_len
, builtin_type_tdescs_max
;
6030 /* Push the declarations of builtin types into the namespace.
6031 RID_INDEX, if < RID_MAX is the index of the builtin type
6032 in the array RID_POINTERS. NAME is the name used when looking
6033 up the builtin type. TYPE is the _TYPE node for the builtin type. */
6036 record_builtin_type (rid_index
, name
, type
)
6041 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
6042 tree tdecl
= NULL_TREE
;
6044 if ((int) rid_index
< (int) RID_MAX
)
6045 rname
= ridpointers
[(int) rid_index
];
6047 tname
= get_identifier (name
);
6049 TYPE_BUILT_IN (type
) = 1;
6053 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
6054 set_identifier_type_value (tname
, NULL_TREE
);
6055 if ((int) rid_index
< (int) RID_MAX
)
6056 /* Built-in types live in the global namespace. */
6057 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
6059 if (rname
!= NULL_TREE
)
6061 if (tname
!= NULL_TREE
)
6063 set_identifier_type_value (rname
, NULL_TREE
);
6064 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
6068 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
6069 set_identifier_type_value (rname
, NULL_TREE
);
6074 /* Record one of the standard Java types.
6075 * Declare it as having the given NAME.
6076 * If SIZE > 0, it is the size of one of the integral types;
6077 * otherwise it is the negative of the size of one of the other types. */
6080 record_builtin_java_type (name
, size
)
6086 type
= make_signed_type (size
);
6087 else if (size
> -32)
6088 { /* "__java_char" or ""__java_boolean". */
6089 type
= make_unsigned_type (-size
);
6090 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
6093 { /* "__java_float" or ""__java_double". */
6094 type
= make_node (REAL_TYPE
);
6095 TYPE_PRECISION (type
) = - size
;
6098 record_builtin_type (RID_MAX
, name
, type
);
6099 decl
= TYPE_NAME (type
);
6101 /* Suppress generate debug symbol entries for these types,
6102 since for normal C++ they are just clutter.
6103 However, push_lang_context undoes this if extern "Java" is seen. */
6104 DECL_IGNORED_P (decl
) = 1;
6106 TYPE_FOR_JAVA (type
) = 1;
6110 /* Push a type into the namespace so that the back-ends ignore it. */
6113 record_unknown_type (type
, name
)
6117 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
6118 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
6119 DECL_IGNORED_P (decl
) = 1;
6120 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
6121 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
6122 TYPE_ALIGN (type
) = 1;
6123 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
6126 /* Push overloaded decl, in global scope, with one argument so it
6127 can be used as a callback from define_function. */
6130 push_overloaded_decl_1 (x
)
6133 push_overloaded_decl (x
, PUSH_GLOBAL
);
6140 auto_function (name
, type
, code
)
6142 enum built_in_function code
;
6144 return define_function
6145 (IDENTIFIER_POINTER (name
), type
, code
, push_overloaded_decl_1
,
6146 IDENTIFIER_POINTER (build_decl_overload (name
, TYPE_ARG_TYPES (type
),
6150 /* Create the predefined scalar types of C,
6151 and some nodes representing standard constants (0, 1, (void *)0).
6152 Initialize the global binding level.
6153 Make definitions for built-in primitive functions. */
6156 init_decl_processing ()
6159 int wchar_type_size
;
6160 tree array_domain_type
;
6162 /* Have to make these distinct before we try using them. */
6163 lang_name_cplusplus
= get_identifier ("C++");
6164 lang_name_c
= get_identifier ("C");
6165 lang_name_java
= get_identifier ("Java");
6167 /* Enter the global namespace. */
6168 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
6169 my_friendly_assert (current_lang_name
== NULL_TREE
, 375);
6170 current_lang_name
= lang_name_cplusplus
;
6171 push_namespace (get_identifier ("::"));
6172 global_namespace
= current_namespace
;
6173 current_lang_name
= NULL_TREE
;
6175 if (flag_strict_prototype
== 2)
6176 flag_strict_prototype
= pedantic
;
6177 if (! flag_permissive
&& ! pedantic
)
6178 flag_pedantic_errors
= 1;
6180 strict_prototypes_lang_c
= flag_strict_prototype
;
6183 current_lang_name
= lang_name_c
;
6185 current_function_decl
= NULL_TREE
;
6186 named_labels
= NULL_TREE
;
6187 named_label_uses
= NULL
;
6188 current_binding_level
= NULL_BINDING_LEVEL
;
6189 free_binding_level
= NULL_BINDING_LEVEL
;
6191 /* Because most segmentation signals can be traced back into user
6192 code, catch them and at least give the user a chance of working
6193 around compiler bugs. */
6194 signal (SIGSEGV
, signal_catch
);
6196 /* We will also catch aborts in the back-end through signal_catch and
6197 give the user a chance to see where the error might be, and to defeat
6198 aborts in the back-end when there have been errors previously in their
6201 signal (SIGIOT
, signal_catch
);
6204 signal (SIGILL
, signal_catch
);
6207 signal (SIGABRT
, signal_catch
);
6210 signal (SIGBUS
, signal_catch
);
6213 gcc_obstack_init (&decl_obstack
);
6215 /* Must lay these out before anything else gets laid out. */
6216 error_mark_node
= make_node (ERROR_MARK
);
6217 TREE_PERMANENT (error_mark_node
) = 1;
6218 TREE_TYPE (error_mark_node
) = error_mark_node
;
6219 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6220 TREE_TYPE (error_mark_list
) = error_mark_node
;
6222 /* Make the binding_level structure for global names. */
6224 global_binding_level
= current_binding_level
;
6225 /* The global level is the namespace level of ::. */
6226 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6227 declare_namespace_level ();
6229 this_identifier
= get_identifier (THIS_NAME
);
6230 in_charge_identifier
= get_identifier (IN_CHARGE_NAME
);
6231 ctor_identifier
= get_identifier (CTOR_NAME
);
6232 dtor_identifier
= get_identifier (DTOR_NAME
);
6233 pfn_identifier
= get_identifier (VTABLE_PFN_NAME
);
6234 index_identifier
= get_identifier (VTABLE_INDEX_NAME
);
6235 delta_identifier
= get_identifier (VTABLE_DELTA_NAME
);
6236 delta2_identifier
= get_identifier (VTABLE_DELTA2_NAME
);
6237 pfn_or_delta2_identifier
= get_identifier ("__pfn_or_delta2");
6239 /* Define `int' and `char' first so that dbx will output them first. */
6241 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
6242 record_builtin_type (RID_INT
, NULL_PTR
, integer_type_node
);
6244 /* Define `char', which is like either `signed char' or `unsigned char'
6245 but not the same as either. */
6249 ? make_signed_type (CHAR_TYPE_SIZE
)
6250 : make_unsigned_type (CHAR_TYPE_SIZE
));
6251 record_builtin_type (RID_CHAR
, "char", char_type_node
);
6253 /* `signed' is the same as `int' */
6254 record_builtin_type (RID_SIGNED
, NULL_PTR
, integer_type_node
);
6256 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
6257 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
6259 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
6260 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
6262 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
6263 record_builtin_type (RID_MAX
, "long unsigned int", long_unsigned_type_node
);
6264 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
6266 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
6267 record_builtin_type (RID_MAX
, "long long int", long_long_integer_type_node
);
6269 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
6270 record_builtin_type (RID_MAX
, "long long unsigned int",
6271 long_long_unsigned_type_node
);
6272 record_builtin_type (RID_MAX
, "long long unsigned",
6273 long_long_unsigned_type_node
);
6275 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
6276 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
6277 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
6278 record_builtin_type (RID_MAX
, "short unsigned int", short_unsigned_type_node
);
6279 record_builtin_type (RID_MAX
, "unsigned short", short_unsigned_type_node
);
6281 /* `unsigned long' is the standard type for sizeof.
6282 Note that stddef.h uses `unsigned long',
6283 and this must agree, even if long and int are the same size. */
6285 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE
))));
6288 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE
)));
6290 /* Define both `signed char' and `unsigned char'. */
6291 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
6292 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
6293 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
6294 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
6296 /* Create the widest literal types. */
6297 widest_integer_literal_type_node
= make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
6298 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6299 widest_integer_literal_type_node
));
6301 widest_unsigned_literal_type_node
= make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
6302 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6303 widest_unsigned_literal_type_node
));
6305 /* These are types that type_for_size and type_for_mode use. */
6306 intQI_type_node
= make_signed_type (GET_MODE_BITSIZE (QImode
));
6307 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intQI_type_node
));
6308 intHI_type_node
= make_signed_type (GET_MODE_BITSIZE (HImode
));
6309 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intHI_type_node
));
6310 intSI_type_node
= make_signed_type (GET_MODE_BITSIZE (SImode
));
6311 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intSI_type_node
));
6312 intDI_type_node
= make_signed_type (GET_MODE_BITSIZE (DImode
));
6313 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intDI_type_node
));
6314 #if HOST_BITS_PER_WIDE_INT >= 64
6315 intTI_type_node
= make_signed_type (GET_MODE_BITSIZE (TImode
));
6316 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__int128_t"), intTI_type_node
));
6318 unsigned_intQI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (QImode
));
6319 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intQI_type_node
));
6320 unsigned_intHI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (HImode
));
6321 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intHI_type_node
));
6322 unsigned_intSI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (SImode
));
6323 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intSI_type_node
));
6324 unsigned_intDI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (DImode
));
6325 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intDI_type_node
));
6326 #if HOST_BITS_PER_WIDE_INT >= 64
6327 unsigned_intTI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (TImode
));
6328 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__uint128_t"), unsigned_intTI_type_node
));
6331 float_type_node
= make_node (REAL_TYPE
);
6332 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
6333 record_builtin_type (RID_FLOAT
, NULL_PTR
, float_type_node
);
6334 layout_type (float_type_node
);
6336 double_type_node
= make_node (REAL_TYPE
);
6337 if (flag_short_double
)
6338 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
6340 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
6341 record_builtin_type (RID_DOUBLE
, NULL_PTR
, double_type_node
);
6342 layout_type (double_type_node
);
6344 long_double_type_node
= make_node (REAL_TYPE
);
6345 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
6346 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
6347 layout_type (long_double_type_node
);
6349 complex_integer_type_node
= make_node (COMPLEX_TYPE
);
6350 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex int"),
6351 complex_integer_type_node
));
6352 TREE_TYPE (complex_integer_type_node
) = integer_type_node
;
6353 layout_type (complex_integer_type_node
);
6355 complex_float_type_node
= make_node (COMPLEX_TYPE
);
6356 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex float"),
6357 complex_float_type_node
));
6358 TREE_TYPE (complex_float_type_node
) = float_type_node
;
6359 layout_type (complex_float_type_node
);
6361 complex_double_type_node
= make_node (COMPLEX_TYPE
);
6362 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex double"),
6363 complex_double_type_node
));
6364 TREE_TYPE (complex_double_type_node
) = double_type_node
;
6365 layout_type (complex_double_type_node
);
6367 complex_long_double_type_node
= make_node (COMPLEX_TYPE
);
6368 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
6369 complex_long_double_type_node
));
6370 TREE_TYPE (complex_long_double_type_node
) = long_double_type_node
;
6371 layout_type (complex_long_double_type_node
);
6373 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6374 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6375 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6376 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6377 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6378 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6379 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6380 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6382 integer_zero_node
= build_int_2 (0, 0);
6383 TREE_TYPE (integer_zero_node
) = integer_type_node
;
6384 integer_one_node
= build_int_2 (1, 0);
6385 TREE_TYPE (integer_one_node
) = integer_type_node
;
6386 integer_two_node
= build_int_2 (2, 0);
6387 TREE_TYPE (integer_two_node
) = integer_type_node
;
6388 integer_three_node
= build_int_2 (3, 0);
6389 TREE_TYPE (integer_three_node
) = integer_type_node
;
6391 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6392 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6393 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6394 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6395 TYPE_PRECISION (boolean_type_node
) = 1;
6396 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6397 boolean_false_node
= build_int_2 (0, 0);
6398 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6399 boolean_true_node
= build_int_2 (1, 0);
6400 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6402 /* These are needed by stor-layout.c. */
6403 size_zero_node
= size_int (0);
6404 size_one_node
= size_int (1);
6406 signed_size_zero_node
= build_int_2 (0, 0);
6407 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6409 void_type_node
= make_node (VOID_TYPE
);
6410 record_builtin_type (RID_VOID
, NULL_PTR
, void_type_node
);
6411 layout_type (void_type_node
); /* Uses integer_zero_node. */
6412 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
6413 TREE_PARMLIST (void_list_node
) = 1;
6415 null_pointer_node
= build_int_2 (0, 0);
6416 TREE_TYPE (null_pointer_node
) = build_pointer_type (void_type_node
);
6417 layout_type (TREE_TYPE (null_pointer_node
));
6419 /* Used for expressions that do nothing, but are not errors. */
6420 void_zero_node
= build_int_2 (0, 0);
6421 TREE_TYPE (void_zero_node
) = void_type_node
;
6423 string_type_node
= build_pointer_type (char_type_node
);
6424 const_string_type_node
6425 = build_pointer_type (build_qualified_type (char_type_node
,
6427 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6429 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
6432 /* Make a type to be the domain of a few array types
6433 whose domains don't really matter.
6434 200 is small enough that it always fits in size_t
6435 and large enough that it can hold most function names for the
6436 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
6437 array_domain_type
= build_index_type (build_int_2 (200, 0));
6439 /* Make a type for arrays of characters.
6440 With luck nothing will ever really depend on the length of this
6442 char_array_type_node
6443 = build_array_type (char_type_node
, array_domain_type
);
6444 /* Likewise for arrays of ints. */
6446 = build_array_type (integer_type_node
, array_domain_type
);
6448 /* This is just some anonymous class type. Nobody should ever
6449 need to look inside this envelope. */
6450 class_star_type_node
= build_pointer_type (make_lang_type (RECORD_TYPE
));
6452 if (flag_huge_objects
)
6453 delta_type_node
= long_integer_type_node
;
6455 delta_type_node
= short_integer_type_node
;
6457 default_function_type
6458 = build_function_type (integer_type_node
, NULL_TREE
);
6460 ptr_type_node
= build_pointer_type (void_type_node
);
6462 = build_pointer_type (build_qualified_type (void_type_node
,
6464 c_common_nodes_and_builtins (1, flag_no_builtin
, flag_no_nonansi_builtin
);
6467 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6469 /* C++ extensions */
6471 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6472 record_unknown_type (unknown_type_node
, "unknown type");
6474 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6475 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6477 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6479 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6481 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6482 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6484 /* This is special for C++ so functions can be overloaded. */
6486 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (WCHAR_TYPE
)));
6487 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
6488 signed_wchar_type_node
= make_signed_type (wchar_type_size
);
6489 unsigned_wchar_type_node
= make_unsigned_type (wchar_type_size
);
6491 = TREE_UNSIGNED (wchar_type_node
)
6492 ? unsigned_wchar_type_node
6493 : signed_wchar_type_node
;
6494 record_builtin_type (RID_WCHAR
, "__wchar_t", wchar_type_node
);
6496 /* Artificial declaration of wchar_t -- can be bashed */
6497 wchar_decl_node
= build_decl (TYPE_DECL
, get_identifier ("wchar_t"),
6499 pushdecl (wchar_decl_node
);
6501 /* This is for wide string constants. */
6502 wchar_array_type_node
6503 = build_array_type (wchar_type_node
, array_domain_type
);
6505 if (flag_vtable_thunks
)
6507 /* Make sure we get a unique function type, so we can give
6508 its pointer type a name. (This wins for gdb.) */
6509 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6510 TREE_TYPE (vfunc_type
) = integer_type_node
;
6511 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6512 layout_type (vfunc_type
);
6514 vtable_entry_type
= build_pointer_type (vfunc_type
);
6518 vtable_entry_type
= make_lang_type (RECORD_TYPE
);
6519 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
6521 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
6523 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_identifier
,
6525 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6528 /* Make this part of an invisible union. */
6529 fields
[3] = copy_node (fields
[2]);
6530 TREE_TYPE (fields
[3]) = delta_type_node
;
6531 DECL_NAME (fields
[3]) = delta2_identifier
;
6532 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6533 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6534 TREE_UNSIGNED (fields
[3]) = 0;
6535 TREE_CHAIN (fields
[2]) = fields
[3];
6536 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6539 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6542 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6543 layout_type (vtbl_type_node
);
6544 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6545 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6546 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6547 layout_type (vtbl_ptr_type_node
);
6548 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6550 std_node
= build_decl (NAMESPACE_DECL
,
6551 get_identifier (flag_honor_std
? "fake std":"std"),
6553 pushdecl (std_node
);
6555 global_type_node
= make_node (LANG_TYPE
);
6556 record_unknown_type (global_type_node
, "global type");
6559 current_lang_name
= lang_name_cplusplus
;
6562 tree bad_alloc_type_node
, newtype
, deltype
;
6564 push_namespace (get_identifier ("std"));
6565 bad_alloc_type_node
= xref_tag
6566 (class_type_node
, get_identifier ("bad_alloc"), 1);
6569 newtype
= build_exception_variant
6570 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6571 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6572 auto_function (ansi_opname
[(int) NEW_EXPR
], newtype
, NOT_BUILT_IN
);
6573 auto_function (ansi_opname
[(int) VEC_NEW_EXPR
], newtype
, NOT_BUILT_IN
);
6574 global_delete_fndecl
6575 = auto_function (ansi_opname
[(int) DELETE_EXPR
], deltype
, NOT_BUILT_IN
);
6576 auto_function (ansi_opname
[(int) VEC_DELETE_EXPR
], deltype
, NOT_BUILT_IN
);
6580 = define_function ("__pure_virtual", void_ftype
,
6581 NOT_BUILT_IN
, 0, 0);
6583 /* Perform other language dependent initializations. */
6584 init_class_processing ();
6585 init_init_processing ();
6586 init_search_processing ();
6588 init_rtti_processing ();
6590 if (flag_exceptions
)
6591 init_exception_processing ();
6594 flag_inline_functions
= 0;
6597 if (! supports_one_only ())
6600 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6601 declare_function_name ();
6603 /* Prepare to check format strings against argument lists. */
6604 init_function_format_info ();
6606 /* Show we use EH for cleanups. */
6607 using_eh_for_cleanups ();
6609 print_error_function
= lang_print_error_function
;
6610 lang_get_alias_set
= &c_get_alias_set
;
6611 valid_lang_attribute
= cp_valid_lang_attribute
;
6613 /* Maintain consistency. Perhaps we should just complain if they
6614 say -fwritable-strings? */
6615 if (flag_writable_strings
)
6616 flag_const_strings
= 0;
6619 /* Function to print any language-specific context for an error message. */
6622 lang_print_error_function (file
)
6625 default_print_error_function (file
);
6626 maybe_print_template_context ();
6629 /* Make a definition for a builtin function named NAME and whose data type
6630 is TYPE. TYPE should be a function type with argument types.
6631 FUNCTION_CODE tells later passes how to compile calls to this function.
6632 See tree.h for its possible values.
6634 If LIBRARY_NAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6635 the name to be called if we can't opencode the function. */
6638 define_function (name
, type
, function_code
, pfn
, library_name
)
6641 enum built_in_function function_code
;
6642 void (*pfn
) PROTO((tree
));
6643 const char *library_name
;
6645 tree decl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), type
);
6646 DECL_EXTERNAL (decl
) = 1;
6647 TREE_PUBLIC (decl
) = 1;
6648 DECL_ARTIFICIAL (decl
) = 1;
6650 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6651 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
6653 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6654 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6655 function in the namespace. */
6656 if (pfn
) (*pfn
) (decl
);
6658 DECL_ASSEMBLER_NAME (decl
) = get_identifier (library_name
);
6659 make_function_rtl (decl
);
6660 if (function_code
!= NOT_BUILT_IN
)
6662 DECL_BUILT_IN (decl
) = 1;
6663 DECL_FUNCTION_CODE (decl
) = function_code
;
6669 builtin_function (name
, type
, code
, libname
)
6672 enum built_in_function code
;
6673 const char *libname
;
6675 return define_function (name
, type
, code
, (void (*) PROTO((tree
)))pushdecl
, libname
);
6678 /* When we call finish_struct for an anonymous union, we create
6679 default copy constructors and such. But, an anonymous union
6680 shouldn't have such things; this function undoes the damage to the
6681 anonymous union type T.
6683 (The reason that we create the synthesized methods is that we don't
6684 distinguish `union { int i; }' from `typedef union { int i; } U'.
6685 The first is an anonymous union; the second is just an ordinary
6689 fixup_anonymous_aggr (t
)
6694 /* Wipe out memory of synthesized methods */
6695 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6696 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6697 TYPE_HAS_INIT_REF (t
) = 0;
6698 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6699 TYPE_HAS_ASSIGN_REF (t
) = 0;
6700 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6702 /* Splice the implicitly generated functions out of the TYPE_METHODS
6704 q
= &TYPE_METHODS (t
);
6707 if (DECL_ARTIFICIAL (*q
))
6708 *q
= TREE_CHAIN (*q
);
6710 q
= &TREE_CHAIN (*q
);
6713 /* ANSI C++ June 5 1992 WP 9.5.3. Anonymous unions may not have
6714 function members. */
6715 if (TYPE_METHODS (t
))
6716 error ("an anonymous union cannot have function members");
6719 /* Make sure that a declaration with no declarator is well-formed, i.e.
6720 just defines a tagged type or anonymous union.
6722 Returns the type defined, if any. */
6725 check_tag_decl (declspecs
)
6729 tree ob_modifier
= NULL_TREE
;
6731 register tree t
= NULL_TREE
;
6733 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6735 register tree value
= TREE_VALUE (link
);
6741 if (IS_AGGR_TYPE (value
) || TREE_CODE (value
) == ENUMERAL_TYPE
)
6743 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6747 else if (value
== ridpointers
[(int) RID_FRIEND
])
6749 if (current_class_type
== NULL_TREE
6750 || current_scope () != current_class_type
)
6751 ob_modifier
= value
;
6753 else if (value
== ridpointers
[(int) RID_STATIC
]
6754 || value
== ridpointers
[(int) RID_EXTERN
]
6755 || value
== ridpointers
[(int) RID_AUTO
]
6756 || value
== ridpointers
[(int) RID_REGISTER
]
6757 || value
== ridpointers
[(int) RID_INLINE
]
6758 || value
== ridpointers
[(int) RID_VIRTUAL
]
6759 || value
== ridpointers
[(int) RID_CONST
]
6760 || value
== ridpointers
[(int) RID_VOLATILE
]
6761 || value
== ridpointers
[(int) RID_EXPLICIT
])
6762 ob_modifier
= value
;
6766 error ("multiple types in one declaration");
6768 /* Inside a class, we might be in a friend or access declaration.
6769 Until we have a good way of detecting the latter, don't warn. */
6770 if (t
== NULL_TREE
&& ! current_class_type
)
6771 pedwarn ("declaration does not declare anything");
6773 /* Check for an anonymous union. We're careful
6774 accessing TYPE_IDENTIFIER because some built-in types, like
6775 pointer-to-member types, do not have TYPE_NAME. */
6776 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
6778 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
6780 /* Anonymous unions are objects, so they can have specifiers. */;
6781 SET_ANON_AGGR_TYPE_P (t
);
6783 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
6784 pedwarn ("ISO C++ prohibits anonymous structs");
6787 else if (ob_modifier
)
6789 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
6790 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
6791 cp_error ("`%D' can only be specified for functions", ob_modifier
);
6792 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
6793 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
6794 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
6795 cp_error ("`%D' can only be specified for constructors",
6798 cp_error ("`%D' can only be specified for objects and functions",
6805 /* Called when a declaration is seen that contains no names to declare.
6806 If its type is a reference to a structure, union or enum inherited
6807 from a containing scope, shadow that tag name for the current scope
6808 with a forward reference.
6809 If its type defines a new named structure or union
6810 or defines an enum, it is valid but we need not do anything here.
6811 Otherwise, it is an error.
6813 C++: may have to grok the declspecs to learn about static,
6814 complain for anonymous unions. */
6817 shadow_tag (declspecs
)
6820 tree t
= check_tag_decl (declspecs
);
6823 maybe_process_partial_specialization (t
);
6825 /* This is where the variables in an anonymous union are
6826 declared. An anonymous union declaration looks like:
6828 because there is no declarator after the union, the parser
6829 sends that declaration here. */
6830 if (t
&& ANON_AGGR_TYPE_P (t
))
6832 fixup_anonymous_aggr (t
);
6834 if (TYPE_FIELDS (t
))
6836 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
6838 finish_anon_union (decl
);
6843 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6846 groktypename (typename
)
6849 if (TREE_CODE (typename
) != TREE_LIST
)
6851 return grokdeclarator (TREE_VALUE (typename
),
6852 TREE_PURPOSE (typename
),
6853 TYPENAME
, 0, NULL_TREE
);
6856 /* Decode a declarator in an ordinary declaration or data definition.
6857 This is called as soon as the type information and variable name
6858 have been parsed, before parsing the initializer if any.
6859 Here we create the ..._DECL node, fill in its type,
6860 and put it on the list of decls for the current context.
6861 The ..._DECL node is returned as the value.
6863 Exception: for arrays where the length is not specified,
6864 the type is left null, to be filled in by `cp_finish_decl'.
6866 Function definitions do not come here; they go to start_function
6867 instead. However, external and forward declarations of functions
6868 do go through here. Structure field declarations are done by
6869 grokfield and not through here. */
6871 /* Set this to zero to debug not using the temporary obstack
6872 to parse initializers. */
6873 int debug_temp_inits
= 1;
6876 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
6877 tree declarator
, declspecs
;
6879 tree attributes
, prefix_attributes
;
6882 register tree type
, tem
;
6884 extern int have_extern_spec
;
6885 extern int used_extern_spec
;
6889 /* See code below that used this. */
6890 int init_written
= initialized
;
6893 /* This should only be done once on the top most decl. */
6894 if (have_extern_spec
&& !used_extern_spec
)
6896 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"),
6898 used_extern_spec
= 1;
6901 if (attributes
|| prefix_attributes
)
6902 attrlist
= build_scratch_list (attributes
, prefix_attributes
);
6904 attrlist
= NULL_TREE
;
6906 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
6909 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
6912 type
= TREE_TYPE (decl
);
6914 if (type
== error_mark_node
)
6917 /* Don't lose if destructors must be executed at file-level. */
6918 if (! processing_template_decl
&& TREE_STATIC (decl
)
6919 && TYPE_NEEDS_DESTRUCTOR (complete_type (type
))
6920 && !TREE_PERMANENT (decl
))
6922 push_obstacks (&permanent_obstack
, &permanent_obstack
);
6923 decl
= copy_node (decl
);
6924 if (TREE_CODE (type
) == ARRAY_TYPE
)
6926 tree itype
= TYPE_DOMAIN (type
);
6927 if (itype
&& ! TREE_PERMANENT (itype
))
6929 itype
= build_index_type (copy_to_permanent (TYPE_MAX_VALUE (itype
)));
6930 type
= build_cplus_array_type (TREE_TYPE (type
), itype
);
6931 TREE_TYPE (decl
) = type
;
6938 = (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
6939 ? DECL_CLASS_CONTEXT (decl
)
6940 : DECL_CONTEXT (decl
);
6942 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
6943 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
6945 /* When parsing the initializer, lookup should use the object's
6947 push_decl_namespace (context
);
6950 /* We are only interested in class contexts, later. */
6951 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
6952 context
= NULL_TREE
;
6955 /* Is it valid for this decl to have an initializer at all?
6956 If not, set INITIALIZED to zero, which will indirectly
6957 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6958 switch (TREE_CODE (decl
))
6961 /* typedef foo = bar means give foo the same type as bar.
6962 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
6963 Any other case of an initialization in a TYPE_DECL is an error. */
6964 if (pedantic
|| list_length (declspecs
) > 1)
6966 cp_error ("typedef `%D' is initialized", decl
);
6972 cp_error ("function `%#D' is initialized like a variable", decl
);
6982 if (! toplevel_bindings_p ()
6983 && DECL_EXTERNAL (decl
))
6984 cp_warning ("declaration of `%#D' has `extern' and is initialized",
6986 DECL_EXTERNAL (decl
) = 0;
6987 if (toplevel_bindings_p ())
6988 TREE_STATIC (decl
) = 1;
6990 /* Tell `pushdecl' this is an initialized decl
6991 even though we don't yet have the initializer expression.
6992 Also tell `cp_finish_decl' it may store the real initializer. */
6993 DECL_INITIAL (decl
) = error_mark_node
;
6996 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
6997 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
7000 /* Set attributes here so if duplicate decl, will have proper attributes. */
7001 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
7003 if (context
&& TYPE_SIZE (complete_type (context
)) != NULL_TREE
)
7005 push_nested_class (context
, 2);
7007 if (TREE_CODE (decl
) == VAR_DECL
)
7009 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
7010 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
7011 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
7014 if (DECL_CONTEXT (field
) != context
)
7016 cp_pedwarn ("ANSI C++ does not permit `%T::%D' to be defined as `%T::%D'",
7017 DECL_CONTEXT (field
), DECL_NAME (decl
),
7018 context
, DECL_NAME (decl
));
7019 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
7021 /* Static data member are tricky; an in-class initialization
7022 still doesn't provide a definition, so the in-class
7023 declaration will have DECL_EXTERNAL set, but will have an
7024 initialization. Thus, duplicate_decls won't warn
7025 about this situation, and so we check here. */
7026 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
7027 cp_error ("duplicate initialization of %D", decl
);
7028 if (duplicate_decls (decl
, field
))
7034 tree field
= check_classfn (context
, decl
);
7035 if (field
&& duplicate_decls (decl
, field
))
7039 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
7040 DECL_IN_AGGR_P (decl
) = 0;
7041 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
7042 || CLASSTYPE_USE_TEMPLATE (context
))
7044 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
7045 /* [temp.expl.spec] An explicit specialization of a static data
7046 member of a template is a definition if the declaration
7047 includes an initializer; otherwise, it is a declaration.
7049 We check for processing_specialization so this only applies
7050 to the new specialization syntax. */
7051 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
7052 DECL_EXTERNAL (decl
) = 1;
7055 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
7056 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
7060 /* Enter this declaration into the symbol table. */
7061 tem
= maybe_push_decl (decl
);
7063 if (processing_template_decl
)
7065 if (at_function_scope_p ())
7066 push_permanent_obstack ();
7068 tem
= push_template_decl (tem
);
7069 /* In a a local scope, add a representation of this declaration
7070 to the statement tree. */
7071 if (at_function_scope_p ())
7073 add_decl_stmt (decl
);
7079 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7080 /* Tell the back-end to use or not use .common as appropriate. If we say
7081 -fconserve-space, we want this to save .data space, at the expense of
7082 wrong semantics. If we say -fno-conserve-space, we want this to
7083 produce errors about redefs; to do this we force variables into the
7085 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
7088 if (! processing_template_decl
)
7091 /* Corresponding pop_obstacks is done in `cp_finish_decl'. */
7092 push_obstacks_nochange ();
7101 tree type
= TREE_TYPE (decl
);
7102 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
7104 if (type
== error_mark_node
)
7107 /* If this type of object needs a cleanup, and control may
7108 jump past it, make a new binding level so that it is cleaned
7109 up only when it is initialized first. */
7110 if (TYPE_NEEDS_DESTRUCTOR (type
)
7111 && current_binding_level
->more_cleanups_ok
== 0)
7112 pushlevel_temporary (1);
7115 /* Is it valid for this decl to have an initializer at all?
7116 If not, set INITIALIZED to zero, which will indirectly
7117 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7119 /* Don't allow initializations for incomplete types except for
7120 arrays which might be completed by the initialization. */
7121 if (TYPE_SIZE (complete_type (type
)) != NULL_TREE
)
7122 ; /* A complete type is ok. */
7123 else if (TREE_CODE (type
) != ARRAY_TYPE
)
7125 cp_error ("variable `%#D' has initializer but incomplete type",
7128 type
= TREE_TYPE (decl
) = error_mark_node
;
7130 else if (TYPE_SIZE (complete_type (TREE_TYPE (type
))) == NULL_TREE
)
7132 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
7133 cp_error ("elements of array `%#D' have incomplete type", decl
);
7134 /* else we already gave an error in start_decl. */
7140 && TREE_CODE (decl
) != TYPE_DECL
7141 && TREE_CODE (decl
) != TEMPLATE_DECL
7142 && IS_AGGR_TYPE (type
) && ! DECL_EXTERNAL (decl
))
7144 if ((! processing_template_decl
|| ! uses_template_parms (type
))
7145 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
7147 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
7149 /* Change the type so that assemble_variable will give
7150 DECL an rtl we can live with: (mem (const_int 0)). */
7151 type
= TREE_TYPE (decl
) = error_mark_node
;
7155 /* If any base type in the hierarchy of TYPE needs a constructor,
7156 then we set initialized to 1. This way any nodes which are
7157 created for the purposes of initializing this aggregate
7158 will live as long as it does. This is necessary for global
7159 aggregates which do not have their initializers processed until
7160 the end of the file. */
7161 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
7166 DECL_INITIAL (decl
) = NULL_TREE
;
7169 /* Handle initialization of references.
7170 These three arguments are from `cp_finish_decl', and have the
7171 same meaning here that they do there.
7173 Quotes on semantics can be found in ARM 8.4.3. */
7176 grok_reference_init (decl
, type
, init
)
7177 tree decl
, type
, init
;
7181 if (init
== NULL_TREE
)
7183 if ((DECL_LANG_SPECIFIC (decl
) == 0
7184 || DECL_IN_AGGR_P (decl
) == 0)
7185 && ! DECL_THIS_EXTERN (decl
))
7187 cp_error ("`%D' declared as reference but not initialized", decl
);
7188 if (TREE_CODE (decl
) == VAR_DECL
)
7189 SET_DECL_REFERENCE_SLOT (decl
, error_mark_node
);
7194 if (init
== error_mark_node
)
7197 if (TREE_CODE (type
) == REFERENCE_TYPE
7198 && TREE_CODE (init
) == CONSTRUCTOR
)
7200 cp_error ("ANSI C++ forbids use of initializer list to initialize reference `%D'", decl
);
7204 if (TREE_CODE (init
) == TREE_LIST
)
7205 init
= build_compound_expr (init
);
7207 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
7208 init
= convert_from_reference (init
);
7210 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
7211 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
7213 /* Note: default conversion is only called in very special cases. */
7214 init
= default_conversion (init
);
7217 tmp
= convert_to_reference
7218 (type
, init
, CONV_IMPLICIT
,
7219 LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
, decl
);
7221 if (tmp
== error_mark_node
)
7223 else if (tmp
!= NULL_TREE
)
7226 DECL_INITIAL (decl
) = save_expr (init
);
7230 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7234 /* ?? Can this be optimized in some cases to
7235 hand back the DECL_INITIAL slot?? */
7236 if (TYPE_SIZE (TREE_TYPE (type
)))
7238 init
= convert_from_reference (decl
);
7239 if (TREE_PERMANENT (decl
))
7240 init
= copy_to_permanent (init
);
7241 SET_DECL_REFERENCE_SLOT (decl
, init
);
7244 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
7246 expand_static_init (decl
, DECL_INITIAL (decl
));
7247 DECL_INITIAL (decl
) = NULL_TREE
;
7252 if (TREE_CODE (decl
) == VAR_DECL
)
7253 SET_DECL_REFERENCE_SLOT (decl
, error_mark_node
);
7257 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7258 mucking with forces it does not comprehend (i.e. initialization with a
7259 constructor). If we are at global scope and won't go into COMMON, fill
7260 it in with a dummy CONSTRUCTOR to force the variable into .data;
7261 otherwise we can use error_mark_node. */
7264 obscure_complex_init (decl
, init
)
7267 if (! flag_no_inline
&& TREE_STATIC (decl
))
7269 if (extract_init (decl
, init
))
7273 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7274 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7275 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7279 DECL_INITIAL (decl
) = error_mark_node
;
7284 /* Issue an error message if DECL is an uninitialized const variable. */
7287 check_for_uninitialized_const_var (decl
)
7290 tree type
= TREE_TYPE (decl
);
7292 /* ``Unless explicitly declared extern, a const object does not have
7293 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7295 if (TREE_CODE (decl
) == VAR_DECL
7296 && TREE_CODE (type
) != REFERENCE_TYPE
7297 && CP_TYPE_CONST_P (type
)
7298 && !TYPE_NEEDS_CONSTRUCTING (type
)
7299 && !DECL_INITIAL (decl
))
7300 cp_error ("uninitialized const `%D'", decl
);
7303 /* Finish processing of a declaration;
7304 install its line number and initial value.
7305 If the length of an array type is not known before,
7306 it must be determined now, from the initial value, or it is an error.
7308 Call `pop_obstacks' iff NEED_POP is nonzero.
7310 For C++, `cp_finish_decl' must be fairly evasive: it must keep initializers
7311 for aggregates that have constructors alive on the permanent obstack,
7312 so that the global initializing functions can be written at the end.
7314 INIT0 holds the value of an initializer that should be allowed to escape
7317 FLAGS is LOOKUP_ONLYCONVERTING is the = init syntax was used, else 0
7318 if the (init) syntax was used.
7320 For functions that take default parameters, DECL points to its
7321 "maximal" instantiation. `cp_finish_decl' must then also declared its
7322 subsequently lower and lower forms of instantiation, checking for
7323 ambiguity as it goes. This can be sped up later. */
7326 cp_finish_decl (decl
, init
, asmspec_tree
, need_pop
, flags
)
7333 tree cleanup
= NULL_TREE
, ttype
= NULL_TREE
;
7335 int temporary
= allocation_temporary_p ();
7336 const char *asmspec
= NULL
;
7337 int was_readonly
= 0;
7338 int already_used
= 0;
7341 /* If this is 0, then we did not change obstacks. */
7345 error ("assignment (not initialization) in declaration");
7349 /* If a name was specified, get the string. */
7351 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
7353 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
7355 cp_error ("Cannot initialize `%D' to namespace `%D'",
7360 if (current_class_type
7361 && DECL_REAL_CONTEXT (decl
) == current_class_type
7362 && TYPE_BEING_DEFINED (current_class_type
)
7363 && (DECL_INITIAL (decl
) || init
))
7364 DECL_DEFINED_IN_CLASS_P (decl
) = 1;
7366 if (TREE_CODE (decl
) == VAR_DECL
7367 && DECL_CONTEXT (decl
)
7368 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7369 && DECL_CONTEXT (decl
) != current_namespace
7372 /* Leave the namespace of the object. */
7373 pop_decl_namespace ();
7376 /* If the type of the thing we are declaring either has
7377 a constructor, or has a virtual function table pointer,
7378 AND its initialization was accepted by `start_decl',
7379 then we stayed on the permanent obstack through the
7380 declaration, otherwise, changed obstacks as GCC would. */
7382 type
= TREE_TYPE (decl
);
7384 if (type
== error_mark_node
)
7386 if (toplevel_bindings_p () && temporary
)
7387 end_temporary_allocation ();
7392 if (TYPE_HAS_MUTABLE_P (type
))
7393 TREE_READONLY (decl
) = 0;
7395 if (processing_template_decl
)
7397 if (init
&& DECL_INITIAL (decl
))
7398 DECL_INITIAL (decl
) = copy_to_permanent (init
);
7402 /* Take care of TYPE_DECLs up front. */
7403 if (TREE_CODE (decl
) == TYPE_DECL
)
7405 if (init
&& DECL_INITIAL (decl
))
7407 /* typedef foo = bar; store the type of bar as the type of foo. */
7408 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
7409 DECL_INITIAL (decl
) = init
= NULL_TREE
;
7411 if (type
!= error_mark_node
7412 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
7414 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
7415 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
7416 set_identifier_type_value (DECL_NAME (decl
), type
);
7417 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
7419 GNU_xref_decl (current_function_decl
, decl
);
7421 /* If we have installed this as the canonical typedef for this
7422 type, and that type has not been defined yet, delay emitting
7423 the debug information for it, as we will emit it later. */
7424 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
7425 && TYPE_SIZE (TREE_TYPE (decl
)) == NULL_TREE
)
7426 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
7428 rest_of_decl_compilation (decl
, NULL_PTR
,
7429 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
7433 if (TREE_CODE (decl
) != FUNCTION_DECL
)
7434 ttype
= target_type (type
);
7436 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
7437 && TYPE_NEEDS_CONSTRUCTING (type
))
7439 /* Currently, GNU C++ puts constants in text space, making them
7440 impossible to initialize. In the future, one would hope for
7441 an operating system which understood the difference between
7442 initialization and the running of a program. */
7444 TREE_READONLY (decl
) = 0;
7447 if (TREE_CODE (decl
) == FIELD_DECL
)
7449 if (init
&& init
!= error_mark_node
)
7450 my_friendly_assert (TREE_PERMANENT (init
), 147);
7454 /* This must override the asm specifier which was placed
7455 by grokclassfn. Lay this out fresh. */
7456 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
7457 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7458 make_decl_rtl (decl
, asmspec
, 0);
7461 /* If `start_decl' didn't like having an initialization, ignore it now. */
7462 else if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7464 else if (DECL_EXTERNAL (decl
))
7466 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
7468 if (TREE_STATIC (decl
))
7469 make_decl_rtl (decl
, NULL_PTR
, toplevel_bindings_p ());
7470 grok_reference_init (decl
, type
, init
);
7474 /* Check for certain invalid initializations. */
7477 if (TYPE_SIZE (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7479 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7482 if (TREE_CODE (type
) == ARRAY_TYPE
7483 && !TYPE_SIZE (complete_type (TREE_TYPE (type
))))
7485 cp_error ("elements of array `%#D' have incomplete type", decl
);
7490 GNU_xref_decl (current_function_decl
, decl
);
7493 while (TREE_CODE (core_type
) == ARRAY_TYPE
)
7494 core_type
= TREE_TYPE (core_type
);
7496 if (TREE_CODE (decl
) == FIELD_DECL
)
7498 else if (TREE_CODE (decl
) == CONST_DECL
)
7500 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7502 DECL_INITIAL (decl
) = init
;
7504 /* This will keep us from needing to worry about our obstacks. */
7505 my_friendly_assert (init
!= NULL_TREE
, 149);
7510 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7512 if (TREE_CODE (type
) == ARRAY_TYPE
)
7513 init
= digest_init (type
, init
, (tree
*) 0);
7514 else if (TREE_CODE (init
) == CONSTRUCTOR
7515 && TREE_HAS_CONSTRUCTOR (init
))
7517 if (TYPE_NON_AGGREGATE_CLASS (type
))
7519 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7521 init
= error_mark_node
;
7524 goto dont_use_constructor
;
7529 dont_use_constructor
:
7530 if (TREE_CODE (init
) != TREE_VEC
)
7531 init
= store_init_value (decl
, init
);
7535 /* We must hide the initializer so that expand_decl
7536 won't try to do something it does not understand. */
7537 init
= obscure_complex_init (decl
, init
);
7539 else if (DECL_EXTERNAL (decl
))
7541 else if (TREE_CODE_CLASS (TREE_CODE (type
)) == 't'
7542 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7544 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7546 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7547 cp_error ("structure `%D' with uninitialized const members", decl
);
7548 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7549 cp_error ("structure `%D' with uninitialized reference members",
7553 check_for_uninitialized_const_var (decl
);
7555 if (TYPE_SIZE (type
) != NULL_TREE
7556 && TYPE_NEEDS_CONSTRUCTING (type
))
7557 init
= obscure_complex_init (decl
, NULL_TREE
);
7561 check_for_uninitialized_const_var (decl
);
7563 /* For top-level declaration, the initial value was read in
7564 the temporary obstack. MAXINDEX, rtl, etc. to be made below
7565 must go in the permanent obstack; but don't discard the
7566 temporary data yet. */
7568 if (toplevel_bindings_p () && temporary
)
7569 end_temporary_allocation ();
7571 /* Deduce size of array from initialization, if not already known. */
7573 if (TREE_CODE (type
) == ARRAY_TYPE
7574 && TYPE_DOMAIN (type
) == NULL_TREE
7575 && TREE_CODE (decl
) != TYPE_DECL
)
7578 = (TREE_STATIC (decl
)
7579 /* Even if pedantic, an external linkage array
7580 may have incomplete type at first. */
7581 ? pedantic
&& ! DECL_EXTERNAL (decl
)
7582 : !DECL_EXTERNAL (decl
));
7583 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7584 int failure
= complete_array_type (type
, initializer
, do_default
);
7587 cp_error ("initializer fails to determine size of `%D'", decl
);
7592 cp_error ("array size missing in `%D'", decl
);
7593 /* If a `static' var's size isn't known, make it extern as
7594 well as static, so it does not get allocated. If it's not
7595 `static', then don't mark it extern; finish_incomplete_decl
7596 will give it a default size and it will get allocated. */
7597 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7598 DECL_EXTERNAL (decl
) = 1;
7601 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7602 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7604 cp_error ("zero-size array `%D'", decl
);
7606 layout_decl (decl
, 0);
7609 if (TREE_CODE (decl
) == VAR_DECL
)
7611 if (DECL_SIZE (decl
) == NULL_TREE
7612 && TYPE_SIZE (complete_type (TREE_TYPE (decl
))) != NULL_TREE
)
7613 layout_decl (decl
, 0);
7615 if (TREE_STATIC (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7617 /* A static variable with an incomplete type:
7618 that is an error if it is initialized.
7619 Otherwise, let it through, but if it is not `extern'
7620 then it may cause an error message later. */
7621 if (DECL_INITIAL (decl
) != NULL_TREE
)
7622 cp_error ("storage size of `%D' isn't known", decl
);
7625 else if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7627 /* An automatic variable with an incomplete type: that is an error.
7628 Don't talk about array types here, since we took care of that
7629 message in grokdeclarator. */
7630 cp_error ("storage size of `%D' isn't known", decl
);
7631 TREE_TYPE (decl
) = error_mark_node
;
7633 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7634 /* Let debugger know it should output info for this type. */
7635 note_debug_info_needed (ttype
);
7637 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7638 note_debug_info_needed (DECL_CONTEXT (decl
));
7640 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7641 && DECL_SIZE (decl
) != NULL_TREE
7642 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7644 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7645 constant_expression_warning (DECL_SIZE (decl
));
7647 cp_error ("storage size of `%D' isn't constant", decl
);
7650 if (! DECL_EXTERNAL (decl
) && TYPE_NEEDS_DESTRUCTOR (type
)
7651 /* Cleanups for static variables are handled by `finish_file'. */
7652 && ! TREE_STATIC (decl
))
7654 int yes
= suspend_momentary ();
7655 cleanup
= maybe_build_cleanup (decl
);
7656 resume_momentary (yes
);
7659 /* PARM_DECLs get cleanups, too. */
7660 else if (TREE_CODE (decl
) == PARM_DECL
&& TYPE_NEEDS_DESTRUCTOR (type
))
7663 end_temporary_allocation ();
7664 cleanup
= maybe_build_cleanup (decl
);
7666 resume_temporary_allocation ();
7669 /* Output the assembler code and/or RTL code for variables and functions,
7670 unless the type is an undefined structure or union.
7671 If not, it will get done when the type is completed. */
7673 was_incomplete
= (DECL_SIZE (decl
) == NULL_TREE
);
7675 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
7676 || TREE_CODE (decl
) == RESULT_DECL
)
7678 /* ??? FIXME: What about nested classes? */
7679 int toplev
= toplevel_bindings_p ();
7681 = (TREE_STATIC (decl
) && TYPE_NEEDS_DESTRUCTOR (type
)
7682 && allocation_temporary_p ());
7685 end_temporary_allocation ();
7687 /* Static data in a function with comdat linkage also has comdat
7689 if (TREE_CODE (decl
) == VAR_DECL
7690 && TREE_STATIC (decl
)
7691 /* Don't mess with __FUNCTION__. */
7692 && ! TREE_ASM_WRITTEN (decl
)
7693 && current_function_decl
7694 && DECL_CONTEXT (decl
) == current_function_decl
7695 && (DECL_THIS_INLINE (current_function_decl
)
7696 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7697 && TREE_PUBLIC (current_function_decl
))
7699 /* Rather than try to get this right with inlining, we suppress
7700 inlining of such functions. */
7701 current_function_cannot_inline
7702 = "function with static variable cannot be inline";
7704 /* If flag_weak, we don't need to mess with this, as we can just
7705 make the function weak, and let it refer to its unique local
7706 copy. This works because we don't allow the function to be
7710 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7712 TREE_PUBLIC (decl
) = 1;
7713 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7715 else if (DECL_INITIAL (decl
) == NULL_TREE
7716 || DECL_INITIAL (decl
) == error_mark_node
)
7718 TREE_PUBLIC (decl
) = 1;
7719 DECL_COMMON (decl
) = 1;
7721 /* else we lose. We can only do this if we can use common,
7722 which we can't if it has been initialized. */
7724 if (TREE_PUBLIC (decl
))
7725 DECL_ASSEMBLER_NAME (decl
)
7726 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7727 else if (! DECL_ARTIFICIAL (decl
))
7729 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7730 cp_warning_at (" you can work around this by removing the initializer", decl
);
7735 else if (TREE_CODE (decl
) == VAR_DECL
7736 && DECL_LANG_SPECIFIC (decl
)
7737 && DECL_COMDAT (decl
))
7738 /* Set it up again; we might have set DECL_INITIAL since the
7740 comdat_linkage (decl
);
7742 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_VIRTUAL_P (decl
))
7743 make_decl_rtl (decl
, NULL_PTR
, toplev
);
7744 else if (TREE_CODE (decl
) == VAR_DECL
7745 && TREE_READONLY (decl
)
7746 && DECL_INITIAL (decl
) != NULL_TREE
7747 && DECL_INITIAL (decl
) != error_mark_node
7748 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
7750 DECL_INITIAL (decl
) = save_expr (DECL_INITIAL (decl
));
7753 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7756 && TREE_STATIC (decl
)
7757 && ! TREE_SIDE_EFFECTS (decl
)
7758 && ! TREE_PUBLIC (decl
)
7759 && ! DECL_EXTERNAL (decl
)
7760 && ! TYPE_NEEDS_DESTRUCTOR (type
)
7761 && DECL_MODE (decl
) != BLKmode
)
7763 /* If this variable is really a constant, then fill its DECL_RTL
7764 slot with something which won't take up storage.
7765 If something later should take its address, we can always give
7766 it legitimate RTL at that time. */
7767 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
7768 store_expr (DECL_INITIAL (decl
), DECL_RTL (decl
), 0);
7769 TREE_ASM_WRITTEN (decl
) = 1;
7771 else if (toplev
&& ! TREE_PUBLIC (decl
))
7773 /* If this is a static const, change its apparent linkage
7774 if it belongs to a #pragma interface. */
7775 if (!interface_unknown
)
7777 TREE_PUBLIC (decl
) = 1;
7778 DECL_EXTERNAL (decl
) = interface_only
;
7780 make_decl_rtl (decl
, asmspec
, toplev
);
7783 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7785 else if (TREE_CODE (decl
) == VAR_DECL
7786 && DECL_LANG_SPECIFIC (decl
)
7787 && DECL_IN_AGGR_P (decl
))
7789 if (TREE_STATIC (decl
))
7791 if (init
== NULL_TREE
7792 #ifdef DEFAULT_STATIC_DEFS
7793 /* If this code is dead, then users must
7794 explicitly declare static member variables
7795 outside the class def'n as well. */
7796 && TYPE_NEEDS_CONSTRUCTING (type
)
7800 DECL_EXTERNAL (decl
) = 1;
7801 make_decl_rtl (decl
, asmspec
, 1);
7804 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7807 /* Just a constant field. Should not need any rtl. */
7811 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7814 resume_temporary_allocation ();
7816 if (!abstract_virtuals_error (decl
, core_type
)
7817 && (TREE_CODE (type
) == FUNCTION_TYPE
7818 || TREE_CODE (type
) == METHOD_TYPE
))
7819 abstract_virtuals_error (decl
, TREE_TYPE (type
));
7821 if (TREE_CODE (decl
) == FUNCTION_DECL
)
7823 else if (DECL_EXTERNAL (decl
)
7824 && ! (DECL_LANG_SPECIFIC (decl
)
7825 && DECL_NOT_REALLY_EXTERN (decl
)))
7828 DECL_INITIAL (decl
) = init
;
7830 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
7832 /* Cleanups for static variables are handled by `finish_file'. */
7833 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7834 || TYPE_NEEDS_DESTRUCTOR (type
))
7835 expand_static_init (decl
, init
);
7839 /* This is a declared decl which must live until the
7840 end of the binding contour. It may need a cleanup. */
7842 /* Recompute the RTL of a local array now
7843 if it used to be an incomplete type. */
7844 if (was_incomplete
&& ! TREE_STATIC (decl
))
7846 /* If we used it already as memory, it must stay in memory. */
7847 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7848 /* If it's still incomplete now, no init will save it. */
7849 if (DECL_SIZE (decl
) == NULL_TREE
)
7850 DECL_INITIAL (decl
) = NULL_TREE
;
7853 else if (! TREE_ASM_WRITTEN (decl
)
7854 && (TYPE_SIZE (type
) != NULL_TREE
7855 || TREE_CODE (type
) == ARRAY_TYPE
))
7857 /* Do this here, because we did not expand this decl's
7858 rtl in start_decl. */
7859 if (DECL_RTL (decl
) == NULL_RTX
)
7863 /* XXX: Why don't we use decl here? */
7864 /* Ans: Because it was already expanded? */
7865 if (! expand_decl_cleanup (NULL_TREE
, cleanup
))
7866 cp_error ("parser lost in parsing declaration of `%D'",
7868 /* Cleanup used up here. */
7869 cleanup
= NULL_TREE
;
7873 if (current_binding_level
->is_for_scope
)
7875 struct binding_level
*outer
7876 = current_binding_level
->level_chain
;
7878 /* Check to see if the same name is already bound at
7879 the outer level, either because it was directly declared,
7880 or because a dead for-decl got preserved. In either case,
7881 the code would not have been valid under the ARM
7882 scope rules, so clear is_for_scope for the
7883 current_binding_level.
7885 Otherwise, we need to preserve the temp slot for decl
7886 to last into the outer binding level. */
7889 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7891 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7892 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7894 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7896 BINDING_VALUE (outer_binding
)
7897 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7898 current_binding_level
->is_for_scope
= 0;
7900 else if (DECL_IN_MEMORY_P (decl
))
7901 preserve_temp_slots (DECL_RTL (decl
));
7904 expand_start_target_temps ();
7906 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7908 /* Compute and store the initial value. */
7909 expand_decl_init (decl
);
7910 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7912 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7914 emit_line_note (DECL_SOURCE_FILE (decl
),
7915 DECL_SOURCE_LINE (decl
));
7916 /* We call push_momentary here so that when
7917 finish_expr_stmt clears the momentary obstack it
7918 doesn't destory any momentary expressions we may
7919 have lying around. Although cp_finish_decl is
7920 usually called at the end of a declaration
7921 statement, it may also be called for a temporary
7922 object in the middle of an expression. */
7924 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7928 /* Set this to 0 so we can tell whether an aggregate which
7929 was initialized was ever used. Don't do this if it has a
7930 destructor, so we don't complain about the 'resource
7931 allocation is initialization' idiom. */
7932 /* Now set attribute((unused)) on types so decls of
7933 that type will be marked used. (see TREE_USED, above.)
7934 This avoids the warning problems this particular code
7935 tried to work around. */
7937 if (TYPE_NEEDS_CONSTRUCTING (type
)
7939 && cleanup
== NULL_TREE
7940 && DECL_NAME (decl
))
7941 TREE_USED (decl
) = 0;
7944 TREE_USED (decl
) = 1;
7947 /* Cleanup any temporaries needed for the initial value. */
7948 expand_end_target_temps ();
7950 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7952 /* Store the cleanup, if there was one. */
7955 if (! expand_decl_cleanup (decl
, cleanup
))
7956 cp_error ("parser lost in parsing declaration of `%D'",
7963 /* Undo call to `pushclass' that was done in `start_decl'
7964 due to initialization of qualified member variable.
7965 I.e., Foo::x = 10; */
7967 tree context
= DECL_REAL_CONTEXT (decl
);
7969 && TREE_CODE_CLASS (TREE_CODE (context
)) == 't'
7970 && (TREE_CODE (decl
) == VAR_DECL
7971 /* We also have a pushclass done that we need to undo here
7972 if we're at top level and declare a method. */
7973 || TREE_CODE (decl
) == FUNCTION_DECL
)
7974 /* If size hasn't been set, we're still defining it,
7975 and therefore inside the class body; don't pop
7976 the binding level.. */
7977 && TYPE_SIZE (context
) != NULL_TREE
7978 && context
== current_class_type
)
7979 pop_nested_class ();
7985 /* If requested, warn about definitions of large data objects. */
7987 if (warn_larger_than
7988 && ! processing_template_decl
7989 && (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
7990 && !DECL_EXTERNAL (decl
))
7992 register tree decl_size
= DECL_SIZE (decl
);
7994 if (decl_size
&& TREE_CODE (decl_size
) == INTEGER_CST
)
7996 unsigned units
= TREE_INT_CST_LOW (decl_size
) / BITS_PER_UNIT
;
7998 if (units
> larger_than_size
)
7999 warning_with_decl (decl
, "size of `%s' is %u bytes", units
);
8005 /* Resume permanent allocation, if not within a function. */
8006 /* The corresponding push_obstacks_nochange is in start_decl,
8007 start_method, groktypename, and in grokfield. */
8012 TREE_READONLY (decl
) = 1;
8015 /* This is here for a midend callback from c-common.c */
8018 finish_decl (decl
, init
, asmspec_tree
)
8022 cp_finish_decl (decl
, init
, asmspec_tree
, 1, 0);
8026 expand_static_init (decl
, init
)
8030 tree oldstatic
= value_member (decl
, static_aggregates
);
8034 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
8035 cp_error ("multiple initializations given for `%D'", decl
);
8037 else if (! toplevel_bindings_p ())
8039 /* Emit code to perform this initialization but once. */
8044 /* Remember this information until end of file. */
8045 push_obstacks (&permanent_obstack
, &permanent_obstack
);
8047 /* Emit code to perform this initialization but once. This code
8050 static int temp = 0;
8052 // Do initialization.
8054 // Register variable for destruction at end of program.
8057 Note that the `temp' variable is only set to 1 *after* the
8058 initialization is complete. This ensures that an exception,
8059 thrown during the construction, will cause the variable to
8060 reinitialized when we pass through this code again, as per:
8064 If the initialization exits by throwing an exception, the
8065 initialization is not complete, so it will be tried again
8066 the next time control enters the declaration.
8068 In theory, this process should be thread-safe, too; multiple
8069 threads should not be able to initialize the variable more
8070 than once. We don't yet attempt to ensure thread-safety. */
8071 temp
= get_temp_name (integer_type_node
, 1);
8072 rest_of_decl_compilation (temp
, NULL_PTR
, 0, 0);
8074 /* Begin the conditional initialization. */
8075 expand_start_cond (build_binary_op (EQ_EXPR
, temp
,
8076 integer_zero_node
), 0);
8078 /* Do the initialization itself. */
8079 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
8080 || (init
&& TREE_CODE (init
) == TREE_LIST
))
8081 assignment
= build_aggr_init (decl
, init
, 0);
8083 assignment
= build_modify_expr (decl
, NOP_EXPR
, init
);
8085 assignment
= NULL_TREE
;
8087 /* Once the assignment is complete, set TEMP to 1. Since the
8088 construction of the static object is complete at this point,
8089 we want to make sure TEMP is set to 1 even if a temporary
8090 constructed during the initialization throws an exception
8091 when it is destroyed. So, we combine the initialization and
8092 the assignment to TEMP into a single expression, ensuring
8093 that when we call finish_expr_stmt the cleanups will not be
8094 run until after TEMP is set to 1. */
8095 temp_init
= build_modify_expr (temp
, NOP_EXPR
, integer_one_node
);
8098 assignment
= tree_cons (NULL_TREE
, assignment
,
8099 build_tree_list (NULL_TREE
,
8101 assignment
= build_compound_expr (assignment
);
8104 assignment
= temp_init
;
8105 finish_expr_stmt (assignment
);
8107 /* Use atexit to register a function for destroying this static
8109 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
8111 tree cleanup
, fcall
;
8112 static tree Atexit
= 0;
8113 int saved_flag_access_control
;
8117 tree atexit_fndecl
, PFV
, pfvlist
;
8118 /* Remember this information until end of file. */
8119 push_obstacks (&permanent_obstack
, &permanent_obstack
);
8120 PFV
= build_pointer_type (build_function_type
8121 (void_type_node
, void_list_node
));
8123 pfvlist
= tree_cons (NULL_TREE
, PFV
, void_list_node
);
8125 push_lang_context (lang_name_c
);
8126 /* Note that we do not call pushdecl for this function;
8127 there's no reason that this declaration should be
8128 accessible to anyone. */
8130 = define_function ("atexit",
8131 build_function_type (void_type_node
,
8136 mark_used (atexit_fndecl
);
8137 Atexit
= default_conversion (atexit_fndecl
);
8138 pop_lang_context ();
8142 /* Call build_cleanup before we enter the anonymous function
8143 so that any access checks will be done relative to the
8144 current scope, rather than the scope of the anonymous
8146 build_cleanup (decl
);
8148 /* Now start the function. */
8149 cleanup
= start_anon_func ();
8151 /* Now, recompute the cleanup. It may contain SAVE_EXPRs
8152 that refer to the original function, rather than the
8153 anonymous one. That will make the back-end think that
8154 nested functions are in use, which causes confusion. */
8155 saved_flag_access_control
= flag_access_control
;
8156 flag_access_control
= 0;
8157 fcall
= build_cleanup (decl
);
8158 flag_access_control
= saved_flag_access_control
;
8160 /* Finish off the function. */
8161 expand_expr_stmt (fcall
);
8164 /* Call atexit with the cleanup function. */
8165 mark_addressable (cleanup
);
8166 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
8167 fcall
= build_function_call (Atexit
,
8168 expr_tree_cons (NULL_TREE
,
8171 expand_expr_stmt (fcall
);
8175 /* Resume old (possibly temporary) allocation. */
8180 /* This code takes into account memory allocation policy of
8181 `start_decl'. Namely, if TYPE_NEEDS_CONSTRUCTING does not
8182 hold for this object, then we must make permanent the storage
8183 currently in the temporary obstack. */
8184 if (!TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
8185 preserve_initializer ();
8186 static_aggregates
= perm_tree_cons (init
, decl
, static_aggregates
);
8190 /* Make TYPE a complete type based on INITIAL_VALUE.
8191 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8192 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8195 complete_array_type (type
, initial_value
, do_default
)
8196 tree type
, initial_value
;
8199 register tree maxindex
= NULL_TREE
;
8202 /* Allocate on the same obstack as TYPE. */
8203 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
8207 /* Note MAXINDEX is really the maximum index,
8208 one less than the size. */
8209 if (TREE_CODE (initial_value
) == STRING_CST
)
8212 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8213 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8216 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8218 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8219 maxindex
= size_binop (MINUS_EXPR
, integer_zero_node
, size_one_node
);
8220 for (; elts
; elts
= TREE_CHAIN (elts
))
8222 if (TREE_PURPOSE (elts
))
8223 maxindex
= TREE_PURPOSE (elts
);
8225 maxindex
= size_binop (PLUS_EXPR
, maxindex
, size_one_node
);
8227 maxindex
= copy_node (maxindex
);
8231 /* Make an error message unless that happened already. */
8232 if (initial_value
!= error_mark_node
)
8235 initial_value
= NULL_TREE
;
8237 /* Prevent further error messages. */
8238 maxindex
= build_int_2 (0, 0);
8245 maxindex
= build_int_2 (0, 0);
8254 domain
= build_index_type (maxindex
);
8255 TYPE_DOMAIN (type
) = domain
;
8257 if (! TREE_TYPE (maxindex
))
8258 TREE_TYPE (maxindex
) = domain
;
8260 itype
= TREE_TYPE (initial_value
);
8263 if (itype
&& !TYPE_DOMAIN (itype
))
8264 TYPE_DOMAIN (itype
) = domain
;
8265 /* The type of the main variant should never be used for arrays
8266 of different sizes. It should only ever be completed with the
8267 size of the array. */
8268 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8269 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8274 /* Lay out the type now that we can get the real answer. */
8281 /* Return zero if something is declared to be a member of type
8282 CTYPE when in the context of CUR_TYPE. STRING is the error
8283 message to print in that case. Otherwise, quietly return 1. */
8286 member_function_or_else (ctype
, cur_type
, string
)
8287 tree ctype
, cur_type
;
8290 if (ctype
&& ctype
!= cur_type
)
8292 error (string
, TYPE_NAME_STRING (ctype
));
8298 /* Subroutine of `grokdeclarator'. */
8300 /* Generate errors possibly applicable for a given set of specifiers.
8301 This is for ARM $7.1.2. */
8304 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8307 int virtualp
, quals
, friendp
, raises
, inlinep
;
8310 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8312 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8314 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8317 cp_error_at ("`%D' declared as a friend", object
);
8319 cp_error_at ("`%D' declared with an exception specification", object
);
8322 /* CTYPE is class type, or null if non-class.
8323 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8325 DECLARATOR is the function's name.
8326 VIRTUALP is truthvalue of whether the function is virtual or not.
8327 FLAGS are to be passed through to `grokclassfn'.
8328 QUALS are qualifiers indicating whether the function is `const'
8330 RAISES is a list of exceptions that this function can raise.
8331 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8332 not look, and -1 if we should not call `grokclassfn' at all.
8334 Returns `NULL_TREE' if something goes wrong, after issuing
8335 applicable error messages. */
8338 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8339 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8340 template_count
, in_namespace
)
8343 tree orig_declarator
;
8345 enum overload_flags flags
;
8347 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8351 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8352 int has_default_arg
= 0;
8356 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8357 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8363 type
= build_exception_variant (type
, raises
);
8366 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8367 /* Propagate volatile out from type to decl. */
8368 if (TYPE_VOLATILE (type
))
8369 TREE_THIS_VOLATILE (decl
) = 1;
8371 /* If this decl has namespace scope, set that up. */
8373 set_decl_namespace (decl
, in_namespace
, friendp
);
8374 else if (publicp
&& ! ctype
)
8375 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8377 /* `main' and builtins have implicit 'C' linkage. */
8378 if ((MAIN_NAME_P (declarator
)
8379 || (IDENTIFIER_LENGTH (declarator
) > 10
8380 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8381 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8382 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8383 && current_lang_name
== lang_name_cplusplus
8384 && ctype
== NULL_TREE
8385 /* NULL_TREE means global namespace. */
8386 && DECL_CONTEXT (decl
) == NULL_TREE
)
8387 DECL_LANGUAGE (decl
) = lang_c
;
8389 /* Should probably propagate const out from type to decl I bet (mrs). */
8392 DECL_STATIC_FUNCTION_P (decl
) = 1;
8393 DECL_CONTEXT (decl
) = ctype
;
8397 DECL_CLASS_CONTEXT (decl
) = ctype
;
8399 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8401 if (processing_template_decl
)
8402 error ("cannot declare `main' to be a template");
8404 error ("cannot declare `main' to be inline");
8406 error ("cannot declare `main' to be static");
8411 /* Members of anonymous types and local classes have no linkage; make
8413 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8414 || hack_decl_function_context (TYPE_MAIN_DECL (ctype
))))
8419 /* [basic.link]: A name with no linkage (notably, the name of a class
8420 or enumeration declared in a local scope) shall not be used to
8421 declare an entity with linkage.
8423 Only check this for public decls for now. */
8424 t
= no_linkage_check (TREE_TYPE (decl
));
8427 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8429 if (DECL_LANGUAGE (decl
) == lang_c
)
8430 /* Allow this; it's pretty common in C. */;
8432 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8436 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8441 TREE_PUBLIC (decl
) = publicp
;
8444 DECL_INTERFACE_KNOWN (decl
) = 1;
8445 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8449 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8451 DECL_EXTERNAL (decl
) = 1;
8452 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8454 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8455 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8459 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8460 grok_op_properties (decl
, virtualp
, check
< 0);
8462 if (ctype
&& hack_decl_function_context (decl
))
8463 DECL_NO_STATIC_CHAIN (decl
) = 1;
8465 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8466 if (TREE_PURPOSE (t
)
8467 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8469 has_default_arg
= 1;
8474 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8478 ("defining explicit specialization `%D' in friend declaration",
8482 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8484 /* Something like `template <class T> friend void f<T>()'. */
8485 cp_error ("template-id `%D' in declaration of primary template",
8491 /* A friend declaration of the form friend void f<>(). Record
8492 the information in the TEMPLATE_ID_EXPR. */
8493 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8494 DECL_TEMPLATE_INFO (decl
)
8495 = perm_tree_cons (TREE_OPERAND (orig_declarator
, 0),
8496 TREE_OPERAND (orig_declarator
, 1),
8499 if (has_default_arg
)
8501 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8508 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8515 if (has_default_arg
)
8516 add_defarg_fn (decl
);
8518 /* Plain overloading: will not be grok'd by grokclassfn. */
8519 if (! ctype
&& ! processing_template_decl
8520 && DECL_LANGUAGE (decl
) != lang_c
8521 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8522 set_mangled_name_for_decl (decl
);
8525 /* Make the init_value nonzero so pushdecl knows this is not
8526 tentative. error_mark_node is replaced later with the BLOCK. */
8527 DECL_INITIAL (decl
) = error_mark_node
;
8529 /* Caller will do the rest of this. */
8533 if (check
&& funcdef_flag
)
8534 DECL_INITIAL (decl
) = error_mark_node
;
8536 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8539 /* Just handle constructors here. We could do this
8540 inside the following if stmt, but I think
8541 that the code is more legible by breaking this
8542 case out. See comments below for what each of
8543 the following calls is supposed to do. */
8544 DECL_CONSTRUCTOR_P (decl
) = 1;
8546 grokclassfn (ctype
, decl
, flags
, quals
);
8548 decl
= check_explicit_specialization (orig_declarator
, decl
,
8550 2 * (funcdef_flag
!= 0) +
8551 4 * (friendp
!= 0));
8552 if (decl
== error_mark_node
)
8555 if ((! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8558 tmp
= check_classfn (ctype
, decl
);
8560 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8561 tmp
= DECL_TEMPLATE_RESULT(tmp
);
8563 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8564 cp_error ("definition of implicitly-declared `%D'", tmp
);
8565 if (tmp
&& duplicate_decls (decl
, tmp
))
8568 if (! grok_ctor_properties (ctype
, decl
))
8575 /* Function gets the ugly name, field gets the nice one.
8576 This call may change the type of the function (because
8577 of default parameters)! */
8578 if (ctype
!= NULL_TREE
)
8579 grokclassfn (ctype
, decl
, flags
, quals
);
8581 decl
= check_explicit_specialization (orig_declarator
, decl
,
8583 2 * (funcdef_flag
!= 0) +
8584 4 * (friendp
!= 0));
8585 if (decl
== error_mark_node
)
8588 if (ctype
!= NULL_TREE
8589 && (! 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_STATIC_FUNCTION_P (tmp
)
8598 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8600 /* Remove the `this' parm added by grokclassfn.
8601 XXX Isn't this done in start_function, too? */
8602 revert_static_member_fn (&decl
, NULL
, NULL
);
8603 last_function_parms
= TREE_CHAIN (last_function_parms
);
8605 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8606 cp_error ("definition of implicitly-declared `%D'", tmp
);
8609 /* Attempt to merge the declarations. This can fail, in
8610 the case of some illegal specialization declarations. */
8611 if (!duplicate_decls (decl
, tmp
))
8612 cp_error ("no `%#D' member function declared in class `%T'",
8618 if (ctype
== NULL_TREE
|| check
)
8623 DECL_VIRTUAL_P (decl
) = 1;
8624 if (DECL_VINDEX (decl
) == NULL_TREE
)
8625 DECL_VINDEX (decl
) = error_mark_node
;
8626 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
8633 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
8636 RID_BIT_TYPE
*specbits_in
;
8642 RID_BIT_TYPE specbits
;
8644 specbits
= *specbits_in
;
8646 if (TREE_CODE (type
) == OFFSET_TYPE
)
8648 /* If you declare a static member so that it
8649 can be initialized, the code will reach here. */
8650 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
8651 type
= TREE_TYPE (type
);
8652 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8653 DECL_CONTEXT (decl
) = basetype
;
8654 DECL_CLASS_CONTEXT (decl
) = basetype
;
8655 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
, declarator
);
8662 context
= in_namespace
;
8663 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
8664 context
= current_namespace
;
8666 context
= NULL_TREE
;
8668 if (processing_template_decl
)
8670 /* If we're in a template, we need DECL_LANG_SPECIFIC so that
8671 we can call push_template_decl. */
8672 push_permanent_obstack ();
8673 decl
= build_lang_decl (VAR_DECL
, declarator
,
8674 complete_type (type
));
8678 decl
= build_decl (VAR_DECL
, declarator
, complete_type (type
));
8681 set_decl_namespace (decl
, context
, 0);
8683 context
= DECL_CONTEXT (decl
);
8684 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
8685 DECL_ASSEMBLER_NAME (decl
) = build_static_name (context
, declarator
);
8689 set_decl_namespace (decl
, in_namespace
, 0);
8691 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
8693 DECL_THIS_EXTERN (decl
) = 1;
8694 DECL_EXTERNAL (decl
) = !initialized
;
8697 /* In class context, static means one per class,
8698 public access, and static storage. */
8699 if (DECL_CLASS_SCOPE_P (decl
))
8701 TREE_PUBLIC (decl
) = 1;
8702 TREE_STATIC (decl
) = 1;
8703 DECL_EXTERNAL (decl
) = 0;
8705 /* At top level, either `static' or no s.c. makes a definition
8706 (perhaps tentative), and absence of `static' makes it public. */
8707 else if (toplevel_bindings_p ())
8709 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
8710 && (DECL_THIS_EXTERN (decl
) || ! constp
));
8711 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
8713 /* Not at top level, only `static' makes a static definition. */
8716 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
8717 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
8720 if (TREE_PUBLIC (decl
))
8722 /* [basic.link]: A name with no linkage (notably, the name of a class
8723 or enumeration declared in a local scope) shall not be used to
8724 declare an entity with linkage.
8726 Only check this for public decls for now. */
8727 tree t
= no_linkage_check (TREE_TYPE (decl
));
8730 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8731 /* Ignore for now; `enum { foo } e' is pretty common. */;
8733 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
8741 /* Create and return a canonical pointer to member function type, for
8742 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
8745 build_ptrmemfunc_type (type
)
8751 tree unqualified_variant
= NULL_TREE
;
8753 /* If a canonical type already exists for this type, use it. We use
8754 this method instead of type_hash_canon, because it only does a
8755 simple equality check on the list of field members. */
8757 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
8760 /* Make sure that we always have the unqualified pointer-to-member
8762 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8764 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
8766 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
8768 u
= make_lang_type (UNION_TYPE
);
8769 SET_IS_AGGR_TYPE (u
, 0);
8770 fields
[0] = build_lang_decl (FIELD_DECL
, pfn_identifier
, type
);
8771 fields
[1] = build_lang_decl (FIELD_DECL
, delta2_identifier
,
8773 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
8774 TYPE_NAME (u
) = NULL_TREE
;
8776 t
= make_lang_type (RECORD_TYPE
);
8778 /* Let the front-end know this is a pointer to member function... */
8779 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
8780 /* ... and not really an aggregate. */
8781 SET_IS_AGGR_TYPE (t
, 0);
8783 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
8785 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
8787 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
8788 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
8792 /* Zap out the name so that the back-end will give us the debugging
8793 information for this anonymous RECORD_TYPE. */
8794 TYPE_NAME (t
) = NULL_TREE
;
8796 /* If this is not the unqualified form of this pointer-to-member
8797 type, set the TYPE_MAIN_VARIANT for this type to be the
8798 unqualified type. Since they are actually RECORD_TYPEs that are
8799 not variants of each other, we must do this manually. */
8800 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8802 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
8803 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
8804 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
8805 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
8808 /* Cache this pointer-to-member type so that we can find it again
8810 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
8812 /* Seems to be wanted. */
8813 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
8818 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
8819 Check to see that the definition is valid. Issue appropriate error
8820 messages. Return 1 if the definition is particularly bad, or 0
8824 check_static_variable_definition (decl
, type
)
8828 /* Motion 10 at San Diego: If a static const integral data member is
8829 initialized with an integral constant expression, the initializer
8830 may appear either in the declaration (within the class), or in
8831 the definition, but not both. If it appears in the class, the
8832 member is a member constant. The file-scope definition is always
8834 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
8836 cp_error ("in-class initialization of static data member of non-integral type `%T'",
8838 /* If we just return the declaration, crashes will sometimes
8839 occur. We therefore return void_type_node, as if this was a
8840 friend declaration, to cause callers to completely ignore
8841 this declaration. */
8844 else if (!CP_TYPE_CONST_P (type
))
8845 cp_error ("ANSI C++ forbids in-class initialization of non-const static member `%D'",
8847 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
8848 cp_pedwarn ("ANSI C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
8853 /* Given declspecs and a declarator,
8854 determine the name and type of the object declared
8855 and construct a ..._DECL node for it.
8856 (In one case we can return a ..._TYPE node instead.
8857 For invalid input we sometimes return 0.)
8859 DECLSPECS is a chain of tree_list nodes whose value fields
8860 are the storage classes and type specifiers.
8862 DECL_CONTEXT says which syntactic context this declaration is in:
8863 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
8864 FUNCDEF for a function definition. Like NORMAL but a few different
8865 error messages in each case. Return value may be zero meaning
8866 this definition is too screwy to try to parse.
8867 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
8868 handle member functions (which have FIELD context).
8869 Return value may be zero meaning this definition is too screwy to
8871 PARM for a parameter declaration (either within a function prototype
8872 or before a function body). Make a PARM_DECL, or return void_type_node.
8873 CATCHPARM for a parameter declaration before a catch clause.
8874 TYPENAME if for a typename (in a cast or sizeof).
8875 Don't make a DECL node; just return the ..._TYPE node.
8876 FIELD for a struct or union field; make a FIELD_DECL.
8877 BITFIELD for a field with specified width.
8878 INITIALIZED is 1 if the decl has an initializer.
8880 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
8881 normal attributes in TREE_PURPOSE, or NULL_TREE.
8883 In the TYPENAME case, DECLARATOR is really an absolute declarator.
8884 It may also be so in the PARM case, for a prototype where the
8885 argument type is specified but not the name.
8887 This function is where the complicated C meanings of `static'
8888 and `extern' are interpreted.
8890 For C++, if there is any monkey business to do, the function which
8891 calls this one must do it, i.e., prepending instance variables,
8892 renaming overloaded function names, etc.
8894 Note that for this C++, it is an error to define a method within a class
8895 which does not belong to that class.
8897 Except in the case where SCOPE_REFs are implicitly known (such as
8898 methods within a class being redundantly qualified),
8899 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
8900 (class_name::decl_name). The caller must also deal with this.
8902 If a constructor or destructor is seen, and the context is FIELD,
8903 then the type gains the attribute TREE_HAS_x. If such a declaration
8904 is erroneous, NULL_TREE is returned.
8906 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
8907 function, these are the qualifiers to give to the `this' pointer.
8909 May return void_type_node if the declarator turned out to be a friend.
8910 See grokfield for details. */
8912 enum return_types
{ return_normal
, return_ctor
, return_dtor
, return_conversion
};
8915 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
8918 enum decl_context decl_context
;
8922 RID_BIT_TYPE specbits
;
8925 tree type
= NULL_TREE
;
8931 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
8932 int explicit_int
= 0;
8933 int explicit_char
= 0;
8934 int defaulted_int
= 0;
8935 tree typedef_decl
= NULL_TREE
;
8937 tree typedef_type
= NULL_TREE
;
8938 int funcdef_flag
= 0;
8939 enum tree_code innermost_code
= ERROR_MARK
;
8942 /* See the code below that used this. */
8943 tree decl_machine_attr
= NULL_TREE
;
8945 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
8946 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
8947 tree init
= NULL_TREE
;
8949 /* Keep track of what sort of function is being processed
8950 so that we can warn about default return values, or explicit
8951 return values which do not match prescribed defaults. */
8952 enum return_types return_type
= return_normal
;
8954 tree dname
= NULL_TREE
;
8955 tree ctype
= current_class_type
;
8956 tree ctor_return_type
= NULL_TREE
;
8957 enum overload_flags flags
= NO_SPECIAL
;
8958 tree quals
= NULL_TREE
;
8959 tree raises
= NULL_TREE
;
8960 int template_count
= 0;
8961 tree in_namespace
= NULL_TREE
;
8965 RIDBIT_RESET_ALL (specbits
);
8966 if (decl_context
== FUNCDEF
)
8967 funcdef_flag
= 1, decl_context
= NORMAL
;
8968 else if (decl_context
== MEMFUNCDEF
)
8969 funcdef_flag
= -1, decl_context
= FIELD
;
8970 else if (decl_context
== BITFIELD
)
8971 bitfield
= 1, decl_context
= FIELD
;
8973 /* Look inside a declarator for the name being declared
8974 and get it as a string, for an error message. */
8976 tree
*next
= &declarator
;
8980 while (next
&& *next
)
8983 switch (TREE_CODE (decl
))
8986 /* For attributes. */
8987 next
= &TREE_VALUE (decl
);
8992 next
= &TREE_OPERAND (decl
, 0);
8995 case BIT_NOT_EXPR
: /* For C++ destructors! */
8997 tree name
= TREE_OPERAND (decl
, 0);
8998 tree rename
= NULL_TREE
;
9000 my_friendly_assert (flags
== NO_SPECIAL
, 152);
9002 return_type
= return_dtor
;
9003 if (TREE_CODE (name
) == TYPE_DECL
)
9004 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
9005 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
9006 if (ctype
== NULL_TREE
)
9008 if (current_class_type
== NULL_TREE
)
9010 error ("destructors must be member functions");
9015 tree t
= constructor_name (current_class_name
);
9022 tree t
= constructor_name (ctype
);
9029 cp_error ("destructor `%T' must match class name `%T'",
9031 TREE_OPERAND (decl
, 0) = rename
;
9037 case ADDR_EXPR
: /* C++ reference declaration */
9042 innermost_code
= TREE_CODE (decl
);
9043 next
= &TREE_OPERAND (decl
, 0);
9047 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
9049 /* This is actually a variable declaration using
9050 constructor syntax. We need to call start_decl and
9051 cp_finish_decl so we can get the variable
9054 tree attributes
, prefix_attributes
;
9056 *next
= TREE_OPERAND (decl
, 0);
9057 init
= CALL_DECLARATOR_PARMS (decl
);
9061 attributes
= TREE_PURPOSE (attrlist
);
9062 prefix_attributes
= TREE_VALUE (attrlist
);
9066 attributes
= NULL_TREE
;
9067 prefix_attributes
= NULL_TREE
;
9070 decl
= start_decl (declarator
, declspecs
, 1,
9071 attributes
, prefix_attributes
);
9074 /* Look for __unused__ attribute */
9075 if (TREE_USED (TREE_TYPE (decl
)))
9076 TREE_USED (decl
) = 1;
9077 finish_decl (decl
, init
, NULL_TREE
);
9080 cp_error ("invalid declarator");
9083 innermost_code
= TREE_CODE (decl
);
9084 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
9085 ctype
= current_class_type
;
9087 && TREE_OPERAND (decl
, 0)
9088 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
9089 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
9090 == constructor_name_full (ctype
))
9091 || (DECL_NAME (TREE_OPERAND (decl
, 0))
9092 == constructor_name (ctype
)))))
9093 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9094 next
= &TREE_OPERAND (decl
, 0);
9096 if (ctype
!= NULL_TREE
9097 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
9098 && decl
== constructor_name (ctype
))
9100 return_type
= return_ctor
;
9101 ctor_return_type
= ctype
;
9106 case TEMPLATE_ID_EXPR
:
9108 tree fns
= TREE_OPERAND (decl
, 0);
9110 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9111 fns
= TREE_OPERAND (fns
, 0);
9114 if (TREE_CODE (dname
) == COMPONENT_REF
)
9115 dname
= TREE_OPERAND (dname
, 1);
9116 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9118 my_friendly_assert (is_overloaded_fn (dname
),
9120 dname
= DECL_NAME (get_first_fn (dname
));
9125 case IDENTIFIER_NODE
:
9126 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9133 cp_error ("declarator-id missing; using reserved word `%D'",
9135 name
= IDENTIFIER_POINTER (dname
);
9137 if (! IDENTIFIER_OPNAME_P (dname
)
9138 /* GNU/Linux headers use '__op'. Arrgh. */
9139 || (IDENTIFIER_TYPENAME_P (dname
) && ! TREE_TYPE (dname
)))
9140 name
= IDENTIFIER_POINTER (dname
);
9143 if (IDENTIFIER_TYPENAME_P (dname
))
9145 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9146 flags
= TYPENAME_FLAG
;
9147 ctor_return_type
= TREE_TYPE (dname
);
9148 return_type
= return_conversion
;
9150 name
= operator_name_string (dname
);
9157 /* Perform error checking, and decide on a ctype. */
9158 tree cname
= TREE_OPERAND (decl
, 0);
9159 if (cname
== NULL_TREE
)
9161 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9164 in_namespace
= TREE_OPERAND (decl
, 0);
9165 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9167 else if (! is_aggr_type (cname
, 1))
9168 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9169 /* Must test TREE_OPERAND (decl, 1), in case user gives
9170 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9171 else if (TREE_OPERAND (decl
, 1)
9172 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9174 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9175 || TREE_CODE (cname
) == TEMPLATE_TEMPLATE_PARM
)
9177 cp_error ("`%T::%D' is not a valid declarator", cname
,
9178 TREE_OPERAND (decl
, 1));
9179 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9180 cname
, TREE_OPERAND (decl
, 1));
9181 return void_type_node
;
9183 else if (ctype
== NULL_TREE
)
9185 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9186 TREE_OPERAND (decl
, 0) = ctype
;
9189 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9191 cp_error ("type `%T' is not derived from type `%T'",
9193 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9199 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9200 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9201 == constructor_name_full (ctype
))
9202 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9203 == constructor_name (ctype
))))
9204 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9205 next
= &TREE_OPERAND (decl
, 1);
9209 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9210 && constructor_name (ctype
) == decl
)
9212 return_type
= return_ctor
;
9213 ctor_return_type
= ctype
;
9215 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9216 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9217 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9218 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9220 return_type
= return_dtor
;
9221 ctor_return_type
= ctype
;
9223 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9224 next
= &TREE_OPERAND (decl
, 0);
9235 /* Parse error puts this typespec where
9236 a declarator should go. */
9237 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9238 if (TREE_TYPE (decl
) == current_class_type
)
9239 cp_error (" perhaps you want `%T' for a constructor",
9240 current_class_name
);
9241 dname
= DECL_NAME (decl
);
9242 name
= IDENTIFIER_POINTER (dname
);
9244 /* Avoid giving two errors for this. */
9245 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9247 declspecs
= temp_tree_cons (NULL_TREE
, integer_type_node
,
9254 cp_compiler_error ("`%D' as declarator", decl
);
9255 return 0; /* We used to do a 155 abort here. */
9262 /* A function definition's declarator must have the form of
9263 a function declarator. */
9265 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9268 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9269 && innermost_code
!= CALL_EXPR
9270 && ! (ctype
&& declspecs
== NULL_TREE
))
9272 cp_error ("declaration of `%D' as non-function", dname
);
9273 return void_type_node
;
9276 /* Anything declared one level down from the top level
9277 must be one of the parameters of a function
9278 (because the body is at least two levels down). */
9280 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9281 by not allowing C++ class definitions to specify their parameters
9282 with xdecls (must be spec.d in the parmlist).
9284 Since we now wait to push a class scope until we are sure that
9285 we are in a legitimate method context, we must set oldcname
9286 explicitly (since current_class_name is not yet alive).
9288 We also want to avoid calling this a PARM if it is in a namespace. */
9290 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
9292 struct binding_level
*b
= current_binding_level
;
9293 current_binding_level
= b
->level_chain
;
9294 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9295 decl_context
= PARM
;
9296 current_binding_level
= b
;
9299 /* Look through the decl specs and record which ones appear.
9300 Some typespecs are defined as built-in typenames.
9301 Others, the ones that are modifiers of other types,
9302 are represented by bits in SPECBITS: set the bits for
9303 the modifiers that appear. Storage class keywords are also in SPECBITS.
9305 If there is a typedef name or a type, store the type in TYPE.
9306 This includes builtin typedefs such as `int'.
9308 Set EXPLICIT_INT if the type is `int' or `char' and did not
9309 come from a user typedef.
9311 Set LONGLONG if `long' is mentioned twice.
9313 For C++, constructors and destructors have their own fast treatment. */
9315 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
9320 /* Certain parse errors slip through. For example,
9321 `int class;' is not caught by the parser. Try
9322 weakly to recover here. */
9323 if (TREE_CODE (spec
) != TREE_LIST
)
9326 id
= TREE_VALUE (spec
);
9328 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9330 if (id
== ridpointers
[(int) RID_INT
]
9331 || id
== ridpointers
[(int) RID_CHAR
]
9332 || id
== ridpointers
[(int) RID_BOOL
]
9333 || id
== ridpointers
[(int) RID_WCHAR
])
9337 if (id
== ridpointers
[(int) RID_BOOL
])
9338 error ("`bool' is now a keyword");
9340 cp_error ("extraneous `%T' ignored", id
);
9344 if (id
== ridpointers
[(int) RID_INT
])
9346 else if (id
== ridpointers
[(int) RID_CHAR
])
9348 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
9352 /* C++ aggregate types. */
9353 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
9356 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
9358 type
= IDENTIFIER_TYPE_VALUE (id
);
9362 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
9364 if (ridpointers
[i
] == id
)
9366 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
9368 if (pedantic
&& ! in_system_header
&& warn_long_long
)
9369 pedwarn ("ANSI C++ does not support `long long'");
9371 error ("`long long long' is too long for GCC");
9375 else if (RIDBIT_SETP (i
, specbits
))
9376 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
9377 RIDBIT_SET (i
, specbits
);
9382 /* C++ aggregate types. */
9383 else if (TREE_CODE (id
) == TYPE_DECL
|| TREE_CODE (id
) == TEMPLATE_DECL
)
9386 cp_error ("multiple declarations `%T' and `%T'", type
,
9390 type
= TREE_TYPE (id
);
9391 TREE_VALUE (spec
) = type
;
9396 error ("two or more data types in declaration of `%s'", name
);
9397 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9399 register tree t
= lookup_name (id
, 1);
9400 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
9401 error ("`%s' fails to be a typedef or built in type",
9402 IDENTIFIER_POINTER (id
));
9405 type
= TREE_TYPE (t
);
9407 /* See the code below that used this. */
9408 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
9413 else if (id
!= error_mark_node
)
9414 /* Can't change CLASS nodes into RECORD nodes here! */
9420 typedef_type
= type
;
9422 /* No type at all: default to `int', and set DEFAULTED_INT
9423 because it was not a user-defined typedef. */
9425 if (type
== NULL_TREE
9426 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
9427 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9428 || RIDBIT_SETP (RID_LONG
, specbits
)
9429 || RIDBIT_SETP (RID_SHORT
, specbits
)))
9431 /* These imply 'int'. */
9432 type
= integer_type_node
;
9436 if (type
== NULL_TREE
)
9439 if (return_type
== return_dtor
)
9440 type
= void_type_node
;
9441 else if (return_type
== return_ctor
)
9442 type
= build_pointer_type (ctor_return_type
);
9443 else if (return_type
== return_conversion
)
9444 type
= ctor_return_type
;
9447 /* We handle `main' specially here, because 'main () { }' is so
9448 common. With no options, it is allowed. With -Wreturn-type,
9449 it is a warning. It is only an error with -pedantic-errors. */
9450 int is_main
= (funcdef_flag
9451 && MAIN_NAME_P (dname
)
9452 && ctype
== NULL_TREE
9453 && in_namespace
== NULL_TREE
9454 && current_namespace
== global_namespace
);
9456 if (in_system_header
|| flag_ms_extensions
)
9457 /* Allow it, sigh. */;
9458 else if (pedantic
|| ! is_main
)
9459 cp_pedwarn ("ANSI C++ forbids declaration `%D' with no type",
9461 else if (warn_return_type
)
9462 cp_warning ("ANSI C++ forbids declaration `%D' with no type",
9465 type
= integer_type_node
;
9468 else if (return_type
== return_dtor
)
9470 error ("return type specification for destructor invalid");
9471 type
= void_type_node
;
9473 else if (return_type
== return_ctor
)
9475 error ("return type specification for constructor invalid");
9476 type
= build_pointer_type (ctor_return_type
);
9478 else if (return_type
== return_conversion
)
9480 if (!same_type_p (type
, ctor_return_type
))
9481 cp_error ("operator `%T' declared to return `%T'",
9482 ctor_return_type
, type
);
9484 cp_pedwarn ("return type specified for `operator %T'",
9487 type
= ctor_return_type
;
9492 /* Now process the modifiers that were specified
9493 and check for invalid combinations. */
9495 /* Long double is a special combination. */
9497 if (RIDBIT_SETP (RID_LONG
, specbits
)
9498 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
9500 RIDBIT_RESET (RID_LONG
, specbits
);
9501 type
= build_qualified_type (long_double_type_node
,
9502 CP_TYPE_QUALS (type
));
9505 /* Check all other uses of type modifiers. */
9507 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9508 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9509 || RIDBIT_SETP (RID_LONG
, specbits
)
9510 || RIDBIT_SETP (RID_SHORT
, specbits
))
9514 if (TREE_CODE (type
) == REAL_TYPE
)
9515 error ("short, signed or unsigned invalid for `%s'", name
);
9516 else if (TREE_CODE (type
) != INTEGER_TYPE
)
9517 error ("long, short, signed or unsigned invalid for `%s'", name
);
9518 else if (RIDBIT_SETP (RID_LONG
, specbits
)
9519 && RIDBIT_SETP (RID_SHORT
, specbits
))
9520 error ("long and short specified together for `%s'", name
);
9521 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9522 || RIDBIT_SETP (RID_SHORT
, specbits
))
9524 error ("long or short specified with char for `%s'", name
);
9525 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9526 || RIDBIT_SETP (RID_SHORT
, specbits
))
9527 && TREE_CODE (type
) == REAL_TYPE
)
9528 error ("long or short specified with floating type for `%s'", name
);
9529 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9530 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
9531 error ("signed and unsigned given together for `%s'", name
);
9535 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
9537 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
9539 if (flag_pedantic_errors
)
9544 /* Discard the type modifiers if they are invalid. */
9547 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
9548 RIDBIT_RESET (RID_SIGNED
, specbits
);
9549 RIDBIT_RESET (RID_LONG
, specbits
);
9550 RIDBIT_RESET (RID_SHORT
, specbits
);
9555 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
9556 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
9558 error ("complex invalid for `%s'", name
);
9559 RIDBIT_RESET (RID_COMPLEX
, specbits
);
9562 /* Decide whether an integer type is signed or not.
9563 Optionally treat bitfields as signed by default. */
9564 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9567 It is implementation-defined whether a plain (neither
9568 explicitly signed or unsigned) char, short, int, or long
9569 bit-field is signed or unsigned.
9571 Naturally, we extend this to long long as well. Note that
9572 this does not include wchar_t. */
9573 || (bitfield
&& !flag_signed_bitfields
9574 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
9575 /* A typedef for plain `int' without `signed' can be
9576 controlled just like plain `int', but a typedef for
9577 `signed int' cannot be so controlled. */
9579 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
9580 && (TREE_CODE (type
) == INTEGER_TYPE
9581 || TREE_CODE (type
) == CHAR_TYPE
)
9582 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
9585 type
= long_long_unsigned_type_node
;
9586 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9587 type
= long_unsigned_type_node
;
9588 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9589 type
= short_unsigned_type_node
;
9590 else if (type
== char_type_node
)
9591 type
= unsigned_char_type_node
;
9592 else if (typedef_decl
)
9593 type
= unsigned_type (type
);
9595 type
= unsigned_type_node
;
9597 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9598 && type
== char_type_node
)
9599 type
= signed_char_type_node
;
9601 type
= long_long_integer_type_node
;
9602 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9603 type
= long_integer_type_node
;
9604 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9605 type
= short_integer_type_node
;
9607 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
9609 /* If we just have "complex", it is equivalent to
9610 "complex double", but if any modifiers at all are specified it is
9611 the complex form of TYPE. E.g, "complex short" is
9612 "complex short int". */
9614 if (defaulted_int
&& ! longlong
9615 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
9616 || RIDBIT_SETP (RID_SHORT
, specbits
)
9617 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9618 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
9619 type
= complex_double_type_node
;
9620 else if (type
== integer_type_node
)
9621 type
= complex_integer_type_node
;
9622 else if (type
== float_type_node
)
9623 type
= complex_float_type_node
;
9624 else if (type
== double_type_node
)
9625 type
= complex_double_type_node
;
9626 else if (type
== long_double_type_node
)
9627 type
= complex_long_double_type_node
;
9629 type
= build_complex_type (type
);
9632 if (return_type
== return_conversion
9633 && (RIDBIT_SETP (RID_CONST
, specbits
)
9634 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
9635 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
9636 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
9639 /* Set CONSTP if this declaration is `const', whether by
9640 explicit specification or via a typedef.
9641 Likewise for VOLATILEP. */
9643 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
9645 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
9647 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
9648 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
9649 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
9650 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
9651 type
= cp_build_qualified_type (type
, type_quals
);
9653 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
9654 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
9655 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
9656 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
9657 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
9659 if (RIDBIT_SETP (RID_STATIC
, specbits
))
9660 staticp
= 1 + (decl_context
== FIELD
);
9662 if (virtualp
&& staticp
== 2)
9664 cp_error ("member `%D' cannot be declared both virtual and static",
9668 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
9669 RIDBIT_RESET (RID_FRIEND
, specbits
);
9671 /* $7.1.2, Function specifiers */
9672 if (friendp
&& explicitp
)
9673 error ("only declarations of constructors can be `explicit'");
9675 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
9677 if (decl_context
== PARM
)
9679 error ("non-member `%s' cannot be declared `mutable'", name
);
9680 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9682 else if (friendp
|| decl_context
== TYPENAME
)
9684 error ("non-object member `%s' cannot be declared `mutable'", name
);
9685 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9689 /* Warn if two storage classes are given. Default to `auto'. */
9691 if (RIDBIT_ANY_SET (specbits
))
9693 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
9694 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
9695 if (decl_context
== PARM
&& nclasses
> 0)
9696 error ("storage class specifiers invalid in parameter declarations");
9697 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9699 if (decl_context
== PARM
)
9700 error ("typedef declaration invalid in parameter declaration");
9703 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
9704 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
9707 /* Give error if `virtual' is used outside of class declaration. */
9709 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
9711 error ("virtual outside class declaration");
9714 if (current_class_name
== NULL_TREE
&& RIDBIT_SETP (RID_MUTABLE
, specbits
))
9716 error ("only members can be declared mutable");
9717 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9720 /* Static anonymous unions are dealt with here. */
9721 if (staticp
&& decl_context
== TYPENAME
9722 && TREE_CODE (declspecs
) == TREE_LIST
9723 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
9724 decl_context
= FIELD
;
9726 /* Warn about storage classes that are invalid for certain
9727 kinds of declarations (parameters, typenames, etc.). */
9730 error ("multiple storage classes in declaration of `%s'", name
);
9731 else if (decl_context
!= NORMAL
&& nclasses
> 0)
9733 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9734 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
9735 || RIDBIT_SETP (RID_AUTO
, specbits
)))
9737 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9739 else if (decl_context
== FIELD
9740 /* C++ allows static class elements */
9741 && RIDBIT_SETP (RID_STATIC
, specbits
))
9742 /* C++ also allows inlines and signed and unsigned elements,
9743 but in those cases we don't come in here. */
9747 if (decl_context
== FIELD
)
9749 tree tmp
= NULL_TREE
;
9750 register int op
= 0;
9754 /* Avoid trying to get an operand off an identifier node. */
9755 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
9758 tmp
= TREE_OPERAND (declarator
, 0);
9759 op
= IDENTIFIER_OPNAME_P (tmp
);
9761 error ("storage class specified for %s `%s'",
9762 op
? "member operator" : "field",
9763 op
? operator_name_string (tmp
) : name
);
9766 error (((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9767 ? "storage class specified for parameter `%s'"
9768 : "storage class specified for typename"), name
);
9769 RIDBIT_RESET (RID_REGISTER
, specbits
);
9770 RIDBIT_RESET (RID_AUTO
, specbits
);
9771 RIDBIT_RESET (RID_EXTERN
, specbits
);
9774 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
9776 if (toplevel_bindings_p ())
9778 /* It's common practice (and completely valid) to have a const
9779 be initialized and declared extern. */
9780 if (!(type_quals
& TYPE_QUAL_CONST
))
9781 warning ("`%s' initialized and declared `extern'", name
);
9784 error ("`%s' has both `extern' and initializer", name
);
9786 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
9787 && ! toplevel_bindings_p ())
9788 error ("nested function `%s' declared `extern'", name
);
9789 else if (toplevel_bindings_p ())
9791 if (RIDBIT_SETP (RID_AUTO
, specbits
))
9792 error ("top-level declaration of `%s' specifies `auto'", name
);
9795 if (nclasses
> 0 && friendp
)
9796 error ("storage class specifiers invalid in friend function declarations");
9798 /* Now figure out the structure of the declarator proper.
9799 Descend through it, creating more complex types, until we reach
9800 the declared identifier (or NULL_TREE, in an absolute declarator). */
9802 inner_attrs
= NULL_TREE
;
9805 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
9806 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
9808 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
9809 an INDIRECT_REF (for *...),
9810 a CALL_EXPR (for ...(...)),
9811 an identifier (for the name being declared)
9812 or a null pointer (for the place in an absolute declarator
9813 where the name was omitted).
9814 For the last two cases, we have just exited the loop.
9816 For C++ it could also be
9817 a SCOPE_REF (for class :: ...). In this case, we have converted
9818 sensible names to types, and those are the values we use to
9819 qualify the member name.
9820 an ADDR_EXPR (for &...),
9821 a BIT_NOT_EXPR (for destructors)
9823 At this point, TYPE is the type of elements of an array,
9824 or for a function to return, or for a pointer to point to.
9825 After this sequence of ifs, TYPE is the type of the
9826 array or function or pointer, and DECLARATOR has had its
9827 outermost layer removed. */
9829 if (type
== error_mark_node
)
9831 if (TREE_CODE (declarator
) == SCOPE_REF
)
9832 declarator
= TREE_OPERAND (declarator
, 1);
9834 declarator
= TREE_OPERAND (declarator
, 0);
9837 if (quals
!= NULL_TREE
9838 && (declarator
== NULL_TREE
9839 || TREE_CODE (declarator
) != SCOPE_REF
))
9841 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
9842 ctype
= TYPE_METHOD_BASETYPE (type
);
9843 if (ctype
!= NULL_TREE
)
9845 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
9846 ctype
= grok_method_quals (ctype
, dummy
, quals
);
9847 type
= TREE_TYPE (dummy
);
9852 /* See the comment for the TREE_LIST case, below. */
9855 else if (inner_attrs
)
9857 decl_attributes (type
, inner_attrs
, NULL_TREE
);
9858 inner_attrs
= NULL_TREE
;
9861 switch (TREE_CODE (declarator
))
9865 /* We encode a declarator with embedded attributes using
9866 a TREE_LIST. The attributes apply to the declarator
9867 directly inside them, so we have to skip an iteration
9868 before applying them to the type. If the declarator just
9869 inside is the declarator-id, we apply the attrs to the
9871 inner_attrs
= TREE_PURPOSE (declarator
);
9873 declarator
= TREE_VALUE (declarator
);
9879 register tree itype
= NULL_TREE
;
9880 register tree size
= TREE_OPERAND (declarator
, 1);
9881 /* The index is a signed object `sizetype' bits wide. */
9882 tree index_type
= signed_type (sizetype
);
9884 declarator
= TREE_OPERAND (declarator
, 0);
9886 /* Check for some types that there cannot be arrays of. */
9888 if (TREE_CODE (type
) == VOID_TYPE
)
9890 cp_error ("declaration of `%D' as array of voids", dname
);
9891 type
= error_mark_node
;
9894 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9896 cp_error ("declaration of `%D' as array of functions", dname
);
9897 type
= error_mark_node
;
9900 /* ARM $8.4.3: Since you can't have a pointer to a reference,
9901 you can't have arrays of references. If we allowed them,
9902 then we'd be saying x[i] is valid for an array x, but
9903 then you'd have to ask: what does `*(x + i)' mean? */
9904 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9906 if (decl_context
== TYPENAME
)
9907 cp_error ("cannot make arrays of references");
9909 cp_error ("declaration of `%D' as array of references",
9911 type
= error_mark_node
;
9914 if (TREE_CODE (type
) == OFFSET_TYPE
)
9916 cp_error ("declaration of `%D' as array of data members",
9918 type
= error_mark_node
;
9921 if (TREE_CODE (type
) == METHOD_TYPE
)
9923 cp_error ("declaration of `%D' as array of function members",
9925 type
= error_mark_node
;
9928 if (size
== error_mark_node
)
9929 type
= error_mark_node
;
9930 else if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9934 the constant expressions that specify the bounds of
9935 the arrays can be omitted only for the first member
9937 cp_error ("declaration of `%D' as multidimensional array",
9939 cp_error ("must have bounds for all dimensions except the first");
9940 type
= error_mark_node
;
9943 if (type
== error_mark_node
)
9946 /* VC++ spells a zero-sized array with []. */
9947 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
9948 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9949 size
= integer_zero_node
;
9953 /* Must suspend_momentary here because the index
9954 type may need to live until the end of the function.
9955 For example, it is used in the declaration of a
9956 variable which requires destructing at the end of
9957 the function; then build_vec_delete will need this
9959 int yes
= suspend_momentary ();
9960 /* Might be a cast. */
9961 if (TREE_CODE (size
) == NOP_EXPR
9962 && TREE_TYPE (size
) == TREE_TYPE (TREE_OPERAND (size
, 0)))
9963 size
= TREE_OPERAND (size
, 0);
9964 if (TREE_READONLY_DECL_P (size
))
9965 size
= decl_constant_value (size
);
9967 /* If this involves a template parameter, it will be a
9968 constant at instantiation time, but we don't know
9969 what the value is yet. Even if no template
9970 parameters are involved, we may an expression that
9971 is not a constant; we don't even simplify `1 + 2'
9972 when processing a template. */
9973 if (processing_template_decl
)
9975 /* Resolve a qualified reference to an enumerator or
9976 static const data member of ours. */
9977 if (TREE_CODE (size
) == SCOPE_REF
9978 && TREE_OPERAND (size
, 0) == current_class_type
)
9980 tree t
= lookup_field (current_class_type
,
9981 TREE_OPERAND (size
, 1), 0, 0);
9986 itype
= build_index_type (build_min
9987 (MINUS_EXPR
, sizetype
, size
, integer_one_node
));
9988 goto dont_grok_size
;
9991 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9992 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
9993 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
9995 cp_error ("size of array `%D' has non-integer type",
9997 size
= integer_one_node
;
9999 if (pedantic
&& integer_zerop (size
))
10000 cp_pedwarn ("ANSI C++ forbids zero-size array `%D'", dname
);
10001 if (TREE_CONSTANT (size
))
10003 int old_flag_pedantic_errors
= flag_pedantic_errors
;
10004 int old_pedantic
= pedantic
;
10005 pedantic
= flag_pedantic_errors
= 1;
10006 /* Always give overflow errors on array subscripts. */
10007 constant_expression_warning (size
);
10008 pedantic
= old_pedantic
;
10009 flag_pedantic_errors
= old_flag_pedantic_errors
;
10010 if (INT_CST_LT (size
, integer_zero_node
))
10012 cp_error ("size of array `%D' is negative", dname
);
10013 size
= integer_one_node
;
10021 cp_pedwarn ("ANSI C++ forbids variable-size array `%D'",
10024 cp_pedwarn ("ANSI C++ forbids variable-size array");
10029 = fold (build_binary_op (MINUS_EXPR
,
10030 cp_convert (index_type
, size
),
10031 cp_convert (index_type
,
10032 integer_one_node
)));
10033 if (! TREE_CONSTANT (itype
))
10034 itype
= variable_size (itype
);
10035 else if (TREE_OVERFLOW (itype
))
10037 error ("overflow in array dimension");
10038 TREE_OVERFLOW (itype
) = 0;
10041 /* If we're a parm, we need to have a permanent type so
10042 mangling checks for re-use will work right. If both the
10043 element and index types are permanent, the array type
10045 if (decl_context
== PARM
10046 && allocation_temporary_p () && TREE_PERMANENT (type
))
10048 push_obstacks (&permanent_obstack
, &permanent_obstack
);
10049 itype
= build_index_type (itype
);
10053 itype
= build_index_type (itype
);
10056 resume_momentary (yes
);
10059 type
= build_cplus_array_type (type
, itype
);
10068 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
10069 tree inner_decl
= TREE_OPERAND (declarator
, 0);
10071 /* Declaring a function type.
10072 Make sure we have a valid type for the function to return. */
10074 /* We now know that the TYPE_QUALS don't apply to the
10075 decl, but to its return type. */
10076 type_quals
= TYPE_UNQUALIFIED
;
10078 /* Warn about some types functions can't return. */
10080 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10082 error ("`%s' declared as function returning a function", name
);
10083 type
= integer_type_node
;
10085 if (TREE_CODE (type
) == ARRAY_TYPE
)
10087 error ("`%s' declared as function returning an array", name
);
10088 type
= integer_type_node
;
10091 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
10092 inner_decl
= TREE_OPERAND (inner_decl
, 1);
10094 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
10095 inner_decl
= dname
;
10097 /* Pick up type qualifiers which should be applied to `this'. */
10098 quals
= CALL_DECLARATOR_QUALS (declarator
);
10100 /* Pick up the exception specifications. */
10101 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
10103 /* Say it's a definition only for the CALL_EXPR
10104 closest to the identifier. */
10107 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
10108 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
10109 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
10111 if (ctype
== NULL_TREE
10112 && decl_context
== FIELD
10114 && (friendp
== 0 || dname
== current_class_name
))
10115 ctype
= current_class_type
;
10117 if (ctype
&& return_type
== return_conversion
)
10118 TYPE_HAS_CONVERSION (ctype
) = 1;
10119 if (ctype
&& constructor_name (ctype
) == dname
)
10121 /* We are within a class's scope. If our declarator name
10122 is the same as the class name, and we are defining
10123 a function, then it is a constructor/destructor, and
10124 therefore returns a void type. */
10126 if (flags
== DTOR_FLAG
)
10128 /* ANSI C++ June 5 1992 WP 12.4.1. A destructor may
10129 not be declared const or volatile. A destructor
10130 may not be static. */
10132 error ("destructor cannot be static member function");
10135 cp_error ("destructors may not be `%s'",
10136 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10139 if (decl_context
== FIELD
)
10141 if (! member_function_or_else (ctype
, current_class_type
,
10142 "destructor for alien class `%s' cannot be a member"))
10143 return void_type_node
;
10146 else /* It's a constructor. */
10148 if (explicitp
== 1)
10150 /* ANSI C++ June 5 1992 WP 12.1.2. A constructor may
10151 not be declared const or volatile. A constructor may
10152 not be virtual. A constructor may not be static. */
10154 error ("constructor cannot be static member function");
10157 pedwarn ("constructors cannot be declared virtual");
10162 cp_error ("constructors may not be `%s'",
10163 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10167 RID_BIT_TYPE tmp_bits
;
10168 bcopy ((void*)&specbits
, (void*)&tmp_bits
, sizeof (RID_BIT_TYPE
));
10169 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10170 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10171 if (RIDBIT_ANY_SET (tmp_bits
))
10172 error ("return value type specifier for constructor ignored");
10174 type
= build_pointer_type (ctype
);
10175 if (decl_context
== FIELD
)
10177 if (! member_function_or_else (ctype
, current_class_type
,
10178 "constructor for alien class `%s' cannot be member"))
10179 return void_type_node
;
10180 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10181 if (return_type
!= return_ctor
)
10185 if (decl_context
== FIELD
)
10191 error ("can't initialize friend function `%s'", name
);
10194 /* Cannot be both friend and virtual. */
10195 error ("virtual functions cannot be friends");
10196 RIDBIT_RESET (RID_FRIEND
, specbits
);
10199 if (decl_context
== NORMAL
)
10200 error ("friend declaration not in class definition");
10201 if (current_function_decl
&& funcdef_flag
)
10202 cp_error ("can't define friend function `%s' in a local class definition",
10206 /* Construct the function type and go to the next
10207 inner layer of declarator. */
10209 declarator
= TREE_OPERAND (declarator
, 0);
10211 /* FIXME: This is where default args should be fully
10214 arg_types
= grokparms (inner_parms
, funcdecl_p
? funcdef_flag
: 0);
10216 if (declarator
&& flags
== DTOR_FLAG
)
10218 /* A destructor declared in the body of a class will
10219 be represented as a BIT_NOT_EXPR. But, we just
10220 want the underlying IDENTIFIER. */
10221 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10222 declarator
= TREE_OPERAND (declarator
, 0);
10224 if (strict_prototype
== 0 && arg_types
== NULL_TREE
)
10225 arg_types
= void_list_node
;
10226 else if (arg_types
== NULL_TREE
10227 || arg_types
!= void_list_node
)
10229 cp_error ("destructors may not have parameters");
10230 arg_types
= void_list_node
;
10231 last_function_parms
= NULL_TREE
;
10235 /* ANSI says that `const int foo ();'
10236 does not make the function foo const. */
10237 type
= build_function_type (type
, arg_types
);
10241 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10242 if (TREE_PURPOSE (t
)
10243 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10245 add_defarg_fn (type
);
10254 /* Filter out pointers-to-references and references-to-references.
10255 We can get these if a TYPE_DECL is used. */
10257 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10259 error ("cannot declare %s to references",
10260 TREE_CODE (declarator
) == ADDR_EXPR
10261 ? "references" : "pointers");
10262 declarator
= TREE_OPERAND (declarator
, 0);
10266 if (TREE_CODE (type
) == OFFSET_TYPE
10267 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10268 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10270 cp_error ("cannot declare pointer to `%#T' member",
10272 type
= TREE_TYPE (type
);
10275 /* Merge any constancy or volatility into the target type
10276 for the pointer. */
10278 /* We now know that the TYPE_QUALS don't apply to the decl,
10279 but to the target of the pointer. */
10280 type_quals
= TYPE_UNQUALIFIED
;
10282 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10284 if (TREE_CODE (type
) == VOID_TYPE
)
10285 error ("invalid type: `void &'");
10287 type
= build_reference_type (type
);
10289 else if (TREE_CODE (type
) == METHOD_TYPE
)
10290 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10292 type
= build_pointer_type (type
);
10294 /* Process a list of type modifier keywords (such as
10295 const or volatile) that were given inside the `*' or `&'. */
10297 if (TREE_TYPE (declarator
))
10299 register tree typemodlist
;
10305 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10306 typemodlist
= TREE_CHAIN (typemodlist
))
10308 tree qualifier
= TREE_VALUE (typemodlist
);
10310 if (qualifier
== ridpointers
[(int) RID_CONST
])
10312 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10314 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10319 error ("invalid type modifier within pointer declarator");
10323 pedwarn ("duplicate `const'");
10325 pedwarn ("duplicate `volatile'");
10327 pedwarn ("duplicate `restrict'");
10329 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10330 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10331 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10332 if (TREE_CODE (declarator
) == ADDR_EXPR
10333 && (constp
|| volatilep
))
10336 pedwarn ("discarding `const' applied to a reference");
10338 pedwarn ("discarding `volatile' applied to a reference");
10339 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10341 type
= cp_build_qualified_type (type
, type_quals
);
10343 declarator
= TREE_OPERAND (declarator
, 0);
10349 /* We have converted type names to NULL_TREE if the
10350 name was bogus, or to a _TYPE node, if not.
10352 The variable CTYPE holds the type we will ultimately
10353 resolve to. The code here just needs to build
10354 up appropriate member types. */
10355 tree sname
= TREE_OPERAND (declarator
, 1);
10358 /* Destructors can have their visibilities changed as well. */
10359 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10360 sname
= TREE_OPERAND (sname
, 0);
10362 if (TREE_COMPLEXITY (declarator
) == 0)
10363 /* This needs to be here, in case we are called
10364 multiple times. */ ;
10365 else if (TREE_COMPLEXITY (declarator
) == -1)
10366 /* Namespace member. */
10367 pop_decl_namespace ();
10368 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10369 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10370 else if (! IS_AGGR_TYPE_CODE
10371 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10373 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10375 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10376 that refer to ctype. They couldn't be resolved earlier
10377 because we hadn't pushed into the class yet.
10378 Example: resolve 'B<T>::type' in
10379 'B<typename B<T>::type> B<T>::f () { }'. */
10380 if (current_template_parms
10381 && uses_template_parms (type
)
10382 && uses_template_parms (current_class_type
))
10384 tree args
= current_template_args ();
10385 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10388 /* This pop_nested_class corresponds to the
10389 push_nested_class used to push into class scope for
10390 parsing the argument list of a function decl, in
10392 pop_nested_class ();
10393 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10396 my_friendly_abort (16);
10398 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10400 /* We had a reference to a global decl, or
10401 perhaps we were given a non-aggregate typedef,
10402 in which case we cleared this out, and should just
10403 keep going as though it wasn't there. */
10404 declarator
= sname
;
10407 ctype
= TREE_OPERAND (declarator
, 0);
10410 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10412 if (CLASSTYPE_TEMPLATE_INFO (t
) &&
10413 !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
10414 template_count
+= 1;
10415 t
= TYPE_MAIN_DECL (t
);
10416 if (DECL_LANG_SPECIFIC (t
))
10417 t
= DECL_CLASS_CONTEXT (t
);
10422 if (sname
== NULL_TREE
)
10425 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10427 /* This is the `standard' use of the scoping operator:
10428 basetype :: member . */
10430 if (ctype
== current_class_type
)
10436 Is this ill-formed? */
10439 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10442 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10444 if (current_class_type
== NULL_TREE
10446 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10447 TYPE_ARG_TYPES (type
));
10450 cp_error ("cannot declare member function `%T::%s' within `%T'",
10451 ctype
, name
, current_class_type
);
10452 return void_type_node
;
10455 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10456 || TYPE_SIZE (complete_type (ctype
)) != NULL_TREE
)
10458 /* Have to move this code elsewhere in this function.
10459 this code is used for i.e., typedef int A::M; M *pm;
10461 It is? How? jason 10/2/94 */
10463 if (current_class_type
)
10465 cp_error ("cannot declare member `%T::%s' within `%T'",
10466 ctype
, name
, current_class_type
);
10467 return void_type_node
;
10469 type
= build_offset_type (ctype
, type
);
10471 else if (uses_template_parms (ctype
))
10473 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10475 = build_cplus_method_type (ctype
, TREE_TYPE (type
),
10476 TYPE_ARG_TYPES (type
));
10480 cp_error ("structure `%T' not yet defined", ctype
);
10481 return error_mark_node
;
10484 declarator
= sname
;
10486 else if (TREE_CODE (sname
) == SCOPE_REF
)
10487 my_friendly_abort (17);
10491 declarator
= TREE_OPERAND (declarator
, 1);
10492 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10493 /* In this case, we will deal with it later. */
10497 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10498 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10499 TYPE_ARG_TYPES (type
));
10501 type
= build_offset_type (ctype
, type
);
10508 declarator
= TREE_OPERAND (declarator
, 0);
10513 case ENUMERAL_TYPE
:
10514 declarator
= NULL_TREE
;
10518 declarator
= NULL_TREE
;
10522 my_friendly_abort (158);
10526 /* See the comment for the TREE_LIST case, above. */
10529 if (! ignore_attrs
)
10530 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10532 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
10534 attrlist
= build_decl_list (NULL_TREE
, inner_attrs
);
10537 /* Now TYPE has the actual type. */
10539 if (explicitp
== 1)
10541 error ("only constructors can be declared `explicit'");
10545 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10547 if (type_quals
& TYPE_QUAL_CONST
)
10549 error ("const `%s' cannot be declared `mutable'", name
);
10550 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10554 error ("static `%s' cannot be declared `mutable'", name
);
10555 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10559 if (declarator
== NULL_TREE
10560 || TREE_CODE (declarator
) == IDENTIFIER_NODE
10561 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
10562 && (TREE_CODE (type
) == FUNCTION_TYPE
10563 || TREE_CODE (type
) == METHOD_TYPE
)))
10565 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10567 cp_error ("template-id `%D' used as a declarator", declarator
);
10568 declarator
= dname
;
10571 /* Unexpected declarator format. */
10572 my_friendly_abort (990210);
10574 /* If this is declaring a typedef name, return a TYPE_DECL. */
10576 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
10580 /* Note that the grammar rejects storage classes
10581 in typenames, fields or parameters. */
10582 if (current_lang_name
== lang_name_java
)
10583 TYPE_FOR_JAVA (type
) = 1;
10585 if (decl_context
== FIELD
)
10587 if (declarator
== constructor_name (current_class_type
))
10588 cp_pedwarn ("ANSI C++ forbids nested type `%D' with same name as enclosing class",
10590 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10594 /* Make sure this typedef lives as long as its type,
10595 since it might be used as a template parameter. */
10596 if (type
!= error_mark_node
)
10597 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
10598 if (processing_template_decl
)
10599 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10601 decl
= build_decl (TYPE_DECL
, declarator
, type
);
10602 if (type
!= error_mark_node
)
10606 /* If the user declares "typedef struct {...} foo" then the
10607 struct will have an anonymous name. Fill that name in now.
10608 Nothing can refer to it, so nothing needs know about the name
10610 if (type
!= error_mark_node
10611 && TYPE_NAME (type
)
10612 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
10613 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
10614 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
10616 tree oldname
= TYPE_NAME (type
);
10619 /* Replace the anonymous name with the real name everywhere. */
10620 lookup_tag_reverse (type
, declarator
);
10621 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
10622 if (TYPE_NAME (t
) == oldname
)
10623 TYPE_NAME (t
) = decl
;
10625 if (TYPE_LANG_SPECIFIC (type
))
10626 TYPE_WAS_ANONYMOUS (type
) = 1;
10628 /* If this is a typedef within a template class, the nested
10629 type is a (non-primary) template. The name for the
10630 template needs updating as well. */
10631 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
10632 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
10633 = TYPE_IDENTIFIER (type
);
10635 /* XXX Temporarily set the scope.
10636 When returning, start_decl expects it as NULL_TREE,
10637 and will then then set it using pushdecl. */
10638 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
10639 if (current_class_type
)
10640 DECL_CONTEXT (decl
) = current_class_type
;
10642 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
10644 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
10645 DECL_ASSEMBLER_NAME (decl
)
10646 = get_identifier (build_overload_name (type
, 1, 1));
10647 DECL_CONTEXT (decl
) = NULL_TREE
;
10649 /* FIXME remangle member functions; member functions of a
10650 type with external linkage have external linkage. */
10653 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10655 cp_error_at ("typedef name may not be class-qualified", decl
);
10660 if (ctype
== NULL_TREE
)
10662 if (TREE_CODE (type
) != METHOD_TYPE
)
10663 cp_error_at ("invalid type qualifier for non-method type", decl
);
10665 ctype
= TYPE_METHOD_BASETYPE (type
);
10667 if (ctype
!= NULL_TREE
)
10668 grok_method_quals (ctype
, decl
, quals
);
10671 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10672 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
10673 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
10675 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10676 error ("non-object member `%s' cannot be declared mutable", name
);
10678 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
10679 inlinep
, friendp
, raises
!= NULL_TREE
);
10682 error ("typedef declaration includes an initializer");
10687 /* Detect the case of an array type of unspecified size
10688 which came, as such, direct from a typedef name.
10689 We must copy the type, so that each identifier gets
10690 a distinct type, so that each identifier's size can be
10691 controlled separately by its own initializer. */
10693 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
10694 && TYPE_DOMAIN (type
) == NULL_TREE
)
10696 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
10699 /* If this is a type name (such as, in a cast or sizeof),
10700 compute the type and return it now. */
10702 if (decl_context
== TYPENAME
)
10704 /* Note that the grammar rejects storage classes
10705 in typenames, fields or parameters. */
10706 if (type_quals
!= TYPE_UNQUALIFIED
)
10707 type_quals
= TYPE_UNQUALIFIED
;
10709 /* Special case: "friend class foo" looks like a TYPENAME context. */
10712 if (type_quals
!= TYPE_UNQUALIFIED
)
10714 cp_error ("type qualifiers specified for friend class declaration");
10715 type_quals
= TYPE_UNQUALIFIED
;
10719 cp_error ("`inline' specified for friend class declaration");
10723 /* Only try to do this stuff if we didn't already give up. */
10724 if (type
!= integer_type_node
)
10726 /* A friendly class? */
10727 if (current_class_type
)
10728 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
10730 error ("trying to make class `%s' a friend of global scope",
10731 TYPE_NAME_STRING (type
));
10732 type
= void_type_node
;
10737 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
10738 if (ctype
== NULL_TREE
)
10740 my_friendly_assert (TREE_CODE (type
) == METHOD_TYPE
, 159);
10741 ctype
= TYPE_METHOD_BASETYPE (type
);
10743 grok_method_quals (ctype
, dummy
, quals
);
10744 type
= TREE_TYPE (dummy
);
10749 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
10750 && decl_context
!= CATCHPARM
10751 && TREE_CODE (type
) != UNION_TYPE
10754 cp_error ("abstract declarator `%T' used as declaration", type
);
10755 declarator
= make_anon_name ();
10758 /* `void' at top level (not within pointer)
10759 is allowed only in typedefs or type names.
10760 We don't complain about parms either, but that is because
10761 a better error message can be made later. */
10763 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
10766 error ("unnamed variable or field declared void");
10767 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10769 if (IDENTIFIER_OPNAME_P (declarator
))
10770 my_friendly_abort (356);
10772 error ("variable or field `%s' declared void", name
);
10775 error ("variable or field declared void");
10776 type
= integer_type_node
;
10779 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
10780 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
10782 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10784 if (ctype
|| in_namespace
)
10785 error ("cannot use `::' in parameter declaration");
10787 /* A parameter declared as an array of T is really a pointer to T.
10788 One declared as a function is really a pointer to a function.
10789 One declared as a member is really a pointer to member. */
10791 if (TREE_CODE (type
) == ARRAY_TYPE
)
10793 /* Transfer const-ness of array into that of type pointed to. */
10794 type
= build_pointer_type (TREE_TYPE (type
));
10795 type_quals
= TYPE_UNQUALIFIED
;
10797 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10798 type
= build_pointer_type (type
);
10799 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10800 type
= build_pointer_type (type
);
10801 else if (TREE_CODE (type
) == VOID_TYPE
&& declarator
)
10803 error ("declaration of `%s' as void", name
);
10809 register tree decl
;
10811 if (decl_context
== PARM
)
10813 decl
= build_decl (PARM_DECL
, declarator
, type
);
10815 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
10816 inlinep
, friendp
, raises
!= NULL_TREE
);
10818 /* Compute the type actually passed in the parmlist,
10819 for the case where there is no prototype.
10820 (For example, shorts and chars are passed as ints.)
10821 When there is a prototype, this is overridden later. */
10823 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
10825 else if (decl_context
== FIELD
)
10827 if (type
== error_mark_node
)
10829 /* Happens when declaring arrays of sizes which
10830 are error_mark_node, for example. */
10833 else if (in_namespace
&& !friendp
)
10835 /* Something like struct S { int N::j; }; */
10836 cp_error ("invalid use of `::'");
10839 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10842 tree function_context
;
10844 /* We catch the others as conflicts with the builtin
10846 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
10848 cp_error ("function `%D' cannot be declared friend",
10855 if (ctype
== NULL_TREE
)
10856 ctype
= current_class_type
;
10858 if (ctype
== NULL_TREE
)
10860 cp_error ("can't make `%D' into a method -- not in a class",
10862 return void_type_node
;
10865 /* ``A union may [ ... ] not [ have ] virtual functions.''
10867 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
10869 cp_error ("function `%D' declared virtual inside a union",
10871 return void_type_node
;
10874 if (declarator
== ansi_opname
[(int) NEW_EXPR
]
10875 || declarator
== ansi_opname
[(int) VEC_NEW_EXPR
]
10876 || declarator
== ansi_opname
[(int) DELETE_EXPR
]
10877 || declarator
== ansi_opname
[(int) VEC_DELETE_EXPR
])
10881 cp_error ("`%D' cannot be declared virtual, since it is always static",
10886 else if (staticp
< 2)
10887 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10888 TYPE_ARG_TYPES (type
));
10891 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
10892 function_context
= (ctype
!= NULL_TREE
) ?
10893 hack_decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
10894 publicp
= (! friendp
|| ! staticp
)
10895 && function_context
== NULL_TREE
;
10896 decl
= grokfndecl (ctype
, type
,
10897 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
10898 ? declarator
: dname
,
10900 virtualp
, flags
, quals
, raises
,
10901 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
10902 funcdef_flag
, template_count
, in_namespace
);
10903 if (decl
== NULL_TREE
)
10906 /* This clobbers the attrs stored in `decl' from `attrlist'. */
10907 /* The decl and setting of decl_machine_attr is also turned off. */
10908 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
10911 /* [class.conv.ctor]
10913 A constructor declared without the function-specifier
10914 explicit that can be called with a single parameter
10915 specifies a conversion from the type of its first
10916 parameter to the type of its class. Such a constructor
10917 is called a converting constructor. */
10918 if (explicitp
== 2)
10919 DECL_NONCONVERTING_P (decl
) = 1;
10920 else if (DECL_CONSTRUCTOR_P (decl
))
10922 /* The constructor can be called with exactly one
10923 parameter if there is at least one parameter, and
10924 any subsequent parameters have default arguments.
10925 We don't look at the first parameter, which is
10926 really just the `this' parameter for the new
10929 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
10931 /* Skip the `in_chrg' argument too, if present. */
10932 if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (decl
)))
10933 arg_types
= TREE_CHAIN (arg_types
);
10935 if (arg_types
== void_list_node
10937 && TREE_CHAIN (arg_types
)
10938 && TREE_CHAIN (arg_types
) != void_list_node
10939 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
10940 DECL_NONCONVERTING_P (decl
) = 1;
10943 else if (TREE_CODE (type
) == METHOD_TYPE
)
10945 /* We only get here for friend declarations of
10946 members of other classes. */
10947 /* All method decls are public, so tell grokfndecl to set
10948 TREE_PUBLIC, also. */
10949 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
10950 virtualp
, flags
, quals
, raises
,
10951 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
10952 template_count
, in_namespace
);
10953 if (decl
== NULL_TREE
)
10956 else if (!staticp
&& ! processing_template_decl
10957 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
10958 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
10961 cp_error ("field `%D' has incomplete type", declarator
);
10963 cp_error ("name `%T' has incomplete type", type
);
10965 /* If we're instantiating a template, tell them which
10966 instantiation made the field's type be incomplete. */
10967 if (current_class_type
10968 && TYPE_NAME (current_class_type
)
10969 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
10970 && declspecs
&& TREE_VALUE (declspecs
)
10971 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
10972 cp_error (" in instantiation of template `%T'",
10973 current_class_type
);
10975 type
= error_mark_node
;
10982 error ("`%s' is neither function nor method; cannot be declared friend",
10983 IDENTIFIER_POINTER (declarator
));
10991 /* Friends are treated specially. */
10992 if (ctype
== current_class_type
)
10993 warning ("member functions are implicitly friends of their class");
10996 tree t
= NULL_TREE
;
10997 if (decl
&& DECL_NAME (decl
))
10999 if (template_class_depth (current_class_type
) == 0)
11002 = check_explicit_specialization
11004 template_count
, 2 * (funcdef_flag
!= 0) + 4);
11005 if (decl
== error_mark_node
)
11006 return error_mark_node
;
11009 t
= do_friend (ctype
, declarator
, decl
,
11010 last_function_parms
, attrlist
, flags
, quals
,
11013 if (t
&& funcdef_flag
)
11016 return void_type_node
;
11020 /* Structure field. It may not be a function, except for C++ */
11022 if (decl
== NULL_TREE
)
11028 /* An attempt is being made to initialize a non-static
11029 member. But, from [class.mem]:
11031 4 A member-declarator can contain a
11032 constant-initializer only if it declares a static
11033 member (_class.static_) of integral or enumeration
11034 type, see _class.static.data_.
11036 This used to be relatively common practice, but
11037 the rest of the compiler does not correctly
11038 handle the initialization unless the member is
11039 static so we make it static below. */
11040 cp_pedwarn ("ANSI C++ forbids initialization of member `%D'",
11042 cp_pedwarn ("making `%D' static", declarator
);
11046 if (uses_template_parms (type
))
11047 /* We'll check at instantiation time. */
11049 else if (check_static_variable_definition (declarator
,
11051 /* If we just return the declaration, crashes
11052 will sometimes occur. We therefore return
11053 void_type_node, as if this was a friend
11054 declaration, to cause callers to completely
11055 ignore this declaration. */
11056 return void_type_node
;
11059 /* 9.2p13 [class.mem] */
11060 if (declarator
== constructor_name (current_class_type
)
11061 /* Divergence from the standard: In extern "C", we
11062 allow non-static data members here, because C does
11063 and /usr/include/netinet/in.h uses that. */
11064 && (staticp
|| ! in_system_header
))
11065 cp_pedwarn ("ANSI C++ forbids data member `%D' with same name as enclosing class",
11070 /* C++ allows static class members. All other work
11071 for this is done by grokfield. */
11072 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
11073 TREE_STATIC (decl
) = 1;
11074 /* In class context, 'static' means public access. */
11075 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
11079 decl
= build_lang_decl (FIELD_DECL
, declarator
, type
);
11080 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11082 DECL_MUTABLE_P (decl
) = 1;
11083 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11087 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
11088 inlinep
, friendp
, raises
!= NULL_TREE
);
11091 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11093 tree original_name
;
11099 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11100 original_name
= dname
;
11102 original_name
= declarator
;
11104 if (RIDBIT_SETP (RID_AUTO
, specbits
))
11105 error ("storage class `auto' invalid for function `%s'", name
);
11106 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11107 error ("storage class `register' invalid for function `%s'", name
);
11109 /* Function declaration not at top level.
11110 Storage classes other than `extern' are not allowed
11111 and `extern' makes no difference. */
11112 if (! toplevel_bindings_p ()
11113 && (RIDBIT_SETP (RID_STATIC
, specbits
)
11114 || RIDBIT_SETP (RID_INLINE
, specbits
))
11117 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11118 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
11120 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
11123 if (ctype
== NULL_TREE
)
11127 error ("virtual non-class function `%s'", name
);
11131 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
11132 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11133 TYPE_ARG_TYPES (type
));
11135 /* Record presence of `static'. */
11136 publicp
= (ctype
!= NULL_TREE
11137 || RIDBIT_SETP (RID_EXTERN
, specbits
)
11138 || !RIDBIT_SETP (RID_STATIC
, specbits
));
11140 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
11141 virtualp
, flags
, quals
, raises
,
11143 publicp
, inlinep
, funcdef_flag
,
11144 template_count
, in_namespace
);
11145 if (decl
== NULL_TREE
)
11150 int illegal_static
= 0;
11152 /* Don't allow a static member function in a class, and forbid
11153 declaring main to be static. */
11154 if (TREE_CODE (type
) == METHOD_TYPE
)
11156 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11157 illegal_static
= 1;
11159 else if (current_function_decl
)
11161 /* FIXME need arm citation */
11162 error ("cannot declare static function inside another function");
11163 illegal_static
= 1;
11166 if (illegal_static
)
11169 RIDBIT_RESET (RID_STATIC
, specbits
);
11175 /* It's a variable. */
11177 /* An uninitialized decl with `extern' is a reference. */
11178 decl
= grokvardecl (type
, declarator
, &specbits
,
11180 (type_quals
& TYPE_QUAL_CONST
) != 0,
11182 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11183 inlinep
, friendp
, raises
!= NULL_TREE
);
11187 DECL_CONTEXT (decl
) = ctype
;
11190 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11192 RIDBIT_RESET (RID_STATIC
, specbits
);
11194 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11196 cp_error ("static member `%D' declared `register'", decl
);
11197 RIDBIT_RESET (RID_REGISTER
, specbits
);
11199 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11201 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11203 RIDBIT_RESET (RID_EXTERN
, specbits
);
11208 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11210 error ("`%s' cannot be declared mutable", name
);
11213 /* Record `register' declaration for warnings on &
11214 and in case doing stupid register allocation. */
11216 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11217 DECL_REGISTER (decl
) = 1;
11219 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11220 DECL_THIS_EXTERN (decl
) = 1;
11222 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11223 DECL_THIS_STATIC (decl
) = 1;
11225 /* Record constancy and volatility. There's no need to do this
11226 when processing a template; we'll do this for the instantiated
11227 declaration based on the type of DECL. */
11228 if (!processing_template_decl
)
11229 c_apply_type_quals_to_decl (type_quals
, decl
);
11235 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11236 An empty exprlist is a parmlist. An exprlist which
11237 contains only identifiers at the global level
11238 is a parmlist. Otherwise, it is an exprlist. */
11241 parmlist_is_exprlist (exprs
)
11244 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11247 if (toplevel_bindings_p ())
11249 /* At the global level, if these are all identifiers,
11250 then it is a parmlist. */
11253 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11255 exprs
= TREE_CHAIN (exprs
);
11262 /* Subroutine of start_function. Ensure that each of the parameter
11263 types (as listed in PARMS) is complete, as is required for a
11264 function definition. */
11267 require_complete_types_for_parms (parms
)
11272 tree type
= TREE_TYPE (parms
);
11273 if (TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
11275 if (DECL_NAME (parms
))
11276 error ("parameter `%s' has incomplete type",
11277 IDENTIFIER_POINTER (DECL_NAME (parms
)));
11279 error ("parameter has incomplete type");
11280 TREE_TYPE (parms
) = error_mark_node
;
11283 layout_decl (parms
, 0);
11285 parms
= TREE_CHAIN (parms
);
11289 /* Returns DECL if DECL is a local variable (or parameter). Returns
11290 NULL_TREE otherwise. */
11293 local_variable_p (t
)
11296 if ((TREE_CODE (t
) == VAR_DECL
11297 /* A VAR_DECL with a context that is a _TYPE is a static data
11299 && !TYPE_P (CP_DECL_CONTEXT (t
))
11300 /* Any other non-local variable must be at namespace scope. */
11301 && TREE_CODE (CP_DECL_CONTEXT (t
)) != NAMESPACE_DECL
)
11302 || (TREE_CODE (t
) == PARM_DECL
))
11308 /* Check that ARG, which is a default-argument expression for a
11309 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11310 something goes wrong. DECL may also be a _TYPE node, rather than a
11311 DECL, if there is no DECL available. */
11314 check_default_argument (decl
, arg
)
11321 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11322 /* We get a DEFAULT_ARG when looking at an in-class declaration
11323 with a default argument. Ignore the argument for now; we'll
11324 deal with it after the class is complete. */
11327 if (processing_template_decl
|| uses_template_parms (arg
))
11328 /* We don't do anything checking until instantiation-time. Note
11329 that there may be uninstantiated arguments even for an
11330 instantiated function, since default arguments are not
11331 instantiated until they are needed. */
11340 decl_type
= TREE_TYPE (decl
);
11342 if (arg
== error_mark_node
11343 || decl
== error_mark_node
11344 || TREE_TYPE (arg
) == error_mark_node
11345 || decl_type
== error_mark_node
)
11346 /* Something already went wrong. There's no need to check
11348 return error_mark_node
;
11350 /* [dcl.fct.default]
11352 A default argument expression is implicitly converted to the
11354 if (!TREE_TYPE (arg
)
11355 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11358 cp_error ("default argument for `%#D' has type `%T'",
11359 decl
, TREE_TYPE (arg
));
11361 cp_error ("default argument for parameter of type `%T' has type `%T'",
11362 decl_type
, TREE_TYPE (arg
));
11364 return error_mark_node
;
11367 /* [dcl.fct.default]
11369 Local variables shall not be used in default argument
11372 The keyword `this' shall not be used in a default argument of a
11373 member function. */
11374 var
= search_tree (arg
, local_variable_p
);
11377 cp_error ("default argument `%E' uses local variable `%D'",
11379 return error_mark_node
;
11386 /* Decode the list of parameter types for a function type.
11387 Given the list of things declared inside the parens,
11388 return a list of types.
11390 The list we receive can have three kinds of elements:
11391 an IDENTIFIER_NODE for names given without types,
11392 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11393 or void_type_node, to mark the end of an argument list
11394 when additional arguments are not permitted (... was not used).
11396 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11397 a mere declaration. A nonempty identifier-list gets an error message
11398 when FUNCDEF_FLAG is zero.
11399 If FUNCDEF_FLAG is 1, then parameter types must be complete.
11400 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11402 If all elements of the input list contain types,
11403 we return a list of the types.
11404 If all elements contain no type (except perhaps a void_type_node
11405 at the end), we return a null list.
11406 If some have types and some do not, it is an error, and we
11407 return a null list.
11409 Also set last_function_parms to either
11410 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11411 A list of names is converted to a chain of PARM_DECLs
11412 by store_parm_decls so that ultimately it is always a chain of decls.
11414 Note that in C++, parameters can take default values. These default
11415 values are in the TREE_PURPOSE field of the TREE_LIST. It is
11416 an error to specify default values which are followed by parameters
11417 that have no default values, or an ELLIPSES. For simplicities sake,
11418 only parameters which are specified with their types can take on
11422 grokparms (first_parm
, funcdef_flag
)
11426 tree result
= NULL_TREE
;
11427 tree decls
= NULL_TREE
;
11429 if (first_parm
!= NULL_TREE
11430 && TREE_CODE (TREE_VALUE (first_parm
)) == IDENTIFIER_NODE
)
11432 if (! funcdef_flag
)
11433 pedwarn ("parameter names (without types) in function declaration");
11434 last_function_parms
= first_parm
;
11437 else if (first_parm
!= NULL_TREE
11438 && TREE_CODE (TREE_VALUE (first_parm
)) != TREE_LIST
11439 && TREE_CODE (TREE_VALUE (first_parm
)) != VOID_TYPE
)
11440 my_friendly_abort (145);
11443 /* Types were specified. This is a list of declarators
11444 each represented as a TREE_LIST node. */
11445 register tree parm
, chain
;
11446 int any_init
= 0, any_error
= 0;
11448 if (first_parm
!= NULL_TREE
)
11450 tree last_result
= NULL_TREE
;
11451 tree last_decl
= NULL_TREE
;
11453 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11455 tree type
= NULL_TREE
, list_node
= parm
;
11456 register tree decl
= TREE_VALUE (parm
);
11457 tree init
= TREE_PURPOSE (parm
);
11459 chain
= TREE_CHAIN (parm
);
11460 /* @@ weak defense against parse errors. */
11461 if (TREE_CODE (decl
) != VOID_TYPE
11462 && TREE_CODE (decl
) != TREE_LIST
)
11464 /* Give various messages as the need arises. */
11465 if (TREE_CODE (decl
) == STRING_CST
)
11466 cp_error ("invalid string constant `%E'", decl
);
11467 else if (TREE_CODE (decl
) == INTEGER_CST
)
11468 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11472 if (TREE_CODE (decl
) != VOID_TYPE
)
11474 decl
= grokdeclarator (TREE_VALUE (decl
),
11475 TREE_PURPOSE (decl
),
11476 PARM
, init
!= NULL_TREE
,
11478 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
11481 /* Top-level qualifiers on the parameters are
11482 ignored for function types. */
11483 type
= TYPE_MAIN_VARIANT (TREE_TYPE (decl
));
11485 if (TREE_CODE (type
) == VOID_TYPE
)
11486 decl
= void_type_node
;
11487 else if (TREE_CODE (type
) == METHOD_TYPE
)
11489 if (DECL_NAME (decl
))
11490 /* Cannot use the decl here because
11491 we don't have DECL_CONTEXT set up yet. */
11492 cp_error ("parameter `%D' invalidly declared method type",
11495 error ("parameter invalidly declared method type");
11496 type
= build_pointer_type (type
);
11497 TREE_TYPE (decl
) = type
;
11499 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11501 if (DECL_NAME (decl
))
11502 cp_error ("parameter `%D' invalidly declared offset type",
11505 error ("parameter invalidly declared offset type");
11506 type
= build_pointer_type (type
);
11507 TREE_TYPE (decl
) = type
;
11509 else if (abstract_virtuals_error (decl
, type
))
11510 any_error
= 1; /* Seems like a good idea. */
11511 else if (POINTER_TYPE_P (type
))
11514 while (POINTER_TYPE_P (t
)
11515 || (TREE_CODE (t
) == ARRAY_TYPE
11516 && TYPE_DOMAIN (t
) != NULL_TREE
))
11518 if (TREE_CODE (t
) == ARRAY_TYPE
)
11519 cp_error ("parameter type `%T' includes %s to array of unknown bound",
11521 TYPE_PTR_P (type
) ? "pointer" : "reference");
11525 if (TREE_CODE (decl
) == VOID_TYPE
)
11527 if (result
== NULL_TREE
)
11529 result
= void_list_node
;
11530 last_result
= result
;
11534 TREE_CHAIN (last_result
) = void_list_node
;
11535 last_result
= void_list_node
;
11538 && (chain
!= void_list_node
|| TREE_CHAIN (chain
)))
11539 error ("`void' in parameter list must be entire list");
11543 /* Since there is a prototype, args are passed in their own types. */
11544 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
11545 if (PROMOTE_PROTOTYPES
11546 && (TREE_CODE (type
) == INTEGER_TYPE
11547 || TREE_CODE (type
) == ENUMERAL_TYPE
)
11548 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
11549 DECL_ARG_TYPE (decl
) = integer_type_node
;
11550 if (!any_error
&& init
)
11553 init
= check_default_argument (decl
, init
);
11558 if (decls
== NULL_TREE
)
11565 TREE_CHAIN (last_decl
) = decl
;
11568 if (! current_function_decl
&& TREE_PERMANENT (list_node
))
11570 TREE_PURPOSE (list_node
) = init
;
11571 TREE_VALUE (list_node
) = type
;
11572 TREE_CHAIN (list_node
) = NULL_TREE
;
11575 list_node
= saveable_tree_cons (init
, type
, NULL_TREE
);
11576 if (result
== NULL_TREE
)
11578 result
= list_node
;
11579 last_result
= result
;
11583 TREE_CHAIN (last_result
) = list_node
;
11584 last_result
= list_node
;
11588 TREE_CHAIN (last_result
) = NULL_TREE
;
11589 /* If there are no parameters, and the function does not end
11590 with `...', then last_decl will be NULL_TREE. */
11591 if (last_decl
!= NULL_TREE
)
11592 TREE_CHAIN (last_decl
) = NULL_TREE
;
11596 last_function_parms
= decls
;
11601 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
11602 FUNCTION_TYPE with the newly parsed version of its default argument, which
11603 was previously digested as text. See snarf_defarg et al in lex.c. */
11606 replace_defarg (arg
, init
)
11609 if (! processing_template_decl
11610 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
11611 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
11612 TREE_TYPE (init
), TREE_VALUE (arg
));
11613 TREE_PURPOSE (arg
) = init
;
11620 tree t
= FUNCTION_ARG_CHAIN (d
);
11621 if (DECL_CONSTRUCTOR_P (d
)
11622 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (d
)))
11623 t
= TREE_CHAIN (t
);
11624 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
11625 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
11626 == DECL_CLASS_CONTEXT (d
))
11627 && (TREE_CHAIN (t
) == NULL_TREE
11628 || TREE_CHAIN (t
) == void_list_node
11629 || TREE_PURPOSE (TREE_CHAIN (t
))))
11634 /* These memoizing functions keep track of special properties which
11635 a class may have. `grok_ctor_properties' notices whether a class
11636 has a constructor of the form X(X&), and also complains
11637 if the class has a constructor of the form X(X).
11638 `grok_op_properties' takes notice of the various forms of
11639 operator= which are defined, as well as what sorts of type conversion
11640 may apply. Both functions take a FUNCTION_DECL as an argument. */
11643 grok_ctor_properties (ctype
, decl
)
11646 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
11647 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
11649 /* When a type has virtual baseclasses, a magical first int argument is
11650 added to any ctor so we can tell if the class has been initialized
11651 yet. This could screw things up in this function, so we deliberately
11652 ignore the leading int if we're in that situation. */
11653 if (TYPE_USES_VIRTUAL_BASECLASSES (ctype
))
11655 my_friendly_assert (parmtypes
11656 && TREE_VALUE (parmtypes
) == integer_type_node
,
11658 parmtypes
= TREE_CHAIN (parmtypes
);
11659 parmtype
= TREE_VALUE (parmtypes
);
11664 A non-template constructor for class X is a copy constructor if
11665 its first parameter is of type X&, const X&, volatile X& or const
11666 volatile X&, and either there are no other parameters or else all
11667 other parameters have default arguments. */
11668 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
11669 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
11670 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11671 || TREE_CHAIN (parmtypes
) == void_list_node
11672 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11673 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11674 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11676 TYPE_HAS_INIT_REF (ctype
) = 1;
11677 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11678 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
11682 A declaration of a constructor for a class X is ill-formed if its
11683 first parameter is of type (optionally cv-qualified) X and either
11684 there are no other parameters or else all other parameters have
11687 We *don't* complain about member template instantiations that
11688 have this form, though; they can occur as we try to decide what
11689 constructor to use during overload resolution. Since overload
11690 resolution will never prefer such a constructor to the
11691 non-template copy constructor (which is either explicitly or
11692 implicitly defined), there's no need to worry about their
11693 existence. Theoretically, they should never even be
11694 instantiated, but that's hard to forestall. */
11695 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
11696 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11697 || TREE_CHAIN (parmtypes
) == void_list_node
11698 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11699 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11700 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11702 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
11704 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
11707 else if (TREE_CODE (parmtype
) == VOID_TYPE
11708 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
11709 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
11714 /* An operator with this name can be either unary or binary. */
11720 return (name
== ansi_opname
[(int) INDIRECT_REF
]
11721 || name
== ansi_opname
[(int) ADDR_EXPR
]
11722 || name
== ansi_opname
[(int) NEGATE_EXPR
]
11723 || name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11724 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]
11725 || name
== ansi_opname
[(int) CONVERT_EXPR
]);
11728 /* An operator with this name can only be unary. */
11734 return (name
== ansi_opname
[(int) TRUTH_NOT_EXPR
]
11735 || name
== ansi_opname
[(int) BIT_NOT_EXPR
]
11736 || name
== ansi_opname
[(int) COMPONENT_REF
]
11737 || IDENTIFIER_TYPENAME_P (name
));
11740 /* Do a little sanity-checking on how they declared their operator. */
11743 grok_op_properties (decl
, virtualp
, friendp
)
11745 int virtualp
, friendp
;
11747 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
11748 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
11749 tree name
= DECL_NAME (decl
);
11751 if (current_class_type
== NULL_TREE
)
11758 A user-declared copy assignment operator X::operator= is a
11759 non-static non-template member function of class X with
11760 exactly one parameter of type X, X&, const X&, volatile X& or
11761 const volatile X&. */
11762 if (name
== ansi_opname
[(int) MODIFY_EXPR
]
11763 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11764 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11766 else if (name
== ansi_opname
[(int) CALL_EXPR
])
11767 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
11768 else if (name
== ansi_opname
[(int) ARRAY_REF
])
11769 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
11770 else if (name
== ansi_opname
[(int) COMPONENT_REF
]
11771 || name
== ansi_opname
[(int) MEMBER_REF
])
11772 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
11773 else if (name
== ansi_opname
[(int) NEW_EXPR
])
11774 TYPE_GETS_NEW (current_class_type
) |= 1;
11775 else if (name
== ansi_opname
[(int) DELETE_EXPR
])
11776 TYPE_GETS_DELETE (current_class_type
) |= 1;
11777 else if (name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11778 TYPE_GETS_NEW (current_class_type
) |= 2;
11779 else if (name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11780 TYPE_GETS_DELETE (current_class_type
) |= 2;
11783 if (name
== ansi_opname
[(int) NEW_EXPR
]
11784 || name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11786 /* When the compiler encounters the definition of A::operator new, it
11787 doesn't look at the class declaration to find out if it's static. */
11789 revert_static_member_fn (&decl
, NULL
, NULL
);
11791 /* Take care of function decl if we had syntax errors. */
11792 if (argtypes
== NULL_TREE
)
11794 = build_function_type (ptr_type_node
,
11795 hash_tree_chain (integer_type_node
,
11798 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
11800 else if (name
== ansi_opname
[(int) DELETE_EXPR
]
11801 || name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11804 revert_static_member_fn (&decl
, NULL
, NULL
);
11806 if (argtypes
== NULL_TREE
)
11808 = build_function_type (void_type_node
,
11809 hash_tree_chain (ptr_type_node
,
11813 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
11815 if (! friendp
&& name
== ansi_opname
[(int) VEC_DELETE_EXPR
]
11816 && (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
11817 != void_list_node
))
11818 TYPE_VEC_DELETE_TAKES_SIZE (current_class_type
) = 1;
11823 /* An operator function must either be a non-static member function
11824 or have at least one parameter of a class, a reference to a class,
11825 an enumeration, or a reference to an enumeration. 13.4.0.6 */
11826 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
11828 if (IDENTIFIER_TYPENAME_P (name
)
11829 || name
== ansi_opname
[(int) CALL_EXPR
]
11830 || name
== ansi_opname
[(int) MODIFY_EXPR
]
11831 || name
== ansi_opname
[(int) COMPONENT_REF
]
11832 || name
== ansi_opname
[(int) ARRAY_REF
])
11833 cp_error ("`%D' must be a nonstatic member function", decl
);
11838 if (DECL_STATIC_FUNCTION_P (decl
))
11839 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
11842 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
11844 tree arg
= TREE_VALUE (p
);
11845 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
11846 arg
= TREE_TYPE (arg
);
11848 /* This lets bad template code slip through. */
11849 if (IS_AGGR_TYPE (arg
)
11850 || TREE_CODE (arg
) == ENUMERAL_TYPE
11851 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
11852 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11856 ("`%D' must have an argument of class or enumerated type",
11863 if (name
== ansi_opname
[(int) CALL_EXPR
])
11864 return; /* No restrictions on args. */
11866 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
11868 tree t
= TREE_TYPE (name
);
11869 if (TREE_CODE (t
) == VOID_TYPE
)
11870 pedwarn ("void is not a valid type conversion operator");
11871 else if (! friendp
)
11873 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
11874 const char *what
= 0;
11876 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
11878 if (t
== current_class_type
)
11879 what
= "the same type";
11880 /* Don't force t to be complete here. */
11881 else if (IS_AGGR_TYPE (t
)
11883 && DERIVED_FROM_P (t
, current_class_type
))
11884 what
= "a base class";
11887 warning ("conversion to %s%s will never use a type conversion operator",
11888 ref
? "a reference to " : "", what
);
11892 if (name
== ansi_opname
[(int) MODIFY_EXPR
])
11896 if (list_length (argtypes
) != 3 && methodp
)
11898 cp_error ("`%D' must take exactly one argument", decl
);
11901 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
11903 if (copy_assignment_arg_p (parmtype
, virtualp
)
11906 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
11907 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
11908 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11909 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
11912 else if (name
== ansi_opname
[(int) COND_EXPR
])
11915 cp_error ("ANSI C++ prohibits overloading operator ?:");
11917 else if (ambi_op_p (name
))
11919 if (list_length (argtypes
) == 2)
11921 else if (list_length (argtypes
) == 3)
11923 if ((name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11924 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11925 && ! processing_template_decl
11926 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
11929 cp_error ("postfix `%D' must take `int' as its argument",
11933 ("postfix `%D' must take `int' as its second argument",
11940 cp_error ("`%D' must take either zero or one argument", decl
);
11942 cp_error ("`%D' must take either one or two arguments", decl
);
11945 /* More Effective C++ rule 6. */
11947 && (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11948 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]))
11950 tree arg
= TREE_VALUE (argtypes
);
11951 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
11952 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
11953 arg
= TREE_TYPE (arg
);
11954 arg
= TYPE_MAIN_VARIANT (arg
);
11955 if (list_length (argtypes
) == 2)
11957 if (TREE_CODE (ret
) != REFERENCE_TYPE
11958 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
11960 cp_warning ("prefix `%D' should return `%T'", decl
,
11961 build_reference_type (arg
));
11965 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
11966 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
11970 else if (unary_op_p (name
))
11972 if (list_length (argtypes
) != 2)
11975 cp_error ("`%D' must take `void'", decl
);
11977 cp_error ("`%D' must take exactly one argument", decl
);
11980 else /* if (binary_op_p (name)) */
11982 if (list_length (argtypes
) != 3)
11985 cp_error ("`%D' must take exactly one argument", decl
);
11987 cp_error ("`%D' must take exactly two arguments", decl
);
11990 /* More Effective C++ rule 7. */
11992 && (name
== ansi_opname
[TRUTH_ANDIF_EXPR
]
11993 || name
== ansi_opname
[TRUTH_ORIF_EXPR
]
11994 || name
== ansi_opname
[COMPOUND_EXPR
]))
11995 cp_warning ("user-defined `%D' always evaluates both arguments",
11999 /* Effective C++ rule 23. */
12001 && list_length (argtypes
) == 3
12002 && (name
== ansi_opname
[PLUS_EXPR
]
12003 || name
== ansi_opname
[MINUS_EXPR
]
12004 || name
== ansi_opname
[TRUNC_DIV_EXPR
]
12005 || name
== ansi_opname
[MULT_EXPR
])
12006 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
12007 cp_warning ("`%D' should return by value", decl
);
12011 for (; argtypes
!= void_list_node
; argtypes
= TREE_CHAIN (argtypes
))
12012 if (TREE_PURPOSE (argtypes
))
12014 TREE_PURPOSE (argtypes
) = NULL_TREE
;
12015 if (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
12016 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
12019 cp_pedwarn ("`%D' cannot have default arguments", decl
);
12022 cp_error ("`%D' cannot have default arguments", decl
);
12027 static const char *
12029 enum tag_types code
;
12042 my_friendly_abort (981122);
12046 /* Get the struct, enum or union (CODE says which) with tag NAME.
12047 Define the tag as a forward-reference if it is not defined.
12049 C++: If a class derivation is given, process it here, and report
12050 an error if multiple derivation declarations are not identical.
12052 If this is a definition, come in through xref_tag and only look in
12053 the current frame for the name (since C++ allows new names in any
12057 xref_tag (code_type_node
, name
, globalize
)
12058 tree code_type_node
;
12062 enum tag_types tag_code
;
12063 enum tree_code code
;
12065 register tree ref
, t
;
12066 struct binding_level
*b
= current_binding_level
;
12068 tree attributes
= NULL_TREE
;
12069 tree context
= NULL_TREE
;
12071 /* If we are called from the parser, code_type_node will sometimes be a
12072 TREE_LIST. This indicates that the user wrote
12073 "class __attribute__ ((foo)) bar". Extract the attributes so we can
12075 if (TREE_CODE (code_type_node
) == TREE_LIST
)
12077 attributes
= TREE_PURPOSE (code_type_node
);
12078 code_type_node
= TREE_VALUE (code_type_node
);
12081 tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
12086 code
= RECORD_TYPE
;
12092 code
= ENUMERAL_TYPE
;
12095 my_friendly_abort (18);
12098 /* If a cross reference is requested, look up the type
12099 already defined for this tag and return it. */
12100 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
12103 name
= TYPE_IDENTIFIER (t
);
12107 t
= IDENTIFIER_TYPE_VALUE (name
);
12109 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
12110 && TREE_CODE (t
) != TEMPLATE_TEMPLATE_PARM
)
12115 /* If we know we are defining this tag, only look it up in
12116 this scope and don't try to find it as a type. */
12117 ref
= lookup_tag (code
, name
, b
, 1);
12123 /* [dcl.type.elab] If the identifier resolves to a
12124 typedef-name or a template type-parameter, the
12125 elaborated-type-specifier is ill-formed. */
12126 if (t
!= TYPE_MAIN_VARIANT (t
)
12127 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
12128 cp_pedwarn ("using typedef-name `%D' after `%s'",
12129 TYPE_NAME (t
), tag_name (tag_code
));
12130 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12131 cp_error ("using template type parameter `%T' after `%s'",
12132 t
, tag_name (tag_code
));
12137 ref
= lookup_tag (code
, name
, b
, 0);
12141 /* Try finding it as a type declaration. If that wins,
12143 ref
= lookup_name (name
, 1);
12145 if (ref
!= NULL_TREE
12146 && processing_template_decl
12147 && DECL_CLASS_TEMPLATE_P (ref
)
12148 && template_class_depth (current_class_type
) == 0)
12149 /* Since GLOBALIZE is true, we're declaring a global
12150 template, so we want this type. */
12151 ref
= DECL_RESULT (ref
);
12153 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12154 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12155 ref
= TREE_TYPE (ref
);
12160 if (ref
&& current_class_type
12161 && template_class_depth (current_class_type
)
12162 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12164 /* Since GLOBALIZE is non-zero, we are not looking at a
12165 definition of this tag. Since, in addition, we are currently
12166 processing a (member) template declaration of a template
12167 class, we must be very careful; consider:
12174 { template <class V>
12175 friend struct S1; };
12177 Here, the S2::S1 declaration should not be confused with the
12178 outer declaration. In particular, the inner version should
12179 have a template parameter of level 2, not level 1. This
12180 would be particularly important if the member declaration
12183 template <class V = U> friend struct S1;
12185 say, when we should tsubst into `U' when instantiating
12186 S2. On the other hand, when presented with:
12196 we must find the inner binding eventually. We
12197 accomplish this by making sure that the new type we
12198 create to represent this declaration has the right
12200 context
= TYPE_CONTEXT (ref
);
12205 push_obstacks_nochange ();
12209 /* If no such tag is yet defined, create a forward-reference node
12210 and record it as the "definition".
12211 When a real declaration of this type is found,
12212 the forward-reference will be altered into a real type. */
12214 /* In C++, since these migrate into the global scope, we must
12215 build them on the permanent obstack. */
12217 temp
= allocation_temporary_p ();
12219 end_temporary_allocation ();
12221 if (code
== ENUMERAL_TYPE
)
12223 cp_error ("use of enum `%#D' without previous declaration", name
);
12225 ref
= make_node (ENUMERAL_TYPE
);
12227 /* Give the type a default layout like unsigned int
12228 to avoid crashing if it does not get defined. */
12229 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12230 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12231 TREE_UNSIGNED (ref
) = 1;
12232 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12233 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12234 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12236 /* Enable us to recognize when a type is created in class context.
12237 To do nested classes correctly, this should probably be cleared
12238 out when we leave this classes scope. Currently this in only
12239 done in `start_enum'. */
12241 pushtag (name
, ref
, globalize
);
12245 struct binding_level
*old_b
= class_binding_level
;
12247 ref
= make_lang_type (code
);
12248 TYPE_CONTEXT (ref
) = context
;
12250 #ifdef NONNESTED_CLASSES
12251 /* Class types don't nest the way enums do. */
12252 class_binding_level
= (struct binding_level
*)0;
12254 pushtag (name
, ref
, globalize
);
12255 class_binding_level
= old_b
;
12260 /* If it no longer looks like a nested type, make sure it's
12262 If it is not an IDENTIFIER, this is not a declaration */
12263 if (b
->namespace_p
&& !class_binding_level
12264 && TREE_CODE (name
) == IDENTIFIER_NODE
)
12266 if (IDENTIFIER_NAMESPACE_VALUE (name
) == NULL_TREE
)
12267 SET_IDENTIFIER_NAMESPACE_VALUE (name
, TYPE_NAME (ref
));
12270 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12271 redeclare_class_template (ref
, current_template_parms
);
12274 /* Until the type is defined, tentatively accept whatever
12275 structure tag the user hands us. */
12276 if (TYPE_SIZE (ref
) == NULL_TREE
12277 && ref
!= current_class_type
12278 /* Have to check this, in case we have contradictory tag info. */
12279 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12281 if (tag_code
== class_type
)
12282 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12283 else if (tag_code
== record_type
)
12284 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12289 TREE_TYPE (ref
) = attributes
;
12295 xref_tag_from_type (old
, id
, globalize
)
12299 tree code_type_node
;
12301 if (TREE_CODE (old
) == RECORD_TYPE
)
12302 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12303 ? class_type_node
: record_type_node
);
12305 code_type_node
= union_type_node
;
12307 if (id
== NULL_TREE
)
12308 id
= TYPE_IDENTIFIER (old
);
12310 return xref_tag (code_type_node
, id
, globalize
);
12313 /* REF is a type (named NAME), for which we have just seen some
12314 baseclasses. BINFO is a list of those baseclasses; the
12315 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12316 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12317 struct, or union. */
12320 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12321 tree code_type_node
;
12325 /* In the declaration `A : X, Y, ... Z' we mark all the types
12326 (A, X, Y, ..., Z) so we can check for duplicates. */
12331 enum tag_types tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
12333 if (tag_code
== union_type
)
12335 cp_error ("derived union `%T' invalid", ref
);
12339 len
= list_length (binfo
);
12340 push_obstacks (TYPE_OBSTACK (ref
), TYPE_OBSTACK (ref
));
12342 /* First, make sure that any templates in base-classes are
12343 instantiated. This ensures that if we call ourselves recursively
12344 we do not get confused about which classes are marked and which
12346 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12347 complete_type (TREE_VALUE (base
));
12349 SET_CLASSTYPE_MARKED (ref
);
12350 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12352 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12354 /* The base of a derived struct is public by default. */
12356 = (TREE_PURPOSE (binfo
) == access_public_node
12357 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12358 || (tag_code
!= class_type
12359 && (TREE_PURPOSE (binfo
) == access_default_node
12360 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12362 = (TREE_PURPOSE (binfo
) == access_protected_node
12363 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12365 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12366 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12367 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12368 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12369 tree basetype
= TREE_VALUE (binfo
);
12372 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12373 basetype
= TREE_TYPE (basetype
);
12375 || (TREE_CODE (basetype
) != RECORD_TYPE
12376 && TREE_CODE (basetype
) != TYPENAME_TYPE
12377 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12378 && TREE_CODE (basetype
) != TEMPLATE_TEMPLATE_PARM
))
12380 cp_error ("base type `%T' fails to be a struct or class type",
12381 TREE_VALUE (binfo
));
12385 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12387 /* This code replaces similar code in layout_basetypes.
12388 We put the complete_type first for implicit `typename'. */
12389 if (TYPE_SIZE (basetype
) == NULL_TREE
12390 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12392 cp_error ("base class `%T' has incomplete type", basetype
);
12397 if (CLASSTYPE_MARKED (basetype
))
12399 if (basetype
== ref
)
12400 cp_error ("recursive type `%T' undefined", basetype
);
12402 cp_error ("duplicate base type `%T' invalid", basetype
);
12406 if (TYPE_FOR_JAVA (basetype
)
12407 && current_lang_stack
== current_lang_base
)
12408 TYPE_FOR_JAVA (ref
) = 1;
12410 /* Note that the BINFO records which describe individual
12411 inheritances are *not* shared in the lattice! They
12412 cannot be shared because a given baseclass may be
12413 inherited with different `accessibility' by different
12414 derived classes. (Each BINFO record describing an
12415 individual inheritance contains flags which say what
12416 the `accessibility' of that particular inheritance is.) */
12419 = make_binfo (integer_zero_node
, basetype
,
12420 CLASS_TYPE_P (basetype
)
12421 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
12422 CLASS_TYPE_P (basetype
)
12423 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
12425 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
12426 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
12427 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
12428 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
12429 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
12431 /* We need to unshare the binfos now so that lookups during class
12432 definition work. */
12433 unshare_base_binfos (base_binfo
);
12435 SET_CLASSTYPE_MARKED (basetype
);
12437 /* We are free to modify these bits because they are meaningless
12438 at top level, and BASETYPE is a top-level type. */
12439 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
12441 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
12442 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12445 if (CLASS_TYPE_P (basetype
))
12447 TYPE_GETS_NEW (ref
) |= TYPE_GETS_NEW (basetype
);
12448 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
12455 TREE_VEC_LENGTH (binfos
) = i
;
12457 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
12460 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
12463 tree basetype
= BINFO_TYPE (TREE_VEC_ELT (binfos
, 0));
12465 if (CLASS_TYPE_P (basetype
))
12466 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
12467 = TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
12470 if (TYPE_USES_MULTIPLE_INHERITANCE (ref
))
12471 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12473 /* Unmark all the types. */
12475 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
12476 CLEAR_CLASSTYPE_MARKED (ref
);
12478 /* Now that we know all the base-classes, set up the list of virtual
12480 CLASSTYPE_VBASECLASSES (ref
) = get_vbase_types (ref
);
12486 /* Begin compiling the definition of an enumeration type.
12487 NAME is its name (or null if anonymous).
12488 Returns the type object, as yet incomplete.
12489 Also records info about it so that build_enumerator
12490 may be used to declare the individual values as they are read. */
12496 register tree enumtype
= NULL_TREE
;
12497 struct binding_level
*b
= current_binding_level
;
12499 /* We are wasting space here and putting these on the permanent_obstack so
12500 that typeid(local enum) will work correctly. */
12501 push_obstacks (&permanent_obstack
, &permanent_obstack
);
12503 /* If this is the real definition for a previous forward reference,
12504 fill in the contents in the same object that used to be the
12505 forward reference. */
12507 if (name
!= NULL_TREE
)
12508 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
12510 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
12512 cp_error ("multiple definition of `%#T'", enumtype
);
12513 cp_error_at ("previous definition here", enumtype
);
12517 enumtype
= make_node (ENUMERAL_TYPE
);
12518 pushtag (name
, enumtype
, 0);
12521 if (current_class_type
)
12522 TREE_ADDRESSABLE (b
->tags
) = 1;
12524 /* We don't copy this value because build_enumerator needs to do it. */
12525 enum_next_value
= integer_zero_node
;
12528 GNU_xref_decl (current_function_decl
, enumtype
);
12532 /* After processing and defining all the values of an enumeration type,
12533 install their decls in the enumeration type and finish it off.
12534 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12535 Returns ENUMTYPE. */
12538 finish_enum (enumtype
)
12541 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
12542 /* Calculate the maximum value of any enumerator in this type. */
12544 tree values
= TYPE_VALUES (enumtype
);
12549 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
12554 /* The TREE_VALUE is a CONST_DECL for this enumeration
12556 decl
= TREE_VALUE (pair
);
12558 /* The DECL_INITIAL will be NULL if we are processing a
12559 template declaration and this enumeration constant had no
12560 explicit initializer. */
12561 value
= DECL_INITIAL (decl
);
12562 if (value
&& !processing_template_decl
)
12564 /* Set the TREE_TYPE for the VALUE as well. That's so
12565 that when we call decl_constant_value we get an
12566 entity of the right type (but with the constant
12567 value). Since we shouldn't ever call
12568 decl_constant_value on a template type, there's no
12569 reason to do that when processing_template_decl.
12570 And, if the expression is something like a
12571 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12572 wreak havoc on the intended type of the expression.
12574 Of course, there's also no point in trying to compute
12575 minimum or maximum values if we're in a template. */
12576 TREE_TYPE (value
) = enumtype
;
12579 minnode
= maxnode
= value
;
12580 else if (tree_int_cst_lt (maxnode
, value
))
12582 else if (tree_int_cst_lt (value
, minnode
))
12586 if (processing_template_decl
)
12587 /* If this is just a template, leave the CONST_DECL
12588 alone. That way tsubst_copy will find CONST_DECLs for
12589 CONST_DECLs, and not INTEGER_CSTs. */
12592 /* In the list we're building up, we want the enumeration
12593 values, not the CONST_DECLs. */
12594 TREE_VALUE (pair
) = value
;
12598 maxnode
= minnode
= integer_zero_node
;
12600 TYPE_VALUES (enumtype
) = nreverse (values
);
12602 if (processing_template_decl
)
12604 tree scope
= current_scope ();
12605 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
12606 add_tree (build_min (TAG_DEFN
, enumtype
));
12610 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
12611 int lowprec
= min_precision (minnode
, unsignedp
);
12612 int highprec
= min_precision (maxnode
, unsignedp
);
12613 int precision
= MAX (lowprec
, highprec
);
12616 TYPE_SIZE (enumtype
) = NULL_TREE
;
12618 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
12620 TYPE_PRECISION (enumtype
) = precision
;
12622 fixup_unsigned_type (enumtype
);
12624 fixup_signed_type (enumtype
);
12626 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
12627 /* Use the width of the narrowest normal C type which is wide
12629 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
12632 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
12634 TYPE_SIZE (enumtype
) = 0;
12635 layout_type (enumtype
);
12637 /* Fix up all variant types of this enum type. */
12638 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
12639 tem
= TYPE_NEXT_VARIANT (tem
))
12641 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
12642 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
12643 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
12644 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
12645 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
12646 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
12647 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
12648 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
12649 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
12652 /* Finish debugging output for this type. */
12653 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
12656 /* In start_enum we pushed obstacks. Here, we must pop them. */
12662 /* Build and install a CONST_DECL for an enumeration constant of the
12663 enumeration type TYPE whose NAME and VALUE (if any) are provided.
12664 Assignment of sequential values by default is handled here. */
12667 build_enumerator (name
, value
, type
)
12675 /* Remove no-op casts from the value. */
12677 STRIP_TYPE_NOPS (value
);
12679 if (! processing_template_decl
)
12681 /* Validate and default VALUE. */
12682 if (value
!= NULL_TREE
)
12684 if (TREE_READONLY_DECL_P (value
))
12685 value
= decl_constant_value (value
);
12687 if (TREE_CODE (value
) == INTEGER_CST
)
12689 value
= default_conversion (value
);
12690 constant_expression_warning (value
);
12694 cp_error ("enumerator value for `%D' not integer constant", name
);
12699 /* Default based on previous value. */
12700 if (value
== NULL_TREE
&& ! processing_template_decl
)
12702 value
= enum_next_value
;
12704 cp_error ("overflow in enumeration values at `%D'", name
);
12707 /* Remove no-op casts from the value. */
12709 STRIP_TYPE_NOPS (value
);
12711 /* To fix MAX_VAL enum consts. (bkoz) */
12712 TREE_TYPE (value
) = integer_type_node
;
12716 /* We always have to copy here; not all INTEGER_CSTs are unshared.
12717 Even in other cases, we will later (in finish_enum) be setting the
12719 if (value
!= NULL_TREE
)
12720 value
= copy_node (value
);
12722 /* C++ associates enums with global, function, or class declarations. */
12724 context
= current_scope ();
12725 if (context
&& context
== current_class_type
)
12726 /* This enum declaration is local to the class. */
12727 decl
= build_lang_decl (CONST_DECL
, name
, type
);
12729 /* It's a global enum, or it's local to a function. (Note local to
12730 a function could mean local to a class method. */
12731 decl
= build_decl (CONST_DECL
, name
, type
);
12733 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
12734 DECL_INITIAL (decl
) = value
;
12735 TREE_READONLY (decl
) = 1;
12737 if (context
&& context
== current_class_type
)
12738 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
12739 on the TYPE_FIELDS list for `S'. (That's so that you can say
12740 things like `S::i' later.) */
12741 finish_member_declaration (decl
);
12745 GNU_xref_decl (current_function_decl
, decl
);
12748 if (! processing_template_decl
)
12750 /* Set basis for default for next value. */
12751 enum_next_value
= build_binary_op_nodefault (PLUS_EXPR
, value
,
12752 integer_one_node
, PLUS_EXPR
);
12753 enum_overflow
= tree_int_cst_lt (enum_next_value
, value
);
12756 result
= saveable_tree_cons (name
, decl
, NULL_TREE
);
12761 static int function_depth
;
12763 /* Create the FUNCTION_DECL for a function definition.
12764 DECLSPECS and DECLARATOR are the parts of the declaration;
12765 they describe the function's name and the type it returns,
12766 but twisted together in a fashion that parallels the syntax of C.
12768 If PRE_PARSED_P is non-zero then DECLARATOR is really the DECL for
12769 the function we are about to process; DECLSPECS are ignored. For
12770 example, we set PRE_PARSED_P when processing the definition of
12771 inline function that was defined in-class; the definition is
12772 actually processed when the class is complete. In this case,
12773 PRE_PARSED_P is 2. We also set PRE_PARSED_P when instanting the
12774 body of a template function, and when constructing thunk functions
12775 and such; in these cases PRE_PARSED_P is 1.
12777 This function creates a binding context for the function body
12778 as well as setting up the FUNCTION_DECL in current_function_decl.
12780 Returns 1 on success. If the DECLARATOR is not suitable for a function
12781 (it defines a datum instead), we return 0, which tells
12782 yyparse to report a parse error.
12784 For C++, we must first check whether that datum makes any sense.
12785 For example, "class A local_a(1,2);" means that variable local_a
12786 is an aggregate of type A, which should have a constructor
12787 applied to it with the argument list [1, 2].
12789 @@ There is currently no way to retrieve the storage
12790 @@ allocated to FUNCTION (or all of its parms) if we return
12791 @@ something we had previously. */
12794 start_function (declspecs
, declarator
, attrs
, pre_parsed_p
)
12795 tree declspecs
, declarator
, attrs
;
12799 tree ctype
= NULL_TREE
;
12802 extern int have_extern_spec
;
12803 extern int used_extern_spec
;
12804 int doing_friend
= 0;
12806 /* Sanity check. */
12807 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
12808 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
12810 /* Assume, until we see it does. */
12811 current_function_returns_value
= 0;
12812 current_function_returns_null
= 0;
12814 shadowed_labels
= 0;
12815 current_function_assigns_this
= 0;
12816 current_function_just_assigned_this
= 0;
12817 current_function_parms_stored
= 0;
12818 original_result_rtx
= NULL_RTX
;
12819 base_init_expr
= NULL_TREE
;
12820 current_base_init_list
= NULL_TREE
;
12821 current_member_init_list
= NULL_TREE
;
12822 ctor_label
= dtor_label
= NULL_TREE
;
12823 static_labelno
= 0;
12824 in_function_try_handler
= 0;
12826 clear_temp_name ();
12828 /* This should only be done once on the top most decl. */
12829 if (have_extern_spec
&& !used_extern_spec
)
12831 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
12832 used_extern_spec
= 1;
12837 decl1
= declarator
;
12839 fntype
= TREE_TYPE (decl1
);
12840 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12841 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12843 /* ANSI C++ June 5 1992 WP 11.4.5. A friend function defined in a
12844 class is in the (lexical) scope of the class in which it is
12846 if (!ctype
&& DECL_FRIEND_P (decl1
))
12848 ctype
= DECL_CLASS_CONTEXT (decl1
);
12850 /* CTYPE could be null here if we're dealing with a template;
12851 for example, `inline friend float foo()' inside a template
12852 will have no CTYPE set. */
12853 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
12859 last_function_parms
= DECL_ARGUMENTS (decl1
);
12860 last_function_parm_tags
= NULL_TREE
;
12864 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
12865 /* If the declarator is not suitable for a function definition,
12866 cause a syntax error. */
12867 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
12869 fntype
= TREE_TYPE (decl1
);
12871 restype
= TREE_TYPE (fntype
);
12872 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
12874 cp_error ("semicolon missing after declaration of `%#T'", restype
);
12875 shadow_tag (build_expr_list (NULL_TREE
, restype
));
12876 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
12877 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
12878 fntype
= build_function_type (integer_type_node
,
12879 TYPE_ARG_TYPES (fntype
));
12881 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
12883 TYPE_ARG_TYPES (fntype
));
12884 TREE_TYPE (decl1
) = fntype
;
12887 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12888 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12889 else if (DECL_MAIN_P (decl1
))
12891 /* If this doesn't return integer_type, complain. */
12892 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
12894 if (pedantic
|| warn_return_type
)
12895 pedwarn ("return type for `main' changed to `int'");
12896 TREE_TYPE (decl1
) = fntype
= default_function_type
;
12901 /* Warn if function was previously implicitly declared
12902 (but not if we warned then). */
12903 if (! warn_implicit
12904 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
12905 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
12907 if (!building_stmt_tree ())
12908 announce_function (decl1
);
12910 /* Set up current_class_type, and enter the scope of the class, if
12913 push_nested_class (ctype
, 1);
12914 else if (DECL_STATIC_FUNCTION_P (decl1
))
12915 push_nested_class (DECL_CONTEXT (decl1
), 2);
12917 /* Now that we have entered the scope of the class, we must restore
12918 the bindings for any template parameters surrounding DECL1, if it
12919 is an inline member template. (Order is important; consider the
12920 case where a template parameter has the same name as a field of
12921 the class.) It is not until after this point that
12922 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
12923 if (pre_parsed_p
== 2)
12924 maybe_begin_member_template_processing (decl1
);
12926 /* Effective C++ rule 15. See also c_expand_return. */
12928 && DECL_NAME (decl1
) == ansi_opname
[(int) MODIFY_EXPR
]
12929 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
12930 cp_warning ("`operator=' should return a reference to `*this'");
12932 /* Make the init_value nonzero so pushdecl knows this is not tentative.
12933 error_mark_node is replaced below (in poplevel) with the BLOCK. */
12934 DECL_INITIAL (decl1
) = error_mark_node
;
12936 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
12937 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
12940 /* This function exists in static storage.
12941 (This does not mean `static' in the C sense!) */
12942 TREE_STATIC (decl1
) = 1;
12944 /* We must call push_template_decl after current_class_type is set
12945 up. (If we are processing inline definitions after exiting a
12946 class scope, current_class_type will be NULL_TREE until set above
12947 by push_nested_class.) */
12948 if (processing_template_decl
)
12949 decl1
= push_template_decl (decl1
);
12951 /* We are now in the scope of the function being defined. */
12952 current_function_decl
= decl1
;
12954 /* Save the parm names or decls from this function's declarator
12955 where store_parm_decls will find them. */
12956 current_function_parms
= last_function_parms
;
12957 current_function_parm_tags
= last_function_parm_tags
;
12959 if (! processing_template_decl
)
12961 /* In a function definition, arg types must be complete. */
12962 require_complete_types_for_parms (current_function_parms
);
12964 if (TYPE_SIZE (complete_type (TREE_TYPE (fntype
))) == NULL_TREE
)
12966 cp_error ("return-type `%#T' is an incomplete type",
12967 TREE_TYPE (fntype
));
12969 /* Make it return void instead, but don't change the
12970 type of the DECL_RESULT, in case we have a named return value. */
12973 = build_cplus_method_type (build_type_variant (ctype
,
12974 TREE_READONLY (decl1
),
12975 TREE_SIDE_EFFECTS (decl1
)),
12977 FUNCTION_ARG_CHAIN (decl1
));
12980 = build_function_type (void_type_node
,
12981 TYPE_ARG_TYPES (TREE_TYPE (decl1
)));
12982 DECL_RESULT (decl1
)
12983 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (TREE_TYPE (fntype
)));
12984 TREE_READONLY (DECL_RESULT (decl1
))
12985 = CP_TYPE_CONST_P (TREE_TYPE (fntype
));
12986 TREE_THIS_VOLATILE (DECL_RESULT (decl1
))
12987 = CP_TYPE_VOLATILE_P (TREE_TYPE (fntype
));
12990 abstract_virtuals_error (decl1
, TREE_TYPE (fntype
));
12993 /* Record the decl so that the function name is defined.
12994 If we already have a decl for this name, and it is a FUNCTION_DECL,
12995 use the old decl. */
12996 if (!processing_template_decl
&& pre_parsed_p
== 0)
12998 /* A specialization is not used to guide overload resolution. */
12999 if ((flag_guiding_decls
13000 || !DECL_TEMPLATE_SPECIALIZATION (decl1
))
13001 && ! DECL_FUNCTION_MEMBER_P (decl1
))
13002 decl1
= pushdecl (decl1
);
13005 /* We need to set the DECL_CONTEXT. */
13006 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
13007 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
13008 /* And make sure we have enough default args. */
13009 check_default_args (decl1
);
13011 DECL_MAIN_VARIANT (decl1
) = decl1
;
13012 fntype
= TREE_TYPE (decl1
);
13015 current_function_decl
= decl1
;
13017 if (DECL_INTERFACE_KNOWN (decl1
))
13019 tree ctx
= hack_decl_function_context (decl1
);
13021 if (DECL_NOT_REALLY_EXTERN (decl1
))
13022 DECL_EXTERNAL (decl1
) = 0;
13024 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
13025 && TREE_PUBLIC (ctx
))
13026 /* This is a function in a local class in an extern inline
13028 comdat_linkage (decl1
);
13030 /* If this function belongs to an interface, it is public.
13031 If it belongs to someone else's interface, it is also external.
13032 This only affects inlines and template instantiations. */
13033 else if (interface_unknown
== 0
13034 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13035 || flag_alt_external_templates
))
13037 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
13038 || processing_template_decl
)
13040 DECL_EXTERNAL (decl1
)
13042 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
13043 && !DECL_VINDEX (decl1
)));
13045 /* For WIN32 we also want to put these in linkonce sections. */
13046 maybe_make_one_only (decl1
);
13049 DECL_EXTERNAL (decl1
) = 0;
13050 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
13051 DECL_INTERFACE_KNOWN (decl1
) = 1;
13053 else if (interface_unknown
&& interface_only
13054 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13055 || flag_alt_external_templates
))
13057 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13058 interface, we will have interface_only set but not
13059 interface_known. In that case, we don't want to use the normal
13060 heuristics because someone will supply a #pragma implementation
13061 elsewhere, and deducing it here would produce a conflict. */
13062 comdat_linkage (decl1
);
13063 DECL_EXTERNAL (decl1
) = 0;
13064 DECL_INTERFACE_KNOWN (decl1
) = 1;
13065 DECL_DEFER_OUTPUT (decl1
) = 1;
13069 /* This is a definition, not a reference.
13070 So clear DECL_EXTERNAL. */
13071 DECL_EXTERNAL (decl1
) = 0;
13073 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
13074 && ! DECL_INTERFACE_KNOWN (decl1
)
13075 /* Don't try to defer nested functions for now. */
13076 && ! hack_decl_function_context (decl1
))
13077 DECL_DEFER_OUTPUT (decl1
) = 1;
13079 DECL_INTERFACE_KNOWN (decl1
) = 1;
13082 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
))
13084 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13085 TREE_TYPE (decl1
) = fntype
13086 = build_function_type (TREE_TYPE (fntype
),
13087 TREE_CHAIN (TYPE_ARG_TYPES (fntype
)));
13088 current_function_parms
= TREE_CHAIN (current_function_parms
);
13089 DECL_ARGUMENTS (decl1
) = current_function_parms
;
13092 restype
= TREE_TYPE (fntype
);
13096 /* If we're compiling a friend function, neither of the variables
13097 current_class_ptr nor current_class_type will have values. */
13098 if (! doing_friend
)
13100 /* We know that this was set up by `grokclassfn'.
13101 We do not wait until `store_parm_decls', since evil
13102 parse errors may never get us to that point. Here
13103 we keep the consistency between `current_class_type'
13104 and `current_class_ptr'. */
13105 tree t
= current_function_parms
;
13108 my_friendly_assert (t
!= NULL_TREE
13109 && TREE_CODE (t
) == PARM_DECL
, 162);
13110 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
13113 if (! hack_decl_function_context (decl1
))
13114 temporary_allocation ();
13115 i
= suspend_momentary ();
13117 /* Normally, build_indirect_ref returns current_class_ref
13118 whenever current_class_ptr is dereferenced. This time,
13119 however, we want it to *create* current_class_ref, so we
13120 temporarily clear current_class_ptr to fool it. */
13121 current_class_ptr
= NULL_TREE
;
13122 current_class_ref
= build_indirect_ref (t
, NULL_PTR
);
13123 current_class_ptr
= t
;
13125 resume_momentary (i
);
13126 if (! hack_decl_function_context (decl1
))
13127 end_temporary_allocation ();
13131 current_class_ptr
= current_class_ref
= NULL_TREE
;
13134 current_binding_level
->parm_flag
= 1;
13137 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13139 if (!building_stmt_tree ())
13141 GNU_xref_function (decl1
, current_function_parms
);
13142 make_function_rtl (decl1
);
13145 /* Promote the value to int before returning it. */
13146 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13147 restype
= type_promotes_to (restype
);
13149 /* If this fcn was already referenced via a block-scope `extern' decl
13150 (or an implicit decl), propagate certain information about the usage. */
13151 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13152 TREE_ADDRESSABLE (decl1
) = 1;
13154 if (DECL_RESULT (decl1
) == NULL_TREE
)
13156 DECL_RESULT (decl1
)
13157 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13158 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13159 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13162 /* Allocate further tree nodes temporarily during compilation
13163 of this function only. Tiemann moved up here from bottom of fn. */
13164 /* If this is a nested function, then we must continue to allocate RTL
13165 on the permanent obstack in case we need to inline it later. */
13166 if (! hack_decl_function_context (decl1
))
13167 temporary_allocation ();
13169 /* Make sure that we always have a momntary obstack while we're in a
13173 if (building_stmt_tree ())
13174 begin_stmt_tree (decl1
);
13178 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl1
))
13179 && DECL_LANGUAGE (decl1
) == lang_cplusplus
)
13181 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13182 ctor_label
= NULL_TREE
;
13186 dtor_label
= NULL_TREE
;
13187 if (DECL_CONSTRUCTOR_P (decl1
))
13188 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13194 /* Called after store_parm_decls for a function-try-block. We need to update
13195 last_parm_cleanup_insn so that the base initializers for a constructor
13196 are run within this block, not before it. */
13199 expand_start_early_try_stmts ()
13201 expand_start_try_stmts ();
13202 last_parm_cleanup_insn
= get_last_insn ();
13205 /* Store the parameter declarations into the current function declaration.
13206 This is called after parsing the parameter declarations, before
13207 digesting the body of the function.
13209 Also install to binding contour return value identifier, if any. */
13212 store_parm_decls ()
13214 register tree fndecl
= current_function_decl
;
13215 register tree parm
;
13216 int parms_have_cleanups
= 0;
13217 tree cleanups
= NULL_TREE
;
13219 /* This is either a chain of PARM_DECLs (when a prototype is used). */
13220 tree specparms
= current_function_parms
;
13222 /* This is a list of types declared among parms in a prototype. */
13223 tree parmtags
= current_function_parm_tags
;
13225 /* This is a chain of any other decls that came in among the parm
13226 declarations. If a parm is declared with enum {foo, bar} x;
13227 then CONST_DECLs for foo and bar are put here. */
13228 tree nonparms
= NULL_TREE
;
13230 if (toplevel_bindings_p ())
13231 fatal ("parse errors have confused me too much");
13233 /* Initialize RTL machinery. */
13234 init_function_start (fndecl
, input_filename
, lineno
);
13236 /* Create a binding level for the parms. */
13237 expand_start_bindings (0);
13239 if (specparms
!= NULL_TREE
)
13241 /* This case is when the function was defined with an ANSI prototype.
13242 The parms already have decls, so we need not do anything here
13243 except record them as in effect
13244 and complain if any redundant old-style parm decls were written. */
13246 register tree next
;
13248 /* Must clear this because it might contain TYPE_DECLs declared
13250 storedecls (NULL_TREE
);
13252 for (parm
= nreverse (specparms
); parm
; parm
= next
)
13254 next
= TREE_CHAIN (parm
);
13255 if (TREE_CODE (parm
) == PARM_DECL
)
13258 if (DECL_NAME (parm
) == NULL_TREE
)
13262 else if (TREE_CODE (TREE_TYPE (parm
)) == VOID_TYPE
)
13263 cp_error ("parameter `%D' declared void", parm
);
13266 /* Now fill in DECL_REFERENCE_SLOT for any of the parm decls.
13267 A parameter is assumed not to have any side effects.
13268 If this should change for any reason, then this
13269 will have to wrap the bashed reference type in a save_expr.
13271 Also, if the parameter type is declared to be an X
13272 and there is an X(X&) constructor, we cannot lay it
13273 into the stack (any more), so we make this parameter
13274 look like it is really of reference type. Functions
13275 which pass parameters to this function will know to
13276 create a temporary in their frame, and pass a reference
13279 if (TREE_CODE (TREE_TYPE (parm
)) == REFERENCE_TYPE
13280 && TYPE_SIZE (TREE_TYPE (TREE_TYPE (parm
))))
13281 SET_DECL_REFERENCE_SLOT (parm
, convert_from_reference (parm
));
13285 if (! building_stmt_tree ()
13286 && (cleanup
= maybe_build_cleanup (parm
), cleanup
))
13288 expand_decl (parm
);
13289 parms_have_cleanups
= 1;
13291 /* Keep track of the cleanups. */
13292 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13297 /* If we find an enum constant or a type tag,
13298 put it aside for the moment. */
13299 TREE_CHAIN (parm
) = NULL_TREE
;
13300 nonparms
= chainon (nonparms
, parm
);
13304 /* Get the decls in their original chain order
13305 and record in the function. This is all and only the
13306 PARM_DECLs that were pushed into scope by the loop above. */
13307 DECL_ARGUMENTS (fndecl
) = getdecls ();
13309 storetags (chainon (parmtags
, gettags ()));
13312 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13314 /* Now store the final chain of decls for the arguments
13315 as the decl-chain of the current lexical scope.
13316 Put the enumerators in as well, at the front so that
13317 DECL_ARGUMENTS is not modified. */
13319 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13321 /* Declare __FUNCTION__ and __PRETTY_FUNCTION__ for this function. */
13322 declare_function_name ();
13324 /* Initialize the RTL code for the function. */
13325 DECL_SAVED_INSNS (fndecl
) = 0;
13326 if (! building_stmt_tree ())
13327 expand_function_start (fndecl
, parms_have_cleanups
);
13329 current_function_parms_stored
= 1;
13331 /* If this function is `main', emit a call to `__main'
13332 to run global initializers, etc. */
13333 if (DECL_MAIN_P (fndecl
) && !building_stmt_tree ())
13334 expand_main_function ();
13336 /* Now that we have initialized the parms, we can start their
13337 cleanups. We cannot do this before, since expand_decl_cleanup
13338 should not be called before the parm can be used. */
13339 if (cleanups
&& !building_stmt_tree ())
13341 for (cleanups
= nreverse (cleanups
); cleanups
; cleanups
= TREE_CHAIN (cleanups
))
13343 if (! expand_decl_cleanup (TREE_PURPOSE (cleanups
), TREE_VALUE (cleanups
)))
13344 cp_error ("parser lost in parsing declaration of `%D'",
13345 TREE_PURPOSE (cleanups
));
13349 /* Create a binding contour which can be used to catch
13350 cleanup-generated temporaries. Also, if the return value needs or
13351 has initialization, deal with that now. */
13352 if (parms_have_cleanups
)
13355 if (!building_stmt_tree ())
13356 expand_start_bindings (0);
13359 if (! building_stmt_tree () && flag_exceptions
)
13361 /* Do the starting of the exception specifications, if we have any. */
13362 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13363 expand_start_eh_spec ();
13366 last_parm_cleanup_insn
= get_last_insn ();
13367 last_dtor_insn
= get_last_insn ();
13370 /* Bind a name and initialization to the return value of
13371 the current function. */
13374 store_return_init (decl
)
13377 /* If this named return value comes in a register, put it in a
13378 pseudo-register. */
13379 if (DECL_REGISTER (decl
))
13381 original_result_rtx
= DECL_RTL (decl
);
13382 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
13387 /* Finish up a function declaration and compile that function
13388 all the way to assembler language output. The free the storage
13389 for the function definition.
13391 This is called after parsing the body of the function definition.
13392 LINENO is the current line number.
13394 FLAGS is a bitwise or of the following values:
13396 An extra call to poplevel (and expand_end_bindings) must be
13397 made to take care of the binding contour for the base
13398 initializers. This is only relevant for constructors.
13400 We just finished processing the body of an in-class inline
13401 function definition. (This processing will have taken place
13402 after the class definition is complete.)
13404 NESTED is nonzero if we were in the middle of compiling another function
13405 when we started on this one. */
13408 finish_function (lineno
, flags
, nested
)
13413 register tree fndecl
= current_function_decl
;
13414 tree fntype
, ctype
= NULL_TREE
;
13415 rtx fn_last_parm_insn
, insns
;
13416 /* Label to use if this function is supposed to return a value. */
13417 tree no_return_label
= NULL_TREE
;
13418 tree decls
= NULL_TREE
;
13419 int call_poplevel
= (flags
& 1) != 0;
13420 int inclass_inline
= (flags
& 2) != 0;
13423 /* When we get some parse errors, we can end up without a
13424 current_function_decl, so cope. */
13425 if (fndecl
== NULL_TREE
)
13428 if (function_depth
> 1)
13431 fntype
= TREE_TYPE (fndecl
);
13433 /* TREE_READONLY (fndecl) = 1;
13434 This caused &foo to be of type ptr-to-const-function
13435 which then got a warning when stored in a ptr-to-function variable. */
13437 /* This happens on strange parse errors. */
13438 if (! current_function_parms_stored
)
13441 store_parm_decls ();
13444 if (building_stmt_tree ())
13446 if (DECL_CONSTRUCTOR_P (fndecl
) && call_poplevel
)
13448 decls
= getdecls ();
13449 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13450 poplevel (decls
!= NULL_TREE
, 0, 0);
13455 if (write_symbols
!= NO_DEBUG
/*&& TREE_CODE (fntype) != METHOD_TYPE*/)
13457 tree ttype
= target_type (fntype
);
13460 if (IS_AGGR_TYPE (ttype
))
13461 /* Let debugger know it should output info for this type. */
13462 note_debug_info_needed (ttype
);
13464 for (parmdecl
= DECL_ARGUMENTS (fndecl
); parmdecl
; parmdecl
= TREE_CHAIN (parmdecl
))
13466 ttype
= target_type (TREE_TYPE (parmdecl
));
13467 if (IS_AGGR_TYPE (ttype
))
13468 /* Let debugger know it should output info for this type. */
13469 note_debug_info_needed (ttype
);
13473 /* Clean house because we will need to reorder insns here. */
13474 do_pending_stack_adjust ();
13478 tree binfo
= TYPE_BINFO (current_class_type
);
13479 tree cond
= integer_one_node
;
13481 tree in_charge_node
= lookup_name (in_charge_identifier
, 0);
13483 int ok_to_optimize_dtor
= 0;
13484 int empty_dtor
= get_last_insn () == last_dtor_insn
;
13486 if (current_function_assigns_this
)
13487 cond
= build (NE_EXPR
, boolean_type_node
,
13488 current_class_ptr
, integer_zero_node
);
13491 int n_baseclasses
= CLASSTYPE_N_BASECLASSES (current_class_type
);
13493 /* If this destructor is empty, then we don't need to check
13494 whether `this' is NULL in some cases. */
13495 if ((flag_this_is_variable
& 1) == 0)
13496 ok_to_optimize_dtor
= 1;
13497 else if (empty_dtor
)
13498 ok_to_optimize_dtor
13499 = (n_baseclasses
== 0
13500 || (n_baseclasses
== 1
13501 && TYPE_HAS_DESTRUCTOR (TYPE_BINFO_BASETYPE (current_class_type
, 0))));
13504 /* These initializations might go inline. Protect
13505 the binding level of the parms. */
13507 expand_start_bindings (0);
13509 if (current_function_assigns_this
)
13511 current_function_assigns_this
= 0;
13512 current_function_just_assigned_this
= 0;
13515 /* Generate the code to call destructor on base class.
13516 If this destructor belongs to a class with virtual
13517 functions, then set the virtual function table
13518 pointer to represent the type of our base class. */
13520 /* This side-effect makes call to `build_delete' generate the
13521 code we have to have at the end of this destructor.
13522 `build_delete' will set the flag again. */
13523 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
13525 /* These are two cases where we cannot delegate deletion. */
13526 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)
13527 || TYPE_GETS_REG_DELETE (current_class_type
))
13528 exprstmt
= build_delete (current_class_type
, current_class_ref
, integer_zero_node
,
13529 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
, 0);
13531 exprstmt
= build_delete (current_class_type
, current_class_ref
, in_charge_node
,
13532 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
, 0);
13534 /* If we did not assign to this, then `this' is non-zero at
13535 the end of a destructor. As a special optimization, don't
13536 emit test if this is an empty destructor. If it does nothing,
13537 it does nothing. If it calls a base destructor, the base
13538 destructor will perform the test. */
13540 if (exprstmt
!= error_mark_node
13541 && (TREE_CODE (exprstmt
) != NOP_EXPR
13542 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
13543 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
13545 expand_label (dtor_label
);
13546 if (cond
!= integer_one_node
)
13547 expand_start_cond (cond
, 0);
13548 if (exprstmt
!= void_zero_node
)
13549 /* Don't call `expand_expr_stmt' if we're not going to do
13550 anything, since -Wall will give a diagnostic. */
13551 expand_expr_stmt (exprstmt
);
13553 /* Run destructor on all virtual baseclasses. */
13554 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13556 tree vbases
= nreverse (copy_list (CLASSTYPE_VBASECLASSES (current_class_type
)));
13557 expand_start_cond (build (BIT_AND_EXPR
, integer_type_node
,
13558 in_charge_node
, integer_two_node
), 0);
13561 if (TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (vbases
)))
13563 tree vb
= get_vbase
13564 (BINFO_TYPE (vbases
),
13565 TYPE_BINFO (current_class_type
));
13567 (build_scoped_method_call
13568 (current_class_ref
, vb
, dtor_identifier
,
13569 build_expr_list (NULL_TREE
, integer_zero_node
)));
13571 vbases
= TREE_CHAIN (vbases
);
13573 expand_end_cond ();
13576 do_pending_stack_adjust ();
13577 if (cond
!= integer_one_node
)
13578 expand_end_cond ();
13581 virtual_size
= c_sizeof (current_class_type
);
13583 /* At the end, call delete if that's what's requested. */
13585 /* FDIS sez: At the point of definition of a virtual destructor
13586 (including an implicit definition), non-placement operator
13587 delete shall be looked up in the scope of the destructor's
13588 class and if found shall be accessible and unambiguous.
13590 This is somewhat unclear, but I take it to mean that if the
13591 class only defines placement deletes we don't do anything here.
13592 So we pass LOOKUP_SPECULATIVELY; delete_sanity will complain
13593 for us if they ever try to delete one of these. */
13595 if (TYPE_GETS_REG_DELETE (current_class_type
)
13596 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13597 exprstmt
= build_op_delete_call
13598 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
13599 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
13601 exprstmt
= NULL_TREE
;
13605 cond
= build (BIT_AND_EXPR
, integer_type_node
,
13606 in_charge_node
, integer_one_node
);
13607 expand_start_cond (cond
, 0);
13608 expand_expr_stmt (exprstmt
);
13609 expand_end_cond ();
13612 /* End of destructor. */
13613 expand_end_bindings (NULL_TREE
, getdecls () != NULL_TREE
, 0);
13614 poplevel (getdecls () != NULL_TREE
, 0, 0);
13616 /* Back to the top of destructor. */
13617 /* Don't execute destructor code if `this' is NULL. */
13621 /* If the dtor is empty, and we know there is not possible way we
13622 could use any vtable entries, before they are possibly set by
13623 a base class dtor, we don't have to setup the vtables, as we
13624 know that any base class dtoring will set up any vtables it
13625 needs. We avoid MI, because one base class dtor can do a
13626 virtual dispatch to an overridden function that would need to
13627 have a non-related vtable set up, we cannot avoid setting up
13628 vtables in that case. We could change this to see if there is
13629 just one vtable. */
13630 if (! empty_dtor
|| TYPE_USES_COMPLEX_INHERITANCE (current_class_type
))
13632 /* Make all virtual function table pointers in non-virtual base
13633 classes point to CURRENT_CLASS_TYPE's virtual function
13635 expand_direct_vtbls_init (binfo
, binfo
, 1, 0, current_class_ptr
);
13637 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13638 expand_indirect_vtbls_init (binfo
, current_class_ref
, current_class_ptr
);
13641 if (! ok_to_optimize_dtor
)
13643 cond
= build_binary_op (NE_EXPR
,
13644 current_class_ptr
, integer_zero_node
);
13645 expand_start_cond (cond
, 0);
13648 insns
= get_insns ();
13651 fn_last_parm_insn
= get_first_nonparm_insn ();
13652 if (fn_last_parm_insn
== NULL_RTX
)
13653 fn_last_parm_insn
= get_last_insn ();
13655 fn_last_parm_insn
= previous_insn (fn_last_parm_insn
);
13657 emit_insns_after (insns
, fn_last_parm_insn
);
13659 if (! ok_to_optimize_dtor
)
13660 expand_end_cond ();
13662 else if (current_function_assigns_this
)
13664 /* Does not need to call emit_base_init, because
13665 that is done (if needed) just after assignment to this
13668 if (DECL_CONSTRUCTOR_P (current_function_decl
))
13670 end_protect_partials ();
13671 expand_label (ctor_label
);
13672 ctor_label
= NULL_TREE
;
13676 decls
= getdecls ();
13677 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13678 poplevel (decls
!= NULL_TREE
, 0, 0);
13680 /* c_expand_return knows to return 'this' from a constructor. */
13681 c_expand_return (NULL_TREE
);
13683 else if (TREE_CODE (TREE_TYPE (DECL_RESULT (current_function_decl
))) != VOID_TYPE
13684 && return_label
!= NULL_RTX
)
13685 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13687 current_function_assigns_this
= 0;
13688 current_function_just_assigned_this
= 0;
13689 base_init_expr
= NULL_TREE
;
13691 else if (DECL_CONSTRUCTOR_P (fndecl
))
13693 tree cond
= NULL_TREE
, thenclause
= NULL_TREE
;
13694 /* Allow constructor for a type to get a new instance of the object
13695 using `build_new'. */
13696 tree abstract_virtuals
= CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
);
13697 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
) = NULL_TREE
;
13699 if (flag_this_is_variable
> 0)
13701 cond
= build_binary_op (EQ_EXPR
,
13702 current_class_ptr
, integer_zero_node
);
13703 thenclause
= build_modify_expr (current_class_ptr
, NOP_EXPR
,
13704 build_new (NULL_TREE
, current_class_type
, void_type_node
, 0));
13707 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
) = abstract_virtuals
;
13711 if (flag_this_is_variable
> 0)
13713 expand_start_cond (cond
, 0);
13714 expand_expr_stmt (thenclause
);
13715 expand_end_cond ();
13718 /* Emit insns from `emit_base_init' which sets up virtual
13719 function table pointer(s). */
13720 if (base_init_expr
)
13722 expand_expr_stmt (base_init_expr
);
13723 base_init_expr
= NULL_TREE
;
13726 insns
= get_insns ();
13729 /* This is where the body of the constructor begins. */
13731 emit_insns_after (insns
, last_parm_cleanup_insn
);
13733 end_protect_partials ();
13735 /* This is where the body of the constructor ends. */
13736 expand_label (ctor_label
);
13737 ctor_label
= NULL_TREE
;
13741 decls
= getdecls ();
13742 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13743 poplevel (decls
!= NULL_TREE
, 1, 0);
13746 /* c_expand_return knows to return 'this' from a constructor. */
13747 c_expand_return (NULL_TREE
);
13749 current_function_assigns_this
= 0;
13750 current_function_just_assigned_this
= 0;
13752 else if (DECL_MAIN_P (fndecl
))
13754 /* Make it so that `main' always returns 0 by default. */
13756 c_expand_return (integer_one_node
);
13758 c_expand_return (integer_zero_node
);
13761 else if (return_label
!= NULL_RTX
13762 && current_function_return_value
== NULL_TREE
13763 && ! DECL_NAME (DECL_RESULT (current_function_decl
)))
13764 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13766 if (flag_exceptions
)
13767 expand_exception_blocks ();
13769 /* If this function is supposed to return a value, ensure that
13770 we do not fall into the cleanups by mistake. The end of our
13771 function will look like this:
13773 user code (may have return stmt somewhere)
13774 goto no_return_label
13779 NOTE_INSN_FUNCTION_END
13783 If the user omits a return stmt in the USER CODE section, we
13784 will have a control path which reaches NOTE_INSN_FUNCTION_END.
13785 Otherwise, we won't. */
13786 if (no_return_label
)
13788 DECL_CONTEXT (no_return_label
) = fndecl
;
13789 DECL_INITIAL (no_return_label
) = error_mark_node
;
13790 DECL_SOURCE_FILE (no_return_label
) = input_filename
;
13791 DECL_SOURCE_LINE (no_return_label
) = lineno
;
13792 expand_goto (no_return_label
);
13797 /* Remove the binding contour which is used
13798 to catch cleanup-generated temporaries. */
13799 expand_end_bindings (0, 0, 0);
13800 poplevel (0, 0, 0);
13802 /* Emit label at beginning of cleanup code for parameters. */
13803 emit_label (cleanup_label
);
13806 /* Get return value into register if that's where it's supposed to be. */
13807 if (original_result_rtx
)
13808 fixup_result_decl (DECL_RESULT (fndecl
), original_result_rtx
);
13810 /* Finish building code that will trigger warnings if users forget
13811 to make their functions return values. */
13812 if (no_return_label
|| cleanup_label
)
13813 emit_jump (return_label
);
13814 if (no_return_label
)
13816 /* We don't need to call `expand_*_return' here because we
13817 don't need any cleanups here--this path of code is only
13818 for error checking purposes. */
13819 expand_label (no_return_label
);
13822 /* Generate rtl for function exit. */
13823 expand_function_end (input_filename
, lineno
, 1);
13826 /* We have to save this value here in case
13827 maybe_end_member_template_processing decides to pop all the
13828 template parameters. */
13829 expand_p
= !building_stmt_tree ();
13831 /* If we're saving up tree structure, tie off the function now. */
13833 finish_stmt_tree (fndecl
);
13835 /* This must come after expand_function_end because cleanups might
13836 have declarations (from inline functions) that need to go into
13837 this function's blocks. */
13838 if (current_binding_level
->parm_flag
!= 1)
13839 my_friendly_abort (122);
13840 poplevel (1, 0, 1);
13842 /* If this is a in-class inline definition, we may have to pop the
13843 bindings for the template parameters that we added in
13844 maybe_begin_member_template_processing when start_function was
13846 if (inclass_inline
)
13847 maybe_end_member_template_processing ();
13849 /* Reset scope for C++: if we were in the scope of a class,
13850 then when we finish this function, we are not longer so.
13851 This cannot be done until we know for sure that no more
13852 class members will ever be referenced in this function
13853 (i.e., calls to destructors). */
13854 if (current_class_name
)
13856 ctype
= current_class_type
;
13857 pop_nested_class ();
13860 /* Must mark the RESULT_DECL as being in this function. */
13861 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
13863 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
13864 to the FUNCTION_DECL node itself. */
13865 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
13867 /* Undo the call to push_momentary in start_function. */
13872 int saved_flag_keep_inline_functions
=
13873 flag_keep_inline_functions
;
13875 /* So we can tell if jump_optimize sets it to 1. */
13878 if (DECL_CONTEXT (fndecl
) != NULL_TREE
13879 && hack_decl_function_context (fndecl
))
13880 /* Trick rest_of_compilation into not deferring output of this
13881 function, even if it is inline, since the rtl_obstack for
13882 this function is the function_obstack of the enclosing
13883 function and will be deallocated when the enclosing
13884 function is gone. See save_tree_status. */
13885 flag_keep_inline_functions
= 1;
13887 /* Run the optimizers and output the assembler code for this
13890 if (DECL_ARTIFICIAL (fndecl
))
13892 /* Do we really *want* to inline this synthesized method? */
13894 int save_fif
= flag_inline_functions
;
13895 flag_inline_functions
= 1;
13897 /* Turn off DECL_INLINE for the moment so function_cannot_inline_p
13898 will check our size. */
13899 DECL_INLINE (fndecl
) = 0;
13901 rest_of_compilation (fndecl
);
13902 flag_inline_functions
= save_fif
;
13905 rest_of_compilation (fndecl
);
13907 flag_keep_inline_functions
= saved_flag_keep_inline_functions
;
13909 if (DECL_SAVED_INSNS (fndecl
) && ! TREE_ASM_WRITTEN (fndecl
))
13911 /* Set DECL_EXTERNAL so that assemble_external will be called as
13912 necessary. We'll clear it again in finish_file. */
13913 if (! DECL_EXTERNAL (fndecl
))
13914 DECL_NOT_REALLY_EXTERN (fndecl
) = 1;
13915 DECL_EXTERNAL (fndecl
) = 1;
13916 mark_inline_for_output (fndecl
);
13919 if (ctype
&& TREE_ASM_WRITTEN (fndecl
))
13920 note_debug_info_needed (ctype
);
13922 current_function_returns_null
|= can_reach_end
;
13924 /* Since we don't normally go through c_expand_return for constructors,
13925 this normally gets the wrong value.
13926 Also, named return values have their return codes emitted after
13927 NOTE_INSN_FUNCTION_END, confusing jump.c. */
13928 if (DECL_CONSTRUCTOR_P (fndecl
)
13929 || DECL_NAME (DECL_RESULT (fndecl
)) != NULL_TREE
)
13930 current_function_returns_null
= 0;
13932 if (TREE_THIS_VOLATILE (fndecl
) && current_function_returns_null
)
13933 cp_warning ("`noreturn' function `%D' does return", fndecl
);
13934 else if ((warn_return_type
|| pedantic
)
13935 && current_function_returns_null
13936 && TREE_CODE (TREE_TYPE (fntype
)) != VOID_TYPE
)
13938 /* If this function returns non-void and control can drop through,
13940 cp_warning ("control reaches end of non-void function `%D'", fndecl
);
13942 /* With just -W, complain only if function returns both with
13943 and without a value. */
13944 else if (extra_warnings
13945 && current_function_returns_value
&& current_function_returns_null
)
13946 warning ("this function may return with or without a value");
13951 /* Free all the tree nodes making up this function. */
13952 /* Switch back to allocating nodes permanently
13953 until we start another function. */
13955 permanent_allocation (1);
13957 if (DECL_SAVED_INSNS (fndecl
) == 0)
13961 /* Stop pointing to the local nodes about to be freed. */
13962 /* But DECL_INITIAL must remain nonzero so we know this
13963 was an actual function definition. */
13964 DECL_INITIAL (fndecl
) = error_mark_node
;
13965 for (t
= DECL_ARGUMENTS (fndecl
); t
; t
= TREE_CHAIN (t
))
13966 DECL_RTL (t
) = DECL_INCOMING_RTL (t
) = NULL_RTX
;
13969 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
13970 static_ctors
= perm_tree_cons (NULL_TREE
, fndecl
, static_ctors
);
13971 if (DECL_STATIC_DESTRUCTOR (fndecl
))
13972 static_dtors
= perm_tree_cons (NULL_TREE
, fndecl
, static_dtors
);
13976 /* Let the error reporting routines know that we're outside a
13977 function. For a nested function, this value is used in
13978 pop_cp_function_context and then reset via pop_function_context. */
13979 current_function_decl
= NULL_TREE
;
13982 named_label_uses
= NULL
;
13983 current_class_ptr
= NULL_TREE
;
13984 current_class_ref
= NULL_TREE
;
13987 /* Create the FUNCTION_DECL for a function definition.
13988 DECLSPECS and DECLARATOR are the parts of the declaration;
13989 they describe the return type and the name of the function,
13990 but twisted together in a fashion that parallels the syntax of C.
13992 This function creates a binding context for the function body
13993 as well as setting up the FUNCTION_DECL in current_function_decl.
13995 Returns a FUNCTION_DECL on success.
13997 If the DECLARATOR is not suitable for a function (it defines a datum
13998 instead), we return 0, which tells yyparse to report a parse error.
14000 May return void_type_node indicating that this method is actually
14001 a friend. See grokfield for more details.
14003 Came here with a `.pushlevel' .
14005 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14006 CHANGES TO CODE IN `grokfield'. */
14009 start_method (declspecs
, declarator
, attrlist
)
14010 tree declarator
, declspecs
, attrlist
;
14012 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
14015 /* Something too ugly to handle. */
14016 if (fndecl
== NULL_TREE
)
14019 /* Pass friends other than inline friend functions back. */
14020 if (fndecl
== void_type_node
)
14023 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
14024 /* Not a function, tell parser to report parse error. */
14027 if (DECL_IN_AGGR_P (fndecl
))
14029 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
14031 if (DECL_CONTEXT (fndecl
)
14032 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
14033 cp_error ("`%D' is already defined in class %s", fndecl
,
14034 TYPE_NAME_STRING (DECL_CONTEXT (fndecl
)));
14036 return void_type_node
;
14039 check_template_shadow (fndecl
);
14041 DECL_THIS_INLINE (fndecl
) = 1;
14043 if (flag_default_inline
)
14044 DECL_INLINE (fndecl
) = 1;
14046 /* We process method specializations in finish_struct_1. */
14047 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
14048 fndecl
= push_template_decl (fndecl
);
14050 /* We read in the parameters on the maybepermanent_obstack,
14051 but we won't be getting back to them until after we
14052 may have clobbered them. So the call to preserve_data
14053 will keep them safe. */
14056 if (! DECL_FRIEND_P (fndecl
))
14058 if (TREE_CHAIN (fndecl
))
14060 fndecl
= copy_node (fndecl
);
14061 TREE_CHAIN (fndecl
) = NULL_TREE
;
14064 if (DECL_CONSTRUCTOR_P (fndecl
))
14066 if (! grok_ctor_properties (current_class_type
, fndecl
))
14067 return void_type_node
;
14069 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
14070 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
14073 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0, 0);
14075 /* Make a place for the parms */
14077 current_binding_level
->parm_flag
= 1;
14079 DECL_IN_AGGR_P (fndecl
) = 1;
14083 /* Go through the motions of finishing a function definition.
14084 We don't compile this method until after the whole class has
14087 FINISH_METHOD must return something that looks as though it
14088 came from GROKFIELD (since we are defining a method, after all).
14090 This is called after parsing the body of the function definition.
14091 STMTS is the chain of statements that makes up the function body.
14093 DECL is the ..._DECL that `start_method' provided. */
14096 finish_method (decl
)
14099 register tree fndecl
= decl
;
14102 register tree link
;
14104 if (decl
== void_type_node
)
14107 old_initial
= DECL_INITIAL (fndecl
);
14109 /* Undo the level for the parms (from start_method).
14110 This is like poplevel, but it causes nothing to be
14111 saved. Saving information here confuses symbol-table
14112 output routines. Besides, this information will
14113 be correctly output when this method is actually
14116 /* Clear out the meanings of the local variables of this level;
14117 also record in each decl which block it belongs to. */
14119 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
14121 if (DECL_NAME (link
) != NULL_TREE
)
14122 pop_binding (DECL_NAME (link
), link
);
14123 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
14124 DECL_CONTEXT (link
) = NULL_TREE
;
14127 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
14128 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
14129 current_binding_level
->parm_flag
,
14130 current_binding_level
->keep
);
14132 poplevel (0, 0, 0);
14134 DECL_INITIAL (fndecl
) = old_initial
;
14136 /* We used to check if the context of FNDECL was different from
14137 current_class_type as another way to get inside here. This didn't work
14138 for String.cc in libg++. */
14139 if (DECL_FRIEND_P (fndecl
))
14141 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
14142 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
14143 decl
= void_type_node
;
14149 /* Called when a new struct TYPE is defined.
14150 If this structure or union completes the type of any previous
14151 variable declaration, lay it out and output its rtl. */
14154 hack_incomplete_structures (type
)
14159 if (current_binding_level
->incomplete
== NULL_TREE
)
14162 if (!type
) /* Don't do this for class templates. */
14165 for (list
= ¤t_binding_level
->incomplete
; *list
; )
14167 tree decl
= TREE_VALUE (*list
);
14168 if ((decl
&& TREE_TYPE (decl
) == type
)
14169 || (TREE_TYPE (decl
)
14170 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14171 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
14173 int toplevel
= toplevel_bindings_p ();
14174 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14175 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
14176 layout_type (TREE_TYPE (decl
));
14177 layout_decl (decl
, 0);
14178 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
14182 expand_decl (decl
);
14183 cleanup
= maybe_build_cleanup (decl
);
14184 expand_decl_init (decl
);
14185 if (! expand_decl_cleanup (decl
, cleanup
))
14186 cp_error ("parser lost in parsing declaration of `%D'",
14189 *list
= TREE_CHAIN (*list
);
14192 list
= &TREE_CHAIN (*list
);
14196 /* If DECL is of a type which needs a cleanup, build that cleanup here.
14197 See build_delete for information about AUTO_DELETE.
14199 Don't build these on the momentary obstack; they must live
14200 the life of the binding contour. */
14203 maybe_build_cleanup_1 (decl
, auto_delete
)
14204 tree decl
, auto_delete
;
14206 tree type
= TREE_TYPE (decl
);
14207 if (type
!= error_mark_node
&& TYPE_NEEDS_DESTRUCTOR (type
))
14209 int temp
= 0, flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14212 if (TREE_CODE (decl
) != PARM_DECL
)
14213 temp
= suspend_momentary ();
14215 if (TREE_CODE (type
) == ARRAY_TYPE
)
14219 mark_addressable (decl
);
14220 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14223 /* Optimize for space over speed here. */
14224 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14225 || flag_expensive_optimizations
)
14226 flags
|= LOOKUP_NONVIRTUAL
;
14228 rval
= build_delete (TREE_TYPE (rval
), rval
, auto_delete
, flags
, 0);
14230 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14231 && ! TYPE_HAS_DESTRUCTOR (type
))
14232 rval
= build_compound_expr (expr_tree_cons (NULL_TREE
, rval
,
14233 build_expr_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14235 if (TREE_CODE (decl
) != PARM_DECL
)
14236 resume_momentary (temp
);
14243 /* If DECL is of a type which needs a cleanup, build that cleanup
14244 here. The cleanup does free the storage with a call to delete. */
14247 maybe_build_cleanup_and_delete (decl
)
14250 return maybe_build_cleanup_1 (decl
, integer_three_node
);
14253 /* If DECL is of a type which needs a cleanup, build that cleanup
14254 here. The cleanup does not free the storage with a call a delete. */
14257 maybe_build_cleanup (decl
)
14260 return maybe_build_cleanup_1 (decl
, integer_two_node
);
14263 /* Expand a C++ expression at the statement level.
14264 This is needed to ferret out nodes which have UNKNOWN_TYPE.
14265 The C++ type checker should get all of these out when
14266 expressions are combined with other, type-providing, expressions,
14267 leaving only orphan expressions, such as:
14269 &class::bar; / / takes its address, but does nothing with it. */
14272 cplus_expand_expr_stmt (exp
)
14275 exp
= require_complete_type_in_void (exp
);
14277 if (TREE_CODE (exp
) == FUNCTION_DECL
)
14279 cp_warning ("reference, not call, to function `%D'", exp
);
14280 warning ("at this point in file");
14284 /* We should do this eventually, but right now this causes regex.o from
14285 libg++ to miscompile, and tString to core dump. */
14286 exp
= build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (exp
), exp
);
14289 /* Strip unused implicit INDIRECT_REFs of references. */
14290 if (TREE_CODE (exp
) == INDIRECT_REF
14291 && TREE_CODE (TREE_TYPE (TREE_OPERAND (exp
, 0))) == REFERENCE_TYPE
)
14292 exp
= TREE_OPERAND (exp
, 0);
14294 /* If we don't do this, we end up down inside expand_expr
14295 trying to do TYPE_MODE on the ERROR_MARK, and really
14296 go outside the bounds of the type. */
14297 if (exp
!= error_mark_node
)
14298 expand_expr_stmt (break_out_cleanups (exp
));
14301 /* When a stmt has been parsed, this function is called. */
14306 if (!current_function_assigns_this
14307 && current_function_just_assigned_this
)
14309 if (DECL_CONSTRUCTOR_P (current_function_decl
))
14311 /* Constructors must wait until we are out of control
14312 zones before calling base constructors. */
14313 if (in_control_zone_p ())
14315 expand_expr_stmt (base_init_expr
);
14316 check_base_init (current_class_type
);
14318 current_function_assigns_this
= 1;
14321 /* Always assume this statement was not an expression statement. If
14322 it actually was an expression statement, its our callers
14323 responsibility to fix this up. */
14324 last_expr_type
= NULL_TREE
;
14327 /* Change a static member function definition into a FUNCTION_TYPE, instead
14328 of the METHOD_TYPE that we create when it's originally parsed.
14330 WARNING: DO NOT pass &TREE_TYPE (decl) to FN or &TYPE_ARG_TYPES
14331 (TREE_TYPE (decl)) to ARGTYPES, as doing so will corrupt the types of
14332 other decls. Either pass the addresses of local variables or NULL. */
14335 revert_static_member_fn (decl
, fn
, argtypes
)
14336 tree
*decl
, *fn
, *argtypes
;
14339 tree function
= fn
? *fn
: TREE_TYPE (*decl
);
14340 tree args
= argtypes
? *argtypes
: TYPE_ARG_TYPES (function
);
14342 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14343 != TYPE_UNQUALIFIED
)
14344 cp_error ("static member function `%#D' declared with type qualifiers",
14347 args
= TREE_CHAIN (args
);
14348 tmp
= build_function_type (TREE_TYPE (function
), args
);
14349 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14350 tmp
= build_exception_variant (tmp
,
14351 TYPE_RAISES_EXCEPTIONS (function
));
14352 TREE_TYPE (*decl
) = tmp
;
14353 if (DECL_ARGUMENTS (*decl
))
14354 DECL_ARGUMENTS (*decl
) = TREE_CHAIN (DECL_ARGUMENTS (*decl
));
14355 DECL_STATIC_FUNCTION_P (*decl
) = 1;
14367 int just_assigned_this
;
14369 int temp_name_counter
;
14371 struct named_label_list
*named_label_uses
;
14372 tree shadowed_labels
;
14375 rtx last_dtor_insn
;
14376 rtx last_parm_cleanup_insn
;
14377 tree base_init_list
;
14378 tree member_init_list
;
14379 tree base_init_expr
;
14380 tree current_class_ptr
;
14381 tree current_class_ref
;
14383 struct cp_function
*next
;
14384 struct binding_level
*binding_level
;
14385 int static_labelno
;
14386 int in_function_try_handler
;
14388 int stmts_are_full_exprs_p
;
14390 tree last_expr_type
;
14393 static struct cp_function
*cp_function_chain
;
14395 extern int temp_name_counter
;
14397 /* Save and reinitialize the variables
14398 used during compilation of a C++ function. */
14401 push_cp_function_context (context
)
14404 struct cp_function
*p
14405 = (struct cp_function
*) xmalloc (sizeof (struct cp_function
));
14407 push_function_context_to (context
);
14409 p
->next
= cp_function_chain
;
14410 cp_function_chain
= p
;
14412 p
->named_labels
= named_labels
;
14413 p
->named_label_uses
= named_label_uses
;
14414 p
->shadowed_labels
= shadowed_labels
;
14415 p
->returns_value
= current_function_returns_value
;
14416 p
->returns_null
= current_function_returns_null
;
14417 p
->binding_level
= current_binding_level
;
14418 p
->ctor_label
= ctor_label
;
14419 p
->dtor_label
= dtor_label
;
14420 p
->last_dtor_insn
= last_dtor_insn
;
14421 p
->last_parm_cleanup_insn
= last_parm_cleanup_insn
;
14422 p
->assigns_this
= current_function_assigns_this
;
14423 p
->just_assigned_this
= current_function_just_assigned_this
;
14424 p
->parms_stored
= current_function_parms_stored
;
14425 p
->result_rtx
= original_result_rtx
;
14426 p
->base_init_expr
= base_init_expr
;
14427 p
->temp_name_counter
= temp_name_counter
;
14428 p
->base_init_list
= current_base_init_list
;
14429 p
->member_init_list
= current_member_init_list
;
14430 p
->current_class_ptr
= current_class_ptr
;
14431 p
->current_class_ref
= current_class_ref
;
14432 p
->static_labelno
= static_labelno
;
14433 p
->in_function_try_handler
= in_function_try_handler
;
14434 p
->last_tree
= last_tree
;
14435 p
->last_expr_type
= last_expr_type
;
14436 p
->expanding_p
= expanding_p
;
14437 p
->stmts_are_full_exprs_p
= stmts_are_full_exprs_p
;
14439 /* For now, we always assume we're expanding all the way to RTL
14440 unless we're explicitly doing otherwise. */
14443 /* Whenever we start a new function, we destroy temporaries in the
14445 stmts_are_full_exprs_p
= 1;
14448 /* Restore the variables used during compilation of a C++ function. */
14451 pop_cp_function_context (context
)
14454 struct cp_function
*p
= cp_function_chain
;
14457 /* Bring back all the labels that were shadowed. */
14458 for (link
= shadowed_labels
; link
; link
= TREE_CHAIN (link
))
14459 if (DECL_NAME (TREE_VALUE (link
)) != 0)
14460 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (TREE_VALUE (link
)),
14461 TREE_VALUE (link
));
14463 pop_function_context_from (context
);
14465 cp_function_chain
= p
->next
;
14467 named_labels
= p
->named_labels
;
14468 named_label_uses
= p
->named_label_uses
;
14469 shadowed_labels
= p
->shadowed_labels
;
14470 current_function_returns_value
= p
->returns_value
;
14471 current_function_returns_null
= p
->returns_null
;
14472 current_binding_level
= p
->binding_level
;
14473 ctor_label
= p
->ctor_label
;
14474 dtor_label
= p
->dtor_label
;
14475 last_dtor_insn
= p
->last_dtor_insn
;
14476 last_parm_cleanup_insn
= p
->last_parm_cleanup_insn
;
14477 current_function_assigns_this
= p
->assigns_this
;
14478 current_function_just_assigned_this
= p
->just_assigned_this
;
14479 current_function_parms_stored
= p
->parms_stored
;
14480 original_result_rtx
= p
->result_rtx
;
14481 base_init_expr
= p
->base_init_expr
;
14482 temp_name_counter
= p
->temp_name_counter
;
14483 current_base_init_list
= p
->base_init_list
;
14484 current_member_init_list
= p
->member_init_list
;
14485 current_class_ptr
= p
->current_class_ptr
;
14486 current_class_ref
= p
->current_class_ref
;
14487 static_labelno
= p
->static_labelno
;
14488 in_function_try_handler
= p
->in_function_try_handler
;
14489 last_tree
= p
->last_tree
;
14490 last_expr_type
= p
->last_expr_type
;
14491 expanding_p
= p
->expanding_p
;
14492 stmts_are_full_exprs_p
= p
->stmts_are_full_exprs_p
;
14500 return function_depth
!= 0;