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 tree global_namespace
;
60 extern int (*valid_lang_attribute
) PROTO ((tree
, tree
, tree
, tree
));
62 /* Use garbage collection. */
66 /* Obstack used for remembering local class declarations (like
67 enums and static (const) members. */
69 struct obstack decl_obstack
;
70 static struct stack_level
*decl_stack
;
72 #ifndef WCHAR_UNSIGNED
73 #define WCHAR_UNSIGNED 0
76 #ifndef CHAR_TYPE_SIZE
77 #define CHAR_TYPE_SIZE BITS_PER_UNIT
80 #ifndef BOOL_TYPE_SIZE
81 #ifdef SLOW_BYTE_ACCESS
82 #define BOOL_TYPE_SIZE ((SLOW_BYTE_ACCESS) ? (POINTER_SIZE) : (CHAR_TYPE_SIZE))
84 #define BOOL_TYPE_SIZE CHAR_TYPE_SIZE
88 /* We let tm.h override the types used here, to handle trivial differences
89 such as the choice of unsigned int or long unsigned int for size_t.
90 When machines start needing nontrivial differences in the size type,
91 it would be best to do something here to figure out automatically
92 from other information what type to use. */
95 #define SIZE_TYPE "long unsigned int"
99 #define PTRDIFF_TYPE "long int"
103 #define WCHAR_TYPE "int"
106 static tree grokparms
PROTO((tree
, int));
107 static const char *redeclaration_error_message
PROTO((tree
, tree
));
109 static struct stack_level
*push_decl_level
PROTO((struct stack_level
*,
111 static void push_binding_level
PROTO((struct binding_level
*, int,
113 static void pop_binding_level
PROTO((void));
114 static void suspend_binding_level
PROTO((void));
115 static void resume_binding_level
PROTO((struct binding_level
*));
116 static struct binding_level
*make_binding_level
PROTO((void));
117 static void declare_namespace_level
PROTO((void));
118 static void signal_catch
PROTO((int)) ATTRIBUTE_NORETURN
;
119 static void storedecls
PROTO((tree
));
120 static void require_complete_types_for_parms
PROTO((tree
));
121 static void push_overloaded_decl_1
PROTO((tree
));
122 static int ambi_op_p
PROTO((tree
));
123 static int unary_op_p
PROTO((tree
));
124 static tree store_bindings
PROTO((tree
, tree
));
125 static tree lookup_tag_reverse
PROTO((tree
, tree
));
126 static tree obscure_complex_init
PROTO((tree
, tree
));
127 static tree maybe_build_cleanup_1
PROTO((tree
, tree
));
128 static tree lookup_name_real
PROTO((tree
, int, int, int));
129 static void warn_extern_redeclared_static
PROTO((tree
, tree
));
130 static void grok_reference_init
PROTO((tree
, tree
, tree
));
131 static tree grokfndecl
PROTO((tree
, tree
, tree
, tree
, int,
132 enum overload_flags
, tree
,
133 tree
, int, int, int, int, int, int, tree
));
134 static tree grokvardecl
PROTO((tree
, tree
, RID_BIT_TYPE
*, int, int, tree
));
135 static tree lookup_tag
PROTO((enum tree_code
, tree
,
136 struct binding_level
*, int));
137 static void set_identifier_type_value_with_scope
138 PROTO((tree
, tree
, struct binding_level
*));
139 static void record_builtin_type
PROTO((enum rid
, const char *, tree
));
140 static void record_unknown_type
PROTO((tree
, const char *));
141 static int member_function_or_else
PROTO((tree
, tree
, const char *));
142 static void bad_specifiers
PROTO((tree
, const char *, int, int, int, int,
144 static void lang_print_error_function
PROTO((const char *));
145 static tree maybe_process_template_type_declaration
PROTO((tree
, int, struct binding_level
*));
146 static void check_for_uninitialized_const_var
PROTO((tree
));
147 static unsigned long typename_hash
PROTO((hash_table_key
));
148 static boolean typename_compare
PROTO((hash_table_key
, hash_table_key
));
149 static void push_binding
PROTO((tree
, tree
, struct binding_level
*));
150 static int add_binding
PROTO((tree
, tree
));
151 static void pop_binding
PROTO((tree
, tree
));
152 static tree local_variable_p
PROTO((tree
*));
153 static tree find_binding
PROTO((tree
, tree
));
154 static tree select_decl
PROTO((tree
, int));
155 static int lookup_flags
PROTO((int, int));
156 static tree qualify_lookup
PROTO((tree
, int));
157 static tree record_builtin_java_type
PROTO((const char *, int));
158 static const char *tag_name
PROTO((enum tag_types code
));
159 static void find_class_binding_level
PROTO((void));
160 static struct binding_level
*innermost_nonclass_level
PROTO((void));
161 static void warn_about_implicit_typename_lookup
PROTO((tree
, tree
));
162 static int walk_namespaces_r
PROTO((tree
, walk_namespaces_fn
, void *));
163 static int walk_globals_r
PROTO((tree
, void *));
164 static void add_decl_to_level
PROTO((tree
, struct binding_level
*));
165 static tree make_label_decl
PROTO((tree
, int));
166 static void pop_label
PROTO((tree
));
167 static void pop_labels
PROTO((tree
));
168 static void maybe_deduce_size_from_array_init
PROTO((tree
, tree
));
169 static void layout_var_decl
PROTO((tree
));
170 static void maybe_commonize_var
PROTO((tree
));
171 static tree check_initializer
PROTO((tree
, tree
));
172 static void make_rtl_for_nonlocal_decl
PROTO((tree
, tree
, const char *));
173 static void push_cp_function_context
PROTO((struct function
*));
174 static void pop_cp_function_context
PROTO((struct function
*));
175 static void mark_binding_level
PROTO((void *));
176 static void mark_cp_function_context
PROTO((struct function
*));
177 static void mark_saved_scope
PROTO((void *));
178 static void mark_lang_function
PROTO((struct language_function
*));
179 static void save_function_data
PROTO((tree
));
180 static void check_function_type
PROTO((tree
));
181 static void destroy_local_static
PROTO((tree
));
182 static void destroy_local_var
PROTO((tree
));
183 static void finish_destructor_body
PROTO((void));
185 #if defined (DEBUG_CP_BINDING_LEVELS)
186 static void indent
PROTO((void));
189 /* Erroneous argument lists can use this *IFF* they do not modify it. */
190 tree error_mark_list
;
192 /* The following symbols are subsumed in the cp_global_trees array, and
193 listed here individually for documentation purposes.
196 tree wchar_decl_node;
199 tree vtable_entry_type;
200 tree delta_type_node;
203 tree __baselist_desc_type_node;
204 tree __i_desc_type_node, __m_desc_type_node;
205 tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type;
207 tree __t_desc_type_node;
209 tree __tp_desc_type_node;
211 tree __access_mode_type_node;
212 tree __bltn_desc_type_node, __user_desc_type_node, __class_desc_type_node;
213 tree __ptr_desc_type_node, __attr_desc_type_node, __func_desc_type_node;
214 tree __ptmf_desc_type_node, __ptmd_desc_type_node;
216 Not needed yet? May be needed one day?
217 tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type;
218 tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type;
219 tree __ptmf_desc_array_type, __ptmd_desc_array_type;
222 tree class_star_type_node;
223 tree class_type_node, record_type_node, union_type_node, enum_type_node;
224 tree unknown_type_node;
226 Array type `vtable_entry_type[]'
229 tree vtbl_ptr_type_node;
235 A FUNCTION_DECL which can call `abort'. Not necessarily the
236 one that the user will declare, but sufficient to be called
237 by routines that want to abort the program.
241 The FUNCTION_DECL for the default `::operator delete'.
243 tree global_delete_fndecl;
246 tree type_info_type_node, tinfo_fn_id, tinfo_fn_type;
250 tree cp_global_trees
[CPTI_MAX
];
252 /* Indicates that there is a type value in some namespace, although
253 that is not necessarily in scope at the moment. */
255 static tree global_type_node
;
260 /* Expect only namespace names now. */
261 static int only_namespace_names
;
263 /* In a destructor, the last insn emitted after the start of the
264 function and the parms. */
266 #define last_dtor_insn cp_function_chain->x_last_dtor_insn
268 /* In a constructor, the last insn emitted after the start of the
269 function and the parms, the exception specification and any
270 function-try-block. The constructor initializers are emitted after
273 #define last_parm_cleanup_insn cp_function_chain->x_last_parm_cleanup_insn
275 /* If original DECL_RESULT of current function was a register,
276 but due to being an addressable named return value, would up
277 on the stack, this variable holds the named return value's
278 original location. */
280 #define original_result_rtx cp_function_chain->x_result_rtx
282 struct named_label_list
284 struct binding_level
*binding_level
;
287 const char *filename_o_goto
;
289 struct named_label_list
*next
;
292 /* Used only for jumps to as-yet undefined labels, since jumps to
293 defined labels can have their validity checked by stmt.c. */
295 #define named_label_uses cp_function_chain->x_named_label_uses
297 /* A list of objects which have constructors or destructors
298 which reside in the global scope. The decl is stored in
299 the TREE_VALUE slot and the initializer is stored
300 in the TREE_PURPOSE slot. */
301 tree static_aggregates
;
305 /* A node for the integer constants 2, and 3. */
307 tree integer_two_node
, integer_three_node
;
309 /* While defining an enum type, this is 1 plus the last enumerator
312 static tree enum_next_value
;
314 /* Nonzero means that there was overflow computing enum_next_value. */
316 static int enum_overflow
;
318 /* Parsing a function declarator leaves here a chain of structure
319 and enum types declared in the parmlist. */
321 static tree last_function_parm_tags
;
323 /* Similar, for last_function_parm_tags. */
324 tree last_function_parms
;
325 static tree current_function_parm_tags
;
327 /* A list (chain of TREE_LIST nodes) of all LABEL_DECLs in the function
328 that have names. Here so we can clear out their names' definitions
329 at the end of the function. The TREE_VALUE is a LABEL_DECL; the
330 TREE_PURPOSE is the previous binding of the label. */
332 #define named_labels cp_function_chain->x_named_labels
334 /* The FUNCTION_DECL for the function currently being compiled,
335 or 0 if between functions. */
336 tree current_function_decl
;
338 /* Set to 0 at beginning of a function definition, and whenever
339 a label (case or named) is defined. Set to value of expression
340 returned from function when that value can be transformed into
341 a named return value. */
343 tree current_function_return_value
;
345 /* Nonzero means give `double' the same size as `float'. */
347 extern int flag_short_double
;
349 /* Nonzero means don't recognize any builtin functions. */
351 extern int flag_no_builtin
;
353 /* Nonzero means don't recognize the non-ANSI builtin functions.
356 extern int flag_no_nonansi_builtin
;
358 /* Nonzero means enable obscure ANSI features and disable GNU extensions
359 that might cause ANSI-compliant code to be miscompiled. */
361 extern int flag_ansi
;
363 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
365 extern int flag_huge_objects
;
367 /* Nonzero if we want to conserve space in the .o files. We do this
368 by putting uninitialized data and runtime initialized data into
369 .common instead of .data at the expense of not flagging multiple
371 extern int flag_conserve_space
;
373 /* C and C++ flags are in decl2.c. */
375 /* Flag used when debugging spew.c */
377 extern int spew_debug
;
379 /* A expression of value 0 with the same precision as a sizetype
381 tree signed_size_zero_node
;
383 /* The name of the anonymous namespace, throughout this translation
385 tree anonymous_namespace_name
;
388 /* Allocate a level of searching. */
392 push_decl_level (stack
, obstack
)
393 struct stack_level
*stack
;
394 struct obstack
*obstack
;
396 struct stack_level tem
;
399 return push_stack_level (obstack
, (char *)&tem
, sizeof (tem
));
402 /* For each binding contour we allocate a binding_level structure
403 which records the names defined in that contour.
406 1) one for each function definition,
407 where internal declarations of the parameters appear.
408 2) one for each compound statement,
409 to record its declarations.
411 The current meaning of a name can be found by searching the levels
412 from the current one out to the global one.
414 Off to the side, may be the class_binding_level. This exists only
415 to catch class-local declarations. It is otherwise nonexistent.
417 Also there may be binding levels that catch cleanups that must be
418 run when exceptions occur. Thus, to see whether a name is bound in
419 the current scope, it is not enough to look in the
420 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
423 /* Note that the information in the `names' component of the global contour
424 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
428 /* A chain of _DECL nodes for all variables, constants, functions,
429 and typedef types. These are in the reverse of the order
430 supplied. There may be OVERLOADs on this list, too, but they
431 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
434 /* A list of structure, union and enum definitions, for looking up
436 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
437 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
438 or ENUMERAL_TYPE node.
440 C++: the TREE_VALUE nodes can be simple types for
441 component_bindings. */
444 /* A list of USING_DECL nodes. */
447 /* A list of used namespaces. PURPOSE is the namespace,
448 VALUE the common ancestor with this binding_level's namespace. */
449 tree using_directives
;
451 /* If this binding level is the binding level for a class, then
452 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
453 is the name of an entity bound in the class; the TREE_VALUE is
454 the IDENTIFIER_CLASS_VALUE before we entered the class. Thus,
455 when leaving class scope, we can restore the
456 IDENTIFIER_CLASS_VALUE by walking this list. The TREE_TYPE is
457 the DECL bound by this name in the class. */
460 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
461 is used for all binding levels. */
464 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
465 label in this scope. The TREE_PURPOSE is the previous value of
466 the IDENTIFIER_LABEL VALUE. */
467 tree shadowed_labels
;
469 /* For each level (except not the global one),
470 a chain of BLOCK nodes for all the levels
471 that were entered and exited one level down. */
474 /* The BLOCK node for this level, if one has been preallocated.
475 If 0, the BLOCK is allocated (if needed) when the level is popped. */
478 /* The binding level which this one is contained in (inherits from). */
479 struct binding_level
*level_chain
;
481 /* List of decls in `names' that have incomplete
482 structure or union types. */
485 /* List of VAR_DECLS saved from a previous for statement.
486 These would be dead in ANSI-conforming code, but might
487 be referenced in ARM-era code. These are stored in a
488 TREE_LIST; the TREE_VALUE is the actual declaration. */
489 tree dead_vars_from_for
;
491 /* 1 for the level that holds the parameters of a function.
492 2 for the level that holds a class declaration.
493 3 for levels that hold parameter declarations. */
494 unsigned parm_flag
: 4;
496 /* 1 means make a BLOCK for this level regardless of all else.
497 2 for temporary binding contours created by the compiler. */
500 /* Nonzero if this level "doesn't exist" for tags. */
501 unsigned tag_transparent
: 1;
503 /* Nonzero if this level can safely have additional
504 cleanup-needing variables added to it. */
505 unsigned more_cleanups_ok
: 1;
506 unsigned have_cleanups
: 1;
508 /* Nonzero if this level is for storing the decls for template
509 parameters and generic decls; these decls will be discarded and
510 replaced with a TEMPLATE_DECL. */
511 unsigned pseudo_global
: 1;
513 /* This is set for a namespace binding level. */
514 unsigned namespace_p
: 1;
516 /* True if this level is that of a for-statement where we need to
517 worry about ambiguous (ARM or ANSI) scope rules. */
518 unsigned is_for_scope
: 1;
520 /* True if this level corresponds to an EH region, as for a try block. */
521 unsigned eh_region
: 1;
523 /* One bit left for this word. */
525 #if defined(DEBUG_CP_BINDING_LEVELS)
526 /* Binding depth at which this level began. */
527 unsigned binding_depth
;
528 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
531 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
533 /* The binding level currently in effect. */
535 #define current_binding_level \
537 ? cp_function_chain->bindings \
538 : scope_chain->bindings)
540 /* The binding level of the current class, if any. */
542 #define class_binding_level scope_chain->class_bindings
544 /* A chain of binding_level structures awaiting reuse. */
546 static struct binding_level
*free_binding_level
;
548 /* The outermost binding level, for names of file scope.
549 This is created when the compiler is started and exists
550 through the entire run. */
552 static struct binding_level
*global_binding_level
;
554 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
556 static int keep_next_level_flag
;
558 #if defined(DEBUG_CP_BINDING_LEVELS)
559 static int binding_depth
= 0;
560 static int is_class_level
= 0;
567 for (i
= 0; i
< binding_depth
*2; i
++)
570 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
572 static tree pushdecl_with_scope
PROTO((tree
, struct binding_level
*));
575 push_binding_level (newlevel
, tag_transparent
, keep
)
576 struct binding_level
*newlevel
;
577 int tag_transparent
, keep
;
579 /* Add this level to the front of the chain (stack) of levels that
581 bzero ((char*) newlevel
, sizeof (struct binding_level
));
582 newlevel
->level_chain
= current_binding_level
;
583 current_binding_level
= newlevel
;
584 newlevel
->tag_transparent
= tag_transparent
;
585 newlevel
->more_cleanups_ok
= 1;
587 /* We are called before expand_start_bindings, but after
588 expand_eh_region_start for a try block; so we check this now,
589 before the EH block is covered up. */
590 newlevel
->eh_region
= is_eh_region ();
592 newlevel
->keep
= keep
;
593 #if defined(DEBUG_CP_BINDING_LEVELS)
594 newlevel
->binding_depth
= binding_depth
;
596 fprintf (stderr
, "push %s level 0x%08x line %d\n",
597 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
600 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
603 /* Find the innermost enclosing class scope, and reset
604 CLASS_BINDING_LEVEL appropriately. */
607 find_class_binding_level ()
609 struct binding_level
*level
= current_binding_level
;
611 while (level
&& level
->parm_flag
!= 2)
612 level
= level
->level_chain
;
613 if (level
&& level
->parm_flag
== 2)
614 class_binding_level
= level
;
616 class_binding_level
= 0;
622 if (global_binding_level
)
624 /* Cannot pop a level, if there are none left to pop. */
625 if (current_binding_level
== global_binding_level
)
626 my_friendly_abort (123);
628 /* Pop the current level, and free the structure for reuse. */
629 #if defined(DEBUG_CP_BINDING_LEVELS)
632 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
633 (is_class_level
) ? "class" : "block",
634 current_binding_level
, lineno
);
635 if (is_class_level
!= (current_binding_level
== class_binding_level
))
638 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
641 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
643 register struct binding_level
*level
= current_binding_level
;
644 current_binding_level
= current_binding_level
->level_chain
;
645 level
->level_chain
= free_binding_level
;
646 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
647 if (level
->binding_depth
!= binding_depth
)
649 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
650 free_binding_level
= level
;
651 find_class_binding_level ();
656 suspend_binding_level ()
658 if (class_binding_level
)
659 current_binding_level
= class_binding_level
;
661 if (global_binding_level
)
663 /* Cannot suspend a level, if there are none left to suspend. */
664 if (current_binding_level
== global_binding_level
)
665 my_friendly_abort (123);
667 /* Suspend the current level. */
668 #if defined(DEBUG_CP_BINDING_LEVELS)
671 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
672 (is_class_level
) ? "class" : "block",
673 current_binding_level
, lineno
);
674 if (is_class_level
!= (current_binding_level
== class_binding_level
))
677 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
680 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
681 current_binding_level
= current_binding_level
->level_chain
;
682 find_class_binding_level ();
686 resume_binding_level (b
)
687 struct binding_level
*b
;
689 /* Resuming binding levels is meant only for namespaces,
690 and those cannot nest into classes. */
691 my_friendly_assert(!class_binding_level
, 386);
692 /* Also, resuming a non-directly nested namespace is a no-no. */
693 my_friendly_assert(b
->level_chain
== current_binding_level
, 386);
694 current_binding_level
= b
;
695 #if defined(DEBUG_CP_BINDING_LEVELS)
696 b
->binding_depth
= binding_depth
;
698 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
699 (is_class_level
) ? "class" : "block", b
, lineno
);
702 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
705 /* Create a new `struct binding_level'. */
708 struct binding_level
*
709 make_binding_level ()
712 return (struct binding_level
*) xmalloc (sizeof (struct binding_level
));
715 /* Nonzero if we are currently in the global binding level. */
720 return current_binding_level
== global_binding_level
;
723 /* Return the innermost binding level that is not for a class scope. */
725 static struct binding_level
*
726 innermost_nonclass_level ()
728 struct binding_level
*b
;
730 b
= current_binding_level
;
731 while (b
->parm_flag
== 2)
737 /* Nonzero if we are currently in a toplevel binding level. This
738 means either the global binding level or a namespace in a toplevel
739 binding level. Since there are no non-toplevel namespace levels,
740 this really means any namespace or pseudo-global level. We also
741 include a class whose context is toplevel. */
744 toplevel_bindings_p ()
746 struct binding_level
*b
= innermost_nonclass_level ();
748 return b
->namespace_p
|| b
->pseudo_global
;
751 /* Nonzero if this is a namespace scope, or if we are defining a class
752 which is itself at namespace scope, or whose enclosing class is
753 such a class, etc. */
756 namespace_bindings_p ()
758 struct binding_level
*b
= innermost_nonclass_level ();
760 return b
->namespace_p
;
763 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
764 unconditionally. Otherwise, use the normal logic to decide whether
765 or not to create a BLOCK. */
768 keep_next_level (keep
)
771 keep_next_level_flag
= keep
;
774 /* Nonzero if the current level needs to have a BLOCK made. */
779 return (current_binding_level
->blocks
!= NULL_TREE
780 || current_binding_level
->keep
781 || current_binding_level
->names
!= NULL_TREE
782 || (current_binding_level
->tags
!= NULL_TREE
783 && !current_binding_level
->tag_transparent
));
787 declare_pseudo_global_level ()
789 current_binding_level
->pseudo_global
= 1;
793 declare_namespace_level ()
795 current_binding_level
->namespace_p
= 1;
799 pseudo_global_level_p ()
801 return current_binding_level
->pseudo_global
;
805 set_class_shadows (shadows
)
808 class_binding_level
->class_shadowed
= shadows
;
811 /* Enter a new binding level.
812 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
813 not for that of tags. */
816 pushlevel (tag_transparent
)
819 struct binding_level
*newlevel
;
821 if (current_function
&& !doing_semantic_analysis_p ())
824 /* Reuse or create a struct for this binding level. */
825 #if defined(DEBUG_CP_BINDING_LEVELS)
827 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
828 if (free_binding_level
)
829 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
831 newlevel
= free_binding_level
;
832 free_binding_level
= free_binding_level
->level_chain
;
835 newlevel
= make_binding_level ();
837 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
838 GNU_xref_start_scope ((HOST_WIDE_INT
) newlevel
);
839 keep_next_level_flag
= 0;
843 note_level_for_for ()
845 current_binding_level
->is_for_scope
= 1;
849 pushlevel_temporary (tag_transparent
)
852 pushlevel (tag_transparent
);
853 current_binding_level
->keep
= 2;
856 /* Note we don't call push_momentary() here. Otherwise, it would cause
857 cleanups to be allocated on the momentary obstack, and they will be
858 overwritten by the next statement. */
860 expand_start_bindings (0);
863 /* For a binding between a name and an entity at a block scope,
864 this is the `struct binding_level' for the block. */
865 #define BINDING_LEVEL(NODE) \
866 (((struct tree_binding*)NODE)->scope.level)
868 /* Make DECL the innermost binding for ID. The LEVEL is the binding
869 level at which this declaration is being bound. */
872 push_binding (id
, decl
, level
)
875 struct binding_level
* level
;
879 binding
= make_node (CPLUS_BINDING
);
881 /* Now, fill in the binding information. */
882 BINDING_VALUE (binding
) = decl
;
883 BINDING_TYPE (binding
) = NULL_TREE
;
884 BINDING_LEVEL (binding
) = level
;
885 INHERITED_VALUE_BINDING_P (binding
) = 0;
886 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
887 BINDING_HAS_LEVEL_P (binding
) = 1;
889 /* And put it on the front of the list of bindings for ID. */
890 TREE_CHAIN (binding
) = IDENTIFIER_BINDING (id
);
891 IDENTIFIER_BINDING (id
) = binding
;
894 /* ID is already bound in the current scope. But, DECL is an
895 additional binding for ID in the same scope. This is the `struct
896 stat' hack whereby a non-typedef class-name or enum-name can be
897 bound at the same level as some other kind of entity. It's the
898 responsibility of the caller to check that inserting this name is
899 legal here. Returns nonzero if the new binding was successful. */
901 add_binding (id
, decl
)
905 tree binding
= IDENTIFIER_BINDING (id
);
908 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
909 /* The new name is the type name. */
910 BINDING_TYPE (binding
) = decl
;
911 else if (!BINDING_VALUE (binding
))
912 /* This situation arises when push_class_level_binding moves an
913 inherited type-binding out of the way to make room for a new
915 BINDING_VALUE (binding
) = decl
;
916 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
917 && DECL_ARTIFICIAL (BINDING_VALUE (binding
)))
919 /* The old binding was a type name. It was placed in
920 BINDING_VALUE because it was thought, at the point it was
921 declared, to be the only entity with such a name. Move the
922 type name into the type slot; it is now hidden by the new
924 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
925 BINDING_VALUE (binding
) = decl
;
926 INHERITED_VALUE_BINDING_P (binding
) = 0;
928 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
929 && TREE_CODE (decl
) == TYPE_DECL
930 && DECL_NAME (decl
) == DECL_NAME (BINDING_VALUE (binding
))
931 && same_type_p (TREE_TYPE (decl
),
932 TREE_TYPE (BINDING_VALUE (binding
))))
933 /* We have two typedef-names, both naming the same type to have
934 the same name. This is OK because of:
938 In a given scope, a typedef specifier can be used to redefine
939 the name of any type declared in that scope to refer to the
940 type to which it already refers. */
944 cp_error ("declaration of `%#D'", decl
);
945 cp_error_at ("conflicts with previous declaration `%#D'",
946 BINDING_VALUE (binding
));
953 /* Add DECL to the list of things declared in B. */
956 add_decl_to_level (decl
, b
)
958 struct binding_level
*b
;
960 /* We build up the list in reverse order, and reverse it later if
962 TREE_CHAIN (decl
) = b
->names
;
966 /* Bind DECL to ID in the current_binding_level, assumed to be a local
967 binding level. If PUSH_USING is set in FLAGS, we know that DECL
968 doesn't really belong to this binding level, that it got here
969 through a using-declaration. */
972 push_local_binding (id
, decl
, flags
)
977 struct binding_level
*b
;
979 /* Skip over any local classes. This makes sense if we call
980 push_local_binding with a friend decl of a local class. */
981 b
= current_binding_level
;
982 while (b
->parm_flag
== 2)
985 if (lookup_name_current_level (id
))
987 /* Supplement the existing binding. */
988 if (!add_binding (id
, decl
))
989 /* It didn't work. Something else must be bound at this
990 level. Do not add DECL to the list of things to pop
995 /* Create a new binding. */
996 push_binding (id
, decl
, b
);
998 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
999 /* We must put the OVERLOAD into a TREE_LIST since the
1000 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1001 decls that got here through a using-declaration. */
1002 decl
= build_tree_list (NULL_TREE
, decl
);
1004 /* And put DECL on the list of things declared by the current
1006 add_decl_to_level (decl
, b
);
1009 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
1010 binding was successful. */
1013 push_class_binding (id
, decl
)
1018 tree binding
= IDENTIFIER_BINDING (id
);
1021 /* Note that we declared this value so that we can issue an error if
1022 this an illegal redeclaration of a name already used for some
1024 note_name_declared_in_class (id
, decl
);
1026 if (binding
&& BINDING_LEVEL (binding
) == class_binding_level
)
1027 /* Supplement the existing binding. */
1028 result
= add_binding (id
, decl
);
1030 /* Create a new binding. */
1031 push_binding (id
, decl
, class_binding_level
);
1033 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1034 class-level declaration. Note that we do not use DECL here
1035 because of the possibility of the `struct stat' hack; if DECL is
1036 a class-name or enum-name we might prefer a field-name, or some
1038 IDENTIFIER_CLASS_VALUE (id
) = BINDING_VALUE (IDENTIFIER_BINDING (id
));
1040 /* If this is a binding from a base class, mark it as such. */
1041 binding
= IDENTIFIER_BINDING (id
);
1042 if (BINDING_VALUE (binding
) == decl
&& TREE_CODE (decl
) != TREE_LIST
)
1044 /* Any implicit typename must be from a base-class. The
1045 context for an implicit typename declaration is always
1046 the derived class in which the lookup was done, so the checks
1047 based on the context of DECL below will not trigger. */
1048 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl
))
1049 INHERITED_VALUE_BINDING_P (binding
) = 1;
1052 if (TREE_CODE (decl
) == OVERLOAD
)
1053 context
= DECL_REAL_CONTEXT (OVL_CURRENT (decl
));
1056 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd',
1058 context
= DECL_REAL_CONTEXT (decl
);
1061 if (is_properly_derived_from (current_class_type
, context
))
1062 INHERITED_VALUE_BINDING_P (binding
) = 1;
1064 INHERITED_VALUE_BINDING_P (binding
) = 0;
1067 else if (BINDING_VALUE (binding
) == decl
)
1068 /* We only encounter a TREE_LIST when push_class_decls detects an
1069 ambiguity. Such an ambiguity can be overridden by a definition
1071 INHERITED_VALUE_BINDING_P (binding
) = 1;
1076 /* Remove the binding for DECL which should be the innermost binding
1080 pop_binding (id
, decl
)
1086 if (id
== NULL_TREE
)
1087 /* It's easiest to write the loops that call this function without
1088 checking whether or not the entities involved have names. We
1089 get here for such an entity. */
1092 /* Get the innermost binding for ID. */
1093 binding
= IDENTIFIER_BINDING (id
);
1095 /* The name should be bound. */
1096 my_friendly_assert (binding
!= NULL_TREE
, 0);
1098 /* The DECL will be either the ordinary binding or the type
1099 binding for this identifier. Remove that binding. */
1100 if (BINDING_VALUE (binding
) == decl
)
1101 BINDING_VALUE (binding
) = NULL_TREE
;
1102 else if (BINDING_TYPE (binding
) == decl
)
1103 BINDING_TYPE (binding
) = NULL_TREE
;
1105 my_friendly_abort (0);
1107 if (!BINDING_VALUE (binding
) && !BINDING_TYPE (binding
))
1108 /* We're completely done with the innermost binding for this
1109 identifier. Unhook it from the list of bindings. */
1110 IDENTIFIER_BINDING (id
) = TREE_CHAIN (binding
);
1113 /* When a label goes out of scope, check to see if that label was used
1114 in a valid manner, and issue any appropriate warnings or errors. */
1120 tree label
= TREE_VALUE (link
);
1122 if (!processing_template_decl
&& doing_semantic_analysis_p ())
1124 if (DECL_INITIAL (label
) == NULL_TREE
)
1126 cp_error_at ("label `%D' used but not defined", label
);
1127 /* Avoid crashing later. */
1128 define_label (input_filename
, 1, DECL_NAME (label
));
1130 else if (warn_unused
&& !TREE_USED (label
))
1131 cp_warning_at ("label `%D' defined but not used", label
);
1134 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), TREE_PURPOSE (link
));
1137 /* At the end of a function, all labels declared within the fucntion
1138 go out of scope. BLOCK is the top-level block for the
1147 /* Clear out the definitions of all label names, since their scopes
1149 for (link
= named_labels
; link
; link
= TREE_CHAIN (link
))
1152 /* Put the labels into the "variables" of the top-level block,
1153 so debugger can see them. */
1154 TREE_CHAIN (TREE_VALUE (link
)) = BLOCK_VARS (block
);
1155 BLOCK_VARS (block
) = TREE_VALUE (link
);
1158 named_labels
= NULL_TREE
;
1161 /* Exit a binding level.
1162 Pop the level off, and restore the state of the identifier-decl mappings
1163 that were in effect when this level was entered.
1165 If KEEP == 1, this level had explicit declarations, so
1166 and create a "block" (a BLOCK node) for the level
1167 to record its declarations and subblocks for symbol table output.
1169 If FUNCTIONBODY is nonzero, this level is the body of a function,
1170 so create a block as if KEEP were set and also clear out all
1173 If REVERSE is nonzero, reverse the order of decls before putting
1174 them into the BLOCK. */
1177 poplevel (keep
, reverse
, functionbody
)
1183 /* The chain of decls was accumulated in reverse order.
1184 Put it into forward order, just for cleanliness. */
1186 int tmp
= functionbody
;
1187 int real_functionbody
;
1190 tree block
= NULL_TREE
;
1192 int block_previously_created
;
1193 int leaving_for_scope
;
1195 if (current_function
&& !doing_semantic_analysis_p ())
1198 my_friendly_assert (current_binding_level
->parm_flag
!= 2,
1201 real_functionbody
= (current_binding_level
->keep
== 2
1202 ? ((functionbody
= 0), tmp
) : functionbody
);
1203 tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1204 subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1206 my_friendly_assert (!current_binding_level
->class_shadowed
,
1209 /* We used to use KEEP == 2 to indicate that the new block should go
1210 at the beginning of the list of blocks at this binding level,
1211 rather than the end. This hack is no longer used. */
1212 my_friendly_assert (keep
== 0 || keep
== 1, 0);
1214 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1215 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1216 current_binding_level
->parm_flag
,
1217 current_binding_level
->keep
);
1219 if (current_binding_level
->keep
== 1)
1222 /* Get the decls in the order they were written.
1223 Usually current_binding_level->names is in reverse order.
1224 But parameter decls were previously put in forward order. */
1227 current_binding_level
->names
1228 = decls
= nreverse (current_binding_level
->names
);
1230 decls
= current_binding_level
->names
;
1232 /* Output any nested inline functions within this block
1233 if they weren't already output. */
1235 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1236 if (TREE_CODE (decl
) == FUNCTION_DECL
1237 && ! TREE_ASM_WRITTEN (decl
)
1238 && DECL_INITIAL (decl
) != NULL_TREE
1239 && TREE_ADDRESSABLE (decl
)
1240 && decl_function_context (decl
) == current_function_decl
)
1242 /* If this decl was copied from a file-scope decl
1243 on account of a block-scope extern decl,
1244 propagate TREE_ADDRESSABLE to the file-scope decl. */
1245 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1246 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1249 push_function_context ();
1250 output_inline_function (decl
);
1251 pop_function_context ();
1255 /* If there were any declarations or structure tags in that level,
1256 or if this level is a function body,
1257 create a BLOCK to record them for the life of this function. */
1260 block_previously_created
= (current_binding_level
->this_block
!= NULL_TREE
);
1261 if (block_previously_created
)
1262 block
= current_binding_level
->this_block
;
1263 else if (keep
== 1 || functionbody
)
1264 block
= make_node (BLOCK
);
1265 if (block
!= NULL_TREE
)
1267 if (block_previously_created
)
1269 if (decls
|| tags
|| subblocks
)
1271 if (BLOCK_VARS (block
) || BLOCK_TYPE_TAGS (block
))
1272 warning ("internal compiler error: debugging info corrupted");
1274 BLOCK_VARS (block
) = decls
;
1275 BLOCK_TYPE_TAGS (block
) = tags
;
1277 /* We can have previous subblocks and new subblocks when
1278 doing fixup_gotos with complex cleanups. We chain the new
1279 subblocks onto the end of any pre-existing subblocks. */
1280 BLOCK_SUBBLOCKS (block
) = chainon (BLOCK_SUBBLOCKS (block
),
1283 /* If we created the block earlier on, and we are just
1284 diddling it now, then it already should have a proper
1285 BLOCK_END_NOTE value associated with it. */
1289 BLOCK_VARS (block
) = decls
;
1290 BLOCK_TYPE_TAGS (block
) = tags
;
1291 BLOCK_SUBBLOCKS (block
) = subblocks
;
1292 /* Otherwise, for a new block, install a new BLOCK_END_NOTE
1294 remember_end_note (block
);
1298 /* In each subblock, record that this is its superior. */
1301 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1302 BLOCK_SUPERCONTEXT (link
) = block
;
1304 /* We still support the old for-scope rules, whereby the variables
1305 in a for-init statement were in scope after the for-statement
1306 ended. We only use the new rules in flag_new_for_scope is
1309 = current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1;
1311 /* Remove declarations for all the DECLs in this level. */
1312 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1314 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
)
1317 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link
)));
1321 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
1323 ns_binding
= NULL_TREE
;
1326 && (BINDING_LEVEL (outer_binding
)
1327 == current_binding_level
->level_chain
))
1328 /* We have something like:
1333 and we are leaving the `for' scope. There's no reason to
1334 keep the binding of the inner `i' in this case. */
1335 pop_binding (DECL_NAME (link
), link
);
1336 else if ((outer_binding
1337 && (TREE_CODE (BINDING_VALUE (outer_binding
))
1340 && TREE_CODE (ns_binding
) == TYPE_DECL
))
1341 /* Here, we have something like:
1349 We must pop the for-scope binding so we know what's a
1350 type and what isn't. */
1351 pop_binding (DECL_NAME (link
), link
);
1354 /* Mark this VAR_DECL as dead so that we can tell we left it
1355 there only for backward compatibility. */
1356 DECL_DEAD_FOR_LOCAL (link
) = 1;
1358 /* Keep track of what should of have happenned when we
1359 popped the binding. */
1360 if (outer_binding
&& BINDING_VALUE (outer_binding
))
1361 DECL_SHADOWED_FOR_VAR (link
)
1362 = BINDING_VALUE (outer_binding
);
1364 /* Add it to the list of dead variables in the next
1365 outermost binding to that we can remove these when we
1366 leave that binding. */
1367 current_binding_level
->level_chain
->dead_vars_from_for
1368 = tree_cons (NULL_TREE
, link
,
1369 current_binding_level
->level_chain
->
1370 dead_vars_from_for
);
1372 /* Although we don't pop the CPLUS_BINDING, we do clear
1373 its BINDING_LEVEL since the level is going away now. */
1374 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link
)))
1380 /* Remove the binding. */
1382 if (TREE_CODE (decl
) == TREE_LIST
)
1383 decl
= TREE_VALUE (decl
);
1384 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd')
1385 pop_binding (DECL_NAME (decl
), decl
);
1386 else if (TREE_CODE (decl
) == OVERLOAD
)
1387 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
1389 my_friendly_abort (0);
1393 /* Remove declarations for any `for' variables from inner scopes
1394 that we kept around. */
1395 for (link
= current_binding_level
->dead_vars_from_for
;
1396 link
; link
= TREE_CHAIN (link
))
1397 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
1399 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1400 for (link
= current_binding_level
->type_shadowed
;
1401 link
; link
= TREE_CHAIN (link
))
1402 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1404 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1405 for (link
= current_binding_level
->shadowed_labels
;
1407 link
= TREE_CHAIN (link
))
1410 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1411 list if a `using' declaration put them there. The debugging
1412 back-ends won't understand OVERLOAD, so we remove them here.
1413 Because the BLOCK_VARS are (temporarily) shared with
1414 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1415 popped all the bindings. */
1420 for (d
= &BLOCK_VARS (block
); *d
; )
1422 if (TREE_CODE (*d
) == TREE_LIST
)
1423 *d
= TREE_CHAIN (*d
);
1425 d
= &TREE_CHAIN (*d
);
1429 /* If the level being exited is the top level of a function,
1430 check over all the labels. */
1433 /* Since this is the top level block of a function, the vars are
1434 the function's parameters. Don't leave them in the BLOCK
1435 because they are found in the FUNCTION_DECL instead. */
1436 BLOCK_VARS (block
) = 0;
1440 /* Any uses of undefined labels now operate under constraints
1441 of next binding contour. */
1442 if (current_function
)
1444 struct binding_level
*level_chain
;
1445 level_chain
= current_binding_level
->level_chain
;
1448 struct named_label_list
*labels
;
1449 for (labels
= named_label_uses
; labels
; labels
= labels
->next
)
1450 if (labels
->binding_level
== current_binding_level
)
1452 labels
->binding_level
= level_chain
;
1453 labels
->names_in_scope
= level_chain
->names
;
1458 tmp
= current_binding_level
->keep
;
1460 pop_binding_level ();
1462 DECL_INITIAL (current_function_decl
) = block
;
1465 if (!block_previously_created
)
1466 current_binding_level
->blocks
1467 = chainon (current_binding_level
->blocks
, block
);
1469 /* If we did not make a block for the level just exited,
1470 any blocks made for inner levels
1471 (since they cannot be recorded as subblocks in that level)
1472 must be carried forward so they will later become subblocks
1473 of something else. */
1475 current_binding_level
->blocks
1476 = chainon (current_binding_level
->blocks
, subblocks
);
1478 /* Take care of compiler's internal binding structures. */
1481 expand_end_bindings (getdecls (), keep
, 1);
1482 /* Each and every BLOCK node created here in `poplevel' is important
1483 (e.g. for proper debugging information) so if we created one
1484 earlier, mark it as "used". */
1486 TREE_USED (block
) = 1;
1487 block
= poplevel (keep
, reverse
, real_functionbody
);
1490 /* Each and every BLOCK node created here in `poplevel' is important
1491 (e.g. for proper debugging information) so if we created one
1492 earlier, mark it as "used". */
1494 TREE_USED (block
) = 1;
1498 /* Delete the node BLOCK from the current binding level.
1499 This is used for the block inside a stmt expr ({...})
1500 so that the block can be reinserted where appropriate. */
1503 delete_block (block
)
1507 if (current_binding_level
->blocks
== block
)
1508 current_binding_level
->blocks
= TREE_CHAIN (block
);
1509 for (t
= current_binding_level
->blocks
; t
;)
1511 if (TREE_CHAIN (t
) == block
)
1512 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1516 TREE_CHAIN (block
) = NULL_TREE
;
1517 /* Clear TREE_USED which is always set by poplevel.
1518 The flag is set again if insert_block is called. */
1519 TREE_USED (block
) = 0;
1522 /* Insert BLOCK at the end of the list of subblocks of the
1523 current binding level. This is used when a BIND_EXPR is expanded,
1524 to handle the BLOCK node inside the BIND_EXPR. */
1527 insert_block (block
)
1530 TREE_USED (block
) = 1;
1531 current_binding_level
->blocks
1532 = chainon (current_binding_level
->blocks
, block
);
1535 /* Set the BLOCK node for the innermost scope
1536 (the one we are currently in). */
1540 register tree block
;
1542 current_binding_level
->this_block
= block
;
1545 /* Do a pushlevel for class declarations. */
1550 register struct binding_level
*newlevel
;
1552 /* Reuse or create a struct for this binding level. */
1553 #if defined(DEBUG_CP_BINDING_LEVELS)
1555 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1556 if (free_binding_level
)
1557 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1559 newlevel
= free_binding_level
;
1560 free_binding_level
= free_binding_level
->level_chain
;
1563 newlevel
= make_binding_level ();
1565 #if defined(DEBUG_CP_BINDING_LEVELS)
1567 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1569 push_binding_level (newlevel
, 0, 0);
1571 decl_stack
= push_decl_level (decl_stack
, &decl_obstack
);
1572 class_binding_level
= current_binding_level
;
1573 class_binding_level
->parm_flag
= 2;
1576 /* ...and a poplevel for class declarations. */
1581 register struct binding_level
*level
= class_binding_level
;
1584 my_friendly_assert (level
!= 0, 354);
1586 decl_stack
= pop_stack_level (decl_stack
);
1587 /* If we're leaving a toplevel class, don't bother to do the setting
1588 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1589 shouldn't even be used when current_class_type isn't set, and second,
1590 if we don't touch it here, we're able to use the cache effect if the
1591 next time we're entering a class scope, it is the same class. */
1592 if (current_class_depth
!= 1)
1594 struct binding_level
* b
;
1596 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1597 for (shadowed
= level
->class_shadowed
;
1599 shadowed
= TREE_CHAIN (shadowed
))
1600 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = NULL_TREE
;
1602 /* Find the next enclosing class, and recreate
1603 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1604 b
= level
->level_chain
;
1605 while (b
&& b
->parm_flag
!= 2)
1609 for (shadowed
= b
->class_shadowed
;
1611 shadowed
= TREE_CHAIN (shadowed
))
1615 t
= IDENTIFIER_BINDING (TREE_PURPOSE (shadowed
));
1616 while (t
&& BINDING_LEVEL (t
) != b
)
1620 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
))
1621 = BINDING_VALUE (t
);
1625 /* Remember to save what IDENTIFIER's were bound in this scope so we
1626 can recover from cache misses. */
1628 previous_class_type
= current_class_type
;
1629 previous_class_values
= class_binding_level
->class_shadowed
;
1631 for (shadowed
= level
->type_shadowed
;
1633 shadowed
= TREE_CHAIN (shadowed
))
1634 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1636 /* Remove the bindings for all of the class-level declarations. */
1637 for (shadowed
= level
->class_shadowed
;
1639 shadowed
= TREE_CHAIN (shadowed
))
1640 pop_binding (TREE_PURPOSE (shadowed
), TREE_TYPE (shadowed
));
1642 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1643 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1644 class_binding_level
->parm_flag
,
1645 class_binding_level
->keep
);
1647 /* Now, pop out of the binding level which we created up in the
1648 `pushlevel_class' routine. */
1649 #if defined(DEBUG_CP_BINDING_LEVELS)
1651 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1653 pop_binding_level ();
1656 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1657 for any names in enclosing classes. */
1660 clear_identifier_class_values ()
1664 if (!class_binding_level
)
1667 for (t
= class_binding_level
->class_shadowed
;
1670 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
1673 /* Returns non-zero if T is a virtual function table. */
1676 vtable_decl_p (t
, data
)
1678 void *data ATTRIBUTE_UNUSED
;
1680 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
1683 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1687 vtype_decl_p (t
, data
)
1689 void *data ATTRIBUTE_UNUSED
;
1691 return (TREE_CODE (t
) == TYPE_DECL
1692 && TREE_TYPE (t
) != error_mark_node
1693 && TYPE_LANG_SPECIFIC (TREE_TYPE (t
))
1694 && CLASSTYPE_VSIZE (TREE_TYPE (t
)));
1697 /* Return the declarations that are members of the namespace NS. */
1700 cp_namespace_decls (ns
)
1703 return NAMESPACE_LEVEL (ns
)->names
;
1706 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1707 itself, calling F for each. The DATA is passed to F as well. */
1710 walk_namespaces_r (namespace, f
, data
)
1712 walk_namespaces_fn f
;
1718 result
|= (*f
) (namespace, data
);
1720 for (current
= cp_namespace_decls (namespace);
1722 current
= TREE_CHAIN (current
))
1724 if (TREE_CODE (current
) != NAMESPACE_DECL
1725 || DECL_NAMESPACE_ALIAS (current
))
1727 if (!DECL_LANG_SPECIFIC (current
))
1730 my_friendly_assert (current
== std_node
, 393);
1734 /* We found a namespace. */
1735 result
|= walk_namespaces_r (current
, f
, data
);
1741 /* Walk all the namespaces, calling F for each. The DATA is passed to
1745 walk_namespaces (f
, data
)
1746 walk_namespaces_fn f
;
1749 return walk_namespaces_r (global_namespace
, f
, data
);
1752 struct walk_globals_data
{
1753 walk_globals_pred p
;
1758 /* Walk the global declarations in NAMESPACE. Whenever one is found
1759 for which P returns non-zero, call F with its address. If any call
1760 to F returns a non-zero value, return a non-zero value. */
1763 walk_globals_r (namespace, data
)
1767 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1768 walk_globals_pred p
= wgd
->p
;
1769 walk_globals_fn f
= wgd
->f
;
1770 void *d
= wgd
->data
;
1774 t
= &NAMESPACE_LEVEL (namespace)->names
;
1781 result
|= (*f
) (t
, d
);
1783 /* If F changed *T, then *T still points at the next item to
1786 t
= &TREE_CHAIN (*t
);
1792 /* Walk the global declarations. Whenever one is found for which P
1793 returns non-zero, call F with its address. If any call to F
1794 returns a non-zero value, return a non-zero value. */
1797 walk_globals (p
, f
, data
)
1798 walk_globals_pred p
;
1802 struct walk_globals_data wgd
;
1807 return walk_namespaces (walk_globals_r
, &wgd
);
1810 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1811 DATA is non-NULL, this is the last time we will call
1812 wrapup_global_declarations for this NAMESPACE. */
1815 wrapup_globals_for_namespace (namespace, data
)
1819 tree globals
= cp_namespace_decls (namespace);
1820 int len
= list_length (globals
);
1821 tree
*vec
= (tree
*) alloca (sizeof (tree
) * len
);
1825 int last_time
= (data
!= 0);
1827 if (last_time
&& namespace == global_namespace
)
1828 /* Let compile_file handle the global namespace. */
1831 /* Process the decls in reverse order--earliest first.
1832 Put them into VEC from back to front, then take out from front. */
1834 for (i
= 0, decl
= globals
; i
< len
; i
++, decl
= TREE_CHAIN (decl
))
1835 vec
[len
- i
- 1] = decl
;
1839 check_global_declarations (vec
, len
);
1843 /* Temporarily mark vtables as external. That prevents
1844 wrapup_global_declarations from writing them out; we must process
1845 them ourselves in finish_vtable_vardecl. */
1846 for (i
= 0; i
< len
; ++i
)
1847 if (vtable_decl_p (vec
[i
], /*data=*/0) && !DECL_EXTERNAL (vec
[i
]))
1849 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 1;
1850 DECL_EXTERNAL (vec
[i
]) = 1;
1853 /* Write out any globals that need to be output. */
1854 result
= wrapup_global_declarations (vec
, len
);
1856 /* Undo the hack to DECL_EXTERNAL above. */
1857 for (i
= 0; i
< len
; ++i
)
1858 if (vtable_decl_p (vec
[i
], /*data=*/0)
1859 && DECL_NOT_REALLY_EXTERN (vec
[i
]))
1861 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 0;
1862 DECL_EXTERNAL (vec
[i
]) = 0;
1869 /* Mark ARG (which is really a struct binding_level **) for GC. */
1872 mark_binding_level (arg
)
1875 struct binding_level
*lvl
= *(struct binding_level
**)arg
;
1879 ggc_mark_tree (lvl
->names
);
1880 ggc_mark_tree (lvl
->tags
);
1881 ggc_mark_tree (lvl
->usings
);
1882 ggc_mark_tree (lvl
->using_directives
);
1883 ggc_mark_tree (lvl
->class_shadowed
);
1884 ggc_mark_tree (lvl
->type_shadowed
);
1885 ggc_mark_tree (lvl
->shadowed_labels
);
1886 ggc_mark_tree (lvl
->blocks
);
1887 ggc_mark_tree (lvl
->this_block
);
1888 ggc_mark_tree (lvl
->incomplete
);
1889 ggc_mark_tree (lvl
->dead_vars_from_for
);
1891 lvl
= lvl
->level_chain
;
1895 /* For debugging. */
1896 static int no_print_functions
= 0;
1897 static int no_print_builtins
= 0;
1900 print_binding_level (lvl
)
1901 struct binding_level
*lvl
;
1905 fprintf (stderr
, " blocks=");
1906 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
1907 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
1908 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
1909 if (lvl
->tag_transparent
)
1910 fprintf (stderr
, " tag-transparent");
1911 if (lvl
->more_cleanups_ok
)
1912 fprintf (stderr
, " more-cleanups-ok");
1913 if (lvl
->have_cleanups
)
1914 fprintf (stderr
, " have-cleanups");
1915 fprintf (stderr
, "\n");
1918 fprintf (stderr
, " names:\t");
1919 /* We can probably fit 3 names to a line? */
1920 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
1922 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
1924 if (no_print_builtins
1925 && (TREE_CODE (t
) == TYPE_DECL
)
1926 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
1929 /* Function decls tend to have longer names. */
1930 if (TREE_CODE (t
) == FUNCTION_DECL
)
1937 fprintf (stderr
, "\n\t");
1940 print_node_brief (stderr
, "", t
, 0);
1941 if (t
== error_mark_node
)
1945 fprintf (stderr
, "\n");
1949 fprintf (stderr
, " tags:\t");
1951 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
1953 if (TREE_PURPOSE (t
) == NULL_TREE
)
1955 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
1962 fprintf (stderr
, "\n\t");
1965 if (TREE_PURPOSE (t
) == NULL_TREE
)
1967 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
1968 fprintf (stderr
, ">");
1970 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
1971 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
1974 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
1975 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
1976 fprintf (stderr
, ">");
1980 fprintf (stderr
, "\n");
1982 if (lvl
->class_shadowed
)
1984 fprintf (stderr
, " class-shadowed:");
1985 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
1987 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1989 fprintf (stderr
, "\n");
1991 if (lvl
->type_shadowed
)
1993 fprintf (stderr
, " type-shadowed:");
1994 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
1996 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1998 fprintf (stderr
, "\n");
2003 print_other_binding_stack (stack
)
2004 struct binding_level
*stack
;
2006 struct binding_level
*level
;
2007 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
2009 fprintf (stderr
, "binding level ");
2010 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
2011 fprintf (stderr
, "\n");
2012 print_binding_level (level
);
2017 print_binding_stack ()
2019 struct binding_level
*b
;
2020 fprintf (stderr
, "current_binding_level=");
2021 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
2022 fprintf (stderr
, "\nclass_binding_level=");
2023 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
2024 fprintf (stderr
, "\nglobal_binding_level=");
2025 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
2026 fprintf (stderr
, "\n");
2027 if (class_binding_level
)
2029 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
2030 if (b
== current_binding_level
)
2033 b
= class_binding_level
;
2035 b
= current_binding_level
;
2038 b
= current_binding_level
;
2039 print_other_binding_stack (b
);
2040 fprintf (stderr
, "global:\n");
2041 print_binding_level (global_binding_level
);
2044 /* Namespace binding access routines: The namespace_bindings field of
2045 the identifier is polymorphic, with three possible values:
2046 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2047 indicating the BINDING_VALUE of global_namespace. */
2049 /* Check whether the a binding for the name to scope is known.
2050 Assumes that the bindings of the name are already a list
2051 of bindings. Returns the binding found, or NULL_TREE. */
2054 find_binding (name
, scope
)
2058 tree iter
, prev
= NULL_TREE
;
2060 scope
= ORIGINAL_NAMESPACE (scope
);
2062 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
2063 iter
= TREE_CHAIN (iter
))
2065 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
2066 if (BINDING_SCOPE (iter
) == scope
)
2068 /* Move binding found to the front of the list, so
2069 subsequent lookups will find it faster. */
2072 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
2073 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
2074 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
2083 /* Always returns a binding for name in scope. If the
2084 namespace_bindings is not a list, convert it to one first.
2085 If no binding is found, make a new one. */
2088 binding_for_name (name
, scope
)
2092 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2095 scope
= ORIGINAL_NAMESPACE (scope
);
2097 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
2099 /* Get rid of optimization for global scope. */
2100 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
2101 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
2102 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2104 if (b
&& (result
= find_binding (name
, scope
)))
2106 /* Not found, make a new permanent one. */
2107 push_obstacks (&permanent_obstack
, &permanent_obstack
);
2108 result
= make_node (CPLUS_BINDING
);
2109 TREE_CHAIN (result
) = b
;
2110 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2111 BINDING_SCOPE (result
) = scope
;
2112 BINDING_TYPE (result
) = NULL_TREE
;
2113 BINDING_VALUE (result
) = NULL_TREE
;
2118 /* Return the binding value for name in scope, considering that
2119 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2122 namespace_binding (name
, scope
)
2126 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2129 if (scope
== NULL_TREE
)
2130 scope
= global_namespace
;
2131 if (TREE_CODE (b
) != CPLUS_BINDING
)
2132 return (scope
== global_namespace
) ? b
: NULL_TREE
;
2133 name
= find_binding (name
,scope
);
2134 if (name
== NULL_TREE
)
2136 return BINDING_VALUE (name
);
2139 /* Set the binding value for name in scope. If modifying the binding
2140 of global_namespace is attempted, try to optimize it. */
2143 set_namespace_binding (name
, scope
, val
)
2150 if (scope
== NULL_TREE
)
2151 scope
= global_namespace
;
2153 if (scope
== global_namespace
)
2155 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2156 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
2158 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
2162 b
= binding_for_name (name
, scope
);
2163 BINDING_VALUE (b
) = val
;
2166 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2167 select a name that is unique to this compilation unit. */
2170 push_namespace (name
)
2175 int implicit_use
= 0;
2177 if (!global_namespace
)
2179 /* This must be ::. */
2180 my_friendly_assert (name
== get_identifier ("::"), 377);
2185 /* The name of anonymous namespace is unique for the translation
2187 if (!anonymous_namespace_name
)
2188 anonymous_namespace_name
= get_file_function_name ('N');
2189 name
= anonymous_namespace_name
;
2190 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2192 /* Reopening anonymous namespace. */
2196 else if (current_namespace
== global_namespace
2197 && name
== DECL_NAME (std_node
))
2204 /* Check whether this is an extended namespace definition. */
2205 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2206 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
2209 if (DECL_NAMESPACE_ALIAS (d
))
2211 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2212 d
, DECL_NAMESPACE_ALIAS (d
));
2213 d
= DECL_NAMESPACE_ALIAS (d
);
2220 /* Make a new namespace, binding the name to it. */
2221 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
2222 /* The global namespace is not pushed, and the global binding
2223 level is set elsewhere. */
2228 declare_namespace_level ();
2229 NAMESPACE_LEVEL (d
) = current_binding_level
;
2233 resume_binding_level (NAMESPACE_LEVEL (d
));
2236 do_using_directive (d
);
2237 /* Enter the name space. */
2238 current_namespace
= d
;
2241 /* Pop from the scope of the current namespace. */
2246 if (current_namespace
== global_namespace
)
2248 my_friendly_assert (in_std
>0, 980421);
2252 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
2253 /* The binding level is not popped, as it might be re-opened later. */
2254 suspend_binding_level ();
2257 /* Push into the scope of the namespace NS, even if it is deeply
2258 nested within another namespace. */
2261 push_nested_namespace (ns
)
2264 if (ns
== global_namespace
)
2265 push_to_top_level ();
2268 push_nested_namespace (CP_DECL_CONTEXT (ns
));
2269 push_namespace (DECL_NAME (ns
));
2273 /* Pop back from the scope of the namespace NS, which was previously
2274 entered with push_nested_namespace. */
2277 pop_nested_namespace (ns
)
2280 while (ns
!= global_namespace
)
2283 ns
= CP_DECL_CONTEXT (ns
);
2286 pop_from_top_level ();
2290 /* Subroutines for reverting temporarily to top-level for instantiation
2291 of templates and such. We actually need to clear out the class- and
2292 local-value slots of all identifiers, so that only the global values
2293 are at all visible. Simply setting current_binding_level to the global
2294 scope isn't enough, because more binding levels may be pushed. */
2295 struct saved_scope
*scope_chain
;
2297 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2300 mark_saved_scope (arg
)
2303 struct saved_scope
*t
= *(struct saved_scope
**)arg
;
2306 mark_binding_level (&t
->class_bindings
);
2307 ggc_mark_tree (t
->old_bindings
);
2308 ggc_mark_tree (t
->old_namespace
);
2309 ggc_mark_tree (t
->class_name
);
2310 ggc_mark_tree (t
->class_type
);
2311 ggc_mark_tree (t
->access_specifier
);
2312 ggc_mark_tree (t
->function_decl
);
2314 ggc_mark_tree_varray (t
->lang_base
);
2315 ggc_mark_tree (t
->lang_name
);
2316 ggc_mark_tree (t
->x_function_parms
);
2317 ggc_mark_tree (t
->template_parms
);
2318 ggc_mark_tree (t
->x_previous_class_type
);
2319 ggc_mark_tree (t
->x_previous_class_values
);
2320 mark_binding_level (&t
->bindings
);
2326 store_bindings (names
, old_bindings
)
2327 tree names
, old_bindings
;
2330 for (t
= names
; t
; t
= TREE_CHAIN (t
))
2332 tree binding
, t1
, id
;
2334 if (TREE_CODE (t
) == TREE_LIST
)
2335 id
= TREE_PURPOSE (t
);
2340 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2341 we have no IDENTIFIER_BINDING if we have left the class
2342 scope, but cached the class-level declarations. */
2343 || !(IDENTIFIER_BINDING (id
) || IDENTIFIER_CLASS_VALUE (id
)))
2346 for (t1
= old_bindings
; t1
; t1
= TREE_CHAIN (t1
))
2347 if (TREE_VEC_ELT (t1
, 0) == id
)
2350 binding
= make_tree_vec (4);
2354 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
2355 TREE_VEC_ELT (binding
, 0) = id
;
2356 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
2357 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_BINDING (id
);
2358 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
2359 IDENTIFIER_BINDING (id
) = NULL_TREE
;
2360 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
2362 TREE_CHAIN (binding
) = old_bindings
;
2363 old_bindings
= binding
;
2367 return old_bindings
;
2371 maybe_push_to_top_level (pseudo
)
2374 struct saved_scope
*s
;
2375 struct binding_level
*b
;
2379 s
= (struct saved_scope
*) xcalloc (1, sizeof (struct saved_scope
));
2381 b
= scope_chain
? current_binding_level
: 0;
2383 /* If we're in the middle of some function, save our state. */
2384 if (current_function
)
2387 push_function_context_to (NULL_TREE
);
2392 old_bindings
= NULL_TREE
;
2393 if (scope_chain
&& previous_class_type
)
2394 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
2396 /* Have to include global_binding_level, because class-level decls
2397 aren't listed anywhere useful. */
2398 for (; b
; b
= b
->level_chain
)
2402 /* Template IDs are inserted into the global level. If they were
2403 inserted into namespace level, finish_file wouldn't find them
2404 when doing pending instantiations. Therefore, don't stop at
2405 namespace level, but continue until :: . */
2406 if (b
== global_binding_level
|| (pseudo
&& b
->pseudo_global
))
2409 old_bindings
= store_bindings (b
->names
, old_bindings
);
2410 /* We also need to check class_shadowed to save class-level type
2411 bindings, since pushclass doesn't fill in b->names. */
2412 if (b
->parm_flag
== 2)
2413 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2415 /* Unwind type-value slots back to top level. */
2416 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2417 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2419 s
->prev
= scope_chain
;
2420 s
->old_bindings
= old_bindings
;
2422 s
->need_pop_function_context
= need_pop
;
2423 s
->function_decl
= current_function_decl
;
2426 current_function_decl
= NULL_TREE
;
2427 VARRAY_TREE_INIT (current_lang_base
, 10, "current_lang_base");
2428 current_lang_stack
= &VARRAY_TREE (current_lang_base
, 0);
2429 current_lang_name
= lang_name_cplusplus
;
2430 strict_prototype
= strict_prototypes_lang_cplusplus
;
2431 current_namespace
= global_namespace
;
2433 push_obstacks (&permanent_obstack
, &permanent_obstack
);
2437 push_to_top_level ()
2439 maybe_push_to_top_level (0);
2443 pop_from_top_level ()
2445 struct saved_scope
*s
= scope_chain
;
2448 /* Clear out class-level bindings cache. */
2449 if (previous_class_type
)
2450 invalidate_class_lookup_cache ();
2454 VARRAY_FREE (current_lang_base
);
2456 scope_chain
= s
->prev
;
2457 for (t
= s
->old_bindings
; t
; t
= TREE_CHAIN (t
))
2459 tree id
= TREE_VEC_ELT (t
, 0);
2462 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2463 IDENTIFIER_BINDING (id
) = TREE_VEC_ELT (t
, 2);
2464 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2468 if (current_lang_name
== lang_name_cplusplus
)
2469 strict_prototype
= strict_prototypes_lang_cplusplus
;
2470 else if (current_lang_name
== lang_name_c
)
2471 strict_prototype
= strict_prototypes_lang_c
;
2473 /* If we were in the middle of compiling a function, restore our
2475 if (s
->need_pop_function_context
)
2476 pop_function_context_from (NULL_TREE
);
2477 current_function_decl
= s
->function_decl
;
2482 /* Push a definition of struct, union or enum tag "name".
2483 into binding_level "b". "type" should be the type node,
2484 We assume that the tag "name" is not already defined.
2486 Note that the definition may really be just a forward reference.
2487 In that case, the TYPE_SIZE will be a NULL_TREE.
2489 C++ gratuitously puts all these tags in the name space. */
2491 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2492 record the shadowed value for this binding contour. TYPE is
2493 the type that ID maps to. */
2496 set_identifier_type_value_with_scope (id
, type
, b
)
2499 struct binding_level
*b
;
2501 if (!b
->namespace_p
)
2503 /* Shadow the marker, not the real thing, so that the marker
2504 gets restored later. */
2505 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2507 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2511 tree binding
= binding_for_name (id
, current_namespace
);
2512 BINDING_TYPE (binding
) = type
;
2513 /* Store marker instead of real type. */
2514 type
= global_type_node
;
2516 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2519 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2522 set_identifier_type_value (id
, type
)
2526 set_identifier_type_value_with_scope (id
, type
, current_binding_level
);
2529 /* Return the type associated with id. */
2532 identifier_type_value (id
)
2535 /* There is no type with that name, anywhere. */
2536 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2538 /* This is not the type marker, but the real thing. */
2539 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2540 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2541 /* Have to search for it. It must be on the global level, now.
2542 Ask lookup_name not to return non-types. */
2543 id
= lookup_name_real (id
, 2, 1, 0);
2545 return TREE_TYPE (id
);
2549 /* Pop off extraneous binding levels left over due to syntax errors.
2551 We don't pop past namespaces, as they might be valid. */
2556 #ifdef DEBUG_CP_BINDING_LEVELS
2557 fprintf (stderr
, "XXX entering pop_everything ()\n");
2559 while (!toplevel_bindings_p ())
2561 if (current_binding_level
->parm_flag
== 2)
2562 pop_nested_class ();
2566 #ifdef DEBUG_CP_BINDING_LEVELS
2567 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2571 /* The type TYPE is being declared. If it is a class template, or a
2572 specialization of a class template, do any processing required and
2573 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2574 being declared a friend. B is the binding level at which this TYPE
2577 Returns the TYPE_DECL for TYPE, which may have been altered by this
2581 maybe_process_template_type_declaration (type
, globalize
, b
)
2584 struct binding_level
* b
;
2586 tree decl
= TYPE_NAME (type
);
2588 if (processing_template_parmlist
)
2589 /* You can't declare a new template type in a template parameter
2590 list. But, you can declare a non-template type:
2592 template <class A*> struct S;
2594 is a forward-declaration of `A'. */
2598 maybe_check_template_type (type
);
2600 my_friendly_assert (IS_AGGR_TYPE (type
)
2601 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2604 if (processing_template_decl
)
2606 /* This may change after the call to
2607 push_template_decl_real, but we want the original value. */
2608 tree name
= DECL_NAME (decl
);
2610 decl
= push_template_decl_real (decl
, globalize
);
2611 /* If the current binding level is the binding level for the
2612 template parameters (see the comment in
2613 begin_template_parm_list) and the enclosing level is a class
2614 scope, and we're not looking at a friend, push the
2615 declaration of the member class into the class scope. In the
2616 friend case, push_template_decl will already have put the
2617 friend into global scope, if appropriate. */
2618 if (TREE_CODE (type
) != ENUMERAL_TYPE
2619 && !globalize
&& b
->pseudo_global
2620 && b
->level_chain
->parm_flag
== 2)
2622 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2623 /* Put this tag on the list of tags for the class, since
2624 that won't happen below because B is not the class
2625 binding level, but is instead the pseudo-global level. */
2626 b
->level_chain
->tags
=
2627 tree_cons (name
, type
, b
->level_chain
->tags
);
2628 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2629 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2637 /* In C++, you don't have to write `struct S' to refer to `S'; you
2638 can just use `S'. We accomplish this by creating a TYPE_DECL as
2639 if the user had written `typedef struct S S'. Create and return
2640 the TYPE_DECL for TYPE. */
2643 create_implicit_typedef (name
, type
)
2649 decl
= build_decl (TYPE_DECL
, name
, type
);
2650 SET_DECL_ARTIFICIAL (decl
);
2651 /* There are other implicit type declarations, like the one *within*
2652 a class that allows you to write `S::S'. We must distinguish
2654 SET_DECL_IMPLICIT_TYPEDEF_P (decl
);
2655 TYPE_NAME (type
) = decl
;
2660 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2661 Normally put it into the inner-most non-tag-transparent scope,
2662 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2663 The latter is needed for implicit declarations. */
2666 pushtag (name
, type
, globalize
)
2670 register struct binding_level
*b
;
2672 b
= current_binding_level
;
2673 while (b
->tag_transparent
2674 || (globalize
&& b
->parm_flag
== 2))
2677 b
->tags
= tree_cons (name
, type
, b
->tags
);
2681 /* Do C++ gratuitous typedefing. */
2682 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2684 register tree d
= NULL_TREE
;
2686 tree context
= TYPE_CONTEXT (type
);
2690 tree cs
= current_scope ();
2694 else if (cs
!= NULL_TREE
2695 && TREE_CODE_CLASS (TREE_CODE (cs
)) == 't')
2696 /* When declaring a friend class of a local class, we want
2697 to inject the newly named class into the scope
2698 containing the local class, not the namespace scope. */
2699 context
= hack_decl_function_context (get_type_decl (cs
));
2702 context
= current_namespace
;
2704 if ((b
->pseudo_global
&& b
->level_chain
->parm_flag
== 2)
2705 || b
->parm_flag
== 2)
2708 if (current_lang_name
== lang_name_java
)
2709 TYPE_FOR_JAVA (type
) = 1;
2711 d
= create_implicit_typedef (name
, type
);
2712 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2714 set_identifier_type_value_with_scope (name
, type
, b
);
2716 d
= maybe_process_template_type_declaration (type
,
2719 if (b
->parm_flag
== 2)
2721 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2722 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2723 class. But if it's a member template class, we
2724 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2726 finish_member_declaration (d
);
2728 pushdecl_class_level (d
);
2731 d
= pushdecl_with_scope (d
, b
);
2733 if (ANON_AGGRNAME_P (name
))
2734 DECL_IGNORED_P (d
) = 1;
2736 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2737 DECL_ASSEMBLER_NAME (d
) = DECL_NAME (d
);
2738 if (!uses_template_parms (type
))
2739 DECL_ASSEMBLER_NAME (d
)
2740 = get_identifier (build_overload_name (type
, 1, 1));
2742 if (b
->parm_flag
== 2)
2744 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2745 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2749 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2750 /* Use the canonical TYPE_DECL for this node. */
2751 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2754 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2755 will be the tagged type we just added to the current
2756 binding level. This fake NULL-named TYPE_DECL node helps
2757 dwarfout.c to know when it needs to output a
2758 representation of a tagged type, and it also gives us a
2759 convenient place to record the "scope start" address for
2762 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2763 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2767 /* Counter used to create anonymous type names. */
2769 static int anon_cnt
= 0;
2771 /* Return an IDENTIFIER which can be used as a name for
2772 anonymous structs and unions. */
2779 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2780 return get_identifier (buf
);
2783 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2784 This keeps dbxout from getting confused. */
2789 register struct binding_level
*b
;
2791 static int last_cnt
= 0;
2793 /* Fast out if no new anon names were declared. */
2794 if (last_cnt
== anon_cnt
)
2797 b
= current_binding_level
;
2798 while (b
->tag_transparent
)
2803 /* A NULL purpose means we have already processed all tags
2804 from here to the end of the list. */
2805 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2807 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2808 TREE_PURPOSE (tags
) = NULL_TREE
;
2809 tags
= TREE_CHAIN (tags
);
2811 last_cnt
= anon_cnt
;
2814 /* Subroutine of duplicate_decls: return truthvalue of whether
2815 or not types of these decls match.
2817 For C++, we must compare the parameter list so that `int' can match
2818 `int&' in a parameter position, but `int&' is not confused with
2822 decls_match (newdecl
, olddecl
)
2823 tree newdecl
, olddecl
;
2827 if (newdecl
== olddecl
)
2830 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
2831 /* If the two DECLs are not even the same kind of thing, we're not
2832 interested in their types. */
2835 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2837 tree f1
= TREE_TYPE (newdecl
);
2838 tree f2
= TREE_TYPE (olddecl
);
2839 tree p1
= TYPE_ARG_TYPES (f1
);
2840 tree p2
= TYPE_ARG_TYPES (f2
);
2842 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
)
2843 && ! (DECL_LANGUAGE (newdecl
) == lang_c
2844 && DECL_LANGUAGE (olddecl
) == lang_c
))
2847 /* When we parse a static member function definition,
2848 we put together a FUNCTION_DECL which thinks its type
2849 is METHOD_TYPE. Change that to FUNCTION_TYPE, and
2851 if (TREE_CODE (f1
) == METHOD_TYPE
&& DECL_STATIC_FUNCTION_P (olddecl
))
2852 revert_static_member_fn (&newdecl
, &f1
, &p1
);
2853 else if (TREE_CODE (f2
) == METHOD_TYPE
2854 && DECL_STATIC_FUNCTION_P (newdecl
))
2855 revert_static_member_fn (&olddecl
, &f2
, &p2
);
2857 /* Here we must take care of the case where new default
2858 parameters are specified. Also, warn if an old
2859 declaration becomes ambiguous because default
2860 parameters may cause the two to be ambiguous. */
2861 if (TREE_CODE (f1
) != TREE_CODE (f2
))
2863 if (TREE_CODE (f1
) == OFFSET_TYPE
)
2864 cp_compiler_error ("`%D' redeclared as member function", newdecl
);
2866 cp_compiler_error ("`%D' redeclared as non-member function", newdecl
);
2870 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
2872 if (! strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
) == lang_c
2875 types_match
= self_promoting_args_p (p1
);
2876 if (p1
== void_list_node
)
2877 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2879 else if (!strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
)==lang_c
2880 && DECL_LANGUAGE (newdecl
) == lang_c
&& p1
== NULL_TREE
)
2882 types_match
= self_promoting_args_p (p2
);
2883 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2886 types_match
= compparms (p1
, p2
);
2891 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2893 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
2894 DECL_TEMPLATE_PARMS (olddecl
)))
2897 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
2900 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
2901 DECL_TEMPLATE_RESULT (newdecl
));
2905 if (TREE_TYPE (newdecl
) == error_mark_node
)
2906 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
2907 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
2908 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
2909 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
2912 types_match
= comptypes (TREE_TYPE (newdecl
),
2913 TREE_TYPE (olddecl
),
2914 COMPARE_REDECLARATION
);
2920 /* If NEWDECL is `static' and an `extern' was seen previously,
2921 warn about it. OLDDECL is the previous declaration.
2923 Note that this does not apply to the C++ case of declaring
2924 a variable `extern const' and then later `const'.
2926 Don't complain about built-in functions, since they are beyond
2927 the user's control. */
2930 warn_extern_redeclared_static (newdecl
, olddecl
)
2931 tree newdecl
, olddecl
;
2933 static const char *explicit_extern_static_warning
2934 = "`%D' was declared `extern' and later `static'";
2935 static const char *implicit_extern_static_warning
2936 = "`%D' was declared implicitly `extern' and later `static'";
2940 if (TREE_CODE (newdecl
) == TYPE_DECL
)
2943 /* Don't get confused by static member functions; that's a different
2945 if (TREE_CODE (newdecl
) == FUNCTION_DECL
2946 && DECL_STATIC_FUNCTION_P (newdecl
))
2949 /* If the old declaration was `static', or the new one isn't, then
2950 then everything is OK. */
2951 if (DECL_THIS_STATIC (olddecl
) || !DECL_THIS_STATIC (newdecl
))
2954 /* It's OK to declare a builtin function as `static'. */
2955 if (TREE_CODE (olddecl
) == FUNCTION_DECL
2956 && DECL_ARTIFICIAL (olddecl
))
2959 name
= DECL_ASSEMBLER_NAME (newdecl
);
2960 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
2961 ? implicit_extern_static_warning
2962 : explicit_extern_static_warning
, newdecl
);
2963 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
2966 /* Handle when a new declaration NEWDECL has the same name as an old
2967 one OLDDECL in the same binding contour. Prints an error message
2970 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
2971 Otherwise, return 0. */
2974 duplicate_decls (newdecl
, olddecl
)
2975 tree newdecl
, olddecl
;
2977 unsigned olddecl_uid
= DECL_UID (olddecl
);
2978 int olddecl_friend
= 0, types_match
= 0;
2979 int new_defines_function
= 0;
2981 if (newdecl
== olddecl
)
2984 types_match
= decls_match (newdecl
, olddecl
);
2986 /* If either the type of the new decl or the type of the old decl is an
2987 error_mark_node, then that implies that we have already issued an
2988 error (earlier) for some bogus type specification, and in that case,
2989 it is rather pointless to harass the user with yet more error message
2990 about the same declaration, so just pretend the types match here. */
2991 if (TREE_TYPE (newdecl
) == error_mark_node
2992 || TREE_TYPE (olddecl
) == error_mark_node
)
2995 /* Check for redeclaration and other discrepancies. */
2996 if (TREE_CODE (olddecl
) == FUNCTION_DECL
2997 && DECL_ARTIFICIAL (olddecl
))
2999 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
3001 /* If you declare a built-in or predefined function name as static,
3002 the old definition is overridden, but optionally warn this was a
3003 bad choice of name. */
3004 if (! TREE_PUBLIC (newdecl
))
3007 cp_warning ("shadowing %s function `%#D'",
3008 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3010 /* Discard the old built-in function. */
3013 /* If the built-in is not ansi, then programs can override
3014 it even globally without an error. */
3015 else if (! DECL_BUILT_IN (olddecl
))
3016 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
3020 cp_error ("declaration of `%#D'", newdecl
);
3021 cp_error ("conflicts with built-in declaration `%#D'",
3026 else if (!types_match
)
3028 if ((DECL_LANGUAGE (newdecl
) == lang_c
3029 && DECL_LANGUAGE (olddecl
) == lang_c
)
3030 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3031 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3033 /* A near match; override the builtin. */
3035 if (TREE_PUBLIC (newdecl
))
3037 cp_warning ("new declaration `%#D'", newdecl
);
3038 cp_warning ("ambiguates built-in declaration `%#D'",
3041 else if (warn_shadow
)
3042 cp_warning ("shadowing %s function `%#D'",
3043 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3047 /* Discard the old built-in function. */
3051 if (DECL_THIS_STATIC (newdecl
) && !DECL_THIS_STATIC (olddecl
))
3053 /* If a builtin function is redeclared as `static', merge
3054 the declarations, but make the original one static. */
3055 DECL_THIS_STATIC (olddecl
) = 1;
3056 TREE_PUBLIC (olddecl
) = 0;
3058 /* Make the olddeclaration consistent with the new one so that
3059 all remnants of the builtin-ness of this function will be
3061 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3062 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3063 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3064 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (newdecl
),
3068 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3070 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3071 && TREE_CODE (newdecl
) != TYPE_DECL
3072 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3073 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3074 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3075 && TREE_CODE (olddecl
) != TYPE_DECL
3076 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3077 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3080 /* We do nothing special here, because C++ does such nasty
3081 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3082 get shadowed, and know that if we need to find a TYPE_DECL
3083 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3084 slot of the identifier. */
3088 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3089 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3090 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3091 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3094 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
3095 if (TREE_CODE (olddecl
) == TREE_LIST
)
3096 olddecl
= TREE_VALUE (olddecl
);
3097 cp_error_at ("previous declaration of `%#D'", olddecl
);
3099 /* New decl is completely inconsistent with the old one =>
3100 tell caller to replace the old one. */
3104 else if (!types_match
)
3106 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
))
3107 /* These are certainly not duplicate declarations; they're
3108 from different scopes. */
3111 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3113 /* The name of a class template may not be declared to refer to
3114 any other template, class, function, object, namespace, value,
3115 or type in the same scope. */
3116 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3117 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3119 cp_error ("declaration of template `%#D'", newdecl
);
3120 cp_error_at ("conflicts with previous declaration `%#D'",
3123 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3124 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3125 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3126 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3127 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3128 DECL_TEMPLATE_PARMS (olddecl
)))
3130 cp_error ("new declaration `%#D'", newdecl
);
3131 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3135 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3137 if (DECL_LANGUAGE (newdecl
) == lang_c
3138 && DECL_LANGUAGE (olddecl
) == lang_c
)
3140 cp_error ("declaration of C function `%#D' conflicts with",
3142 cp_error_at ("previous declaration `%#D' here", olddecl
);
3144 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3145 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3147 cp_error ("new declaration `%#D'", newdecl
);
3148 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3154 /* Already complained about this, so don't do so again. */
3155 else if (current_class_type
== NULL_TREE
3156 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3158 cp_error ("conflicting types for `%#D'", newdecl
);
3159 cp_error_at ("previous declaration as `%#D'", olddecl
);
3162 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3163 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3164 && (!DECL_TEMPLATE_INFO (newdecl
)
3165 || (DECL_TI_TEMPLATE (newdecl
)
3166 != DECL_TI_TEMPLATE (olddecl
))))
3167 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3168 && (!DECL_TEMPLATE_INFO (olddecl
)
3169 || (DECL_TI_TEMPLATE (olddecl
)
3170 != DECL_TI_TEMPLATE (newdecl
))))))
3171 /* It's OK to have a template specialization and a non-template
3172 with the same type, or to have specializations of two
3173 different templates with the same type. Note that if one is a
3174 specialization, and the other is an instantiation of the same
3175 template, that we do not exit at this point. That situation
3176 can occur if we instantiate a template class, and then
3177 specialize one of its methods. This situation is legal, but
3178 the declarations must be merged in the usual way. */
3180 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3181 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3182 && !DECL_USE_TEMPLATE (newdecl
))
3183 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3184 && !DECL_USE_TEMPLATE (olddecl
))))
3185 /* One of the declarations is a template instantiation, and the
3186 other is not a template at all. That's OK. */
3188 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3189 && DECL_NAMESPACE_ALIAS (newdecl
)
3190 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3191 /* Redeclaration of namespace alias, ignore it. */
3195 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3198 cp_error (errmsg
, newdecl
);
3199 if (DECL_NAME (olddecl
) != NULL_TREE
)
3200 cp_error_at ((DECL_INITIAL (olddecl
)
3201 && namespace_bindings_p ())
3202 ? "`%#D' previously defined here"
3203 : "`%#D' previously declared here", olddecl
);
3205 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3206 && DECL_INITIAL (olddecl
) != NULL_TREE
3207 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3208 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3210 /* Prototype decl follows defn w/o prototype. */
3211 cp_warning_at ("prototype for `%#D'", newdecl
);
3212 cp_warning_at ("follows non-prototype definition here", olddecl
);
3214 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3215 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3217 /* extern "C" int foo ();
3218 int foo () { bar (); }
3220 if (current_lang_stack
3221 == &VARRAY_TREE (current_lang_base
, 0))
3222 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3225 cp_error_at ("previous declaration of `%#D' with %L linkage",
3226 olddecl
, DECL_LANGUAGE (olddecl
));
3227 cp_error ("conflicts with new declaration with %L linkage",
3228 DECL_LANGUAGE (newdecl
));
3232 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3234 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3236 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3237 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3240 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3241 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3243 for (; t1
&& t1
!= void_list_node
;
3244 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3245 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3247 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3252 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3254 cp_pedwarn_at ("after previous specification in `%#D'",
3260 cp_error ("default argument given for parameter %d of `%#D'",
3262 cp_error_at ("after previous specification in `%#D'",
3267 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
3268 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3270 cp_warning ("`%#D' was used before it was declared inline",
3272 cp_warning_at ("previous non-inline declaration here",
3278 /* If new decl is `static' and an `extern' was seen previously,
3280 warn_extern_redeclared_static (newdecl
, olddecl
);
3282 /* We have committed to returning 1 at this point. */
3283 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3285 /* Now that functions must hold information normally held
3286 by field decls, there is extra work to do so that
3287 declaration information does not get destroyed during
3289 if (DECL_VINDEX (olddecl
))
3290 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3291 if (DECL_CONTEXT (olddecl
))
3292 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3293 if (DECL_CLASS_CONTEXT (olddecl
))
3294 DECL_CLASS_CONTEXT (newdecl
) = DECL_CLASS_CONTEXT (olddecl
);
3295 if (DECL_PENDING_INLINE_INFO (newdecl
) == (struct pending_inline
*)0)
3296 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3297 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3298 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3299 DECL_ABSTRACT_VIRTUAL_P (newdecl
) |= DECL_ABSTRACT_VIRTUAL_P (olddecl
);
3300 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3301 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3302 DECL_THIS_STATIC (newdecl
) |= DECL_THIS_STATIC (olddecl
);
3303 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3305 /* Optionally warn about more than one declaration for the same
3306 name, but don't warn about a function declaration followed by a
3308 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3309 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3310 /* Don't warn about extern decl followed by definition. */
3311 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3312 /* Don't warn about friends, let add_friend take care of it. */
3313 && ! DECL_FRIEND_P (newdecl
))
3315 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3316 cp_warning_at ("previous declaration of `%D'", olddecl
);
3320 /* Deal with C++: must preserve virtual function table size. */
3321 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3323 register tree newtype
= TREE_TYPE (newdecl
);
3324 register tree oldtype
= TREE_TYPE (olddecl
);
3326 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3327 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3329 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3330 CLASSTYPE_FRIEND_CLASSES (newtype
)
3331 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3335 /* Copy all the DECL_... slots specified in the new decl
3336 except for any that we copy here from the old type. */
3337 DECL_MACHINE_ATTRIBUTES (newdecl
)
3338 = merge_machine_decl_attributes (olddecl
, newdecl
);
3340 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3342 if (! duplicate_decls (DECL_TEMPLATE_RESULT (newdecl
),
3343 DECL_TEMPLATE_RESULT (olddecl
)))
3344 cp_error ("invalid redeclaration of %D", newdecl
);
3345 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3346 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3347 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3348 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3355 /* Automatically handles default parameters. */
3356 tree oldtype
= TREE_TYPE (olddecl
);
3359 /* Make sure we put the new type in the same obstack as the old one. */
3361 push_obstacks (TYPE_OBSTACK (oldtype
), TYPE_OBSTACK (oldtype
));
3363 push_permanent_obstack ();
3365 /* Merge the data types specified in the two decls. */
3366 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3368 if (TREE_CODE (newdecl
) == VAR_DECL
)
3369 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3370 /* Do this after calling `common_type' so that default
3371 parameters don't confuse us. */
3372 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3373 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3374 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3376 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3377 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3378 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3379 TYPE_RAISES_EXCEPTIONS (oldtype
));
3381 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3382 && DECL_SOURCE_LINE (olddecl
) != 0
3384 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
3385 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
3387 cp_error ("declaration of `%F' throws different exceptions",
3389 cp_error_at ("to previous declaration `%F'", olddecl
);
3392 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3394 /* Lay the type out, unless already done. */
3395 if (! same_type_p (newtype
, oldtype
)
3396 && TREE_TYPE (newdecl
) != error_mark_node
3397 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3398 layout_type (TREE_TYPE (newdecl
));
3400 if ((TREE_CODE (newdecl
) == VAR_DECL
3401 || TREE_CODE (newdecl
) == PARM_DECL
3402 || TREE_CODE (newdecl
) == RESULT_DECL
3403 || TREE_CODE (newdecl
) == FIELD_DECL
3404 || TREE_CODE (newdecl
) == TYPE_DECL
)
3405 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3406 layout_decl (newdecl
, 0);
3408 /* Merge the type qualifiers. */
3409 if (TREE_READONLY (newdecl
))
3410 TREE_READONLY (olddecl
) = 1;
3411 if (TREE_THIS_VOLATILE (newdecl
))
3412 TREE_THIS_VOLATILE (olddecl
) = 1;
3414 /* Merge the initialization information. */
3415 if (DECL_INITIAL (newdecl
) == NULL_TREE
3416 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3418 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3419 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3420 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3421 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
3422 && DECL_LANG_SPECIFIC (newdecl
)
3423 && DECL_LANG_SPECIFIC (olddecl
))
3424 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3427 /* Merge the section attribute.
3428 We want to issue an error if the sections conflict but that must be
3429 done later in decl_attributes since we are called before attributes
3431 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3432 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3434 /* Keep the old rtl since we can safely use it. */
3435 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3439 /* If cannot merge, then use the new type and qualifiers,
3440 and don't preserve the old rtl. */
3443 /* Clean out any memory we had of the old declaration. */
3444 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3446 TREE_VALUE (oldstatic
) = error_mark_node
;
3448 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3449 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3450 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3451 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3454 /* Merge the storage class information. */
3455 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3456 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3457 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3458 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3459 if (! DECL_EXTERNAL (olddecl
))
3460 DECL_EXTERNAL (newdecl
) = 0;
3462 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3464 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3465 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3466 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3467 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3468 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3469 /* Don't really know how much of the language-specific
3470 values we should copy from old to new. */
3471 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3472 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3473 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3474 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3475 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3477 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3478 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3479 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3480 DECL_BEFRIENDING_CLASSES (newdecl
)
3481 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3482 DECL_BEFRIENDING_CLASSES (olddecl
));
3485 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3487 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3488 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3490 /* If newdecl is not a specialization, then it is not a
3491 template-related function at all. And that means that we
3492 shoud have exited above, returning 0. */
3493 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3496 if (TREE_USED (olddecl
))
3497 /* From [temp.expl.spec]:
3499 If a template, a member template or the member of a class
3500 template is explicitly specialized then that
3501 specialization shall be declared before the first use of
3502 that specialization that would cause an implicit
3503 instantiation to take place, in every translation unit in
3504 which such a use occurs. */
3505 cp_error ("explicit specialization of %D after first use",
3508 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3510 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3512 /* If either decl says `inline', this fn is inline, unless its
3513 definition was passed already. */
3514 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3515 DECL_INLINE (olddecl
) = 1;
3516 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3520 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3521 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3522 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3524 if (! types_match
|| new_defines_function
)
3526 /* These need to be copied so that the names are available.
3527 Note that if the types do match, we'll preserve inline
3528 info and other bits, but if not, we won't. */
3529 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3530 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3532 if (new_defines_function
)
3533 /* If defining a function declared with other language
3534 linkage, use the previously declared language linkage. */
3535 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3536 else if (types_match
)
3538 /* If redeclaring a builtin function, and not a definition,
3539 it stays built in. */
3540 if (DECL_BUILT_IN (olddecl
))
3542 DECL_BUILT_IN_CLASS (newdecl
) = DECL_BUILT_IN_CLASS (olddecl
);
3543 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3544 /* If we're keeping the built-in definition, keep the rtl,
3545 regardless of declaration matches. */
3546 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3549 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3551 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3552 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3553 /* Previously saved insns go together with
3554 the function's previous definition. */
3555 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3556 /* Don't clear out the arguments if we're redefining a function. */
3557 if (DECL_ARGUMENTS (olddecl
))
3558 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3560 if (DECL_LANG_SPECIFIC (olddecl
))
3561 DECL_MAIN_VARIANT (newdecl
) = DECL_MAIN_VARIANT (olddecl
);
3564 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3566 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3569 /* Now preserve various other info from the definition. */
3570 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3571 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3572 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3573 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3575 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3579 function_size
= sizeof (struct tree_decl
);
3581 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3582 (char *) olddecl
+ sizeof (struct tree_common
),
3583 function_size
- sizeof (struct tree_common
));
3585 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3587 /* If newdecl is a template instantiation, it is possible that
3588 the following sequence of events has occurred:
3590 o A friend function was declared in a class template. The
3591 class template was instantiated.
3593 o The instantiation of the friend declaration was
3594 recorded on the instantiation list, and is newdecl.
3596 o Later, however, instantiate_class_template called pushdecl
3597 on the newdecl to perform name injection. But, pushdecl in
3598 turn called duplicate_decls when it discovered that another
3599 declaration of a global function with the same name already
3602 o Here, in duplicate_decls, we decided to clobber newdecl.
3604 If we're going to do that, we'd better make sure that
3605 olddecl, and not newdecl, is on the list of
3606 instantiations so that if we try to do the instantiation
3607 again we won't get the clobbered declaration. */
3609 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3610 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3612 for (; decls
; decls
= TREE_CHAIN (decls
))
3613 if (TREE_VALUE (decls
) == newdecl
)
3614 TREE_VALUE (decls
) = olddecl
;
3619 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3620 (char *) olddecl
+ sizeof (struct tree_common
),
3621 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3622 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3625 DECL_UID (olddecl
) = olddecl_uid
;
3627 DECL_FRIEND_P (olddecl
) = 1;
3629 /* NEWDECL contains the merged attribute lists.
3630 Update OLDDECL to be the same. */
3631 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3636 /* Record a decl-node X as belonging to the current lexical scope.
3637 Check for errors (such as an incompatible declaration for the same
3638 name already seen in the same scope).
3640 Returns either X or an old decl for the same name.
3641 If an old decl is returned, it may have been smashed
3642 to agree with what X says. */
3650 int need_new_binding
;
3652 /* We shouldn't be calling pushdecl when we're generating RTL for a
3653 function that we already did semantic analysis on previously. */
3654 my_friendly_assert (!current_function
|| doing_semantic_analysis_p (),
3657 name
= DECL_ASSEMBLER_NAME (x
);
3658 need_new_binding
= 1;
3660 if (DECL_TEMPLATE_PARM_P (x
))
3661 /* Template parameters have no context; they are not X::T even
3662 when declared within a class or namespace. */
3666 if (current_function_decl
&& x
!= current_function_decl
3667 /* A local declaration for a function doesn't constitute
3669 && !(TREE_CODE (x
) == FUNCTION_DECL
&& !DECL_INITIAL (x
))
3670 /* A local declaration for an `extern' variable is in the
3671 scoped of the current namespace, not the current
3673 && !(TREE_CODE (x
) == VAR_DECL
&& DECL_EXTERNAL (x
))
3674 /* Don't change DECL_CONTEXT of virtual methods. */
3675 && (TREE_CODE (x
) != FUNCTION_DECL
|| !DECL_VIRTUAL_P (x
))
3676 && !DECL_CONTEXT (x
))
3677 DECL_CONTEXT (x
) = current_function_decl
;
3678 if (!DECL_CONTEXT (x
))
3679 DECL_CONTEXT (x
) = FROB_CONTEXT (current_namespace
);
3682 /* Type are looked up using the DECL_NAME, as that is what the rest of the
3683 compiler wants to use. */
3684 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
3685 || TREE_CODE (x
) == NAMESPACE_DECL
)
3686 name
= DECL_NAME (x
);
3691 /* Not needed...see below. */
3695 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3696 name
= TREE_OPERAND (name
, 0);
3698 /* Namespace-scoped variables are not found in the current level. */
3699 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
))
3700 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3702 t
= lookup_name_current_level (name
);
3703 if (t
== error_mark_node
)
3705 /* error_mark_node is 0 for a while during initialization! */
3707 cp_error_at ("`%#D' used prior to declaration", x
);
3710 else if (t
!= NULL_TREE
)
3713 /* This is turned off until I have time to do it right (bpk). */
3714 /* With the code below that uses it... */
3715 file
= DECL_SOURCE_FILE (t
);
3716 line
= DECL_SOURCE_LINE (t
);
3718 if (TREE_CODE (t
) == PARM_DECL
)
3720 if (DECL_CONTEXT (t
) == NULL_TREE
)
3721 fatal ("parse errors have confused me too much");
3723 /* Check for duplicate params. */
3724 if (duplicate_decls (x
, t
))
3727 else if (((TREE_CODE (x
) == FUNCTION_DECL
&& DECL_LANGUAGE (x
) == lang_c
)
3728 || DECL_FUNCTION_TEMPLATE_P (x
))
3729 && is_overloaded_fn (t
))
3730 /* Don't do anything just yet. */;
3731 else if (t
== wchar_decl_node
)
3733 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3734 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3736 /* Throw away the redeclaration. */
3739 else if (TREE_CODE (t
) != TREE_CODE (x
))
3741 if (duplicate_decls (x
, t
))
3744 else if (duplicate_decls (x
, t
))
3747 /* This is turned off until I have time to do it right (bpk). */
3749 /* Also warn if they did a prototype with `static' on it, but
3750 then later left the `static' off. */
3751 if (! TREE_PUBLIC (name
) && TREE_PUBLIC (x
))
3753 if (DECL_LANG_SPECIFIC (t
) && DECL_FRIEND_P (t
))
3758 cp_warning ("`static' missing from declaration of `%D'",
3760 warning_with_file_and_line (file
, line
,
3761 "previous declaration of `%s'",
3762 decl_as_string (t
, 0));
3765 /* Now fix things so it'll do what they expect. */
3766 if (current_function_decl
)
3767 TREE_PUBLIC (current_function_decl
) = 0;
3769 /* Due to interference in memory reclamation (X may be
3770 obstack-deallocated at this point), we must guard against
3771 one really special case. [jason: This should be handled
3772 by start_function] */
3773 if (current_function_decl
== x
)
3774 current_function_decl
= t
;
3776 if (TREE_CODE (t
) == TYPE_DECL
)
3777 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3778 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3779 check_default_args (t
);
3783 else if (DECL_MAIN_P (x
))
3785 /* A redeclaration of main, but not a duplicate of the
3790 This function shall not be overloaded. */
3791 cp_error_at ("invalid redeclaration of `%D'", t
);
3792 cp_error ("as `%D'", x
);
3793 /* We don't try to push this declaration since that
3799 check_template_shadow (x
);
3801 /* If this is a function conjured up by the backend, massage it
3802 so it looks friendly. */
3803 if (TREE_CODE (x
) == FUNCTION_DECL
3804 && ! DECL_LANG_SPECIFIC (x
))
3806 retrofit_lang_decl (x
);
3807 DECL_LANGUAGE (x
) = lang_c
;
3810 if (TREE_CODE (x
) == FUNCTION_DECL
&& ! DECL_FUNCTION_MEMBER_P (x
))
3812 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
3815 if (!namespace_bindings_p ())
3816 /* We do not need to create a binding for this name;
3817 push_overloaded_decl will have already done so if
3819 need_new_binding
= 0;
3821 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3823 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
3825 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
3829 /* If declaring a type as a typedef, copy the type (unless we're
3830 at line 0), and install this TYPE_DECL as the new type's typedef
3831 name. See the extensive comment in ../c-decl.c (pushdecl). */
3832 if (TREE_CODE (x
) == TYPE_DECL
)
3834 tree type
= TREE_TYPE (x
);
3835 if (DECL_SOURCE_LINE (x
) == 0)
3837 if (TYPE_NAME (type
) == 0)
3838 TYPE_NAME (type
) = x
;
3840 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
3841 /* We don't want to copy the type when all we're
3842 doing is making a TYPE_DECL for the purposes of
3844 && (!TYPE_NAME (type
)
3845 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
3847 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
3849 DECL_ORIGINAL_TYPE (x
) = type
;
3850 type
= build_type_copy (type
);
3851 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
3852 TYPE_NAME (type
) = x
;
3853 TREE_TYPE (x
) = type
;
3858 if (type
!= error_mark_node
3860 && TYPE_IDENTIFIER (type
))
3861 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
3862 current_binding_level
);
3866 /* Multiple external decls of the same identifier ought to match.
3868 We get warnings about inline functions where they are defined.
3869 We get warnings about other functions from push_overloaded_decl.
3871 Avoid duplicate warnings where they are used. */
3872 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
3876 if (IDENTIFIER_NAMESPACE_VALUE (name
) != NULL_TREE
3877 && (DECL_EXTERNAL (IDENTIFIER_NAMESPACE_VALUE (name
))
3878 || TREE_PUBLIC (IDENTIFIER_NAMESPACE_VALUE (name
))))
3879 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
3884 /* If different sort of thing, we already gave an error. */
3885 && TREE_CODE (decl
) == TREE_CODE (x
)
3886 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
3888 cp_pedwarn ("type mismatch with previous external decl", x
);
3889 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
3893 /* This name is new in its binding level.
3894 Install the new declaration and return it. */
3895 if (namespace_bindings_p ())
3897 /* Install a global value. */
3899 /* If the first global decl has external linkage,
3900 warn if we later see static one. */
3901 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
3902 TREE_PUBLIC (name
) = 1;
3904 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
3906 /* For an ordinary function, we create a binding from
3907 the mangled name (i.e., NAME) to the DECL. But, for
3908 an `extern "C"' function, the mangled name and the
3909 ordinary name are the same so we need not do this. */
3910 && !(TREE_CODE (x
) == FUNCTION_DECL
&&
3911 DECL_LANGUAGE (x
) == lang_c
))
3913 if (TREE_CODE (x
) == FUNCTION_DECL
)
3915 ((IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
)
3916 || (IDENTIFIER_GLOBAL_VALUE (name
) == x
), 378);
3917 SET_IDENTIFIER_NAMESPACE_VALUE (name
, x
);
3920 /* Don't forget if the function was used via an implicit decl. */
3921 if (IDENTIFIER_IMPLICIT_DECL (name
)
3922 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
3925 /* Don't forget if its address was taken in that way. */
3926 if (IDENTIFIER_IMPLICIT_DECL (name
)
3927 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
3928 TREE_ADDRESSABLE (x
) = 1;
3930 /* Warn about mismatches against previous implicit decl. */
3931 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
3932 /* If this real decl matches the implicit, don't complain. */
3933 && ! (TREE_CODE (x
) == FUNCTION_DECL
3934 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
3936 ("`%D' was previously implicitly declared to return `int'", x
);
3938 /* If new decl is `static' and an `extern' was seen previously,
3940 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
3941 warn_extern_redeclared_static (x
, t
);
3945 /* Here to install a non-global value. */
3946 tree oldlocal
= IDENTIFIER_VALUE (name
);
3947 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
3949 if (need_new_binding
)
3951 push_local_binding (name
, x
, 0);
3952 /* Because push_local_binding will hook X on to the
3953 current_binding_level's name list, we don't want to
3954 do that again below. */
3955 need_new_binding
= 0;
3958 /* If this is a TYPE_DECL, push it into the type value slot. */
3959 if (TREE_CODE (x
) == TYPE_DECL
)
3960 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
3961 current_binding_level
);
3963 /* Clear out any TYPE_DECL shadowed by a namespace so that
3964 we won't think this is a type. The C struct hack doesn't
3965 go through namespaces. */
3966 if (TREE_CODE (x
) == NAMESPACE_DECL
)
3967 set_identifier_type_value_with_scope (name
, NULL_TREE
,
3968 current_binding_level
);
3970 /* If this is an extern function declaration, see if we
3971 have a global definition or declaration for the function. */
3972 if (oldlocal
== NULL_TREE
3973 && DECL_EXTERNAL (x
)
3974 && oldglobal
!= NULL_TREE
3975 && TREE_CODE (x
) == FUNCTION_DECL
3976 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
3978 /* We have one. Their types must agree. */
3979 if (decls_match (x
, oldglobal
))
3983 cp_warning ("extern declaration of `%#D' doesn't match", x
);
3984 cp_warning_at ("global declaration `%#D'", oldglobal
);
3987 /* If we have a local external declaration,
3988 and no file-scope declaration has yet been seen,
3989 then if we later have a file-scope decl it must not be static. */
3990 if (oldlocal
== NULL_TREE
3991 && oldglobal
== NULL_TREE
3992 && DECL_EXTERNAL (x
)
3994 TREE_PUBLIC (name
) = 1;
3996 if (DECL_FROM_INLINE (x
))
3997 /* Inline decls shadow nothing. */;
3999 /* Warn if shadowing an argument at the top level of the body. */
4000 else if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
4001 && TREE_CODE (oldlocal
) == PARM_DECL
4002 /* Don't complain if it's from an enclosing function. */
4003 && DECL_CONTEXT (oldlocal
) == current_function_decl
4004 && TREE_CODE (x
) != PARM_DECL
)
4006 /* Go to where the parms should be and see if we
4008 struct binding_level
*b
= current_binding_level
->level_chain
;
4014 if (b
->parm_flag
== 1)
4015 cp_error ("declaration of `%#D' shadows a parameter", name
);
4017 else if (warn_shadow
&& oldlocal
!= NULL_TREE
4018 && current_binding_level
->is_for_scope
4019 && !DECL_DEAD_FOR_LOCAL (oldlocal
))
4021 warning ("variable `%s' shadows local",
4022 IDENTIFIER_POINTER (name
));
4023 cp_warning_at (" this is the shadowed declaration", oldlocal
);
4025 /* Maybe warn if shadowing something else. */
4026 else if (warn_shadow
&& !DECL_EXTERNAL (x
)
4027 /* No shadow warnings for internally generated vars. */
4028 && ! DECL_ARTIFICIAL (x
)
4029 /* No shadow warnings for vars made for inlining. */
4030 && ! DECL_FROM_INLINE (x
))
4032 const char *warnstring
= NULL
;
4034 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
4035 warnstring
= "declaration of `%s' shadows a parameter";
4036 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
4037 && current_class_ptr
4038 && !TREE_STATIC (name
))
4039 warnstring
= "declaration of `%s' shadows a member of `this'";
4040 else if (oldlocal
!= NULL_TREE
)
4041 warnstring
= "declaration of `%s' shadows previous local";
4042 else if (oldglobal
!= NULL_TREE
)
4043 /* XXX shadow warnings in outer-more namespaces */
4044 warnstring
= "declaration of `%s' shadows global declaration";
4047 warning (warnstring
, IDENTIFIER_POINTER (name
));
4051 if (TREE_CODE (x
) == FUNCTION_DECL
)
4052 check_default_args (x
);
4054 /* Keep count of variables in this level with incomplete type. */
4055 if (TREE_CODE (x
) == VAR_DECL
4056 && TREE_TYPE (x
) != error_mark_node
4057 && ((TYPE_SIZE (TREE_TYPE (x
)) == NULL_TREE
4058 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
4059 /* RTTI TD entries are created while defining the type_info. */
4060 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
4061 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
4062 current_binding_level
->incomplete
4063 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4066 if (need_new_binding
)
4067 add_decl_to_level (x
, current_binding_level
);
4072 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4073 caller to set DECL_CONTEXT properly. */
4076 pushdecl_with_scope (x
, level
)
4078 struct binding_level
*level
;
4080 register struct binding_level
*b
;
4081 tree function_decl
= current_function_decl
;
4083 current_function_decl
= NULL_TREE
;
4084 if (level
->parm_flag
== 2)
4086 b
= class_binding_level
;
4087 class_binding_level
= level
;
4088 pushdecl_class_level (x
);
4089 class_binding_level
= b
;
4093 b
= current_binding_level
;
4094 current_binding_level
= level
;
4096 current_binding_level
= b
;
4098 current_function_decl
= function_decl
;
4102 /* Like pushdecl, only it places X in the current namespace,
4106 pushdecl_namespace_level (x
)
4109 register struct binding_level
*b
= current_binding_level
;
4112 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4114 /* Now, the type_shadowed stack may screw us. Munge it so it does
4116 if (TREE_CODE (x
) == TYPE_DECL
)
4118 tree name
= DECL_NAME (x
);
4120 tree
*ptr
= (tree
*)0;
4121 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4123 tree shadowed
= b
->type_shadowed
;
4124 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4125 if (TREE_PURPOSE (shadowed
) == name
)
4127 ptr
= &TREE_VALUE (shadowed
);
4128 /* Can't break out of the loop here because sometimes
4129 a binding level will have duplicate bindings for
4130 PT names. It's gross, but I haven't time to fix it. */
4133 newval
= TREE_TYPE (x
);
4134 if (ptr
== (tree
*)0)
4136 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4137 up here if this is changed to an assertion. --KR */
4138 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4148 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4152 pushdecl_top_level (x
)
4155 push_to_top_level ();
4156 x
= pushdecl_namespace_level (x
);
4157 pop_from_top_level ();
4161 /* Make the declaration of X appear in CLASS scope. */
4164 pushdecl_class_level (x
)
4167 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4168 scope looks for the pre-mangled name. */
4171 if (TREE_CODE (x
) == OVERLOAD
)
4172 x
= OVL_CURRENT (x
);
4173 name
= DECL_NAME (x
);
4177 push_class_level_binding (name
, x
);
4178 if (TREE_CODE (x
) == TYPE_DECL
)
4179 set_identifier_type_value (name
, TREE_TYPE (x
));
4181 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4185 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4188 pushdecl_class_level (f
);
4192 /* Enter DECL into the symbol table, if that's appropriate. Returns
4193 DECL, or a modified version thereof. */
4196 maybe_push_decl (decl
)
4199 tree type
= TREE_TYPE (decl
);
4201 /* Add this decl to the current binding level, but not if it comes
4202 from another scope, e.g. a static member variable. TEM may equal
4203 DECL or it may be a previous decl of the same name. */
4204 if ((TREE_CODE (decl
) != PARM_DECL
4205 && DECL_CONTEXT (decl
) != NULL_TREE
4206 /* Definitions of namespace members outside their namespace are
4208 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4209 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4210 || TREE_CODE (type
) == UNKNOWN_TYPE
4211 /* The declaration of a template specialization does not affect
4212 the functions available for overload resolution, so we do not
4214 || (TREE_CODE (decl
) == FUNCTION_DECL
4215 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4218 return pushdecl (decl
);
4222 /* This function is used to push the mangled decls for nested types into
4223 the appropriate scope. Previously pushdecl_top_level was used, but that
4224 is incorrect for members of local classes. */
4227 pushdecl_nonclass_level (x
)
4230 struct binding_level
*b
= current_binding_level
;
4232 my_friendly_assert (b
->parm_flag
!= 2, 180);
4235 /* Get out of template binding levels */
4236 while (b
->pseudo_global
)
4240 pushdecl_with_scope (x
, b
);
4244 /* Make the declaration(s) of X appear in CLASS scope
4245 under the name NAME. */
4248 push_class_level_binding (name
, x
)
4253 /* The class_binding_level will be NULL if x is a template
4254 parameter name in a member template. */
4255 if (!class_binding_level
)
4258 /* Make sure that this new member does not have the same name
4259 as a template parameter. */
4260 if (TYPE_BEING_DEFINED (current_class_type
))
4261 check_template_shadow (x
);
4263 /* If this declaration shadows a declaration from an enclosing
4264 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4265 we leave this class. Record the shadowed declaration here. */
4266 binding
= IDENTIFIER_BINDING (name
);
4268 && ((TREE_CODE (x
) == OVERLOAD
4269 && BINDING_VALUE (binding
)
4270 && is_overloaded_fn (BINDING_VALUE (binding
)))
4271 || INHERITED_VALUE_BINDING_P (binding
)))
4276 /* If the old binding was from a base class, and was for a tag
4277 name, slide it over to make room for the new binding. The
4278 old binding is still visible if explicitly qualified with a
4280 if (INHERITED_VALUE_BINDING_P (binding
)
4281 && BINDING_VALUE (binding
)
4282 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4283 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4284 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4286 old_decl
= BINDING_TYPE (binding
);
4287 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4288 BINDING_VALUE (binding
) = NULL_TREE
;
4289 INHERITED_VALUE_BINDING_P (binding
) = 0;
4292 old_decl
= BINDING_VALUE (binding
);
4294 /* There was already a binding for X containing fewer
4295 functions than are named in X. Find the previous
4296 declaration of X on the class-shadowed list, and update it. */
4297 for (shadow
= class_binding_level
->class_shadowed
;
4299 shadow
= TREE_CHAIN (shadow
))
4300 if (TREE_PURPOSE (shadow
) == name
4301 && TREE_TYPE (shadow
) == old_decl
)
4303 BINDING_VALUE (binding
) = x
;
4304 INHERITED_VALUE_BINDING_P (binding
) = 0;
4305 TREE_TYPE (shadow
) = x
;
4310 /* If we didn't replace an existing binding, put the binding on the
4311 stack of bindings for the identifier, and update
4312 IDENTIFIER_CLASS_VALUE. */
4313 if (push_class_binding (name
, x
))
4315 push_cache_obstack ();
4316 class_binding_level
->class_shadowed
4317 = tree_cons (name
, IDENTIFIER_CLASS_VALUE (name
),
4318 class_binding_level
->class_shadowed
);
4320 /* Record the value we are binding NAME to so that we can know
4321 what to pop later. */
4322 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4326 /* Insert another USING_DECL into the current binding level,
4327 returning this declaration. If this is a redeclaration,
4328 do nothing and return NULL_TREE. */
4331 push_using_decl (scope
, name
)
4337 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4338 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4339 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4340 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4344 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4345 DECL_INITIAL (decl
) = scope
;
4346 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4347 current_binding_level
->usings
= decl
;
4351 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4352 changed (i.e. there was already a directive), or the fresh
4353 TREE_LIST otherwise. */
4356 push_using_directive (used
)
4359 tree ud
= current_binding_level
->using_directives
;
4360 tree iter
, ancestor
;
4362 /* Check if we already have this. */
4363 if (purpose_member (used
, ud
) != NULL_TREE
)
4366 /* Recursively add all namespaces used. */
4367 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4368 push_using_directive (TREE_PURPOSE (iter
));
4370 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4371 ud
= current_binding_level
->using_directives
;
4372 ud
= tree_cons (used
, ancestor
, ud
);
4373 current_binding_level
->using_directives
= ud
;
4377 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4378 other definitions already in place. We get around this by making
4379 the value of the identifier point to a list of all the things that
4380 want to be referenced by that name. It is then up to the users of
4381 that name to decide what to do with that list.
4383 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its DECL_RESULT
4384 slot. It is dealt with the same way.
4386 FLAGS is a bitwise-or of the following values:
4387 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4389 PUSH_USING: DECL is being pushed as the result of a using
4392 The value returned may be a previous declaration if we guessed wrong
4393 about what language DECL should belong to (C or C++). Otherwise,
4394 it's always DECL (and never something that's not a _DECL). */
4397 push_overloaded_decl (decl
, flags
)
4401 tree name
= DECL_NAME (decl
);
4404 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4407 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4409 old
= lookup_name_current_level (name
);
4413 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4415 tree t
= TREE_TYPE (old
);
4416 if (IS_AGGR_TYPE (t
) && warn_shadow
4417 && (! DECL_IN_SYSTEM_HEADER (decl
)
4418 || ! DECL_IN_SYSTEM_HEADER (old
)))
4419 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4422 else if (is_overloaded_fn (old
))
4426 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4428 tree fn
= OVL_CURRENT (tmp
);
4430 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4431 && !(flags
& PUSH_USING
)
4432 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4433 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4434 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4437 if (duplicate_decls (decl
, fn
))
4443 cp_error_at ("previous non-function declaration `%#D'", old
);
4444 cp_error ("conflicts with function declaration `%#D'", decl
);
4449 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4451 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4452 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4454 new_binding
= ovl_cons (decl
, old
);
4455 if (flags
& PUSH_USING
)
4456 OVL_USED (new_binding
) = 1;
4459 /* NAME is not ambiguous. */
4463 set_namespace_binding (name
, current_namespace
, new_binding
);
4466 /* We only create an OVERLOAD if there was a previous binding at
4467 this level, or if decl is a template. In the former case, we
4468 need to remove the old binding and replace it with the new
4469 binding. We must also run through the NAMES on the binding
4470 level where the name was bound to update the chain. */
4472 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4476 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4478 d
= &TREE_CHAIN (*d
))
4480 || (TREE_CODE (*d
) == TREE_LIST
4481 && TREE_VALUE (*d
) == old
))
4483 if (TREE_CODE (*d
) == TREE_LIST
)
4484 /* Just replace the old binding with the new. */
4485 TREE_VALUE (*d
) = new_binding
;
4487 /* Build a TREE_LIST to wrap the OVERLOAD. */
4488 *d
= tree_cons (NULL_TREE
, new_binding
,
4491 /* And update the CPLUS_BINDING node. */
4492 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4497 /* We should always find a previous binding in this case. */
4498 my_friendly_abort (0);
4501 /* Install the new binding. */
4502 push_local_binding (name
, new_binding
, flags
);
4508 /* Generate an implicit declaration for identifier FUNCTIONID
4509 as a function of type int (). Print a warning if appropriate. */
4512 implicitly_declare (functionid
)
4516 int temp
= allocation_temporary_p ();
4518 push_obstacks_nochange ();
4520 /* Save the decl permanently so we can warn if definition follows.
4521 In ANSI C, warn_implicit is usually false, so the saves little space.
4522 But in C++, it's usually true, hence the extra code. */
4523 if (temp
&& (! warn_implicit
|| toplevel_bindings_p ()))
4524 end_temporary_allocation ();
4526 /* We used to reuse an old implicit decl here,
4527 but this loses with inline functions because it can clobber
4528 the saved decl chains. */
4529 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4531 DECL_EXTERNAL (decl
) = 1;
4532 TREE_PUBLIC (decl
) = 1;
4534 /* ANSI standard says implicit declarations are in the innermost block.
4535 So we record the decl in the standard fashion. */
4537 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4540 /* Only one warning per identifier. */
4541 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4543 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4546 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4553 /* Return zero if the declaration NEWDECL is valid
4554 when the declaration OLDDECL (assumed to be for the same name)
4555 has already been seen.
4556 Otherwise return an error message format string with a %s
4557 where the identifier should go. */
4560 redeclaration_error_message (newdecl
, olddecl
)
4561 tree newdecl
, olddecl
;
4563 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4565 /* Because C++ can put things into name space for free,
4566 constructs like "typedef struct foo { ... } foo"
4567 would look like an erroneous redeclaration. */
4568 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4571 return "redefinition of `%#D'";
4573 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4575 /* If this is a pure function, its olddecl will actually be
4576 the original initialization to `0' (which we force to call
4577 abort()). Don't complain about redefinition in this case. */
4578 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_ABSTRACT_VIRTUAL_P (olddecl
))
4581 /* If both functions come from different namespaces, this is not
4582 a redeclaration - this is a conflict with a used function. */
4583 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4584 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4585 return "`%D' conflicts with used function";
4587 /* We'll complain about linkage mismatches in
4588 warn_extern_redeclared_static. */
4590 /* Defining the same name twice is no good. */
4591 if (DECL_INITIAL (olddecl
) != NULL_TREE
4592 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4594 if (DECL_NAME (olddecl
) == NULL_TREE
)
4595 return "`%#D' not declared in class";
4597 return "redefinition of `%#D'";
4601 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4603 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4604 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4605 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4606 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4607 && TYPE_SIZE (TREE_TYPE (newdecl
))
4608 && TYPE_SIZE (TREE_TYPE (olddecl
))))
4609 return "redefinition of `%#D'";
4612 else if (toplevel_bindings_p ())
4614 /* Objects declared at top level: */
4615 /* If at least one is a reference, it's ok. */
4616 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4618 /* Reject two definitions. */
4619 return "redefinition of `%#D'";
4623 /* Objects declared with block scope: */
4624 /* Reject two definitions, and reject a definition
4625 together with an external reference. */
4626 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4627 return "redeclaration of `%#D'";
4632 /* Create a new label, named ID. */
4635 make_label_decl (id
, local_p
)
4641 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4643 /* Make sure every label has an rtx. */
4646 DECL_CONTEXT (decl
) = current_function_decl
;
4647 DECL_MODE (decl
) = VOIDmode
;
4648 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
4650 /* Say where one reference is to the label, for the sake of the
4651 error if it is not defined. */
4652 DECL_SOURCE_LINE (decl
) = lineno
;
4653 DECL_SOURCE_FILE (decl
) = input_filename
;
4655 /* Record the fact that this identifier is bound to this label. */
4656 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4658 /* Record this label on the list of used labels so that we can check
4659 at the end of the function to see whether or not the label was
4660 actually defined. */
4661 if ((named_label_uses
== NULL
|| named_label_uses
->label_decl
!= decl
)
4662 && (named_label_uses
== NULL
4663 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4664 || named_label_uses
->label_decl
!= decl
))
4666 struct named_label_list
*new_ent
;
4668 = (struct named_label_list
*)oballoc (sizeof (struct named_label_list
));
4669 new_ent
->label_decl
= decl
;
4670 new_ent
->names_in_scope
= current_binding_level
->names
;
4671 new_ent
->binding_level
= current_binding_level
;
4672 new_ent
->lineno_o_goto
= lineno
;
4673 new_ent
->filename_o_goto
= input_filename
;
4674 new_ent
->next
= named_label_uses
;
4675 named_label_uses
= new_ent
;
4681 /* Look for a label named ID in the current function. If one cannot
4682 be found, create one. (We keep track of used, but undefined,
4683 labels, and complain about them at the end of a function.) */
4691 /* You can't use labels at global scope. */
4692 if (current_function_decl
== NULL_TREE
)
4694 error ("label `%s' referenced outside of any function",
4695 IDENTIFIER_POINTER (id
));
4699 /* See if we've already got this label. */
4700 decl
= IDENTIFIER_LABEL_VALUE (id
);
4701 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
4704 /* Record this label on the list of labels used in this function.
4705 We do this before calling make_label_decl so that we get the
4706 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4707 named_labels
= tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4709 /* We need a new label. */
4710 decl
= make_label_decl (id
, /*local_p=*/0);
4711 /* Now fill in the information we didn't have before. */
4712 TREE_VALUE (named_labels
) = decl
;
4717 /* Declare a local label named ID. */
4720 declare_local_label (id
)
4725 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4726 this scope we can restore the old value of
4727 IDENTIFIER_TYPE_VALUE. */
4728 current_binding_level
->shadowed_labels
4729 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4730 current_binding_level
->shadowed_labels
);
4731 /* Look for the label. */
4732 decl
= make_label_decl (id
, /*local_p=*/1);
4733 /* Now fill in the information we didn't have before. */
4734 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
4739 /* Define a label, specifying the location in the source file.
4740 Return the LABEL_DECL node for the label, if the definition is valid.
4741 Otherwise return 0. */
4744 define_label (filename
, line
, name
)
4749 tree decl
= lookup_label (name
);
4751 /* After labels, make any new cleanups go into their
4752 own new (temporary) binding contour. */
4753 current_binding_level
->more_cleanups_ok
= 0;
4755 if (name
== get_identifier ("wchar_t"))
4756 cp_pedwarn ("label named wchar_t");
4758 if (DECL_INITIAL (decl
) != NULL_TREE
)
4760 cp_error ("duplicate label `%D'", decl
);
4765 struct named_label_list
*uses
, *prev
;
4769 /* Mark label as having been defined. */
4770 DECL_INITIAL (decl
) = error_mark_node
;
4771 /* Say where in the source. */
4772 DECL_SOURCE_FILE (decl
) = filename
;
4773 DECL_SOURCE_LINE (decl
) = line
;
4776 uses
= named_label_uses
;
4777 while (uses
!= NULL
)
4778 if (uses
->label_decl
== decl
)
4780 struct binding_level
*b
= current_binding_level
;
4783 tree new_decls
= b
->names
;
4784 tree old_decls
= (b
== uses
->binding_level
)
4785 ? uses
->names_in_scope
: NULL_TREE
;
4786 while (new_decls
!= old_decls
)
4788 if (TREE_CODE (new_decls
) == VAR_DECL
4789 /* Don't complain about crossing initialization
4790 of internal entities. They can't be accessed,
4791 and they should be cleaned up
4792 by the time we get to the label. */
4793 && ! DECL_ARTIFICIAL (new_decls
)
4794 && !(DECL_INITIAL (new_decls
) == NULL_TREE
4795 && pod_type_p (TREE_TYPE (new_decls
))))
4797 /* This is really only important if we're crossing
4798 an initialization. The POD stuff is just
4799 pedantry; why should it matter if the class
4800 contains a field of pointer to member type? */
4801 int problem
= (DECL_INITIAL (new_decls
)
4802 || (TYPE_NEEDS_CONSTRUCTING
4803 (TREE_TYPE (new_decls
))));
4809 cp_error ("jump to label `%D'", decl
);
4810 error_with_file_and_line
4811 (uses
->filename_o_goto
,
4812 uses
->lineno_o_goto
, " from here");
4816 cp_pedwarn ("jump to label `%D'", decl
);
4817 pedwarn_with_file_and_line
4818 (uses
->filename_o_goto
,
4819 uses
->lineno_o_goto
, " from here");
4825 cp_error_at (" crosses initialization of `%#D'",
4828 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4831 new_decls
= TREE_CHAIN (new_decls
);
4833 if (b
== uses
->binding_level
)
4835 if (b
->eh_region
&& ! saw_eh
)
4839 cp_error ("jump to label `%D'", decl
);
4840 error_with_file_and_line
4841 (uses
->filename_o_goto
,
4842 uses
->lineno_o_goto
, " from here");
4845 error (" enters exception handling block");
4852 prev
->next
= uses
->next
;
4854 named_label_uses
= uses
->next
;
4863 current_function_return_value
= NULL_TREE
;
4870 struct binding_level
*level
;
4871 struct cp_switch
*next
;
4874 static struct cp_switch
*switch_stack
;
4880 = (struct cp_switch
*) oballoc (sizeof (struct cp_switch
));
4881 p
->level
= current_binding_level
;
4882 p
->next
= switch_stack
;
4889 switch_stack
= switch_stack
->next
;
4892 /* Note that we've seen a definition of a case label, and complain if this
4893 is a bad place for one. */
4896 define_case_label ()
4898 tree cleanup
= last_cleanup_this_contour ();
4899 struct binding_level
*b
= current_binding_level
;
4903 /* Don't crash; we'll complain in do_case. */
4908 static int explained
= 0;
4909 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup
));
4910 warning ("where case label appears here");
4913 warning ("(enclose actions of previous case statements requiring");
4914 warning ("destructors in their own binding contours.)");
4919 for (; b
&& b
!= switch_stack
->level
; b
= b
->level_chain
)
4921 tree new_decls
= b
->names
;
4922 for (; new_decls
; new_decls
= TREE_CHAIN (new_decls
))
4924 if (TREE_CODE (new_decls
) == VAR_DECL
4925 /* Don't complain about crossing initialization
4926 of internal entities. They can't be accessed,
4927 and they should be cleaned up
4928 by the time we get to the label. */
4929 && ! DECL_ARTIFICIAL (new_decls
)
4930 && ((DECL_INITIAL (new_decls
) != NULL_TREE
4931 && DECL_INITIAL (new_decls
) != error_mark_node
)
4932 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls
))))
4935 error ("jump to case label");
4937 cp_error_at (" crosses initialization of `%#D'",
4943 /* After labels, make any new cleanups go into their
4944 own new (temporary) binding contour. */
4946 current_binding_level
->more_cleanups_ok
= 0;
4947 current_function_return_value
= NULL_TREE
;
4950 /* Return the list of declarations of the current level.
4951 Note that this list is in reverse order unless/until
4952 you nreverse it; and when you do nreverse it, you must
4953 store the result back using `storedecls' or you will lose. */
4958 return current_binding_level
->names
;
4961 /* Return the list of type-tags (for structs, etc) of the current level. */
4966 return current_binding_level
->tags
;
4969 /* Store the list of declarations of the current level.
4970 This is done for the parameter declarations of a function being defined,
4971 after they are modified in the light of any missing parameters. */
4977 current_binding_level
->names
= decls
;
4980 /* Similarly, store the list of tags of the current level. */
4986 current_binding_level
->tags
= tags
;
4989 /* Given NAME, an IDENTIFIER_NODE,
4990 return the structure (or union or enum) definition for that name.
4991 Searches binding levels from BINDING_LEVEL up to the global level.
4992 If THISLEVEL_ONLY is nonzero, searches only the specified context
4993 (but skips any tag-transparent contexts to find one that is
4994 meaningful for tags).
4995 FORM says which kind of type the caller wants;
4996 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
4997 If the wrong kind of type is found, and it's not a template, an error is
5001 lookup_tag (form
, name
, binding_level
, thislevel_only
)
5002 enum tree_code form
;
5004 struct binding_level
*binding_level
;
5007 register struct binding_level
*level
;
5008 /* Non-zero if, we should look past a pseudo-global level, even if
5010 int allow_pseudo_global
= 1;
5012 for (level
= binding_level
; level
; level
= level
->level_chain
)
5015 if (ANON_AGGRNAME_P (name
))
5016 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5018 /* There's no need for error checking here, because
5019 anon names are unique throughout the compilation. */
5020 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
5021 return TREE_VALUE (tail
);
5023 else if (level
->namespace_p
)
5024 /* Do namespace lookup. */
5025 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
5027 tree old
= binding_for_name (name
, tail
);
5029 /* If we just skipped past a pseudo global level, even
5030 though THISLEVEL_ONLY, and we find a template class
5031 declaration, then we use the _TYPE node for the
5032 template. See the example below. */
5033 if (thislevel_only
&& !allow_pseudo_global
5034 && old
&& BINDING_VALUE (old
)
5035 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
5036 old
= TREE_TYPE (BINDING_VALUE (old
));
5038 old
= BINDING_TYPE (old
);
5040 /* If it has an original type, it is a typedef, and we
5041 should not return it. */
5042 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
5044 if (old
&& TREE_CODE (old
) != form
5045 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
5047 cp_error ("`%#D' redeclared as %C", old
, form
);
5052 if (thislevel_only
|| tail
== global_namespace
)
5056 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5058 if (TREE_PURPOSE (tail
) == name
)
5060 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
5061 /* Should tighten this up; it'll probably permit
5062 UNION_TYPE and a struct template, for example. */
5064 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
5066 /* Definition isn't the kind we were looking for. */
5067 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
5071 return TREE_VALUE (tail
);
5074 if (thislevel_only
&& ! level
->tag_transparent
)
5076 if (level
->pseudo_global
&& allow_pseudo_global
)
5078 /* We must deal with cases like this:
5080 template <class T> struct S;
5081 template <class T> struct S {};
5083 When looking up `S', for the second declaration, we
5084 would like to find the first declaration. But, we
5085 are in the pseudo-global level created for the
5086 template parameters, rather than the (surrounding)
5087 namespace level. Thus, we keep going one more level,
5088 even though THISLEVEL_ONLY is non-zero. */
5089 allow_pseudo_global
= 0;
5101 set_current_level_tags_transparency (tags_transparent
)
5102 int tags_transparent
;
5104 current_binding_level
->tag_transparent
= tags_transparent
;
5108 /* Given a type, find the tag that was defined for it and return the tag name.
5109 Otherwise return 0. However, the value can never be 0
5110 in the cases in which this is used.
5112 C++: If NAME is non-zero, this is the new name to install. This is
5113 done when replacing anonymous tags with real tag names. */
5116 lookup_tag_reverse (type
, name
)
5120 register struct binding_level
*level
;
5122 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5125 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5127 if (TREE_VALUE (tail
) == type
)
5130 TREE_PURPOSE (tail
) = name
;
5131 return TREE_PURPOSE (tail
);
5138 /* Look up NAME in the NAMESPACE. */
5141 lookup_namespace_name (namespace, name
)
5142 tree
namespace, name
;
5145 tree template_id
= NULL_TREE
;
5147 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5149 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5150 /* This happens for A::B<int> when B is a namespace. */
5152 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5154 /* This happens for A::B where B is a template, and there are no
5155 template arguments. */
5156 cp_error ("invalid use of `%D'", name
);
5157 return error_mark_node
;
5160 namespace = ORIGINAL_NAMESPACE (namespace);
5162 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5165 name
= TREE_OPERAND (name
, 0);
5166 if (TREE_CODE (name
) == OVERLOAD
)
5167 name
= DECL_NAME (OVL_CURRENT (name
));
5168 else if (TREE_CODE_CLASS (TREE_CODE (name
)) == 'd')
5169 name
= DECL_NAME (name
);
5172 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5174 val
= make_node (CPLUS_BINDING
);
5175 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5176 return error_mark_node
;
5178 if (BINDING_VALUE (val
))
5180 val
= BINDING_VALUE (val
);
5184 if (DECL_CLASS_TEMPLATE_P (val
))
5185 val
= lookup_template_class (val
,
5186 TREE_OPERAND (template_id
, 1),
5187 /*in_decl=*/NULL_TREE
,
5188 /*context=*/NULL_TREE
,
5189 /*entering_scope=*/0);
5190 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5191 || TREE_CODE (val
) == OVERLOAD
)
5192 val
= lookup_template_function (val
,
5193 TREE_OPERAND (template_id
, 1));
5196 cp_error ("`%D::%D' is not a template",
5198 return error_mark_node
;
5202 /* If we have a single function from a using decl, pull it out. */
5203 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5204 val
= OVL_FUNCTION (val
);
5208 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5209 return error_mark_node
;
5212 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5214 static unsigned long
5222 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5223 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5228 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5231 typename_compare (k1
, k2
)
5242 d1
= TYPE_NAME (t1
);
5243 d2
= TYPE_NAME (t2
);
5245 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5246 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5247 && ((TREE_TYPE (t1
) != NULL_TREE
)
5248 == (TREE_TYPE (t2
) != NULL_TREE
))
5249 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5250 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5253 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5254 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5255 is non-NULL, this type is being created by the implicit typename
5256 extension, and BASE_TYPE is a type named `t' in some base class of
5257 `T' which depends on template parameters.
5259 Returns the new TYPENAME_TYPE. */
5262 build_typename_type (context
, name
, fullname
, base_type
)
5270 struct hash_entry
* e
;
5272 static struct hash_table ht
;
5274 push_obstacks (&permanent_obstack
, &permanent_obstack
);
5278 static struct hash_table
*h
= &ht
;
5279 if (!hash_table_init (&ht
, &hash_newfunc
, &typename_hash
,
5281 fatal ("virtual memory exhausted");
5282 ggc_add_tree_hash_table_root (&h
, 1);
5285 /* Build the TYPENAME_TYPE. */
5286 t
= make_lang_type (TYPENAME_TYPE
);
5287 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5288 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5289 TREE_TYPE (t
) = base_type
;
5291 /* Build the corresponding TYPE_DECL. */
5292 d
= build_decl (TYPE_DECL
, name
, t
);
5293 TYPE_NAME (TREE_TYPE (d
)) = d
;
5294 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5295 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5296 DECL_ARTIFICIAL (d
) = 1;
5298 /* See if we already have this type. */
5299 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5303 /* Insert the type into the table. */
5304 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5312 make_typename_type (context
, name
)
5317 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
5319 if (!(TYPE_LANG_SPECIFIC (name
)
5320 && (CLASSTYPE_IS_TEMPLATE (name
)
5321 || CLASSTYPE_USE_TEMPLATE (name
))))
5322 name
= TYPE_IDENTIFIER (name
);
5324 /* Create a TEMPLATE_ID_EXPR for the type. */
5325 name
= build_nt (TEMPLATE_ID_EXPR
,
5326 CLASSTYPE_TI_TEMPLATE (name
),
5327 CLASSTYPE_TI_ARGS (name
));
5329 else if (TREE_CODE (name
) == TYPE_DECL
)
5330 name
= DECL_NAME (name
);
5334 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5336 name
= TREE_OPERAND (name
, 0);
5337 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5338 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5340 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5341 my_friendly_abort (2000);
5343 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5345 /* We can get here from typename_sub0 in the explicit_template_type
5346 expansion. Just fail. */
5347 cp_error ("no class template named `%#T' in `%#T'",
5349 return error_mark_node
;
5352 if (! uses_template_parms (context
)
5353 || currently_open_class (context
))
5355 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5357 tree tmpl
= NULL_TREE
;
5358 if (IS_AGGR_TYPE (context
))
5359 tmpl
= lookup_field (context
, name
, 0, 0);
5360 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5362 cp_error ("no class template named `%#T' in `%#T'",
5364 return error_mark_node
;
5367 return lookup_template_class (tmpl
,
5368 TREE_OPERAND (fullname
, 1),
5370 /*entering_scope=*/0);
5376 if (!IS_AGGR_TYPE (context
))
5378 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5379 return error_mark_node
;
5382 t
= lookup_field (context
, name
, 0, 1);
5384 return TREE_TYPE (t
);
5388 /* If the CONTEXT is not a template type, then either the field is
5389 there now or its never going to be. */
5390 if (!uses_template_parms (context
))
5392 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5393 return error_mark_node
;
5397 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5400 /* Select the right _DECL from multiple choices. */
5403 select_decl (binding
, flags
)
5408 val
= BINDING_VALUE (binding
);
5409 if (LOOKUP_NAMESPACES_ONLY (flags
))
5411 /* We are not interested in types. */
5412 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5417 /* If we could have a type and
5418 we have nothing or we need a type and have none. */
5419 if (BINDING_TYPE (binding
)
5420 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5421 && TREE_CODE (val
) != TYPE_DECL
)))
5422 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5423 /* Don't return non-types if we really prefer types. */
5424 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5425 && (TREE_CODE (val
) != TEMPLATE_DECL
5426 || !DECL_CLASS_TEMPLATE_P (val
)))
5432 /* Unscoped lookup of a global: iterate over current namespaces,
5433 considering using-directives. If SPACESP is non-NULL, store a list
5434 of the namespaces we've considered in it. */
5437 unqualified_namespace_lookup (name
, flags
, spacesp
)
5442 tree b
= make_node (CPLUS_BINDING
);
5443 tree initial
= current_decl_namespace();
5444 tree scope
= initial
;
5446 struct binding_level
*level
;
5447 tree val
= NULL_TREE
;
5450 *spacesp
= NULL_TREE
;
5452 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5455 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5456 val
= binding_for_name (name
, scope
);
5458 /* Initialize binding for this context. */
5459 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5460 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5462 /* Add all _DECLs seen through local using-directives. */
5463 for (level
= current_binding_level
;
5464 !level
->namespace_p
;
5465 level
= level
->level_chain
)
5466 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5467 scope
, flags
, spacesp
))
5468 /* Give up because of error. */
5469 return error_mark_node
;
5471 /* Add all _DECLs seen through global using-directives. */
5472 /* XXX local and global using lists should work equally. */
5476 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5477 scope
, flags
, spacesp
))
5478 /* Give up because of error. */
5479 return error_mark_node
;
5480 if (siter
== scope
) break;
5481 siter
= CP_DECL_CONTEXT (siter
);
5484 val
= select_decl (b
, flags
);
5485 if (scope
== global_namespace
)
5491 /* Combine prefer_type and namespaces_only into flags. */
5494 lookup_flags (prefer_type
, namespaces_only
)
5495 int prefer_type
, namespaces_only
;
5497 if (namespaces_only
)
5498 return LOOKUP_PREFER_NAMESPACES
;
5499 if (prefer_type
> 1)
5500 return LOOKUP_PREFER_TYPES
;
5501 if (prefer_type
> 0)
5502 return LOOKUP_PREFER_BOTH
;
5506 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5507 ignore it or not. Subroutine of lookup_name_real. */
5510 qualify_lookup (val
, flags
)
5514 if (val
== NULL_TREE
)
5516 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5518 if ((flags
& LOOKUP_PREFER_TYPES
)
5519 && (TREE_CODE (val
) == TYPE_DECL
5520 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5521 && DECL_CLASS_TEMPLATE_P (val
))))
5523 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5528 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5532 warn_about_implicit_typename_lookup (typename
, binding
)
5536 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5537 tree name
= DECL_NAME (typename
);
5539 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5540 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5541 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5542 && ! (TREE_CODE (binding
) == TYPE_DECL
5543 && same_type_p (TREE_TYPE (binding
), subtype
)))
5545 cp_warning ("lookup of `%D' finds `%#D'",
5547 cp_warning (" instead of `%D' from dependent base class",
5549 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5550 constructor_name (current_class_type
), name
);
5554 /* Look up NAME in the current binding level and its superiors in the
5555 namespace of variables, functions and typedefs. Return a ..._DECL
5556 node of some kind representing its definition if there is only one
5557 such declaration, or return a TREE_LIST with all the overloaded
5558 definitions if there are many, or return 0 if it is undefined.
5560 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5561 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5562 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5563 Otherwise we prefer non-TYPE_DECLs.
5565 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5566 using IDENTIFIER_CLASS_VALUE. */
5569 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5571 int prefer_type
, nonclass
, namespaces_only
;
5574 tree val
= NULL_TREE
;
5576 tree from_obj
= NULL_TREE
;
5578 int val_is_implicit_typename
= 0;
5580 /* Hack: copy flag set by parser, if set. */
5581 if (only_namespace_names
)
5582 namespaces_only
= 1;
5584 if (prefer_type
== -2)
5586 extern int looking_for_typename
;
5587 tree type
= NULL_TREE
;
5590 prefer_type
= looking_for_typename
;
5592 flags
= lookup_flags (prefer_type
, namespaces_only
);
5593 /* If the next thing is '<', class templates are types. */
5594 if (looking_for_template
)
5595 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5597 /* std:: becomes :: for now. */
5598 if (got_scope
== std_node
)
5599 got_scope
= void_type_node
;
5603 else if (got_object
!= error_mark_node
)
5608 if (type
== error_mark_node
)
5609 return error_mark_node
;
5610 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5611 type
= TREE_TYPE (type
);
5614 type
= complete_type (type
);
5616 if (TREE_CODE (type
) == VOID_TYPE
)
5617 type
= global_namespace
;
5618 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5620 val
= make_node (CPLUS_BINDING
);
5621 flags
|= LOOKUP_COMPLAIN
;
5622 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5624 val
= select_decl (val
, flags
);
5626 else if (! IS_AGGR_TYPE (type
)
5627 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5628 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5629 || TREE_CODE (type
) == TYPENAME_TYPE
)
5630 /* Someone else will give an error about this if needed. */
5632 else if (type
== current_class_type
)
5633 val
= IDENTIFIER_CLASS_VALUE (name
);
5635 val
= lookup_member (type
, name
, 0, prefer_type
);
5642 else if (got_object
&& val
)
5647 flags
= lookup_flags (prefer_type
, namespaces_only
);
5648 /* If we're not parsing, we need to complain. */
5649 flags
|= LOOKUP_COMPLAIN
;
5652 /* First, look in non-namespace scopes. */
5654 if (current_class_type
== NULL_TREE
)
5657 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5661 if (!LOCAL_BINDING_P (t
) && nonclass
)
5662 /* We're not looking for class-scoped bindings, so keep going. */
5665 /* If this is the kind of thing we're looking for, we're done. */
5666 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5667 binding
= BINDING_VALUE (t
);
5668 else if ((flags
& LOOKUP_PREFER_TYPES
)
5669 && qualify_lookup (BINDING_TYPE (t
), flags
))
5670 binding
= BINDING_TYPE (t
);
5672 binding
= NULL_TREE
;
5675 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5677 if (val_is_implicit_typename
&& !yylex
)
5678 warn_about_implicit_typename_lookup (val
, binding
);
5680 val_is_implicit_typename
5681 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5682 if (!val_is_implicit_typename
)
5687 /* Now lookup in namespace scopes. */
5688 if (!val
|| val_is_implicit_typename
)
5690 t
= unqualified_namespace_lookup (name
, flags
, 0);
5693 if (val_is_implicit_typename
&& !yylex
)
5694 warn_about_implicit_typename_lookup (val
, t
);
5702 /* This should only warn about types used in qualified-ids. */
5703 if (from_obj
&& from_obj
!= val
)
5705 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5706 && TREE_CODE (val
) == TYPE_DECL
5707 && TREE_TYPE (from_obj
) != TREE_TYPE (val
))
5709 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5710 name
, got_object
, TREE_TYPE (from_obj
));
5711 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
5715 /* We don't change val to from_obj if got_object depends on
5716 template parms because that breaks implicit typename for
5717 destructor calls. */
5718 if (! uses_template_parms (got_object
))
5722 /* If we have a single function from a using decl, pull it out. */
5723 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5724 val
= OVL_FUNCTION (val
);
5733 lookup_name_nonclass (name
)
5736 return lookup_name_real (name
, 0, 1, 0);
5740 lookup_function_nonclass (name
, args
)
5744 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
5748 lookup_name_namespace_only (name
)
5751 /* type-or-namespace, nonclass, namespace_only */
5752 return lookup_name_real (name
, 1, 1, 1);
5756 lookup_name (name
, prefer_type
)
5760 return lookup_name_real (name
, prefer_type
, 0, 0);
5763 /* Similar to `lookup_name' but look only in the innermost non-class
5767 lookup_name_current_level (name
)
5770 struct binding_level
*b
;
5773 b
= current_binding_level
;
5774 while (b
->parm_flag
== 2)
5779 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
5781 /* extern "C" function() */
5782 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
5785 else if (IDENTIFIER_BINDING (name
)
5786 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
5790 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
5791 return IDENTIFIER_VALUE (name
);
5803 /* Like lookup_name_current_level, but for types. */
5806 lookup_type_current_level (name
)
5809 register tree t
= NULL_TREE
;
5811 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
5813 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
5814 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
5816 struct binding_level
*b
= current_binding_level
;
5819 if (purpose_member (name
, b
->type_shadowed
))
5820 return REAL_IDENTIFIER_TYPE_VALUE (name
);
5832 begin_only_namespace_names ()
5834 only_namespace_names
= 1;
5838 end_only_namespace_names ()
5840 only_namespace_names
= 0;
5843 /* Arrange for the user to get a source line number, even when the
5844 compiler is going down in flames, so that she at least has a
5845 chance of working around problems in the compiler. We used to
5846 call error(), but that let the segmentation fault continue
5847 through; now, it's much more passive by asking them to send the
5848 maintainers mail about the problem. */
5852 int sig ATTRIBUTE_UNUSED
;
5854 signal (SIGSEGV
, SIG_DFL
);
5856 signal (SIGIOT
, SIG_DFL
);
5859 signal (SIGILL
, SIG_DFL
);
5862 signal (SIGABRT
, SIG_DFL
);
5865 signal (SIGBUS
, SIG_DFL
);
5867 my_friendly_abort (0);
5870 /* Push the declarations of builtin types into the namespace.
5871 RID_INDEX, if < RID_MAX is the index of the builtin type
5872 in the array RID_POINTERS. NAME is the name used when looking
5873 up the builtin type. TYPE is the _TYPE node for the builtin type. */
5876 record_builtin_type (rid_index
, name
, type
)
5881 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
5882 tree tdecl
= NULL_TREE
;
5884 if ((int) rid_index
< (int) RID_MAX
)
5885 rname
= ridpointers
[(int) rid_index
];
5887 tname
= get_identifier (name
);
5889 TYPE_BUILT_IN (type
) = 1;
5893 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
5894 set_identifier_type_value (tname
, NULL_TREE
);
5895 if ((int) rid_index
< (int) RID_MAX
)
5896 /* Built-in types live in the global namespace. */
5897 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
5899 if (rname
!= NULL_TREE
)
5901 if (tname
!= NULL_TREE
)
5903 set_identifier_type_value (rname
, NULL_TREE
);
5904 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
5908 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
5909 set_identifier_type_value (rname
, NULL_TREE
);
5914 /* Record one of the standard Java types.
5915 * Declare it as having the given NAME.
5916 * If SIZE > 0, it is the size of one of the integral types;
5917 * otherwise it is the negative of the size of one of the other types. */
5920 record_builtin_java_type (name
, size
)
5926 type
= make_signed_type (size
);
5927 else if (size
> -32)
5928 { /* "__java_char" or ""__java_boolean". */
5929 type
= make_unsigned_type (-size
);
5930 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
5933 { /* "__java_float" or ""__java_double". */
5934 type
= make_node (REAL_TYPE
);
5935 TYPE_PRECISION (type
) = - size
;
5938 record_builtin_type (RID_MAX
, name
, type
);
5939 decl
= TYPE_NAME (type
);
5941 /* Suppress generate debug symbol entries for these types,
5942 since for normal C++ they are just clutter.
5943 However, push_lang_context undoes this if extern "Java" is seen. */
5944 DECL_IGNORED_P (decl
) = 1;
5946 TYPE_FOR_JAVA (type
) = 1;
5950 /* Push a type into the namespace so that the back-ends ignore it. */
5953 record_unknown_type (type
, name
)
5957 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
5958 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
5959 DECL_IGNORED_P (decl
) = 1;
5960 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
5961 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
5962 TYPE_ALIGN (type
) = 1;
5963 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
5966 /* Push overloaded decl, in global scope, with one argument so it
5967 can be used as a callback from define_function. */
5970 push_overloaded_decl_1 (x
)
5973 push_overloaded_decl (x
, PUSH_GLOBAL
);
5980 auto_function (name
, type
)
5983 return define_function
5984 (IDENTIFIER_POINTER (name
), type
, push_overloaded_decl_1
,
5985 IDENTIFIER_POINTER (build_decl_overload (name
, TYPE_ARG_TYPES (type
),
5989 /* Create the predefined scalar types of C,
5990 and some nodes representing standard constants (0, 1, (void *)0).
5991 Initialize the global binding level.
5992 Make definitions for built-in primitive functions. */
5995 init_decl_processing ()
5998 int wchar_type_size
;
5999 tree array_domain_type
;
6001 /* Have to make these distinct before we try using them. */
6002 lang_name_cplusplus
= get_identifier ("C++");
6003 lang_name_c
= get_identifier ("C");
6004 lang_name_java
= get_identifier ("Java");
6006 /* Let the back-end now how to save and restore language-specific
6007 per-function globals. */
6008 init_lang_status
= &push_cp_function_context
;
6009 free_lang_status
= &pop_cp_function_context
;
6010 mark_lang_status
= &mark_cp_function_context
;
6016 /* Create the global variables. */
6017 push_to_top_level ();
6019 /* Enter the global namespace. */
6020 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
6021 push_namespace (get_identifier ("::"));
6022 global_namespace
= current_namespace
;
6023 current_lang_name
= NULL_TREE
;
6025 if (flag_strict_prototype
== 2)
6026 flag_strict_prototype
= pedantic
;
6027 if (! flag_permissive
&& ! pedantic
)
6028 flag_pedantic_errors
= 1;
6030 strict_prototypes_lang_c
= flag_strict_prototype
;
6033 current_lang_name
= lang_name_c
;
6035 current_function_decl
= NULL_TREE
;
6036 current_binding_level
= NULL_BINDING_LEVEL
;
6037 free_binding_level
= NULL_BINDING_LEVEL
;
6039 /* Because most segmentation signals can be traced back into user
6040 code, catch them and at least give the user a chance of working
6041 around compiler bugs. */
6042 signal (SIGSEGV
, signal_catch
);
6044 /* We will also catch aborts in the back-end through signal_catch and
6045 give the user a chance to see where the error might be, and to defeat
6046 aborts in the back-end when there have been errors previously in their
6049 signal (SIGIOT
, signal_catch
);
6052 signal (SIGILL
, signal_catch
);
6055 signal (SIGABRT
, signal_catch
);
6058 signal (SIGBUS
, signal_catch
);
6061 gcc_obstack_init (&decl_obstack
);
6063 build_common_tree_nodes (flag_signed_char
);
6065 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6066 TREE_TYPE (error_mark_list
) = error_mark_node
;
6068 /* Make the binding_level structure for global names. */
6070 global_binding_level
= current_binding_level
;
6071 /* The global level is the namespace level of ::. */
6072 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6073 declare_namespace_level ();
6075 this_identifier
= get_identifier (THIS_NAME
);
6076 in_charge_identifier
= get_identifier (IN_CHARGE_NAME
);
6077 ctor_identifier
= get_identifier (CTOR_NAME
);
6078 dtor_identifier
= get_identifier (DTOR_NAME
);
6079 pfn_identifier
= get_identifier (VTABLE_PFN_NAME
);
6080 index_identifier
= get_identifier (VTABLE_INDEX_NAME
);
6081 delta_identifier
= get_identifier (VTABLE_DELTA_NAME
);
6082 delta2_identifier
= get_identifier (VTABLE_DELTA2_NAME
);
6083 pfn_or_delta2_identifier
= get_identifier ("__pfn_or_delta2");
6085 /* Define `int' and `char' first so that dbx will output them first. */
6086 record_builtin_type (RID_INT
, NULL_PTR
, integer_type_node
);
6087 record_builtin_type (RID_CHAR
, "char", char_type_node
);
6089 /* `signed' is the same as `int' */
6090 record_builtin_type (RID_SIGNED
, NULL_PTR
, integer_type_node
);
6091 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
6092 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
6093 record_builtin_type (RID_MAX
, "long unsigned int", long_unsigned_type_node
);
6094 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
6095 record_builtin_type (RID_MAX
, "long long int", long_long_integer_type_node
);
6096 record_builtin_type (RID_MAX
, "long long unsigned int",
6097 long_long_unsigned_type_node
);
6098 record_builtin_type (RID_MAX
, "long long unsigned",
6099 long_long_unsigned_type_node
);
6100 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
6101 record_builtin_type (RID_MAX
, "short unsigned int", short_unsigned_type_node
);
6102 record_builtin_type (RID_MAX
, "unsigned short", short_unsigned_type_node
);
6105 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE
)));
6107 /* Define both `signed char' and `unsigned char'. */
6108 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
6109 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
6111 /* `unsigned long' is the standard type for sizeof.
6112 Note that stddef.h uses `unsigned long',
6113 and this must agree, even if long and int are the same size. */
6115 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE
))));
6117 /* Create the widest literal types. */
6118 widest_integer_literal_type_node
= make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
6119 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6120 widest_integer_literal_type_node
));
6122 widest_unsigned_literal_type_node
= make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
6123 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6124 widest_unsigned_literal_type_node
));
6126 /* These are types that type_for_size and type_for_mode use. */
6127 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intQI_type_node
));
6128 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intHI_type_node
));
6129 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intSI_type_node
));
6130 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intDI_type_node
));
6131 #if HOST_BITS_PER_WIDE_INT >= 64
6132 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__int128_t"), intTI_type_node
));
6134 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intQI_type_node
));
6135 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intHI_type_node
));
6136 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intSI_type_node
));
6137 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intDI_type_node
));
6138 #if HOST_BITS_PER_WIDE_INT >= 64
6139 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__uint128_t"), unsigned_intTI_type_node
));
6142 build_common_tree_nodes_2 (flag_short_double
);
6144 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6145 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6146 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6147 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6148 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6149 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6150 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6151 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6153 integer_two_node
= build_int_2 (2, 0);
6154 TREE_TYPE (integer_two_node
) = integer_type_node
;
6155 integer_three_node
= build_int_2 (3, 0);
6156 TREE_TYPE (integer_three_node
) = integer_type_node
;
6158 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6159 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6160 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6161 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6162 TYPE_PRECISION (boolean_type_node
) = 1;
6163 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6164 boolean_false_node
= build_int_2 (0, 0);
6165 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6166 boolean_true_node
= build_int_2 (1, 0);
6167 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6169 signed_size_zero_node
= build_int_2 (0, 0); record_builtin_type (RID_FLOAT
, NULL_PTR
, float_type_node
);
6170 record_builtin_type (RID_DOUBLE
, NULL_PTR
, double_type_node
);
6171 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
6173 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex int"),
6174 complex_integer_type_node
));
6175 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex float"),
6176 complex_float_type_node
));
6177 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex double"),
6178 complex_double_type_node
));
6179 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
6180 complex_long_double_type_node
));
6182 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6184 record_builtin_type (RID_VOID
, NULL_PTR
, void_type_node
);
6185 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
6186 TREE_PARMLIST (void_list_node
) = 1;
6188 /* Used for expressions that do nothing, but are not errors. */
6189 void_zero_node
= build_int_2 (0, 0);
6190 TREE_TYPE (void_zero_node
) = void_type_node
;
6192 string_type_node
= build_pointer_type (char_type_node
);
6193 const_string_type_node
6194 = build_pointer_type (build_qualified_type (char_type_node
,
6196 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6198 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
6201 /* Make a type to be the domain of a few array types
6202 whose domains don't really matter.
6203 200 is small enough that it always fits in size_t
6204 and large enough that it can hold most function names for the
6205 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
6206 array_domain_type
= build_index_type (build_int_2 (200, 0));
6208 /* Make a type for arrays of characters.
6209 With luck nothing will ever really depend on the length of this
6211 char_array_type_node
6212 = build_array_type (char_type_node
, array_domain_type
);
6213 /* Likewise for arrays of ints. */
6215 = build_array_type (integer_type_node
, array_domain_type
);
6217 /* This is just some anonymous class type. Nobody should ever
6218 need to look inside this envelope. */
6219 class_star_type_node
= build_pointer_type (make_lang_type (RECORD_TYPE
));
6221 if (flag_huge_objects
)
6222 delta_type_node
= long_integer_type_node
;
6224 delta_type_node
= short_integer_type_node
;
6226 default_function_type
6227 = build_function_type (integer_type_node
, NULL_TREE
);
6229 ptr_type_node
= build_pointer_type (void_type_node
);
6231 = build_pointer_type (build_qualified_type (void_type_node
,
6233 c_common_nodes_and_builtins (1, flag_no_builtin
, flag_no_nonansi_builtin
);
6236 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6238 /* C++ extensions */
6240 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6241 record_unknown_type (unknown_type_node
, "unknown type");
6243 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6244 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6246 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6248 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6250 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6251 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6253 /* This is special for C++ so functions can be overloaded. */
6254 wchar_type_node
= get_identifier (flag_short_wchar
6255 ? "short unsigned int"
6257 wchar_type_node
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (wchar_type_node
));
6258 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
6259 signed_wchar_type_node
= make_signed_type (wchar_type_size
);
6260 unsigned_wchar_type_node
= make_unsigned_type (wchar_type_size
);
6262 = TREE_UNSIGNED (wchar_type_node
)
6263 ? unsigned_wchar_type_node
6264 : signed_wchar_type_node
;
6265 record_builtin_type (RID_WCHAR
, "__wchar_t", wchar_type_node
);
6267 /* Artificial declaration of wchar_t -- can be bashed */
6268 wchar_decl_node
= build_decl (TYPE_DECL
, get_identifier ("wchar_t"),
6270 pushdecl (wchar_decl_node
);
6272 /* This is for wide string constants. */
6273 wchar_array_type_node
6274 = build_array_type (wchar_type_node
, array_domain_type
);
6276 if (flag_vtable_thunks
)
6278 /* Make sure we get a unique function type, so we can give
6279 its pointer type a name. (This wins for gdb.) */
6280 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6281 TREE_TYPE (vfunc_type
) = integer_type_node
;
6282 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6283 layout_type (vfunc_type
);
6285 vtable_entry_type
= build_pointer_type (vfunc_type
);
6289 vtable_entry_type
= make_lang_type (RECORD_TYPE
);
6290 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
6292 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
6294 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_identifier
,
6296 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6299 /* Make this part of an invisible union. */
6300 fields
[3] = copy_node (fields
[2]);
6301 TREE_TYPE (fields
[3]) = delta_type_node
;
6302 DECL_NAME (fields
[3]) = delta2_identifier
;
6303 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6304 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6305 TREE_UNSIGNED (fields
[3]) = 0;
6306 TREE_CHAIN (fields
[2]) = fields
[3];
6307 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6310 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6313 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6314 layout_type (vtbl_type_node
);
6315 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6316 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6317 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6318 layout_type (vtbl_ptr_type_node
);
6319 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6321 std_node
= build_decl (NAMESPACE_DECL
,
6322 get_identifier (flag_honor_std
? "fake std":"std"),
6324 pushdecl (std_node
);
6326 global_type_node
= make_node (LANG_TYPE
);
6327 record_unknown_type (global_type_node
, "global type");
6330 current_lang_name
= lang_name_cplusplus
;
6333 tree bad_alloc_type_node
, newtype
, deltype
;
6335 push_namespace (get_identifier ("std"));
6336 bad_alloc_type_node
= xref_tag
6337 (class_type_node
, get_identifier ("bad_alloc"), 1);
6340 newtype
= build_exception_variant
6341 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6342 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6343 auto_function (ansi_opname
[(int) NEW_EXPR
], newtype
);
6344 auto_function (ansi_opname
[(int) VEC_NEW_EXPR
], newtype
);
6345 global_delete_fndecl
= auto_function (ansi_opname
[(int) DELETE_EXPR
],
6347 auto_function (ansi_opname
[(int) VEC_DELETE_EXPR
], deltype
);
6351 = define_function ("__pure_virtual", void_ftype
, 0, 0);
6353 /* Perform other language dependent initializations. */
6354 init_class_processing ();
6355 init_init_processing ();
6356 init_search_processing ();
6358 init_rtti_processing ();
6360 if (flag_exceptions
)
6361 init_exception_processing ();
6364 flag_inline_functions
= 0;
6367 if (! supports_one_only ())
6370 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6371 declare_function_name ();
6373 /* Prepare to check format strings against argument lists. */
6374 init_function_format_info ();
6376 /* Show we use EH for cleanups. */
6377 using_eh_for_cleanups ();
6379 print_error_function
= lang_print_error_function
;
6380 lang_get_alias_set
= &c_get_alias_set
;
6381 valid_lang_attribute
= cp_valid_lang_attribute
;
6383 /* Maintain consistency. Perhaps we should just complain if they
6384 say -fwritable-strings? */
6385 if (flag_writable_strings
)
6386 flag_const_strings
= 0;
6388 /* Add GC roots for all of our global variables. */
6389 ggc_add_tree_root (c_global_trees
, sizeof c_global_trees
/ sizeof(tree
));
6390 ggc_add_tree_root (cp_global_trees
, sizeof cp_global_trees
/ sizeof(tree
));
6391 ggc_add_tree_root (&integer_three_node
, 1);
6392 ggc_add_tree_root (&integer_two_node
, 1);
6393 ggc_add_tree_root (&signed_size_zero_node
, 1);
6394 ggc_add_tree_root (&size_one_node
, 1);
6395 ggc_add_tree_root (&size_zero_node
, 1);
6396 ggc_add_root (&global_binding_level
, 1, sizeof global_binding_level
,
6397 mark_binding_level
);
6398 ggc_add_root (&scope_chain
, 1, sizeof scope_chain
, &mark_saved_scope
);
6399 ggc_add_tree_root (&static_ctors
, 1);
6400 ggc_add_tree_root (&static_dtors
, 1);
6401 ggc_add_tree_root (&lastiddecl
, 1);
6403 ggc_add_tree_root (&enum_next_value
, 1);
6404 ggc_add_tree_root (&last_function_parm_tags
, 1);
6405 ggc_add_tree_root (¤t_function_return_value
, 1);
6406 ggc_add_tree_root (¤t_function_parms
, 1);
6407 ggc_add_tree_root (¤t_function_parm_tags
, 1);
6408 ggc_add_tree_root (&last_function_parms
, 1);
6409 ggc_add_tree_root (&error_mark_list
, 1);
6411 ggc_add_tree_root (&global_namespace
, 1);
6412 ggc_add_tree_root (&global_type_node
, 1);
6413 ggc_add_tree_root (&anonymous_namespace_name
, 1);
6415 ggc_add_tree_root (&got_object
, 1);
6416 ggc_add_tree_root (&got_scope
, 1);
6418 ggc_add_tree_root (¤t_lang_name
, 1);
6419 ggc_add_tree_root (&static_aggregates
, 1);
6422 /* Function to print any language-specific context for an error message. */
6425 lang_print_error_function (file
)
6428 default_print_error_function (file
);
6429 maybe_print_template_context ();
6432 /* Make a definition for a builtin function named NAME and whose data type
6433 is TYPE. TYPE should be a function type with argument types.
6435 If LIBRARY_NAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6436 the name to be called if we can't opencode the function. */
6439 define_function (name
, type
, pfn
, library_name
)
6442 void (*pfn
) PROTO((tree
));
6443 const char *library_name
;
6445 tree decl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), type
);
6446 DECL_EXTERNAL (decl
) = 1;
6447 TREE_PUBLIC (decl
) = 1;
6448 DECL_ARTIFICIAL (decl
) = 1;
6450 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6451 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
6453 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6454 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6455 function in the namespace. */
6456 if (pfn
) (*pfn
) (decl
);
6458 DECL_ASSEMBLER_NAME (decl
) = get_identifier (library_name
);
6459 make_function_rtl (decl
);
6464 /* Wrapper around define_function, for the benefit of
6465 c_common_nodes_and_builtins.
6466 FUNCTION_CODE tells later passes how to compile calls to this function.
6467 See tree.h for its possible values. */
6470 builtin_function (name
, type
, code
, class, libname
)
6474 enum built_in_class
class;
6475 const char *libname
;
6477 tree decl
= define_function (name
, type
, (void (*) PROTO((tree
)))pushdecl
,
6479 DECL_BUILT_IN_CLASS (decl
) = class;
6480 DECL_FUNCTION_CODE (decl
) = code
;
6484 /* When we call finish_struct for an anonymous union, we create
6485 default copy constructors and such. But, an anonymous union
6486 shouldn't have such things; this function undoes the damage to the
6487 anonymous union type T.
6489 (The reason that we create the synthesized methods is that we don't
6490 distinguish `union { int i; }' from `typedef union { int i; } U'.
6491 The first is an anonymous union; the second is just an ordinary
6495 fixup_anonymous_aggr (t
)
6500 /* Wipe out memory of synthesized methods */
6501 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6502 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6503 TYPE_HAS_INIT_REF (t
) = 0;
6504 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6505 TYPE_HAS_ASSIGN_REF (t
) = 0;
6506 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6508 /* Splice the implicitly generated functions out of the TYPE_METHODS
6510 q
= &TYPE_METHODS (t
);
6513 if (DECL_ARTIFICIAL (*q
))
6514 *q
= TREE_CHAIN (*q
);
6516 q
= &TREE_CHAIN (*q
);
6519 /* ANSI C++ June 5 1992 WP 9.5.3. Anonymous unions may not have
6520 function members. */
6521 if (TYPE_METHODS (t
))
6522 error ("an anonymous union cannot have function members");
6525 /* Make sure that a declaration with no declarator is well-formed, i.e.
6526 just defines a tagged type or anonymous union.
6528 Returns the type defined, if any. */
6531 check_tag_decl (declspecs
)
6535 tree ob_modifier
= NULL_TREE
;
6537 register tree t
= NULL_TREE
;
6539 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6541 register tree value
= TREE_VALUE (link
);
6547 if (IS_AGGR_TYPE (value
) || TREE_CODE (value
) == ENUMERAL_TYPE
)
6549 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6553 else if (value
== ridpointers
[(int) RID_FRIEND
])
6555 if (current_class_type
== NULL_TREE
6556 || current_scope () != current_class_type
)
6557 ob_modifier
= value
;
6559 else if (value
== ridpointers
[(int) RID_STATIC
]
6560 || value
== ridpointers
[(int) RID_EXTERN
]
6561 || value
== ridpointers
[(int) RID_AUTO
]
6562 || value
== ridpointers
[(int) RID_REGISTER
]
6563 || value
== ridpointers
[(int) RID_INLINE
]
6564 || value
== ridpointers
[(int) RID_VIRTUAL
]
6565 || value
== ridpointers
[(int) RID_CONST
]
6566 || value
== ridpointers
[(int) RID_VOLATILE
]
6567 || value
== ridpointers
[(int) RID_EXPLICIT
])
6568 ob_modifier
= value
;
6572 error ("multiple types in one declaration");
6574 /* Inside a class, we might be in a friend or access declaration.
6575 Until we have a good way of detecting the latter, don't warn. */
6576 if (t
== NULL_TREE
&& ! current_class_type
)
6577 pedwarn ("declaration does not declare anything");
6579 /* Check for an anonymous union. We're careful
6580 accessing TYPE_IDENTIFIER because some built-in types, like
6581 pointer-to-member types, do not have TYPE_NAME. */
6582 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
6584 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
6586 /* Anonymous unions are objects, so they can have specifiers. */;
6587 SET_ANON_AGGR_TYPE_P (t
);
6589 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
6590 pedwarn ("ISO C++ prohibits anonymous structs");
6593 else if (ob_modifier
)
6595 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
6596 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
6597 cp_error ("`%D' can only be specified for functions", ob_modifier
);
6598 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
6599 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
6600 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
6601 cp_error ("`%D' can only be specified for constructors",
6604 cp_error ("`%D' can only be specified for objects and functions",
6611 /* Called when a declaration is seen that contains no names to declare.
6612 If its type is a reference to a structure, union or enum inherited
6613 from a containing scope, shadow that tag name for the current scope
6614 with a forward reference.
6615 If its type defines a new named structure or union
6616 or defines an enum, it is valid but we need not do anything here.
6617 Otherwise, it is an error.
6619 C++: may have to grok the declspecs to learn about static,
6620 complain for anonymous unions. */
6623 shadow_tag (declspecs
)
6626 tree t
= check_tag_decl (declspecs
);
6629 maybe_process_partial_specialization (t
);
6631 /* This is where the variables in an anonymous union are
6632 declared. An anonymous union declaration looks like:
6634 because there is no declarator after the union, the parser
6635 sends that declaration here. */
6636 if (t
&& ANON_AGGR_TYPE_P (t
))
6638 fixup_anonymous_aggr (t
);
6640 if (TYPE_FIELDS (t
))
6642 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
6644 finish_anon_union (decl
);
6649 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6652 groktypename (typename
)
6655 if (TREE_CODE (typename
) != TREE_LIST
)
6657 return grokdeclarator (TREE_VALUE (typename
),
6658 TREE_PURPOSE (typename
),
6659 TYPENAME
, 0, NULL_TREE
);
6662 /* Decode a declarator in an ordinary declaration or data definition.
6663 This is called as soon as the type information and variable name
6664 have been parsed, before parsing the initializer if any.
6665 Here we create the ..._DECL node, fill in its type,
6666 and put it on the list of decls for the current context.
6667 The ..._DECL node is returned as the value.
6669 Exception: for arrays where the length is not specified,
6670 the type is left null, to be filled in by `cp_finish_decl'.
6672 Function definitions do not come here; they go to start_function
6673 instead. However, external and forward declarations of functions
6674 do go through here. Structure field declarations are done by
6675 grokfield and not through here. */
6677 /* Set this to zero to debug not using the temporary obstack
6678 to parse initializers. */
6679 int debug_temp_inits
= 1;
6682 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
6683 tree declarator
, declspecs
;
6685 tree attributes
, prefix_attributes
;
6688 register tree type
, tem
;
6690 extern int have_extern_spec
;
6691 extern int used_extern_spec
;
6695 /* See code below that used this. */
6696 int init_written
= initialized
;
6699 /* This should only be done once on the top most decl. */
6700 if (have_extern_spec
&& !used_extern_spec
)
6702 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"),
6704 used_extern_spec
= 1;
6707 if (attributes
|| prefix_attributes
)
6708 attrlist
= build_scratch_list (attributes
, prefix_attributes
);
6710 attrlist
= NULL_TREE
;
6712 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
6715 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
6718 type
= TREE_TYPE (decl
);
6720 if (type
== error_mark_node
)
6724 = (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
6725 ? DECL_CLASS_CONTEXT (decl
)
6726 : DECL_CONTEXT (decl
);
6728 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
6729 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
6731 /* When parsing the initializer, lookup should use the object's
6733 push_decl_namespace (context
);
6736 /* We are only interested in class contexts, later. */
6737 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
6738 context
= NULL_TREE
;
6741 /* Is it valid for this decl to have an initializer at all?
6742 If not, set INITIALIZED to zero, which will indirectly
6743 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6744 switch (TREE_CODE (decl
))
6747 /* typedef foo = bar means give foo the same type as bar.
6748 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
6749 Any other case of an initialization in a TYPE_DECL is an error. */
6750 if (pedantic
|| list_length (declspecs
) > 1)
6752 cp_error ("typedef `%D' is initialized", decl
);
6758 cp_error ("function `%#D' is initialized like a variable", decl
);
6768 if (! toplevel_bindings_p ()
6769 && DECL_EXTERNAL (decl
))
6770 cp_warning ("declaration of `%#D' has `extern' and is initialized",
6772 DECL_EXTERNAL (decl
) = 0;
6773 if (toplevel_bindings_p ())
6774 TREE_STATIC (decl
) = 1;
6776 /* Tell `pushdecl' this is an initialized decl
6777 even though we don't yet have the initializer expression.
6778 Also tell `cp_finish_decl' it may store the real initializer. */
6779 DECL_INITIAL (decl
) = error_mark_node
;
6782 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
6783 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
6786 /* Set attributes here so if duplicate decl, will have proper attributes. */
6787 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
6789 if (context
&& TYPE_SIZE (complete_type (context
)) != NULL_TREE
)
6791 push_nested_class (context
, 2);
6793 if (TREE_CODE (decl
) == VAR_DECL
)
6795 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
6796 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
6797 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
6800 if (DECL_CONTEXT (field
) != context
)
6802 cp_pedwarn ("ANSI C++ does not permit `%T::%D' to be defined as `%T::%D'",
6803 DECL_CONTEXT (field
), DECL_NAME (decl
),
6804 context
, DECL_NAME (decl
));
6805 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
6807 /* Static data member are tricky; an in-class initialization
6808 still doesn't provide a definition, so the in-class
6809 declaration will have DECL_EXTERNAL set, but will have an
6810 initialization. Thus, duplicate_decls won't warn
6811 about this situation, and so we check here. */
6812 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
6813 cp_error ("duplicate initialization of %D", decl
);
6814 if (duplicate_decls (decl
, field
))
6820 tree field
= check_classfn (context
, decl
);
6821 if (field
&& duplicate_decls (decl
, field
))
6825 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
6826 DECL_IN_AGGR_P (decl
) = 0;
6827 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
6828 || CLASSTYPE_USE_TEMPLATE (context
))
6830 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
6831 /* [temp.expl.spec] An explicit specialization of a static data
6832 member of a template is a definition if the declaration
6833 includes an initializer; otherwise, it is a declaration.
6835 We check for processing_specialization so this only applies
6836 to the new specialization syntax. */
6837 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
6838 DECL_EXTERNAL (decl
) = 1;
6841 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
6842 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
6846 /* Enter this declaration into the symbol table. */
6847 tem
= maybe_push_decl (decl
);
6849 if (processing_template_decl
)
6851 if (at_function_scope_p ())
6852 push_permanent_obstack ();
6853 tem
= push_template_decl (tem
);
6854 if (at_function_scope_p ())
6859 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
6860 /* Tell the back-end to use or not use .common as appropriate. If we say
6861 -fconserve-space, we want this to save .data space, at the expense of
6862 wrong semantics. If we say -fno-conserve-space, we want this to
6863 produce errors about redefs; to do this we force variables into the
6865 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
6868 if (! processing_template_decl
)
6871 /* Corresponding pop_obstacks is done in `cp_finish_decl'. */
6872 push_obstacks_nochange ();
6881 tree type
= TREE_TYPE (decl
);
6882 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
6884 if (type
== error_mark_node
)
6887 /* If this type of object needs a cleanup, and control may
6888 jump past it, make a new binding level so that it is cleaned
6889 up only when it is initialized first. */
6890 if (TYPE_NEEDS_DESTRUCTOR (type
)
6891 && current_binding_level
->more_cleanups_ok
== 0)
6892 pushlevel_temporary (1);
6895 /* Is it valid for this decl to have an initializer at all?
6896 If not, set INITIALIZED to zero, which will indirectly
6897 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6899 /* Don't allow initializations for incomplete types except for
6900 arrays which might be completed by the initialization. */
6901 if (TYPE_SIZE (complete_type (type
)) != NULL_TREE
)
6902 ; /* A complete type is ok. */
6903 else if (TREE_CODE (type
) != ARRAY_TYPE
)
6905 cp_error ("variable `%#D' has initializer but incomplete type",
6908 type
= TREE_TYPE (decl
) = error_mark_node
;
6910 else if (TYPE_SIZE (complete_type (TREE_TYPE (type
))) == NULL_TREE
)
6912 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
6913 cp_error ("elements of array `%#D' have incomplete type", decl
);
6914 /* else we already gave an error in start_decl. */
6920 && TREE_CODE (decl
) != TYPE_DECL
6921 && TREE_CODE (decl
) != TEMPLATE_DECL
6922 && IS_AGGR_TYPE (type
) && ! DECL_EXTERNAL (decl
))
6924 if ((! processing_template_decl
|| ! uses_template_parms (type
))
6925 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
6927 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
6929 /* Change the type so that assemble_variable will give
6930 DECL an rtl we can live with: (mem (const_int 0)). */
6931 type
= TREE_TYPE (decl
) = error_mark_node
;
6935 /* If any base type in the hierarchy of TYPE needs a constructor,
6936 then we set initialized to 1. This way any nodes which are
6937 created for the purposes of initializing this aggregate
6938 will live as long as it does. This is necessary for global
6939 aggregates which do not have their initializers processed until
6940 the end of the file. */
6941 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
6946 DECL_INITIAL (decl
) = NULL_TREE
;
6949 /* Handle initialization of references.
6950 These three arguments are from `cp_finish_decl', and have the
6951 same meaning here that they do there.
6953 Quotes on semantics can be found in ARM 8.4.3. */
6956 grok_reference_init (decl
, type
, init
)
6957 tree decl
, type
, init
;
6961 if (init
== NULL_TREE
)
6963 if ((DECL_LANG_SPECIFIC (decl
) == 0
6964 || DECL_IN_AGGR_P (decl
) == 0)
6965 && ! DECL_THIS_EXTERN (decl
))
6966 cp_error ("`%D' declared as reference but not initialized", decl
);
6970 if (init
== error_mark_node
)
6973 if (TREE_CODE (init
) == CONSTRUCTOR
)
6975 cp_error ("ANSI C++ forbids use of initializer list to initialize reference `%D'", decl
);
6979 if (TREE_CODE (init
) == TREE_LIST
)
6980 init
= build_compound_expr (init
);
6982 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
6983 init
= convert_from_reference (init
);
6985 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
6986 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
6988 /* Note: default conversion is only called in very special cases. */
6989 init
= default_conversion (init
);
6992 /* Convert INIT to the reference type TYPE. This may involve the
6993 creation of a temporary, whose lifetime must be the same as that
6994 of the reference. If so, a DECL_STMT for the temporary will be
6995 added just after the DECL_STMT for DECL. That's why we don't set
6996 DECL_INITIAL for local references (instead assigning to them
6997 explicitly); we need to allow the temporary to be initialized
6999 tmp
= convert_to_reference
7000 (type
, init
, CONV_IMPLICIT
,
7001 LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
, decl
);
7003 if (tmp
== error_mark_node
)
7005 else if (tmp
!= NULL_TREE
)
7008 tmp
= save_expr (tmp
);
7009 if (building_stmt_tree ())
7011 /* Initialize the declaration. */
7012 tmp
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, tmp
);
7013 /* Setting TREE_SIDE_EFFECTS prevents expand_expr from
7014 omitting this expression entirely. */
7015 TREE_SIDE_EFFECTS (tmp
) = 1;
7016 finish_expr_stmt (tmp
);
7019 DECL_INITIAL (decl
) = tmp
;
7023 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7027 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
7029 expand_static_init (decl
, DECL_INITIAL (decl
));
7030 DECL_INITIAL (decl
) = NULL_TREE
;
7035 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7036 mucking with forces it does not comprehend (i.e. initialization with a
7037 constructor). If we are at global scope and won't go into COMMON, fill
7038 it in with a dummy CONSTRUCTOR to force the variable into .data;
7039 otherwise we can use error_mark_node. */
7042 obscure_complex_init (decl
, init
)
7045 if (! flag_no_inline
&& TREE_STATIC (decl
))
7047 if (extract_init (decl
, init
))
7051 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7052 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7053 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7057 DECL_INITIAL (decl
) = error_mark_node
;
7062 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7063 array until we finish parsing the initializer. If that's the
7064 situation we're in, update DECL accordingly. */
7067 maybe_deduce_size_from_array_init (decl
, init
)
7071 tree type
= TREE_TYPE (decl
);
7073 if (TREE_CODE (type
) == ARRAY_TYPE
7074 && TYPE_DOMAIN (type
) == NULL_TREE
7075 && TREE_CODE (decl
) != TYPE_DECL
)
7078 = (TREE_STATIC (decl
)
7079 /* Even if pedantic, an external linkage array
7080 may have incomplete type at first. */
7081 ? pedantic
&& ! DECL_EXTERNAL (decl
)
7082 : !DECL_EXTERNAL (decl
));
7083 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7084 int failure
= complete_array_type (type
, initializer
, do_default
);
7087 cp_error ("initializer fails to determine size of `%D'", decl
);
7092 cp_error ("array size missing in `%D'", decl
);
7093 /* If a `static' var's size isn't known, make it extern as
7094 well as static, so it does not get allocated. If it's not
7095 `static', then don't mark it extern; finish_incomplete_decl
7096 will give it a default size and it will get allocated. */
7097 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7098 DECL_EXTERNAL (decl
) = 1;
7101 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7102 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7104 cp_error ("zero-size array `%D'", decl
);
7106 layout_decl (decl
, 0);
7110 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7111 any appropriate error messages regarding the layout. */
7114 layout_var_decl (decl
)
7117 tree type
= TREE_TYPE (decl
);
7118 tree ttype
= target_type (type
);
7120 /* If we haven't already layed out this declaration, do so now.
7121 Note that we must not call complete type for an external object
7122 because it's type might involve templates that we are not
7123 supposed to isntantiate yet. (And it's perfectly legal to say
7124 `extern X x' for some incomplete type `X'.) */
7125 if (!DECL_EXTERNAL (decl
))
7126 complete_type (type
);
7127 if (!DECL_SIZE (decl
)&& TYPE_SIZE (type
))
7128 layout_decl (decl
, 0);
7130 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7132 /* An automatic variable with an incomplete type: that is an error.
7133 Don't talk about array types here, since we took care of that
7134 message in grokdeclarator. */
7135 cp_error ("storage size of `%D' isn't known", decl
);
7136 TREE_TYPE (decl
) = error_mark_node
;
7138 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7139 /* Let debugger know it should output info for this type. */
7140 note_debug_info_needed (ttype
);
7142 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7143 note_debug_info_needed (DECL_CONTEXT (decl
));
7145 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7146 && DECL_SIZE (decl
) != NULL_TREE
7147 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7149 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7150 constant_expression_warning (DECL_SIZE (decl
));
7152 cp_error ("storage size of `%D' isn't constant", decl
);
7156 /* If a local static variable is declared in an inline function, or if
7157 we have a weak definition, we must endeavor to create only one
7158 instance of the variable at link-time. */
7161 maybe_commonize_var (decl
)
7164 /* Static data in a function with comdat linkage also has comdat
7166 if (TREE_STATIC (decl
)
7167 /* Don't mess with __FUNCTION__. */
7168 && ! TREE_ASM_WRITTEN (decl
)
7169 && current_function_decl
7170 && DECL_CONTEXT (decl
) == current_function_decl
7171 && (DECL_THIS_INLINE (current_function_decl
)
7172 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7173 && TREE_PUBLIC (current_function_decl
))
7175 /* Rather than try to get this right with inlining, we suppress
7176 inlining of such functions. */
7177 current_function_cannot_inline
7178 = "function with static variable cannot be inline";
7180 /* If flag_weak, we don't need to mess with this, as we can just
7181 make the function weak, and let it refer to its unique local
7182 copy. This works because we don't allow the function to be
7186 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7188 TREE_PUBLIC (decl
) = 1;
7189 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7191 else if (DECL_INITIAL (decl
) == NULL_TREE
7192 || DECL_INITIAL (decl
) == error_mark_node
)
7194 TREE_PUBLIC (decl
) = 1;
7195 DECL_COMMON (decl
) = 1;
7197 /* else we lose. We can only do this if we can use common,
7198 which we can't if it has been initialized. */
7200 if (TREE_PUBLIC (decl
))
7201 DECL_ASSEMBLER_NAME (decl
)
7202 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7203 else if (! DECL_ARTIFICIAL (decl
))
7205 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7206 cp_warning_at (" you can work around this by removing the initializer", decl
);
7210 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7211 /* Set it up again; we might have set DECL_INITIAL since the last
7213 comdat_linkage (decl
);
7216 /* Issue an error message if DECL is an uninitialized const variable. */
7219 check_for_uninitialized_const_var (decl
)
7222 tree type
= TREE_TYPE (decl
);
7224 /* ``Unless explicitly declared extern, a const object does not have
7225 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7227 if (TREE_CODE (decl
) == VAR_DECL
7228 && TREE_CODE (type
) != REFERENCE_TYPE
7229 && CP_TYPE_CONST_P (type
)
7230 && !TYPE_NEEDS_CONSTRUCTING (type
)
7231 && !DECL_INITIAL (decl
))
7232 cp_error ("uninitialized const `%D'", decl
);
7235 /* Verify INIT (the initializer for DECL), and record the
7236 initialization in DECL_INITIAL, if appropriate. Returns a new
7240 check_initializer (decl
, init
)
7246 if (TREE_CODE (decl
) == FIELD_DECL
)
7249 type
= TREE_TYPE (decl
);
7251 /* If `start_decl' didn't like having an initialization, ignore it now. */
7252 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7255 /* Check the initializer. */
7258 /* Things that are going to be initialized need to have complete
7260 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7262 if (type
== error_mark_node
)
7263 /* We will have already complained. */
7265 else if (TYPE_SIZE (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7267 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7270 else if (TREE_CODE (type
) == ARRAY_TYPE
7271 && !TYPE_SIZE (TREE_TYPE (type
)))
7273 cp_error ("elements of array `%#D' have incomplete type", decl
);
7276 else if (!TYPE_SIZE (type
))
7278 cp_error ("`%D' has incomplete type", decl
);
7279 TREE_TYPE (decl
) = error_mark_node
;
7284 if (TREE_CODE (decl
) == CONST_DECL
)
7286 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7288 DECL_INITIAL (decl
) = init
;
7290 /* This will keep us from needing to worry about our obstacks. */
7291 my_friendly_assert (init
!= NULL_TREE
, 149);
7294 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7296 if (TREE_STATIC (decl
))
7297 make_decl_rtl (decl
, NULL_PTR
, toplevel_bindings_p ());
7298 grok_reference_init (decl
, type
, init
);
7303 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7305 if (TREE_CODE (type
) == ARRAY_TYPE
)
7306 init
= digest_init (type
, init
, (tree
*) 0);
7307 else if (TREE_CODE (init
) == CONSTRUCTOR
7308 && TREE_HAS_CONSTRUCTOR (init
))
7310 if (TYPE_NON_AGGREGATE_CLASS (type
))
7312 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7314 init
= error_mark_node
;
7317 goto dont_use_constructor
;
7322 dont_use_constructor
:
7323 if (TREE_CODE (init
) != TREE_VEC
)
7324 init
= store_init_value (decl
, init
);
7328 /* We must hide the initializer so that expand_decl
7329 won't try to do something it does not understand. */
7330 init
= obscure_complex_init (decl
, init
);
7332 else if (DECL_EXTERNAL (decl
))
7334 else if (TREE_CODE_CLASS (TREE_CODE (type
)) == 't'
7335 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7337 tree core_type
= strip_array_types (type
);
7339 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7341 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7342 cp_error ("structure `%D' with uninitialized const members", decl
);
7343 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7344 cp_error ("structure `%D' with uninitialized reference members",
7348 check_for_uninitialized_const_var (decl
);
7350 if (TYPE_SIZE (type
) != NULL_TREE
7351 && TYPE_NEEDS_CONSTRUCTING (type
))
7352 init
= obscure_complex_init (decl
, NULL_TREE
);
7356 check_for_uninitialized_const_var (decl
);
7361 /* If DECL is not a local variable, give it RTL. */
7364 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
7367 const char *asmspec
;
7372 type
= TREE_TYPE (decl
);
7373 toplev
= toplevel_bindings_p ();
7375 /* Handle non-variables up front. */
7376 if (TREE_CODE (decl
) != VAR_DECL
)
7378 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7382 /* Set the DECL_ASSEMBLER_NAME for the variable. */
7384 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7386 if (DECL_VIRTUAL_P (decl
))
7387 make_decl_rtl (decl
, NULL_PTR
, toplev
);
7388 else if (TREE_READONLY (decl
)
7389 && DECL_INITIAL (decl
) != NULL_TREE
7390 && DECL_INITIAL (decl
) != error_mark_node
7391 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
7393 DECL_INITIAL (decl
) = save_expr (DECL_INITIAL (decl
));
7396 && TREE_STATIC (decl
)
7397 && ! TREE_SIDE_EFFECTS (decl
)
7398 && ! TREE_PUBLIC (decl
)
7399 && ! DECL_EXTERNAL (decl
)
7400 && ! TYPE_NEEDS_DESTRUCTOR (type
)
7401 && DECL_MODE (decl
) != BLKmode
)
7403 /* If this variable is really a constant, then fill its DECL_RTL
7404 slot with something which won't take up storage.
7405 If something later should take its address, we can always give
7406 it legitimate RTL at that time. */
7407 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
7408 store_expr (DECL_INITIAL (decl
), DECL_RTL (decl
), 0);
7409 TREE_ASM_WRITTEN (decl
) = 1;
7411 else if (toplev
&& ! TREE_PUBLIC (decl
))
7413 /* If this is a static const, change its apparent linkage
7414 if it belongs to a #pragma interface. */
7415 if (!interface_unknown
)
7417 TREE_PUBLIC (decl
) = 1;
7418 DECL_EXTERNAL (decl
) = interface_only
;
7420 make_decl_rtl (decl
, asmspec
, toplev
);
7423 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7425 else if (DECL_LANG_SPECIFIC (decl
) && DECL_IN_AGGR_P (decl
))
7427 my_friendly_assert (TREE_STATIC (decl
), 19990828);
7429 if (init
== NULL_TREE
7430 #ifdef DEFAULT_STATIC_DEFS
7431 /* If this code is dead, then users must
7432 explicitly declare static member variables
7433 outside the class def'n as well. */
7434 && TYPE_NEEDS_CONSTRUCTING (type
)
7438 DECL_EXTERNAL (decl
) = 1;
7439 make_decl_rtl (decl
, asmspec
, 1);
7442 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7444 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7445 || (TREE_CODE (decl
) == VAR_DECL
&& TREE_STATIC (decl
)))
7446 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7449 /* The old ARM scoping rules injected variables declared in the
7450 initialization statement of a for-statement into the surrounding
7451 scope. We support this usage, in order to be backward-compatible.
7452 DECL is a just-declared VAR_DECL; if necessary inject its
7453 declaration into the surrounding scope. */
7456 maybe_inject_for_scope_var (decl
)
7459 if (current_binding_level
->is_for_scope
)
7461 struct binding_level
*outer
7462 = current_binding_level
->level_chain
;
7464 /* Check to see if the same name is already bound at the outer
7465 level, either because it was directly declared, or because a
7466 dead for-decl got preserved. In either case, the code would
7467 not have been valid under the ARM scope rules, so clear
7468 is_for_scope for the current_binding_level.
7470 Otherwise, we need to preserve the temp slot for decl to last
7471 into the outer binding level. */
7474 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7476 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7477 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7479 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7481 BINDING_VALUE (outer_binding
)
7482 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7483 current_binding_level
->is_for_scope
= 0;
7485 else if (DECL_IN_MEMORY_P (decl
))
7486 preserve_temp_slots (DECL_RTL (decl
));
7490 /* Generate code to initialize DECL (a local variable). */
7493 initialize_local_var (decl
, init
, flags
)
7500 type
= complete_type (TREE_TYPE (decl
));
7502 if (DECL_SIZE (decl
) == NULL_TREE
&& !TREE_STATIC (decl
))
7504 /* If we used it already as memory, it must stay in memory. */
7505 DECL_INITIAL (decl
) = NULL_TREE
;
7506 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7509 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7513 /* Compute and store the initial value. */
7514 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7516 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7518 int saved_stmts_are_full_exprs_p
;
7520 emit_line_note (DECL_SOURCE_FILE (decl
),
7521 DECL_SOURCE_LINE (decl
));
7522 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p
;
7523 stmts_are_full_exprs_p
= 1;
7524 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7525 stmts_are_full_exprs_p
= saved_stmts_are_full_exprs_p
;
7528 /* Set this to 0 so we can tell whether an aggregate which was
7529 initialized was ever used. Don't do this if it has a
7530 destructor, so we don't complain about the 'resource
7531 allocation is initialization' idiom. Now set
7532 attribute((unused)) on types so decls of that type will be
7533 marked used. (see TREE_USED, above.) */
7534 if (TYPE_NEEDS_CONSTRUCTING (type
)
7536 && !TYPE_NEEDS_DESTRUCTOR (type
)
7537 && DECL_NAME (decl
))
7538 TREE_USED (decl
) = 0;
7539 else if (already_used
)
7540 TREE_USED (decl
) = 1;
7544 /* Generate code to destroy DECL (a local variable). */
7547 destroy_local_var (decl
)
7550 tree type
= TREE_TYPE (decl
);
7553 /* Only variables get cleaned up. */
7554 if (TREE_CODE (decl
) != VAR_DECL
)
7557 /* And only things with destructors need cleaning up. */
7558 if (!TYPE_NEEDS_DESTRUCTOR (type
))
7561 if (TREE_CODE (decl
) == VAR_DECL
&&
7562 (DECL_EXTERNAL (decl
) || TREE_STATIC (decl
)))
7563 /* We don't clean up things that aren't defined in this
7564 translation unit, or that need a static cleanup. The latter
7565 are handled by finish_file. */
7568 /* Compute the cleanup. */
7569 cleanup
= maybe_build_cleanup (decl
);
7571 /* Record the cleanup required for this declaration. */
7572 if (DECL_SIZE (decl
) && TREE_TYPE (decl
) != error_mark_node
7574 finish_decl_cleanup (decl
, cleanup
);
7577 /* Let the back-end know about DECL. */
7580 emit_local_var (decl
)
7583 /* Create RTL for this variable. */
7584 if (DECL_RTL (decl
))
7585 /* Only a RESULT_DECL should have non-NULL RTL when
7586 arriving here. All other local variables are
7587 assigned RTL in this function. */
7588 my_friendly_assert (TREE_CODE (decl
) == RESULT_DECL
,
7592 if (DECL_ASSEMBLER_NAME (decl
) != DECL_NAME (decl
))
7593 /* The user must have specified an assembler name for this
7594 variable. Set that up now. */
7595 rest_of_decl_compilation
7596 (decl
, IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)),
7597 /*top_level=*/0, /*at_end=*/0);
7602 /* Actually do the initialization. */
7603 expand_start_target_temps ();
7604 expand_decl_init (decl
);
7605 expand_end_target_temps ();
7608 /* Finish processing of a declaration;
7609 install its line number and initial value.
7610 If the length of an array type is not known before,
7611 it must be determined now, from the initial value, or it is an error.
7613 Call `pop_obstacks' iff NEED_POP is nonzero.
7615 For C++, `cp_finish_decl' must be fairly evasive: it must keep initializers
7616 for aggregates that have constructors alive on the permanent obstack,
7617 so that the global initializing functions can be written at the end.
7619 INIT0 holds the value of an initializer that should be allowed to escape
7622 FLAGS is LOOKUP_ONLYCONVERTING is the = init syntax was used, else 0
7623 if the (init) syntax was used.
7625 For functions that take default parameters, DECL points to its
7626 "maximal" instantiation. `cp_finish_decl' must then also declared its
7627 subsequently lower and lower forms of instantiation, checking for
7628 ambiguity as it goes. This can be sped up later. */
7631 cp_finish_decl (decl
, init
, asmspec_tree
, need_pop
, flags
)
7638 tree ttype
= NULL_TREE
;
7639 int temporary
= allocation_temporary_p ();
7640 const char *asmspec
= NULL
;
7641 int was_readonly
= 0;
7643 /* If this is 0, then we did not change obstacks. */
7647 error ("assignment (not initialization) in declaration");
7651 /* If a name was specified, get the string. */
7653 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
7655 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
7657 cp_error ("Cannot initialize `%D' to namespace `%D'",
7662 if (current_class_type
7663 && DECL_REAL_CONTEXT (decl
) == current_class_type
7664 && TYPE_BEING_DEFINED (current_class_type
)
7665 && (DECL_INITIAL (decl
) || init
))
7666 DECL_DEFINED_IN_CLASS_P (decl
) = 1;
7668 if (TREE_CODE (decl
) == VAR_DECL
7669 && DECL_CONTEXT (decl
)
7670 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7671 && DECL_CONTEXT (decl
) != current_namespace
7674 /* Leave the namespace of the object. */
7675 pop_decl_namespace ();
7678 type
= TREE_TYPE (decl
);
7680 if (type
== error_mark_node
)
7682 if (toplevel_bindings_p () && temporary
)
7683 end_temporary_allocation ();
7688 /* Add this declaration to the statement-tree. */
7689 if (building_stmt_tree ()
7690 && TREE_CODE (current_scope ()) == FUNCTION_DECL
)
7691 add_decl_stmt (decl
);
7693 if (TYPE_HAS_MUTABLE_P (type
))
7694 TREE_READONLY (decl
) = 0;
7696 if (processing_template_decl
)
7698 if (init
&& DECL_INITIAL (decl
))
7699 DECL_INITIAL (decl
) = init
;
7703 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
7704 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
7706 /* Take care of TYPE_DECLs up front. */
7707 if (TREE_CODE (decl
) == TYPE_DECL
)
7709 if (init
&& DECL_INITIAL (decl
))
7711 /* typedef foo = bar; store the type of bar as the type of foo. */
7712 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
7713 DECL_INITIAL (decl
) = init
= NULL_TREE
;
7715 if (type
!= error_mark_node
7716 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
7718 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
7719 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
7720 set_identifier_type_value (DECL_NAME (decl
), type
);
7721 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
7723 GNU_xref_decl (current_function_decl
, decl
);
7725 /* If we have installed this as the canonical typedef for this
7726 type, and that type has not been defined yet, delay emitting
7727 the debug information for it, as we will emit it later. */
7728 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
7729 && TYPE_SIZE (TREE_TYPE (decl
)) == NULL_TREE
)
7730 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
7732 rest_of_decl_compilation (decl
, NULL_PTR
,
7733 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
7737 if (TREE_CODE (decl
) != FUNCTION_DECL
)
7738 ttype
= target_type (type
);
7740 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
7741 && TYPE_NEEDS_CONSTRUCTING (type
))
7743 /* Currently, GNU C++ puts constants in text space, making them
7744 impossible to initialize. In the future, one would hope for
7745 an operating system which understood the difference between
7746 initialization and the running of a program. */
7748 TREE_READONLY (decl
) = 0;
7751 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
7753 /* This must override the asm specifier which was placed by
7754 grokclassfn. Lay this out fresh. */
7755 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
7756 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7757 make_decl_rtl (decl
, asmspec
, 0);
7760 /* Deduce size of array from initialization, if not already known. */
7761 maybe_deduce_size_from_array_init (decl
, init
);
7762 init
= check_initializer (decl
, init
);
7764 GNU_xref_decl (current_function_decl
, decl
);
7766 /* For top-level declaration, the initial value was read in
7767 the temporary obstack. MAXINDEX, rtl, etc. to be made below
7768 must go in the permanent obstack; but don't discard the
7769 temporary data yet. */
7771 if (toplevel_bindings_p () && temporary
)
7772 end_temporary_allocation ();
7774 if (TREE_CODE (decl
) == VAR_DECL
)
7775 layout_var_decl (decl
);
7777 /* Output the assembler code and/or RTL code for variables and functions,
7778 unless the type is an undefined structure or union.
7779 If not, it will get done when the type is completed. */
7780 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
7781 || TREE_CODE (decl
) == RESULT_DECL
)
7783 if (TREE_CODE (decl
) == VAR_DECL
)
7784 maybe_commonize_var (decl
);
7786 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
7788 if (TREE_CODE (type
) == FUNCTION_TYPE
7789 || TREE_CODE (type
) == METHOD_TYPE
)
7790 abstract_virtuals_error (decl
,
7791 strip_array_types (TREE_TYPE (type
)));
7793 abstract_virtuals_error (decl
, strip_array_types (type
));
7795 if (TREE_CODE (decl
) == FUNCTION_DECL
)
7797 else if (DECL_EXTERNAL (decl
)
7798 && ! (DECL_LANG_SPECIFIC (decl
)
7799 && DECL_NOT_REALLY_EXTERN (decl
)))
7802 DECL_INITIAL (decl
) = init
;
7804 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
7806 /* Cleanups for static variables are handled by `finish_file'. */
7807 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7808 || TYPE_NEEDS_DESTRUCTOR (type
))
7809 expand_static_init (decl
, init
);
7811 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
7813 /* This is a local declaration. */
7814 if (doing_semantic_analysis_p ())
7815 maybe_inject_for_scope_var (decl
);
7816 /* Initialize the local variable. But, if we're building a
7817 statement-tree, we'll do the initialization when we
7819 if (processing_template_decl
)
7821 if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
7822 DECL_INITIAL (decl
) = init
;
7826 /* If we're not building RTL, then we need to do so
7828 if (!building_stmt_tree ())
7829 emit_local_var (decl
);
7830 /* Initialize the variable. */
7831 initialize_local_var (decl
, init
, flags
);
7832 /* Clean up the variable. */
7833 destroy_local_var (decl
);
7838 /* Undo call to `pushclass' that was done in `start_decl'
7839 due to initialization of qualified member variable.
7840 I.e., Foo::x = 10; */
7842 tree context
= DECL_REAL_CONTEXT (decl
);
7844 && TREE_CODE_CLASS (TREE_CODE (context
)) == 't'
7845 && (TREE_CODE (decl
) == VAR_DECL
7846 /* We also have a pushclass done that we need to undo here
7847 if we're at top level and declare a method. */
7848 || TREE_CODE (decl
) == FUNCTION_DECL
)
7849 /* If size hasn't been set, we're still defining it,
7850 and therefore inside the class body; don't pop
7851 the binding level.. */
7852 && TYPE_SIZE (context
) != NULL_TREE
7853 && context
== current_class_type
)
7854 pop_nested_class ();
7860 /* If requested, warn about definitions of large data objects. */
7862 if (warn_larger_than
7863 && ! processing_template_decl
7864 && (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
7865 && !DECL_EXTERNAL (decl
))
7867 register tree decl_size
= DECL_SIZE (decl
);
7869 if (decl_size
&& TREE_CODE (decl_size
) == INTEGER_CST
)
7871 unsigned units
= TREE_INT_CST_LOW (decl_size
) / BITS_PER_UNIT
;
7873 if (units
> larger_than_size
)
7874 warning_with_decl (decl
, "size of `%s' is %u bytes", units
);
7879 /* Resume permanent allocation, if not within a function. The
7880 corresponding push_obstacks_nochange is in start_decl,
7881 start_method, groktypename, and in grokfield. */
7885 TREE_READONLY (decl
) = 1;
7888 /* This is here for a midend callback from c-common.c */
7891 finish_decl (decl
, init
, asmspec_tree
)
7895 cp_finish_decl (decl
, init
, asmspec_tree
, 1, 0);
7898 /* Generate code to handle the destruction of the function-scoped
7899 static variable DECL. */
7902 destroy_local_static (decl
)
7905 tree cleanup
, fcall
;
7907 int saved_flag_access_control
;
7909 if (atexit_node
== 0)
7911 tree atexit_fndecl
, PFV
, pfvlist
;
7912 /* Remember this information until end of file. */
7913 push_obstacks (&permanent_obstack
, &permanent_obstack
);
7914 PFV
= build_pointer_type (build_function_type
7915 (void_type_node
, void_list_node
));
7917 pfvlist
= tree_cons (NULL_TREE
, PFV
, void_list_node
);
7919 push_lang_context (lang_name_c
);
7920 /* Note that we do not call pushdecl for this function;
7921 there's no reason that this declaration should be
7922 accessible to anyone. */
7924 = define_function ("atexit",
7925 build_function_type (void_type_node
,
7927 /*pfn=*/0, NULL_PTR
);
7928 mark_used (atexit_fndecl
);
7929 atexit_node
= default_conversion (atexit_fndecl
);
7930 pop_lang_context ();
7934 /* Call build_cleanup before we enter the anonymous function so that
7935 any access checks will be done relative to the current scope,
7936 rather than the scope of the anonymous function. */
7937 build_cleanup (decl
);
7939 /* Now start the function. */
7940 cleanup
= start_anon_func ();
7942 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
7943 to the original function, rather than the anonymous one. That
7944 will make the back-end think that nested functions are in use,
7945 which causes confusion. */
7946 saved_flag_access_control
= flag_access_control
;
7947 flag_access_control
= 0;
7948 fcall
= build_cleanup (decl
);
7949 flag_access_control
= saved_flag_access_control
;
7951 /* Create the body of the anonymous function. */
7952 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
7953 finish_expr_stmt (fcall
);
7954 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
7957 /* Call atexit with the cleanup function. */
7958 mark_addressable (cleanup
);
7959 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
7960 fcall
= build_function_call (atexit_node
,
7961 tree_cons (NULL_TREE
,
7964 finish_expr_stmt (fcall
);
7968 expand_static_init (decl
, init
)
7972 tree oldstatic
= value_member (decl
, static_aggregates
);
7976 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
7977 cp_error ("multiple initializations given for `%D'", decl
);
7979 else if (! toplevel_bindings_p ())
7981 /* Emit code to perform this initialization but once. */
7988 /* Remember this information until end of file. */
7989 push_obstacks (&permanent_obstack
, &permanent_obstack
);
7991 /* Emit code to perform this initialization but once. This code
7994 static int temp = 0;
7996 // Do initialization.
7998 // Register variable for destruction at end of program.
8001 Note that the `temp' variable is only set to 1 *after* the
8002 initialization is complete. This ensures that an exception,
8003 thrown during the construction, will cause the variable to
8004 reinitialized when we pass through this code again, as per:
8008 If the initialization exits by throwing an exception, the
8009 initialization is not complete, so it will be tried again
8010 the next time control enters the declaration.
8012 In theory, this process should be thread-safe, too; multiple
8013 threads should not be able to initialize the variable more
8014 than once. We don't yet attempt to ensure thread-safety. */
8015 temp
= get_temp_name (integer_type_node
, 1);
8016 rest_of_decl_compilation (temp
, NULL_PTR
, 0, 0);
8018 /* Begin the conditional initialization. */
8019 if_stmt
= begin_if_stmt ();
8020 finish_if_stmt_cond (build_binary_op (EQ_EXPR
, temp
,
8023 then_clause
= begin_compound_stmt (/*has_no_scope=*/0);
8025 /* Do the initialization itself. */
8026 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
8027 || (init
&& TREE_CODE (init
) == TREE_LIST
))
8028 assignment
= build_aggr_init (decl
, init
, 0);
8031 /* The initialization we're doing here is just a bitwise
8033 assignment
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
8034 TREE_SIDE_EFFECTS (assignment
) = 1;
8037 assignment
= NULL_TREE
;
8039 /* Once the assignment is complete, set TEMP to 1. Since the
8040 construction of the static object is complete at this point,
8041 we want to make sure TEMP is set to 1 even if a temporary
8042 constructed during the initialization throws an exception
8043 when it is destroyed. So, we combine the initialization and
8044 the assignment to TEMP into a single expression, ensuring
8045 that when we call finish_expr_stmt the cleanups will not be
8046 run until after TEMP is set to 1. */
8047 temp_init
= build_modify_expr (temp
, NOP_EXPR
, integer_one_node
);
8050 assignment
= tree_cons (NULL_TREE
, assignment
,
8051 build_tree_list (NULL_TREE
,
8053 assignment
= build_compound_expr (assignment
);
8056 assignment
= temp_init
;
8057 finish_expr_stmt (assignment
);
8059 /* Use atexit to register a function for destroying this static
8061 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
8062 destroy_local_static (decl
);
8064 finish_compound_stmt (/*has_no_scope=*/0, then_clause
);
8065 finish_then_clause (if_stmt
);
8068 /* Resume old (possibly temporary) allocation. */
8073 /* This code takes into account memory allocation policy of
8074 `start_decl'. Namely, if TYPE_NEEDS_CONSTRUCTING does not
8075 hold for this object, then we must make permanent the storage
8076 currently in the temporary obstack. */
8077 if (!TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
8078 preserve_initializer ();
8079 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8083 /* Finish the declaration of a catch-parameter. */
8086 start_handler_parms (declspecs
, declarator
)
8093 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8095 if (decl
== NULL_TREE
)
8096 error ("invalid catch parameter");
8105 /* Make TYPE a complete type based on INITIAL_VALUE.
8106 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8107 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8110 complete_array_type (type
, initial_value
, do_default
)
8111 tree type
, initial_value
;
8114 register tree maxindex
= NULL_TREE
;
8117 /* Allocate on the same obstack as TYPE. */
8118 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
8122 /* Note MAXINDEX is really the maximum index,
8123 one less than the size. */
8124 if (TREE_CODE (initial_value
) == STRING_CST
)
8127 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8128 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8131 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8133 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8134 maxindex
= size_binop (MINUS_EXPR
, integer_zero_node
, size_one_node
);
8135 for (; elts
; elts
= TREE_CHAIN (elts
))
8137 if (TREE_PURPOSE (elts
))
8138 maxindex
= TREE_PURPOSE (elts
);
8140 maxindex
= size_binop (PLUS_EXPR
, maxindex
, size_one_node
);
8142 maxindex
= copy_node (maxindex
);
8146 /* Make an error message unless that happened already. */
8147 if (initial_value
!= error_mark_node
)
8150 initial_value
= NULL_TREE
;
8152 /* Prevent further error messages. */
8153 maxindex
= build_int_2 (0, 0);
8160 maxindex
= build_int_2 (0, 0);
8169 domain
= build_index_type (maxindex
);
8170 TYPE_DOMAIN (type
) = domain
;
8172 if (! TREE_TYPE (maxindex
))
8173 TREE_TYPE (maxindex
) = domain
;
8175 itype
= TREE_TYPE (initial_value
);
8178 if (itype
&& !TYPE_DOMAIN (itype
))
8179 TYPE_DOMAIN (itype
) = domain
;
8180 /* The type of the main variant should never be used for arrays
8181 of different sizes. It should only ever be completed with the
8182 size of the array. */
8183 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8184 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8189 /* Lay out the type now that we can get the real answer. */
8196 /* Return zero if something is declared to be a member of type
8197 CTYPE when in the context of CUR_TYPE. STRING is the error
8198 message to print in that case. Otherwise, quietly return 1. */
8201 member_function_or_else (ctype
, cur_type
, string
)
8202 tree ctype
, cur_type
;
8205 if (ctype
&& ctype
!= cur_type
)
8207 error (string
, TYPE_NAME_STRING (ctype
));
8213 /* Subroutine of `grokdeclarator'. */
8215 /* Generate errors possibly applicable for a given set of specifiers.
8216 This is for ARM $7.1.2. */
8219 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8222 int virtualp
, quals
, friendp
, raises
, inlinep
;
8225 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8227 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8229 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8232 cp_error_at ("`%D' declared as a friend", object
);
8234 cp_error_at ("`%D' declared with an exception specification", object
);
8237 /* CTYPE is class type, or null if non-class.
8238 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8240 DECLARATOR is the function's name.
8241 VIRTUALP is truthvalue of whether the function is virtual or not.
8242 FLAGS are to be passed through to `grokclassfn'.
8243 QUALS are qualifiers indicating whether the function is `const'
8245 RAISES is a list of exceptions that this function can raise.
8246 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8247 not look, and -1 if we should not call `grokclassfn' at all.
8249 Returns `NULL_TREE' if something goes wrong, after issuing
8250 applicable error messages. */
8253 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8254 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8255 template_count
, in_namespace
)
8258 tree orig_declarator
;
8260 enum overload_flags flags
;
8262 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8266 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8267 int has_default_arg
= 0;
8271 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8272 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8278 type
= build_exception_variant (type
, raises
);
8281 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8282 /* Propagate volatile out from type to decl. */
8283 if (TYPE_VOLATILE (type
))
8284 TREE_THIS_VOLATILE (decl
) = 1;
8286 /* If this decl has namespace scope, set that up. */
8288 set_decl_namespace (decl
, in_namespace
, friendp
);
8289 else if (publicp
&& ! ctype
)
8290 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8292 /* `main' and builtins have implicit 'C' linkage. */
8293 if ((MAIN_NAME_P (declarator
)
8294 || (IDENTIFIER_LENGTH (declarator
) > 10
8295 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8296 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8297 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8298 && current_lang_name
== lang_name_cplusplus
8299 && ctype
== NULL_TREE
8300 /* NULL_TREE means global namespace. */
8301 && DECL_CONTEXT (decl
) == NULL_TREE
)
8302 DECL_LANGUAGE (decl
) = lang_c
;
8304 /* Should probably propagate const out from type to decl I bet (mrs). */
8307 DECL_STATIC_FUNCTION_P (decl
) = 1;
8308 DECL_CONTEXT (decl
) = ctype
;
8312 DECL_CLASS_CONTEXT (decl
) = ctype
;
8314 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8316 if (processing_template_decl
)
8317 error ("cannot declare `main' to be a template");
8319 error ("cannot declare `main' to be inline");
8321 error ("cannot declare `main' to be static");
8326 /* Members of anonymous types and local classes have no linkage; make
8328 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8329 || hack_decl_function_context (TYPE_MAIN_DECL (ctype
))))
8334 /* [basic.link]: A name with no linkage (notably, the name of a class
8335 or enumeration declared in a local scope) shall not be used to
8336 declare an entity with linkage.
8338 Only check this for public decls for now. */
8339 t
= no_linkage_check (TREE_TYPE (decl
));
8342 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8344 if (DECL_LANGUAGE (decl
) == lang_c
)
8345 /* Allow this; it's pretty common in C. */;
8347 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8351 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8356 TREE_PUBLIC (decl
) = publicp
;
8359 DECL_INTERFACE_KNOWN (decl
) = 1;
8360 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8364 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8366 DECL_EXTERNAL (decl
) = 1;
8367 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8369 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8370 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8374 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8375 grok_op_properties (decl
, virtualp
, check
< 0);
8377 if (ctype
&& hack_decl_function_context (decl
))
8378 DECL_NO_STATIC_CHAIN (decl
) = 1;
8380 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8381 if (TREE_PURPOSE (t
)
8382 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8384 has_default_arg
= 1;
8389 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8393 ("defining explicit specialization `%D' in friend declaration",
8397 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8399 /* Something like `template <class T> friend void f<T>()'. */
8400 cp_error ("template-id `%D' in declaration of primary template",
8406 /* A friend declaration of the form friend void f<>(). Record
8407 the information in the TEMPLATE_ID_EXPR. */
8408 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8409 DECL_TEMPLATE_INFO (decl
)
8410 = tree_cons (TREE_OPERAND (orig_declarator
, 0),
8411 TREE_OPERAND (orig_declarator
, 1),
8414 if (has_default_arg
)
8416 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8423 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8430 if (has_default_arg
)
8431 add_defarg_fn (decl
);
8433 /* Plain overloading: will not be grok'd by grokclassfn. */
8434 if (! ctype
&& ! processing_template_decl
8435 && DECL_LANGUAGE (decl
) != lang_c
8436 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8437 set_mangled_name_for_decl (decl
);
8440 /* Make the init_value nonzero so pushdecl knows this is not
8441 tentative. error_mark_node is replaced later with the BLOCK. */
8442 DECL_INITIAL (decl
) = error_mark_node
;
8444 /* Caller will do the rest of this. */
8448 if (check
&& funcdef_flag
)
8449 DECL_INITIAL (decl
) = error_mark_node
;
8451 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8454 /* Just handle constructors here. We could do this
8455 inside the following if stmt, but I think
8456 that the code is more legible by breaking this
8457 case out. See comments below for what each of
8458 the following calls is supposed to do. */
8459 DECL_CONSTRUCTOR_P (decl
) = 1;
8461 grokclassfn (ctype
, decl
, flags
, quals
);
8463 decl
= check_explicit_specialization (orig_declarator
, decl
,
8465 2 * (funcdef_flag
!= 0) +
8466 4 * (friendp
!= 0));
8467 if (decl
== error_mark_node
)
8470 if ((! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8473 tmp
= check_classfn (ctype
, decl
);
8475 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8476 tmp
= DECL_TEMPLATE_RESULT(tmp
);
8478 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8479 cp_error ("definition of implicitly-declared `%D'", tmp
);
8480 if (tmp
&& duplicate_decls (decl
, tmp
))
8483 if (! grok_ctor_properties (ctype
, decl
))
8490 /* Function gets the ugly name, field gets the nice one.
8491 This call may change the type of the function (because
8492 of default parameters)! */
8493 if (ctype
!= NULL_TREE
)
8494 grokclassfn (ctype
, decl
, flags
, quals
);
8496 decl
= check_explicit_specialization (orig_declarator
, decl
,
8498 2 * (funcdef_flag
!= 0) +
8499 4 * (friendp
!= 0));
8500 if (decl
== error_mark_node
)
8503 if (ctype
!= NULL_TREE
8504 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8507 tmp
= check_classfn (ctype
, decl
);
8509 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8510 tmp
= DECL_TEMPLATE_RESULT (tmp
);
8512 if (tmp
&& DECL_STATIC_FUNCTION_P (tmp
)
8513 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8515 /* Remove the `this' parm added by grokclassfn.
8516 XXX Isn't this done in start_function, too? */
8517 revert_static_member_fn (&decl
, NULL
, NULL
);
8518 last_function_parms
= TREE_CHAIN (last_function_parms
);
8520 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8521 cp_error ("definition of implicitly-declared `%D'", tmp
);
8524 /* Attempt to merge the declarations. This can fail, in
8525 the case of some illegal specialization declarations. */
8526 if (!duplicate_decls (decl
, tmp
))
8527 cp_error ("no `%#D' member function declared in class `%T'",
8533 if (ctype
== NULL_TREE
|| check
)
8538 DECL_VIRTUAL_P (decl
) = 1;
8539 if (DECL_VINDEX (decl
) == NULL_TREE
)
8540 DECL_VINDEX (decl
) = error_mark_node
;
8541 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
8548 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
8551 RID_BIT_TYPE
*specbits_in
;
8557 RID_BIT_TYPE specbits
;
8559 specbits
= *specbits_in
;
8561 if (TREE_CODE (type
) == OFFSET_TYPE
)
8563 /* If you declare a static member so that it
8564 can be initialized, the code will reach here. */
8565 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
8566 type
= TREE_TYPE (type
);
8567 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8568 DECL_CONTEXT (decl
) = basetype
;
8569 DECL_CLASS_CONTEXT (decl
) = basetype
;
8570 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
, declarator
);
8577 context
= in_namespace
;
8578 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
8579 context
= current_namespace
;
8581 context
= NULL_TREE
;
8583 if (processing_template_decl
)
8585 /* If we're in a template, we need DECL_LANG_SPECIFIC so that
8586 we can call push_template_decl. */
8587 push_permanent_obstack ();
8588 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8592 decl
= build_decl (VAR_DECL
, declarator
, type
);
8595 set_decl_namespace (decl
, context
, 0);
8597 context
= DECL_CONTEXT (decl
);
8598 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
8599 DECL_ASSEMBLER_NAME (decl
) = build_static_name (context
, declarator
);
8603 set_decl_namespace (decl
, in_namespace
, 0);
8605 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
8607 DECL_THIS_EXTERN (decl
) = 1;
8608 DECL_EXTERNAL (decl
) = !initialized
;
8611 /* In class context, static means one per class,
8612 public access, and static storage. */
8613 if (DECL_CLASS_SCOPE_P (decl
))
8615 TREE_PUBLIC (decl
) = 1;
8616 TREE_STATIC (decl
) = 1;
8617 DECL_EXTERNAL (decl
) = 0;
8619 /* At top level, either `static' or no s.c. makes a definition
8620 (perhaps tentative), and absence of `static' makes it public. */
8621 else if (toplevel_bindings_p ())
8623 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
8624 && (DECL_THIS_EXTERN (decl
) || ! constp
));
8625 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
8627 /* Not at top level, only `static' makes a static definition. */
8630 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
8631 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
8634 if (TREE_PUBLIC (decl
))
8636 /* [basic.link]: A name with no linkage (notably, the name of a class
8637 or enumeration declared in a local scope) shall not be used to
8638 declare an entity with linkage.
8640 Only check this for public decls for now. */
8641 tree t
= no_linkage_check (TREE_TYPE (decl
));
8644 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8645 /* Ignore for now; `enum { foo } e' is pretty common. */;
8647 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
8655 /* Create and return a canonical pointer to member function type, for
8656 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
8659 build_ptrmemfunc_type (type
)
8665 tree unqualified_variant
= NULL_TREE
;
8667 /* If a canonical type already exists for this type, use it. We use
8668 this method instead of type_hash_canon, because it only does a
8669 simple equality check on the list of field members. */
8671 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
8674 /* Make sure that we always have the unqualified pointer-to-member
8676 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8678 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
8680 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
8682 u
= make_lang_type (UNION_TYPE
);
8683 SET_IS_AGGR_TYPE (u
, 0);
8684 fields
[0] = build_lang_decl (FIELD_DECL
, pfn_identifier
, type
);
8685 fields
[1] = build_lang_decl (FIELD_DECL
, delta2_identifier
,
8687 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
8688 TYPE_NAME (u
) = NULL_TREE
;
8690 t
= make_lang_type (RECORD_TYPE
);
8692 /* Let the front-end know this is a pointer to member function... */
8693 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
8694 /* ... and not really an aggregate. */
8695 SET_IS_AGGR_TYPE (t
, 0);
8697 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
8699 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
8701 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
8702 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
8706 /* Zap out the name so that the back-end will give us the debugging
8707 information for this anonymous RECORD_TYPE. */
8708 TYPE_NAME (t
) = NULL_TREE
;
8710 /* If this is not the unqualified form of this pointer-to-member
8711 type, set the TYPE_MAIN_VARIANT for this type to be the
8712 unqualified type. Since they are actually RECORD_TYPEs that are
8713 not variants of each other, we must do this manually. */
8714 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8716 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
8717 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
8718 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
8719 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
8722 /* Cache this pointer-to-member type so that we can find it again
8724 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
8726 /* Seems to be wanted. */
8727 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
8732 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
8733 Check to see that the definition is valid. Issue appropriate error
8734 messages. Return 1 if the definition is particularly bad, or 0
8738 check_static_variable_definition (decl
, type
)
8742 /* Motion 10 at San Diego: If a static const integral data member is
8743 initialized with an integral constant expression, the initializer
8744 may appear either in the declaration (within the class), or in
8745 the definition, but not both. If it appears in the class, the
8746 member is a member constant. The file-scope definition is always
8748 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
8750 cp_error ("in-class initialization of static data member of non-integral type `%T'",
8752 /* If we just return the declaration, crashes will sometimes
8753 occur. We therefore return void_type_node, as if this was a
8754 friend declaration, to cause callers to completely ignore
8755 this declaration. */
8758 else if (!CP_TYPE_CONST_P (type
))
8759 cp_error ("ANSI C++ forbids in-class initialization of non-const static member `%D'",
8761 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
8762 cp_pedwarn ("ANSI C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
8767 /* Given declspecs and a declarator,
8768 determine the name and type of the object declared
8769 and construct a ..._DECL node for it.
8770 (In one case we can return a ..._TYPE node instead.
8771 For invalid input we sometimes return 0.)
8773 DECLSPECS is a chain of tree_list nodes whose value fields
8774 are the storage classes and type specifiers.
8776 DECL_CONTEXT says which syntactic context this declaration is in:
8777 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
8778 FUNCDEF for a function definition. Like NORMAL but a few different
8779 error messages in each case. Return value may be zero meaning
8780 this definition is too screwy to try to parse.
8781 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
8782 handle member functions (which have FIELD context).
8783 Return value may be zero meaning this definition is too screwy to
8785 PARM for a parameter declaration (either within a function prototype
8786 or before a function body). Make a PARM_DECL, or return void_type_node.
8787 CATCHPARM for a parameter declaration before a catch clause.
8788 TYPENAME if for a typename (in a cast or sizeof).
8789 Don't make a DECL node; just return the ..._TYPE node.
8790 FIELD for a struct or union field; make a FIELD_DECL.
8791 BITFIELD for a field with specified width.
8792 INITIALIZED is 1 if the decl has an initializer.
8794 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
8795 normal attributes in TREE_PURPOSE, or NULL_TREE.
8797 In the TYPENAME case, DECLARATOR is really an absolute declarator.
8798 It may also be so in the PARM case, for a prototype where the
8799 argument type is specified but not the name.
8801 This function is where the complicated C meanings of `static'
8802 and `extern' are interpreted.
8804 For C++, if there is any monkey business to do, the function which
8805 calls this one must do it, i.e., prepending instance variables,
8806 renaming overloaded function names, etc.
8808 Note that for this C++, it is an error to define a method within a class
8809 which does not belong to that class.
8811 Except in the case where SCOPE_REFs are implicitly known (such as
8812 methods within a class being redundantly qualified),
8813 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
8814 (class_name::decl_name). The caller must also deal with this.
8816 If a constructor or destructor is seen, and the context is FIELD,
8817 then the type gains the attribute TREE_HAS_x. If such a declaration
8818 is erroneous, NULL_TREE is returned.
8820 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
8821 function, these are the qualifiers to give to the `this' pointer.
8823 May return void_type_node if the declarator turned out to be a friend.
8824 See grokfield for details. */
8826 enum return_types
{ return_normal
, return_ctor
, return_dtor
, return_conversion
};
8829 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
8832 enum decl_context decl_context
;
8836 RID_BIT_TYPE specbits
;
8839 tree type
= NULL_TREE
;
8845 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
8846 int explicit_int
= 0;
8847 int explicit_char
= 0;
8848 int defaulted_int
= 0;
8849 tree typedef_decl
= NULL_TREE
;
8851 tree typedef_type
= NULL_TREE
;
8852 int funcdef_flag
= 0;
8853 enum tree_code innermost_code
= ERROR_MARK
;
8856 /* See the code below that used this. */
8857 tree decl_machine_attr
= NULL_TREE
;
8859 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
8860 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
8861 tree init
= NULL_TREE
;
8863 /* Keep track of what sort of function is being processed
8864 so that we can warn about default return values, or explicit
8865 return values which do not match prescribed defaults. */
8866 enum return_types return_type
= return_normal
;
8868 tree dname
= NULL_TREE
;
8869 tree ctype
= current_class_type
;
8870 tree ctor_return_type
= NULL_TREE
;
8871 enum overload_flags flags
= NO_SPECIAL
;
8872 tree quals
= NULL_TREE
;
8873 tree raises
= NULL_TREE
;
8874 int template_count
= 0;
8875 tree in_namespace
= NULL_TREE
;
8879 RIDBIT_RESET_ALL (specbits
);
8880 if (decl_context
== FUNCDEF
)
8881 funcdef_flag
= 1, decl_context
= NORMAL
;
8882 else if (decl_context
== MEMFUNCDEF
)
8883 funcdef_flag
= -1, decl_context
= FIELD
;
8884 else if (decl_context
== BITFIELD
)
8885 bitfield
= 1, decl_context
= FIELD
;
8887 /* Look inside a declarator for the name being declared
8888 and get it as a string, for an error message. */
8890 tree
*next
= &declarator
;
8894 while (next
&& *next
)
8897 switch (TREE_CODE (decl
))
8900 /* For attributes. */
8901 next
= &TREE_VALUE (decl
);
8906 next
= &TREE_OPERAND (decl
, 0);
8909 case BIT_NOT_EXPR
: /* For C++ destructors! */
8911 tree name
= TREE_OPERAND (decl
, 0);
8912 tree rename
= NULL_TREE
;
8914 my_friendly_assert (flags
== NO_SPECIAL
, 152);
8916 return_type
= return_dtor
;
8917 if (TREE_CODE (name
) == TYPE_DECL
)
8918 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
8919 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
8920 if (ctype
== NULL_TREE
)
8922 if (current_class_type
== NULL_TREE
)
8924 error ("destructors must be member functions");
8929 tree t
= constructor_name (current_class_name
);
8936 tree t
= constructor_name (ctype
);
8943 cp_error ("destructor `%T' must match class name `%T'",
8945 TREE_OPERAND (decl
, 0) = rename
;
8951 case ADDR_EXPR
: /* C++ reference declaration */
8956 innermost_code
= TREE_CODE (decl
);
8957 next
= &TREE_OPERAND (decl
, 0);
8961 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
8963 /* This is actually a variable declaration using
8964 constructor syntax. We need to call start_decl and
8965 cp_finish_decl so we can get the variable
8968 tree attributes
, prefix_attributes
;
8970 *next
= TREE_OPERAND (decl
, 0);
8971 init
= CALL_DECLARATOR_PARMS (decl
);
8975 attributes
= TREE_PURPOSE (attrlist
);
8976 prefix_attributes
= TREE_VALUE (attrlist
);
8980 attributes
= NULL_TREE
;
8981 prefix_attributes
= NULL_TREE
;
8984 decl
= start_decl (declarator
, declspecs
, 1,
8985 attributes
, prefix_attributes
);
8988 /* Look for __unused__ attribute */
8989 if (TREE_USED (TREE_TYPE (decl
)))
8990 TREE_USED (decl
) = 1;
8991 finish_decl (decl
, init
, NULL_TREE
);
8994 cp_error ("invalid declarator");
8997 innermost_code
= TREE_CODE (decl
);
8998 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
8999 ctype
= current_class_type
;
9001 && TREE_OPERAND (decl
, 0)
9002 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
9003 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
9004 == constructor_name_full (ctype
))
9005 || (DECL_NAME (TREE_OPERAND (decl
, 0))
9006 == constructor_name (ctype
)))))
9007 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9008 next
= &TREE_OPERAND (decl
, 0);
9010 if (ctype
!= NULL_TREE
9011 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
9012 && decl
== constructor_name (ctype
))
9014 return_type
= return_ctor
;
9015 ctor_return_type
= ctype
;
9020 case TEMPLATE_ID_EXPR
:
9022 tree fns
= TREE_OPERAND (decl
, 0);
9024 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9025 fns
= TREE_OPERAND (fns
, 0);
9028 if (TREE_CODE (dname
) == COMPONENT_REF
)
9029 dname
= TREE_OPERAND (dname
, 1);
9030 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9032 my_friendly_assert (is_overloaded_fn (dname
),
9034 dname
= DECL_NAME (get_first_fn (dname
));
9039 case IDENTIFIER_NODE
:
9040 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9047 cp_error ("declarator-id missing; using reserved word `%D'",
9049 name
= IDENTIFIER_POINTER (dname
);
9051 if (! IDENTIFIER_OPNAME_P (dname
)
9052 /* GNU/Linux headers use '__op'. Arrgh. */
9053 || (IDENTIFIER_TYPENAME_P (dname
) && ! TREE_TYPE (dname
)))
9054 name
= IDENTIFIER_POINTER (dname
);
9057 if (IDENTIFIER_TYPENAME_P (dname
))
9059 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9060 flags
= TYPENAME_FLAG
;
9061 ctor_return_type
= TREE_TYPE (dname
);
9062 return_type
= return_conversion
;
9064 name
= operator_name_string (dname
);
9071 /* Perform error checking, and decide on a ctype. */
9072 tree cname
= TREE_OPERAND (decl
, 0);
9073 if (cname
== NULL_TREE
)
9075 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9078 in_namespace
= TREE_OPERAND (decl
, 0);
9079 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9081 else if (! is_aggr_type (cname
, 1))
9082 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9083 /* Must test TREE_OPERAND (decl, 1), in case user gives
9084 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9085 else if (TREE_OPERAND (decl
, 1)
9086 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9088 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9089 || TREE_CODE (cname
) == TEMPLATE_TEMPLATE_PARM
)
9091 cp_error ("`%T::%D' is not a valid declarator", cname
,
9092 TREE_OPERAND (decl
, 1));
9093 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9094 cname
, TREE_OPERAND (decl
, 1));
9095 return void_type_node
;
9097 else if (ctype
== NULL_TREE
)
9099 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9100 TREE_OPERAND (decl
, 0) = ctype
;
9103 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9105 cp_error ("type `%T' is not derived from type `%T'",
9107 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9113 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9114 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9115 == constructor_name_full (ctype
))
9116 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9117 == constructor_name (ctype
))))
9118 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9119 next
= &TREE_OPERAND (decl
, 1);
9123 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9124 && constructor_name (ctype
) == decl
)
9126 return_type
= return_ctor
;
9127 ctor_return_type
= ctype
;
9129 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9130 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9131 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9132 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9134 return_type
= return_dtor
;
9135 ctor_return_type
= ctype
;
9137 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9138 next
= &TREE_OPERAND (decl
, 0);
9149 /* Parse error puts this typespec where
9150 a declarator should go. */
9151 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9152 if (TREE_TYPE (decl
) == current_class_type
)
9153 cp_error (" perhaps you want `%T' for a constructor",
9154 current_class_name
);
9155 dname
= DECL_NAME (decl
);
9156 name
= IDENTIFIER_POINTER (dname
);
9158 /* Avoid giving two errors for this. */
9159 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9161 declspecs
= temp_tree_cons (NULL_TREE
, integer_type_node
,
9168 cp_compiler_error ("`%D' as declarator", decl
);
9169 return 0; /* We used to do a 155 abort here. */
9176 /* A function definition's declarator must have the form of
9177 a function declarator. */
9179 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9182 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9183 && innermost_code
!= CALL_EXPR
9184 && ! (ctype
&& declspecs
== NULL_TREE
))
9186 cp_error ("declaration of `%D' as non-function", dname
);
9187 return void_type_node
;
9190 /* Anything declared one level down from the top level
9191 must be one of the parameters of a function
9192 (because the body is at least two levels down). */
9194 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9195 by not allowing C++ class definitions to specify their parameters
9196 with xdecls (must be spec.d in the parmlist).
9198 Since we now wait to push a class scope until we are sure that
9199 we are in a legitimate method context, we must set oldcname
9200 explicitly (since current_class_name is not yet alive).
9202 We also want to avoid calling this a PARM if it is in a namespace. */
9204 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
9206 struct binding_level
*b
= current_binding_level
;
9207 current_binding_level
= b
->level_chain
;
9208 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9209 decl_context
= PARM
;
9210 current_binding_level
= b
;
9213 /* Look through the decl specs and record which ones appear.
9214 Some typespecs are defined as built-in typenames.
9215 Others, the ones that are modifiers of other types,
9216 are represented by bits in SPECBITS: set the bits for
9217 the modifiers that appear. Storage class keywords are also in SPECBITS.
9219 If there is a typedef name or a type, store the type in TYPE.
9220 This includes builtin typedefs such as `int'.
9222 Set EXPLICIT_INT if the type is `int' or `char' and did not
9223 come from a user typedef.
9225 Set LONGLONG if `long' is mentioned twice.
9227 For C++, constructors and destructors have their own fast treatment. */
9229 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
9234 /* Certain parse errors slip through. For example,
9235 `int class;' is not caught by the parser. Try
9236 weakly to recover here. */
9237 if (TREE_CODE (spec
) != TREE_LIST
)
9240 id
= TREE_VALUE (spec
);
9242 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9244 if (id
== ridpointers
[(int) RID_INT
]
9245 || id
== ridpointers
[(int) RID_CHAR
]
9246 || id
== ridpointers
[(int) RID_BOOL
]
9247 || id
== ridpointers
[(int) RID_WCHAR
])
9251 if (id
== ridpointers
[(int) RID_BOOL
])
9252 error ("`bool' is now a keyword");
9254 cp_error ("extraneous `%T' ignored", id
);
9258 if (id
== ridpointers
[(int) RID_INT
])
9260 else if (id
== ridpointers
[(int) RID_CHAR
])
9262 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
9266 /* C++ aggregate types. */
9267 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
9270 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
9272 type
= IDENTIFIER_TYPE_VALUE (id
);
9276 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
9278 if (ridpointers
[i
] == id
)
9280 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
9282 if (pedantic
&& ! in_system_header
&& warn_long_long
)
9283 pedwarn ("ANSI C++ does not support `long long'");
9285 error ("`long long long' is too long for GCC");
9289 else if (RIDBIT_SETP (i
, specbits
))
9290 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
9291 RIDBIT_SET (i
, specbits
);
9296 /* C++ aggregate types. */
9297 else if (TREE_CODE (id
) == TYPE_DECL
|| TREE_CODE (id
) == TEMPLATE_DECL
)
9300 cp_error ("multiple declarations `%T' and `%T'", type
,
9304 type
= TREE_TYPE (id
);
9305 TREE_VALUE (spec
) = type
;
9310 error ("two or more data types in declaration of `%s'", name
);
9311 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9313 register tree t
= lookup_name (id
, 1);
9314 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
9315 error ("`%s' fails to be a typedef or built in type",
9316 IDENTIFIER_POINTER (id
));
9319 type
= TREE_TYPE (t
);
9321 /* See the code below that used this. */
9322 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
9327 else if (id
!= error_mark_node
)
9328 /* Can't change CLASS nodes into RECORD nodes here! */
9334 typedef_type
= type
;
9336 /* No type at all: default to `int', and set DEFAULTED_INT
9337 because it was not a user-defined typedef. */
9339 if (type
== NULL_TREE
9340 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
9341 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9342 || RIDBIT_SETP (RID_LONG
, specbits
)
9343 || RIDBIT_SETP (RID_SHORT
, specbits
)))
9345 /* These imply 'int'. */
9346 type
= integer_type_node
;
9350 if (type
== NULL_TREE
)
9353 if (return_type
== return_dtor
)
9354 type
= void_type_node
;
9355 else if (return_type
== return_ctor
)
9356 type
= build_pointer_type (ctor_return_type
);
9357 else if (return_type
== return_conversion
)
9358 type
= ctor_return_type
;
9361 /* We handle `main' specially here, because 'main () { }' is so
9362 common. With no options, it is allowed. With -Wreturn-type,
9363 it is a warning. It is only an error with -pedantic-errors. */
9364 int is_main
= (funcdef_flag
9365 && MAIN_NAME_P (dname
)
9366 && ctype
== NULL_TREE
9367 && in_namespace
== NULL_TREE
9368 && current_namespace
== global_namespace
);
9370 if (in_system_header
|| flag_ms_extensions
)
9371 /* Allow it, sigh. */;
9372 else if (pedantic
|| ! is_main
)
9373 cp_pedwarn ("ANSI C++ forbids declaration `%D' with no type",
9375 else if (warn_return_type
)
9376 cp_warning ("ANSI C++ forbids declaration `%D' with no type",
9379 type
= integer_type_node
;
9382 else if (return_type
== return_dtor
)
9384 error ("return type specification for destructor invalid");
9385 type
= void_type_node
;
9387 else if (return_type
== return_ctor
)
9389 error ("return type specification for constructor invalid");
9390 type
= build_pointer_type (ctor_return_type
);
9392 else if (return_type
== return_conversion
)
9394 if (!same_type_p (type
, ctor_return_type
))
9395 cp_error ("operator `%T' declared to return `%T'",
9396 ctor_return_type
, type
);
9398 cp_pedwarn ("return type specified for `operator %T'",
9401 type
= ctor_return_type
;
9406 /* Now process the modifiers that were specified
9407 and check for invalid combinations. */
9409 /* Long double is a special combination. */
9411 if (RIDBIT_SETP (RID_LONG
, specbits
)
9412 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
9414 RIDBIT_RESET (RID_LONG
, specbits
);
9415 type
= build_qualified_type (long_double_type_node
,
9416 CP_TYPE_QUALS (type
));
9419 /* Check all other uses of type modifiers. */
9421 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9422 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9423 || RIDBIT_SETP (RID_LONG
, specbits
)
9424 || RIDBIT_SETP (RID_SHORT
, specbits
))
9428 if (TREE_CODE (type
) == REAL_TYPE
)
9429 error ("short, signed or unsigned invalid for `%s'", name
);
9430 else if (TREE_CODE (type
) != INTEGER_TYPE
)
9431 error ("long, short, signed or unsigned invalid for `%s'", name
);
9432 else if (RIDBIT_SETP (RID_LONG
, specbits
)
9433 && RIDBIT_SETP (RID_SHORT
, specbits
))
9434 error ("long and short specified together for `%s'", name
);
9435 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9436 || RIDBIT_SETP (RID_SHORT
, specbits
))
9438 error ("long or short specified with char for `%s'", name
);
9439 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9440 || RIDBIT_SETP (RID_SHORT
, specbits
))
9441 && TREE_CODE (type
) == REAL_TYPE
)
9442 error ("long or short specified with floating type for `%s'", name
);
9443 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9444 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
9445 error ("signed and unsigned given together for `%s'", name
);
9449 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
9451 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
9453 if (flag_pedantic_errors
)
9458 /* Discard the type modifiers if they are invalid. */
9461 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
9462 RIDBIT_RESET (RID_SIGNED
, specbits
);
9463 RIDBIT_RESET (RID_LONG
, specbits
);
9464 RIDBIT_RESET (RID_SHORT
, specbits
);
9469 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
9470 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
9472 error ("complex invalid for `%s'", name
);
9473 RIDBIT_RESET (RID_COMPLEX
, specbits
);
9476 /* Decide whether an integer type is signed or not.
9477 Optionally treat bitfields as signed by default. */
9478 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9481 It is implementation-defined whether a plain (neither
9482 explicitly signed or unsigned) char, short, int, or long
9483 bit-field is signed or unsigned.
9485 Naturally, we extend this to long long as well. Note that
9486 this does not include wchar_t. */
9487 || (bitfield
&& !flag_signed_bitfields
9488 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
9489 /* A typedef for plain `int' without `signed' can be
9490 controlled just like plain `int', but a typedef for
9491 `signed int' cannot be so controlled. */
9493 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
9494 && (TREE_CODE (type
) == INTEGER_TYPE
9495 || TREE_CODE (type
) == CHAR_TYPE
)
9496 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
9499 type
= long_long_unsigned_type_node
;
9500 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9501 type
= long_unsigned_type_node
;
9502 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9503 type
= short_unsigned_type_node
;
9504 else if (type
== char_type_node
)
9505 type
= unsigned_char_type_node
;
9506 else if (typedef_decl
)
9507 type
= unsigned_type (type
);
9509 type
= unsigned_type_node
;
9511 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9512 && type
== char_type_node
)
9513 type
= signed_char_type_node
;
9515 type
= long_long_integer_type_node
;
9516 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9517 type
= long_integer_type_node
;
9518 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9519 type
= short_integer_type_node
;
9521 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
9523 /* If we just have "complex", it is equivalent to
9524 "complex double", but if any modifiers at all are specified it is
9525 the complex form of TYPE. E.g, "complex short" is
9526 "complex short int". */
9528 if (defaulted_int
&& ! longlong
9529 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
9530 || RIDBIT_SETP (RID_SHORT
, specbits
)
9531 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9532 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
9533 type
= complex_double_type_node
;
9534 else if (type
== integer_type_node
)
9535 type
= complex_integer_type_node
;
9536 else if (type
== float_type_node
)
9537 type
= complex_float_type_node
;
9538 else if (type
== double_type_node
)
9539 type
= complex_double_type_node
;
9540 else if (type
== long_double_type_node
)
9541 type
= complex_long_double_type_node
;
9543 type
= build_complex_type (type
);
9546 if (return_type
== return_conversion
9547 && (RIDBIT_SETP (RID_CONST
, specbits
)
9548 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
9549 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
9550 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
9553 /* Set CONSTP if this declaration is `const', whether by
9554 explicit specification or via a typedef.
9555 Likewise for VOLATILEP. */
9557 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
9559 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
9561 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
9562 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
9563 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
9564 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
9565 type
= cp_build_qualified_type (type
, type_quals
);
9567 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
9568 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
9569 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
9570 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
9571 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
9573 if (RIDBIT_SETP (RID_STATIC
, specbits
))
9574 staticp
= 1 + (decl_context
== FIELD
);
9576 if (virtualp
&& staticp
== 2)
9578 cp_error ("member `%D' cannot be declared both virtual and static",
9582 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
9583 RIDBIT_RESET (RID_FRIEND
, specbits
);
9585 /* $7.1.2, Function specifiers */
9586 if (friendp
&& explicitp
)
9587 error ("only declarations of constructors can be `explicit'");
9589 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
9591 if (decl_context
== PARM
)
9593 error ("non-member `%s' cannot be declared `mutable'", name
);
9594 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9596 else if (friendp
|| decl_context
== TYPENAME
)
9598 error ("non-object member `%s' cannot be declared `mutable'", name
);
9599 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9603 /* Warn if two storage classes are given. Default to `auto'. */
9605 if (RIDBIT_ANY_SET (specbits
))
9607 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
9608 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
9609 if (decl_context
== PARM
&& nclasses
> 0)
9610 error ("storage class specifiers invalid in parameter declarations");
9611 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9613 if (decl_context
== PARM
)
9614 error ("typedef declaration invalid in parameter declaration");
9617 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
9618 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
9621 /* Give error if `virtual' is used outside of class declaration. */
9623 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
9625 error ("virtual outside class declaration");
9628 if (current_class_name
== NULL_TREE
&& RIDBIT_SETP (RID_MUTABLE
, specbits
))
9630 error ("only members can be declared mutable");
9631 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9634 /* Static anonymous unions are dealt with here. */
9635 if (staticp
&& decl_context
== TYPENAME
9636 && TREE_CODE (declspecs
) == TREE_LIST
9637 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
9638 decl_context
= FIELD
;
9640 /* Warn about storage classes that are invalid for certain
9641 kinds of declarations (parameters, typenames, etc.). */
9644 error ("multiple storage classes in declaration of `%s'", name
);
9645 else if (decl_context
!= NORMAL
&& nclasses
> 0)
9647 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9648 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
9649 || RIDBIT_SETP (RID_AUTO
, specbits
)))
9651 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9653 else if (decl_context
== FIELD
9654 /* C++ allows static class elements */
9655 && RIDBIT_SETP (RID_STATIC
, specbits
))
9656 /* C++ also allows inlines and signed and unsigned elements,
9657 but in those cases we don't come in here. */
9661 if (decl_context
== FIELD
)
9663 tree tmp
= NULL_TREE
;
9664 register int op
= 0;
9668 /* Avoid trying to get an operand off an identifier node. */
9669 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
9672 tmp
= TREE_OPERAND (declarator
, 0);
9673 op
= IDENTIFIER_OPNAME_P (tmp
);
9675 error ("storage class specified for %s `%s'",
9676 op
? "member operator" : "field",
9677 op
? operator_name_string (tmp
) : name
);
9680 error (((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9681 ? "storage class specified for parameter `%s'"
9682 : "storage class specified for typename"), name
);
9683 RIDBIT_RESET (RID_REGISTER
, specbits
);
9684 RIDBIT_RESET (RID_AUTO
, specbits
);
9685 RIDBIT_RESET (RID_EXTERN
, specbits
);
9688 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
9690 if (toplevel_bindings_p ())
9692 /* It's common practice (and completely valid) to have a const
9693 be initialized and declared extern. */
9694 if (!(type_quals
& TYPE_QUAL_CONST
))
9695 warning ("`%s' initialized and declared `extern'", name
);
9698 error ("`%s' has both `extern' and initializer", name
);
9700 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
9701 && ! toplevel_bindings_p ())
9702 error ("nested function `%s' declared `extern'", name
);
9703 else if (toplevel_bindings_p ())
9705 if (RIDBIT_SETP (RID_AUTO
, specbits
))
9706 error ("top-level declaration of `%s' specifies `auto'", name
);
9709 if (nclasses
> 0 && friendp
)
9710 error ("storage class specifiers invalid in friend function declarations");
9712 /* Now figure out the structure of the declarator proper.
9713 Descend through it, creating more complex types, until we reach
9714 the declared identifier (or NULL_TREE, in an absolute declarator). */
9716 inner_attrs
= NULL_TREE
;
9719 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
9720 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
9722 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
9723 an INDIRECT_REF (for *...),
9724 a CALL_EXPR (for ...(...)),
9725 an identifier (for the name being declared)
9726 or a null pointer (for the place in an absolute declarator
9727 where the name was omitted).
9728 For the last two cases, we have just exited the loop.
9730 For C++ it could also be
9731 a SCOPE_REF (for class :: ...). In this case, we have converted
9732 sensible names to types, and those are the values we use to
9733 qualify the member name.
9734 an ADDR_EXPR (for &...),
9735 a BIT_NOT_EXPR (for destructors)
9737 At this point, TYPE is the type of elements of an array,
9738 or for a function to return, or for a pointer to point to.
9739 After this sequence of ifs, TYPE is the type of the
9740 array or function or pointer, and DECLARATOR has had its
9741 outermost layer removed. */
9743 if (type
== error_mark_node
)
9745 if (TREE_CODE (declarator
) == SCOPE_REF
)
9746 declarator
= TREE_OPERAND (declarator
, 1);
9748 declarator
= TREE_OPERAND (declarator
, 0);
9751 if (quals
!= NULL_TREE
9752 && (declarator
== NULL_TREE
9753 || TREE_CODE (declarator
) != SCOPE_REF
))
9755 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
9756 ctype
= TYPE_METHOD_BASETYPE (type
);
9757 if (ctype
!= NULL_TREE
)
9759 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
9760 ctype
= grok_method_quals (ctype
, dummy
, quals
);
9761 type
= TREE_TYPE (dummy
);
9766 /* See the comment for the TREE_LIST case, below. */
9769 else if (inner_attrs
)
9771 decl_attributes (type
, inner_attrs
, NULL_TREE
);
9772 inner_attrs
= NULL_TREE
;
9775 switch (TREE_CODE (declarator
))
9779 /* We encode a declarator with embedded attributes using
9780 a TREE_LIST. The attributes apply to the declarator
9781 directly inside them, so we have to skip an iteration
9782 before applying them to the type. If the declarator just
9783 inside is the declarator-id, we apply the attrs to the
9785 inner_attrs
= TREE_PURPOSE (declarator
);
9787 declarator
= TREE_VALUE (declarator
);
9793 register tree itype
= NULL_TREE
;
9794 register tree size
= TREE_OPERAND (declarator
, 1);
9795 /* The index is a signed object `sizetype' bits wide. */
9796 tree index_type
= signed_type (sizetype
);
9798 declarator
= TREE_OPERAND (declarator
, 0);
9800 /* Check for some types that there cannot be arrays of. */
9802 if (TREE_CODE (type
) == VOID_TYPE
)
9804 cp_error ("declaration of `%D' as array of voids", dname
);
9805 type
= error_mark_node
;
9808 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9810 cp_error ("declaration of `%D' as array of functions", dname
);
9811 type
= error_mark_node
;
9814 /* ARM $8.4.3: Since you can't have a pointer to a reference,
9815 you can't have arrays of references. If we allowed them,
9816 then we'd be saying x[i] is valid for an array x, but
9817 then you'd have to ask: what does `*(x + i)' mean? */
9818 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9820 if (decl_context
== TYPENAME
)
9821 cp_error ("cannot make arrays of references");
9823 cp_error ("declaration of `%D' as array of references",
9825 type
= error_mark_node
;
9828 if (TREE_CODE (type
) == OFFSET_TYPE
)
9830 cp_error ("declaration of `%D' as array of data members",
9832 type
= error_mark_node
;
9835 if (TREE_CODE (type
) == METHOD_TYPE
)
9837 cp_error ("declaration of `%D' as array of function members",
9839 type
= error_mark_node
;
9842 if (size
== error_mark_node
)
9843 type
= error_mark_node
;
9844 else if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9848 the constant expressions that specify the bounds of
9849 the arrays can be omitted only for the first member
9851 cp_error ("declaration of `%D' as multidimensional array",
9853 cp_error ("must have bounds for all dimensions except the first");
9854 type
= error_mark_node
;
9857 if (type
== error_mark_node
)
9860 /* VC++ spells a zero-sized array with []. */
9861 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
9862 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9863 size
= integer_zero_node
;
9867 /* Must suspend_momentary here because the index
9868 type may need to live until the end of the function.
9869 For example, it is used in the declaration of a
9870 variable which requires destructing at the end of
9871 the function; then build_vec_delete will need this
9873 int yes
= suspend_momentary ();
9874 /* Might be a cast. */
9875 if (TREE_CODE (size
) == NOP_EXPR
9876 && TREE_TYPE (size
) == TREE_TYPE (TREE_OPERAND (size
, 0)))
9877 size
= TREE_OPERAND (size
, 0);
9878 if (TREE_READONLY_DECL_P (size
))
9879 size
= decl_constant_value (size
);
9881 /* If this involves a template parameter, it will be a
9882 constant at instantiation time, but we don't know
9883 what the value is yet. Even if no template
9884 parameters are involved, we may an expression that
9885 is not a constant; we don't even simplify `1 + 2'
9886 when processing a template. */
9887 if (processing_template_decl
)
9889 /* Resolve a qualified reference to an enumerator or
9890 static const data member of ours. */
9891 if (TREE_CODE (size
) == SCOPE_REF
9892 && TREE_OPERAND (size
, 0) == current_class_type
)
9894 tree t
= lookup_field (current_class_type
,
9895 TREE_OPERAND (size
, 1), 0, 0);
9900 itype
= build_index_type (build_min
9901 (MINUS_EXPR
, sizetype
, size
, integer_one_node
));
9902 goto dont_grok_size
;
9905 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9906 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
9907 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
9909 cp_error ("size of array `%D' has non-integer type",
9911 size
= integer_one_node
;
9913 if (pedantic
&& integer_zerop (size
))
9914 cp_pedwarn ("ANSI C++ forbids zero-size array `%D'", dname
);
9915 if (TREE_CONSTANT (size
))
9917 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9918 int old_pedantic
= pedantic
;
9919 pedantic
= flag_pedantic_errors
= 1;
9920 /* Always give overflow errors on array subscripts. */
9921 constant_expression_warning (size
);
9922 pedantic
= old_pedantic
;
9923 flag_pedantic_errors
= old_flag_pedantic_errors
;
9924 if (INT_CST_LT (size
, integer_zero_node
))
9926 cp_error ("size of array `%D' is negative", dname
);
9927 size
= integer_one_node
;
9935 cp_pedwarn ("ANSI C++ forbids variable-size array `%D'",
9938 cp_pedwarn ("ANSI C++ forbids variable-size array");
9943 = fold (build_binary_op (MINUS_EXPR
,
9944 cp_convert (index_type
, size
),
9945 cp_convert (index_type
,
9946 integer_one_node
)));
9947 if (! TREE_CONSTANT (itype
))
9948 itype
= variable_size (itype
);
9949 else if (TREE_OVERFLOW (itype
))
9951 error ("overflow in array dimension");
9952 TREE_OVERFLOW (itype
) = 0;
9955 itype
= build_index_type (itype
);
9958 resume_momentary (yes
);
9961 type
= build_cplus_array_type (type
, itype
);
9970 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
9971 tree inner_decl
= TREE_OPERAND (declarator
, 0);
9973 /* Declaring a function type.
9974 Make sure we have a valid type for the function to return. */
9976 /* We now know that the TYPE_QUALS don't apply to the
9977 decl, but to its return type. */
9978 type_quals
= TYPE_UNQUALIFIED
;
9980 /* Warn about some types functions can't return. */
9982 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9984 error ("`%s' declared as function returning a function", name
);
9985 type
= integer_type_node
;
9987 if (TREE_CODE (type
) == ARRAY_TYPE
)
9989 error ("`%s' declared as function returning an array", name
);
9990 type
= integer_type_node
;
9993 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
9994 inner_decl
= TREE_OPERAND (inner_decl
, 1);
9996 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
9999 /* Pick up type qualifiers which should be applied to `this'. */
10000 quals
= CALL_DECLARATOR_QUALS (declarator
);
10002 /* Pick up the exception specifications. */
10003 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
10005 /* Say it's a definition only for the CALL_EXPR
10006 closest to the identifier. */
10009 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
10010 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
10011 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
10013 if (ctype
== NULL_TREE
10014 && decl_context
== FIELD
10016 && (friendp
== 0 || dname
== current_class_name
))
10017 ctype
= current_class_type
;
10019 if (ctype
&& return_type
== return_conversion
)
10020 TYPE_HAS_CONVERSION (ctype
) = 1;
10021 if (ctype
&& constructor_name (ctype
) == dname
)
10023 /* We are within a class's scope. If our declarator name
10024 is the same as the class name, and we are defining
10025 a function, then it is a constructor/destructor, and
10026 therefore returns a void type. */
10028 if (flags
== DTOR_FLAG
)
10030 /* ANSI C++ June 5 1992 WP 12.4.1. A destructor may
10031 not be declared const or volatile. A destructor
10032 may not be static. */
10034 error ("destructor cannot be static member function");
10037 cp_error ("destructors may not be `%s'",
10038 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10041 if (decl_context
== FIELD
)
10043 if (! member_function_or_else (ctype
, current_class_type
,
10044 "destructor for alien class `%s' cannot be a member"))
10045 return void_type_node
;
10048 else /* It's a constructor. */
10050 if (explicitp
== 1)
10052 /* ANSI C++ June 5 1992 WP 12.1.2. A constructor may
10053 not be declared const or volatile. A constructor may
10054 not be virtual. A constructor may not be static. */
10056 error ("constructor cannot be static member function");
10059 pedwarn ("constructors cannot be declared virtual");
10064 cp_error ("constructors may not be `%s'",
10065 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10069 RID_BIT_TYPE tmp_bits
;
10070 bcopy ((void*)&specbits
, (void*)&tmp_bits
, sizeof (RID_BIT_TYPE
));
10071 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10072 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10073 if (RIDBIT_ANY_SET (tmp_bits
))
10074 error ("return value type specifier for constructor ignored");
10076 type
= build_pointer_type (ctype
);
10077 if (decl_context
== FIELD
)
10079 if (! member_function_or_else (ctype
, current_class_type
,
10080 "constructor for alien class `%s' cannot be member"))
10081 return void_type_node
;
10082 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10083 if (return_type
!= return_ctor
)
10087 if (decl_context
== FIELD
)
10093 error ("can't initialize friend function `%s'", name
);
10096 /* Cannot be both friend and virtual. */
10097 error ("virtual functions cannot be friends");
10098 RIDBIT_RESET (RID_FRIEND
, specbits
);
10101 if (decl_context
== NORMAL
)
10102 error ("friend declaration not in class definition");
10103 if (current_function_decl
&& funcdef_flag
)
10104 cp_error ("can't define friend function `%s' in a local class definition",
10108 /* Construct the function type and go to the next
10109 inner layer of declarator. */
10111 declarator
= TREE_OPERAND (declarator
, 0);
10113 /* FIXME: This is where default args should be fully
10116 arg_types
= grokparms (inner_parms
, funcdecl_p
? funcdef_flag
: 0);
10118 if (declarator
&& flags
== DTOR_FLAG
)
10120 /* A destructor declared in the body of a class will
10121 be represented as a BIT_NOT_EXPR. But, we just
10122 want the underlying IDENTIFIER. */
10123 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10124 declarator
= TREE_OPERAND (declarator
, 0);
10126 if (strict_prototype
== 0 && arg_types
== NULL_TREE
)
10127 arg_types
= void_list_node
;
10128 else if (arg_types
== NULL_TREE
10129 || arg_types
!= void_list_node
)
10131 cp_error ("destructors may not have parameters");
10132 arg_types
= void_list_node
;
10133 last_function_parms
= NULL_TREE
;
10137 /* ANSI says that `const int foo ();'
10138 does not make the function foo const. */
10139 type
= build_function_type (type
, arg_types
);
10143 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10144 if (TREE_PURPOSE (t
)
10145 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10147 add_defarg_fn (type
);
10156 /* Filter out pointers-to-references and references-to-references.
10157 We can get these if a TYPE_DECL is used. */
10159 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10161 error ("cannot declare %s to references",
10162 TREE_CODE (declarator
) == ADDR_EXPR
10163 ? "references" : "pointers");
10164 declarator
= TREE_OPERAND (declarator
, 0);
10168 if (TREE_CODE (type
) == OFFSET_TYPE
10169 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10170 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10172 cp_error ("cannot declare pointer to `%#T' member",
10174 type
= TREE_TYPE (type
);
10177 /* Merge any constancy or volatility into the target type
10178 for the pointer. */
10180 /* We now know that the TYPE_QUALS don't apply to the decl,
10181 but to the target of the pointer. */
10182 type_quals
= TYPE_UNQUALIFIED
;
10184 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10186 if (TREE_CODE (type
) == VOID_TYPE
)
10187 error ("invalid type: `void &'");
10189 type
= build_reference_type (type
);
10191 else if (TREE_CODE (type
) == METHOD_TYPE
)
10192 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10194 type
= build_pointer_type (type
);
10196 /* Process a list of type modifier keywords (such as
10197 const or volatile) that were given inside the `*' or `&'. */
10199 if (TREE_TYPE (declarator
))
10201 register tree typemodlist
;
10207 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10208 typemodlist
= TREE_CHAIN (typemodlist
))
10210 tree qualifier
= TREE_VALUE (typemodlist
);
10212 if (qualifier
== ridpointers
[(int) RID_CONST
])
10214 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10216 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10221 error ("invalid type modifier within pointer declarator");
10225 pedwarn ("duplicate `const'");
10227 pedwarn ("duplicate `volatile'");
10229 pedwarn ("duplicate `restrict'");
10231 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10232 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10233 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10234 if (TREE_CODE (declarator
) == ADDR_EXPR
10235 && (constp
|| volatilep
))
10238 pedwarn ("discarding `const' applied to a reference");
10240 pedwarn ("discarding `volatile' applied to a reference");
10241 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10243 type
= cp_build_qualified_type (type
, type_quals
);
10245 declarator
= TREE_OPERAND (declarator
, 0);
10251 /* We have converted type names to NULL_TREE if the
10252 name was bogus, or to a _TYPE node, if not.
10254 The variable CTYPE holds the type we will ultimately
10255 resolve to. The code here just needs to build
10256 up appropriate member types. */
10257 tree sname
= TREE_OPERAND (declarator
, 1);
10260 /* Destructors can have their visibilities changed as well. */
10261 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10262 sname
= TREE_OPERAND (sname
, 0);
10264 if (TREE_COMPLEXITY (declarator
) == 0)
10265 /* This needs to be here, in case we are called
10266 multiple times. */ ;
10267 else if (TREE_COMPLEXITY (declarator
) == -1)
10268 /* Namespace member. */
10269 pop_decl_namespace ();
10270 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10271 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10272 else if (! IS_AGGR_TYPE_CODE
10273 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10275 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10277 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10278 that refer to ctype. They couldn't be resolved earlier
10279 because we hadn't pushed into the class yet.
10280 Example: resolve 'B<T>::type' in
10281 'B<typename B<T>::type> B<T>::f () { }'. */
10282 if (current_template_parms
10283 && uses_template_parms (type
)
10284 && uses_template_parms (current_class_type
))
10286 tree args
= current_template_args ();
10287 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10290 /* This pop_nested_class corresponds to the
10291 push_nested_class used to push into class scope for
10292 parsing the argument list of a function decl, in
10294 pop_nested_class ();
10295 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10298 my_friendly_abort (16);
10300 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10302 /* We had a reference to a global decl, or
10303 perhaps we were given a non-aggregate typedef,
10304 in which case we cleared this out, and should just
10305 keep going as though it wasn't there. */
10306 declarator
= sname
;
10309 ctype
= TREE_OPERAND (declarator
, 0);
10312 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10314 if (CLASSTYPE_TEMPLATE_INFO (t
) &&
10315 !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
10316 template_count
+= 1;
10317 t
= TYPE_MAIN_DECL (t
);
10318 if (DECL_LANG_SPECIFIC (t
))
10319 t
= DECL_CLASS_CONTEXT (t
);
10324 if (sname
== NULL_TREE
)
10327 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10329 /* This is the `standard' use of the scoping operator:
10330 basetype :: member . */
10332 if (ctype
== current_class_type
)
10338 Is this ill-formed? */
10341 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10344 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10346 if (current_class_type
== NULL_TREE
10348 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10349 TYPE_ARG_TYPES (type
));
10352 cp_error ("cannot declare member function `%T::%s' within `%T'",
10353 ctype
, name
, current_class_type
);
10354 return void_type_node
;
10357 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10358 || TYPE_SIZE (complete_type (ctype
)) != NULL_TREE
)
10360 /* Have to move this code elsewhere in this function.
10361 this code is used for i.e., typedef int A::M; M *pm;
10363 It is? How? jason 10/2/94 */
10365 if (current_class_type
)
10367 cp_error ("cannot declare member `%T::%s' within `%T'",
10368 ctype
, name
, current_class_type
);
10369 return void_type_node
;
10371 type
= build_offset_type (ctype
, type
);
10373 else if (uses_template_parms (ctype
))
10375 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10377 = build_cplus_method_type (ctype
, TREE_TYPE (type
),
10378 TYPE_ARG_TYPES (type
));
10382 cp_error ("structure `%T' not yet defined", ctype
);
10383 return error_mark_node
;
10386 declarator
= sname
;
10388 else if (TREE_CODE (sname
) == SCOPE_REF
)
10389 my_friendly_abort (17);
10393 declarator
= TREE_OPERAND (declarator
, 1);
10394 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10395 /* In this case, we will deal with it later. */
10399 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10400 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10401 TYPE_ARG_TYPES (type
));
10403 type
= build_offset_type (ctype
, type
);
10410 declarator
= TREE_OPERAND (declarator
, 0);
10415 case ENUMERAL_TYPE
:
10416 declarator
= NULL_TREE
;
10420 declarator
= NULL_TREE
;
10424 my_friendly_abort (158);
10428 /* See the comment for the TREE_LIST case, above. */
10431 if (! ignore_attrs
)
10432 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10434 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
10436 attrlist
= build_decl_list (NULL_TREE
, inner_attrs
);
10439 /* Now TYPE has the actual type. */
10441 if (explicitp
== 1)
10443 error ("only constructors can be declared `explicit'");
10447 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10449 if (type_quals
& TYPE_QUAL_CONST
)
10451 error ("const `%s' cannot be declared `mutable'", name
);
10452 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10456 error ("static `%s' cannot be declared `mutable'", name
);
10457 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10461 if (declarator
== NULL_TREE
10462 || TREE_CODE (declarator
) == IDENTIFIER_NODE
10463 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
10464 && (TREE_CODE (type
) == FUNCTION_TYPE
10465 || TREE_CODE (type
) == METHOD_TYPE
)))
10467 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10469 cp_error ("template-id `%D' used as a declarator", declarator
);
10470 declarator
= dname
;
10473 /* Unexpected declarator format. */
10474 my_friendly_abort (990210);
10476 /* If this is declaring a typedef name, return a TYPE_DECL. */
10478 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
10482 /* Note that the grammar rejects storage classes
10483 in typenames, fields or parameters. */
10484 if (current_lang_name
== lang_name_java
)
10485 TYPE_FOR_JAVA (type
) = 1;
10487 if (decl_context
== FIELD
)
10489 if (declarator
== constructor_name (current_class_type
))
10490 cp_pedwarn ("ANSI C++ forbids nested type `%D' with same name as enclosing class",
10492 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10496 /* Make sure this typedef lives as long as its type,
10497 since it might be used as a template parameter. */
10498 if (type
!= error_mark_node
)
10499 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
10500 if (processing_template_decl
)
10501 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10503 decl
= build_decl (TYPE_DECL
, declarator
, type
);
10504 if (type
!= error_mark_node
)
10508 /* If the user declares "typedef struct {...} foo" then the
10509 struct will have an anonymous name. Fill that name in now.
10510 Nothing can refer to it, so nothing needs know about the name
10512 if (type
!= error_mark_node
10513 && TYPE_NAME (type
)
10514 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
10515 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
10516 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
10518 tree oldname
= TYPE_NAME (type
);
10521 /* Replace the anonymous name with the real name everywhere. */
10522 lookup_tag_reverse (type
, declarator
);
10523 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
10524 if (TYPE_NAME (t
) == oldname
)
10525 TYPE_NAME (t
) = decl
;
10527 if (TYPE_LANG_SPECIFIC (type
))
10528 TYPE_WAS_ANONYMOUS (type
) = 1;
10530 /* If this is a typedef within a template class, the nested
10531 type is a (non-primary) template. The name for the
10532 template needs updating as well. */
10533 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
10534 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
10535 = TYPE_IDENTIFIER (type
);
10537 /* XXX Temporarily set the scope.
10538 When returning, start_decl expects it as NULL_TREE,
10539 and will then then set it using pushdecl. */
10540 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
10541 if (current_class_type
)
10542 DECL_CONTEXT (decl
) = current_class_type
;
10544 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
10546 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
10547 DECL_ASSEMBLER_NAME (decl
)
10548 = get_identifier (build_overload_name (type
, 1, 1));
10549 DECL_CONTEXT (decl
) = NULL_TREE
;
10551 /* FIXME remangle member functions; member functions of a
10552 type with external linkage have external linkage. */
10555 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10557 cp_error_at ("typedef name may not be class-qualified", decl
);
10562 if (ctype
== NULL_TREE
)
10564 if (TREE_CODE (type
) != METHOD_TYPE
)
10565 cp_error_at ("invalid type qualifier for non-method type", decl
);
10567 ctype
= TYPE_METHOD_BASETYPE (type
);
10569 if (ctype
!= NULL_TREE
)
10570 grok_method_quals (ctype
, decl
, quals
);
10573 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10574 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
10575 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
10577 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10578 error ("non-object member `%s' cannot be declared mutable", name
);
10580 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
10581 inlinep
, friendp
, raises
!= NULL_TREE
);
10584 error ("typedef declaration includes an initializer");
10589 /* Detect the case of an array type of unspecified size
10590 which came, as such, direct from a typedef name.
10591 We must copy the type, so that each identifier gets
10592 a distinct type, so that each identifier's size can be
10593 controlled separately by its own initializer. */
10595 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
10596 && TYPE_DOMAIN (type
) == NULL_TREE
)
10598 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
10601 /* If this is a type name (such as, in a cast or sizeof),
10602 compute the type and return it now. */
10604 if (decl_context
== TYPENAME
)
10606 /* Note that the grammar rejects storage classes
10607 in typenames, fields or parameters. */
10608 if (type_quals
!= TYPE_UNQUALIFIED
)
10609 type_quals
= TYPE_UNQUALIFIED
;
10611 /* Special case: "friend class foo" looks like a TYPENAME context. */
10614 if (type_quals
!= TYPE_UNQUALIFIED
)
10616 cp_error ("type qualifiers specified for friend class declaration");
10617 type_quals
= TYPE_UNQUALIFIED
;
10621 cp_error ("`inline' specified for friend class declaration");
10625 /* Only try to do this stuff if we didn't already give up. */
10626 if (type
!= integer_type_node
)
10628 /* A friendly class? */
10629 if (current_class_type
)
10630 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
10632 error ("trying to make class `%s' a friend of global scope",
10633 TYPE_NAME_STRING (type
));
10634 type
= void_type_node
;
10639 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
10640 if (ctype
== NULL_TREE
)
10642 my_friendly_assert (TREE_CODE (type
) == METHOD_TYPE
, 159);
10643 ctype
= TYPE_METHOD_BASETYPE (type
);
10645 grok_method_quals (ctype
, dummy
, quals
);
10646 type
= TREE_TYPE (dummy
);
10651 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
10652 && decl_context
!= CATCHPARM
10653 && TREE_CODE (type
) != UNION_TYPE
10656 cp_error ("abstract declarator `%T' used as declaration", type
);
10657 declarator
= make_anon_name ();
10660 /* `void' at top level (not within pointer)
10661 is allowed only in typedefs or type names.
10662 We don't complain about parms either, but that is because
10663 a better error message can be made later. */
10665 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
10668 error ("unnamed variable or field declared void");
10669 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10671 if (IDENTIFIER_OPNAME_P (declarator
))
10672 my_friendly_abort (356);
10674 error ("variable or field `%s' declared void", name
);
10677 error ("variable or field declared void");
10678 type
= integer_type_node
;
10681 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
10682 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
10684 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10686 if (ctype
|| in_namespace
)
10687 error ("cannot use `::' in parameter declaration");
10689 /* A parameter declared as an array of T is really a pointer to T.
10690 One declared as a function is really a pointer to a function.
10691 One declared as a member is really a pointer to member. */
10693 if (TREE_CODE (type
) == ARRAY_TYPE
)
10695 /* Transfer const-ness of array into that of type pointed to. */
10696 type
= build_pointer_type (TREE_TYPE (type
));
10697 type_quals
= TYPE_UNQUALIFIED
;
10699 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10700 type
= build_pointer_type (type
);
10701 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10702 type
= build_pointer_type (type
);
10703 else if (TREE_CODE (type
) == VOID_TYPE
&& declarator
)
10705 error ("declaration of `%s' as void", name
);
10711 register tree decl
;
10713 if (decl_context
== PARM
)
10715 decl
= build_decl (PARM_DECL
, declarator
, type
);
10717 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
10718 inlinep
, friendp
, raises
!= NULL_TREE
);
10720 /* Compute the type actually passed in the parmlist,
10721 for the case where there is no prototype.
10722 (For example, shorts and chars are passed as ints.)
10723 When there is a prototype, this is overridden later. */
10725 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
10727 else if (decl_context
== FIELD
)
10729 if (type
== error_mark_node
)
10731 /* Happens when declaring arrays of sizes which
10732 are error_mark_node, for example. */
10735 else if (in_namespace
&& !friendp
)
10737 /* Something like struct S { int N::j; }; */
10738 cp_error ("invalid use of `::'");
10741 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10744 tree function_context
;
10746 /* We catch the others as conflicts with the builtin
10748 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
10750 cp_error ("function `%D' cannot be declared friend",
10757 if (ctype
== NULL_TREE
)
10758 ctype
= current_class_type
;
10760 if (ctype
== NULL_TREE
)
10762 cp_error ("can't make `%D' into a method -- not in a class",
10764 return void_type_node
;
10767 /* ``A union may [ ... ] not [ have ] virtual functions.''
10769 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
10771 cp_error ("function `%D' declared virtual inside a union",
10773 return void_type_node
;
10776 if (declarator
== ansi_opname
[(int) NEW_EXPR
]
10777 || declarator
== ansi_opname
[(int) VEC_NEW_EXPR
]
10778 || declarator
== ansi_opname
[(int) DELETE_EXPR
]
10779 || declarator
== ansi_opname
[(int) VEC_DELETE_EXPR
])
10783 cp_error ("`%D' cannot be declared virtual, since it is always static",
10788 else if (staticp
< 2)
10789 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10790 TYPE_ARG_TYPES (type
));
10793 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
10794 function_context
= (ctype
!= NULL_TREE
) ?
10795 hack_decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
10796 publicp
= (! friendp
|| ! staticp
)
10797 && function_context
== NULL_TREE
;
10798 decl
= grokfndecl (ctype
, type
,
10799 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
10800 ? declarator
: dname
,
10802 virtualp
, flags
, quals
, raises
,
10803 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
10804 funcdef_flag
, template_count
, in_namespace
);
10805 if (decl
== NULL_TREE
)
10808 /* This clobbers the attrs stored in `decl' from `attrlist'. */
10809 /* The decl and setting of decl_machine_attr is also turned off. */
10810 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
10813 /* [class.conv.ctor]
10815 A constructor declared without the function-specifier
10816 explicit that can be called with a single parameter
10817 specifies a conversion from the type of its first
10818 parameter to the type of its class. Such a constructor
10819 is called a converting constructor. */
10820 if (explicitp
== 2)
10821 DECL_NONCONVERTING_P (decl
) = 1;
10822 else if (DECL_CONSTRUCTOR_P (decl
))
10824 /* The constructor can be called with exactly one
10825 parameter if there is at least one parameter, and
10826 any subsequent parameters have default arguments.
10827 We don't look at the first parameter, which is
10828 really just the `this' parameter for the new
10831 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
10833 /* Skip the `in_chrg' argument too, if present. */
10834 if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (decl
)))
10835 arg_types
= TREE_CHAIN (arg_types
);
10837 if (arg_types
== void_list_node
10839 && TREE_CHAIN (arg_types
)
10840 && TREE_CHAIN (arg_types
) != void_list_node
10841 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
10842 DECL_NONCONVERTING_P (decl
) = 1;
10845 else if (TREE_CODE (type
) == METHOD_TYPE
)
10847 /* We only get here for friend declarations of
10848 members of other classes. */
10849 /* All method decls are public, so tell grokfndecl to set
10850 TREE_PUBLIC, also. */
10851 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
10852 virtualp
, flags
, quals
, raises
,
10853 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
10854 template_count
, in_namespace
);
10855 if (decl
== NULL_TREE
)
10858 else if (!staticp
&& ! processing_template_decl
10859 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
10860 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
10863 cp_error ("field `%D' has incomplete type", declarator
);
10865 cp_error ("name `%T' has incomplete type", type
);
10867 /* If we're instantiating a template, tell them which
10868 instantiation made the field's type be incomplete. */
10869 if (current_class_type
10870 && TYPE_NAME (current_class_type
)
10871 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
10872 && declspecs
&& TREE_VALUE (declspecs
)
10873 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
10874 cp_error (" in instantiation of template `%T'",
10875 current_class_type
);
10877 type
= error_mark_node
;
10884 error ("`%s' is neither function nor method; cannot be declared friend",
10885 IDENTIFIER_POINTER (declarator
));
10893 /* Friends are treated specially. */
10894 if (ctype
== current_class_type
)
10895 warning ("member functions are implicitly friends of their class");
10898 tree t
= NULL_TREE
;
10899 if (decl
&& DECL_NAME (decl
))
10901 if (template_class_depth (current_class_type
) == 0)
10904 = check_explicit_specialization
10906 template_count
, 2 * (funcdef_flag
!= 0) + 4);
10907 if (decl
== error_mark_node
)
10908 return error_mark_node
;
10911 t
= do_friend (ctype
, declarator
, decl
,
10912 last_function_parms
, attrlist
, flags
, quals
,
10915 if (t
&& funcdef_flag
)
10918 return void_type_node
;
10922 /* Structure field. It may not be a function, except for C++ */
10924 if (decl
== NULL_TREE
)
10930 /* An attempt is being made to initialize a non-static
10931 member. But, from [class.mem]:
10933 4 A member-declarator can contain a
10934 constant-initializer only if it declares a static
10935 member (_class.static_) of integral or enumeration
10936 type, see _class.static.data_.
10938 This used to be relatively common practice, but
10939 the rest of the compiler does not correctly
10940 handle the initialization unless the member is
10941 static so we make it static below. */
10942 cp_pedwarn ("ANSI C++ forbids initialization of member `%D'",
10944 cp_pedwarn ("making `%D' static", declarator
);
10948 if (uses_template_parms (type
))
10949 /* We'll check at instantiation time. */
10951 else if (check_static_variable_definition (declarator
,
10953 /* If we just return the declaration, crashes
10954 will sometimes occur. We therefore return
10955 void_type_node, as if this was a friend
10956 declaration, to cause callers to completely
10957 ignore this declaration. */
10958 return void_type_node
;
10961 /* 9.2p13 [class.mem] */
10962 if (declarator
== constructor_name (current_class_type
)
10963 /* Divergence from the standard: In extern "C", we
10964 allow non-static data members here, because C does
10965 and /usr/include/netinet/in.h uses that. */
10966 && (staticp
|| ! in_system_header
))
10967 cp_pedwarn ("ANSI C++ forbids data member `%D' with same name as enclosing class",
10972 /* C++ allows static class members. All other work
10973 for this is done by grokfield. */
10974 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
10975 TREE_STATIC (decl
) = 1;
10976 /* In class context, 'static' means public access. */
10977 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
10981 decl
= build_lang_decl (FIELD_DECL
, declarator
, type
);
10982 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10984 DECL_MUTABLE_P (decl
) = 1;
10985 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10989 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
10990 inlinep
, friendp
, raises
!= NULL_TREE
);
10993 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10995 tree original_name
;
11001 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11002 original_name
= dname
;
11004 original_name
= declarator
;
11006 if (RIDBIT_SETP (RID_AUTO
, specbits
))
11007 error ("storage class `auto' invalid for function `%s'", name
);
11008 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11009 error ("storage class `register' invalid for function `%s'", name
);
11011 /* Function declaration not at top level.
11012 Storage classes other than `extern' are not allowed
11013 and `extern' makes no difference. */
11014 if (! toplevel_bindings_p ()
11015 && (RIDBIT_SETP (RID_STATIC
, specbits
)
11016 || RIDBIT_SETP (RID_INLINE
, specbits
))
11019 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11020 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
11022 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
11025 if (ctype
== NULL_TREE
)
11029 error ("virtual non-class function `%s'", name
);
11033 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
11034 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11035 TYPE_ARG_TYPES (type
));
11037 /* Record presence of `static'. */
11038 publicp
= (ctype
!= NULL_TREE
11039 || RIDBIT_SETP (RID_EXTERN
, specbits
)
11040 || !RIDBIT_SETP (RID_STATIC
, specbits
));
11042 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
11043 virtualp
, flags
, quals
, raises
,
11045 publicp
, inlinep
, funcdef_flag
,
11046 template_count
, in_namespace
);
11047 if (decl
== NULL_TREE
)
11052 int illegal_static
= 0;
11054 /* Don't allow a static member function in a class, and forbid
11055 declaring main to be static. */
11056 if (TREE_CODE (type
) == METHOD_TYPE
)
11058 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11059 illegal_static
= 1;
11061 else if (current_function_decl
)
11063 /* FIXME need arm citation */
11064 error ("cannot declare static function inside another function");
11065 illegal_static
= 1;
11068 if (illegal_static
)
11071 RIDBIT_RESET (RID_STATIC
, specbits
);
11077 /* It's a variable. */
11079 /* An uninitialized decl with `extern' is a reference. */
11080 decl
= grokvardecl (type
, declarator
, &specbits
,
11082 (type_quals
& TYPE_QUAL_CONST
) != 0,
11084 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11085 inlinep
, friendp
, raises
!= NULL_TREE
);
11089 DECL_CONTEXT (decl
) = ctype
;
11092 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11094 RIDBIT_RESET (RID_STATIC
, specbits
);
11096 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11098 cp_error ("static member `%D' declared `register'", decl
);
11099 RIDBIT_RESET (RID_REGISTER
, specbits
);
11101 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11103 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11105 RIDBIT_RESET (RID_EXTERN
, specbits
);
11110 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11112 error ("`%s' cannot be declared mutable", name
);
11115 /* Record `register' declaration for warnings on &
11116 and in case doing stupid register allocation. */
11118 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11119 DECL_REGISTER (decl
) = 1;
11121 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11122 DECL_THIS_EXTERN (decl
) = 1;
11124 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11125 DECL_THIS_STATIC (decl
) = 1;
11127 /* Record constancy and volatility. There's no need to do this
11128 when processing a template; we'll do this for the instantiated
11129 declaration based on the type of DECL. */
11130 if (!processing_template_decl
)
11131 c_apply_type_quals_to_decl (type_quals
, decl
);
11137 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11138 An empty exprlist is a parmlist. An exprlist which
11139 contains only identifiers at the global level
11140 is a parmlist. Otherwise, it is an exprlist. */
11143 parmlist_is_exprlist (exprs
)
11146 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11149 if (toplevel_bindings_p ())
11151 /* At the global level, if these are all identifiers,
11152 then it is a parmlist. */
11155 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11157 exprs
= TREE_CHAIN (exprs
);
11164 /* Subroutine of start_function. Ensure that each of the parameter
11165 types (as listed in PARMS) is complete, as is required for a
11166 function definition. */
11169 require_complete_types_for_parms (parms
)
11174 tree type
= TREE_TYPE (parms
);
11175 if (TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
11177 if (DECL_NAME (parms
))
11178 error ("parameter `%s' has incomplete type",
11179 IDENTIFIER_POINTER (DECL_NAME (parms
)));
11181 error ("parameter has incomplete type");
11182 TREE_TYPE (parms
) = error_mark_node
;
11185 layout_decl (parms
, 0);
11187 parms
= TREE_CHAIN (parms
);
11191 /* Returns *TP if *TP is a local variable (or parameter). Returns
11192 NULL_TREE otherwise. */
11195 local_variable_p (tp
)
11200 if ((TREE_CODE (t
) == VAR_DECL
11201 /* A VAR_DECL with a context that is a _TYPE is a static data
11203 && !TYPE_P (CP_DECL_CONTEXT (t
))
11204 /* Any other non-local variable must be at namespace scope. */
11205 && TREE_CODE (CP_DECL_CONTEXT (t
)) != NAMESPACE_DECL
)
11206 || (TREE_CODE (t
) == PARM_DECL
))
11212 /* Check that ARG, which is a default-argument expression for a
11213 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11214 something goes wrong. DECL may also be a _TYPE node, rather than a
11215 DECL, if there is no DECL available. */
11218 check_default_argument (decl
, arg
)
11225 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11226 /* We get a DEFAULT_ARG when looking at an in-class declaration
11227 with a default argument. Ignore the argument for now; we'll
11228 deal with it after the class is complete. */
11231 if (processing_template_decl
|| uses_template_parms (arg
))
11232 /* We don't do anything checking until instantiation-time. Note
11233 that there may be uninstantiated arguments even for an
11234 instantiated function, since default arguments are not
11235 instantiated until they are needed. */
11244 decl_type
= TREE_TYPE (decl
);
11246 if (arg
== error_mark_node
11247 || decl
== error_mark_node
11248 || TREE_TYPE (arg
) == error_mark_node
11249 || decl_type
== error_mark_node
)
11250 /* Something already went wrong. There's no need to check
11252 return error_mark_node
;
11254 /* [dcl.fct.default]
11256 A default argument expression is implicitly converted to the
11258 if (!TREE_TYPE (arg
)
11259 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11262 cp_error ("default argument for `%#D' has type `%T'",
11263 decl
, TREE_TYPE (arg
));
11265 cp_error ("default argument for parameter of type `%T' has type `%T'",
11266 decl_type
, TREE_TYPE (arg
));
11268 return error_mark_node
;
11271 /* [dcl.fct.default]
11273 Local variables shall not be used in default argument
11276 The keyword `this' shall not be used in a default argument of a
11277 member function. */
11278 var
= search_tree (&arg
, local_variable_p
);
11281 cp_error ("default argument `%E' uses local variable `%D'",
11283 return error_mark_node
;
11290 /* Decode the list of parameter types for a function type.
11291 Given the list of things declared inside the parens,
11292 return a list of types.
11294 The list we receive can have three kinds of elements:
11295 an IDENTIFIER_NODE for names given without types,
11296 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11297 or void_type_node, to mark the end of an argument list
11298 when additional arguments are not permitted (... was not used).
11300 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11301 a mere declaration. A nonempty identifier-list gets an error message
11302 when FUNCDEF_FLAG is zero.
11303 If FUNCDEF_FLAG is 1, then parameter types must be complete.
11304 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11306 If all elements of the input list contain types,
11307 we return a list of the types.
11308 If all elements contain no type (except perhaps a void_type_node
11309 at the end), we return a null list.
11310 If some have types and some do not, it is an error, and we
11311 return a null list.
11313 Also set last_function_parms to either
11314 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11315 A list of names is converted to a chain of PARM_DECLs
11316 by store_parm_decls so that ultimately it is always a chain of decls.
11318 Note that in C++, parameters can take default values. These default
11319 values are in the TREE_PURPOSE field of the TREE_LIST. It is
11320 an error to specify default values which are followed by parameters
11321 that have no default values, or an ELLIPSES. For simplicities sake,
11322 only parameters which are specified with their types can take on
11326 grokparms (first_parm
, funcdef_flag
)
11330 tree result
= NULL_TREE
;
11331 tree decls
= NULL_TREE
;
11333 if (first_parm
!= NULL_TREE
11334 && TREE_CODE (TREE_VALUE (first_parm
)) == IDENTIFIER_NODE
)
11336 if (! funcdef_flag
)
11337 pedwarn ("parameter names (without types) in function declaration");
11338 last_function_parms
= first_parm
;
11341 else if (first_parm
!= NULL_TREE
11342 && TREE_CODE (TREE_VALUE (first_parm
)) != TREE_LIST
11343 && TREE_CODE (TREE_VALUE (first_parm
)) != VOID_TYPE
)
11344 my_friendly_abort (145);
11347 /* Types were specified. This is a list of declarators
11348 each represented as a TREE_LIST node. */
11349 register tree parm
, chain
;
11350 int any_init
= 0, any_error
= 0;
11352 if (first_parm
!= NULL_TREE
)
11354 tree last_result
= NULL_TREE
;
11355 tree last_decl
= NULL_TREE
;
11357 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11359 tree type
= NULL_TREE
, list_node
= parm
;
11360 register tree decl
= TREE_VALUE (parm
);
11361 tree init
= TREE_PURPOSE (parm
);
11363 chain
= TREE_CHAIN (parm
);
11364 /* @@ weak defense against parse errors. */
11365 if (TREE_CODE (decl
) != VOID_TYPE
11366 && TREE_CODE (decl
) != TREE_LIST
)
11368 /* Give various messages as the need arises. */
11369 if (TREE_CODE (decl
) == STRING_CST
)
11370 cp_error ("invalid string constant `%E'", decl
);
11371 else if (TREE_CODE (decl
) == INTEGER_CST
)
11372 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11376 if (TREE_CODE (decl
) != VOID_TYPE
)
11378 decl
= grokdeclarator (TREE_VALUE (decl
),
11379 TREE_PURPOSE (decl
),
11380 PARM
, init
!= NULL_TREE
,
11382 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
11385 /* Top-level qualifiers on the parameters are
11386 ignored for function types. */
11387 type
= TYPE_MAIN_VARIANT (TREE_TYPE (decl
));
11389 if (TREE_CODE (type
) == VOID_TYPE
)
11390 decl
= void_type_node
;
11391 else if (TREE_CODE (type
) == METHOD_TYPE
)
11393 if (DECL_NAME (decl
))
11394 /* Cannot use the decl here because
11395 we don't have DECL_CONTEXT set up yet. */
11396 cp_error ("parameter `%D' invalidly declared method type",
11399 error ("parameter invalidly declared method type");
11400 type
= build_pointer_type (type
);
11401 TREE_TYPE (decl
) = type
;
11403 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11405 if (DECL_NAME (decl
))
11406 cp_error ("parameter `%D' invalidly declared offset type",
11409 error ("parameter invalidly declared offset type");
11410 type
= build_pointer_type (type
);
11411 TREE_TYPE (decl
) = type
;
11413 else if (abstract_virtuals_error (decl
, type
))
11414 any_error
= 1; /* Seems like a good idea. */
11415 else if (POINTER_TYPE_P (type
))
11418 while (POINTER_TYPE_P (t
)
11419 || (TREE_CODE (t
) == ARRAY_TYPE
11420 && TYPE_DOMAIN (t
) != NULL_TREE
))
11422 if (TREE_CODE (t
) == ARRAY_TYPE
)
11423 cp_error ("parameter type `%T' includes %s to array of unknown bound",
11425 TYPE_PTR_P (type
) ? "pointer" : "reference");
11429 if (TREE_CODE (decl
) == VOID_TYPE
)
11431 if (result
== NULL_TREE
)
11433 result
= void_list_node
;
11434 last_result
= result
;
11438 TREE_CHAIN (last_result
) = void_list_node
;
11439 last_result
= void_list_node
;
11442 && (chain
!= void_list_node
|| TREE_CHAIN (chain
)))
11443 error ("`void' in parameter list must be entire list");
11447 /* Since there is a prototype, args are passed in their own types. */
11448 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
11449 if (PROMOTE_PROTOTYPES
11450 && (TREE_CODE (type
) == INTEGER_TYPE
11451 || TREE_CODE (type
) == ENUMERAL_TYPE
)
11452 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
11453 DECL_ARG_TYPE (decl
) = integer_type_node
;
11454 if (!any_error
&& init
)
11457 init
= check_default_argument (decl
, init
);
11462 if (decls
== NULL_TREE
)
11469 TREE_CHAIN (last_decl
) = decl
;
11472 list_node
= tree_cons (init
, type
, NULL_TREE
);
11473 if (result
== NULL_TREE
)
11475 result
= list_node
;
11476 last_result
= result
;
11480 TREE_CHAIN (last_result
) = list_node
;
11481 last_result
= list_node
;
11485 TREE_CHAIN (last_result
) = NULL_TREE
;
11486 /* If there are no parameters, and the function does not end
11487 with `...', then last_decl will be NULL_TREE. */
11488 if (last_decl
!= NULL_TREE
)
11489 TREE_CHAIN (last_decl
) = NULL_TREE
;
11493 last_function_parms
= decls
;
11498 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
11499 FUNCTION_TYPE with the newly parsed version of its default argument, which
11500 was previously digested as text. See snarf_defarg et al in lex.c. */
11503 replace_defarg (arg
, init
)
11506 if (! processing_template_decl
11507 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
11508 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
11509 TREE_TYPE (init
), TREE_VALUE (arg
));
11510 TREE_PURPOSE (arg
) = init
;
11517 tree t
= FUNCTION_ARG_CHAIN (d
);
11518 if (DECL_CONSTRUCTOR_P (d
)
11519 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (d
)))
11520 t
= TREE_CHAIN (t
);
11521 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
11522 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
11523 == DECL_CLASS_CONTEXT (d
))
11524 && (TREE_CHAIN (t
) == NULL_TREE
11525 || TREE_CHAIN (t
) == void_list_node
11526 || TREE_PURPOSE (TREE_CHAIN (t
))))
11531 /* These memoizing functions keep track of special properties which
11532 a class may have. `grok_ctor_properties' notices whether a class
11533 has a constructor of the form X(X&), and also complains
11534 if the class has a constructor of the form X(X).
11535 `grok_op_properties' takes notice of the various forms of
11536 operator= which are defined, as well as what sorts of type conversion
11537 may apply. Both functions take a FUNCTION_DECL as an argument. */
11540 grok_ctor_properties (ctype
, decl
)
11543 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
11544 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
11546 /* When a type has virtual baseclasses, a magical first int argument is
11547 added to any ctor so we can tell if the class has been initialized
11548 yet. This could screw things up in this function, so we deliberately
11549 ignore the leading int if we're in that situation. */
11550 if (TYPE_USES_VIRTUAL_BASECLASSES (ctype
))
11552 my_friendly_assert (parmtypes
11553 && TREE_VALUE (parmtypes
) == integer_type_node
,
11555 parmtypes
= TREE_CHAIN (parmtypes
);
11556 parmtype
= TREE_VALUE (parmtypes
);
11561 A non-template constructor for class X is a copy constructor if
11562 its first parameter is of type X&, const X&, volatile X& or const
11563 volatile X&, and either there are no other parameters or else all
11564 other parameters have default arguments. */
11565 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
11566 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
11567 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11568 || TREE_CHAIN (parmtypes
) == void_list_node
11569 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11570 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11571 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11573 TYPE_HAS_INIT_REF (ctype
) = 1;
11574 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11575 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
11579 A declaration of a constructor for a class X is ill-formed if its
11580 first parameter is of type (optionally cv-qualified) X and either
11581 there are no other parameters or else all other parameters have
11584 We *don't* complain about member template instantiations that
11585 have this form, though; they can occur as we try to decide what
11586 constructor to use during overload resolution. Since overload
11587 resolution will never prefer such a constructor to the
11588 non-template copy constructor (which is either explicitly or
11589 implicitly defined), there's no need to worry about their
11590 existence. Theoretically, they should never even be
11591 instantiated, but that's hard to forestall. */
11592 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
11593 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11594 || TREE_CHAIN (parmtypes
) == void_list_node
11595 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11596 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11597 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11599 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
11601 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
11604 else if (TREE_CODE (parmtype
) == VOID_TYPE
11605 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
11606 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
11611 /* An operator with this name can be either unary or binary. */
11617 return (name
== ansi_opname
[(int) INDIRECT_REF
]
11618 || name
== ansi_opname
[(int) ADDR_EXPR
]
11619 || name
== ansi_opname
[(int) NEGATE_EXPR
]
11620 || name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11621 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]
11622 || name
== ansi_opname
[(int) CONVERT_EXPR
]);
11625 /* An operator with this name can only be unary. */
11631 return (name
== ansi_opname
[(int) TRUTH_NOT_EXPR
]
11632 || name
== ansi_opname
[(int) BIT_NOT_EXPR
]
11633 || name
== ansi_opname
[(int) COMPONENT_REF
]
11634 || IDENTIFIER_TYPENAME_P (name
));
11637 /* Do a little sanity-checking on how they declared their operator. */
11640 grok_op_properties (decl
, virtualp
, friendp
)
11642 int virtualp
, friendp
;
11644 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
11645 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
11646 tree name
= DECL_NAME (decl
);
11648 if (current_class_type
== NULL_TREE
)
11655 A user-declared copy assignment operator X::operator= is a
11656 non-static non-template member function of class X with
11657 exactly one parameter of type X, X&, const X&, volatile X& or
11658 const volatile X&. */
11659 if (name
== ansi_opname
[(int) MODIFY_EXPR
]
11660 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11661 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11663 else if (name
== ansi_opname
[(int) CALL_EXPR
])
11664 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
11665 else if (name
== ansi_opname
[(int) ARRAY_REF
])
11666 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
11667 else if (name
== ansi_opname
[(int) COMPONENT_REF
]
11668 || name
== ansi_opname
[(int) MEMBER_REF
])
11669 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
11670 else if (name
== ansi_opname
[(int) NEW_EXPR
])
11671 TYPE_GETS_NEW (current_class_type
) |= 1;
11672 else if (name
== ansi_opname
[(int) DELETE_EXPR
])
11673 TYPE_GETS_DELETE (current_class_type
) |= 1;
11674 else if (name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11675 TYPE_GETS_NEW (current_class_type
) |= 2;
11676 else if (name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11677 TYPE_GETS_DELETE (current_class_type
) |= 2;
11680 if (name
== ansi_opname
[(int) NEW_EXPR
]
11681 || name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11683 /* When the compiler encounters the definition of A::operator new, it
11684 doesn't look at the class declaration to find out if it's static. */
11686 revert_static_member_fn (&decl
, NULL
, NULL
);
11688 /* Take care of function decl if we had syntax errors. */
11689 if (argtypes
== NULL_TREE
)
11691 = build_function_type (ptr_type_node
,
11692 hash_tree_chain (integer_type_node
,
11695 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
11697 else if (name
== ansi_opname
[(int) DELETE_EXPR
]
11698 || name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11701 revert_static_member_fn (&decl
, NULL
, NULL
);
11703 if (argtypes
== NULL_TREE
)
11705 = build_function_type (void_type_node
,
11706 hash_tree_chain (ptr_type_node
,
11710 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
11712 if (! friendp
&& name
== ansi_opname
[(int) VEC_DELETE_EXPR
]
11713 && (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
11714 != void_list_node
))
11715 TYPE_VEC_DELETE_TAKES_SIZE (current_class_type
) = 1;
11720 /* An operator function must either be a non-static member function
11721 or have at least one parameter of a class, a reference to a class,
11722 an enumeration, or a reference to an enumeration. 13.4.0.6 */
11723 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
11725 if (IDENTIFIER_TYPENAME_P (name
)
11726 || name
== ansi_opname
[(int) CALL_EXPR
]
11727 || name
== ansi_opname
[(int) MODIFY_EXPR
]
11728 || name
== ansi_opname
[(int) COMPONENT_REF
]
11729 || name
== ansi_opname
[(int) ARRAY_REF
])
11730 cp_error ("`%D' must be a nonstatic member function", decl
);
11735 if (DECL_STATIC_FUNCTION_P (decl
))
11736 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
11739 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
11741 tree arg
= TREE_VALUE (p
);
11742 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
11743 arg
= TREE_TYPE (arg
);
11745 /* This lets bad template code slip through. */
11746 if (IS_AGGR_TYPE (arg
)
11747 || TREE_CODE (arg
) == ENUMERAL_TYPE
11748 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
11749 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11753 ("`%D' must have an argument of class or enumerated type",
11760 if (name
== ansi_opname
[(int) CALL_EXPR
])
11761 return; /* No restrictions on args. */
11763 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
11765 tree t
= TREE_TYPE (name
);
11766 if (TREE_CODE (t
) == VOID_TYPE
)
11767 pedwarn ("void is not a valid type conversion operator");
11768 else if (! friendp
)
11770 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
11771 const char *what
= 0;
11773 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
11775 if (t
== current_class_type
)
11776 what
= "the same type";
11777 /* Don't force t to be complete here. */
11778 else if (IS_AGGR_TYPE (t
)
11780 && DERIVED_FROM_P (t
, current_class_type
))
11781 what
= "a base class";
11784 warning ("conversion to %s%s will never use a type conversion operator",
11785 ref
? "a reference to " : "", what
);
11789 if (name
== ansi_opname
[(int) MODIFY_EXPR
])
11793 if (list_length (argtypes
) != 3 && methodp
)
11795 cp_error ("`%D' must take exactly one argument", decl
);
11798 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
11800 if (copy_assignment_arg_p (parmtype
, virtualp
)
11803 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
11804 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
11805 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11806 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
11809 else if (name
== ansi_opname
[(int) COND_EXPR
])
11812 cp_error ("ANSI C++ prohibits overloading operator ?:");
11814 else if (ambi_op_p (name
))
11816 if (list_length (argtypes
) == 2)
11818 else if (list_length (argtypes
) == 3)
11820 if ((name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11821 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11822 && ! processing_template_decl
11823 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
11826 cp_error ("postfix `%D' must take `int' as its argument",
11830 ("postfix `%D' must take `int' as its second argument",
11837 cp_error ("`%D' must take either zero or one argument", decl
);
11839 cp_error ("`%D' must take either one or two arguments", decl
);
11842 /* More Effective C++ rule 6. */
11844 && (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11845 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]))
11847 tree arg
= TREE_VALUE (argtypes
);
11848 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
11849 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
11850 arg
= TREE_TYPE (arg
);
11851 arg
= TYPE_MAIN_VARIANT (arg
);
11852 if (list_length (argtypes
) == 2)
11854 if (TREE_CODE (ret
) != REFERENCE_TYPE
11855 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
11857 cp_warning ("prefix `%D' should return `%T'", decl
,
11858 build_reference_type (arg
));
11862 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
11863 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
11867 else if (unary_op_p (name
))
11869 if (list_length (argtypes
) != 2)
11872 cp_error ("`%D' must take `void'", decl
);
11874 cp_error ("`%D' must take exactly one argument", decl
);
11877 else /* if (binary_op_p (name)) */
11879 if (list_length (argtypes
) != 3)
11882 cp_error ("`%D' must take exactly one argument", decl
);
11884 cp_error ("`%D' must take exactly two arguments", decl
);
11887 /* More Effective C++ rule 7. */
11889 && (name
== ansi_opname
[TRUTH_ANDIF_EXPR
]
11890 || name
== ansi_opname
[TRUTH_ORIF_EXPR
]
11891 || name
== ansi_opname
[COMPOUND_EXPR
]))
11892 cp_warning ("user-defined `%D' always evaluates both arguments",
11896 /* Effective C++ rule 23. */
11898 && list_length (argtypes
) == 3
11899 && (name
== ansi_opname
[PLUS_EXPR
]
11900 || name
== ansi_opname
[MINUS_EXPR
]
11901 || name
== ansi_opname
[TRUNC_DIV_EXPR
]
11902 || name
== ansi_opname
[MULT_EXPR
])
11903 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
11904 cp_warning ("`%D' should return by value", decl
);
11908 for (; argtypes
!= void_list_node
; argtypes
= TREE_CHAIN (argtypes
))
11909 if (TREE_PURPOSE (argtypes
))
11911 TREE_PURPOSE (argtypes
) = NULL_TREE
;
11912 if (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11913 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11916 cp_pedwarn ("`%D' cannot have default arguments", decl
);
11919 cp_error ("`%D' cannot have default arguments", decl
);
11924 static const char *
11926 enum tag_types code
;
11939 my_friendly_abort (981122);
11943 /* Get the struct, enum or union (CODE says which) with tag NAME.
11944 Define the tag as a forward-reference if it is not defined.
11946 C++: If a class derivation is given, process it here, and report
11947 an error if multiple derivation declarations are not identical.
11949 If this is a definition, come in through xref_tag and only look in
11950 the current frame for the name (since C++ allows new names in any
11954 xref_tag (code_type_node
, name
, globalize
)
11955 tree code_type_node
;
11959 enum tag_types tag_code
;
11960 enum tree_code code
;
11962 register tree ref
, t
;
11963 struct binding_level
*b
= current_binding_level
;
11965 tree attributes
= NULL_TREE
;
11966 tree context
= NULL_TREE
;
11968 /* If we are called from the parser, code_type_node will sometimes be a
11969 TREE_LIST. This indicates that the user wrote
11970 "class __attribute__ ((foo)) bar". Extract the attributes so we can
11972 if (TREE_CODE (code_type_node
) == TREE_LIST
)
11974 attributes
= TREE_PURPOSE (code_type_node
);
11975 code_type_node
= TREE_VALUE (code_type_node
);
11978 tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
11983 code
= RECORD_TYPE
;
11989 code
= ENUMERAL_TYPE
;
11992 my_friendly_abort (18);
11995 /* If a cross reference is requested, look up the type
11996 already defined for this tag and return it. */
11997 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
12000 name
= TYPE_IDENTIFIER (t
);
12004 t
= IDENTIFIER_TYPE_VALUE (name
);
12006 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
12007 && TREE_CODE (t
) != TEMPLATE_TEMPLATE_PARM
)
12012 /* If we know we are defining this tag, only look it up in
12013 this scope and don't try to find it as a type. */
12014 ref
= lookup_tag (code
, name
, b
, 1);
12020 /* [dcl.type.elab] If the identifier resolves to a
12021 typedef-name or a template type-parameter, the
12022 elaborated-type-specifier is ill-formed. */
12023 if (t
!= TYPE_MAIN_VARIANT (t
)
12024 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
12025 cp_pedwarn ("using typedef-name `%D' after `%s'",
12026 TYPE_NAME (t
), tag_name (tag_code
));
12027 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12028 cp_error ("using template type parameter `%T' after `%s'",
12029 t
, tag_name (tag_code
));
12034 ref
= lookup_tag (code
, name
, b
, 0);
12038 /* Try finding it as a type declaration. If that wins,
12040 ref
= lookup_name (name
, 1);
12042 if (ref
!= NULL_TREE
12043 && processing_template_decl
12044 && DECL_CLASS_TEMPLATE_P (ref
)
12045 && template_class_depth (current_class_type
) == 0)
12046 /* Since GLOBALIZE is true, we're declaring a global
12047 template, so we want this type. */
12048 ref
= DECL_RESULT (ref
);
12050 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12051 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12052 ref
= TREE_TYPE (ref
);
12057 if (ref
&& current_class_type
12058 && template_class_depth (current_class_type
)
12059 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12061 /* Since GLOBALIZE is non-zero, we are not looking at a
12062 definition of this tag. Since, in addition, we are currently
12063 processing a (member) template declaration of a template
12064 class, we must be very careful; consider:
12071 { template <class V>
12072 friend struct S1; };
12074 Here, the S2::S1 declaration should not be confused with the
12075 outer declaration. In particular, the inner version should
12076 have a template parameter of level 2, not level 1. This
12077 would be particularly important if the member declaration
12080 template <class V = U> friend struct S1;
12082 say, when we should tsubst into `U' when instantiating
12083 S2. On the other hand, when presented with:
12093 we must find the inner binding eventually. We
12094 accomplish this by making sure that the new type we
12095 create to represent this declaration has the right
12097 context
= TYPE_CONTEXT (ref
);
12102 push_obstacks_nochange ();
12106 /* If no such tag is yet defined, create a forward-reference node
12107 and record it as the "definition".
12108 When a real declaration of this type is found,
12109 the forward-reference will be altered into a real type. */
12111 /* In C++, since these migrate into the global scope, we must
12112 build them on the permanent obstack. */
12114 temp
= allocation_temporary_p ();
12116 end_temporary_allocation ();
12118 if (code
== ENUMERAL_TYPE
)
12120 cp_error ("use of enum `%#D' without previous declaration", name
);
12122 ref
= make_node (ENUMERAL_TYPE
);
12124 /* Give the type a default layout like unsigned int
12125 to avoid crashing if it does not get defined. */
12126 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12127 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12128 TREE_UNSIGNED (ref
) = 1;
12129 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12130 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12131 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12133 /* Enable us to recognize when a type is created in class context.
12134 To do nested classes correctly, this should probably be cleared
12135 out when we leave this classes scope. Currently this in only
12136 done in `start_enum'. */
12138 pushtag (name
, ref
, globalize
);
12142 struct binding_level
*old_b
= class_binding_level
;
12144 ref
= make_lang_type (code
);
12145 TYPE_CONTEXT (ref
) = context
;
12147 #ifdef NONNESTED_CLASSES
12148 /* Class types don't nest the way enums do. */
12149 class_binding_level
= (struct binding_level
*)0;
12151 pushtag (name
, ref
, globalize
);
12152 class_binding_level
= old_b
;
12157 /* If it no longer looks like a nested type, make sure it's
12159 If it is not an IDENTIFIER, this is not a declaration */
12160 if (b
->namespace_p
&& !class_binding_level
12161 && TREE_CODE (name
) == IDENTIFIER_NODE
12162 && IDENTIFIER_NAMESPACE_VALUE (name
) == NULL_TREE
)
12163 SET_IDENTIFIER_NAMESPACE_VALUE (name
, TYPE_NAME (ref
));
12165 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12166 redeclare_class_template (ref
, current_template_parms
);
12169 /* Until the type is defined, tentatively accept whatever
12170 structure tag the user hands us. */
12171 if (TYPE_SIZE (ref
) == NULL_TREE
12172 && ref
!= current_class_type
12173 /* Have to check this, in case we have contradictory tag info. */
12174 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12176 if (tag_code
== class_type
)
12177 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12178 else if (tag_code
== record_type
)
12179 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12184 TREE_TYPE (ref
) = attributes
;
12190 xref_tag_from_type (old
, id
, globalize
)
12194 tree code_type_node
;
12196 if (TREE_CODE (old
) == RECORD_TYPE
)
12197 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12198 ? class_type_node
: record_type_node
);
12200 code_type_node
= union_type_node
;
12202 if (id
== NULL_TREE
)
12203 id
= TYPE_IDENTIFIER (old
);
12205 return xref_tag (code_type_node
, id
, globalize
);
12208 /* REF is a type (named NAME), for which we have just seen some
12209 baseclasses. BINFO is a list of those baseclasses; the
12210 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12211 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12212 struct, or union. */
12215 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12216 tree code_type_node
;
12220 /* In the declaration `A : X, Y, ... Z' we mark all the types
12221 (A, X, Y, ..., Z) so we can check for duplicates. */
12226 enum tag_types tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
12228 if (tag_code
== union_type
)
12230 cp_error ("derived union `%T' invalid", ref
);
12234 len
= list_length (binfo
);
12235 push_obstacks (TYPE_OBSTACK (ref
), TYPE_OBSTACK (ref
));
12237 /* First, make sure that any templates in base-classes are
12238 instantiated. This ensures that if we call ourselves recursively
12239 we do not get confused about which classes are marked and which
12241 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12242 complete_type (TREE_VALUE (base
));
12244 SET_CLASSTYPE_MARKED (ref
);
12245 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12247 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12249 /* The base of a derived struct is public by default. */
12251 = (TREE_PURPOSE (binfo
) == access_public_node
12252 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12253 || (tag_code
!= class_type
12254 && (TREE_PURPOSE (binfo
) == access_default_node
12255 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12257 = (TREE_PURPOSE (binfo
) == access_protected_node
12258 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12260 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12261 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12262 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12263 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12264 tree basetype
= TREE_VALUE (binfo
);
12267 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12268 basetype
= TREE_TYPE (basetype
);
12270 || (TREE_CODE (basetype
) != RECORD_TYPE
12271 && TREE_CODE (basetype
) != TYPENAME_TYPE
12272 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12273 && TREE_CODE (basetype
) != TEMPLATE_TEMPLATE_PARM
))
12275 cp_error ("base type `%T' fails to be a struct or class type",
12276 TREE_VALUE (binfo
));
12280 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12282 /* This code replaces similar code in layout_basetypes.
12283 We put the complete_type first for implicit `typename'. */
12284 if (TYPE_SIZE (basetype
) == NULL_TREE
12285 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12287 cp_error ("base class `%T' has incomplete type", basetype
);
12292 if (CLASSTYPE_MARKED (basetype
))
12294 if (basetype
== ref
)
12295 cp_error ("recursive type `%T' undefined", basetype
);
12297 cp_error ("duplicate base type `%T' invalid", basetype
);
12301 if (TYPE_FOR_JAVA (basetype
)
12302 && (current_lang_stack
12303 == &VARRAY_TREE (current_lang_base
, 0)))
12304 TYPE_FOR_JAVA (ref
) = 1;
12306 /* Note that the BINFO records which describe individual
12307 inheritances are *not* shared in the lattice! They
12308 cannot be shared because a given baseclass may be
12309 inherited with different `accessibility' by different
12310 derived classes. (Each BINFO record describing an
12311 individual inheritance contains flags which say what
12312 the `accessibility' of that particular inheritance is.) */
12315 = make_binfo (integer_zero_node
, basetype
,
12316 CLASS_TYPE_P (basetype
)
12317 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
12318 CLASS_TYPE_P (basetype
)
12319 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
12321 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
12322 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
12323 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
12324 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
12325 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
12327 /* We need to unshare the binfos now so that lookups during class
12328 definition work. */
12329 unshare_base_binfos (base_binfo
);
12331 SET_CLASSTYPE_MARKED (basetype
);
12333 /* We are free to modify these bits because they are meaningless
12334 at top level, and BASETYPE is a top-level type. */
12335 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
12337 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
12338 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12341 if (CLASS_TYPE_P (basetype
))
12343 TYPE_GETS_NEW (ref
) |= TYPE_GETS_NEW (basetype
);
12344 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
12351 TREE_VEC_LENGTH (binfos
) = i
;
12353 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
12356 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
12359 tree basetype
= BINFO_TYPE (TREE_VEC_ELT (binfos
, 0));
12361 if (CLASS_TYPE_P (basetype
))
12362 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
12363 = TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
12366 if (TYPE_USES_MULTIPLE_INHERITANCE (ref
))
12367 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12369 /* Unmark all the types. */
12371 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
12372 CLEAR_CLASSTYPE_MARKED (ref
);
12374 /* Now that we know all the base-classes, set up the list of virtual
12376 CLASSTYPE_VBASECLASSES (ref
) = get_vbase_types (ref
);
12382 /* Begin compiling the definition of an enumeration type.
12383 NAME is its name (or null if anonymous).
12384 Returns the type object, as yet incomplete.
12385 Also records info about it so that build_enumerator
12386 may be used to declare the individual values as they are read. */
12392 register tree enumtype
= NULL_TREE
;
12393 struct binding_level
*b
= current_binding_level
;
12395 /* We are wasting space here and putting these on the permanent_obstack so
12396 that typeid(local enum) will work correctly. */
12397 push_obstacks (&permanent_obstack
, &permanent_obstack
);
12399 /* If this is the real definition for a previous forward reference,
12400 fill in the contents in the same object that used to be the
12401 forward reference. */
12403 if (name
!= NULL_TREE
)
12404 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
12406 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
12408 cp_error ("multiple definition of `%#T'", enumtype
);
12409 cp_error_at ("previous definition here", enumtype
);
12413 enumtype
= make_node (ENUMERAL_TYPE
);
12414 pushtag (name
, enumtype
, 0);
12417 if (current_class_type
)
12418 TREE_ADDRESSABLE (b
->tags
) = 1;
12420 /* We don't copy this value because build_enumerator needs to do it. */
12421 enum_next_value
= integer_zero_node
;
12424 GNU_xref_decl (current_function_decl
, enumtype
);
12428 /* After processing and defining all the values of an enumeration type,
12429 install their decls in the enumeration type and finish it off.
12430 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12431 Returns ENUMTYPE. */
12434 finish_enum (enumtype
)
12437 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
12438 /* Calculate the maximum value of any enumerator in this type. */
12440 tree values
= TYPE_VALUES (enumtype
);
12445 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
12450 /* The TREE_VALUE is a CONST_DECL for this enumeration
12452 decl
= TREE_VALUE (pair
);
12454 /* The DECL_INITIAL will be NULL if we are processing a
12455 template declaration and this enumeration constant had no
12456 explicit initializer. */
12457 value
= DECL_INITIAL (decl
);
12458 if (value
&& !processing_template_decl
)
12460 /* Set the TREE_TYPE for the VALUE as well. That's so
12461 that when we call decl_constant_value we get an
12462 entity of the right type (but with the constant
12463 value). Since we shouldn't ever call
12464 decl_constant_value on a template type, there's no
12465 reason to do that when processing_template_decl.
12466 And, if the expression is something like a
12467 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12468 wreak havoc on the intended type of the expression.
12470 Of course, there's also no point in trying to compute
12471 minimum or maximum values if we're in a template. */
12472 TREE_TYPE (value
) = enumtype
;
12475 minnode
= maxnode
= value
;
12476 else if (tree_int_cst_lt (maxnode
, value
))
12478 else if (tree_int_cst_lt (value
, minnode
))
12482 if (processing_template_decl
)
12483 /* If this is just a template, leave the CONST_DECL
12484 alone. That way tsubst_copy will find CONST_DECLs for
12485 CONST_DECLs, and not INTEGER_CSTs. */
12488 /* In the list we're building up, we want the enumeration
12489 values, not the CONST_DECLs. */
12490 TREE_VALUE (pair
) = value
;
12494 maxnode
= minnode
= integer_zero_node
;
12496 TYPE_VALUES (enumtype
) = nreverse (values
);
12498 if (processing_template_decl
)
12500 tree scope
= current_scope ();
12501 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
12502 add_tree (build_min (TAG_DEFN
, enumtype
));
12506 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
12507 int lowprec
= min_precision (minnode
, unsignedp
);
12508 int highprec
= min_precision (maxnode
, unsignedp
);
12509 int precision
= MAX (lowprec
, highprec
);
12512 TYPE_SIZE (enumtype
) = NULL_TREE
;
12514 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
12516 TYPE_PRECISION (enumtype
) = precision
;
12518 fixup_unsigned_type (enumtype
);
12520 fixup_signed_type (enumtype
);
12522 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
12523 /* Use the width of the narrowest normal C type which is wide
12525 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
12528 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
12530 TYPE_SIZE (enumtype
) = 0;
12531 layout_type (enumtype
);
12533 /* Fix up all variant types of this enum type. */
12534 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
12535 tem
= TYPE_NEXT_VARIANT (tem
))
12537 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
12538 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
12539 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
12540 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
12541 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
12542 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
12543 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
12544 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
12545 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
12548 /* Finish debugging output for this type. */
12549 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
12552 /* In start_enum we pushed obstacks. Here, we must pop them. */
12558 /* Build and install a CONST_DECL for an enumeration constant of the
12559 enumeration type TYPE whose NAME and VALUE (if any) are provided.
12560 Assignment of sequential values by default is handled here. */
12563 build_enumerator (name
, value
, type
)
12571 /* Remove no-op casts from the value. */
12573 STRIP_TYPE_NOPS (value
);
12575 if (! processing_template_decl
)
12577 /* Validate and default VALUE. */
12578 if (value
!= NULL_TREE
)
12580 if (TREE_READONLY_DECL_P (value
))
12581 value
= decl_constant_value (value
);
12583 if (TREE_CODE (value
) == INTEGER_CST
)
12585 value
= default_conversion (value
);
12586 constant_expression_warning (value
);
12590 cp_error ("enumerator value for `%D' not integer constant", name
);
12595 /* Default based on previous value. */
12596 if (value
== NULL_TREE
&& ! processing_template_decl
)
12598 value
= enum_next_value
;
12600 cp_error ("overflow in enumeration values at `%D'", name
);
12603 /* Remove no-op casts from the value. */
12605 STRIP_TYPE_NOPS (value
);
12607 /* To fix MAX_VAL enum consts. (bkoz) */
12608 TREE_TYPE (value
) = integer_type_node
;
12612 /* We always have to copy here; not all INTEGER_CSTs are unshared.
12613 Even in other cases, we will later (in finish_enum) be setting the
12615 if (value
!= NULL_TREE
)
12616 value
= copy_node (value
);
12618 /* C++ associates enums with global, function, or class declarations. */
12620 context
= current_scope ();
12621 if (context
&& context
== current_class_type
)
12622 /* This enum declaration is local to the class. */
12623 decl
= build_lang_decl (CONST_DECL
, name
, type
);
12625 /* It's a global enum, or it's local to a function. (Note local to
12626 a function could mean local to a class method. */
12627 decl
= build_decl (CONST_DECL
, name
, type
);
12629 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
12630 DECL_INITIAL (decl
) = value
;
12631 TREE_READONLY (decl
) = 1;
12633 if (context
&& context
== current_class_type
)
12634 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
12635 on the TYPE_FIELDS list for `S'. (That's so that you can say
12636 things like `S::i' later.) */
12637 finish_member_declaration (decl
);
12641 GNU_xref_decl (current_function_decl
, decl
);
12644 if (! processing_template_decl
)
12646 /* Set basis for default for next value. */
12647 enum_next_value
= build_binary_op_nodefault (PLUS_EXPR
, value
,
12648 integer_one_node
, PLUS_EXPR
);
12649 enum_overflow
= tree_int_cst_lt (enum_next_value
, value
);
12652 result
= tree_cons (name
, decl
, NULL_TREE
);
12657 static int function_depth
;
12659 /* We're defining DECL. Make sure that it's type is OK. */
12662 check_function_type (decl
)
12665 tree fntype
= TREE_TYPE (decl
);
12667 /* In a function definition, arg types must be complete. */
12668 require_complete_types_for_parms (current_function_parms
);
12670 if (TYPE_SIZE (complete_type (TREE_TYPE (fntype
))) == NULL_TREE
)
12672 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
12674 /* Make it return void instead, but don't change the
12675 type of the DECL_RESULT, in case we have a named return value. */
12676 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12678 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
12680 = build_cplus_method_type (ctype
,
12682 FUNCTION_ARG_CHAIN (decl
));
12686 = build_function_type (void_type_node
,
12687 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
12689 = build_exception_variant (fntype
,
12690 TYPE_RAISES_EXCEPTIONS (fntype
));
12693 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
12696 /* Create the FUNCTION_DECL for a function definition.
12697 DECLSPECS and DECLARATOR are the parts of the declaration;
12698 they describe the function's name and the type it returns,
12699 but twisted together in a fashion that parallels the syntax of C.
12701 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
12702 DECLARATOR is really the DECL for the function we are about to
12703 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
12704 indicating that the function is an inline defined in-class, and
12705 SF_EXPAND indicating that we should generate RTL for this
12708 This function creates a binding context for the function body
12709 as well as setting up the FUNCTION_DECL in current_function_decl.
12711 Returns 1 on success. If the DECLARATOR is not suitable for a function
12712 (it defines a datum instead), we return 0, which tells
12713 yyparse to report a parse error.
12715 For C++, we must first check whether that datum makes any sense.
12716 For example, "class A local_a(1,2);" means that variable local_a
12717 is an aggregate of type A, which should have a constructor
12718 applied to it with the argument list [1, 2]. */
12721 start_function (declspecs
, declarator
, attrs
, flags
)
12722 tree declspecs
, declarator
, attrs
;
12726 tree ctype
= NULL_TREE
;
12729 extern int have_extern_spec
;
12730 extern int used_extern_spec
;
12731 int doing_friend
= 0;
12732 struct binding_level
*bl
;
12734 /* Sanity check. */
12735 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
12736 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
12738 /* This should only be done once on the top most decl. */
12739 if (have_extern_spec
&& !used_extern_spec
)
12741 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
12742 used_extern_spec
= 1;
12745 if (flags
& SF_PRE_PARSED
)
12747 decl1
= declarator
;
12749 fntype
= TREE_TYPE (decl1
);
12750 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12751 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12753 /* ANSI C++ June 5 1992 WP 11.4.5. A friend function defined in a
12754 class is in the (lexical) scope of the class in which it is
12756 if (!ctype
&& DECL_FRIEND_P (decl1
))
12758 ctype
= DECL_CLASS_CONTEXT (decl1
);
12760 /* CTYPE could be null here if we're dealing with a template;
12761 for example, `inline friend float foo()' inside a template
12762 will have no CTYPE set. */
12763 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
12769 last_function_parms
= DECL_ARGUMENTS (decl1
);
12770 last_function_parm_tags
= NULL_TREE
;
12774 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
12775 /* If the declarator is not suitable for a function definition,
12776 cause a syntax error. */
12777 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
12779 fntype
= TREE_TYPE (decl1
);
12781 restype
= TREE_TYPE (fntype
);
12782 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
12784 cp_error ("semicolon missing after declaration of `%#T'", restype
);
12785 shadow_tag (build_expr_list (NULL_TREE
, restype
));
12786 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
12787 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
12788 fntype
= build_function_type (integer_type_node
,
12789 TYPE_ARG_TYPES (fntype
));
12791 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
12793 TYPE_ARG_TYPES (fntype
));
12794 TREE_TYPE (decl1
) = fntype
;
12797 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12798 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12799 else if (DECL_MAIN_P (decl1
))
12801 /* If this doesn't return integer_type, complain. */
12802 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
12804 if (pedantic
|| warn_return_type
)
12805 pedwarn ("return type for `main' changed to `int'");
12806 TREE_TYPE (decl1
) = fntype
= default_function_type
;
12811 /* Sometimes we don't notice that a function is a static member, and
12812 build a METHOD_TYPE for it. Fix that up now. */
12813 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
)
12814 && TREE_CODE (TREE_TYPE (decl1
)) == METHOD_TYPE
)
12816 revert_static_member_fn (&decl1
, NULL
, NULL
);
12817 last_function_parms
= TREE_CHAIN (last_function_parms
);
12821 /* Warn if function was previously implicitly declared
12822 (but not if we warned then). */
12823 if (! warn_implicit
12824 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
12825 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
12827 /* Set up current_class_type, and enter the scope of the class, if
12830 push_nested_class (ctype
, 1);
12831 else if (DECL_STATIC_FUNCTION_P (decl1
))
12832 push_nested_class (DECL_CONTEXT (decl1
), 2);
12834 /* Now that we have entered the scope of the class, we must restore
12835 the bindings for any template parameters surrounding DECL1, if it
12836 is an inline member template. (Order is important; consider the
12837 case where a template parameter has the same name as a field of
12838 the class.) It is not until after this point that
12839 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
12840 if (flags
& SF_INCLASS_INLINE
)
12841 maybe_begin_member_template_processing (decl1
);
12843 /* Effective C++ rule 15. See also c_expand_return. */
12845 && DECL_NAME (decl1
) == ansi_opname
[(int) MODIFY_EXPR
]
12846 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
12847 cp_warning ("`operator=' should return a reference to `*this'");
12849 /* Make the init_value nonzero so pushdecl knows this is not tentative.
12850 error_mark_node is replaced below (in poplevel) with the BLOCK. */
12851 if (!DECL_INITIAL (decl1
))
12852 DECL_INITIAL (decl1
) = error_mark_node
;
12854 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
12855 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
12858 /* This function exists in static storage.
12859 (This does not mean `static' in the C sense!) */
12860 TREE_STATIC (decl1
) = 1;
12862 /* We must call push_template_decl after current_class_type is set
12863 up. (If we are processing inline definitions after exiting a
12864 class scope, current_class_type will be NULL_TREE until set above
12865 by push_nested_class.) */
12866 if (processing_template_decl
)
12867 decl1
= push_template_decl (decl1
);
12869 /* We are now in the scope of the function being defined. */
12870 current_function_decl
= decl1
;
12872 /* Save the parm names or decls from this function's declarator
12873 where store_parm_decls will find them. */
12874 current_function_parms
= last_function_parms
;
12875 current_function_parm_tags
= last_function_parm_tags
;
12877 /* Make sure the parameter and return types are reasonable. When
12878 you declare a function, these types can be incomplete, but they
12879 must be complete when you define the function. */
12880 if (! processing_template_decl
)
12881 check_function_type (decl1
);
12883 /* Build the return declaration for the function. */
12884 restype
= TREE_TYPE (fntype
);
12885 if (!processing_template_decl
)
12887 if (!DECL_RESULT (decl1
))
12889 DECL_RESULT (decl1
)
12890 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
12891 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype
),
12892 DECL_RESULT (decl1
));
12896 /* Just use `void'. Nobody will ever look at this anyhow. */
12897 DECL_RESULT (decl1
) = build_decl (RESULT_DECL
, 0, void_type_node
);
12899 /* Initialize RTL machinery. We cannot do this until
12900 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
12901 even when processing a template; this is how we get
12902 CURRENT_FUNCTION set up, and our per-function variables
12904 bl
= current_binding_level
;
12905 init_function_start (decl1
, input_filename
, lineno
);
12906 current_binding_level
= bl
;
12907 expanding_p
= (flags
& SF_EXPAND
) != 0;
12909 /* Even though we're inside a function body, we still don't want to
12910 call expand_expr to calculate the size of a variable-sized array.
12911 We haven't necessarily assigned RTL to all variables yet, so it's
12912 not safe to try to expand expressions involving them. */
12913 immediate_size_expand
= 0;
12914 get_pending_sizes ();
12916 /* Let the user know we're compiling this function. */
12917 if (processing_template_decl
|| !building_stmt_tree ())
12918 announce_function (decl1
);
12920 /* Record the decl so that the function name is defined.
12921 If we already have a decl for this name, and it is a FUNCTION_DECL,
12922 use the old decl. */
12923 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
12925 /* A specialization is not used to guide overload resolution. */
12926 if ((flag_guiding_decls
12927 || !DECL_TEMPLATE_SPECIALIZATION (decl1
))
12928 && ! DECL_FUNCTION_MEMBER_P (decl1
))
12929 decl1
= pushdecl (decl1
);
12932 /* We need to set the DECL_CONTEXT. */
12933 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
12934 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
12935 /* And make sure we have enough default args. */
12936 check_default_args (decl1
);
12938 DECL_MAIN_VARIANT (decl1
) = decl1
;
12939 fntype
= TREE_TYPE (decl1
);
12942 /* Reset these in case the call to pushdecl changed them. */
12943 current_function_decl
= decl1
;
12944 current_function
->decl
= decl1
;
12946 /* Initialize the per-function data. */
12947 if (!DECL_PENDING_INLINE_P (decl1
) && DECL_SAVED_FUNCTION_DATA (decl1
))
12949 /* If we already parsed this function, and we're just expanding it
12950 now, restore saved state. */
12951 struct binding_level
*bl
= current_binding_level
;
12952 *cp_function_chain
= *DECL_SAVED_FUNCTION_DATA (decl1
);
12953 current_binding_level
= bl
;
12955 /* This function is being processed in whole-function mode; we
12956 already did semantic analysis. */
12957 current_function
->x_whole_function_mode_p
= 1;
12959 /* If we decided that we didn't want to inline this function,
12960 make sure the back-end knows that. */
12961 if (!current_function_cannot_inline
)
12962 current_function_cannot_inline
= cp_function_chain
->cannot_inline
;
12964 /* We don't need the saved data anymore. */
12965 free (DECL_SAVED_FUNCTION_DATA (decl1
));
12966 DECL_SAVED_FUNCTION_DATA (decl1
) = NULL
;
12968 else if (ctype
&& !doing_friend
&& !DECL_STATIC_FUNCTION_P (decl1
))
12970 /* We know that this was set up by `grokclassfn'. We do not
12971 wait until `store_parm_decls', since evil parse errors may
12972 never get us to that point. Here we keep the consistency
12973 between `current_class_type' and `current_class_ptr'. */
12974 tree t
= DECL_ARGUMENTS (decl1
);
12976 my_friendly_assert (t
!= NULL_TREE
&& TREE_CODE (t
) == PARM_DECL
,
12978 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
12981 cp_function_chain
->x_current_class_ref
12982 = build_indirect_ref (t
, NULL_PTR
);
12983 cp_function_chain
->x_current_class_ptr
= t
;
12985 if (DECL_DESTRUCTOR_P (decl1
))
12986 current_in_charge_parm
= TREE_CHAIN (t
);
12989 if (DECL_INTERFACE_KNOWN (decl1
))
12991 tree ctx
= hack_decl_function_context (decl1
);
12993 if (DECL_NOT_REALLY_EXTERN (decl1
))
12994 DECL_EXTERNAL (decl1
) = 0;
12996 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
12997 && TREE_PUBLIC (ctx
))
12998 /* This is a function in a local class in an extern inline
13000 comdat_linkage (decl1
);
13002 /* If this function belongs to an interface, it is public.
13003 If it belongs to someone else's interface, it is also external.
13004 This only affects inlines and template instantiations. */
13005 else if (interface_unknown
== 0
13006 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13007 || flag_alt_external_templates
))
13009 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
13010 || processing_template_decl
)
13012 DECL_EXTERNAL (decl1
)
13014 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
13015 && !DECL_VINDEX (decl1
)));
13017 /* For WIN32 we also want to put these in linkonce sections. */
13018 maybe_make_one_only (decl1
);
13021 DECL_EXTERNAL (decl1
) = 0;
13022 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
13023 DECL_INTERFACE_KNOWN (decl1
) = 1;
13025 else if (interface_unknown
&& interface_only
13026 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13027 || flag_alt_external_templates
))
13029 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13030 interface, we will have interface_only set but not
13031 interface_known. In that case, we don't want to use the normal
13032 heuristics because someone will supply a #pragma implementation
13033 elsewhere, and deducing it here would produce a conflict. */
13034 comdat_linkage (decl1
);
13035 DECL_EXTERNAL (decl1
) = 0;
13036 DECL_INTERFACE_KNOWN (decl1
) = 1;
13037 DECL_DEFER_OUTPUT (decl1
) = 1;
13041 /* This is a definition, not a reference.
13042 So clear DECL_EXTERNAL. */
13043 DECL_EXTERNAL (decl1
) = 0;
13045 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
13046 && ! DECL_INTERFACE_KNOWN (decl1
)
13047 /* Don't try to defer nested functions for now. */
13048 && ! hack_decl_function_context (decl1
))
13049 DECL_DEFER_OUTPUT (decl1
) = 1;
13051 DECL_INTERFACE_KNOWN (decl1
) = 1;
13054 if (doing_semantic_analysis_p ())
13057 current_binding_level
->parm_flag
= 1;
13061 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13063 if (!building_stmt_tree ())
13065 GNU_xref_function (decl1
, current_function_parms
);
13066 make_function_rtl (decl1
);
13069 /* Promote the value to int before returning it. */
13070 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13071 restype
= type_promotes_to (restype
);
13073 /* If this fcn was already referenced via a block-scope `extern' decl
13074 (or an implicit decl), propagate certain information about the usage. */
13075 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13076 TREE_ADDRESSABLE (decl1
) = 1;
13078 if (DECL_RESULT (decl1
) == NULL_TREE
)
13080 DECL_RESULT (decl1
)
13081 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13082 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13083 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13086 /* Allocate further tree nodes temporarily during compilation
13087 of this function only. Tiemann moved up here from bottom of fn. */
13088 /* If this is a nested function, then we must continue to allocate RTL
13089 on the permanent obstack in case we need to inline it later. */
13090 if (! hack_decl_function_context (decl1
))
13091 temporary_allocation ();
13093 /* Make sure that we always have a momntary obstack while we're in a
13097 if (building_stmt_tree ())
13098 begin_stmt_tree (decl1
);
13102 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl1
))
13103 && DECL_LANGUAGE (decl1
) == lang_cplusplus
)
13104 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13105 else if (DECL_CONSTRUCTOR_P (decl1
))
13106 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13111 /* Called after store_parm_decls for a function-try-block. We need to update
13112 last_parm_cleanup_insn so that the base initializers for a constructor
13113 are run within this block, not before it. */
13116 expand_start_early_try_stmts ()
13118 expand_start_try_stmts ();
13119 last_parm_cleanup_insn
= get_last_insn ();
13122 /* Store the parameter declarations into the current function declaration.
13123 This is called after parsing the parameter declarations, before
13124 digesting the body of the function.
13126 Also install to binding contour return value identifier, if any. */
13129 store_parm_decls ()
13131 register tree fndecl
= current_function_decl
;
13132 register tree parm
;
13133 int parms_have_cleanups
= 0;
13134 tree cleanups
= NULL_TREE
;
13136 /* This is a list of types declared among parms in a prototype. */
13137 tree parmtags
= current_function_parm_tags
;
13139 /* This is a chain of any other decls that came in among the parm
13140 declarations. If a parm is declared with enum {foo, bar} x;
13141 then CONST_DECLs for foo and bar are put here. */
13142 tree nonparms
= NULL_TREE
;
13144 /* Create a binding level for the parms. */
13145 if (!building_stmt_tree ())
13146 expand_start_bindings (2);
13148 if (current_function_parms
)
13150 /* This case is when the function was defined with an ANSI prototype.
13151 The parms already have decls, so we need not do anything here
13152 except record them as in effect
13153 and complain if any redundant old-style parm decls were written. */
13155 tree specparms
= current_function_parms
;
13158 if (doing_semantic_analysis_p ())
13160 /* Must clear this because it might contain TYPE_DECLs declared
13162 storedecls (NULL_TREE
);
13164 /* If we're doing semantic analysis, then we'll call pushdecl
13165 for each of these. We must do them in reverse order so that
13166 they end in the correct forward order. */
13167 specparms
= nreverse (specparms
);
13170 for (parm
= specparms
; parm
; parm
= next
)
13172 next
= TREE_CHAIN (parm
);
13173 if (TREE_CODE (parm
) == PARM_DECL
)
13177 if (doing_semantic_analysis_p ())
13179 if (DECL_NAME (parm
) == NULL_TREE
13180 || TREE_CODE (TREE_TYPE (parm
)) != VOID_TYPE
)
13183 cp_error ("parameter `%D' declared void", parm
);
13186 if (! building_stmt_tree ()
13187 && (cleanup
= maybe_build_cleanup (parm
), cleanup
))
13189 expand_decl (parm
);
13190 parms_have_cleanups
= 1;
13192 /* Keep track of the cleanups. */
13193 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13198 /* If we find an enum constant or a type tag,
13199 put it aside for the moment. */
13200 TREE_CHAIN (parm
) = NULL_TREE
;
13201 nonparms
= chainon (nonparms
, parm
);
13205 if (doing_semantic_analysis_p ())
13207 /* Get the decls in their original chain order
13208 and record in the function. This is all and only the
13209 PARM_DECLs that were pushed into scope by the loop above. */
13210 DECL_ARGUMENTS (fndecl
) = getdecls ();
13211 storetags (chainon (parmtags
, gettags ()));
13213 /* We built up the cleanups in reversed order. */
13214 cleanups
= nreverse (cleanups
);
13218 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13220 /* Now store the final chain of decls for the arguments
13221 as the decl-chain of the current lexical scope.
13222 Put the enumerators in as well, at the front so that
13223 DECL_ARGUMENTS is not modified. */
13224 if (doing_semantic_analysis_p ())
13225 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13227 /* Initialize the RTL code for the function. */
13228 DECL_SAVED_INSNS (fndecl
) = 0;
13229 if (! building_stmt_tree ())
13230 expand_function_start (fndecl
, parms_have_cleanups
);
13232 current_function_parms_stored
= 1;
13234 /* If this function is `main', emit a call to `__main'
13235 to run global initializers, etc. */
13236 if (DECL_MAIN_P (fndecl
) && !building_stmt_tree ())
13237 expand_main_function ();
13239 /* Now that we have initialized the parms, we can start their
13240 cleanups. We cannot do this before, since expand_decl_cleanup
13241 should not be called before the parm can be used. */
13242 if (cleanups
&& !building_stmt_tree ())
13245 if (! expand_decl_cleanup (TREE_PURPOSE (cleanups
),
13246 TREE_VALUE (cleanups
)))
13247 cp_error ("parser lost in parsing declaration of `%D'",
13248 TREE_PURPOSE (cleanups
));
13250 cleanups
= TREE_CHAIN (cleanups
);
13253 /* Create a binding contour which can be used to catch
13254 cleanup-generated temporaries. Also, if the return value needs or
13255 has initialization, deal with that now. */
13256 if (parms_have_cleanups
)
13259 if (!building_stmt_tree ())
13260 expand_start_bindings (2);
13263 /* Do the starting of the exception specifications, if we have any. */
13264 if (flag_exceptions
&& !processing_template_decl
13265 && building_stmt_tree ()
13266 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13267 current_eh_spec_try_block
= expand_start_eh_spec ();
13269 last_parm_cleanup_insn
= get_last_insn ();
13270 last_dtor_insn
= get_last_insn ();
13273 /* Bind a name and initialization to the return value of
13274 the current function. */
13277 store_return_init (decl
)
13280 /* If this named return value comes in a register, put it in a
13281 pseudo-register. */
13282 if (DECL_REGISTER (decl
))
13284 original_result_rtx
= DECL_RTL (decl
);
13285 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
13290 /* We have finished doing semantic analysis on DECL, but have not yet
13291 generated RTL for its body. Save away our current state, so that
13292 when we want to generate RTL later we know what to do. */
13295 save_function_data (decl
)
13298 struct language_function
*f
;
13300 /* Save the language-specific per-function data so that we can
13301 get it back when we really expand this function. */
13302 my_friendly_assert (!DECL_PENDING_INLINE_P (decl
),
13306 f
= ((struct language_function
*)
13307 xmalloc (sizeof (struct language_function
)));
13308 bcopy ((char *) cp_function_chain
, (char *) f
,
13309 sizeof (struct language_function
));
13310 DECL_SAVED_FUNCTION_DATA (decl
) = f
;
13312 /* Clear out the bits we don't need. */
13313 f
->x_base_init_list
= NULL_TREE
;
13314 f
->x_member_init_list
= NULL_TREE
;
13315 f
->x_last_tree
= NULL_TREE
;
13316 f
->x_last_expr_type
= NULL_TREE
;
13317 f
->x_last_dtor_insn
= NULL_RTX
;
13318 f
->x_last_parm_cleanup_insn
= NULL_RTX
;
13319 f
->x_result_rtx
= NULL_RTX
;
13320 f
->x_named_label_uses
= NULL
;
13321 f
->bindings
= NULL
;
13323 /* When we get back here again, we will be expanding. */
13324 f
->x_expanding_p
= 1;
13326 /* If we've already decided that we cannot inline this function, we
13327 must remember that fact when we actually go to expand the
13329 f
->cannot_inline
= current_function_cannot_inline
;
13332 /* At the end of every destructor we generate code to restore virtual
13333 function tables to the values desired by base classes and to call
13334 to base class destructors. Do that now, for DECL. */
13337 finish_destructor_body ()
13339 tree compound_stmt
;
13344 /* Create a block to contain all the extra code. */
13345 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
13347 /* Generate the code to call destructor on base class. If this
13348 destructor belongs to a class with virtual functions, then set
13349 the virtual function table pointer to represent the type of our
13352 /* This side-effect makes call to `build_delete' generate the code
13353 we have to have at the end of this destructor. `build_delete'
13354 will set the flag again. */
13355 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
13357 /* These are two cases where we cannot delegate deletion. */
13358 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)
13359 || TYPE_GETS_REG_DELETE (current_class_type
))
13360 in_charge
= integer_zero_node
;
13362 in_charge
= current_in_charge_parm
;
13364 exprstmt
= build_delete (current_class_type
,
13367 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
,
13370 if (exprstmt
!= error_mark_node
13371 && (TREE_CODE (exprstmt
) != NOP_EXPR
13372 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
13373 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
13375 add_tree (build_min_nt (LABEL_STMT
, dtor_label
));
13376 if (exprstmt
!= void_zero_node
)
13377 /* Don't call `expand_expr_stmt' if we're not going to do
13378 anything, since -Wall will give a diagnostic. */
13379 finish_expr_stmt (exprstmt
);
13381 /* Run destructor on all virtual baseclasses. */
13382 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13384 tree vbases
= nreverse (copy_list (CLASSTYPE_VBASECLASSES (current_class_type
)));
13385 tree if_stmt
= begin_if_stmt ();
13386 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13387 current_in_charge_parm
,
13393 if (TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (vbases
)))
13395 tree vb
= get_vbase
13396 (BINFO_TYPE (vbases
),
13397 TYPE_BINFO (current_class_type
));
13399 (build_scoped_method_call
13400 (current_class_ref
, vb
, dtor_identifier
,
13401 build_expr_list (NULL_TREE
, integer_zero_node
)));
13403 vbases
= TREE_CHAIN (vbases
);
13406 finish_then_clause (if_stmt
);
13411 virtual_size
= c_sizeof (current_class_type
);
13413 /* At the end, call delete if that's what's requested. */
13415 /* FDIS sez: At the point of definition of a virtual destructor
13416 (including an implicit definition), non-placement operator delete
13417 shall be looked up in the scope of the destructor's class and if
13418 found shall be accessible and unambiguous.
13420 This is somewhat unclear, but I take it to mean that if the class
13421 only defines placement deletes we don't do anything here. So we
13422 pass LOOKUP_SPECULATIVELY; delete_sanity will complain for us if
13423 they ever try to delete one of these. */
13424 if (TYPE_GETS_REG_DELETE (current_class_type
)
13425 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13429 exprstmt
= build_op_delete_call
13430 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
13431 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
13433 if_stmt
= begin_if_stmt ();
13434 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13435 current_in_charge_parm
,
13438 finish_expr_stmt (exprstmt
);
13439 finish_then_clause (if_stmt
);
13443 /* Close the block we started above. */
13444 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
13447 /* Finish up a function declaration and compile that function
13448 all the way to assembler language output. The free the storage
13449 for the function definition.
13451 This is called after parsing the body of the function definition.
13452 LINENO is the current line number.
13454 FLAGS is a bitwise or of the following values:
13456 An extra call to poplevel (and expand_end_bindings) must be
13457 made to take care of the binding contour for the base
13458 initializers. This is only relevant for constructors.
13460 We just finished processing the body of an in-class inline
13461 function definition. (This processing will have taken place
13462 after the class definition is complete.) */
13465 finish_function (lineno
, flags
)
13469 register tree fndecl
= current_function_decl
;
13470 tree fntype
, ctype
= NULL_TREE
;
13471 /* Label to use if this function is supposed to return a value. */
13472 tree no_return_label
= NULL_TREE
;
13473 int call_poplevel
= (flags
& 1) != 0;
13474 int inclass_inline
= (flags
& 2) != 0;
13478 /* When we get some parse errors, we can end up without a
13479 current_function_decl, so cope. */
13480 if (fndecl
== NULL_TREE
)
13481 return error_mark_node
;
13483 nested
= function_depth
> 1;
13484 fntype
= TREE_TYPE (fndecl
);
13486 /* TREE_READONLY (fndecl) = 1;
13487 This caused &foo to be of type ptr-to-const-function
13488 which then got a warning when stored in a ptr-to-function variable. */
13490 /* This happens on strange parse errors. */
13491 if (! current_function_parms_stored
)
13494 store_parm_decls ();
13497 if (building_stmt_tree ())
13499 if (DECL_CONSTRUCTOR_P (fndecl
) && call_poplevel
)
13501 else if (DECL_DESTRUCTOR_P (fndecl
) && !processing_template_decl
)
13502 finish_destructor_body ();
13504 /* Finish dealing with exception specifiers. */
13505 if (flag_exceptions
&& !processing_template_decl
13506 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13507 expand_end_eh_spec (TYPE_RAISES_EXCEPTIONS
13508 (TREE_TYPE (current_function_decl
)),
13509 current_eh_spec_try_block
);
13513 if (write_symbols
!= NO_DEBUG
/*&& TREE_CODE (fntype) != METHOD_TYPE*/)
13515 tree ttype
= target_type (fntype
);
13518 if (IS_AGGR_TYPE (ttype
))
13519 /* Let debugger know it should output info for this type. */
13520 note_debug_info_needed (ttype
);
13522 for (parmdecl
= DECL_ARGUMENTS (fndecl
); parmdecl
; parmdecl
= TREE_CHAIN (parmdecl
))
13524 ttype
= target_type (TREE_TYPE (parmdecl
));
13525 if (IS_AGGR_TYPE (ttype
))
13526 /* Let debugger know it should output info for this type. */
13527 note_debug_info_needed (ttype
);
13531 /* Clean house because we will need to reorder insns here. */
13532 do_pending_stack_adjust ();
13536 else if (DECL_CONSTRUCTOR_P (fndecl
))
13538 /* This is where the body of the constructor begins. All
13539 subobjects have been fully constructed at this point. */
13540 end_protect_partials ();
13542 /* This is where the body of the constructor ends. */
13543 expand_label (ctor_label
);
13544 ctor_label
= NULL_TREE
;
13549 /* c_expand_return knows to return 'this' from a constructor. */
13550 c_expand_return (NULL_TREE
);
13552 else if (DECL_MAIN_P (fndecl
))
13554 /* Make it so that `main' always returns 0 by default. */
13556 c_expand_return (integer_one_node
);
13558 c_expand_return (integer_zero_node
);
13561 else if (return_label
!= NULL_RTX
13562 && flag_this_is_variable
<= 0
13563 && current_function_return_value
== NULL_TREE
13564 && ! DECL_NAME (DECL_RESULT (current_function_decl
)))
13565 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13567 if (flag_exceptions
)
13568 expand_exception_blocks ();
13570 /* If this function is supposed to return a value, ensure that
13571 we do not fall into the cleanups by mistake. The end of our
13572 function will look like this:
13574 user code (may have return stmt somewhere)
13575 goto no_return_label
13580 NOTE_INSN_FUNCTION_END
13584 If the user omits a return stmt in the USER CODE section, we
13585 will have a control path which reaches NOTE_INSN_FUNCTION_END.
13586 Otherwise, we won't. */
13587 if (no_return_label
)
13589 DECL_CONTEXT (no_return_label
) = fndecl
;
13590 DECL_INITIAL (no_return_label
) = error_mark_node
;
13591 DECL_SOURCE_FILE (no_return_label
) = input_filename
;
13592 DECL_SOURCE_LINE (no_return_label
) = lineno
;
13593 expand_goto (no_return_label
);
13598 /* Remove the binding contour which is used
13599 to catch cleanup-generated temporaries. */
13600 expand_end_bindings (0, 0, 0);
13601 poplevel (0, 0, 0);
13603 /* Emit label at beginning of cleanup code for parameters. */
13604 emit_label (cleanup_label
);
13607 /* Get return value into register if that's where it's supposed
13609 if (original_result_rtx
)
13610 fixup_result_decl (DECL_RESULT (fndecl
), original_result_rtx
);
13612 /* Finish building code that will trigger warnings if users forget
13613 to make their functions return values. */
13614 if (no_return_label
|| cleanup_label
)
13615 emit_jump (return_label
);
13616 if (no_return_label
)
13618 /* We don't need to call `expand_*_return' here because we
13619 don't need any cleanups here--this path of code is only
13620 for error checking purposes. */
13621 expand_label (no_return_label
);
13624 /* We hard-wired immediate_size_expand to zero in
13625 start_function. Expand_function_end will decrement this
13626 variable. So, we set the variable to one here, so that after
13627 the decrement it will remain zero. */
13628 immediate_size_expand
= 1;
13630 /* Generate rtl for function exit. */
13631 expand_function_end (input_filename
, lineno
, 1);
13634 /* We have to save this value here in case
13635 maybe_end_member_template_processing decides to pop all the
13636 template parameters. */
13637 expand_p
= !building_stmt_tree ();
13639 /* If we're saving up tree structure, tie off the function now. */
13641 finish_stmt_tree (fndecl
);
13643 /* This must come after expand_function_end because cleanups might
13644 have declarations (from inline functions) that need to go into
13645 this function's blocks. */
13646 if (doing_semantic_analysis_p ())
13648 if (current_binding_level
->parm_flag
!= 1)
13649 my_friendly_abort (122);
13650 poplevel (1, 0, 1);
13653 /* Remember that we were in class scope. */
13654 if (current_class_name
)
13655 ctype
= current_class_type
;
13657 /* Must mark the RESULT_DECL as being in this function. */
13658 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
13660 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
13661 to the FUNCTION_DECL node itself. */
13662 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
13664 /* Undo the call to push_momentary in start_function. */
13667 /* Save away current state, if appropriate. */
13668 if (!expanding_p
&& !processing_template_decl
)
13669 save_function_data (fndecl
);
13675 int saved_flag_keep_inline_functions
=
13676 flag_keep_inline_functions
;
13678 /* So we can tell if jump_optimize sets it to 1. */
13681 if (DECL_CONTEXT (fndecl
) != NULL_TREE
13682 && hack_decl_function_context (fndecl
))
13683 /* Trick rest_of_compilation into not deferring output of this
13684 function, even if it is inline, since the rtl_obstack for
13685 this function is the function_obstack of the enclosing
13686 function and will be deallocated when the enclosing
13687 function is gone. See save_tree_status. */
13688 flag_keep_inline_functions
= 1;
13690 /* Before we call rest_of_compilation (which will pop the
13691 CURRENT_FUNCTION), we must save these values. */
13692 returns_null
= current_function_returns_null
;
13693 returns_value
= current_function_returns_value
;
13695 /* If this is a nested function (like a template instantiation
13696 that we're compiling in the midst of compiling something
13697 else), push a new GC context. That will keep local variables
13698 on the stack from being collected while we're doing the
13699 compilation of this function. */
13700 if (function_depth
> 1)
13701 ggc_push_context ();
13703 /* Run the optimizers and output the assembler code for this
13705 if (DECL_ARTIFICIAL (fndecl
))
13707 /* Do we really *want* to inline this synthesized method? */
13709 int save_fif
= flag_inline_functions
;
13710 flag_inline_functions
= 1;
13712 /* Turn off DECL_INLINE for the moment so function_cannot_inline_p
13713 will check our size. */
13714 DECL_INLINE (fndecl
) = 0;
13716 rest_of_compilation (fndecl
);
13717 flag_inline_functions
= save_fif
;
13720 rest_of_compilation (fndecl
);
13722 /* Undo the call to ggc_push_context above. */
13723 if (function_depth
> 1)
13724 ggc_pop_context ();
13726 flag_keep_inline_functions
= saved_flag_keep_inline_functions
;
13728 if (DECL_SAVED_INSNS (fndecl
) && ! TREE_ASM_WRITTEN (fndecl
))
13730 /* Set DECL_EXTERNAL so that assemble_external will be called as
13731 necessary. We'll clear it again in finish_file. */
13732 if (! DECL_EXTERNAL (fndecl
))
13733 DECL_NOT_REALLY_EXTERN (fndecl
) = 1;
13734 DECL_EXTERNAL (fndecl
) = 1;
13735 mark_inline_for_output (fndecl
);
13738 if (ctype
&& TREE_ASM_WRITTEN (fndecl
))
13739 note_debug_info_needed (ctype
);
13741 returns_null
|= can_reach_end
;
13743 /* Since we don't normally go through c_expand_return for constructors,
13744 this normally gets the wrong value.
13745 Also, named return values have their return codes emitted after
13746 NOTE_INSN_FUNCTION_END, confusing jump.c. */
13747 if (DECL_CONSTRUCTOR_P (fndecl
)
13748 || DECL_NAME (DECL_RESULT (fndecl
)) != NULL_TREE
)
13751 if (TREE_THIS_VOLATILE (fndecl
) && returns_null
)
13752 cp_warning ("`noreturn' function `%D' does return", fndecl
);
13753 else if ((warn_return_type
|| pedantic
)
13755 && TREE_CODE (TREE_TYPE (fntype
)) != VOID_TYPE
)
13757 /* If this function returns non-void and control can drop through,
13759 cp_warning ("control reaches end of non-void function `%D'", fndecl
);
13761 /* With just -W, complain only if function returns both with
13762 and without a value. */
13763 else if (extra_warnings
&& returns_value
&& returns_null
)
13764 warning ("this function may return with or without a value");
13768 /* Since we never call rest_of_compilation, we never clear
13769 CURRENT_FUNCTION. Do so explicitly. */
13770 free_after_compilation (current_function
);
13771 current_function
= NULL
;
13774 /* If this is a in-class inline definition, we may have to pop the
13775 bindings for the template parameters that we added in
13776 maybe_begin_member_template_processing when start_function was
13778 if (inclass_inline
)
13779 maybe_end_member_template_processing ();
13781 /* Leave the scope of the class. */
13783 pop_nested_class ();
13787 /* Free all the tree nodes making up this function. */
13788 /* Switch back to allocating nodes permanently
13789 until we start another function. */
13791 permanent_allocation (1);
13793 if (!DECL_SAVED_INSNS (fndecl
) && !DECL_SAVED_FUNCTION_DATA (fndecl
))
13797 /* Stop pointing to the local nodes about to be freed. */
13798 /* But DECL_INITIAL must remain nonzero so we know this
13799 was an actual function definition. */
13800 DECL_INITIAL (fndecl
) = error_mark_node
;
13801 for (t
= DECL_ARGUMENTS (fndecl
); t
; t
= TREE_CHAIN (t
))
13802 DECL_RTL (t
) = DECL_INCOMING_RTL (t
) = NULL_RTX
;
13805 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
13806 static_ctors
= tree_cons (NULL_TREE
, fndecl
, static_ctors
);
13807 if (DECL_STATIC_DESTRUCTOR (fndecl
))
13808 static_dtors
= tree_cons (NULL_TREE
, fndecl
, static_dtors
);
13813 /* Let the error reporting routines know that we're outside a
13814 function. For a nested function, this value is used in
13815 pop_cp_function_context and then reset via pop_function_context. */
13816 current_function_decl
= NULL_TREE
;
13822 /* Create the FUNCTION_DECL for a function definition.
13823 DECLSPECS and DECLARATOR are the parts of the declaration;
13824 they describe the return type and the name of the function,
13825 but twisted together in a fashion that parallels the syntax of C.
13827 This function creates a binding context for the function body
13828 as well as setting up the FUNCTION_DECL in current_function_decl.
13830 Returns a FUNCTION_DECL on success.
13832 If the DECLARATOR is not suitable for a function (it defines a datum
13833 instead), we return 0, which tells yyparse to report a parse error.
13835 May return void_type_node indicating that this method is actually
13836 a friend. See grokfield for more details.
13838 Came here with a `.pushlevel' .
13840 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
13841 CHANGES TO CODE IN `grokfield'. */
13844 start_method (declspecs
, declarator
, attrlist
)
13845 tree declarator
, declspecs
, attrlist
;
13847 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
13850 /* Something too ugly to handle. */
13851 if (fndecl
== NULL_TREE
)
13854 /* Pass friends other than inline friend functions back. */
13855 if (fndecl
== void_type_node
)
13858 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
13859 /* Not a function, tell parser to report parse error. */
13862 if (DECL_IN_AGGR_P (fndecl
))
13864 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
13866 if (DECL_CONTEXT (fndecl
)
13867 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
13868 cp_error ("`%D' is already defined in class %s", fndecl
,
13869 TYPE_NAME_STRING (DECL_CONTEXT (fndecl
)));
13871 return void_type_node
;
13874 check_template_shadow (fndecl
);
13876 DECL_THIS_INLINE (fndecl
) = 1;
13878 if (flag_default_inline
)
13879 DECL_INLINE (fndecl
) = 1;
13881 /* We process method specializations in finish_struct_1. */
13882 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
13883 fndecl
= push_template_decl (fndecl
);
13885 /* We read in the parameters on the maybepermanent_obstack,
13886 but we won't be getting back to them until after we
13887 may have clobbered them. So the call to preserve_data
13888 will keep them safe. */
13891 if (! DECL_FRIEND_P (fndecl
))
13893 if (TREE_CHAIN (fndecl
))
13895 fndecl
= copy_node (fndecl
);
13896 TREE_CHAIN (fndecl
) = NULL_TREE
;
13899 if (DECL_CONSTRUCTOR_P (fndecl
))
13901 if (! grok_ctor_properties (current_class_type
, fndecl
))
13902 return void_type_node
;
13904 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
13905 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
13908 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0, 0);
13910 /* Make a place for the parms */
13912 current_binding_level
->parm_flag
= 1;
13914 DECL_IN_AGGR_P (fndecl
) = 1;
13918 /* Go through the motions of finishing a function definition.
13919 We don't compile this method until after the whole class has
13922 FINISH_METHOD must return something that looks as though it
13923 came from GROKFIELD (since we are defining a method, after all).
13925 This is called after parsing the body of the function definition.
13926 STMTS is the chain of statements that makes up the function body.
13928 DECL is the ..._DECL that `start_method' provided. */
13931 finish_method (decl
)
13934 register tree fndecl
= decl
;
13937 register tree link
;
13939 if (decl
== void_type_node
)
13942 old_initial
= DECL_INITIAL (fndecl
);
13944 /* Undo the level for the parms (from start_method).
13945 This is like poplevel, but it causes nothing to be
13946 saved. Saving information here confuses symbol-table
13947 output routines. Besides, this information will
13948 be correctly output when this method is actually
13951 /* Clear out the meanings of the local variables of this level;
13952 also record in each decl which block it belongs to. */
13954 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
13956 if (DECL_NAME (link
) != NULL_TREE
)
13957 pop_binding (DECL_NAME (link
), link
);
13958 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
13959 DECL_CONTEXT (link
) = NULL_TREE
;
13962 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
13963 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
13964 current_binding_level
->parm_flag
,
13965 current_binding_level
->keep
);
13967 poplevel (0, 0, 0);
13969 DECL_INITIAL (fndecl
) = old_initial
;
13971 /* We used to check if the context of FNDECL was different from
13972 current_class_type as another way to get inside here. This didn't work
13973 for String.cc in libg++. */
13974 if (DECL_FRIEND_P (fndecl
))
13976 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
13977 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
13978 decl
= void_type_node
;
13984 /* Called when a new struct TYPE is defined.
13985 If this structure or union completes the type of any previous
13986 variable declaration, lay it out and output its rtl. */
13989 hack_incomplete_structures (type
)
13994 if (current_binding_level
->incomplete
== NULL_TREE
)
13997 if (!type
) /* Don't do this for class templates. */
14000 for (list
= ¤t_binding_level
->incomplete
; *list
; )
14002 tree decl
= TREE_VALUE (*list
);
14003 if ((decl
&& TREE_TYPE (decl
) == type
)
14004 || (TREE_TYPE (decl
)
14005 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14006 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
14008 int toplevel
= toplevel_bindings_p ();
14009 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14010 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
14011 layout_type (TREE_TYPE (decl
));
14012 layout_decl (decl
, 0);
14013 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
14017 expand_decl (decl
);
14018 cleanup
= maybe_build_cleanup (decl
);
14019 expand_decl_init (decl
);
14020 if (! expand_decl_cleanup (decl
, cleanup
))
14021 cp_error ("parser lost in parsing declaration of `%D'",
14024 *list
= TREE_CHAIN (*list
);
14027 list
= &TREE_CHAIN (*list
);
14031 /* If DECL is of a type which needs a cleanup, build that cleanup here.
14032 See build_delete for information about AUTO_DELETE.
14034 Don't build these on the momentary obstack; they must live
14035 the life of the binding contour. */
14038 maybe_build_cleanup_1 (decl
, auto_delete
)
14039 tree decl
, auto_delete
;
14041 tree type
= TREE_TYPE (decl
);
14042 if (type
!= error_mark_node
&& TYPE_NEEDS_DESTRUCTOR (type
))
14044 int temp
= 0, flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14047 if (TREE_CODE (decl
) != PARM_DECL
)
14048 temp
= suspend_momentary ();
14050 if (TREE_CODE (type
) == ARRAY_TYPE
)
14054 mark_addressable (decl
);
14055 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14058 /* Optimize for space over speed here. */
14059 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14060 || flag_expensive_optimizations
)
14061 flags
|= LOOKUP_NONVIRTUAL
;
14063 rval
= build_delete (TREE_TYPE (rval
), rval
, auto_delete
, flags
, 0);
14065 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14066 && ! TYPE_HAS_DESTRUCTOR (type
))
14067 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14068 build_expr_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14070 if (TREE_CODE (decl
) != PARM_DECL
)
14071 resume_momentary (temp
);
14078 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
14081 build_target_expr (decl
, value
)
14087 t
= build (TARGET_EXPR
, TREE_TYPE (decl
), decl
, value
,
14088 maybe_build_cleanup (decl
), NULL_TREE
);
14089 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
14090 ignore the TARGET_EXPR. If there really turn out to be no
14091 side-effects, then the optimizer should be able to get rid of
14092 whatever code is generated anyhow. */
14093 TREE_SIDE_EFFECTS (t
) = 1;
14098 /* If DECL is of a type which needs a cleanup, build that cleanup
14099 here. The cleanup does free the storage with a call to delete. */
14102 maybe_build_cleanup_and_delete (decl
)
14105 return maybe_build_cleanup_1 (decl
, integer_three_node
);
14108 /* If DECL is of a type which needs a cleanup, build that cleanup
14109 here. The cleanup does not free the storage with a call a delete. */
14112 maybe_build_cleanup (decl
)
14115 return maybe_build_cleanup_1 (decl
, integer_two_node
);
14118 /* Expand a C++ expression at the statement level.
14119 This is needed to ferret out nodes which have UNKNOWN_TYPE.
14120 The C++ type checker should get all of these out when
14121 expressions are combined with other, type-providing, expressions,
14122 leaving only orphan expressions, such as:
14124 &class::bar; / / takes its address, but does nothing with it. */
14127 cplus_expand_expr_stmt (exp
)
14130 if (stmts_are_full_exprs_p
)
14131 exp
= convert_to_void (exp
, "statement");
14134 /* We should do this eventually, but right now this causes regex.o from
14135 libg++ to miscompile, and tString to core dump. */
14136 exp
= build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (exp
), exp
);
14139 /* If we don't do this, we end up down inside expand_expr
14140 trying to do TYPE_MODE on the ERROR_MARK, and really
14141 go outside the bounds of the type. */
14142 if (exp
!= error_mark_node
)
14143 expand_expr_stmt (break_out_cleanups (exp
));
14146 /* When a stmt has been parsed, this function is called. */
14151 /* Always assume this statement was not an expression statement. If
14152 it actually was an expression statement, its our callers
14153 responsibility to fix this up. */
14154 last_expr_type
= NULL_TREE
;
14157 /* Change a static member function definition into a FUNCTION_TYPE, instead
14158 of the METHOD_TYPE that we create when it's originally parsed.
14160 WARNING: DO NOT pass &TREE_TYPE (decl) to FN or &TYPE_ARG_TYPES
14161 (TREE_TYPE (decl)) to ARGTYPES, as doing so will corrupt the types of
14162 other decls. Either pass the addresses of local variables or NULL. */
14165 revert_static_member_fn (decl
, fn
, argtypes
)
14166 tree
*decl
, *fn
, *argtypes
;
14169 tree function
= fn
? *fn
: TREE_TYPE (*decl
);
14170 tree args
= argtypes
? *argtypes
: TYPE_ARG_TYPES (function
);
14172 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14173 != TYPE_UNQUALIFIED
)
14174 cp_error ("static member function `%#D' declared with type qualifiers",
14177 args
= TREE_CHAIN (args
);
14178 tmp
= build_function_type (TREE_TYPE (function
), args
);
14179 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14180 tmp
= build_exception_variant (tmp
,
14181 TYPE_RAISES_EXCEPTIONS (function
));
14182 TREE_TYPE (*decl
) = tmp
;
14183 if (DECL_ARGUMENTS (*decl
))
14184 DECL_ARGUMENTS (*decl
) = TREE_CHAIN (DECL_ARGUMENTS (*decl
));
14185 DECL_STATIC_FUNCTION_P (*decl
) = 1;
14192 /* Initialize the variables used during compilation of a C++
14196 push_cp_function_context (f
)
14197 struct function
*f
;
14199 struct language_function
*p
14200 = ((struct language_function
*)
14201 xcalloc (1, sizeof (struct language_function
)));
14204 /* It takes an explicit call to expand_body to generate RTL for a
14208 /* Whenever we start a new function, we destroy temporaries in the
14210 stmts_are_full_exprs_p
= 1;
14213 /* Free the language-specific parts of F, now that we've finished
14214 compiling the function. */
14217 pop_cp_function_context (f
)
14218 struct function
*f
;
14220 free (f
->language
);
14224 /* Mark P for GC. */
14227 mark_lang_function (p
)
14228 struct language_function
*p
;
14233 ggc_mark_tree (p
->x_named_labels
);
14234 ggc_mark_tree (p
->x_ctor_label
);
14235 ggc_mark_tree (p
->x_dtor_label
);
14236 ggc_mark_tree (p
->x_base_init_list
);
14237 ggc_mark_tree (p
->x_member_init_list
);
14238 ggc_mark_tree (p
->x_current_class_ptr
);
14239 ggc_mark_tree (p
->x_current_class_ref
);
14240 ggc_mark_tree (p
->x_last_tree
);
14241 ggc_mark_tree (p
->x_last_expr_type
);
14242 ggc_mark_tree (p
->x_eh_spec_try_block
);
14243 ggc_mark_tree (p
->x_scope_stmt_stack
);
14245 ggc_mark_rtx (p
->x_last_dtor_insn
);
14246 ggc_mark_rtx (p
->x_last_parm_cleanup_insn
);
14247 ggc_mark_rtx (p
->x_result_rtx
);
14249 mark_binding_level (&p
->bindings
);
14252 /* Mark the language-specific data in F for GC. */
14255 mark_cp_function_context (f
)
14256 struct function
*f
;
14258 mark_lang_function (f
->language
);
14264 return function_depth
!= 0;
14269 lang_mark_false_label_stack (l
)
14270 struct label_node
*l
;
14272 /* C++ doesn't use false_label_stack. It better be NULL. */
14273 my_friendly_assert (l
== NULL
, 19990904);
14280 enum tree_code code
= TREE_CODE (t
);
14281 if (code
== IDENTIFIER_NODE
)
14283 struct lang_identifier
*li
= (struct lang_identifier
*) t
;
14284 struct lang_id2
*li2
= li
->x
;
14285 ggc_mark_tree (li
->namespace_bindings
);
14286 ggc_mark_tree (li
->bindings
);
14287 ggc_mark_tree (li
->class_value
);
14288 ggc_mark_tree (li
->class_template_info
);
14292 ggc_mark_tree (li2
->label_value
);
14293 ggc_mark_tree (li2
->implicit_decl
);
14294 ggc_mark_tree (li2
->error_locus
);
14297 else if (code
== CPLUS_BINDING
)
14299 if (BINDING_HAS_LEVEL_P (t
))
14300 mark_binding_level (&BINDING_LEVEL (t
));
14302 ggc_mark_tree (BINDING_SCOPE (t
));
14303 ggc_mark_tree (BINDING_VALUE (t
));
14305 else if (code
== OVERLOAD
)
14306 ggc_mark_tree (OVL_FUNCTION (t
));
14307 else if (code
== TEMPLATE_PARM_INDEX
)
14308 ggc_mark_tree (TEMPLATE_PARM_DECL (t
));
14309 else if (TREE_CODE_CLASS (code
) == 'd')
14311 struct lang_decl
*ld
= DECL_LANG_SPECIFIC (t
);
14316 ggc_mark_tree (ld
->decl_flags
.access
);
14317 ggc_mark_tree (ld
->decl_flags
.context
);
14318 if (TREE_CODE (t
) != NAMESPACE_DECL
)
14319 ggc_mark_tree (ld
->decl_flags
.u
.template_info
);
14320 if (CAN_HAVE_FULL_LANG_DECL_P (t
))
14322 ggc_mark_tree (ld
->main_decl_variant
);
14323 ggc_mark_tree (ld
->befriending_classes
);
14324 ggc_mark_tree (ld
->saved_tree
);
14325 if (TREE_CODE (t
) == TYPE_DECL
)
14326 ggc_mark_tree (ld
->u
.sorted_fields
);
14327 else if (TREE_CODE (t
) == FUNCTION_DECL
14328 && !DECL_PENDING_INLINE_P (t
))
14329 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t
));
14333 else if (TREE_CODE_CLASS (code
) == 't')
14335 struct lang_type
*lt
= TYPE_LANG_SPECIFIC (t
);
14337 if (lt
&& !(TREE_CODE (t
) == POINTER_TYPE
14338 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
14341 ggc_mark_tree (lt
->vfields
);
14342 ggc_mark_tree (lt
->vbases
);
14343 ggc_mark_tree (lt
->tags
);
14344 ggc_mark_tree (lt
->search_slot
);
14345 ggc_mark_tree (lt
->size
);
14346 ggc_mark_tree (lt
->abstract_virtuals
);
14347 ggc_mark_tree (lt
->friend_classes
);
14348 ggc_mark_tree (lt
->rtti
);
14349 ggc_mark_tree (lt
->methods
);
14350 ggc_mark_tree (lt
->template_info
);
14351 ggc_mark_tree (lt
->befriending_classes
);
14354 /* In the case of pointer-to-member function types, the
14355 TYPE_LANG_SPECIFIC is really just a tree. */
14356 ggc_mark_tree ((tree
) lt
);