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 (newdecl
) = 1;
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 /* Don't change DECL_CONTEXT of virtual methods. */
3671 && (TREE_CODE (x
) != FUNCTION_DECL
|| !DECL_VIRTUAL_P (x
))
3672 && !DECL_CONTEXT (x
))
3673 DECL_CONTEXT (x
) = current_function_decl
;
3674 if (!DECL_CONTEXT (x
))
3675 DECL_CONTEXT (x
) = FROB_CONTEXT (current_namespace
);
3678 /* Type are looked up using the DECL_NAME, as that is what the rest of the
3679 compiler wants to use. */
3680 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
3681 || TREE_CODE (x
) == NAMESPACE_DECL
)
3682 name
= DECL_NAME (x
);
3687 /* Not needed...see below. */
3691 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3692 name
= TREE_OPERAND (name
, 0);
3694 /* Namespace-scoped variables are not found in the current level. */
3695 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
))
3696 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3698 t
= lookup_name_current_level (name
);
3699 if (t
== error_mark_node
)
3701 /* error_mark_node is 0 for a while during initialization! */
3703 cp_error_at ("`%#D' used prior to declaration", x
);
3706 else if (t
!= NULL_TREE
)
3709 /* This is turned off until I have time to do it right (bpk). */
3710 /* With the code below that uses it... */
3711 file
= DECL_SOURCE_FILE (t
);
3712 line
= DECL_SOURCE_LINE (t
);
3714 if (TREE_CODE (t
) == PARM_DECL
)
3716 if (DECL_CONTEXT (t
) == NULL_TREE
)
3717 fatal ("parse errors have confused me too much");
3719 /* Check for duplicate params. */
3720 if (duplicate_decls (x
, t
))
3723 else if (((TREE_CODE (x
) == FUNCTION_DECL
&& DECL_LANGUAGE (x
) == lang_c
)
3724 || DECL_FUNCTION_TEMPLATE_P (x
))
3725 && is_overloaded_fn (t
))
3726 /* Don't do anything just yet. */;
3727 else if (t
== wchar_decl_node
)
3729 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3730 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3732 /* Throw away the redeclaration. */
3735 else if (TREE_CODE (t
) != TREE_CODE (x
))
3737 if (duplicate_decls (x
, t
))
3740 else if (duplicate_decls (x
, t
))
3743 /* This is turned off until I have time to do it right (bpk). */
3745 /* Also warn if they did a prototype with `static' on it, but
3746 then later left the `static' off. */
3747 if (! TREE_PUBLIC (name
) && TREE_PUBLIC (x
))
3749 if (DECL_LANG_SPECIFIC (t
) && DECL_FRIEND_P (t
))
3754 cp_warning ("`static' missing from declaration of `%D'",
3756 warning_with_file_and_line (file
, line
,
3757 "previous declaration of `%s'",
3758 decl_as_string (t
, 0));
3761 /* Now fix things so it'll do what they expect. */
3762 if (current_function_decl
)
3763 TREE_PUBLIC (current_function_decl
) = 0;
3765 /* Due to interference in memory reclamation (X may be
3766 obstack-deallocated at this point), we must guard against
3767 one really special case. [jason: This should be handled
3768 by start_function] */
3769 if (current_function_decl
== x
)
3770 current_function_decl
= t
;
3772 if (TREE_CODE (t
) == TYPE_DECL
)
3773 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3774 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3775 check_default_args (t
);
3779 else if (DECL_MAIN_P (x
))
3781 /* A redeclaration of main, but not a duplicate of the
3786 This function shall not be overloaded. */
3787 cp_error_at ("invalid redeclaration of `%D'", t
);
3788 cp_error ("as `%D'", x
);
3789 /* We don't try to push this declaration since that
3795 check_template_shadow (x
);
3797 /* If this is a function conjured up by the backend, massage it
3798 so it looks friendly. */
3799 if (TREE_CODE (x
) == FUNCTION_DECL
3800 && ! DECL_LANG_SPECIFIC (x
))
3802 retrofit_lang_decl (x
);
3803 DECL_LANGUAGE (x
) = lang_c
;
3806 if (TREE_CODE (x
) == FUNCTION_DECL
&& ! DECL_FUNCTION_MEMBER_P (x
))
3808 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
3809 if (t
!= x
|| DECL_LANGUAGE (x
) == lang_c
)
3811 if (!namespace_bindings_p ())
3812 /* We do not need to create a binding for this name;
3813 push_overloaded_decl will have already done so if
3815 need_new_binding
= 0;
3817 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3819 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
3821 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
3825 /* If declaring a type as a typedef, copy the type (unless we're
3826 at line 0), and install this TYPE_DECL as the new type's typedef
3827 name. See the extensive comment in ../c-decl.c (pushdecl). */
3828 if (TREE_CODE (x
) == TYPE_DECL
)
3830 tree type
= TREE_TYPE (x
);
3831 if (DECL_SOURCE_LINE (x
) == 0)
3833 if (TYPE_NAME (type
) == 0)
3834 TYPE_NAME (type
) = x
;
3836 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
3837 /* We don't want to copy the type when all we're
3838 doing is making a TYPE_DECL for the purposes of
3840 && (!TYPE_NAME (type
)
3841 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
3843 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
3845 DECL_ORIGINAL_TYPE (x
) = type
;
3846 type
= build_type_copy (type
);
3847 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
3848 TYPE_NAME (type
) = x
;
3849 TREE_TYPE (x
) = type
;
3854 if (type
!= error_mark_node
3856 && TYPE_IDENTIFIER (type
))
3857 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
3858 current_binding_level
);
3862 /* Multiple external decls of the same identifier ought to match.
3864 We get warnings about inline functions where they are defined.
3865 We get warnings about other functions from push_overloaded_decl.
3867 Avoid duplicate warnings where they are used. */
3868 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
3872 if (IDENTIFIER_NAMESPACE_VALUE (name
) != NULL_TREE
3873 && (DECL_EXTERNAL (IDENTIFIER_NAMESPACE_VALUE (name
))
3874 || TREE_PUBLIC (IDENTIFIER_NAMESPACE_VALUE (name
))))
3875 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
3880 /* If different sort of thing, we already gave an error. */
3881 && TREE_CODE (decl
) == TREE_CODE (x
)
3882 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
3884 cp_pedwarn ("type mismatch with previous external decl", x
);
3885 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
3889 /* This name is new in its binding level.
3890 Install the new declaration and return it. */
3891 if (namespace_bindings_p ())
3893 /* Install a global value. */
3895 /* If the first global decl has external linkage,
3896 warn if we later see static one. */
3897 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
3898 TREE_PUBLIC (name
) = 1;
3900 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
3903 if (TREE_CODE (x
) == FUNCTION_DECL
)
3905 ((IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
)
3906 || (IDENTIFIER_GLOBAL_VALUE (name
) == x
), 378);
3907 SET_IDENTIFIER_NAMESPACE_VALUE (name
, x
);
3910 /* Don't forget if the function was used via an implicit decl. */
3911 if (IDENTIFIER_IMPLICIT_DECL (name
)
3912 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
3915 /* Don't forget if its address was taken in that way. */
3916 if (IDENTIFIER_IMPLICIT_DECL (name
)
3917 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
3918 TREE_ADDRESSABLE (x
) = 1;
3920 /* Warn about mismatches against previous implicit decl. */
3921 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
3922 /* If this real decl matches the implicit, don't complain. */
3923 && ! (TREE_CODE (x
) == FUNCTION_DECL
3924 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
3926 ("`%D' was previously implicitly declared to return `int'", x
);
3928 /* If new decl is `static' and an `extern' was seen previously,
3930 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
3931 warn_extern_redeclared_static (x
, t
);
3935 /* Here to install a non-global value. */
3936 tree oldlocal
= IDENTIFIER_VALUE (name
);
3937 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
3939 if (need_new_binding
)
3941 push_local_binding (name
, x
, 0);
3942 /* Because push_local_binding will hook X on to the
3943 current_binding_level's name list, we don't want to
3944 do that again below. */
3945 need_new_binding
= 0;
3948 /* If this is a TYPE_DECL, push it into the type value slot. */
3949 if (TREE_CODE (x
) == TYPE_DECL
)
3950 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
3951 current_binding_level
);
3953 /* Clear out any TYPE_DECL shadowed by a namespace so that
3954 we won't think this is a type. The C struct hack doesn't
3955 go through namespaces. */
3956 if (TREE_CODE (x
) == NAMESPACE_DECL
)
3957 set_identifier_type_value_with_scope (name
, NULL_TREE
,
3958 current_binding_level
);
3960 /* If this is an extern function declaration, see if we
3961 have a global definition or declaration for the function. */
3962 if (oldlocal
== NULL_TREE
3963 && DECL_EXTERNAL (x
)
3964 && oldglobal
!= NULL_TREE
3965 && TREE_CODE (x
) == FUNCTION_DECL
3966 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
3968 /* We have one. Their types must agree. */
3969 if (decls_match (x
, oldglobal
))
3973 cp_warning ("extern declaration of `%#D' doesn't match", x
);
3974 cp_warning_at ("global declaration `%#D'", oldglobal
);
3977 /* If we have a local external declaration,
3978 and no file-scope declaration has yet been seen,
3979 then if we later have a file-scope decl it must not be static. */
3980 if (oldlocal
== NULL_TREE
3981 && oldglobal
== NULL_TREE
3982 && DECL_EXTERNAL (x
)
3984 TREE_PUBLIC (name
) = 1;
3986 if (DECL_FROM_INLINE (x
))
3987 /* Inline decls shadow nothing. */;
3989 /* Warn if shadowing an argument at the top level of the body. */
3990 else if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
3991 && TREE_CODE (oldlocal
) == PARM_DECL
3992 /* Don't complain if it's from an enclosing function. */
3993 && DECL_CONTEXT (oldlocal
) == current_function_decl
3994 && TREE_CODE (x
) != PARM_DECL
)
3996 /* Go to where the parms should be and see if we
3998 struct binding_level
*b
= current_binding_level
->level_chain
;
4004 if (b
->parm_flag
== 1)
4005 cp_error ("declaration of `%#D' shadows a parameter", name
);
4007 else if (warn_shadow
&& oldlocal
!= NULL_TREE
4008 && current_binding_level
->is_for_scope
4009 && !DECL_DEAD_FOR_LOCAL (oldlocal
))
4011 warning ("variable `%s' shadows local",
4012 IDENTIFIER_POINTER (name
));
4013 cp_warning_at (" this is the shadowed declaration", oldlocal
);
4015 /* Maybe warn if shadowing something else. */
4016 else if (warn_shadow
&& !DECL_EXTERNAL (x
)
4017 /* No shadow warnings for internally generated vars. */
4018 && ! DECL_ARTIFICIAL (x
)
4019 /* No shadow warnings for vars made for inlining. */
4020 && ! DECL_FROM_INLINE (x
))
4022 const char *warnstring
= NULL
;
4024 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
4025 warnstring
= "declaration of `%s' shadows a parameter";
4026 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
4027 && current_class_ptr
4028 && !TREE_STATIC (name
))
4029 warnstring
= "declaration of `%s' shadows a member of `this'";
4030 else if (oldlocal
!= NULL_TREE
)
4031 warnstring
= "declaration of `%s' shadows previous local";
4032 else if (oldglobal
!= NULL_TREE
)
4033 /* XXX shadow warnings in outer-more namespaces */
4034 warnstring
= "declaration of `%s' shadows global declaration";
4037 warning (warnstring
, IDENTIFIER_POINTER (name
));
4041 if (TREE_CODE (x
) == FUNCTION_DECL
)
4042 check_default_args (x
);
4044 /* Keep count of variables in this level with incomplete type. */
4045 if (TREE_CODE (x
) == VAR_DECL
4046 && TREE_TYPE (x
) != error_mark_node
4047 && ((TYPE_SIZE (TREE_TYPE (x
)) == NULL_TREE
4048 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
4049 /* RTTI TD entries are created while defining the type_info. */
4050 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
4051 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
4052 current_binding_level
->incomplete
4053 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4056 if (need_new_binding
)
4057 add_decl_to_level (x
, current_binding_level
);
4062 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4063 caller to set DECL_CONTEXT properly. */
4066 pushdecl_with_scope (x
, level
)
4068 struct binding_level
*level
;
4070 register struct binding_level
*b
;
4071 tree function_decl
= current_function_decl
;
4073 current_function_decl
= NULL_TREE
;
4074 if (level
->parm_flag
== 2)
4076 b
= class_binding_level
;
4077 class_binding_level
= level
;
4078 pushdecl_class_level (x
);
4079 class_binding_level
= b
;
4083 b
= current_binding_level
;
4084 current_binding_level
= level
;
4086 current_binding_level
= b
;
4088 current_function_decl
= function_decl
;
4092 /* Like pushdecl, only it places X in the current namespace,
4096 pushdecl_namespace_level (x
)
4099 register struct binding_level
*b
= current_binding_level
;
4102 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4104 /* Now, the type_shadowed stack may screw us. Munge it so it does
4106 if (TREE_CODE (x
) == TYPE_DECL
)
4108 tree name
= DECL_NAME (x
);
4110 tree
*ptr
= (tree
*)0;
4111 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4113 tree shadowed
= b
->type_shadowed
;
4114 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4115 if (TREE_PURPOSE (shadowed
) == name
)
4117 ptr
= &TREE_VALUE (shadowed
);
4118 /* Can't break out of the loop here because sometimes
4119 a binding level will have duplicate bindings for
4120 PT names. It's gross, but I haven't time to fix it. */
4123 newval
= TREE_TYPE (x
);
4124 if (ptr
== (tree
*)0)
4126 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4127 up here if this is changed to an assertion. --KR */
4128 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4138 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4142 pushdecl_top_level (x
)
4145 push_to_top_level ();
4146 x
= pushdecl_namespace_level (x
);
4147 pop_from_top_level ();
4151 /* Make the declaration of X appear in CLASS scope. */
4154 pushdecl_class_level (x
)
4157 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4158 scope looks for the pre-mangled name. */
4161 if (TREE_CODE (x
) == OVERLOAD
)
4162 x
= OVL_CURRENT (x
);
4163 name
= DECL_NAME (x
);
4167 push_class_level_binding (name
, x
);
4168 if (TREE_CODE (x
) == TYPE_DECL
)
4169 set_identifier_type_value (name
, TREE_TYPE (x
));
4171 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4175 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4178 pushdecl_class_level (f
);
4182 /* Enter DECL into the symbol table, if that's appropriate. Returns
4183 DECL, or a modified version thereof. */
4186 maybe_push_decl (decl
)
4189 tree type
= TREE_TYPE (decl
);
4191 /* Add this decl to the current binding level, but not if it comes
4192 from another scope, e.g. a static member variable. TEM may equal
4193 DECL or it may be a previous decl of the same name. */
4194 if ((TREE_CODE (decl
) != PARM_DECL
4195 && DECL_CONTEXT (decl
) != NULL_TREE
4196 /* Definitions of namespace members outside their namespace are
4198 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4199 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4200 || TREE_CODE (type
) == UNKNOWN_TYPE
4201 /* The declaration of a template specialization does not affect
4202 the functions available for overload resolution, so we do not
4204 || (TREE_CODE (decl
) == FUNCTION_DECL
4205 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4208 return pushdecl (decl
);
4212 /* This function is used to push the mangled decls for nested types into
4213 the appropriate scope. Previously pushdecl_top_level was used, but that
4214 is incorrect for members of local classes. */
4217 pushdecl_nonclass_level (x
)
4220 struct binding_level
*b
= current_binding_level
;
4222 my_friendly_assert (b
->parm_flag
!= 2, 180);
4225 /* Get out of template binding levels */
4226 while (b
->pseudo_global
)
4230 pushdecl_with_scope (x
, b
);
4234 /* Make the declaration(s) of X appear in CLASS scope
4235 under the name NAME. */
4238 push_class_level_binding (name
, x
)
4243 /* The class_binding_level will be NULL if x is a template
4244 parameter name in a member template. */
4245 if (!class_binding_level
)
4248 /* Make sure that this new member does not have the same name
4249 as a template parameter. */
4250 if (TYPE_BEING_DEFINED (current_class_type
))
4251 check_template_shadow (x
);
4253 /* If this declaration shadows a declaration from an enclosing
4254 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4255 we leave this class. Record the shadowed declaration here. */
4256 binding
= IDENTIFIER_BINDING (name
);
4258 && ((TREE_CODE (x
) == OVERLOAD
4259 && BINDING_VALUE (binding
)
4260 && is_overloaded_fn (BINDING_VALUE (binding
)))
4261 || INHERITED_VALUE_BINDING_P (binding
)))
4266 /* If the old binding was from a base class, and was for a tag
4267 name, slide it over to make room for the new binding. The
4268 old binding is still visible if explicitly qualified with a
4270 if (INHERITED_VALUE_BINDING_P (binding
)
4271 && BINDING_VALUE (binding
)
4272 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4273 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4274 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4276 old_decl
= BINDING_TYPE (binding
);
4277 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4278 BINDING_VALUE (binding
) = NULL_TREE
;
4279 INHERITED_VALUE_BINDING_P (binding
) = 0;
4282 old_decl
= BINDING_VALUE (binding
);
4284 /* There was already a binding for X containing fewer
4285 functions than are named in X. Find the previous
4286 declaration of X on the class-shadowed list, and update it. */
4287 for (shadow
= class_binding_level
->class_shadowed
;
4289 shadow
= TREE_CHAIN (shadow
))
4290 if (TREE_PURPOSE (shadow
) == name
4291 && TREE_TYPE (shadow
) == old_decl
)
4293 BINDING_VALUE (binding
) = x
;
4294 INHERITED_VALUE_BINDING_P (binding
) = 0;
4295 TREE_TYPE (shadow
) = x
;
4300 /* If we didn't replace an existing binding, put the binding on the
4301 stack of bindings for the identifier, and update
4302 IDENTIFIER_CLASS_VALUE. */
4303 if (push_class_binding (name
, x
))
4305 push_cache_obstack ();
4306 class_binding_level
->class_shadowed
4307 = tree_cons (name
, IDENTIFIER_CLASS_VALUE (name
),
4308 class_binding_level
->class_shadowed
);
4310 /* Record the value we are binding NAME to so that we can know
4311 what to pop later. */
4312 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4316 /* Insert another USING_DECL into the current binding level,
4317 returning this declaration. If this is a redeclaration,
4318 do nothing and return NULL_TREE. */
4321 push_using_decl (scope
, name
)
4327 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4328 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4329 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4330 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4334 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4335 DECL_INITIAL (decl
) = scope
;
4336 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4337 current_binding_level
->usings
= decl
;
4341 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4342 changed (i.e. there was already a directive), or the fresh
4343 TREE_LIST otherwise. */
4346 push_using_directive (used
)
4349 tree ud
= current_binding_level
->using_directives
;
4350 tree iter
, ancestor
;
4352 /* Check if we already have this. */
4353 if (purpose_member (used
, ud
) != NULL_TREE
)
4356 /* Recursively add all namespaces used. */
4357 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4358 push_using_directive (TREE_PURPOSE (iter
));
4360 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4361 ud
= current_binding_level
->using_directives
;
4362 ud
= tree_cons (used
, ancestor
, ud
);
4363 current_binding_level
->using_directives
= ud
;
4367 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4368 other definitions already in place. We get around this by making
4369 the value of the identifier point to a list of all the things that
4370 want to be referenced by that name. It is then up to the users of
4371 that name to decide what to do with that list.
4373 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its DECL_RESULT
4374 slot. It is dealt with the same way.
4376 FLAGS is a bitwise-or of the following values:
4377 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4379 PUSH_USING: DECL is being pushed as the result of a using
4382 The value returned may be a previous declaration if we guessed wrong
4383 about what language DECL should belong to (C or C++). Otherwise,
4384 it's always DECL (and never something that's not a _DECL). */
4387 push_overloaded_decl (decl
, flags
)
4391 tree name
= DECL_NAME (decl
);
4394 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4397 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4399 old
= lookup_name_current_level (name
);
4403 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4405 tree t
= TREE_TYPE (old
);
4406 if (IS_AGGR_TYPE (t
) && warn_shadow
4407 && (! DECL_IN_SYSTEM_HEADER (decl
)
4408 || ! DECL_IN_SYSTEM_HEADER (old
)))
4409 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4412 else if (is_overloaded_fn (old
))
4416 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4418 tree fn
= OVL_CURRENT (tmp
);
4420 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4421 && !(flags
& PUSH_USING
)
4422 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4423 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4424 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4427 if (duplicate_decls (decl
, fn
))
4433 cp_error_at ("previous non-function declaration `%#D'", old
);
4434 cp_error ("conflicts with function declaration `%#D'", decl
);
4439 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4441 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4442 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4444 new_binding
= ovl_cons (decl
, old
);
4445 if (flags
& PUSH_USING
)
4446 OVL_USED (new_binding
) = 1;
4449 /* NAME is not ambiguous. */
4453 set_namespace_binding (name
, current_namespace
, new_binding
);
4456 /* We only create an OVERLOAD if there was a previous binding at
4457 this level, or if decl is a template. In the former case, we
4458 need to remove the old binding and replace it with the new
4459 binding. We must also run through the NAMES on the binding
4460 level where the name was bound to update the chain. */
4462 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4466 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4468 d
= &TREE_CHAIN (*d
))
4470 || (TREE_CODE (*d
) == TREE_LIST
4471 && TREE_VALUE (*d
) == old
))
4473 if (TREE_CODE (*d
) == TREE_LIST
)
4474 /* Just replace the old binding with the new. */
4475 TREE_VALUE (*d
) = new_binding
;
4477 /* Build a TREE_LIST to wrap the OVERLOAD. */
4478 *d
= tree_cons (NULL_TREE
, new_binding
,
4481 /* And update the CPLUS_BINDING node. */
4482 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4487 /* We should always find a previous binding in this case. */
4488 my_friendly_abort (0);
4491 /* Install the new binding. */
4492 push_local_binding (name
, new_binding
, flags
);
4498 /* Generate an implicit declaration for identifier FUNCTIONID
4499 as a function of type int (). Print a warning if appropriate. */
4502 implicitly_declare (functionid
)
4506 int temp
= allocation_temporary_p ();
4508 push_obstacks_nochange ();
4510 /* Save the decl permanently so we can warn if definition follows.
4511 In ANSI C, warn_implicit is usually false, so the saves little space.
4512 But in C++, it's usually true, hence the extra code. */
4513 if (temp
&& (! warn_implicit
|| toplevel_bindings_p ()))
4514 end_temporary_allocation ();
4516 /* We used to reuse an old implicit decl here,
4517 but this loses with inline functions because it can clobber
4518 the saved decl chains. */
4519 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4521 DECL_EXTERNAL (decl
) = 1;
4522 TREE_PUBLIC (decl
) = 1;
4524 /* ANSI standard says implicit declarations are in the innermost block.
4525 So we record the decl in the standard fashion. */
4527 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4530 /* Only one warning per identifier. */
4531 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4533 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4536 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4543 /* Return zero if the declaration NEWDECL is valid
4544 when the declaration OLDDECL (assumed to be for the same name)
4545 has already been seen.
4546 Otherwise return an error message format string with a %s
4547 where the identifier should go. */
4550 redeclaration_error_message (newdecl
, olddecl
)
4551 tree newdecl
, olddecl
;
4553 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4555 /* Because C++ can put things into name space for free,
4556 constructs like "typedef struct foo { ... } foo"
4557 would look like an erroneous redeclaration. */
4558 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4561 return "redefinition of `%#D'";
4563 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4565 /* If this is a pure function, its olddecl will actually be
4566 the original initialization to `0' (which we force to call
4567 abort()). Don't complain about redefinition in this case. */
4568 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_ABSTRACT_VIRTUAL_P (olddecl
))
4571 /* If both functions come from different namespaces, this is not
4572 a redeclaration - this is a conflict with a used function. */
4573 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4574 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4575 return "`%D' conflicts with used function";
4577 /* We'll complain about linkage mismatches in
4578 warn_extern_redeclared_static. */
4580 /* Defining the same name twice is no good. */
4581 if (DECL_INITIAL (olddecl
) != NULL_TREE
4582 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4584 if (DECL_NAME (olddecl
) == NULL_TREE
)
4585 return "`%#D' not declared in class";
4587 return "redefinition of `%#D'";
4591 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4593 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4594 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4595 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4596 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4597 && TYPE_SIZE (TREE_TYPE (newdecl
))
4598 && TYPE_SIZE (TREE_TYPE (olddecl
))))
4599 return "redefinition of `%#D'";
4602 else if (toplevel_bindings_p ())
4604 /* Objects declared at top level: */
4605 /* If at least one is a reference, it's ok. */
4606 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4608 /* Reject two definitions. */
4609 return "redefinition of `%#D'";
4613 /* Objects declared with block scope: */
4614 /* Reject two definitions, and reject a definition
4615 together with an external reference. */
4616 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4617 return "redeclaration of `%#D'";
4622 /* Create a new label, named ID. */
4625 make_label_decl (id
, local_p
)
4631 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4633 /* Make sure every label has an rtx. */
4636 DECL_CONTEXT (decl
) = current_function_decl
;
4637 DECL_MODE (decl
) = VOIDmode
;
4638 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
4640 /* Say where one reference is to the label, for the sake of the
4641 error if it is not defined. */
4642 DECL_SOURCE_LINE (decl
) = lineno
;
4643 DECL_SOURCE_FILE (decl
) = input_filename
;
4645 /* Record the fact that this identifier is bound to this label. */
4646 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4648 /* Record this label on the list of used labels so that we can check
4649 at the end of the function to see whether or not the label was
4650 actually defined. */
4651 if ((named_label_uses
== NULL
|| named_label_uses
->label_decl
!= decl
)
4652 && (named_label_uses
== NULL
4653 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4654 || named_label_uses
->label_decl
!= decl
))
4656 struct named_label_list
*new_ent
;
4658 = (struct named_label_list
*)oballoc (sizeof (struct named_label_list
));
4659 new_ent
->label_decl
= decl
;
4660 new_ent
->names_in_scope
= current_binding_level
->names
;
4661 new_ent
->binding_level
= current_binding_level
;
4662 new_ent
->lineno_o_goto
= lineno
;
4663 new_ent
->filename_o_goto
= input_filename
;
4664 new_ent
->next
= named_label_uses
;
4665 named_label_uses
= new_ent
;
4671 /* Look for a label named ID in the current function. If one cannot
4672 be found, create one. (We keep track of used, but undefined,
4673 labels, and complain about them at the end of a function.) */
4681 /* You can't use labels at global scope. */
4682 if (current_function_decl
== NULL_TREE
)
4684 error ("label `%s' referenced outside of any function",
4685 IDENTIFIER_POINTER (id
));
4689 /* See if we've already got this label. */
4690 decl
= IDENTIFIER_LABEL_VALUE (id
);
4691 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
4694 /* Record this label on the list of labels used in this function.
4695 We do this before calling make_label_decl so that we get the
4696 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4697 named_labels
= tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4699 /* We need a new label. */
4700 decl
= make_label_decl (id
, /*local_p=*/0);
4701 /* Now fill in the information we didn't have before. */
4702 TREE_VALUE (named_labels
) = decl
;
4707 /* Declare a local label named ID. */
4710 declare_local_label (id
)
4715 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4716 this scope we can restore the old value of
4717 IDENTIFIER_TYPE_VALUE. */
4718 current_binding_level
->shadowed_labels
4719 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4720 current_binding_level
->shadowed_labels
);
4721 /* Look for the label. */
4722 decl
= make_label_decl (id
, /*local_p=*/1);
4723 /* Now fill in the information we didn't have before. */
4724 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
4729 /* Define a label, specifying the location in the source file.
4730 Return the LABEL_DECL node for the label, if the definition is valid.
4731 Otherwise return 0. */
4734 define_label (filename
, line
, name
)
4739 tree decl
= lookup_label (name
);
4741 /* After labels, make any new cleanups go into their
4742 own new (temporary) binding contour. */
4743 current_binding_level
->more_cleanups_ok
= 0;
4745 if (name
== get_identifier ("wchar_t"))
4746 cp_pedwarn ("label named wchar_t");
4748 if (DECL_INITIAL (decl
) != NULL_TREE
)
4750 cp_error ("duplicate label `%D'", decl
);
4755 struct named_label_list
*uses
, *prev
;
4759 /* Mark label as having been defined. */
4760 DECL_INITIAL (decl
) = error_mark_node
;
4761 /* Say where in the source. */
4762 DECL_SOURCE_FILE (decl
) = filename
;
4763 DECL_SOURCE_LINE (decl
) = line
;
4766 uses
= named_label_uses
;
4767 while (uses
!= NULL
)
4768 if (uses
->label_decl
== decl
)
4770 struct binding_level
*b
= current_binding_level
;
4773 tree new_decls
= b
->names
;
4774 tree old_decls
= (b
== uses
->binding_level
)
4775 ? uses
->names_in_scope
: NULL_TREE
;
4776 while (new_decls
!= old_decls
)
4778 if (TREE_CODE (new_decls
) == VAR_DECL
4779 /* Don't complain about crossing initialization
4780 of internal entities. They can't be accessed,
4781 and they should be cleaned up
4782 by the time we get to the label. */
4783 && ! DECL_ARTIFICIAL (new_decls
)
4784 && !(DECL_INITIAL (new_decls
) == NULL_TREE
4785 && pod_type_p (TREE_TYPE (new_decls
))))
4787 /* This is really only important if we're crossing
4788 an initialization. The POD stuff is just
4789 pedantry; why should it matter if the class
4790 contains a field of pointer to member type? */
4791 int problem
= (DECL_INITIAL (new_decls
)
4792 || (TYPE_NEEDS_CONSTRUCTING
4793 (TREE_TYPE (new_decls
))));
4799 cp_error ("jump to label `%D'", decl
);
4800 error_with_file_and_line
4801 (uses
->filename_o_goto
,
4802 uses
->lineno_o_goto
, " from here");
4806 cp_pedwarn ("jump to label `%D'", decl
);
4807 pedwarn_with_file_and_line
4808 (uses
->filename_o_goto
,
4809 uses
->lineno_o_goto
, " from here");
4815 cp_error_at (" crosses initialization of `%#D'",
4818 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4821 new_decls
= TREE_CHAIN (new_decls
);
4823 if (b
== uses
->binding_level
)
4825 if (b
->eh_region
&& ! saw_eh
)
4829 cp_error ("jump to label `%D'", decl
);
4830 error_with_file_and_line
4831 (uses
->filename_o_goto
,
4832 uses
->lineno_o_goto
, " from here");
4835 error (" enters exception handling block");
4842 prev
->next
= uses
->next
;
4844 named_label_uses
= uses
->next
;
4853 current_function_return_value
= NULL_TREE
;
4860 struct binding_level
*level
;
4861 struct cp_switch
*next
;
4864 static struct cp_switch
*switch_stack
;
4870 = (struct cp_switch
*) oballoc (sizeof (struct cp_switch
));
4871 p
->level
= current_binding_level
;
4872 p
->next
= switch_stack
;
4879 switch_stack
= switch_stack
->next
;
4882 /* Note that we've seen a definition of a case label, and complain if this
4883 is a bad place for one. */
4886 define_case_label ()
4888 tree cleanup
= last_cleanup_this_contour ();
4889 struct binding_level
*b
= current_binding_level
;
4893 /* Don't crash; we'll complain in do_case. */
4898 static int explained
= 0;
4899 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup
));
4900 warning ("where case label appears here");
4903 warning ("(enclose actions of previous case statements requiring");
4904 warning ("destructors in their own binding contours.)");
4909 for (; b
&& b
!= switch_stack
->level
; b
= b
->level_chain
)
4911 tree new_decls
= b
->names
;
4912 for (; new_decls
; new_decls
= TREE_CHAIN (new_decls
))
4914 if (TREE_CODE (new_decls
) == VAR_DECL
4915 /* Don't complain about crossing initialization
4916 of internal entities. They can't be accessed,
4917 and they should be cleaned up
4918 by the time we get to the label. */
4919 && ! DECL_ARTIFICIAL (new_decls
)
4920 && ((DECL_INITIAL (new_decls
) != NULL_TREE
4921 && DECL_INITIAL (new_decls
) != error_mark_node
)
4922 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls
))))
4925 error ("jump to case label");
4927 cp_error_at (" crosses initialization of `%#D'",
4933 /* After labels, make any new cleanups go into their
4934 own new (temporary) binding contour. */
4936 current_binding_level
->more_cleanups_ok
= 0;
4937 current_function_return_value
= NULL_TREE
;
4940 /* Return the list of declarations of the current level.
4941 Note that this list is in reverse order unless/until
4942 you nreverse it; and when you do nreverse it, you must
4943 store the result back using `storedecls' or you will lose. */
4948 return current_binding_level
->names
;
4951 /* Return the list of type-tags (for structs, etc) of the current level. */
4956 return current_binding_level
->tags
;
4959 /* Store the list of declarations of the current level.
4960 This is done for the parameter declarations of a function being defined,
4961 after they are modified in the light of any missing parameters. */
4967 current_binding_level
->names
= decls
;
4970 /* Similarly, store the list of tags of the current level. */
4976 current_binding_level
->tags
= tags
;
4979 /* Given NAME, an IDENTIFIER_NODE,
4980 return the structure (or union or enum) definition for that name.
4981 Searches binding levels from BINDING_LEVEL up to the global level.
4982 If THISLEVEL_ONLY is nonzero, searches only the specified context
4983 (but skips any tag-transparent contexts to find one that is
4984 meaningful for tags).
4985 FORM says which kind of type the caller wants;
4986 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
4987 If the wrong kind of type is found, and it's not a template, an error is
4991 lookup_tag (form
, name
, binding_level
, thislevel_only
)
4992 enum tree_code form
;
4994 struct binding_level
*binding_level
;
4997 register struct binding_level
*level
;
4998 /* Non-zero if, we should look past a pseudo-global level, even if
5000 int allow_pseudo_global
= 1;
5002 for (level
= binding_level
; level
; level
= level
->level_chain
)
5005 if (ANON_AGGRNAME_P (name
))
5006 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5008 /* There's no need for error checking here, because
5009 anon names are unique throughout the compilation. */
5010 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
5011 return TREE_VALUE (tail
);
5013 else if (level
->namespace_p
)
5014 /* Do namespace lookup. */
5015 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
5017 tree old
= binding_for_name (name
, tail
);
5019 /* If we just skipped past a pseudo global level, even
5020 though THISLEVEL_ONLY, and we find a template class
5021 declaration, then we use the _TYPE node for the
5022 template. See the example below. */
5023 if (thislevel_only
&& !allow_pseudo_global
5024 && old
&& BINDING_VALUE (old
)
5025 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
5026 old
= TREE_TYPE (BINDING_VALUE (old
));
5028 old
= BINDING_TYPE (old
);
5030 /* If it has an original type, it is a typedef, and we
5031 should not return it. */
5032 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
5034 if (old
&& TREE_CODE (old
) != form
5035 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
5037 cp_error ("`%#D' redeclared as %C", old
, form
);
5042 if (thislevel_only
|| tail
== global_namespace
)
5046 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5048 if (TREE_PURPOSE (tail
) == name
)
5050 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
5051 /* Should tighten this up; it'll probably permit
5052 UNION_TYPE and a struct template, for example. */
5054 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
5056 /* Definition isn't the kind we were looking for. */
5057 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
5061 return TREE_VALUE (tail
);
5064 if (thislevel_only
&& ! level
->tag_transparent
)
5066 if (level
->pseudo_global
&& allow_pseudo_global
)
5068 /* We must deal with cases like this:
5070 template <class T> struct S;
5071 template <class T> struct S {};
5073 When looking up `S', for the second declaration, we
5074 would like to find the first declaration. But, we
5075 are in the pseudo-global level created for the
5076 template parameters, rather than the (surrounding)
5077 namespace level. Thus, we keep going one more level,
5078 even though THISLEVEL_ONLY is non-zero. */
5079 allow_pseudo_global
= 0;
5091 set_current_level_tags_transparency (tags_transparent
)
5092 int tags_transparent
;
5094 current_binding_level
->tag_transparent
= tags_transparent
;
5098 /* Given a type, find the tag that was defined for it and return the tag name.
5099 Otherwise return 0. However, the value can never be 0
5100 in the cases in which this is used.
5102 C++: If NAME is non-zero, this is the new name to install. This is
5103 done when replacing anonymous tags with real tag names. */
5106 lookup_tag_reverse (type
, name
)
5110 register struct binding_level
*level
;
5112 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5115 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5117 if (TREE_VALUE (tail
) == type
)
5120 TREE_PURPOSE (tail
) = name
;
5121 return TREE_PURPOSE (tail
);
5128 /* Look up NAME in the NAMESPACE. */
5131 lookup_namespace_name (namespace, name
)
5132 tree
namespace, name
;
5135 tree template_id
= NULL_TREE
;
5137 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5139 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5140 /* This happens for A::B<int> when B is a namespace. */
5142 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5144 /* This happens for A::B where B is a template, and there are no
5145 template arguments. */
5146 cp_error ("invalid use of `%D'", name
);
5147 return error_mark_node
;
5150 namespace = ORIGINAL_NAMESPACE (namespace);
5152 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5155 name
= TREE_OPERAND (name
, 0);
5156 if (TREE_CODE (name
) == OVERLOAD
)
5157 name
= DECL_NAME (OVL_CURRENT (name
));
5158 else if (TREE_CODE_CLASS (TREE_CODE (name
)) == 'd')
5159 name
= DECL_NAME (name
);
5162 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5164 val
= make_node (CPLUS_BINDING
);
5165 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5166 return error_mark_node
;
5168 if (BINDING_VALUE (val
))
5170 val
= BINDING_VALUE (val
);
5174 if (DECL_CLASS_TEMPLATE_P (val
))
5175 val
= lookup_template_class (val
,
5176 TREE_OPERAND (template_id
, 1),
5177 /*in_decl=*/NULL_TREE
,
5178 /*context=*/NULL_TREE
,
5179 /*entering_scope=*/0);
5180 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5181 || TREE_CODE (val
) == OVERLOAD
)
5182 val
= lookup_template_function (val
,
5183 TREE_OPERAND (template_id
, 1));
5186 cp_error ("`%D::%D' is not a template",
5188 return error_mark_node
;
5192 /* If we have a single function from a using decl, pull it out. */
5193 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5194 val
= OVL_FUNCTION (val
);
5198 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5199 return error_mark_node
;
5202 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5204 static unsigned long
5212 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5213 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5218 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5221 typename_compare (k1
, k2
)
5232 d1
= TYPE_NAME (t1
);
5233 d2
= TYPE_NAME (t2
);
5235 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5236 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5237 && ((TREE_TYPE (t1
) != NULL_TREE
)
5238 == (TREE_TYPE (t2
) != NULL_TREE
))
5239 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5240 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5243 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5244 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5245 is non-NULL, this type is being created by the implicit typename
5246 extension, and BASE_TYPE is a type named `t' in some base class of
5247 `T' which depends on template parameters.
5249 Returns the new TYPENAME_TYPE. */
5252 build_typename_type (context
, name
, fullname
, base_type
)
5260 struct hash_entry
* e
;
5262 static struct hash_table ht
;
5264 push_obstacks (&permanent_obstack
, &permanent_obstack
);
5268 static struct hash_table
*h
= &ht
;
5269 if (!hash_table_init (&ht
, &hash_newfunc
, &typename_hash
,
5271 fatal ("virtual memory exhausted");
5272 ggc_add_tree_hash_table_root (&h
, 1);
5275 /* Build the TYPENAME_TYPE. */
5276 t
= make_lang_type (TYPENAME_TYPE
);
5277 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5278 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5279 TREE_TYPE (t
) = base_type
;
5281 /* Build the corresponding TYPE_DECL. */
5282 d
= build_decl (TYPE_DECL
, name
, t
);
5283 TYPE_NAME (TREE_TYPE (d
)) = d
;
5284 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5285 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5286 DECL_ARTIFICIAL (d
) = 1;
5288 /* See if we already have this type. */
5289 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5293 /* Insert the type into the table. */
5294 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5302 make_typename_type (context
, name
)
5307 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
5309 if (!(TYPE_LANG_SPECIFIC (name
)
5310 && (CLASSTYPE_IS_TEMPLATE (name
)
5311 || CLASSTYPE_USE_TEMPLATE (name
))))
5312 name
= TYPE_IDENTIFIER (name
);
5314 /* Create a TEMPLATE_ID_EXPR for the type. */
5315 name
= build_nt (TEMPLATE_ID_EXPR
,
5316 CLASSTYPE_TI_TEMPLATE (name
),
5317 CLASSTYPE_TI_ARGS (name
));
5319 else if (TREE_CODE (name
) == TYPE_DECL
)
5320 name
= DECL_NAME (name
);
5324 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5326 name
= TREE_OPERAND (name
, 0);
5327 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5328 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5330 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5331 my_friendly_abort (2000);
5333 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5335 /* We can get here from typename_sub0 in the explicit_template_type
5336 expansion. Just fail. */
5337 cp_error ("no class template named `%#T' in `%#T'",
5339 return error_mark_node
;
5342 if (! uses_template_parms (context
)
5343 || currently_open_class (context
))
5345 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5347 tree tmpl
= NULL_TREE
;
5348 if (IS_AGGR_TYPE (context
))
5349 tmpl
= lookup_field (context
, name
, 0, 0);
5350 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5352 cp_error ("no class template named `%#T' in `%#T'",
5354 return error_mark_node
;
5357 return lookup_template_class (tmpl
,
5358 TREE_OPERAND (fullname
, 1),
5360 /*entering_scope=*/0);
5366 if (!IS_AGGR_TYPE (context
))
5368 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5369 return error_mark_node
;
5372 t
= lookup_field (context
, name
, 0, 1);
5374 return TREE_TYPE (t
);
5378 /* If the CONTEXT is not a template type, then either the field is
5379 there now or its never going to be. */
5380 if (!uses_template_parms (context
))
5382 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5383 return error_mark_node
;
5387 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5390 /* Select the right _DECL from multiple choices. */
5393 select_decl (binding
, flags
)
5398 val
= BINDING_VALUE (binding
);
5399 if (LOOKUP_NAMESPACES_ONLY (flags
))
5401 /* We are not interested in types. */
5402 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5407 /* If we could have a type and
5408 we have nothing or we need a type and have none. */
5409 if (BINDING_TYPE (binding
)
5410 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5411 && TREE_CODE (val
) != TYPE_DECL
)))
5412 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5413 /* Don't return non-types if we really prefer types. */
5414 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5415 && (TREE_CODE (val
) != TEMPLATE_DECL
5416 || !DECL_CLASS_TEMPLATE_P (val
)))
5422 /* Unscoped lookup of a global: iterate over current namespaces,
5423 considering using-directives. If SPACESP is non-NULL, store a list
5424 of the namespaces we've considered in it. */
5427 unqualified_namespace_lookup (name
, flags
, spacesp
)
5432 tree b
= make_node (CPLUS_BINDING
);
5433 tree initial
= current_decl_namespace();
5434 tree scope
= initial
;
5436 struct binding_level
*level
;
5437 tree val
= NULL_TREE
;
5440 *spacesp
= NULL_TREE
;
5442 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5445 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5446 val
= binding_for_name (name
, scope
);
5448 /* Initialize binding for this context. */
5449 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5450 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5452 /* Add all _DECLs seen through local using-directives. */
5453 for (level
= current_binding_level
;
5454 !level
->namespace_p
;
5455 level
= level
->level_chain
)
5456 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5457 scope
, flags
, spacesp
))
5458 /* Give up because of error. */
5459 return error_mark_node
;
5461 /* Add all _DECLs seen through global using-directives. */
5462 /* XXX local and global using lists should work equally. */
5466 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5467 scope
, flags
, spacesp
))
5468 /* Give up because of error. */
5469 return error_mark_node
;
5470 if (siter
== scope
) break;
5471 siter
= CP_DECL_CONTEXT (siter
);
5474 val
= select_decl (b
, flags
);
5475 if (scope
== global_namespace
)
5481 /* Combine prefer_type and namespaces_only into flags. */
5484 lookup_flags (prefer_type
, namespaces_only
)
5485 int prefer_type
, namespaces_only
;
5487 if (namespaces_only
)
5488 return LOOKUP_PREFER_NAMESPACES
;
5489 if (prefer_type
> 1)
5490 return LOOKUP_PREFER_TYPES
;
5491 if (prefer_type
> 0)
5492 return LOOKUP_PREFER_BOTH
;
5496 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5497 ignore it or not. Subroutine of lookup_name_real. */
5500 qualify_lookup (val
, flags
)
5504 if (val
== NULL_TREE
)
5506 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5508 if ((flags
& LOOKUP_PREFER_TYPES
)
5509 && (TREE_CODE (val
) == TYPE_DECL
5510 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5511 && DECL_CLASS_TEMPLATE_P (val
))))
5513 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5518 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5522 warn_about_implicit_typename_lookup (typename
, binding
)
5526 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5527 tree name
= DECL_NAME (typename
);
5529 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5530 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5531 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5532 && ! (TREE_CODE (binding
) == TYPE_DECL
5533 && same_type_p (TREE_TYPE (binding
), subtype
)))
5535 cp_warning ("lookup of `%D' finds `%#D'",
5537 cp_warning (" instead of `%D' from dependent base class",
5539 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5540 constructor_name (current_class_type
), name
);
5544 /* Look up NAME in the current binding level and its superiors in the
5545 namespace of variables, functions and typedefs. Return a ..._DECL
5546 node of some kind representing its definition if there is only one
5547 such declaration, or return a TREE_LIST with all the overloaded
5548 definitions if there are many, or return 0 if it is undefined.
5550 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5551 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5552 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5553 Otherwise we prefer non-TYPE_DECLs.
5555 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5556 using IDENTIFIER_CLASS_VALUE. */
5559 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5561 int prefer_type
, nonclass
, namespaces_only
;
5564 tree val
= NULL_TREE
;
5566 tree from_obj
= NULL_TREE
;
5568 int val_is_implicit_typename
= 0;
5570 /* Hack: copy flag set by parser, if set. */
5571 if (only_namespace_names
)
5572 namespaces_only
= 1;
5574 if (prefer_type
== -2)
5576 extern int looking_for_typename
;
5577 tree type
= NULL_TREE
;
5580 prefer_type
= looking_for_typename
;
5582 flags
= lookup_flags (prefer_type
, namespaces_only
);
5583 /* If the next thing is '<', class templates are types. */
5584 if (looking_for_template
)
5585 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5587 /* std:: becomes :: for now. */
5588 if (got_scope
== std_node
)
5589 got_scope
= void_type_node
;
5593 else if (got_object
!= error_mark_node
)
5598 if (type
== error_mark_node
)
5599 return error_mark_node
;
5600 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5601 type
= TREE_TYPE (type
);
5604 type
= complete_type (type
);
5606 if (TREE_CODE (type
) == VOID_TYPE
)
5607 type
= global_namespace
;
5608 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5610 val
= make_node (CPLUS_BINDING
);
5611 flags
|= LOOKUP_COMPLAIN
;
5612 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5614 val
= select_decl (val
, flags
);
5616 else if (! IS_AGGR_TYPE (type
)
5617 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5618 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5619 || TREE_CODE (type
) == TYPENAME_TYPE
)
5620 /* Someone else will give an error about this if needed. */
5622 else if (type
== current_class_type
)
5623 val
= IDENTIFIER_CLASS_VALUE (name
);
5625 val
= lookup_member (type
, name
, 0, prefer_type
);
5632 else if (got_object
&& val
)
5637 flags
= lookup_flags (prefer_type
, namespaces_only
);
5638 /* If we're not parsing, we need to complain. */
5639 flags
|= LOOKUP_COMPLAIN
;
5642 /* First, look in non-namespace scopes. */
5644 if (current_class_type
== NULL_TREE
)
5647 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5651 if (!LOCAL_BINDING_P (t
) && nonclass
)
5652 /* We're not looking for class-scoped bindings, so keep going. */
5655 /* If this is the kind of thing we're looking for, we're done. */
5656 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5657 binding
= BINDING_VALUE (t
);
5658 else if ((flags
& LOOKUP_PREFER_TYPES
)
5659 && qualify_lookup (BINDING_TYPE (t
), flags
))
5660 binding
= BINDING_TYPE (t
);
5662 binding
= NULL_TREE
;
5665 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5667 if (val_is_implicit_typename
&& !yylex
)
5668 warn_about_implicit_typename_lookup (val
, binding
);
5670 val_is_implicit_typename
5671 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5672 if (!val_is_implicit_typename
)
5677 /* Now lookup in namespace scopes. */
5678 if (!val
|| val_is_implicit_typename
)
5680 t
= unqualified_namespace_lookup (name
, flags
, 0);
5683 if (val_is_implicit_typename
&& !yylex
)
5684 warn_about_implicit_typename_lookup (val
, t
);
5692 /* This should only warn about types used in qualified-ids. */
5693 if (from_obj
&& from_obj
!= val
)
5695 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5696 && TREE_CODE (val
) == TYPE_DECL
5697 && TREE_TYPE (from_obj
) != TREE_TYPE (val
))
5699 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5700 name
, got_object
, TREE_TYPE (from_obj
));
5701 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
5705 /* We don't change val to from_obj if got_object depends on
5706 template parms because that breaks implicit typename for
5707 destructor calls. */
5708 if (! uses_template_parms (got_object
))
5712 /* If we have a single function from a using decl, pull it out. */
5713 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5714 val
= OVL_FUNCTION (val
);
5723 lookup_name_nonclass (name
)
5726 return lookup_name_real (name
, 0, 1, 0);
5730 lookup_function_nonclass (name
, args
)
5734 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
5738 lookup_name_namespace_only (name
)
5741 /* type-or-namespace, nonclass, namespace_only */
5742 return lookup_name_real (name
, 1, 1, 1);
5746 lookup_name (name
, prefer_type
)
5750 return lookup_name_real (name
, prefer_type
, 0, 0);
5753 /* Similar to `lookup_name' but look only in the innermost non-class
5757 lookup_name_current_level (name
)
5760 struct binding_level
*b
;
5763 b
= current_binding_level
;
5764 while (b
->parm_flag
== 2)
5769 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
5771 /* extern "C" function() */
5772 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
5775 else if (IDENTIFIER_BINDING (name
)
5776 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
5780 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
5781 return IDENTIFIER_VALUE (name
);
5793 /* Like lookup_name_current_level, but for types. */
5796 lookup_type_current_level (name
)
5799 register tree t
= NULL_TREE
;
5801 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
5803 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
5804 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
5806 struct binding_level
*b
= current_binding_level
;
5809 if (purpose_member (name
, b
->type_shadowed
))
5810 return REAL_IDENTIFIER_TYPE_VALUE (name
);
5822 begin_only_namespace_names ()
5824 only_namespace_names
= 1;
5828 end_only_namespace_names ()
5830 only_namespace_names
= 0;
5833 /* Arrange for the user to get a source line number, even when the
5834 compiler is going down in flames, so that she at least has a
5835 chance of working around problems in the compiler. We used to
5836 call error(), but that let the segmentation fault continue
5837 through; now, it's much more passive by asking them to send the
5838 maintainers mail about the problem. */
5842 int sig ATTRIBUTE_UNUSED
;
5844 signal (SIGSEGV
, SIG_DFL
);
5846 signal (SIGIOT
, SIG_DFL
);
5849 signal (SIGILL
, SIG_DFL
);
5852 signal (SIGABRT
, SIG_DFL
);
5855 signal (SIGBUS
, SIG_DFL
);
5857 my_friendly_abort (0);
5860 /* Push the declarations of builtin types into the namespace.
5861 RID_INDEX, if < RID_MAX is the index of the builtin type
5862 in the array RID_POINTERS. NAME is the name used when looking
5863 up the builtin type. TYPE is the _TYPE node for the builtin type. */
5866 record_builtin_type (rid_index
, name
, type
)
5871 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
5872 tree tdecl
= NULL_TREE
;
5874 if ((int) rid_index
< (int) RID_MAX
)
5875 rname
= ridpointers
[(int) rid_index
];
5877 tname
= get_identifier (name
);
5879 TYPE_BUILT_IN (type
) = 1;
5883 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
5884 set_identifier_type_value (tname
, NULL_TREE
);
5885 if ((int) rid_index
< (int) RID_MAX
)
5886 /* Built-in types live in the global namespace. */
5887 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
5889 if (rname
!= NULL_TREE
)
5891 if (tname
!= NULL_TREE
)
5893 set_identifier_type_value (rname
, NULL_TREE
);
5894 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
5898 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
5899 set_identifier_type_value (rname
, NULL_TREE
);
5904 /* Record one of the standard Java types.
5905 * Declare it as having the given NAME.
5906 * If SIZE > 0, it is the size of one of the integral types;
5907 * otherwise it is the negative of the size of one of the other types. */
5910 record_builtin_java_type (name
, size
)
5916 type
= make_signed_type (size
);
5917 else if (size
> -32)
5918 { /* "__java_char" or ""__java_boolean". */
5919 type
= make_unsigned_type (-size
);
5920 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
5923 { /* "__java_float" or ""__java_double". */
5924 type
= make_node (REAL_TYPE
);
5925 TYPE_PRECISION (type
) = - size
;
5928 record_builtin_type (RID_MAX
, name
, type
);
5929 decl
= TYPE_NAME (type
);
5931 /* Suppress generate debug symbol entries for these types,
5932 since for normal C++ they are just clutter.
5933 However, push_lang_context undoes this if extern "Java" is seen. */
5934 DECL_IGNORED_P (decl
) = 1;
5936 TYPE_FOR_JAVA (type
) = 1;
5940 /* Push a type into the namespace so that the back-ends ignore it. */
5943 record_unknown_type (type
, name
)
5947 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
5948 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
5949 DECL_IGNORED_P (decl
) = 1;
5950 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
5951 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
5952 TYPE_ALIGN (type
) = 1;
5953 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
5956 /* Push overloaded decl, in global scope, with one argument so it
5957 can be used as a callback from define_function. */
5960 push_overloaded_decl_1 (x
)
5963 push_overloaded_decl (x
, PUSH_GLOBAL
);
5970 auto_function (name
, type
)
5973 return define_function
5974 (IDENTIFIER_POINTER (name
), type
, push_overloaded_decl_1
,
5975 IDENTIFIER_POINTER (build_decl_overload (name
, TYPE_ARG_TYPES (type
),
5979 /* Create the predefined scalar types of C,
5980 and some nodes representing standard constants (0, 1, (void *)0).
5981 Initialize the global binding level.
5982 Make definitions for built-in primitive functions. */
5985 init_decl_processing ()
5988 int wchar_type_size
;
5989 tree array_domain_type
;
5991 /* Have to make these distinct before we try using them. */
5992 lang_name_cplusplus
= get_identifier ("C++");
5993 lang_name_c
= get_identifier ("C");
5994 lang_name_java
= get_identifier ("Java");
5996 /* Let the back-end now how to save and restore language-specific
5997 per-function globals. */
5998 init_lang_status
= &push_cp_function_context
;
5999 free_lang_status
= &pop_cp_function_context
;
6000 mark_lang_status
= &mark_cp_function_context
;
6006 /* Create the global variables. */
6007 push_to_top_level ();
6009 /* Enter the global namespace. */
6010 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
6011 push_namespace (get_identifier ("::"));
6012 global_namespace
= current_namespace
;
6013 current_lang_name
= NULL_TREE
;
6015 if (flag_strict_prototype
== 2)
6016 flag_strict_prototype
= pedantic
;
6017 if (! flag_permissive
&& ! pedantic
)
6018 flag_pedantic_errors
= 1;
6020 strict_prototypes_lang_c
= flag_strict_prototype
;
6023 current_lang_name
= lang_name_c
;
6025 current_function_decl
= NULL_TREE
;
6026 current_binding_level
= NULL_BINDING_LEVEL
;
6027 free_binding_level
= NULL_BINDING_LEVEL
;
6029 /* Because most segmentation signals can be traced back into user
6030 code, catch them and at least give the user a chance of working
6031 around compiler bugs. */
6032 signal (SIGSEGV
, signal_catch
);
6034 /* We will also catch aborts in the back-end through signal_catch and
6035 give the user a chance to see where the error might be, and to defeat
6036 aborts in the back-end when there have been errors previously in their
6039 signal (SIGIOT
, signal_catch
);
6042 signal (SIGILL
, signal_catch
);
6045 signal (SIGABRT
, signal_catch
);
6048 signal (SIGBUS
, signal_catch
);
6051 gcc_obstack_init (&decl_obstack
);
6053 build_common_tree_nodes (flag_signed_char
);
6055 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6056 TREE_TYPE (error_mark_list
) = error_mark_node
;
6058 /* Make the binding_level structure for global names. */
6060 global_binding_level
= current_binding_level
;
6061 /* The global level is the namespace level of ::. */
6062 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6063 declare_namespace_level ();
6065 this_identifier
= get_identifier (THIS_NAME
);
6066 in_charge_identifier
= get_identifier (IN_CHARGE_NAME
);
6067 ctor_identifier
= get_identifier (CTOR_NAME
);
6068 dtor_identifier
= get_identifier (DTOR_NAME
);
6069 pfn_identifier
= get_identifier (VTABLE_PFN_NAME
);
6070 index_identifier
= get_identifier (VTABLE_INDEX_NAME
);
6071 delta_identifier
= get_identifier (VTABLE_DELTA_NAME
);
6072 delta2_identifier
= get_identifier (VTABLE_DELTA2_NAME
);
6073 pfn_or_delta2_identifier
= get_identifier ("__pfn_or_delta2");
6075 /* Define `int' and `char' first so that dbx will output them first. */
6076 record_builtin_type (RID_INT
, NULL_PTR
, integer_type_node
);
6077 record_builtin_type (RID_CHAR
, "char", char_type_node
);
6079 /* `signed' is the same as `int' */
6080 record_builtin_type (RID_SIGNED
, NULL_PTR
, integer_type_node
);
6081 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
6082 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
6083 record_builtin_type (RID_MAX
, "long unsigned int", long_unsigned_type_node
);
6084 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
6085 record_builtin_type (RID_MAX
, "long long int", long_long_integer_type_node
);
6086 record_builtin_type (RID_MAX
, "long long unsigned int",
6087 long_long_unsigned_type_node
);
6088 record_builtin_type (RID_MAX
, "long long unsigned",
6089 long_long_unsigned_type_node
);
6090 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
6091 record_builtin_type (RID_MAX
, "short unsigned int", short_unsigned_type_node
);
6092 record_builtin_type (RID_MAX
, "unsigned short", short_unsigned_type_node
);
6095 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE
)));
6097 /* Define both `signed char' and `unsigned char'. */
6098 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
6099 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
6101 /* `unsigned long' is the standard type for sizeof.
6102 Note that stddef.h uses `unsigned long',
6103 and this must agree, even if long and int are the same size. */
6105 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE
))));
6107 /* Create the widest literal types. */
6108 widest_integer_literal_type_node
= make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
6109 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6110 widest_integer_literal_type_node
));
6112 widest_unsigned_literal_type_node
= make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
6113 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6114 widest_unsigned_literal_type_node
));
6116 /* These are types that type_for_size and type_for_mode use. */
6117 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intQI_type_node
));
6118 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intHI_type_node
));
6119 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intSI_type_node
));
6120 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intDI_type_node
));
6121 #if HOST_BITS_PER_WIDE_INT >= 64
6122 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__int128_t"), intTI_type_node
));
6124 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intQI_type_node
));
6125 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intHI_type_node
));
6126 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intSI_type_node
));
6127 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intDI_type_node
));
6128 #if HOST_BITS_PER_WIDE_INT >= 64
6129 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__uint128_t"), unsigned_intTI_type_node
));
6132 build_common_tree_nodes_2 (flag_short_double
);
6134 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6135 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6136 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6137 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6138 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6139 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6140 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6141 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6143 integer_two_node
= build_int_2 (2, 0);
6144 TREE_TYPE (integer_two_node
) = integer_type_node
;
6145 integer_three_node
= build_int_2 (3, 0);
6146 TREE_TYPE (integer_three_node
) = integer_type_node
;
6148 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6149 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6150 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6151 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6152 TYPE_PRECISION (boolean_type_node
) = 1;
6153 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6154 boolean_false_node
= build_int_2 (0, 0);
6155 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6156 boolean_true_node
= build_int_2 (1, 0);
6157 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6159 signed_size_zero_node
= build_int_2 (0, 0); record_builtin_type (RID_FLOAT
, NULL_PTR
, float_type_node
);
6160 record_builtin_type (RID_DOUBLE
, NULL_PTR
, double_type_node
);
6161 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
6163 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex int"),
6164 complex_integer_type_node
));
6165 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex float"),
6166 complex_float_type_node
));
6167 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex double"),
6168 complex_double_type_node
));
6169 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
6170 complex_long_double_type_node
));
6172 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6174 record_builtin_type (RID_VOID
, NULL_PTR
, void_type_node
);
6175 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
6176 TREE_PARMLIST (void_list_node
) = 1;
6178 /* Used for expressions that do nothing, but are not errors. */
6179 void_zero_node
= build_int_2 (0, 0);
6180 TREE_TYPE (void_zero_node
) = void_type_node
;
6182 string_type_node
= build_pointer_type (char_type_node
);
6183 const_string_type_node
6184 = build_pointer_type (build_qualified_type (char_type_node
,
6186 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6188 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
6191 /* Make a type to be the domain of a few array types
6192 whose domains don't really matter.
6193 200 is small enough that it always fits in size_t
6194 and large enough that it can hold most function names for the
6195 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
6196 array_domain_type
= build_index_type (build_int_2 (200, 0));
6198 /* Make a type for arrays of characters.
6199 With luck nothing will ever really depend on the length of this
6201 char_array_type_node
6202 = build_array_type (char_type_node
, array_domain_type
);
6203 /* Likewise for arrays of ints. */
6205 = build_array_type (integer_type_node
, array_domain_type
);
6207 /* This is just some anonymous class type. Nobody should ever
6208 need to look inside this envelope. */
6209 class_star_type_node
= build_pointer_type (make_lang_type (RECORD_TYPE
));
6211 if (flag_huge_objects
)
6212 delta_type_node
= long_integer_type_node
;
6214 delta_type_node
= short_integer_type_node
;
6216 default_function_type
6217 = build_function_type (integer_type_node
, NULL_TREE
);
6219 ptr_type_node
= build_pointer_type (void_type_node
);
6221 = build_pointer_type (build_qualified_type (void_type_node
,
6223 c_common_nodes_and_builtins (1, flag_no_builtin
, flag_no_nonansi_builtin
);
6226 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6228 /* C++ extensions */
6230 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6231 record_unknown_type (unknown_type_node
, "unknown type");
6233 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6234 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6236 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6238 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6240 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6241 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6243 /* This is special for C++ so functions can be overloaded. */
6245 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (WCHAR_TYPE
)));
6246 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
6247 signed_wchar_type_node
= make_signed_type (wchar_type_size
);
6248 unsigned_wchar_type_node
= make_unsigned_type (wchar_type_size
);
6250 = TREE_UNSIGNED (wchar_type_node
)
6251 ? unsigned_wchar_type_node
6252 : signed_wchar_type_node
;
6253 record_builtin_type (RID_WCHAR
, "__wchar_t", wchar_type_node
);
6255 /* Artificial declaration of wchar_t -- can be bashed */
6256 wchar_decl_node
= build_decl (TYPE_DECL
, get_identifier ("wchar_t"),
6258 pushdecl (wchar_decl_node
);
6260 /* This is for wide string constants. */
6261 wchar_array_type_node
6262 = build_array_type (wchar_type_node
, array_domain_type
);
6264 if (flag_vtable_thunks
)
6266 /* Make sure we get a unique function type, so we can give
6267 its pointer type a name. (This wins for gdb.) */
6268 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6269 TREE_TYPE (vfunc_type
) = integer_type_node
;
6270 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6271 layout_type (vfunc_type
);
6273 vtable_entry_type
= build_pointer_type (vfunc_type
);
6277 vtable_entry_type
= make_lang_type (RECORD_TYPE
);
6278 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
6280 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
6282 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_identifier
,
6284 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6287 /* Make this part of an invisible union. */
6288 fields
[3] = copy_node (fields
[2]);
6289 TREE_TYPE (fields
[3]) = delta_type_node
;
6290 DECL_NAME (fields
[3]) = delta2_identifier
;
6291 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6292 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6293 TREE_UNSIGNED (fields
[3]) = 0;
6294 TREE_CHAIN (fields
[2]) = fields
[3];
6295 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6298 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6301 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6302 layout_type (vtbl_type_node
);
6303 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6304 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6305 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6306 layout_type (vtbl_ptr_type_node
);
6307 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6309 std_node
= build_decl (NAMESPACE_DECL
,
6310 get_identifier (flag_honor_std
? "fake std":"std"),
6312 pushdecl (std_node
);
6314 global_type_node
= make_node (LANG_TYPE
);
6315 record_unknown_type (global_type_node
, "global type");
6318 current_lang_name
= lang_name_cplusplus
;
6321 tree bad_alloc_type_node
, newtype
, deltype
;
6323 push_namespace (get_identifier ("std"));
6324 bad_alloc_type_node
= xref_tag
6325 (class_type_node
, get_identifier ("bad_alloc"), 1);
6328 newtype
= build_exception_variant
6329 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6330 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6331 auto_function (ansi_opname
[(int) NEW_EXPR
], newtype
);
6332 auto_function (ansi_opname
[(int) VEC_NEW_EXPR
], newtype
);
6333 global_delete_fndecl
= auto_function (ansi_opname
[(int) DELETE_EXPR
],
6335 auto_function (ansi_opname
[(int) VEC_DELETE_EXPR
], deltype
);
6339 = define_function ("__pure_virtual", void_ftype
, 0, 0);
6341 /* Perform other language dependent initializations. */
6342 init_class_processing ();
6343 init_init_processing ();
6344 init_search_processing ();
6346 init_rtti_processing ();
6348 if (flag_exceptions
)
6349 init_exception_processing ();
6352 flag_inline_functions
= 0;
6355 if (! supports_one_only ())
6358 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6359 declare_function_name ();
6361 /* Prepare to check format strings against argument lists. */
6362 init_function_format_info ();
6364 /* Show we use EH for cleanups. */
6365 using_eh_for_cleanups ();
6367 print_error_function
= lang_print_error_function
;
6368 lang_get_alias_set
= &c_get_alias_set
;
6369 valid_lang_attribute
= cp_valid_lang_attribute
;
6371 /* Maintain consistency. Perhaps we should just complain if they
6372 say -fwritable-strings? */
6373 if (flag_writable_strings
)
6374 flag_const_strings
= 0;
6376 /* Add GC roots for all of our global variables. */
6377 ggc_add_tree_root (c_global_trees
, sizeof c_global_trees
/ sizeof(tree
));
6378 ggc_add_tree_root (cp_global_trees
, sizeof cp_global_trees
/ sizeof(tree
));
6379 ggc_add_tree_root (&integer_three_node
, 1);
6380 ggc_add_tree_root (&integer_two_node
, 1);
6381 ggc_add_tree_root (&signed_size_zero_node
, 1);
6382 ggc_add_tree_root (&size_one_node
, 1);
6383 ggc_add_tree_root (&size_zero_node
, 1);
6384 ggc_add_root (&global_binding_level
, 1, sizeof global_binding_level
,
6385 mark_binding_level
);
6386 ggc_add_root (&scope_chain
, 1, sizeof scope_chain
, &mark_saved_scope
);
6387 ggc_add_tree_root (&static_ctors
, 1);
6388 ggc_add_tree_root (&static_dtors
, 1);
6389 ggc_add_tree_root (&lastiddecl
, 1);
6391 ggc_add_tree_root (&enum_next_value
, 1);
6392 ggc_add_tree_root (&last_function_parm_tags
, 1);
6393 ggc_add_tree_root (¤t_function_return_value
, 1);
6394 ggc_add_tree_root (¤t_function_parms
, 1);
6395 ggc_add_tree_root (¤t_function_parm_tags
, 1);
6396 ggc_add_tree_root (&last_function_parms
, 1);
6397 ggc_add_tree_root (&error_mark_list
, 1);
6399 ggc_add_tree_root (&global_namespace
, 1);
6400 ggc_add_tree_root (&global_type_node
, 1);
6401 ggc_add_tree_root (&anonymous_namespace_name
, 1);
6403 ggc_add_tree_root (&got_object
, 1);
6404 ggc_add_tree_root (&got_scope
, 1);
6406 ggc_add_tree_root (¤t_lang_name
, 1);
6407 ggc_add_tree_root (&static_aggregates
, 1);
6410 /* Function to print any language-specific context for an error message. */
6413 lang_print_error_function (file
)
6416 default_print_error_function (file
);
6417 maybe_print_template_context ();
6420 /* Make a definition for a builtin function named NAME and whose data type
6421 is TYPE. TYPE should be a function type with argument types.
6423 If LIBRARY_NAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6424 the name to be called if we can't opencode the function. */
6427 define_function (name
, type
, pfn
, library_name
)
6430 void (*pfn
) PROTO((tree
));
6431 const char *library_name
;
6433 tree decl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), type
);
6434 DECL_EXTERNAL (decl
) = 1;
6435 TREE_PUBLIC (decl
) = 1;
6436 DECL_ARTIFICIAL (decl
) = 1;
6438 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6439 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
6441 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6442 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6443 function in the namespace. */
6444 if (pfn
) (*pfn
) (decl
);
6446 DECL_ASSEMBLER_NAME (decl
) = get_identifier (library_name
);
6447 make_function_rtl (decl
);
6452 /* Wrapper around define_function, for the benefit of
6453 c_common_nodes_and_builtins.
6454 FUNCTION_CODE tells later passes how to compile calls to this function.
6455 See tree.h for its possible values. */
6458 builtin_function (name
, type
, code
, libname
)
6461 enum built_in_function code
;
6462 const char *libname
;
6464 tree decl
= define_function (name
, type
, (void (*) PROTO((tree
)))pushdecl
,
6466 if (code
!= NOT_BUILT_IN
)
6468 DECL_BUILT_IN (decl
) = 1;
6469 DECL_FUNCTION_CODE (decl
) = code
;
6474 /* When we call finish_struct for an anonymous union, we create
6475 default copy constructors and such. But, an anonymous union
6476 shouldn't have such things; this function undoes the damage to the
6477 anonymous union type T.
6479 (The reason that we create the synthesized methods is that we don't
6480 distinguish `union { int i; }' from `typedef union { int i; } U'.
6481 The first is an anonymous union; the second is just an ordinary
6485 fixup_anonymous_aggr (t
)
6490 /* Wipe out memory of synthesized methods */
6491 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6492 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6493 TYPE_HAS_INIT_REF (t
) = 0;
6494 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6495 TYPE_HAS_ASSIGN_REF (t
) = 0;
6496 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6498 /* Splice the implicitly generated functions out of the TYPE_METHODS
6500 q
= &TYPE_METHODS (t
);
6503 if (DECL_ARTIFICIAL (*q
))
6504 *q
= TREE_CHAIN (*q
);
6506 q
= &TREE_CHAIN (*q
);
6509 /* ANSI C++ June 5 1992 WP 9.5.3. Anonymous unions may not have
6510 function members. */
6511 if (TYPE_METHODS (t
))
6512 error ("an anonymous union cannot have function members");
6515 /* Make sure that a declaration with no declarator is well-formed, i.e.
6516 just defines a tagged type or anonymous union.
6518 Returns the type defined, if any. */
6521 check_tag_decl (declspecs
)
6525 tree ob_modifier
= NULL_TREE
;
6527 register tree t
= NULL_TREE
;
6529 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6531 register tree value
= TREE_VALUE (link
);
6537 if (IS_AGGR_TYPE (value
) || TREE_CODE (value
) == ENUMERAL_TYPE
)
6539 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6543 else if (value
== ridpointers
[(int) RID_FRIEND
])
6545 if (current_class_type
== NULL_TREE
6546 || current_scope () != current_class_type
)
6547 ob_modifier
= value
;
6549 else if (value
== ridpointers
[(int) RID_STATIC
]
6550 || value
== ridpointers
[(int) RID_EXTERN
]
6551 || value
== ridpointers
[(int) RID_AUTO
]
6552 || value
== ridpointers
[(int) RID_REGISTER
]
6553 || value
== ridpointers
[(int) RID_INLINE
]
6554 || value
== ridpointers
[(int) RID_VIRTUAL
]
6555 || value
== ridpointers
[(int) RID_CONST
]
6556 || value
== ridpointers
[(int) RID_VOLATILE
]
6557 || value
== ridpointers
[(int) RID_EXPLICIT
])
6558 ob_modifier
= value
;
6562 error ("multiple types in one declaration");
6564 /* Inside a class, we might be in a friend or access declaration.
6565 Until we have a good way of detecting the latter, don't warn. */
6566 if (t
== NULL_TREE
&& ! current_class_type
)
6567 pedwarn ("declaration does not declare anything");
6569 /* Check for an anonymous union. We're careful
6570 accessing TYPE_IDENTIFIER because some built-in types, like
6571 pointer-to-member types, do not have TYPE_NAME. */
6572 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
6574 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
6576 /* Anonymous unions are objects, so they can have specifiers. */;
6577 SET_ANON_AGGR_TYPE_P (t
);
6579 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
6580 pedwarn ("ISO C++ prohibits anonymous structs");
6583 else if (ob_modifier
)
6585 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
6586 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
6587 cp_error ("`%D' can only be specified for functions", ob_modifier
);
6588 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
6589 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
6590 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
6591 cp_error ("`%D' can only be specified for constructors",
6594 cp_error ("`%D' can only be specified for objects and functions",
6601 /* Called when a declaration is seen that contains no names to declare.
6602 If its type is a reference to a structure, union or enum inherited
6603 from a containing scope, shadow that tag name for the current scope
6604 with a forward reference.
6605 If its type defines a new named structure or union
6606 or defines an enum, it is valid but we need not do anything here.
6607 Otherwise, it is an error.
6609 C++: may have to grok the declspecs to learn about static,
6610 complain for anonymous unions. */
6613 shadow_tag (declspecs
)
6616 tree t
= check_tag_decl (declspecs
);
6619 maybe_process_partial_specialization (t
);
6621 /* This is where the variables in an anonymous union are
6622 declared. An anonymous union declaration looks like:
6624 because there is no declarator after the union, the parser
6625 sends that declaration here. */
6626 if (t
&& ANON_AGGR_TYPE_P (t
))
6628 fixup_anonymous_aggr (t
);
6630 if (TYPE_FIELDS (t
))
6632 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
6634 finish_anon_union (decl
);
6639 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6642 groktypename (typename
)
6645 if (TREE_CODE (typename
) != TREE_LIST
)
6647 return grokdeclarator (TREE_VALUE (typename
),
6648 TREE_PURPOSE (typename
),
6649 TYPENAME
, 0, NULL_TREE
);
6652 /* Decode a declarator in an ordinary declaration or data definition.
6653 This is called as soon as the type information and variable name
6654 have been parsed, before parsing the initializer if any.
6655 Here we create the ..._DECL node, fill in its type,
6656 and put it on the list of decls for the current context.
6657 The ..._DECL node is returned as the value.
6659 Exception: for arrays where the length is not specified,
6660 the type is left null, to be filled in by `cp_finish_decl'.
6662 Function definitions do not come here; they go to start_function
6663 instead. However, external and forward declarations of functions
6664 do go through here. Structure field declarations are done by
6665 grokfield and not through here. */
6667 /* Set this to zero to debug not using the temporary obstack
6668 to parse initializers. */
6669 int debug_temp_inits
= 1;
6672 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
6673 tree declarator
, declspecs
;
6675 tree attributes
, prefix_attributes
;
6678 register tree type
, tem
;
6680 extern int have_extern_spec
;
6681 extern int used_extern_spec
;
6685 /* See code below that used this. */
6686 int init_written
= initialized
;
6689 /* This should only be done once on the top most decl. */
6690 if (have_extern_spec
&& !used_extern_spec
)
6692 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"),
6694 used_extern_spec
= 1;
6697 if (attributes
|| prefix_attributes
)
6698 attrlist
= build_scratch_list (attributes
, prefix_attributes
);
6700 attrlist
= NULL_TREE
;
6702 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
6705 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
6708 type
= TREE_TYPE (decl
);
6710 if (type
== error_mark_node
)
6714 = (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
6715 ? DECL_CLASS_CONTEXT (decl
)
6716 : DECL_CONTEXT (decl
);
6718 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
6719 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
6721 /* When parsing the initializer, lookup should use the object's
6723 push_decl_namespace (context
);
6726 /* We are only interested in class contexts, later. */
6727 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
6728 context
= NULL_TREE
;
6731 /* Is it valid for this decl to have an initializer at all?
6732 If not, set INITIALIZED to zero, which will indirectly
6733 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6734 switch (TREE_CODE (decl
))
6737 /* typedef foo = bar means give foo the same type as bar.
6738 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
6739 Any other case of an initialization in a TYPE_DECL is an error. */
6740 if (pedantic
|| list_length (declspecs
) > 1)
6742 cp_error ("typedef `%D' is initialized", decl
);
6748 cp_error ("function `%#D' is initialized like a variable", decl
);
6758 if (! toplevel_bindings_p ()
6759 && DECL_EXTERNAL (decl
))
6760 cp_warning ("declaration of `%#D' has `extern' and is initialized",
6762 DECL_EXTERNAL (decl
) = 0;
6763 if (toplevel_bindings_p ())
6764 TREE_STATIC (decl
) = 1;
6766 /* Tell `pushdecl' this is an initialized decl
6767 even though we don't yet have the initializer expression.
6768 Also tell `cp_finish_decl' it may store the real initializer. */
6769 DECL_INITIAL (decl
) = error_mark_node
;
6772 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
6773 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
6776 /* Set attributes here so if duplicate decl, will have proper attributes. */
6777 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
6779 if (context
&& TYPE_SIZE (complete_type (context
)) != NULL_TREE
)
6781 push_nested_class (context
, 2);
6783 if (TREE_CODE (decl
) == VAR_DECL
)
6785 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
6786 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
6787 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
6790 if (DECL_CONTEXT (field
) != context
)
6792 cp_pedwarn ("ANSI C++ does not permit `%T::%D' to be defined as `%T::%D'",
6793 DECL_CONTEXT (field
), DECL_NAME (decl
),
6794 context
, DECL_NAME (decl
));
6795 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
6797 /* Static data member are tricky; an in-class initialization
6798 still doesn't provide a definition, so the in-class
6799 declaration will have DECL_EXTERNAL set, but will have an
6800 initialization. Thus, duplicate_decls won't warn
6801 about this situation, and so we check here. */
6802 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
6803 cp_error ("duplicate initialization of %D", decl
);
6804 if (duplicate_decls (decl
, field
))
6810 tree field
= check_classfn (context
, decl
);
6811 if (field
&& duplicate_decls (decl
, field
))
6815 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
6816 DECL_IN_AGGR_P (decl
) = 0;
6817 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
6818 || CLASSTYPE_USE_TEMPLATE (context
))
6820 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
6821 /* [temp.expl.spec] An explicit specialization of a static data
6822 member of a template is a definition if the declaration
6823 includes an initializer; otherwise, it is a declaration.
6825 We check for processing_specialization so this only applies
6826 to the new specialization syntax. */
6827 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
6828 DECL_EXTERNAL (decl
) = 1;
6831 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
6832 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
6836 /* Enter this declaration into the symbol table. */
6837 tem
= maybe_push_decl (decl
);
6839 if (processing_template_decl
)
6841 if (at_function_scope_p ())
6842 push_permanent_obstack ();
6843 tem
= push_template_decl (tem
);
6844 if (at_function_scope_p ())
6849 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
6850 /* Tell the back-end to use or not use .common as appropriate. If we say
6851 -fconserve-space, we want this to save .data space, at the expense of
6852 wrong semantics. If we say -fno-conserve-space, we want this to
6853 produce errors about redefs; to do this we force variables into the
6855 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
6858 if (! processing_template_decl
)
6861 /* Corresponding pop_obstacks is done in `cp_finish_decl'. */
6862 push_obstacks_nochange ();
6871 tree type
= TREE_TYPE (decl
);
6872 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
6874 if (type
== error_mark_node
)
6877 /* If this type of object needs a cleanup, and control may
6878 jump past it, make a new binding level so that it is cleaned
6879 up only when it is initialized first. */
6880 if (TYPE_NEEDS_DESTRUCTOR (type
)
6881 && current_binding_level
->more_cleanups_ok
== 0)
6882 pushlevel_temporary (1);
6885 /* Is it valid for this decl to have an initializer at all?
6886 If not, set INITIALIZED to zero, which will indirectly
6887 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6889 /* Don't allow initializations for incomplete types except for
6890 arrays which might be completed by the initialization. */
6891 if (TYPE_SIZE (complete_type (type
)) != NULL_TREE
)
6892 ; /* A complete type is ok. */
6893 else if (TREE_CODE (type
) != ARRAY_TYPE
)
6895 cp_error ("variable `%#D' has initializer but incomplete type",
6898 type
= TREE_TYPE (decl
) = error_mark_node
;
6900 else if (TYPE_SIZE (complete_type (TREE_TYPE (type
))) == NULL_TREE
)
6902 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
6903 cp_error ("elements of array `%#D' have incomplete type", decl
);
6904 /* else we already gave an error in start_decl. */
6910 && TREE_CODE (decl
) != TYPE_DECL
6911 && TREE_CODE (decl
) != TEMPLATE_DECL
6912 && IS_AGGR_TYPE (type
) && ! DECL_EXTERNAL (decl
))
6914 if ((! processing_template_decl
|| ! uses_template_parms (type
))
6915 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
6917 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
6919 /* Change the type so that assemble_variable will give
6920 DECL an rtl we can live with: (mem (const_int 0)). */
6921 type
= TREE_TYPE (decl
) = error_mark_node
;
6925 /* If any base type in the hierarchy of TYPE needs a constructor,
6926 then we set initialized to 1. This way any nodes which are
6927 created for the purposes of initializing this aggregate
6928 will live as long as it does. This is necessary for global
6929 aggregates which do not have their initializers processed until
6930 the end of the file. */
6931 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
6936 DECL_INITIAL (decl
) = NULL_TREE
;
6939 /* Handle initialization of references.
6940 These three arguments are from `cp_finish_decl', and have the
6941 same meaning here that they do there.
6943 Quotes on semantics can be found in ARM 8.4.3. */
6946 grok_reference_init (decl
, type
, init
)
6947 tree decl
, type
, init
;
6951 if (init
== NULL_TREE
)
6953 if ((DECL_LANG_SPECIFIC (decl
) == 0
6954 || DECL_IN_AGGR_P (decl
) == 0)
6955 && ! DECL_THIS_EXTERN (decl
))
6956 cp_error ("`%D' declared as reference but not initialized", decl
);
6960 if (init
== error_mark_node
)
6963 if (TREE_CODE (init
) == CONSTRUCTOR
)
6965 cp_error ("ANSI C++ forbids use of initializer list to initialize reference `%D'", decl
);
6969 if (TREE_CODE (init
) == TREE_LIST
)
6970 init
= build_compound_expr (init
);
6972 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
6973 init
= convert_from_reference (init
);
6975 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
6976 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
6978 /* Note: default conversion is only called in very special cases. */
6979 init
= default_conversion (init
);
6982 /* Convert INIT to the reference type TYPE. This may involve the
6983 creation of a temporary, whose lifetime must be the same as that
6984 of the reference. If so, a DECL_STMT for the temporary will be
6985 added just after the DECL_STMT for DECL. That's why we don't set
6986 DECL_INITIAL for local references (instead assigning to them
6987 explicitly); we need to allow the temporary to be initialized
6989 tmp
= convert_to_reference
6990 (type
, init
, CONV_IMPLICIT
,
6991 LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
, decl
);
6993 if (tmp
== error_mark_node
)
6995 else if (tmp
!= NULL_TREE
)
6998 tmp
= save_expr (tmp
);
6999 if (building_stmt_tree ())
7001 /* Initialize the declaration. */
7002 tmp
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, tmp
);
7003 /* Setting TREE_SIDE_EFFECTS prevents expand_expr from
7004 omitting this expression entirely. */
7005 TREE_SIDE_EFFECTS (tmp
) = 1;
7006 finish_expr_stmt (tmp
);
7009 DECL_INITIAL (decl
) = tmp
;
7013 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7017 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
7019 expand_static_init (decl
, DECL_INITIAL (decl
));
7020 DECL_INITIAL (decl
) = NULL_TREE
;
7025 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7026 mucking with forces it does not comprehend (i.e. initialization with a
7027 constructor). If we are at global scope and won't go into COMMON, fill
7028 it in with a dummy CONSTRUCTOR to force the variable into .data;
7029 otherwise we can use error_mark_node. */
7032 obscure_complex_init (decl
, init
)
7035 if (! flag_no_inline
&& TREE_STATIC (decl
))
7037 if (extract_init (decl
, init
))
7041 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7042 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7043 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7047 DECL_INITIAL (decl
) = error_mark_node
;
7052 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7053 array until we finish parsing the initializer. If that's the
7054 situation we're in, update DECL accordingly. */
7057 maybe_deduce_size_from_array_init (decl
, init
)
7061 tree type
= TREE_TYPE (decl
);
7063 if (TREE_CODE (type
) == ARRAY_TYPE
7064 && TYPE_DOMAIN (type
) == NULL_TREE
7065 && TREE_CODE (decl
) != TYPE_DECL
)
7068 = (TREE_STATIC (decl
)
7069 /* Even if pedantic, an external linkage array
7070 may have incomplete type at first. */
7071 ? pedantic
&& ! DECL_EXTERNAL (decl
)
7072 : !DECL_EXTERNAL (decl
));
7073 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7074 int failure
= complete_array_type (type
, initializer
, do_default
);
7077 cp_error ("initializer fails to determine size of `%D'", decl
);
7082 cp_error ("array size missing in `%D'", decl
);
7083 /* If a `static' var's size isn't known, make it extern as
7084 well as static, so it does not get allocated. If it's not
7085 `static', then don't mark it extern; finish_incomplete_decl
7086 will give it a default size and it will get allocated. */
7087 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7088 DECL_EXTERNAL (decl
) = 1;
7091 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7092 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7094 cp_error ("zero-size array `%D'", decl
);
7096 layout_decl (decl
, 0);
7100 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7101 any appropriate error messages regarding the layout. */
7104 layout_var_decl (decl
)
7107 tree type
= TREE_TYPE (decl
);
7108 tree ttype
= target_type (type
);
7110 /* If we haven't already layed out this declaration, do so now.
7111 Note that we must not call complete type for an external object
7112 because it's type might involve templates that we are not
7113 supposed to isntantiate yet. (And it's perfectly legal to say
7114 `extern X x' for some incomplete type `X'.) */
7115 if (!DECL_EXTERNAL (decl
))
7116 complete_type (type
);
7117 if (!DECL_SIZE (decl
)&& TYPE_SIZE (type
))
7118 layout_decl (decl
, 0);
7120 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7122 /* An automatic variable with an incomplete type: that is an error.
7123 Don't talk about array types here, since we took care of that
7124 message in grokdeclarator. */
7125 cp_error ("storage size of `%D' isn't known", decl
);
7126 TREE_TYPE (decl
) = error_mark_node
;
7128 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7129 /* Let debugger know it should output info for this type. */
7130 note_debug_info_needed (ttype
);
7132 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7133 note_debug_info_needed (DECL_CONTEXT (decl
));
7135 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7136 && DECL_SIZE (decl
) != NULL_TREE
7137 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7139 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7140 constant_expression_warning (DECL_SIZE (decl
));
7142 cp_error ("storage size of `%D' isn't constant", decl
);
7146 /* If a local static variable is declared in an inline function, or if
7147 we have a weak definition, we must endeavor to create only one
7148 instance of the variable at link-time. */
7151 maybe_commonize_var (decl
)
7154 /* Static data in a function with comdat linkage also has comdat
7156 if (TREE_STATIC (decl
)
7157 /* Don't mess with __FUNCTION__. */
7158 && ! TREE_ASM_WRITTEN (decl
)
7159 && current_function_decl
7160 && DECL_CONTEXT (decl
) == current_function_decl
7161 && (DECL_THIS_INLINE (current_function_decl
)
7162 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7163 && TREE_PUBLIC (current_function_decl
))
7165 /* Rather than try to get this right with inlining, we suppress
7166 inlining of such functions. */
7167 current_function_cannot_inline
7168 = "function with static variable cannot be inline";
7170 /* If flag_weak, we don't need to mess with this, as we can just
7171 make the function weak, and let it refer to its unique local
7172 copy. This works because we don't allow the function to be
7176 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7178 TREE_PUBLIC (decl
) = 1;
7179 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7181 else if (DECL_INITIAL (decl
) == NULL_TREE
7182 || DECL_INITIAL (decl
) == error_mark_node
)
7184 TREE_PUBLIC (decl
) = 1;
7185 DECL_COMMON (decl
) = 1;
7187 /* else we lose. We can only do this if we can use common,
7188 which we can't if it has been initialized. */
7190 if (TREE_PUBLIC (decl
))
7191 DECL_ASSEMBLER_NAME (decl
)
7192 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7193 else if (! DECL_ARTIFICIAL (decl
))
7195 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7196 cp_warning_at (" you can work around this by removing the initializer", decl
);
7200 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7201 /* Set it up again; we might have set DECL_INITIAL since the last
7203 comdat_linkage (decl
);
7206 /* Issue an error message if DECL is an uninitialized const variable. */
7209 check_for_uninitialized_const_var (decl
)
7212 tree type
= TREE_TYPE (decl
);
7214 /* ``Unless explicitly declared extern, a const object does not have
7215 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7217 if (TREE_CODE (decl
) == VAR_DECL
7218 && TREE_CODE (type
) != REFERENCE_TYPE
7219 && CP_TYPE_CONST_P (type
)
7220 && !TYPE_NEEDS_CONSTRUCTING (type
)
7221 && !DECL_INITIAL (decl
))
7222 cp_error ("uninitialized const `%D'", decl
);
7225 /* Verify INIT (the initializer for DECL), and record the
7226 initialization in DECL_INITIAL, if appropriate. Returns a new
7230 check_initializer (decl
, init
)
7236 if (TREE_CODE (decl
) == FIELD_DECL
)
7239 type
= TREE_TYPE (decl
);
7241 /* If `start_decl' didn't like having an initialization, ignore it now. */
7242 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7245 /* Check the initializer. */
7248 /* Things that are going to be initialized need to have complete
7250 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7252 if (type
== error_mark_node
)
7253 /* We will have already complained. */
7255 else if (TYPE_SIZE (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7257 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7260 else if (TREE_CODE (type
) == ARRAY_TYPE
7261 && !TYPE_SIZE (TREE_TYPE (type
)))
7263 cp_error ("elements of array `%#D' have incomplete type", decl
);
7266 else if (!TYPE_SIZE (type
))
7268 cp_error ("`%D' has incomplete type", decl
);
7269 TREE_TYPE (decl
) = error_mark_node
;
7274 if (TREE_CODE (decl
) == CONST_DECL
)
7276 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7278 DECL_INITIAL (decl
) = init
;
7280 /* This will keep us from needing to worry about our obstacks. */
7281 my_friendly_assert (init
!= NULL_TREE
, 149);
7284 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7286 if (TREE_STATIC (decl
))
7287 make_decl_rtl (decl
, NULL_PTR
, toplevel_bindings_p ());
7288 grok_reference_init (decl
, type
, init
);
7293 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7295 if (TREE_CODE (type
) == ARRAY_TYPE
)
7296 init
= digest_init (type
, init
, (tree
*) 0);
7297 else if (TREE_CODE (init
) == CONSTRUCTOR
7298 && TREE_HAS_CONSTRUCTOR (init
))
7300 if (TYPE_NON_AGGREGATE_CLASS (type
))
7302 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7304 init
= error_mark_node
;
7307 goto dont_use_constructor
;
7312 dont_use_constructor
:
7313 if (TREE_CODE (init
) != TREE_VEC
)
7314 init
= store_init_value (decl
, init
);
7318 /* We must hide the initializer so that expand_decl
7319 won't try to do something it does not understand. */
7320 init
= obscure_complex_init (decl
, init
);
7322 else if (DECL_EXTERNAL (decl
))
7324 else if (TREE_CODE_CLASS (TREE_CODE (type
)) == 't'
7325 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7327 tree core_type
= strip_array_types (type
);
7329 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7331 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7332 cp_error ("structure `%D' with uninitialized const members", decl
);
7333 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7334 cp_error ("structure `%D' with uninitialized reference members",
7338 check_for_uninitialized_const_var (decl
);
7340 if (TYPE_SIZE (type
) != NULL_TREE
7341 && TYPE_NEEDS_CONSTRUCTING (type
))
7342 init
= obscure_complex_init (decl
, NULL_TREE
);
7346 check_for_uninitialized_const_var (decl
);
7351 /* If DECL is not a local variable, give it RTL. */
7354 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
7357 const char *asmspec
;
7362 type
= TREE_TYPE (decl
);
7363 toplev
= toplevel_bindings_p ();
7364 push_obstacks_nochange ();
7365 if (TREE_STATIC (decl
)
7366 && TYPE_NEEDS_DESTRUCTOR (type
)
7367 && allocation_temporary_p ())
7368 end_temporary_allocation ();
7370 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_VIRTUAL_P (decl
))
7371 make_decl_rtl (decl
, NULL_PTR
, toplev
);
7372 else if (TREE_CODE (decl
) == VAR_DECL
7373 && TREE_READONLY (decl
)
7374 && DECL_INITIAL (decl
) != NULL_TREE
7375 && DECL_INITIAL (decl
) != error_mark_node
7376 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
7378 DECL_INITIAL (decl
) = save_expr (DECL_INITIAL (decl
));
7381 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7384 && TREE_STATIC (decl
)
7385 && ! TREE_SIDE_EFFECTS (decl
)
7386 && ! TREE_PUBLIC (decl
)
7387 && ! DECL_EXTERNAL (decl
)
7388 && ! TYPE_NEEDS_DESTRUCTOR (type
)
7389 && DECL_MODE (decl
) != BLKmode
)
7391 /* If this variable is really a constant, then fill its DECL_RTL
7392 slot with something which won't take up storage.
7393 If something later should take its address, we can always give
7394 it legitimate RTL at that time. */
7395 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
7396 store_expr (DECL_INITIAL (decl
), DECL_RTL (decl
), 0);
7397 TREE_ASM_WRITTEN (decl
) = 1;
7399 else if (toplev
&& ! TREE_PUBLIC (decl
))
7401 /* If this is a static const, change its apparent linkage
7402 if it belongs to a #pragma interface. */
7403 if (!interface_unknown
)
7405 TREE_PUBLIC (decl
) = 1;
7406 DECL_EXTERNAL (decl
) = interface_only
;
7408 make_decl_rtl (decl
, asmspec
, toplev
);
7411 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7413 else if (TREE_CODE (decl
) == VAR_DECL
7414 && DECL_LANG_SPECIFIC (decl
)
7415 && DECL_IN_AGGR_P (decl
))
7417 my_friendly_assert (TREE_STATIC (decl
), 19990828);
7419 if (init
== NULL_TREE
7420 #ifdef DEFAULT_STATIC_DEFS
7421 /* If this code is dead, then users must
7422 explicitly declare static member variables
7423 outside the class def'n as well. */
7424 && TYPE_NEEDS_CONSTRUCTING (type
)
7428 DECL_EXTERNAL (decl
) = 1;
7429 make_decl_rtl (decl
, asmspec
, 1);
7432 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7435 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7440 /* The old ARM scoping rules injected variables declared in the
7441 initialization statement of a for-statement into the surrounding
7442 scope. We support this usage, in order to be backward-compatible.
7443 DECL is a just-declared VAR_DECL; if necessary inject its
7444 declaration into the surrounding scope. */
7447 maybe_inject_for_scope_var (decl
)
7450 if (current_binding_level
->is_for_scope
)
7452 struct binding_level
*outer
7453 = current_binding_level
->level_chain
;
7455 /* Check to see if the same name is already bound at the outer
7456 level, either because it was directly declared, or because a
7457 dead for-decl got preserved. In either case, the code would
7458 not have been valid under the ARM scope rules, so clear
7459 is_for_scope for the current_binding_level.
7461 Otherwise, we need to preserve the temp slot for decl to last
7462 into the outer binding level. */
7465 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7467 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7468 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7470 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7472 BINDING_VALUE (outer_binding
)
7473 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7474 current_binding_level
->is_for_scope
= 0;
7476 else if (DECL_IN_MEMORY_P (decl
))
7477 preserve_temp_slots (DECL_RTL (decl
));
7481 /* Generate code to initialize DECL (a local variable). */
7484 initialize_local_var (decl
, init
, flags
)
7491 type
= complete_type (TREE_TYPE (decl
));
7493 if (DECL_SIZE (decl
) == NULL_TREE
&& !TREE_STATIC (decl
))
7495 /* If we used it already as memory, it must stay in memory. */
7496 DECL_INITIAL (decl
) = NULL_TREE
;
7497 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7500 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7504 /* Compute and store the initial value. */
7505 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7507 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7509 int saved_stmts_are_full_exprs_p
;
7511 emit_line_note (DECL_SOURCE_FILE (decl
),
7512 DECL_SOURCE_LINE (decl
));
7513 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p
;
7514 stmts_are_full_exprs_p
= 1;
7515 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7516 stmts_are_full_exprs_p
= saved_stmts_are_full_exprs_p
;
7519 /* Set this to 0 so we can tell whether an aggregate which was
7520 initialized was ever used. Don't do this if it has a
7521 destructor, so we don't complain about the 'resource
7522 allocation is initialization' idiom. Now set
7523 attribute((unused)) on types so decls of that type will be
7524 marked used. (see TREE_USED, above.) */
7525 if (TYPE_NEEDS_CONSTRUCTING (type
)
7527 && !TYPE_NEEDS_DESTRUCTOR (type
)
7528 && DECL_NAME (decl
))
7529 TREE_USED (decl
) = 0;
7530 else if (already_used
)
7531 TREE_USED (decl
) = 1;
7535 /* Generate code to destroy DECL (a local variable). */
7538 destroy_local_var (decl
)
7541 tree type
= TREE_TYPE (decl
);
7544 /* Only variables get cleaned up. */
7545 if (TREE_CODE (decl
) != VAR_DECL
)
7548 /* And only things with destructors need cleaning up. */
7549 if (!TYPE_NEEDS_DESTRUCTOR (type
))
7552 if (TREE_CODE (decl
) == VAR_DECL
&&
7553 (DECL_EXTERNAL (decl
) || TREE_STATIC (decl
)))
7554 /* We don't clean up things that aren't defined in this
7555 translation unit, or that need a static cleanup. The latter
7556 are handled by finish_file. */
7559 /* Compute the cleanup. */
7560 cleanup
= maybe_build_cleanup (decl
);
7562 /* Record the cleanup required for this declaration. */
7563 if (DECL_SIZE (decl
) && TREE_TYPE (decl
) != error_mark_node
7565 finish_decl_cleanup (decl
, cleanup
);
7568 /* Let the back-end know about DECL. */
7571 emit_local_var (decl
)
7574 /* Create RTL for this variable. */
7575 if (DECL_RTL (decl
))
7576 /* Only a RESULT_DECL should have non-NULL RTL when
7577 arriving here. All other local variables are
7578 assigned RTL in this function. */
7579 my_friendly_assert (TREE_CODE (decl
) == RESULT_DECL
,
7584 /* Actually do the initialization. */
7585 expand_start_target_temps ();
7586 expand_decl_init (decl
);
7587 expand_end_target_temps ();
7590 /* Finish processing of a declaration;
7591 install its line number and initial value.
7592 If the length of an array type is not known before,
7593 it must be determined now, from the initial value, or it is an error.
7595 Call `pop_obstacks' iff NEED_POP is nonzero.
7597 For C++, `cp_finish_decl' must be fairly evasive: it must keep initializers
7598 for aggregates that have constructors alive on the permanent obstack,
7599 so that the global initializing functions can be written at the end.
7601 INIT0 holds the value of an initializer that should be allowed to escape
7604 FLAGS is LOOKUP_ONLYCONVERTING is the = init syntax was used, else 0
7605 if the (init) syntax was used.
7607 For functions that take default parameters, DECL points to its
7608 "maximal" instantiation. `cp_finish_decl' must then also declared its
7609 subsequently lower and lower forms of instantiation, checking for
7610 ambiguity as it goes. This can be sped up later. */
7613 cp_finish_decl (decl
, init
, asmspec_tree
, need_pop
, flags
)
7620 tree ttype
= NULL_TREE
;
7621 int temporary
= allocation_temporary_p ();
7622 const char *asmspec
= NULL
;
7623 int was_readonly
= 0;
7625 /* If this is 0, then we did not change obstacks. */
7629 error ("assignment (not initialization) in declaration");
7633 /* If a name was specified, get the string. */
7635 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
7637 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
7639 cp_error ("Cannot initialize `%D' to namespace `%D'",
7644 if (current_class_type
7645 && DECL_REAL_CONTEXT (decl
) == current_class_type
7646 && TYPE_BEING_DEFINED (current_class_type
)
7647 && (DECL_INITIAL (decl
) || init
))
7648 DECL_DEFINED_IN_CLASS_P (decl
) = 1;
7650 if (TREE_CODE (decl
) == VAR_DECL
7651 && DECL_CONTEXT (decl
)
7652 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7653 && DECL_CONTEXT (decl
) != current_namespace
7656 /* Leave the namespace of the object. */
7657 pop_decl_namespace ();
7660 type
= TREE_TYPE (decl
);
7662 if (type
== error_mark_node
)
7664 if (toplevel_bindings_p () && temporary
)
7665 end_temporary_allocation ();
7670 /* Add this declaration to the statement-tree. */
7671 if (building_stmt_tree ()
7672 && TREE_CODE (current_scope ()) == FUNCTION_DECL
)
7673 add_decl_stmt (decl
);
7675 if (TYPE_HAS_MUTABLE_P (type
))
7676 TREE_READONLY (decl
) = 0;
7678 if (processing_template_decl
)
7680 if (init
&& DECL_INITIAL (decl
))
7681 DECL_INITIAL (decl
) = init
;
7685 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
7686 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
7688 /* Take care of TYPE_DECLs up front. */
7689 if (TREE_CODE (decl
) == TYPE_DECL
)
7691 if (init
&& DECL_INITIAL (decl
))
7693 /* typedef foo = bar; store the type of bar as the type of foo. */
7694 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
7695 DECL_INITIAL (decl
) = init
= NULL_TREE
;
7697 if (type
!= error_mark_node
7698 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
7700 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
7701 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
7702 set_identifier_type_value (DECL_NAME (decl
), type
);
7703 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
7705 GNU_xref_decl (current_function_decl
, decl
);
7707 /* If we have installed this as the canonical typedef for this
7708 type, and that type has not been defined yet, delay emitting
7709 the debug information for it, as we will emit it later. */
7710 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
7711 && TYPE_SIZE (TREE_TYPE (decl
)) == NULL_TREE
)
7712 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
7714 rest_of_decl_compilation (decl
, NULL_PTR
,
7715 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
7719 if (TREE_CODE (decl
) != FUNCTION_DECL
)
7720 ttype
= target_type (type
);
7722 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
7723 && TYPE_NEEDS_CONSTRUCTING (type
))
7725 /* Currently, GNU C++ puts constants in text space, making them
7726 impossible to initialize. In the future, one would hope for
7727 an operating system which understood the difference between
7728 initialization and the running of a program. */
7730 TREE_READONLY (decl
) = 0;
7733 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
7735 /* This must override the asm specifier which was placed by
7736 grokclassfn. Lay this out fresh. */
7737 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
7738 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7739 make_decl_rtl (decl
, asmspec
, 0);
7742 /* Deduce size of array from initialization, if not already known. */
7743 maybe_deduce_size_from_array_init (decl
, init
);
7744 init
= check_initializer (decl
, init
);
7746 GNU_xref_decl (current_function_decl
, decl
);
7748 /* For top-level declaration, the initial value was read in
7749 the temporary obstack. MAXINDEX, rtl, etc. to be made below
7750 must go in the permanent obstack; but don't discard the
7751 temporary data yet. */
7753 if (toplevel_bindings_p () && temporary
)
7754 end_temporary_allocation ();
7756 if (TREE_CODE (decl
) == VAR_DECL
)
7757 layout_var_decl (decl
);
7759 /* Output the assembler code and/or RTL code for variables and functions,
7760 unless the type is an undefined structure or union.
7761 If not, it will get done when the type is completed. */
7762 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
7763 || TREE_CODE (decl
) == RESULT_DECL
)
7765 if (TREE_CODE (decl
) == VAR_DECL
)
7766 maybe_commonize_var (decl
);
7768 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
7770 if (TREE_CODE (type
) == FUNCTION_TYPE
7771 || TREE_CODE (type
) == METHOD_TYPE
)
7772 abstract_virtuals_error (decl
,
7773 strip_array_types (TREE_TYPE (type
)));
7775 abstract_virtuals_error (decl
, strip_array_types (type
));
7777 if (TREE_CODE (decl
) == FUNCTION_DECL
)
7779 else if (DECL_EXTERNAL (decl
)
7780 && ! (DECL_LANG_SPECIFIC (decl
)
7781 && DECL_NOT_REALLY_EXTERN (decl
)))
7784 DECL_INITIAL (decl
) = init
;
7786 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
7788 /* Cleanups for static variables are handled by `finish_file'. */
7789 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7790 || TYPE_NEEDS_DESTRUCTOR (type
))
7791 expand_static_init (decl
, init
);
7793 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
7795 /* This is a local declaration. */
7796 if (doing_semantic_analysis_p ())
7797 maybe_inject_for_scope_var (decl
);
7798 /* Initialize the local variable. But, if we're building a
7799 statement-tree, we'll do the initialization when we
7801 if (processing_template_decl
)
7803 if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
7804 DECL_INITIAL (decl
) = init
;
7808 /* If we're not building RTL, then we need to do so
7810 if (!building_stmt_tree ())
7811 emit_local_var (decl
);
7812 /* Initialize the variable. */
7813 initialize_local_var (decl
, init
, flags
);
7814 /* Clean up the variable. */
7815 destroy_local_var (decl
);
7820 /* Undo call to `pushclass' that was done in `start_decl'
7821 due to initialization of qualified member variable.
7822 I.e., Foo::x = 10; */
7824 tree context
= DECL_REAL_CONTEXT (decl
);
7826 && TREE_CODE_CLASS (TREE_CODE (context
)) == 't'
7827 && (TREE_CODE (decl
) == VAR_DECL
7828 /* We also have a pushclass done that we need to undo here
7829 if we're at top level and declare a method. */
7830 || TREE_CODE (decl
) == FUNCTION_DECL
)
7831 /* If size hasn't been set, we're still defining it,
7832 and therefore inside the class body; don't pop
7833 the binding level.. */
7834 && TYPE_SIZE (context
) != NULL_TREE
7835 && context
== current_class_type
)
7836 pop_nested_class ();
7842 /* If requested, warn about definitions of large data objects. */
7844 if (warn_larger_than
7845 && ! processing_template_decl
7846 && (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
7847 && !DECL_EXTERNAL (decl
))
7849 register tree decl_size
= DECL_SIZE (decl
);
7851 if (decl_size
&& TREE_CODE (decl_size
) == INTEGER_CST
)
7853 unsigned units
= TREE_INT_CST_LOW (decl_size
) / BITS_PER_UNIT
;
7855 if (units
> larger_than_size
)
7856 warning_with_decl (decl
, "size of `%s' is %u bytes", units
);
7861 /* Resume permanent allocation, if not within a function. The
7862 corresponding push_obstacks_nochange is in start_decl,
7863 start_method, groktypename, and in grokfield. */
7867 TREE_READONLY (decl
) = 1;
7870 /* This is here for a midend callback from c-common.c */
7873 finish_decl (decl
, init
, asmspec_tree
)
7877 cp_finish_decl (decl
, init
, asmspec_tree
, 1, 0);
7880 /* Generate code to handle the destruction of the function-scoped
7881 static variable DECL. */
7884 destroy_local_static (decl
)
7887 tree cleanup
, fcall
;
7889 int saved_flag_access_control
;
7891 if (atexit_node
== 0)
7893 tree atexit_fndecl
, PFV
, pfvlist
;
7894 /* Remember this information until end of file. */
7895 push_obstacks (&permanent_obstack
, &permanent_obstack
);
7896 PFV
= build_pointer_type (build_function_type
7897 (void_type_node
, void_list_node
));
7899 pfvlist
= tree_cons (NULL_TREE
, PFV
, void_list_node
);
7901 push_lang_context (lang_name_c
);
7902 /* Note that we do not call pushdecl for this function;
7903 there's no reason that this declaration should be
7904 accessible to anyone. */
7906 = define_function ("atexit",
7907 build_function_type (void_type_node
,
7909 /*pfn=*/0, NULL_PTR
);
7910 mark_used (atexit_fndecl
);
7911 atexit_node
= default_conversion (atexit_fndecl
);
7912 pop_lang_context ();
7916 /* Call build_cleanup before we enter the anonymous function so that
7917 any access checks will be done relative to the current scope,
7918 rather than the scope of the anonymous function. */
7919 build_cleanup (decl
);
7921 /* Now start the function. */
7922 cleanup
= start_anon_func ();
7924 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
7925 to the original function, rather than the anonymous one. That
7926 will make the back-end think that nested functions are in use,
7927 which causes confusion. */
7928 saved_flag_access_control
= flag_access_control
;
7929 flag_access_control
= 0;
7930 fcall
= build_cleanup (decl
);
7931 flag_access_control
= saved_flag_access_control
;
7933 /* Create the body of the anonymous function. */
7934 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
7935 finish_expr_stmt (fcall
);
7936 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
7939 /* Call atexit with the cleanup function. */
7940 mark_addressable (cleanup
);
7941 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
7942 fcall
= build_function_call (atexit_node
,
7943 tree_cons (NULL_TREE
,
7946 finish_expr_stmt (fcall
);
7950 expand_static_init (decl
, init
)
7954 tree oldstatic
= value_member (decl
, static_aggregates
);
7958 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
7959 cp_error ("multiple initializations given for `%D'", decl
);
7961 else if (! toplevel_bindings_p ())
7963 /* Emit code to perform this initialization but once. */
7970 /* Remember this information until end of file. */
7971 push_obstacks (&permanent_obstack
, &permanent_obstack
);
7973 /* Emit code to perform this initialization but once. This code
7976 static int temp = 0;
7978 // Do initialization.
7980 // Register variable for destruction at end of program.
7983 Note that the `temp' variable is only set to 1 *after* the
7984 initialization is complete. This ensures that an exception,
7985 thrown during the construction, will cause the variable to
7986 reinitialized when we pass through this code again, as per:
7990 If the initialization exits by throwing an exception, the
7991 initialization is not complete, so it will be tried again
7992 the next time control enters the declaration.
7994 In theory, this process should be thread-safe, too; multiple
7995 threads should not be able to initialize the variable more
7996 than once. We don't yet attempt to ensure thread-safety. */
7997 temp
= get_temp_name (integer_type_node
, 1);
7998 rest_of_decl_compilation (temp
, NULL_PTR
, 0, 0);
8000 /* Begin the conditional initialization. */
8001 if_stmt
= begin_if_stmt ();
8002 finish_if_stmt_cond (build_binary_op (EQ_EXPR
, temp
,
8005 then_clause
= begin_compound_stmt (/*has_no_scope=*/0);
8007 /* Do the initialization itself. */
8008 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
8009 || (init
&& TREE_CODE (init
) == TREE_LIST
))
8010 assignment
= build_aggr_init (decl
, init
, 0);
8013 /* The initialization we're doing here is just a bitwise
8015 assignment
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
8016 TREE_SIDE_EFFECTS (assignment
) = 1;
8019 assignment
= NULL_TREE
;
8021 /* Once the assignment is complete, set TEMP to 1. Since the
8022 construction of the static object is complete at this point,
8023 we want to make sure TEMP is set to 1 even if a temporary
8024 constructed during the initialization throws an exception
8025 when it is destroyed. So, we combine the initialization and
8026 the assignment to TEMP into a single expression, ensuring
8027 that when we call finish_expr_stmt the cleanups will not be
8028 run until after TEMP is set to 1. */
8029 temp_init
= build_modify_expr (temp
, NOP_EXPR
, integer_one_node
);
8032 assignment
= tree_cons (NULL_TREE
, assignment
,
8033 build_tree_list (NULL_TREE
,
8035 assignment
= build_compound_expr (assignment
);
8038 assignment
= temp_init
;
8039 finish_expr_stmt (assignment
);
8041 /* Use atexit to register a function for destroying this static
8043 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
8044 destroy_local_static (decl
);
8046 finish_compound_stmt (/*has_no_scope=*/0, then_clause
);
8047 finish_then_clause (if_stmt
);
8050 /* Resume old (possibly temporary) allocation. */
8055 /* This code takes into account memory allocation policy of
8056 `start_decl'. Namely, if TYPE_NEEDS_CONSTRUCTING does not
8057 hold for this object, then we must make permanent the storage
8058 currently in the temporary obstack. */
8059 if (!TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
8060 preserve_initializer ();
8061 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8065 /* Finish the declaration of a catch-parameter. */
8068 start_handler_parms (declspecs
, declarator
)
8075 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8077 if (decl
== NULL_TREE
)
8078 error ("invalid catch parameter");
8087 /* Make TYPE a complete type based on INITIAL_VALUE.
8088 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8089 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8092 complete_array_type (type
, initial_value
, do_default
)
8093 tree type
, initial_value
;
8096 register tree maxindex
= NULL_TREE
;
8099 /* Allocate on the same obstack as TYPE. */
8100 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
8104 /* Note MAXINDEX is really the maximum index,
8105 one less than the size. */
8106 if (TREE_CODE (initial_value
) == STRING_CST
)
8109 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8110 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8113 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8115 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8116 maxindex
= size_binop (MINUS_EXPR
, integer_zero_node
, size_one_node
);
8117 for (; elts
; elts
= TREE_CHAIN (elts
))
8119 if (TREE_PURPOSE (elts
))
8120 maxindex
= TREE_PURPOSE (elts
);
8122 maxindex
= size_binop (PLUS_EXPR
, maxindex
, size_one_node
);
8124 maxindex
= copy_node (maxindex
);
8128 /* Make an error message unless that happened already. */
8129 if (initial_value
!= error_mark_node
)
8132 initial_value
= NULL_TREE
;
8134 /* Prevent further error messages. */
8135 maxindex
= build_int_2 (0, 0);
8142 maxindex
= build_int_2 (0, 0);
8151 domain
= build_index_type (maxindex
);
8152 TYPE_DOMAIN (type
) = domain
;
8154 if (! TREE_TYPE (maxindex
))
8155 TREE_TYPE (maxindex
) = domain
;
8157 itype
= TREE_TYPE (initial_value
);
8160 if (itype
&& !TYPE_DOMAIN (itype
))
8161 TYPE_DOMAIN (itype
) = domain
;
8162 /* The type of the main variant should never be used for arrays
8163 of different sizes. It should only ever be completed with the
8164 size of the array. */
8165 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8166 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8171 /* Lay out the type now that we can get the real answer. */
8178 /* Return zero if something is declared to be a member of type
8179 CTYPE when in the context of CUR_TYPE. STRING is the error
8180 message to print in that case. Otherwise, quietly return 1. */
8183 member_function_or_else (ctype
, cur_type
, string
)
8184 tree ctype
, cur_type
;
8187 if (ctype
&& ctype
!= cur_type
)
8189 error (string
, TYPE_NAME_STRING (ctype
));
8195 /* Subroutine of `grokdeclarator'. */
8197 /* Generate errors possibly applicable for a given set of specifiers.
8198 This is for ARM $7.1.2. */
8201 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8204 int virtualp
, quals
, friendp
, raises
, inlinep
;
8207 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8209 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8211 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8214 cp_error_at ("`%D' declared as a friend", object
);
8216 cp_error_at ("`%D' declared with an exception specification", object
);
8219 /* CTYPE is class type, or null if non-class.
8220 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8222 DECLARATOR is the function's name.
8223 VIRTUALP is truthvalue of whether the function is virtual or not.
8224 FLAGS are to be passed through to `grokclassfn'.
8225 QUALS are qualifiers indicating whether the function is `const'
8227 RAISES is a list of exceptions that this function can raise.
8228 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8229 not look, and -1 if we should not call `grokclassfn' at all.
8231 Returns `NULL_TREE' if something goes wrong, after issuing
8232 applicable error messages. */
8235 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8236 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8237 template_count
, in_namespace
)
8240 tree orig_declarator
;
8242 enum overload_flags flags
;
8244 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8248 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8249 int has_default_arg
= 0;
8253 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8254 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8260 type
= build_exception_variant (type
, raises
);
8263 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8264 /* Propagate volatile out from type to decl. */
8265 if (TYPE_VOLATILE (type
))
8266 TREE_THIS_VOLATILE (decl
) = 1;
8268 /* If this decl has namespace scope, set that up. */
8270 set_decl_namespace (decl
, in_namespace
, friendp
);
8271 else if (publicp
&& ! ctype
)
8272 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8274 /* `main' and builtins have implicit 'C' linkage. */
8275 if ((MAIN_NAME_P (declarator
)
8276 || (IDENTIFIER_LENGTH (declarator
) > 10
8277 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8278 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8279 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8280 && current_lang_name
== lang_name_cplusplus
8281 && ctype
== NULL_TREE
8282 /* NULL_TREE means global namespace. */
8283 && DECL_CONTEXT (decl
) == NULL_TREE
)
8284 DECL_LANGUAGE (decl
) = lang_c
;
8286 /* Should probably propagate const out from type to decl I bet (mrs). */
8289 DECL_STATIC_FUNCTION_P (decl
) = 1;
8290 DECL_CONTEXT (decl
) = ctype
;
8294 DECL_CLASS_CONTEXT (decl
) = ctype
;
8296 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8298 if (processing_template_decl
)
8299 error ("cannot declare `main' to be a template");
8301 error ("cannot declare `main' to be inline");
8303 error ("cannot declare `main' to be static");
8308 /* Members of anonymous types and local classes have no linkage; make
8310 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8311 || hack_decl_function_context (TYPE_MAIN_DECL (ctype
))))
8316 /* [basic.link]: A name with no linkage (notably, the name of a class
8317 or enumeration declared in a local scope) shall not be used to
8318 declare an entity with linkage.
8320 Only check this for public decls for now. */
8321 t
= no_linkage_check (TREE_TYPE (decl
));
8324 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8326 if (DECL_LANGUAGE (decl
) == lang_c
)
8327 /* Allow this; it's pretty common in C. */;
8329 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8333 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8338 TREE_PUBLIC (decl
) = publicp
;
8341 DECL_INTERFACE_KNOWN (decl
) = 1;
8342 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8346 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8348 DECL_EXTERNAL (decl
) = 1;
8349 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8351 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8352 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8356 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8357 grok_op_properties (decl
, virtualp
, check
< 0);
8359 if (ctype
&& hack_decl_function_context (decl
))
8360 DECL_NO_STATIC_CHAIN (decl
) = 1;
8362 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8363 if (TREE_PURPOSE (t
)
8364 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8366 has_default_arg
= 1;
8371 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8375 ("defining explicit specialization `%D' in friend declaration",
8379 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8381 /* Something like `template <class T> friend void f<T>()'. */
8382 cp_error ("template-id `%D' in declaration of primary template",
8388 /* A friend declaration of the form friend void f<>(). Record
8389 the information in the TEMPLATE_ID_EXPR. */
8390 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8391 DECL_TEMPLATE_INFO (decl
)
8392 = tree_cons (TREE_OPERAND (orig_declarator
, 0),
8393 TREE_OPERAND (orig_declarator
, 1),
8396 if (has_default_arg
)
8398 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8405 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8412 if (has_default_arg
)
8413 add_defarg_fn (decl
);
8415 /* Plain overloading: will not be grok'd by grokclassfn. */
8416 if (! ctype
&& ! processing_template_decl
8417 && DECL_LANGUAGE (decl
) != lang_c
8418 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8419 set_mangled_name_for_decl (decl
);
8422 /* Make the init_value nonzero so pushdecl knows this is not
8423 tentative. error_mark_node is replaced later with the BLOCK. */
8424 DECL_INITIAL (decl
) = error_mark_node
;
8426 /* Caller will do the rest of this. */
8430 if (check
&& funcdef_flag
)
8431 DECL_INITIAL (decl
) = error_mark_node
;
8433 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8436 /* Just handle constructors here. We could do this
8437 inside the following if stmt, but I think
8438 that the code is more legible by breaking this
8439 case out. See comments below for what each of
8440 the following calls is supposed to do. */
8441 DECL_CONSTRUCTOR_P (decl
) = 1;
8443 grokclassfn (ctype
, decl
, flags
, quals
);
8445 decl
= check_explicit_specialization (orig_declarator
, decl
,
8447 2 * (funcdef_flag
!= 0) +
8448 4 * (friendp
!= 0));
8449 if (decl
== error_mark_node
)
8452 if ((! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8455 tmp
= check_classfn (ctype
, decl
);
8457 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8458 tmp
= DECL_TEMPLATE_RESULT(tmp
);
8460 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8461 cp_error ("definition of implicitly-declared `%D'", tmp
);
8462 if (tmp
&& duplicate_decls (decl
, tmp
))
8465 if (! grok_ctor_properties (ctype
, decl
))
8472 /* Function gets the ugly name, field gets the nice one.
8473 This call may change the type of the function (because
8474 of default parameters)! */
8475 if (ctype
!= NULL_TREE
)
8476 grokclassfn (ctype
, decl
, flags
, quals
);
8478 decl
= check_explicit_specialization (orig_declarator
, decl
,
8480 2 * (funcdef_flag
!= 0) +
8481 4 * (friendp
!= 0));
8482 if (decl
== error_mark_node
)
8485 if (ctype
!= NULL_TREE
8486 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8489 tmp
= check_classfn (ctype
, decl
);
8491 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8492 tmp
= DECL_TEMPLATE_RESULT (tmp
);
8494 if (tmp
&& DECL_STATIC_FUNCTION_P (tmp
)
8495 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8497 /* Remove the `this' parm added by grokclassfn.
8498 XXX Isn't this done in start_function, too? */
8499 revert_static_member_fn (&decl
, NULL
, NULL
);
8500 last_function_parms
= TREE_CHAIN (last_function_parms
);
8502 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8503 cp_error ("definition of implicitly-declared `%D'", tmp
);
8506 /* Attempt to merge the declarations. This can fail, in
8507 the case of some illegal specialization declarations. */
8508 if (!duplicate_decls (decl
, tmp
))
8509 cp_error ("no `%#D' member function declared in class `%T'",
8515 if (ctype
== NULL_TREE
|| check
)
8520 DECL_VIRTUAL_P (decl
) = 1;
8521 if (DECL_VINDEX (decl
) == NULL_TREE
)
8522 DECL_VINDEX (decl
) = error_mark_node
;
8523 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
8530 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
8533 RID_BIT_TYPE
*specbits_in
;
8539 RID_BIT_TYPE specbits
;
8541 specbits
= *specbits_in
;
8543 if (TREE_CODE (type
) == OFFSET_TYPE
)
8545 /* If you declare a static member so that it
8546 can be initialized, the code will reach here. */
8547 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
8548 type
= TREE_TYPE (type
);
8549 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8550 DECL_CONTEXT (decl
) = basetype
;
8551 DECL_CLASS_CONTEXT (decl
) = basetype
;
8552 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
, declarator
);
8559 context
= in_namespace
;
8560 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
8561 context
= current_namespace
;
8563 context
= NULL_TREE
;
8565 if (processing_template_decl
)
8567 /* If we're in a template, we need DECL_LANG_SPECIFIC so that
8568 we can call push_template_decl. */
8569 push_permanent_obstack ();
8570 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8574 decl
= build_decl (VAR_DECL
, declarator
, type
);
8577 set_decl_namespace (decl
, context
, 0);
8579 context
= DECL_CONTEXT (decl
);
8580 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
8581 DECL_ASSEMBLER_NAME (decl
) = build_static_name (context
, declarator
);
8585 set_decl_namespace (decl
, in_namespace
, 0);
8587 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
8589 DECL_THIS_EXTERN (decl
) = 1;
8590 DECL_EXTERNAL (decl
) = !initialized
;
8593 /* In class context, static means one per class,
8594 public access, and static storage. */
8595 if (DECL_CLASS_SCOPE_P (decl
))
8597 TREE_PUBLIC (decl
) = 1;
8598 TREE_STATIC (decl
) = 1;
8599 DECL_EXTERNAL (decl
) = 0;
8601 /* At top level, either `static' or no s.c. makes a definition
8602 (perhaps tentative), and absence of `static' makes it public. */
8603 else if (toplevel_bindings_p ())
8605 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
8606 && (DECL_THIS_EXTERN (decl
) || ! constp
));
8607 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
8609 /* Not at top level, only `static' makes a static definition. */
8612 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
8613 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
8616 if (TREE_PUBLIC (decl
))
8618 /* [basic.link]: A name with no linkage (notably, the name of a class
8619 or enumeration declared in a local scope) shall not be used to
8620 declare an entity with linkage.
8622 Only check this for public decls for now. */
8623 tree t
= no_linkage_check (TREE_TYPE (decl
));
8626 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8627 /* Ignore for now; `enum { foo } e' is pretty common. */;
8629 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
8637 /* Create and return a canonical pointer to member function type, for
8638 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
8641 build_ptrmemfunc_type (type
)
8647 tree unqualified_variant
= NULL_TREE
;
8649 /* If a canonical type already exists for this type, use it. We use
8650 this method instead of type_hash_canon, because it only does a
8651 simple equality check on the list of field members. */
8653 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
8656 /* Make sure that we always have the unqualified pointer-to-member
8658 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8660 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
8662 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
8664 u
= make_lang_type (UNION_TYPE
);
8665 SET_IS_AGGR_TYPE (u
, 0);
8666 fields
[0] = build_lang_decl (FIELD_DECL
, pfn_identifier
, type
);
8667 fields
[1] = build_lang_decl (FIELD_DECL
, delta2_identifier
,
8669 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
8670 TYPE_NAME (u
) = NULL_TREE
;
8672 t
= make_lang_type (RECORD_TYPE
);
8674 /* Let the front-end know this is a pointer to member function... */
8675 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
8676 /* ... and not really an aggregate. */
8677 SET_IS_AGGR_TYPE (t
, 0);
8679 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
8681 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
8683 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
8684 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
8688 /* Zap out the name so that the back-end will give us the debugging
8689 information for this anonymous RECORD_TYPE. */
8690 TYPE_NAME (t
) = NULL_TREE
;
8692 /* If this is not the unqualified form of this pointer-to-member
8693 type, set the TYPE_MAIN_VARIANT for this type to be the
8694 unqualified type. Since they are actually RECORD_TYPEs that are
8695 not variants of each other, we must do this manually. */
8696 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8698 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
8699 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
8700 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
8701 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
8704 /* Cache this pointer-to-member type so that we can find it again
8706 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
8708 /* Seems to be wanted. */
8709 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
8714 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
8715 Check to see that the definition is valid. Issue appropriate error
8716 messages. Return 1 if the definition is particularly bad, or 0
8720 check_static_variable_definition (decl
, type
)
8724 /* Motion 10 at San Diego: If a static const integral data member is
8725 initialized with an integral constant expression, the initializer
8726 may appear either in the declaration (within the class), or in
8727 the definition, but not both. If it appears in the class, the
8728 member is a member constant. The file-scope definition is always
8730 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
8732 cp_error ("in-class initialization of static data member of non-integral type `%T'",
8734 /* If we just return the declaration, crashes will sometimes
8735 occur. We therefore return void_type_node, as if this was a
8736 friend declaration, to cause callers to completely ignore
8737 this declaration. */
8740 else if (!CP_TYPE_CONST_P (type
))
8741 cp_error ("ANSI C++ forbids in-class initialization of non-const static member `%D'",
8743 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
8744 cp_pedwarn ("ANSI C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
8749 /* Given declspecs and a declarator,
8750 determine the name and type of the object declared
8751 and construct a ..._DECL node for it.
8752 (In one case we can return a ..._TYPE node instead.
8753 For invalid input we sometimes return 0.)
8755 DECLSPECS is a chain of tree_list nodes whose value fields
8756 are the storage classes and type specifiers.
8758 DECL_CONTEXT says which syntactic context this declaration is in:
8759 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
8760 FUNCDEF for a function definition. Like NORMAL but a few different
8761 error messages in each case. Return value may be zero meaning
8762 this definition is too screwy to try to parse.
8763 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
8764 handle member functions (which have FIELD context).
8765 Return value may be zero meaning this definition is too screwy to
8767 PARM for a parameter declaration (either within a function prototype
8768 or before a function body). Make a PARM_DECL, or return void_type_node.
8769 CATCHPARM for a parameter declaration before a catch clause.
8770 TYPENAME if for a typename (in a cast or sizeof).
8771 Don't make a DECL node; just return the ..._TYPE node.
8772 FIELD for a struct or union field; make a FIELD_DECL.
8773 BITFIELD for a field with specified width.
8774 INITIALIZED is 1 if the decl has an initializer.
8776 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
8777 normal attributes in TREE_PURPOSE, or NULL_TREE.
8779 In the TYPENAME case, DECLARATOR is really an absolute declarator.
8780 It may also be so in the PARM case, for a prototype where the
8781 argument type is specified but not the name.
8783 This function is where the complicated C meanings of `static'
8784 and `extern' are interpreted.
8786 For C++, if there is any monkey business to do, the function which
8787 calls this one must do it, i.e., prepending instance variables,
8788 renaming overloaded function names, etc.
8790 Note that for this C++, it is an error to define a method within a class
8791 which does not belong to that class.
8793 Except in the case where SCOPE_REFs are implicitly known (such as
8794 methods within a class being redundantly qualified),
8795 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
8796 (class_name::decl_name). The caller must also deal with this.
8798 If a constructor or destructor is seen, and the context is FIELD,
8799 then the type gains the attribute TREE_HAS_x. If such a declaration
8800 is erroneous, NULL_TREE is returned.
8802 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
8803 function, these are the qualifiers to give to the `this' pointer.
8805 May return void_type_node if the declarator turned out to be a friend.
8806 See grokfield for details. */
8808 enum return_types
{ return_normal
, return_ctor
, return_dtor
, return_conversion
};
8811 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
8814 enum decl_context decl_context
;
8818 RID_BIT_TYPE specbits
;
8821 tree type
= NULL_TREE
;
8827 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
8828 int explicit_int
= 0;
8829 int explicit_char
= 0;
8830 int defaulted_int
= 0;
8831 tree typedef_decl
= NULL_TREE
;
8833 tree typedef_type
= NULL_TREE
;
8834 int funcdef_flag
= 0;
8835 enum tree_code innermost_code
= ERROR_MARK
;
8838 /* See the code below that used this. */
8839 tree decl_machine_attr
= NULL_TREE
;
8841 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
8842 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
8843 tree init
= NULL_TREE
;
8845 /* Keep track of what sort of function is being processed
8846 so that we can warn about default return values, or explicit
8847 return values which do not match prescribed defaults. */
8848 enum return_types return_type
= return_normal
;
8850 tree dname
= NULL_TREE
;
8851 tree ctype
= current_class_type
;
8852 tree ctor_return_type
= NULL_TREE
;
8853 enum overload_flags flags
= NO_SPECIAL
;
8854 tree quals
= NULL_TREE
;
8855 tree raises
= NULL_TREE
;
8856 int template_count
= 0;
8857 tree in_namespace
= NULL_TREE
;
8861 RIDBIT_RESET_ALL (specbits
);
8862 if (decl_context
== FUNCDEF
)
8863 funcdef_flag
= 1, decl_context
= NORMAL
;
8864 else if (decl_context
== MEMFUNCDEF
)
8865 funcdef_flag
= -1, decl_context
= FIELD
;
8866 else if (decl_context
== BITFIELD
)
8867 bitfield
= 1, decl_context
= FIELD
;
8869 /* Look inside a declarator for the name being declared
8870 and get it as a string, for an error message. */
8872 tree
*next
= &declarator
;
8876 while (next
&& *next
)
8879 switch (TREE_CODE (decl
))
8882 /* For attributes. */
8883 next
= &TREE_VALUE (decl
);
8888 next
= &TREE_OPERAND (decl
, 0);
8891 case BIT_NOT_EXPR
: /* For C++ destructors! */
8893 tree name
= TREE_OPERAND (decl
, 0);
8894 tree rename
= NULL_TREE
;
8896 my_friendly_assert (flags
== NO_SPECIAL
, 152);
8898 return_type
= return_dtor
;
8899 if (TREE_CODE (name
) == TYPE_DECL
)
8900 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
8901 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
8902 if (ctype
== NULL_TREE
)
8904 if (current_class_type
== NULL_TREE
)
8906 error ("destructors must be member functions");
8911 tree t
= constructor_name (current_class_name
);
8918 tree t
= constructor_name (ctype
);
8925 cp_error ("destructor `%T' must match class name `%T'",
8927 TREE_OPERAND (decl
, 0) = rename
;
8933 case ADDR_EXPR
: /* C++ reference declaration */
8938 innermost_code
= TREE_CODE (decl
);
8939 next
= &TREE_OPERAND (decl
, 0);
8943 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
8945 /* This is actually a variable declaration using
8946 constructor syntax. We need to call start_decl and
8947 cp_finish_decl so we can get the variable
8950 tree attributes
, prefix_attributes
;
8952 *next
= TREE_OPERAND (decl
, 0);
8953 init
= CALL_DECLARATOR_PARMS (decl
);
8957 attributes
= TREE_PURPOSE (attrlist
);
8958 prefix_attributes
= TREE_VALUE (attrlist
);
8962 attributes
= NULL_TREE
;
8963 prefix_attributes
= NULL_TREE
;
8966 decl
= start_decl (declarator
, declspecs
, 1,
8967 attributes
, prefix_attributes
);
8970 /* Look for __unused__ attribute */
8971 if (TREE_USED (TREE_TYPE (decl
)))
8972 TREE_USED (decl
) = 1;
8973 finish_decl (decl
, init
, NULL_TREE
);
8976 cp_error ("invalid declarator");
8979 innermost_code
= TREE_CODE (decl
);
8980 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
8981 ctype
= current_class_type
;
8983 && TREE_OPERAND (decl
, 0)
8984 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
8985 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
8986 == constructor_name_full (ctype
))
8987 || (DECL_NAME (TREE_OPERAND (decl
, 0))
8988 == constructor_name (ctype
)))))
8989 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
8990 next
= &TREE_OPERAND (decl
, 0);
8992 if (ctype
!= NULL_TREE
8993 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
8994 && decl
== constructor_name (ctype
))
8996 return_type
= return_ctor
;
8997 ctor_return_type
= ctype
;
9002 case TEMPLATE_ID_EXPR
:
9004 tree fns
= TREE_OPERAND (decl
, 0);
9006 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9007 fns
= TREE_OPERAND (fns
, 0);
9010 if (TREE_CODE (dname
) == COMPONENT_REF
)
9011 dname
= TREE_OPERAND (dname
, 1);
9012 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9014 my_friendly_assert (is_overloaded_fn (dname
),
9016 dname
= DECL_NAME (get_first_fn (dname
));
9021 case IDENTIFIER_NODE
:
9022 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9029 cp_error ("declarator-id missing; using reserved word `%D'",
9031 name
= IDENTIFIER_POINTER (dname
);
9033 if (! IDENTIFIER_OPNAME_P (dname
)
9034 /* GNU/Linux headers use '__op'. Arrgh. */
9035 || (IDENTIFIER_TYPENAME_P (dname
) && ! TREE_TYPE (dname
)))
9036 name
= IDENTIFIER_POINTER (dname
);
9039 if (IDENTIFIER_TYPENAME_P (dname
))
9041 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9042 flags
= TYPENAME_FLAG
;
9043 ctor_return_type
= TREE_TYPE (dname
);
9044 return_type
= return_conversion
;
9046 name
= operator_name_string (dname
);
9053 /* Perform error checking, and decide on a ctype. */
9054 tree cname
= TREE_OPERAND (decl
, 0);
9055 if (cname
== NULL_TREE
)
9057 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9060 in_namespace
= TREE_OPERAND (decl
, 0);
9061 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9063 else if (! is_aggr_type (cname
, 1))
9064 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9065 /* Must test TREE_OPERAND (decl, 1), in case user gives
9066 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9067 else if (TREE_OPERAND (decl
, 1)
9068 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9070 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9071 || TREE_CODE (cname
) == TEMPLATE_TEMPLATE_PARM
)
9073 cp_error ("`%T::%D' is not a valid declarator", cname
,
9074 TREE_OPERAND (decl
, 1));
9075 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9076 cname
, TREE_OPERAND (decl
, 1));
9077 return void_type_node
;
9079 else if (ctype
== NULL_TREE
)
9081 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9082 TREE_OPERAND (decl
, 0) = ctype
;
9085 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9087 cp_error ("type `%T' is not derived from type `%T'",
9089 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9095 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9096 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9097 == constructor_name_full (ctype
))
9098 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9099 == constructor_name (ctype
))))
9100 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9101 next
= &TREE_OPERAND (decl
, 1);
9105 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9106 && constructor_name (ctype
) == decl
)
9108 return_type
= return_ctor
;
9109 ctor_return_type
= ctype
;
9111 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9112 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9113 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9114 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9116 return_type
= return_dtor
;
9117 ctor_return_type
= ctype
;
9119 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9120 next
= &TREE_OPERAND (decl
, 0);
9131 /* Parse error puts this typespec where
9132 a declarator should go. */
9133 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9134 if (TREE_TYPE (decl
) == current_class_type
)
9135 cp_error (" perhaps you want `%T' for a constructor",
9136 current_class_name
);
9137 dname
= DECL_NAME (decl
);
9138 name
= IDENTIFIER_POINTER (dname
);
9140 /* Avoid giving two errors for this. */
9141 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9143 declspecs
= temp_tree_cons (NULL_TREE
, integer_type_node
,
9150 cp_compiler_error ("`%D' as declarator", decl
);
9151 return 0; /* We used to do a 155 abort here. */
9158 /* A function definition's declarator must have the form of
9159 a function declarator. */
9161 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9164 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9165 && innermost_code
!= CALL_EXPR
9166 && ! (ctype
&& declspecs
== NULL_TREE
))
9168 cp_error ("declaration of `%D' as non-function", dname
);
9169 return void_type_node
;
9172 /* Anything declared one level down from the top level
9173 must be one of the parameters of a function
9174 (because the body is at least two levels down). */
9176 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9177 by not allowing C++ class definitions to specify their parameters
9178 with xdecls (must be spec.d in the parmlist).
9180 Since we now wait to push a class scope until we are sure that
9181 we are in a legitimate method context, we must set oldcname
9182 explicitly (since current_class_name is not yet alive).
9184 We also want to avoid calling this a PARM if it is in a namespace. */
9186 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
9188 struct binding_level
*b
= current_binding_level
;
9189 current_binding_level
= b
->level_chain
;
9190 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9191 decl_context
= PARM
;
9192 current_binding_level
= b
;
9195 /* Look through the decl specs and record which ones appear.
9196 Some typespecs are defined as built-in typenames.
9197 Others, the ones that are modifiers of other types,
9198 are represented by bits in SPECBITS: set the bits for
9199 the modifiers that appear. Storage class keywords are also in SPECBITS.
9201 If there is a typedef name or a type, store the type in TYPE.
9202 This includes builtin typedefs such as `int'.
9204 Set EXPLICIT_INT if the type is `int' or `char' and did not
9205 come from a user typedef.
9207 Set LONGLONG if `long' is mentioned twice.
9209 For C++, constructors and destructors have their own fast treatment. */
9211 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
9216 /* Certain parse errors slip through. For example,
9217 `int class;' is not caught by the parser. Try
9218 weakly to recover here. */
9219 if (TREE_CODE (spec
) != TREE_LIST
)
9222 id
= TREE_VALUE (spec
);
9224 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9226 if (id
== ridpointers
[(int) RID_INT
]
9227 || id
== ridpointers
[(int) RID_CHAR
]
9228 || id
== ridpointers
[(int) RID_BOOL
]
9229 || id
== ridpointers
[(int) RID_WCHAR
])
9233 if (id
== ridpointers
[(int) RID_BOOL
])
9234 error ("`bool' is now a keyword");
9236 cp_error ("extraneous `%T' ignored", id
);
9240 if (id
== ridpointers
[(int) RID_INT
])
9242 else if (id
== ridpointers
[(int) RID_CHAR
])
9244 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
9248 /* C++ aggregate types. */
9249 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
9252 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
9254 type
= IDENTIFIER_TYPE_VALUE (id
);
9258 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
9260 if (ridpointers
[i
] == id
)
9262 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
9264 if (pedantic
&& ! in_system_header
&& warn_long_long
)
9265 pedwarn ("ANSI C++ does not support `long long'");
9267 error ("`long long long' is too long for GCC");
9271 else if (RIDBIT_SETP (i
, specbits
))
9272 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
9273 RIDBIT_SET (i
, specbits
);
9278 /* C++ aggregate types. */
9279 else if (TREE_CODE (id
) == TYPE_DECL
|| TREE_CODE (id
) == TEMPLATE_DECL
)
9282 cp_error ("multiple declarations `%T' and `%T'", type
,
9286 type
= TREE_TYPE (id
);
9287 TREE_VALUE (spec
) = type
;
9292 error ("two or more data types in declaration of `%s'", name
);
9293 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9295 register tree t
= lookup_name (id
, 1);
9296 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
9297 error ("`%s' fails to be a typedef or built in type",
9298 IDENTIFIER_POINTER (id
));
9301 type
= TREE_TYPE (t
);
9303 /* See the code below that used this. */
9304 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
9309 else if (id
!= error_mark_node
)
9310 /* Can't change CLASS nodes into RECORD nodes here! */
9316 typedef_type
= type
;
9318 /* No type at all: default to `int', and set DEFAULTED_INT
9319 because it was not a user-defined typedef. */
9321 if (type
== NULL_TREE
9322 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
9323 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9324 || RIDBIT_SETP (RID_LONG
, specbits
)
9325 || RIDBIT_SETP (RID_SHORT
, specbits
)))
9327 /* These imply 'int'. */
9328 type
= integer_type_node
;
9332 if (type
== NULL_TREE
)
9335 if (return_type
== return_dtor
)
9336 type
= void_type_node
;
9337 else if (return_type
== return_ctor
)
9338 type
= build_pointer_type (ctor_return_type
);
9339 else if (return_type
== return_conversion
)
9340 type
= ctor_return_type
;
9343 /* We handle `main' specially here, because 'main () { }' is so
9344 common. With no options, it is allowed. With -Wreturn-type,
9345 it is a warning. It is only an error with -pedantic-errors. */
9346 int is_main
= (funcdef_flag
9347 && MAIN_NAME_P (dname
)
9348 && ctype
== NULL_TREE
9349 && in_namespace
== NULL_TREE
9350 && current_namespace
== global_namespace
);
9352 if (in_system_header
|| flag_ms_extensions
)
9353 /* Allow it, sigh. */;
9354 else if (pedantic
|| ! is_main
)
9355 cp_pedwarn ("ANSI C++ forbids declaration `%D' with no type",
9357 else if (warn_return_type
)
9358 cp_warning ("ANSI C++ forbids declaration `%D' with no type",
9361 type
= integer_type_node
;
9364 else if (return_type
== return_dtor
)
9366 error ("return type specification for destructor invalid");
9367 type
= void_type_node
;
9369 else if (return_type
== return_ctor
)
9371 error ("return type specification for constructor invalid");
9372 type
= build_pointer_type (ctor_return_type
);
9374 else if (return_type
== return_conversion
)
9376 if (!same_type_p (type
, ctor_return_type
))
9377 cp_error ("operator `%T' declared to return `%T'",
9378 ctor_return_type
, type
);
9380 cp_pedwarn ("return type specified for `operator %T'",
9383 type
= ctor_return_type
;
9388 /* Now process the modifiers that were specified
9389 and check for invalid combinations. */
9391 /* Long double is a special combination. */
9393 if (RIDBIT_SETP (RID_LONG
, specbits
)
9394 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
9396 RIDBIT_RESET (RID_LONG
, specbits
);
9397 type
= build_qualified_type (long_double_type_node
,
9398 CP_TYPE_QUALS (type
));
9401 /* Check all other uses of type modifiers. */
9403 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9404 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9405 || RIDBIT_SETP (RID_LONG
, specbits
)
9406 || RIDBIT_SETP (RID_SHORT
, specbits
))
9410 if (TREE_CODE (type
) == REAL_TYPE
)
9411 error ("short, signed or unsigned invalid for `%s'", name
);
9412 else if (TREE_CODE (type
) != INTEGER_TYPE
)
9413 error ("long, short, signed or unsigned invalid for `%s'", name
);
9414 else if (RIDBIT_SETP (RID_LONG
, specbits
)
9415 && RIDBIT_SETP (RID_SHORT
, specbits
))
9416 error ("long and short specified together for `%s'", name
);
9417 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9418 || RIDBIT_SETP (RID_SHORT
, specbits
))
9420 error ("long or short specified with char for `%s'", name
);
9421 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9422 || RIDBIT_SETP (RID_SHORT
, specbits
))
9423 && TREE_CODE (type
) == REAL_TYPE
)
9424 error ("long or short specified with floating type for `%s'", name
);
9425 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9426 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
9427 error ("signed and unsigned given together for `%s'", name
);
9431 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
9433 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
9435 if (flag_pedantic_errors
)
9440 /* Discard the type modifiers if they are invalid. */
9443 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
9444 RIDBIT_RESET (RID_SIGNED
, specbits
);
9445 RIDBIT_RESET (RID_LONG
, specbits
);
9446 RIDBIT_RESET (RID_SHORT
, specbits
);
9451 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
9452 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
9454 error ("complex invalid for `%s'", name
);
9455 RIDBIT_RESET (RID_COMPLEX
, specbits
);
9458 /* Decide whether an integer type is signed or not.
9459 Optionally treat bitfields as signed by default. */
9460 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9463 It is implementation-defined whether a plain (neither
9464 explicitly signed or unsigned) char, short, int, or long
9465 bit-field is signed or unsigned.
9467 Naturally, we extend this to long long as well. Note that
9468 this does not include wchar_t. */
9469 || (bitfield
&& !flag_signed_bitfields
9470 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
9471 /* A typedef for plain `int' without `signed' can be
9472 controlled just like plain `int', but a typedef for
9473 `signed int' cannot be so controlled. */
9475 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
9476 && (TREE_CODE (type
) == INTEGER_TYPE
9477 || TREE_CODE (type
) == CHAR_TYPE
)
9478 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
9481 type
= long_long_unsigned_type_node
;
9482 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9483 type
= long_unsigned_type_node
;
9484 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9485 type
= short_unsigned_type_node
;
9486 else if (type
== char_type_node
)
9487 type
= unsigned_char_type_node
;
9488 else if (typedef_decl
)
9489 type
= unsigned_type (type
);
9491 type
= unsigned_type_node
;
9493 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9494 && type
== char_type_node
)
9495 type
= signed_char_type_node
;
9497 type
= long_long_integer_type_node
;
9498 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9499 type
= long_integer_type_node
;
9500 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9501 type
= short_integer_type_node
;
9503 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
9505 /* If we just have "complex", it is equivalent to
9506 "complex double", but if any modifiers at all are specified it is
9507 the complex form of TYPE. E.g, "complex short" is
9508 "complex short int". */
9510 if (defaulted_int
&& ! longlong
9511 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
9512 || RIDBIT_SETP (RID_SHORT
, specbits
)
9513 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9514 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
9515 type
= complex_double_type_node
;
9516 else if (type
== integer_type_node
)
9517 type
= complex_integer_type_node
;
9518 else if (type
== float_type_node
)
9519 type
= complex_float_type_node
;
9520 else if (type
== double_type_node
)
9521 type
= complex_double_type_node
;
9522 else if (type
== long_double_type_node
)
9523 type
= complex_long_double_type_node
;
9525 type
= build_complex_type (type
);
9528 if (return_type
== return_conversion
9529 && (RIDBIT_SETP (RID_CONST
, specbits
)
9530 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
9531 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
9532 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
9535 /* Set CONSTP if this declaration is `const', whether by
9536 explicit specification or via a typedef.
9537 Likewise for VOLATILEP. */
9539 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
9541 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
9543 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
9544 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
9545 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
9546 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
9547 type
= cp_build_qualified_type (type
, type_quals
);
9549 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
9550 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
9551 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
9552 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
9553 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
9555 if (RIDBIT_SETP (RID_STATIC
, specbits
))
9556 staticp
= 1 + (decl_context
== FIELD
);
9558 if (virtualp
&& staticp
== 2)
9560 cp_error ("member `%D' cannot be declared both virtual and static",
9564 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
9565 RIDBIT_RESET (RID_FRIEND
, specbits
);
9567 /* $7.1.2, Function specifiers */
9568 if (friendp
&& explicitp
)
9569 error ("only declarations of constructors can be `explicit'");
9571 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
9573 if (decl_context
== PARM
)
9575 error ("non-member `%s' cannot be declared `mutable'", name
);
9576 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9578 else if (friendp
|| decl_context
== TYPENAME
)
9580 error ("non-object member `%s' cannot be declared `mutable'", name
);
9581 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9585 /* Warn if two storage classes are given. Default to `auto'. */
9587 if (RIDBIT_ANY_SET (specbits
))
9589 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
9590 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
9591 if (decl_context
== PARM
&& nclasses
> 0)
9592 error ("storage class specifiers invalid in parameter declarations");
9593 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9595 if (decl_context
== PARM
)
9596 error ("typedef declaration invalid in parameter declaration");
9599 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
9600 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
9603 /* Give error if `virtual' is used outside of class declaration. */
9605 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
9607 error ("virtual outside class declaration");
9610 if (current_class_name
== NULL_TREE
&& RIDBIT_SETP (RID_MUTABLE
, specbits
))
9612 error ("only members can be declared mutable");
9613 RIDBIT_RESET (RID_MUTABLE
, specbits
);
9616 /* Static anonymous unions are dealt with here. */
9617 if (staticp
&& decl_context
== TYPENAME
9618 && TREE_CODE (declspecs
) == TREE_LIST
9619 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
9620 decl_context
= FIELD
;
9622 /* Warn about storage classes that are invalid for certain
9623 kinds of declarations (parameters, typenames, etc.). */
9626 error ("multiple storage classes in declaration of `%s'", name
);
9627 else if (decl_context
!= NORMAL
&& nclasses
> 0)
9629 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9630 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
9631 || RIDBIT_SETP (RID_AUTO
, specbits
)))
9633 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9635 else if (decl_context
== FIELD
9636 /* C++ allows static class elements */
9637 && RIDBIT_SETP (RID_STATIC
, specbits
))
9638 /* C++ also allows inlines and signed and unsigned elements,
9639 but in those cases we don't come in here. */
9643 if (decl_context
== FIELD
)
9645 tree tmp
= NULL_TREE
;
9646 register int op
= 0;
9650 /* Avoid trying to get an operand off an identifier node. */
9651 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
9654 tmp
= TREE_OPERAND (declarator
, 0);
9655 op
= IDENTIFIER_OPNAME_P (tmp
);
9657 error ("storage class specified for %s `%s'",
9658 op
? "member operator" : "field",
9659 op
? operator_name_string (tmp
) : name
);
9662 error (((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9663 ? "storage class specified for parameter `%s'"
9664 : "storage class specified for typename"), name
);
9665 RIDBIT_RESET (RID_REGISTER
, specbits
);
9666 RIDBIT_RESET (RID_AUTO
, specbits
);
9667 RIDBIT_RESET (RID_EXTERN
, specbits
);
9670 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
9672 if (toplevel_bindings_p ())
9674 /* It's common practice (and completely valid) to have a const
9675 be initialized and declared extern. */
9676 if (!(type_quals
& TYPE_QUAL_CONST
))
9677 warning ("`%s' initialized and declared `extern'", name
);
9680 error ("`%s' has both `extern' and initializer", name
);
9682 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
9683 && ! toplevel_bindings_p ())
9684 error ("nested function `%s' declared `extern'", name
);
9685 else if (toplevel_bindings_p ())
9687 if (RIDBIT_SETP (RID_AUTO
, specbits
))
9688 error ("top-level declaration of `%s' specifies `auto'", name
);
9691 if (nclasses
> 0 && friendp
)
9692 error ("storage class specifiers invalid in friend function declarations");
9694 /* Now figure out the structure of the declarator proper.
9695 Descend through it, creating more complex types, until we reach
9696 the declared identifier (or NULL_TREE, in an absolute declarator). */
9698 inner_attrs
= NULL_TREE
;
9701 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
9702 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
9704 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
9705 an INDIRECT_REF (for *...),
9706 a CALL_EXPR (for ...(...)),
9707 an identifier (for the name being declared)
9708 or a null pointer (for the place in an absolute declarator
9709 where the name was omitted).
9710 For the last two cases, we have just exited the loop.
9712 For C++ it could also be
9713 a SCOPE_REF (for class :: ...). In this case, we have converted
9714 sensible names to types, and those are the values we use to
9715 qualify the member name.
9716 an ADDR_EXPR (for &...),
9717 a BIT_NOT_EXPR (for destructors)
9719 At this point, TYPE is the type of elements of an array,
9720 or for a function to return, or for a pointer to point to.
9721 After this sequence of ifs, TYPE is the type of the
9722 array or function or pointer, and DECLARATOR has had its
9723 outermost layer removed. */
9725 if (type
== error_mark_node
)
9727 if (TREE_CODE (declarator
) == SCOPE_REF
)
9728 declarator
= TREE_OPERAND (declarator
, 1);
9730 declarator
= TREE_OPERAND (declarator
, 0);
9733 if (quals
!= NULL_TREE
9734 && (declarator
== NULL_TREE
9735 || TREE_CODE (declarator
) != SCOPE_REF
))
9737 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
9738 ctype
= TYPE_METHOD_BASETYPE (type
);
9739 if (ctype
!= NULL_TREE
)
9741 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
9742 ctype
= grok_method_quals (ctype
, dummy
, quals
);
9743 type
= TREE_TYPE (dummy
);
9748 /* See the comment for the TREE_LIST case, below. */
9751 else if (inner_attrs
)
9753 decl_attributes (type
, inner_attrs
, NULL_TREE
);
9754 inner_attrs
= NULL_TREE
;
9757 switch (TREE_CODE (declarator
))
9761 /* We encode a declarator with embedded attributes using
9762 a TREE_LIST. The attributes apply to the declarator
9763 directly inside them, so we have to skip an iteration
9764 before applying them to the type. If the declarator just
9765 inside is the declarator-id, we apply the attrs to the
9767 inner_attrs
= TREE_PURPOSE (declarator
);
9769 declarator
= TREE_VALUE (declarator
);
9775 register tree itype
= NULL_TREE
;
9776 register tree size
= TREE_OPERAND (declarator
, 1);
9777 /* The index is a signed object `sizetype' bits wide. */
9778 tree index_type
= signed_type (sizetype
);
9780 declarator
= TREE_OPERAND (declarator
, 0);
9782 /* Check for some types that there cannot be arrays of. */
9784 if (TREE_CODE (type
) == VOID_TYPE
)
9786 cp_error ("declaration of `%D' as array of voids", dname
);
9787 type
= error_mark_node
;
9790 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9792 cp_error ("declaration of `%D' as array of functions", dname
);
9793 type
= error_mark_node
;
9796 /* ARM $8.4.3: Since you can't have a pointer to a reference,
9797 you can't have arrays of references. If we allowed them,
9798 then we'd be saying x[i] is valid for an array x, but
9799 then you'd have to ask: what does `*(x + i)' mean? */
9800 if (TREE_CODE (type
) == REFERENCE_TYPE
)
9802 if (decl_context
== TYPENAME
)
9803 cp_error ("cannot make arrays of references");
9805 cp_error ("declaration of `%D' as array of references",
9807 type
= error_mark_node
;
9810 if (TREE_CODE (type
) == OFFSET_TYPE
)
9812 cp_error ("declaration of `%D' as array of data members",
9814 type
= error_mark_node
;
9817 if (TREE_CODE (type
) == METHOD_TYPE
)
9819 cp_error ("declaration of `%D' as array of function members",
9821 type
= error_mark_node
;
9824 if (size
== error_mark_node
)
9825 type
= error_mark_node
;
9826 else if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9830 the constant expressions that specify the bounds of
9831 the arrays can be omitted only for the first member
9833 cp_error ("declaration of `%D' as multidimensional array",
9835 cp_error ("must have bounds for all dimensions except the first");
9836 type
= error_mark_node
;
9839 if (type
== error_mark_node
)
9842 /* VC++ spells a zero-sized array with []. */
9843 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
9844 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9845 size
= integer_zero_node
;
9849 /* Must suspend_momentary here because the index
9850 type may need to live until the end of the function.
9851 For example, it is used in the declaration of a
9852 variable which requires destructing at the end of
9853 the function; then build_vec_delete will need this
9855 int yes
= suspend_momentary ();
9856 /* Might be a cast. */
9857 if (TREE_CODE (size
) == NOP_EXPR
9858 && TREE_TYPE (size
) == TREE_TYPE (TREE_OPERAND (size
, 0)))
9859 size
= TREE_OPERAND (size
, 0);
9860 if (TREE_READONLY_DECL_P (size
))
9861 size
= decl_constant_value (size
);
9863 /* If this involves a template parameter, it will be a
9864 constant at instantiation time, but we don't know
9865 what the value is yet. Even if no template
9866 parameters are involved, we may an expression that
9867 is not a constant; we don't even simplify `1 + 2'
9868 when processing a template. */
9869 if (processing_template_decl
)
9871 /* Resolve a qualified reference to an enumerator or
9872 static const data member of ours. */
9873 if (TREE_CODE (size
) == SCOPE_REF
9874 && TREE_OPERAND (size
, 0) == current_class_type
)
9876 tree t
= lookup_field (current_class_type
,
9877 TREE_OPERAND (size
, 1), 0, 0);
9882 itype
= build_index_type (build_min
9883 (MINUS_EXPR
, sizetype
, size
, integer_one_node
));
9884 goto dont_grok_size
;
9887 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9888 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
9889 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
9891 cp_error ("size of array `%D' has non-integer type",
9893 size
= integer_one_node
;
9895 if (pedantic
&& integer_zerop (size
))
9896 cp_pedwarn ("ANSI C++ forbids zero-size array `%D'", dname
);
9897 if (TREE_CONSTANT (size
))
9899 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9900 int old_pedantic
= pedantic
;
9901 pedantic
= flag_pedantic_errors
= 1;
9902 /* Always give overflow errors on array subscripts. */
9903 constant_expression_warning (size
);
9904 pedantic
= old_pedantic
;
9905 flag_pedantic_errors
= old_flag_pedantic_errors
;
9906 if (INT_CST_LT (size
, integer_zero_node
))
9908 cp_error ("size of array `%D' is negative", dname
);
9909 size
= integer_one_node
;
9917 cp_pedwarn ("ANSI C++ forbids variable-size array `%D'",
9920 cp_pedwarn ("ANSI C++ forbids variable-size array");
9925 = fold (build_binary_op (MINUS_EXPR
,
9926 cp_convert (index_type
, size
),
9927 cp_convert (index_type
,
9928 integer_one_node
)));
9929 if (! TREE_CONSTANT (itype
))
9930 itype
= variable_size (itype
);
9931 else if (TREE_OVERFLOW (itype
))
9933 error ("overflow in array dimension");
9934 TREE_OVERFLOW (itype
) = 0;
9937 itype
= build_index_type (itype
);
9940 resume_momentary (yes
);
9943 type
= build_cplus_array_type (type
, itype
);
9952 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
9953 tree inner_decl
= TREE_OPERAND (declarator
, 0);
9955 /* Declaring a function type.
9956 Make sure we have a valid type for the function to return. */
9958 /* We now know that the TYPE_QUALS don't apply to the
9959 decl, but to its return type. */
9960 type_quals
= TYPE_UNQUALIFIED
;
9962 /* Warn about some types functions can't return. */
9964 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9966 error ("`%s' declared as function returning a function", name
);
9967 type
= integer_type_node
;
9969 if (TREE_CODE (type
) == ARRAY_TYPE
)
9971 error ("`%s' declared as function returning an array", name
);
9972 type
= integer_type_node
;
9975 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
9976 inner_decl
= TREE_OPERAND (inner_decl
, 1);
9978 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
9981 /* Pick up type qualifiers which should be applied to `this'. */
9982 quals
= CALL_DECLARATOR_QUALS (declarator
);
9984 /* Pick up the exception specifications. */
9985 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
9987 /* Say it's a definition only for the CALL_EXPR
9988 closest to the identifier. */
9991 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
9992 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
9993 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
9995 if (ctype
== NULL_TREE
9996 && decl_context
== FIELD
9998 && (friendp
== 0 || dname
== current_class_name
))
9999 ctype
= current_class_type
;
10001 if (ctype
&& return_type
== return_conversion
)
10002 TYPE_HAS_CONVERSION (ctype
) = 1;
10003 if (ctype
&& constructor_name (ctype
) == dname
)
10005 /* We are within a class's scope. If our declarator name
10006 is the same as the class name, and we are defining
10007 a function, then it is a constructor/destructor, and
10008 therefore returns a void type. */
10010 if (flags
== DTOR_FLAG
)
10012 /* ANSI C++ June 5 1992 WP 12.4.1. A destructor may
10013 not be declared const or volatile. A destructor
10014 may not be static. */
10016 error ("destructor cannot be static member function");
10019 cp_error ("destructors may not be `%s'",
10020 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10023 if (decl_context
== FIELD
)
10025 if (! member_function_or_else (ctype
, current_class_type
,
10026 "destructor for alien class `%s' cannot be a member"))
10027 return void_type_node
;
10030 else /* It's a constructor. */
10032 if (explicitp
== 1)
10034 /* ANSI C++ June 5 1992 WP 12.1.2. A constructor may
10035 not be declared const or volatile. A constructor may
10036 not be virtual. A constructor may not be static. */
10038 error ("constructor cannot be static member function");
10041 pedwarn ("constructors cannot be declared virtual");
10046 cp_error ("constructors may not be `%s'",
10047 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10051 RID_BIT_TYPE tmp_bits
;
10052 bcopy ((void*)&specbits
, (void*)&tmp_bits
, sizeof (RID_BIT_TYPE
));
10053 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10054 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10055 if (RIDBIT_ANY_SET (tmp_bits
))
10056 error ("return value type specifier for constructor ignored");
10058 type
= build_pointer_type (ctype
);
10059 if (decl_context
== FIELD
)
10061 if (! member_function_or_else (ctype
, current_class_type
,
10062 "constructor for alien class `%s' cannot be member"))
10063 return void_type_node
;
10064 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10065 if (return_type
!= return_ctor
)
10069 if (decl_context
== FIELD
)
10075 error ("can't initialize friend function `%s'", name
);
10078 /* Cannot be both friend and virtual. */
10079 error ("virtual functions cannot be friends");
10080 RIDBIT_RESET (RID_FRIEND
, specbits
);
10083 if (decl_context
== NORMAL
)
10084 error ("friend declaration not in class definition");
10085 if (current_function_decl
&& funcdef_flag
)
10086 cp_error ("can't define friend function `%s' in a local class definition",
10090 /* Construct the function type and go to the next
10091 inner layer of declarator. */
10093 declarator
= TREE_OPERAND (declarator
, 0);
10095 /* FIXME: This is where default args should be fully
10098 arg_types
= grokparms (inner_parms
, funcdecl_p
? funcdef_flag
: 0);
10100 if (declarator
&& flags
== DTOR_FLAG
)
10102 /* A destructor declared in the body of a class will
10103 be represented as a BIT_NOT_EXPR. But, we just
10104 want the underlying IDENTIFIER. */
10105 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10106 declarator
= TREE_OPERAND (declarator
, 0);
10108 if (strict_prototype
== 0 && arg_types
== NULL_TREE
)
10109 arg_types
= void_list_node
;
10110 else if (arg_types
== NULL_TREE
10111 || arg_types
!= void_list_node
)
10113 cp_error ("destructors may not have parameters");
10114 arg_types
= void_list_node
;
10115 last_function_parms
= NULL_TREE
;
10119 /* ANSI says that `const int foo ();'
10120 does not make the function foo const. */
10121 type
= build_function_type (type
, arg_types
);
10125 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10126 if (TREE_PURPOSE (t
)
10127 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10129 add_defarg_fn (type
);
10138 /* Filter out pointers-to-references and references-to-references.
10139 We can get these if a TYPE_DECL is used. */
10141 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10143 error ("cannot declare %s to references",
10144 TREE_CODE (declarator
) == ADDR_EXPR
10145 ? "references" : "pointers");
10146 declarator
= TREE_OPERAND (declarator
, 0);
10150 if (TREE_CODE (type
) == OFFSET_TYPE
10151 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10152 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10154 cp_error ("cannot declare pointer to `%#T' member",
10156 type
= TREE_TYPE (type
);
10159 /* Merge any constancy or volatility into the target type
10160 for the pointer. */
10162 /* We now know that the TYPE_QUALS don't apply to the decl,
10163 but to the target of the pointer. */
10164 type_quals
= TYPE_UNQUALIFIED
;
10166 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10168 if (TREE_CODE (type
) == VOID_TYPE
)
10169 error ("invalid type: `void &'");
10171 type
= build_reference_type (type
);
10173 else if (TREE_CODE (type
) == METHOD_TYPE
)
10174 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10176 type
= build_pointer_type (type
);
10178 /* Process a list of type modifier keywords (such as
10179 const or volatile) that were given inside the `*' or `&'. */
10181 if (TREE_TYPE (declarator
))
10183 register tree typemodlist
;
10189 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10190 typemodlist
= TREE_CHAIN (typemodlist
))
10192 tree qualifier
= TREE_VALUE (typemodlist
);
10194 if (qualifier
== ridpointers
[(int) RID_CONST
])
10196 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10198 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10203 error ("invalid type modifier within pointer declarator");
10207 pedwarn ("duplicate `const'");
10209 pedwarn ("duplicate `volatile'");
10211 pedwarn ("duplicate `restrict'");
10213 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10214 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10215 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10216 if (TREE_CODE (declarator
) == ADDR_EXPR
10217 && (constp
|| volatilep
))
10220 pedwarn ("discarding `const' applied to a reference");
10222 pedwarn ("discarding `volatile' applied to a reference");
10223 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10225 type
= cp_build_qualified_type (type
, type_quals
);
10227 declarator
= TREE_OPERAND (declarator
, 0);
10233 /* We have converted type names to NULL_TREE if the
10234 name was bogus, or to a _TYPE node, if not.
10236 The variable CTYPE holds the type we will ultimately
10237 resolve to. The code here just needs to build
10238 up appropriate member types. */
10239 tree sname
= TREE_OPERAND (declarator
, 1);
10242 /* Destructors can have their visibilities changed as well. */
10243 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10244 sname
= TREE_OPERAND (sname
, 0);
10246 if (TREE_COMPLEXITY (declarator
) == 0)
10247 /* This needs to be here, in case we are called
10248 multiple times. */ ;
10249 else if (TREE_COMPLEXITY (declarator
) == -1)
10250 /* Namespace member. */
10251 pop_decl_namespace ();
10252 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10253 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10254 else if (! IS_AGGR_TYPE_CODE
10255 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10257 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10259 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10260 that refer to ctype. They couldn't be resolved earlier
10261 because we hadn't pushed into the class yet.
10262 Example: resolve 'B<T>::type' in
10263 'B<typename B<T>::type> B<T>::f () { }'. */
10264 if (current_template_parms
10265 && uses_template_parms (type
)
10266 && uses_template_parms (current_class_type
))
10268 tree args
= current_template_args ();
10269 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10272 /* This pop_nested_class corresponds to the
10273 push_nested_class used to push into class scope for
10274 parsing the argument list of a function decl, in
10276 pop_nested_class ();
10277 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10280 my_friendly_abort (16);
10282 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10284 /* We had a reference to a global decl, or
10285 perhaps we were given a non-aggregate typedef,
10286 in which case we cleared this out, and should just
10287 keep going as though it wasn't there. */
10288 declarator
= sname
;
10291 ctype
= TREE_OPERAND (declarator
, 0);
10294 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10296 if (CLASSTYPE_TEMPLATE_INFO (t
) &&
10297 !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
10298 template_count
+= 1;
10299 t
= TYPE_MAIN_DECL (t
);
10300 if (DECL_LANG_SPECIFIC (t
))
10301 t
= DECL_CLASS_CONTEXT (t
);
10306 if (sname
== NULL_TREE
)
10309 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10311 /* This is the `standard' use of the scoping operator:
10312 basetype :: member . */
10314 if (ctype
== current_class_type
)
10320 Is this ill-formed? */
10323 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10326 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10328 if (current_class_type
== NULL_TREE
10330 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10331 TYPE_ARG_TYPES (type
));
10334 cp_error ("cannot declare member function `%T::%s' within `%T'",
10335 ctype
, name
, current_class_type
);
10336 return void_type_node
;
10339 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10340 || TYPE_SIZE (complete_type (ctype
)) != NULL_TREE
)
10342 /* Have to move this code elsewhere in this function.
10343 this code is used for i.e., typedef int A::M; M *pm;
10345 It is? How? jason 10/2/94 */
10347 if (current_class_type
)
10349 cp_error ("cannot declare member `%T::%s' within `%T'",
10350 ctype
, name
, current_class_type
);
10351 return void_type_node
;
10353 type
= build_offset_type (ctype
, type
);
10355 else if (uses_template_parms (ctype
))
10357 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10359 = build_cplus_method_type (ctype
, TREE_TYPE (type
),
10360 TYPE_ARG_TYPES (type
));
10364 cp_error ("structure `%T' not yet defined", ctype
);
10365 return error_mark_node
;
10368 declarator
= sname
;
10370 else if (TREE_CODE (sname
) == SCOPE_REF
)
10371 my_friendly_abort (17);
10375 declarator
= TREE_OPERAND (declarator
, 1);
10376 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10377 /* In this case, we will deal with it later. */
10381 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10382 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10383 TYPE_ARG_TYPES (type
));
10385 type
= build_offset_type (ctype
, type
);
10392 declarator
= TREE_OPERAND (declarator
, 0);
10397 case ENUMERAL_TYPE
:
10398 declarator
= NULL_TREE
;
10402 declarator
= NULL_TREE
;
10406 my_friendly_abort (158);
10410 /* See the comment for the TREE_LIST case, above. */
10413 if (! ignore_attrs
)
10414 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10416 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
10418 attrlist
= build_decl_list (NULL_TREE
, inner_attrs
);
10421 /* Now TYPE has the actual type. */
10423 if (explicitp
== 1)
10425 error ("only constructors can be declared `explicit'");
10429 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10431 if (type_quals
& TYPE_QUAL_CONST
)
10433 error ("const `%s' cannot be declared `mutable'", name
);
10434 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10438 error ("static `%s' cannot be declared `mutable'", name
);
10439 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10443 if (declarator
== NULL_TREE
10444 || TREE_CODE (declarator
) == IDENTIFIER_NODE
10445 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
10446 && (TREE_CODE (type
) == FUNCTION_TYPE
10447 || TREE_CODE (type
) == METHOD_TYPE
)))
10449 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10451 cp_error ("template-id `%D' used as a declarator", declarator
);
10452 declarator
= dname
;
10455 /* Unexpected declarator format. */
10456 my_friendly_abort (990210);
10458 /* If this is declaring a typedef name, return a TYPE_DECL. */
10460 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
10464 /* Note that the grammar rejects storage classes
10465 in typenames, fields or parameters. */
10466 if (current_lang_name
== lang_name_java
)
10467 TYPE_FOR_JAVA (type
) = 1;
10469 if (decl_context
== FIELD
)
10471 if (declarator
== constructor_name (current_class_type
))
10472 cp_pedwarn ("ANSI C++ forbids nested type `%D' with same name as enclosing class",
10474 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10478 /* Make sure this typedef lives as long as its type,
10479 since it might be used as a template parameter. */
10480 if (type
!= error_mark_node
)
10481 push_obstacks (TYPE_OBSTACK (type
), TYPE_OBSTACK (type
));
10482 if (processing_template_decl
)
10483 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10485 decl
= build_decl (TYPE_DECL
, declarator
, type
);
10486 if (type
!= error_mark_node
)
10490 /* If the user declares "typedef struct {...} foo" then the
10491 struct will have an anonymous name. Fill that name in now.
10492 Nothing can refer to it, so nothing needs know about the name
10494 if (type
!= error_mark_node
10495 && TYPE_NAME (type
)
10496 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
10497 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
10498 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
10500 tree oldname
= TYPE_NAME (type
);
10503 /* Replace the anonymous name with the real name everywhere. */
10504 lookup_tag_reverse (type
, declarator
);
10505 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
10506 if (TYPE_NAME (t
) == oldname
)
10507 TYPE_NAME (t
) = decl
;
10509 if (TYPE_LANG_SPECIFIC (type
))
10510 TYPE_WAS_ANONYMOUS (type
) = 1;
10512 /* If this is a typedef within a template class, the nested
10513 type is a (non-primary) template. The name for the
10514 template needs updating as well. */
10515 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
10516 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
10517 = TYPE_IDENTIFIER (type
);
10519 /* XXX Temporarily set the scope.
10520 When returning, start_decl expects it as NULL_TREE,
10521 and will then then set it using pushdecl. */
10522 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
10523 if (current_class_type
)
10524 DECL_CONTEXT (decl
) = current_class_type
;
10526 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
10528 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
10529 DECL_ASSEMBLER_NAME (decl
)
10530 = get_identifier (build_overload_name (type
, 1, 1));
10531 DECL_CONTEXT (decl
) = NULL_TREE
;
10533 /* FIXME remangle member functions; member functions of a
10534 type with external linkage have external linkage. */
10537 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10539 cp_error_at ("typedef name may not be class-qualified", decl
);
10544 if (ctype
== NULL_TREE
)
10546 if (TREE_CODE (type
) != METHOD_TYPE
)
10547 cp_error_at ("invalid type qualifier for non-method type", decl
);
10549 ctype
= TYPE_METHOD_BASETYPE (type
);
10551 if (ctype
!= NULL_TREE
)
10552 grok_method_quals (ctype
, decl
, quals
);
10555 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10556 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
10557 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
10559 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10560 error ("non-object member `%s' cannot be declared mutable", name
);
10562 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
10563 inlinep
, friendp
, raises
!= NULL_TREE
);
10566 error ("typedef declaration includes an initializer");
10571 /* Detect the case of an array type of unspecified size
10572 which came, as such, direct from a typedef name.
10573 We must copy the type, so that each identifier gets
10574 a distinct type, so that each identifier's size can be
10575 controlled separately by its own initializer. */
10577 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
10578 && TYPE_DOMAIN (type
) == NULL_TREE
)
10580 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
10583 /* If this is a type name (such as, in a cast or sizeof),
10584 compute the type and return it now. */
10586 if (decl_context
== TYPENAME
)
10588 /* Note that the grammar rejects storage classes
10589 in typenames, fields or parameters. */
10590 if (type_quals
!= TYPE_UNQUALIFIED
)
10591 type_quals
= TYPE_UNQUALIFIED
;
10593 /* Special case: "friend class foo" looks like a TYPENAME context. */
10596 if (type_quals
!= TYPE_UNQUALIFIED
)
10598 cp_error ("type qualifiers specified for friend class declaration");
10599 type_quals
= TYPE_UNQUALIFIED
;
10603 cp_error ("`inline' specified for friend class declaration");
10607 /* Only try to do this stuff if we didn't already give up. */
10608 if (type
!= integer_type_node
)
10610 /* A friendly class? */
10611 if (current_class_type
)
10612 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
10614 error ("trying to make class `%s' a friend of global scope",
10615 TYPE_NAME_STRING (type
));
10616 type
= void_type_node
;
10621 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
10622 if (ctype
== NULL_TREE
)
10624 my_friendly_assert (TREE_CODE (type
) == METHOD_TYPE
, 159);
10625 ctype
= TYPE_METHOD_BASETYPE (type
);
10627 grok_method_quals (ctype
, dummy
, quals
);
10628 type
= TREE_TYPE (dummy
);
10633 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
10634 && decl_context
!= CATCHPARM
10635 && TREE_CODE (type
) != UNION_TYPE
10638 cp_error ("abstract declarator `%T' used as declaration", type
);
10639 declarator
= make_anon_name ();
10642 /* `void' at top level (not within pointer)
10643 is allowed only in typedefs or type names.
10644 We don't complain about parms either, but that is because
10645 a better error message can be made later. */
10647 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
10650 error ("unnamed variable or field declared void");
10651 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10653 if (IDENTIFIER_OPNAME_P (declarator
))
10654 my_friendly_abort (356);
10656 error ("variable or field `%s' declared void", name
);
10659 error ("variable or field declared void");
10660 type
= integer_type_node
;
10663 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
10664 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
10666 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10668 if (ctype
|| in_namespace
)
10669 error ("cannot use `::' in parameter declaration");
10671 /* A parameter declared as an array of T is really a pointer to T.
10672 One declared as a function is really a pointer to a function.
10673 One declared as a member is really a pointer to member. */
10675 if (TREE_CODE (type
) == ARRAY_TYPE
)
10677 /* Transfer const-ness of array into that of type pointed to. */
10678 type
= build_pointer_type (TREE_TYPE (type
));
10679 type_quals
= TYPE_UNQUALIFIED
;
10681 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10682 type
= build_pointer_type (type
);
10683 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10684 type
= build_pointer_type (type
);
10685 else if (TREE_CODE (type
) == VOID_TYPE
&& declarator
)
10687 error ("declaration of `%s' as void", name
);
10693 register tree decl
;
10695 if (decl_context
== PARM
)
10697 decl
= build_decl (PARM_DECL
, declarator
, type
);
10699 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
10700 inlinep
, friendp
, raises
!= NULL_TREE
);
10702 /* Compute the type actually passed in the parmlist,
10703 for the case where there is no prototype.
10704 (For example, shorts and chars are passed as ints.)
10705 When there is a prototype, this is overridden later. */
10707 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
10709 else if (decl_context
== FIELD
)
10711 if (type
== error_mark_node
)
10713 /* Happens when declaring arrays of sizes which
10714 are error_mark_node, for example. */
10717 else if (in_namespace
&& !friendp
)
10719 /* Something like struct S { int N::j; }; */
10720 cp_error ("invalid use of `::'");
10723 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10726 tree function_context
;
10728 /* We catch the others as conflicts with the builtin
10730 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
10732 cp_error ("function `%D' cannot be declared friend",
10739 if (ctype
== NULL_TREE
)
10740 ctype
= current_class_type
;
10742 if (ctype
== NULL_TREE
)
10744 cp_error ("can't make `%D' into a method -- not in a class",
10746 return void_type_node
;
10749 /* ``A union may [ ... ] not [ have ] virtual functions.''
10751 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
10753 cp_error ("function `%D' declared virtual inside a union",
10755 return void_type_node
;
10758 if (declarator
== ansi_opname
[(int) NEW_EXPR
]
10759 || declarator
== ansi_opname
[(int) VEC_NEW_EXPR
]
10760 || declarator
== ansi_opname
[(int) DELETE_EXPR
]
10761 || declarator
== ansi_opname
[(int) VEC_DELETE_EXPR
])
10765 cp_error ("`%D' cannot be declared virtual, since it is always static",
10770 else if (staticp
< 2)
10771 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10772 TYPE_ARG_TYPES (type
));
10775 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
10776 function_context
= (ctype
!= NULL_TREE
) ?
10777 hack_decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
10778 publicp
= (! friendp
|| ! staticp
)
10779 && function_context
== NULL_TREE
;
10780 decl
= grokfndecl (ctype
, type
,
10781 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
10782 ? declarator
: dname
,
10784 virtualp
, flags
, quals
, raises
,
10785 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
10786 funcdef_flag
, template_count
, in_namespace
);
10787 if (decl
== NULL_TREE
)
10790 /* This clobbers the attrs stored in `decl' from `attrlist'. */
10791 /* The decl and setting of decl_machine_attr is also turned off. */
10792 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
10795 /* [class.conv.ctor]
10797 A constructor declared without the function-specifier
10798 explicit that can be called with a single parameter
10799 specifies a conversion from the type of its first
10800 parameter to the type of its class. Such a constructor
10801 is called a converting constructor. */
10802 if (explicitp
== 2)
10803 DECL_NONCONVERTING_P (decl
) = 1;
10804 else if (DECL_CONSTRUCTOR_P (decl
))
10806 /* The constructor can be called with exactly one
10807 parameter if there is at least one parameter, and
10808 any subsequent parameters have default arguments.
10809 We don't look at the first parameter, which is
10810 really just the `this' parameter for the new
10813 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
10815 /* Skip the `in_chrg' argument too, if present. */
10816 if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (decl
)))
10817 arg_types
= TREE_CHAIN (arg_types
);
10819 if (arg_types
== void_list_node
10821 && TREE_CHAIN (arg_types
)
10822 && TREE_CHAIN (arg_types
) != void_list_node
10823 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
10824 DECL_NONCONVERTING_P (decl
) = 1;
10827 else if (TREE_CODE (type
) == METHOD_TYPE
)
10829 /* We only get here for friend declarations of
10830 members of other classes. */
10831 /* All method decls are public, so tell grokfndecl to set
10832 TREE_PUBLIC, also. */
10833 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
10834 virtualp
, flags
, quals
, raises
,
10835 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
10836 template_count
, in_namespace
);
10837 if (decl
== NULL_TREE
)
10840 else if (!staticp
&& ! processing_template_decl
10841 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
10842 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
10845 cp_error ("field `%D' has incomplete type", declarator
);
10847 cp_error ("name `%T' has incomplete type", type
);
10849 /* If we're instantiating a template, tell them which
10850 instantiation made the field's type be incomplete. */
10851 if (current_class_type
10852 && TYPE_NAME (current_class_type
)
10853 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
10854 && declspecs
&& TREE_VALUE (declspecs
)
10855 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
10856 cp_error (" in instantiation of template `%T'",
10857 current_class_type
);
10859 type
= error_mark_node
;
10866 error ("`%s' is neither function nor method; cannot be declared friend",
10867 IDENTIFIER_POINTER (declarator
));
10875 /* Friends are treated specially. */
10876 if (ctype
== current_class_type
)
10877 warning ("member functions are implicitly friends of their class");
10880 tree t
= NULL_TREE
;
10881 if (decl
&& DECL_NAME (decl
))
10883 if (template_class_depth (current_class_type
) == 0)
10886 = check_explicit_specialization
10888 template_count
, 2 * (funcdef_flag
!= 0) + 4);
10889 if (decl
== error_mark_node
)
10890 return error_mark_node
;
10893 t
= do_friend (ctype
, declarator
, decl
,
10894 last_function_parms
, attrlist
, flags
, quals
,
10897 if (t
&& funcdef_flag
)
10900 return void_type_node
;
10904 /* Structure field. It may not be a function, except for C++ */
10906 if (decl
== NULL_TREE
)
10912 /* An attempt is being made to initialize a non-static
10913 member. But, from [class.mem]:
10915 4 A member-declarator can contain a
10916 constant-initializer only if it declares a static
10917 member (_class.static_) of integral or enumeration
10918 type, see _class.static.data_.
10920 This used to be relatively common practice, but
10921 the rest of the compiler does not correctly
10922 handle the initialization unless the member is
10923 static so we make it static below. */
10924 cp_pedwarn ("ANSI C++ forbids initialization of member `%D'",
10926 cp_pedwarn ("making `%D' static", declarator
);
10930 if (uses_template_parms (type
))
10931 /* We'll check at instantiation time. */
10933 else if (check_static_variable_definition (declarator
,
10935 /* If we just return the declaration, crashes
10936 will sometimes occur. We therefore return
10937 void_type_node, as if this was a friend
10938 declaration, to cause callers to completely
10939 ignore this declaration. */
10940 return void_type_node
;
10943 /* 9.2p13 [class.mem] */
10944 if (declarator
== constructor_name (current_class_type
)
10945 /* Divergence from the standard: In extern "C", we
10946 allow non-static data members here, because C does
10947 and /usr/include/netinet/in.h uses that. */
10948 && (staticp
|| ! in_system_header
))
10949 cp_pedwarn ("ANSI C++ forbids data member `%D' with same name as enclosing class",
10954 /* C++ allows static class members. All other work
10955 for this is done by grokfield. */
10956 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
10957 TREE_STATIC (decl
) = 1;
10958 /* In class context, 'static' means public access. */
10959 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
10963 decl
= build_lang_decl (FIELD_DECL
, declarator
, type
);
10964 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10966 DECL_MUTABLE_P (decl
) = 1;
10967 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10971 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
10972 inlinep
, friendp
, raises
!= NULL_TREE
);
10975 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10977 tree original_name
;
10983 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10984 original_name
= dname
;
10986 original_name
= declarator
;
10988 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10989 error ("storage class `auto' invalid for function `%s'", name
);
10990 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
10991 error ("storage class `register' invalid for function `%s'", name
);
10993 /* Function declaration not at top level.
10994 Storage classes other than `extern' are not allowed
10995 and `extern' makes no difference. */
10996 if (! toplevel_bindings_p ()
10997 && (RIDBIT_SETP (RID_STATIC
, specbits
)
10998 || RIDBIT_SETP (RID_INLINE
, specbits
))
11001 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11002 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
11004 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
11007 if (ctype
== NULL_TREE
)
11011 error ("virtual non-class function `%s'", name
);
11015 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
11016 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11017 TYPE_ARG_TYPES (type
));
11019 /* Record presence of `static'. */
11020 publicp
= (ctype
!= NULL_TREE
11021 || RIDBIT_SETP (RID_EXTERN
, specbits
)
11022 || !RIDBIT_SETP (RID_STATIC
, specbits
));
11024 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
11025 virtualp
, flags
, quals
, raises
,
11027 publicp
, inlinep
, funcdef_flag
,
11028 template_count
, in_namespace
);
11029 if (decl
== NULL_TREE
)
11034 int illegal_static
= 0;
11036 /* Don't allow a static member function in a class, and forbid
11037 declaring main to be static. */
11038 if (TREE_CODE (type
) == METHOD_TYPE
)
11040 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11041 illegal_static
= 1;
11043 else if (current_function_decl
)
11045 /* FIXME need arm citation */
11046 error ("cannot declare static function inside another function");
11047 illegal_static
= 1;
11050 if (illegal_static
)
11053 RIDBIT_RESET (RID_STATIC
, specbits
);
11059 /* It's a variable. */
11061 /* An uninitialized decl with `extern' is a reference. */
11062 decl
= grokvardecl (type
, declarator
, &specbits
,
11064 (type_quals
& TYPE_QUAL_CONST
) != 0,
11066 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11067 inlinep
, friendp
, raises
!= NULL_TREE
);
11071 DECL_CONTEXT (decl
) = ctype
;
11074 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11076 RIDBIT_RESET (RID_STATIC
, specbits
);
11078 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11080 cp_error ("static member `%D' declared `register'", decl
);
11081 RIDBIT_RESET (RID_REGISTER
, specbits
);
11083 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11085 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11087 RIDBIT_RESET (RID_EXTERN
, specbits
);
11092 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11094 error ("`%s' cannot be declared mutable", name
);
11097 /* Record `register' declaration for warnings on &
11098 and in case doing stupid register allocation. */
11100 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11101 DECL_REGISTER (decl
) = 1;
11103 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11104 DECL_THIS_EXTERN (decl
) = 1;
11106 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11107 DECL_THIS_STATIC (decl
) = 1;
11109 /* Record constancy and volatility. There's no need to do this
11110 when processing a template; we'll do this for the instantiated
11111 declaration based on the type of DECL. */
11112 if (!processing_template_decl
)
11113 c_apply_type_quals_to_decl (type_quals
, decl
);
11119 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11120 An empty exprlist is a parmlist. An exprlist which
11121 contains only identifiers at the global level
11122 is a parmlist. Otherwise, it is an exprlist. */
11125 parmlist_is_exprlist (exprs
)
11128 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11131 if (toplevel_bindings_p ())
11133 /* At the global level, if these are all identifiers,
11134 then it is a parmlist. */
11137 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11139 exprs
= TREE_CHAIN (exprs
);
11146 /* Subroutine of start_function. Ensure that each of the parameter
11147 types (as listed in PARMS) is complete, as is required for a
11148 function definition. */
11151 require_complete_types_for_parms (parms
)
11156 tree type
= TREE_TYPE (parms
);
11157 if (TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
11159 if (DECL_NAME (parms
))
11160 error ("parameter `%s' has incomplete type",
11161 IDENTIFIER_POINTER (DECL_NAME (parms
)));
11163 error ("parameter has incomplete type");
11164 TREE_TYPE (parms
) = error_mark_node
;
11167 layout_decl (parms
, 0);
11169 parms
= TREE_CHAIN (parms
);
11173 /* Returns DECL if DECL is a local variable (or parameter). Returns
11174 NULL_TREE otherwise. */
11177 local_variable_p (t
)
11180 if ((TREE_CODE (t
) == VAR_DECL
11181 /* A VAR_DECL with a context that is a _TYPE is a static data
11183 && !TYPE_P (CP_DECL_CONTEXT (t
))
11184 /* Any other non-local variable must be at namespace scope. */
11185 && TREE_CODE (CP_DECL_CONTEXT (t
)) != NAMESPACE_DECL
)
11186 || (TREE_CODE (t
) == PARM_DECL
))
11192 /* Check that ARG, which is a default-argument expression for a
11193 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11194 something goes wrong. DECL may also be a _TYPE node, rather than a
11195 DECL, if there is no DECL available. */
11198 check_default_argument (decl
, arg
)
11205 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11206 /* We get a DEFAULT_ARG when looking at an in-class declaration
11207 with a default argument. Ignore the argument for now; we'll
11208 deal with it after the class is complete. */
11211 if (processing_template_decl
|| uses_template_parms (arg
))
11212 /* We don't do anything checking until instantiation-time. Note
11213 that there may be uninstantiated arguments even for an
11214 instantiated function, since default arguments are not
11215 instantiated until they are needed. */
11224 decl_type
= TREE_TYPE (decl
);
11226 if (arg
== error_mark_node
11227 || decl
== error_mark_node
11228 || TREE_TYPE (arg
) == error_mark_node
11229 || decl_type
== error_mark_node
)
11230 /* Something already went wrong. There's no need to check
11232 return error_mark_node
;
11234 /* [dcl.fct.default]
11236 A default argument expression is implicitly converted to the
11238 if (!TREE_TYPE (arg
)
11239 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11242 cp_error ("default argument for `%#D' has type `%T'",
11243 decl
, TREE_TYPE (arg
));
11245 cp_error ("default argument for parameter of type `%T' has type `%T'",
11246 decl_type
, TREE_TYPE (arg
));
11248 return error_mark_node
;
11251 /* [dcl.fct.default]
11253 Local variables shall not be used in default argument
11256 The keyword `this' shall not be used in a default argument of a
11257 member function. */
11258 var
= search_tree (arg
, local_variable_p
);
11261 cp_error ("default argument `%E' uses local variable `%D'",
11263 return error_mark_node
;
11270 /* Decode the list of parameter types for a function type.
11271 Given the list of things declared inside the parens,
11272 return a list of types.
11274 The list we receive can have three kinds of elements:
11275 an IDENTIFIER_NODE for names given without types,
11276 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11277 or void_type_node, to mark the end of an argument list
11278 when additional arguments are not permitted (... was not used).
11280 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11281 a mere declaration. A nonempty identifier-list gets an error message
11282 when FUNCDEF_FLAG is zero.
11283 If FUNCDEF_FLAG is 1, then parameter types must be complete.
11284 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11286 If all elements of the input list contain types,
11287 we return a list of the types.
11288 If all elements contain no type (except perhaps a void_type_node
11289 at the end), we return a null list.
11290 If some have types and some do not, it is an error, and we
11291 return a null list.
11293 Also set last_function_parms to either
11294 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11295 A list of names is converted to a chain of PARM_DECLs
11296 by store_parm_decls so that ultimately it is always a chain of decls.
11298 Note that in C++, parameters can take default values. These default
11299 values are in the TREE_PURPOSE field of the TREE_LIST. It is
11300 an error to specify default values which are followed by parameters
11301 that have no default values, or an ELLIPSES. For simplicities sake,
11302 only parameters which are specified with their types can take on
11306 grokparms (first_parm
, funcdef_flag
)
11310 tree result
= NULL_TREE
;
11311 tree decls
= NULL_TREE
;
11313 if (first_parm
!= NULL_TREE
11314 && TREE_CODE (TREE_VALUE (first_parm
)) == IDENTIFIER_NODE
)
11316 if (! funcdef_flag
)
11317 pedwarn ("parameter names (without types) in function declaration");
11318 last_function_parms
= first_parm
;
11321 else if (first_parm
!= NULL_TREE
11322 && TREE_CODE (TREE_VALUE (first_parm
)) != TREE_LIST
11323 && TREE_CODE (TREE_VALUE (first_parm
)) != VOID_TYPE
)
11324 my_friendly_abort (145);
11327 /* Types were specified. This is a list of declarators
11328 each represented as a TREE_LIST node. */
11329 register tree parm
, chain
;
11330 int any_init
= 0, any_error
= 0;
11332 if (first_parm
!= NULL_TREE
)
11334 tree last_result
= NULL_TREE
;
11335 tree last_decl
= NULL_TREE
;
11337 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11339 tree type
= NULL_TREE
, list_node
= parm
;
11340 register tree decl
= TREE_VALUE (parm
);
11341 tree init
= TREE_PURPOSE (parm
);
11343 chain
= TREE_CHAIN (parm
);
11344 /* @@ weak defense against parse errors. */
11345 if (TREE_CODE (decl
) != VOID_TYPE
11346 && TREE_CODE (decl
) != TREE_LIST
)
11348 /* Give various messages as the need arises. */
11349 if (TREE_CODE (decl
) == STRING_CST
)
11350 cp_error ("invalid string constant `%E'", decl
);
11351 else if (TREE_CODE (decl
) == INTEGER_CST
)
11352 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11356 if (TREE_CODE (decl
) != VOID_TYPE
)
11358 decl
= grokdeclarator (TREE_VALUE (decl
),
11359 TREE_PURPOSE (decl
),
11360 PARM
, init
!= NULL_TREE
,
11362 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
11365 /* Top-level qualifiers on the parameters are
11366 ignored for function types. */
11367 type
= TYPE_MAIN_VARIANT (TREE_TYPE (decl
));
11369 if (TREE_CODE (type
) == VOID_TYPE
)
11370 decl
= void_type_node
;
11371 else if (TREE_CODE (type
) == METHOD_TYPE
)
11373 if (DECL_NAME (decl
))
11374 /* Cannot use the decl here because
11375 we don't have DECL_CONTEXT set up yet. */
11376 cp_error ("parameter `%D' invalidly declared method type",
11379 error ("parameter invalidly declared method type");
11380 type
= build_pointer_type (type
);
11381 TREE_TYPE (decl
) = type
;
11383 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11385 if (DECL_NAME (decl
))
11386 cp_error ("parameter `%D' invalidly declared offset type",
11389 error ("parameter invalidly declared offset type");
11390 type
= build_pointer_type (type
);
11391 TREE_TYPE (decl
) = type
;
11393 else if (abstract_virtuals_error (decl
, type
))
11394 any_error
= 1; /* Seems like a good idea. */
11395 else if (POINTER_TYPE_P (type
))
11398 while (POINTER_TYPE_P (t
)
11399 || (TREE_CODE (t
) == ARRAY_TYPE
11400 && TYPE_DOMAIN (t
) != NULL_TREE
))
11402 if (TREE_CODE (t
) == ARRAY_TYPE
)
11403 cp_error ("parameter type `%T' includes %s to array of unknown bound",
11405 TYPE_PTR_P (type
) ? "pointer" : "reference");
11409 if (TREE_CODE (decl
) == VOID_TYPE
)
11411 if (result
== NULL_TREE
)
11413 result
= void_list_node
;
11414 last_result
= result
;
11418 TREE_CHAIN (last_result
) = void_list_node
;
11419 last_result
= void_list_node
;
11422 && (chain
!= void_list_node
|| TREE_CHAIN (chain
)))
11423 error ("`void' in parameter list must be entire list");
11427 /* Since there is a prototype, args are passed in their own types. */
11428 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
11429 if (PROMOTE_PROTOTYPES
11430 && (TREE_CODE (type
) == INTEGER_TYPE
11431 || TREE_CODE (type
) == ENUMERAL_TYPE
)
11432 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
11433 DECL_ARG_TYPE (decl
) = integer_type_node
;
11434 if (!any_error
&& init
)
11437 init
= check_default_argument (decl
, init
);
11442 if (decls
== NULL_TREE
)
11449 TREE_CHAIN (last_decl
) = decl
;
11452 list_node
= tree_cons (init
, type
, NULL_TREE
);
11453 if (result
== NULL_TREE
)
11455 result
= list_node
;
11456 last_result
= result
;
11460 TREE_CHAIN (last_result
) = list_node
;
11461 last_result
= list_node
;
11465 TREE_CHAIN (last_result
) = NULL_TREE
;
11466 /* If there are no parameters, and the function does not end
11467 with `...', then last_decl will be NULL_TREE. */
11468 if (last_decl
!= NULL_TREE
)
11469 TREE_CHAIN (last_decl
) = NULL_TREE
;
11473 last_function_parms
= decls
;
11478 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
11479 FUNCTION_TYPE with the newly parsed version of its default argument, which
11480 was previously digested as text. See snarf_defarg et al in lex.c. */
11483 replace_defarg (arg
, init
)
11486 if (! processing_template_decl
11487 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
11488 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
11489 TREE_TYPE (init
), TREE_VALUE (arg
));
11490 TREE_PURPOSE (arg
) = init
;
11497 tree t
= FUNCTION_ARG_CHAIN (d
);
11498 if (DECL_CONSTRUCTOR_P (d
)
11499 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (d
)))
11500 t
= TREE_CHAIN (t
);
11501 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
11502 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
11503 == DECL_CLASS_CONTEXT (d
))
11504 && (TREE_CHAIN (t
) == NULL_TREE
11505 || TREE_CHAIN (t
) == void_list_node
11506 || TREE_PURPOSE (TREE_CHAIN (t
))))
11511 /* These memoizing functions keep track of special properties which
11512 a class may have. `grok_ctor_properties' notices whether a class
11513 has a constructor of the form X(X&), and also complains
11514 if the class has a constructor of the form X(X).
11515 `grok_op_properties' takes notice of the various forms of
11516 operator= which are defined, as well as what sorts of type conversion
11517 may apply. Both functions take a FUNCTION_DECL as an argument. */
11520 grok_ctor_properties (ctype
, decl
)
11523 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
11524 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
11526 /* When a type has virtual baseclasses, a magical first int argument is
11527 added to any ctor so we can tell if the class has been initialized
11528 yet. This could screw things up in this function, so we deliberately
11529 ignore the leading int if we're in that situation. */
11530 if (TYPE_USES_VIRTUAL_BASECLASSES (ctype
))
11532 my_friendly_assert (parmtypes
11533 && TREE_VALUE (parmtypes
) == integer_type_node
,
11535 parmtypes
= TREE_CHAIN (parmtypes
);
11536 parmtype
= TREE_VALUE (parmtypes
);
11541 A non-template constructor for class X is a copy constructor if
11542 its first parameter is of type X&, const X&, volatile X& or const
11543 volatile X&, and either there are no other parameters or else all
11544 other parameters have default arguments. */
11545 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
11546 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
11547 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11548 || TREE_CHAIN (parmtypes
) == void_list_node
11549 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11550 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11551 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11553 TYPE_HAS_INIT_REF (ctype
) = 1;
11554 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11555 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
11559 A declaration of a constructor for a class X is ill-formed if its
11560 first parameter is of type (optionally cv-qualified) X and either
11561 there are no other parameters or else all other parameters have
11564 We *don't* complain about member template instantiations that
11565 have this form, though; they can occur as we try to decide what
11566 constructor to use during overload resolution. Since overload
11567 resolution will never prefer such a constructor to the
11568 non-template copy constructor (which is either explicitly or
11569 implicitly defined), there's no need to worry about their
11570 existence. Theoretically, they should never even be
11571 instantiated, but that's hard to forestall. */
11572 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
11573 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11574 || TREE_CHAIN (parmtypes
) == void_list_node
11575 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11576 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11577 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11579 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
11581 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
11584 else if (TREE_CODE (parmtype
) == VOID_TYPE
11585 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
11586 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
11591 /* An operator with this name can be either unary or binary. */
11597 return (name
== ansi_opname
[(int) INDIRECT_REF
]
11598 || name
== ansi_opname
[(int) ADDR_EXPR
]
11599 || name
== ansi_opname
[(int) NEGATE_EXPR
]
11600 || name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11601 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]
11602 || name
== ansi_opname
[(int) CONVERT_EXPR
]);
11605 /* An operator with this name can only be unary. */
11611 return (name
== ansi_opname
[(int) TRUTH_NOT_EXPR
]
11612 || name
== ansi_opname
[(int) BIT_NOT_EXPR
]
11613 || name
== ansi_opname
[(int) COMPONENT_REF
]
11614 || IDENTIFIER_TYPENAME_P (name
));
11617 /* Do a little sanity-checking on how they declared their operator. */
11620 grok_op_properties (decl
, virtualp
, friendp
)
11622 int virtualp
, friendp
;
11624 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
11625 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
11626 tree name
= DECL_NAME (decl
);
11628 if (current_class_type
== NULL_TREE
)
11635 A user-declared copy assignment operator X::operator= is a
11636 non-static non-template member function of class X with
11637 exactly one parameter of type X, X&, const X&, volatile X& or
11638 const volatile X&. */
11639 if (name
== ansi_opname
[(int) MODIFY_EXPR
]
11640 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11641 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11643 else if (name
== ansi_opname
[(int) CALL_EXPR
])
11644 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
11645 else if (name
== ansi_opname
[(int) ARRAY_REF
])
11646 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
11647 else if (name
== ansi_opname
[(int) COMPONENT_REF
]
11648 || name
== ansi_opname
[(int) MEMBER_REF
])
11649 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
11650 else if (name
== ansi_opname
[(int) NEW_EXPR
])
11651 TYPE_GETS_NEW (current_class_type
) |= 1;
11652 else if (name
== ansi_opname
[(int) DELETE_EXPR
])
11653 TYPE_GETS_DELETE (current_class_type
) |= 1;
11654 else if (name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11655 TYPE_GETS_NEW (current_class_type
) |= 2;
11656 else if (name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11657 TYPE_GETS_DELETE (current_class_type
) |= 2;
11660 if (name
== ansi_opname
[(int) NEW_EXPR
]
11661 || name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11663 /* When the compiler encounters the definition of A::operator new, it
11664 doesn't look at the class declaration to find out if it's static. */
11666 revert_static_member_fn (&decl
, NULL
, NULL
);
11668 /* Take care of function decl if we had syntax errors. */
11669 if (argtypes
== NULL_TREE
)
11671 = build_function_type (ptr_type_node
,
11672 hash_tree_chain (integer_type_node
,
11675 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
11677 else if (name
== ansi_opname
[(int) DELETE_EXPR
]
11678 || name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11681 revert_static_member_fn (&decl
, NULL
, NULL
);
11683 if (argtypes
== NULL_TREE
)
11685 = build_function_type (void_type_node
,
11686 hash_tree_chain (ptr_type_node
,
11690 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
11692 if (! friendp
&& name
== ansi_opname
[(int) VEC_DELETE_EXPR
]
11693 && (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
11694 != void_list_node
))
11695 TYPE_VEC_DELETE_TAKES_SIZE (current_class_type
) = 1;
11700 /* An operator function must either be a non-static member function
11701 or have at least one parameter of a class, a reference to a class,
11702 an enumeration, or a reference to an enumeration. 13.4.0.6 */
11703 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
11705 if (IDENTIFIER_TYPENAME_P (name
)
11706 || name
== ansi_opname
[(int) CALL_EXPR
]
11707 || name
== ansi_opname
[(int) MODIFY_EXPR
]
11708 || name
== ansi_opname
[(int) COMPONENT_REF
]
11709 || name
== ansi_opname
[(int) ARRAY_REF
])
11710 cp_error ("`%D' must be a nonstatic member function", decl
);
11715 if (DECL_STATIC_FUNCTION_P (decl
))
11716 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
11719 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
11721 tree arg
= TREE_VALUE (p
);
11722 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
11723 arg
= TREE_TYPE (arg
);
11725 /* This lets bad template code slip through. */
11726 if (IS_AGGR_TYPE (arg
)
11727 || TREE_CODE (arg
) == ENUMERAL_TYPE
11728 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
11729 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11733 ("`%D' must have an argument of class or enumerated type",
11740 if (name
== ansi_opname
[(int) CALL_EXPR
])
11741 return; /* No restrictions on args. */
11743 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
11745 tree t
= TREE_TYPE (name
);
11746 if (TREE_CODE (t
) == VOID_TYPE
)
11747 pedwarn ("void is not a valid type conversion operator");
11748 else if (! friendp
)
11750 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
11751 const char *what
= 0;
11753 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
11755 if (t
== current_class_type
)
11756 what
= "the same type";
11757 /* Don't force t to be complete here. */
11758 else if (IS_AGGR_TYPE (t
)
11760 && DERIVED_FROM_P (t
, current_class_type
))
11761 what
= "a base class";
11764 warning ("conversion to %s%s will never use a type conversion operator",
11765 ref
? "a reference to " : "", what
);
11769 if (name
== ansi_opname
[(int) MODIFY_EXPR
])
11773 if (list_length (argtypes
) != 3 && methodp
)
11775 cp_error ("`%D' must take exactly one argument", decl
);
11778 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
11780 if (copy_assignment_arg_p (parmtype
, virtualp
)
11783 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
11784 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
11785 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11786 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
11789 else if (name
== ansi_opname
[(int) COND_EXPR
])
11792 cp_error ("ANSI C++ prohibits overloading operator ?:");
11794 else if (ambi_op_p (name
))
11796 if (list_length (argtypes
) == 2)
11798 else if (list_length (argtypes
) == 3)
11800 if ((name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11801 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11802 && ! processing_template_decl
11803 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
11806 cp_error ("postfix `%D' must take `int' as its argument",
11810 ("postfix `%D' must take `int' as its second argument",
11817 cp_error ("`%D' must take either zero or one argument", decl
);
11819 cp_error ("`%D' must take either one or two arguments", decl
);
11822 /* More Effective C++ rule 6. */
11824 && (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11825 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]))
11827 tree arg
= TREE_VALUE (argtypes
);
11828 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
11829 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
11830 arg
= TREE_TYPE (arg
);
11831 arg
= TYPE_MAIN_VARIANT (arg
);
11832 if (list_length (argtypes
) == 2)
11834 if (TREE_CODE (ret
) != REFERENCE_TYPE
11835 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
11837 cp_warning ("prefix `%D' should return `%T'", decl
,
11838 build_reference_type (arg
));
11842 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
11843 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
11847 else if (unary_op_p (name
))
11849 if (list_length (argtypes
) != 2)
11852 cp_error ("`%D' must take `void'", decl
);
11854 cp_error ("`%D' must take exactly one argument", decl
);
11857 else /* if (binary_op_p (name)) */
11859 if (list_length (argtypes
) != 3)
11862 cp_error ("`%D' must take exactly one argument", decl
);
11864 cp_error ("`%D' must take exactly two arguments", decl
);
11867 /* More Effective C++ rule 7. */
11869 && (name
== ansi_opname
[TRUTH_ANDIF_EXPR
]
11870 || name
== ansi_opname
[TRUTH_ORIF_EXPR
]
11871 || name
== ansi_opname
[COMPOUND_EXPR
]))
11872 cp_warning ("user-defined `%D' always evaluates both arguments",
11876 /* Effective C++ rule 23. */
11878 && list_length (argtypes
) == 3
11879 && (name
== ansi_opname
[PLUS_EXPR
]
11880 || name
== ansi_opname
[MINUS_EXPR
]
11881 || name
== ansi_opname
[TRUNC_DIV_EXPR
]
11882 || name
== ansi_opname
[MULT_EXPR
])
11883 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
11884 cp_warning ("`%D' should return by value", decl
);
11888 for (; argtypes
!= void_list_node
; argtypes
= TREE_CHAIN (argtypes
))
11889 if (TREE_PURPOSE (argtypes
))
11891 TREE_PURPOSE (argtypes
) = NULL_TREE
;
11892 if (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11893 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11896 cp_pedwarn ("`%D' cannot have default arguments", decl
);
11899 cp_error ("`%D' cannot have default arguments", decl
);
11904 static const char *
11906 enum tag_types code
;
11919 my_friendly_abort (981122);
11923 /* Get the struct, enum or union (CODE says which) with tag NAME.
11924 Define the tag as a forward-reference if it is not defined.
11926 C++: If a class derivation is given, process it here, and report
11927 an error if multiple derivation declarations are not identical.
11929 If this is a definition, come in through xref_tag and only look in
11930 the current frame for the name (since C++ allows new names in any
11934 xref_tag (code_type_node
, name
, globalize
)
11935 tree code_type_node
;
11939 enum tag_types tag_code
;
11940 enum tree_code code
;
11942 register tree ref
, t
;
11943 struct binding_level
*b
= current_binding_level
;
11945 tree attributes
= NULL_TREE
;
11946 tree context
= NULL_TREE
;
11948 /* If we are called from the parser, code_type_node will sometimes be a
11949 TREE_LIST. This indicates that the user wrote
11950 "class __attribute__ ((foo)) bar". Extract the attributes so we can
11952 if (TREE_CODE (code_type_node
) == TREE_LIST
)
11954 attributes
= TREE_PURPOSE (code_type_node
);
11955 code_type_node
= TREE_VALUE (code_type_node
);
11958 tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
11963 code
= RECORD_TYPE
;
11969 code
= ENUMERAL_TYPE
;
11972 my_friendly_abort (18);
11975 /* If a cross reference is requested, look up the type
11976 already defined for this tag and return it. */
11977 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
11980 name
= TYPE_IDENTIFIER (t
);
11984 t
= IDENTIFIER_TYPE_VALUE (name
);
11986 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
11987 && TREE_CODE (t
) != TEMPLATE_TEMPLATE_PARM
)
11992 /* If we know we are defining this tag, only look it up in
11993 this scope and don't try to find it as a type. */
11994 ref
= lookup_tag (code
, name
, b
, 1);
12000 /* [dcl.type.elab] If the identifier resolves to a
12001 typedef-name or a template type-parameter, the
12002 elaborated-type-specifier is ill-formed. */
12003 if (t
!= TYPE_MAIN_VARIANT (t
)
12004 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
12005 cp_pedwarn ("using typedef-name `%D' after `%s'",
12006 TYPE_NAME (t
), tag_name (tag_code
));
12007 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12008 cp_error ("using template type parameter `%T' after `%s'",
12009 t
, tag_name (tag_code
));
12014 ref
= lookup_tag (code
, name
, b
, 0);
12018 /* Try finding it as a type declaration. If that wins,
12020 ref
= lookup_name (name
, 1);
12022 if (ref
!= NULL_TREE
12023 && processing_template_decl
12024 && DECL_CLASS_TEMPLATE_P (ref
)
12025 && template_class_depth (current_class_type
) == 0)
12026 /* Since GLOBALIZE is true, we're declaring a global
12027 template, so we want this type. */
12028 ref
= DECL_RESULT (ref
);
12030 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12031 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12032 ref
= TREE_TYPE (ref
);
12037 if (ref
&& current_class_type
12038 && template_class_depth (current_class_type
)
12039 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12041 /* Since GLOBALIZE is non-zero, we are not looking at a
12042 definition of this tag. Since, in addition, we are currently
12043 processing a (member) template declaration of a template
12044 class, we must be very careful; consider:
12051 { template <class V>
12052 friend struct S1; };
12054 Here, the S2::S1 declaration should not be confused with the
12055 outer declaration. In particular, the inner version should
12056 have a template parameter of level 2, not level 1. This
12057 would be particularly important if the member declaration
12060 template <class V = U> friend struct S1;
12062 say, when we should tsubst into `U' when instantiating
12063 S2. On the other hand, when presented with:
12073 we must find the inner binding eventually. We
12074 accomplish this by making sure that the new type we
12075 create to represent this declaration has the right
12077 context
= TYPE_CONTEXT (ref
);
12082 push_obstacks_nochange ();
12086 /* If no such tag is yet defined, create a forward-reference node
12087 and record it as the "definition".
12088 When a real declaration of this type is found,
12089 the forward-reference will be altered into a real type. */
12091 /* In C++, since these migrate into the global scope, we must
12092 build them on the permanent obstack. */
12094 temp
= allocation_temporary_p ();
12096 end_temporary_allocation ();
12098 if (code
== ENUMERAL_TYPE
)
12100 cp_error ("use of enum `%#D' without previous declaration", name
);
12102 ref
= make_node (ENUMERAL_TYPE
);
12104 /* Give the type a default layout like unsigned int
12105 to avoid crashing if it does not get defined. */
12106 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12107 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12108 TREE_UNSIGNED (ref
) = 1;
12109 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12110 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12111 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12113 /* Enable us to recognize when a type is created in class context.
12114 To do nested classes correctly, this should probably be cleared
12115 out when we leave this classes scope. Currently this in only
12116 done in `start_enum'. */
12118 pushtag (name
, ref
, globalize
);
12122 struct binding_level
*old_b
= class_binding_level
;
12124 ref
= make_lang_type (code
);
12125 TYPE_CONTEXT (ref
) = context
;
12127 #ifdef NONNESTED_CLASSES
12128 /* Class types don't nest the way enums do. */
12129 class_binding_level
= (struct binding_level
*)0;
12131 pushtag (name
, ref
, globalize
);
12132 class_binding_level
= old_b
;
12137 /* If it no longer looks like a nested type, make sure it's
12139 If it is not an IDENTIFIER, this is not a declaration */
12140 if (b
->namespace_p
&& !class_binding_level
12141 && TREE_CODE (name
) == IDENTIFIER_NODE
)
12143 if (IDENTIFIER_NAMESPACE_VALUE (name
) == NULL_TREE
)
12144 SET_IDENTIFIER_NAMESPACE_VALUE (name
, TYPE_NAME (ref
));
12147 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12148 redeclare_class_template (ref
, current_template_parms
);
12151 /* Until the type is defined, tentatively accept whatever
12152 structure tag the user hands us. */
12153 if (TYPE_SIZE (ref
) == NULL_TREE
12154 && ref
!= current_class_type
12155 /* Have to check this, in case we have contradictory tag info. */
12156 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12158 if (tag_code
== class_type
)
12159 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12160 else if (tag_code
== record_type
)
12161 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12166 TREE_TYPE (ref
) = attributes
;
12172 xref_tag_from_type (old
, id
, globalize
)
12176 tree code_type_node
;
12178 if (TREE_CODE (old
) == RECORD_TYPE
)
12179 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12180 ? class_type_node
: record_type_node
);
12182 code_type_node
= union_type_node
;
12184 if (id
== NULL_TREE
)
12185 id
= TYPE_IDENTIFIER (old
);
12187 return xref_tag (code_type_node
, id
, globalize
);
12190 /* REF is a type (named NAME), for which we have just seen some
12191 baseclasses. BINFO is a list of those baseclasses; the
12192 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12193 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12194 struct, or union. */
12197 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12198 tree code_type_node
;
12202 /* In the declaration `A : X, Y, ... Z' we mark all the types
12203 (A, X, Y, ..., Z) so we can check for duplicates. */
12208 enum tag_types tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
12210 if (tag_code
== union_type
)
12212 cp_error ("derived union `%T' invalid", ref
);
12216 len
= list_length (binfo
);
12217 push_obstacks (TYPE_OBSTACK (ref
), TYPE_OBSTACK (ref
));
12219 /* First, make sure that any templates in base-classes are
12220 instantiated. This ensures that if we call ourselves recursively
12221 we do not get confused about which classes are marked and which
12223 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12224 complete_type (TREE_VALUE (base
));
12226 SET_CLASSTYPE_MARKED (ref
);
12227 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12229 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12231 /* The base of a derived struct is public by default. */
12233 = (TREE_PURPOSE (binfo
) == access_public_node
12234 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12235 || (tag_code
!= class_type
12236 && (TREE_PURPOSE (binfo
) == access_default_node
12237 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12239 = (TREE_PURPOSE (binfo
) == access_protected_node
12240 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12242 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12243 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12244 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12245 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12246 tree basetype
= TREE_VALUE (binfo
);
12249 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12250 basetype
= TREE_TYPE (basetype
);
12252 || (TREE_CODE (basetype
) != RECORD_TYPE
12253 && TREE_CODE (basetype
) != TYPENAME_TYPE
12254 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12255 && TREE_CODE (basetype
) != TEMPLATE_TEMPLATE_PARM
))
12257 cp_error ("base type `%T' fails to be a struct or class type",
12258 TREE_VALUE (binfo
));
12262 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12264 /* This code replaces similar code in layout_basetypes.
12265 We put the complete_type first for implicit `typename'. */
12266 if (TYPE_SIZE (basetype
) == NULL_TREE
12267 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12269 cp_error ("base class `%T' has incomplete type", basetype
);
12274 if (CLASSTYPE_MARKED (basetype
))
12276 if (basetype
== ref
)
12277 cp_error ("recursive type `%T' undefined", basetype
);
12279 cp_error ("duplicate base type `%T' invalid", basetype
);
12283 if (TYPE_FOR_JAVA (basetype
)
12284 && (current_lang_stack
12285 == &VARRAY_TREE (current_lang_base
, 0)))
12286 TYPE_FOR_JAVA (ref
) = 1;
12288 /* Note that the BINFO records which describe individual
12289 inheritances are *not* shared in the lattice! They
12290 cannot be shared because a given baseclass may be
12291 inherited with different `accessibility' by different
12292 derived classes. (Each BINFO record describing an
12293 individual inheritance contains flags which say what
12294 the `accessibility' of that particular inheritance is.) */
12297 = make_binfo (integer_zero_node
, basetype
,
12298 CLASS_TYPE_P (basetype
)
12299 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
12300 CLASS_TYPE_P (basetype
)
12301 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
12303 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
12304 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
12305 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
12306 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
12307 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
12309 /* We need to unshare the binfos now so that lookups during class
12310 definition work. */
12311 unshare_base_binfos (base_binfo
);
12313 SET_CLASSTYPE_MARKED (basetype
);
12315 /* We are free to modify these bits because they are meaningless
12316 at top level, and BASETYPE is a top-level type. */
12317 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
12319 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
12320 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12323 if (CLASS_TYPE_P (basetype
))
12325 TYPE_GETS_NEW (ref
) |= TYPE_GETS_NEW (basetype
);
12326 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
12333 TREE_VEC_LENGTH (binfos
) = i
;
12335 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
12338 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
12341 tree basetype
= BINFO_TYPE (TREE_VEC_ELT (binfos
, 0));
12343 if (CLASS_TYPE_P (basetype
))
12344 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
12345 = TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
12348 if (TYPE_USES_MULTIPLE_INHERITANCE (ref
))
12349 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12351 /* Unmark all the types. */
12353 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
12354 CLEAR_CLASSTYPE_MARKED (ref
);
12356 /* Now that we know all the base-classes, set up the list of virtual
12358 CLASSTYPE_VBASECLASSES (ref
) = get_vbase_types (ref
);
12364 /* Begin compiling the definition of an enumeration type.
12365 NAME is its name (or null if anonymous).
12366 Returns the type object, as yet incomplete.
12367 Also records info about it so that build_enumerator
12368 may be used to declare the individual values as they are read. */
12374 register tree enumtype
= NULL_TREE
;
12375 struct binding_level
*b
= current_binding_level
;
12377 /* We are wasting space here and putting these on the permanent_obstack so
12378 that typeid(local enum) will work correctly. */
12379 push_obstacks (&permanent_obstack
, &permanent_obstack
);
12381 /* If this is the real definition for a previous forward reference,
12382 fill in the contents in the same object that used to be the
12383 forward reference. */
12385 if (name
!= NULL_TREE
)
12386 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
12388 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
12390 cp_error ("multiple definition of `%#T'", enumtype
);
12391 cp_error_at ("previous definition here", enumtype
);
12395 enumtype
= make_node (ENUMERAL_TYPE
);
12396 pushtag (name
, enumtype
, 0);
12399 if (current_class_type
)
12400 TREE_ADDRESSABLE (b
->tags
) = 1;
12402 /* We don't copy this value because build_enumerator needs to do it. */
12403 enum_next_value
= integer_zero_node
;
12406 GNU_xref_decl (current_function_decl
, enumtype
);
12410 /* After processing and defining all the values of an enumeration type,
12411 install their decls in the enumeration type and finish it off.
12412 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12413 Returns ENUMTYPE. */
12416 finish_enum (enumtype
)
12419 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
12420 /* Calculate the maximum value of any enumerator in this type. */
12422 tree values
= TYPE_VALUES (enumtype
);
12427 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
12432 /* The TREE_VALUE is a CONST_DECL for this enumeration
12434 decl
= TREE_VALUE (pair
);
12436 /* The DECL_INITIAL will be NULL if we are processing a
12437 template declaration and this enumeration constant had no
12438 explicit initializer. */
12439 value
= DECL_INITIAL (decl
);
12440 if (value
&& !processing_template_decl
)
12442 /* Set the TREE_TYPE for the VALUE as well. That's so
12443 that when we call decl_constant_value we get an
12444 entity of the right type (but with the constant
12445 value). Since we shouldn't ever call
12446 decl_constant_value on a template type, there's no
12447 reason to do that when processing_template_decl.
12448 And, if the expression is something like a
12449 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12450 wreak havoc on the intended type of the expression.
12452 Of course, there's also no point in trying to compute
12453 minimum or maximum values if we're in a template. */
12454 TREE_TYPE (value
) = enumtype
;
12457 minnode
= maxnode
= value
;
12458 else if (tree_int_cst_lt (maxnode
, value
))
12460 else if (tree_int_cst_lt (value
, minnode
))
12464 if (processing_template_decl
)
12465 /* If this is just a template, leave the CONST_DECL
12466 alone. That way tsubst_copy will find CONST_DECLs for
12467 CONST_DECLs, and not INTEGER_CSTs. */
12470 /* In the list we're building up, we want the enumeration
12471 values, not the CONST_DECLs. */
12472 TREE_VALUE (pair
) = value
;
12476 maxnode
= minnode
= integer_zero_node
;
12478 TYPE_VALUES (enumtype
) = nreverse (values
);
12480 if (processing_template_decl
)
12482 tree scope
= current_scope ();
12483 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
12484 add_tree (build_min (TAG_DEFN
, enumtype
));
12488 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
12489 int lowprec
= min_precision (minnode
, unsignedp
);
12490 int highprec
= min_precision (maxnode
, unsignedp
);
12491 int precision
= MAX (lowprec
, highprec
);
12494 TYPE_SIZE (enumtype
) = NULL_TREE
;
12496 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
12498 TYPE_PRECISION (enumtype
) = precision
;
12500 fixup_unsigned_type (enumtype
);
12502 fixup_signed_type (enumtype
);
12504 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
12505 /* Use the width of the narrowest normal C type which is wide
12507 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
12510 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
12512 TYPE_SIZE (enumtype
) = 0;
12513 layout_type (enumtype
);
12515 /* Fix up all variant types of this enum type. */
12516 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
12517 tem
= TYPE_NEXT_VARIANT (tem
))
12519 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
12520 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
12521 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
12522 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
12523 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
12524 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
12525 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
12526 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
12527 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
12530 /* Finish debugging output for this type. */
12531 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
12534 /* In start_enum we pushed obstacks. Here, we must pop them. */
12540 /* Build and install a CONST_DECL for an enumeration constant of the
12541 enumeration type TYPE whose NAME and VALUE (if any) are provided.
12542 Assignment of sequential values by default is handled here. */
12545 build_enumerator (name
, value
, type
)
12553 /* Remove no-op casts from the value. */
12555 STRIP_TYPE_NOPS (value
);
12557 if (! processing_template_decl
)
12559 /* Validate and default VALUE. */
12560 if (value
!= NULL_TREE
)
12562 if (TREE_READONLY_DECL_P (value
))
12563 value
= decl_constant_value (value
);
12565 if (TREE_CODE (value
) == INTEGER_CST
)
12567 value
= default_conversion (value
);
12568 constant_expression_warning (value
);
12572 cp_error ("enumerator value for `%D' not integer constant", name
);
12577 /* Default based on previous value. */
12578 if (value
== NULL_TREE
&& ! processing_template_decl
)
12580 value
= enum_next_value
;
12582 cp_error ("overflow in enumeration values at `%D'", name
);
12585 /* Remove no-op casts from the value. */
12587 STRIP_TYPE_NOPS (value
);
12589 /* To fix MAX_VAL enum consts. (bkoz) */
12590 TREE_TYPE (value
) = integer_type_node
;
12594 /* We always have to copy here; not all INTEGER_CSTs are unshared.
12595 Even in other cases, we will later (in finish_enum) be setting the
12597 if (value
!= NULL_TREE
)
12598 value
= copy_node (value
);
12600 /* C++ associates enums with global, function, or class declarations. */
12602 context
= current_scope ();
12603 if (context
&& context
== current_class_type
)
12604 /* This enum declaration is local to the class. */
12605 decl
= build_lang_decl (CONST_DECL
, name
, type
);
12607 /* It's a global enum, or it's local to a function. (Note local to
12608 a function could mean local to a class method. */
12609 decl
= build_decl (CONST_DECL
, name
, type
);
12611 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
12612 DECL_INITIAL (decl
) = value
;
12613 TREE_READONLY (decl
) = 1;
12615 if (context
&& context
== current_class_type
)
12616 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
12617 on the TYPE_FIELDS list for `S'. (That's so that you can say
12618 things like `S::i' later.) */
12619 finish_member_declaration (decl
);
12623 GNU_xref_decl (current_function_decl
, decl
);
12626 if (! processing_template_decl
)
12628 /* Set basis for default for next value. */
12629 enum_next_value
= build_binary_op_nodefault (PLUS_EXPR
, value
,
12630 integer_one_node
, PLUS_EXPR
);
12631 enum_overflow
= tree_int_cst_lt (enum_next_value
, value
);
12634 result
= tree_cons (name
, decl
, NULL_TREE
);
12639 static int function_depth
;
12641 /* We're defining DECL. Make sure that it's type is OK. */
12644 check_function_type (decl
)
12647 tree fntype
= TREE_TYPE (decl
);
12649 /* In a function definition, arg types must be complete. */
12650 require_complete_types_for_parms (current_function_parms
);
12652 if (TYPE_SIZE (complete_type (TREE_TYPE (fntype
))) == NULL_TREE
)
12654 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
12656 /* Make it return void instead, but don't change the
12657 type of the DECL_RESULT, in case we have a named return value. */
12658 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12660 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
12662 = build_cplus_method_type (ctype
,
12664 FUNCTION_ARG_CHAIN (decl
));
12668 = build_function_type (void_type_node
,
12669 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
12671 = build_exception_variant (fntype
,
12672 TYPE_RAISES_EXCEPTIONS (fntype
));
12675 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
12678 /* Create the FUNCTION_DECL for a function definition.
12679 DECLSPECS and DECLARATOR are the parts of the declaration;
12680 they describe the function's name and the type it returns,
12681 but twisted together in a fashion that parallels the syntax of C.
12683 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
12684 DECLARATOR is really the DECL for the function we are about to
12685 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
12686 indicating that the function is an inline defined in-class, and
12687 SF_EXPAND indicating that we should generate RTL for this
12690 This function creates a binding context for the function body
12691 as well as setting up the FUNCTION_DECL in current_function_decl.
12693 Returns 1 on success. If the DECLARATOR is not suitable for a function
12694 (it defines a datum instead), we return 0, which tells
12695 yyparse to report a parse error.
12697 For C++, we must first check whether that datum makes any sense.
12698 For example, "class A local_a(1,2);" means that variable local_a
12699 is an aggregate of type A, which should have a constructor
12700 applied to it with the argument list [1, 2]. */
12703 start_function (declspecs
, declarator
, attrs
, flags
)
12704 tree declspecs
, declarator
, attrs
;
12708 tree ctype
= NULL_TREE
;
12711 extern int have_extern_spec
;
12712 extern int used_extern_spec
;
12713 int doing_friend
= 0;
12714 struct binding_level
*bl
;
12716 /* Sanity check. */
12717 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
12718 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
12720 /* This should only be done once on the top most decl. */
12721 if (have_extern_spec
&& !used_extern_spec
)
12723 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
12724 used_extern_spec
= 1;
12727 if (flags
& SF_PRE_PARSED
)
12729 decl1
= declarator
;
12731 fntype
= TREE_TYPE (decl1
);
12732 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12733 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12735 /* ANSI C++ June 5 1992 WP 11.4.5. A friend function defined in a
12736 class is in the (lexical) scope of the class in which it is
12738 if (!ctype
&& DECL_FRIEND_P (decl1
))
12740 ctype
= DECL_CLASS_CONTEXT (decl1
);
12742 /* CTYPE could be null here if we're dealing with a template;
12743 for example, `inline friend float foo()' inside a template
12744 will have no CTYPE set. */
12745 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
12751 last_function_parms
= DECL_ARGUMENTS (decl1
);
12752 last_function_parm_tags
= NULL_TREE
;
12756 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
12757 /* If the declarator is not suitable for a function definition,
12758 cause a syntax error. */
12759 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
12761 fntype
= TREE_TYPE (decl1
);
12763 restype
= TREE_TYPE (fntype
);
12764 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
12766 cp_error ("semicolon missing after declaration of `%#T'", restype
);
12767 shadow_tag (build_expr_list (NULL_TREE
, restype
));
12768 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
12769 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
12770 fntype
= build_function_type (integer_type_node
,
12771 TYPE_ARG_TYPES (fntype
));
12773 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
12775 TYPE_ARG_TYPES (fntype
));
12776 TREE_TYPE (decl1
) = fntype
;
12779 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12780 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12781 else if (DECL_MAIN_P (decl1
))
12783 /* If this doesn't return integer_type, complain. */
12784 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
12786 if (pedantic
|| warn_return_type
)
12787 pedwarn ("return type for `main' changed to `int'");
12788 TREE_TYPE (decl1
) = fntype
= default_function_type
;
12793 /* Sometimes we don't notice that a function is a static member, and
12794 build a METHOD_TYPE for it. Fix that up now. */
12795 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
)
12796 && TREE_CODE (TREE_TYPE (decl1
)) == METHOD_TYPE
)
12798 revert_static_member_fn (&decl1
, NULL
, NULL
);
12799 last_function_parms
= TREE_CHAIN (last_function_parms
);
12803 /* Warn if function was previously implicitly declared
12804 (but not if we warned then). */
12805 if (! warn_implicit
12806 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
12807 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
12809 /* Set up current_class_type, and enter the scope of the class, if
12812 push_nested_class (ctype
, 1);
12813 else if (DECL_STATIC_FUNCTION_P (decl1
))
12814 push_nested_class (DECL_CONTEXT (decl1
), 2);
12816 /* Now that we have entered the scope of the class, we must restore
12817 the bindings for any template parameters surrounding DECL1, if it
12818 is an inline member template. (Order is important; consider the
12819 case where a template parameter has the same name as a field of
12820 the class.) It is not until after this point that
12821 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
12822 if (flags
& SF_INCLASS_INLINE
)
12823 maybe_begin_member_template_processing (decl1
);
12825 /* Effective C++ rule 15. See also c_expand_return. */
12827 && DECL_NAME (decl1
) == ansi_opname
[(int) MODIFY_EXPR
]
12828 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
12829 cp_warning ("`operator=' should return a reference to `*this'");
12831 /* Make the init_value nonzero so pushdecl knows this is not tentative.
12832 error_mark_node is replaced below (in poplevel) with the BLOCK. */
12833 if (!DECL_INITIAL (decl1
))
12834 DECL_INITIAL (decl1
) = error_mark_node
;
12836 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
12837 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
12840 /* This function exists in static storage.
12841 (This does not mean `static' in the C sense!) */
12842 TREE_STATIC (decl1
) = 1;
12844 /* We must call push_template_decl after current_class_type is set
12845 up. (If we are processing inline definitions after exiting a
12846 class scope, current_class_type will be NULL_TREE until set above
12847 by push_nested_class.) */
12848 if (processing_template_decl
)
12849 decl1
= push_template_decl (decl1
);
12851 /* We are now in the scope of the function being defined. */
12852 current_function_decl
= decl1
;
12854 /* Save the parm names or decls from this function's declarator
12855 where store_parm_decls will find them. */
12856 current_function_parms
= last_function_parms
;
12857 current_function_parm_tags
= last_function_parm_tags
;
12859 /* Make sure the parameter and return types are reasonable. When
12860 you declare a function, these types can be incomplete, but they
12861 must be complete when you define the function. */
12862 if (! processing_template_decl
)
12863 check_function_type (decl1
);
12865 /* Build the return declaration for the function. */
12866 restype
= TREE_TYPE (fntype
);
12867 if (!processing_template_decl
)
12869 if (!DECL_RESULT (decl1
))
12871 DECL_RESULT (decl1
)
12872 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
12873 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype
),
12874 DECL_RESULT (decl1
));
12878 /* Just use `void'. Nobody will ever look at this anyhow. */
12879 DECL_RESULT (decl1
) = build_decl (RESULT_DECL
, 0, void_type_node
);
12881 /* Initialize RTL machinery. We cannot do this until
12882 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
12883 even when processing a template; this is how we get
12884 CURRENT_FUNCTION set up, and our per-function variables
12886 bl
= current_binding_level
;
12887 init_function_start (decl1
, input_filename
, lineno
);
12888 current_binding_level
= bl
;
12889 expanding_p
= (flags
& SF_EXPAND
) != 0;
12891 /* Even though we're inside a function body, we still don't want to
12892 call expand_expr to calculate the size of a variable-sized array.
12893 We haven't necessarily assigned RTL to all variables yet, so it's
12894 not safe to try to expand expressions involving them. */
12895 immediate_size_expand
= 0;
12896 get_pending_sizes ();
12898 /* Let the user know we're compiling this function. */
12899 if (processing_template_decl
|| !building_stmt_tree ())
12900 announce_function (decl1
);
12902 /* Record the decl so that the function name is defined.
12903 If we already have a decl for this name, and it is a FUNCTION_DECL,
12904 use the old decl. */
12905 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
12907 /* A specialization is not used to guide overload resolution. */
12908 if ((flag_guiding_decls
12909 || !DECL_TEMPLATE_SPECIALIZATION (decl1
))
12910 && ! DECL_FUNCTION_MEMBER_P (decl1
))
12911 decl1
= pushdecl (decl1
);
12914 /* We need to set the DECL_CONTEXT. */
12915 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
12916 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
12917 /* And make sure we have enough default args. */
12918 check_default_args (decl1
);
12920 DECL_MAIN_VARIANT (decl1
) = decl1
;
12921 fntype
= TREE_TYPE (decl1
);
12924 /* Reset these in case the call to pushdecl changed them. */
12925 current_function_decl
= decl1
;
12926 current_function
->decl
= decl1
;
12928 /* Initialize the per-function data. */
12929 if (!DECL_PENDING_INLINE_P (decl1
) && DECL_SAVED_FUNCTION_DATA (decl1
))
12931 /* If we already parsed this function, and we're just expanding it
12932 now, restore saved state. */
12933 struct binding_level
*bl
= current_binding_level
;
12934 *cp_function_chain
= *DECL_SAVED_FUNCTION_DATA (decl1
);
12935 current_binding_level
= bl
;
12937 /* This function is being processed in whole-function mode; we
12938 already did semantic analysis. */
12939 current_function
->x_whole_function_mode_p
= 1;
12941 /* We don't need the saved data anymore. */
12942 free (DECL_SAVED_FUNCTION_DATA (decl1
));
12943 DECL_SAVED_FUNCTION_DATA (decl1
) = NULL
;
12945 else if (ctype
&& !doing_friend
&& !DECL_STATIC_FUNCTION_P (decl1
))
12947 /* We know that this was set up by `grokclassfn'. We do not
12948 wait until `store_parm_decls', since evil parse errors may
12949 never get us to that point. Here we keep the consistency
12950 between `current_class_type' and `current_class_ptr'. */
12951 tree t
= DECL_ARGUMENTS (decl1
);
12953 my_friendly_assert (t
!= NULL_TREE
&& TREE_CODE (t
) == PARM_DECL
,
12955 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
12958 cp_function_chain
->x_current_class_ref
12959 = build_indirect_ref (t
, NULL_PTR
);
12960 cp_function_chain
->x_current_class_ptr
= t
;
12962 if (DECL_DESTRUCTOR_P (decl1
))
12963 current_in_charge_parm
= TREE_CHAIN (t
);
12966 if (DECL_INTERFACE_KNOWN (decl1
))
12968 tree ctx
= hack_decl_function_context (decl1
);
12970 if (DECL_NOT_REALLY_EXTERN (decl1
))
12971 DECL_EXTERNAL (decl1
) = 0;
12973 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
12974 && TREE_PUBLIC (ctx
))
12975 /* This is a function in a local class in an extern inline
12977 comdat_linkage (decl1
);
12979 /* If this function belongs to an interface, it is public.
12980 If it belongs to someone else's interface, it is also external.
12981 This only affects inlines and template instantiations. */
12982 else if (interface_unknown
== 0
12983 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
12984 || flag_alt_external_templates
))
12986 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
12987 || processing_template_decl
)
12989 DECL_EXTERNAL (decl1
)
12991 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
12992 && !DECL_VINDEX (decl1
)));
12994 /* For WIN32 we also want to put these in linkonce sections. */
12995 maybe_make_one_only (decl1
);
12998 DECL_EXTERNAL (decl1
) = 0;
12999 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
13000 DECL_INTERFACE_KNOWN (decl1
) = 1;
13002 else if (interface_unknown
&& interface_only
13003 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13004 || flag_alt_external_templates
))
13006 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13007 interface, we will have interface_only set but not
13008 interface_known. In that case, we don't want to use the normal
13009 heuristics because someone will supply a #pragma implementation
13010 elsewhere, and deducing it here would produce a conflict. */
13011 comdat_linkage (decl1
);
13012 DECL_EXTERNAL (decl1
) = 0;
13013 DECL_INTERFACE_KNOWN (decl1
) = 1;
13014 DECL_DEFER_OUTPUT (decl1
) = 1;
13018 /* This is a definition, not a reference.
13019 So clear DECL_EXTERNAL. */
13020 DECL_EXTERNAL (decl1
) = 0;
13022 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
13023 && ! DECL_INTERFACE_KNOWN (decl1
)
13024 /* Don't try to defer nested functions for now. */
13025 && ! hack_decl_function_context (decl1
))
13026 DECL_DEFER_OUTPUT (decl1
) = 1;
13028 DECL_INTERFACE_KNOWN (decl1
) = 1;
13031 if (doing_semantic_analysis_p ())
13034 current_binding_level
->parm_flag
= 1;
13038 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13040 if (!building_stmt_tree ())
13042 GNU_xref_function (decl1
, current_function_parms
);
13043 make_function_rtl (decl1
);
13046 /* Promote the value to int before returning it. */
13047 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13048 restype
= type_promotes_to (restype
);
13050 /* If this fcn was already referenced via a block-scope `extern' decl
13051 (or an implicit decl), propagate certain information about the usage. */
13052 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13053 TREE_ADDRESSABLE (decl1
) = 1;
13055 if (DECL_RESULT (decl1
) == NULL_TREE
)
13057 DECL_RESULT (decl1
)
13058 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13059 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13060 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13063 /* Allocate further tree nodes temporarily during compilation
13064 of this function only. Tiemann moved up here from bottom of fn. */
13065 /* If this is a nested function, then we must continue to allocate RTL
13066 on the permanent obstack in case we need to inline it later. */
13067 if (! hack_decl_function_context (decl1
))
13068 temporary_allocation ();
13070 /* Make sure that we always have a momntary obstack while we're in a
13074 if (building_stmt_tree ())
13075 begin_stmt_tree (decl1
);
13079 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl1
))
13080 && DECL_LANGUAGE (decl1
) == lang_cplusplus
)
13081 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13082 else if (DECL_CONSTRUCTOR_P (decl1
))
13083 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13088 /* Called after store_parm_decls for a function-try-block. We need to update
13089 last_parm_cleanup_insn so that the base initializers for a constructor
13090 are run within this block, not before it. */
13093 expand_start_early_try_stmts ()
13095 expand_start_try_stmts ();
13096 last_parm_cleanup_insn
= get_last_insn ();
13099 /* Store the parameter declarations into the current function declaration.
13100 This is called after parsing the parameter declarations, before
13101 digesting the body of the function.
13103 Also install to binding contour return value identifier, if any. */
13106 store_parm_decls ()
13108 register tree fndecl
= current_function_decl
;
13109 register tree parm
;
13110 int parms_have_cleanups
= 0;
13111 tree cleanups
= NULL_TREE
;
13113 /* This is a list of types declared among parms in a prototype. */
13114 tree parmtags
= current_function_parm_tags
;
13116 /* This is a chain of any other decls that came in among the parm
13117 declarations. If a parm is declared with enum {foo, bar} x;
13118 then CONST_DECLs for foo and bar are put here. */
13119 tree nonparms
= NULL_TREE
;
13121 /* Create a binding level for the parms. */
13122 if (!building_stmt_tree ())
13123 expand_start_bindings (2);
13125 if (current_function_parms
)
13127 /* This case is when the function was defined with an ANSI prototype.
13128 The parms already have decls, so we need not do anything here
13129 except record them as in effect
13130 and complain if any redundant old-style parm decls were written. */
13132 tree specparms
= current_function_parms
;
13135 if (doing_semantic_analysis_p ())
13137 /* Must clear this because it might contain TYPE_DECLs declared
13139 storedecls (NULL_TREE
);
13141 /* If we're doing semantic analysis, then we'll call pushdecl
13142 for each of these. We must do them in reverse order so that
13143 they end in the correct forward order. */
13144 specparms
= nreverse (specparms
);
13147 for (parm
= specparms
; parm
; parm
= next
)
13149 next
= TREE_CHAIN (parm
);
13150 if (TREE_CODE (parm
) == PARM_DECL
)
13154 if (doing_semantic_analysis_p ())
13156 if (DECL_NAME (parm
) == NULL_TREE
13157 || TREE_CODE (TREE_TYPE (parm
)) != VOID_TYPE
)
13160 cp_error ("parameter `%D' declared void", parm
);
13163 if (! building_stmt_tree ()
13164 && (cleanup
= maybe_build_cleanup (parm
), cleanup
))
13166 expand_decl (parm
);
13167 parms_have_cleanups
= 1;
13169 /* Keep track of the cleanups. */
13170 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13175 /* If we find an enum constant or a type tag,
13176 put it aside for the moment. */
13177 TREE_CHAIN (parm
) = NULL_TREE
;
13178 nonparms
= chainon (nonparms
, parm
);
13182 if (doing_semantic_analysis_p ())
13184 /* Get the decls in their original chain order
13185 and record in the function. This is all and only the
13186 PARM_DECLs that were pushed into scope by the loop above. */
13187 DECL_ARGUMENTS (fndecl
) = getdecls ();
13188 storetags (chainon (parmtags
, gettags ()));
13190 /* We built up the cleanups in reversed order. */
13191 cleanups
= nreverse (cleanups
);
13195 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13197 /* Now store the final chain of decls for the arguments
13198 as the decl-chain of the current lexical scope.
13199 Put the enumerators in as well, at the front so that
13200 DECL_ARGUMENTS is not modified. */
13201 if (doing_semantic_analysis_p ())
13202 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13204 /* Initialize the RTL code for the function. */
13205 DECL_SAVED_INSNS (fndecl
) = 0;
13206 if (! building_stmt_tree ())
13207 expand_function_start (fndecl
, parms_have_cleanups
);
13209 current_function_parms_stored
= 1;
13211 /* If this function is `main', emit a call to `__main'
13212 to run global initializers, etc. */
13213 if (DECL_MAIN_P (fndecl
) && !building_stmt_tree ())
13214 expand_main_function ();
13216 /* Now that we have initialized the parms, we can start their
13217 cleanups. We cannot do this before, since expand_decl_cleanup
13218 should not be called before the parm can be used. */
13219 if (cleanups
&& !building_stmt_tree ())
13222 if (! expand_decl_cleanup (TREE_PURPOSE (cleanups
),
13223 TREE_VALUE (cleanups
)))
13224 cp_error ("parser lost in parsing declaration of `%D'",
13225 TREE_PURPOSE (cleanups
));
13227 cleanups
= TREE_CHAIN (cleanups
);
13230 /* Create a binding contour which can be used to catch
13231 cleanup-generated temporaries. Also, if the return value needs or
13232 has initialization, deal with that now. */
13233 if (parms_have_cleanups
)
13236 if (!building_stmt_tree ())
13237 expand_start_bindings (2);
13240 /* Do the starting of the exception specifications, if we have any. */
13241 if (flag_exceptions
&& !processing_template_decl
13242 && building_stmt_tree ()
13243 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13244 current_eh_spec_try_block
= expand_start_eh_spec ();
13246 last_parm_cleanup_insn
= get_last_insn ();
13247 last_dtor_insn
= get_last_insn ();
13250 /* Bind a name and initialization to the return value of
13251 the current function. */
13254 store_return_init (decl
)
13257 /* If this named return value comes in a register, put it in a
13258 pseudo-register. */
13259 if (DECL_REGISTER (decl
))
13261 original_result_rtx
= DECL_RTL (decl
);
13262 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
13267 /* We have finished doing semantic analysis on DECL, but have not yet
13268 generated RTL for its body. Save away our current state, so that
13269 when we want to generate RTL later we know what to do. */
13272 save_function_data (decl
)
13275 struct language_function
*f
;
13277 /* Save the language-specific per-function data so that we can
13278 get it back when we really expand this function. */
13279 my_friendly_assert (!DECL_PENDING_INLINE_P (decl
),
13283 f
= ((struct language_function
*)
13284 xmalloc (sizeof (struct language_function
)));
13285 bcopy ((char *) cp_function_chain
, (char *) f
,
13286 sizeof (struct language_function
));
13287 DECL_SAVED_FUNCTION_DATA (decl
) = f
;
13289 /* Clear out the bits we don't need. */
13290 f
->x_base_init_list
= NULL_TREE
;
13291 f
->x_member_init_list
= NULL_TREE
;
13292 f
->x_last_tree
= NULL_TREE
;
13293 f
->x_last_expr_type
= NULL_TREE
;
13294 f
->x_last_dtor_insn
= NULL_RTX
;
13295 f
->x_last_parm_cleanup_insn
= NULL_RTX
;
13296 f
->x_result_rtx
= NULL_RTX
;
13297 f
->x_named_label_uses
= NULL
;
13298 f
->bindings
= NULL
;
13300 /* When we get back here again, we will be expanding. */
13301 f
->x_expanding_p
= 1;
13304 /* At the end of every destructor we generate code to restore virtual
13305 function tables to the values desired by base classes and to call
13306 to base class destructors. Do that now, for DECL. */
13309 finish_destructor_body ()
13311 tree compound_stmt
;
13316 /* Create a block to contain all the extra code. */
13317 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
13319 /* Generate the code to call destructor on base class. If this
13320 destructor belongs to a class with virtual functions, then set
13321 the virtual function table pointer to represent the type of our
13324 /* This side-effect makes call to `build_delete' generate the code
13325 we have to have at the end of this destructor. `build_delete'
13326 will set the flag again. */
13327 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
13329 /* These are two cases where we cannot delegate deletion. */
13330 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)
13331 || TYPE_GETS_REG_DELETE (current_class_type
))
13332 in_charge
= integer_zero_node
;
13334 in_charge
= current_in_charge_parm
;
13336 exprstmt
= build_delete (current_class_type
,
13339 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
,
13342 if (exprstmt
!= error_mark_node
13343 && (TREE_CODE (exprstmt
) != NOP_EXPR
13344 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
13345 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
13347 add_tree (build_min_nt (LABEL_STMT
, dtor_label
));
13348 if (exprstmt
!= void_zero_node
)
13349 /* Don't call `expand_expr_stmt' if we're not going to do
13350 anything, since -Wall will give a diagnostic. */
13351 finish_expr_stmt (exprstmt
);
13353 /* Run destructor on all virtual baseclasses. */
13354 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13356 tree vbases
= nreverse (copy_list (CLASSTYPE_VBASECLASSES (current_class_type
)));
13357 tree if_stmt
= begin_if_stmt ();
13358 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13359 current_in_charge_parm
,
13365 if (TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (vbases
)))
13367 tree vb
= get_vbase
13368 (BINFO_TYPE (vbases
),
13369 TYPE_BINFO (current_class_type
));
13371 (build_scoped_method_call
13372 (current_class_ref
, vb
, dtor_identifier
,
13373 build_expr_list (NULL_TREE
, integer_zero_node
)));
13375 vbases
= TREE_CHAIN (vbases
);
13378 finish_then_clause (if_stmt
);
13383 virtual_size
= c_sizeof (current_class_type
);
13385 /* At the end, call delete if that's what's requested. */
13387 /* FDIS sez: At the point of definition of a virtual destructor
13388 (including an implicit definition), non-placement operator delete
13389 shall be looked up in the scope of the destructor's class and if
13390 found shall be accessible and unambiguous.
13392 This is somewhat unclear, but I take it to mean that if the class
13393 only defines placement deletes we don't do anything here. So we
13394 pass LOOKUP_SPECULATIVELY; delete_sanity will complain for us if
13395 they ever try to delete one of these. */
13396 if (TYPE_GETS_REG_DELETE (current_class_type
)
13397 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13401 exprstmt
= build_op_delete_call
13402 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
13403 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
13405 if_stmt
= begin_if_stmt ();
13406 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13407 current_in_charge_parm
,
13410 finish_expr_stmt (exprstmt
);
13411 finish_then_clause (if_stmt
);
13415 /* Close the block we started above. */
13416 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
13419 /* Finish up a function declaration and compile that function
13420 all the way to assembler language output. The free the storage
13421 for the function definition.
13423 This is called after parsing the body of the function definition.
13424 LINENO is the current line number.
13426 FLAGS is a bitwise or of the following values:
13428 An extra call to poplevel (and expand_end_bindings) must be
13429 made to take care of the binding contour for the base
13430 initializers. This is only relevant for constructors.
13432 We just finished processing the body of an in-class inline
13433 function definition. (This processing will have taken place
13434 after the class definition is complete.) */
13437 finish_function (lineno
, flags
)
13441 register tree fndecl
= current_function_decl
;
13442 tree fntype
, ctype
= NULL_TREE
;
13443 /* Label to use if this function is supposed to return a value. */
13444 tree no_return_label
= NULL_TREE
;
13445 int call_poplevel
= (flags
& 1) != 0;
13446 int inclass_inline
= (flags
& 2) != 0;
13450 /* When we get some parse errors, we can end up without a
13451 current_function_decl, so cope. */
13452 if (fndecl
== NULL_TREE
)
13453 return error_mark_node
;
13455 nested
= function_depth
> 1;
13456 fntype
= TREE_TYPE (fndecl
);
13458 /* TREE_READONLY (fndecl) = 1;
13459 This caused &foo to be of type ptr-to-const-function
13460 which then got a warning when stored in a ptr-to-function variable. */
13462 /* This happens on strange parse errors. */
13463 if (! current_function_parms_stored
)
13466 store_parm_decls ();
13469 if (building_stmt_tree ())
13471 if (DECL_CONSTRUCTOR_P (fndecl
) && call_poplevel
)
13473 else if (DECL_DESTRUCTOR_P (fndecl
) && !processing_template_decl
)
13474 finish_destructor_body ();
13476 /* Finish dealing with exception specifiers. */
13477 if (flag_exceptions
&& !processing_template_decl
13478 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13479 expand_end_eh_spec (TYPE_RAISES_EXCEPTIONS
13480 (TREE_TYPE (current_function_decl
)),
13481 current_eh_spec_try_block
);
13485 if (write_symbols
!= NO_DEBUG
/*&& TREE_CODE (fntype) != METHOD_TYPE*/)
13487 tree ttype
= target_type (fntype
);
13490 if (IS_AGGR_TYPE (ttype
))
13491 /* Let debugger know it should output info for this type. */
13492 note_debug_info_needed (ttype
);
13494 for (parmdecl
= DECL_ARGUMENTS (fndecl
); parmdecl
; parmdecl
= TREE_CHAIN (parmdecl
))
13496 ttype
= target_type (TREE_TYPE (parmdecl
));
13497 if (IS_AGGR_TYPE (ttype
))
13498 /* Let debugger know it should output info for this type. */
13499 note_debug_info_needed (ttype
);
13503 /* Clean house because we will need to reorder insns here. */
13504 do_pending_stack_adjust ();
13508 else if (DECL_CONSTRUCTOR_P (fndecl
))
13510 /* This is where the body of the constructor begins. All
13511 subobjects have been fully constructed at this point. */
13512 end_protect_partials ();
13514 /* This is where the body of the constructor ends. */
13515 expand_label (ctor_label
);
13516 ctor_label
= NULL_TREE
;
13521 /* c_expand_return knows to return 'this' from a constructor. */
13522 c_expand_return (NULL_TREE
);
13524 else if (DECL_MAIN_P (fndecl
))
13526 /* Make it so that `main' always returns 0 by default. */
13528 c_expand_return (integer_one_node
);
13530 c_expand_return (integer_zero_node
);
13533 else if (return_label
!= NULL_RTX
13534 && flag_this_is_variable
<= 0
13535 && current_function_return_value
== NULL_TREE
13536 && ! DECL_NAME (DECL_RESULT (current_function_decl
)))
13537 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13539 if (flag_exceptions
)
13540 expand_exception_blocks ();
13542 /* If this function is supposed to return a value, ensure that
13543 we do not fall into the cleanups by mistake. The end of our
13544 function will look like this:
13546 user code (may have return stmt somewhere)
13547 goto no_return_label
13552 NOTE_INSN_FUNCTION_END
13556 If the user omits a return stmt in the USER CODE section, we
13557 will have a control path which reaches NOTE_INSN_FUNCTION_END.
13558 Otherwise, we won't. */
13559 if (no_return_label
)
13561 DECL_CONTEXT (no_return_label
) = fndecl
;
13562 DECL_INITIAL (no_return_label
) = error_mark_node
;
13563 DECL_SOURCE_FILE (no_return_label
) = input_filename
;
13564 DECL_SOURCE_LINE (no_return_label
) = lineno
;
13565 expand_goto (no_return_label
);
13570 /* Remove the binding contour which is used
13571 to catch cleanup-generated temporaries. */
13572 expand_end_bindings (0, 0, 0);
13573 poplevel (0, 0, 0);
13575 /* Emit label at beginning of cleanup code for parameters. */
13576 emit_label (cleanup_label
);
13579 /* Get return value into register if that's where it's supposed
13581 if (original_result_rtx
)
13582 fixup_result_decl (DECL_RESULT (fndecl
), original_result_rtx
);
13584 /* Finish building code that will trigger warnings if users forget
13585 to make their functions return values. */
13586 if (no_return_label
|| cleanup_label
)
13587 emit_jump (return_label
);
13588 if (no_return_label
)
13590 /* We don't need to call `expand_*_return' here because we
13591 don't need any cleanups here--this path of code is only
13592 for error checking purposes. */
13593 expand_label (no_return_label
);
13596 /* We hard-wired immediate_size_expand to zero in
13597 start_function. Expand_function_end will decrement this
13598 variable. So, we set the variable to one here, so that after
13599 the decrement it will remain zero. */
13600 immediate_size_expand
= 1;
13602 /* Generate rtl for function exit. */
13603 expand_function_end (input_filename
, lineno
, 1);
13606 /* We have to save this value here in case
13607 maybe_end_member_template_processing decides to pop all the
13608 template parameters. */
13609 expand_p
= !building_stmt_tree ();
13611 /* If we're saving up tree structure, tie off the function now. */
13613 finish_stmt_tree (fndecl
);
13615 /* This must come after expand_function_end because cleanups might
13616 have declarations (from inline functions) that need to go into
13617 this function's blocks. */
13618 if (doing_semantic_analysis_p ())
13620 if (current_binding_level
->parm_flag
!= 1)
13621 my_friendly_abort (122);
13622 poplevel (1, 0, 1);
13625 /* Remember that we were in class scope. */
13626 if (current_class_name
)
13627 ctype
= current_class_type
;
13629 /* Must mark the RESULT_DECL as being in this function. */
13630 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
13632 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
13633 to the FUNCTION_DECL node itself. */
13634 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
13636 /* Undo the call to push_momentary in start_function. */
13639 /* Save away current state, if appropriate. */
13640 if (!expanding_p
&& !processing_template_decl
)
13641 save_function_data (fndecl
);
13647 int saved_flag_keep_inline_functions
=
13648 flag_keep_inline_functions
;
13650 /* So we can tell if jump_optimize sets it to 1. */
13653 if (DECL_CONTEXT (fndecl
) != NULL_TREE
13654 && hack_decl_function_context (fndecl
))
13655 /* Trick rest_of_compilation into not deferring output of this
13656 function, even if it is inline, since the rtl_obstack for
13657 this function is the function_obstack of the enclosing
13658 function and will be deallocated when the enclosing
13659 function is gone. See save_tree_status. */
13660 flag_keep_inline_functions
= 1;
13662 /* Before we call rest_of_compilation (which will pop the
13663 CURRENT_FUNCTION), we must save these values. */
13664 returns_null
= current_function_returns_null
;
13665 returns_value
= current_function_returns_value
;
13667 /* If this is a nested function (like a template instantiation
13668 that we're compiling in the midst of compiling something
13669 else), push a new GC context. That will keep local variables
13670 on the stack from being collected while we're doing the
13671 compilation of this function. */
13672 if (function_depth
> 1)
13673 ggc_push_context ();
13675 /* Run the optimizers and output the assembler code for this
13677 if (DECL_ARTIFICIAL (fndecl
))
13679 /* Do we really *want* to inline this synthesized method? */
13681 int save_fif
= flag_inline_functions
;
13682 flag_inline_functions
= 1;
13684 /* Turn off DECL_INLINE for the moment so function_cannot_inline_p
13685 will check our size. */
13686 DECL_INLINE (fndecl
) = 0;
13688 rest_of_compilation (fndecl
);
13689 flag_inline_functions
= save_fif
;
13692 rest_of_compilation (fndecl
);
13694 /* Undo the call to ggc_push_context above. */
13695 if (function_depth
> 1)
13696 ggc_pop_context ();
13698 flag_keep_inline_functions
= saved_flag_keep_inline_functions
;
13700 if (DECL_SAVED_INSNS (fndecl
) && ! TREE_ASM_WRITTEN (fndecl
))
13702 /* Set DECL_EXTERNAL so that assemble_external will be called as
13703 necessary. We'll clear it again in finish_file. */
13704 if (! DECL_EXTERNAL (fndecl
))
13705 DECL_NOT_REALLY_EXTERN (fndecl
) = 1;
13706 DECL_EXTERNAL (fndecl
) = 1;
13707 mark_inline_for_output (fndecl
);
13710 if (ctype
&& TREE_ASM_WRITTEN (fndecl
))
13711 note_debug_info_needed (ctype
);
13713 returns_null
|= can_reach_end
;
13715 /* Since we don't normally go through c_expand_return for constructors,
13716 this normally gets the wrong value.
13717 Also, named return values have their return codes emitted after
13718 NOTE_INSN_FUNCTION_END, confusing jump.c. */
13719 if (DECL_CONSTRUCTOR_P (fndecl
)
13720 || DECL_NAME (DECL_RESULT (fndecl
)) != NULL_TREE
)
13723 if (TREE_THIS_VOLATILE (fndecl
) && returns_null
)
13724 cp_warning ("`noreturn' function `%D' does return", fndecl
);
13725 else if ((warn_return_type
|| pedantic
)
13727 && TREE_CODE (TREE_TYPE (fntype
)) != VOID_TYPE
)
13729 /* If this function returns non-void and control can drop through,
13731 cp_warning ("control reaches end of non-void function `%D'", fndecl
);
13733 /* With just -W, complain only if function returns both with
13734 and without a value. */
13735 else if (extra_warnings
&& returns_value
&& returns_null
)
13736 warning ("this function may return with or without a value");
13740 /* Since we never call rest_of_compilation, we never clear
13741 CURRENT_FUNCTION. Do so explicitly. */
13742 free_after_compilation (current_function
);
13743 current_function
= NULL
;
13746 /* If this is a in-class inline definition, we may have to pop the
13747 bindings for the template parameters that we added in
13748 maybe_begin_member_template_processing when start_function was
13750 if (inclass_inline
)
13751 maybe_end_member_template_processing ();
13753 /* Leave the scope of the class. */
13755 pop_nested_class ();
13759 /* Free all the tree nodes making up this function. */
13760 /* Switch back to allocating nodes permanently
13761 until we start another function. */
13763 permanent_allocation (1);
13765 if (!DECL_SAVED_INSNS (fndecl
) && !DECL_SAVED_FUNCTION_DATA (fndecl
))
13769 /* Stop pointing to the local nodes about to be freed. */
13770 /* But DECL_INITIAL must remain nonzero so we know this
13771 was an actual function definition. */
13772 DECL_INITIAL (fndecl
) = error_mark_node
;
13773 for (t
= DECL_ARGUMENTS (fndecl
); t
; t
= TREE_CHAIN (t
))
13774 DECL_RTL (t
) = DECL_INCOMING_RTL (t
) = NULL_RTX
;
13777 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
13778 static_ctors
= tree_cons (NULL_TREE
, fndecl
, static_ctors
);
13779 if (DECL_STATIC_DESTRUCTOR (fndecl
))
13780 static_dtors
= tree_cons (NULL_TREE
, fndecl
, static_dtors
);
13785 /* Let the error reporting routines know that we're outside a
13786 function. For a nested function, this value is used in
13787 pop_cp_function_context and then reset via pop_function_context. */
13788 current_function_decl
= NULL_TREE
;
13794 /* Create the FUNCTION_DECL for a function definition.
13795 DECLSPECS and DECLARATOR are the parts of the declaration;
13796 they describe the return type and the name of the function,
13797 but twisted together in a fashion that parallels the syntax of C.
13799 This function creates a binding context for the function body
13800 as well as setting up the FUNCTION_DECL in current_function_decl.
13802 Returns a FUNCTION_DECL on success.
13804 If the DECLARATOR is not suitable for a function (it defines a datum
13805 instead), we return 0, which tells yyparse to report a parse error.
13807 May return void_type_node indicating that this method is actually
13808 a friend. See grokfield for more details.
13810 Came here with a `.pushlevel' .
13812 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
13813 CHANGES TO CODE IN `grokfield'. */
13816 start_method (declspecs
, declarator
, attrlist
)
13817 tree declarator
, declspecs
, attrlist
;
13819 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
13822 /* Something too ugly to handle. */
13823 if (fndecl
== NULL_TREE
)
13826 /* Pass friends other than inline friend functions back. */
13827 if (fndecl
== void_type_node
)
13830 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
13831 /* Not a function, tell parser to report parse error. */
13834 if (DECL_IN_AGGR_P (fndecl
))
13836 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
13838 if (DECL_CONTEXT (fndecl
)
13839 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
13840 cp_error ("`%D' is already defined in class %s", fndecl
,
13841 TYPE_NAME_STRING (DECL_CONTEXT (fndecl
)));
13843 return void_type_node
;
13846 check_template_shadow (fndecl
);
13848 DECL_THIS_INLINE (fndecl
) = 1;
13850 if (flag_default_inline
)
13851 DECL_INLINE (fndecl
) = 1;
13853 /* We process method specializations in finish_struct_1. */
13854 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
13855 fndecl
= push_template_decl (fndecl
);
13857 /* We read in the parameters on the maybepermanent_obstack,
13858 but we won't be getting back to them until after we
13859 may have clobbered them. So the call to preserve_data
13860 will keep them safe. */
13863 if (! DECL_FRIEND_P (fndecl
))
13865 if (TREE_CHAIN (fndecl
))
13867 fndecl
= copy_node (fndecl
);
13868 TREE_CHAIN (fndecl
) = NULL_TREE
;
13871 if (DECL_CONSTRUCTOR_P (fndecl
))
13873 if (! grok_ctor_properties (current_class_type
, fndecl
))
13874 return void_type_node
;
13876 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
13877 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
13880 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0, 0);
13882 /* Make a place for the parms */
13884 current_binding_level
->parm_flag
= 1;
13886 DECL_IN_AGGR_P (fndecl
) = 1;
13890 /* Go through the motions of finishing a function definition.
13891 We don't compile this method until after the whole class has
13894 FINISH_METHOD must return something that looks as though it
13895 came from GROKFIELD (since we are defining a method, after all).
13897 This is called after parsing the body of the function definition.
13898 STMTS is the chain of statements that makes up the function body.
13900 DECL is the ..._DECL that `start_method' provided. */
13903 finish_method (decl
)
13906 register tree fndecl
= decl
;
13909 register tree link
;
13911 if (decl
== void_type_node
)
13914 old_initial
= DECL_INITIAL (fndecl
);
13916 /* Undo the level for the parms (from start_method).
13917 This is like poplevel, but it causes nothing to be
13918 saved. Saving information here confuses symbol-table
13919 output routines. Besides, this information will
13920 be correctly output when this method is actually
13923 /* Clear out the meanings of the local variables of this level;
13924 also record in each decl which block it belongs to. */
13926 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
13928 if (DECL_NAME (link
) != NULL_TREE
)
13929 pop_binding (DECL_NAME (link
), link
);
13930 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
13931 DECL_CONTEXT (link
) = NULL_TREE
;
13934 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
13935 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
13936 current_binding_level
->parm_flag
,
13937 current_binding_level
->keep
);
13939 poplevel (0, 0, 0);
13941 DECL_INITIAL (fndecl
) = old_initial
;
13943 /* We used to check if the context of FNDECL was different from
13944 current_class_type as another way to get inside here. This didn't work
13945 for String.cc in libg++. */
13946 if (DECL_FRIEND_P (fndecl
))
13948 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
13949 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
13950 decl
= void_type_node
;
13956 /* Called when a new struct TYPE is defined.
13957 If this structure or union completes the type of any previous
13958 variable declaration, lay it out and output its rtl. */
13961 hack_incomplete_structures (type
)
13966 if (current_binding_level
->incomplete
== NULL_TREE
)
13969 if (!type
) /* Don't do this for class templates. */
13972 for (list
= ¤t_binding_level
->incomplete
; *list
; )
13974 tree decl
= TREE_VALUE (*list
);
13975 if ((decl
&& TREE_TYPE (decl
) == type
)
13976 || (TREE_TYPE (decl
)
13977 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
13978 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
13980 int toplevel
= toplevel_bindings_p ();
13981 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
13982 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
13983 layout_type (TREE_TYPE (decl
));
13984 layout_decl (decl
, 0);
13985 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
13989 expand_decl (decl
);
13990 cleanup
= maybe_build_cleanup (decl
);
13991 expand_decl_init (decl
);
13992 if (! expand_decl_cleanup (decl
, cleanup
))
13993 cp_error ("parser lost in parsing declaration of `%D'",
13996 *list
= TREE_CHAIN (*list
);
13999 list
= &TREE_CHAIN (*list
);
14003 /* If DECL is of a type which needs a cleanup, build that cleanup here.
14004 See build_delete for information about AUTO_DELETE.
14006 Don't build these on the momentary obstack; they must live
14007 the life of the binding contour. */
14010 maybe_build_cleanup_1 (decl
, auto_delete
)
14011 tree decl
, auto_delete
;
14013 tree type
= TREE_TYPE (decl
);
14014 if (type
!= error_mark_node
&& TYPE_NEEDS_DESTRUCTOR (type
))
14016 int temp
= 0, flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14019 if (TREE_CODE (decl
) != PARM_DECL
)
14020 temp
= suspend_momentary ();
14022 if (TREE_CODE (type
) == ARRAY_TYPE
)
14026 mark_addressable (decl
);
14027 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14030 /* Optimize for space over speed here. */
14031 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14032 || flag_expensive_optimizations
)
14033 flags
|= LOOKUP_NONVIRTUAL
;
14035 rval
= build_delete (TREE_TYPE (rval
), rval
, auto_delete
, flags
, 0);
14037 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14038 && ! TYPE_HAS_DESTRUCTOR (type
))
14039 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14040 build_expr_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14042 if (TREE_CODE (decl
) != PARM_DECL
)
14043 resume_momentary (temp
);
14050 /* Build a TARGET_EXPR, initializing the DECL with the VALUE. */
14053 build_target_expr (decl
, value
)
14059 t
= build (TARGET_EXPR
, TREE_TYPE (decl
), decl
, value
,
14060 maybe_build_cleanup (decl
), NULL_TREE
);
14061 /* We always set TREE_SIDE_EFFECTS so that expand_expr does not
14062 ignore the TARGET_EXPR. If there really turn out to be no
14063 side-effects, then the optimizer should be able to get rid of
14064 whatever code is generated anyhow. */
14065 TREE_SIDE_EFFECTS (t
) = 1;
14070 /* If DECL is of a type which needs a cleanup, build that cleanup
14071 here. The cleanup does free the storage with a call to delete. */
14074 maybe_build_cleanup_and_delete (decl
)
14077 return maybe_build_cleanup_1 (decl
, integer_three_node
);
14080 /* If DECL is of a type which needs a cleanup, build that cleanup
14081 here. The cleanup does not free the storage with a call a delete. */
14084 maybe_build_cleanup (decl
)
14087 return maybe_build_cleanup_1 (decl
, integer_two_node
);
14090 /* Expand a C++ expression at the statement level.
14091 This is needed to ferret out nodes which have UNKNOWN_TYPE.
14092 The C++ type checker should get all of these out when
14093 expressions are combined with other, type-providing, expressions,
14094 leaving only orphan expressions, such as:
14096 &class::bar; / / takes its address, but does nothing with it. */
14099 cplus_expand_expr_stmt (exp
)
14102 if (stmts_are_full_exprs_p
)
14103 exp
= convert_to_void (exp
, "statement");
14106 /* We should do this eventually, but right now this causes regex.o from
14107 libg++ to miscompile, and tString to core dump. */
14108 exp
= build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (exp
), exp
);
14111 /* If we don't do this, we end up down inside expand_expr
14112 trying to do TYPE_MODE on the ERROR_MARK, and really
14113 go outside the bounds of the type. */
14114 if (exp
!= error_mark_node
)
14115 expand_expr_stmt (break_out_cleanups (exp
));
14118 /* When a stmt has been parsed, this function is called. */
14123 /* Always assume this statement was not an expression statement. If
14124 it actually was an expression statement, its our callers
14125 responsibility to fix this up. */
14126 last_expr_type
= NULL_TREE
;
14129 /* Change a static member function definition into a FUNCTION_TYPE, instead
14130 of the METHOD_TYPE that we create when it's originally parsed.
14132 WARNING: DO NOT pass &TREE_TYPE (decl) to FN or &TYPE_ARG_TYPES
14133 (TREE_TYPE (decl)) to ARGTYPES, as doing so will corrupt the types of
14134 other decls. Either pass the addresses of local variables or NULL. */
14137 revert_static_member_fn (decl
, fn
, argtypes
)
14138 tree
*decl
, *fn
, *argtypes
;
14141 tree function
= fn
? *fn
: TREE_TYPE (*decl
);
14142 tree args
= argtypes
? *argtypes
: TYPE_ARG_TYPES (function
);
14144 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14145 != TYPE_UNQUALIFIED
)
14146 cp_error ("static member function `%#D' declared with type qualifiers",
14149 args
= TREE_CHAIN (args
);
14150 tmp
= build_function_type (TREE_TYPE (function
), args
);
14151 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14152 tmp
= build_exception_variant (tmp
,
14153 TYPE_RAISES_EXCEPTIONS (function
));
14154 TREE_TYPE (*decl
) = tmp
;
14155 if (DECL_ARGUMENTS (*decl
))
14156 DECL_ARGUMENTS (*decl
) = TREE_CHAIN (DECL_ARGUMENTS (*decl
));
14157 DECL_STATIC_FUNCTION_P (*decl
) = 1;
14164 /* Initialize the variables used during compilation of a C++
14168 push_cp_function_context (f
)
14169 struct function
*f
;
14171 struct language_function
*p
14172 = ((struct language_function
*)
14173 xcalloc (1, sizeof (struct language_function
)));
14176 /* It takes an explicit call to expand_body to generate RTL for a
14180 /* Whenever we start a new function, we destroy temporaries in the
14182 stmts_are_full_exprs_p
= 1;
14185 /* Free the language-specific parts of F, now that we've finished
14186 compiling the function. */
14189 pop_cp_function_context (f
)
14190 struct function
*f
;
14192 free (f
->language
);
14196 /* Mark P for GC. */
14199 mark_lang_function (p
)
14200 struct language_function
*p
;
14205 ggc_mark_tree (p
->x_named_labels
);
14206 ggc_mark_tree (p
->x_ctor_label
);
14207 ggc_mark_tree (p
->x_dtor_label
);
14208 ggc_mark_tree (p
->x_base_init_list
);
14209 ggc_mark_tree (p
->x_member_init_list
);
14210 ggc_mark_tree (p
->x_current_class_ptr
);
14211 ggc_mark_tree (p
->x_current_class_ref
);
14212 ggc_mark_tree (p
->x_last_tree
);
14213 ggc_mark_tree (p
->x_last_expr_type
);
14214 ggc_mark_tree (p
->x_eh_spec_try_block
);
14215 ggc_mark_tree (p
->x_scope_stmt_stack
);
14217 ggc_mark_rtx (p
->x_last_dtor_insn
);
14218 ggc_mark_rtx (p
->x_last_parm_cleanup_insn
);
14219 ggc_mark_rtx (p
->x_result_rtx
);
14221 mark_binding_level (&p
->bindings
);
14224 /* Mark the language-specific data in F for GC. */
14227 mark_cp_function_context (f
)
14228 struct function
*f
;
14230 mark_lang_function (f
->language
);
14236 return function_depth
!= 0;
14241 lang_mark_false_label_stack (l
)
14242 struct label_node
*l
;
14244 /* C++ doesn't use false_label_stack. It better be NULL. */
14245 my_friendly_assert (l
== NULL
, 19990904);
14252 enum tree_code code
= TREE_CODE (t
);
14253 if (code
== IDENTIFIER_NODE
)
14255 struct lang_identifier
*li
= (struct lang_identifier
*) t
;
14256 struct lang_id2
*li2
= li
->x
;
14257 ggc_mark_tree (li
->namespace_bindings
);
14258 ggc_mark_tree (li
->bindings
);
14259 ggc_mark_tree (li
->class_value
);
14260 ggc_mark_tree (li
->class_template_info
);
14264 ggc_mark_tree (li2
->label_value
);
14265 ggc_mark_tree (li2
->implicit_decl
);
14266 ggc_mark_tree (li2
->error_locus
);
14269 else if (code
== CPLUS_BINDING
)
14271 if (BINDING_HAS_LEVEL_P (t
))
14272 mark_binding_level (&BINDING_LEVEL (t
));
14274 ggc_mark_tree (BINDING_SCOPE (t
));
14275 ggc_mark_tree (BINDING_VALUE (t
));
14277 else if (code
== OVERLOAD
)
14278 ggc_mark_tree (OVL_FUNCTION (t
));
14279 else if (code
== TEMPLATE_PARM_INDEX
)
14280 ggc_mark_tree (TEMPLATE_PARM_DECL (t
));
14281 else if (TREE_CODE_CLASS (code
) == 'd')
14283 struct lang_decl
*ld
= DECL_LANG_SPECIFIC (t
);
14288 ggc_mark_tree (ld
->decl_flags
.access
);
14289 ggc_mark_tree (ld
->decl_flags
.context
);
14290 if (TREE_CODE (t
) != NAMESPACE_DECL
)
14291 ggc_mark_tree (ld
->decl_flags
.u
.template_info
);
14292 if (CAN_HAVE_FULL_LANG_DECL_P (t
))
14294 ggc_mark_tree (ld
->main_decl_variant
);
14295 ggc_mark_tree (ld
->befriending_classes
);
14296 ggc_mark_tree (ld
->saved_tree
);
14297 if (TREE_CODE (t
) == TYPE_DECL
)
14298 ggc_mark_tree (ld
->u
.sorted_fields
);
14299 else if (TREE_CODE (t
) == FUNCTION_DECL
14300 && !DECL_PENDING_INLINE_P (t
))
14301 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t
));
14305 else if (TREE_CODE_CLASS (code
) == 't')
14307 struct lang_type
*lt
= TYPE_LANG_SPECIFIC (t
);
14309 if (lt
&& !(TREE_CODE (t
) == POINTER_TYPE
14310 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
14313 ggc_mark_tree (lt
->vfields
);
14314 ggc_mark_tree (lt
->vbases
);
14315 ggc_mark_tree (lt
->tags
);
14316 ggc_mark_tree (lt
->search_slot
);
14317 ggc_mark_tree (lt
->size
);
14318 ggc_mark_tree (lt
->abstract_virtuals
);
14319 ggc_mark_tree (lt
->friend_classes
);
14320 ggc_mark_tree (lt
->rtti
);
14321 ggc_mark_tree (lt
->methods
);
14322 ggc_mark_tree (lt
->template_info
);
14323 ggc_mark_tree (lt
->befriending_classes
);
14326 /* In the case of pointer-to-member function types, the
14327 TYPE_LANG_SPECIFIC is really just a tree. */
14328 ggc_mark_tree ((tree
) lt
);