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 if (building_stmt_tree ())
4833 push_permanent_obstack ();
4834 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4835 if (building_stmt_tree ())
4838 /* Make sure every label has an rtx. */
4841 /* A label not explicitly declared must be local to where it's ref'd. */
4842 DECL_CONTEXT (decl
) = current_function_decl
;
4844 DECL_MODE (decl
) = VOIDmode
;
4846 /* Say where one reference is to the label,
4847 for the sake of the error if it is not defined. */
4848 DECL_SOURCE_LINE (decl
) = lineno
;
4849 DECL_SOURCE_FILE (decl
) = input_filename
;
4851 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4853 named_labels
= tree_cons (NULL_TREE
, decl
, named_labels
);
4854 named_label_uses
->label_decl
= decl
;
4859 /* Make a label named NAME in the current function,
4860 shadowing silently any that may be inherited from containing functions
4861 or containing scopes.
4863 Note that valid use, if the label being shadowed
4864 comes from another scope in the same function,
4865 requires calling declare_nonlocal_label right away. */
4871 register tree decl
= IDENTIFIER_LABEL_VALUE (name
);
4873 if (decl
!= NULL_TREE
)
4875 shadowed_labels
= tree_cons (NULL_TREE
, decl
, shadowed_labels
);
4876 SET_IDENTIFIER_LABEL_VALUE (name
, NULL_TREE
);
4879 return lookup_label (name
);
4882 /* Define a label, specifying the location in the source file.
4883 Return the LABEL_DECL node for the label, if the definition is valid.
4884 Otherwise return 0. */
4887 define_label (filename
, line
, name
)
4892 tree decl
= lookup_label (name
);
4894 /* After labels, make any new cleanups go into their
4895 own new (temporary) binding contour. */
4896 current_binding_level
->more_cleanups_ok
= 0;
4898 /* If label with this name is known from an outer context, shadow it. */
4899 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) != current_function_decl
)
4901 shadowed_labels
= tree_cons (NULL_TREE
, decl
, shadowed_labels
);
4902 SET_IDENTIFIER_LABEL_VALUE (name
, NULL_TREE
);
4903 decl
= lookup_label (name
);
4906 if (name
== get_identifier ("wchar_t"))
4907 cp_pedwarn ("label named wchar_t");
4909 if (DECL_INITIAL (decl
) != NULL_TREE
)
4911 cp_error ("duplicate label `%D'", decl
);
4916 struct named_label_list
*uses
, *prev
;
4920 /* Mark label as having been defined. */
4921 DECL_INITIAL (decl
) = error_mark_node
;
4922 /* Say where in the source. */
4923 DECL_SOURCE_FILE (decl
) = filename
;
4924 DECL_SOURCE_LINE (decl
) = line
;
4927 uses
= named_label_uses
;
4928 while (uses
!= NULL
)
4929 if (uses
->label_decl
== decl
)
4931 struct binding_level
*b
= current_binding_level
;
4934 tree new_decls
= b
->names
;
4935 tree old_decls
= (b
== uses
->binding_level
)
4936 ? uses
->names_in_scope
: NULL_TREE
;
4937 while (new_decls
!= old_decls
)
4939 if (TREE_CODE (new_decls
) == VAR_DECL
4940 /* Don't complain about crossing initialization
4941 of internal entities. They can't be accessed,
4942 and they should be cleaned up
4943 by the time we get to the label. */
4944 && ! DECL_ARTIFICIAL (new_decls
)
4945 && !(DECL_INITIAL (new_decls
) == NULL_TREE
4946 && pod_type_p (TREE_TYPE (new_decls
))))
4948 /* This is really only important if we're crossing
4949 an initialization. The POD stuff is just
4950 pedantry; why should it matter if the class
4951 contains a field of pointer to member type? */
4952 int problem
= (DECL_INITIAL (new_decls
)
4953 || (TYPE_NEEDS_CONSTRUCTING
4954 (TREE_TYPE (new_decls
))));
4960 cp_error ("jump to label `%D'", decl
);
4961 error_with_file_and_line
4962 (uses
->filename_o_goto
,
4963 uses
->lineno_o_goto
, " from here");
4967 cp_pedwarn ("jump to label `%D'", decl
);
4968 pedwarn_with_file_and_line
4969 (uses
->filename_o_goto
,
4970 uses
->lineno_o_goto
, " from here");
4976 cp_error_at (" crosses initialization of `%#D'",
4979 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4982 new_decls
= TREE_CHAIN (new_decls
);
4984 if (b
== uses
->binding_level
)
4986 if (b
->eh_region
&& ! saw_eh
)
4990 cp_error ("jump to label `%D'", decl
);
4991 error_with_file_and_line
4992 (uses
->filename_o_goto
,
4993 uses
->lineno_o_goto
, " from here");
4996 error (" enters exception handling block");
5003 prev
->next
= uses
->next
;
5005 named_label_uses
= uses
->next
;
5014 current_function_return_value
= NULL_TREE
;
5021 struct binding_level
*level
;
5022 struct cp_switch
*next
;
5025 static struct cp_switch
*switch_stack
;
5031 = (struct cp_switch
*) oballoc (sizeof (struct cp_switch
));
5032 p
->level
= current_binding_level
;
5033 p
->next
= switch_stack
;
5040 switch_stack
= switch_stack
->next
;
5043 /* Same, but for CASE labels. If DECL is NULL_TREE, it's the default. */
5044 /* XXX Note decl is never actually used. (bpk) */
5047 define_case_label ()
5049 tree cleanup
= last_cleanup_this_contour ();
5050 struct binding_level
*b
= current_binding_level
;
5055 static int explained
= 0;
5056 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup
));
5057 warning ("where case label appears here");
5060 warning ("(enclose actions of previous case statements requiring");
5061 warning ("destructors in their own binding contours.)");
5066 for (; b
&& b
!= switch_stack
->level
; b
= b
->level_chain
)
5068 tree new_decls
= b
->names
;
5069 for (; new_decls
; new_decls
= TREE_CHAIN (new_decls
))
5071 if (TREE_CODE (new_decls
) == VAR_DECL
5072 /* Don't complain about crossing initialization
5073 of internal entities. They can't be accessed,
5074 and they should be cleaned up
5075 by the time we get to the label. */
5076 && ! DECL_ARTIFICIAL (new_decls
)
5077 && ((DECL_INITIAL (new_decls
) != NULL_TREE
5078 && DECL_INITIAL (new_decls
) != error_mark_node
)
5079 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls
))))
5082 error ("jump to case label");
5084 cp_error_at (" crosses initialization of `%#D'",
5090 /* After labels, make any new cleanups go into their
5091 own new (temporary) binding contour. */
5093 current_binding_level
->more_cleanups_ok
= 0;
5094 current_function_return_value
= NULL_TREE
;
5097 /* Return the list of declarations of the current level.
5098 Note that this list is in reverse order unless/until
5099 you nreverse it; and when you do nreverse it, you must
5100 store the result back using `storedecls' or you will lose. */
5105 return current_binding_level
->names
;
5108 /* Return the list of type-tags (for structs, etc) of the current level. */
5113 return current_binding_level
->tags
;
5116 /* Store the list of declarations of the current level.
5117 This is done for the parameter declarations of a function being defined,
5118 after they are modified in the light of any missing parameters. */
5124 current_binding_level
->names
= decls
;
5127 /* Similarly, store the list of tags of the current level. */
5133 current_binding_level
->tags
= tags
;
5136 /* Given NAME, an IDENTIFIER_NODE,
5137 return the structure (or union or enum) definition for that name.
5138 Searches binding levels from BINDING_LEVEL up to the global level.
5139 If THISLEVEL_ONLY is nonzero, searches only the specified context
5140 (but skips any tag-transparent contexts to find one that is
5141 meaningful for tags).
5142 FORM says which kind of type the caller wants;
5143 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
5144 If the wrong kind of type is found, and it's not a template, an error is
5148 lookup_tag (form
, name
, binding_level
, thislevel_only
)
5149 enum tree_code form
;
5151 struct binding_level
*binding_level
;
5154 register struct binding_level
*level
;
5155 /* Non-zero if, we should look past a pseudo-global level, even if
5157 int allow_pseudo_global
= 1;
5159 for (level
= binding_level
; level
; level
= level
->level_chain
)
5162 if (ANON_AGGRNAME_P (name
))
5163 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5165 /* There's no need for error checking here, because
5166 anon names are unique throughout the compilation. */
5167 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
5168 return TREE_VALUE (tail
);
5170 else if (level
->namespace_p
)
5171 /* Do namespace lookup. */
5172 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
5174 tree old
= binding_for_name (name
, tail
);
5176 /* If we just skipped past a pseudo global level, even
5177 though THISLEVEL_ONLY, and we find a template class
5178 declaration, then we use the _TYPE node for the
5179 template. See the example below. */
5180 if (thislevel_only
&& !allow_pseudo_global
5181 && old
&& BINDING_VALUE (old
)
5182 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
5183 old
= TREE_TYPE (BINDING_VALUE (old
));
5185 old
= BINDING_TYPE (old
);
5187 /* If it has an original type, it is a typedef, and we
5188 should not return it. */
5189 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
5191 if (old
&& TREE_CODE (old
) != form
5192 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
5194 cp_error ("`%#D' redeclared as %C", old
, form
);
5199 if (thislevel_only
|| tail
== global_namespace
)
5203 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5205 if (TREE_PURPOSE (tail
) == name
)
5207 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
5208 /* Should tighten this up; it'll probably permit
5209 UNION_TYPE and a struct template, for example. */
5211 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
5213 /* Definition isn't the kind we were looking for. */
5214 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
5218 return TREE_VALUE (tail
);
5221 if (thislevel_only
&& ! level
->tag_transparent
)
5223 if (level
->pseudo_global
&& allow_pseudo_global
)
5225 /* We must deal with cases like this:
5227 template <class T> struct S;
5228 template <class T> struct S {};
5230 When looking up `S', for the second declaration, we
5231 would like to find the first declaration. But, we
5232 are in the pseudo-global level created for the
5233 template parameters, rather than the (surrounding)
5234 namespace level. Thus, we keep going one more level,
5235 even though THISLEVEL_ONLY is non-zero. */
5236 allow_pseudo_global
= 0;
5248 set_current_level_tags_transparency (tags_transparent
)
5249 int tags_transparent
;
5251 current_binding_level
->tag_transparent
= tags_transparent
;
5255 /* Given a type, find the tag that was defined for it and return the tag name.
5256 Otherwise return 0. However, the value can never be 0
5257 in the cases in which this is used.
5259 C++: If NAME is non-zero, this is the new name to install. This is
5260 done when replacing anonymous tags with real tag names. */
5263 lookup_tag_reverse (type
, name
)
5267 register struct binding_level
*level
;
5269 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5272 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5274 if (TREE_VALUE (tail
) == type
)
5277 TREE_PURPOSE (tail
) = name
;
5278 return TREE_PURPOSE (tail
);
5285 /* Look up NAME in the NAMESPACE. */
5288 lookup_namespace_name (namespace, name
)
5289 tree
namespace, name
;
5291 struct tree_binding _b
;
5293 tree template_id
= NULL_TREE
;
5295 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5297 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5298 /* This happens for A::B<int> when B is a namespace. */
5300 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5302 /* This happens for A::B where B is a template, and there are no
5303 template arguments. */
5304 cp_error ("invalid use of `%D'", name
);
5305 return error_mark_node
;
5308 namespace = ORIGINAL_NAMESPACE (namespace);
5310 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5313 name
= TREE_OPERAND (name
, 0);
5314 if (TREE_CODE (name
) == OVERLOAD
)
5315 name
= DECL_NAME (OVL_CURRENT (name
));
5316 else if (TREE_CODE_CLASS (TREE_CODE (name
)) == 'd')
5317 name
= DECL_NAME (name
);
5320 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5322 val
= binding_init (&_b
);
5323 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5324 return error_mark_node
;
5326 if (BINDING_VALUE (val
))
5328 val
= BINDING_VALUE (val
);
5332 if (DECL_CLASS_TEMPLATE_P (val
))
5333 val
= lookup_template_class (val
,
5334 TREE_OPERAND (template_id
, 1),
5335 /*in_decl=*/NULL_TREE
,
5336 /*context=*/NULL_TREE
,
5337 /*entering_scope=*/0);
5338 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5339 || TREE_CODE (val
) == OVERLOAD
)
5340 val
= lookup_template_function (val
,
5341 TREE_OPERAND (template_id
, 1));
5344 cp_error ("`%D::%D' is not a template",
5346 return error_mark_node
;
5350 /* If we have a single function from a using decl, pull it out. */
5351 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5352 val
= OVL_FUNCTION (val
);
5356 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5357 return error_mark_node
;
5360 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5362 static unsigned long
5370 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5371 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5376 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5379 typename_compare (k1
, k2
)
5390 d1
= TYPE_NAME (t1
);
5391 d2
= TYPE_NAME (t2
);
5393 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5394 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5395 && ((TREE_TYPE (t1
) != NULL_TREE
)
5396 == (TREE_TYPE (t2
) != NULL_TREE
))
5397 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5398 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5401 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5402 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5403 is non-NULL, this type is being created by the implicit typename
5404 extension, and BASE_TYPE is a type named `t' in some base class of
5405 `T' which depends on template parameters.
5407 Returns the new TYPENAME_TYPE. */
5410 build_typename_type (context
, name
, fullname
, base_type
)
5418 struct hash_entry
* e
;
5420 static struct hash_table ht
;
5422 push_obstacks (&permanent_obstack
, &permanent_obstack
);
5425 && !hash_table_init (&ht
, &hash_newfunc
, &typename_hash
,
5427 fatal ("virtual memory exhausted");
5429 /* The FULLNAME needs to exist for the life of the hash table, i.e.,
5430 for the entire compilation. */
5431 if (!TREE_PERMANENT (fullname
))
5432 fullname
= copy_to_permanent (fullname
);
5434 /* Build the TYPENAME_TYPE. */
5435 t
= make_lang_type (TYPENAME_TYPE
);
5436 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5437 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5438 TREE_TYPE (t
) = base_type
;
5440 /* Build the corresponding TYPE_DECL. */
5441 d
= build_decl (TYPE_DECL
, name
, t
);
5442 TYPE_NAME (TREE_TYPE (d
)) = d
;
5443 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5444 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5445 DECL_ARTIFICIAL (d
) = 1;
5447 /* See if we already have this type. */
5448 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5451 /* This will free not only TREE_TYPE, but the lang-specific data
5452 and the TYPE_DECL as well. */
5453 obstack_free (&permanent_obstack
, t
);
5457 /* Insert the type into the table. */
5458 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5466 make_typename_type (context
, name
)
5471 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
5473 if (!(TYPE_LANG_SPECIFIC (name
)
5474 && (CLASSTYPE_IS_TEMPLATE (name
)
5475 || CLASSTYPE_USE_TEMPLATE (name
))))
5476 name
= TYPE_IDENTIFIER (name
);
5478 /* Create a TEMPLATE_ID_EXPR for the type. */
5479 name
= build_nt (TEMPLATE_ID_EXPR
,
5480 CLASSTYPE_TI_TEMPLATE (name
),
5481 CLASSTYPE_TI_ARGS (name
));
5483 else if (TREE_CODE (name
) == TYPE_DECL
)
5484 name
= DECL_NAME (name
);
5488 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5490 name
= TREE_OPERAND (name
, 0);
5491 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5492 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5494 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5495 my_friendly_abort (2000);
5497 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5499 /* We can get here from typename_sub0 in the explicit_template_type
5500 expansion. Just fail. */
5501 cp_error ("no class template named `%#T' in `%#T'",
5503 return error_mark_node
;
5506 if (! uses_template_parms (context
)
5507 || currently_open_class (context
))
5509 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5511 tree tmpl
= NULL_TREE
;
5512 if (IS_AGGR_TYPE (context
))
5513 tmpl
= lookup_field (context
, name
, 0, 0);
5514 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5516 cp_error ("no class template named `%#T' in `%#T'",
5518 return error_mark_node
;
5521 return lookup_template_class (tmpl
,
5522 TREE_OPERAND (fullname
, 1),
5524 /*entering_scope=*/0);
5530 if (!IS_AGGR_TYPE (context
))
5532 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5533 return error_mark_node
;
5536 t
= lookup_field (context
, name
, 0, 1);
5538 return TREE_TYPE (t
);
5542 /* If the CONTEXT is not a template type, then either the field is
5543 there now or its never going to be. */
5544 if (!uses_template_parms (context
))
5546 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5547 return error_mark_node
;
5551 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5554 /* Select the right _DECL from multiple choices. */
5557 select_decl (binding
, flags
)
5562 val
= BINDING_VALUE (binding
);
5563 if (LOOKUP_NAMESPACES_ONLY (flags
))
5565 /* We are not interested in types. */
5566 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5571 /* If we could have a type and
5572 we have nothing or we need a type and have none. */
5573 if (BINDING_TYPE (binding
)
5574 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5575 && TREE_CODE (val
) != TYPE_DECL
)))
5576 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5577 /* Don't return non-types if we really prefer types. */
5578 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5579 && (TREE_CODE (val
) != TEMPLATE_DECL
5580 || !DECL_CLASS_TEMPLATE_P (val
)))
5586 /* Unscoped lookup of a global: iterate over current namespaces,
5587 considering using-directives. If SPACESP is non-NULL, store a list
5588 of the namespaces we've considered in it. */
5591 unqualified_namespace_lookup (name
, flags
, spacesp
)
5596 struct tree_binding _binding
;
5597 tree b
= binding_init (&_binding
);
5598 tree initial
= current_decl_namespace();
5599 tree scope
= initial
;
5601 struct binding_level
*level
;
5602 tree val
= NULL_TREE
;
5605 *spacesp
= NULL_TREE
;
5607 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5610 *spacesp
= scratch_tree_cons (scope
, NULL_TREE
, *spacesp
);
5611 val
= binding_for_name (name
, scope
);
5613 /* Initialize binding for this context. */
5614 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5615 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5617 /* Add all _DECLs seen through local using-directives. */
5618 for (level
= current_binding_level
;
5619 !level
->namespace_p
;
5620 level
= level
->level_chain
)
5621 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5622 scope
, flags
, spacesp
))
5623 /* Give up because of error. */
5624 return error_mark_node
;
5626 /* Add all _DECLs seen through global using-directives. */
5627 /* XXX local and global using lists should work equally. */
5631 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5632 scope
, flags
, spacesp
))
5633 /* Give up because of error. */
5634 return error_mark_node
;
5635 if (siter
== scope
) break;
5636 siter
= CP_DECL_CONTEXT (siter
);
5639 val
= select_decl (b
, flags
);
5640 if (scope
== global_namespace
)
5646 /* Combine prefer_type and namespaces_only into flags. */
5649 lookup_flags (prefer_type
, namespaces_only
)
5650 int prefer_type
, namespaces_only
;
5652 if (namespaces_only
)
5653 return LOOKUP_PREFER_NAMESPACES
;
5654 if (prefer_type
> 1)
5655 return LOOKUP_PREFER_TYPES
;
5656 if (prefer_type
> 0)
5657 return LOOKUP_PREFER_BOTH
;
5661 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5662 ignore it or not. Subroutine of lookup_name_real. */
5665 qualify_lookup (val
, flags
)
5669 if (val
== NULL_TREE
)
5671 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5673 if ((flags
& LOOKUP_PREFER_TYPES
)
5674 && (TREE_CODE (val
) == TYPE_DECL
5675 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5676 && DECL_CLASS_TEMPLATE_P (val
))))
5678 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5683 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5687 warn_about_implicit_typename_lookup (typename
, binding
)
5691 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5692 tree name
= DECL_NAME (typename
);
5694 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5695 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5696 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5697 && ! (TREE_CODE (binding
) == TYPE_DECL
5698 && same_type_p (TREE_TYPE (binding
), subtype
)))
5700 cp_warning ("lookup of `%D' finds `%#D'",
5702 cp_warning (" instead of `%D' from dependent base class",
5704 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5705 constructor_name (current_class_type
), name
);
5709 /* Look up NAME in the current binding level and its superiors in the
5710 namespace of variables, functions and typedefs. Return a ..._DECL
5711 node of some kind representing its definition if there is only one
5712 such declaration, or return a TREE_LIST with all the overloaded
5713 definitions if there are many, or return 0 if it is undefined.
5715 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5716 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5717 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5718 Otherwise we prefer non-TYPE_DECLs.
5720 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5721 using IDENTIFIER_CLASS_VALUE. */
5724 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5726 int prefer_type
, nonclass
, namespaces_only
;
5729 tree val
= NULL_TREE
;
5731 tree from_obj
= NULL_TREE
;
5733 int val_is_implicit_typename
= 0;
5735 /* Hack: copy flag set by parser, if set. */
5736 if (only_namespace_names
)
5737 namespaces_only
= 1;
5739 if (prefer_type
== -2)
5741 extern int looking_for_typename
;
5742 tree type
= NULL_TREE
;
5745 prefer_type
= looking_for_typename
;
5747 flags
= lookup_flags (prefer_type
, namespaces_only
);
5748 /* If the next thing is '<', class templates are types. */
5749 if (looking_for_template
)
5750 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5752 /* std:: becomes :: for now. */
5753 if (got_scope
== std_node
)
5754 got_scope
= void_type_node
;
5758 else if (got_object
!= error_mark_node
)
5763 if (type
== error_mark_node
)
5764 return error_mark_node
;
5765 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5766 type
= TREE_TYPE (type
);
5769 type
= complete_type (type
);
5771 if (TREE_CODE (type
) == VOID_TYPE
)
5772 type
= global_namespace
;
5773 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5775 struct tree_binding b
;
5776 val
= binding_init (&b
);
5777 flags
|= LOOKUP_COMPLAIN
;
5778 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5780 val
= select_decl (val
, flags
);
5782 else if (! IS_AGGR_TYPE (type
)
5783 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5784 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5785 || TREE_CODE (type
) == TYPENAME_TYPE
)
5786 /* Someone else will give an error about this if needed. */
5788 else if (type
== current_class_type
)
5789 val
= IDENTIFIER_CLASS_VALUE (name
);
5791 val
= lookup_member (type
, name
, 0, prefer_type
);
5798 else if (got_object
&& val
)
5803 flags
= lookup_flags (prefer_type
, namespaces_only
);
5804 /* If we're not parsing, we need to complain. */
5805 flags
|= LOOKUP_COMPLAIN
;
5808 /* First, look in non-namespace scopes. */
5810 if (current_class_type
== NULL_TREE
)
5813 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5817 if (!LOCAL_BINDING_P (t
) && nonclass
)
5818 /* We're not looking for class-scoped bindings, so keep going. */
5821 /* If this is the kind of thing we're looking for, we're done. */
5822 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5823 binding
= BINDING_VALUE (t
);
5824 else if ((flags
& LOOKUP_PREFER_TYPES
)
5825 && qualify_lookup (BINDING_TYPE (t
), flags
))
5826 binding
= BINDING_TYPE (t
);
5828 binding
= NULL_TREE
;
5831 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5833 if (val_is_implicit_typename
&& !yylex
)
5834 warn_about_implicit_typename_lookup (val
, binding
);
5836 val_is_implicit_typename
5837 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5838 if (!val_is_implicit_typename
)
5843 /* Now lookup in namespace scopes. */
5844 if (!val
|| val_is_implicit_typename
)
5846 t
= unqualified_namespace_lookup (name
, flags
, 0);
5849 if (val_is_implicit_typename
&& !yylex
)
5850 warn_about_implicit_typename_lookup (val
, t
);
5858 /* This should only warn about types used in qualified-ids. */
5859 if (from_obj
&& from_obj
!= val
)
5861 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5862 && TREE_CODE (val
) == TYPE_DECL
5863 && TREE_TYPE (from_obj
) != TREE_TYPE (val
))
5865 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5866 name
, got_object
, TREE_TYPE (from_obj
));
5867 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
5871 /* We don't change val to from_obj if got_object depends on
5872 template parms because that breaks implicit typename for
5873 destructor calls. */
5874 if (! uses_template_parms (got_object
))
5878 /* If we have a single function from a using decl, pull it out. */
5879 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5880 val
= OVL_FUNCTION (val
);
5889 lookup_name_nonclass (name
)
5892 return lookup_name_real (name
, 0, 1, 0);
5896 lookup_function_nonclass (name
, args
)
5900 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
5904 lookup_name_namespace_only (name
)
5907 /* type-or-namespace, nonclass, namespace_only */
5908 return lookup_name_real (name
, 1, 1, 1);
5912 lookup_name (name
, prefer_type
)
5916 return lookup_name_real (name
, prefer_type
, 0, 0);
5919 /* Similar to `lookup_name' but look only in the innermost non-class
5923 lookup_name_current_level (name
)
5926 struct binding_level
*b
;
5929 b
= current_binding_level
;
5930 while (b
->parm_flag
== 2)
5935 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
5937 /* extern "C" function() */
5938 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
5941 else if (IDENTIFIER_BINDING (name
)
5942 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
5946 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
5947 return IDENTIFIER_VALUE (name
);
5959 /* Like lookup_name_current_level, but for types. */
5962 lookup_type_current_level (name
)
5965 register tree t
= NULL_TREE
;
5967 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
5969 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
5970 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
5972 struct binding_level
*b
= current_binding_level
;
5975 if (purpose_member (name
, b
->type_shadowed
))
5976 return REAL_IDENTIFIER_TYPE_VALUE (name
);
5988 begin_only_namespace_names ()
5990 only_namespace_names
= 1;
5994 end_only_namespace_names ()
5996 only_namespace_names
= 0;
5999 /* Arrange for the user to get a source line number, even when the
6000 compiler is going down in flames, so that she at least has a
6001 chance of working around problems in the compiler. We used to
6002 call error(), but that let the segmentation fault continue
6003 through; now, it's much more passive by asking them to send the
6004 maintainers mail about the problem. */
6008 int sig ATTRIBUTE_UNUSED
;
6010 signal (SIGSEGV
, SIG_DFL
);
6012 signal (SIGIOT
, SIG_DFL
);
6015 signal (SIGILL
, SIG_DFL
);
6018 signal (SIGABRT
, SIG_DFL
);
6021 signal (SIGBUS
, SIG_DFL
);
6023 my_friendly_abort (0);
6027 /* Unused -- brendan 970107 */
6028 /* Array for holding types considered "built-in". These types
6029 are output in the module in which `main' is defined. */
6030 static tree
*builtin_type_tdescs_arr
;
6031 static int builtin_type_tdescs_len
, builtin_type_tdescs_max
;
6034 /* Push the declarations of builtin types into the namespace.
6035 RID_INDEX, if < RID_MAX is the index of the builtin type
6036 in the array RID_POINTERS. NAME is the name used when looking
6037 up the builtin type. TYPE is the _TYPE node for the builtin type. */
6040 record_builtin_type (rid_index
, name
, type
)
6045 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
6046 tree tdecl
= NULL_TREE
;
6048 if ((int) rid_index
< (int) RID_MAX
)
6049 rname
= ridpointers
[(int) rid_index
];
6051 tname
= get_identifier (name
);
6053 TYPE_BUILT_IN (type
) = 1;
6057 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
6058 set_identifier_type_value (tname
, NULL_TREE
);
6059 if ((int) rid_index
< (int) RID_MAX
)
6060 /* Built-in types live in the global namespace. */
6061 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
6063 if (rname
!= NULL_TREE
)
6065 if (tname
!= NULL_TREE
)
6067 set_identifier_type_value (rname
, NULL_TREE
);
6068 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
6072 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
6073 set_identifier_type_value (rname
, NULL_TREE
);
6078 /* Record one of the standard Java types.
6079 * Declare it as having the given NAME.
6080 * If SIZE > 0, it is the size of one of the integral types;
6081 * otherwise it is the negative of the size of one of the other types. */
6084 record_builtin_java_type (name
, size
)
6090 type
= make_signed_type (size
);
6091 else if (size
> -32)
6092 { /* "__java_char" or ""__java_boolean". */
6093 type
= make_unsigned_type (-size
);
6094 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
6097 { /* "__java_float" or ""__java_double". */
6098 type
= make_node (REAL_TYPE
);
6099 TYPE_PRECISION (type
) = - size
;
6102 record_builtin_type (RID_MAX
, name
, type
);
6103 decl
= TYPE_NAME (type
);
6105 /* Suppress generate debug symbol entries for these types,
6106 since for normal C++ they are just clutter.
6107 However, push_lang_context undoes this if extern "Java" is seen. */
6108 DECL_IGNORED_P (decl
) = 1;
6110 TYPE_FOR_JAVA (type
) = 1;
6114 /* Push a type into the namespace so that the back-ends ignore it. */
6117 record_unknown_type (type
, name
)
6121 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
6122 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
6123 DECL_IGNORED_P (decl
) = 1;
6124 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
6125 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
6126 TYPE_ALIGN (type
) = 1;
6127 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
6130 /* Push overloaded decl, in global scope, with one argument so it
6131 can be used as a callback from define_function. */
6134 push_overloaded_decl_1 (x
)
6137 push_overloaded_decl (x
, PUSH_GLOBAL
);
6144 auto_function (name
, type
, code
)
6146 enum built_in_function code
;
6148 return define_function
6149 (IDENTIFIER_POINTER (name
), type
, code
, push_overloaded_decl_1
,
6150 IDENTIFIER_POINTER (build_decl_overload (name
, TYPE_ARG_TYPES (type
),
6154 /* Create the predefined scalar types of C,
6155 and some nodes representing standard constants (0, 1, (void *)0).
6156 Initialize the global binding level.
6157 Make definitions for built-in primitive functions. */
6160 init_decl_processing ()
6163 int wchar_type_size
;
6164 tree array_domain_type
;
6166 /* Have to make these distinct before we try using them. */
6167 lang_name_cplusplus
= get_identifier ("C++");
6168 lang_name_c
= get_identifier ("C");
6169 lang_name_java
= get_identifier ("Java");
6171 /* Enter the global namespace. */
6172 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
6173 my_friendly_assert (current_lang_name
== NULL_TREE
, 375);
6174 current_lang_name
= lang_name_cplusplus
;
6175 push_namespace (get_identifier ("::"));
6176 global_namespace
= current_namespace
;
6177 current_lang_name
= NULL_TREE
;
6179 if (flag_strict_prototype
== 2)
6180 flag_strict_prototype
= pedantic
;
6181 if (! flag_permissive
&& ! pedantic
)
6182 flag_pedantic_errors
= 1;
6184 strict_prototypes_lang_c
= flag_strict_prototype
;
6187 current_lang_name
= lang_name_c
;
6189 current_function_decl
= NULL_TREE
;
6190 named_labels
= NULL_TREE
;
6191 named_label_uses
= NULL
;
6192 current_binding_level
= NULL_BINDING_LEVEL
;
6193 free_binding_level
= NULL_BINDING_LEVEL
;
6195 /* Because most segmentation signals can be traced back into user
6196 code, catch them and at least give the user a chance of working
6197 around compiler bugs. */
6198 signal (SIGSEGV
, signal_catch
);
6200 /* We will also catch aborts in the back-end through signal_catch and
6201 give the user a chance to see where the error might be, and to defeat
6202 aborts in the back-end when there have been errors previously in their
6205 signal (SIGIOT
, signal_catch
);
6208 signal (SIGILL
, signal_catch
);
6211 signal (SIGABRT
, signal_catch
);
6214 signal (SIGBUS
, signal_catch
);
6217 gcc_obstack_init (&decl_obstack
);
6219 /* Must lay these out before anything else gets laid out. */
6220 error_mark_node
= make_node (ERROR_MARK
);
6221 TREE_PERMANENT (error_mark_node
) = 1;
6222 TREE_TYPE (error_mark_node
) = error_mark_node
;
6223 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6224 TREE_TYPE (error_mark_list
) = error_mark_node
;
6226 /* Make the binding_level structure for global names. */
6228 global_binding_level
= current_binding_level
;
6229 /* The global level is the namespace level of ::. */
6230 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6231 declare_namespace_level ();
6233 this_identifier
= get_identifier (THIS_NAME
);
6234 in_charge_identifier
= get_identifier (IN_CHARGE_NAME
);
6235 ctor_identifier
= get_identifier (CTOR_NAME
);
6236 dtor_identifier
= get_identifier (DTOR_NAME
);
6237 pfn_identifier
= get_identifier (VTABLE_PFN_NAME
);
6238 index_identifier
= get_identifier (VTABLE_INDEX_NAME
);
6239 delta_identifier
= get_identifier (VTABLE_DELTA_NAME
);
6240 delta2_identifier
= get_identifier (VTABLE_DELTA2_NAME
);
6241 pfn_or_delta2_identifier
= get_identifier ("__pfn_or_delta2");
6243 /* Define `int' and `char' first so that dbx will output them first. */
6245 integer_type_node
= make_signed_type (INT_TYPE_SIZE
);
6246 record_builtin_type (RID_INT
, NULL_PTR
, integer_type_node
);
6248 /* Define `char', which is like either `signed char' or `unsigned char'
6249 but not the same as either. */
6253 ? make_signed_type (CHAR_TYPE_SIZE
)
6254 : make_unsigned_type (CHAR_TYPE_SIZE
));
6255 record_builtin_type (RID_CHAR
, "char", char_type_node
);
6257 /* `signed' is the same as `int' */
6258 record_builtin_type (RID_SIGNED
, NULL_PTR
, integer_type_node
);
6260 long_integer_type_node
= make_signed_type (LONG_TYPE_SIZE
);
6261 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
6263 unsigned_type_node
= make_unsigned_type (INT_TYPE_SIZE
);
6264 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
6266 long_unsigned_type_node
= make_unsigned_type (LONG_TYPE_SIZE
);
6267 record_builtin_type (RID_MAX
, "long unsigned int", long_unsigned_type_node
);
6268 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
6270 long_long_integer_type_node
= make_signed_type (LONG_LONG_TYPE_SIZE
);
6271 record_builtin_type (RID_MAX
, "long long int", long_long_integer_type_node
);
6273 long_long_unsigned_type_node
= make_unsigned_type (LONG_LONG_TYPE_SIZE
);
6274 record_builtin_type (RID_MAX
, "long long unsigned int",
6275 long_long_unsigned_type_node
);
6276 record_builtin_type (RID_MAX
, "long long unsigned",
6277 long_long_unsigned_type_node
);
6279 short_integer_type_node
= make_signed_type (SHORT_TYPE_SIZE
);
6280 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
6281 short_unsigned_type_node
= make_unsigned_type (SHORT_TYPE_SIZE
);
6282 record_builtin_type (RID_MAX
, "short unsigned int", short_unsigned_type_node
);
6283 record_builtin_type (RID_MAX
, "unsigned short", short_unsigned_type_node
);
6285 /* `unsigned long' is the standard type for sizeof.
6286 Note that stddef.h uses `unsigned long',
6287 and this must agree, even if long and int are the same size. */
6289 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE
))));
6292 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE
)));
6294 /* Define both `signed char' and `unsigned char'. */
6295 signed_char_type_node
= make_signed_type (CHAR_TYPE_SIZE
);
6296 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
6297 unsigned_char_type_node
= make_unsigned_type (CHAR_TYPE_SIZE
);
6298 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
6300 /* Create the widest literal types. */
6301 widest_integer_literal_type_node
= make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
6302 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6303 widest_integer_literal_type_node
));
6305 widest_unsigned_literal_type_node
= make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
6306 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6307 widest_unsigned_literal_type_node
));
6309 /* These are types that type_for_size and type_for_mode use. */
6310 intQI_type_node
= make_signed_type (GET_MODE_BITSIZE (QImode
));
6311 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intQI_type_node
));
6312 intHI_type_node
= make_signed_type (GET_MODE_BITSIZE (HImode
));
6313 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intHI_type_node
));
6314 intSI_type_node
= make_signed_type (GET_MODE_BITSIZE (SImode
));
6315 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intSI_type_node
));
6316 intDI_type_node
= make_signed_type (GET_MODE_BITSIZE (DImode
));
6317 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intDI_type_node
));
6318 #if HOST_BITS_PER_WIDE_INT >= 64
6319 intTI_type_node
= make_signed_type (GET_MODE_BITSIZE (TImode
));
6320 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__int128_t"), intTI_type_node
));
6322 unsigned_intQI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (QImode
));
6323 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intQI_type_node
));
6324 unsigned_intHI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (HImode
));
6325 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intHI_type_node
));
6326 unsigned_intSI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (SImode
));
6327 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intSI_type_node
));
6328 unsigned_intDI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (DImode
));
6329 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intDI_type_node
));
6330 #if HOST_BITS_PER_WIDE_INT >= 64
6331 unsigned_intTI_type_node
= make_unsigned_type (GET_MODE_BITSIZE (TImode
));
6332 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__uint128_t"), unsigned_intTI_type_node
));
6335 float_type_node
= make_node (REAL_TYPE
);
6336 TYPE_PRECISION (float_type_node
) = FLOAT_TYPE_SIZE
;
6337 record_builtin_type (RID_FLOAT
, NULL_PTR
, float_type_node
);
6338 layout_type (float_type_node
);
6340 double_type_node
= make_node (REAL_TYPE
);
6341 if (flag_short_double
)
6342 TYPE_PRECISION (double_type_node
) = FLOAT_TYPE_SIZE
;
6344 TYPE_PRECISION (double_type_node
) = DOUBLE_TYPE_SIZE
;
6345 record_builtin_type (RID_DOUBLE
, NULL_PTR
, double_type_node
);
6346 layout_type (double_type_node
);
6348 long_double_type_node
= make_node (REAL_TYPE
);
6349 TYPE_PRECISION (long_double_type_node
) = LONG_DOUBLE_TYPE_SIZE
;
6350 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
6351 layout_type (long_double_type_node
);
6353 complex_integer_type_node
= make_node (COMPLEX_TYPE
);
6354 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex int"),
6355 complex_integer_type_node
));
6356 TREE_TYPE (complex_integer_type_node
) = integer_type_node
;
6357 layout_type (complex_integer_type_node
);
6359 complex_float_type_node
= make_node (COMPLEX_TYPE
);
6360 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex float"),
6361 complex_float_type_node
));
6362 TREE_TYPE (complex_float_type_node
) = float_type_node
;
6363 layout_type (complex_float_type_node
);
6365 complex_double_type_node
= make_node (COMPLEX_TYPE
);
6366 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex double"),
6367 complex_double_type_node
));
6368 TREE_TYPE (complex_double_type_node
) = double_type_node
;
6369 layout_type (complex_double_type_node
);
6371 complex_long_double_type_node
= make_node (COMPLEX_TYPE
);
6372 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
6373 complex_long_double_type_node
));
6374 TREE_TYPE (complex_long_double_type_node
) = long_double_type_node
;
6375 layout_type (complex_long_double_type_node
);
6377 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6378 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6379 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6380 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6381 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6382 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6383 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6384 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6386 integer_zero_node
= build_int_2 (0, 0);
6387 TREE_TYPE (integer_zero_node
) = integer_type_node
;
6388 integer_one_node
= build_int_2 (1, 0);
6389 TREE_TYPE (integer_one_node
) = integer_type_node
;
6390 integer_two_node
= build_int_2 (2, 0);
6391 TREE_TYPE (integer_two_node
) = integer_type_node
;
6392 integer_three_node
= build_int_2 (3, 0);
6393 TREE_TYPE (integer_three_node
) = integer_type_node
;
6395 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6396 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6397 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6398 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6399 TYPE_PRECISION (boolean_type_node
) = 1;
6400 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6401 boolean_false_node
= build_int_2 (0, 0);
6402 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6403 boolean_true_node
= build_int_2 (1, 0);
6404 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6406 /* These are needed by stor-layout.c. */
6407 size_zero_node
= size_int (0);
6408 size_one_node
= size_int (1);
6410 signed_size_zero_node
= build_int_2 (0, 0);
6411 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6413 void_type_node
= make_node (VOID_TYPE
);
6414 record_builtin_type (RID_VOID
, NULL_PTR
, void_type_node
);
6415 layout_type (void_type_node
); /* Uses integer_zero_node. */
6416 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
6417 TREE_PARMLIST (void_list_node
) = 1;
6419 null_pointer_node
= build_int_2 (0, 0);
6420 TREE_TYPE (null_pointer_node
) = build_pointer_type (void_type_node
);
6421 layout_type (TREE_TYPE (null_pointer_node
));
6423 /* Used for expressions that do nothing, but are not errors. */
6424 void_zero_node
= build_int_2 (0, 0);
6425 TREE_TYPE (void_zero_node
) = void_type_node
;
6427 string_type_node
= build_pointer_type (char_type_node
);
6428 const_string_type_node
6429 = build_pointer_type (build_qualified_type (char_type_node
,
6431 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6433 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
6436 /* Make a type to be the domain of a few array types
6437 whose domains don't really matter.
6438 200 is small enough that it always fits in size_t
6439 and large enough that it can hold most function names for the
6440 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
6441 array_domain_type
= build_index_type (build_int_2 (200, 0));
6443 /* Make a type for arrays of characters.
6444 With luck nothing will ever really depend on the length of this
6446 char_array_type_node
6447 = build_array_type (char_type_node
, array_domain_type
);
6448 /* Likewise for arrays of ints. */
6450 = build_array_type (integer_type_node
, array_domain_type
);
6452 /* This is just some anonymous class type. Nobody should ever
6453 need to look inside this envelope. */
6454 class_star_type_node
= build_pointer_type (make_lang_type (RECORD_TYPE
));
6456 if (flag_huge_objects
)
6457 delta_type_node
= long_integer_type_node
;
6459 delta_type_node
= short_integer_type_node
;
6461 default_function_type
6462 = build_function_type (integer_type_node
, NULL_TREE
);
6464 ptr_type_node
= build_pointer_type (void_type_node
);
6466 = build_pointer_type (build_qualified_type (void_type_node
,
6468 c_common_nodes_and_builtins (1, flag_no_builtin
, flag_no_nonansi_builtin
);
6471 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6473 /* C++ extensions */
6475 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6476 record_unknown_type (unknown_type_node
, "unknown type");
6478 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6479 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6481 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6483 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6485 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6486 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6488 /* This is special for C++ so functions can be overloaded. */
6490 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (WCHAR_TYPE
)));
6491 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
6492 signed_wchar_type_node
= make_signed_type (wchar_type_size
);
6493 unsigned_wchar_type_node
= make_unsigned_type (wchar_type_size
);
6495 = TREE_UNSIGNED (wchar_type_node
)
6496 ? unsigned_wchar_type_node
6497 : signed_wchar_type_node
;
6498 record_builtin_type (RID_WCHAR
, "__wchar_t", wchar_type_node
);
6500 /* Artificial declaration of wchar_t -- can be bashed */
6501 wchar_decl_node
= build_decl (TYPE_DECL
, get_identifier ("wchar_t"),
6503 pushdecl (wchar_decl_node
);
6505 /* This is for wide string constants. */
6506 wchar_array_type_node
6507 = build_array_type (wchar_type_node
, array_domain_type
);
6509 if (flag_vtable_thunks
)
6511 /* Make sure we get a unique function type, so we can give
6512 its pointer type a name. (This wins for gdb.) */
6513 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6514 TREE_TYPE (vfunc_type
) = integer_type_node
;
6515 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6516 layout_type (vfunc_type
);
6518 vtable_entry_type
= build_pointer_type (vfunc_type
);
6522 vtable_entry_type
= make_lang_type (RECORD_TYPE
);
6523 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
6525 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
6527 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_identifier
,
6529 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6532 /* Make this part of an invisible union. */
6533 fields
[3] = copy_node (fields
[2]);
6534 TREE_TYPE (fields
[3]) = delta_type_node
;
6535 DECL_NAME (fields
[3]) = delta2_identifier
;
6536 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6537 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6538 TREE_UNSIGNED (fields
[3]) = 0;
6539 TREE_CHAIN (fields
[2]) = fields
[3];
6540 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6543 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6546 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6547 layout_type (vtbl_type_node
);
6548 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6549 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6550 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6551 layout_type (vtbl_ptr_type_node
);
6552 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6554 std_node
= build_decl (NAMESPACE_DECL
,
6555 get_identifier (flag_honor_std
? "fake std":"std"),
6557 pushdecl (std_node
);
6559 global_type_node
= make_node (LANG_TYPE
);
6560 record_unknown_type (global_type_node
, "global type");
6563 current_lang_name
= lang_name_cplusplus
;
6566 tree bad_alloc_type_node
, newtype
, deltype
;
6568 push_namespace (get_identifier ("std"));
6569 bad_alloc_type_node
= xref_tag
6570 (class_type_node
, get_identifier ("bad_alloc"), 1);
6573 newtype
= build_exception_variant
6574 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6575 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6576 auto_function (ansi_opname
[(int) NEW_EXPR
], newtype
, NOT_BUILT_IN
);
6577 auto_function (ansi_opname
[(int) VEC_NEW_EXPR
], newtype
, NOT_BUILT_IN
);
6578 global_delete_fndecl
6579 = auto_function (ansi_opname
[(int) DELETE_EXPR
], deltype
, NOT_BUILT_IN
);
6580 auto_function (ansi_opname
[(int) VEC_DELETE_EXPR
], deltype
, NOT_BUILT_IN
);
6584 = define_function ("__pure_virtual", void_ftype
,
6585 NOT_BUILT_IN
, 0, 0);
6587 /* Perform other language dependent initializations. */
6588 init_class_processing ();
6589 init_init_processing ();
6590 init_search_processing ();
6592 init_rtti_processing ();
6594 if (flag_exceptions
)
6595 init_exception_processing ();
6598 flag_inline_functions
= 0;
6601 if (! supports_one_only ())
6604 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6605 declare_function_name ();
6607 /* Prepare to check format strings against argument lists. */
6608 init_function_format_info ();
6610 /* Show we use EH for cleanups. */
6611 using_eh_for_cleanups ();
6613 print_error_function
= lang_print_error_function
;
6614 lang_get_alias_set
= &c_get_alias_set
;
6615 valid_lang_attribute
= cp_valid_lang_attribute
;
6617 /* Maintain consistency. Perhaps we should just complain if they
6618 say -fwritable-strings? */
6619 if (flag_writable_strings
)
6620 flag_const_strings
= 0;
6623 /* Function to print any language-specific context for an error message. */
6626 lang_print_error_function (file
)
6629 default_print_error_function (file
);
6630 maybe_print_template_context ();
6633 /* Make a definition for a builtin function named NAME and whose data type
6634 is TYPE. TYPE should be a function type with argument types.
6635 FUNCTION_CODE tells later passes how to compile calls to this function.
6636 See tree.h for its possible values.
6638 If LIBRARY_NAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6639 the name to be called if we can't opencode the function. */
6642 define_function (name
, type
, function_code
, pfn
, library_name
)
6645 enum built_in_function function_code
;
6646 void (*pfn
) PROTO((tree
));
6647 const char *library_name
;
6649 tree decl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), type
);
6650 DECL_EXTERNAL (decl
) = 1;
6651 TREE_PUBLIC (decl
) = 1;
6652 DECL_ARTIFICIAL (decl
) = 1;
6654 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6655 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
6657 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6658 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6659 function in the namespace. */
6660 if (pfn
) (*pfn
) (decl
);
6662 DECL_ASSEMBLER_NAME (decl
) = get_identifier (library_name
);
6663 make_function_rtl (decl
);
6664 if (function_code
!= NOT_BUILT_IN
)
6666 DECL_BUILT_IN (decl
) = 1;
6667 DECL_FUNCTION_CODE (decl
) = function_code
;
6673 builtin_function (name
, type
, code
, libname
)
6676 enum built_in_function code
;
6677 const char *libname
;
6679 return define_function (name
, type
, code
, (void (*) PROTO((tree
)))pushdecl
, libname
);
6682 /* When we call finish_struct for an anonymous union, we create
6683 default copy constructors and such. But, an anonymous union
6684 shouldn't have such things; this function undoes the damage to the
6685 anonymous union type T.
6687 (The reason that we create the synthesized methods is that we don't
6688 distinguish `union { int i; }' from `typedef union { int i; } U'.
6689 The first is an anonymous union; the second is just an ordinary
6693 fixup_anonymous_aggr (t
)
6698 /* Wipe out memory of synthesized methods */
6699 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6700 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6701 TYPE_HAS_INIT_REF (t
) = 0;
6702 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6703 TYPE_HAS_ASSIGN_REF (t
) = 0;
6704 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6706 /* Splice the implicitly generated functions out of the TYPE_METHODS
6708 q
= &TYPE_METHODS (t
);
6711 if (DECL_ARTIFICIAL (*q
))
6712 *q
= TREE_CHAIN (*q
);
6714 q
= &TREE_CHAIN (*q
);
6717 /* ANSI C++ June 5 1992 WP 9.5.3. Anonymous unions may not have
6718 function members. */
6719 if (TYPE_METHODS (t
))
6720 error ("an anonymous union cannot have function members");
6723 /* Make sure that a declaration with no declarator is well-formed, i.e.
6724 just defines a tagged type or anonymous union.
6726 Returns the type defined, if any. */
6729 check_tag_decl (declspecs
)
6733 tree ob_modifier
= NULL_TREE
;
6735 register tree t
= NULL_TREE
;
6737 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6739 register tree value
= TREE_VALUE (link
);
6745 if (IS_AGGR_TYPE (value
) || TREE_CODE (value
) == ENUMERAL_TYPE
)
6747 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6751 else if (value
== ridpointers
[(int) RID_FRIEND
])
6753 if (current_class_type
== NULL_TREE
6754 || current_scope () != current_class_type
)
6755 ob_modifier
= value
;
6757 else if (value
== ridpointers
[(int) RID_STATIC
]
6758 || value
== ridpointers
[(int) RID_EXTERN
]
6759 || value
== ridpointers
[(int) RID_AUTO
]
6760 || value
== ridpointers
[(int) RID_REGISTER
]
6761 || value
== ridpointers
[(int) RID_INLINE
]
6762 || value
== ridpointers
[(int) RID_VIRTUAL
]
6763 || value
== ridpointers
[(int) RID_CONST
]
6764 || value
== ridpointers
[(int) RID_VOLATILE
]
6765 || value
== ridpointers
[(int) RID_EXPLICIT
])
6766 ob_modifier
= value
;
6770 error ("multiple types in one declaration");
6772 /* Inside a class, we might be in a friend or access declaration.
6773 Until we have a good way of detecting the latter, don't warn. */
6774 if (t
== NULL_TREE
&& ! current_class_type
)
6775 pedwarn ("declaration does not declare anything");
6777 /* Check for an anonymous union. We're careful
6778 accessing TYPE_IDENTIFIER because some built-in types, like
6779 pointer-to-member types, do not have TYPE_NAME. */
6780 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
6782 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
6784 /* Anonymous unions are objects, so they can have specifiers. */;
6785 SET_ANON_AGGR_TYPE_P (t
);
6787 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
6788 pedwarn ("ISO C++ prohibits anonymous structs");
6791 else if (ob_modifier
)
6793 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
6794 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
6795 cp_error ("`%D' can only be specified for functions", ob_modifier
);
6796 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
6797 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
6798 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
6799 cp_error ("`%D' can only be specified for constructors",
6802 cp_error ("`%D' can only be specified for objects and functions",
6809 /* Called when a declaration is seen that contains no names to declare.
6810 If its type is a reference to a structure, union or enum inherited
6811 from a containing scope, shadow that tag name for the current scope
6812 with a forward reference.
6813 If its type defines a new named structure or union
6814 or defines an enum, it is valid but we need not do anything here.
6815 Otherwise, it is an error.
6817 C++: may have to grok the declspecs to learn about static,
6818 complain for anonymous unions. */
6821 shadow_tag (declspecs
)
6824 tree t
= check_tag_decl (declspecs
);
6827 maybe_process_partial_specialization (t
);
6829 /* This is where the variables in an anonymous union are
6830 declared. An anonymous union declaration looks like:
6832 because there is no declarator after the union, the parser
6833 sends that declaration here. */
6834 if (t
&& ANON_AGGR_TYPE_P (t
))
6836 fixup_anonymous_aggr (t
);
6838 if (TYPE_FIELDS (t
))
6840 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
6842 finish_anon_union (decl
);
6847 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6850 groktypename (typename
)
6853 if (TREE_CODE (typename
) != TREE_LIST
)
6855 return grokdeclarator (TREE_VALUE (typename
),
6856 TREE_PURPOSE (typename
),
6857 TYPENAME
, 0, NULL_TREE
);
6860 /* Decode a declarator in an ordinary declaration or data definition.
6861 This is called as soon as the type information and variable name
6862 have been parsed, before parsing the initializer if any.
6863 Here we create the ..._DECL node, fill in its type,
6864 and put it on the list of decls for the current context.
6865 The ..._DECL node is returned as the value.
6867 Exception: for arrays where the length is not specified,
6868 the type is left null, to be filled in by `cp_finish_decl'.
6870 Function definitions do not come here; they go to start_function
6871 instead. However, external and forward declarations of functions
6872 do go through here. Structure field declarations are done by
6873 grokfield and not through here. */
6875 /* Set this to zero to debug not using the temporary obstack
6876 to parse initializers. */
6877 int debug_temp_inits
= 1;
6880 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
6881 tree declarator
, declspecs
;
6883 tree attributes
, prefix_attributes
;
6886 register tree type
, tem
;
6888 extern int have_extern_spec
;
6889 extern int used_extern_spec
;
6893 /* See code below that used this. */
6894 int init_written
= initialized
;
6897 /* This should only be done once on the top most decl. */
6898 if (have_extern_spec
&& !used_extern_spec
)
6900 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"),
6902 used_extern_spec
= 1;
6905 if (attributes
|| prefix_attributes
)
6906 attrlist
= build_scratch_list (attributes
, prefix_attributes
);
6908 attrlist
= NULL_TREE
;
6910 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
6913 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
6916 type
= TREE_TYPE (decl
);
6918 if (type
== error_mark_node
)
6921 /* Don't lose if destructors must be executed at file-level. */
6922 if (! processing_template_decl
&& TREE_STATIC (decl
)
6923 && TYPE_NEEDS_DESTRUCTOR (complete_type (type
))
6924 && !TREE_PERMANENT (decl
))
6926 push_obstacks (&permanent_obstack
, &permanent_obstack
);
6927 decl
= copy_node (decl
);
6928 if (TREE_CODE (type
) == ARRAY_TYPE
)
6930 tree itype
= TYPE_DOMAIN (type
);
6931 if (itype
&& ! TREE_PERMANENT (itype
))
6933 itype
= build_index_type (copy_to_permanent (TYPE_MAX_VALUE (itype
)));
6934 type
= build_cplus_array_type (TREE_TYPE (type
), itype
);
6935 TREE_TYPE (decl
) = type
;
6942 = (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
6943 ? DECL_CLASS_CONTEXT (decl
)
6944 : DECL_CONTEXT (decl
);
6946 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
6947 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
6949 /* When parsing the initializer, lookup should use the object's
6951 push_decl_namespace (context
);
6954 /* We are only interested in class contexts, later. */
6955 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
6956 context
= NULL_TREE
;
6959 /* Is it valid for this decl to have an initializer at all?
6960 If not, set INITIALIZED to zero, which will indirectly
6961 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6962 switch (TREE_CODE (decl
))
6965 /* typedef foo = bar means give foo the same type as bar.
6966 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
6967 Any other case of an initialization in a TYPE_DECL is an error. */
6968 if (pedantic
|| list_length (declspecs
) > 1)
6970 cp_error ("typedef `%D' is initialized", decl
);
6976 cp_error ("function `%#D' is initialized like a variable", decl
);
6986 if (! toplevel_bindings_p ()
6987 && DECL_EXTERNAL (decl
))
6988 cp_warning ("declaration of `%#D' has `extern' and is initialized",
6990 DECL_EXTERNAL (decl
) = 0;
6991 if (toplevel_bindings_p ())
6992 TREE_STATIC (decl
) = 1;
6994 /* Tell `pushdecl' this is an initialized decl
6995 even though we don't yet have the initializer expression.
6996 Also tell `cp_finish_decl' it may store the real initializer. */
6997 DECL_INITIAL (decl
) = error_mark_node
;
7000 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
7001 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
7004 /* Set attributes here so if duplicate decl, will have proper attributes. */
7005 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
7007 if (context
&& TYPE_SIZE (complete_type (context
)) != NULL_TREE
)
7009 push_nested_class (context
, 2);
7011 if (TREE_CODE (decl
) == VAR_DECL
)
7013 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
7014 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
7015 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
7018 if (DECL_CONTEXT (field
) != context
)
7020 cp_pedwarn ("ANSI C++ does not permit `%T::%D' to be defined as `%T::%D'",
7021 DECL_CONTEXT (field
), DECL_NAME (decl
),
7022 context
, DECL_NAME (decl
));
7023 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
7025 /* Static data member are tricky; an in-class initialization
7026 still doesn't provide a definition, so the in-class
7027 declaration will have DECL_EXTERNAL set, but will have an
7028 initialization. Thus, duplicate_decls won't warn
7029 about this situation, and so we check here. */
7030 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
7031 cp_error ("duplicate initialization of %D", decl
);
7032 if (duplicate_decls (decl
, field
))
7038 tree field
= check_classfn (context
, decl
);
7039 if (field
&& duplicate_decls (decl
, field
))
7043 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
7044 DECL_IN_AGGR_P (decl
) = 0;
7045 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
7046 || CLASSTYPE_USE_TEMPLATE (context
))
7048 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
7049 /* [temp.expl.spec] An explicit specialization of a static data
7050 member of a template is a definition if the declaration
7051 includes an initializer; otherwise, it is a declaration.
7053 We check for processing_specialization so this only applies
7054 to the new specialization syntax. */
7055 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
7056 DECL_EXTERNAL (decl
) = 1;
7059 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
7060 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
7064 /* Enter this declaration into the symbol table. */
7065 tem
= maybe_push_decl (decl
);
7067 if (processing_template_decl
)
7069 if (at_function_scope_p ())
7070 push_permanent_obstack ();
7072 tem
= push_template_decl (tem
);
7073 /* In a a local scope, add a representation of this declaration
7074 to the statement tree. */
7075 if (at_function_scope_p ())
7077 add_decl_stmt (decl
);
7083 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7084 /* Tell the back-end to use or not use .common as appropriate. If we say
7085 -fconserve-space, we want this to save .data space, at the expense of
7086 wrong semantics. If we say -fno-conserve-space, we want this to
7087 produce errors about redefs; to do this we force variables into the
7089 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
7092 if (! processing_template_decl
)
7095 /* Corresponding pop_obstacks is done in `cp_finish_decl'. */
7096 push_obstacks_nochange ();
7105 tree type
= TREE_TYPE (decl
);
7106 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
7108 if (type
== error_mark_node
)
7111 /* If this type of object needs a cleanup, and control may
7112 jump past it, make a new binding level so that it is cleaned
7113 up only when it is initialized first. */
7114 if (TYPE_NEEDS_DESTRUCTOR (type
)
7115 && current_binding_level
->more_cleanups_ok
== 0)
7116 pushlevel_temporary (1);
7119 /* Is it valid for this decl to have an initializer at all?
7120 If not, set INITIALIZED to zero, which will indirectly
7121 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7123 /* Don't allow initializations for incomplete types except for
7124 arrays which might be completed by the initialization. */
7125 if (TYPE_SIZE (complete_type (type
)) != NULL_TREE
)
7126 ; /* A complete type is ok. */
7127 else if (TREE_CODE (type
) != ARRAY_TYPE
)
7129 cp_error ("variable `%#D' has initializer but incomplete type",
7132 type
= TREE_TYPE (decl
) = error_mark_node
;
7134 else if (TYPE_SIZE (complete_type (TREE_TYPE (type
))) == NULL_TREE
)
7136 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
7137 cp_error ("elements of array `%#D' have incomplete type", decl
);
7138 /* else we already gave an error in start_decl. */
7144 && TREE_CODE (decl
) != TYPE_DECL
7145 && TREE_CODE (decl
) != TEMPLATE_DECL
7146 && IS_AGGR_TYPE (type
) && ! DECL_EXTERNAL (decl
))
7148 if ((! processing_template_decl
|| ! uses_template_parms (type
))
7149 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
7151 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
7153 /* Change the type so that assemble_variable will give
7154 DECL an rtl we can live with: (mem (const_int 0)). */
7155 type
= TREE_TYPE (decl
) = error_mark_node
;
7159 /* If any base type in the hierarchy of TYPE needs a constructor,
7160 then we set initialized to 1. This way any nodes which are
7161 created for the purposes of initializing this aggregate
7162 will live as long as it does. This is necessary for global
7163 aggregates which do not have their initializers processed until
7164 the end of the file. */
7165 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
7170 DECL_INITIAL (decl
) = NULL_TREE
;
7173 /* Handle initialization of references.
7174 These three arguments are from `cp_finish_decl', and have the
7175 same meaning here that they do there.
7177 Quotes on semantics can be found in ARM 8.4.3. */
7180 grok_reference_init (decl
, type
, init
)
7181 tree decl
, type
, init
;
7185 if (init
== NULL_TREE
)
7187 if ((DECL_LANG_SPECIFIC (decl
) == 0
7188 || DECL_IN_AGGR_P (decl
) == 0)
7189 && ! DECL_THIS_EXTERN (decl
))
7191 cp_error ("`%D' declared as reference but not initialized", decl
);
7192 if (TREE_CODE (decl
) == VAR_DECL
)
7193 SET_DECL_REFERENCE_SLOT (decl
, error_mark_node
);
7198 if (init
== error_mark_node
)
7201 if (TREE_CODE (type
) == REFERENCE_TYPE
7202 && TREE_CODE (init
) == CONSTRUCTOR
)
7204 cp_error ("ANSI C++ forbids use of initializer list to initialize reference `%D'", decl
);
7208 if (TREE_CODE (init
) == TREE_LIST
)
7209 init
= build_compound_expr (init
);
7211 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
7212 init
= convert_from_reference (init
);
7214 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
7215 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
7217 /* Note: default conversion is only called in very special cases. */
7218 init
= default_conversion (init
);
7221 tmp
= convert_to_reference
7222 (type
, init
, CONV_IMPLICIT
,
7223 LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
, decl
);
7225 if (tmp
== error_mark_node
)
7227 else if (tmp
!= NULL_TREE
)
7230 DECL_INITIAL (decl
) = save_expr (init
);
7234 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7238 /* ?? Can this be optimized in some cases to
7239 hand back the DECL_INITIAL slot?? */
7240 if (TYPE_SIZE (TREE_TYPE (type
)))
7242 init
= convert_from_reference (decl
);
7243 if (TREE_PERMANENT (decl
))
7244 init
= copy_to_permanent (init
);
7245 SET_DECL_REFERENCE_SLOT (decl
, init
);
7248 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
7250 expand_static_init (decl
, DECL_INITIAL (decl
));
7251 DECL_INITIAL (decl
) = NULL_TREE
;
7256 if (TREE_CODE (decl
) == VAR_DECL
)
7257 SET_DECL_REFERENCE_SLOT (decl
, error_mark_node
);
7261 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7262 mucking with forces it does not comprehend (i.e. initialization with a
7263 constructor). If we are at global scope and won't go into COMMON, fill
7264 it in with a dummy CONSTRUCTOR to force the variable into .data;
7265 otherwise we can use error_mark_node. */
7268 obscure_complex_init (decl
, init
)
7271 if (! flag_no_inline
&& TREE_STATIC (decl
))
7273 if (extract_init (decl
, init
))
7277 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7278 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7279 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7283 DECL_INITIAL (decl
) = error_mark_node
;
7288 /* Issue an error message if DECL is an uninitialized const variable. */
7291 check_for_uninitialized_const_var (decl
)
7294 tree type
= TREE_TYPE (decl
);
7296 /* ``Unless explicitly declared extern, a const object does not have
7297 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7299 if (TREE_CODE (decl
) == VAR_DECL
7300 && TREE_CODE (type
) != REFERENCE_TYPE
7301 && CP_TYPE_CONST_P (type
)
7302 && !TYPE_NEEDS_CONSTRUCTING (type
)
7303 && !DECL_INITIAL (decl
))
7304 cp_error ("uninitialized const `%D'", decl
);
7307 /* Finish processing of a declaration;
7308 install its line number and initial value.
7309 If the length of an array type is not known before,
7310 it must be determined now, from the initial value, or it is an error.
7312 Call `pop_obstacks' iff NEED_POP is nonzero.
7314 For C++, `cp_finish_decl' must be fairly evasive: it must keep initializers
7315 for aggregates that have constructors alive on the permanent obstack,
7316 so that the global initializing functions can be written at the end.
7318 INIT0 holds the value of an initializer that should be allowed to escape
7321 FLAGS is LOOKUP_ONLYCONVERTING is the = init syntax was used, else 0
7322 if the (init) syntax was used.
7324 For functions that take default parameters, DECL points to its
7325 "maximal" instantiation. `cp_finish_decl' must then also declared its
7326 subsequently lower and lower forms of instantiation, checking for
7327 ambiguity as it goes. This can be sped up later. */
7330 cp_finish_decl (decl
, init
, asmspec_tree
, need_pop
, flags
)
7337 tree cleanup
= NULL_TREE
, ttype
= NULL_TREE
;
7339 int temporary
= allocation_temporary_p ();
7340 const char *asmspec
= NULL
;
7341 int was_readonly
= 0;
7342 int already_used
= 0;
7345 /* If this is 0, then we did not change obstacks. */
7349 error ("assignment (not initialization) in declaration");
7353 /* If a name was specified, get the string. */
7355 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
7357 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
7359 cp_error ("Cannot initialize `%D' to namespace `%D'",
7364 if (current_class_type
7365 && DECL_REAL_CONTEXT (decl
) == current_class_type
7366 && TYPE_BEING_DEFINED (current_class_type
)
7367 && (DECL_INITIAL (decl
) || init
))
7368 DECL_DEFINED_IN_CLASS_P (decl
) = 1;
7370 if (TREE_CODE (decl
) == VAR_DECL
7371 && DECL_CONTEXT (decl
)
7372 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7373 && DECL_CONTEXT (decl
) != current_namespace
7376 /* Leave the namespace of the object. */
7377 pop_decl_namespace ();
7380 /* If the type of the thing we are declaring either has
7381 a constructor, or has a virtual function table pointer,
7382 AND its initialization was accepted by `start_decl',
7383 then we stayed on the permanent obstack through the
7384 declaration, otherwise, changed obstacks as GCC would. */
7386 type
= TREE_TYPE (decl
);
7388 if (type
== error_mark_node
)
7390 if (toplevel_bindings_p () && temporary
)
7391 end_temporary_allocation ();
7396 if (TYPE_HAS_MUTABLE_P (type
))
7397 TREE_READONLY (decl
) = 0;
7399 if (processing_template_decl
)
7401 if (init
&& DECL_INITIAL (decl
))
7402 DECL_INITIAL (decl
) = copy_to_permanent (init
);
7406 /* Take care of TYPE_DECLs up front. */
7407 if (TREE_CODE (decl
) == TYPE_DECL
)
7409 if (init
&& DECL_INITIAL (decl
))
7411 /* typedef foo = bar; store the type of bar as the type of foo. */
7412 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
7413 DECL_INITIAL (decl
) = init
= NULL_TREE
;
7415 if (type
!= error_mark_node
7416 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
7418 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
7419 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
7420 set_identifier_type_value (DECL_NAME (decl
), type
);
7421 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
7423 GNU_xref_decl (current_function_decl
, decl
);
7425 /* If we have installed this as the canonical typedef for this
7426 type, and that type has not been defined yet, delay emitting
7427 the debug information for it, as we will emit it later. */
7428 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
7429 && TYPE_SIZE (TREE_TYPE (decl
)) == NULL_TREE
)
7430 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
7432 rest_of_decl_compilation (decl
, NULL_PTR
,
7433 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
7437 if (TREE_CODE (decl
) != FUNCTION_DECL
)
7438 ttype
= target_type (type
);
7440 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
7441 && TYPE_NEEDS_CONSTRUCTING (type
))
7443 /* Currently, GNU C++ puts constants in text space, making them
7444 impossible to initialize. In the future, one would hope for
7445 an operating system which understood the difference between
7446 initialization and the running of a program. */
7448 TREE_READONLY (decl
) = 0;
7451 if (TREE_CODE (decl
) == FIELD_DECL
)
7453 if (init
&& init
!= error_mark_node
)
7454 my_friendly_assert (TREE_PERMANENT (init
), 147);
7458 /* This must override the asm specifier which was placed
7459 by grokclassfn. Lay this out fresh. */
7460 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
7461 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7462 make_decl_rtl (decl
, asmspec
, 0);
7465 /* If `start_decl' didn't like having an initialization, ignore it now. */
7466 else if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7468 else if (DECL_EXTERNAL (decl
))
7470 else if (TREE_CODE (type
) == REFERENCE_TYPE
)
7472 if (TREE_STATIC (decl
))
7473 make_decl_rtl (decl
, NULL_PTR
, toplevel_bindings_p ());
7474 grok_reference_init (decl
, type
, init
);
7478 /* Check for certain invalid initializations. */
7481 if (TYPE_SIZE (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7483 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7486 if (TREE_CODE (type
) == ARRAY_TYPE
7487 && !TYPE_SIZE (complete_type (TREE_TYPE (type
))))
7489 cp_error ("elements of array `%#D' have incomplete type", decl
);
7494 GNU_xref_decl (current_function_decl
, decl
);
7497 while (TREE_CODE (core_type
) == ARRAY_TYPE
)
7498 core_type
= TREE_TYPE (core_type
);
7500 if (TREE_CODE (decl
) == FIELD_DECL
)
7502 else if (TREE_CODE (decl
) == CONST_DECL
)
7504 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7506 DECL_INITIAL (decl
) = init
;
7508 /* This will keep us from needing to worry about our obstacks. */
7509 my_friendly_assert (init
!= NULL_TREE
, 149);
7514 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7516 if (TREE_CODE (type
) == ARRAY_TYPE
)
7517 init
= digest_init (type
, init
, (tree
*) 0);
7518 else if (TREE_CODE (init
) == CONSTRUCTOR
7519 && TREE_HAS_CONSTRUCTOR (init
))
7521 if (TYPE_NON_AGGREGATE_CLASS (type
))
7523 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7525 init
= error_mark_node
;
7528 goto dont_use_constructor
;
7533 dont_use_constructor
:
7534 if (TREE_CODE (init
) != TREE_VEC
)
7535 init
= store_init_value (decl
, init
);
7539 /* We must hide the initializer so that expand_decl
7540 won't try to do something it does not understand. */
7541 init
= obscure_complex_init (decl
, init
);
7543 else if (DECL_EXTERNAL (decl
))
7545 else if (TREE_CODE_CLASS (TREE_CODE (type
)) == 't'
7546 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7548 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7550 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7551 cp_error ("structure `%D' with uninitialized const members", decl
);
7552 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7553 cp_error ("structure `%D' with uninitialized reference members",
7557 check_for_uninitialized_const_var (decl
);
7559 if (TYPE_SIZE (type
) != NULL_TREE
7560 && TYPE_NEEDS_CONSTRUCTING (type
))
7561 init
= obscure_complex_init (decl
, NULL_TREE
);
7565 check_for_uninitialized_const_var (decl
);
7567 /* For top-level declaration, the initial value was read in
7568 the temporary obstack. MAXINDEX, rtl, etc. to be made below
7569 must go in the permanent obstack; but don't discard the
7570 temporary data yet. */
7572 if (toplevel_bindings_p () && temporary
)
7573 end_temporary_allocation ();
7575 /* Deduce size of array from initialization, if not already known. */
7577 if (TREE_CODE (type
) == ARRAY_TYPE
7578 && TYPE_DOMAIN (type
) == NULL_TREE
7579 && TREE_CODE (decl
) != TYPE_DECL
)
7582 = (TREE_STATIC (decl
)
7583 /* Even if pedantic, an external linkage array
7584 may have incomplete type at first. */
7585 ? pedantic
&& ! DECL_EXTERNAL (decl
)
7586 : !DECL_EXTERNAL (decl
));
7587 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7588 int failure
= complete_array_type (type
, initializer
, do_default
);
7591 cp_error ("initializer fails to determine size of `%D'", decl
);
7596 cp_error ("array size missing in `%D'", decl
);
7597 /* If a `static' var's size isn't known, make it extern as
7598 well as static, so it does not get allocated. If it's not
7599 `static', then don't mark it extern; finish_incomplete_decl
7600 will give it a default size and it will get allocated. */
7601 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7602 DECL_EXTERNAL (decl
) = 1;
7605 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7606 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7608 cp_error ("zero-size array `%D'", decl
);
7610 layout_decl (decl
, 0);
7613 if (TREE_CODE (decl
) == VAR_DECL
)
7615 if (DECL_SIZE (decl
) == NULL_TREE
7616 && TYPE_SIZE (complete_type (TREE_TYPE (decl
))) != NULL_TREE
)
7617 layout_decl (decl
, 0);
7619 if (TREE_STATIC (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7621 /* A static variable with an incomplete type:
7622 that is an error if it is initialized.
7623 Otherwise, let it through, but if it is not `extern'
7624 then it may cause an error message later. */
7625 if (DECL_INITIAL (decl
) != NULL_TREE
)
7626 cp_error ("storage size of `%D' isn't known", decl
);
7629 else if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7631 /* An automatic variable with an incomplete type: that is an error.
7632 Don't talk about array types here, since we took care of that
7633 message in grokdeclarator. */
7634 cp_error ("storage size of `%D' isn't known", decl
);
7635 TREE_TYPE (decl
) = error_mark_node
;
7637 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7638 /* Let debugger know it should output info for this type. */
7639 note_debug_info_needed (ttype
);
7641 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7642 note_debug_info_needed (DECL_CONTEXT (decl
));
7644 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7645 && DECL_SIZE (decl
) != NULL_TREE
7646 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7648 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7649 constant_expression_warning (DECL_SIZE (decl
));
7651 cp_error ("storage size of `%D' isn't constant", decl
);
7654 if (! DECL_EXTERNAL (decl
) && TYPE_NEEDS_DESTRUCTOR (type
)
7655 /* Cleanups for static variables are handled by `finish_file'. */
7656 && ! TREE_STATIC (decl
))
7658 int yes
= suspend_momentary ();
7659 cleanup
= maybe_build_cleanup (decl
);
7660 resume_momentary (yes
);
7663 /* PARM_DECLs get cleanups, too. */
7664 else if (TREE_CODE (decl
) == PARM_DECL
&& TYPE_NEEDS_DESTRUCTOR (type
))
7667 end_temporary_allocation ();
7668 cleanup
= maybe_build_cleanup (decl
);
7670 resume_temporary_allocation ();
7673 /* Output the assembler code and/or RTL code for variables and functions,
7674 unless the type is an undefined structure or union.
7675 If not, it will get done when the type is completed. */
7677 was_incomplete
= (DECL_SIZE (decl
) == NULL_TREE
);
7679 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
7680 || TREE_CODE (decl
) == RESULT_DECL
)
7682 /* ??? FIXME: What about nested classes? */
7683 int toplev
= toplevel_bindings_p ();
7685 = (TREE_STATIC (decl
) && TYPE_NEEDS_DESTRUCTOR (type
)
7686 && allocation_temporary_p ());
7689 end_temporary_allocation ();
7691 /* Static data in a function with comdat linkage also has comdat
7693 if (TREE_CODE (decl
) == VAR_DECL
7694 && TREE_STATIC (decl
)
7695 /* Don't mess with __FUNCTION__. */
7696 && ! TREE_ASM_WRITTEN (decl
)
7697 && current_function_decl
7698 && DECL_CONTEXT (decl
) == current_function_decl
7699 && (DECL_THIS_INLINE (current_function_decl
)
7700 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7701 && TREE_PUBLIC (current_function_decl
))
7703 /* Rather than try to get this right with inlining, we suppress
7704 inlining of such functions. */
7705 current_function_cannot_inline
7706 = "function with static variable cannot be inline";
7708 /* If flag_weak, we don't need to mess with this, as we can just
7709 make the function weak, and let it refer to its unique local
7710 copy. This works because we don't allow the function to be
7714 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7716 TREE_PUBLIC (decl
) = 1;
7717 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7719 else if (DECL_INITIAL (decl
) == NULL_TREE
7720 || DECL_INITIAL (decl
) == error_mark_node
)
7722 TREE_PUBLIC (decl
) = 1;
7723 DECL_COMMON (decl
) = 1;
7725 /* else we lose. We can only do this if we can use common,
7726 which we can't if it has been initialized. */
7728 if (TREE_PUBLIC (decl
))
7729 DECL_ASSEMBLER_NAME (decl
)
7730 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7731 else if (! DECL_ARTIFICIAL (decl
))
7733 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7734 cp_warning_at (" you can work around this by removing the initializer", decl
);
7739 else if (TREE_CODE (decl
) == VAR_DECL
7740 && DECL_LANG_SPECIFIC (decl
)
7741 && DECL_COMDAT (decl
))
7742 /* Set it up again; we might have set DECL_INITIAL since the
7744 comdat_linkage (decl
);
7746 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_VIRTUAL_P (decl
))
7747 make_decl_rtl (decl
, NULL_PTR
, toplev
);
7748 else if (TREE_CODE (decl
) == VAR_DECL
7749 && TREE_READONLY (decl
)
7750 && DECL_INITIAL (decl
) != NULL_TREE
7751 && DECL_INITIAL (decl
) != error_mark_node
7752 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
7754 DECL_INITIAL (decl
) = save_expr (DECL_INITIAL (decl
));
7757 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7760 && TREE_STATIC (decl
)
7761 && ! TREE_SIDE_EFFECTS (decl
)
7762 && ! TREE_PUBLIC (decl
)
7763 && ! DECL_EXTERNAL (decl
)
7764 && ! TYPE_NEEDS_DESTRUCTOR (type
)
7765 && DECL_MODE (decl
) != BLKmode
)
7767 /* If this variable is really a constant, then fill its DECL_RTL
7768 slot with something which won't take up storage.
7769 If something later should take its address, we can always give
7770 it legitimate RTL at that time. */
7771 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
7772 store_expr (DECL_INITIAL (decl
), DECL_RTL (decl
), 0);
7773 TREE_ASM_WRITTEN (decl
) = 1;
7775 else if (toplev
&& ! TREE_PUBLIC (decl
))
7777 /* If this is a static const, change its apparent linkage
7778 if it belongs to a #pragma interface. */
7779 if (!interface_unknown
)
7781 TREE_PUBLIC (decl
) = 1;
7782 DECL_EXTERNAL (decl
) = interface_only
;
7784 make_decl_rtl (decl
, asmspec
, toplev
);
7787 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7789 else if (TREE_CODE (decl
) == VAR_DECL
7790 && DECL_LANG_SPECIFIC (decl
)
7791 && DECL_IN_AGGR_P (decl
))
7793 if (TREE_STATIC (decl
))
7795 if (init
== NULL_TREE
7796 #ifdef DEFAULT_STATIC_DEFS
7797 /* If this code is dead, then users must
7798 explicitly declare static member variables
7799 outside the class def'n as well. */
7800 && TYPE_NEEDS_CONSTRUCTING (type
)
7804 DECL_EXTERNAL (decl
) = 1;
7805 make_decl_rtl (decl
, asmspec
, 1);
7808 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7811 /* Just a constant field. Should not need any rtl. */
7815 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7818 resume_temporary_allocation ();
7820 if (!abstract_virtuals_error (decl
, core_type
)
7821 && (TREE_CODE (type
) == FUNCTION_TYPE
7822 || TREE_CODE (type
) == METHOD_TYPE
))
7823 abstract_virtuals_error (decl
, TREE_TYPE (type
));
7825 if (TREE_CODE (decl
) == FUNCTION_DECL
)
7827 else if (DECL_EXTERNAL (decl
)
7828 && ! (DECL_LANG_SPECIFIC (decl
)
7829 && DECL_NOT_REALLY_EXTERN (decl
)))
7832 DECL_INITIAL (decl
) = init
;
7834 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
7836 /* Cleanups for static variables are handled by `finish_file'. */
7837 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7838 || TYPE_NEEDS_DESTRUCTOR (type
))
7839 expand_static_init (decl
, init
);
7843 /* This is a declared decl which must live until the
7844 end of the binding contour. It may need a cleanup. */
7846 /* Recompute the RTL of a local array now
7847 if it used to be an incomplete type. */
7848 if (was_incomplete
&& ! TREE_STATIC (decl
))
7850 /* If we used it already as memory, it must stay in memory. */
7851 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7852 /* If it's still incomplete now, no init will save it. */
7853 if (DECL_SIZE (decl
) == NULL_TREE
)
7854 DECL_INITIAL (decl
) = NULL_TREE
;
7857 else if (! TREE_ASM_WRITTEN (decl
)
7858 && (TYPE_SIZE (type
) != NULL_TREE
7859 || TREE_CODE (type
) == ARRAY_TYPE
))
7861 /* Do this here, because we did not expand this decl's
7862 rtl in start_decl. */
7863 if (DECL_RTL (decl
) == NULL_RTX
)
7867 /* XXX: Why don't we use decl here? */
7868 /* Ans: Because it was already expanded? */
7869 if (! expand_decl_cleanup (NULL_TREE
, cleanup
))
7870 cp_error ("parser lost in parsing declaration of `%D'",
7872 /* Cleanup used up here. */
7873 cleanup
= NULL_TREE
;
7877 if (current_binding_level
->is_for_scope
)
7879 struct binding_level
*outer
7880 = current_binding_level
->level_chain
;
7882 /* Check to see if the same name is already bound at
7883 the outer level, either because it was directly declared,
7884 or because a dead for-decl got preserved. In either case,
7885 the code would not have been valid under the ARM
7886 scope rules, so clear is_for_scope for the
7887 current_binding_level.
7889 Otherwise, we need to preserve the temp slot for decl
7890 to last into the outer binding level. */
7893 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7895 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7896 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7898 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7900 BINDING_VALUE (outer_binding
)
7901 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7902 current_binding_level
->is_for_scope
= 0;
7904 else if (DECL_IN_MEMORY_P (decl
))
7905 preserve_temp_slots (DECL_RTL (decl
));
7908 expand_start_target_temps ();
7910 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7912 /* Compute and store the initial value. */
7913 expand_decl_init (decl
);
7914 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7916 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7918 emit_line_note (DECL_SOURCE_FILE (decl
),
7919 DECL_SOURCE_LINE (decl
));
7920 /* We call push_momentary here so that when
7921 finish_expr_stmt clears the momentary obstack it
7922 doesn't destory any momentary expressions we may
7923 have lying around. Although cp_finish_decl is
7924 usually called at the end of a declaration
7925 statement, it may also be called for a temporary
7926 object in the middle of an expression. */
7928 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7932 /* Set this to 0 so we can tell whether an aggregate which
7933 was initialized was ever used. Don't do this if it has a
7934 destructor, so we don't complain about the 'resource
7935 allocation is initialization' idiom. */
7936 /* Now set attribute((unused)) on types so decls of
7937 that type will be marked used. (see TREE_USED, above.)
7938 This avoids the warning problems this particular code
7939 tried to work around. */
7941 if (TYPE_NEEDS_CONSTRUCTING (type
)
7943 && cleanup
== NULL_TREE
7944 && DECL_NAME (decl
))
7945 TREE_USED (decl
) = 0;
7948 TREE_USED (decl
) = 1;
7951 /* Cleanup any temporaries needed for the initial value. */
7952 expand_end_target_temps ();
7954 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7956 /* Store the cleanup, if there was one. */
7959 if (! expand_decl_cleanup (decl
, cleanup
))
7960 cp_error ("parser lost in parsing declaration of `%D'",
7967 /* Undo call to `pushclass' that was done in `start_decl'
7968 due to initialization of qualified member variable.
7969 I.e., Foo::x = 10; */
7971 tree context
= DECL_REAL_CONTEXT (decl
);
7973 && TREE_CODE_CLASS (TREE_CODE (context
)) == 't'
7974 && (TREE_CODE (decl
) == VAR_DECL
7975 /* We also have a pushclass done that we need to undo here
7976 if we're at top level and declare a method. */
7977 || TREE_CODE (decl
) == FUNCTION_DECL
)
7978 /* If size hasn't been set, we're still defining it,
7979 and therefore inside the class body; don't pop
7980 the binding level.. */
7981 && TYPE_SIZE (context
) != NULL_TREE
7982 && context
== current_class_type
)
7983 pop_nested_class ();
7989 /* If requested, warn about definitions of large data objects. */
7991 if (warn_larger_than
7992 && ! processing_template_decl
7993 && (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
7994 && !DECL_EXTERNAL (decl
))
7996 register tree decl_size
= DECL_SIZE (decl
);
7998 if (decl_size
&& TREE_CODE (decl_size
) == INTEGER_CST
)
8000 unsigned units
= TREE_INT_CST_LOW (decl_size
) / BITS_PER_UNIT
;
8002 if (units
> larger_than_size
)
8003 warning_with_decl (decl
, "size of `%s' is %u bytes", units
);
8009 /* Resume permanent allocation, if not within a function. */
8010 /* The corresponding push_obstacks_nochange is in start_decl,
8011 start_method, groktypename, and in grokfield. */
8016 TREE_READONLY (decl
) = 1;
8019 /* This is here for a midend callback from c-common.c */
8022 finish_decl (decl
, init
, asmspec_tree
)
8026 cp_finish_decl (decl
, init
, asmspec_tree
, 1, 0);
8030 expand_static_init (decl
, init
)
8034 tree oldstatic
= value_member (decl
, static_aggregates
);
8038 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
8039 cp_error ("multiple initializations given for `%D'", decl
);
8041 else if (! toplevel_bindings_p ())
8043 /* Emit code to perform this initialization but once. */
8048 /* Remember this information until end of file. */
8049 push_obstacks (&permanent_obstack
, &permanent_obstack
);
8051 /* Emit code to perform this initialization but once. This code
8054 static int temp = 0;
8056 // Do initialization.
8058 // Register variable for destruction at end of program.
8061 Note that the `temp' variable is only set to 1 *after* the
8062 initialization is complete. This ensures that an exception,
8063 thrown during the construction, will cause the variable to
8064 reinitialized when we pass through this code again, as per:
8068 If the initialization exits by throwing an exception, the
8069 initialization is not complete, so it will be tried again
8070 the next time control enters the declaration.
8072 In theory, this process should be thread-safe, too; multiple
8073 threads should not be able to initialize the variable more
8074 than once. We don't yet attempt to ensure thread-safety. */
8075 temp
= get_temp_name (integer_type_node
, 1);
8076 rest_of_decl_compilation (temp
, NULL_PTR
, 0, 0);
8078 /* Begin the conditional initialization. */
8079 expand_start_cond (build_binary_op (EQ_EXPR
, temp
,
8080 integer_zero_node
), 0);
8082 /* Do the initialization itself. */
8083 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
8084 || (init
&& TREE_CODE (init
) == TREE_LIST
))
8085 assignment
= build_aggr_init (decl
, init
, 0);
8087 assignment
= build_modify_expr (decl
, NOP_EXPR
, init
);
8089 assignment
= NULL_TREE
;
8091 /* Once the assignment is complete, set TEMP to 1. Since the
8092 construction of the static object is complete at this point,
8093 we want to make sure TEMP is set to 1 even if a temporary
8094 constructed during the initialization throws an exception
8095 when it is destroyed. So, we combine the initialization and
8096 the assignment to TEMP into a single expression, ensuring
8097 that when we call finish_expr_stmt the cleanups will not be
8098 run until after TEMP is set to 1. */
8099 temp_init
= build_modify_expr (temp
, NOP_EXPR
, integer_one_node
);
8102 assignment
= tree_cons (NULL_TREE
, assignment
,
8103 build_tree_list (NULL_TREE
,
8105 assignment
= build_compound_expr (assignment
);
8108 assignment
= temp_init
;
8109 finish_expr_stmt (assignment
);
8111 /* Use atexit to register a function for destroying this static
8113 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
8115 tree cleanup
, fcall
;
8116 static tree Atexit
= 0;
8117 int saved_flag_access_control
;
8121 tree atexit_fndecl
, PFV
, pfvlist
;
8122 /* Remember this information until end of file. */
8123 push_obstacks (&permanent_obstack
, &permanent_obstack
);
8124 PFV
= build_pointer_type (build_function_type
8125 (void_type_node
, void_list_node
));
8127 pfvlist
= tree_cons (NULL_TREE
, PFV
, void_list_node
);
8129 push_lang_context (lang_name_c
);
8130 /* Note that we do not call pushdecl for this function;
8131 there's no reason that this declaration should be
8132 accessible to anyone. */
8134 = define_function ("atexit",
8135 build_function_type (void_type_node
,
8140 mark_used (atexit_fndecl
);
8141 Atexit
= default_conversion (atexit_fndecl
);
8142 pop_lang_context ();
8146 /* Call build_cleanup before we enter the anonymous function
8147 so that any access checks will be done relative to the
8148 current scope, rather than the scope of the anonymous
8150 build_cleanup (decl
);
8152 /* Now start the function. */
8153 cleanup
= start_anon_func ();
8155 /* Now, recompute the cleanup. It may contain SAVE_EXPRs
8156 that refer to the original function, rather than the
8157 anonymous one. That will make the back-end think that
8158 nested functions are in use, which causes confusion. */
8159 saved_flag_access_control
= flag_access_control
;
8160 flag_access_control
= 0;
8161 fcall
= build_cleanup (decl
);
8162 flag_access_control
= saved_flag_access_control
;
8164 /* Finish off the function. */
8165 expand_expr_stmt (fcall
);
8168 /* Call atexit with the cleanup function. */
8169 mark_addressable (cleanup
);
8170 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
8171 fcall
= build_function_call (Atexit
,
8172 expr_tree_cons (NULL_TREE
,
8175 expand_expr_stmt (fcall
);
8179 /* Resume old (possibly temporary) allocation. */
8184 /* This code takes into account memory allocation policy of
8185 `start_decl'. Namely, if TYPE_NEEDS_CONSTRUCTING does not
8186 hold for this object, then we must make permanent the storage
8187 currently in the temporary obstack. */
8188 if (!TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
8189 preserve_initializer ();
8190 static_aggregates
= perm_tree_cons (init
, decl
, static_aggregates
);
8194 /* Make TYPE a complete type based on INITIAL_VALUE.
8195 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8196 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8199 complete_array_type (type
, initial_value
, do_default
)
8200 tree type
, initial_value
;
8203 register tree maxindex
= NULL_TREE
;
8206 /* Allocate on the same obstack as TYPE. */
8207 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
8211 /* Note MAXINDEX is really the maximum index,
8212 one less than the size. */
8213 if (TREE_CODE (initial_value
) == STRING_CST
)
8216 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8217 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8220 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8222 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8223 maxindex
= size_binop (MINUS_EXPR
, integer_zero_node
, size_one_node
);
8224 for (; elts
; elts
= TREE_CHAIN (elts
))
8226 if (TREE_PURPOSE (elts
))
8227 maxindex
= TREE_PURPOSE (elts
);
8229 maxindex
= size_binop (PLUS_EXPR
, maxindex
, size_one_node
);
8231 maxindex
= copy_node (maxindex
);
8235 /* Make an error message unless that happened already. */
8236 if (initial_value
!= error_mark_node
)
8239 initial_value
= NULL_TREE
;
8241 /* Prevent further error messages. */
8242 maxindex
= build_int_2 (0, 0);
8249 maxindex
= build_int_2 (0, 0);
8258 domain
= build_index_type (maxindex
);
8259 TYPE_DOMAIN (type
) = domain
;
8261 if (! TREE_TYPE (maxindex
))
8262 TREE_TYPE (maxindex
) = domain
;
8264 itype
= TREE_TYPE (initial_value
);
8267 if (itype
&& !TYPE_DOMAIN (itype
))
8268 TYPE_DOMAIN (itype
) = domain
;
8269 /* The type of the main variant should never be used for arrays
8270 of different sizes. It should only ever be completed with the
8271 size of the array. */
8272 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8273 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8278 /* Lay out the type now that we can get the real answer. */
8285 /* Return zero if something is declared to be a member of type
8286 CTYPE when in the context of CUR_TYPE. STRING is the error
8287 message to print in that case. Otherwise, quietly return 1. */
8290 member_function_or_else (ctype
, cur_type
, string
)
8291 tree ctype
, cur_type
;
8294 if (ctype
&& ctype
!= cur_type
)
8296 error (string
, TYPE_NAME_STRING (ctype
));
8302 /* Subroutine of `grokdeclarator'. */
8304 /* Generate errors possibly applicable for a given set of specifiers.
8305 This is for ARM $7.1.2. */
8308 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8311 int virtualp
, quals
, friendp
, raises
, inlinep
;
8314 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8316 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8318 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8321 cp_error_at ("`%D' declared as a friend", object
);
8323 cp_error_at ("`%D' declared with an exception specification", object
);
8326 /* CTYPE is class type, or null if non-class.
8327 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8329 DECLARATOR is the function's name.
8330 VIRTUALP is truthvalue of whether the function is virtual or not.
8331 FLAGS are to be passed through to `grokclassfn'.
8332 QUALS are qualifiers indicating whether the function is `const'
8334 RAISES is a list of exceptions that this function can raise.
8335 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8336 not look, and -1 if we should not call `grokclassfn' at all.
8338 Returns `NULL_TREE' if something goes wrong, after issuing
8339 applicable error messages. */
8342 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8343 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8344 template_count
, in_namespace
)
8347 tree orig_declarator
;
8349 enum overload_flags flags
;
8351 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8355 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8356 int has_default_arg
= 0;
8360 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8361 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8367 type
= build_exception_variant (type
, raises
);
8370 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8371 /* Propagate volatile out from type to decl. */
8372 if (TYPE_VOLATILE (type
))
8373 TREE_THIS_VOLATILE (decl
) = 1;
8375 /* If this decl has namespace scope, set that up. */
8377 set_decl_namespace (decl
, in_namespace
, friendp
);
8378 else if (publicp
&& ! ctype
)
8379 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8381 /* `main' and builtins have implicit 'C' linkage. */
8382 if ((MAIN_NAME_P (declarator
)
8383 || (IDENTIFIER_LENGTH (declarator
) > 10
8384 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8385 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8386 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8387 && current_lang_name
== lang_name_cplusplus
8388 && ctype
== NULL_TREE
8389 /* NULL_TREE means global namespace. */
8390 && DECL_CONTEXT (decl
) == NULL_TREE
)
8391 DECL_LANGUAGE (decl
) = lang_c
;
8393 /* Should probably propagate const out from type to decl I bet (mrs). */
8396 DECL_STATIC_FUNCTION_P (decl
) = 1;
8397 DECL_CONTEXT (decl
) = ctype
;
8401 DECL_CLASS_CONTEXT (decl
) = ctype
;
8403 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8405 if (processing_template_decl
)
8406 error ("cannot declare `main' to be a template");
8408 error ("cannot declare `main' to be inline");
8410 error ("cannot declare `main' to be static");
8415 /* Members of anonymous types and local classes have no linkage; make
8417 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8418 || hack_decl_function_context (TYPE_MAIN_DECL (ctype
))))
8423 /* [basic.link]: A name with no linkage (notably, the name of a class
8424 or enumeration declared in a local scope) shall not be used to
8425 declare an entity with linkage.
8427 Only check this for public decls for now. */
8428 t
= no_linkage_check (TREE_TYPE (decl
));
8431 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8433 if (DECL_LANGUAGE (decl
) == lang_c
)
8434 /* Allow this; it's pretty common in C. */;
8436 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8440 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8445 TREE_PUBLIC (decl
) = publicp
;
8448 DECL_INTERFACE_KNOWN (decl
) = 1;
8449 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8453 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8455 DECL_EXTERNAL (decl
) = 1;
8456 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8458 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8459 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8463 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8464 grok_op_properties (decl
, virtualp
, check
< 0);
8466 if (ctype
&& hack_decl_function_context (decl
))
8467 DECL_NO_STATIC_CHAIN (decl
) = 1;
8469 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8470 if (TREE_PURPOSE (t
)
8471 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8473 has_default_arg
= 1;
8478 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8482 ("defining explicit specialization `%D' in friend declaration",
8486 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8488 /* Something like `template <class T> friend void f<T>()'. */
8489 cp_error ("template-id `%D' in declaration of primary template",
8495 /* A friend declaration of the form friend void f<>(). Record
8496 the information in the TEMPLATE_ID_EXPR. */
8497 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8498 DECL_TEMPLATE_INFO (decl
)
8499 = perm_tree_cons (TREE_OPERAND (orig_declarator
, 0),
8500 TREE_OPERAND (orig_declarator
, 1),
8503 if (has_default_arg
)
8505 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8512 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8519 if (has_default_arg
)
8520 add_defarg_fn (decl
);
8522 /* Plain overloading: will not be grok'd by grokclassfn. */
8523 if (! ctype
&& ! processing_template_decl
8524 && DECL_LANGUAGE (decl
) != lang_c
8525 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8526 set_mangled_name_for_decl (decl
);
8529 /* Make the init_value nonzero so pushdecl knows this is not
8530 tentative. error_mark_node is replaced later with the BLOCK. */
8531 DECL_INITIAL (decl
) = error_mark_node
;
8533 /* Caller will do the rest of this. */
8537 if (check
&& funcdef_flag
)
8538 DECL_INITIAL (decl
) = error_mark_node
;
8540 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8543 /* Just handle constructors here. We could do this
8544 inside the following if stmt, but I think
8545 that the code is more legible by breaking this
8546 case out. See comments below for what each of
8547 the following calls is supposed to do. */
8548 DECL_CONSTRUCTOR_P (decl
) = 1;
8550 grokclassfn (ctype
, decl
, flags
, quals
);
8552 decl
= check_explicit_specialization (orig_declarator
, decl
,
8554 2 * (funcdef_flag
!= 0) +
8555 4 * (friendp
!= 0));
8556 if (decl
== error_mark_node
)
8559 if ((! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8562 tmp
= check_classfn (ctype
, decl
);
8564 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8565 tmp
= DECL_TEMPLATE_RESULT(tmp
);
8567 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8568 cp_error ("definition of implicitly-declared `%D'", tmp
);
8569 if (tmp
&& duplicate_decls (decl
, tmp
))
8572 if (! grok_ctor_properties (ctype
, decl
))
8579 /* Function gets the ugly name, field gets the nice one.
8580 This call may change the type of the function (because
8581 of default parameters)! */
8582 if (ctype
!= NULL_TREE
)
8583 grokclassfn (ctype
, decl
, flags
, quals
);
8585 decl
= check_explicit_specialization (orig_declarator
, decl
,
8587 2 * (funcdef_flag
!= 0) +
8588 4 * (friendp
!= 0));
8589 if (decl
== error_mark_node
)
8592 if (ctype
!= NULL_TREE
8593 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8596 tmp
= check_classfn (ctype
, decl
);
8598 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8599 tmp
= DECL_TEMPLATE_RESULT (tmp
);
8601 if (tmp
&& DECL_STATIC_FUNCTION_P (tmp
)
8602 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8604 /* Remove the `this' parm added by grokclassfn.
8605 XXX Isn't this done in start_function, too? */
8606 revert_static_member_fn (&decl
, NULL
, NULL
);
8607 last_function_parms
= TREE_CHAIN (last_function_parms
);
8609 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8610 cp_error ("definition of implicitly-declared `%D'", tmp
);
8613 /* Attempt to merge the declarations. This can fail, in
8614 the case of some illegal specialization declarations. */
8615 if (!duplicate_decls (decl
, tmp
))
8616 cp_error ("no `%#D' member function declared in class `%T'",
8622 if (ctype
== NULL_TREE
|| check
)
8627 DECL_VIRTUAL_P (decl
) = 1;
8628 if (DECL_VINDEX (decl
) == NULL_TREE
)
8629 DECL_VINDEX (decl
) = error_mark_node
;
8630 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
8637 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
8640 RID_BIT_TYPE
*specbits_in
;
8646 RID_BIT_TYPE specbits
;
8648 specbits
= *specbits_in
;
8650 if (TREE_CODE (type
) == OFFSET_TYPE
)
8652 /* If you declare a static member so that it
8653 can be initialized, the code will reach here. */
8654 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
8655 type
= TREE_TYPE (type
);
8656 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8657 DECL_CONTEXT (decl
) = basetype
;
8658 DECL_CLASS_CONTEXT (decl
) = basetype
;
8659 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
, declarator
);
8666 context
= in_namespace
;
8667 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
8668 context
= current_namespace
;
8670 context
= NULL_TREE
;
8672 if (processing_template_decl
)
8674 /* If we're in a template, we need DECL_LANG_SPECIFIC so that
8675 we can call push_template_decl. */
8676 push_permanent_obstack ();
8677 decl
= build_lang_decl (VAR_DECL
, declarator
,
8678 complete_type (type
));
8682 decl
= build_decl (VAR_DECL
, declarator
, complete_type (type
));
8685 set_decl_namespace (decl
, context
, 0);
8687 context
= DECL_CONTEXT (decl
);
8688 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
8689 DECL_ASSEMBLER_NAME (decl
) = build_static_name (context
, declarator
);
8693 set_decl_namespace (decl
, in_namespace
, 0);
8695 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
8697 DECL_THIS_EXTERN (decl
) = 1;
8698 DECL_EXTERNAL (decl
) = !initialized
;
8701 /* In class context, static means one per class,
8702 public access, and static storage. */
8703 if (DECL_CLASS_SCOPE_P (decl
))
8705 TREE_PUBLIC (decl
) = 1;
8706 TREE_STATIC (decl
) = 1;
8707 DECL_EXTERNAL (decl
) = 0;
8709 /* At top level, either `static' or no s.c. makes a definition
8710 (perhaps tentative), and absence of `static' makes it public. */
8711 else if (toplevel_bindings_p ())
8713 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
8714 && (DECL_THIS_EXTERN (decl
) || ! constp
));
8715 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
8717 /* Not at top level, only `static' makes a static definition. */
8720 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
8721 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
8724 if (TREE_PUBLIC (decl
))
8726 /* [basic.link]: A name with no linkage (notably, the name of a class
8727 or enumeration declared in a local scope) shall not be used to
8728 declare an entity with linkage.
8730 Only check this for public decls for now. */
8731 tree t
= no_linkage_check (TREE_TYPE (decl
));
8734 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8735 /* Ignore for now; `enum { foo } e' is pretty common. */;
8737 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
8745 /* Create and return a canonical pointer to member function type, for
8746 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
8749 build_ptrmemfunc_type (type
)
8755 tree unqualified_variant
= NULL_TREE
;
8757 /* If a canonical type already exists for this type, use it. We use
8758 this method instead of type_hash_canon, because it only does a
8759 simple equality check on the list of field members. */
8761 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
8764 /* Make sure that we always have the unqualified pointer-to-member
8766 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8768 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
8770 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
8772 u
= make_lang_type (UNION_TYPE
);
8773 SET_IS_AGGR_TYPE (u
, 0);
8774 fields
[0] = build_lang_decl (FIELD_DECL
, pfn_identifier
, type
);
8775 fields
[1] = build_lang_decl (FIELD_DECL
, delta2_identifier
,
8777 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
8778 TYPE_NAME (u
) = NULL_TREE
;
8780 t
= make_lang_type (RECORD_TYPE
);
8782 /* Let the front-end know this is a pointer to member function... */
8783 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
8784 /* ... and not really an aggregate. */
8785 SET_IS_AGGR_TYPE (t
, 0);
8787 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
8789 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
8791 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
8792 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
8796 /* Zap out the name so that the back-end will give us the debugging
8797 information for this anonymous RECORD_TYPE. */
8798 TYPE_NAME (t
) = NULL_TREE
;
8800 /* If this is not the unqualified form of this pointer-to-member
8801 type, set the TYPE_MAIN_VARIANT for this type to be the
8802 unqualified type. Since they are actually RECORD_TYPEs that are
8803 not variants of each other, we must do this manually. */
8804 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8806 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
8807 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
8808 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
8809 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
8812 /* Cache this pointer-to-member type so that we can find it again
8814 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
8816 /* Seems to be wanted. */
8817 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
8822 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
8823 Check to see that the definition is valid. Issue appropriate error
8824 messages. Return 1 if the definition is particularly bad, or 0
8828 check_static_variable_definition (decl
, type
)
8832 /* Motion 10 at San Diego: If a static const integral data member is
8833 initialized with an integral constant expression, the initializer
8834 may appear either in the declaration (within the class), or in
8835 the definition, but not both. If it appears in the class, the
8836 member is a member constant. The file-scope definition is always
8838 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
8840 cp_error ("in-class initialization of static data member of non-integral type `%T'",
8842 /* If we just return the declaration, crashes will sometimes
8843 occur. We therefore return void_type_node, as if this was a
8844 friend declaration, to cause callers to completely ignore
8845 this declaration. */
8848 else if (!CP_TYPE_CONST_P (type
))
8849 cp_error ("ANSI C++ forbids in-class initialization of non-const static member `%D'",
8851 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
8852 cp_pedwarn ("ANSI C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
8857 /* Given declspecs and a declarator,
8858 determine the name and type of the object declared
8859 and construct a ..._DECL node for it.
8860 (In one case we can return a ..._TYPE node instead.
8861 For invalid input we sometimes return 0.)
8863 DECLSPECS is a chain of tree_list nodes whose value fields
8864 are the storage classes and type specifiers.
8866 DECL_CONTEXT says which syntactic context this declaration is in:
8867 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
8868 FUNCDEF for a function definition. Like NORMAL but a few different
8869 error messages in each case. Return value may be zero meaning
8870 this definition is too screwy to try to parse.
8871 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
8872 handle member functions (which have FIELD context).
8873 Return value may be zero meaning this definition is too screwy to
8875 PARM for a parameter declaration (either within a function prototype
8876 or before a function body). Make a PARM_DECL, or return void_type_node.
8877 CATCHPARM for a parameter declaration before a catch clause.
8878 TYPENAME if for a typename (in a cast or sizeof).
8879 Don't make a DECL node; just return the ..._TYPE node.
8880 FIELD for a struct or union field; make a FIELD_DECL.
8881 BITFIELD for a field with specified width.
8882 INITIALIZED is 1 if the decl has an initializer.
8884 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
8885 normal attributes in TREE_PURPOSE, or NULL_TREE.
8887 In the TYPENAME case, DECLARATOR is really an absolute declarator.
8888 It may also be so in the PARM case, for a prototype where the
8889 argument type is specified but not the name.
8891 This function is where the complicated C meanings of `static'
8892 and `extern' are interpreted.
8894 For C++, if there is any monkey business to do, the function which
8895 calls this one must do it, i.e., prepending instance variables,
8896 renaming overloaded function names, etc.
8898 Note that for this C++, it is an error to define a method within a class
8899 which does not belong to that class.
8901 Except in the case where SCOPE_REFs are implicitly known (such as
8902 methods within a class being redundantly qualified),
8903 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
8904 (class_name::decl_name). The caller must also deal with this.
8906 If a constructor or destructor is seen, and the context is FIELD,
8907 then the type gains the attribute TREE_HAS_x. If such a declaration
8908 is erroneous, NULL_TREE is returned.
8910 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
8911 function, these are the qualifiers to give to the `this' pointer.
8913 May return void_type_node if the declarator turned out to be a friend.
8914 See grokfield for details. */
8916 enum return_types
{ return_normal
, return_ctor
, return_dtor
, return_conversion
};
8919 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
8922 enum decl_context decl_context
;
8926 RID_BIT_TYPE specbits
;
8929 tree type
= NULL_TREE
;
8935 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
8936 int explicit_int
= 0;
8937 int explicit_char
= 0;
8938 int defaulted_int
= 0;
8939 tree typedef_decl
= NULL_TREE
;
8941 tree typedef_type
= NULL_TREE
;
8942 int funcdef_flag
= 0;
8943 enum tree_code innermost_code
= ERROR_MARK
;
8946 /* See the code below that used this. */
8947 tree decl_machine_attr
= NULL_TREE
;
8949 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
8950 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
8951 tree init
= NULL_TREE
;
8953 /* Keep track of what sort of function is being processed
8954 so that we can warn about default return values, or explicit
8955 return values which do not match prescribed defaults. */
8956 enum return_types return_type
= return_normal
;
8958 tree dname
= NULL_TREE
;
8959 tree ctype
= current_class_type
;
8960 tree ctor_return_type
= NULL_TREE
;
8961 enum overload_flags flags
= NO_SPECIAL
;
8962 tree quals
= NULL_TREE
;
8963 tree raises
= NULL_TREE
;
8964 int template_count
= 0;
8965 tree in_namespace
= NULL_TREE
;
8969 RIDBIT_RESET_ALL (specbits
);
8970 if (decl_context
== FUNCDEF
)
8971 funcdef_flag
= 1, decl_context
= NORMAL
;
8972 else if (decl_context
== MEMFUNCDEF
)
8973 funcdef_flag
= -1, decl_context
= FIELD
;
8974 else if (decl_context
== BITFIELD
)
8975 bitfield
= 1, decl_context
= FIELD
;
8977 /* Look inside a declarator for the name being declared
8978 and get it as a string, for an error message. */
8980 tree
*next
= &declarator
;
8984 while (next
&& *next
)
8987 switch (TREE_CODE (decl
))
8990 /* For attributes. */
8991 next
= &TREE_VALUE (decl
);
8996 next
= &TREE_OPERAND (decl
, 0);
8999 case BIT_NOT_EXPR
: /* For C++ destructors! */
9001 tree name
= TREE_OPERAND (decl
, 0);
9002 tree rename
= NULL_TREE
;
9004 my_friendly_assert (flags
== NO_SPECIAL
, 152);
9006 return_type
= return_dtor
;
9007 if (TREE_CODE (name
) == TYPE_DECL
)
9008 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
9009 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
9010 if (ctype
== NULL_TREE
)
9012 if (current_class_type
== NULL_TREE
)
9014 error ("destructors must be member functions");
9019 tree t
= constructor_name (current_class_name
);
9026 tree t
= constructor_name (ctype
);
9033 cp_error ("destructor `%T' must match class name `%T'",
9035 TREE_OPERAND (decl
, 0) = rename
;
9041 case ADDR_EXPR
: /* C++ reference declaration */
9046 innermost_code
= TREE_CODE (decl
);
9047 next
= &TREE_OPERAND (decl
, 0);
9051 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
9053 /* This is actually a variable declaration using
9054 constructor syntax. We need to call start_decl and
9055 cp_finish_decl so we can get the variable
9058 tree attributes
, prefix_attributes
;
9060 *next
= TREE_OPERAND (decl
, 0);
9061 init
= CALL_DECLARATOR_PARMS (decl
);
9065 attributes
= TREE_PURPOSE (attrlist
);
9066 prefix_attributes
= TREE_VALUE (attrlist
);
9070 attributes
= NULL_TREE
;
9071 prefix_attributes
= NULL_TREE
;
9074 decl
= start_decl (declarator
, declspecs
, 1,
9075 attributes
, prefix_attributes
);
9078 /* Look for __unused__ attribute */
9079 if (TREE_USED (TREE_TYPE (decl
)))
9080 TREE_USED (decl
) = 1;
9081 finish_decl (decl
, init
, NULL_TREE
);
9084 cp_error ("invalid declarator");
9087 innermost_code
= TREE_CODE (decl
);
9088 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
9089 ctype
= current_class_type
;
9091 && TREE_OPERAND (decl
, 0)
9092 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
9093 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
9094 == constructor_name_full (ctype
))
9095 || (DECL_NAME (TREE_OPERAND (decl
, 0))
9096 == constructor_name (ctype
)))))
9097 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9098 next
= &TREE_OPERAND (decl
, 0);
9100 if (ctype
!= NULL_TREE
9101 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
9102 && decl
== constructor_name (ctype
))
9104 return_type
= return_ctor
;
9105 ctor_return_type
= ctype
;
9110 case TEMPLATE_ID_EXPR
:
9112 tree fns
= TREE_OPERAND (decl
, 0);
9114 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9115 fns
= TREE_OPERAND (fns
, 0);
9118 if (TREE_CODE (dname
) == COMPONENT_REF
)
9119 dname
= TREE_OPERAND (dname
, 1);
9120 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9122 my_friendly_assert (is_overloaded_fn (dname
),
9124 dname
= DECL_NAME (get_first_fn (dname
));
9129 case IDENTIFIER_NODE
:
9130 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9137 cp_error ("declarator-id missing; using reserved word `%D'",
9139 name
= IDENTIFIER_POINTER (dname
);
9141 if (! IDENTIFIER_OPNAME_P (dname
)
9142 /* GNU/Linux headers use '__op'. Arrgh. */
9143 || (IDENTIFIER_TYPENAME_P (dname
) && ! TREE_TYPE (dname
)))
9144 name
= IDENTIFIER_POINTER (dname
);
9147 if (IDENTIFIER_TYPENAME_P (dname
))
9149 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9150 flags
= TYPENAME_FLAG
;
9151 ctor_return_type
= TREE_TYPE (dname
);
9152 return_type
= return_conversion
;
9154 name
= operator_name_string (dname
);
9161 /* Perform error checking, and decide on a ctype. */
9162 tree cname
= TREE_OPERAND (decl
, 0);
9163 if (cname
== NULL_TREE
)
9165 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9168 in_namespace
= TREE_OPERAND (decl
, 0);
9169 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9171 else if (! is_aggr_type (cname
, 1))
9172 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9173 /* Must test TREE_OPERAND (decl, 1), in case user gives
9174 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9175 else if (TREE_OPERAND (decl
, 1)
9176 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9178 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9179 || TREE_CODE (cname
) == TEMPLATE_TEMPLATE_PARM
)
9181 cp_error ("`%T::%D' is not a valid declarator", cname
,
9182 TREE_OPERAND (decl
, 1));
9183 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9184 cname
, TREE_OPERAND (decl
, 1));
9185 return void_type_node
;
9187 else if (ctype
== NULL_TREE
)
9189 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9190 TREE_OPERAND (decl
, 0) = ctype
;
9193 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9195 cp_error ("type `%T' is not derived from type `%T'",
9197 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9203 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9204 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9205 == constructor_name_full (ctype
))
9206 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9207 == constructor_name (ctype
))))
9208 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9209 next
= &TREE_OPERAND (decl
, 1);
9213 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9214 && constructor_name (ctype
) == decl
)
9216 return_type
= return_ctor
;
9217 ctor_return_type
= ctype
;
9219 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9220 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9221 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9222 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9224 return_type
= return_dtor
;
9225 ctor_return_type
= ctype
;
9227 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9228 next
= &TREE_OPERAND (decl
, 0);
9239 /* Parse error puts this typespec where
9240 a declarator should go. */
9241 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9242 if (TREE_TYPE (decl
) == current_class_type
)
9243 cp_error (" perhaps you want `%T' for a constructor",
9244 current_class_name
);
9245 dname
= DECL_NAME (decl
);
9246 name
= IDENTIFIER_POINTER (dname
);
9248 /* Avoid giving two errors for this. */
9249 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9251 declspecs
= temp_tree_cons (NULL_TREE
, integer_type_node
,
9258 cp_compiler_error ("`%D' as declarator", decl
);
9259 return 0; /* We used to do a 155 abort here. */
9266 /* A function definition's declarator must have the form of
9267 a function declarator. */
9269 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9272 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9273 && innermost_code
!= CALL_EXPR
9274 && ! (ctype
&& declspecs
== NULL_TREE
))
9276 cp_error ("declaration of `%D' as non-function", dname
);
9277 return void_type_node
;
9280 /* Anything declared one level down from the top level
9281 must be one of the parameters of a function
9282 (because the body is at least two levels down). */
9284 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9285 by not allowing C++ class definitions to specify their parameters
9286 with xdecls (must be spec.d in the parmlist).
9288 Since we now wait to push a class scope until we are sure that
9289 we are in a legitimate method context, we must set oldcname
9290 explicitly (since current_class_name is not yet alive).
9292 We also want to avoid calling this a PARM if it is in a namespace. */
9294 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
9296 struct binding_level
*b
= current_binding_level
;
9297 current_binding_level
= b
->level_chain
;
9298 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9299 decl_context
= PARM
;
9300 current_binding_level
= b
;
9303 /* Look through the decl specs and record which ones appear.
9304 Some typespecs are defined as built-in typenames.
9305 Others, the ones that are modifiers of other types,
9306 are represented by bits in SPECBITS: set the bits for
9307 the modifiers that appear. Storage class keywords are also in SPECBITS.
9309 If there is a typedef name or a type, store the type in TYPE.
9310 This includes builtin typedefs such as `int'.
9312 Set EXPLICIT_INT if the type is `int' or `char' and did not
9313 come from a user typedef.
9315 Set LONGLONG if `long' is mentioned twice.
9317 For C++, constructors and destructors have their own fast treatment. */
9319 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
9324 /* Certain parse errors slip through. For example,
9325 `int class;' is not caught by the parser. Try
9326 weakly to recover here. */
9327 if (TREE_CODE (spec
) != TREE_LIST
)
9330 id
= TREE_VALUE (spec
);
9332 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9334 if (id
== ridpointers
[(int) RID_INT
]
9335 || id
== ridpointers
[(int) RID_CHAR
]
9336 || id
== ridpointers
[(int) RID_BOOL
]
9337 || id
== ridpointers
[(int) RID_WCHAR
])
9341 if (id
== ridpointers
[(int) RID_BOOL
])
9342 error ("`bool' is now a keyword");
9344 cp_error ("extraneous `%T' ignored", id
);
9348 if (id
== ridpointers
[(int) RID_INT
])
9350 else if (id
== ridpointers
[(int) RID_CHAR
])
9352 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
9356 /* C++ aggregate types. */
9357 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
9360 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
9362 type
= IDENTIFIER_TYPE_VALUE (id
);
9366 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
9368 if (ridpointers
[i
] == id
)
9370 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
9372 if (pedantic
&& ! in_system_header
&& warn_long_long
)
9373 pedwarn ("ANSI C++ does not support `long long'");
9375 error ("`long long long' is too long for GCC");
9379 else if (RIDBIT_SETP (i
, specbits
))
9380 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
9381 RIDBIT_SET (i
, specbits
);
9386 /* C++ aggregate types. */
9387 else if (TREE_CODE (id
) == TYPE_DECL
|| TREE_CODE (id
) == TEMPLATE_DECL
)
9390 cp_error ("multiple declarations `%T' and `%T'", type
,
9394 type
= TREE_TYPE (id
);
9395 TREE_VALUE (spec
) = type
;
9400 error ("two or more data types in declaration of `%s'", name
);
9401 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9403 register tree t
= lookup_name (id
, 1);
9404 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
9405 error ("`%s' fails to be a typedef or built in type",
9406 IDENTIFIER_POINTER (id
));
9409 type
= TREE_TYPE (t
);
9411 /* See the code below that used this. */
9412 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
9417 else if (id
!= error_mark_node
)
9418 /* Can't change CLASS nodes into RECORD nodes here! */
9424 typedef_type
= type
;
9426 /* No type at all: default to `int', and set DEFAULTED_INT
9427 because it was not a user-defined typedef. */
9429 if (type
== NULL_TREE
9430 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
9431 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9432 || RIDBIT_SETP (RID_LONG
, specbits
)
9433 || RIDBIT_SETP (RID_SHORT
, specbits
)))
9435 /* These imply 'int'. */
9436 type
= integer_type_node
;
9440 if (type
== NULL_TREE
)
9443 if (return_type
== return_dtor
)
9444 type
= void_type_node
;
9445 else if (return_type
== return_ctor
)
9446 type
= build_pointer_type (ctor_return_type
);
9447 else if (return_type
== return_conversion
)
9448 type
= ctor_return_type
;
9451 /* We handle `main' specially here, because 'main () { }' is so
9452 common. With no options, it is allowed. With -Wreturn-type,
9453 it is a warning. It is only an error with -pedantic-errors. */
9454 int is_main
= (funcdef_flag
9455 && MAIN_NAME_P (dname
)
9456 && ctype
== NULL_TREE
9457 && in_namespace
== NULL_TREE
9458 && current_namespace
== global_namespace
);
9460 if (in_system_header
|| flag_ms_extensions
)
9461 /* Allow it, sigh. */;
9462 else if (pedantic
|| ! is_main
)
9463 cp_pedwarn ("ANSI C++ forbids declaration `%D' with no type",
9465 else if (warn_return_type
)
9466 cp_warning ("ANSI C++ forbids declaration `%D' with no type",
9469 type
= integer_type_node
;
9472 else if (return_type
== return_dtor
)
9474 error ("return type specification for destructor invalid");
9475 type
= void_type_node
;
9477 else if (return_type
== return_ctor
)
9479 error ("return type specification for constructor invalid");
9480 type
= build_pointer_type (ctor_return_type
);
9482 else if (return_type
== return_conversion
)
9484 if (!same_type_p (type
, ctor_return_type
))
9485 cp_error ("operator `%T' declared to return `%T'",
9486 ctor_return_type
, type
);
9488 cp_pedwarn ("return type specified for `operator %T'",
9491 type
= ctor_return_type
;
9496 /* Now process the modifiers that were specified
9497 and check for invalid combinations. */
9499 /* Long double is a special combination. */
9501 if (RIDBIT_SETP (RID_LONG
, specbits
)
9502 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
9504 RIDBIT_RESET (RID_LONG
, specbits
);
9505 type
= build_qualified_type (long_double_type_node
,
9506 CP_TYPE_QUALS (type
));
9509 /* Check all other uses of type modifiers. */
9511 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9512 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9513 || RIDBIT_SETP (RID_LONG
, specbits
)
9514 || RIDBIT_SETP (RID_SHORT
, specbits
))
9518 if (TREE_CODE (type
) == REAL_TYPE
)
9519 error ("short, signed or unsigned invalid for `%s'", name
);
9520 else if (TREE_CODE (type
) != INTEGER_TYPE
)
9521 error ("long, short, signed or unsigned invalid for `%s'", name
);
9522 else if (RIDBIT_SETP (RID_LONG
, specbits
)
9523 && RIDBIT_SETP (RID_SHORT
, specbits
))
9524 error ("long and short specified together for `%s'", name
);
9525 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9526 || RIDBIT_SETP (RID_SHORT
, specbits
))
9528 error ("long or short specified with char for `%s'", name
);
9529 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9530 || RIDBIT_SETP (RID_SHORT
, specbits
))
9531 && TREE_CODE (type
) == REAL_TYPE
)
9532 error ("long or short specified with floating type for `%s'", name
);
9533 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9534 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
9535 error ("signed and unsigned given together for `%s'", name
);
9539 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
9541 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
9543 if (flag_pedantic_errors
)
9548 /* Discard the type modifiers if they are invalid. */
9551 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
9552 RIDBIT_RESET (RID_SIGNED
, specbits
);
9553 RIDBIT_RESET (RID_LONG
, specbits
);
9554 RIDBIT_RESET (RID_SHORT
, specbits
);
9559 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
9560 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
9562 error ("complex invalid for `%s'", name
);
9563 RIDBIT_RESET (RID_COMPLEX
, specbits
);
9566 /* Decide whether an integer type is signed or not.
9567 Optionally treat bitfields as signed by default. */
9568 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9571 It is implementation-defined whether a plain (neither
9572 explicitly signed or unsigned) char, short, int, or long
9573 bit-field is signed or unsigned.
9575 Naturally, we extend this to long long as well. Note that
9576 this does not include wchar_t. */
9577 || (bitfield
&& !flag_signed_bitfields
9578 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
9579 /* A typedef for plain `int' without `signed' can be
9580 controlled just like plain `int', but a typedef for
9581 `signed int' cannot be so controlled. */
9583 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
9584 && (TREE_CODE (type
) == INTEGER_TYPE
9585 || TREE_CODE (type
) == CHAR_TYPE
)
9586 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
9589 type
= long_long_unsigned_type_node
;
9590 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9591 type
= long_unsigned_type_node
;
9592 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9593 type
= short_unsigned_type_node
;
9594 else if (type
== char_type_node
)
9595 type
= unsigned_char_type_node
;
9596 else if (typedef_decl
)
9597 type
= unsigned_type (type
);
9599 type
= unsigned_type_node
;
9601 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9602 && type
== char_type_node
)
9603 type
= signed_char_type_node
;
9605 type
= long_long_integer_type_node
;
9606 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9607 type
= long_integer_type_node
;
9608 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9609 type
= short_integer_type_node
;
9611 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
9613 /* If we just have "complex", it is equivalent to
9614 "complex double", but if any modifiers at all are specified it is
9615 the complex form of TYPE. E.g, "complex short" is
9616 "complex short int". */
9618 if (defaulted_int
&& ! longlong
9619 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
9620 || RIDBIT_SETP (RID_SHORT
, specbits
)
9621 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9622 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
9623 type
= complex_double_type_node
;
9624 else if (type
== integer_type_node
)
9625 type
= complex_integer_type_node
;
9626 else if (type
== float_type_node
)
9627 type
= complex_float_type_node
;
9628 else if (type
== double_type_node
)
9629 type
= complex_double_type_node
;
9630 else if (type
== long_double_type_node
)
9631 type
= complex_long_double_type_node
;
9633 type
= build_complex_type (type
);
9636 if (return_type
== return_conversion
9637 && (RIDBIT_SETP (RID_CONST
, specbits
)
9638 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
9639 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
9640 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
9643 /* Set CONSTP if this declaration is `const', whether by
9644 explicit specification or via a typedef.
9645 Likewise for VOLATILEP. */
9647 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
9649 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
9651 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
9652 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
9653 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
9654 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
9655 type
= cp_build_qualified_type (type
, type_quals
);
9657 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
9658 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
9659 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
9660 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
9661 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
9663 if (RIDBIT_SETP (RID_STATIC
, specbits
))
9664 staticp
= 1 + (decl_context
== FIELD
);
9666 if (virtualp
&& staticp
== 2)
9668 cp_error ("member `%D' cannot be declared both virtual and static",
9672 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
9673 RIDBIT_RESET (RID_FRIEND
, specbits
);
9675 /* $7.1.2, Function specifiers */
9676 if (friendp
&& explicitp
)
9677 error ("only declarations of constructors can be `explicit'");
9679 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
9681 if (decl_context
== PARM
)
9683 error ("non-member `%s' cannot be declared `mutable'", name
);
9684 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9686 else if (friendp
|| decl_context
== TYPENAME
)
9688 error ("non-object member `%s' cannot be declared `mutable'", name
);
9689 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9693 /* Warn if two storage classes are given. Default to `auto'. */
9695 if (RIDBIT_ANY_SET (specbits
))
9697 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
9698 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
9699 if (decl_context
== PARM
&& nclasses
> 0)
9700 error ("storage class specifiers invalid in parameter declarations");
9701 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9703 if (decl_context
== PARM
)
9704 error ("typedef declaration invalid in parameter declaration");
9707 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
9708 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
9711 /* Give error if `virtual' is used outside of class declaration. */
9713 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
9715 error ("virtual outside class declaration");
9718 if (current_class_name
== NULL_TREE
&& RIDBIT_SETP (RID_MUTABLE
, specbits
))
9720 error ("only members can be declared mutable");
9721 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9724 /* Static anonymous unions are dealt with here. */
9725 if (staticp
&& decl_context
== TYPENAME
9726 && TREE_CODE (declspecs
) == TREE_LIST
9727 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
9728 decl_context
= FIELD
;
9730 /* Warn about storage classes that are invalid for certain
9731 kinds of declarations (parameters, typenames, etc.). */
9734 error ("multiple storage classes in declaration of `%s'", name
);
9735 else if (decl_context
!= NORMAL
&& nclasses
> 0)
9737 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9738 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
9739 || RIDBIT_SETP (RID_AUTO
, specbits
)))
9741 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9743 else if (decl_context
== FIELD
9744 /* C++ allows static class elements */
9745 && RIDBIT_SETP (RID_STATIC
, specbits
))
9746 /* C++ also allows inlines and signed and unsigned elements,
9747 but in those cases we don't come in here. */
9751 if (decl_context
== FIELD
)
9753 tree tmp
= NULL_TREE
;
9754 register int op
= 0;
9758 /* Avoid trying to get an operand off an identifier node. */
9759 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
9762 tmp
= TREE_OPERAND (declarator
, 0);
9763 op
= IDENTIFIER_OPNAME_P (tmp
);
9765 error ("storage class specified for %s `%s'",
9766 op
? "member operator" : "field",
9767 op
? operator_name_string (tmp
) : name
);
9770 error (((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9771 ? "storage class specified for parameter `%s'"
9772 : "storage class specified for typename"), name
);
9773 RIDBIT_RESET (RID_REGISTER
, specbits
);
9774 RIDBIT_RESET (RID_AUTO
, specbits
);
9775 RIDBIT_RESET (RID_EXTERN
, specbits
);
9778 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
9780 if (toplevel_bindings_p ())
9782 /* It's common practice (and completely valid) to have a const
9783 be initialized and declared extern. */
9784 if (!(type_quals
& TYPE_QUAL_CONST
))
9785 warning ("`%s' initialized and declared `extern'", name
);
9788 error ("`%s' has both `extern' and initializer", name
);
9790 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
9791 && ! toplevel_bindings_p ())
9792 error ("nested function `%s' declared `extern'", name
);
9793 else if (toplevel_bindings_p ())
9795 if (RIDBIT_SETP (RID_AUTO
, specbits
))
9796 error ("top-level declaration of `%s' specifies `auto'", name
);
9799 if (nclasses
> 0 && friendp
)
9800 error ("storage class specifiers invalid in friend function declarations");
9802 /* Now figure out the structure of the declarator proper.
9803 Descend through it, creating more complex types, until we reach
9804 the declared identifier (or NULL_TREE, in an absolute declarator). */
9806 inner_attrs
= NULL_TREE
;
9809 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
9810 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
9812 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
9813 an INDIRECT_REF (for *...),
9814 a CALL_EXPR (for ...(...)),
9815 an identifier (for the name being declared)
9816 or a null pointer (for the place in an absolute declarator
9817 where the name was omitted).
9818 For the last two cases, we have just exited the loop.
9820 For C++ it could also be
9821 a SCOPE_REF (for class :: ...). In this case, we have converted
9822 sensible names to types, and those are the values we use to
9823 qualify the member name.
9824 an ADDR_EXPR (for &...),
9825 a BIT_NOT_EXPR (for destructors)
9827 At this point, TYPE is the type of elements of an array,
9828 or for a function to return, or for a pointer to point to.
9829 After this sequence of ifs, TYPE is the type of the
9830 array or function or pointer, and DECLARATOR has had its
9831 outermost layer removed. */
9833 if (type
== error_mark_node
)
9835 if (TREE_CODE (declarator
) == SCOPE_REF
)
9836 declarator
= TREE_OPERAND (declarator
, 1);
9838 declarator
= TREE_OPERAND (declarator
, 0);
9841 if (quals
!= NULL_TREE
9842 && (declarator
== NULL_TREE
9843 || TREE_CODE (declarator
) != SCOPE_REF
))
9845 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
9846 ctype
= TYPE_METHOD_BASETYPE (type
);
9847 if (ctype
!= NULL_TREE
)
9849 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
9850 ctype
= grok_method_quals (ctype
, dummy
, quals
);
9851 type
= TREE_TYPE (dummy
);
9856 /* See the comment for the TREE_LIST case, below. */
9859 else if (inner_attrs
)
9861 decl_attributes (type
, inner_attrs
, NULL_TREE
);
9862 inner_attrs
= NULL_TREE
;
9865 switch (TREE_CODE (declarator
))
9869 /* We encode a declarator with embedded attributes using
9870 a TREE_LIST. The attributes apply to the declarator
9871 directly inside them, so we have to skip an iteration
9872 before applying them to the type. If the declarator just
9873 inside is the declarator-id, we apply the attrs to the
9875 inner_attrs
= TREE_PURPOSE (declarator
);
9877 declarator
= TREE_VALUE (declarator
);
9883 register tree itype
= NULL_TREE
;
9884 register tree size
= TREE_OPERAND (declarator
, 1);
9885 /* The index is a signed object `sizetype' bits wide. */
9886 tree index_type
= signed_type (sizetype
);
9888 declarator
= TREE_OPERAND (declarator
, 0);
9890 /* Check for some types that there cannot be arrays of. */
9892 if (TREE_CODE (type
) == VOID_TYPE
)
9894 cp_error ("declaration of `%D' as array of voids", dname
);
9895 type
= error_mark_node
;
9898 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9900 cp_error ("declaration of `%D' as array of functions", dname
);
9901 type
= error_mark_node
;
9904 /* ARM $8.4.3: Since you can't have a pointer to a reference,
9905 you can't have arrays of references. If we allowed them,
9906 then we'd be saying x[i] is valid for an array x, but
9907 then you'd have to ask: what does `*(x + i)' mean? */
9908 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9910 if (decl_context
== TYPENAME
)
9911 cp_error ("cannot make arrays of references");
9913 cp_error ("declaration of `%D' as array of references",
9915 type
= error_mark_node
;
9918 if (TREE_CODE (type
) == OFFSET_TYPE
)
9920 cp_error ("declaration of `%D' as array of data members",
9922 type
= error_mark_node
;
9925 if (TREE_CODE (type
) == METHOD_TYPE
)
9927 cp_error ("declaration of `%D' as array of function members",
9929 type
= error_mark_node
;
9932 if (size
== error_mark_node
)
9933 type
= error_mark_node
;
9934 else if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9938 the constant expressions that specify the bounds of
9939 the arrays can be omitted only for the first member
9941 cp_error ("declaration of `%D' as multidimensional array",
9943 cp_error ("must have bounds for all dimensions except the first");
9944 type
= error_mark_node
;
9947 if (type
== error_mark_node
)
9950 /* VC++ spells a zero-sized array with []. */
9951 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
9952 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9953 size
= integer_zero_node
;
9957 /* Must suspend_momentary here because the index
9958 type may need to live until the end of the function.
9959 For example, it is used in the declaration of a
9960 variable which requires destructing at the end of
9961 the function; then build_vec_delete will need this
9963 int yes
= suspend_momentary ();
9964 /* Might be a cast. */
9965 if (TREE_CODE (size
) == NOP_EXPR
9966 && TREE_TYPE (size
) == TREE_TYPE (TREE_OPERAND (size
, 0)))
9967 size
= TREE_OPERAND (size
, 0);
9968 if (TREE_READONLY_DECL_P (size
))
9969 size
= decl_constant_value (size
);
9971 /* If this involves a template parameter, it will be a
9972 constant at instantiation time, but we don't know
9973 what the value is yet. Even if no template
9974 parameters are involved, we may an expression that
9975 is not a constant; we don't even simplify `1 + 2'
9976 when processing a template. */
9977 if (processing_template_decl
)
9979 /* Resolve a qualified reference to an enumerator or
9980 static const data member of ours. */
9981 if (TREE_CODE (size
) == SCOPE_REF
9982 && TREE_OPERAND (size
, 0) == current_class_type
)
9984 tree t
= lookup_field (current_class_type
,
9985 TREE_OPERAND (size
, 1), 0, 0);
9990 itype
= build_index_type (build_min
9991 (MINUS_EXPR
, sizetype
, size
, integer_one_node
));
9992 goto dont_grok_size
;
9995 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9996 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
9997 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
9999 cp_error ("size of array `%D' has non-integer type",
10001 size
= integer_one_node
;
10003 if (pedantic
&& integer_zerop (size
))
10004 cp_pedwarn ("ANSI C++ forbids zero-size array `%D'", dname
);
10005 if (TREE_CONSTANT (size
))
10007 int old_flag_pedantic_errors
= flag_pedantic_errors
;
10008 int old_pedantic
= pedantic
;
10009 pedantic
= flag_pedantic_errors
= 1;
10010 /* Always give overflow errors on array subscripts. */
10011 constant_expression_warning (size
);
10012 pedantic
= old_pedantic
;
10013 flag_pedantic_errors
= old_flag_pedantic_errors
;
10014 if (INT_CST_LT (size
, integer_zero_node
))
10016 cp_error ("size of array `%D' is negative", dname
);
10017 size
= integer_one_node
;
10025 cp_pedwarn ("ANSI C++ forbids variable-size array `%D'",
10028 cp_pedwarn ("ANSI C++ forbids variable-size array");
10033 = fold (build_binary_op (MINUS_EXPR
,
10034 cp_convert (index_type
, size
),
10035 cp_convert (index_type
,
10036 integer_one_node
)));
10037 if (! TREE_CONSTANT (itype
))
10038 itype
= variable_size (itype
);
10039 else if (TREE_OVERFLOW (itype
))
10041 error ("overflow in array dimension");
10042 TREE_OVERFLOW (itype
) = 0;
10045 /* If we're a parm, we need to have a permanent type so
10046 mangling checks for re-use will work right. If both the
10047 element and index types are permanent, the array type
10049 if (decl_context
== PARM
10050 && allocation_temporary_p () && TREE_PERMANENT (type
))
10052 push_obstacks (&permanent_obstack
, &permanent_obstack
);
10053 itype
= build_index_type (itype
);
10057 itype
= build_index_type (itype
);
10060 resume_momentary (yes
);
10063 type
= build_cplus_array_type (type
, itype
);
10072 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
10073 tree inner_decl
= TREE_OPERAND (declarator
, 0);
10075 /* Declaring a function type.
10076 Make sure we have a valid type for the function to return. */
10078 /* We now know that the TYPE_QUALS don't apply to the
10079 decl, but to its return type. */
10080 type_quals
= TYPE_UNQUALIFIED
;
10082 /* Warn about some types functions can't return. */
10084 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10086 error ("`%s' declared as function returning a function", name
);
10087 type
= integer_type_node
;
10089 if (TREE_CODE (type
) == ARRAY_TYPE
)
10091 error ("`%s' declared as function returning an array", name
);
10092 type
= integer_type_node
;
10095 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
10096 inner_decl
= TREE_OPERAND (inner_decl
, 1);
10098 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
10099 inner_decl
= dname
;
10101 /* Pick up type qualifiers which should be applied to `this'. */
10102 quals
= CALL_DECLARATOR_QUALS (declarator
);
10104 /* Pick up the exception specifications. */
10105 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
10107 /* Say it's a definition only for the CALL_EXPR
10108 closest to the identifier. */
10111 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
10112 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
10113 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
10115 if (ctype
== NULL_TREE
10116 && decl_context
== FIELD
10118 && (friendp
== 0 || dname
== current_class_name
))
10119 ctype
= current_class_type
;
10121 if (ctype
&& return_type
== return_conversion
)
10122 TYPE_HAS_CONVERSION (ctype
) = 1;
10123 if (ctype
&& constructor_name (ctype
) == dname
)
10125 /* We are within a class's scope. If our declarator name
10126 is the same as the class name, and we are defining
10127 a function, then it is a constructor/destructor, and
10128 therefore returns a void type. */
10130 if (flags
== DTOR_FLAG
)
10132 /* ANSI C++ June 5 1992 WP 12.4.1. A destructor may
10133 not be declared const or volatile. A destructor
10134 may not be static. */
10136 error ("destructor cannot be static member function");
10139 cp_error ("destructors may not be `%s'",
10140 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10143 if (decl_context
== FIELD
)
10145 if (! member_function_or_else (ctype
, current_class_type
,
10146 "destructor for alien class `%s' cannot be a member"))
10147 return void_type_node
;
10150 else /* It's a constructor. */
10152 if (explicitp
== 1)
10154 /* ANSI C++ June 5 1992 WP 12.1.2. A constructor may
10155 not be declared const or volatile. A constructor may
10156 not be virtual. A constructor may not be static. */
10158 error ("constructor cannot be static member function");
10161 pedwarn ("constructors cannot be declared virtual");
10166 cp_error ("constructors may not be `%s'",
10167 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10171 RID_BIT_TYPE tmp_bits
;
10172 bcopy ((void*)&specbits
, (void*)&tmp_bits
, sizeof (RID_BIT_TYPE
));
10173 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10174 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10175 if (RIDBIT_ANY_SET (tmp_bits
))
10176 error ("return value type specifier for constructor ignored");
10178 type
= build_pointer_type (ctype
);
10179 if (decl_context
== FIELD
)
10181 if (! member_function_or_else (ctype
, current_class_type
,
10182 "constructor for alien class `%s' cannot be member"))
10183 return void_type_node
;
10184 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10185 if (return_type
!= return_ctor
)
10189 if (decl_context
== FIELD
)
10195 error ("can't initialize friend function `%s'", name
);
10198 /* Cannot be both friend and virtual. */
10199 error ("virtual functions cannot be friends");
10200 RIDBIT_RESET (RID_FRIEND
, specbits
);
10203 if (decl_context
== NORMAL
)
10204 error ("friend declaration not in class definition");
10205 if (current_function_decl
&& funcdef_flag
)
10206 cp_error ("can't define friend function `%s' in a local class definition",
10210 /* Construct the function type and go to the next
10211 inner layer of declarator. */
10213 declarator
= TREE_OPERAND (declarator
, 0);
10215 /* FIXME: This is where default args should be fully
10218 arg_types
= grokparms (inner_parms
, funcdecl_p
? funcdef_flag
: 0);
10220 if (declarator
&& flags
== DTOR_FLAG
)
10222 /* A destructor declared in the body of a class will
10223 be represented as a BIT_NOT_EXPR. But, we just
10224 want the underlying IDENTIFIER. */
10225 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10226 declarator
= TREE_OPERAND (declarator
, 0);
10228 if (strict_prototype
== 0 && arg_types
== NULL_TREE
)
10229 arg_types
= void_list_node
;
10230 else if (arg_types
== NULL_TREE
10231 || arg_types
!= void_list_node
)
10233 cp_error ("destructors may not have parameters");
10234 arg_types
= void_list_node
;
10235 last_function_parms
= NULL_TREE
;
10239 /* ANSI says that `const int foo ();'
10240 does not make the function foo const. */
10241 type
= build_function_type (type
, arg_types
);
10245 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10246 if (TREE_PURPOSE (t
)
10247 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10249 add_defarg_fn (type
);
10258 /* Filter out pointers-to-references and references-to-references.
10259 We can get these if a TYPE_DECL is used. */
10261 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10263 error ("cannot declare %s to references",
10264 TREE_CODE (declarator
) == ADDR_EXPR
10265 ? "references" : "pointers");
10266 declarator
= TREE_OPERAND (declarator
, 0);
10270 if (TREE_CODE (type
) == OFFSET_TYPE
10271 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10272 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10274 cp_error ("cannot declare pointer to `%#T' member",
10276 type
= TREE_TYPE (type
);
10279 /* Merge any constancy or volatility into the target type
10280 for the pointer. */
10282 /* We now know that the TYPE_QUALS don't apply to the decl,
10283 but to the target of the pointer. */
10284 type_quals
= TYPE_UNQUALIFIED
;
10286 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10288 if (TREE_CODE (type
) == VOID_TYPE
)
10289 error ("invalid type: `void &'");
10291 type
= build_reference_type (type
);
10293 else if (TREE_CODE (type
) == METHOD_TYPE
)
10294 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10296 type
= build_pointer_type (type
);
10298 /* Process a list of type modifier keywords (such as
10299 const or volatile) that were given inside the `*' or `&'. */
10301 if (TREE_TYPE (declarator
))
10303 register tree typemodlist
;
10309 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10310 typemodlist
= TREE_CHAIN (typemodlist
))
10312 tree qualifier
= TREE_VALUE (typemodlist
);
10314 if (qualifier
== ridpointers
[(int) RID_CONST
])
10316 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10318 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10323 error ("invalid type modifier within pointer declarator");
10327 pedwarn ("duplicate `const'");
10329 pedwarn ("duplicate `volatile'");
10331 pedwarn ("duplicate `restrict'");
10333 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10334 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10335 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10336 if (TREE_CODE (declarator
) == ADDR_EXPR
10337 && (constp
|| volatilep
))
10340 pedwarn ("discarding `const' applied to a reference");
10342 pedwarn ("discarding `volatile' applied to a reference");
10343 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10345 type
= cp_build_qualified_type (type
, type_quals
);
10347 declarator
= TREE_OPERAND (declarator
, 0);
10353 /* We have converted type names to NULL_TREE if the
10354 name was bogus, or to a _TYPE node, if not.
10356 The variable CTYPE holds the type we will ultimately
10357 resolve to. The code here just needs to build
10358 up appropriate member types. */
10359 tree sname
= TREE_OPERAND (declarator
, 1);
10362 /* Destructors can have their visibilities changed as well. */
10363 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10364 sname
= TREE_OPERAND (sname
, 0);
10366 if (TREE_COMPLEXITY (declarator
) == 0)
10367 /* This needs to be here, in case we are called
10368 multiple times. */ ;
10369 else if (TREE_COMPLEXITY (declarator
) == -1)
10370 /* Namespace member. */
10371 pop_decl_namespace ();
10372 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10373 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10374 else if (! IS_AGGR_TYPE_CODE
10375 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10377 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10379 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10380 that refer to ctype. They couldn't be resolved earlier
10381 because we hadn't pushed into the class yet.
10382 Example: resolve 'B<T>::type' in
10383 'B<typename B<T>::type> B<T>::f () { }'. */
10384 if (current_template_parms
10385 && uses_template_parms (type
)
10386 && uses_template_parms (current_class_type
))
10388 tree args
= current_template_args ();
10389 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10392 /* This pop_nested_class corresponds to the
10393 push_nested_class used to push into class scope for
10394 parsing the argument list of a function decl, in
10396 pop_nested_class ();
10397 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10400 my_friendly_abort (16);
10402 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10404 /* We had a reference to a global decl, or
10405 perhaps we were given a non-aggregate typedef,
10406 in which case we cleared this out, and should just
10407 keep going as though it wasn't there. */
10408 declarator
= sname
;
10411 ctype
= TREE_OPERAND (declarator
, 0);
10414 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10416 if (CLASSTYPE_TEMPLATE_INFO (t
) &&
10417 !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
10418 template_count
+= 1;
10419 t
= TYPE_MAIN_DECL (t
);
10420 if (DECL_LANG_SPECIFIC (t
))
10421 t
= DECL_CLASS_CONTEXT (t
);
10426 if (sname
== NULL_TREE
)
10429 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10431 /* This is the `standard' use of the scoping operator:
10432 basetype :: member . */
10434 if (ctype
== current_class_type
)
10440 Is this ill-formed? */
10443 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10446 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10448 if (current_class_type
== NULL_TREE
10450 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10451 TYPE_ARG_TYPES (type
));
10454 cp_error ("cannot declare member function `%T::%s' within `%T'",
10455 ctype
, name
, current_class_type
);
10456 return void_type_node
;
10459 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10460 || TYPE_SIZE (complete_type (ctype
)) != NULL_TREE
)
10462 /* Have to move this code elsewhere in this function.
10463 this code is used for i.e., typedef int A::M; M *pm;
10465 It is? How? jason 10/2/94 */
10467 if (current_class_type
)
10469 cp_error ("cannot declare member `%T::%s' within `%T'",
10470 ctype
, name
, current_class_type
);
10471 return void_type_node
;
10473 type
= build_offset_type (ctype
, type
);
10475 else if (uses_template_parms (ctype
))
10477 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10479 = build_cplus_method_type (ctype
, TREE_TYPE (type
),
10480 TYPE_ARG_TYPES (type
));
10484 cp_error ("structure `%T' not yet defined", ctype
);
10485 return error_mark_node
;
10488 declarator
= sname
;
10490 else if (TREE_CODE (sname
) == SCOPE_REF
)
10491 my_friendly_abort (17);
10495 declarator
= TREE_OPERAND (declarator
, 1);
10496 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10497 /* In this case, we will deal with it later. */
10501 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10502 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10503 TYPE_ARG_TYPES (type
));
10505 type
= build_offset_type (ctype
, type
);
10512 declarator
= TREE_OPERAND (declarator
, 0);
10517 case ENUMERAL_TYPE
:
10518 declarator
= NULL_TREE
;
10522 declarator
= NULL_TREE
;
10526 my_friendly_abort (158);
10530 /* See the comment for the TREE_LIST case, above. */
10533 if (! ignore_attrs
)
10534 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10536 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
10538 attrlist
= build_decl_list (NULL_TREE
, inner_attrs
);
10541 /* Now TYPE has the actual type. */
10543 if (explicitp
== 1)
10545 error ("only constructors can be declared `explicit'");
10549 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10551 if (type_quals
& TYPE_QUAL_CONST
)
10553 error ("const `%s' cannot be declared `mutable'", name
);
10554 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10558 error ("static `%s' cannot be declared `mutable'", name
);
10559 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10563 if (declarator
== NULL_TREE
10564 || TREE_CODE (declarator
) == IDENTIFIER_NODE
10565 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
10566 && (TREE_CODE (type
) == FUNCTION_TYPE
10567 || TREE_CODE (type
) == METHOD_TYPE
)))
10569 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10571 cp_error ("template-id `%D' used as a declarator", declarator
);
10572 declarator
= dname
;
10575 /* Unexpected declarator format. */
10576 my_friendly_abort (990210);
10578 /* If this is declaring a typedef name, return a TYPE_DECL. */
10580 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
10584 /* Note that the grammar rejects storage classes
10585 in typenames, fields or parameters. */
10586 if (current_lang_name
== lang_name_java
)
10587 TYPE_FOR_JAVA (type
) = 1;
10589 if (decl_context
== FIELD
)
10591 if (declarator
== constructor_name (current_class_type
))
10592 cp_pedwarn ("ANSI C++ forbids nested type `%D' with same name as enclosing class",
10594 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10598 /* Make sure this typedef lives as long as its type,
10599 since it might be used as a template parameter. */
10600 if (type
!= error_mark_node
)
10601 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
10602 if (processing_template_decl
)
10603 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10605 decl
= build_decl (TYPE_DECL
, declarator
, type
);
10606 if (type
!= error_mark_node
)
10610 /* If the user declares "typedef struct {...} foo" then the
10611 struct will have an anonymous name. Fill that name in now.
10612 Nothing can refer to it, so nothing needs know about the name
10614 if (type
!= error_mark_node
10615 && TYPE_NAME (type
)
10616 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
10617 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
10618 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
10620 tree oldname
= TYPE_NAME (type
);
10623 /* Replace the anonymous name with the real name everywhere. */
10624 lookup_tag_reverse (type
, declarator
);
10625 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
10626 if (TYPE_NAME (t
) == oldname
)
10627 TYPE_NAME (t
) = decl
;
10629 if (TYPE_LANG_SPECIFIC (type
))
10630 TYPE_WAS_ANONYMOUS (type
) = 1;
10632 /* If this is a typedef within a template class, the nested
10633 type is a (non-primary) template. The name for the
10634 template needs updating as well. */
10635 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
10636 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
10637 = TYPE_IDENTIFIER (type
);
10639 /* XXX Temporarily set the scope.
10640 When returning, start_decl expects it as NULL_TREE,
10641 and will then then set it using pushdecl. */
10642 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
10643 if (current_class_type
)
10644 DECL_CONTEXT (decl
) = current_class_type
;
10646 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
10648 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
10649 DECL_ASSEMBLER_NAME (decl
)
10650 = get_identifier (build_overload_name (type
, 1, 1));
10651 DECL_CONTEXT (decl
) = NULL_TREE
;
10653 /* FIXME remangle member functions; member functions of a
10654 type with external linkage have external linkage. */
10657 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10659 cp_error_at ("typedef name may not be class-qualified", decl
);
10664 if (ctype
== NULL_TREE
)
10666 if (TREE_CODE (type
) != METHOD_TYPE
)
10667 cp_error_at ("invalid type qualifier for non-method type", decl
);
10669 ctype
= TYPE_METHOD_BASETYPE (type
);
10671 if (ctype
!= NULL_TREE
)
10672 grok_method_quals (ctype
, decl
, quals
);
10675 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10676 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
10677 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
10679 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10680 error ("non-object member `%s' cannot be declared mutable", name
);
10682 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
10683 inlinep
, friendp
, raises
!= NULL_TREE
);
10686 error ("typedef declaration includes an initializer");
10691 /* Detect the case of an array type of unspecified size
10692 which came, as such, direct from a typedef name.
10693 We must copy the type, so that each identifier gets
10694 a distinct type, so that each identifier's size can be
10695 controlled separately by its own initializer. */
10697 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
10698 && TYPE_DOMAIN (type
) == NULL_TREE
)
10700 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
10703 /* If this is a type name (such as, in a cast or sizeof),
10704 compute the type and return it now. */
10706 if (decl_context
== TYPENAME
)
10708 /* Note that the grammar rejects storage classes
10709 in typenames, fields or parameters. */
10710 if (type_quals
!= TYPE_UNQUALIFIED
)
10711 type_quals
= TYPE_UNQUALIFIED
;
10713 /* Special case: "friend class foo" looks like a TYPENAME context. */
10716 if (type_quals
!= TYPE_UNQUALIFIED
)
10718 cp_error ("type qualifiers specified for friend class declaration");
10719 type_quals
= TYPE_UNQUALIFIED
;
10723 cp_error ("`inline' specified for friend class declaration");
10727 /* Only try to do this stuff if we didn't already give up. */
10728 if (type
!= integer_type_node
)
10730 /* A friendly class? */
10731 if (current_class_type
)
10732 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
10734 error ("trying to make class `%s' a friend of global scope",
10735 TYPE_NAME_STRING (type
));
10736 type
= void_type_node
;
10741 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
10742 if (ctype
== NULL_TREE
)
10744 my_friendly_assert (TREE_CODE (type
) == METHOD_TYPE
, 159);
10745 ctype
= TYPE_METHOD_BASETYPE (type
);
10747 grok_method_quals (ctype
, dummy
, quals
);
10748 type
= TREE_TYPE (dummy
);
10753 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
10754 && decl_context
!= CATCHPARM
10755 && TREE_CODE (type
) != UNION_TYPE
10758 cp_error ("abstract declarator `%T' used as declaration", type
);
10759 declarator
= make_anon_name ();
10762 /* `void' at top level (not within pointer)
10763 is allowed only in typedefs or type names.
10764 We don't complain about parms either, but that is because
10765 a better error message can be made later. */
10767 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
10770 error ("unnamed variable or field declared void");
10771 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10773 if (IDENTIFIER_OPNAME_P (declarator
))
10774 my_friendly_abort (356);
10776 error ("variable or field `%s' declared void", name
);
10779 error ("variable or field declared void");
10780 type
= integer_type_node
;
10783 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
10784 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
10786 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10788 if (ctype
|| in_namespace
)
10789 error ("cannot use `::' in parameter declaration");
10791 /* A parameter declared as an array of T is really a pointer to T.
10792 One declared as a function is really a pointer to a function.
10793 One declared as a member is really a pointer to member. */
10795 if (TREE_CODE (type
) == ARRAY_TYPE
)
10797 /* Transfer const-ness of array into that of type pointed to. */
10798 type
= build_pointer_type (TREE_TYPE (type
));
10799 type_quals
= TYPE_UNQUALIFIED
;
10801 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10802 type
= build_pointer_type (type
);
10803 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10804 type
= build_pointer_type (type
);
10805 else if (TREE_CODE (type
) == VOID_TYPE
&& declarator
)
10807 error ("declaration of `%s' as void", name
);
10813 register tree decl
;
10815 if (decl_context
== PARM
)
10817 decl
= build_decl (PARM_DECL
, declarator
, type
);
10819 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
10820 inlinep
, friendp
, raises
!= NULL_TREE
);
10822 /* Compute the type actually passed in the parmlist,
10823 for the case where there is no prototype.
10824 (For example, shorts and chars are passed as ints.)
10825 When there is a prototype, this is overridden later. */
10827 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
10829 else if (decl_context
== FIELD
)
10831 if (type
== error_mark_node
)
10833 /* Happens when declaring arrays of sizes which
10834 are error_mark_node, for example. */
10837 else if (in_namespace
&& !friendp
)
10839 /* Something like struct S { int N::j; }; */
10840 cp_error ("invalid use of `::'");
10843 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10846 tree function_context
;
10848 /* We catch the others as conflicts with the builtin
10850 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
10852 cp_error ("function `%D' cannot be declared friend",
10859 if (ctype
== NULL_TREE
)
10860 ctype
= current_class_type
;
10862 if (ctype
== NULL_TREE
)
10864 cp_error ("can't make `%D' into a method -- not in a class",
10866 return void_type_node
;
10869 /* ``A union may [ ... ] not [ have ] virtual functions.''
10871 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
10873 cp_error ("function `%D' declared virtual inside a union",
10875 return void_type_node
;
10878 if (declarator
== ansi_opname
[(int) NEW_EXPR
]
10879 || declarator
== ansi_opname
[(int) VEC_NEW_EXPR
]
10880 || declarator
== ansi_opname
[(int) DELETE_EXPR
]
10881 || declarator
== ansi_opname
[(int) VEC_DELETE_EXPR
])
10885 cp_error ("`%D' cannot be declared virtual, since it is always static",
10890 else if (staticp
< 2)
10891 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10892 TYPE_ARG_TYPES (type
));
10895 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
10896 function_context
= (ctype
!= NULL_TREE
) ?
10897 hack_decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
10898 publicp
= (! friendp
|| ! staticp
)
10899 && function_context
== NULL_TREE
;
10900 decl
= grokfndecl (ctype
, type
,
10901 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
10902 ? declarator
: dname
,
10904 virtualp
, flags
, quals
, raises
,
10905 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
10906 funcdef_flag
, template_count
, in_namespace
);
10907 if (decl
== NULL_TREE
)
10910 /* This clobbers the attrs stored in `decl' from `attrlist'. */
10911 /* The decl and setting of decl_machine_attr is also turned off. */
10912 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
10915 /* [class.conv.ctor]
10917 A constructor declared without the function-specifier
10918 explicit that can be called with a single parameter
10919 specifies a conversion from the type of its first
10920 parameter to the type of its class. Such a constructor
10921 is called a converting constructor. */
10922 if (explicitp
== 2)
10923 DECL_NONCONVERTING_P (decl
) = 1;
10924 else if (DECL_CONSTRUCTOR_P (decl
))
10926 /* The constructor can be called with exactly one
10927 parameter if there is at least one parameter, and
10928 any subsequent parameters have default arguments.
10929 We don't look at the first parameter, which is
10930 really just the `this' parameter for the new
10933 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
10935 /* Skip the `in_chrg' argument too, if present. */
10936 if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (decl
)))
10937 arg_types
= TREE_CHAIN (arg_types
);
10939 if (arg_types
== void_list_node
10941 && TREE_CHAIN (arg_types
)
10942 && TREE_CHAIN (arg_types
) != void_list_node
10943 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
10944 DECL_NONCONVERTING_P (decl
) = 1;
10947 else if (TREE_CODE (type
) == METHOD_TYPE
)
10949 /* We only get here for friend declarations of
10950 members of other classes. */
10951 /* All method decls are public, so tell grokfndecl to set
10952 TREE_PUBLIC, also. */
10953 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
10954 virtualp
, flags
, quals
, raises
,
10955 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
10956 template_count
, in_namespace
);
10957 if (decl
== NULL_TREE
)
10960 else if (!staticp
&& ! processing_template_decl
10961 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
10962 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
10965 cp_error ("field `%D' has incomplete type", declarator
);
10967 cp_error ("name `%T' has incomplete type", type
);
10969 /* If we're instantiating a template, tell them which
10970 instantiation made the field's type be incomplete. */
10971 if (current_class_type
10972 && TYPE_NAME (current_class_type
)
10973 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
10974 && declspecs
&& TREE_VALUE (declspecs
)
10975 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
10976 cp_error (" in instantiation of template `%T'",
10977 current_class_type
);
10979 type
= error_mark_node
;
10986 error ("`%s' is neither function nor method; cannot be declared friend",
10987 IDENTIFIER_POINTER (declarator
));
10995 /* Friends are treated specially. */
10996 if (ctype
== current_class_type
)
10997 warning ("member functions are implicitly friends of their class");
11000 tree t
= NULL_TREE
;
11001 if (decl
&& DECL_NAME (decl
))
11003 if (template_class_depth (current_class_type
) == 0)
11006 = check_explicit_specialization
11008 template_count
, 2 * (funcdef_flag
!= 0) + 4);
11009 if (decl
== error_mark_node
)
11010 return error_mark_node
;
11013 t
= do_friend (ctype
, declarator
, decl
,
11014 last_function_parms
, attrlist
, flags
, quals
,
11017 if (t
&& funcdef_flag
)
11020 return void_type_node
;
11024 /* Structure field. It may not be a function, except for C++ */
11026 if (decl
== NULL_TREE
)
11032 /* An attempt is being made to initialize a non-static
11033 member. But, from [class.mem]:
11035 4 A member-declarator can contain a
11036 constant-initializer only if it declares a static
11037 member (_class.static_) of integral or enumeration
11038 type, see _class.static.data_.
11040 This used to be relatively common practice, but
11041 the rest of the compiler does not correctly
11042 handle the initialization unless the member is
11043 static so we make it static below. */
11044 cp_pedwarn ("ANSI C++ forbids initialization of member `%D'",
11046 cp_pedwarn ("making `%D' static", declarator
);
11050 if (uses_template_parms (type
))
11051 /* We'll check at instantiation time. */
11053 else if (check_static_variable_definition (declarator
,
11055 /* If we just return the declaration, crashes
11056 will sometimes occur. We therefore return
11057 void_type_node, as if this was a friend
11058 declaration, to cause callers to completely
11059 ignore this declaration. */
11060 return void_type_node
;
11063 /* 9.2p13 [class.mem] */
11064 if (declarator
== constructor_name (current_class_type
)
11065 /* Divergence from the standard: In extern "C", we
11066 allow non-static data members here, because C does
11067 and /usr/include/netinet/in.h uses that. */
11068 && (staticp
|| ! in_system_header
))
11069 cp_pedwarn ("ANSI C++ forbids data member `%D' with same name as enclosing class",
11074 /* C++ allows static class members. All other work
11075 for this is done by grokfield. */
11076 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
11077 TREE_STATIC (decl
) = 1;
11078 /* In class context, 'static' means public access. */
11079 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
11083 decl
= build_lang_decl (FIELD_DECL
, declarator
, type
);
11084 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11086 DECL_MUTABLE_P (decl
) = 1;
11087 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11091 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
11092 inlinep
, friendp
, raises
!= NULL_TREE
);
11095 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11097 tree original_name
;
11103 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11104 original_name
= dname
;
11106 original_name
= declarator
;
11108 if (RIDBIT_SETP (RID_AUTO
, specbits
))
11109 error ("storage class `auto' invalid for function `%s'", name
);
11110 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11111 error ("storage class `register' invalid for function `%s'", name
);
11113 /* Function declaration not at top level.
11114 Storage classes other than `extern' are not allowed
11115 and `extern' makes no difference. */
11116 if (! toplevel_bindings_p ()
11117 && (RIDBIT_SETP (RID_STATIC
, specbits
)
11118 || RIDBIT_SETP (RID_INLINE
, specbits
))
11121 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11122 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
11124 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
11127 if (ctype
== NULL_TREE
)
11131 error ("virtual non-class function `%s'", name
);
11135 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
11136 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11137 TYPE_ARG_TYPES (type
));
11139 /* Record presence of `static'. */
11140 publicp
= (ctype
!= NULL_TREE
11141 || RIDBIT_SETP (RID_EXTERN
, specbits
)
11142 || !RIDBIT_SETP (RID_STATIC
, specbits
));
11144 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
11145 virtualp
, flags
, quals
, raises
,
11147 publicp
, inlinep
, funcdef_flag
,
11148 template_count
, in_namespace
);
11149 if (decl
== NULL_TREE
)
11154 int illegal_static
= 0;
11156 /* Don't allow a static member function in a class, and forbid
11157 declaring main to be static. */
11158 if (TREE_CODE (type
) == METHOD_TYPE
)
11160 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11161 illegal_static
= 1;
11163 else if (current_function_decl
)
11165 /* FIXME need arm citation */
11166 error ("cannot declare static function inside another function");
11167 illegal_static
= 1;
11170 if (illegal_static
)
11173 RIDBIT_RESET (RID_STATIC
, specbits
);
11179 /* It's a variable. */
11181 /* An uninitialized decl with `extern' is a reference. */
11182 decl
= grokvardecl (type
, declarator
, &specbits
,
11184 (type_quals
& TYPE_QUAL_CONST
) != 0,
11186 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11187 inlinep
, friendp
, raises
!= NULL_TREE
);
11191 DECL_CONTEXT (decl
) = ctype
;
11194 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11196 RIDBIT_RESET (RID_STATIC
, specbits
);
11198 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11200 cp_error ("static member `%D' declared `register'", decl
);
11201 RIDBIT_RESET (RID_REGISTER
, specbits
);
11203 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11205 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11207 RIDBIT_RESET (RID_EXTERN
, specbits
);
11212 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11214 error ("`%s' cannot be declared mutable", name
);
11217 /* Record `register' declaration for warnings on &
11218 and in case doing stupid register allocation. */
11220 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11221 DECL_REGISTER (decl
) = 1;
11223 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11224 DECL_THIS_EXTERN (decl
) = 1;
11226 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11227 DECL_THIS_STATIC (decl
) = 1;
11229 /* Record constancy and volatility. There's no need to do this
11230 when processing a template; we'll do this for the instantiated
11231 declaration based on the type of DECL. */
11232 if (!processing_template_decl
)
11233 c_apply_type_quals_to_decl (type_quals
, decl
);
11239 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11240 An empty exprlist is a parmlist. An exprlist which
11241 contains only identifiers at the global level
11242 is a parmlist. Otherwise, it is an exprlist. */
11245 parmlist_is_exprlist (exprs
)
11248 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11251 if (toplevel_bindings_p ())
11253 /* At the global level, if these are all identifiers,
11254 then it is a parmlist. */
11257 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11259 exprs
= TREE_CHAIN (exprs
);
11266 /* Subroutine of start_function. Ensure that each of the parameter
11267 types (as listed in PARMS) is complete, as is required for a
11268 function definition. */
11271 require_complete_types_for_parms (parms
)
11276 tree type
= TREE_TYPE (parms
);
11277 if (TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
11279 if (DECL_NAME (parms
))
11280 error ("parameter `%s' has incomplete type",
11281 IDENTIFIER_POINTER (DECL_NAME (parms
)));
11283 error ("parameter has incomplete type");
11284 TREE_TYPE (parms
) = error_mark_node
;
11287 layout_decl (parms
, 0);
11289 parms
= TREE_CHAIN (parms
);
11293 /* Returns DECL if DECL is a local variable (or parameter). Returns
11294 NULL_TREE otherwise. */
11297 local_variable_p (t
)
11300 if ((TREE_CODE (t
) == VAR_DECL
11301 /* A VAR_DECL with a context that is a _TYPE is a static data
11303 && !TYPE_P (CP_DECL_CONTEXT (t
))
11304 /* Any other non-local variable must be at namespace scope. */
11305 && TREE_CODE (CP_DECL_CONTEXT (t
)) != NAMESPACE_DECL
)
11306 || (TREE_CODE (t
) == PARM_DECL
))
11312 /* Check that ARG, which is a default-argument expression for a
11313 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11314 something goes wrong. DECL may also be a _TYPE node, rather than a
11315 DECL, if there is no DECL available. */
11318 check_default_argument (decl
, arg
)
11325 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11326 /* We get a DEFAULT_ARG when looking at an in-class declaration
11327 with a default argument. Ignore the argument for now; we'll
11328 deal with it after the class is complete. */
11331 if (processing_template_decl
|| uses_template_parms (arg
))
11332 /* We don't do anything checking until instantiation-time. Note
11333 that there may be uninstantiated arguments even for an
11334 instantiated function, since default arguments are not
11335 instantiated until they are needed. */
11344 decl_type
= TREE_TYPE (decl
);
11346 if (arg
== error_mark_node
11347 || decl
== error_mark_node
11348 || TREE_TYPE (arg
) == error_mark_node
11349 || decl_type
== error_mark_node
)
11350 /* Something already went wrong. There's no need to check
11352 return error_mark_node
;
11354 /* [dcl.fct.default]
11356 A default argument expression is implicitly converted to the
11358 if (!TREE_TYPE (arg
)
11359 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11362 cp_error ("default argument for `%#D' has type `%T'",
11363 decl
, TREE_TYPE (arg
));
11365 cp_error ("default argument for parameter of type `%T' has type `%T'",
11366 decl_type
, TREE_TYPE (arg
));
11368 return error_mark_node
;
11371 /* [dcl.fct.default]
11373 Local variables shall not be used in default argument
11376 The keyword `this' shall not be used in a default argument of a
11377 member function. */
11378 var
= search_tree (arg
, local_variable_p
);
11381 cp_error ("default argument `%E' uses local variable `%D'",
11383 return error_mark_node
;
11390 /* Decode the list of parameter types for a function type.
11391 Given the list of things declared inside the parens,
11392 return a list of types.
11394 The list we receive can have three kinds of elements:
11395 an IDENTIFIER_NODE for names given without types,
11396 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11397 or void_type_node, to mark the end of an argument list
11398 when additional arguments are not permitted (... was not used).
11400 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11401 a mere declaration. A nonempty identifier-list gets an error message
11402 when FUNCDEF_FLAG is zero.
11403 If FUNCDEF_FLAG is 1, then parameter types must be complete.
11404 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11406 If all elements of the input list contain types,
11407 we return a list of the types.
11408 If all elements contain no type (except perhaps a void_type_node
11409 at the end), we return a null list.
11410 If some have types and some do not, it is an error, and we
11411 return a null list.
11413 Also set last_function_parms to either
11414 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11415 A list of names is converted to a chain of PARM_DECLs
11416 by store_parm_decls so that ultimately it is always a chain of decls.
11418 Note that in C++, parameters can take default values. These default
11419 values are in the TREE_PURPOSE field of the TREE_LIST. It is
11420 an error to specify default values which are followed by parameters
11421 that have no default values, or an ELLIPSES. For simplicities sake,
11422 only parameters which are specified with their types can take on
11426 grokparms (first_parm
, funcdef_flag
)
11430 tree result
= NULL_TREE
;
11431 tree decls
= NULL_TREE
;
11433 if (first_parm
!= NULL_TREE
11434 && TREE_CODE (TREE_VALUE (first_parm
)) == IDENTIFIER_NODE
)
11436 if (! funcdef_flag
)
11437 pedwarn ("parameter names (without types) in function declaration");
11438 last_function_parms
= first_parm
;
11441 else if (first_parm
!= NULL_TREE
11442 && TREE_CODE (TREE_VALUE (first_parm
)) != TREE_LIST
11443 && TREE_CODE (TREE_VALUE (first_parm
)) != VOID_TYPE
)
11444 my_friendly_abort (145);
11447 /* Types were specified. This is a list of declarators
11448 each represented as a TREE_LIST node. */
11449 register tree parm
, chain
;
11450 int any_init
= 0, any_error
= 0;
11452 if (first_parm
!= NULL_TREE
)
11454 tree last_result
= NULL_TREE
;
11455 tree last_decl
= NULL_TREE
;
11457 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11459 tree type
= NULL_TREE
, list_node
= parm
;
11460 register tree decl
= TREE_VALUE (parm
);
11461 tree init
= TREE_PURPOSE (parm
);
11463 chain
= TREE_CHAIN (parm
);
11464 /* @@ weak defense against parse errors. */
11465 if (TREE_CODE (decl
) != VOID_TYPE
11466 && TREE_CODE (decl
) != TREE_LIST
)
11468 /* Give various messages as the need arises. */
11469 if (TREE_CODE (decl
) == STRING_CST
)
11470 cp_error ("invalid string constant `%E'", decl
);
11471 else if (TREE_CODE (decl
) == INTEGER_CST
)
11472 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11476 if (TREE_CODE (decl
) != VOID_TYPE
)
11478 decl
= grokdeclarator (TREE_VALUE (decl
),
11479 TREE_PURPOSE (decl
),
11480 PARM
, init
!= NULL_TREE
,
11482 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
11485 /* Top-level qualifiers on the parameters are
11486 ignored for function types. */
11487 type
= TYPE_MAIN_VARIANT (TREE_TYPE (decl
));
11489 if (TREE_CODE (type
) == VOID_TYPE
)
11490 decl
= void_type_node
;
11491 else if (TREE_CODE (type
) == METHOD_TYPE
)
11493 if (DECL_NAME (decl
))
11494 /* Cannot use the decl here because
11495 we don't have DECL_CONTEXT set up yet. */
11496 cp_error ("parameter `%D' invalidly declared method type",
11499 error ("parameter invalidly declared method type");
11500 type
= build_pointer_type (type
);
11501 TREE_TYPE (decl
) = type
;
11503 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11505 if (DECL_NAME (decl
))
11506 cp_error ("parameter `%D' invalidly declared offset type",
11509 error ("parameter invalidly declared offset type");
11510 type
= build_pointer_type (type
);
11511 TREE_TYPE (decl
) = type
;
11513 else if (abstract_virtuals_error (decl
, type
))
11514 any_error
= 1; /* Seems like a good idea. */
11515 else if (POINTER_TYPE_P (type
))
11518 while (POINTER_TYPE_P (t
)
11519 || (TREE_CODE (t
) == ARRAY_TYPE
11520 && TYPE_DOMAIN (t
) != NULL_TREE
))
11522 if (TREE_CODE (t
) == ARRAY_TYPE
)
11523 cp_error ("parameter type `%T' includes %s to array of unknown bound",
11525 TYPE_PTR_P (type
) ? "pointer" : "reference");
11529 if (TREE_CODE (decl
) == VOID_TYPE
)
11531 if (result
== NULL_TREE
)
11533 result
= void_list_node
;
11534 last_result
= result
;
11538 TREE_CHAIN (last_result
) = void_list_node
;
11539 last_result
= void_list_node
;
11542 && (chain
!= void_list_node
|| TREE_CHAIN (chain
)))
11543 error ("`void' in parameter list must be entire list");
11547 /* Since there is a prototype, args are passed in their own types. */
11548 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
11549 if (PROMOTE_PROTOTYPES
11550 && (TREE_CODE (type
) == INTEGER_TYPE
11551 || TREE_CODE (type
) == ENUMERAL_TYPE
)
11552 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
11553 DECL_ARG_TYPE (decl
) = integer_type_node
;
11554 if (!any_error
&& init
)
11557 init
= check_default_argument (decl
, init
);
11562 if (decls
== NULL_TREE
)
11569 TREE_CHAIN (last_decl
) = decl
;
11572 if (! current_function_decl
&& TREE_PERMANENT (list_node
))
11574 TREE_PURPOSE (list_node
) = init
;
11575 TREE_VALUE (list_node
) = type
;
11576 TREE_CHAIN (list_node
) = NULL_TREE
;
11579 list_node
= saveable_tree_cons (init
, type
, NULL_TREE
);
11580 if (result
== NULL_TREE
)
11582 result
= list_node
;
11583 last_result
= result
;
11587 TREE_CHAIN (last_result
) = list_node
;
11588 last_result
= list_node
;
11592 TREE_CHAIN (last_result
) = NULL_TREE
;
11593 /* If there are no parameters, and the function does not end
11594 with `...', then last_decl will be NULL_TREE. */
11595 if (last_decl
!= NULL_TREE
)
11596 TREE_CHAIN (last_decl
) = NULL_TREE
;
11600 last_function_parms
= decls
;
11605 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
11606 FUNCTION_TYPE with the newly parsed version of its default argument, which
11607 was previously digested as text. See snarf_defarg et al in lex.c. */
11610 replace_defarg (arg
, init
)
11613 if (! processing_template_decl
11614 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
11615 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
11616 TREE_TYPE (init
), TREE_VALUE (arg
));
11617 TREE_PURPOSE (arg
) = init
;
11624 tree t
= FUNCTION_ARG_CHAIN (d
);
11625 if (DECL_CONSTRUCTOR_P (d
)
11626 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (d
)))
11627 t
= TREE_CHAIN (t
);
11628 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
11629 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
11630 == DECL_CLASS_CONTEXT (d
))
11631 && (TREE_CHAIN (t
) == NULL_TREE
11632 || TREE_CHAIN (t
) == void_list_node
11633 || TREE_PURPOSE (TREE_CHAIN (t
))))
11638 /* These memoizing functions keep track of special properties which
11639 a class may have. `grok_ctor_properties' notices whether a class
11640 has a constructor of the form X(X&), and also complains
11641 if the class has a constructor of the form X(X).
11642 `grok_op_properties' takes notice of the various forms of
11643 operator= which are defined, as well as what sorts of type conversion
11644 may apply. Both functions take a FUNCTION_DECL as an argument. */
11647 grok_ctor_properties (ctype
, decl
)
11650 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
11651 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
11653 /* When a type has virtual baseclasses, a magical first int argument is
11654 added to any ctor so we can tell if the class has been initialized
11655 yet. This could screw things up in this function, so we deliberately
11656 ignore the leading int if we're in that situation. */
11657 if (TYPE_USES_VIRTUAL_BASECLASSES (ctype
))
11659 my_friendly_assert (parmtypes
11660 && TREE_VALUE (parmtypes
) == integer_type_node
,
11662 parmtypes
= TREE_CHAIN (parmtypes
);
11663 parmtype
= TREE_VALUE (parmtypes
);
11668 A non-template constructor for class X is a copy constructor if
11669 its first parameter is of type X&, const X&, volatile X& or const
11670 volatile X&, and either there are no other parameters or else all
11671 other parameters have default arguments. */
11672 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
11673 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
11674 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11675 || TREE_CHAIN (parmtypes
) == void_list_node
11676 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11677 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11678 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11680 TYPE_HAS_INIT_REF (ctype
) = 1;
11681 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11682 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
11686 A declaration of a constructor for a class X is ill-formed if its
11687 first parameter is of type (optionally cv-qualified) X and either
11688 there are no other parameters or else all other parameters have
11691 We *don't* complain about member template instantiations that
11692 have this form, though; they can occur as we try to decide what
11693 constructor to use during overload resolution. Since overload
11694 resolution will never prefer such a constructor to the
11695 non-template copy constructor (which is either explicitly or
11696 implicitly defined), there's no need to worry about their
11697 existence. Theoretically, they should never even be
11698 instantiated, but that's hard to forestall. */
11699 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
11700 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11701 || TREE_CHAIN (parmtypes
) == void_list_node
11702 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11703 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11704 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11706 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
11708 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
11711 else if (TREE_CODE (parmtype
) == VOID_TYPE
11712 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
11713 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
11718 /* An operator with this name can be either unary or binary. */
11724 return (name
== ansi_opname
[(int) INDIRECT_REF
]
11725 || name
== ansi_opname
[(int) ADDR_EXPR
]
11726 || name
== ansi_opname
[(int) NEGATE_EXPR
]
11727 || name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11728 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]
11729 || name
== ansi_opname
[(int) CONVERT_EXPR
]);
11732 /* An operator with this name can only be unary. */
11738 return (name
== ansi_opname
[(int) TRUTH_NOT_EXPR
]
11739 || name
== ansi_opname
[(int) BIT_NOT_EXPR
]
11740 || name
== ansi_opname
[(int) COMPONENT_REF
]
11741 || IDENTIFIER_TYPENAME_P (name
));
11744 /* Do a little sanity-checking on how they declared their operator. */
11747 grok_op_properties (decl
, virtualp
, friendp
)
11749 int virtualp
, friendp
;
11751 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
11752 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
11753 tree name
= DECL_NAME (decl
);
11755 if (current_class_type
== NULL_TREE
)
11762 A user-declared copy assignment operator X::operator= is a
11763 non-static non-template member function of class X with
11764 exactly one parameter of type X, X&, const X&, volatile X& or
11765 const volatile X&. */
11766 if (name
== ansi_opname
[(int) MODIFY_EXPR
]
11767 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11768 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11770 else if (name
== ansi_opname
[(int) CALL_EXPR
])
11771 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
11772 else if (name
== ansi_opname
[(int) ARRAY_REF
])
11773 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
11774 else if (name
== ansi_opname
[(int) COMPONENT_REF
]
11775 || name
== ansi_opname
[(int) MEMBER_REF
])
11776 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
11777 else if (name
== ansi_opname
[(int) NEW_EXPR
])
11778 TYPE_GETS_NEW (current_class_type
) |= 1;
11779 else if (name
== ansi_opname
[(int) DELETE_EXPR
])
11780 TYPE_GETS_DELETE (current_class_type
) |= 1;
11781 else if (name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11782 TYPE_GETS_NEW (current_class_type
) |= 2;
11783 else if (name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11784 TYPE_GETS_DELETE (current_class_type
) |= 2;
11787 if (name
== ansi_opname
[(int) NEW_EXPR
]
11788 || name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11790 /* When the compiler encounters the definition of A::operator new, it
11791 doesn't look at the class declaration to find out if it's static. */
11793 revert_static_member_fn (&decl
, NULL
, NULL
);
11795 /* Take care of function decl if we had syntax errors. */
11796 if (argtypes
== NULL_TREE
)
11798 = build_function_type (ptr_type_node
,
11799 hash_tree_chain (integer_type_node
,
11802 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
11804 else if (name
== ansi_opname
[(int) DELETE_EXPR
]
11805 || name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11808 revert_static_member_fn (&decl
, NULL
, NULL
);
11810 if (argtypes
== NULL_TREE
)
11812 = build_function_type (void_type_node
,
11813 hash_tree_chain (ptr_type_node
,
11817 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
11819 if (! friendp
&& name
== ansi_opname
[(int) VEC_DELETE_EXPR
]
11820 && (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
11821 != void_list_node
))
11822 TYPE_VEC_DELETE_TAKES_SIZE (current_class_type
) = 1;
11827 /* An operator function must either be a non-static member function
11828 or have at least one parameter of a class, a reference to a class,
11829 an enumeration, or a reference to an enumeration. 13.4.0.6 */
11830 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
11832 if (IDENTIFIER_TYPENAME_P (name
)
11833 || name
== ansi_opname
[(int) CALL_EXPR
]
11834 || name
== ansi_opname
[(int) MODIFY_EXPR
]
11835 || name
== ansi_opname
[(int) COMPONENT_REF
]
11836 || name
== ansi_opname
[(int) ARRAY_REF
])
11837 cp_error ("`%D' must be a nonstatic member function", decl
);
11842 if (DECL_STATIC_FUNCTION_P (decl
))
11843 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
11846 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
11848 tree arg
= TREE_VALUE (p
);
11849 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
11850 arg
= TREE_TYPE (arg
);
11852 /* This lets bad template code slip through. */
11853 if (IS_AGGR_TYPE (arg
)
11854 || TREE_CODE (arg
) == ENUMERAL_TYPE
11855 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
11856 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11860 ("`%D' must have an argument of class or enumerated type",
11867 if (name
== ansi_opname
[(int) CALL_EXPR
])
11868 return; /* No restrictions on args. */
11870 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
11872 tree t
= TREE_TYPE (name
);
11873 if (TREE_CODE (t
) == VOID_TYPE
)
11874 pedwarn ("void is not a valid type conversion operator");
11875 else if (! friendp
)
11877 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
11878 const char *what
= 0;
11880 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
11882 if (t
== current_class_type
)
11883 what
= "the same type";
11884 /* Don't force t to be complete here. */
11885 else if (IS_AGGR_TYPE (t
)
11887 && DERIVED_FROM_P (t
, current_class_type
))
11888 what
= "a base class";
11891 warning ("conversion to %s%s will never use a type conversion operator",
11892 ref
? "a reference to " : "", what
);
11896 if (name
== ansi_opname
[(int) MODIFY_EXPR
])
11900 if (list_length (argtypes
) != 3 && methodp
)
11902 cp_error ("`%D' must take exactly one argument", decl
);
11905 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
11907 if (copy_assignment_arg_p (parmtype
, virtualp
)
11910 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
11911 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
11912 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11913 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
11916 else if (name
== ansi_opname
[(int) COND_EXPR
])
11919 cp_error ("ANSI C++ prohibits overloading operator ?:");
11921 else if (ambi_op_p (name
))
11923 if (list_length (argtypes
) == 2)
11925 else if (list_length (argtypes
) == 3)
11927 if ((name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11928 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11929 && ! processing_template_decl
11930 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
11933 cp_error ("postfix `%D' must take `int' as its argument",
11937 ("postfix `%D' must take `int' as its second argument",
11944 cp_error ("`%D' must take either zero or one argument", decl
);
11946 cp_error ("`%D' must take either one or two arguments", decl
);
11949 /* More Effective C++ rule 6. */
11951 && (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11952 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]))
11954 tree arg
= TREE_VALUE (argtypes
);
11955 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
11956 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
11957 arg
= TREE_TYPE (arg
);
11958 arg
= TYPE_MAIN_VARIANT (arg
);
11959 if (list_length (argtypes
) == 2)
11961 if (TREE_CODE (ret
) != REFERENCE_TYPE
11962 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
11964 cp_warning ("prefix `%D' should return `%T'", decl
,
11965 build_reference_type (arg
));
11969 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
11970 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
11974 else if (unary_op_p (name
))
11976 if (list_length (argtypes
) != 2)
11979 cp_error ("`%D' must take `void'", decl
);
11981 cp_error ("`%D' must take exactly one argument", decl
);
11984 else /* if (binary_op_p (name)) */
11986 if (list_length (argtypes
) != 3)
11989 cp_error ("`%D' must take exactly one argument", decl
);
11991 cp_error ("`%D' must take exactly two arguments", decl
);
11994 /* More Effective C++ rule 7. */
11996 && (name
== ansi_opname
[TRUTH_ANDIF_EXPR
]
11997 || name
== ansi_opname
[TRUTH_ORIF_EXPR
]
11998 || name
== ansi_opname
[COMPOUND_EXPR
]))
11999 cp_warning ("user-defined `%D' always evaluates both arguments",
12003 /* Effective C++ rule 23. */
12005 && list_length (argtypes
) == 3
12006 && (name
== ansi_opname
[PLUS_EXPR
]
12007 || name
== ansi_opname
[MINUS_EXPR
]
12008 || name
== ansi_opname
[TRUNC_DIV_EXPR
]
12009 || name
== ansi_opname
[MULT_EXPR
])
12010 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
12011 cp_warning ("`%D' should return by value", decl
);
12015 for (; argtypes
!= void_list_node
; argtypes
= TREE_CHAIN (argtypes
))
12016 if (TREE_PURPOSE (argtypes
))
12018 TREE_PURPOSE (argtypes
) = NULL_TREE
;
12019 if (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
12020 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
12023 cp_pedwarn ("`%D' cannot have default arguments", decl
);
12026 cp_error ("`%D' cannot have default arguments", decl
);
12031 static const char *
12033 enum tag_types code
;
12046 my_friendly_abort (981122);
12050 /* Get the struct, enum or union (CODE says which) with tag NAME.
12051 Define the tag as a forward-reference if it is not defined.
12053 C++: If a class derivation is given, process it here, and report
12054 an error if multiple derivation declarations are not identical.
12056 If this is a definition, come in through xref_tag and only look in
12057 the current frame for the name (since C++ allows new names in any
12061 xref_tag (code_type_node
, name
, globalize
)
12062 tree code_type_node
;
12066 enum tag_types tag_code
;
12067 enum tree_code code
;
12069 register tree ref
, t
;
12070 struct binding_level
*b
= current_binding_level
;
12072 tree attributes
= NULL_TREE
;
12073 tree context
= NULL_TREE
;
12075 /* If we are called from the parser, code_type_node will sometimes be a
12076 TREE_LIST. This indicates that the user wrote
12077 "class __attribute__ ((foo)) bar". Extract the attributes so we can
12079 if (TREE_CODE (code_type_node
) == TREE_LIST
)
12081 attributes
= TREE_PURPOSE (code_type_node
);
12082 code_type_node
= TREE_VALUE (code_type_node
);
12085 tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
12090 code
= RECORD_TYPE
;
12096 code
= ENUMERAL_TYPE
;
12099 my_friendly_abort (18);
12102 /* If a cross reference is requested, look up the type
12103 already defined for this tag and return it. */
12104 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
12107 name
= TYPE_IDENTIFIER (t
);
12111 t
= IDENTIFIER_TYPE_VALUE (name
);
12113 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
12114 && TREE_CODE (t
) != TEMPLATE_TEMPLATE_PARM
)
12119 /* If we know we are defining this tag, only look it up in
12120 this scope and don't try to find it as a type. */
12121 ref
= lookup_tag (code
, name
, b
, 1);
12127 /* [dcl.type.elab] If the identifier resolves to a
12128 typedef-name or a template type-parameter, the
12129 elaborated-type-specifier is ill-formed. */
12130 if (t
!= TYPE_MAIN_VARIANT (t
)
12131 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
12132 cp_pedwarn ("using typedef-name `%D' after `%s'",
12133 TYPE_NAME (t
), tag_name (tag_code
));
12134 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12135 cp_error ("using template type parameter `%T' after `%s'",
12136 t
, tag_name (tag_code
));
12141 ref
= lookup_tag (code
, name
, b
, 0);
12145 /* Try finding it as a type declaration. If that wins,
12147 ref
= lookup_name (name
, 1);
12149 if (ref
!= NULL_TREE
12150 && processing_template_decl
12151 && DECL_CLASS_TEMPLATE_P (ref
)
12152 && template_class_depth (current_class_type
) == 0)
12153 /* Since GLOBALIZE is true, we're declaring a global
12154 template, so we want this type. */
12155 ref
= DECL_RESULT (ref
);
12157 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12158 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12159 ref
= TREE_TYPE (ref
);
12164 if (ref
&& current_class_type
12165 && template_class_depth (current_class_type
)
12166 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12168 /* Since GLOBALIZE is non-zero, we are not looking at a
12169 definition of this tag. Since, in addition, we are currently
12170 processing a (member) template declaration of a template
12171 class, we must be very careful; consider:
12178 { template <class V>
12179 friend struct S1; };
12181 Here, the S2::S1 declaration should not be confused with the
12182 outer declaration. In particular, the inner version should
12183 have a template parameter of level 2, not level 1. This
12184 would be particularly important if the member declaration
12187 template <class V = U> friend struct S1;
12189 say, when we should tsubst into `U' when instantiating
12190 S2. On the other hand, when presented with:
12200 we must find the inner binding eventually. We
12201 accomplish this by making sure that the new type we
12202 create to represent this declaration has the right
12204 context
= TYPE_CONTEXT (ref
);
12209 push_obstacks_nochange ();
12213 /* If no such tag is yet defined, create a forward-reference node
12214 and record it as the "definition".
12215 When a real declaration of this type is found,
12216 the forward-reference will be altered into a real type. */
12218 /* In C++, since these migrate into the global scope, we must
12219 build them on the permanent obstack. */
12221 temp
= allocation_temporary_p ();
12223 end_temporary_allocation ();
12225 if (code
== ENUMERAL_TYPE
)
12227 cp_error ("use of enum `%#D' without previous declaration", name
);
12229 ref
= make_node (ENUMERAL_TYPE
);
12231 /* Give the type a default layout like unsigned int
12232 to avoid crashing if it does not get defined. */
12233 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12234 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12235 TREE_UNSIGNED (ref
) = 1;
12236 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12237 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12238 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12240 /* Enable us to recognize when a type is created in class context.
12241 To do nested classes correctly, this should probably be cleared
12242 out when we leave this classes scope. Currently this in only
12243 done in `start_enum'. */
12245 pushtag (name
, ref
, globalize
);
12249 struct binding_level
*old_b
= class_binding_level
;
12251 ref
= make_lang_type (code
);
12252 TYPE_CONTEXT (ref
) = context
;
12254 #ifdef NONNESTED_CLASSES
12255 /* Class types don't nest the way enums do. */
12256 class_binding_level
= (struct binding_level
*)0;
12258 pushtag (name
, ref
, globalize
);
12259 class_binding_level
= old_b
;
12264 /* If it no longer looks like a nested type, make sure it's
12266 If it is not an IDENTIFIER, this is not a declaration */
12267 if (b
->namespace_p
&& !class_binding_level
12268 && TREE_CODE (name
) == IDENTIFIER_NODE
)
12270 if (IDENTIFIER_NAMESPACE_VALUE (name
) == NULL_TREE
)
12271 SET_IDENTIFIER_NAMESPACE_VALUE (name
, TYPE_NAME (ref
));
12274 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12275 redeclare_class_template (ref
, current_template_parms
);
12278 /* Until the type is defined, tentatively accept whatever
12279 structure tag the user hands us. */
12280 if (TYPE_SIZE (ref
) == NULL_TREE
12281 && ref
!= current_class_type
12282 /* Have to check this, in case we have contradictory tag info. */
12283 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12285 if (tag_code
== class_type
)
12286 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12287 else if (tag_code
== record_type
)
12288 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12293 TREE_TYPE (ref
) = attributes
;
12299 xref_tag_from_type (old
, id
, globalize
)
12303 tree code_type_node
;
12305 if (TREE_CODE (old
) == RECORD_TYPE
)
12306 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12307 ? class_type_node
: record_type_node
);
12309 code_type_node
= union_type_node
;
12311 if (id
== NULL_TREE
)
12312 id
= TYPE_IDENTIFIER (old
);
12314 return xref_tag (code_type_node
, id
, globalize
);
12317 /* REF is a type (named NAME), for which we have just seen some
12318 baseclasses. BINFO is a list of those baseclasses; the
12319 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12320 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12321 struct, or union. */
12324 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12325 tree code_type_node
;
12329 /* In the declaration `A : X, Y, ... Z' we mark all the types
12330 (A, X, Y, ..., Z) so we can check for duplicates. */
12335 enum tag_types tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
12337 if (tag_code
== union_type
)
12339 cp_error ("derived union `%T' invalid", ref
);
12343 len
= list_length (binfo
);
12344 push_obstacks (TYPE_OBSTACK (ref
), TYPE_OBSTACK (ref
));
12346 /* First, make sure that any templates in base-classes are
12347 instantiated. This ensures that if we call ourselves recursively
12348 we do not get confused about which classes are marked and which
12350 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12351 complete_type (TREE_VALUE (base
));
12353 SET_CLASSTYPE_MARKED (ref
);
12354 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12356 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12358 /* The base of a derived struct is public by default. */
12360 = (TREE_PURPOSE (binfo
) == access_public_node
12361 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12362 || (tag_code
!= class_type
12363 && (TREE_PURPOSE (binfo
) == access_default_node
12364 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12366 = (TREE_PURPOSE (binfo
) == access_protected_node
12367 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12369 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12370 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12371 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12372 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12373 tree basetype
= TREE_VALUE (binfo
);
12376 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12377 basetype
= TREE_TYPE (basetype
);
12379 || (TREE_CODE (basetype
) != RECORD_TYPE
12380 && TREE_CODE (basetype
) != TYPENAME_TYPE
12381 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12382 && TREE_CODE (basetype
) != TEMPLATE_TEMPLATE_PARM
))
12384 cp_error ("base type `%T' fails to be a struct or class type",
12385 TREE_VALUE (binfo
));
12389 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12391 /* This code replaces similar code in layout_basetypes.
12392 We put the complete_type first for implicit `typename'. */
12393 if (TYPE_SIZE (basetype
) == NULL_TREE
12394 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12396 cp_error ("base class `%T' has incomplete type", basetype
);
12401 if (CLASSTYPE_MARKED (basetype
))
12403 if (basetype
== ref
)
12404 cp_error ("recursive type `%T' undefined", basetype
);
12406 cp_error ("duplicate base type `%T' invalid", basetype
);
12410 if (TYPE_FOR_JAVA (basetype
)
12411 && current_lang_stack
== current_lang_base
)
12412 TYPE_FOR_JAVA (ref
) = 1;
12414 /* Note that the BINFO records which describe individual
12415 inheritances are *not* shared in the lattice! They
12416 cannot be shared because a given baseclass may be
12417 inherited with different `accessibility' by different
12418 derived classes. (Each BINFO record describing an
12419 individual inheritance contains flags which say what
12420 the `accessibility' of that particular inheritance is.) */
12423 = make_binfo (integer_zero_node
, basetype
,
12424 CLASS_TYPE_P (basetype
)
12425 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
12426 CLASS_TYPE_P (basetype
)
12427 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
12429 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
12430 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
12431 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
12432 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
12433 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
12435 /* We need to unshare the binfos now so that lookups during class
12436 definition work. */
12437 unshare_base_binfos (base_binfo
);
12439 SET_CLASSTYPE_MARKED (basetype
);
12441 /* We are free to modify these bits because they are meaningless
12442 at top level, and BASETYPE is a top-level type. */
12443 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
12445 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
12446 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12449 if (CLASS_TYPE_P (basetype
))
12451 TYPE_GETS_NEW (ref
) |= TYPE_GETS_NEW (basetype
);
12452 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
12459 TREE_VEC_LENGTH (binfos
) = i
;
12461 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
12464 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
12467 tree basetype
= BINFO_TYPE (TREE_VEC_ELT (binfos
, 0));
12469 if (CLASS_TYPE_P (basetype
))
12470 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
12471 = TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
12474 if (TYPE_USES_MULTIPLE_INHERITANCE (ref
))
12475 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12477 /* Unmark all the types. */
12479 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
12480 CLEAR_CLASSTYPE_MARKED (ref
);
12482 /* Now that we know all the base-classes, set up the list of virtual
12484 CLASSTYPE_VBASECLASSES (ref
) = get_vbase_types (ref
);
12490 /* Begin compiling the definition of an enumeration type.
12491 NAME is its name (or null if anonymous).
12492 Returns the type object, as yet incomplete.
12493 Also records info about it so that build_enumerator
12494 may be used to declare the individual values as they are read. */
12500 register tree enumtype
= NULL_TREE
;
12501 struct binding_level
*b
= current_binding_level
;
12503 /* We are wasting space here and putting these on the permanent_obstack so
12504 that typeid(local enum) will work correctly. */
12505 push_obstacks (&permanent_obstack
, &permanent_obstack
);
12507 /* If this is the real definition for a previous forward reference,
12508 fill in the contents in the same object that used to be the
12509 forward reference. */
12511 if (name
!= NULL_TREE
)
12512 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
12514 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
12516 cp_error ("multiple definition of `%#T'", enumtype
);
12517 cp_error_at ("previous definition here", enumtype
);
12521 enumtype
= make_node (ENUMERAL_TYPE
);
12522 pushtag (name
, enumtype
, 0);
12525 if (current_class_type
)
12526 TREE_ADDRESSABLE (b
->tags
) = 1;
12528 /* We don't copy this value because build_enumerator needs to do it. */
12529 enum_next_value
= integer_zero_node
;
12532 GNU_xref_decl (current_function_decl
, enumtype
);
12536 /* After processing and defining all the values of an enumeration type,
12537 install their decls in the enumeration type and finish it off.
12538 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12539 Returns ENUMTYPE. */
12542 finish_enum (enumtype
)
12545 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
12546 /* Calculate the maximum value of any enumerator in this type. */
12548 tree values
= TYPE_VALUES (enumtype
);
12553 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
12558 /* The TREE_VALUE is a CONST_DECL for this enumeration
12560 decl
= TREE_VALUE (pair
);
12562 /* The DECL_INITIAL will be NULL if we are processing a
12563 template declaration and this enumeration constant had no
12564 explicit initializer. */
12565 value
= DECL_INITIAL (decl
);
12566 if (value
&& !processing_template_decl
)
12568 /* Set the TREE_TYPE for the VALUE as well. That's so
12569 that when we call decl_constant_value we get an
12570 entity of the right type (but with the constant
12571 value). Since we shouldn't ever call
12572 decl_constant_value on a template type, there's no
12573 reason to do that when processing_template_decl.
12574 And, if the expression is something like a
12575 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12576 wreak havoc on the intended type of the expression.
12578 Of course, there's also no point in trying to compute
12579 minimum or maximum values if we're in a template. */
12580 TREE_TYPE (value
) = enumtype
;
12583 minnode
= maxnode
= value
;
12584 else if (tree_int_cst_lt (maxnode
, value
))
12586 else if (tree_int_cst_lt (value
, minnode
))
12590 if (processing_template_decl
)
12591 /* If this is just a template, leave the CONST_DECL
12592 alone. That way tsubst_copy will find CONST_DECLs for
12593 CONST_DECLs, and not INTEGER_CSTs. */
12596 /* In the list we're building up, we want the enumeration
12597 values, not the CONST_DECLs. */
12598 TREE_VALUE (pair
) = value
;
12602 maxnode
= minnode
= integer_zero_node
;
12604 TYPE_VALUES (enumtype
) = nreverse (values
);
12606 if (processing_template_decl
)
12608 tree scope
= current_scope ();
12609 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
12610 add_tree (build_min (TAG_DEFN
, enumtype
));
12614 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
12615 int lowprec
= min_precision (minnode
, unsignedp
);
12616 int highprec
= min_precision (maxnode
, unsignedp
);
12617 int precision
= MAX (lowprec
, highprec
);
12620 TYPE_SIZE (enumtype
) = NULL_TREE
;
12622 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
12624 TYPE_PRECISION (enumtype
) = precision
;
12626 fixup_unsigned_type (enumtype
);
12628 fixup_signed_type (enumtype
);
12630 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
12631 /* Use the width of the narrowest normal C type which is wide
12633 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
12636 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
12638 TYPE_SIZE (enumtype
) = 0;
12639 layout_type (enumtype
);
12641 /* Fix up all variant types of this enum type. */
12642 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
12643 tem
= TYPE_NEXT_VARIANT (tem
))
12645 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
12646 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
12647 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
12648 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
12649 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
12650 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
12651 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
12652 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
12653 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
12656 /* Finish debugging output for this type. */
12657 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
12660 /* In start_enum we pushed obstacks. Here, we must pop them. */
12666 /* Build and install a CONST_DECL for an enumeration constant of the
12667 enumeration type TYPE whose NAME and VALUE (if any) are provided.
12668 Assignment of sequential values by default is handled here. */
12671 build_enumerator (name
, value
, type
)
12679 /* Remove no-op casts from the value. */
12681 STRIP_TYPE_NOPS (value
);
12683 if (! processing_template_decl
)
12685 /* Validate and default VALUE. */
12686 if (value
!= NULL_TREE
)
12688 if (TREE_READONLY_DECL_P (value
))
12689 value
= decl_constant_value (value
);
12691 if (TREE_CODE (value
) == INTEGER_CST
)
12693 value
= default_conversion (value
);
12694 constant_expression_warning (value
);
12698 cp_error ("enumerator value for `%D' not integer constant", name
);
12703 /* Default based on previous value. */
12704 if (value
== NULL_TREE
&& ! processing_template_decl
)
12706 value
= enum_next_value
;
12708 cp_error ("overflow in enumeration values at `%D'", name
);
12711 /* Remove no-op casts from the value. */
12713 STRIP_TYPE_NOPS (value
);
12715 /* To fix MAX_VAL enum consts. (bkoz) */
12716 TREE_TYPE (value
) = integer_type_node
;
12720 /* We always have to copy here; not all INTEGER_CSTs are unshared.
12721 Even in other cases, we will later (in finish_enum) be setting the
12723 if (value
!= NULL_TREE
)
12724 value
= copy_node (value
);
12726 /* C++ associates enums with global, function, or class declarations. */
12728 context
= current_scope ();
12729 if (context
&& context
== current_class_type
)
12730 /* This enum declaration is local to the class. */
12731 decl
= build_lang_decl (CONST_DECL
, name
, type
);
12733 /* It's a global enum, or it's local to a function. (Note local to
12734 a function could mean local to a class method. */
12735 decl
= build_decl (CONST_DECL
, name
, type
);
12737 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
12738 DECL_INITIAL (decl
) = value
;
12739 TREE_READONLY (decl
) = 1;
12741 if (context
&& context
== current_class_type
)
12742 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
12743 on the TYPE_FIELDS list for `S'. (That's so that you can say
12744 things like `S::i' later.) */
12745 finish_member_declaration (decl
);
12749 GNU_xref_decl (current_function_decl
, decl
);
12752 if (! processing_template_decl
)
12754 /* Set basis for default for next value. */
12755 enum_next_value
= build_binary_op_nodefault (PLUS_EXPR
, value
,
12756 integer_one_node
, PLUS_EXPR
);
12757 enum_overflow
= tree_int_cst_lt (enum_next_value
, value
);
12760 result
= saveable_tree_cons (name
, decl
, NULL_TREE
);
12765 static int function_depth
;
12767 /* Create the FUNCTION_DECL for a function definition.
12768 DECLSPECS and DECLARATOR are the parts of the declaration;
12769 they describe the function's name and the type it returns,
12770 but twisted together in a fashion that parallels the syntax of C.
12772 If PRE_PARSED_P is non-zero then DECLARATOR is really the DECL for
12773 the function we are about to process; DECLSPECS are ignored. For
12774 example, we set PRE_PARSED_P when processing the definition of
12775 inline function that was defined in-class; the definition is
12776 actually processed when the class is complete. In this case,
12777 PRE_PARSED_P is 2. We also set PRE_PARSED_P when instanting the
12778 body of a template function, and when constructing thunk functions
12779 and such; in these cases PRE_PARSED_P is 1.
12781 This function creates a binding context for the function body
12782 as well as setting up the FUNCTION_DECL in current_function_decl.
12784 Returns 1 on success. If the DECLARATOR is not suitable for a function
12785 (it defines a datum instead), we return 0, which tells
12786 yyparse to report a parse error.
12788 For C++, we must first check whether that datum makes any sense.
12789 For example, "class A local_a(1,2);" means that variable local_a
12790 is an aggregate of type A, which should have a constructor
12791 applied to it with the argument list [1, 2].
12793 @@ There is currently no way to retrieve the storage
12794 @@ allocated to FUNCTION (or all of its parms) if we return
12795 @@ something we had previously. */
12798 start_function (declspecs
, declarator
, attrs
, pre_parsed_p
)
12799 tree declspecs
, declarator
, attrs
;
12803 tree ctype
= NULL_TREE
;
12806 extern int have_extern_spec
;
12807 extern int used_extern_spec
;
12808 int doing_friend
= 0;
12810 /* Sanity check. */
12811 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
12812 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
12814 /* Assume, until we see it does. */
12815 current_function_returns_value
= 0;
12816 current_function_returns_null
= 0;
12818 shadowed_labels
= 0;
12819 current_function_assigns_this
= 0;
12820 current_function_just_assigned_this
= 0;
12821 current_function_parms_stored
= 0;
12822 original_result_rtx
= NULL_RTX
;
12823 base_init_expr
= NULL_TREE
;
12824 current_base_init_list
= NULL_TREE
;
12825 current_member_init_list
= NULL_TREE
;
12826 ctor_label
= dtor_label
= NULL_TREE
;
12827 static_labelno
= 0;
12828 in_function_try_handler
= 0;
12830 clear_temp_name ();
12832 /* This should only be done once on the top most decl. */
12833 if (have_extern_spec
&& !used_extern_spec
)
12835 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
12836 used_extern_spec
= 1;
12841 decl1
= declarator
;
12843 fntype
= TREE_TYPE (decl1
);
12844 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12845 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12847 /* ANSI C++ June 5 1992 WP 11.4.5. A friend function defined in a
12848 class is in the (lexical) scope of the class in which it is
12850 if (!ctype
&& DECL_FRIEND_P (decl1
))
12852 ctype
= DECL_CLASS_CONTEXT (decl1
);
12854 /* CTYPE could be null here if we're dealing with a template;
12855 for example, `inline friend float foo()' inside a template
12856 will have no CTYPE set. */
12857 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
12863 last_function_parms
= DECL_ARGUMENTS (decl1
);
12864 last_function_parm_tags
= NULL_TREE
;
12868 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
12869 /* If the declarator is not suitable for a function definition,
12870 cause a syntax error. */
12871 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
12873 fntype
= TREE_TYPE (decl1
);
12875 restype
= TREE_TYPE (fntype
);
12876 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
12878 cp_error ("semicolon missing after declaration of `%#T'", restype
);
12879 shadow_tag (build_expr_list (NULL_TREE
, restype
));
12880 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
12881 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
12882 fntype
= build_function_type (integer_type_node
,
12883 TYPE_ARG_TYPES (fntype
));
12885 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
12887 TYPE_ARG_TYPES (fntype
));
12888 TREE_TYPE (decl1
) = fntype
;
12891 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12892 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12893 else if (DECL_MAIN_P (decl1
))
12895 /* If this doesn't return integer_type, complain. */
12896 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
12898 if (pedantic
|| warn_return_type
)
12899 pedwarn ("return type for `main' changed to `int'");
12900 TREE_TYPE (decl1
) = fntype
= default_function_type
;
12905 /* Warn if function was previously implicitly declared
12906 (but not if we warned then). */
12907 if (! warn_implicit
12908 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
12909 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
12911 if (!building_stmt_tree ())
12912 announce_function (decl1
);
12914 /* Set up current_class_type, and enter the scope of the class, if
12917 push_nested_class (ctype
, 1);
12918 else if (DECL_STATIC_FUNCTION_P (decl1
))
12919 push_nested_class (DECL_CONTEXT (decl1
), 2);
12921 /* Now that we have entered the scope of the class, we must restore
12922 the bindings for any template parameters surrounding DECL1, if it
12923 is an inline member template. (Order is important; consider the
12924 case where a template parameter has the same name as a field of
12925 the class.) It is not until after this point that
12926 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
12927 if (pre_parsed_p
== 2)
12928 maybe_begin_member_template_processing (decl1
);
12930 /* Effective C++ rule 15. See also c_expand_return. */
12932 && DECL_NAME (decl1
) == ansi_opname
[(int) MODIFY_EXPR
]
12933 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
12934 cp_warning ("`operator=' should return a reference to `*this'");
12936 /* Make the init_value nonzero so pushdecl knows this is not tentative.
12937 error_mark_node is replaced below (in poplevel) with the BLOCK. */
12938 DECL_INITIAL (decl1
) = error_mark_node
;
12940 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
12941 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
12944 /* This function exists in static storage.
12945 (This does not mean `static' in the C sense!) */
12946 TREE_STATIC (decl1
) = 1;
12948 /* We must call push_template_decl after current_class_type is set
12949 up. (If we are processing inline definitions after exiting a
12950 class scope, current_class_type will be NULL_TREE until set above
12951 by push_nested_class.) */
12952 if (processing_template_decl
)
12953 decl1
= push_template_decl (decl1
);
12955 /* We are now in the scope of the function being defined. */
12956 current_function_decl
= decl1
;
12958 /* Save the parm names or decls from this function's declarator
12959 where store_parm_decls will find them. */
12960 current_function_parms
= last_function_parms
;
12961 current_function_parm_tags
= last_function_parm_tags
;
12963 if (! processing_template_decl
)
12965 /* In a function definition, arg types must be complete. */
12966 require_complete_types_for_parms (current_function_parms
);
12968 if (TYPE_SIZE (complete_type (TREE_TYPE (fntype
))) == NULL_TREE
)
12970 cp_error ("return-type `%#T' is an incomplete type",
12971 TREE_TYPE (fntype
));
12973 /* Make it return void instead, but don't change the
12974 type of the DECL_RESULT, in case we have a named return value. */
12977 = build_cplus_method_type (build_type_variant (ctype
,
12978 TREE_READONLY (decl1
),
12979 TREE_SIDE_EFFECTS (decl1
)),
12981 FUNCTION_ARG_CHAIN (decl1
));
12984 = build_function_type (void_type_node
,
12985 TYPE_ARG_TYPES (TREE_TYPE (decl1
)));
12986 DECL_RESULT (decl1
)
12987 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (TREE_TYPE (fntype
)));
12988 TREE_READONLY (DECL_RESULT (decl1
))
12989 = CP_TYPE_CONST_P (TREE_TYPE (fntype
));
12990 TREE_THIS_VOLATILE (DECL_RESULT (decl1
))
12991 = CP_TYPE_VOLATILE_P (TREE_TYPE (fntype
));
12994 abstract_virtuals_error (decl1
, TREE_TYPE (fntype
));
12997 /* Record the decl so that the function name is defined.
12998 If we already have a decl for this name, and it is a FUNCTION_DECL,
12999 use the old decl. */
13000 if (!processing_template_decl
&& pre_parsed_p
== 0)
13002 /* A specialization is not used to guide overload resolution. */
13003 if ((flag_guiding_decls
13004 || !DECL_TEMPLATE_SPECIALIZATION (decl1
))
13005 && ! DECL_FUNCTION_MEMBER_P (decl1
))
13006 decl1
= pushdecl (decl1
);
13009 /* We need to set the DECL_CONTEXT. */
13010 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
13011 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
13012 /* And make sure we have enough default args. */
13013 check_default_args (decl1
);
13015 DECL_MAIN_VARIANT (decl1
) = decl1
;
13016 fntype
= TREE_TYPE (decl1
);
13019 current_function_decl
= decl1
;
13021 if (DECL_INTERFACE_KNOWN (decl1
))
13023 tree ctx
= hack_decl_function_context (decl1
);
13025 if (DECL_NOT_REALLY_EXTERN (decl1
))
13026 DECL_EXTERNAL (decl1
) = 0;
13028 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
13029 && TREE_PUBLIC (ctx
))
13030 /* This is a function in a local class in an extern inline
13032 comdat_linkage (decl1
);
13034 /* If this function belongs to an interface, it is public.
13035 If it belongs to someone else's interface, it is also external.
13036 This only affects inlines and template instantiations. */
13037 else if (interface_unknown
== 0
13038 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13039 || flag_alt_external_templates
))
13041 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
13042 || processing_template_decl
)
13044 DECL_EXTERNAL (decl1
)
13046 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
13047 && !DECL_VINDEX (decl1
)));
13049 /* For WIN32 we also want to put these in linkonce sections. */
13050 maybe_make_one_only (decl1
);
13053 DECL_EXTERNAL (decl1
) = 0;
13054 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
13055 DECL_INTERFACE_KNOWN (decl1
) = 1;
13057 else if (interface_unknown
&& interface_only
13058 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13059 || flag_alt_external_templates
))
13061 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13062 interface, we will have interface_only set but not
13063 interface_known. In that case, we don't want to use the normal
13064 heuristics because someone will supply a #pragma implementation
13065 elsewhere, and deducing it here would produce a conflict. */
13066 comdat_linkage (decl1
);
13067 DECL_EXTERNAL (decl1
) = 0;
13068 DECL_INTERFACE_KNOWN (decl1
) = 1;
13069 DECL_DEFER_OUTPUT (decl1
) = 1;
13073 /* This is a definition, not a reference.
13074 So clear DECL_EXTERNAL. */
13075 DECL_EXTERNAL (decl1
) = 0;
13077 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
13078 && ! DECL_INTERFACE_KNOWN (decl1
)
13079 /* Don't try to defer nested functions for now. */
13080 && ! hack_decl_function_context (decl1
))
13081 DECL_DEFER_OUTPUT (decl1
) = 1;
13083 DECL_INTERFACE_KNOWN (decl1
) = 1;
13086 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
))
13088 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13089 TREE_TYPE (decl1
) = fntype
13090 = build_function_type (TREE_TYPE (fntype
),
13091 TREE_CHAIN (TYPE_ARG_TYPES (fntype
)));
13092 current_function_parms
= TREE_CHAIN (current_function_parms
);
13093 DECL_ARGUMENTS (decl1
) = current_function_parms
;
13096 restype
= TREE_TYPE (fntype
);
13100 /* If we're compiling a friend function, neither of the variables
13101 current_class_ptr nor current_class_type will have values. */
13102 if (! doing_friend
)
13104 /* We know that this was set up by `grokclassfn'.
13105 We do not wait until `store_parm_decls', since evil
13106 parse errors may never get us to that point. Here
13107 we keep the consistency between `current_class_type'
13108 and `current_class_ptr'. */
13109 tree t
= current_function_parms
;
13112 my_friendly_assert (t
!= NULL_TREE
13113 && TREE_CODE (t
) == PARM_DECL
, 162);
13114 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
13117 if (! hack_decl_function_context (decl1
))
13118 temporary_allocation ();
13119 i
= suspend_momentary ();
13121 /* Normally, build_indirect_ref returns current_class_ref
13122 whenever current_class_ptr is dereferenced. This time,
13123 however, we want it to *create* current_class_ref, so we
13124 temporarily clear current_class_ptr to fool it. */
13125 current_class_ptr
= NULL_TREE
;
13126 current_class_ref
= build_indirect_ref (t
, NULL_PTR
);
13127 current_class_ptr
= t
;
13129 resume_momentary (i
);
13130 if (! hack_decl_function_context (decl1
))
13131 end_temporary_allocation ();
13135 current_class_ptr
= current_class_ref
= NULL_TREE
;
13138 current_binding_level
->parm_flag
= 1;
13141 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13143 if (!building_stmt_tree ())
13145 GNU_xref_function (decl1
, current_function_parms
);
13146 make_function_rtl (decl1
);
13149 /* Promote the value to int before returning it. */
13150 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13151 restype
= type_promotes_to (restype
);
13153 /* If this fcn was already referenced via a block-scope `extern' decl
13154 (or an implicit decl), propagate certain information about the usage. */
13155 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13156 TREE_ADDRESSABLE (decl1
) = 1;
13158 if (DECL_RESULT (decl1
) == NULL_TREE
)
13160 DECL_RESULT (decl1
)
13161 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13162 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13163 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13166 /* Allocate further tree nodes temporarily during compilation
13167 of this function only. Tiemann moved up here from bottom of fn. */
13168 /* If this is a nested function, then we must continue to allocate RTL
13169 on the permanent obstack in case we need to inline it later. */
13170 if (! hack_decl_function_context (decl1
))
13171 temporary_allocation ();
13173 /* Make sure that we always have a momntary obstack while we're in a
13177 if (building_stmt_tree ())
13178 begin_stmt_tree (decl1
);
13182 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl1
))
13183 && DECL_LANGUAGE (decl1
) == lang_cplusplus
)
13185 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13186 ctor_label
= NULL_TREE
;
13190 dtor_label
= NULL_TREE
;
13191 if (DECL_CONSTRUCTOR_P (decl1
))
13192 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13198 /* Called after store_parm_decls for a function-try-block. We need to update
13199 last_parm_cleanup_insn so that the base initializers for a constructor
13200 are run within this block, not before it. */
13203 expand_start_early_try_stmts ()
13205 expand_start_try_stmts ();
13206 last_parm_cleanup_insn
= get_last_insn ();
13209 /* Store the parameter declarations into the current function declaration.
13210 This is called after parsing the parameter declarations, before
13211 digesting the body of the function.
13213 Also install to binding contour return value identifier, if any. */
13216 store_parm_decls ()
13218 register tree fndecl
= current_function_decl
;
13219 register tree parm
;
13220 int parms_have_cleanups
= 0;
13221 tree cleanups
= NULL_TREE
;
13223 /* This is either a chain of PARM_DECLs (when a prototype is used). */
13224 tree specparms
= current_function_parms
;
13226 /* This is a list of types declared among parms in a prototype. */
13227 tree parmtags
= current_function_parm_tags
;
13229 /* This is a chain of any other decls that came in among the parm
13230 declarations. If a parm is declared with enum {foo, bar} x;
13231 then CONST_DECLs for foo and bar are put here. */
13232 tree nonparms
= NULL_TREE
;
13234 if (toplevel_bindings_p ())
13235 fatal ("parse errors have confused me too much");
13237 /* Initialize RTL machinery. */
13238 init_function_start (fndecl
, input_filename
, lineno
);
13239 /* Even though we're inside a function body, we still don't want to
13240 call expand_expr to calculate the size of a variable-sized array.
13241 We haven't necessarily assigned RTL to all variables yet, so it's
13242 not safe to try to expand expressions involving them. */
13243 immediate_size_expand
= 0;
13244 get_pending_sizes ();
13246 /* Create a binding level for the parms. */
13247 expand_start_bindings (0);
13249 if (specparms
!= NULL_TREE
)
13251 /* This case is when the function was defined with an ANSI prototype.
13252 The parms already have decls, so we need not do anything here
13253 except record them as in effect
13254 and complain if any redundant old-style parm decls were written. */
13256 register tree next
;
13258 /* Must clear this because it might contain TYPE_DECLs declared
13260 storedecls (NULL_TREE
);
13262 for (parm
= nreverse (specparms
); parm
; parm
= next
)
13264 next
= TREE_CHAIN (parm
);
13265 if (TREE_CODE (parm
) == PARM_DECL
)
13268 if (DECL_NAME (parm
) == NULL_TREE
)
13272 else if (TREE_CODE (TREE_TYPE (parm
)) == VOID_TYPE
)
13273 cp_error ("parameter `%D' declared void", parm
);
13276 /* Now fill in DECL_REFERENCE_SLOT for any of the parm decls.
13277 A parameter is assumed not to have any side effects.
13278 If this should change for any reason, then this
13279 will have to wrap the bashed reference type in a save_expr.
13281 Also, if the parameter type is declared to be an X
13282 and there is an X(X&) constructor, we cannot lay it
13283 into the stack (any more), so we make this parameter
13284 look like it is really of reference type. Functions
13285 which pass parameters to this function will know to
13286 create a temporary in their frame, and pass a reference
13289 if (TREE_CODE (TREE_TYPE (parm
)) == REFERENCE_TYPE
13290 && TYPE_SIZE (TREE_TYPE (TREE_TYPE (parm
))))
13291 SET_DECL_REFERENCE_SLOT (parm
, convert_from_reference (parm
));
13295 if (! building_stmt_tree ()
13296 && (cleanup
= maybe_build_cleanup (parm
), cleanup
))
13298 expand_decl (parm
);
13299 parms_have_cleanups
= 1;
13301 /* Keep track of the cleanups. */
13302 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13307 /* If we find an enum constant or a type tag,
13308 put it aside for the moment. */
13309 TREE_CHAIN (parm
) = NULL_TREE
;
13310 nonparms
= chainon (nonparms
, parm
);
13314 /* Get the decls in their original chain order
13315 and record in the function. This is all and only the
13316 PARM_DECLs that were pushed into scope by the loop above. */
13317 DECL_ARGUMENTS (fndecl
) = getdecls ();
13319 storetags (chainon (parmtags
, gettags ()));
13322 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13324 /* Now store the final chain of decls for the arguments
13325 as the decl-chain of the current lexical scope.
13326 Put the enumerators in as well, at the front so that
13327 DECL_ARGUMENTS is not modified. */
13329 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13331 /* Declare __FUNCTION__ and __PRETTY_FUNCTION__ for this function. */
13332 declare_function_name ();
13334 /* Initialize the RTL code for the function. */
13335 DECL_SAVED_INSNS (fndecl
) = 0;
13336 if (! building_stmt_tree ())
13337 expand_function_start (fndecl
, parms_have_cleanups
);
13339 current_function_parms_stored
= 1;
13341 /* If this function is `main', emit a call to `__main'
13342 to run global initializers, etc. */
13343 if (DECL_MAIN_P (fndecl
) && !building_stmt_tree ())
13344 expand_main_function ();
13346 /* Now that we have initialized the parms, we can start their
13347 cleanups. We cannot do this before, since expand_decl_cleanup
13348 should not be called before the parm can be used. */
13349 if (cleanups
&& !building_stmt_tree ())
13351 for (cleanups
= nreverse (cleanups
); cleanups
; cleanups
= TREE_CHAIN (cleanups
))
13353 if (! expand_decl_cleanup (TREE_PURPOSE (cleanups
), TREE_VALUE (cleanups
)))
13354 cp_error ("parser lost in parsing declaration of `%D'",
13355 TREE_PURPOSE (cleanups
));
13359 /* Create a binding contour which can be used to catch
13360 cleanup-generated temporaries. Also, if the return value needs or
13361 has initialization, deal with that now. */
13362 if (parms_have_cleanups
)
13365 if (!building_stmt_tree ())
13366 expand_start_bindings (0);
13369 if (! building_stmt_tree () && flag_exceptions
)
13371 /* Do the starting of the exception specifications, if we have any. */
13372 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13373 expand_start_eh_spec ();
13376 last_parm_cleanup_insn
= get_last_insn ();
13377 last_dtor_insn
= get_last_insn ();
13380 /* Bind a name and initialization to the return value of
13381 the current function. */
13384 store_return_init (decl
)
13387 /* If this named return value comes in a register, put it in a
13388 pseudo-register. */
13389 if (DECL_REGISTER (decl
))
13391 original_result_rtx
= DECL_RTL (decl
);
13392 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
13397 /* Finish up a function declaration and compile that function
13398 all the way to assembler language output. The free the storage
13399 for the function definition.
13401 This is called after parsing the body of the function definition.
13402 LINENO is the current line number.
13404 FLAGS is a bitwise or of the following values:
13406 An extra call to poplevel (and expand_end_bindings) must be
13407 made to take care of the binding contour for the base
13408 initializers. This is only relevant for constructors.
13410 We just finished processing the body of an in-class inline
13411 function definition. (This processing will have taken place
13412 after the class definition is complete.)
13414 NESTED is nonzero if we were in the middle of compiling another function
13415 when we started on this one. */
13418 finish_function (lineno
, flags
, nested
)
13423 register tree fndecl
= current_function_decl
;
13424 tree fntype
, ctype
= NULL_TREE
;
13425 rtx fn_last_parm_insn
, insns
;
13426 /* Label to use if this function is supposed to return a value. */
13427 tree no_return_label
= NULL_TREE
;
13428 tree decls
= NULL_TREE
;
13429 int call_poplevel
= (flags
& 1) != 0;
13430 int inclass_inline
= (flags
& 2) != 0;
13433 /* When we get some parse errors, we can end up without a
13434 current_function_decl, so cope. */
13435 if (fndecl
== NULL_TREE
)
13438 if (function_depth
> 1)
13441 fntype
= TREE_TYPE (fndecl
);
13443 /* TREE_READONLY (fndecl) = 1;
13444 This caused &foo to be of type ptr-to-const-function
13445 which then got a warning when stored in a ptr-to-function variable. */
13447 /* This happens on strange parse errors. */
13448 if (! current_function_parms_stored
)
13451 store_parm_decls ();
13454 if (building_stmt_tree ())
13456 if (DECL_CONSTRUCTOR_P (fndecl
) && call_poplevel
)
13458 decls
= getdecls ();
13459 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13460 poplevel (decls
!= NULL_TREE
, 0, 0);
13465 if (write_symbols
!= NO_DEBUG
/*&& TREE_CODE (fntype) != METHOD_TYPE*/)
13467 tree ttype
= target_type (fntype
);
13470 if (IS_AGGR_TYPE (ttype
))
13471 /* Let debugger know it should output info for this type. */
13472 note_debug_info_needed (ttype
);
13474 for (parmdecl
= DECL_ARGUMENTS (fndecl
); parmdecl
; parmdecl
= TREE_CHAIN (parmdecl
))
13476 ttype
= target_type (TREE_TYPE (parmdecl
));
13477 if (IS_AGGR_TYPE (ttype
))
13478 /* Let debugger know it should output info for this type. */
13479 note_debug_info_needed (ttype
);
13483 /* Clean house because we will need to reorder insns here. */
13484 do_pending_stack_adjust ();
13488 tree binfo
= TYPE_BINFO (current_class_type
);
13489 tree cond
= integer_one_node
;
13491 tree in_charge_node
= lookup_name (in_charge_identifier
, 0);
13493 int ok_to_optimize_dtor
= 0;
13494 int empty_dtor
= get_last_insn () == last_dtor_insn
;
13496 if (current_function_assigns_this
)
13497 cond
= build (NE_EXPR
, boolean_type_node
,
13498 current_class_ptr
, integer_zero_node
);
13501 int n_baseclasses
= CLASSTYPE_N_BASECLASSES (current_class_type
);
13503 /* If this destructor is empty, then we don't need to check
13504 whether `this' is NULL in some cases. */
13505 if ((flag_this_is_variable
& 1) == 0)
13506 ok_to_optimize_dtor
= 1;
13507 else if (empty_dtor
)
13508 ok_to_optimize_dtor
13509 = (n_baseclasses
== 0
13510 || (n_baseclasses
== 1
13511 && TYPE_HAS_DESTRUCTOR (TYPE_BINFO_BASETYPE (current_class_type
, 0))));
13514 /* These initializations might go inline. Protect
13515 the binding level of the parms. */
13517 expand_start_bindings (0);
13519 if (current_function_assigns_this
)
13521 current_function_assigns_this
= 0;
13522 current_function_just_assigned_this
= 0;
13525 /* Generate the code to call destructor on base class.
13526 If this destructor belongs to a class with virtual
13527 functions, then set the virtual function table
13528 pointer to represent the type of our base class. */
13530 /* This side-effect makes call to `build_delete' generate the
13531 code we have to have at the end of this destructor.
13532 `build_delete' will set the flag again. */
13533 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
13535 /* These are two cases where we cannot delegate deletion. */
13536 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)
13537 || TYPE_GETS_REG_DELETE (current_class_type
))
13538 exprstmt
= build_delete (current_class_type
, current_class_ref
, integer_zero_node
,
13539 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
, 0);
13541 exprstmt
= build_delete (current_class_type
, current_class_ref
, in_charge_node
,
13542 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
, 0);
13544 /* If we did not assign to this, then `this' is non-zero at
13545 the end of a destructor. As a special optimization, don't
13546 emit test if this is an empty destructor. If it does nothing,
13547 it does nothing. If it calls a base destructor, the base
13548 destructor will perform the test. */
13550 if (exprstmt
!= error_mark_node
13551 && (TREE_CODE (exprstmt
) != NOP_EXPR
13552 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
13553 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
13555 expand_label (dtor_label
);
13556 if (cond
!= integer_one_node
)
13557 expand_start_cond (cond
, 0);
13558 if (exprstmt
!= void_zero_node
)
13559 /* Don't call `expand_expr_stmt' if we're not going to do
13560 anything, since -Wall will give a diagnostic. */
13561 expand_expr_stmt (exprstmt
);
13563 /* Run destructor on all virtual baseclasses. */
13564 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13566 tree vbases
= nreverse (copy_list (CLASSTYPE_VBASECLASSES (current_class_type
)));
13567 expand_start_cond (build (BIT_AND_EXPR
, integer_type_node
,
13568 in_charge_node
, integer_two_node
), 0);
13571 if (TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (vbases
)))
13573 tree vb
= get_vbase
13574 (BINFO_TYPE (vbases
),
13575 TYPE_BINFO (current_class_type
));
13577 (build_scoped_method_call
13578 (current_class_ref
, vb
, dtor_identifier
,
13579 build_expr_list (NULL_TREE
, integer_zero_node
)));
13581 vbases
= TREE_CHAIN (vbases
);
13583 expand_end_cond ();
13586 do_pending_stack_adjust ();
13587 if (cond
!= integer_one_node
)
13588 expand_end_cond ();
13591 virtual_size
= c_sizeof (current_class_type
);
13593 /* At the end, call delete if that's what's requested. */
13595 /* FDIS sez: At the point of definition of a virtual destructor
13596 (including an implicit definition), non-placement operator
13597 delete shall be looked up in the scope of the destructor's
13598 class and if found shall be accessible and unambiguous.
13600 This is somewhat unclear, but I take it to mean that if the
13601 class only defines placement deletes we don't do anything here.
13602 So we pass LOOKUP_SPECULATIVELY; delete_sanity will complain
13603 for us if they ever try to delete one of these. */
13605 if (TYPE_GETS_REG_DELETE (current_class_type
)
13606 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13607 exprstmt
= build_op_delete_call
13608 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
13609 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
13611 exprstmt
= NULL_TREE
;
13615 cond
= build (BIT_AND_EXPR
, integer_type_node
,
13616 in_charge_node
, integer_one_node
);
13617 expand_start_cond (cond
, 0);
13618 expand_expr_stmt (exprstmt
);
13619 expand_end_cond ();
13622 /* End of destructor. */
13623 expand_end_bindings (NULL_TREE
, getdecls () != NULL_TREE
, 0);
13624 poplevel (getdecls () != NULL_TREE
, 0, 0);
13626 /* Back to the top of destructor. */
13627 /* Don't execute destructor code if `this' is NULL. */
13631 /* If the dtor is empty, and we know there is not possible way we
13632 could use any vtable entries, before they are possibly set by
13633 a base class dtor, we don't have to setup the vtables, as we
13634 know that any base class dtoring will set up any vtables it
13635 needs. We avoid MI, because one base class dtor can do a
13636 virtual dispatch to an overridden function that would need to
13637 have a non-related vtable set up, we cannot avoid setting up
13638 vtables in that case. We could change this to see if there is
13639 just one vtable. */
13640 if (! empty_dtor
|| TYPE_USES_COMPLEX_INHERITANCE (current_class_type
))
13642 /* Make all virtual function table pointers in non-virtual base
13643 classes point to CURRENT_CLASS_TYPE's virtual function
13645 expand_direct_vtbls_init (binfo
, binfo
, 1, 0, current_class_ptr
);
13647 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13648 expand_indirect_vtbls_init (binfo
, current_class_ref
, current_class_ptr
);
13651 if (! ok_to_optimize_dtor
)
13653 cond
= build_binary_op (NE_EXPR
,
13654 current_class_ptr
, integer_zero_node
);
13655 expand_start_cond (cond
, 0);
13658 insns
= get_insns ();
13661 fn_last_parm_insn
= get_first_nonparm_insn ();
13662 if (fn_last_parm_insn
== NULL_RTX
)
13663 fn_last_parm_insn
= get_last_insn ();
13665 fn_last_parm_insn
= previous_insn (fn_last_parm_insn
);
13667 emit_insns_after (insns
, fn_last_parm_insn
);
13669 if (! ok_to_optimize_dtor
)
13670 expand_end_cond ();
13672 else if (current_function_assigns_this
)
13674 /* Does not need to call emit_base_init, because
13675 that is done (if needed) just after assignment to this
13678 if (DECL_CONSTRUCTOR_P (current_function_decl
))
13680 end_protect_partials ();
13681 expand_label (ctor_label
);
13682 ctor_label
= NULL_TREE
;
13686 decls
= getdecls ();
13687 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13688 poplevel (decls
!= NULL_TREE
, 0, 0);
13690 /* c_expand_return knows to return 'this' from a constructor. */
13691 c_expand_return (NULL_TREE
);
13693 else if (TREE_CODE (TREE_TYPE (DECL_RESULT (current_function_decl
))) != VOID_TYPE
13694 && return_label
!= NULL_RTX
)
13695 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13697 current_function_assigns_this
= 0;
13698 current_function_just_assigned_this
= 0;
13699 base_init_expr
= NULL_TREE
;
13701 else if (DECL_CONSTRUCTOR_P (fndecl
))
13703 tree cond
= NULL_TREE
, thenclause
= NULL_TREE
;
13704 /* Allow constructor for a type to get a new instance of the object
13705 using `build_new'. */
13706 tree abstract_virtuals
= CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
);
13707 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
) = NULL_TREE
;
13709 if (flag_this_is_variable
> 0)
13711 cond
= build_binary_op (EQ_EXPR
,
13712 current_class_ptr
, integer_zero_node
);
13713 thenclause
= build_modify_expr (current_class_ptr
, NOP_EXPR
,
13714 build_new (NULL_TREE
, current_class_type
, void_type_node
, 0));
13717 CLASSTYPE_ABSTRACT_VIRTUALS (current_class_type
) = abstract_virtuals
;
13721 if (flag_this_is_variable
> 0)
13723 expand_start_cond (cond
, 0);
13724 expand_expr_stmt (thenclause
);
13725 expand_end_cond ();
13728 /* Emit insns from `emit_base_init' which sets up virtual
13729 function table pointer(s). */
13730 if (base_init_expr
)
13732 expand_expr_stmt (base_init_expr
);
13733 base_init_expr
= NULL_TREE
;
13736 insns
= get_insns ();
13739 /* This is where the body of the constructor begins. */
13741 emit_insns_after (insns
, last_parm_cleanup_insn
);
13743 end_protect_partials ();
13745 /* This is where the body of the constructor ends. */
13746 expand_label (ctor_label
);
13747 ctor_label
= NULL_TREE
;
13751 decls
= getdecls ();
13752 expand_end_bindings (decls
, decls
!= NULL_TREE
, 0);
13753 poplevel (decls
!= NULL_TREE
, 1, 0);
13756 /* c_expand_return knows to return 'this' from a constructor. */
13757 c_expand_return (NULL_TREE
);
13759 current_function_assigns_this
= 0;
13760 current_function_just_assigned_this
= 0;
13762 else if (DECL_MAIN_P (fndecl
))
13764 /* Make it so that `main' always returns 0 by default. */
13766 c_expand_return (integer_one_node
);
13768 c_expand_return (integer_zero_node
);
13771 else if (return_label
!= NULL_RTX
13772 && current_function_return_value
== NULL_TREE
13773 && ! DECL_NAME (DECL_RESULT (current_function_decl
)))
13774 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13776 if (flag_exceptions
)
13777 expand_exception_blocks ();
13779 /* If this function is supposed to return a value, ensure that
13780 we do not fall into the cleanups by mistake. The end of our
13781 function will look like this:
13783 user code (may have return stmt somewhere)
13784 goto no_return_label
13789 NOTE_INSN_FUNCTION_END
13793 If the user omits a return stmt in the USER CODE section, we
13794 will have a control path which reaches NOTE_INSN_FUNCTION_END.
13795 Otherwise, we won't. */
13796 if (no_return_label
)
13798 DECL_CONTEXT (no_return_label
) = fndecl
;
13799 DECL_INITIAL (no_return_label
) = error_mark_node
;
13800 DECL_SOURCE_FILE (no_return_label
) = input_filename
;
13801 DECL_SOURCE_LINE (no_return_label
) = lineno
;
13802 expand_goto (no_return_label
);
13807 /* Remove the binding contour which is used
13808 to catch cleanup-generated temporaries. */
13809 expand_end_bindings (0, 0, 0);
13810 poplevel (0, 0, 0);
13812 /* Emit label at beginning of cleanup code for parameters. */
13813 emit_label (cleanup_label
);
13816 /* Get return value into register if that's where it's supposed to be. */
13817 if (original_result_rtx
)
13818 fixup_result_decl (DECL_RESULT (fndecl
), original_result_rtx
);
13820 /* Finish building code that will trigger warnings if users forget
13821 to make their functions return values. */
13822 if (no_return_label
|| cleanup_label
)
13823 emit_jump (return_label
);
13824 if (no_return_label
)
13826 /* We don't need to call `expand_*_return' here because we
13827 don't need any cleanups here--this path of code is only
13828 for error checking purposes. */
13829 expand_label (no_return_label
);
13832 /* We hard-wired immediate_size_expand to zero in
13833 start_function. Expand_function_end will decrement this
13834 variable. So, we set the variable to one here, so that after
13835 the decrement it will remain zero. */
13836 immediate_size_expand
= 0;
13838 /* Generate rtl for function exit. */
13839 expand_function_end (input_filename
, lineno
, 1);
13842 /* We have to save this value here in case
13843 maybe_end_member_template_processing decides to pop all the
13844 template parameters. */
13845 expand_p
= !building_stmt_tree ();
13847 /* If we're saving up tree structure, tie off the function now. */
13849 finish_stmt_tree (fndecl
);
13851 /* This must come after expand_function_end because cleanups might
13852 have declarations (from inline functions) that need to go into
13853 this function's blocks. */
13854 if (current_binding_level
->parm_flag
!= 1)
13855 my_friendly_abort (122);
13856 poplevel (1, 0, 1);
13858 /* If this is a in-class inline definition, we may have to pop the
13859 bindings for the template parameters that we added in
13860 maybe_begin_member_template_processing when start_function was
13862 if (inclass_inline
)
13863 maybe_end_member_template_processing ();
13865 /* Reset scope for C++: if we were in the scope of a class,
13866 then when we finish this function, we are not longer so.
13867 This cannot be done until we know for sure that no more
13868 class members will ever be referenced in this function
13869 (i.e., calls to destructors). */
13870 if (current_class_name
)
13872 ctype
= current_class_type
;
13873 pop_nested_class ();
13876 /* Must mark the RESULT_DECL as being in this function. */
13877 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
13879 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
13880 to the FUNCTION_DECL node itself. */
13881 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
13883 /* Undo the call to push_momentary in start_function. */
13888 int saved_flag_keep_inline_functions
=
13889 flag_keep_inline_functions
;
13891 /* So we can tell if jump_optimize sets it to 1. */
13894 if (DECL_CONTEXT (fndecl
) != NULL_TREE
13895 && hack_decl_function_context (fndecl
))
13896 /* Trick rest_of_compilation into not deferring output of this
13897 function, even if it is inline, since the rtl_obstack for
13898 this function is the function_obstack of the enclosing
13899 function and will be deallocated when the enclosing
13900 function is gone. See save_tree_status. */
13901 flag_keep_inline_functions
= 1;
13903 /* Run the optimizers and output the assembler code for this
13906 if (DECL_ARTIFICIAL (fndecl
))
13908 /* Do we really *want* to inline this synthesized method? */
13910 int save_fif
= flag_inline_functions
;
13911 flag_inline_functions
= 1;
13913 /* Turn off DECL_INLINE for the moment so function_cannot_inline_p
13914 will check our size. */
13915 DECL_INLINE (fndecl
) = 0;
13917 rest_of_compilation (fndecl
);
13918 flag_inline_functions
= save_fif
;
13921 rest_of_compilation (fndecl
);
13923 flag_keep_inline_functions
= saved_flag_keep_inline_functions
;
13925 if (DECL_SAVED_INSNS (fndecl
) && ! TREE_ASM_WRITTEN (fndecl
))
13927 /* Set DECL_EXTERNAL so that assemble_external will be called as
13928 necessary. We'll clear it again in finish_file. */
13929 if (! DECL_EXTERNAL (fndecl
))
13930 DECL_NOT_REALLY_EXTERN (fndecl
) = 1;
13931 DECL_EXTERNAL (fndecl
) = 1;
13932 mark_inline_for_output (fndecl
);
13935 if (ctype
&& TREE_ASM_WRITTEN (fndecl
))
13936 note_debug_info_needed (ctype
);
13938 current_function_returns_null
|= can_reach_end
;
13940 /* Since we don't normally go through c_expand_return for constructors,
13941 this normally gets the wrong value.
13942 Also, named return values have their return codes emitted after
13943 NOTE_INSN_FUNCTION_END, confusing jump.c. */
13944 if (DECL_CONSTRUCTOR_P (fndecl
)
13945 || DECL_NAME (DECL_RESULT (fndecl
)) != NULL_TREE
)
13946 current_function_returns_null
= 0;
13948 if (TREE_THIS_VOLATILE (fndecl
) && current_function_returns_null
)
13949 cp_warning ("`noreturn' function `%D' does return", fndecl
);
13950 else if ((warn_return_type
|| pedantic
)
13951 && current_function_returns_null
13952 && TREE_CODE (TREE_TYPE (fntype
)) != VOID_TYPE
)
13954 /* If this function returns non-void and control can drop through,
13956 cp_warning ("control reaches end of non-void function `%D'", fndecl
);
13958 /* With just -W, complain only if function returns both with
13959 and without a value. */
13960 else if (extra_warnings
13961 && current_function_returns_value
&& current_function_returns_null
)
13962 warning ("this function may return with or without a value");
13967 /* Free all the tree nodes making up this function. */
13968 /* Switch back to allocating nodes permanently
13969 until we start another function. */
13971 permanent_allocation (1);
13973 if (DECL_SAVED_INSNS (fndecl
) == 0)
13977 /* Stop pointing to the local nodes about to be freed. */
13978 /* But DECL_INITIAL must remain nonzero so we know this
13979 was an actual function definition. */
13980 DECL_INITIAL (fndecl
) = error_mark_node
;
13981 for (t
= DECL_ARGUMENTS (fndecl
); t
; t
= TREE_CHAIN (t
))
13982 DECL_RTL (t
) = DECL_INCOMING_RTL (t
) = NULL_RTX
;
13985 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
13986 static_ctors
= perm_tree_cons (NULL_TREE
, fndecl
, static_ctors
);
13987 if (DECL_STATIC_DESTRUCTOR (fndecl
))
13988 static_dtors
= perm_tree_cons (NULL_TREE
, fndecl
, static_dtors
);
13992 /* Let the error reporting routines know that we're outside a
13993 function. For a nested function, this value is used in
13994 pop_cp_function_context and then reset via pop_function_context. */
13995 current_function_decl
= NULL_TREE
;
13998 named_label_uses
= NULL
;
13999 current_class_ptr
= NULL_TREE
;
14000 current_class_ref
= NULL_TREE
;
14003 /* Create the FUNCTION_DECL for a function definition.
14004 DECLSPECS and DECLARATOR are the parts of the declaration;
14005 they describe the return type and the name of the function,
14006 but twisted together in a fashion that parallels the syntax of C.
14008 This function creates a binding context for the function body
14009 as well as setting up the FUNCTION_DECL in current_function_decl.
14011 Returns a FUNCTION_DECL on success.
14013 If the DECLARATOR is not suitable for a function (it defines a datum
14014 instead), we return 0, which tells yyparse to report a parse error.
14016 May return void_type_node indicating that this method is actually
14017 a friend. See grokfield for more details.
14019 Came here with a `.pushlevel' .
14021 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14022 CHANGES TO CODE IN `grokfield'. */
14025 start_method (declspecs
, declarator
, attrlist
)
14026 tree declarator
, declspecs
, attrlist
;
14028 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
14031 /* Something too ugly to handle. */
14032 if (fndecl
== NULL_TREE
)
14035 /* Pass friends other than inline friend functions back. */
14036 if (fndecl
== void_type_node
)
14039 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
14040 /* Not a function, tell parser to report parse error. */
14043 if (DECL_IN_AGGR_P (fndecl
))
14045 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
14047 if (DECL_CONTEXT (fndecl
)
14048 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
14049 cp_error ("`%D' is already defined in class %s", fndecl
,
14050 TYPE_NAME_STRING (DECL_CONTEXT (fndecl
)));
14052 return void_type_node
;
14055 check_template_shadow (fndecl
);
14057 DECL_THIS_INLINE (fndecl
) = 1;
14059 if (flag_default_inline
)
14060 DECL_INLINE (fndecl
) = 1;
14062 /* We process method specializations in finish_struct_1. */
14063 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
14064 fndecl
= push_template_decl (fndecl
);
14066 /* We read in the parameters on the maybepermanent_obstack,
14067 but we won't be getting back to them until after we
14068 may have clobbered them. So the call to preserve_data
14069 will keep them safe. */
14072 if (! DECL_FRIEND_P (fndecl
))
14074 if (TREE_CHAIN (fndecl
))
14076 fndecl
= copy_node (fndecl
);
14077 TREE_CHAIN (fndecl
) = NULL_TREE
;
14080 if (DECL_CONSTRUCTOR_P (fndecl
))
14082 if (! grok_ctor_properties (current_class_type
, fndecl
))
14083 return void_type_node
;
14085 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
14086 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
14089 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0, 0);
14091 /* Make a place for the parms */
14093 current_binding_level
->parm_flag
= 1;
14095 DECL_IN_AGGR_P (fndecl
) = 1;
14099 /* Go through the motions of finishing a function definition.
14100 We don't compile this method until after the whole class has
14103 FINISH_METHOD must return something that looks as though it
14104 came from GROKFIELD (since we are defining a method, after all).
14106 This is called after parsing the body of the function definition.
14107 STMTS is the chain of statements that makes up the function body.
14109 DECL is the ..._DECL that `start_method' provided. */
14112 finish_method (decl
)
14115 register tree fndecl
= decl
;
14118 register tree link
;
14120 if (decl
== void_type_node
)
14123 old_initial
= DECL_INITIAL (fndecl
);
14125 /* Undo the level for the parms (from start_method).
14126 This is like poplevel, but it causes nothing to be
14127 saved. Saving information here confuses symbol-table
14128 output routines. Besides, this information will
14129 be correctly output when this method is actually
14132 /* Clear out the meanings of the local variables of this level;
14133 also record in each decl which block it belongs to. */
14135 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
14137 if (DECL_NAME (link
) != NULL_TREE
)
14138 pop_binding (DECL_NAME (link
), link
);
14139 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
14140 DECL_CONTEXT (link
) = NULL_TREE
;
14143 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
14144 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
14145 current_binding_level
->parm_flag
,
14146 current_binding_level
->keep
);
14148 poplevel (0, 0, 0);
14150 DECL_INITIAL (fndecl
) = old_initial
;
14152 /* We used to check if the context of FNDECL was different from
14153 current_class_type as another way to get inside here. This didn't work
14154 for String.cc in libg++. */
14155 if (DECL_FRIEND_P (fndecl
))
14157 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
14158 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
14159 decl
= void_type_node
;
14165 /* Called when a new struct TYPE is defined.
14166 If this structure or union completes the type of any previous
14167 variable declaration, lay it out and output its rtl. */
14170 hack_incomplete_structures (type
)
14175 if (current_binding_level
->incomplete
== NULL_TREE
)
14178 if (!type
) /* Don't do this for class templates. */
14181 for (list
= ¤t_binding_level
->incomplete
; *list
; )
14183 tree decl
= TREE_VALUE (*list
);
14184 if ((decl
&& TREE_TYPE (decl
) == type
)
14185 || (TREE_TYPE (decl
)
14186 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14187 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
14189 int toplevel
= toplevel_bindings_p ();
14190 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14191 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
14192 layout_type (TREE_TYPE (decl
));
14193 layout_decl (decl
, 0);
14194 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
14198 expand_decl (decl
);
14199 cleanup
= maybe_build_cleanup (decl
);
14200 expand_decl_init (decl
);
14201 if (! expand_decl_cleanup (decl
, cleanup
))
14202 cp_error ("parser lost in parsing declaration of `%D'",
14205 *list
= TREE_CHAIN (*list
);
14208 list
= &TREE_CHAIN (*list
);
14212 /* If DECL is of a type which needs a cleanup, build that cleanup here.
14213 See build_delete for information about AUTO_DELETE.
14215 Don't build these on the momentary obstack; they must live
14216 the life of the binding contour. */
14219 maybe_build_cleanup_1 (decl
, auto_delete
)
14220 tree decl
, auto_delete
;
14222 tree type
= TREE_TYPE (decl
);
14223 if (type
!= error_mark_node
&& TYPE_NEEDS_DESTRUCTOR (type
))
14225 int temp
= 0, flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14228 if (TREE_CODE (decl
) != PARM_DECL
)
14229 temp
= suspend_momentary ();
14231 if (TREE_CODE (type
) == ARRAY_TYPE
)
14235 mark_addressable (decl
);
14236 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14239 /* Optimize for space over speed here. */
14240 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14241 || flag_expensive_optimizations
)
14242 flags
|= LOOKUP_NONVIRTUAL
;
14244 rval
= build_delete (TREE_TYPE (rval
), rval
, auto_delete
, flags
, 0);
14246 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14247 && ! TYPE_HAS_DESTRUCTOR (type
))
14248 rval
= build_compound_expr (expr_tree_cons (NULL_TREE
, rval
,
14249 build_expr_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14251 if (TREE_CODE (decl
) != PARM_DECL
)
14252 resume_momentary (temp
);
14259 /* If DECL is of a type which needs a cleanup, build that cleanup
14260 here. The cleanup does free the storage with a call to delete. */
14263 maybe_build_cleanup_and_delete (decl
)
14266 return maybe_build_cleanup_1 (decl
, integer_three_node
);
14269 /* If DECL is of a type which needs a cleanup, build that cleanup
14270 here. The cleanup does not free the storage with a call a delete. */
14273 maybe_build_cleanup (decl
)
14276 return maybe_build_cleanup_1 (decl
, integer_two_node
);
14279 /* Expand a C++ expression at the statement level.
14280 This is needed to ferret out nodes which have UNKNOWN_TYPE.
14281 The C++ type checker should get all of these out when
14282 expressions are combined with other, type-providing, expressions,
14283 leaving only orphan expressions, such as:
14285 &class::bar; / / takes its address, but does nothing with it. */
14288 cplus_expand_expr_stmt (exp
)
14291 exp
= require_complete_type_in_void (exp
);
14293 if (TREE_CODE (exp
) == FUNCTION_DECL
)
14295 cp_warning ("reference, not call, to function `%D'", exp
);
14296 warning ("at this point in file");
14300 /* We should do this eventually, but right now this causes regex.o from
14301 libg++ to miscompile, and tString to core dump. */
14302 exp
= build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (exp
), exp
);
14305 /* Strip unused implicit INDIRECT_REFs of references. */
14306 if (TREE_CODE (exp
) == INDIRECT_REF
14307 && TREE_CODE (TREE_TYPE (TREE_OPERAND (exp
, 0))) == REFERENCE_TYPE
)
14308 exp
= TREE_OPERAND (exp
, 0);
14310 /* If we don't do this, we end up down inside expand_expr
14311 trying to do TYPE_MODE on the ERROR_MARK, and really
14312 go outside the bounds of the type. */
14313 if (exp
!= error_mark_node
)
14314 expand_expr_stmt (break_out_cleanups (exp
));
14317 /* When a stmt has been parsed, this function is called. */
14322 if (!current_function_assigns_this
14323 && current_function_just_assigned_this
)
14325 if (DECL_CONSTRUCTOR_P (current_function_decl
))
14327 /* Constructors must wait until we are out of control
14328 zones before calling base constructors. */
14329 if (in_control_zone_p ())
14331 expand_expr_stmt (base_init_expr
);
14332 check_base_init (current_class_type
);
14334 current_function_assigns_this
= 1;
14337 /* Always assume this statement was not an expression statement. If
14338 it actually was an expression statement, its our callers
14339 responsibility to fix this up. */
14340 last_expr_type
= NULL_TREE
;
14343 /* Change a static member function definition into a FUNCTION_TYPE, instead
14344 of the METHOD_TYPE that we create when it's originally parsed.
14346 WARNING: DO NOT pass &TREE_TYPE (decl) to FN or &TYPE_ARG_TYPES
14347 (TREE_TYPE (decl)) to ARGTYPES, as doing so will corrupt the types of
14348 other decls. Either pass the addresses of local variables or NULL. */
14351 revert_static_member_fn (decl
, fn
, argtypes
)
14352 tree
*decl
, *fn
, *argtypes
;
14355 tree function
= fn
? *fn
: TREE_TYPE (*decl
);
14356 tree args
= argtypes
? *argtypes
: TYPE_ARG_TYPES (function
);
14358 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14359 != TYPE_UNQUALIFIED
)
14360 cp_error ("static member function `%#D' declared with type qualifiers",
14363 args
= TREE_CHAIN (args
);
14364 tmp
= build_function_type (TREE_TYPE (function
), args
);
14365 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14366 tmp
= build_exception_variant (tmp
,
14367 TYPE_RAISES_EXCEPTIONS (function
));
14368 TREE_TYPE (*decl
) = tmp
;
14369 if (DECL_ARGUMENTS (*decl
))
14370 DECL_ARGUMENTS (*decl
) = TREE_CHAIN (DECL_ARGUMENTS (*decl
));
14371 DECL_STATIC_FUNCTION_P (*decl
) = 1;
14383 int just_assigned_this
;
14385 int temp_name_counter
;
14387 struct named_label_list
*named_label_uses
;
14388 tree shadowed_labels
;
14391 rtx last_dtor_insn
;
14392 rtx last_parm_cleanup_insn
;
14393 tree base_init_list
;
14394 tree member_init_list
;
14395 tree base_init_expr
;
14396 tree current_class_ptr
;
14397 tree current_class_ref
;
14399 struct cp_function
*next
;
14400 struct binding_level
*binding_level
;
14401 int static_labelno
;
14402 int in_function_try_handler
;
14404 int stmts_are_full_exprs_p
;
14406 tree last_expr_type
;
14409 static struct cp_function
*cp_function_chain
;
14411 extern int temp_name_counter
;
14413 /* Save and reinitialize the variables
14414 used during compilation of a C++ function. */
14417 push_cp_function_context (context
)
14420 struct cp_function
*p
14421 = (struct cp_function
*) xmalloc (sizeof (struct cp_function
));
14423 push_function_context_to (context
);
14425 p
->next
= cp_function_chain
;
14426 cp_function_chain
= p
;
14428 p
->named_labels
= named_labels
;
14429 p
->named_label_uses
= named_label_uses
;
14430 p
->shadowed_labels
= shadowed_labels
;
14431 p
->returns_value
= current_function_returns_value
;
14432 p
->returns_null
= current_function_returns_null
;
14433 p
->binding_level
= current_binding_level
;
14434 p
->ctor_label
= ctor_label
;
14435 p
->dtor_label
= dtor_label
;
14436 p
->last_dtor_insn
= last_dtor_insn
;
14437 p
->last_parm_cleanup_insn
= last_parm_cleanup_insn
;
14438 p
->assigns_this
= current_function_assigns_this
;
14439 p
->just_assigned_this
= current_function_just_assigned_this
;
14440 p
->parms_stored
= current_function_parms_stored
;
14441 p
->result_rtx
= original_result_rtx
;
14442 p
->base_init_expr
= base_init_expr
;
14443 p
->temp_name_counter
= temp_name_counter
;
14444 p
->base_init_list
= current_base_init_list
;
14445 p
->member_init_list
= current_member_init_list
;
14446 p
->current_class_ptr
= current_class_ptr
;
14447 p
->current_class_ref
= current_class_ref
;
14448 p
->static_labelno
= static_labelno
;
14449 p
->in_function_try_handler
= in_function_try_handler
;
14450 p
->last_tree
= last_tree
;
14451 p
->last_expr_type
= last_expr_type
;
14452 p
->expanding_p
= expanding_p
;
14453 p
->stmts_are_full_exprs_p
= stmts_are_full_exprs_p
;
14455 /* For now, we always assume we're expanding all the way to RTL
14456 unless we're explicitly doing otherwise. */
14459 /* Whenever we start a new function, we destroy temporaries in the
14461 stmts_are_full_exprs_p
= 1;
14464 /* Restore the variables used during compilation of a C++ function. */
14467 pop_cp_function_context (context
)
14470 struct cp_function
*p
= cp_function_chain
;
14473 /* Bring back all the labels that were shadowed. */
14474 for (link
= shadowed_labels
; link
; link
= TREE_CHAIN (link
))
14475 if (DECL_NAME (TREE_VALUE (link
)) != 0)
14476 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (TREE_VALUE (link
)),
14477 TREE_VALUE (link
));
14479 pop_function_context_from (context
);
14481 cp_function_chain
= p
->next
;
14483 named_labels
= p
->named_labels
;
14484 named_label_uses
= p
->named_label_uses
;
14485 shadowed_labels
= p
->shadowed_labels
;
14486 current_function_returns_value
= p
->returns_value
;
14487 current_function_returns_null
= p
->returns_null
;
14488 current_binding_level
= p
->binding_level
;
14489 ctor_label
= p
->ctor_label
;
14490 dtor_label
= p
->dtor_label
;
14491 last_dtor_insn
= p
->last_dtor_insn
;
14492 last_parm_cleanup_insn
= p
->last_parm_cleanup_insn
;
14493 current_function_assigns_this
= p
->assigns_this
;
14494 current_function_just_assigned_this
= p
->just_assigned_this
;
14495 current_function_parms_stored
= p
->parms_stored
;
14496 original_result_rtx
= p
->result_rtx
;
14497 base_init_expr
= p
->base_init_expr
;
14498 temp_name_counter
= p
->temp_name_counter
;
14499 current_base_init_list
= p
->base_init_list
;
14500 current_member_init_list
= p
->member_init_list
;
14501 current_class_ptr
= p
->current_class_ptr
;
14502 current_class_ref
= p
->current_class_ref
;
14503 static_labelno
= p
->static_labelno
;
14504 in_function_try_handler
= p
->in_function_try_handler
;
14505 last_tree
= p
->last_tree
;
14506 last_expr_type
= p
->last_expr_type
;
14507 expanding_p
= p
->expanding_p
;
14508 stmts_are_full_exprs_p
= p
->stmts_are_full_exprs_p
;
14516 return function_depth
!= 0;