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 #ifndef WCHAR_UNSIGNED
67 #define WCHAR_UNSIGNED 0
70 #ifndef CHAR_TYPE_SIZE
71 #define CHAR_TYPE_SIZE BITS_PER_UNIT
74 #ifndef BOOL_TYPE_SIZE
75 #ifdef SLOW_BYTE_ACCESS
76 #define BOOL_TYPE_SIZE ((SLOW_BYTE_ACCESS) ? (POINTER_SIZE) : (CHAR_TYPE_SIZE))
78 #define BOOL_TYPE_SIZE CHAR_TYPE_SIZE
82 /* We let tm.h override the types used here, to handle trivial differences
83 such as the choice of unsigned int or long unsigned int for size_t.
84 When machines start needing nontrivial differences in the size type,
85 it would be best to do something here to figure out automatically
86 from other information what type to use. */
89 #define SIZE_TYPE "long unsigned int"
93 #define PTRDIFF_TYPE "long int"
97 #define WCHAR_TYPE "int"
100 static tree grokparms
PROTO((tree
, int));
101 static const char *redeclaration_error_message
PROTO((tree
, tree
));
103 static void push_binding_level
PROTO((struct binding_level
*, int,
105 static void pop_binding_level
PROTO((void));
106 static void suspend_binding_level
PROTO((void));
107 static void resume_binding_level
PROTO((struct binding_level
*));
108 static struct binding_level
*make_binding_level
PROTO((void));
109 static void declare_namespace_level
PROTO((void));
110 static void signal_catch
PROTO((int)) ATTRIBUTE_NORETURN
;
111 static void storedecls
PROTO((tree
));
112 static void require_complete_types_for_parms
PROTO((tree
));
113 static void push_overloaded_decl_1
PROTO((tree
));
114 static int ambi_op_p
PROTO((tree
));
115 static int unary_op_p
PROTO((tree
));
116 static tree store_bindings
PROTO((tree
, tree
));
117 static tree lookup_tag_reverse
PROTO((tree
, tree
));
118 static tree obscure_complex_init
PROTO((tree
, tree
));
119 static tree maybe_build_cleanup_1
PROTO((tree
, tree
));
120 static tree lookup_name_real
PROTO((tree
, int, int, int));
121 static void warn_extern_redeclared_static
PROTO((tree
, tree
));
122 static void grok_reference_init
PROTO((tree
, tree
, tree
));
123 static tree grokfndecl
PROTO((tree
, tree
, tree
, tree
, int,
124 enum overload_flags
, tree
,
125 tree
, int, int, int, int, int, int, tree
));
126 static tree grokvardecl
PROTO((tree
, tree
, RID_BIT_TYPE
*, int, int, tree
));
127 static tree lookup_tag
PROTO((enum tree_code
, tree
,
128 struct binding_level
*, int));
129 static void set_identifier_type_value_with_scope
130 PROTO((tree
, tree
, struct binding_level
*));
131 static void record_builtin_type
PROTO((enum rid
, const char *, tree
));
132 static void record_unknown_type
PROTO((tree
, const char *));
133 static int member_function_or_else
PROTO((tree
, tree
, const char *));
134 static void bad_specifiers
PROTO((tree
, const char *, int, int, int, int,
136 static void lang_print_error_function
PROTO((const char *));
137 static tree maybe_process_template_type_declaration
PROTO((tree
, int, struct binding_level
*));
138 static void check_for_uninitialized_const_var
PROTO((tree
));
139 static unsigned long typename_hash
PROTO((hash_table_key
));
140 static boolean typename_compare
PROTO((hash_table_key
, hash_table_key
));
141 static void push_binding
PROTO((tree
, tree
, struct binding_level
*));
142 static int add_binding
PROTO((tree
, tree
));
143 static void pop_binding
PROTO((tree
, tree
));
144 static tree local_variable_p
PROTO((tree
*, int *, void *));
145 static tree find_binding
PROTO((tree
, tree
));
146 static tree select_decl
PROTO((tree
, int));
147 static int lookup_flags
PROTO((int, int));
148 static tree qualify_lookup
PROTO((tree
, int));
149 static tree record_builtin_java_type
PROTO((const char *, int));
150 static const char *tag_name
PROTO((enum tag_types code
));
151 static void find_class_binding_level
PROTO((void));
152 static struct binding_level
*innermost_nonclass_level
PROTO((void));
153 static void warn_about_implicit_typename_lookup
PROTO((tree
, tree
));
154 static int walk_namespaces_r
PROTO((tree
, walk_namespaces_fn
, void *));
155 static int walk_globals_r
PROTO((tree
, void *));
156 static void add_decl_to_level
PROTO((tree
, struct binding_level
*));
157 static tree make_label_decl
PROTO((tree
, int));
158 static void pop_label
PROTO((tree
));
159 static void pop_labels
PROTO((tree
));
160 static void maybe_deduce_size_from_array_init
PROTO((tree
, tree
));
161 static void layout_var_decl
PROTO((tree
));
162 static void maybe_commonize_var
PROTO((tree
));
163 static tree check_initializer
PROTO((tree
, tree
));
164 static void make_rtl_for_nonlocal_decl
PROTO((tree
, tree
, const char *));
165 static void push_cp_function_context
PROTO((struct function
*));
166 static void pop_cp_function_context
PROTO((struct function
*));
167 static void mark_binding_level
PROTO((void *));
168 static void mark_cp_function_context
PROTO((struct function
*));
169 static void mark_saved_scope
PROTO((void *));
170 static void mark_lang_function
PROTO((struct language_function
*));
171 static void mark_stmt_tree
PROTO((struct stmt_tree
*));
172 static void save_function_data
PROTO((tree
));
173 static void check_function_type
PROTO((tree
));
174 static void destroy_local_static
PROTO((tree
));
175 static void destroy_local_var
PROTO((tree
));
176 static void finish_constructor_body
PROTO((void));
177 static void finish_destructor_body
PROTO((void));
178 static tree compute_array_index_type
PROTO((tree
, tree
));
179 static tree create_array_type_for_decl
PROTO((tree
, tree
, tree
));
181 #if defined (DEBUG_CP_BINDING_LEVELS)
182 static void indent
PROTO((void));
185 /* Erroneous argument lists can use this *IFF* they do not modify it. */
186 tree error_mark_list
;
188 /* The following symbols are subsumed in the cp_global_trees array, and
189 listed here individually for documentation purposes.
192 tree wchar_decl_node;
195 tree vtable_entry_type;
196 tree delta_type_node;
199 tree __baselist_desc_type_node;
200 tree __i_desc_type_node, __m_desc_type_node;
201 tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type;
203 tree __t_desc_type_node;
205 tree __tp_desc_type_node;
207 tree __access_mode_type_node;
208 tree __bltn_desc_type_node, __user_desc_type_node, __class_desc_type_node;
209 tree __ptr_desc_type_node, __attr_desc_type_node, __func_desc_type_node;
210 tree __ptmf_desc_type_node, __ptmd_desc_type_node;
212 Not needed yet? May be needed one day?
213 tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type;
214 tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type;
215 tree __ptmf_desc_array_type, __ptmd_desc_array_type;
218 tree class_star_type_node;
219 tree class_type_node, record_type_node, union_type_node, enum_type_node;
220 tree unknown_type_node;
222 Array type `vtable_entry_type[]'
225 tree vtbl_ptr_type_node;
231 A FUNCTION_DECL which can call `abort'. Not necessarily the
232 one that the user will declare, but sufficient to be called
233 by routines that want to abort the program.
237 The FUNCTION_DECL for the default `::operator delete'.
239 tree global_delete_fndecl;
242 tree type_info_type_node, tinfo_fn_id, tinfo_fn_type;
246 tree cp_global_trees
[CPTI_MAX
];
248 /* Indicates that there is a type value in some namespace, although
249 that is not necessarily in scope at the moment. */
251 static tree global_type_node
;
256 /* Expect only namespace names now. */
257 static int only_namespace_names
;
259 /* If original DECL_RESULT of current function was a register,
260 but due to being an addressable named return value, would up
261 on the stack, this variable holds the named return value's
262 original location. */
264 #define original_result_rtx cp_function_chain->x_result_rtx
266 struct named_label_list
268 struct binding_level
*binding_level
;
271 const char *filename_o_goto
;
273 struct named_label_list
*next
;
276 /* Used only for jumps to as-yet undefined labels, since jumps to
277 defined labels can have their validity checked by stmt.c. */
279 #define named_label_uses cp_function_chain->x_named_label_uses
281 /* A list of objects which have constructors or destructors
282 which reside in the global scope. The decl is stored in
283 the TREE_VALUE slot and the initializer is stored
284 in the TREE_PURPOSE slot. */
285 tree static_aggregates
;
289 /* A node for the integer constants 2, and 3. */
291 tree integer_two_node
, integer_three_node
;
293 /* Parsing a function declarator leaves here a chain of structure
294 and enum types declared in the parmlist. */
296 static tree last_function_parm_tags
;
298 /* Similar, for last_function_parm_tags. */
299 tree last_function_parms
;
300 static tree current_function_parm_tags
;
302 /* A list (chain of TREE_LIST nodes) of all LABEL_DECLs in the function
303 that have names. Here so we can clear out their names' definitions
304 at the end of the function. The TREE_VALUE is a LABEL_DECL; the
305 TREE_PURPOSE is the previous binding of the label. */
307 #define named_labels cp_function_chain->x_named_labels
309 /* The FUNCTION_DECL for the function currently being compiled,
310 or 0 if between functions. */
311 tree current_function_decl
;
313 /* Set to 0 at beginning of a function definition, and whenever
314 a label (case or named) is defined. Set to value of expression
315 returned from function when that value can be transformed into
316 a named return value. */
318 tree current_function_return_value
;
320 /* Nonzero means give `double' the same size as `float'. */
322 extern int flag_short_double
;
324 /* Nonzero means don't recognize any builtin functions. */
326 extern int flag_no_builtin
;
328 /* Nonzero means don't recognize the non-ANSI builtin functions.
331 extern int flag_no_nonansi_builtin
;
333 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
335 extern int flag_huge_objects
;
337 /* Nonzero if we want to conserve space in the .o files. We do this
338 by putting uninitialized data and runtime initialized data into
339 .common instead of .data at the expense of not flagging multiple
341 extern int flag_conserve_space
;
343 /* C and C++ flags are in decl2.c. */
345 /* Flag used when debugging spew.c */
347 extern int spew_debug
;
349 /* A expression of value 0 with the same precision as a sizetype
351 tree signed_size_zero_node
;
353 /* The name of the anonymous namespace, throughout this translation
355 tree anonymous_namespace_name
;
358 /* For each binding contour we allocate a binding_level structure
359 which records the names defined in that contour.
362 1) one for each function definition,
363 where internal declarations of the parameters appear.
364 2) one for each compound statement,
365 to record its declarations.
367 The current meaning of a name can be found by searching the levels
368 from the current one out to the global one.
370 Off to the side, may be the class_binding_level. This exists only
371 to catch class-local declarations. It is otherwise nonexistent.
373 Also there may be binding levels that catch cleanups that must be
374 run when exceptions occur. Thus, to see whether a name is bound in
375 the current scope, it is not enough to look in the
376 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
379 /* Note that the information in the `names' component of the global contour
380 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
384 /* A chain of _DECL nodes for all variables, constants, functions,
385 and typedef types. These are in the reverse of the order
386 supplied. There may be OVERLOADs on this list, too, but they
387 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
390 /* A list of structure, union and enum definitions, for looking up
392 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
393 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
394 or ENUMERAL_TYPE node.
396 C++: the TREE_VALUE nodes can be simple types for
397 component_bindings. */
400 /* A list of USING_DECL nodes. */
403 /* A list of used namespaces. PURPOSE is the namespace,
404 VALUE the common ancestor with this binding_level's namespace. */
405 tree using_directives
;
407 /* If this binding level is the binding level for a class, then
408 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
409 is the name of an entity bound in the class; the TREE_VALUE is
410 the IDENTIFIER_CLASS_VALUE before we entered the class. Thus,
411 when leaving class scope, we can restore the
412 IDENTIFIER_CLASS_VALUE by walking this list. The TREE_TYPE is
413 the DECL bound by this name in the class. */
416 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
417 is used for all binding levels. */
420 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
421 label in this scope. The TREE_PURPOSE is the previous value of
422 the IDENTIFIER_LABEL VALUE. */
423 tree shadowed_labels
;
425 /* For each level (except not the global one),
426 a chain of BLOCK nodes for all the levels
427 that were entered and exited one level down. */
430 /* The BLOCK node for this level, if one has been preallocated.
431 If 0, the BLOCK is allocated (if needed) when the level is popped. */
434 /* The binding level which this one is contained in (inherits from). */
435 struct binding_level
*level_chain
;
437 /* List of decls in `names' that have incomplete
438 structure or union types. */
441 /* List of VAR_DECLS saved from a previous for statement.
442 These would be dead in ANSI-conforming code, but might
443 be referenced in ARM-era code. These are stored in a
444 TREE_LIST; the TREE_VALUE is the actual declaration. */
445 tree dead_vars_from_for
;
447 /* 1 for the level that holds the parameters of a function.
448 2 for the level that holds a class declaration.
449 3 for levels that hold parameter declarations. */
450 unsigned parm_flag
: 4;
452 /* 1 means make a BLOCK for this level regardless of all else.
453 2 for temporary binding contours created by the compiler. */
456 /* Nonzero if this level "doesn't exist" for tags. */
457 unsigned tag_transparent
: 1;
459 /* Nonzero if this level can safely have additional
460 cleanup-needing variables added to it. */
461 unsigned more_cleanups_ok
: 1;
462 unsigned have_cleanups
: 1;
464 /* Nonzero if this level is for storing the decls for template
465 parameters and generic decls; these decls will be discarded and
466 replaced with a TEMPLATE_DECL. */
467 unsigned pseudo_global
: 1;
469 /* This is set for a namespace binding level. */
470 unsigned namespace_p
: 1;
472 /* True if this level is that of a for-statement where we need to
473 worry about ambiguous (ARM or ANSI) scope rules. */
474 unsigned is_for_scope
: 1;
476 /* True if this level corresponds to an EH region, as for a try block. */
477 unsigned eh_region
: 1;
479 /* One bit left for this word. */
481 #if defined(DEBUG_CP_BINDING_LEVELS)
482 /* Binding depth at which this level began. */
483 unsigned binding_depth
;
484 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
487 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
489 /* The binding level currently in effect. */
491 #define current_binding_level \
493 ? cp_function_chain->bindings \
494 : scope_chain->bindings)
496 /* The binding level of the current class, if any. */
498 #define class_binding_level scope_chain->class_bindings
500 /* A chain of binding_level structures awaiting reuse. */
502 static struct binding_level
*free_binding_level
;
504 /* The outermost binding level, for names of file scope.
505 This is created when the compiler is started and exists
506 through the entire run. */
508 static struct binding_level
*global_binding_level
;
510 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
512 static int keep_next_level_flag
;
514 #if defined(DEBUG_CP_BINDING_LEVELS)
515 static int binding_depth
= 0;
516 static int is_class_level
= 0;
523 for (i
= 0; i
< binding_depth
*2; i
++)
526 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
528 static tree pushdecl_with_scope
PROTO((tree
, struct binding_level
*));
531 push_binding_level (newlevel
, tag_transparent
, keep
)
532 struct binding_level
*newlevel
;
533 int tag_transparent
, keep
;
535 /* Add this level to the front of the chain (stack) of levels that
537 bzero ((char*) newlevel
, sizeof (struct binding_level
));
538 newlevel
->level_chain
= current_binding_level
;
539 current_binding_level
= newlevel
;
540 newlevel
->tag_transparent
= tag_transparent
;
541 newlevel
->more_cleanups_ok
= 1;
543 /* We are called before expand_start_bindings, but after
544 expand_eh_region_start for a try block; so we check this now,
545 before the EH block is covered up. */
546 newlevel
->eh_region
= is_eh_region ();
548 newlevel
->keep
= keep
;
549 #if defined(DEBUG_CP_BINDING_LEVELS)
550 newlevel
->binding_depth
= binding_depth
;
552 fprintf (stderr
, "push %s level 0x%08x line %d\n",
553 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
556 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
559 /* Find the innermost enclosing class scope, and reset
560 CLASS_BINDING_LEVEL appropriately. */
563 find_class_binding_level ()
565 struct binding_level
*level
= current_binding_level
;
567 while (level
&& level
->parm_flag
!= 2)
568 level
= level
->level_chain
;
569 if (level
&& level
->parm_flag
== 2)
570 class_binding_level
= level
;
572 class_binding_level
= 0;
578 if (global_binding_level
)
580 /* Cannot pop a level, if there are none left to pop. */
581 if (current_binding_level
== global_binding_level
)
582 my_friendly_abort (123);
584 /* Pop the current level, and free the structure for reuse. */
585 #if defined(DEBUG_CP_BINDING_LEVELS)
588 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
589 (is_class_level
) ? "class" : "block",
590 current_binding_level
, lineno
);
591 if (is_class_level
!= (current_binding_level
== class_binding_level
))
594 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
597 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
599 register struct binding_level
*level
= current_binding_level
;
600 current_binding_level
= current_binding_level
->level_chain
;
601 level
->level_chain
= free_binding_level
;
602 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
603 if (level
->binding_depth
!= binding_depth
)
605 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
606 free_binding_level
= level
;
607 find_class_binding_level ();
612 suspend_binding_level ()
614 if (class_binding_level
)
615 current_binding_level
= class_binding_level
;
617 if (global_binding_level
)
619 /* Cannot suspend a level, if there are none left to suspend. */
620 if (current_binding_level
== global_binding_level
)
621 my_friendly_abort (123);
623 /* Suspend the current level. */
624 #if defined(DEBUG_CP_BINDING_LEVELS)
627 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
628 (is_class_level
) ? "class" : "block",
629 current_binding_level
, lineno
);
630 if (is_class_level
!= (current_binding_level
== class_binding_level
))
633 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
636 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
637 current_binding_level
= current_binding_level
->level_chain
;
638 find_class_binding_level ();
642 resume_binding_level (b
)
643 struct binding_level
*b
;
645 /* Resuming binding levels is meant only for namespaces,
646 and those cannot nest into classes. */
647 my_friendly_assert(!class_binding_level
, 386);
648 /* Also, resuming a non-directly nested namespace is a no-no. */
649 my_friendly_assert(b
->level_chain
== current_binding_level
, 386);
650 current_binding_level
= b
;
651 #if defined(DEBUG_CP_BINDING_LEVELS)
652 b
->binding_depth
= binding_depth
;
654 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
655 (is_class_level
) ? "class" : "block", b
, lineno
);
658 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
661 /* Create a new `struct binding_level'. */
664 struct binding_level
*
665 make_binding_level ()
668 return (struct binding_level
*) xmalloc (sizeof (struct binding_level
));
671 /* Nonzero if we are currently in the global binding level. */
676 return current_binding_level
== global_binding_level
;
679 /* Return the innermost binding level that is not for a class scope. */
681 static struct binding_level
*
682 innermost_nonclass_level ()
684 struct binding_level
*b
;
686 b
= current_binding_level
;
687 while (b
->parm_flag
== 2)
693 /* Nonzero if we are currently in a toplevel binding level. This
694 means either the global binding level or a namespace in a toplevel
695 binding level. Since there are no non-toplevel namespace levels,
696 this really means any namespace or pseudo-global level. We also
697 include a class whose context is toplevel. */
700 toplevel_bindings_p ()
702 struct binding_level
*b
= innermost_nonclass_level ();
704 return b
->namespace_p
|| b
->pseudo_global
;
707 /* Nonzero if this is a namespace scope, or if we are defining a class
708 which is itself at namespace scope, or whose enclosing class is
709 such a class, etc. */
712 namespace_bindings_p ()
714 struct binding_level
*b
= innermost_nonclass_level ();
716 return b
->namespace_p
;
719 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
720 unconditionally. Otherwise, use the normal logic to decide whether
721 or not to create a BLOCK. */
724 keep_next_level (keep
)
727 keep_next_level_flag
= keep
;
730 /* Nonzero if the current level needs to have a BLOCK made. */
735 return (current_binding_level
->blocks
!= NULL_TREE
736 || current_binding_level
->keep
737 || current_binding_level
->names
!= NULL_TREE
738 || (current_binding_level
->tags
!= NULL_TREE
739 && !current_binding_level
->tag_transparent
));
743 declare_pseudo_global_level ()
745 current_binding_level
->pseudo_global
= 1;
749 declare_namespace_level ()
751 current_binding_level
->namespace_p
= 1;
755 pseudo_global_level_p ()
757 return current_binding_level
->pseudo_global
;
761 set_class_shadows (shadows
)
764 class_binding_level
->class_shadowed
= shadows
;
767 /* Enter a new binding level.
768 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
769 not for that of tags. */
772 pushlevel (tag_transparent
)
775 struct binding_level
*newlevel
;
777 if (current_function
&& !doing_semantic_analysis_p ())
780 /* Reuse or create a struct for this binding level. */
781 #if defined(DEBUG_CP_BINDING_LEVELS)
783 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
784 if (free_binding_level
)
785 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
787 newlevel
= free_binding_level
;
788 free_binding_level
= free_binding_level
->level_chain
;
791 newlevel
= make_binding_level ();
793 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
794 GNU_xref_start_scope ((HOST_WIDE_INT
) newlevel
);
795 keep_next_level_flag
= 0;
799 note_level_for_for ()
801 current_binding_level
->is_for_scope
= 1;
804 /* For a binding between a name and an entity at a block scope,
805 this is the `struct binding_level' for the block. */
806 #define BINDING_LEVEL(NODE) \
807 (((struct tree_binding*)NODE)->scope.level)
809 /* Make DECL the innermost binding for ID. The LEVEL is the binding
810 level at which this declaration is being bound. */
813 push_binding (id
, decl
, level
)
816 struct binding_level
* level
;
820 binding
= make_node (CPLUS_BINDING
);
822 /* Now, fill in the binding information. */
823 BINDING_VALUE (binding
) = decl
;
824 BINDING_TYPE (binding
) = NULL_TREE
;
825 BINDING_LEVEL (binding
) = level
;
826 INHERITED_VALUE_BINDING_P (binding
) = 0;
827 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
828 BINDING_HAS_LEVEL_P (binding
) = 1;
830 /* And put it on the front of the list of bindings for ID. */
831 TREE_CHAIN (binding
) = IDENTIFIER_BINDING (id
);
832 IDENTIFIER_BINDING (id
) = binding
;
835 /* ID is already bound in the current scope. But, DECL is an
836 additional binding for ID in the same scope. This is the `struct
837 stat' hack whereby a non-typedef class-name or enum-name can be
838 bound at the same level as some other kind of entity. It's the
839 responsibility of the caller to check that inserting this name is
840 legal here. Returns nonzero if the new binding was successful. */
842 add_binding (id
, decl
)
846 tree binding
= IDENTIFIER_BINDING (id
);
849 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
850 /* The new name is the type name. */
851 BINDING_TYPE (binding
) = decl
;
852 else if (!BINDING_VALUE (binding
))
853 /* This situation arises when push_class_level_binding moves an
854 inherited type-binding out of the way to make room for a new
856 BINDING_VALUE (binding
) = decl
;
857 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
858 && DECL_ARTIFICIAL (BINDING_VALUE (binding
)))
860 /* The old binding was a type name. It was placed in
861 BINDING_VALUE because it was thought, at the point it was
862 declared, to be the only entity with such a name. Move the
863 type name into the type slot; it is now hidden by the new
865 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
866 BINDING_VALUE (binding
) = decl
;
867 INHERITED_VALUE_BINDING_P (binding
) = 0;
869 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
870 && TREE_CODE (decl
) == TYPE_DECL
871 && DECL_NAME (decl
) == DECL_NAME (BINDING_VALUE (binding
))
872 && same_type_p (TREE_TYPE (decl
),
873 TREE_TYPE (BINDING_VALUE (binding
))))
874 /* We have two typedef-names, both naming the same type to have
875 the same name. This is OK because of:
879 In a given scope, a typedef specifier can be used to redefine
880 the name of any type declared in that scope to refer to the
881 type to which it already refers. */
885 cp_error ("declaration of `%#D'", decl
);
886 cp_error_at ("conflicts with previous declaration `%#D'",
887 BINDING_VALUE (binding
));
894 /* Add DECL to the list of things declared in B. */
897 add_decl_to_level (decl
, b
)
899 struct binding_level
*b
;
901 /* We build up the list in reverse order, and reverse it later if
903 TREE_CHAIN (decl
) = b
->names
;
907 /* Bind DECL to ID in the current_binding_level, assumed to be a local
908 binding level. If PUSH_USING is set in FLAGS, we know that DECL
909 doesn't really belong to this binding level, that it got here
910 through a using-declaration. */
913 push_local_binding (id
, decl
, flags
)
918 struct binding_level
*b
;
920 /* Skip over any local classes. This makes sense if we call
921 push_local_binding with a friend decl of a local class. */
922 b
= current_binding_level
;
923 while (b
->parm_flag
== 2)
926 if (lookup_name_current_level (id
))
928 /* Supplement the existing binding. */
929 if (!add_binding (id
, decl
))
930 /* It didn't work. Something else must be bound at this
931 level. Do not add DECL to the list of things to pop
936 /* Create a new binding. */
937 push_binding (id
, decl
, b
);
939 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
940 /* We must put the OVERLOAD into a TREE_LIST since the
941 TREE_CHAIN of an OVERLOAD is already used. Similarly for
942 decls that got here through a using-declaration. */
943 decl
= build_tree_list (NULL_TREE
, decl
);
945 /* And put DECL on the list of things declared by the current
947 add_decl_to_level (decl
, b
);
950 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
951 binding was successful. */
954 push_class_binding (id
, decl
)
959 tree binding
= IDENTIFIER_BINDING (id
);
962 /* Note that we declared this value so that we can issue an error if
963 this an illegal redeclaration of a name already used for some
965 note_name_declared_in_class (id
, decl
);
967 if (binding
&& BINDING_LEVEL (binding
) == class_binding_level
)
968 /* Supplement the existing binding. */
969 result
= add_binding (id
, decl
);
971 /* Create a new binding. */
972 push_binding (id
, decl
, class_binding_level
);
974 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
975 class-level declaration. Note that we do not use DECL here
976 because of the possibility of the `struct stat' hack; if DECL is
977 a class-name or enum-name we might prefer a field-name, or some
979 IDENTIFIER_CLASS_VALUE (id
) = BINDING_VALUE (IDENTIFIER_BINDING (id
));
981 /* If this is a binding from a base class, mark it as such. */
982 binding
= IDENTIFIER_BINDING (id
);
983 if (BINDING_VALUE (binding
) == decl
&& TREE_CODE (decl
) != TREE_LIST
)
985 /* Any implicit typename must be from a base-class. The
986 context for an implicit typename declaration is always
987 the derived class in which the lookup was done, so the checks
988 based on the context of DECL below will not trigger. */
989 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl
))
990 INHERITED_VALUE_BINDING_P (binding
) = 1;
993 if (TREE_CODE (decl
) == OVERLOAD
)
994 context
= DECL_REAL_CONTEXT (OVL_CURRENT (decl
));
997 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd',
999 context
= DECL_REAL_CONTEXT (decl
);
1002 if (is_properly_derived_from (current_class_type
, context
))
1003 INHERITED_VALUE_BINDING_P (binding
) = 1;
1005 INHERITED_VALUE_BINDING_P (binding
) = 0;
1008 else if (BINDING_VALUE (binding
) == decl
)
1009 /* We only encounter a TREE_LIST when push_class_decls detects an
1010 ambiguity. Such an ambiguity can be overridden by a definition
1012 INHERITED_VALUE_BINDING_P (binding
) = 1;
1017 /* Remove the binding for DECL which should be the innermost binding
1021 pop_binding (id
, decl
)
1027 if (id
== NULL_TREE
)
1028 /* It's easiest to write the loops that call this function without
1029 checking whether or not the entities involved have names. We
1030 get here for such an entity. */
1033 /* Get the innermost binding for ID. */
1034 binding
= IDENTIFIER_BINDING (id
);
1036 /* The name should be bound. */
1037 my_friendly_assert (binding
!= NULL_TREE
, 0);
1039 /* The DECL will be either the ordinary binding or the type
1040 binding for this identifier. Remove that binding. */
1041 if (BINDING_VALUE (binding
) == decl
)
1042 BINDING_VALUE (binding
) = NULL_TREE
;
1043 else if (BINDING_TYPE (binding
) == decl
)
1044 BINDING_TYPE (binding
) = NULL_TREE
;
1046 my_friendly_abort (0);
1048 if (!BINDING_VALUE (binding
) && !BINDING_TYPE (binding
))
1049 /* We're completely done with the innermost binding for this
1050 identifier. Unhook it from the list of bindings. */
1051 IDENTIFIER_BINDING (id
) = TREE_CHAIN (binding
);
1054 /* When a label goes out of scope, check to see if that label was used
1055 in a valid manner, and issue any appropriate warnings or errors. */
1061 tree label
= TREE_VALUE (link
);
1063 if (!processing_template_decl
&& doing_semantic_analysis_p ())
1065 if (DECL_INITIAL (label
) == NULL_TREE
)
1067 cp_error_at ("label `%D' used but not defined", label
);
1068 /* Avoid crashing later. */
1069 define_label (input_filename
, 1, DECL_NAME (label
));
1071 else if (warn_unused
&& !TREE_USED (label
))
1072 cp_warning_at ("label `%D' defined but not used", label
);
1075 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), TREE_PURPOSE (link
));
1078 /* At the end of a function, all labels declared within the fucntion
1079 go out of scope. BLOCK is the top-level block for the
1088 /* Clear out the definitions of all label names, since their scopes
1090 for (link
= named_labels
; link
; link
= TREE_CHAIN (link
))
1093 /* Put the labels into the "variables" of the top-level block,
1094 so debugger can see them. */
1095 TREE_CHAIN (TREE_VALUE (link
)) = BLOCK_VARS (block
);
1096 BLOCK_VARS (block
) = TREE_VALUE (link
);
1099 named_labels
= NULL_TREE
;
1102 /* Exit a binding level.
1103 Pop the level off, and restore the state of the identifier-decl mappings
1104 that were in effect when this level was entered.
1106 If KEEP == 1, this level had explicit declarations, so
1107 and create a "block" (a BLOCK node) for the level
1108 to record its declarations and subblocks for symbol table output.
1110 If FUNCTIONBODY is nonzero, this level is the body of a function,
1111 so create a block as if KEEP were set and also clear out all
1114 If REVERSE is nonzero, reverse the order of decls before putting
1115 them into the BLOCK. */
1118 poplevel (keep
, reverse
, functionbody
)
1124 /* The chain of decls was accumulated in reverse order.
1125 Put it into forward order, just for cleanliness. */
1127 int tmp
= functionbody
;
1128 int real_functionbody
;
1131 tree block
= NULL_TREE
;
1133 int block_previously_created
;
1134 int leaving_for_scope
;
1136 if (current_function
&& !doing_semantic_analysis_p ())
1139 my_friendly_assert (current_binding_level
->parm_flag
!= 2,
1142 real_functionbody
= (current_binding_level
->keep
== 2
1143 ? ((functionbody
= 0), tmp
) : functionbody
);
1144 tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1145 subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1147 my_friendly_assert (!current_binding_level
->class_shadowed
,
1150 /* We used to use KEEP == 2 to indicate that the new block should go
1151 at the beginning of the list of blocks at this binding level,
1152 rather than the end. This hack is no longer used. */
1153 my_friendly_assert (keep
== 0 || keep
== 1, 0);
1155 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1156 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1157 current_binding_level
->parm_flag
,
1158 current_binding_level
->keep
);
1160 if (current_binding_level
->keep
== 1)
1163 /* Get the decls in the order they were written.
1164 Usually current_binding_level->names is in reverse order.
1165 But parameter decls were previously put in forward order. */
1168 current_binding_level
->names
1169 = decls
= nreverse (current_binding_level
->names
);
1171 decls
= current_binding_level
->names
;
1173 /* Output any nested inline functions within this block
1174 if they weren't already output. */
1176 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1177 if (TREE_CODE (decl
) == FUNCTION_DECL
1178 && ! TREE_ASM_WRITTEN (decl
)
1179 && DECL_INITIAL (decl
) != NULL_TREE
1180 && TREE_ADDRESSABLE (decl
)
1181 && decl_function_context (decl
) == current_function_decl
)
1183 /* If this decl was copied from a file-scope decl
1184 on account of a block-scope extern decl,
1185 propagate TREE_ADDRESSABLE to the file-scope decl. */
1186 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1187 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1190 push_function_context ();
1191 output_inline_function (decl
);
1192 pop_function_context ();
1196 /* If there were any declarations or structure tags in that level,
1197 or if this level is a function body,
1198 create a BLOCK to record them for the life of this function. */
1201 block_previously_created
= (current_binding_level
->this_block
!= NULL_TREE
);
1202 if (block_previously_created
)
1203 block
= current_binding_level
->this_block
;
1204 else if (keep
== 1 || functionbody
)
1205 block
= make_node (BLOCK
);
1206 if (block
!= NULL_TREE
)
1208 if (block_previously_created
)
1210 if (decls
|| tags
|| subblocks
)
1212 if (BLOCK_VARS (block
))
1213 warning ("internal compiler error: debugging info corrupted");
1215 BLOCK_VARS (block
) = decls
;
1217 /* We can have previous subblocks and new subblocks when
1218 doing fixup_gotos with complex cleanups. We chain the new
1219 subblocks onto the end of any pre-existing subblocks. */
1220 BLOCK_SUBBLOCKS (block
) = chainon (BLOCK_SUBBLOCKS (block
),
1226 BLOCK_VARS (block
) = decls
;
1227 BLOCK_SUBBLOCKS (block
) = subblocks
;
1231 /* In each subblock, record that this is its superior. */
1234 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1235 BLOCK_SUPERCONTEXT (link
) = block
;
1237 /* We still support the old for-scope rules, whereby the variables
1238 in a for-init statement were in scope after the for-statement
1239 ended. We only use the new rules in flag_new_for_scope is
1242 = current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1;
1244 /* Remove declarations for all the DECLs in this level. */
1245 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1247 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
)
1250 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link
)));
1254 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
1256 ns_binding
= NULL_TREE
;
1259 && (BINDING_LEVEL (outer_binding
)
1260 == current_binding_level
->level_chain
))
1261 /* We have something like:
1266 and we are leaving the `for' scope. There's no reason to
1267 keep the binding of the inner `i' in this case. */
1268 pop_binding (DECL_NAME (link
), link
);
1269 else if ((outer_binding
1270 && (TREE_CODE (BINDING_VALUE (outer_binding
))
1273 && TREE_CODE (ns_binding
) == TYPE_DECL
))
1274 /* Here, we have something like:
1282 We must pop the for-scope binding so we know what's a
1283 type and what isn't. */
1284 pop_binding (DECL_NAME (link
), link
);
1287 /* Mark this VAR_DECL as dead so that we can tell we left it
1288 there only for backward compatibility. */
1289 DECL_DEAD_FOR_LOCAL (link
) = 1;
1291 /* Keep track of what should of have happenned when we
1292 popped the binding. */
1293 if (outer_binding
&& BINDING_VALUE (outer_binding
))
1294 DECL_SHADOWED_FOR_VAR (link
)
1295 = BINDING_VALUE (outer_binding
);
1297 /* Add it to the list of dead variables in the next
1298 outermost binding to that we can remove these when we
1299 leave that binding. */
1300 current_binding_level
->level_chain
->dead_vars_from_for
1301 = tree_cons (NULL_TREE
, link
,
1302 current_binding_level
->level_chain
->
1303 dead_vars_from_for
);
1305 /* Although we don't pop the CPLUS_BINDING, we do clear
1306 its BINDING_LEVEL since the level is going away now. */
1307 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link
)))
1313 /* Remove the binding. */
1315 if (TREE_CODE (decl
) == TREE_LIST
)
1316 decl
= TREE_VALUE (decl
);
1317 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd')
1318 pop_binding (DECL_NAME (decl
), decl
);
1319 else if (TREE_CODE (decl
) == OVERLOAD
)
1320 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
1322 my_friendly_abort (0);
1326 /* Remove declarations for any `for' variables from inner scopes
1327 that we kept around. */
1328 for (link
= current_binding_level
->dead_vars_from_for
;
1329 link
; link
= TREE_CHAIN (link
))
1330 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
1332 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1333 for (link
= current_binding_level
->type_shadowed
;
1334 link
; link
= TREE_CHAIN (link
))
1335 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1337 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1338 for (link
= current_binding_level
->shadowed_labels
;
1340 link
= TREE_CHAIN (link
))
1343 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1344 list if a `using' declaration put them there. The debugging
1345 back-ends won't understand OVERLOAD, so we remove them here.
1346 Because the BLOCK_VARS are (temporarily) shared with
1347 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1348 popped all the bindings. */
1353 for (d
= &BLOCK_VARS (block
); *d
; )
1355 if (TREE_CODE (*d
) == TREE_LIST
)
1356 *d
= TREE_CHAIN (*d
);
1358 d
= &TREE_CHAIN (*d
);
1362 /* If the level being exited is the top level of a function,
1363 check over all the labels. */
1366 /* Since this is the top level block of a function, the vars are
1367 the function's parameters. Don't leave them in the BLOCK
1368 because they are found in the FUNCTION_DECL instead. */
1369 BLOCK_VARS (block
) = 0;
1373 /* Any uses of undefined labels now operate under constraints
1374 of next binding contour. */
1375 if (current_function
)
1377 struct binding_level
*level_chain
;
1378 level_chain
= current_binding_level
->level_chain
;
1381 struct named_label_list
*labels
;
1382 for (labels
= named_label_uses
; labels
; labels
= labels
->next
)
1383 if (labels
->binding_level
== current_binding_level
)
1385 labels
->binding_level
= level_chain
;
1386 labels
->names_in_scope
= level_chain
->names
;
1391 tmp
= current_binding_level
->keep
;
1393 pop_binding_level ();
1395 DECL_INITIAL (current_function_decl
) = block
;
1398 if (!block_previously_created
)
1399 current_binding_level
->blocks
1400 = chainon (current_binding_level
->blocks
, block
);
1402 /* If we did not make a block for the level just exited,
1403 any blocks made for inner levels
1404 (since they cannot be recorded as subblocks in that level)
1405 must be carried forward so they will later become subblocks
1406 of something else. */
1408 current_binding_level
->blocks
1409 = chainon (current_binding_level
->blocks
, subblocks
);
1411 /* Take care of compiler's internal binding structures. */
1414 add_scope_stmt (/*begin_p=*/0, /*partial_p=*/1);
1415 /* Each and every BLOCK node created here in `poplevel' is important
1416 (e.g. for proper debugging information) so if we created one
1417 earlier, mark it as "used". */
1419 TREE_USED (block
) = 1;
1420 block
= poplevel (keep
, reverse
, functionbody
);
1423 /* Each and every BLOCK node created here in `poplevel' is important
1424 (e.g. for proper debugging information) so if we created one
1425 earlier, mark it as "used". */
1427 TREE_USED (block
) = 1;
1431 /* Delete the node BLOCK from the current binding level.
1432 This is used for the block inside a stmt expr ({...})
1433 so that the block can be reinserted where appropriate. */
1436 delete_block (block
)
1440 if (current_binding_level
->blocks
== block
)
1441 current_binding_level
->blocks
= TREE_CHAIN (block
);
1442 for (t
= current_binding_level
->blocks
; t
;)
1444 if (TREE_CHAIN (t
) == block
)
1445 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1449 TREE_CHAIN (block
) = NULL_TREE
;
1450 /* Clear TREE_USED which is always set by poplevel.
1451 The flag is set again if insert_block is called. */
1452 TREE_USED (block
) = 0;
1455 /* Insert BLOCK at the end of the list of subblocks of the
1456 current binding level. This is used when a BIND_EXPR is expanded,
1457 to handle the BLOCK node inside the BIND_EXPR. */
1460 insert_block (block
)
1463 TREE_USED (block
) = 1;
1464 current_binding_level
->blocks
1465 = chainon (current_binding_level
->blocks
, block
);
1468 /* Set the BLOCK node for the innermost scope
1469 (the one we are currently in). */
1473 register tree block
;
1475 current_binding_level
->this_block
= block
;
1478 /* Do a pushlevel for class declarations. */
1483 register struct binding_level
*newlevel
;
1485 /* Reuse or create a struct for this binding level. */
1486 #if defined(DEBUG_CP_BINDING_LEVELS)
1488 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1489 if (free_binding_level
)
1490 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1492 newlevel
= free_binding_level
;
1493 free_binding_level
= free_binding_level
->level_chain
;
1496 newlevel
= make_binding_level ();
1498 #if defined(DEBUG_CP_BINDING_LEVELS)
1500 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1502 push_binding_level (newlevel
, 0, 0);
1504 class_binding_level
= current_binding_level
;
1505 class_binding_level
->parm_flag
= 2;
1508 /* ...and a poplevel for class declarations. */
1513 register struct binding_level
*level
= class_binding_level
;
1516 my_friendly_assert (level
!= 0, 354);
1518 /* If we're leaving a toplevel class, don't bother to do the setting
1519 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1520 shouldn't even be used when current_class_type isn't set, and second,
1521 if we don't touch it here, we're able to use the cache effect if the
1522 next time we're entering a class scope, it is the same class. */
1523 if (current_class_depth
!= 1)
1525 struct binding_level
* b
;
1527 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1528 for (shadowed
= level
->class_shadowed
;
1530 shadowed
= TREE_CHAIN (shadowed
))
1531 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = NULL_TREE
;
1533 /* Find the next enclosing class, and recreate
1534 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1535 b
= level
->level_chain
;
1536 while (b
&& b
->parm_flag
!= 2)
1540 for (shadowed
= b
->class_shadowed
;
1542 shadowed
= TREE_CHAIN (shadowed
))
1546 t
= IDENTIFIER_BINDING (TREE_PURPOSE (shadowed
));
1547 while (t
&& BINDING_LEVEL (t
) != b
)
1551 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
))
1552 = BINDING_VALUE (t
);
1556 /* Remember to save what IDENTIFIER's were bound in this scope so we
1557 can recover from cache misses. */
1559 previous_class_type
= current_class_type
;
1560 previous_class_values
= class_binding_level
->class_shadowed
;
1562 for (shadowed
= level
->type_shadowed
;
1564 shadowed
= TREE_CHAIN (shadowed
))
1565 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1567 /* Remove the bindings for all of the class-level declarations. */
1568 for (shadowed
= level
->class_shadowed
;
1570 shadowed
= TREE_CHAIN (shadowed
))
1571 pop_binding (TREE_PURPOSE (shadowed
), TREE_TYPE (shadowed
));
1573 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1574 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1575 class_binding_level
->parm_flag
,
1576 class_binding_level
->keep
);
1578 /* Now, pop out of the binding level which we created up in the
1579 `pushlevel_class' routine. */
1580 #if defined(DEBUG_CP_BINDING_LEVELS)
1582 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1584 pop_binding_level ();
1587 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1588 for any names in enclosing classes. */
1591 clear_identifier_class_values ()
1595 if (!class_binding_level
)
1598 for (t
= class_binding_level
->class_shadowed
;
1601 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
1604 /* Returns non-zero if T is a virtual function table. */
1607 vtable_decl_p (t
, data
)
1609 void *data ATTRIBUTE_UNUSED
;
1611 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
1614 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1618 vtype_decl_p (t
, data
)
1620 void *data ATTRIBUTE_UNUSED
;
1622 return (TREE_CODE (t
) == TYPE_DECL
1623 && TREE_TYPE (t
) != error_mark_node
1624 && TYPE_LANG_SPECIFIC (TREE_TYPE (t
))
1625 && CLASSTYPE_VSIZE (TREE_TYPE (t
)));
1628 /* Return the declarations that are members of the namespace NS. */
1631 cp_namespace_decls (ns
)
1634 return NAMESPACE_LEVEL (ns
)->names
;
1637 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1638 itself, calling F for each. The DATA is passed to F as well. */
1641 walk_namespaces_r (namespace, f
, data
)
1643 walk_namespaces_fn f
;
1649 result
|= (*f
) (namespace, data
);
1651 for (current
= cp_namespace_decls (namespace);
1653 current
= TREE_CHAIN (current
))
1655 if (TREE_CODE (current
) != NAMESPACE_DECL
1656 || DECL_NAMESPACE_ALIAS (current
))
1658 if (!DECL_LANG_SPECIFIC (current
))
1661 my_friendly_assert (current
== std_node
, 393);
1665 /* We found a namespace. */
1666 result
|= walk_namespaces_r (current
, f
, data
);
1672 /* Walk all the namespaces, calling F for each. The DATA is passed to
1676 walk_namespaces (f
, data
)
1677 walk_namespaces_fn f
;
1680 return walk_namespaces_r (global_namespace
, f
, data
);
1683 struct walk_globals_data
{
1684 walk_globals_pred p
;
1689 /* Walk the global declarations in NAMESPACE. Whenever one is found
1690 for which P returns non-zero, call F with its address. If any call
1691 to F returns a non-zero value, return a non-zero value. */
1694 walk_globals_r (namespace, data
)
1698 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1699 walk_globals_pred p
= wgd
->p
;
1700 walk_globals_fn f
= wgd
->f
;
1701 void *d
= wgd
->data
;
1705 t
= &NAMESPACE_LEVEL (namespace)->names
;
1712 result
|= (*f
) (t
, d
);
1714 /* If F changed *T, then *T still points at the next item to
1717 t
= &TREE_CHAIN (*t
);
1723 /* Walk the global declarations. Whenever one is found for which P
1724 returns non-zero, call F with its address. If any call to F
1725 returns a non-zero value, return a non-zero value. */
1728 walk_globals (p
, f
, data
)
1729 walk_globals_pred p
;
1733 struct walk_globals_data wgd
;
1738 return walk_namespaces (walk_globals_r
, &wgd
);
1741 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1742 DATA is non-NULL, this is the last time we will call
1743 wrapup_global_declarations for this NAMESPACE. */
1746 wrapup_globals_for_namespace (namespace, data
)
1750 tree globals
= cp_namespace_decls (namespace);
1751 int len
= list_length (globals
);
1752 tree
*vec
= (tree
*) alloca (sizeof (tree
) * len
);
1756 int last_time
= (data
!= 0);
1758 if (last_time
&& namespace == global_namespace
)
1759 /* Let compile_file handle the global namespace. */
1762 /* Process the decls in reverse order--earliest first.
1763 Put them into VEC from back to front, then take out from front. */
1765 for (i
= 0, decl
= globals
; i
< len
; i
++, decl
= TREE_CHAIN (decl
))
1766 vec
[len
- i
- 1] = decl
;
1770 check_global_declarations (vec
, len
);
1774 /* Temporarily mark vtables as external. That prevents
1775 wrapup_global_declarations from writing them out; we must process
1776 them ourselves in finish_vtable_vardecl. */
1777 for (i
= 0; i
< len
; ++i
)
1778 if (vtable_decl_p (vec
[i
], /*data=*/0) && !DECL_EXTERNAL (vec
[i
]))
1780 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 1;
1781 DECL_EXTERNAL (vec
[i
]) = 1;
1784 /* Write out any globals that need to be output. */
1785 result
= wrapup_global_declarations (vec
, len
);
1787 /* Undo the hack to DECL_EXTERNAL above. */
1788 for (i
= 0; i
< len
; ++i
)
1789 if (vtable_decl_p (vec
[i
], /*data=*/0)
1790 && DECL_NOT_REALLY_EXTERN (vec
[i
]))
1792 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 0;
1793 DECL_EXTERNAL (vec
[i
]) = 0;
1800 /* Mark ARG (which is really a struct binding_level **) for GC. */
1803 mark_binding_level (arg
)
1806 struct binding_level
*lvl
= *(struct binding_level
**)arg
;
1810 ggc_mark_tree (lvl
->names
);
1811 ggc_mark_tree (lvl
->tags
);
1812 ggc_mark_tree (lvl
->usings
);
1813 ggc_mark_tree (lvl
->using_directives
);
1814 ggc_mark_tree (lvl
->class_shadowed
);
1815 ggc_mark_tree (lvl
->type_shadowed
);
1816 ggc_mark_tree (lvl
->shadowed_labels
);
1817 ggc_mark_tree (lvl
->blocks
);
1818 ggc_mark_tree (lvl
->this_block
);
1819 ggc_mark_tree (lvl
->incomplete
);
1820 ggc_mark_tree (lvl
->dead_vars_from_for
);
1822 lvl
= lvl
->level_chain
;
1826 /* For debugging. */
1827 static int no_print_functions
= 0;
1828 static int no_print_builtins
= 0;
1831 print_binding_level (lvl
)
1832 struct binding_level
*lvl
;
1836 fprintf (stderr
, " blocks=");
1837 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
1838 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
1839 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
1840 if (lvl
->tag_transparent
)
1841 fprintf (stderr
, " tag-transparent");
1842 if (lvl
->more_cleanups_ok
)
1843 fprintf (stderr
, " more-cleanups-ok");
1844 if (lvl
->have_cleanups
)
1845 fprintf (stderr
, " have-cleanups");
1846 fprintf (stderr
, "\n");
1849 fprintf (stderr
, " names:\t");
1850 /* We can probably fit 3 names to a line? */
1851 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
1853 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
1855 if (no_print_builtins
1856 && (TREE_CODE (t
) == TYPE_DECL
)
1857 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
1860 /* Function decls tend to have longer names. */
1861 if (TREE_CODE (t
) == FUNCTION_DECL
)
1868 fprintf (stderr
, "\n\t");
1871 print_node_brief (stderr
, "", t
, 0);
1872 if (t
== error_mark_node
)
1876 fprintf (stderr
, "\n");
1880 fprintf (stderr
, " tags:\t");
1882 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
1884 if (TREE_PURPOSE (t
) == NULL_TREE
)
1886 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
1893 fprintf (stderr
, "\n\t");
1896 if (TREE_PURPOSE (t
) == NULL_TREE
)
1898 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
1899 fprintf (stderr
, ">");
1901 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
1902 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
1905 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
1906 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
1907 fprintf (stderr
, ">");
1911 fprintf (stderr
, "\n");
1913 if (lvl
->class_shadowed
)
1915 fprintf (stderr
, " class-shadowed:");
1916 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
1918 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1920 fprintf (stderr
, "\n");
1922 if (lvl
->type_shadowed
)
1924 fprintf (stderr
, " type-shadowed:");
1925 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
1927 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1929 fprintf (stderr
, "\n");
1934 print_other_binding_stack (stack
)
1935 struct binding_level
*stack
;
1937 struct binding_level
*level
;
1938 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
1940 fprintf (stderr
, "binding level ");
1941 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
1942 fprintf (stderr
, "\n");
1943 print_binding_level (level
);
1948 print_binding_stack ()
1950 struct binding_level
*b
;
1951 fprintf (stderr
, "current_binding_level=");
1952 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
1953 fprintf (stderr
, "\nclass_binding_level=");
1954 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
1955 fprintf (stderr
, "\nglobal_binding_level=");
1956 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
1957 fprintf (stderr
, "\n");
1958 if (class_binding_level
)
1960 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
1961 if (b
== current_binding_level
)
1964 b
= class_binding_level
;
1966 b
= current_binding_level
;
1969 b
= current_binding_level
;
1970 print_other_binding_stack (b
);
1971 fprintf (stderr
, "global:\n");
1972 print_binding_level (global_binding_level
);
1975 /* Namespace binding access routines: The namespace_bindings field of
1976 the identifier is polymorphic, with three possible values:
1977 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
1978 indicating the BINDING_VALUE of global_namespace. */
1980 /* Check whether the a binding for the name to scope is known.
1981 Assumes that the bindings of the name are already a list
1982 of bindings. Returns the binding found, or NULL_TREE. */
1985 find_binding (name
, scope
)
1989 tree iter
, prev
= NULL_TREE
;
1991 scope
= ORIGINAL_NAMESPACE (scope
);
1993 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
1994 iter
= TREE_CHAIN (iter
))
1996 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
1997 if (BINDING_SCOPE (iter
) == scope
)
1999 /* Move binding found to the front of the list, so
2000 subsequent lookups will find it faster. */
2003 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
2004 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
2005 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
2014 /* Always returns a binding for name in scope. If the
2015 namespace_bindings is not a list, convert it to one first.
2016 If no binding is found, make a new one. */
2019 binding_for_name (name
, scope
)
2023 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2026 scope
= ORIGINAL_NAMESPACE (scope
);
2028 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
2030 /* Get rid of optimization for global scope. */
2031 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
2032 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
2033 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2035 if (b
&& (result
= find_binding (name
, scope
)))
2037 /* Not found, make a new one. */
2038 result
= make_node (CPLUS_BINDING
);
2039 TREE_CHAIN (result
) = b
;
2040 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2041 BINDING_SCOPE (result
) = scope
;
2042 BINDING_TYPE (result
) = NULL_TREE
;
2043 BINDING_VALUE (result
) = NULL_TREE
;
2047 /* Return the binding value for name in scope, considering that
2048 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2051 namespace_binding (name
, scope
)
2055 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2058 if (scope
== NULL_TREE
)
2059 scope
= global_namespace
;
2060 if (TREE_CODE (b
) != CPLUS_BINDING
)
2061 return (scope
== global_namespace
) ? b
: NULL_TREE
;
2062 name
= find_binding (name
,scope
);
2063 if (name
== NULL_TREE
)
2065 return BINDING_VALUE (name
);
2068 /* Set the binding value for name in scope. If modifying the binding
2069 of global_namespace is attempted, try to optimize it. */
2072 set_namespace_binding (name
, scope
, val
)
2079 if (scope
== NULL_TREE
)
2080 scope
= global_namespace
;
2082 if (scope
== global_namespace
)
2084 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2085 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
2087 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
2091 b
= binding_for_name (name
, scope
);
2092 BINDING_VALUE (b
) = val
;
2095 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2096 select a name that is unique to this compilation unit. */
2099 push_namespace (name
)
2104 int implicit_use
= 0;
2106 if (!global_namespace
)
2108 /* This must be ::. */
2109 my_friendly_assert (name
== get_identifier ("::"), 377);
2114 /* The name of anonymous namespace is unique for the translation
2116 if (!anonymous_namespace_name
)
2117 anonymous_namespace_name
= get_file_function_name ('N');
2118 name
= anonymous_namespace_name
;
2119 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2121 /* Reopening anonymous namespace. */
2125 else if (current_namespace
== global_namespace
2126 && name
== DECL_NAME (std_node
))
2133 /* Check whether this is an extended namespace definition. */
2134 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2135 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
2138 if (DECL_NAMESPACE_ALIAS (d
))
2140 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2141 d
, DECL_NAMESPACE_ALIAS (d
));
2142 d
= DECL_NAMESPACE_ALIAS (d
);
2149 /* Make a new namespace, binding the name to it. */
2150 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
2151 /* The global namespace is not pushed, and the global binding
2152 level is set elsewhere. */
2157 declare_namespace_level ();
2158 NAMESPACE_LEVEL (d
) = current_binding_level
;
2162 resume_binding_level (NAMESPACE_LEVEL (d
));
2165 do_using_directive (d
);
2166 /* Enter the name space. */
2167 current_namespace
= d
;
2170 /* Pop from the scope of the current namespace. */
2175 if (current_namespace
== global_namespace
)
2177 my_friendly_assert (in_std
>0, 980421);
2181 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
2182 /* The binding level is not popped, as it might be re-opened later. */
2183 suspend_binding_level ();
2186 /* Push into the scope of the namespace NS, even if it is deeply
2187 nested within another namespace. */
2190 push_nested_namespace (ns
)
2193 if (ns
== global_namespace
)
2194 push_to_top_level ();
2197 push_nested_namespace (CP_DECL_CONTEXT (ns
));
2198 push_namespace (DECL_NAME (ns
));
2202 /* Pop back from the scope of the namespace NS, which was previously
2203 entered with push_nested_namespace. */
2206 pop_nested_namespace (ns
)
2209 while (ns
!= global_namespace
)
2212 ns
= CP_DECL_CONTEXT (ns
);
2215 pop_from_top_level ();
2219 /* Subroutines for reverting temporarily to top-level for instantiation
2220 of templates and such. We actually need to clear out the class- and
2221 local-value slots of all identifiers, so that only the global values
2222 are at all visible. Simply setting current_binding_level to the global
2223 scope isn't enough, because more binding levels may be pushed. */
2224 struct saved_scope
*scope_chain
;
2226 /* Mark ST for GC. */
2230 struct stmt_tree
*st
;
2232 ggc_mark_tree (st
->x_last_stmt
);
2233 ggc_mark_tree (st
->x_last_expr_type
);
2236 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2239 mark_saved_scope (arg
)
2242 struct saved_scope
*t
= *(struct saved_scope
**)arg
;
2245 mark_binding_level (&t
->class_bindings
);
2246 ggc_mark_tree (t
->old_bindings
);
2247 ggc_mark_tree (t
->old_namespace
);
2248 ggc_mark_tree (t
->class_name
);
2249 ggc_mark_tree (t
->class_type
);
2250 ggc_mark_tree (t
->access_specifier
);
2251 ggc_mark_tree (t
->function_decl
);
2253 ggc_mark_tree_varray (t
->lang_base
);
2254 ggc_mark_tree (t
->lang_name
);
2255 ggc_mark_tree (t
->x_function_parms
);
2256 ggc_mark_tree (t
->template_parms
);
2257 ggc_mark_tree (t
->x_previous_class_type
);
2258 ggc_mark_tree (t
->x_previous_class_values
);
2259 ggc_mark_tree (t
->x_saved_tree
);
2261 mark_stmt_tree (&t
->x_stmt_tree
);
2262 mark_binding_level (&t
->bindings
);
2268 store_bindings (names
, old_bindings
)
2269 tree names
, old_bindings
;
2272 for (t
= names
; t
; t
= TREE_CHAIN (t
))
2274 tree binding
, t1
, id
;
2276 if (TREE_CODE (t
) == TREE_LIST
)
2277 id
= TREE_PURPOSE (t
);
2282 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2283 we have no IDENTIFIER_BINDING if we have left the class
2284 scope, but cached the class-level declarations. */
2285 || !(IDENTIFIER_BINDING (id
) || IDENTIFIER_CLASS_VALUE (id
)))
2288 for (t1
= old_bindings
; t1
; t1
= TREE_CHAIN (t1
))
2289 if (TREE_VEC_ELT (t1
, 0) == id
)
2292 binding
= make_tree_vec (4);
2296 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
2297 TREE_VEC_ELT (binding
, 0) = id
;
2298 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
2299 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_BINDING (id
);
2300 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
2301 IDENTIFIER_BINDING (id
) = NULL_TREE
;
2302 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
2304 TREE_CHAIN (binding
) = old_bindings
;
2305 old_bindings
= binding
;
2309 return old_bindings
;
2313 maybe_push_to_top_level (pseudo
)
2316 struct saved_scope
*s
;
2317 struct binding_level
*b
;
2321 s
= (struct saved_scope
*) xcalloc (1, sizeof (struct saved_scope
));
2323 b
= scope_chain
? current_binding_level
: 0;
2325 /* If we're in the middle of some function, save our state. */
2326 if (current_function
)
2329 push_function_context_to (NULL_TREE
);
2334 old_bindings
= NULL_TREE
;
2335 if (scope_chain
&& previous_class_type
)
2336 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
2338 /* Have to include global_binding_level, because class-level decls
2339 aren't listed anywhere useful. */
2340 for (; b
; b
= b
->level_chain
)
2344 /* Template IDs are inserted into the global level. If they were
2345 inserted into namespace level, finish_file wouldn't find them
2346 when doing pending instantiations. Therefore, don't stop at
2347 namespace level, but continue until :: . */
2348 if (b
== global_binding_level
|| (pseudo
&& b
->pseudo_global
))
2351 old_bindings
= store_bindings (b
->names
, old_bindings
);
2352 /* We also need to check class_shadowed to save class-level type
2353 bindings, since pushclass doesn't fill in b->names. */
2354 if (b
->parm_flag
== 2)
2355 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2357 /* Unwind type-value slots back to top level. */
2358 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2359 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2361 s
->prev
= scope_chain
;
2362 s
->old_bindings
= old_bindings
;
2364 s
->need_pop_function_context
= need_pop
;
2365 s
->function_decl
= current_function_decl
;
2368 current_function_decl
= NULL_TREE
;
2369 VARRAY_TREE_INIT (current_lang_base
, 10, "current_lang_base");
2370 current_lang_stack
= &VARRAY_TREE (current_lang_base
, 0);
2371 current_lang_name
= lang_name_cplusplus
;
2372 strict_prototype
= strict_prototypes_lang_cplusplus
;
2373 current_namespace
= global_namespace
;
2377 push_to_top_level ()
2379 maybe_push_to_top_level (0);
2383 pop_from_top_level ()
2385 struct saved_scope
*s
= scope_chain
;
2388 /* Clear out class-level bindings cache. */
2389 if (previous_class_type
)
2390 invalidate_class_lookup_cache ();
2392 VARRAY_FREE (current_lang_base
);
2394 scope_chain
= s
->prev
;
2395 for (t
= s
->old_bindings
; t
; t
= TREE_CHAIN (t
))
2397 tree id
= TREE_VEC_ELT (t
, 0);
2400 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2401 IDENTIFIER_BINDING (id
) = TREE_VEC_ELT (t
, 2);
2402 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2406 if (current_lang_name
== lang_name_cplusplus
)
2407 strict_prototype
= strict_prototypes_lang_cplusplus
;
2408 else if (current_lang_name
== lang_name_c
)
2409 strict_prototype
= strict_prototypes_lang_c
;
2411 /* If we were in the middle of compiling a function, restore our
2413 if (s
->need_pop_function_context
)
2414 pop_function_context_from (NULL_TREE
);
2415 current_function_decl
= s
->function_decl
;
2420 /* Push a definition of struct, union or enum tag "name".
2421 into binding_level "b". "type" should be the type node,
2422 We assume that the tag "name" is not already defined.
2424 Note that the definition may really be just a forward reference.
2425 In that case, the TYPE_SIZE will be a NULL_TREE.
2427 C++ gratuitously puts all these tags in the name space. */
2429 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2430 record the shadowed value for this binding contour. TYPE is
2431 the type that ID maps to. */
2434 set_identifier_type_value_with_scope (id
, type
, b
)
2437 struct binding_level
*b
;
2439 if (!b
->namespace_p
)
2441 /* Shadow the marker, not the real thing, so that the marker
2442 gets restored later. */
2443 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2445 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2449 tree binding
= binding_for_name (id
, current_namespace
);
2450 BINDING_TYPE (binding
) = type
;
2451 /* Store marker instead of real type. */
2452 type
= global_type_node
;
2454 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2457 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2460 set_identifier_type_value (id
, type
)
2464 set_identifier_type_value_with_scope (id
, type
, current_binding_level
);
2467 /* Return the type associated with id. */
2470 identifier_type_value (id
)
2473 /* There is no type with that name, anywhere. */
2474 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2476 /* This is not the type marker, but the real thing. */
2477 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2478 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2479 /* Have to search for it. It must be on the global level, now.
2480 Ask lookup_name not to return non-types. */
2481 id
= lookup_name_real (id
, 2, 1, 0);
2483 return TREE_TYPE (id
);
2487 /* Pop off extraneous binding levels left over due to syntax errors.
2489 We don't pop past namespaces, as they might be valid. */
2494 #ifdef DEBUG_CP_BINDING_LEVELS
2495 fprintf (stderr
, "XXX entering pop_everything ()\n");
2497 while (!toplevel_bindings_p ())
2499 if (current_binding_level
->parm_flag
== 2)
2500 pop_nested_class ();
2504 #ifdef DEBUG_CP_BINDING_LEVELS
2505 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2509 /* The type TYPE is being declared. If it is a class template, or a
2510 specialization of a class template, do any processing required and
2511 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2512 being declared a friend. B is the binding level at which this TYPE
2515 Returns the TYPE_DECL for TYPE, which may have been altered by this
2519 maybe_process_template_type_declaration (type
, globalize
, b
)
2522 struct binding_level
* b
;
2524 tree decl
= TYPE_NAME (type
);
2526 if (processing_template_parmlist
)
2527 /* You can't declare a new template type in a template parameter
2528 list. But, you can declare a non-template type:
2530 template <class A*> struct S;
2532 is a forward-declaration of `A'. */
2536 maybe_check_template_type (type
);
2538 my_friendly_assert (IS_AGGR_TYPE (type
)
2539 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2542 if (processing_template_decl
)
2544 /* This may change after the call to
2545 push_template_decl_real, but we want the original value. */
2546 tree name
= DECL_NAME (decl
);
2548 decl
= push_template_decl_real (decl
, globalize
);
2549 /* If the current binding level is the binding level for the
2550 template parameters (see the comment in
2551 begin_template_parm_list) and the enclosing level is a class
2552 scope, and we're not looking at a friend, push the
2553 declaration of the member class into the class scope. In the
2554 friend case, push_template_decl will already have put the
2555 friend into global scope, if appropriate. */
2556 if (TREE_CODE (type
) != ENUMERAL_TYPE
2557 && !globalize
&& b
->pseudo_global
2558 && b
->level_chain
->parm_flag
== 2)
2560 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2561 /* Put this tag on the list of tags for the class, since
2562 that won't happen below because B is not the class
2563 binding level, but is instead the pseudo-global level. */
2564 b
->level_chain
->tags
=
2565 tree_cons (name
, type
, b
->level_chain
->tags
);
2566 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2567 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2575 /* In C++, you don't have to write `struct S' to refer to `S'; you
2576 can just use `S'. We accomplish this by creating a TYPE_DECL as
2577 if the user had written `typedef struct S S'. Create and return
2578 the TYPE_DECL for TYPE. */
2581 create_implicit_typedef (name
, type
)
2587 decl
= build_decl (TYPE_DECL
, name
, type
);
2588 SET_DECL_ARTIFICIAL (decl
);
2589 /* There are other implicit type declarations, like the one *within*
2590 a class that allows you to write `S::S'. We must distinguish
2592 SET_DECL_IMPLICIT_TYPEDEF_P (decl
);
2593 TYPE_NAME (type
) = decl
;
2598 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2599 Normally put it into the inner-most non-tag-transparent scope,
2600 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2601 The latter is needed for implicit declarations. */
2604 pushtag (name
, type
, globalize
)
2608 register struct binding_level
*b
;
2610 b
= current_binding_level
;
2611 while (b
->tag_transparent
2612 || (globalize
&& b
->parm_flag
== 2))
2615 b
->tags
= tree_cons (name
, type
, b
->tags
);
2619 /* Do C++ gratuitous typedefing. */
2620 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2622 register tree d
= NULL_TREE
;
2624 tree context
= TYPE_CONTEXT (type
);
2628 tree cs
= current_scope ();
2632 else if (cs
!= NULL_TREE
2633 && TREE_CODE_CLASS (TREE_CODE (cs
)) == 't')
2634 /* When declaring a friend class of a local class, we want
2635 to inject the newly named class into the scope
2636 containing the local class, not the namespace scope. */
2637 context
= hack_decl_function_context (get_type_decl (cs
));
2640 context
= current_namespace
;
2642 if ((b
->pseudo_global
&& b
->level_chain
->parm_flag
== 2)
2643 || b
->parm_flag
== 2)
2646 if (current_lang_name
== lang_name_java
)
2647 TYPE_FOR_JAVA (type
) = 1;
2649 d
= create_implicit_typedef (name
, type
);
2650 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2652 set_identifier_type_value_with_scope (name
, type
, b
);
2654 d
= maybe_process_template_type_declaration (type
,
2657 if (b
->parm_flag
== 2)
2659 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2660 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2661 class. But if it's a member template class, we
2662 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2664 finish_member_declaration (d
);
2666 pushdecl_class_level (d
);
2669 d
= pushdecl_with_scope (d
, b
);
2671 if (ANON_AGGRNAME_P (name
))
2672 DECL_IGNORED_P (d
) = 1;
2674 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2675 DECL_ASSEMBLER_NAME (d
) = DECL_NAME (d
);
2676 if (!uses_template_parms (type
))
2677 DECL_ASSEMBLER_NAME (d
)
2678 = get_identifier (build_overload_name (type
, 1, 1));
2680 if (b
->parm_flag
== 2)
2682 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2683 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2687 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2688 /* Use the canonical TYPE_DECL for this node. */
2689 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2692 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2693 will be the tagged type we just added to the current
2694 binding level. This fake NULL-named TYPE_DECL node helps
2695 dwarfout.c to know when it needs to output a
2696 representation of a tagged type, and it also gives us a
2697 convenient place to record the "scope start" address for
2700 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2701 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2705 /* Counter used to create anonymous type names. */
2707 static int anon_cnt
= 0;
2709 /* Return an IDENTIFIER which can be used as a name for
2710 anonymous structs and unions. */
2717 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2718 return get_identifier (buf
);
2721 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2722 This keeps dbxout from getting confused. */
2727 register struct binding_level
*b
;
2729 static int last_cnt
= 0;
2731 /* Fast out if no new anon names were declared. */
2732 if (last_cnt
== anon_cnt
)
2735 b
= current_binding_level
;
2736 while (b
->tag_transparent
)
2741 /* A NULL purpose means we have already processed all tags
2742 from here to the end of the list. */
2743 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2745 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2746 TREE_PURPOSE (tags
) = NULL_TREE
;
2747 tags
= TREE_CHAIN (tags
);
2749 last_cnt
= anon_cnt
;
2752 /* Subroutine of duplicate_decls: return truthvalue of whether
2753 or not types of these decls match.
2755 For C++, we must compare the parameter list so that `int' can match
2756 `int&' in a parameter position, but `int&' is not confused with
2760 decls_match (newdecl
, olddecl
)
2761 tree newdecl
, olddecl
;
2765 if (newdecl
== olddecl
)
2768 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
2769 /* If the two DECLs are not even the same kind of thing, we're not
2770 interested in their types. */
2773 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2775 tree f1
= TREE_TYPE (newdecl
);
2776 tree f2
= TREE_TYPE (olddecl
);
2777 tree p1
= TYPE_ARG_TYPES (f1
);
2778 tree p2
= TYPE_ARG_TYPES (f2
);
2780 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
)
2781 && ! (DECL_LANGUAGE (newdecl
) == lang_c
2782 && DECL_LANGUAGE (olddecl
) == lang_c
))
2785 /* When we parse a static member function definition,
2786 we put together a FUNCTION_DECL which thinks its type
2787 is METHOD_TYPE. Change that to FUNCTION_TYPE, and
2789 if (TREE_CODE (f1
) == METHOD_TYPE
&& DECL_STATIC_FUNCTION_P (olddecl
))
2790 revert_static_member_fn (&newdecl
, &f1
, &p1
);
2791 else if (TREE_CODE (f2
) == METHOD_TYPE
2792 && DECL_STATIC_FUNCTION_P (newdecl
))
2793 revert_static_member_fn (&olddecl
, &f2
, &p2
);
2795 /* Here we must take care of the case where new default
2796 parameters are specified. Also, warn if an old
2797 declaration becomes ambiguous because default
2798 parameters may cause the two to be ambiguous. */
2799 if (TREE_CODE (f1
) != TREE_CODE (f2
))
2801 if (TREE_CODE (f1
) == OFFSET_TYPE
)
2802 cp_compiler_error ("`%D' redeclared as member function", newdecl
);
2804 cp_compiler_error ("`%D' redeclared as non-member function", newdecl
);
2808 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
2810 if (! strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
) == lang_c
2813 types_match
= self_promoting_args_p (p1
);
2814 if (p1
== void_list_node
)
2815 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2817 else if (!strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
)==lang_c
2818 && DECL_LANGUAGE (newdecl
) == lang_c
&& p1
== NULL_TREE
)
2820 types_match
= self_promoting_args_p (p2
);
2821 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2824 types_match
= compparms (p1
, p2
);
2829 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2831 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
2832 DECL_TEMPLATE_PARMS (olddecl
)))
2835 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
2838 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
2839 DECL_TEMPLATE_RESULT (newdecl
));
2843 if (TREE_TYPE (newdecl
) == error_mark_node
)
2844 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
2845 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
2846 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
2847 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
2850 types_match
= comptypes (TREE_TYPE (newdecl
),
2851 TREE_TYPE (olddecl
),
2852 COMPARE_REDECLARATION
);
2858 /* If NEWDECL is `static' and an `extern' was seen previously,
2859 warn about it. OLDDECL is the previous declaration.
2861 Note that this does not apply to the C++ case of declaring
2862 a variable `extern const' and then later `const'.
2864 Don't complain about built-in functions, since they are beyond
2865 the user's control. */
2868 warn_extern_redeclared_static (newdecl
, olddecl
)
2869 tree newdecl
, olddecl
;
2871 static const char *explicit_extern_static_warning
2872 = "`%D' was declared `extern' and later `static'";
2873 static const char *implicit_extern_static_warning
2874 = "`%D' was declared implicitly `extern' and later `static'";
2878 if (TREE_CODE (newdecl
) == TYPE_DECL
2879 || TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2882 /* Don't get confused by static member functions; that's a different
2884 if (TREE_CODE (newdecl
) == FUNCTION_DECL
2885 && DECL_STATIC_FUNCTION_P (newdecl
))
2888 /* If the old declaration was `static', or the new one isn't, then
2889 then everything is OK. */
2890 if (DECL_THIS_STATIC (olddecl
) || !DECL_THIS_STATIC (newdecl
))
2893 /* It's OK to declare a builtin function as `static'. */
2894 if (TREE_CODE (olddecl
) == FUNCTION_DECL
2895 && DECL_ARTIFICIAL (olddecl
))
2898 name
= DECL_ASSEMBLER_NAME (newdecl
);
2899 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
2900 ? implicit_extern_static_warning
2901 : explicit_extern_static_warning
, newdecl
);
2902 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
2905 /* Handle when a new declaration NEWDECL has the same name as an old
2906 one OLDDECL in the same binding contour. Prints an error message
2909 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
2910 Otherwise, return 0. */
2913 duplicate_decls (newdecl
, olddecl
)
2914 tree newdecl
, olddecl
;
2916 unsigned olddecl_uid
= DECL_UID (olddecl
);
2917 int olddecl_friend
= 0, types_match
= 0;
2918 int new_defines_function
= 0;
2920 if (newdecl
== olddecl
)
2923 types_match
= decls_match (newdecl
, olddecl
);
2925 /* If either the type of the new decl or the type of the old decl is an
2926 error_mark_node, then that implies that we have already issued an
2927 error (earlier) for some bogus type specification, and in that case,
2928 it is rather pointless to harass the user with yet more error message
2929 about the same declaration, so just pretend the types match here. */
2930 if (TREE_TYPE (newdecl
) == error_mark_node
2931 || TREE_TYPE (olddecl
) == error_mark_node
)
2934 /* Check for redeclaration and other discrepancies. */
2935 if (TREE_CODE (olddecl
) == FUNCTION_DECL
2936 && DECL_ARTIFICIAL (olddecl
))
2938 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
2940 /* If you declare a built-in or predefined function name as static,
2941 the old definition is overridden, but optionally warn this was a
2942 bad choice of name. */
2943 if (! TREE_PUBLIC (newdecl
))
2946 cp_warning ("shadowing %s function `%#D'",
2947 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
2949 /* Discard the old built-in function. */
2952 /* If the built-in is not ansi, then programs can override
2953 it even globally without an error. */
2954 else if (! DECL_BUILT_IN (olddecl
))
2955 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
2959 cp_error ("declaration of `%#D'", newdecl
);
2960 cp_error ("conflicts with built-in declaration `%#D'",
2965 else if (!types_match
)
2967 if ((DECL_LANGUAGE (newdecl
) == lang_c
2968 && DECL_LANGUAGE (olddecl
) == lang_c
)
2969 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
2970 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
2972 /* A near match; override the builtin. */
2974 if (TREE_PUBLIC (newdecl
))
2976 cp_warning ("new declaration `%#D'", newdecl
);
2977 cp_warning ("ambiguates built-in declaration `%#D'",
2980 else if (warn_shadow
)
2981 cp_warning ("shadowing %s function `%#D'",
2982 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
2986 /* Discard the old built-in function. */
2990 if (DECL_THIS_STATIC (newdecl
) && !DECL_THIS_STATIC (olddecl
))
2992 /* If a builtin function is redeclared as `static', merge
2993 the declarations, but make the original one static. */
2994 DECL_THIS_STATIC (olddecl
) = 1;
2995 TREE_PUBLIC (olddecl
) = 0;
2997 /* Make the olddeclaration consistent with the new one so that
2998 all remnants of the builtin-ness of this function will be
3000 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3001 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3002 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3003 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (newdecl
),
3007 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3009 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3010 && TREE_CODE (newdecl
) != TYPE_DECL
3011 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3012 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3013 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3014 && TREE_CODE (olddecl
) != TYPE_DECL
3015 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3016 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3019 /* We do nothing special here, because C++ does such nasty
3020 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3021 get shadowed, and know that if we need to find a TYPE_DECL
3022 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3023 slot of the identifier. */
3027 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3028 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3029 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3030 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3033 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
3034 if (TREE_CODE (olddecl
) == TREE_LIST
)
3035 olddecl
= TREE_VALUE (olddecl
);
3036 cp_error_at ("previous declaration of `%#D'", olddecl
);
3038 /* New decl is completely inconsistent with the old one =>
3039 tell caller to replace the old one. */
3043 else if (!types_match
)
3045 if (DECL_REAL_CONTEXT (newdecl
) != DECL_REAL_CONTEXT (olddecl
))
3046 /* These are certainly not duplicate declarations; they're
3047 from different scopes. */
3050 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3052 /* The name of a class template may not be declared to refer to
3053 any other template, class, function, object, namespace, value,
3054 or type in the same scope. */
3055 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3056 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3058 cp_error ("declaration of template `%#D'", newdecl
);
3059 cp_error_at ("conflicts with previous declaration `%#D'",
3062 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3063 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3064 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3065 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3066 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3067 DECL_TEMPLATE_PARMS (olddecl
)))
3069 cp_error ("new declaration `%#D'", newdecl
);
3070 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3074 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3076 if (DECL_LANGUAGE (newdecl
) == lang_c
3077 && DECL_LANGUAGE (olddecl
) == lang_c
)
3079 cp_error ("declaration of C function `%#D' conflicts with",
3081 cp_error_at ("previous declaration `%#D' here", olddecl
);
3083 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3084 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3086 cp_error ("new declaration `%#D'", newdecl
);
3087 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3093 /* Already complained about this, so don't do so again. */
3094 else if (current_class_type
== NULL_TREE
3095 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3097 cp_error ("conflicting types for `%#D'", newdecl
);
3098 cp_error_at ("previous declaration as `%#D'", olddecl
);
3101 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3102 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3103 && (!DECL_TEMPLATE_INFO (newdecl
)
3104 || (DECL_TI_TEMPLATE (newdecl
)
3105 != DECL_TI_TEMPLATE (olddecl
))))
3106 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3107 && (!DECL_TEMPLATE_INFO (olddecl
)
3108 || (DECL_TI_TEMPLATE (olddecl
)
3109 != DECL_TI_TEMPLATE (newdecl
))))))
3110 /* It's OK to have a template specialization and a non-template
3111 with the same type, or to have specializations of two
3112 different templates with the same type. Note that if one is a
3113 specialization, and the other is an instantiation of the same
3114 template, that we do not exit at this point. That situation
3115 can occur if we instantiate a template class, and then
3116 specialize one of its methods. This situation is legal, but
3117 the declarations must be merged in the usual way. */
3119 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3120 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3121 && !DECL_USE_TEMPLATE (newdecl
))
3122 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3123 && !DECL_USE_TEMPLATE (olddecl
))))
3124 /* One of the declarations is a template instantiation, and the
3125 other is not a template at all. That's OK. */
3127 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3128 && DECL_NAMESPACE_ALIAS (newdecl
)
3129 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3130 /* Redeclaration of namespace alias, ignore it. */
3134 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3137 cp_error (errmsg
, newdecl
);
3138 if (DECL_NAME (olddecl
) != NULL_TREE
)
3139 cp_error_at ((DECL_INITIAL (olddecl
)
3140 && namespace_bindings_p ())
3141 ? "`%#D' previously defined here"
3142 : "`%#D' previously declared here", olddecl
);
3144 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3145 && DECL_INITIAL (olddecl
) != NULL_TREE
3146 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3147 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3149 /* Prototype decl follows defn w/o prototype. */
3150 cp_warning_at ("prototype for `%#D'", newdecl
);
3151 cp_warning_at ("follows non-prototype definition here", olddecl
);
3153 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3154 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3156 /* extern "C" int foo ();
3157 int foo () { bar (); }
3159 if (current_lang_stack
3160 == &VARRAY_TREE (current_lang_base
, 0))
3161 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3164 cp_error_at ("previous declaration of `%#D' with %L linkage",
3165 olddecl
, DECL_LANGUAGE (olddecl
));
3166 cp_error ("conflicts with new declaration with %L linkage",
3167 DECL_LANGUAGE (newdecl
));
3171 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3173 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3175 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3176 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3179 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3180 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3182 for (; t1
&& t1
!= void_list_node
;
3183 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3184 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3186 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3191 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3193 cp_pedwarn_at ("after previous specification in `%#D'",
3199 cp_error ("default argument given for parameter %d of `%#D'",
3201 cp_error_at ("after previous specification in `%#D'",
3206 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
3207 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3209 cp_warning ("`%#D' was used before it was declared inline",
3211 cp_warning_at ("previous non-inline declaration here",
3217 /* If new decl is `static' and an `extern' was seen previously,
3219 warn_extern_redeclared_static (newdecl
, olddecl
);
3221 /* We have committed to returning 1 at this point. */
3222 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3224 /* Now that functions must hold information normally held
3225 by field decls, there is extra work to do so that
3226 declaration information does not get destroyed during
3228 if (DECL_VINDEX (olddecl
))
3229 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3230 if (DECL_CONTEXT (olddecl
))
3231 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3232 if (DECL_CLASS_CONTEXT (olddecl
))
3233 DECL_CLASS_CONTEXT (newdecl
) = DECL_CLASS_CONTEXT (olddecl
);
3234 if (DECL_PENDING_INLINE_INFO (newdecl
) == (struct pending_inline
*)0)
3235 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3236 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3237 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3238 DECL_ABSTRACT_VIRTUAL_P (newdecl
) |= DECL_ABSTRACT_VIRTUAL_P (olddecl
);
3239 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3240 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3241 DECL_THIS_STATIC (newdecl
) |= DECL_THIS_STATIC (olddecl
);
3242 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3244 /* Optionally warn about more than one declaration for the same
3245 name, but don't warn about a function declaration followed by a
3247 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3248 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3249 /* Don't warn about extern decl followed by definition. */
3250 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3251 /* Don't warn about friends, let add_friend take care of it. */
3252 && ! DECL_FRIEND_P (newdecl
))
3254 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3255 cp_warning_at ("previous declaration of `%D'", olddecl
);
3259 /* Deal with C++: must preserve virtual function table size. */
3260 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3262 register tree newtype
= TREE_TYPE (newdecl
);
3263 register tree oldtype
= TREE_TYPE (olddecl
);
3265 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3266 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3268 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3269 CLASSTYPE_FRIEND_CLASSES (newtype
)
3270 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3274 /* Copy all the DECL_... slots specified in the new decl
3275 except for any that we copy here from the old type. */
3276 DECL_MACHINE_ATTRIBUTES (newdecl
)
3277 = merge_machine_decl_attributes (olddecl
, newdecl
);
3279 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3281 if (! duplicate_decls (DECL_TEMPLATE_RESULT (newdecl
),
3282 DECL_TEMPLATE_RESULT (olddecl
)))
3283 cp_error ("invalid redeclaration of %D", newdecl
);
3284 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3285 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3286 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3287 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3294 /* Automatically handles default parameters. */
3295 tree oldtype
= TREE_TYPE (olddecl
);
3298 /* Merge the data types specified in the two decls. */
3299 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3301 if (TREE_CODE (newdecl
) == VAR_DECL
)
3302 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3303 /* Do this after calling `common_type' so that default
3304 parameters don't confuse us. */
3305 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3306 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3307 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3309 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3310 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3311 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3312 TYPE_RAISES_EXCEPTIONS (oldtype
));
3314 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3315 && DECL_SOURCE_LINE (olddecl
) != 0
3317 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
3318 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
3320 cp_error ("declaration of `%F' throws different exceptions",
3322 cp_error_at ("to previous declaration `%F'", olddecl
);
3325 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3327 /* Lay the type out, unless already done. */
3328 if (! same_type_p (newtype
, oldtype
)
3329 && TREE_TYPE (newdecl
) != error_mark_node
3330 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3331 layout_type (TREE_TYPE (newdecl
));
3333 if ((TREE_CODE (newdecl
) == VAR_DECL
3334 || TREE_CODE (newdecl
) == PARM_DECL
3335 || TREE_CODE (newdecl
) == RESULT_DECL
3336 || TREE_CODE (newdecl
) == FIELD_DECL
3337 || TREE_CODE (newdecl
) == TYPE_DECL
)
3338 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3339 layout_decl (newdecl
, 0);
3341 /* Merge the type qualifiers. */
3342 if (TREE_READONLY (newdecl
))
3343 TREE_READONLY (olddecl
) = 1;
3344 if (TREE_THIS_VOLATILE (newdecl
))
3345 TREE_THIS_VOLATILE (olddecl
) = 1;
3347 /* Merge the initialization information. */
3348 if (DECL_INITIAL (newdecl
) == NULL_TREE
3349 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3351 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3352 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3353 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3354 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
3355 && DECL_LANG_SPECIFIC (newdecl
)
3356 && DECL_LANG_SPECIFIC (olddecl
))
3357 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3360 /* Merge the section attribute.
3361 We want to issue an error if the sections conflict but that must be
3362 done later in decl_attributes since we are called before attributes
3364 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3365 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3367 /* Keep the old rtl since we can safely use it. */
3368 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3370 /* If cannot merge, then use the new type and qualifiers,
3371 and don't preserve the old rtl. */
3374 /* Clean out any memory we had of the old declaration. */
3375 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3377 TREE_VALUE (oldstatic
) = error_mark_node
;
3379 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3380 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3381 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3382 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3385 /* Merge the storage class information. */
3386 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3387 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3388 DECL_DEFER_OUTPUT (newdecl
) |= DECL_DEFER_OUTPUT (olddecl
);
3389 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3390 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3391 if (! DECL_EXTERNAL (olddecl
))
3392 DECL_EXTERNAL (newdecl
) = 0;
3394 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3396 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3397 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3398 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3399 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3400 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3401 /* Don't really know how much of the language-specific
3402 values we should copy from old to new. */
3403 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3404 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3405 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3406 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3407 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3409 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3410 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3411 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3412 DECL_BEFRIENDING_CLASSES (newdecl
)
3413 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3414 DECL_BEFRIENDING_CLASSES (olddecl
));
3417 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3419 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3420 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3422 /* If newdecl is not a specialization, then it is not a
3423 template-related function at all. And that means that we
3424 shoud have exited above, returning 0. */
3425 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3428 if (TREE_USED (olddecl
))
3429 /* From [temp.expl.spec]:
3431 If a template, a member template or the member of a class
3432 template is explicitly specialized then that
3433 specialization shall be declared before the first use of
3434 that specialization that would cause an implicit
3435 instantiation to take place, in every translation unit in
3436 which such a use occurs. */
3437 cp_error ("explicit specialization of %D after first use",
3440 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3442 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3444 /* If either decl says `inline', this fn is inline, unless its
3445 definition was passed already. */
3446 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3447 DECL_INLINE (olddecl
) = 1;
3448 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3452 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3453 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3454 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3456 if (! types_match
|| new_defines_function
)
3458 /* These need to be copied so that the names are available.
3459 Note that if the types do match, we'll preserve inline
3460 info and other bits, but if not, we won't. */
3461 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3462 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3464 if (new_defines_function
)
3465 /* If defining a function declared with other language
3466 linkage, use the previously declared language linkage. */
3467 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3468 else if (types_match
)
3470 /* If redeclaring a builtin function, and not a definition,
3471 it stays built in. */
3472 if (DECL_BUILT_IN (olddecl
))
3474 DECL_BUILT_IN_CLASS (newdecl
) = DECL_BUILT_IN_CLASS (olddecl
);
3475 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3476 /* If we're keeping the built-in definition, keep the rtl,
3477 regardless of declaration matches. */
3478 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3481 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3483 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3484 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3485 /* Previously saved insns go together with
3486 the function's previous definition. */
3487 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3488 /* Don't clear out the arguments if we're redefining a function. */
3489 if (DECL_ARGUMENTS (olddecl
))
3490 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3492 if (DECL_LANG_SPECIFIC (olddecl
))
3493 DECL_MAIN_VARIANT (newdecl
) = DECL_MAIN_VARIANT (olddecl
);
3496 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3498 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3501 /* Now preserve various other info from the definition. */
3502 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3503 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3504 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3505 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3507 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3511 function_size
= sizeof (struct tree_decl
);
3513 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3514 (char *) olddecl
+ sizeof (struct tree_common
),
3515 function_size
- sizeof (struct tree_common
));
3517 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3519 /* If newdecl is a template instantiation, it is possible that
3520 the following sequence of events has occurred:
3522 o A friend function was declared in a class template. The
3523 class template was instantiated.
3525 o The instantiation of the friend declaration was
3526 recorded on the instantiation list, and is newdecl.
3528 o Later, however, instantiate_class_template called pushdecl
3529 on the newdecl to perform name injection. But, pushdecl in
3530 turn called duplicate_decls when it discovered that another
3531 declaration of a global function with the same name already
3534 o Here, in duplicate_decls, we decided to clobber newdecl.
3536 If we're going to do that, we'd better make sure that
3537 olddecl, and not newdecl, is on the list of
3538 instantiations so that if we try to do the instantiation
3539 again we won't get the clobbered declaration. */
3541 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3542 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3544 for (; decls
; decls
= TREE_CHAIN (decls
))
3545 if (TREE_VALUE (decls
) == newdecl
)
3546 TREE_VALUE (decls
) = olddecl
;
3551 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3552 (char *) olddecl
+ sizeof (struct tree_common
),
3553 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3554 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3557 DECL_UID (olddecl
) = olddecl_uid
;
3559 DECL_FRIEND_P (olddecl
) = 1;
3561 /* NEWDECL contains the merged attribute lists.
3562 Update OLDDECL to be the same. */
3563 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3568 /* Record a decl-node X as belonging to the current lexical scope.
3569 Check for errors (such as an incompatible declaration for the same
3570 name already seen in the same scope).
3572 Returns either X or an old decl for the same name.
3573 If an old decl is returned, it may have been smashed
3574 to agree with what X says. */
3582 int need_new_binding
;
3584 /* We shouldn't be calling pushdecl when we're generating RTL for a
3585 function that we already did semantic analysis on previously. */
3586 my_friendly_assert (!current_function
|| doing_semantic_analysis_p (),
3589 name
= DECL_ASSEMBLER_NAME (x
);
3590 need_new_binding
= 1;
3592 if (DECL_TEMPLATE_PARM_P (x
))
3593 /* Template parameters have no context; they are not X::T even
3594 when declared within a class or namespace. */
3598 if (current_function_decl
&& x
!= current_function_decl
3599 /* A local declaration for a function doesn't constitute
3601 && !(TREE_CODE (x
) == FUNCTION_DECL
&& !DECL_INITIAL (x
))
3602 /* A local declaration for an `extern' variable is in the
3603 scoped of the current namespace, not the current
3605 && !(TREE_CODE (x
) == VAR_DECL
&& DECL_EXTERNAL (x
))
3606 /* Don't change DECL_CONTEXT of virtual methods. */
3607 && (TREE_CODE (x
) != FUNCTION_DECL
|| !DECL_VIRTUAL_P (x
))
3608 && !DECL_CONTEXT (x
))
3609 DECL_CONTEXT (x
) = current_function_decl
;
3610 if (!DECL_CONTEXT (x
))
3611 DECL_CONTEXT (x
) = FROB_CONTEXT (current_namespace
);
3613 /* If this is the declaration for a namespace-scope function,
3614 but the declaration itself is in a local scope, mark the
3616 if (TREE_CODE (x
) == FUNCTION_DECL
3617 && DECL_NAMESPACE_SCOPE_P (x
)
3618 && current_function_decl
3619 && x
!= current_function_decl
)
3620 DECL_LOCAL_FUNCTION_P (x
) = 1;
3623 /* Type are looked up using the DECL_NAME, as that is what the rest of the
3624 compiler wants to use. */
3625 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
3626 || TREE_CODE (x
) == NAMESPACE_DECL
)
3627 name
= DECL_NAME (x
);
3632 /* Not needed...see below. */
3636 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3637 name
= TREE_OPERAND (name
, 0);
3639 /* Namespace-scoped variables are not found in the current level. */
3640 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
))
3641 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3643 t
= lookup_name_current_level (name
);
3644 if (t
== error_mark_node
)
3646 /* error_mark_node is 0 for a while during initialization! */
3648 cp_error_at ("`%#D' used prior to declaration", x
);
3651 else if (t
!= NULL_TREE
)
3654 /* This is turned off until I have time to do it right (bpk). */
3655 /* With the code below that uses it... */
3656 file
= DECL_SOURCE_FILE (t
);
3657 line
= DECL_SOURCE_LINE (t
);
3659 if (TREE_CODE (t
) == PARM_DECL
)
3661 if (DECL_CONTEXT (t
) == NULL_TREE
)
3662 fatal ("parse errors have confused me too much");
3664 /* Check for duplicate params. */
3665 if (duplicate_decls (x
, t
))
3668 else if (((TREE_CODE (x
) == FUNCTION_DECL
&& DECL_LANGUAGE (x
) == lang_c
)
3669 || DECL_FUNCTION_TEMPLATE_P (x
))
3670 && is_overloaded_fn (t
))
3671 /* Don't do anything just yet. */;
3672 else if (t
== wchar_decl_node
)
3674 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3675 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3677 /* Throw away the redeclaration. */
3680 else if (TREE_CODE (t
) != TREE_CODE (x
))
3682 if (duplicate_decls (x
, t
))
3685 else if (duplicate_decls (x
, t
))
3688 /* This is turned off until I have time to do it right (bpk). */
3690 /* Also warn if they did a prototype with `static' on it, but
3691 then later left the `static' off. */
3692 if (! TREE_PUBLIC (name
) && TREE_PUBLIC (x
))
3694 if (DECL_LANG_SPECIFIC (t
) && DECL_FRIEND_P (t
))
3699 cp_warning ("`static' missing from declaration of `%D'",
3701 warning_with_file_and_line (file
, line
,
3702 "previous declaration of `%s'",
3703 decl_as_string (t
, 0));
3706 /* Now fix things so it'll do what they expect. */
3707 if (current_function_decl
)
3708 TREE_PUBLIC (current_function_decl
) = 0;
3710 /* Due to interference in memory reclamation (X may be
3711 obstack-deallocated at this point), we must guard against
3712 one really special case. [jason: This should be handled
3713 by start_function] */
3714 if (current_function_decl
== x
)
3715 current_function_decl
= t
;
3717 if (TREE_CODE (t
) == TYPE_DECL
)
3718 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3719 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3720 check_default_args (t
);
3724 else if (DECL_MAIN_P (x
))
3726 /* A redeclaration of main, but not a duplicate of the
3731 This function shall not be overloaded. */
3732 cp_error_at ("invalid redeclaration of `%D'", t
);
3733 cp_error ("as `%D'", x
);
3734 /* We don't try to push this declaration since that
3740 check_template_shadow (x
);
3742 /* If this is a function conjured up by the backend, massage it
3743 so it looks friendly. */
3744 if (TREE_CODE (x
) == FUNCTION_DECL
3745 && ! DECL_LANG_SPECIFIC (x
))
3747 retrofit_lang_decl (x
);
3748 DECL_LANGUAGE (x
) = lang_c
;
3751 if (TREE_CODE (x
) == FUNCTION_DECL
&& ! DECL_FUNCTION_MEMBER_P (x
))
3753 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
3756 if (!namespace_bindings_p ())
3757 /* We do not need to create a binding for this name;
3758 push_overloaded_decl will have already done so if
3760 need_new_binding
= 0;
3762 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3764 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
3766 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
3770 /* If declaring a type as a typedef, copy the type (unless we're
3771 at line 0), and install this TYPE_DECL as the new type's typedef
3772 name. See the extensive comment in ../c-decl.c (pushdecl). */
3773 if (TREE_CODE (x
) == TYPE_DECL
)
3775 tree type
= TREE_TYPE (x
);
3776 if (DECL_SOURCE_LINE (x
) == 0)
3778 if (TYPE_NAME (type
) == 0)
3779 TYPE_NAME (type
) = x
;
3781 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
3782 /* We don't want to copy the type when all we're
3783 doing is making a TYPE_DECL for the purposes of
3785 && (!TYPE_NAME (type
)
3786 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
3788 DECL_ORIGINAL_TYPE (x
) = type
;
3789 type
= build_type_copy (type
);
3790 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
3791 TYPE_NAME (type
) = x
;
3792 TREE_TYPE (x
) = type
;
3795 if (type
!= error_mark_node
3797 && TYPE_IDENTIFIER (type
))
3798 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
3799 current_binding_level
);
3803 /* Multiple external decls of the same identifier ought to match.
3805 We get warnings about inline functions where they are defined.
3806 We get warnings about other functions from push_overloaded_decl.
3808 Avoid duplicate warnings where they are used. */
3809 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
3813 if (IDENTIFIER_NAMESPACE_VALUE (name
) != NULL_TREE
3814 && (DECL_EXTERNAL (IDENTIFIER_NAMESPACE_VALUE (name
))
3815 || TREE_PUBLIC (IDENTIFIER_NAMESPACE_VALUE (name
))))
3816 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
3821 /* If different sort of thing, we already gave an error. */
3822 && TREE_CODE (decl
) == TREE_CODE (x
)
3823 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
3825 cp_pedwarn ("type mismatch with previous external decl", x
);
3826 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
3830 /* This name is new in its binding level.
3831 Install the new declaration and return it. */
3832 if (namespace_bindings_p ())
3834 /* Install a global value. */
3836 /* If the first global decl has external linkage,
3837 warn if we later see static one. */
3838 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
3839 TREE_PUBLIC (name
) = 1;
3841 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
3843 /* For an ordinary function, we create a binding from
3844 the mangled name (i.e., NAME) to the DECL. But, for
3845 an `extern "C"' function, the mangled name and the
3846 ordinary name are the same so we need not do this. */
3847 && !(TREE_CODE (x
) == FUNCTION_DECL
&&
3848 DECL_LANGUAGE (x
) == lang_c
))
3850 if (TREE_CODE (x
) == FUNCTION_DECL
)
3852 ((IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
)
3853 || (IDENTIFIER_GLOBAL_VALUE (name
) == x
), 378);
3854 SET_IDENTIFIER_NAMESPACE_VALUE (name
, x
);
3857 /* Don't forget if the function was used via an implicit decl. */
3858 if (IDENTIFIER_IMPLICIT_DECL (name
)
3859 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
3862 /* Don't forget if its address was taken in that way. */
3863 if (IDENTIFIER_IMPLICIT_DECL (name
)
3864 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
3865 TREE_ADDRESSABLE (x
) = 1;
3867 /* Warn about mismatches against previous implicit decl. */
3868 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
3869 /* If this real decl matches the implicit, don't complain. */
3870 && ! (TREE_CODE (x
) == FUNCTION_DECL
3871 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
3873 ("`%D' was previously implicitly declared to return `int'", x
);
3875 /* If new decl is `static' and an `extern' was seen previously,
3877 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
3878 warn_extern_redeclared_static (x
, t
);
3882 /* Here to install a non-global value. */
3883 tree oldlocal
= IDENTIFIER_VALUE (name
);
3884 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
3886 if (need_new_binding
)
3888 push_local_binding (name
, x
, 0);
3889 /* Because push_local_binding will hook X on to the
3890 current_binding_level's name list, we don't want to
3891 do that again below. */
3892 need_new_binding
= 0;
3895 /* If this is a TYPE_DECL, push it into the type value slot. */
3896 if (TREE_CODE (x
) == TYPE_DECL
)
3897 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
3898 current_binding_level
);
3900 /* Clear out any TYPE_DECL shadowed by a namespace so that
3901 we won't think this is a type. The C struct hack doesn't
3902 go through namespaces. */
3903 if (TREE_CODE (x
) == NAMESPACE_DECL
)
3904 set_identifier_type_value_with_scope (name
, NULL_TREE
,
3905 current_binding_level
);
3907 /* If this is an extern function declaration, see if we
3908 have a global definition or declaration for the function. */
3909 if (oldlocal
== NULL_TREE
3910 && DECL_EXTERNAL (x
)
3911 && oldglobal
!= NULL_TREE
3912 && TREE_CODE (x
) == FUNCTION_DECL
3913 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
3915 /* We have one. Their types must agree. */
3916 if (decls_match (x
, oldglobal
))
3920 cp_warning ("extern declaration of `%#D' doesn't match", x
);
3921 cp_warning_at ("global declaration `%#D'", oldglobal
);
3924 /* If we have a local external declaration,
3925 and no file-scope declaration has yet been seen,
3926 then if we later have a file-scope decl it must not be static. */
3927 if (oldlocal
== NULL_TREE
3928 && oldglobal
== NULL_TREE
3929 && DECL_EXTERNAL (x
)
3931 TREE_PUBLIC (name
) = 1;
3933 if (DECL_FROM_INLINE (x
))
3934 /* Inline decls shadow nothing. */;
3936 /* Warn if shadowing an argument at the top level of the body. */
3937 else if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
3938 && TREE_CODE (oldlocal
) == PARM_DECL
3939 /* Don't complain if it's from an enclosing function. */
3940 && DECL_CONTEXT (oldlocal
) == current_function_decl
3941 && TREE_CODE (x
) != PARM_DECL
)
3943 /* Go to where the parms should be and see if we
3945 struct binding_level
*b
= current_binding_level
->level_chain
;
3951 if (b
->parm_flag
== 1)
3952 cp_error ("declaration of `%#D' shadows a parameter", name
);
3954 else if (warn_shadow
&& oldlocal
!= NULL_TREE
3955 && current_binding_level
->is_for_scope
3956 && !DECL_DEAD_FOR_LOCAL (oldlocal
))
3958 warning ("variable `%s' shadows local",
3959 IDENTIFIER_POINTER (name
));
3960 cp_warning_at (" this is the shadowed declaration", oldlocal
);
3962 /* Maybe warn if shadowing something else. */
3963 else if (warn_shadow
&& !DECL_EXTERNAL (x
)
3964 /* No shadow warnings for internally generated vars. */
3965 && ! DECL_ARTIFICIAL (x
)
3966 /* No shadow warnings for vars made for inlining. */
3967 && ! DECL_FROM_INLINE (x
))
3969 const char *warnstring
= NULL
;
3971 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
3972 warnstring
= "declaration of `%s' shadows a parameter";
3973 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
3974 && current_class_ptr
3975 && !TREE_STATIC (name
))
3976 warnstring
= "declaration of `%s' shadows a member of `this'";
3977 else if (oldlocal
!= NULL_TREE
)
3978 warnstring
= "declaration of `%s' shadows previous local";
3979 else if (oldglobal
!= NULL_TREE
)
3980 /* XXX shadow warnings in outer-more namespaces */
3981 warnstring
= "declaration of `%s' shadows global declaration";
3984 warning (warnstring
, IDENTIFIER_POINTER (name
));
3988 if (TREE_CODE (x
) == FUNCTION_DECL
)
3989 check_default_args (x
);
3991 /* Keep count of variables in this level with incomplete type. */
3992 if (TREE_CODE (x
) == VAR_DECL
3993 && TREE_TYPE (x
) != error_mark_node
3994 && ((TYPE_SIZE (TREE_TYPE (x
)) == NULL_TREE
3995 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
3996 /* RTTI TD entries are created while defining the type_info. */
3997 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
3998 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
3999 current_binding_level
->incomplete
4000 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4003 if (need_new_binding
)
4004 add_decl_to_level (x
,
4005 DECL_NAMESPACE_SCOPE_P (x
)
4006 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x
))
4007 : current_binding_level
);
4012 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4013 caller to set DECL_CONTEXT properly. */
4016 pushdecl_with_scope (x
, level
)
4018 struct binding_level
*level
;
4020 register struct binding_level
*b
;
4021 tree function_decl
= current_function_decl
;
4023 current_function_decl
= NULL_TREE
;
4024 if (level
->parm_flag
== 2)
4026 b
= class_binding_level
;
4027 class_binding_level
= level
;
4028 pushdecl_class_level (x
);
4029 class_binding_level
= b
;
4033 b
= current_binding_level
;
4034 current_binding_level
= level
;
4036 current_binding_level
= b
;
4038 current_function_decl
= function_decl
;
4042 /* Like pushdecl, only it places X in the current namespace,
4046 pushdecl_namespace_level (x
)
4049 register struct binding_level
*b
= current_binding_level
;
4052 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4054 /* Now, the type_shadowed stack may screw us. Munge it so it does
4056 if (TREE_CODE (x
) == TYPE_DECL
)
4058 tree name
= DECL_NAME (x
);
4060 tree
*ptr
= (tree
*)0;
4061 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4063 tree shadowed
= b
->type_shadowed
;
4064 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4065 if (TREE_PURPOSE (shadowed
) == name
)
4067 ptr
= &TREE_VALUE (shadowed
);
4068 /* Can't break out of the loop here because sometimes
4069 a binding level will have duplicate bindings for
4070 PT names. It's gross, but I haven't time to fix it. */
4073 newval
= TREE_TYPE (x
);
4074 if (ptr
== (tree
*)0)
4076 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4077 up here if this is changed to an assertion. --KR */
4078 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4088 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4092 pushdecl_top_level (x
)
4095 push_to_top_level ();
4096 x
= pushdecl_namespace_level (x
);
4097 pop_from_top_level ();
4101 /* Make the declaration of X appear in CLASS scope. */
4104 pushdecl_class_level (x
)
4107 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4108 scope looks for the pre-mangled name. */
4111 if (TREE_CODE (x
) == OVERLOAD
)
4112 x
= OVL_CURRENT (x
);
4113 name
= DECL_NAME (x
);
4117 push_class_level_binding (name
, x
);
4118 if (TREE_CODE (x
) == TYPE_DECL
)
4119 set_identifier_type_value (name
, TREE_TYPE (x
));
4121 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4125 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4128 pushdecl_class_level (f
);
4132 /* Enter DECL into the symbol table, if that's appropriate. Returns
4133 DECL, or a modified version thereof. */
4136 maybe_push_decl (decl
)
4139 tree type
= TREE_TYPE (decl
);
4141 /* Add this decl to the current binding level, but not if it comes
4142 from another scope, e.g. a static member variable. TEM may equal
4143 DECL or it may be a previous decl of the same name. */
4144 if ((TREE_CODE (decl
) != PARM_DECL
4145 && DECL_CONTEXT (decl
) != NULL_TREE
4146 /* Definitions of namespace members outside their namespace are
4148 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4149 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4150 || TREE_CODE (type
) == UNKNOWN_TYPE
4151 /* The declaration of a template specialization does not affect
4152 the functions available for overload resolution, so we do not
4154 || (TREE_CODE (decl
) == FUNCTION_DECL
4155 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4158 return pushdecl (decl
);
4162 /* This function is used to push the mangled decls for nested types into
4163 the appropriate scope. Previously pushdecl_top_level was used, but that
4164 is incorrect for members of local classes. */
4167 pushdecl_nonclass_level (x
)
4170 struct binding_level
*b
= current_binding_level
;
4172 my_friendly_assert (b
->parm_flag
!= 2, 180);
4175 /* Get out of template binding levels */
4176 while (b
->pseudo_global
)
4180 pushdecl_with_scope (x
, b
);
4184 /* Make the declaration(s) of X appear in CLASS scope
4185 under the name NAME. */
4188 push_class_level_binding (name
, x
)
4193 /* The class_binding_level will be NULL if x is a template
4194 parameter name in a member template. */
4195 if (!class_binding_level
)
4198 /* Make sure that this new member does not have the same name
4199 as a template parameter. */
4200 if (TYPE_BEING_DEFINED (current_class_type
))
4201 check_template_shadow (x
);
4203 /* If this declaration shadows a declaration from an enclosing
4204 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4205 we leave this class. Record the shadowed declaration here. */
4206 binding
= IDENTIFIER_BINDING (name
);
4208 && ((TREE_CODE (x
) == OVERLOAD
4209 && BINDING_VALUE (binding
)
4210 && is_overloaded_fn (BINDING_VALUE (binding
)))
4211 || INHERITED_VALUE_BINDING_P (binding
)))
4216 /* If the old binding was from a base class, and was for a tag
4217 name, slide it over to make room for the new binding. The
4218 old binding is still visible if explicitly qualified with a
4220 if (INHERITED_VALUE_BINDING_P (binding
)
4221 && BINDING_VALUE (binding
)
4222 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4223 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4224 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4226 old_decl
= BINDING_TYPE (binding
);
4227 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4228 BINDING_VALUE (binding
) = NULL_TREE
;
4229 INHERITED_VALUE_BINDING_P (binding
) = 0;
4232 old_decl
= BINDING_VALUE (binding
);
4234 /* There was already a binding for X containing fewer
4235 functions than are named in X. Find the previous
4236 declaration of X on the class-shadowed list, and update it. */
4237 for (shadow
= class_binding_level
->class_shadowed
;
4239 shadow
= TREE_CHAIN (shadow
))
4240 if (TREE_PURPOSE (shadow
) == name
4241 && TREE_TYPE (shadow
) == old_decl
)
4243 BINDING_VALUE (binding
) = x
;
4244 INHERITED_VALUE_BINDING_P (binding
) = 0;
4245 TREE_TYPE (shadow
) = x
;
4250 /* If we didn't replace an existing binding, put the binding on the
4251 stack of bindings for the identifier, and update
4252 IDENTIFIER_CLASS_VALUE. */
4253 if (push_class_binding (name
, x
))
4255 class_binding_level
->class_shadowed
4256 = tree_cons (name
, IDENTIFIER_CLASS_VALUE (name
),
4257 class_binding_level
->class_shadowed
);
4258 /* Record the value we are binding NAME to so that we can know
4259 what to pop later. */
4260 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4264 /* Insert another USING_DECL into the current binding level,
4265 returning this declaration. If this is a redeclaration,
4266 do nothing and return NULL_TREE. */
4269 push_using_decl (scope
, name
)
4275 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4276 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4277 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4278 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4282 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4283 DECL_INITIAL (decl
) = scope
;
4284 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4285 current_binding_level
->usings
= decl
;
4289 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4290 changed (i.e. there was already a directive), or the fresh
4291 TREE_LIST otherwise. */
4294 push_using_directive (used
)
4297 tree ud
= current_binding_level
->using_directives
;
4298 tree iter
, ancestor
;
4300 /* Check if we already have this. */
4301 if (purpose_member (used
, ud
) != NULL_TREE
)
4304 /* Recursively add all namespaces used. */
4305 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4306 push_using_directive (TREE_PURPOSE (iter
));
4308 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4309 ud
= current_binding_level
->using_directives
;
4310 ud
= tree_cons (used
, ancestor
, ud
);
4311 current_binding_level
->using_directives
= ud
;
4315 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4316 other definitions already in place. We get around this by making
4317 the value of the identifier point to a list of all the things that
4318 want to be referenced by that name. It is then up to the users of
4319 that name to decide what to do with that list.
4321 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its DECL_RESULT
4322 slot. It is dealt with the same way.
4324 FLAGS is a bitwise-or of the following values:
4325 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4327 PUSH_USING: DECL is being pushed as the result of a using
4330 The value returned may be a previous declaration if we guessed wrong
4331 about what language DECL should belong to (C or C++). Otherwise,
4332 it's always DECL (and never something that's not a _DECL). */
4335 push_overloaded_decl (decl
, flags
)
4339 tree name
= DECL_NAME (decl
);
4342 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4345 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4347 old
= lookup_name_current_level (name
);
4351 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4353 tree t
= TREE_TYPE (old
);
4354 if (IS_AGGR_TYPE (t
) && warn_shadow
4355 && (! DECL_IN_SYSTEM_HEADER (decl
)
4356 || ! DECL_IN_SYSTEM_HEADER (old
)))
4357 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4360 else if (is_overloaded_fn (old
))
4364 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4366 tree fn
= OVL_CURRENT (tmp
);
4368 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4369 && !(flags
& PUSH_USING
)
4370 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4371 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4372 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4375 if (duplicate_decls (decl
, fn
))
4381 cp_error_at ("previous non-function declaration `%#D'", old
);
4382 cp_error ("conflicts with function declaration `%#D'", decl
);
4387 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4389 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4390 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4392 new_binding
= ovl_cons (decl
, old
);
4393 if (flags
& PUSH_USING
)
4394 OVL_USED (new_binding
) = 1;
4397 /* NAME is not ambiguous. */
4401 set_namespace_binding (name
, current_namespace
, new_binding
);
4404 /* We only create an OVERLOAD if there was a previous binding at
4405 this level, or if decl is a template. In the former case, we
4406 need to remove the old binding and replace it with the new
4407 binding. We must also run through the NAMES on the binding
4408 level where the name was bound to update the chain. */
4410 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4414 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4416 d
= &TREE_CHAIN (*d
))
4418 || (TREE_CODE (*d
) == TREE_LIST
4419 && TREE_VALUE (*d
) == old
))
4421 if (TREE_CODE (*d
) == TREE_LIST
)
4422 /* Just replace the old binding with the new. */
4423 TREE_VALUE (*d
) = new_binding
;
4425 /* Build a TREE_LIST to wrap the OVERLOAD. */
4426 *d
= tree_cons (NULL_TREE
, new_binding
,
4429 /* And update the CPLUS_BINDING node. */
4430 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4435 /* We should always find a previous binding in this case. */
4436 my_friendly_abort (0);
4439 /* Install the new binding. */
4440 push_local_binding (name
, new_binding
, flags
);
4446 /* Generate an implicit declaration for identifier FUNCTIONID
4447 as a function of type int (). Print a warning if appropriate. */
4450 implicitly_declare (functionid
)
4455 /* We used to reuse an old implicit decl here,
4456 but this loses with inline functions because it can clobber
4457 the saved decl chains. */
4458 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4460 DECL_EXTERNAL (decl
) = 1;
4461 TREE_PUBLIC (decl
) = 1;
4463 /* ANSI standard says implicit declarations are in the innermost block.
4464 So we record the decl in the standard fashion. */
4466 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4469 /* Only one warning per identifier. */
4470 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4472 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4475 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4480 /* Return zero if the declaration NEWDECL is valid
4481 when the declaration OLDDECL (assumed to be for the same name)
4482 has already been seen.
4483 Otherwise return an error message format string with a %s
4484 where the identifier should go. */
4487 redeclaration_error_message (newdecl
, olddecl
)
4488 tree newdecl
, olddecl
;
4490 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4492 /* Because C++ can put things into name space for free,
4493 constructs like "typedef struct foo { ... } foo"
4494 would look like an erroneous redeclaration. */
4495 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4498 return "redefinition of `%#D'";
4500 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4502 /* If this is a pure function, its olddecl will actually be
4503 the original initialization to `0' (which we force to call
4504 abort()). Don't complain about redefinition in this case. */
4505 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_ABSTRACT_VIRTUAL_P (olddecl
))
4508 /* If both functions come from different namespaces, this is not
4509 a redeclaration - this is a conflict with a used function. */
4510 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4511 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4512 return "`%D' conflicts with used function";
4514 /* We'll complain about linkage mismatches in
4515 warn_extern_redeclared_static. */
4517 /* Defining the same name twice is no good. */
4518 if (DECL_INITIAL (olddecl
) != NULL_TREE
4519 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4521 if (DECL_NAME (olddecl
) == NULL_TREE
)
4522 return "`%#D' not declared in class";
4524 return "redefinition of `%#D'";
4528 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4530 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4531 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4532 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4533 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4534 && TYPE_SIZE (TREE_TYPE (newdecl
))
4535 && TYPE_SIZE (TREE_TYPE (olddecl
))))
4536 return "redefinition of `%#D'";
4539 else if (toplevel_bindings_p ())
4541 /* Objects declared at top level: */
4542 /* If at least one is a reference, it's ok. */
4543 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4545 /* Reject two definitions. */
4546 return "redefinition of `%#D'";
4550 /* Objects declared with block scope: */
4551 /* Reject two definitions, and reject a definition
4552 together with an external reference. */
4553 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4554 return "redeclaration of `%#D'";
4559 /* Create a new label, named ID. */
4562 make_label_decl (id
, local_p
)
4568 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4570 /* Make sure every label has an rtx. */
4573 DECL_CONTEXT (decl
) = current_function_decl
;
4574 DECL_MODE (decl
) = VOIDmode
;
4575 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
4577 /* Say where one reference is to the label, for the sake of the
4578 error if it is not defined. */
4579 DECL_SOURCE_LINE (decl
) = lineno
;
4580 DECL_SOURCE_FILE (decl
) = input_filename
;
4582 /* Record the fact that this identifier is bound to this label. */
4583 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4585 /* Record this label on the list of used labels so that we can check
4586 at the end of the function to see whether or not the label was
4587 actually defined. */
4588 if ((named_label_uses
== NULL
|| named_label_uses
->label_decl
!= decl
)
4589 && (named_label_uses
== NULL
4590 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4591 || named_label_uses
->label_decl
!= decl
))
4593 struct named_label_list
*new_ent
;
4595 = (struct named_label_list
*)oballoc (sizeof (struct named_label_list
));
4596 new_ent
->label_decl
= decl
;
4597 new_ent
->names_in_scope
= current_binding_level
->names
;
4598 new_ent
->binding_level
= current_binding_level
;
4599 new_ent
->lineno_o_goto
= lineno
;
4600 new_ent
->filename_o_goto
= input_filename
;
4601 new_ent
->next
= named_label_uses
;
4602 named_label_uses
= new_ent
;
4608 /* Look for a label named ID in the current function. If one cannot
4609 be found, create one. (We keep track of used, but undefined,
4610 labels, and complain about them at the end of a function.) */
4618 /* You can't use labels at global scope. */
4619 if (current_function_decl
== NULL_TREE
)
4621 error ("label `%s' referenced outside of any function",
4622 IDENTIFIER_POINTER (id
));
4626 /* See if we've already got this label. */
4627 decl
= IDENTIFIER_LABEL_VALUE (id
);
4628 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
4631 /* Record this label on the list of labels used in this function.
4632 We do this before calling make_label_decl so that we get the
4633 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4634 named_labels
= tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4636 /* We need a new label. */
4637 decl
= make_label_decl (id
, /*local_p=*/0);
4638 /* Now fill in the information we didn't have before. */
4639 TREE_VALUE (named_labels
) = decl
;
4644 /* Declare a local label named ID. */
4647 declare_local_label (id
)
4652 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4653 this scope we can restore the old value of
4654 IDENTIFIER_TYPE_VALUE. */
4655 current_binding_level
->shadowed_labels
4656 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4657 current_binding_level
->shadowed_labels
);
4658 /* Look for the label. */
4659 decl
= make_label_decl (id
, /*local_p=*/1);
4660 /* Now fill in the information we didn't have before. */
4661 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
4666 /* Define a label, specifying the location in the source file.
4667 Return the LABEL_DECL node for the label, if the definition is valid.
4668 Otherwise return 0. */
4671 define_label (filename
, line
, name
)
4676 tree decl
= lookup_label (name
);
4678 /* After labels, make any new cleanups go into their
4679 own new (temporary) binding contour. */
4680 current_binding_level
->more_cleanups_ok
= 0;
4682 if (name
== get_identifier ("wchar_t"))
4683 cp_pedwarn ("label named wchar_t");
4685 if (DECL_INITIAL (decl
) != NULL_TREE
)
4687 cp_error ("duplicate label `%D'", decl
);
4692 struct named_label_list
*uses
, *prev
;
4696 /* Mark label as having been defined. */
4697 DECL_INITIAL (decl
) = error_mark_node
;
4698 /* Say where in the source. */
4699 DECL_SOURCE_FILE (decl
) = filename
;
4700 DECL_SOURCE_LINE (decl
) = line
;
4703 uses
= named_label_uses
;
4704 while (uses
!= NULL
)
4705 if (uses
->label_decl
== decl
)
4707 struct binding_level
*b
= current_binding_level
;
4710 tree new_decls
= b
->names
;
4711 tree old_decls
= (b
== uses
->binding_level
)
4712 ? uses
->names_in_scope
: NULL_TREE
;
4713 while (new_decls
!= old_decls
)
4715 if (TREE_CODE (new_decls
) == VAR_DECL
4716 /* Don't complain about crossing initialization
4717 of internal entities. They can't be accessed,
4718 and they should be cleaned up
4719 by the time we get to the label. */
4720 && ! DECL_ARTIFICIAL (new_decls
)
4721 && !(DECL_INITIAL (new_decls
) == NULL_TREE
4722 && pod_type_p (TREE_TYPE (new_decls
))))
4724 /* This is really only important if we're crossing
4725 an initialization. The POD stuff is just
4726 pedantry; why should it matter if the class
4727 contains a field of pointer to member type? */
4728 int problem
= (DECL_INITIAL (new_decls
)
4729 || (TYPE_NEEDS_CONSTRUCTING
4730 (TREE_TYPE (new_decls
))));
4736 cp_error ("jump to label `%D'", decl
);
4737 error_with_file_and_line
4738 (uses
->filename_o_goto
,
4739 uses
->lineno_o_goto
, " from here");
4743 cp_pedwarn ("jump to label `%D'", decl
);
4744 pedwarn_with_file_and_line
4745 (uses
->filename_o_goto
,
4746 uses
->lineno_o_goto
, " from here");
4752 cp_error_at (" crosses initialization of `%#D'",
4755 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4758 new_decls
= TREE_CHAIN (new_decls
);
4760 if (b
== uses
->binding_level
)
4762 if (b
->eh_region
&& ! saw_eh
)
4766 cp_error ("jump to label `%D'", decl
);
4767 error_with_file_and_line
4768 (uses
->filename_o_goto
,
4769 uses
->lineno_o_goto
, " from here");
4772 error (" enters exception handling block");
4779 prev
->next
= uses
->next
;
4781 named_label_uses
= uses
->next
;
4790 current_function_return_value
= NULL_TREE
;
4797 struct binding_level
*level
;
4798 struct cp_switch
*next
;
4801 static struct cp_switch
*switch_stack
;
4807 = (struct cp_switch
*) oballoc (sizeof (struct cp_switch
));
4808 p
->level
= current_binding_level
;
4809 p
->next
= switch_stack
;
4816 switch_stack
= switch_stack
->next
;
4819 /* Note that we've seen a definition of a case label, and complain if this
4820 is a bad place for one. */
4823 define_case_label ()
4825 tree cleanup
= last_cleanup_this_contour ();
4826 struct binding_level
*b
= current_binding_level
;
4830 /* Don't crash; we'll complain in do_case. */
4835 static int explained
= 0;
4836 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup
));
4837 warning ("where case label appears here");
4840 warning ("(enclose actions of previous case statements requiring");
4841 warning ("destructors in their own binding contours.)");
4846 for (; b
&& b
!= switch_stack
->level
; b
= b
->level_chain
)
4848 tree new_decls
= b
->names
;
4849 for (; new_decls
; new_decls
= TREE_CHAIN (new_decls
))
4851 if (TREE_CODE (new_decls
) == VAR_DECL
4852 /* Don't complain about crossing initialization
4853 of internal entities. They can't be accessed,
4854 and they should be cleaned up
4855 by the time we get to the label. */
4856 && ! DECL_ARTIFICIAL (new_decls
)
4857 && ((DECL_INITIAL (new_decls
) != NULL_TREE
4858 && DECL_INITIAL (new_decls
) != error_mark_node
)
4859 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls
))))
4862 error ("jump to case label");
4864 cp_error_at (" crosses initialization of `%#D'",
4870 /* After labels, make any new cleanups go into their
4871 own new (temporary) binding contour. */
4873 current_binding_level
->more_cleanups_ok
= 0;
4874 current_function_return_value
= NULL_TREE
;
4877 /* Return the list of declarations of the current level.
4878 Note that this list is in reverse order unless/until
4879 you nreverse it; and when you do nreverse it, you must
4880 store the result back using `storedecls' or you will lose. */
4885 return current_binding_level
->names
;
4888 /* Return the list of type-tags (for structs, etc) of the current level. */
4893 return current_binding_level
->tags
;
4896 /* Store the list of declarations of the current level.
4897 This is done for the parameter declarations of a function being defined,
4898 after they are modified in the light of any missing parameters. */
4904 current_binding_level
->names
= decls
;
4907 /* Similarly, store the list of tags of the current level. */
4913 current_binding_level
->tags
= tags
;
4916 /* Given NAME, an IDENTIFIER_NODE,
4917 return the structure (or union or enum) definition for that name.
4918 Searches binding levels from BINDING_LEVEL up to the global level.
4919 If THISLEVEL_ONLY is nonzero, searches only the specified context
4920 (but skips any tag-transparent contexts to find one that is
4921 meaningful for tags).
4922 FORM says which kind of type the caller wants;
4923 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
4924 If the wrong kind of type is found, and it's not a template, an error is
4928 lookup_tag (form
, name
, binding_level
, thislevel_only
)
4929 enum tree_code form
;
4931 struct binding_level
*binding_level
;
4934 register struct binding_level
*level
;
4935 /* Non-zero if, we should look past a pseudo-global level, even if
4937 int allow_pseudo_global
= 1;
4939 for (level
= binding_level
; level
; level
= level
->level_chain
)
4942 if (ANON_AGGRNAME_P (name
))
4943 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
4945 /* There's no need for error checking here, because
4946 anon names are unique throughout the compilation. */
4947 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
4948 return TREE_VALUE (tail
);
4950 else if (level
->namespace_p
)
4951 /* Do namespace lookup. */
4952 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
4954 tree old
= binding_for_name (name
, tail
);
4956 /* If we just skipped past a pseudo global level, even
4957 though THISLEVEL_ONLY, and we find a template class
4958 declaration, then we use the _TYPE node for the
4959 template. See the example below. */
4960 if (thislevel_only
&& !allow_pseudo_global
4961 && old
&& BINDING_VALUE (old
)
4962 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
4963 old
= TREE_TYPE (BINDING_VALUE (old
));
4965 old
= BINDING_TYPE (old
);
4967 /* If it has an original type, it is a typedef, and we
4968 should not return it. */
4969 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
4971 if (old
&& TREE_CODE (old
) != form
4972 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
4974 cp_error ("`%#D' redeclared as %C", old
, form
);
4979 if (thislevel_only
|| tail
== global_namespace
)
4983 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
4985 if (TREE_PURPOSE (tail
) == name
)
4987 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
4988 /* Should tighten this up; it'll probably permit
4989 UNION_TYPE and a struct template, for example. */
4991 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
4993 /* Definition isn't the kind we were looking for. */
4994 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
4998 return TREE_VALUE (tail
);
5001 if (thislevel_only
&& ! level
->tag_transparent
)
5003 if (level
->pseudo_global
&& allow_pseudo_global
)
5005 /* We must deal with cases like this:
5007 template <class T> struct S;
5008 template <class T> struct S {};
5010 When looking up `S', for the second declaration, we
5011 would like to find the first declaration. But, we
5012 are in the pseudo-global level created for the
5013 template parameters, rather than the (surrounding)
5014 namespace level. Thus, we keep going one more level,
5015 even though THISLEVEL_ONLY is non-zero. */
5016 allow_pseudo_global
= 0;
5028 set_current_level_tags_transparency (tags_transparent
)
5029 int tags_transparent
;
5031 current_binding_level
->tag_transparent
= tags_transparent
;
5035 /* Given a type, find the tag that was defined for it and return the tag name.
5036 Otherwise return 0. However, the value can never be 0
5037 in the cases in which this is used.
5039 C++: If NAME is non-zero, this is the new name to install. This is
5040 done when replacing anonymous tags with real tag names. */
5043 lookup_tag_reverse (type
, name
)
5047 register struct binding_level
*level
;
5049 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5052 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5054 if (TREE_VALUE (tail
) == type
)
5057 TREE_PURPOSE (tail
) = name
;
5058 return TREE_PURPOSE (tail
);
5065 /* Look up NAME in the NAMESPACE. */
5068 lookup_namespace_name (namespace, name
)
5069 tree
namespace, name
;
5072 tree template_id
= NULL_TREE
;
5074 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5076 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5077 /* This happens for A::B<int> when B is a namespace. */
5079 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5081 /* This happens for A::B where B is a template, and there are no
5082 template arguments. */
5083 cp_error ("invalid use of `%D'", name
);
5084 return error_mark_node
;
5087 namespace = ORIGINAL_NAMESPACE (namespace);
5089 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5092 name
= TREE_OPERAND (name
, 0);
5093 if (TREE_CODE (name
) == OVERLOAD
)
5094 name
= DECL_NAME (OVL_CURRENT (name
));
5095 else if (TREE_CODE_CLASS (TREE_CODE (name
)) == 'd')
5096 name
= DECL_NAME (name
);
5099 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5101 val
= make_node (CPLUS_BINDING
);
5102 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5103 return error_mark_node
;
5105 if (BINDING_VALUE (val
))
5107 val
= BINDING_VALUE (val
);
5111 if (DECL_CLASS_TEMPLATE_P (val
))
5112 val
= lookup_template_class (val
,
5113 TREE_OPERAND (template_id
, 1),
5114 /*in_decl=*/NULL_TREE
,
5115 /*context=*/NULL_TREE
,
5116 /*entering_scope=*/0);
5117 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5118 || TREE_CODE (val
) == OVERLOAD
)
5119 val
= lookup_template_function (val
,
5120 TREE_OPERAND (template_id
, 1));
5123 cp_error ("`%D::%D' is not a template",
5125 return error_mark_node
;
5129 /* If we have a single function from a using decl, pull it out. */
5130 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5131 val
= OVL_FUNCTION (val
);
5135 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5136 return error_mark_node
;
5139 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5141 static unsigned long
5149 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5150 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5155 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5158 typename_compare (k1
, k2
)
5169 d1
= TYPE_NAME (t1
);
5170 d2
= TYPE_NAME (t2
);
5172 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5173 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5174 && ((TREE_TYPE (t1
) != NULL_TREE
)
5175 == (TREE_TYPE (t2
) != NULL_TREE
))
5176 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5177 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5180 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5181 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5182 is non-NULL, this type is being created by the implicit typename
5183 extension, and BASE_TYPE is a type named `t' in some base class of
5184 `T' which depends on template parameters.
5186 Returns the new TYPENAME_TYPE. */
5189 build_typename_type (context
, name
, fullname
, base_type
)
5197 struct hash_entry
* e
;
5199 static struct hash_table ht
;
5203 static struct hash_table
*h
= &ht
;
5204 if (!hash_table_init (&ht
, &hash_newfunc
, &typename_hash
,
5206 fatal ("virtual memory exhausted");
5207 ggc_add_tree_hash_table_root (&h
, 1);
5210 /* Build the TYPENAME_TYPE. */
5211 t
= make_lang_type (TYPENAME_TYPE
);
5212 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5213 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5214 TREE_TYPE (t
) = base_type
;
5216 /* Build the corresponding TYPE_DECL. */
5217 d
= build_decl (TYPE_DECL
, name
, t
);
5218 TYPE_NAME (TREE_TYPE (d
)) = d
;
5219 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5220 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5221 DECL_ARTIFICIAL (d
) = 1;
5223 /* See if we already have this type. */
5224 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5228 /* Insert the type into the table. */
5229 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5234 /* Resolve `typename CONTEXT::NAME'. Returns an appropriate type,
5235 unless an error occurs, in which case error_mark_node is returned.
5236 If COMPLAIN zero, don't complain about any errors that occur. */
5239 make_typename_type (context
, name
, complain
)
5245 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
5247 if (!(TYPE_LANG_SPECIFIC (name
)
5248 && (CLASSTYPE_IS_TEMPLATE (name
)
5249 || CLASSTYPE_USE_TEMPLATE (name
))))
5250 name
= TYPE_IDENTIFIER (name
);
5252 /* Create a TEMPLATE_ID_EXPR for the type. */
5253 name
= build_nt (TEMPLATE_ID_EXPR
,
5254 CLASSTYPE_TI_TEMPLATE (name
),
5255 CLASSTYPE_TI_ARGS (name
));
5257 else if (TREE_CODE (name
) == TYPE_DECL
)
5258 name
= DECL_NAME (name
);
5262 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5264 name
= TREE_OPERAND (name
, 0);
5265 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5266 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5268 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5269 my_friendly_abort (2000);
5271 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5273 /* We can get here from typename_sub0 in the explicit_template_type
5274 expansion. Just fail. */
5276 cp_error ("no class template named `%#T' in `%#T'",
5278 return error_mark_node
;
5281 if (! uses_template_parms (context
)
5282 || currently_open_class (context
))
5284 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5286 tree tmpl
= NULL_TREE
;
5287 if (IS_AGGR_TYPE (context
))
5288 tmpl
= lookup_field (context
, name
, 0, 0);
5289 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5292 cp_error ("no class template named `%#T' in `%#T'",
5294 return error_mark_node
;
5297 return lookup_template_class (tmpl
,
5298 TREE_OPERAND (fullname
, 1),
5300 /*entering_scope=*/0);
5306 if (!IS_AGGR_TYPE (context
))
5309 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5310 return error_mark_node
;
5313 t
= lookup_field (context
, name
, 0, 1);
5315 return TREE_TYPE (t
);
5319 /* If the CONTEXT is not a template type, then either the field is
5320 there now or its never going to be. */
5321 if (!uses_template_parms (context
))
5324 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5325 return error_mark_node
;
5329 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5332 /* Select the right _DECL from multiple choices. */
5335 select_decl (binding
, flags
)
5340 val
= BINDING_VALUE (binding
);
5341 if (LOOKUP_NAMESPACES_ONLY (flags
))
5343 /* We are not interested in types. */
5344 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5349 /* If we could have a type and
5350 we have nothing or we need a type and have none. */
5351 if (BINDING_TYPE (binding
)
5352 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5353 && TREE_CODE (val
) != TYPE_DECL
)))
5354 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5355 /* Don't return non-types if we really prefer types. */
5356 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5357 && (TREE_CODE (val
) != TEMPLATE_DECL
5358 || !DECL_CLASS_TEMPLATE_P (val
)))
5364 /* Unscoped lookup of a global: iterate over current namespaces,
5365 considering using-directives. If SPACESP is non-NULL, store a list
5366 of the namespaces we've considered in it. */
5369 unqualified_namespace_lookup (name
, flags
, spacesp
)
5374 tree b
= make_node (CPLUS_BINDING
);
5375 tree initial
= current_decl_namespace();
5376 tree scope
= initial
;
5378 struct binding_level
*level
;
5379 tree val
= NULL_TREE
;
5382 *spacesp
= NULL_TREE
;
5384 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5387 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5388 val
= binding_for_name (name
, scope
);
5390 /* Initialize binding for this context. */
5391 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5392 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5394 /* Add all _DECLs seen through local using-directives. */
5395 for (level
= current_binding_level
;
5396 !level
->namespace_p
;
5397 level
= level
->level_chain
)
5398 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5399 scope
, flags
, spacesp
))
5400 /* Give up because of error. */
5401 return error_mark_node
;
5403 /* Add all _DECLs seen through global using-directives. */
5404 /* XXX local and global using lists should work equally. */
5408 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5409 scope
, flags
, spacesp
))
5410 /* Give up because of error. */
5411 return error_mark_node
;
5412 if (siter
== scope
) break;
5413 siter
= CP_DECL_CONTEXT (siter
);
5416 val
= select_decl (b
, flags
);
5417 if (scope
== global_namespace
)
5423 /* Combine prefer_type and namespaces_only into flags. */
5426 lookup_flags (prefer_type
, namespaces_only
)
5427 int prefer_type
, namespaces_only
;
5429 if (namespaces_only
)
5430 return LOOKUP_PREFER_NAMESPACES
;
5431 if (prefer_type
> 1)
5432 return LOOKUP_PREFER_TYPES
;
5433 if (prefer_type
> 0)
5434 return LOOKUP_PREFER_BOTH
;
5438 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5439 ignore it or not. Subroutine of lookup_name_real. */
5442 qualify_lookup (val
, flags
)
5446 if (val
== NULL_TREE
)
5448 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5450 if ((flags
& LOOKUP_PREFER_TYPES
)
5451 && (TREE_CODE (val
) == TYPE_DECL
5452 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5453 && DECL_CLASS_TEMPLATE_P (val
))))
5455 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5460 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5464 warn_about_implicit_typename_lookup (typename
, binding
)
5468 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5469 tree name
= DECL_NAME (typename
);
5471 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5472 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5473 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5474 && ! (TREE_CODE (binding
) == TYPE_DECL
5475 && same_type_p (TREE_TYPE (binding
), subtype
)))
5477 cp_warning ("lookup of `%D' finds `%#D'",
5479 cp_warning (" instead of `%D' from dependent base class",
5481 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5482 constructor_name (current_class_type
), name
);
5486 /* Look up NAME in the current binding level and its superiors in the
5487 namespace of variables, functions and typedefs. Return a ..._DECL
5488 node of some kind representing its definition if there is only one
5489 such declaration, or return a TREE_LIST with all the overloaded
5490 definitions if there are many, or return 0 if it is undefined.
5492 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5493 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5494 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5495 Otherwise we prefer non-TYPE_DECLs.
5497 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5498 using IDENTIFIER_CLASS_VALUE. */
5501 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5503 int prefer_type
, nonclass
, namespaces_only
;
5506 tree val
= NULL_TREE
;
5508 tree from_obj
= NULL_TREE
;
5510 int val_is_implicit_typename
= 0;
5512 /* Hack: copy flag set by parser, if set. */
5513 if (only_namespace_names
)
5514 namespaces_only
= 1;
5516 if (prefer_type
== -2)
5518 extern int looking_for_typename
;
5519 tree type
= NULL_TREE
;
5522 prefer_type
= looking_for_typename
;
5524 flags
= lookup_flags (prefer_type
, namespaces_only
);
5525 /* If the next thing is '<', class templates are types. */
5526 if (looking_for_template
)
5527 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5529 /* std:: becomes :: for now. */
5530 if (got_scope
== std_node
)
5531 got_scope
= void_type_node
;
5535 else if (got_object
!= error_mark_node
)
5540 if (type
== error_mark_node
)
5541 return error_mark_node
;
5542 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5543 type
= TREE_TYPE (type
);
5546 type
= complete_type (type
);
5548 if (TREE_CODE (type
) == VOID_TYPE
)
5549 type
= global_namespace
;
5550 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5552 val
= make_node (CPLUS_BINDING
);
5553 flags
|= LOOKUP_COMPLAIN
;
5554 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5556 val
= select_decl (val
, flags
);
5558 else if (! IS_AGGR_TYPE (type
)
5559 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5560 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5561 || TREE_CODE (type
) == TYPENAME_TYPE
)
5562 /* Someone else will give an error about this if needed. */
5564 else if (type
== current_class_type
)
5565 val
= IDENTIFIER_CLASS_VALUE (name
);
5567 val
= lookup_member (type
, name
, 0, prefer_type
);
5574 else if (got_object
&& val
)
5579 flags
= lookup_flags (prefer_type
, namespaces_only
);
5580 /* If we're not parsing, we need to complain. */
5581 flags
|= LOOKUP_COMPLAIN
;
5584 /* First, look in non-namespace scopes. */
5586 if (current_class_type
== NULL_TREE
)
5589 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5593 if (!LOCAL_BINDING_P (t
) && nonclass
)
5594 /* We're not looking for class-scoped bindings, so keep going. */
5597 /* If this is the kind of thing we're looking for, we're done. */
5598 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5599 binding
= BINDING_VALUE (t
);
5600 else if ((flags
& LOOKUP_PREFER_TYPES
)
5601 && qualify_lookup (BINDING_TYPE (t
), flags
))
5602 binding
= BINDING_TYPE (t
);
5604 binding
= NULL_TREE
;
5607 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5609 if (val_is_implicit_typename
&& !yylex
)
5610 warn_about_implicit_typename_lookup (val
, binding
);
5612 val_is_implicit_typename
5613 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5614 if (!val_is_implicit_typename
)
5619 /* Now lookup in namespace scopes. */
5620 if (!val
|| val_is_implicit_typename
)
5622 t
= unqualified_namespace_lookup (name
, flags
, 0);
5625 if (val_is_implicit_typename
&& !yylex
)
5626 warn_about_implicit_typename_lookup (val
, t
);
5634 /* This should only warn about types used in qualified-ids. */
5635 if (from_obj
&& from_obj
!= val
)
5637 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5638 && TREE_CODE (val
) == TYPE_DECL
5639 && TREE_TYPE (from_obj
) != TREE_TYPE (val
))
5641 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5642 name
, got_object
, TREE_TYPE (from_obj
));
5643 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
5647 /* We don't change val to from_obj if got_object depends on
5648 template parms because that breaks implicit typename for
5649 destructor calls. */
5650 if (! uses_template_parms (got_object
))
5654 /* If we have a single function from a using decl, pull it out. */
5655 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5656 val
= OVL_FUNCTION (val
);
5665 lookup_name_nonclass (name
)
5668 return lookup_name_real (name
, 0, 1, 0);
5672 lookup_function_nonclass (name
, args
)
5676 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
5680 lookup_name_namespace_only (name
)
5683 /* type-or-namespace, nonclass, namespace_only */
5684 return lookup_name_real (name
, 1, 1, 1);
5688 lookup_name (name
, prefer_type
)
5692 return lookup_name_real (name
, prefer_type
, 0, 0);
5695 /* Similar to `lookup_name' but look only in the innermost non-class
5699 lookup_name_current_level (name
)
5702 struct binding_level
*b
;
5705 b
= current_binding_level
;
5706 while (b
->parm_flag
== 2)
5711 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
5713 /* extern "C" function() */
5714 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
5717 else if (IDENTIFIER_BINDING (name
)
5718 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
5722 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
5723 return IDENTIFIER_VALUE (name
);
5735 /* Like lookup_name_current_level, but for types. */
5738 lookup_type_current_level (name
)
5741 register tree t
= NULL_TREE
;
5743 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
5745 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
5746 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
5748 struct binding_level
*b
= current_binding_level
;
5751 if (purpose_member (name
, b
->type_shadowed
))
5752 return REAL_IDENTIFIER_TYPE_VALUE (name
);
5764 begin_only_namespace_names ()
5766 only_namespace_names
= 1;
5770 end_only_namespace_names ()
5772 only_namespace_names
= 0;
5775 /* Arrange for the user to get a source line number, even when the
5776 compiler is going down in flames, so that she at least has a
5777 chance of working around problems in the compiler. We used to
5778 call error(), but that let the segmentation fault continue
5779 through; now, it's much more passive by asking them to send the
5780 maintainers mail about the problem. */
5784 int sig ATTRIBUTE_UNUSED
;
5786 signal (SIGSEGV
, SIG_DFL
);
5788 signal (SIGIOT
, SIG_DFL
);
5791 signal (SIGILL
, SIG_DFL
);
5794 signal (SIGABRT
, SIG_DFL
);
5797 signal (SIGBUS
, SIG_DFL
);
5799 my_friendly_abort (0);
5802 /* Push the declarations of builtin types into the namespace.
5803 RID_INDEX, if < RID_MAX is the index of the builtin type
5804 in the array RID_POINTERS. NAME is the name used when looking
5805 up the builtin type. TYPE is the _TYPE node for the builtin type. */
5808 record_builtin_type (rid_index
, name
, type
)
5813 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
5814 tree tdecl
= NULL_TREE
;
5816 if ((int) rid_index
< (int) RID_MAX
)
5817 rname
= ridpointers
[(int) rid_index
];
5819 tname
= get_identifier (name
);
5821 TYPE_BUILT_IN (type
) = 1;
5825 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
5826 set_identifier_type_value (tname
, NULL_TREE
);
5827 if ((int) rid_index
< (int) RID_MAX
)
5828 /* Built-in types live in the global namespace. */
5829 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
5831 if (rname
!= NULL_TREE
)
5833 if (tname
!= NULL_TREE
)
5835 set_identifier_type_value (rname
, NULL_TREE
);
5836 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
5840 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
5841 set_identifier_type_value (rname
, NULL_TREE
);
5846 /* Record one of the standard Java types.
5847 * Declare it as having the given NAME.
5848 * If SIZE > 0, it is the size of one of the integral types;
5849 * otherwise it is the negative of the size of one of the other types. */
5852 record_builtin_java_type (name
, size
)
5858 type
= make_signed_type (size
);
5859 else if (size
> -32)
5860 { /* "__java_char" or ""__java_boolean". */
5861 type
= make_unsigned_type (-size
);
5862 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
5865 { /* "__java_float" or ""__java_double". */
5866 type
= make_node (REAL_TYPE
);
5867 TYPE_PRECISION (type
) = - size
;
5870 record_builtin_type (RID_MAX
, name
, type
);
5871 decl
= TYPE_NAME (type
);
5873 /* Suppress generate debug symbol entries for these types,
5874 since for normal C++ they are just clutter.
5875 However, push_lang_context undoes this if extern "Java" is seen. */
5876 DECL_IGNORED_P (decl
) = 1;
5878 TYPE_FOR_JAVA (type
) = 1;
5882 /* Push a type into the namespace so that the back-ends ignore it. */
5885 record_unknown_type (type
, name
)
5889 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
5890 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
5891 DECL_IGNORED_P (decl
) = 1;
5892 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
5893 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
5894 TYPE_ALIGN (type
) = 1;
5895 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
5898 /* Push overloaded decl, in global scope, with one argument so it
5899 can be used as a callback from define_function. */
5902 push_overloaded_decl_1 (x
)
5909 auto_function (name
, type
)
5912 return define_function
5913 (IDENTIFIER_POINTER (name
), type
, push_overloaded_decl_1
,
5914 IDENTIFIER_POINTER (build_decl_overload (name
, TYPE_ARG_TYPES (type
),
5918 /* Create the predefined scalar types of C,
5919 and some nodes representing standard constants (0, 1, (void *)0).
5920 Initialize the global binding level.
5921 Make definitions for built-in primitive functions. */
5924 init_decl_processing ()
5927 int wchar_type_size
;
5928 tree array_domain_type
;
5930 /* Have to make these distinct before we try using them. */
5931 lang_name_cplusplus
= get_identifier ("C++");
5932 lang_name_c
= get_identifier ("C");
5933 lang_name_java
= get_identifier ("Java");
5935 /* Let the back-end now how to save and restore language-specific
5936 per-function globals. */
5937 init_lang_status
= &push_cp_function_context
;
5938 free_lang_status
= &pop_cp_function_context
;
5939 mark_lang_status
= &mark_cp_function_context
;
5945 /* Create the global variables. */
5946 push_to_top_level ();
5948 /* Enter the global namespace. */
5949 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
5950 push_namespace (get_identifier ("::"));
5951 global_namespace
= current_namespace
;
5952 current_lang_name
= NULL_TREE
;
5954 if (flag_strict_prototype
== 2)
5955 flag_strict_prototype
= pedantic
;
5956 if (! flag_permissive
&& ! pedantic
)
5957 flag_pedantic_errors
= 1;
5959 strict_prototypes_lang_c
= flag_strict_prototype
;
5962 current_lang_name
= lang_name_c
;
5964 current_function_decl
= NULL_TREE
;
5965 current_binding_level
= NULL_BINDING_LEVEL
;
5966 free_binding_level
= NULL_BINDING_LEVEL
;
5968 /* Because most segmentation signals can be traced back into user
5969 code, catch them and at least give the user a chance of working
5970 around compiler bugs. */
5971 signal (SIGSEGV
, signal_catch
);
5973 /* We will also catch aborts in the back-end through signal_catch and
5974 give the user a chance to see where the error might be, and to defeat
5975 aborts in the back-end when there have been errors previously in their
5978 signal (SIGIOT
, signal_catch
);
5981 signal (SIGILL
, signal_catch
);
5984 signal (SIGABRT
, signal_catch
);
5987 signal (SIGBUS
, signal_catch
);
5990 build_common_tree_nodes (flag_signed_char
);
5992 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
5993 TREE_TYPE (error_mark_list
) = error_mark_node
;
5995 /* Make the binding_level structure for global names. */
5997 global_binding_level
= current_binding_level
;
5998 /* The global level is the namespace level of ::. */
5999 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6000 declare_namespace_level ();
6002 this_identifier
= get_identifier (THIS_NAME
);
6003 in_charge_identifier
= get_identifier (IN_CHARGE_NAME
);
6004 ctor_identifier
= get_identifier (CTOR_NAME
);
6005 dtor_identifier
= get_identifier (DTOR_NAME
);
6006 pfn_identifier
= get_identifier (VTABLE_PFN_NAME
);
6007 index_identifier
= get_identifier (VTABLE_INDEX_NAME
);
6008 delta_identifier
= get_identifier (VTABLE_DELTA_NAME
);
6009 delta2_identifier
= get_identifier (VTABLE_DELTA2_NAME
);
6010 pfn_or_delta2_identifier
= get_identifier ("__pfn_or_delta2");
6012 /* Define `int' and `char' first so that dbx will output them first. */
6013 record_builtin_type (RID_INT
, NULL_PTR
, integer_type_node
);
6014 record_builtin_type (RID_CHAR
, "char", char_type_node
);
6016 /* `signed' is the same as `int' */
6017 record_builtin_type (RID_SIGNED
, NULL_PTR
, integer_type_node
);
6018 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
6019 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
6020 record_builtin_type (RID_MAX
, "long unsigned int", long_unsigned_type_node
);
6021 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
6022 record_builtin_type (RID_MAX
, "long long int", long_long_integer_type_node
);
6023 record_builtin_type (RID_MAX
, "long long unsigned int",
6024 long_long_unsigned_type_node
);
6025 record_builtin_type (RID_MAX
, "long long unsigned",
6026 long_long_unsigned_type_node
);
6027 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
6028 record_builtin_type (RID_MAX
, "short unsigned int", short_unsigned_type_node
);
6029 record_builtin_type (RID_MAX
, "unsigned short", short_unsigned_type_node
);
6032 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE
)));
6034 /* Define both `signed char' and `unsigned char'. */
6035 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
6036 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
6038 /* `unsigned long' is the standard type for sizeof.
6039 Note that stddef.h uses `unsigned long',
6040 and this must agree, even if long and int are the same size. */
6042 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE
))));
6044 /* Create the widest literal types. */
6045 widest_integer_literal_type_node
= make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
6046 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6047 widest_integer_literal_type_node
));
6049 widest_unsigned_literal_type_node
= make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
6050 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6051 widest_unsigned_literal_type_node
));
6053 /* These are types that type_for_size and type_for_mode use. */
6054 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intQI_type_node
));
6055 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intHI_type_node
));
6056 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intSI_type_node
));
6057 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intDI_type_node
));
6058 #if HOST_BITS_PER_WIDE_INT >= 64
6059 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__int128_t"), intTI_type_node
));
6061 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intQI_type_node
));
6062 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intHI_type_node
));
6063 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intSI_type_node
));
6064 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intDI_type_node
));
6065 #if HOST_BITS_PER_WIDE_INT >= 64
6066 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__uint128_t"), unsigned_intTI_type_node
));
6069 build_common_tree_nodes_2 (flag_short_double
);
6071 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6072 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6073 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6074 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6075 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6076 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6077 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6078 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6080 integer_two_node
= build_int_2 (2, 0);
6081 TREE_TYPE (integer_two_node
) = integer_type_node
;
6082 integer_three_node
= build_int_2 (3, 0);
6083 TREE_TYPE (integer_three_node
) = integer_type_node
;
6085 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6086 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6087 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6088 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6089 TYPE_PRECISION (boolean_type_node
) = 1;
6090 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6091 boolean_false_node
= build_int_2 (0, 0);
6092 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6093 boolean_true_node
= build_int_2 (1, 0);
6094 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6096 signed_size_zero_node
= build_int_2 (0, 0); record_builtin_type (RID_FLOAT
, NULL_PTR
, float_type_node
);
6097 record_builtin_type (RID_DOUBLE
, NULL_PTR
, double_type_node
);
6098 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
6100 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex int"),
6101 complex_integer_type_node
));
6102 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex float"),
6103 complex_float_type_node
));
6104 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex double"),
6105 complex_double_type_node
));
6106 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
6107 complex_long_double_type_node
));
6109 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6111 record_builtin_type (RID_VOID
, NULL_PTR
, void_type_node
);
6112 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
6113 TREE_PARMLIST (void_list_node
) = 1;
6115 /* Used for expressions that do nothing, but are not errors. */
6116 void_zero_node
= build_int_2 (0, 0);
6117 TREE_TYPE (void_zero_node
) = void_type_node
;
6119 string_type_node
= build_pointer_type (char_type_node
);
6120 const_string_type_node
6121 = build_pointer_type (build_qualified_type (char_type_node
,
6123 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6125 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
6128 /* Make a type to be the domain of a few array types
6129 whose domains don't really matter.
6130 200 is small enough that it always fits in size_t
6131 and large enough that it can hold most function names for the
6132 initializations of __FUNCTION__ and __PRETTY_FUNCTION__. */
6133 array_domain_type
= build_index_type (build_int_2 (200, 0));
6135 /* Make a type for arrays of characters.
6136 With luck nothing will ever really depend on the length of this
6138 char_array_type_node
6139 = build_array_type (char_type_node
, array_domain_type
);
6140 /* Likewise for arrays of ints. */
6142 = build_array_type (integer_type_node
, array_domain_type
);
6144 /* This is just some anonymous class type. Nobody should ever
6145 need to look inside this envelope. */
6146 class_star_type_node
= build_pointer_type (make_lang_type (RECORD_TYPE
));
6148 if (flag_huge_objects
)
6149 delta_type_node
= long_integer_type_node
;
6151 delta_type_node
= short_integer_type_node
;
6153 default_function_type
6154 = build_function_type (integer_type_node
, NULL_TREE
);
6156 ptr_type_node
= build_pointer_type (void_type_node
);
6158 = build_pointer_type (build_qualified_type (void_type_node
,
6160 c_common_nodes_and_builtins (1, flag_no_builtin
, flag_no_nonansi_builtin
);
6161 lang_type_promotes_to
= convert_type_from_ellipsis
;
6164 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6166 /* C++ extensions */
6168 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6169 record_unknown_type (unknown_type_node
, "unknown type");
6171 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6172 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6174 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6176 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6178 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6179 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6181 /* This is special for C++ so functions can be overloaded. */
6182 wchar_type_node
= get_identifier (flag_short_wchar
6183 ? "short unsigned int"
6185 wchar_type_node
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (wchar_type_node
));
6186 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
6187 signed_wchar_type_node
= make_signed_type (wchar_type_size
);
6188 unsigned_wchar_type_node
= make_unsigned_type (wchar_type_size
);
6190 = TREE_UNSIGNED (wchar_type_node
)
6191 ? unsigned_wchar_type_node
6192 : signed_wchar_type_node
;
6193 record_builtin_type (RID_WCHAR
, "__wchar_t", wchar_type_node
);
6195 /* Artificial declaration of wchar_t -- can be bashed */
6196 wchar_decl_node
= build_decl (TYPE_DECL
, get_identifier ("wchar_t"),
6198 pushdecl (wchar_decl_node
);
6200 /* This is for wide string constants. */
6201 wchar_array_type_node
6202 = build_array_type (wchar_type_node
, array_domain_type
);
6204 if (flag_vtable_thunks
)
6206 /* Make sure we get a unique function type, so we can give
6207 its pointer type a name. (This wins for gdb.) */
6208 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6209 TREE_TYPE (vfunc_type
) = integer_type_node
;
6210 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6211 layout_type (vfunc_type
);
6213 vtable_entry_type
= build_pointer_type (vfunc_type
);
6217 vtable_entry_type
= make_lang_type (RECORD_TYPE
);
6218 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
6220 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
6222 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_identifier
,
6224 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6227 /* Make this part of an invisible union. */
6228 fields
[3] = copy_node (fields
[2]);
6229 TREE_TYPE (fields
[3]) = delta_type_node
;
6230 DECL_NAME (fields
[3]) = delta2_identifier
;
6231 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6232 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6233 TREE_UNSIGNED (fields
[3]) = 0;
6234 TREE_CHAIN (fields
[2]) = fields
[3];
6235 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6238 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6241 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6242 layout_type (vtbl_type_node
);
6243 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6244 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6245 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6246 layout_type (vtbl_ptr_type_node
);
6247 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6249 std_node
= build_decl (NAMESPACE_DECL
,
6250 get_identifier (flag_honor_std
? "fake std":"std"),
6252 pushdecl (std_node
);
6254 global_type_node
= make_node (LANG_TYPE
);
6255 record_unknown_type (global_type_node
, "global type");
6258 current_lang_name
= lang_name_cplusplus
;
6261 tree bad_alloc_type_node
, newtype
, deltype
;
6263 push_namespace (get_identifier ("std"));
6264 bad_alloc_type_node
= xref_tag
6265 (class_type_node
, get_identifier ("bad_alloc"), 1);
6268 newtype
= build_exception_variant
6269 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6270 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6271 auto_function (ansi_opname
[(int) NEW_EXPR
], newtype
);
6272 auto_function (ansi_opname
[(int) VEC_NEW_EXPR
], newtype
);
6273 global_delete_fndecl
= auto_function (ansi_opname
[(int) DELETE_EXPR
],
6275 auto_function (ansi_opname
[(int) VEC_DELETE_EXPR
], deltype
);
6279 = define_function ("__pure_virtual", void_ftype
, 0, 0);
6281 /* Perform other language dependent initializations. */
6282 init_class_processing ();
6283 init_init_processing ();
6284 init_search_processing ();
6285 init_rtti_processing ();
6287 if (flag_exceptions
)
6288 init_exception_processing ();
6291 flag_inline_functions
= 0;
6294 if (! supports_one_only ())
6297 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6298 declare_function_name ();
6300 /* Prepare to check format strings against argument lists. */
6301 init_function_format_info ();
6303 /* Show we use EH for cleanups. */
6304 using_eh_for_cleanups ();
6306 print_error_function
= lang_print_error_function
;
6307 lang_get_alias_set
= &c_get_alias_set
;
6308 valid_lang_attribute
= cp_valid_lang_attribute
;
6310 /* Maintain consistency. Perhaps we should just complain if they
6311 say -fwritable-strings? */
6312 if (flag_writable_strings
)
6313 flag_const_strings
= 0;
6315 /* Add GC roots for all of our global variables. */
6316 ggc_add_tree_root (c_global_trees
, sizeof c_global_trees
/ sizeof(tree
));
6317 ggc_add_tree_root (cp_global_trees
, sizeof cp_global_trees
/ sizeof(tree
));
6318 ggc_add_tree_root (&integer_three_node
, 1);
6319 ggc_add_tree_root (&integer_two_node
, 1);
6320 ggc_add_tree_root (&signed_size_zero_node
, 1);
6321 ggc_add_tree_root (&size_one_node
, 1);
6322 ggc_add_tree_root (&size_zero_node
, 1);
6323 ggc_add_root (&global_binding_level
, 1, sizeof global_binding_level
,
6324 mark_binding_level
);
6325 ggc_add_root (&scope_chain
, 1, sizeof scope_chain
, &mark_saved_scope
);
6326 ggc_add_tree_root (&static_ctors
, 1);
6327 ggc_add_tree_root (&static_dtors
, 1);
6328 ggc_add_tree_root (&lastiddecl
, 1);
6330 ggc_add_tree_root (&last_function_parm_tags
, 1);
6331 ggc_add_tree_root (¤t_function_return_value
, 1);
6332 ggc_add_tree_root (¤t_function_parms
, 1);
6333 ggc_add_tree_root (¤t_function_parm_tags
, 1);
6334 ggc_add_tree_root (&last_function_parms
, 1);
6335 ggc_add_tree_root (&error_mark_list
, 1);
6337 ggc_add_tree_root (&global_namespace
, 1);
6338 ggc_add_tree_root (&global_type_node
, 1);
6339 ggc_add_tree_root (&anonymous_namespace_name
, 1);
6341 ggc_add_tree_root (&got_object
, 1);
6342 ggc_add_tree_root (&got_scope
, 1);
6344 ggc_add_tree_root (¤t_lang_name
, 1);
6345 ggc_add_tree_root (&static_aggregates
, 1);
6348 /* Function to print any language-specific context for an error message. */
6351 lang_print_error_function (file
)
6354 default_print_error_function (file
);
6355 maybe_print_template_context ();
6358 /* Make a definition for a builtin function named NAME and whose data type
6359 is TYPE. TYPE should be a function type with argument types.
6361 If LIBRARY_NAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6362 the name to be called if we can't opencode the function. */
6365 define_function (name
, type
, pfn
, library_name
)
6368 void (*pfn
) PROTO((tree
));
6369 const char *library_name
;
6371 tree decl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), type
);
6372 DECL_EXTERNAL (decl
) = 1;
6373 TREE_PUBLIC (decl
) = 1;
6374 DECL_ARTIFICIAL (decl
) = 1;
6376 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6377 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
6379 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6380 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6381 function in the namespace. */
6382 if (pfn
) (*pfn
) (decl
);
6384 DECL_ASSEMBLER_NAME (decl
) = get_identifier (library_name
);
6385 make_function_rtl (decl
);
6390 /* Wrapper around define_function, for the benefit of
6391 c_common_nodes_and_builtins.
6392 FUNCTION_CODE tells later passes how to compile calls to this function.
6393 See tree.h for its possible values. */
6396 builtin_function (name
, type
, code
, class, libname
)
6400 enum built_in_class
class;
6401 const char *libname
;
6403 tree decl
= define_function (name
, type
, (void (*) PROTO((tree
)))pushdecl
,
6405 DECL_BUILT_IN_CLASS (decl
) = class;
6406 DECL_FUNCTION_CODE (decl
) = code
;
6410 /* When we call finish_struct for an anonymous union, we create
6411 default copy constructors and such. But, an anonymous union
6412 shouldn't have such things; this function undoes the damage to the
6413 anonymous union type T.
6415 (The reason that we create the synthesized methods is that we don't
6416 distinguish `union { int i; }' from `typedef union { int i; } U'.
6417 The first is an anonymous union; the second is just an ordinary
6421 fixup_anonymous_aggr (t
)
6426 /* Wipe out memory of synthesized methods */
6427 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6428 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6429 TYPE_HAS_INIT_REF (t
) = 0;
6430 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6431 TYPE_HAS_ASSIGN_REF (t
) = 0;
6432 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6434 /* Splice the implicitly generated functions out of the TYPE_METHODS
6436 q
= &TYPE_METHODS (t
);
6439 if (DECL_ARTIFICIAL (*q
))
6440 *q
= TREE_CHAIN (*q
);
6442 q
= &TREE_CHAIN (*q
);
6445 /* ANSI C++ June 5 1992 WP 9.5.3. Anonymous unions may not have
6446 function members. */
6447 if (TYPE_METHODS (t
))
6448 error ("an anonymous union cannot have function members");
6451 /* Make sure that a declaration with no declarator is well-formed, i.e.
6452 just defines a tagged type or anonymous union.
6454 Returns the type defined, if any. */
6457 check_tag_decl (declspecs
)
6461 tree ob_modifier
= NULL_TREE
;
6463 register tree t
= NULL_TREE
;
6465 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6467 register tree value
= TREE_VALUE (link
);
6473 if (IS_AGGR_TYPE (value
) || TREE_CODE (value
) == ENUMERAL_TYPE
)
6475 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6479 else if (value
== ridpointers
[(int) RID_FRIEND
])
6481 if (current_class_type
== NULL_TREE
6482 || current_scope () != current_class_type
)
6483 ob_modifier
= value
;
6485 else if (value
== ridpointers
[(int) RID_STATIC
]
6486 || value
== ridpointers
[(int) RID_EXTERN
]
6487 || value
== ridpointers
[(int) RID_AUTO
]
6488 || value
== ridpointers
[(int) RID_REGISTER
]
6489 || value
== ridpointers
[(int) RID_INLINE
]
6490 || value
== ridpointers
[(int) RID_VIRTUAL
]
6491 || value
== ridpointers
[(int) RID_CONST
]
6492 || value
== ridpointers
[(int) RID_VOLATILE
]
6493 || value
== ridpointers
[(int) RID_EXPLICIT
])
6494 ob_modifier
= value
;
6498 error ("multiple types in one declaration");
6500 /* Inside a class, we might be in a friend or access declaration.
6501 Until we have a good way of detecting the latter, don't warn. */
6502 if (t
== NULL_TREE
&& ! current_class_type
)
6503 pedwarn ("declaration does not declare anything");
6505 /* Check for an anonymous union. We're careful
6506 accessing TYPE_IDENTIFIER because some built-in types, like
6507 pointer-to-member types, do not have TYPE_NAME. */
6508 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
6510 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
6512 /* Anonymous unions are objects, so they can have specifiers. */;
6513 SET_ANON_AGGR_TYPE_P (t
);
6515 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
6516 pedwarn ("ISO C++ prohibits anonymous structs");
6519 else if (ob_modifier
)
6521 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
6522 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
6523 cp_error ("`%D' can only be specified for functions", ob_modifier
);
6524 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
6525 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
6526 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
6527 cp_error ("`%D' can only be specified for constructors",
6530 cp_error ("`%D' can only be specified for objects and functions",
6537 /* Called when a declaration is seen that contains no names to declare.
6538 If its type is a reference to a structure, union or enum inherited
6539 from a containing scope, shadow that tag name for the current scope
6540 with a forward reference.
6541 If its type defines a new named structure or union
6542 or defines an enum, it is valid but we need not do anything here.
6543 Otherwise, it is an error.
6545 C++: may have to grok the declspecs to learn about static,
6546 complain for anonymous unions. */
6549 shadow_tag (declspecs
)
6552 tree t
= check_tag_decl (declspecs
);
6555 maybe_process_partial_specialization (t
);
6557 /* This is where the variables in an anonymous union are
6558 declared. An anonymous union declaration looks like:
6560 because there is no declarator after the union, the parser
6561 sends that declaration here. */
6562 if (t
&& ANON_AGGR_TYPE_P (t
))
6564 fixup_anonymous_aggr (t
);
6566 if (TYPE_FIELDS (t
))
6568 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
6570 finish_anon_union (decl
);
6575 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6578 groktypename (typename
)
6581 if (TREE_CODE (typename
) != TREE_LIST
)
6583 return grokdeclarator (TREE_VALUE (typename
),
6584 TREE_PURPOSE (typename
),
6585 TYPENAME
, 0, NULL_TREE
);
6588 /* Decode a declarator in an ordinary declaration or data definition.
6589 This is called as soon as the type information and variable name
6590 have been parsed, before parsing the initializer if any.
6591 Here we create the ..._DECL node, fill in its type,
6592 and put it on the list of decls for the current context.
6593 The ..._DECL node is returned as the value.
6595 Exception: for arrays where the length is not specified,
6596 the type is left null, to be filled in by `cp_finish_decl'.
6598 Function definitions do not come here; they go to start_function
6599 instead. However, external and forward declarations of functions
6600 do go through here. Structure field declarations are done by
6601 grokfield and not through here. */
6603 /* Set this to zero to debug not using the temporary obstack
6604 to parse initializers. */
6605 int debug_temp_inits
= 1;
6608 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
6609 tree declarator
, declspecs
;
6611 tree attributes
, prefix_attributes
;
6614 register tree type
, tem
;
6616 extern int have_extern_spec
;
6617 extern int used_extern_spec
;
6621 /* See code below that used this. */
6622 int init_written
= initialized
;
6625 /* This should only be done once on the top most decl. */
6626 if (have_extern_spec
&& !used_extern_spec
)
6628 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"),
6630 used_extern_spec
= 1;
6633 if (attributes
|| prefix_attributes
)
6634 attrlist
= build_scratch_list (attributes
, prefix_attributes
);
6636 attrlist
= NULL_TREE
;
6638 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
6641 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
6644 type
= TREE_TYPE (decl
);
6646 if (type
== error_mark_node
)
6650 = (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
6651 ? DECL_CLASS_CONTEXT (decl
)
6652 : DECL_CONTEXT (decl
);
6654 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
6655 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
6657 /* When parsing the initializer, lookup should use the object's
6659 push_decl_namespace (context
);
6662 /* We are only interested in class contexts, later. */
6663 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
6664 context
= NULL_TREE
;
6667 /* Is it valid for this decl to have an initializer at all?
6668 If not, set INITIALIZED to zero, which will indirectly
6669 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6670 switch (TREE_CODE (decl
))
6673 /* typedef foo = bar means give foo the same type as bar.
6674 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
6675 Any other case of an initialization in a TYPE_DECL is an error. */
6676 if (pedantic
|| list_length (declspecs
) > 1)
6678 cp_error ("typedef `%D' is initialized", decl
);
6684 cp_error ("function `%#D' is initialized like a variable", decl
);
6694 if (! toplevel_bindings_p ()
6695 && DECL_EXTERNAL (decl
))
6696 cp_warning ("declaration of `%#D' has `extern' and is initialized",
6698 DECL_EXTERNAL (decl
) = 0;
6699 if (toplevel_bindings_p ())
6700 TREE_STATIC (decl
) = 1;
6702 /* Tell `pushdecl' this is an initialized decl
6703 even though we don't yet have the initializer expression.
6704 Also tell `cp_finish_decl' it may store the real initializer. */
6705 DECL_INITIAL (decl
) = error_mark_node
;
6708 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
6709 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
6712 /* Set attributes here so if duplicate decl, will have proper attributes. */
6713 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
6715 if (context
&& TYPE_SIZE (complete_type (context
)) != NULL_TREE
)
6717 push_nested_class (context
, 2);
6719 if (TREE_CODE (decl
) == VAR_DECL
)
6721 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
6722 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
6723 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
6726 if (DECL_CONTEXT (field
) != context
)
6728 cp_pedwarn ("ANSI C++ does not permit `%T::%D' to be defined as `%T::%D'",
6729 DECL_CONTEXT (field
), DECL_NAME (decl
),
6730 context
, DECL_NAME (decl
));
6731 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
6733 /* Static data member are tricky; an in-class initialization
6734 still doesn't provide a definition, so the in-class
6735 declaration will have DECL_EXTERNAL set, but will have an
6736 initialization. Thus, duplicate_decls won't warn
6737 about this situation, and so we check here. */
6738 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
6739 cp_error ("duplicate initialization of %D", decl
);
6740 if (duplicate_decls (decl
, field
))
6746 tree field
= check_classfn (context
, decl
);
6747 if (field
&& duplicate_decls (decl
, field
))
6751 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
6752 DECL_IN_AGGR_P (decl
) = 0;
6753 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
6754 || CLASSTYPE_USE_TEMPLATE (context
))
6756 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
6757 /* [temp.expl.spec] An explicit specialization of a static data
6758 member of a template is a definition if the declaration
6759 includes an initializer; otherwise, it is a declaration.
6761 We check for processing_specialization so this only applies
6762 to the new specialization syntax. */
6763 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
6764 DECL_EXTERNAL (decl
) = 1;
6767 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
6768 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
6772 /* Enter this declaration into the symbol table. */
6773 tem
= maybe_push_decl (decl
);
6775 if (processing_template_decl
)
6776 tem
= push_template_decl (tem
);
6778 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
6779 /* Tell the back-end to use or not use .common as appropriate. If we say
6780 -fconserve-space, we want this to save .data space, at the expense of
6781 wrong semantics. If we say -fno-conserve-space, we want this to
6782 produce errors about redefs; to do this we force variables into the
6784 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
6787 if (! processing_template_decl
)
6797 tree type
= TREE_TYPE (decl
);
6798 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
6800 if (type
== error_mark_node
)
6803 /* If this type of object needs a cleanup, but we're not allowed to
6804 add any more objects with cleanups to the current scope, create a
6805 new binding level. */
6806 if (TYPE_NEEDS_DESTRUCTOR (type
)
6807 && current_binding_level
->more_cleanups_ok
== 0)
6809 keep_next_level (2);
6812 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/1);
6816 /* Is it valid for this decl to have an initializer at all?
6817 If not, set INITIALIZED to zero, which will indirectly
6818 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6820 /* Don't allow initializations for incomplete types except for
6821 arrays which might be completed by the initialization. */
6822 if (TYPE_SIZE (complete_type (type
)) != NULL_TREE
)
6823 ; /* A complete type is ok. */
6824 else if (TREE_CODE (type
) != ARRAY_TYPE
)
6826 cp_error ("variable `%#D' has initializer but incomplete type",
6829 type
= TREE_TYPE (decl
) = error_mark_node
;
6831 else if (TYPE_SIZE (complete_type (TREE_TYPE (type
))) == NULL_TREE
)
6833 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
6834 cp_error ("elements of array `%#D' have incomplete type", decl
);
6835 /* else we already gave an error in start_decl. */
6841 && TREE_CODE (decl
) != TYPE_DECL
6842 && TREE_CODE (decl
) != TEMPLATE_DECL
6843 && IS_AGGR_TYPE (type
) && ! DECL_EXTERNAL (decl
))
6845 if ((! processing_template_decl
|| ! uses_template_parms (type
))
6846 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
6848 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
6850 /* Change the type so that assemble_variable will give
6851 DECL an rtl we can live with: (mem (const_int 0)). */
6852 type
= TREE_TYPE (decl
) = error_mark_node
;
6856 /* If any base type in the hierarchy of TYPE needs a constructor,
6857 then we set initialized to 1. This way any nodes which are
6858 created for the purposes of initializing this aggregate
6859 will live as long as it does. This is necessary for global
6860 aggregates which do not have their initializers processed until
6861 the end of the file. */
6862 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
6867 DECL_INITIAL (decl
) = NULL_TREE
;
6870 /* Handle initialization of references.
6871 These three arguments are from `cp_finish_decl', and have the
6872 same meaning here that they do there.
6874 Quotes on semantics can be found in ARM 8.4.3. */
6877 grok_reference_init (decl
, type
, init
)
6878 tree decl
, type
, init
;
6882 if (init
== NULL_TREE
)
6884 if ((DECL_LANG_SPECIFIC (decl
) == 0
6885 || DECL_IN_AGGR_P (decl
) == 0)
6886 && ! DECL_THIS_EXTERN (decl
))
6887 cp_error ("`%D' declared as reference but not initialized", decl
);
6891 if (init
== error_mark_node
)
6894 if (TREE_CODE (init
) == CONSTRUCTOR
)
6896 cp_error ("ANSI C++ forbids use of initializer list to initialize reference `%D'", decl
);
6900 if (TREE_CODE (init
) == TREE_LIST
)
6901 init
= build_compound_expr (init
);
6903 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
6904 init
= convert_from_reference (init
);
6906 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
6907 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
6909 /* Note: default conversion is only called in very special cases. */
6910 init
= default_conversion (init
);
6913 /* Convert INIT to the reference type TYPE. This may involve the
6914 creation of a temporary, whose lifetime must be the same as that
6915 of the reference. If so, a DECL_STMT for the temporary will be
6916 added just after the DECL_STMT for DECL. That's why we don't set
6917 DECL_INITIAL for local references (instead assigning to them
6918 explicitly); we need to allow the temporary to be initialized
6920 tmp
= convert_to_reference
6921 (type
, init
, CONV_IMPLICIT
,
6922 LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
, decl
);
6924 if (tmp
== error_mark_node
)
6926 else if (tmp
!= NULL_TREE
)
6929 tmp
= save_expr (tmp
);
6930 if (building_stmt_tree ())
6932 /* Initialize the declaration. */
6933 tmp
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, tmp
);
6934 finish_expr_stmt (tmp
);
6937 DECL_INITIAL (decl
) = tmp
;
6941 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
6945 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
6947 expand_static_init (decl
, DECL_INITIAL (decl
));
6948 DECL_INITIAL (decl
) = NULL_TREE
;
6953 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
6954 mucking with forces it does not comprehend (i.e. initialization with a
6955 constructor). If we are at global scope and won't go into COMMON, fill
6956 it in with a dummy CONSTRUCTOR to force the variable into .data;
6957 otherwise we can use error_mark_node. */
6960 obscure_complex_init (decl
, init
)
6963 if (! flag_no_inline
&& TREE_STATIC (decl
))
6965 if (extract_init (decl
, init
))
6969 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
6970 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
6971 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
6975 DECL_INITIAL (decl
) = error_mark_node
;
6980 /* When parsing `int a[] = {1, 2};' we don't know the size of the
6981 array until we finish parsing the initializer. If that's the
6982 situation we're in, update DECL accordingly. */
6985 maybe_deduce_size_from_array_init (decl
, init
)
6989 tree type
= TREE_TYPE (decl
);
6991 if (TREE_CODE (type
) == ARRAY_TYPE
6992 && TYPE_DOMAIN (type
) == NULL_TREE
6993 && TREE_CODE (decl
) != TYPE_DECL
)
6996 = (TREE_STATIC (decl
)
6997 /* Even if pedantic, an external linkage array
6998 may have incomplete type at first. */
6999 ? pedantic
&& ! DECL_EXTERNAL (decl
)
7000 : !DECL_EXTERNAL (decl
));
7001 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7002 int failure
= complete_array_type (type
, initializer
, do_default
);
7005 cp_error ("initializer fails to determine size of `%D'", decl
);
7010 cp_error ("array size missing in `%D'", decl
);
7011 /* If a `static' var's size isn't known, make it extern as
7012 well as static, so it does not get allocated. If it's not
7013 `static', then don't mark it extern; finish_incomplete_decl
7014 will give it a default size and it will get allocated. */
7015 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7016 DECL_EXTERNAL (decl
) = 1;
7019 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7020 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7022 cp_error ("zero-size array `%D'", decl
);
7024 layout_decl (decl
, 0);
7028 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7029 any appropriate error messages regarding the layout. */
7032 layout_var_decl (decl
)
7035 tree type
= TREE_TYPE (decl
);
7036 tree ttype
= target_type (type
);
7038 /* If we haven't already layed out this declaration, do so now.
7039 Note that we must not call complete type for an external object
7040 because it's type might involve templates that we are not
7041 supposed to isntantiate yet. (And it's perfectly legal to say
7042 `extern X x' for some incomplete type `X'.) */
7043 if (!DECL_EXTERNAL (decl
))
7044 complete_type (type
);
7045 if (!DECL_SIZE (decl
)&& TYPE_SIZE (type
))
7046 layout_decl (decl
, 0);
7048 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7050 /* An automatic variable with an incomplete type: that is an error.
7051 Don't talk about array types here, since we took care of that
7052 message in grokdeclarator. */
7053 cp_error ("storage size of `%D' isn't known", decl
);
7054 TREE_TYPE (decl
) = error_mark_node
;
7057 /* Keep this code around in case we later want to control debug info
7058 based on whether a type is "used". (jason 1999-11-11) */
7060 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7061 /* Let debugger know it should output info for this type. */
7062 note_debug_info_needed (ttype
);
7064 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7065 note_debug_info_needed (DECL_CONTEXT (decl
));
7068 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7069 && DECL_SIZE (decl
) != NULL_TREE
7070 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7072 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7073 constant_expression_warning (DECL_SIZE (decl
));
7075 cp_error ("storage size of `%D' isn't constant", decl
);
7079 /* If a local static variable is declared in an inline function, or if
7080 we have a weak definition, we must endeavor to create only one
7081 instance of the variable at link-time. */
7084 maybe_commonize_var (decl
)
7087 /* Static data in a function with comdat linkage also has comdat
7089 if (TREE_STATIC (decl
)
7090 /* Don't mess with __FUNCTION__. */
7091 && ! TREE_ASM_WRITTEN (decl
)
7092 && current_function_decl
7093 && DECL_CONTEXT (decl
) == current_function_decl
7094 && (DECL_THIS_INLINE (current_function_decl
)
7095 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7096 && TREE_PUBLIC (current_function_decl
))
7098 /* Rather than try to get this right with inlining, we suppress
7099 inlining of such functions. */
7100 current_function_cannot_inline
7101 = "function with static variable cannot be inline";
7103 /* If flag_weak, we don't need to mess with this, as we can just
7104 make the function weak, and let it refer to its unique local
7105 copy. This works because we don't allow the function to be
7109 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7111 TREE_PUBLIC (decl
) = 1;
7112 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7114 else if (DECL_INITIAL (decl
) == NULL_TREE
7115 || DECL_INITIAL (decl
) == error_mark_node
)
7117 TREE_PUBLIC (decl
) = 1;
7118 DECL_COMMON (decl
) = 1;
7120 /* else we lose. We can only do this if we can use common,
7121 which we can't if it has been initialized. */
7123 if (TREE_PUBLIC (decl
))
7124 DECL_ASSEMBLER_NAME (decl
)
7125 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7126 else if (! DECL_ARTIFICIAL (decl
))
7128 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7129 cp_warning_at (" you can work around this by removing the initializer", decl
);
7133 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7134 /* Set it up again; we might have set DECL_INITIAL since the last
7136 comdat_linkage (decl
);
7139 /* Issue an error message if DECL is an uninitialized const variable. */
7142 check_for_uninitialized_const_var (decl
)
7145 tree type
= TREE_TYPE (decl
);
7147 /* ``Unless explicitly declared extern, a const object does not have
7148 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7150 if (TREE_CODE (decl
) == VAR_DECL
7151 && TREE_CODE (type
) != REFERENCE_TYPE
7152 && CP_TYPE_CONST_P (type
)
7153 && !TYPE_NEEDS_CONSTRUCTING (type
)
7154 && !DECL_INITIAL (decl
))
7155 cp_error ("uninitialized const `%D'", decl
);
7158 /* Verify INIT (the initializer for DECL), and record the
7159 initialization in DECL_INITIAL, if appropriate. Returns a new
7163 check_initializer (decl
, init
)
7169 if (TREE_CODE (decl
) == FIELD_DECL
)
7172 type
= TREE_TYPE (decl
);
7174 /* If `start_decl' didn't like having an initialization, ignore it now. */
7175 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7178 /* Check the initializer. */
7181 /* Things that are going to be initialized need to have complete
7183 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7185 if (type
== error_mark_node
)
7186 /* We will have already complained. */
7188 else if (TYPE_SIZE (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7190 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7193 else if (TREE_CODE (type
) == ARRAY_TYPE
7194 && !TYPE_SIZE (TREE_TYPE (type
)))
7196 cp_error ("elements of array `%#D' have incomplete type", decl
);
7199 else if (!TYPE_SIZE (type
))
7201 cp_error ("`%D' has incomplete type", decl
);
7202 TREE_TYPE (decl
) = error_mark_node
;
7207 if (TREE_CODE (decl
) == CONST_DECL
)
7209 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7211 DECL_INITIAL (decl
) = init
;
7213 /* This will keep us from needing to worry about our obstacks. */
7214 my_friendly_assert (init
!= NULL_TREE
, 149);
7217 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7219 if (TREE_STATIC (decl
))
7220 make_decl_rtl (decl
, NULL_PTR
, toplevel_bindings_p ());
7221 grok_reference_init (decl
, type
, init
);
7226 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7228 if (TREE_CODE (type
) == ARRAY_TYPE
)
7229 init
= digest_init (type
, init
, (tree
*) 0);
7230 else if (TREE_CODE (init
) == CONSTRUCTOR
7231 && TREE_HAS_CONSTRUCTOR (init
))
7233 if (TYPE_NON_AGGREGATE_CLASS (type
))
7235 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7237 init
= error_mark_node
;
7240 goto dont_use_constructor
;
7245 dont_use_constructor
:
7246 if (TREE_CODE (init
) != TREE_VEC
)
7247 init
= store_init_value (decl
, init
);
7251 /* We must hide the initializer so that expand_decl
7252 won't try to do something it does not understand. */
7253 init
= obscure_complex_init (decl
, init
);
7255 else if (DECL_EXTERNAL (decl
))
7257 else if (TREE_CODE_CLASS (TREE_CODE (type
)) == 't'
7258 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7260 tree core_type
= strip_array_types (type
);
7262 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7264 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7265 cp_error ("structure `%D' with uninitialized const members", decl
);
7266 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7267 cp_error ("structure `%D' with uninitialized reference members",
7271 check_for_uninitialized_const_var (decl
);
7273 if (TYPE_SIZE (type
) != NULL_TREE
7274 && TYPE_NEEDS_CONSTRUCTING (type
))
7275 init
= obscure_complex_init (decl
, NULL_TREE
);
7279 check_for_uninitialized_const_var (decl
);
7284 /* If DECL is not a local variable, give it RTL. */
7287 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
7290 const char *asmspec
;
7295 type
= TREE_TYPE (decl
);
7296 toplev
= toplevel_bindings_p ();
7298 /* Handle non-variables up front. */
7299 if (TREE_CODE (decl
) != VAR_DECL
)
7301 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7305 /* Set the DECL_ASSEMBLER_NAME for the variable. */
7307 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7309 if (DECL_VIRTUAL_P (decl
))
7310 make_decl_rtl (decl
, NULL_PTR
, toplev
);
7311 else if (TREE_READONLY (decl
)
7312 && DECL_INITIAL (decl
) != NULL_TREE
7313 && DECL_INITIAL (decl
) != error_mark_node
7314 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
7316 DECL_INITIAL (decl
) = save_expr (DECL_INITIAL (decl
));
7318 if (toplev
&& ! TREE_PUBLIC (decl
))
7320 /* If this is a static const, change its apparent linkage
7321 if it belongs to a #pragma interface. */
7322 if (!interface_unknown
)
7324 TREE_PUBLIC (decl
) = 1;
7325 DECL_EXTERNAL (decl
) = interface_only
;
7327 make_decl_rtl (decl
, asmspec
, toplev
);
7330 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7332 else if (DECL_LANG_SPECIFIC (decl
) && DECL_IN_AGGR_P (decl
))
7334 my_friendly_assert (TREE_STATIC (decl
), 19990828);
7336 if (init
== NULL_TREE
7337 #ifdef DEFAULT_STATIC_DEFS
7338 /* If this code is dead, then users must
7339 explicitly declare static member variables
7340 outside the class def'n as well. */
7341 && TYPE_NEEDS_CONSTRUCTING (type
)
7345 DECL_EXTERNAL (decl
) = 1;
7346 make_decl_rtl (decl
, asmspec
, 1);
7349 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7351 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7352 || (TREE_CODE (decl
) == VAR_DECL
&& TREE_STATIC (decl
)))
7353 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7356 /* Create RTL for the local static variable DECL. */
7359 make_rtl_for_local_static (decl
)
7362 tree type
= TREE_TYPE (decl
);
7363 const char *asmspec
= NULL
;
7365 if (TREE_READONLY (decl
)
7366 && DECL_INITIAL (decl
) != NULL_TREE
7367 && DECL_INITIAL (decl
) != error_mark_node
7368 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
))
7369 && ! TREE_SIDE_EFFECTS (decl
)
7370 && ! TREE_PUBLIC (decl
)
7371 && ! DECL_EXTERNAL (decl
)
7372 && ! TYPE_NEEDS_DESTRUCTOR (type
)
7373 && ! TREE_ADDRESSABLE (decl
)
7374 && DECL_MODE (decl
) != BLKmode
)
7376 /* As an optimization, we try to put register-sized static
7377 constants in a register, rather than writing them out. If we
7378 take the address of the constant later, we'll make RTL for it
7380 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
7381 store_expr (DECL_INITIAL (decl
), DECL_RTL (decl
), 0);
7382 TREE_ASM_WRITTEN (decl
) = 1;
7386 if (DECL_ASSEMBLER_NAME (decl
) != DECL_NAME (decl
))
7388 /* The only way this situaton can occur is if the
7389 user specified a name for this DECL using the
7390 `attribute' syntax. */
7391 asmspec
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
7392 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
7395 rest_of_decl_compilation (decl
, asmspec
, /*top_level=*/0, /*at_end=*/0);
7398 /* The old ARM scoping rules injected variables declared in the
7399 initialization statement of a for-statement into the surrounding
7400 scope. We support this usage, in order to be backward-compatible.
7401 DECL is a just-declared VAR_DECL; if necessary inject its
7402 declaration into the surrounding scope. */
7405 maybe_inject_for_scope_var (decl
)
7408 if (current_binding_level
->is_for_scope
)
7410 struct binding_level
*outer
7411 = current_binding_level
->level_chain
;
7413 /* Check to see if the same name is already bound at the outer
7414 level, either because it was directly declared, or because a
7415 dead for-decl got preserved. In either case, the code would
7416 not have been valid under the ARM scope rules, so clear
7417 is_for_scope for the current_binding_level.
7419 Otherwise, we need to preserve the temp slot for decl to last
7420 into the outer binding level. */
7423 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7425 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7426 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7428 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7430 BINDING_VALUE (outer_binding
)
7431 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7432 current_binding_level
->is_for_scope
= 0;
7434 else if (DECL_IN_MEMORY_P (decl
))
7435 preserve_temp_slots (DECL_RTL (decl
));
7439 /* Generate code to initialize DECL (a local variable). */
7442 initialize_local_var (decl
, init
, flags
)
7447 tree type
= TREE_TYPE (decl
);
7449 /* If the type is bogus, don't bother initializing the variable. */
7450 if (type
== error_mark_node
)
7453 if (DECL_SIZE (decl
) == NULL_TREE
&& !TREE_STATIC (decl
))
7455 /* If we used it already as memory, it must stay in memory. */
7456 DECL_INITIAL (decl
) = NULL_TREE
;
7457 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7460 /* Local statics are handled differently from ordinary automatic
7462 if (TREE_STATIC (decl
))
7464 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7465 || TYPE_NEEDS_DESTRUCTOR (type
))
7466 expand_static_init (decl
, init
);
7470 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7474 /* Compute and store the initial value. */
7475 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7477 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7479 int saved_stmts_are_full_exprs_p
;
7481 emit_line_note (DECL_SOURCE_FILE (decl
),
7482 DECL_SOURCE_LINE (decl
));
7483 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p
;
7484 stmts_are_full_exprs_p
= 1;
7485 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7486 stmts_are_full_exprs_p
= saved_stmts_are_full_exprs_p
;
7489 /* Set this to 0 so we can tell whether an aggregate which was
7490 initialized was ever used. Don't do this if it has a
7491 destructor, so we don't complain about the 'resource
7492 allocation is initialization' idiom. Now set
7493 attribute((unused)) on types so decls of that type will be
7494 marked used. (see TREE_USED, above.) */
7495 if (TYPE_NEEDS_CONSTRUCTING (type
)
7497 && !TYPE_NEEDS_DESTRUCTOR (type
)
7498 && DECL_NAME (decl
))
7499 TREE_USED (decl
) = 0;
7500 else if (already_used
)
7501 TREE_USED (decl
) = 1;
7505 /* Generate code to destroy DECL (a local variable). */
7508 destroy_local_var (decl
)
7511 tree type
= TREE_TYPE (decl
);
7514 /* Only variables get cleaned up. */
7515 if (TREE_CODE (decl
) != VAR_DECL
)
7518 /* And only things with destructors need cleaning up. */
7519 if (!TYPE_NEEDS_DESTRUCTOR (type
))
7522 if (TREE_CODE (decl
) == VAR_DECL
&&
7523 (DECL_EXTERNAL (decl
) || TREE_STATIC (decl
)))
7524 /* We don't clean up things that aren't defined in this
7525 translation unit, or that need a static cleanup. The latter
7526 are handled by finish_file. */
7529 /* Compute the cleanup. */
7530 cleanup
= maybe_build_cleanup (decl
);
7532 /* Record the cleanup required for this declaration. */
7533 if (DECL_SIZE (decl
) && TREE_TYPE (decl
) != error_mark_node
7535 finish_decl_cleanup (decl
, cleanup
);
7538 /* Let the back-end know about DECL. */
7541 emit_local_var (decl
)
7544 /* Create RTL for this variable. */
7545 if (DECL_RTL (decl
))
7546 /* Only a RESULT_DECL should have non-NULL RTL when
7547 arriving here. All other local variables are
7548 assigned RTL in this function. */
7549 my_friendly_assert (TREE_CODE (decl
) == RESULT_DECL
,
7553 if (DECL_ASSEMBLER_NAME (decl
) != DECL_NAME (decl
))
7554 /* The user must have specified an assembler name for this
7555 variable. Set that up now. */
7556 rest_of_decl_compilation
7557 (decl
, IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)),
7558 /*top_level=*/0, /*at_end=*/0);
7563 /* Actually do the initialization. */
7564 expand_start_target_temps ();
7565 expand_decl_init (decl
);
7566 expand_end_target_temps ();
7569 /* Finish processing of a declaration;
7570 install its line number and initial value.
7571 If the length of an array type is not known before,
7572 it must be determined now, from the initial value, or it is an error.
7574 For C++, `cp_finish_decl' must be fairly evasive: it must keep initializers
7575 for aggregates that have constructors alive on the permanent obstack,
7576 so that the global initializing functions can be written at the end.
7578 INIT0 holds the value of an initializer that should be allowed to escape
7581 FLAGS is LOOKUP_ONLYCONVERTING is the = init syntax was used, else 0
7582 if the (init) syntax was used.
7584 For functions that take default parameters, DECL points to its
7585 "maximal" instantiation. `cp_finish_decl' must then also declared its
7586 subsequently lower and lower forms of instantiation, checking for
7587 ambiguity as it goes. This can be sped up later. */
7590 cp_finish_decl (decl
, init
, asmspec_tree
, flags
)
7596 tree ttype
= NULL_TREE
;
7597 const char *asmspec
= NULL
;
7598 int was_readonly
= 0;
7600 /* If this is 0, then we did not change obstacks. */
7604 error ("assignment (not initialization) in declaration");
7608 /* If a name was specified, get the string. */
7610 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
7612 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
7614 cp_error ("Cannot initialize `%D' to namespace `%D'",
7619 if (current_class_type
7620 && DECL_REAL_CONTEXT (decl
) == current_class_type
7621 && TYPE_BEING_DEFINED (current_class_type
)
7622 && (DECL_INITIAL (decl
) || init
))
7623 DECL_DEFINED_IN_CLASS_P (decl
) = 1;
7625 if (TREE_CODE (decl
) == VAR_DECL
7626 && DECL_CONTEXT (decl
)
7627 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7628 && DECL_CONTEXT (decl
) != current_namespace
7631 /* Leave the namespace of the object. */
7632 pop_decl_namespace ();
7635 type
= TREE_TYPE (decl
);
7637 if (type
== error_mark_node
)
7640 /* Add this declaration to the statement-tree. */
7641 if (building_stmt_tree ()
7642 && TREE_CODE (current_scope ()) == FUNCTION_DECL
)
7643 add_decl_stmt (decl
);
7645 if (TYPE_HAS_MUTABLE_P (type
))
7646 TREE_READONLY (decl
) = 0;
7648 if (processing_template_decl
)
7650 if (init
&& DECL_INITIAL (decl
))
7651 DECL_INITIAL (decl
) = init
;
7655 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
7656 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
7658 /* Take care of TYPE_DECLs up front. */
7659 if (TREE_CODE (decl
) == TYPE_DECL
)
7661 if (init
&& DECL_INITIAL (decl
))
7663 /* typedef foo = bar; store the type of bar as the type of foo. */
7664 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
7665 DECL_INITIAL (decl
) = init
= NULL_TREE
;
7667 if (type
!= error_mark_node
7668 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
7670 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
7671 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
7672 set_identifier_type_value (DECL_NAME (decl
), type
);
7673 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
7675 GNU_xref_decl (current_function_decl
, decl
);
7677 /* If we have installed this as the canonical typedef for this
7678 type, and that type has not been defined yet, delay emitting
7679 the debug information for it, as we will emit it later. */
7680 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
7681 && TYPE_SIZE (TREE_TYPE (decl
)) == NULL_TREE
)
7682 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
7684 rest_of_decl_compilation (decl
, NULL_PTR
,
7685 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
7689 if (TREE_CODE (decl
) != FUNCTION_DECL
)
7690 ttype
= target_type (type
);
7692 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
7693 && TYPE_NEEDS_CONSTRUCTING (type
))
7695 /* Currently, GNU C++ puts constants in text space, making them
7696 impossible to initialize. In the future, one would hope for
7697 an operating system which understood the difference between
7698 initialization and the running of a program. */
7700 TREE_READONLY (decl
) = 0;
7703 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
7705 /* This must override the asm specifier which was placed by
7706 grokclassfn. Lay this out fresh. */
7707 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
7708 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7709 make_decl_rtl (decl
, asmspec
, 0);
7712 /* Deduce size of array from initialization, if not already known. */
7713 maybe_deduce_size_from_array_init (decl
, init
);
7714 init
= check_initializer (decl
, init
);
7716 GNU_xref_decl (current_function_decl
, decl
);
7718 if (TREE_CODE (decl
) == VAR_DECL
)
7719 layout_var_decl (decl
);
7721 /* Output the assembler code and/or RTL code for variables and functions,
7722 unless the type is an undefined structure or union.
7723 If not, it will get done when the type is completed. */
7724 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
7725 || TREE_CODE (decl
) == RESULT_DECL
)
7727 if (TREE_CODE (decl
) == VAR_DECL
)
7728 maybe_commonize_var (decl
);
7730 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
7732 if (TREE_CODE (type
) == FUNCTION_TYPE
7733 || TREE_CODE (type
) == METHOD_TYPE
)
7734 abstract_virtuals_error (decl
,
7735 strip_array_types (TREE_TYPE (type
)));
7737 abstract_virtuals_error (decl
, strip_array_types (type
));
7739 if (TREE_CODE (decl
) == FUNCTION_DECL
)
7741 else if (DECL_EXTERNAL (decl
)
7742 && ! (DECL_LANG_SPECIFIC (decl
)
7743 && DECL_NOT_REALLY_EXTERN (decl
)))
7746 DECL_INITIAL (decl
) = init
;
7748 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
7750 /* This is a local declaration. */
7751 if (doing_semantic_analysis_p ())
7752 maybe_inject_for_scope_var (decl
);
7753 /* Initialize the local variable. But, if we're building a
7754 statement-tree, we'll do the initialization when we
7756 if (processing_template_decl
)
7758 if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
7759 DECL_INITIAL (decl
) = init
;
7763 /* If we're not building RTL, then we need to do so
7765 if (!building_stmt_tree ())
7766 emit_local_var (decl
);
7767 /* Initialize the variable. */
7768 initialize_local_var (decl
, init
, flags
);
7769 /* Clean up the variable. */
7770 destroy_local_var (decl
);
7773 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
7775 /* Cleanups for static variables are handled by `finish_file'. */
7776 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7777 || TYPE_NEEDS_DESTRUCTOR (type
))
7778 expand_static_init (decl
, init
);
7782 /* Undo call to `pushclass' that was done in `start_decl'
7783 due to initialization of qualified member variable.
7784 I.e., Foo::x = 10; */
7786 tree context
= DECL_REAL_CONTEXT (decl
);
7788 && TREE_CODE_CLASS (TREE_CODE (context
)) == 't'
7789 && (TREE_CODE (decl
) == VAR_DECL
7790 /* We also have a pushclass done that we need to undo here
7791 if we're at top level and declare a method. */
7792 || TREE_CODE (decl
) == FUNCTION_DECL
)
7793 /* If size hasn't been set, we're still defining it,
7794 and therefore inside the class body; don't pop
7795 the binding level.. */
7796 && TYPE_SIZE (context
) != NULL_TREE
7797 && context
== current_class_type
)
7798 pop_nested_class ();
7804 /* If requested, warn about definitions of large data objects. */
7806 if (warn_larger_than
7807 && ! processing_template_decl
7808 && (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
7809 && !DECL_EXTERNAL (decl
))
7811 register tree decl_size
= DECL_SIZE (decl
);
7813 if (decl_size
&& TREE_CODE (decl_size
) == INTEGER_CST
)
7815 unsigned units
= TREE_INT_CST_LOW (decl_size
) / BITS_PER_UNIT
;
7817 if (units
> larger_than_size
)
7818 warning_with_decl (decl
, "size of `%s' is %u bytes", units
);
7823 TREE_READONLY (decl
) = 1;
7826 /* This is here for a midend callback from c-common.c */
7829 finish_decl (decl
, init
, asmspec_tree
)
7833 cp_finish_decl (decl
, init
, asmspec_tree
, 0);
7836 /* Generate code to handle the destruction of the function-scoped
7837 static variable DECL. */
7840 destroy_local_static (decl
)
7843 tree cleanup
, fcall
;
7845 int saved_flag_access_control
;
7847 if (atexit_node
== 0)
7849 tree atexit_fndecl
, PFV
, pfvlist
;
7851 PFV
= build_pointer_type (build_function_type
7852 (void_type_node
, void_list_node
));
7854 pfvlist
= tree_cons (NULL_TREE
, PFV
, void_list_node
);
7856 push_lang_context (lang_name_c
);
7857 /* Note that we do not call pushdecl for this function;
7858 there's no reason that this declaration should be
7859 accessible to anyone. */
7861 = define_function ("atexit",
7862 build_function_type (void_type_node
,
7864 /*pfn=*/0, NULL_PTR
);
7865 mark_used (atexit_fndecl
);
7866 atexit_node
= default_conversion (atexit_fndecl
);
7867 pop_lang_context ();
7870 /* Call build_cleanup before we enter the anonymous function so that
7871 any access checks will be done relative to the current scope,
7872 rather than the scope of the anonymous function. */
7873 build_cleanup (decl
);
7875 /* Now start the function. */
7876 cleanup
= start_anon_func ();
7878 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
7879 to the original function, rather than the anonymous one. That
7880 will make the back-end think that nested functions are in use,
7881 which causes confusion. */
7882 saved_flag_access_control
= flag_access_control
;
7883 flag_access_control
= 0;
7884 fcall
= build_cleanup (decl
);
7885 flag_access_control
= saved_flag_access_control
;
7887 /* Create the body of the anonymous function. */
7888 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
7889 finish_expr_stmt (fcall
);
7890 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
7893 /* Call atexit with the cleanup function. */
7894 mark_addressable (cleanup
);
7895 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
7896 fcall
= build_function_call (atexit_node
,
7897 tree_cons (NULL_TREE
,
7900 finish_expr_stmt (fcall
);
7904 expand_static_init (decl
, init
)
7908 tree oldstatic
= value_member (decl
, static_aggregates
);
7912 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
7913 cp_error ("multiple initializations given for `%D'", decl
);
7915 else if (! toplevel_bindings_p ())
7917 /* Emit code to perform this initialization but once. */
7924 /* Emit code to perform this initialization but once. This code
7927 static int temp = 0;
7929 // Do initialization.
7931 // Register variable for destruction at end of program.
7934 Note that the `temp' variable is only set to 1 *after* the
7935 initialization is complete. This ensures that an exception,
7936 thrown during the construction, will cause the variable to
7937 reinitialized when we pass through this code again, as per:
7941 If the initialization exits by throwing an exception, the
7942 initialization is not complete, so it will be tried again
7943 the next time control enters the declaration.
7945 In theory, this process should be thread-safe, too; multiple
7946 threads should not be able to initialize the variable more
7947 than once. We don't yet attempt to ensure thread-safety. */
7948 temp
= get_temp_name (integer_type_node
, 1);
7949 rest_of_decl_compilation (temp
, NULL_PTR
, 0, 0);
7951 /* Begin the conditional initialization. */
7952 if_stmt
= begin_if_stmt ();
7953 finish_if_stmt_cond (build_binary_op (EQ_EXPR
, temp
,
7956 then_clause
= begin_compound_stmt (/*has_no_scope=*/0);
7958 /* Do the initialization itself. */
7959 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
7960 || (init
&& TREE_CODE (init
) == TREE_LIST
))
7961 assignment
= build_aggr_init (decl
, init
, 0);
7963 /* The initialization we're doing here is just a bitwise
7965 assignment
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
7967 assignment
= NULL_TREE
;
7969 /* Once the assignment is complete, set TEMP to 1. Since the
7970 construction of the static object is complete at this point,
7971 we want to make sure TEMP is set to 1 even if a temporary
7972 constructed during the initialization throws an exception
7973 when it is destroyed. So, we combine the initialization and
7974 the assignment to TEMP into a single expression, ensuring
7975 that when we call finish_expr_stmt the cleanups will not be
7976 run until after TEMP is set to 1. */
7977 temp_init
= build_modify_expr (temp
, NOP_EXPR
, integer_one_node
);
7980 assignment
= tree_cons (NULL_TREE
, assignment
,
7981 build_tree_list (NULL_TREE
,
7983 assignment
= build_compound_expr (assignment
);
7986 assignment
= temp_init
;
7987 finish_expr_stmt (assignment
);
7989 /* Use atexit to register a function for destroying this static
7991 if (TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
7992 destroy_local_static (decl
);
7994 finish_compound_stmt (/*has_no_scope=*/0, then_clause
);
7995 finish_then_clause (if_stmt
);
8000 /* This code takes into account memory allocation policy of
8001 `start_decl'. Namely, if TYPE_NEEDS_CONSTRUCTING does not
8002 hold for this object, then we must make permanent the storage
8003 currently in the temporary obstack. */
8004 if (!TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
8005 preserve_initializer ();
8006 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8010 /* Finish the declaration of a catch-parameter. */
8013 start_handler_parms (declspecs
, declarator
)
8020 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8022 if (decl
== NULL_TREE
)
8023 error ("invalid catch parameter");
8032 /* Make TYPE a complete type based on INITIAL_VALUE.
8033 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8034 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8037 complete_array_type (type
, initial_value
, do_default
)
8038 tree type
, initial_value
;
8041 register tree maxindex
= NULL_TREE
;
8046 /* Note MAXINDEX is really the maximum index,
8047 one less than the size. */
8048 if (TREE_CODE (initial_value
) == STRING_CST
)
8051 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8052 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8055 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8057 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8058 maxindex
= size_binop (MINUS_EXPR
, integer_zero_node
, size_one_node
);
8059 for (; elts
; elts
= TREE_CHAIN (elts
))
8061 if (TREE_PURPOSE (elts
))
8062 maxindex
= TREE_PURPOSE (elts
);
8064 maxindex
= size_binop (PLUS_EXPR
, maxindex
, size_one_node
);
8066 maxindex
= copy_node (maxindex
);
8070 /* Make an error message unless that happened already. */
8071 if (initial_value
!= error_mark_node
)
8074 initial_value
= NULL_TREE
;
8076 /* Prevent further error messages. */
8077 maxindex
= build_int_2 (0, 0);
8084 maxindex
= build_int_2 (0, 0);
8093 domain
= build_index_type (maxindex
);
8094 TYPE_DOMAIN (type
) = domain
;
8096 if (! TREE_TYPE (maxindex
))
8097 TREE_TYPE (maxindex
) = domain
;
8099 itype
= TREE_TYPE (initial_value
);
8102 if (itype
&& !TYPE_DOMAIN (itype
))
8103 TYPE_DOMAIN (itype
) = domain
;
8104 /* The type of the main variant should never be used for arrays
8105 of different sizes. It should only ever be completed with the
8106 size of the array. */
8107 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8108 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8111 /* Lay out the type now that we can get the real answer. */
8118 /* Return zero if something is declared to be a member of type
8119 CTYPE when in the context of CUR_TYPE. STRING is the error
8120 message to print in that case. Otherwise, quietly return 1. */
8123 member_function_or_else (ctype
, cur_type
, string
)
8124 tree ctype
, cur_type
;
8127 if (ctype
&& ctype
!= cur_type
)
8129 error (string
, TYPE_NAME_STRING (ctype
));
8135 /* Subroutine of `grokdeclarator'. */
8137 /* Generate errors possibly applicable for a given set of specifiers.
8138 This is for ARM $7.1.2. */
8141 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8144 int virtualp
, quals
, friendp
, raises
, inlinep
;
8147 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8149 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8151 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8154 cp_error_at ("`%D' declared as a friend", object
);
8156 cp_error_at ("`%D' declared with an exception specification", object
);
8159 /* CTYPE is class type, or null if non-class.
8160 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8162 DECLARATOR is the function's name.
8163 VIRTUALP is truthvalue of whether the function is virtual or not.
8164 FLAGS are to be passed through to `grokclassfn'.
8165 QUALS are qualifiers indicating whether the function is `const'
8167 RAISES is a list of exceptions that this function can raise.
8168 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8169 not look, and -1 if we should not call `grokclassfn' at all.
8171 Returns `NULL_TREE' if something goes wrong, after issuing
8172 applicable error messages. */
8175 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8176 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8177 template_count
, in_namespace
)
8180 tree orig_declarator
;
8182 enum overload_flags flags
;
8184 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8188 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8189 int has_default_arg
= 0;
8193 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8194 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8200 type
= build_exception_variant (type
, raises
);
8203 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8204 /* Propagate volatile out from type to decl. */
8205 if (TYPE_VOLATILE (type
))
8206 TREE_THIS_VOLATILE (decl
) = 1;
8208 /* If this decl has namespace scope, set that up. */
8210 set_decl_namespace (decl
, in_namespace
, friendp
);
8211 else if (publicp
&& ! ctype
)
8212 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8214 /* `main' and builtins have implicit 'C' linkage. */
8215 if ((MAIN_NAME_P (declarator
)
8216 || (IDENTIFIER_LENGTH (declarator
) > 10
8217 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8218 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8219 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8220 && current_lang_name
== lang_name_cplusplus
8221 && ctype
== NULL_TREE
8222 /* NULL_TREE means global namespace. */
8223 && DECL_CONTEXT (decl
) == NULL_TREE
)
8224 DECL_LANGUAGE (decl
) = lang_c
;
8226 /* Should probably propagate const out from type to decl I bet (mrs). */
8229 DECL_STATIC_FUNCTION_P (decl
) = 1;
8230 DECL_CONTEXT (decl
) = ctype
;
8234 DECL_CLASS_CONTEXT (decl
) = ctype
;
8236 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8238 if (processing_template_decl
)
8239 error ("cannot declare `main' to be a template");
8241 error ("cannot declare `main' to be inline");
8243 error ("cannot declare `main' to be static");
8248 /* Members of anonymous types and local classes have no linkage; make
8250 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8251 || hack_decl_function_context (TYPE_MAIN_DECL (ctype
))))
8256 /* [basic.link]: A name with no linkage (notably, the name of a class
8257 or enumeration declared in a local scope) shall not be used to
8258 declare an entity with linkage.
8260 Only check this for public decls for now. */
8261 t
= no_linkage_check (TREE_TYPE (decl
));
8264 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8266 if (DECL_LANGUAGE (decl
) == lang_c
)
8267 /* Allow this; it's pretty common in C. */;
8269 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8273 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8278 TREE_PUBLIC (decl
) = publicp
;
8281 DECL_INTERFACE_KNOWN (decl
) = 1;
8282 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8286 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8288 DECL_EXTERNAL (decl
) = 1;
8289 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8291 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8292 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8296 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8297 grok_op_properties (decl
, virtualp
, check
< 0);
8299 if (ctype
&& hack_decl_function_context (decl
))
8300 DECL_NO_STATIC_CHAIN (decl
) = 1;
8302 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8303 if (TREE_PURPOSE (t
)
8304 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8306 has_default_arg
= 1;
8311 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8315 ("defining explicit specialization `%D' in friend declaration",
8319 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8321 /* Something like `template <class T> friend void f<T>()'. */
8322 cp_error ("template-id `%D' in declaration of primary template",
8328 /* A friend declaration of the form friend void f<>(). Record
8329 the information in the TEMPLATE_ID_EXPR. */
8330 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8331 DECL_TEMPLATE_INFO (decl
)
8332 = tree_cons (TREE_OPERAND (orig_declarator
, 0),
8333 TREE_OPERAND (orig_declarator
, 1),
8336 if (has_default_arg
)
8338 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8345 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8352 if (has_default_arg
)
8353 add_defarg_fn (decl
);
8355 /* Plain overloading: will not be grok'd by grokclassfn. */
8356 if (! ctype
&& ! processing_template_decl
8357 && DECL_LANGUAGE (decl
) != lang_c
8358 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8359 set_mangled_name_for_decl (decl
);
8362 /* Make the init_value nonzero so pushdecl knows this is not
8363 tentative. error_mark_node is replaced later with the BLOCK. */
8364 DECL_INITIAL (decl
) = error_mark_node
;
8366 /* Caller will do the rest of this. */
8370 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8373 /* Just handle constructors here. We could do this
8374 inside the following if stmt, but I think
8375 that the code is more legible by breaking this
8376 case out. See comments below for what each of
8377 the following calls is supposed to do. */
8378 DECL_CONSTRUCTOR_P (decl
) = 1;
8380 grokclassfn (ctype
, decl
, flags
, quals
);
8382 decl
= check_explicit_specialization (orig_declarator
, decl
,
8384 2 * (funcdef_flag
!= 0) +
8385 4 * (friendp
!= 0));
8386 if (decl
== error_mark_node
)
8389 if ((! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8392 tmp
= check_classfn (ctype
, decl
);
8394 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8395 tmp
= DECL_TEMPLATE_RESULT(tmp
);
8397 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8398 cp_error ("definition of implicitly-declared `%D'", tmp
);
8399 if (tmp
&& duplicate_decls (decl
, tmp
))
8402 if (! grok_ctor_properties (ctype
, decl
))
8409 /* Function gets the ugly name, field gets the nice one.
8410 This call may change the type of the function (because
8411 of default parameters)! */
8412 if (ctype
!= NULL_TREE
)
8413 grokclassfn (ctype
, decl
, flags
, quals
);
8415 decl
= check_explicit_specialization (orig_declarator
, decl
,
8417 2 * (funcdef_flag
!= 0) +
8418 4 * (friendp
!= 0));
8419 if (decl
== error_mark_node
)
8422 if (ctype
!= NULL_TREE
8423 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8426 tmp
= check_classfn (ctype
, decl
);
8428 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8429 tmp
= DECL_TEMPLATE_RESULT (tmp
);
8431 if (tmp
&& DECL_STATIC_FUNCTION_P (tmp
)
8432 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8434 /* Remove the `this' parm added by grokclassfn.
8435 XXX Isn't this done in start_function, too? */
8436 revert_static_member_fn (&decl
, NULL
, NULL
);
8437 last_function_parms
= TREE_CHAIN (last_function_parms
);
8439 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8440 cp_error ("definition of implicitly-declared `%D'", tmp
);
8443 /* Attempt to merge the declarations. This can fail, in
8444 the case of some illegal specialization declarations. */
8445 if (!duplicate_decls (decl
, tmp
))
8446 cp_error ("no `%#D' member function declared in class `%T'",
8452 if (ctype
== NULL_TREE
|| check
)
8457 DECL_VIRTUAL_P (decl
) = 1;
8458 if (DECL_VINDEX (decl
) == NULL_TREE
)
8459 DECL_VINDEX (decl
) = error_mark_node
;
8460 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
8467 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
8470 RID_BIT_TYPE
*specbits_in
;
8476 RID_BIT_TYPE specbits
;
8478 specbits
= *specbits_in
;
8480 if (TREE_CODE (type
) == OFFSET_TYPE
)
8482 /* If you declare a static member so that it
8483 can be initialized, the code will reach here. */
8484 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
8485 type
= TREE_TYPE (type
);
8486 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8487 DECL_CONTEXT (decl
) = basetype
;
8488 DECL_CLASS_CONTEXT (decl
) = basetype
;
8489 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
, declarator
);
8496 context
= in_namespace
;
8497 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
8498 context
= current_namespace
;
8500 context
= NULL_TREE
;
8502 if (processing_template_decl
)
8503 /* If we're in a template, we need DECL_LANG_SPECIFIC so that
8504 we can call push_template_decl. */
8505 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8507 decl
= build_decl (VAR_DECL
, declarator
, type
);
8510 set_decl_namespace (decl
, context
, 0);
8512 context
= DECL_CONTEXT (decl
);
8513 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
8514 DECL_ASSEMBLER_NAME (decl
) = build_static_name (context
, declarator
);
8518 set_decl_namespace (decl
, in_namespace
, 0);
8520 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
8522 DECL_THIS_EXTERN (decl
) = 1;
8523 DECL_EXTERNAL (decl
) = !initialized
;
8526 /* In class context, static means one per class,
8527 public access, and static storage. */
8528 if (DECL_CLASS_SCOPE_P (decl
))
8530 TREE_PUBLIC (decl
) = 1;
8531 TREE_STATIC (decl
) = 1;
8532 DECL_EXTERNAL (decl
) = 0;
8534 /* At top level, either `static' or no s.c. makes a definition
8535 (perhaps tentative), and absence of `static' makes it public. */
8536 else if (toplevel_bindings_p ())
8538 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
8539 && (DECL_THIS_EXTERN (decl
) || ! constp
));
8540 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
8542 /* Not at top level, only `static' makes a static definition. */
8545 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
8546 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
8549 if (TREE_PUBLIC (decl
))
8551 /* [basic.link]: A name with no linkage (notably, the name of a class
8552 or enumeration declared in a local scope) shall not be used to
8553 declare an entity with linkage.
8555 Only check this for public decls for now. */
8556 tree t
= no_linkage_check (TREE_TYPE (decl
));
8559 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8560 /* Ignore for now; `enum { foo } e' is pretty common. */;
8562 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
8570 /* Create and return a canonical pointer to member function type, for
8571 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
8574 build_ptrmemfunc_type (type
)
8580 tree unqualified_variant
= NULL_TREE
;
8582 /* If a canonical type already exists for this type, use it. We use
8583 this method instead of type_hash_canon, because it only does a
8584 simple equality check on the list of field members. */
8586 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
8589 /* Make sure that we always have the unqualified pointer-to-member
8591 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8593 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
8595 u
= make_lang_type (UNION_TYPE
);
8596 SET_IS_AGGR_TYPE (u
, 0);
8597 fields
[0] = build_lang_decl (FIELD_DECL
, pfn_identifier
, type
);
8598 fields
[1] = build_lang_decl (FIELD_DECL
, delta2_identifier
,
8600 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
8601 TYPE_NAME (u
) = NULL_TREE
;
8603 t
= make_lang_type (RECORD_TYPE
);
8605 /* Let the front-end know this is a pointer to member function... */
8606 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
8607 /* ... and not really an aggregate. */
8608 SET_IS_AGGR_TYPE (t
, 0);
8610 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
8612 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
8614 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
8615 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
8617 /* Zap out the name so that the back-end will give us the debugging
8618 information for this anonymous RECORD_TYPE. */
8619 TYPE_NAME (t
) = NULL_TREE
;
8621 /* If this is not the unqualified form of this pointer-to-member
8622 type, set the TYPE_MAIN_VARIANT for this type to be the
8623 unqualified type. Since they are actually RECORD_TYPEs that are
8624 not variants of each other, we must do this manually. */
8625 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8627 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
8628 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
8629 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
8630 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
8633 /* Cache this pointer-to-member type so that we can find it again
8635 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
8637 /* Seems to be wanted. */
8638 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
8643 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
8644 Check to see that the definition is valid. Issue appropriate error
8645 messages. Return 1 if the definition is particularly bad, or 0
8649 check_static_variable_definition (decl
, type
)
8653 /* Motion 10 at San Diego: If a static const integral data member is
8654 initialized with an integral constant expression, the initializer
8655 may appear either in the declaration (within the class), or in
8656 the definition, but not both. If it appears in the class, the
8657 member is a member constant. The file-scope definition is always
8659 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
8661 cp_error ("in-class initialization of static data member of non-integral type `%T'",
8663 /* If we just return the declaration, crashes will sometimes
8664 occur. We therefore return void_type_node, as if this was a
8665 friend declaration, to cause callers to completely ignore
8666 this declaration. */
8669 else if (!CP_TYPE_CONST_P (type
))
8670 cp_error ("ANSI C++ forbids in-class initialization of non-const static member `%D'",
8672 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
8673 cp_pedwarn ("ANSI C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
8678 /* Given the SIZE (i.e., number of elements) in an array, compute an
8679 appropriate index type for the array. If non-NULL, NAME is the
8680 name of the thing being declared. */
8683 compute_array_index_type (name
, size
)
8689 /* The size might be the result of a cast. */
8690 STRIP_TYPE_NOPS (size
);
8692 /* It might be a const variable or enumeration constant. */
8693 if (TREE_READONLY_DECL_P (size
))
8694 size
= decl_constant_value (size
);
8696 /* If this involves a template parameter, it will be a constant at
8697 instantiation time, but we don't know what the value is yet.
8698 Even if no template parameters are involved, we may an expression
8699 that is not a constant; we don't even simplify `1 + 2' when
8700 processing a template. */
8701 if (processing_template_decl
)
8703 /* Resolve a qualified reference to an enumerator or static
8704 const data member of ours. */
8705 if (TREE_CODE (size
) == SCOPE_REF
8706 && TREE_OPERAND (size
, 0) == current_class_type
)
8708 tree t
= lookup_field (current_class_type
,
8709 TREE_OPERAND (size
, 1), 0, 0);
8714 return build_index_type (build_min (MINUS_EXPR
, sizetype
,
8715 size
, integer_one_node
));
8718 /* The array bound must be an integer type. */
8719 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
8720 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
8721 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
8723 cp_error ("size of array `%D' has non-integer type", name
);
8724 size
= integer_one_node
;
8727 /* Normally, the array-bound will be a constant. */
8728 if (TREE_CONSTANT (size
))
8730 /* Check to see if the array bound overflowed. Make that an
8731 error, no matter how generous we're being. */
8732 int old_flag_pedantic_errors
= flag_pedantic_errors
;
8733 int old_pedantic
= pedantic
;
8734 pedantic
= flag_pedantic_errors
= 1;
8735 constant_expression_warning (size
);
8736 pedantic
= old_pedantic
;
8737 flag_pedantic_errors
= old_flag_pedantic_errors
;
8739 /* An array must have a positive number of elements. */
8740 if (INT_CST_LT (size
, integer_zero_node
))
8742 cp_error ("size of array `%D' is negative", name
);
8743 size
= integer_one_node
;
8745 /* Except that an extension we allow zero-sized arrays. We
8746 always allow them in system headers because glibc uses
8748 else if (integer_zerop (size
) && pedantic
&& !in_system_header
)
8749 cp_pedwarn ("ANSI C++ forbids zero-size array `%D'", name
);
8752 /* Compute the index of the largest element in the array. It is
8753 one less than the number of elements in the array. */
8755 = fold (build_binary_op (MINUS_EXPR
,
8756 cp_convert (ssizetype
, size
),
8757 cp_convert (ssizetype
,
8758 integer_one_node
)));
8760 /* Check for variable-sized arrays. We allow such things as an
8761 extension, even though they are not allowed in ANSI/ISO C++. */
8762 if (!TREE_CONSTANT (itype
))
8767 cp_pedwarn ("ANSI C++ forbids variable-size array `%D'",
8770 cp_pedwarn ("ANSI C++ forbids variable-size array");
8773 /* Create a variable-sized array index type. */
8774 itype
= variable_size (itype
);
8776 /* Make sure that there was no overflow when creating to a signed
8777 index type. (For example, on a 32-bit machine, an array with
8778 size 2^32 - 1 is too big.) */
8779 else if (TREE_OVERFLOW (itype
))
8781 error ("overflow in array dimension");
8782 TREE_OVERFLOW (itype
) = 0;
8785 /* Create and return the appropriate index type. */
8786 return build_index_type (itype
);
8789 /* Returns an ARRAY_TYPE for an array with SIZE elements of the
8790 indicated TYPE. If non-NULL, NAME is the NAME of the declaration
8794 create_array_type_for_decl (name
, type
, size
)
8799 tree itype
= NULL_TREE
;
8800 const char* error_msg
;
8802 /* If things have already gone awry, bail now. */
8803 if (type
== error_mark_node
|| size
== error_mark_node
)
8804 return error_mark_node
;
8806 /* Assume that everything will go OK. */
8809 /* There are some types which cannot be array elements. */
8810 switch (TREE_CODE (type
))
8813 error_msg
= "array of void";
8817 error_msg
= "array of functions";
8820 case REFERENCE_TYPE
:
8821 error_msg
= "array of references";
8825 error_msg
= "array of data members";
8829 error_msg
= "array of function members";
8836 /* If something went wrong, issue an error-message and return. */
8840 cp_error ("declaration of `%D' as %s", name
, error_msg
);
8842 cp_error ("creating %s", error_msg
);
8844 return error_mark_node
;
8849 The constant expressions that specify the bounds of the arrays
8850 can be omitted only for the first member of the sequence. */
8851 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
8853 cp_error ("declaration of `%D' as multidimensional array",
8855 cp_error ("must have bounds for all dimensions except the first");
8857 return error_mark_node
;
8860 /* Figure out the index type for the array. */
8862 itype
= compute_array_index_type (name
, size
);
8864 return build_cplus_array_type (type
, itype
);
8867 /* Given declspecs and a declarator,
8868 determine the name and type of the object declared
8869 and construct a ..._DECL node for it.
8870 (In one case we can return a ..._TYPE node instead.
8871 For invalid input we sometimes return 0.)
8873 DECLSPECS is a chain of tree_list nodes whose value fields
8874 are the storage classes and type specifiers.
8876 DECL_CONTEXT says which syntactic context this declaration is in:
8877 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
8878 FUNCDEF for a function definition. Like NORMAL but a few different
8879 error messages in each case. Return value may be zero meaning
8880 this definition is too screwy to try to parse.
8881 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
8882 handle member functions (which have FIELD context).
8883 Return value may be zero meaning this definition is too screwy to
8885 PARM for a parameter declaration (either within a function prototype
8886 or before a function body). Make a PARM_DECL, or return void_type_node.
8887 CATCHPARM for a parameter declaration before a catch clause.
8888 TYPENAME if for a typename (in a cast or sizeof).
8889 Don't make a DECL node; just return the ..._TYPE node.
8890 FIELD for a struct or union field; make a FIELD_DECL.
8891 BITFIELD for a field with specified width.
8892 INITIALIZED is 1 if the decl has an initializer.
8894 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
8895 normal attributes in TREE_PURPOSE, or NULL_TREE.
8897 In the TYPENAME case, DECLARATOR is really an absolute declarator.
8898 It may also be so in the PARM case, for a prototype where the
8899 argument type is specified but not the name.
8901 This function is where the complicated C meanings of `static'
8902 and `extern' are interpreted.
8904 For C++, if there is any monkey business to do, the function which
8905 calls this one must do it, i.e., prepending instance variables,
8906 renaming overloaded function names, etc.
8908 Note that for this C++, it is an error to define a method within a class
8909 which does not belong to that class.
8911 Except in the case where SCOPE_REFs are implicitly known (such as
8912 methods within a class being redundantly qualified),
8913 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
8914 (class_name::decl_name). The caller must also deal with this.
8916 If a constructor or destructor is seen, and the context is FIELD,
8917 then the type gains the attribute TREE_HAS_x. If such a declaration
8918 is erroneous, NULL_TREE is returned.
8920 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
8921 function, these are the qualifiers to give to the `this' pointer.
8923 May return void_type_node if the declarator turned out to be a friend.
8924 See grokfield for details. */
8926 enum return_types
{ return_normal
, return_ctor
, return_dtor
, return_conversion
};
8929 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
8932 enum decl_context decl_context
;
8936 RID_BIT_TYPE specbits
;
8939 tree type
= NULL_TREE
;
8945 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
8946 int explicit_int
= 0;
8947 int explicit_char
= 0;
8948 int defaulted_int
= 0;
8949 tree typedef_decl
= NULL_TREE
;
8951 tree typedef_type
= NULL_TREE
;
8952 int funcdef_flag
= 0;
8953 enum tree_code innermost_code
= ERROR_MARK
;
8956 /* See the code below that used this. */
8957 tree decl_machine_attr
= NULL_TREE
;
8959 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
8960 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
8961 tree init
= NULL_TREE
;
8963 /* Keep track of what sort of function is being processed
8964 so that we can warn about default return values, or explicit
8965 return values which do not match prescribed defaults. */
8966 enum return_types return_type
= return_normal
;
8968 tree dname
= NULL_TREE
;
8969 tree ctype
= current_class_type
;
8970 tree ctor_return_type
= NULL_TREE
;
8971 enum overload_flags flags
= NO_SPECIAL
;
8972 tree quals
= NULL_TREE
;
8973 tree raises
= NULL_TREE
;
8974 int template_count
= 0;
8975 tree in_namespace
= NULL_TREE
;
8979 RIDBIT_RESET_ALL (specbits
);
8980 if (decl_context
== FUNCDEF
)
8981 funcdef_flag
= 1, decl_context
= NORMAL
;
8982 else if (decl_context
== MEMFUNCDEF
)
8983 funcdef_flag
= -1, decl_context
= FIELD
;
8984 else if (decl_context
== BITFIELD
)
8985 bitfield
= 1, decl_context
= FIELD
;
8987 /* Look inside a declarator for the name being declared
8988 and get it as a string, for an error message. */
8990 tree
*next
= &declarator
;
8994 while (next
&& *next
)
8997 switch (TREE_CODE (decl
))
9000 /* For attributes. */
9001 next
= &TREE_VALUE (decl
);
9006 next
= &TREE_OPERAND (decl
, 0);
9009 case BIT_NOT_EXPR
: /* For C++ destructors! */
9011 tree name
= TREE_OPERAND (decl
, 0);
9012 tree rename
= NULL_TREE
;
9014 my_friendly_assert (flags
== NO_SPECIAL
, 152);
9016 return_type
= return_dtor
;
9017 if (TREE_CODE (name
) == TYPE_DECL
)
9018 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
9019 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
9020 if (ctype
== NULL_TREE
)
9022 if (current_class_type
== NULL_TREE
)
9024 error ("destructors must be member functions");
9029 tree t
= constructor_name (current_class_name
);
9036 tree t
= constructor_name (ctype
);
9043 cp_error ("destructor `%T' must match class name `%T'",
9045 TREE_OPERAND (decl
, 0) = rename
;
9051 case ADDR_EXPR
: /* C++ reference declaration */
9056 innermost_code
= TREE_CODE (decl
);
9057 next
= &TREE_OPERAND (decl
, 0);
9061 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
9063 /* This is actually a variable declaration using
9064 constructor syntax. We need to call start_decl and
9065 cp_finish_decl so we can get the variable
9068 tree attributes
, prefix_attributes
;
9070 *next
= TREE_OPERAND (decl
, 0);
9071 init
= CALL_DECLARATOR_PARMS (decl
);
9075 attributes
= TREE_PURPOSE (attrlist
);
9076 prefix_attributes
= TREE_VALUE (attrlist
);
9080 attributes
= NULL_TREE
;
9081 prefix_attributes
= NULL_TREE
;
9084 decl
= start_decl (declarator
, declspecs
, 1,
9085 attributes
, prefix_attributes
);
9088 /* Look for __unused__ attribute */
9089 if (TREE_USED (TREE_TYPE (decl
)))
9090 TREE_USED (decl
) = 1;
9091 finish_decl (decl
, init
, NULL_TREE
);
9094 cp_error ("invalid declarator");
9097 innermost_code
= TREE_CODE (decl
);
9098 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
9099 ctype
= current_class_type
;
9101 && TREE_OPERAND (decl
, 0)
9102 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
9103 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
9104 == constructor_name_full (ctype
))
9105 || (DECL_NAME (TREE_OPERAND (decl
, 0))
9106 == constructor_name (ctype
)))))
9107 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9108 next
= &TREE_OPERAND (decl
, 0);
9110 if (ctype
!= NULL_TREE
9111 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
9112 && decl
== constructor_name (ctype
))
9114 return_type
= return_ctor
;
9115 ctor_return_type
= ctype
;
9120 case TEMPLATE_ID_EXPR
:
9122 tree fns
= TREE_OPERAND (decl
, 0);
9124 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9125 fns
= TREE_OPERAND (fns
, 0);
9128 if (TREE_CODE (dname
) == COMPONENT_REF
)
9129 dname
= TREE_OPERAND (dname
, 1);
9130 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9132 my_friendly_assert (is_overloaded_fn (dname
),
9134 dname
= DECL_NAME (get_first_fn (dname
));
9139 case IDENTIFIER_NODE
:
9140 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9147 cp_error ("declarator-id missing; using reserved word `%D'",
9149 name
= IDENTIFIER_POINTER (dname
);
9151 if (! IDENTIFIER_OPNAME_P (dname
)
9152 /* GNU/Linux headers use '__op'. Arrgh. */
9153 || (IDENTIFIER_TYPENAME_P (dname
) && ! TREE_TYPE (dname
)))
9154 name
= IDENTIFIER_POINTER (dname
);
9157 if (IDENTIFIER_TYPENAME_P (dname
))
9159 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9160 flags
= TYPENAME_FLAG
;
9161 ctor_return_type
= TREE_TYPE (dname
);
9162 return_type
= return_conversion
;
9164 name
= operator_name_string (dname
);
9171 /* Perform error checking, and decide on a ctype. */
9172 tree cname
= TREE_OPERAND (decl
, 0);
9173 if (cname
== NULL_TREE
)
9175 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9178 in_namespace
= TREE_OPERAND (decl
, 0);
9179 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9181 else if (! is_aggr_type (cname
, 1))
9182 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9183 /* Must test TREE_OPERAND (decl, 1), in case user gives
9184 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9185 else if (TREE_OPERAND (decl
, 1)
9186 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9188 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9189 || TREE_CODE (cname
) == TEMPLATE_TEMPLATE_PARM
)
9191 cp_error ("`%T::%D' is not a valid declarator", cname
,
9192 TREE_OPERAND (decl
, 1));
9193 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9194 cname
, TREE_OPERAND (decl
, 1));
9195 return void_type_node
;
9197 else if (ctype
== NULL_TREE
)
9199 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9200 TREE_OPERAND (decl
, 0) = ctype
;
9203 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9205 cp_error ("type `%T' is not derived from type `%T'",
9207 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9213 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9214 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9215 == constructor_name_full (ctype
))
9216 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9217 == constructor_name (ctype
))))
9218 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9219 next
= &TREE_OPERAND (decl
, 1);
9223 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9224 && constructor_name (ctype
) == decl
)
9226 return_type
= return_ctor
;
9227 ctor_return_type
= ctype
;
9229 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9230 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9231 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9232 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9234 return_type
= return_dtor
;
9235 ctor_return_type
= ctype
;
9237 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9238 next
= &TREE_OPERAND (decl
, 0);
9249 /* Parse error puts this typespec where
9250 a declarator should go. */
9251 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9252 if (TREE_TYPE (decl
) == current_class_type
)
9253 cp_error (" perhaps you want `%T' for a constructor",
9254 current_class_name
);
9255 dname
= DECL_NAME (decl
);
9256 name
= IDENTIFIER_POINTER (dname
);
9258 /* Avoid giving two errors for this. */
9259 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9261 declspecs
= temp_tree_cons (NULL_TREE
, integer_type_node
,
9268 cp_compiler_error ("`%D' as declarator", decl
);
9269 return 0; /* We used to do a 155 abort here. */
9274 /* A function definition's declarator must have the form of
9275 a function declarator. */
9277 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9280 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9281 && innermost_code
!= CALL_EXPR
9282 && ! (ctype
&& declspecs
== NULL_TREE
))
9284 cp_error ("declaration of `%D' as non-function", dname
);
9285 return void_type_node
;
9288 /* Anything declared one level down from the top level
9289 must be one of the parameters of a function
9290 (because the body is at least two levels down). */
9292 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9293 by not allowing C++ class definitions to specify their parameters
9294 with xdecls (must be spec.d in the parmlist).
9296 Since we now wait to push a class scope until we are sure that
9297 we are in a legitimate method context, we must set oldcname
9298 explicitly (since current_class_name is not yet alive).
9300 We also want to avoid calling this a PARM if it is in a namespace. */
9302 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
9304 struct binding_level
*b
= current_binding_level
;
9305 current_binding_level
= b
->level_chain
;
9306 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9307 decl_context
= PARM
;
9308 current_binding_level
= b
;
9312 name
= decl_context
== PARM
? "parameter" : "type name";
9314 /* Look through the decl specs and record which ones appear.
9315 Some typespecs are defined as built-in typenames.
9316 Others, the ones that are modifiers of other types,
9317 are represented by bits in SPECBITS: set the bits for
9318 the modifiers that appear. Storage class keywords are also in SPECBITS.
9320 If there is a typedef name or a type, store the type in TYPE.
9321 This includes builtin typedefs such as `int'.
9323 Set EXPLICIT_INT if the type is `int' or `char' and did not
9324 come from a user typedef.
9326 Set LONGLONG if `long' is mentioned twice.
9328 For C++, constructors and destructors have their own fast treatment. */
9330 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
9335 /* Certain parse errors slip through. For example,
9336 `int class;' is not caught by the parser. Try
9337 weakly to recover here. */
9338 if (TREE_CODE (spec
) != TREE_LIST
)
9341 id
= TREE_VALUE (spec
);
9343 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9345 if (id
== ridpointers
[(int) RID_INT
]
9346 || id
== ridpointers
[(int) RID_CHAR
]
9347 || id
== ridpointers
[(int) RID_BOOL
]
9348 || id
== ridpointers
[(int) RID_WCHAR
])
9352 if (id
== ridpointers
[(int) RID_BOOL
])
9353 error ("`bool' is now a keyword");
9355 cp_error ("extraneous `%T' ignored", id
);
9359 if (id
== ridpointers
[(int) RID_INT
])
9361 else if (id
== ridpointers
[(int) RID_CHAR
])
9363 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
9367 /* C++ aggregate types. */
9368 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
9371 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
9373 type
= IDENTIFIER_TYPE_VALUE (id
);
9377 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
9379 if (ridpointers
[i
] == id
)
9381 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
9383 if (pedantic
&& ! in_system_header
&& warn_long_long
)
9384 pedwarn ("ANSI C++ does not support `long long'");
9386 error ("`long long long' is too long for GCC");
9390 else if (RIDBIT_SETP (i
, specbits
))
9391 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
9392 RIDBIT_SET (i
, specbits
);
9397 /* C++ aggregate types. */
9398 else if (TREE_CODE (id
) == TYPE_DECL
|| TREE_CODE (id
) == TEMPLATE_DECL
)
9401 cp_error ("multiple declarations `%T' and `%T'", type
,
9405 type
= TREE_TYPE (id
);
9406 TREE_VALUE (spec
) = type
;
9411 error ("two or more data types in declaration of `%s'", name
);
9412 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9414 register tree t
= lookup_name (id
, 1);
9415 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
9416 error ("`%s' fails to be a typedef or built in type",
9417 IDENTIFIER_POINTER (id
));
9420 type
= TREE_TYPE (t
);
9422 /* See the code below that used this. */
9423 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
9428 else if (id
!= error_mark_node
)
9429 /* Can't change CLASS nodes into RECORD nodes here! */
9435 typedef_type
= type
;
9437 /* No type at all: default to `int', and set DEFAULTED_INT
9438 because it was not a user-defined typedef. */
9440 if (type
== NULL_TREE
9441 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
9442 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9443 || RIDBIT_SETP (RID_LONG
, specbits
)
9444 || RIDBIT_SETP (RID_SHORT
, specbits
)))
9446 /* These imply 'int'. */
9447 type
= integer_type_node
;
9451 if (type
== NULL_TREE
)
9454 if (return_type
== return_dtor
)
9455 type
= void_type_node
;
9456 else if (return_type
== return_ctor
)
9457 type
= build_pointer_type (ctor_return_type
);
9458 else if (return_type
== return_conversion
)
9459 type
= ctor_return_type
;
9462 /* We handle `main' specially here, because 'main () { }' is so
9463 common. With no options, it is allowed. With -Wreturn-type,
9464 it is a warning. It is only an error with -pedantic-errors. */
9465 int is_main
= (funcdef_flag
9466 && MAIN_NAME_P (dname
)
9467 && ctype
== NULL_TREE
9468 && in_namespace
== NULL_TREE
9469 && current_namespace
== global_namespace
);
9471 if (in_system_header
|| flag_ms_extensions
)
9472 /* Allow it, sigh. */;
9473 else if (pedantic
|| ! is_main
)
9474 cp_pedwarn ("ANSI C++ forbids declaration of `%s' with no type",
9476 else if (warn_return_type
)
9477 cp_warning ("ANSI C++ forbids declaration of `%s' with no type",
9480 type
= integer_type_node
;
9483 else if (return_type
== return_dtor
)
9485 error ("return type specification for destructor invalid");
9486 type
= void_type_node
;
9488 else if (return_type
== return_ctor
)
9490 error ("return type specification for constructor invalid");
9491 type
= build_pointer_type (ctor_return_type
);
9493 else if (return_type
== return_conversion
)
9495 if (!same_type_p (type
, ctor_return_type
))
9496 cp_error ("operator `%T' declared to return `%T'",
9497 ctor_return_type
, type
);
9499 cp_pedwarn ("return type specified for `operator %T'",
9502 type
= ctor_return_type
;
9507 /* Now process the modifiers that were specified
9508 and check for invalid combinations. */
9510 /* Long double is a special combination. */
9512 if (RIDBIT_SETP (RID_LONG
, specbits
)
9513 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
9515 RIDBIT_RESET (RID_LONG
, specbits
);
9516 type
= build_qualified_type (long_double_type_node
,
9517 CP_TYPE_QUALS (type
));
9520 /* Check all other uses of type modifiers. */
9522 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9523 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9524 || RIDBIT_SETP (RID_LONG
, specbits
)
9525 || RIDBIT_SETP (RID_SHORT
, specbits
))
9529 if (TREE_CODE (type
) == REAL_TYPE
)
9530 error ("short, signed or unsigned invalid for `%s'", name
);
9531 else if (TREE_CODE (type
) != INTEGER_TYPE
)
9532 error ("long, short, signed or unsigned invalid for `%s'", name
);
9533 else if (RIDBIT_SETP (RID_LONG
, specbits
)
9534 && RIDBIT_SETP (RID_SHORT
, specbits
))
9535 error ("long and short specified together for `%s'", name
);
9536 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9537 || RIDBIT_SETP (RID_SHORT
, specbits
))
9539 error ("long or short specified with char for `%s'", name
);
9540 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9541 || RIDBIT_SETP (RID_SHORT
, specbits
))
9542 && TREE_CODE (type
) == REAL_TYPE
)
9543 error ("long or short specified with floating type for `%s'", name
);
9544 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9545 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
9546 error ("signed and unsigned given together for `%s'", name
);
9550 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
9552 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
9554 if (flag_pedantic_errors
)
9559 /* Discard the type modifiers if they are invalid. */
9562 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
9563 RIDBIT_RESET (RID_SIGNED
, specbits
);
9564 RIDBIT_RESET (RID_LONG
, specbits
);
9565 RIDBIT_RESET (RID_SHORT
, specbits
);
9570 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
9571 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
9573 error ("complex invalid for `%s'", name
);
9574 RIDBIT_RESET (RID_COMPLEX
, specbits
);
9577 /* Decide whether an integer type is signed or not.
9578 Optionally treat bitfields as signed by default. */
9579 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9582 It is implementation-defined whether a plain (neither
9583 explicitly signed or unsigned) char, short, int, or long
9584 bit-field is signed or unsigned.
9586 Naturally, we extend this to long long as well. Note that
9587 this does not include wchar_t. */
9588 || (bitfield
&& !flag_signed_bitfields
9589 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
9590 /* A typedef for plain `int' without `signed' can be
9591 controlled just like plain `int', but a typedef for
9592 `signed int' cannot be so controlled. */
9594 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
9595 && (TREE_CODE (type
) == INTEGER_TYPE
9596 || TREE_CODE (type
) == CHAR_TYPE
)
9597 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
9600 type
= long_long_unsigned_type_node
;
9601 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9602 type
= long_unsigned_type_node
;
9603 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9604 type
= short_unsigned_type_node
;
9605 else if (type
== char_type_node
)
9606 type
= unsigned_char_type_node
;
9607 else if (typedef_decl
)
9608 type
= unsigned_type (type
);
9610 type
= unsigned_type_node
;
9612 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9613 && type
== char_type_node
)
9614 type
= signed_char_type_node
;
9616 type
= long_long_integer_type_node
;
9617 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9618 type
= long_integer_type_node
;
9619 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9620 type
= short_integer_type_node
;
9622 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
9624 /* If we just have "complex", it is equivalent to
9625 "complex double", but if any modifiers at all are specified it is
9626 the complex form of TYPE. E.g, "complex short" is
9627 "complex short int". */
9629 if (defaulted_int
&& ! longlong
9630 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
9631 || RIDBIT_SETP (RID_SHORT
, specbits
)
9632 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9633 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
9634 type
= complex_double_type_node
;
9635 else if (type
== integer_type_node
)
9636 type
= complex_integer_type_node
;
9637 else if (type
== float_type_node
)
9638 type
= complex_float_type_node
;
9639 else if (type
== double_type_node
)
9640 type
= complex_double_type_node
;
9641 else if (type
== long_double_type_node
)
9642 type
= complex_long_double_type_node
;
9644 type
= build_complex_type (type
);
9647 if (return_type
== return_conversion
9648 && (RIDBIT_SETP (RID_CONST
, specbits
)
9649 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
9650 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
9651 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
9654 /* Set CONSTP if this declaration is `const', whether by
9655 explicit specification or via a typedef.
9656 Likewise for VOLATILEP. */
9658 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
9660 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
9662 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
9663 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
9664 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
9665 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
9666 type
= cp_build_qualified_type (type
, type_quals
);
9668 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
9669 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
9670 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
9671 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
9672 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
9674 if (RIDBIT_SETP (RID_STATIC
, specbits
))
9675 staticp
= 1 + (decl_context
== FIELD
);
9677 if (virtualp
&& staticp
== 2)
9679 cp_error ("member `%D' cannot be declared both virtual and static",
9683 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
9684 RIDBIT_RESET (RID_FRIEND
, specbits
);
9686 /* Warn if two storage classes are given. Default to `auto'. */
9688 if (RIDBIT_ANY_SET (specbits
))
9690 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
9691 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
9692 if (decl_context
== PARM
&& nclasses
> 0)
9693 error ("storage class specifiers invalid in parameter declarations");
9694 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9696 if (decl_context
== PARM
)
9697 error ("typedef declaration invalid in parameter declaration");
9700 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
9701 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
9704 /* Give error if `virtual' is used outside of class declaration. */
9706 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
9708 error ("virtual outside class declaration");
9712 /* Static anonymous unions are dealt with here. */
9713 if (staticp
&& decl_context
== TYPENAME
9714 && TREE_CODE (declspecs
) == TREE_LIST
9715 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
9716 decl_context
= FIELD
;
9718 /* Warn about storage classes that are invalid for certain
9719 kinds of declarations (parameters, typenames, etc.). */
9722 error ("multiple storage classes in declaration of `%s'", name
);
9723 else if (decl_context
!= NORMAL
&& nclasses
> 0)
9725 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9726 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
9727 || RIDBIT_SETP (RID_AUTO
, specbits
)))
9729 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9731 else if (decl_context
== FIELD
9732 /* C++ allows static class elements */
9733 && RIDBIT_SETP (RID_STATIC
, specbits
))
9734 /* C++ also allows inlines and signed and unsigned elements,
9735 but in those cases we don't come in here. */
9739 if (decl_context
== FIELD
)
9741 tree tmp
= NULL_TREE
;
9742 register int op
= 0;
9746 /* Avoid trying to get an operand off an identifier node. */
9747 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
9750 tmp
= TREE_OPERAND (declarator
, 0);
9751 op
= IDENTIFIER_OPNAME_P (tmp
);
9753 error ("storage class specified for %s `%s'",
9754 op
? "member operator" : "field",
9755 op
? operator_name_string (tmp
) : name
);
9758 error (((decl_context
== PARM
|| decl_context
== CATCHPARM
)
9759 ? "storage class specified for parameter `%s'"
9760 : "storage class specified for typename"), name
);
9761 RIDBIT_RESET (RID_REGISTER
, specbits
);
9762 RIDBIT_RESET (RID_AUTO
, specbits
);
9763 RIDBIT_RESET (RID_EXTERN
, specbits
);
9766 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
9768 if (toplevel_bindings_p ())
9770 /* It's common practice (and completely valid) to have a const
9771 be initialized and declared extern. */
9772 if (!(type_quals
& TYPE_QUAL_CONST
))
9773 warning ("`%s' initialized and declared `extern'", name
);
9776 error ("`%s' has both `extern' and initializer", name
);
9778 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
9779 && ! toplevel_bindings_p ())
9780 error ("nested function `%s' declared `extern'", name
);
9781 else if (toplevel_bindings_p ())
9783 if (RIDBIT_SETP (RID_AUTO
, specbits
))
9784 error ("top-level declaration of `%s' specifies `auto'", name
);
9787 if (nclasses
> 0 && friendp
)
9788 error ("storage class specifiers invalid in friend function declarations");
9790 /* Now figure out the structure of the declarator proper.
9791 Descend through it, creating more complex types, until we reach
9792 the declared identifier (or NULL_TREE, in an absolute declarator). */
9794 inner_attrs
= NULL_TREE
;
9797 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
9798 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
9800 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
9801 an INDIRECT_REF (for *...),
9802 a CALL_EXPR (for ...(...)),
9803 an identifier (for the name being declared)
9804 or a null pointer (for the place in an absolute declarator
9805 where the name was omitted).
9806 For the last two cases, we have just exited the loop.
9808 For C++ it could also be
9809 a SCOPE_REF (for class :: ...). In this case, we have converted
9810 sensible names to types, and those are the values we use to
9811 qualify the member name.
9812 an ADDR_EXPR (for &...),
9813 a BIT_NOT_EXPR (for destructors)
9815 At this point, TYPE is the type of elements of an array,
9816 or for a function to return, or for a pointer to point to.
9817 After this sequence of ifs, TYPE is the type of the
9818 array or function or pointer, and DECLARATOR has had its
9819 outermost layer removed. */
9821 if (type
== error_mark_node
)
9823 if (TREE_CODE (declarator
) == SCOPE_REF
)
9824 declarator
= TREE_OPERAND (declarator
, 1);
9826 declarator
= TREE_OPERAND (declarator
, 0);
9829 if (quals
!= NULL_TREE
9830 && (declarator
== NULL_TREE
9831 || TREE_CODE (declarator
) != SCOPE_REF
))
9833 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
9834 ctype
= TYPE_METHOD_BASETYPE (type
);
9835 if (ctype
!= NULL_TREE
)
9837 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
9838 ctype
= grok_method_quals (ctype
, dummy
, quals
);
9839 type
= TREE_TYPE (dummy
);
9844 /* See the comment for the TREE_LIST case, below. */
9847 else if (inner_attrs
)
9849 decl_attributes (type
, inner_attrs
, NULL_TREE
);
9850 inner_attrs
= NULL_TREE
;
9853 switch (TREE_CODE (declarator
))
9857 /* We encode a declarator with embedded attributes using
9858 a TREE_LIST. The attributes apply to the declarator
9859 directly inside them, so we have to skip an iteration
9860 before applying them to the type. If the declarator just
9861 inside is the declarator-id, we apply the attrs to the
9863 inner_attrs
= TREE_PURPOSE (declarator
);
9865 declarator
= TREE_VALUE (declarator
);
9873 size
= TREE_OPERAND (declarator
, 1);
9875 /* VC++ spells a zero-sized array with []. */
9876 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
9877 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
9878 size
= integer_zero_node
;
9880 declarator
= TREE_OPERAND (declarator
, 0);
9882 type
= create_array_type_for_decl (dname
, type
, size
);
9891 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
9892 tree inner_decl
= TREE_OPERAND (declarator
, 0);
9894 /* Declaring a function type.
9895 Make sure we have a valid type for the function to return. */
9897 /* We now know that the TYPE_QUALS don't apply to the
9898 decl, but to its return type. */
9899 type_quals
= TYPE_UNQUALIFIED
;
9901 /* Warn about some types functions can't return. */
9903 if (TREE_CODE (type
) == FUNCTION_TYPE
)
9905 error ("`%s' declared as function returning a function", name
);
9906 type
= integer_type_node
;
9908 if (TREE_CODE (type
) == ARRAY_TYPE
)
9910 error ("`%s' declared as function returning an array", name
);
9911 type
= integer_type_node
;
9914 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
9915 inner_decl
= TREE_OPERAND (inner_decl
, 1);
9917 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
9920 /* Pick up type qualifiers which should be applied to `this'. */
9921 quals
= CALL_DECLARATOR_QUALS (declarator
);
9923 /* Pick up the exception specifications. */
9924 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
9926 /* Say it's a definition only for the CALL_EXPR
9927 closest to the identifier. */
9930 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
9931 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
9932 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
9934 if (ctype
== NULL_TREE
9935 && decl_context
== FIELD
9937 && (friendp
== 0 || dname
== current_class_name
))
9938 ctype
= current_class_type
;
9940 if (ctype
&& return_type
== return_conversion
)
9941 TYPE_HAS_CONVERSION (ctype
) = 1;
9942 if (ctype
&& constructor_name (ctype
) == dname
)
9944 /* We are within a class's scope. If our declarator name
9945 is the same as the class name, and we are defining
9946 a function, then it is a constructor/destructor, and
9947 therefore returns a void type. */
9949 if (flags
== DTOR_FLAG
)
9951 /* ANSI C++ June 5 1992 WP 12.4.1. A destructor may
9952 not be declared const or volatile. A destructor
9953 may not be static. */
9955 error ("destructor cannot be static member function");
9958 cp_error ("destructors may not be `%s'",
9959 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
9962 if (decl_context
== FIELD
)
9964 if (! member_function_or_else (ctype
, current_class_type
,
9965 "destructor for alien class `%s' cannot be a member"))
9966 return void_type_node
;
9969 else /* It's a constructor. */
9973 /* ANSI C++ June 5 1992 WP 12.1.2. A constructor may
9974 not be declared const or volatile. A constructor may
9975 not be virtual. A constructor may not be static. */
9977 error ("constructor cannot be static member function");
9980 pedwarn ("constructors cannot be declared virtual");
9985 cp_error ("constructors may not be `%s'",
9986 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
9990 RID_BIT_TYPE tmp_bits
;
9991 bcopy ((void*)&specbits
, (void*)&tmp_bits
, sizeof (RID_BIT_TYPE
));
9992 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
9993 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
9994 if (RIDBIT_ANY_SET (tmp_bits
))
9995 error ("return value type specifier for constructor ignored");
9997 type
= build_pointer_type (ctype
);
9998 if (decl_context
== FIELD
)
10000 if (! member_function_or_else (ctype
, current_class_type
,
10001 "constructor for alien class `%s' cannot be member"))
10002 return void_type_node
;
10003 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10004 if (return_type
!= return_ctor
)
10008 if (decl_context
== FIELD
)
10014 error ("can't initialize friend function `%s'", name
);
10017 /* Cannot be both friend and virtual. */
10018 error ("virtual functions cannot be friends");
10019 RIDBIT_RESET (RID_FRIEND
, specbits
);
10022 if (decl_context
== NORMAL
)
10023 error ("friend declaration not in class definition");
10024 if (current_function_decl
&& funcdef_flag
)
10025 cp_error ("can't define friend function `%s' in a local class definition",
10029 /* Construct the function type and go to the next
10030 inner layer of declarator. */
10032 declarator
= TREE_OPERAND (declarator
, 0);
10034 /* FIXME: This is where default args should be fully
10037 arg_types
= grokparms (inner_parms
, funcdecl_p
? funcdef_flag
: 0);
10039 if (declarator
&& flags
== DTOR_FLAG
)
10041 /* A destructor declared in the body of a class will
10042 be represented as a BIT_NOT_EXPR. But, we just
10043 want the underlying IDENTIFIER. */
10044 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10045 declarator
= TREE_OPERAND (declarator
, 0);
10047 if (strict_prototype
== 0 && arg_types
== NULL_TREE
)
10048 arg_types
= void_list_node
;
10049 else if (arg_types
== NULL_TREE
10050 || arg_types
!= void_list_node
)
10052 cp_error ("destructors may not have parameters");
10053 arg_types
= void_list_node
;
10054 last_function_parms
= NULL_TREE
;
10058 /* ANSI says that `const int foo ();'
10059 does not make the function foo const. */
10060 type
= build_function_type (type
, arg_types
);
10064 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10065 if (TREE_PURPOSE (t
)
10066 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10068 add_defarg_fn (type
);
10077 /* Filter out pointers-to-references and references-to-references.
10078 We can get these if a TYPE_DECL is used. */
10080 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10082 error ("cannot declare %s to references",
10083 TREE_CODE (declarator
) == ADDR_EXPR
10084 ? "references" : "pointers");
10085 declarator
= TREE_OPERAND (declarator
, 0);
10089 if (TREE_CODE (type
) == OFFSET_TYPE
10090 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10091 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10093 cp_error ("cannot declare pointer to `%#T' member",
10095 type
= TREE_TYPE (type
);
10098 /* Merge any constancy or volatility into the target type
10099 for the pointer. */
10101 /* We now know that the TYPE_QUALS don't apply to the decl,
10102 but to the target of the pointer. */
10103 type_quals
= TYPE_UNQUALIFIED
;
10105 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10107 if (TREE_CODE (type
) == VOID_TYPE
)
10108 error ("invalid type: `void &'");
10110 type
= build_reference_type (type
);
10112 else if (TREE_CODE (type
) == METHOD_TYPE
)
10113 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10115 type
= build_pointer_type (type
);
10117 /* Process a list of type modifier keywords (such as
10118 const or volatile) that were given inside the `*' or `&'. */
10120 if (TREE_TYPE (declarator
))
10122 register tree typemodlist
;
10128 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10129 typemodlist
= TREE_CHAIN (typemodlist
))
10131 tree qualifier
= TREE_VALUE (typemodlist
);
10133 if (qualifier
== ridpointers
[(int) RID_CONST
])
10135 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10137 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10142 error ("invalid type modifier within pointer declarator");
10146 pedwarn ("duplicate `const'");
10148 pedwarn ("duplicate `volatile'");
10150 pedwarn ("duplicate `restrict'");
10152 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10153 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10154 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10155 if (TREE_CODE (declarator
) == ADDR_EXPR
10156 && (constp
|| volatilep
))
10159 pedwarn ("discarding `const' applied to a reference");
10161 pedwarn ("discarding `volatile' applied to a reference");
10162 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10164 type
= cp_build_qualified_type (type
, type_quals
);
10166 declarator
= TREE_OPERAND (declarator
, 0);
10172 /* We have converted type names to NULL_TREE if the
10173 name was bogus, or to a _TYPE node, if not.
10175 The variable CTYPE holds the type we will ultimately
10176 resolve to. The code here just needs to build
10177 up appropriate member types. */
10178 tree sname
= TREE_OPERAND (declarator
, 1);
10181 /* Destructors can have their visibilities changed as well. */
10182 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10183 sname
= TREE_OPERAND (sname
, 0);
10185 if (TREE_COMPLEXITY (declarator
) == 0)
10186 /* This needs to be here, in case we are called
10187 multiple times. */ ;
10188 else if (TREE_COMPLEXITY (declarator
) == -1)
10189 /* Namespace member. */
10190 pop_decl_namespace ();
10191 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10192 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10193 else if (! IS_AGGR_TYPE_CODE
10194 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10196 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10198 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10199 that refer to ctype. They couldn't be resolved earlier
10200 because we hadn't pushed into the class yet.
10201 Example: resolve 'B<T>::type' in
10202 'B<typename B<T>::type> B<T>::f () { }'. */
10203 if (current_template_parms
10204 && uses_template_parms (type
)
10205 && uses_template_parms (current_class_type
))
10207 tree args
= current_template_args ();
10208 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10211 /* This pop_nested_class corresponds to the
10212 push_nested_class used to push into class scope for
10213 parsing the argument list of a function decl, in
10215 pop_nested_class ();
10216 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10219 my_friendly_abort (16);
10221 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10223 /* We had a reference to a global decl, or
10224 perhaps we were given a non-aggregate typedef,
10225 in which case we cleared this out, and should just
10226 keep going as though it wasn't there. */
10227 declarator
= sname
;
10230 ctype
= TREE_OPERAND (declarator
, 0);
10233 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10235 if (CLASSTYPE_TEMPLATE_INFO (t
) &&
10236 !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
10237 template_count
+= 1;
10238 t
= TYPE_MAIN_DECL (t
);
10239 if (DECL_LANG_SPECIFIC (t
))
10240 t
= DECL_CLASS_CONTEXT (t
);
10245 if (sname
== NULL_TREE
)
10248 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10250 /* This is the `standard' use of the scoping operator:
10251 basetype :: member . */
10253 if (ctype
== current_class_type
)
10259 Is this ill-formed? */
10262 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10265 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10267 if (current_class_type
== NULL_TREE
10269 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10270 TYPE_ARG_TYPES (type
));
10273 cp_error ("cannot declare member function `%T::%s' within `%T'",
10274 ctype
, name
, current_class_type
);
10275 return void_type_node
;
10278 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10279 || TYPE_SIZE (complete_type (ctype
)) != NULL_TREE
)
10281 /* Have to move this code elsewhere in this function.
10282 this code is used for i.e., typedef int A::M; M *pm;
10284 It is? How? jason 10/2/94 */
10286 if (current_class_type
)
10288 cp_error ("cannot declare member `%T::%s' within `%T'",
10289 ctype
, name
, current_class_type
);
10290 return void_type_node
;
10292 type
= build_offset_type (ctype
, type
);
10294 else if (uses_template_parms (ctype
))
10296 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10298 = build_cplus_method_type (ctype
, TREE_TYPE (type
),
10299 TYPE_ARG_TYPES (type
));
10303 cp_error ("structure `%T' not yet defined", ctype
);
10304 return error_mark_node
;
10307 declarator
= sname
;
10309 else if (TREE_CODE (sname
) == SCOPE_REF
)
10310 my_friendly_abort (17);
10314 declarator
= TREE_OPERAND (declarator
, 1);
10315 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10316 /* In this case, we will deal with it later. */
10320 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10321 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10322 TYPE_ARG_TYPES (type
));
10324 type
= build_offset_type (ctype
, type
);
10331 declarator
= TREE_OPERAND (declarator
, 0);
10336 case ENUMERAL_TYPE
:
10337 declarator
= NULL_TREE
;
10341 declarator
= NULL_TREE
;
10345 my_friendly_abort (158);
10349 /* See the comment for the TREE_LIST case, above. */
10352 if (! ignore_attrs
)
10353 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10355 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
10357 attrlist
= build_decl_list (NULL_TREE
, inner_attrs
);
10360 /* Now TYPE has the actual type. */
10362 if (explicitp
== 1 || (explicitp
&& friendp
))
10364 /* [dcl.fct.spec] The explicit specifier shall only be used in
10365 declarations of constructors within a class definition. */
10366 error ("only declarations of constructors can be `explicit'");
10370 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10372 if (current_class_name
== NULL_TREE
|| decl_context
== PARM
|| friendp
)
10374 error ("non-member `%s' cannot be declared `mutable'", name
);
10375 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10377 else if (decl_context
== TYPENAME
|| RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10379 error ("non-object member `%s' cannot be declared `mutable'", name
);
10380 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10382 else if (TREE_CODE (type
) == FUNCTION_TYPE
10383 || TREE_CODE (type
) == METHOD_TYPE
)
10385 error ("function `%s' cannot be declared `mutable'", name
);
10386 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10390 error ("static `%s' cannot be declared `mutable'", name
);
10391 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10393 else if (type_quals
& TYPE_QUAL_CONST
)
10395 error ("const `%s' cannot be declared `mutable'", name
);
10396 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10400 if (declarator
== NULL_TREE
10401 || TREE_CODE (declarator
) == IDENTIFIER_NODE
10402 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
10403 && (TREE_CODE (type
) == FUNCTION_TYPE
10404 || TREE_CODE (type
) == METHOD_TYPE
)))
10406 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10408 cp_error ("template-id `%D' used as a declarator", declarator
);
10409 declarator
= dname
;
10412 /* Unexpected declarator format. */
10413 my_friendly_abort (990210);
10415 /* If this is declaring a typedef name, return a TYPE_DECL. */
10417 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
10421 /* Note that the grammar rejects storage classes
10422 in typenames, fields or parameters. */
10423 if (current_lang_name
== lang_name_java
)
10424 TYPE_FOR_JAVA (type
) = 1;
10426 if (decl_context
== FIELD
)
10428 if (declarator
== constructor_name (current_class_type
))
10429 cp_pedwarn ("ANSI C++ forbids nested type `%D' with same name as enclosing class",
10431 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10435 /* Make sure this typedef lives as long as its type,
10436 since it might be used as a template parameter. */
10437 if (processing_template_decl
)
10438 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10440 decl
= build_decl (TYPE_DECL
, declarator
, type
);
10443 /* If the user declares "typedef struct {...} foo" then the
10444 struct will have an anonymous name. Fill that name in now.
10445 Nothing can refer to it, so nothing needs know about the name
10447 if (type
!= error_mark_node
10448 && TYPE_NAME (type
)
10449 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
10450 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
10451 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
10453 tree oldname
= TYPE_NAME (type
);
10456 /* Replace the anonymous name with the real name everywhere. */
10457 lookup_tag_reverse (type
, declarator
);
10458 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
10459 if (TYPE_NAME (t
) == oldname
)
10460 TYPE_NAME (t
) = decl
;
10462 if (TYPE_LANG_SPECIFIC (type
))
10463 TYPE_WAS_ANONYMOUS (type
) = 1;
10465 /* If this is a typedef within a template class, the nested
10466 type is a (non-primary) template. The name for the
10467 template needs updating as well. */
10468 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
10469 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
10470 = TYPE_IDENTIFIER (type
);
10472 /* XXX Temporarily set the scope.
10473 When returning, start_decl expects it as NULL_TREE,
10474 and will then then set it using pushdecl. */
10475 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
10476 if (current_class_type
)
10477 DECL_CONTEXT (decl
) = current_class_type
;
10479 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
10481 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
10482 DECL_ASSEMBLER_NAME (decl
)
10483 = get_identifier (build_overload_name (type
, 1, 1));
10484 DECL_CONTEXT (decl
) = NULL_TREE
;
10486 /* FIXME remangle member functions; member functions of a
10487 type with external linkage have external linkage. */
10490 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10492 cp_error_at ("typedef name may not be class-qualified", decl
);
10497 if (ctype
== NULL_TREE
)
10499 if (TREE_CODE (type
) != METHOD_TYPE
)
10500 cp_error_at ("invalid type qualifier for non-method type", decl
);
10502 ctype
= TYPE_METHOD_BASETYPE (type
);
10504 if (ctype
!= NULL_TREE
)
10505 grok_method_quals (ctype
, decl
, quals
);
10508 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10509 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
10510 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
10512 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
10513 inlinep
, friendp
, raises
!= NULL_TREE
);
10516 error ("typedef declaration includes an initializer");
10521 /* Detect the case of an array type of unspecified size
10522 which came, as such, direct from a typedef name.
10523 We must copy the type, so that each identifier gets
10524 a distinct type, so that each identifier's size can be
10525 controlled separately by its own initializer. */
10527 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
10528 && TYPE_DOMAIN (type
) == NULL_TREE
)
10530 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
10533 /* If this is a type name (such as, in a cast or sizeof),
10534 compute the type and return it now. */
10536 if (decl_context
== TYPENAME
)
10538 /* Note that the grammar rejects storage classes
10539 in typenames, fields or parameters. */
10540 if (type_quals
!= TYPE_UNQUALIFIED
)
10541 type_quals
= TYPE_UNQUALIFIED
;
10543 /* Special case: "friend class foo" looks like a TYPENAME context. */
10546 if (type_quals
!= TYPE_UNQUALIFIED
)
10548 cp_error ("type qualifiers specified for friend class declaration");
10549 type_quals
= TYPE_UNQUALIFIED
;
10553 cp_error ("`inline' specified for friend class declaration");
10557 /* Only try to do this stuff if we didn't already give up. */
10558 if (type
!= integer_type_node
)
10560 /* A friendly class? */
10561 if (current_class_type
)
10562 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
10564 error ("trying to make class `%s' a friend of global scope",
10565 TYPE_NAME_STRING (type
));
10566 type
= void_type_node
;
10571 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
10572 if (ctype
== NULL_TREE
)
10574 my_friendly_assert (TREE_CODE (type
) == METHOD_TYPE
, 159);
10575 ctype
= TYPE_METHOD_BASETYPE (type
);
10577 grok_method_quals (ctype
, dummy
, quals
);
10578 type
= TREE_TYPE (dummy
);
10583 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
10584 && decl_context
!= CATCHPARM
10585 && TREE_CODE (type
) != UNION_TYPE
10588 cp_error ("abstract declarator `%T' used as declaration", type
);
10589 declarator
= make_anon_name ();
10592 /* `void' at top level (not within pointer)
10593 is allowed only in typedefs or type names.
10594 We don't complain about parms either, but that is because
10595 a better error message can be made later. */
10597 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
10600 error ("unnamed variable or field declared void");
10601 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10603 if (IDENTIFIER_OPNAME_P (declarator
))
10604 my_friendly_abort (356);
10606 error ("variable or field `%s' declared void", name
);
10609 error ("variable or field declared void");
10610 type
= integer_type_node
;
10613 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
10614 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
10616 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10618 if (ctype
|| in_namespace
)
10619 error ("cannot use `::' in parameter declaration");
10621 /* A parameter declared as an array of T is really a pointer to T.
10622 One declared as a function is really a pointer to a function.
10623 One declared as a member is really a pointer to member. */
10625 if (TREE_CODE (type
) == ARRAY_TYPE
)
10627 /* Transfer const-ness of array into that of type pointed to. */
10628 type
= build_pointer_type (TREE_TYPE (type
));
10629 type_quals
= TYPE_UNQUALIFIED
;
10631 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10632 type
= build_pointer_type (type
);
10633 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10634 type
= build_pointer_type (type
);
10635 else if (TREE_CODE (type
) == VOID_TYPE
&& declarator
)
10637 error ("declaration of `%s' as void", name
);
10643 register tree decl
;
10645 if (decl_context
== PARM
)
10647 decl
= build_decl (PARM_DECL
, declarator
, type
);
10649 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
10650 inlinep
, friendp
, raises
!= NULL_TREE
);
10652 /* Compute the type actually passed in the parmlist,
10653 for the case where there is no prototype.
10654 (For example, shorts and chars are passed as ints.)
10655 When there is a prototype, this is overridden later. */
10657 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
10659 else if (decl_context
== FIELD
)
10661 if (type
== error_mark_node
)
10663 /* Happens when declaring arrays of sizes which
10664 are error_mark_node, for example. */
10667 else if (in_namespace
&& !friendp
)
10669 /* Something like struct S { int N::j; }; */
10670 cp_error ("invalid use of `::'");
10673 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10676 tree function_context
;
10678 /* We catch the others as conflicts with the builtin
10680 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
10682 cp_error ("function `%D' cannot be declared friend",
10689 if (ctype
== NULL_TREE
)
10690 ctype
= current_class_type
;
10692 if (ctype
== NULL_TREE
)
10694 cp_error ("can't make `%D' into a method -- not in a class",
10696 return void_type_node
;
10699 /* ``A union may [ ... ] not [ have ] virtual functions.''
10701 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
10703 cp_error ("function `%D' declared virtual inside a union",
10705 return void_type_node
;
10708 if (declarator
== ansi_opname
[(int) NEW_EXPR
]
10709 || declarator
== ansi_opname
[(int) VEC_NEW_EXPR
]
10710 || declarator
== ansi_opname
[(int) DELETE_EXPR
]
10711 || declarator
== ansi_opname
[(int) VEC_DELETE_EXPR
])
10715 cp_error ("`%D' cannot be declared virtual, since it is always static",
10720 else if (staticp
< 2)
10721 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10722 TYPE_ARG_TYPES (type
));
10725 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
10726 function_context
= (ctype
!= NULL_TREE
) ?
10727 hack_decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
10728 publicp
= (! friendp
|| ! staticp
)
10729 && function_context
== NULL_TREE
;
10730 decl
= grokfndecl (ctype
, type
,
10731 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
10732 ? declarator
: dname
,
10734 virtualp
, flags
, quals
, raises
,
10735 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
10736 funcdef_flag
, template_count
, in_namespace
);
10737 if (decl
== NULL_TREE
)
10740 /* This clobbers the attrs stored in `decl' from `attrlist'. */
10741 /* The decl and setting of decl_machine_attr is also turned off. */
10742 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
10745 /* [class.conv.ctor]
10747 A constructor declared without the function-specifier
10748 explicit that can be called with a single parameter
10749 specifies a conversion from the type of its first
10750 parameter to the type of its class. Such a constructor
10751 is called a converting constructor. */
10752 if (explicitp
== 2)
10753 DECL_NONCONVERTING_P (decl
) = 1;
10754 else if (DECL_CONSTRUCTOR_P (decl
))
10756 /* The constructor can be called with exactly one
10757 parameter if there is at least one parameter, and
10758 any subsequent parameters have default arguments.
10759 We don't look at the first parameter, which is
10760 really just the `this' parameter for the new
10763 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
10765 /* Skip the `in_chrg' argument too, if present. */
10766 if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (decl
)))
10767 arg_types
= TREE_CHAIN (arg_types
);
10769 if (arg_types
== void_list_node
10771 && TREE_CHAIN (arg_types
)
10772 && TREE_CHAIN (arg_types
) != void_list_node
10773 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
10774 DECL_NONCONVERTING_P (decl
) = 1;
10777 else if (TREE_CODE (type
) == METHOD_TYPE
)
10779 /* We only get here for friend declarations of
10780 members of other classes. */
10781 /* All method decls are public, so tell grokfndecl to set
10782 TREE_PUBLIC, also. */
10783 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
10784 virtualp
, flags
, quals
, raises
,
10785 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
10786 template_count
, in_namespace
);
10787 if (decl
== NULL_TREE
)
10790 else if (!staticp
&& ! processing_template_decl
10791 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
10792 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
10795 cp_error ("field `%D' has incomplete type", declarator
);
10797 cp_error ("name `%T' has incomplete type", type
);
10799 /* If we're instantiating a template, tell them which
10800 instantiation made the field's type be incomplete. */
10801 if (current_class_type
10802 && TYPE_NAME (current_class_type
)
10803 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
10804 && declspecs
&& TREE_VALUE (declspecs
)
10805 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
10806 cp_error (" in instantiation of template `%T'",
10807 current_class_type
);
10809 type
= error_mark_node
;
10816 error ("`%s' is neither function nor method; cannot be declared friend",
10817 IDENTIFIER_POINTER (declarator
));
10825 /* Friends are treated specially. */
10826 if (ctype
== current_class_type
)
10827 warning ("member functions are implicitly friends of their class");
10830 tree t
= NULL_TREE
;
10831 if (decl
&& DECL_NAME (decl
))
10833 if (template_class_depth (current_class_type
) == 0)
10836 = check_explicit_specialization
10838 template_count
, 2 * (funcdef_flag
!= 0) + 4);
10839 if (decl
== error_mark_node
)
10840 return error_mark_node
;
10843 t
= do_friend (ctype
, declarator
, decl
,
10844 last_function_parms
, attrlist
, flags
, quals
,
10847 if (t
&& funcdef_flag
)
10850 return void_type_node
;
10854 /* Structure field. It may not be a function, except for C++ */
10856 if (decl
== NULL_TREE
)
10862 /* An attempt is being made to initialize a non-static
10863 member. But, from [class.mem]:
10865 4 A member-declarator can contain a
10866 constant-initializer only if it declares a static
10867 member (_class.static_) of integral or enumeration
10868 type, see _class.static.data_.
10870 This used to be relatively common practice, but
10871 the rest of the compiler does not correctly
10872 handle the initialization unless the member is
10873 static so we make it static below. */
10874 cp_pedwarn ("ANSI C++ forbids initialization of member `%D'",
10876 cp_pedwarn ("making `%D' static", declarator
);
10880 if (uses_template_parms (type
))
10881 /* We'll check at instantiation time. */
10883 else if (check_static_variable_definition (declarator
,
10885 /* If we just return the declaration, crashes
10886 will sometimes occur. We therefore return
10887 void_type_node, as if this was a friend
10888 declaration, to cause callers to completely
10889 ignore this declaration. */
10890 return void_type_node
;
10893 /* 9.2p13 [class.mem] */
10894 if (declarator
== constructor_name (current_class_type
)
10895 /* Divergence from the standard: In extern "C", we
10896 allow non-static data members here, because C does
10897 and /usr/include/netinet/in.h uses that. */
10898 && (staticp
|| ! in_system_header
))
10899 cp_pedwarn ("ANSI C++ forbids data member `%D' with same name as enclosing class",
10904 /* C++ allows static class members. All other work
10905 for this is done by grokfield. */
10906 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
10907 TREE_STATIC (decl
) = 1;
10908 /* In class context, 'static' means public access. */
10909 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
10913 decl
= build_lang_decl (FIELD_DECL
, declarator
, type
);
10914 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10916 DECL_MUTABLE_P (decl
) = 1;
10917 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10921 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
10922 inlinep
, friendp
, raises
!= NULL_TREE
);
10925 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10927 tree original_name
;
10933 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10934 original_name
= dname
;
10936 original_name
= declarator
;
10938 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10939 error ("storage class `auto' invalid for function `%s'", name
);
10940 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
10941 error ("storage class `register' invalid for function `%s'", name
);
10943 /* Function declaration not at top level.
10944 Storage classes other than `extern' are not allowed
10945 and `extern' makes no difference. */
10946 if (! toplevel_bindings_p ()
10947 && (RIDBIT_SETP (RID_STATIC
, specbits
)
10948 || RIDBIT_SETP (RID_INLINE
, specbits
))
10951 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10952 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
10954 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
10957 if (ctype
== NULL_TREE
)
10961 error ("virtual non-class function `%s'", name
);
10965 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
10966 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10967 TYPE_ARG_TYPES (type
));
10969 /* Record presence of `static'. */
10970 publicp
= (ctype
!= NULL_TREE
10971 || RIDBIT_SETP (RID_EXTERN
, specbits
)
10972 || !RIDBIT_SETP (RID_STATIC
, specbits
));
10974 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
10975 virtualp
, flags
, quals
, raises
,
10977 publicp
, inlinep
, funcdef_flag
,
10978 template_count
, in_namespace
);
10979 if (decl
== NULL_TREE
)
10984 int illegal_static
= 0;
10986 /* Don't allow a static member function in a class, and forbid
10987 declaring main to be static. */
10988 if (TREE_CODE (type
) == METHOD_TYPE
)
10990 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
10991 illegal_static
= 1;
10993 else if (current_function_decl
)
10995 /* FIXME need arm citation */
10996 error ("cannot declare static function inside another function");
10997 illegal_static
= 1;
11000 if (illegal_static
)
11003 RIDBIT_RESET (RID_STATIC
, specbits
);
11009 /* It's a variable. */
11011 /* An uninitialized decl with `extern' is a reference. */
11012 decl
= grokvardecl (type
, declarator
, &specbits
,
11014 (type_quals
& TYPE_QUAL_CONST
) != 0,
11016 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11017 inlinep
, friendp
, raises
!= NULL_TREE
);
11021 DECL_CONTEXT (decl
) = ctype
;
11024 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11026 RIDBIT_RESET (RID_STATIC
, specbits
);
11028 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11030 cp_error ("static member `%D' declared `register'", decl
);
11031 RIDBIT_RESET (RID_REGISTER
, specbits
);
11033 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11035 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11037 RIDBIT_RESET (RID_EXTERN
, specbits
);
11042 my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE
, specbits
), 19990927);
11044 /* Record `register' declaration for warnings on &
11045 and in case doing stupid register allocation. */
11047 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11048 DECL_REGISTER (decl
) = 1;
11050 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11051 DECL_THIS_EXTERN (decl
) = 1;
11053 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11054 DECL_THIS_STATIC (decl
) = 1;
11056 /* Record constancy and volatility. There's no need to do this
11057 when processing a template; we'll do this for the instantiated
11058 declaration based on the type of DECL. */
11059 if (!processing_template_decl
)
11060 c_apply_type_quals_to_decl (type_quals
, decl
);
11066 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11067 An empty exprlist is a parmlist. An exprlist which
11068 contains only identifiers at the global level
11069 is a parmlist. Otherwise, it is an exprlist. */
11072 parmlist_is_exprlist (exprs
)
11075 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11078 if (toplevel_bindings_p ())
11080 /* At the global level, if these are all identifiers,
11081 then it is a parmlist. */
11084 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11086 exprs
= TREE_CHAIN (exprs
);
11093 /* Subroutine of start_function. Ensure that each of the parameter
11094 types (as listed in PARMS) is complete, as is required for a
11095 function definition. */
11098 require_complete_types_for_parms (parms
)
11103 tree type
= TREE_TYPE (parms
);
11104 if (TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
11106 if (DECL_NAME (parms
))
11107 error ("parameter `%s' has incomplete type",
11108 IDENTIFIER_POINTER (DECL_NAME (parms
)));
11110 error ("parameter has incomplete type");
11111 TREE_TYPE (parms
) = error_mark_node
;
11114 layout_decl (parms
, 0);
11116 parms
= TREE_CHAIN (parms
);
11120 /* Returns *TP if *TP is a local variable (or parameter). Returns
11121 NULL_TREE otherwise. */
11124 local_variable_p (tp
, walk_subtrees
, data
)
11126 int *walk_subtrees ATTRIBUTE_UNUSED
;
11127 void *data ATTRIBUTE_UNUSED
;
11131 if ((TREE_CODE (t
) == VAR_DECL
11132 /* A VAR_DECL with a context that is a _TYPE is a static data
11134 && !TYPE_P (CP_DECL_CONTEXT (t
))
11135 /* Any other non-local variable must be at namespace scope. */
11136 && TREE_CODE (CP_DECL_CONTEXT (t
)) != NAMESPACE_DECL
)
11137 || (TREE_CODE (t
) == PARM_DECL
))
11143 /* Check that ARG, which is a default-argument expression for a
11144 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11145 something goes wrong. DECL may also be a _TYPE node, rather than a
11146 DECL, if there is no DECL available. */
11149 check_default_argument (decl
, arg
)
11156 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11157 /* We get a DEFAULT_ARG when looking at an in-class declaration
11158 with a default argument. Ignore the argument for now; we'll
11159 deal with it after the class is complete. */
11162 if (processing_template_decl
|| uses_template_parms (arg
))
11163 /* We don't do anything checking until instantiation-time. Note
11164 that there may be uninstantiated arguments even for an
11165 instantiated function, since default arguments are not
11166 instantiated until they are needed. */
11175 decl_type
= TREE_TYPE (decl
);
11177 if (arg
== error_mark_node
11178 || decl
== error_mark_node
11179 || TREE_TYPE (arg
) == error_mark_node
11180 || decl_type
== error_mark_node
)
11181 /* Something already went wrong. There's no need to check
11183 return error_mark_node
;
11185 /* [dcl.fct.default]
11187 A default argument expression is implicitly converted to the
11189 if (!TREE_TYPE (arg
)
11190 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11193 cp_error ("default argument for `%#D' has type `%T'",
11194 decl
, TREE_TYPE (arg
));
11196 cp_error ("default argument for parameter of type `%T' has type `%T'",
11197 decl_type
, TREE_TYPE (arg
));
11199 return error_mark_node
;
11202 /* [dcl.fct.default]
11204 Local variables shall not be used in default argument
11207 The keyword `this' shall not be used in a default argument of a
11208 member function. */
11209 var
= walk_tree (&arg
, local_variable_p
, NULL
);
11212 cp_error ("default argument `%E' uses local variable `%D'",
11214 return error_mark_node
;
11221 /* Decode the list of parameter types for a function type.
11222 Given the list of things declared inside the parens,
11223 return a list of types.
11225 The list we receive can have three kinds of elements:
11226 an IDENTIFIER_NODE for names given without types,
11227 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11228 or void_type_node, to mark the end of an argument list
11229 when additional arguments are not permitted (... was not used).
11231 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11232 a mere declaration. A nonempty identifier-list gets an error message
11233 when FUNCDEF_FLAG is zero.
11234 If FUNCDEF_FLAG is 1, then parameter types must be complete.
11235 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11237 If all elements of the input list contain types,
11238 we return a list of the types.
11239 If all elements contain no type (except perhaps a void_type_node
11240 at the end), we return a null list.
11241 If some have types and some do not, it is an error, and we
11242 return a null list.
11244 Also set last_function_parms to either
11245 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11246 A list of names is converted to a chain of PARM_DECLs
11247 by store_parm_decls so that ultimately it is always a chain of decls.
11249 Note that in C++, parameters can take default values. These default
11250 values are in the TREE_PURPOSE field of the TREE_LIST. It is
11251 an error to specify default values which are followed by parameters
11252 that have no default values, or an ELLIPSES. For simplicities sake,
11253 only parameters which are specified with their types can take on
11257 grokparms (first_parm
, funcdef_flag
)
11261 tree result
= NULL_TREE
;
11262 tree decls
= NULL_TREE
;
11264 if (first_parm
!= NULL_TREE
11265 && TREE_CODE (TREE_VALUE (first_parm
)) == IDENTIFIER_NODE
)
11267 if (! funcdef_flag
)
11268 pedwarn ("parameter names (without types) in function declaration");
11269 last_function_parms
= first_parm
;
11272 else if (first_parm
!= NULL_TREE
11273 && TREE_CODE (TREE_VALUE (first_parm
)) != TREE_LIST
11274 && TREE_CODE (TREE_VALUE (first_parm
)) != VOID_TYPE
)
11275 my_friendly_abort (145);
11278 /* Types were specified. This is a list of declarators
11279 each represented as a TREE_LIST node. */
11280 register tree parm
, chain
;
11281 int any_init
= 0, any_error
= 0;
11283 if (first_parm
!= NULL_TREE
)
11285 tree last_result
= NULL_TREE
;
11286 tree last_decl
= NULL_TREE
;
11288 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11290 tree type
= NULL_TREE
, list_node
= parm
;
11291 register tree decl
= TREE_VALUE (parm
);
11292 tree init
= TREE_PURPOSE (parm
);
11294 chain
= TREE_CHAIN (parm
);
11295 /* @@ weak defense against parse errors. */
11296 if (TREE_CODE (decl
) != VOID_TYPE
11297 && TREE_CODE (decl
) != TREE_LIST
)
11299 /* Give various messages as the need arises. */
11300 if (TREE_CODE (decl
) == STRING_CST
)
11301 cp_error ("invalid string constant `%E'", decl
);
11302 else if (TREE_CODE (decl
) == INTEGER_CST
)
11303 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11307 if (TREE_CODE (decl
) != VOID_TYPE
)
11309 decl
= grokdeclarator (TREE_VALUE (decl
),
11310 TREE_PURPOSE (decl
),
11311 PARM
, init
!= NULL_TREE
,
11313 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
11316 /* Top-level qualifiers on the parameters are
11317 ignored for function types. */
11318 type
= TYPE_MAIN_VARIANT (TREE_TYPE (decl
));
11320 if (TREE_CODE (type
) == VOID_TYPE
)
11321 decl
= void_type_node
;
11322 else if (TREE_CODE (type
) == METHOD_TYPE
)
11324 if (DECL_NAME (decl
))
11325 /* Cannot use the decl here because
11326 we don't have DECL_CONTEXT set up yet. */
11327 cp_error ("parameter `%D' invalidly declared method type",
11330 error ("parameter invalidly declared method type");
11331 type
= build_pointer_type (type
);
11332 TREE_TYPE (decl
) = type
;
11334 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11336 if (DECL_NAME (decl
))
11337 cp_error ("parameter `%D' invalidly declared offset type",
11340 error ("parameter invalidly declared offset type");
11341 type
= build_pointer_type (type
);
11342 TREE_TYPE (decl
) = type
;
11344 else if (abstract_virtuals_error (decl
, type
))
11345 any_error
= 1; /* Seems like a good idea. */
11346 else if (POINTER_TYPE_P (type
))
11349 while (POINTER_TYPE_P (t
)
11350 || (TREE_CODE (t
) == ARRAY_TYPE
11351 && TYPE_DOMAIN (t
) != NULL_TREE
))
11353 if (TREE_CODE (t
) == ARRAY_TYPE
)
11354 cp_error ("parameter type `%T' includes %s to array of unknown bound",
11356 TYPE_PTR_P (type
) ? "pointer" : "reference");
11360 if (TREE_CODE (decl
) == VOID_TYPE
)
11362 if (result
== NULL_TREE
)
11364 result
= void_list_node
;
11365 last_result
= result
;
11369 TREE_CHAIN (last_result
) = void_list_node
;
11370 last_result
= void_list_node
;
11373 && (chain
!= void_list_node
|| TREE_CHAIN (chain
)))
11374 error ("`void' in parameter list must be entire list");
11378 /* Since there is a prototype, args are passed in their own types. */
11379 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
11380 if (PROMOTE_PROTOTYPES
11381 && (TREE_CODE (type
) == INTEGER_TYPE
11382 || TREE_CODE (type
) == ENUMERAL_TYPE
)
11383 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
11384 DECL_ARG_TYPE (decl
) = integer_type_node
;
11385 if (!any_error
&& init
)
11388 init
= check_default_argument (decl
, init
);
11393 if (decls
== NULL_TREE
)
11400 TREE_CHAIN (last_decl
) = decl
;
11403 list_node
= tree_cons (init
, type
, NULL_TREE
);
11404 if (result
== NULL_TREE
)
11406 result
= list_node
;
11407 last_result
= result
;
11411 TREE_CHAIN (last_result
) = list_node
;
11412 last_result
= list_node
;
11416 TREE_CHAIN (last_result
) = NULL_TREE
;
11417 /* If there are no parameters, and the function does not end
11418 with `...', then last_decl will be NULL_TREE. */
11419 if (last_decl
!= NULL_TREE
)
11420 TREE_CHAIN (last_decl
) = NULL_TREE
;
11424 last_function_parms
= decls
;
11429 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
11430 FUNCTION_TYPE with the newly parsed version of its default argument, which
11431 was previously digested as text. See snarf_defarg et al in lex.c. */
11434 replace_defarg (arg
, init
)
11437 if (! processing_template_decl
11438 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
11439 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
11440 TREE_TYPE (init
), TREE_VALUE (arg
));
11441 TREE_PURPOSE (arg
) = init
;
11448 tree t
= FUNCTION_ARG_CHAIN (d
);
11449 if (DECL_CONSTRUCTOR_P (d
)
11450 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (d
)))
11451 t
= TREE_CHAIN (t
);
11452 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
11453 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
11454 == DECL_CLASS_CONTEXT (d
))
11455 && (TREE_CHAIN (t
) == NULL_TREE
11456 || TREE_CHAIN (t
) == void_list_node
11457 || TREE_PURPOSE (TREE_CHAIN (t
))))
11462 /* These memoizing functions keep track of special properties which
11463 a class may have. `grok_ctor_properties' notices whether a class
11464 has a constructor of the form X(X&), and also complains
11465 if the class has a constructor of the form X(X).
11466 `grok_op_properties' takes notice of the various forms of
11467 operator= which are defined, as well as what sorts of type conversion
11468 may apply. Both functions take a FUNCTION_DECL as an argument. */
11471 grok_ctor_properties (ctype
, decl
)
11474 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
11475 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
11477 /* When a type has virtual baseclasses, a magical first int argument is
11478 added to any ctor so we can tell if the class has been initialized
11479 yet. This could screw things up in this function, so we deliberately
11480 ignore the leading int if we're in that situation. */
11481 if (TYPE_USES_VIRTUAL_BASECLASSES (ctype
))
11483 my_friendly_assert (parmtypes
11484 && TREE_VALUE (parmtypes
) == integer_type_node
,
11486 parmtypes
= TREE_CHAIN (parmtypes
);
11487 parmtype
= TREE_VALUE (parmtypes
);
11492 A non-template constructor for class X is a copy constructor if
11493 its first parameter is of type X&, const X&, volatile X& or const
11494 volatile X&, and either there are no other parameters or else all
11495 other parameters have default arguments. */
11496 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
11497 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
11498 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11499 || TREE_CHAIN (parmtypes
) == void_list_node
11500 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11501 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11502 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11504 TYPE_HAS_INIT_REF (ctype
) = 1;
11505 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11506 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
11510 A declaration of a constructor for a class X is ill-formed if its
11511 first parameter is of type (optionally cv-qualified) X and either
11512 there are no other parameters or else all other parameters have
11515 We *don't* complain about member template instantiations that
11516 have this form, though; they can occur as we try to decide what
11517 constructor to use during overload resolution. Since overload
11518 resolution will never prefer such a constructor to the
11519 non-template copy constructor (which is either explicitly or
11520 implicitly defined), there's no need to worry about their
11521 existence. Theoretically, they should never even be
11522 instantiated, but that's hard to forestall. */
11523 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
11524 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11525 || TREE_CHAIN (parmtypes
) == void_list_node
11526 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11527 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11528 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11530 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
11532 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
11535 else if (TREE_CODE (parmtype
) == VOID_TYPE
11536 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
11537 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
11542 /* An operator with this name can be either unary or binary. */
11548 return (name
== ansi_opname
[(int) INDIRECT_REF
]
11549 || name
== ansi_opname
[(int) ADDR_EXPR
]
11550 || name
== ansi_opname
[(int) NEGATE_EXPR
]
11551 || name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11552 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]
11553 || name
== ansi_opname
[(int) CONVERT_EXPR
]);
11556 /* An operator with this name can only be unary. */
11562 return (name
== ansi_opname
[(int) TRUTH_NOT_EXPR
]
11563 || name
== ansi_opname
[(int) BIT_NOT_EXPR
]
11564 || name
== ansi_opname
[(int) COMPONENT_REF
]
11565 || IDENTIFIER_TYPENAME_P (name
));
11568 /* Do a little sanity-checking on how they declared their operator. */
11571 grok_op_properties (decl
, virtualp
, friendp
)
11573 int virtualp
, friendp
;
11575 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
11576 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
11577 tree name
= DECL_NAME (decl
);
11579 if (current_class_type
== NULL_TREE
)
11586 A user-declared copy assignment operator X::operator= is a
11587 non-static non-template member function of class X with
11588 exactly one parameter of type X, X&, const X&, volatile X& or
11589 const volatile X&. */
11590 if (name
== ansi_opname
[(int) MODIFY_EXPR
]
11591 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11592 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11594 else if (name
== ansi_opname
[(int) CALL_EXPR
])
11595 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
11596 else if (name
== ansi_opname
[(int) ARRAY_REF
])
11597 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
11598 else if (name
== ansi_opname
[(int) COMPONENT_REF
]
11599 || name
== ansi_opname
[(int) MEMBER_REF
])
11600 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
11601 else if (name
== ansi_opname
[(int) NEW_EXPR
])
11602 TYPE_GETS_NEW (current_class_type
) |= 1;
11603 else if (name
== ansi_opname
[(int) DELETE_EXPR
])
11604 TYPE_GETS_DELETE (current_class_type
) |= 1;
11605 else if (name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11606 TYPE_GETS_NEW (current_class_type
) |= 2;
11607 else if (name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11608 TYPE_GETS_DELETE (current_class_type
) |= 2;
11611 if (name
== ansi_opname
[(int) NEW_EXPR
]
11612 || name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11614 /* When the compiler encounters the definition of A::operator new, it
11615 doesn't look at the class declaration to find out if it's static. */
11617 revert_static_member_fn (&decl
, NULL
, NULL
);
11619 /* Take care of function decl if we had syntax errors. */
11620 if (argtypes
== NULL_TREE
)
11622 = build_function_type (ptr_type_node
,
11623 hash_tree_chain (integer_type_node
,
11626 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
11628 else if (name
== ansi_opname
[(int) DELETE_EXPR
]
11629 || name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11632 revert_static_member_fn (&decl
, NULL
, NULL
);
11634 if (argtypes
== NULL_TREE
)
11636 = build_function_type (void_type_node
,
11637 hash_tree_chain (ptr_type_node
,
11641 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
11643 if (! friendp
&& name
== ansi_opname
[(int) VEC_DELETE_EXPR
]
11644 && (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)))
11645 != void_list_node
))
11646 TYPE_VEC_DELETE_TAKES_SIZE (current_class_type
) = 1;
11651 /* An operator function must either be a non-static member function
11652 or have at least one parameter of a class, a reference to a class,
11653 an enumeration, or a reference to an enumeration. 13.4.0.6 */
11654 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
11656 if (IDENTIFIER_TYPENAME_P (name
)
11657 || name
== ansi_opname
[(int) CALL_EXPR
]
11658 || name
== ansi_opname
[(int) MODIFY_EXPR
]
11659 || name
== ansi_opname
[(int) COMPONENT_REF
]
11660 || name
== ansi_opname
[(int) ARRAY_REF
])
11661 cp_error ("`%D' must be a nonstatic member function", decl
);
11666 if (DECL_STATIC_FUNCTION_P (decl
))
11667 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
11670 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
11672 tree arg
= TREE_VALUE (p
);
11673 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
11674 arg
= TREE_TYPE (arg
);
11676 /* This lets bad template code slip through. */
11677 if (IS_AGGR_TYPE (arg
)
11678 || TREE_CODE (arg
) == ENUMERAL_TYPE
11679 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
11680 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
11684 ("`%D' must have an argument of class or enumerated type",
11691 if (name
== ansi_opname
[(int) CALL_EXPR
])
11692 return; /* No restrictions on args. */
11694 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
11696 tree t
= TREE_TYPE (name
);
11697 if (TREE_CODE (t
) == VOID_TYPE
)
11698 pedwarn ("void is not a valid type conversion operator");
11699 else if (! friendp
)
11701 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
11702 const char *what
= 0;
11704 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
11706 if (t
== current_class_type
)
11707 what
= "the same type";
11708 /* Don't force t to be complete here. */
11709 else if (IS_AGGR_TYPE (t
)
11711 && DERIVED_FROM_P (t
, current_class_type
))
11712 what
= "a base class";
11715 warning ("conversion to %s%s will never use a type conversion operator",
11716 ref
? "a reference to " : "", what
);
11720 if (name
== ansi_opname
[(int) MODIFY_EXPR
])
11724 if (list_length (argtypes
) != 3 && methodp
)
11726 cp_error ("`%D' must take exactly one argument", decl
);
11729 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
11731 if (copy_assignment_arg_p (parmtype
, virtualp
)
11734 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
11735 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
11736 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11737 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
11740 else if (name
== ansi_opname
[(int) COND_EXPR
])
11743 cp_error ("ANSI C++ prohibits overloading operator ?:");
11745 else if (ambi_op_p (name
))
11747 if (list_length (argtypes
) == 2)
11749 else if (list_length (argtypes
) == 3)
11751 if ((name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11752 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11753 && ! processing_template_decl
11754 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
11757 cp_error ("postfix `%D' must take `int' as its argument",
11761 ("postfix `%D' must take `int' as its second argument",
11768 cp_error ("`%D' must take either zero or one argument", decl
);
11770 cp_error ("`%D' must take either one or two arguments", decl
);
11773 /* More Effective C++ rule 6. */
11775 && (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11776 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]))
11778 tree arg
= TREE_VALUE (argtypes
);
11779 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
11780 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
11781 arg
= TREE_TYPE (arg
);
11782 arg
= TYPE_MAIN_VARIANT (arg
);
11783 if (list_length (argtypes
) == 2)
11785 if (TREE_CODE (ret
) != REFERENCE_TYPE
11786 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
11788 cp_warning ("prefix `%D' should return `%T'", decl
,
11789 build_reference_type (arg
));
11793 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
11794 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
11798 else if (unary_op_p (name
))
11800 if (list_length (argtypes
) != 2)
11803 cp_error ("`%D' must take `void'", decl
);
11805 cp_error ("`%D' must take exactly one argument", decl
);
11808 else /* if (binary_op_p (name)) */
11810 if (list_length (argtypes
) != 3)
11813 cp_error ("`%D' must take exactly one argument", decl
);
11815 cp_error ("`%D' must take exactly two arguments", decl
);
11818 /* More Effective C++ rule 7. */
11820 && (name
== ansi_opname
[TRUTH_ANDIF_EXPR
]
11821 || name
== ansi_opname
[TRUTH_ORIF_EXPR
]
11822 || name
== ansi_opname
[COMPOUND_EXPR
]))
11823 cp_warning ("user-defined `%D' always evaluates both arguments",
11827 /* Effective C++ rule 23. */
11829 && list_length (argtypes
) == 3
11830 && (name
== ansi_opname
[PLUS_EXPR
]
11831 || name
== ansi_opname
[MINUS_EXPR
]
11832 || name
== ansi_opname
[TRUNC_DIV_EXPR
]
11833 || name
== ansi_opname
[MULT_EXPR
])
11834 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
11835 cp_warning ("`%D' should return by value", decl
);
11839 for (; argtypes
!= void_list_node
; argtypes
= TREE_CHAIN (argtypes
))
11840 if (TREE_PURPOSE (argtypes
))
11842 TREE_PURPOSE (argtypes
) = NULL_TREE
;
11843 if (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11844 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
11847 cp_pedwarn ("`%D' cannot have default arguments", decl
);
11850 cp_error ("`%D' cannot have default arguments", decl
);
11855 static const char *
11857 enum tag_types code
;
11870 my_friendly_abort (981122);
11874 /* Get the struct, enum or union (CODE says which) with tag NAME.
11875 Define the tag as a forward-reference if it is not defined.
11877 C++: If a class derivation is given, process it here, and report
11878 an error if multiple derivation declarations are not identical.
11880 If this is a definition, come in through xref_tag and only look in
11881 the current frame for the name (since C++ allows new names in any
11885 xref_tag (code_type_node
, name
, globalize
)
11886 tree code_type_node
;
11890 enum tag_types tag_code
;
11891 enum tree_code code
;
11892 register tree ref
, t
;
11893 struct binding_level
*b
= current_binding_level
;
11895 tree attributes
= NULL_TREE
;
11896 tree context
= NULL_TREE
;
11898 /* If we are called from the parser, code_type_node will sometimes be a
11899 TREE_LIST. This indicates that the user wrote
11900 "class __attribute__ ((foo)) bar". Extract the attributes so we can
11902 if (TREE_CODE (code_type_node
) == TREE_LIST
)
11904 attributes
= TREE_PURPOSE (code_type_node
);
11905 code_type_node
= TREE_VALUE (code_type_node
);
11908 tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
11913 code
= RECORD_TYPE
;
11919 code
= ENUMERAL_TYPE
;
11922 my_friendly_abort (18);
11925 /* If a cross reference is requested, look up the type
11926 already defined for this tag and return it. */
11927 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
11930 name
= TYPE_IDENTIFIER (t
);
11934 t
= IDENTIFIER_TYPE_VALUE (name
);
11936 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
11937 && TREE_CODE (t
) != TEMPLATE_TEMPLATE_PARM
)
11942 /* If we know we are defining this tag, only look it up in
11943 this scope and don't try to find it as a type. */
11944 ref
= lookup_tag (code
, name
, b
, 1);
11950 /* [dcl.type.elab] If the identifier resolves to a
11951 typedef-name or a template type-parameter, the
11952 elaborated-type-specifier is ill-formed. */
11953 if (t
!= TYPE_MAIN_VARIANT (t
)
11954 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
11955 cp_pedwarn ("using typedef-name `%D' after `%s'",
11956 TYPE_NAME (t
), tag_name (tag_code
));
11957 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
11958 cp_error ("using template type parameter `%T' after `%s'",
11959 t
, tag_name (tag_code
));
11964 ref
= lookup_tag (code
, name
, b
, 0);
11968 /* Try finding it as a type declaration. If that wins,
11970 ref
= lookup_name (name
, 1);
11972 if (ref
!= NULL_TREE
11973 && processing_template_decl
11974 && DECL_CLASS_TEMPLATE_P (ref
)
11975 && template_class_depth (current_class_type
) == 0)
11976 /* Since GLOBALIZE is true, we're declaring a global
11977 template, so we want this type. */
11978 ref
= DECL_RESULT (ref
);
11980 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
11981 && TREE_CODE (TREE_TYPE (ref
)) == code
)
11982 ref
= TREE_TYPE (ref
);
11987 if (ref
&& current_class_type
11988 && template_class_depth (current_class_type
)
11989 && PROCESSING_REAL_TEMPLATE_DECL_P ())
11991 /* Since GLOBALIZE is non-zero, we are not looking at a
11992 definition of this tag. Since, in addition, we are currently
11993 processing a (member) template declaration of a template
11994 class, we must be very careful; consider:
12001 { template <class V>
12002 friend struct S1; };
12004 Here, the S2::S1 declaration should not be confused with the
12005 outer declaration. In particular, the inner version should
12006 have a template parameter of level 2, not level 1. This
12007 would be particularly important if the member declaration
12010 template <class V = U> friend struct S1;
12012 say, when we should tsubst into `U' when instantiating
12013 S2. On the other hand, when presented with:
12023 we must find the inner binding eventually. We
12024 accomplish this by making sure that the new type we
12025 create to represent this declaration has the right
12027 context
= TYPE_CONTEXT (ref
);
12034 /* If no such tag is yet defined, create a forward-reference node
12035 and record it as the "definition".
12036 When a real declaration of this type is found,
12037 the forward-reference will be altered into a real type. */
12038 if (code
== ENUMERAL_TYPE
)
12040 cp_error ("use of enum `%#D' without previous declaration", name
);
12042 ref
= make_node (ENUMERAL_TYPE
);
12044 /* Give the type a default layout like unsigned int
12045 to avoid crashing if it does not get defined. */
12046 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12047 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12048 TREE_UNSIGNED (ref
) = 1;
12049 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12050 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12051 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12053 /* Enable us to recognize when a type is created in class context.
12054 To do nested classes correctly, this should probably be cleared
12055 out when we leave this classes scope. Currently this in only
12056 done in `start_enum'. */
12058 pushtag (name
, ref
, globalize
);
12062 struct binding_level
*old_b
= class_binding_level
;
12064 ref
= make_lang_type (code
);
12065 TYPE_CONTEXT (ref
) = context
;
12067 #ifdef NONNESTED_CLASSES
12068 /* Class types don't nest the way enums do. */
12069 class_binding_level
= (struct binding_level
*)0;
12071 pushtag (name
, ref
, globalize
);
12072 class_binding_level
= old_b
;
12077 /* If it no longer looks like a nested type, make sure it's
12079 If it is not an IDENTIFIER, this is not a declaration */
12080 if (b
->namespace_p
&& !class_binding_level
12081 && TREE_CODE (name
) == IDENTIFIER_NODE
12082 && IDENTIFIER_NAMESPACE_VALUE (name
) == NULL_TREE
)
12083 SET_IDENTIFIER_NAMESPACE_VALUE (name
, TYPE_NAME (ref
));
12085 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12086 redeclare_class_template (ref
, current_template_parms
);
12089 /* Until the type is defined, tentatively accept whatever
12090 structure tag the user hands us. */
12091 if (TYPE_SIZE (ref
) == NULL_TREE
12092 && ref
!= current_class_type
12093 /* Have to check this, in case we have contradictory tag info. */
12094 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12096 if (tag_code
== class_type
)
12097 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12098 else if (tag_code
== record_type
)
12099 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12102 TREE_TYPE (ref
) = attributes
;
12108 xref_tag_from_type (old
, id
, globalize
)
12112 tree code_type_node
;
12114 if (TREE_CODE (old
) == RECORD_TYPE
)
12115 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12116 ? class_type_node
: record_type_node
);
12118 code_type_node
= union_type_node
;
12120 if (id
== NULL_TREE
)
12121 id
= TYPE_IDENTIFIER (old
);
12123 return xref_tag (code_type_node
, id
, globalize
);
12126 /* REF is a type (named NAME), for which we have just seen some
12127 baseclasses. BINFO is a list of those baseclasses; the
12128 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12129 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12130 struct, or union. */
12133 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12134 tree code_type_node
;
12138 /* In the declaration `A : X, Y, ... Z' we mark all the types
12139 (A, X, Y, ..., Z) so we can check for duplicates. */
12144 enum tag_types tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
12146 if (tag_code
== union_type
)
12148 cp_error ("derived union `%T' invalid", ref
);
12152 len
= list_length (binfo
);
12154 /* First, make sure that any templates in base-classes are
12155 instantiated. This ensures that if we call ourselves recursively
12156 we do not get confused about which classes are marked and which
12158 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12159 complete_type (TREE_VALUE (base
));
12161 SET_CLASSTYPE_MARKED (ref
);
12162 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12164 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12166 /* The base of a derived struct is public by default. */
12168 = (TREE_PURPOSE (binfo
) == access_public_node
12169 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12170 || (tag_code
!= class_type
12171 && (TREE_PURPOSE (binfo
) == access_default_node
12172 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12174 = (TREE_PURPOSE (binfo
) == access_protected_node
12175 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12177 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12178 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12179 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12180 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12181 tree basetype
= TREE_VALUE (binfo
);
12184 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12185 basetype
= TREE_TYPE (basetype
);
12187 || (TREE_CODE (basetype
) != RECORD_TYPE
12188 && TREE_CODE (basetype
) != TYPENAME_TYPE
12189 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12190 && TREE_CODE (basetype
) != TEMPLATE_TEMPLATE_PARM
))
12192 cp_error ("base type `%T' fails to be a struct or class type",
12193 TREE_VALUE (binfo
));
12197 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12199 /* This code replaces similar code in layout_basetypes.
12200 We put the complete_type first for implicit `typename'. */
12201 if (TYPE_SIZE (basetype
) == NULL_TREE
12202 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12204 cp_error ("base class `%T' has incomplete type", basetype
);
12209 if (CLASSTYPE_MARKED (basetype
))
12211 if (basetype
== ref
)
12212 cp_error ("recursive type `%T' undefined", basetype
);
12214 cp_error ("duplicate base type `%T' invalid", basetype
);
12218 if (TYPE_FOR_JAVA (basetype
)
12219 && (current_lang_stack
12220 == &VARRAY_TREE (current_lang_base
, 0)))
12221 TYPE_FOR_JAVA (ref
) = 1;
12223 /* Note that the BINFO records which describe individual
12224 inheritances are *not* shared in the lattice! They
12225 cannot be shared because a given baseclass may be
12226 inherited with different `accessibility' by different
12227 derived classes. (Each BINFO record describing an
12228 individual inheritance contains flags which say what
12229 the `accessibility' of that particular inheritance is.) */
12232 = make_binfo (integer_zero_node
, basetype
,
12233 CLASS_TYPE_P (basetype
)
12234 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
12235 CLASS_TYPE_P (basetype
)
12236 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
12238 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
12239 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
12240 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
12241 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
12242 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
12244 /* We need to unshare the binfos now so that lookups during class
12245 definition work. */
12246 unshare_base_binfos (base_binfo
);
12248 SET_CLASSTYPE_MARKED (basetype
);
12250 /* We are free to modify these bits because they are meaningless
12251 at top level, and BASETYPE is a top-level type. */
12252 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
12254 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
12255 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12258 if (CLASS_TYPE_P (basetype
))
12260 TYPE_GETS_NEW (ref
) |= TYPE_GETS_NEW (basetype
);
12261 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
12268 TREE_VEC_LENGTH (binfos
) = i
;
12270 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
12273 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
12276 tree basetype
= BINFO_TYPE (TREE_VEC_ELT (binfos
, 0));
12278 if (CLASS_TYPE_P (basetype
))
12279 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
12280 = TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
12283 if (TYPE_USES_MULTIPLE_INHERITANCE (ref
))
12284 TYPE_USES_COMPLEX_INHERITANCE (ref
) = 1;
12286 /* Unmark all the types. */
12288 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
12289 CLEAR_CLASSTYPE_MARKED (ref
);
12291 /* Now that we know all the base-classes, set up the list of virtual
12293 CLASSTYPE_VBASECLASSES (ref
) = get_vbase_types (ref
);
12297 /* Begin compiling the definition of an enumeration type.
12298 NAME is its name (or null if anonymous).
12299 Returns the type object, as yet incomplete.
12300 Also records info about it so that build_enumerator
12301 may be used to declare the individual values as they are read. */
12307 register tree enumtype
= NULL_TREE
;
12308 struct binding_level
*b
= current_binding_level
;
12310 /* If this is the real definition for a previous forward reference,
12311 fill in the contents in the same object that used to be the
12312 forward reference. */
12314 if (name
!= NULL_TREE
)
12315 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
12317 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
12319 cp_error ("multiple definition of `%#T'", enumtype
);
12320 cp_error_at ("previous definition here", enumtype
);
12321 /* Clear out TYPE_VALUES, and start again. */
12322 TYPE_VALUES (enumtype
) = NULL_TREE
;
12326 enumtype
= make_node (ENUMERAL_TYPE
);
12327 pushtag (name
, enumtype
, 0);
12330 if (current_class_type
)
12331 TREE_ADDRESSABLE (b
->tags
) = 1;
12333 GNU_xref_decl (current_function_decl
, enumtype
);
12337 /* After processing and defining all the values of an enumeration type,
12338 install their decls in the enumeration type and finish it off.
12339 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12340 Returns ENUMTYPE. */
12343 finish_enum (enumtype
)
12346 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
12347 /* Calculate the maximum value of any enumerator in this type. */
12349 tree values
= TYPE_VALUES (enumtype
);
12354 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
12359 /* The TREE_VALUE is a CONST_DECL for this enumeration
12361 decl
= TREE_VALUE (pair
);
12365 Following the closing brace of an enum-specifier, each
12366 enumerator has the type of its enumeration. Prior to the
12367 closing brace, the type of each enumerator is the type of
12368 its initializing value. */
12369 TREE_TYPE (decl
) = enumtype
;
12371 /* The DECL_INITIAL will be NULL if we are processing a
12372 template declaration and this enumeration constant had no
12373 explicit initializer. */
12374 value
= DECL_INITIAL (decl
);
12375 if (value
&& !processing_template_decl
)
12377 /* Set the TREE_TYPE for the VALUE as well. That's so
12378 that when we call decl_constant_value we get an
12379 entity of the right type (but with the constant
12380 value). Since we shouldn't ever call
12381 decl_constant_value on a template type, there's no
12382 reason to do that when processing_template_decl.
12383 And, if the expression is something like a
12384 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12385 wreak havoc on the intended type of the expression.
12387 Of course, there's also no point in trying to compute
12388 minimum or maximum values if we're in a template. */
12389 TREE_TYPE (value
) = enumtype
;
12392 minnode
= maxnode
= value
;
12393 else if (tree_int_cst_lt (maxnode
, value
))
12395 else if (tree_int_cst_lt (value
, minnode
))
12399 if (processing_template_decl
)
12400 /* If this is just a template, leave the CONST_DECL
12401 alone. That way tsubst_copy will find CONST_DECLs for
12402 CONST_DECLs, and not INTEGER_CSTs. */
12405 /* In the list we're building up, we want the enumeration
12406 values, not the CONST_DECLs. */
12407 TREE_VALUE (pair
) = value
;
12411 maxnode
= minnode
= integer_zero_node
;
12413 TYPE_VALUES (enumtype
) = nreverse (values
);
12415 if (processing_template_decl
)
12417 tree scope
= current_scope ();
12418 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
12419 add_tree (build_min (TAG_DEFN
, enumtype
));
12423 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
12424 int lowprec
= min_precision (minnode
, unsignedp
);
12425 int highprec
= min_precision (maxnode
, unsignedp
);
12426 int precision
= MAX (lowprec
, highprec
);
12429 TYPE_SIZE (enumtype
) = NULL_TREE
;
12431 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
12433 TYPE_PRECISION (enumtype
) = precision
;
12435 fixup_unsigned_type (enumtype
);
12437 fixup_signed_type (enumtype
);
12439 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
12440 /* Use the width of the narrowest normal C type which is wide
12442 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
12445 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
12447 TYPE_SIZE (enumtype
) = 0;
12448 layout_type (enumtype
);
12450 /* Fix up all variant types of this enum type. */
12451 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
12452 tem
= TYPE_NEXT_VARIANT (tem
))
12454 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
12455 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
12456 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
12457 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
12458 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
12459 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
12460 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
12461 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
12462 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
12465 /* Finish debugging output for this type. */
12466 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
12472 /* Build and install a CONST_DECL for an enumeration constant of the
12473 enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided.
12474 Assignment of sequential values by default is handled here. */
12477 build_enumerator (name
, value
, enumtype
)
12487 /* Remove no-op casts from the value. */
12489 STRIP_TYPE_NOPS (value
);
12491 if (! processing_template_decl
)
12493 /* Validate and default VALUE. */
12494 if (value
!= NULL_TREE
)
12496 if (TREE_READONLY_DECL_P (value
))
12497 value
= decl_constant_value (value
);
12499 if (TREE_CODE (value
) == INTEGER_CST
)
12501 value
= default_conversion (value
);
12502 constant_expression_warning (value
);
12506 cp_error ("enumerator value for `%D' not integer constant", name
);
12511 /* Default based on previous value. */
12512 if (value
== NULL_TREE
&& ! processing_template_decl
)
12516 if (TYPE_VALUES (enumtype
))
12518 /* The next value is the previous value ... */
12519 prev_value
= DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype
)));
12520 /* ... plus one. */
12521 value
= build_binary_op_nodefault (PLUS_EXPR
,
12526 if (tree_int_cst_lt (value
, prev_value
))
12527 cp_error ("overflow in enumeration values at `%D'", name
);
12530 value
= integer_zero_node
;
12533 /* Remove no-op casts from the value. */
12535 STRIP_TYPE_NOPS (value
);
12537 /* To fix MAX_VAL enum consts. (bkoz) */
12538 TREE_TYPE (value
) = integer_type_node
;
12542 /* We always have to copy here; not all INTEGER_CSTs are unshared.
12543 Even in other cases, we will later (in finish_enum) be setting
12544 the type of VALUE. But, we don't need to make a copy if this
12545 VALUE is one of the enumeration constants for this same
12546 enumeration type. */
12547 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
12548 if (TREE_VALUE (values
) == value
)
12550 /* If we didn't break out of the loop, then we do need a copy. */
12551 if (!values
&& value
)
12552 value
= copy_node (value
);
12554 /* C++ associates enums with global, function, or class declarations. */
12555 context
= current_scope ();
12557 /* Build the actual enumeration constant. Note that the enumeration
12558 constants have the type of their initializers until the
12559 enumeration is complete:
12563 Following the closing brace of an enum-specifier, each enumer-
12564 ator has the type of its enumeration. Prior to the closing
12565 brace, the type of each enumerator is the type of its
12566 initializing value.
12568 In finish_enum we will reset the type. Of course, if we're
12569 processing a template, there may be no value. */
12570 type
= value
? TREE_TYPE (value
) : NULL_TREE
;
12572 if (context
&& context
== current_class_type
)
12573 /* This enum declaration is local to the class. We need the full
12574 lang_decl so that we can record DECL_CLASS_CONTEXT, for example. */
12575 decl
= build_lang_decl (CONST_DECL
, name
, type
);
12577 /* It's a global enum, or it's local to a function. (Note local to
12578 a function could mean local to a class method. */
12579 decl
= build_decl (CONST_DECL
, name
, type
);
12581 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
12582 DECL_INITIAL (decl
) = value
;
12583 TREE_READONLY (decl
) = 1;
12585 if (context
&& context
== current_class_type
)
12586 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
12587 on the TYPE_FIELDS list for `S'. (That's so that you can say
12588 things like `S::i' later.) */
12589 finish_member_declaration (decl
);
12593 GNU_xref_decl (current_function_decl
, decl
);
12596 /* Add this enumeration constant to the list for this type. */
12597 TYPE_VALUES (enumtype
) = tree_cons (name
, decl
, TYPE_VALUES (enumtype
));
12601 static int function_depth
;
12603 /* We're defining DECL. Make sure that it's type is OK. */
12606 check_function_type (decl
)
12609 tree fntype
= TREE_TYPE (decl
);
12611 /* In a function definition, arg types must be complete. */
12612 require_complete_types_for_parms (current_function_parms
);
12614 if (TYPE_SIZE (complete_type (TREE_TYPE (fntype
))) == NULL_TREE
)
12616 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
12618 /* Make it return void instead, but don't change the
12619 type of the DECL_RESULT, in case we have a named return value. */
12620 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12622 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
12624 = build_cplus_method_type (ctype
,
12626 FUNCTION_ARG_CHAIN (decl
));
12630 = build_function_type (void_type_node
,
12631 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
12633 = build_exception_variant (fntype
,
12634 TYPE_RAISES_EXCEPTIONS (fntype
));
12637 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
12640 /* Create the FUNCTION_DECL for a function definition.
12641 DECLSPECS and DECLARATOR are the parts of the declaration;
12642 they describe the function's name and the type it returns,
12643 but twisted together in a fashion that parallels the syntax of C.
12645 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
12646 DECLARATOR is really the DECL for the function we are about to
12647 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
12648 indicating that the function is an inline defined in-class, and
12649 SF_EXPAND indicating that we should generate RTL for this
12652 This function creates a binding context for the function body
12653 as well as setting up the FUNCTION_DECL in current_function_decl.
12655 Returns 1 on success. If the DECLARATOR is not suitable for a function
12656 (it defines a datum instead), we return 0, which tells
12657 yyparse to report a parse error.
12659 For C++, we must first check whether that datum makes any sense.
12660 For example, "class A local_a(1,2);" means that variable local_a
12661 is an aggregate of type A, which should have a constructor
12662 applied to it with the argument list [1, 2]. */
12665 start_function (declspecs
, declarator
, attrs
, flags
)
12666 tree declspecs
, declarator
, attrs
;
12670 tree ctype
= NULL_TREE
;
12673 extern int have_extern_spec
;
12674 extern int used_extern_spec
;
12675 int doing_friend
= 0;
12676 struct binding_level
*bl
;
12678 /* Sanity check. */
12679 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
12680 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
12682 /* This should only be done once on the top most decl. */
12683 if (have_extern_spec
&& !used_extern_spec
)
12685 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
12686 used_extern_spec
= 1;
12689 if (flags
& SF_PRE_PARSED
)
12691 decl1
= declarator
;
12693 fntype
= TREE_TYPE (decl1
);
12694 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12695 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12697 /* ANSI C++ June 5 1992 WP 11.4.5. A friend function defined in a
12698 class is in the (lexical) scope of the class in which it is
12700 if (!ctype
&& DECL_FRIEND_P (decl1
))
12702 ctype
= DECL_CLASS_CONTEXT (decl1
);
12704 /* CTYPE could be null here if we're dealing with a template;
12705 for example, `inline friend float foo()' inside a template
12706 will have no CTYPE set. */
12707 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
12713 last_function_parms
= DECL_ARGUMENTS (decl1
);
12714 last_function_parm_tags
= NULL_TREE
;
12718 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
12719 /* If the declarator is not suitable for a function definition,
12720 cause a syntax error. */
12721 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
12723 fntype
= TREE_TYPE (decl1
);
12725 restype
= TREE_TYPE (fntype
);
12726 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
12728 cp_error ("semicolon missing after declaration of `%#T'", restype
);
12729 shadow_tag (build_expr_list (NULL_TREE
, restype
));
12730 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
12731 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
12732 fntype
= build_function_type (integer_type_node
,
12733 TYPE_ARG_TYPES (fntype
));
12735 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
12737 TYPE_ARG_TYPES (fntype
));
12738 TREE_TYPE (decl1
) = fntype
;
12741 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12742 ctype
= TYPE_METHOD_BASETYPE (fntype
);
12743 else if (DECL_MAIN_P (decl1
))
12745 /* If this doesn't return integer_type, complain. */
12746 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
12748 if (pedantic
|| warn_return_type
)
12749 pedwarn ("return type for `main' changed to `int'");
12750 TREE_TYPE (decl1
) = fntype
= default_function_type
;
12755 /* Sometimes we don't notice that a function is a static member, and
12756 build a METHOD_TYPE for it. Fix that up now. */
12757 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
)
12758 && TREE_CODE (TREE_TYPE (decl1
)) == METHOD_TYPE
)
12760 revert_static_member_fn (&decl1
, NULL
, NULL
);
12761 last_function_parms
= TREE_CHAIN (last_function_parms
);
12765 /* Warn if function was previously implicitly declared
12766 (but not if we warned then). */
12767 if (! warn_implicit
12768 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
12769 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
12771 /* Set up current_class_type, and enter the scope of the class, if
12774 push_nested_class (ctype
, 1);
12775 else if (DECL_STATIC_FUNCTION_P (decl1
))
12776 push_nested_class (DECL_CONTEXT (decl1
), 2);
12778 /* Now that we have entered the scope of the class, we must restore
12779 the bindings for any template parameters surrounding DECL1, if it
12780 is an inline member template. (Order is important; consider the
12781 case where a template parameter has the same name as a field of
12782 the class.) It is not until after this point that
12783 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
12784 if (flags
& SF_INCLASS_INLINE
)
12785 maybe_begin_member_template_processing (decl1
);
12787 /* Effective C++ rule 15. See also c_expand_return. */
12789 && DECL_NAME (decl1
) == ansi_opname
[(int) MODIFY_EXPR
]
12790 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
12791 cp_warning ("`operator=' should return a reference to `*this'");
12793 /* Make the init_value nonzero so pushdecl knows this is not tentative.
12794 error_mark_node is replaced below (in poplevel) with the BLOCK. */
12795 if (!DECL_INITIAL (decl1
))
12796 DECL_INITIAL (decl1
) = error_mark_node
;
12798 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
12799 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
12802 /* This function exists in static storage.
12803 (This does not mean `static' in the C sense!) */
12804 TREE_STATIC (decl1
) = 1;
12806 /* We must call push_template_decl after current_class_type is set
12807 up. (If we are processing inline definitions after exiting a
12808 class scope, current_class_type will be NULL_TREE until set above
12809 by push_nested_class.) */
12810 if (processing_template_decl
)
12811 decl1
= push_template_decl (decl1
);
12813 /* We are now in the scope of the function being defined. */
12814 current_function_decl
= decl1
;
12816 /* Save the parm names or decls from this function's declarator
12817 where store_parm_decls will find them. */
12818 current_function_parms
= last_function_parms
;
12819 current_function_parm_tags
= last_function_parm_tags
;
12821 /* Make sure the parameter and return types are reasonable. When
12822 you declare a function, these types can be incomplete, but they
12823 must be complete when you define the function. */
12824 if (! processing_template_decl
)
12825 check_function_type (decl1
);
12827 /* Build the return declaration for the function. */
12828 restype
= TREE_TYPE (fntype
);
12829 if (!processing_template_decl
)
12831 if (!DECL_RESULT (decl1
))
12833 DECL_RESULT (decl1
)
12834 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
12835 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype
),
12836 DECL_RESULT (decl1
));
12840 /* Just use `void'. Nobody will ever look at this anyhow. */
12841 DECL_RESULT (decl1
) = build_decl (RESULT_DECL
, 0, void_type_node
);
12843 /* Initialize RTL machinery. We cannot do this until
12844 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
12845 even when processing a template; this is how we get
12846 CURRENT_FUNCTION set up, and our per-function variables
12848 bl
= current_binding_level
;
12849 init_function_start (decl1
, input_filename
, lineno
);
12850 current_binding_level
= bl
;
12851 expanding_p
= (flags
& SF_EXPAND
) != 0;
12853 /* Even though we're inside a function body, we still don't want to
12854 call expand_expr to calculate the size of a variable-sized array.
12855 We haven't necessarily assigned RTL to all variables yet, so it's
12856 not safe to try to expand expressions involving them. */
12857 immediate_size_expand
= 0;
12858 current_function
->x_dont_save_pending_sizes_p
= 1;
12860 /* If we're building a statement-tree, start the tree now. */
12861 if (processing_template_decl
|| !expanding_p
)
12862 begin_stmt_tree (&DECL_SAVED_TREE (decl1
));
12864 /* Let the user know we're compiling this function. */
12865 if (processing_template_decl
|| !building_stmt_tree ())
12866 announce_function (decl1
);
12868 /* Record the decl so that the function name is defined.
12869 If we already have a decl for this name, and it is a FUNCTION_DECL,
12870 use the old decl. */
12871 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
12873 /* A specialization is not used to guide overload resolution. */
12874 if ((flag_guiding_decls
12875 || !DECL_TEMPLATE_SPECIALIZATION (decl1
))
12876 && ! DECL_FUNCTION_MEMBER_P (decl1
))
12877 decl1
= pushdecl (decl1
);
12880 /* We need to set the DECL_CONTEXT. */
12881 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
12882 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
12883 /* And make sure we have enough default args. */
12884 check_default_args (decl1
);
12886 DECL_MAIN_VARIANT (decl1
) = decl1
;
12887 fntype
= TREE_TYPE (decl1
);
12890 /* Reset these in case the call to pushdecl changed them. */
12891 current_function_decl
= decl1
;
12892 current_function
->decl
= decl1
;
12894 /* Initialize the per-function data. */
12895 if (!DECL_PENDING_INLINE_P (decl1
) && DECL_SAVED_FUNCTION_DATA (decl1
))
12897 /* If we already parsed this function, and we're just expanding it
12898 now, restore saved state. */
12899 struct binding_level
*bl
= current_binding_level
;
12900 *cp_function_chain
= *DECL_SAVED_FUNCTION_DATA (decl1
);
12901 current_binding_level
= bl
;
12903 /* This function is being processed in whole-function mode; we
12904 already did semantic analysis. */
12905 current_function
->x_whole_function_mode_p
= 1;
12907 /* If we decided that we didn't want to inline this function,
12908 make sure the back-end knows that. */
12909 if (!current_function_cannot_inline
)
12910 current_function_cannot_inline
= cp_function_chain
->cannot_inline
;
12912 /* We don't need the saved data anymore. */
12913 free (DECL_SAVED_FUNCTION_DATA (decl1
));
12914 DECL_SAVED_FUNCTION_DATA (decl1
) = NULL
;
12916 else if (ctype
&& !doing_friend
&& !DECL_STATIC_FUNCTION_P (decl1
))
12918 /* We know that this was set up by `grokclassfn'. We do not
12919 wait until `store_parm_decls', since evil parse errors may
12920 never get us to that point. Here we keep the consistency
12921 between `current_class_type' and `current_class_ptr'. */
12922 tree t
= DECL_ARGUMENTS (decl1
);
12924 my_friendly_assert (t
!= NULL_TREE
&& TREE_CODE (t
) == PARM_DECL
,
12926 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
12929 cp_function_chain
->x_current_class_ref
12930 = build_indirect_ref (t
, NULL_PTR
);
12931 cp_function_chain
->x_current_class_ptr
= t
;
12933 /* Constructors and destructors need to know whether they're "in
12934 charge" of initializing virtual base classes. */
12935 if (DECL_DESTRUCTOR_P (decl1
))
12936 current_in_charge_parm
= TREE_CHAIN (t
);
12937 else if (DECL_CONSTRUCTOR_P (decl1
)
12939 && DECL_ARTIFICIAL (TREE_CHAIN (t
))
12940 && (DECL_NAME (TREE_CHAIN (t
))
12941 == in_charge_identifier
))
12942 current_in_charge_parm
= TREE_CHAIN (t
);
12945 if (DECL_INTERFACE_KNOWN (decl1
))
12947 tree ctx
= hack_decl_function_context (decl1
);
12949 if (DECL_NOT_REALLY_EXTERN (decl1
))
12950 DECL_EXTERNAL (decl1
) = 0;
12952 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
12953 && TREE_PUBLIC (ctx
))
12954 /* This is a function in a local class in an extern inline
12956 comdat_linkage (decl1
);
12958 /* If this function belongs to an interface, it is public.
12959 If it belongs to someone else's interface, it is also external.
12960 This only affects inlines and template instantiations. */
12961 else if (interface_unknown
== 0
12962 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
12963 || flag_alt_external_templates
))
12965 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
12966 || processing_template_decl
)
12968 DECL_EXTERNAL (decl1
)
12970 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
12971 && !DECL_VINDEX (decl1
)));
12973 /* For WIN32 we also want to put these in linkonce sections. */
12974 maybe_make_one_only (decl1
);
12977 DECL_EXTERNAL (decl1
) = 0;
12978 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
12979 DECL_INTERFACE_KNOWN (decl1
) = 1;
12981 else if (interface_unknown
&& interface_only
12982 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
12983 || flag_alt_external_templates
))
12985 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
12986 interface, we will have interface_only set but not
12987 interface_known. In that case, we don't want to use the normal
12988 heuristics because someone will supply a #pragma implementation
12989 elsewhere, and deducing it here would produce a conflict. */
12990 comdat_linkage (decl1
);
12991 DECL_EXTERNAL (decl1
) = 0;
12992 DECL_INTERFACE_KNOWN (decl1
) = 1;
12993 DECL_DEFER_OUTPUT (decl1
) = 1;
12997 /* This is a definition, not a reference.
12998 So clear DECL_EXTERNAL. */
12999 DECL_EXTERNAL (decl1
) = 0;
13001 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
13002 && ! DECL_INTERFACE_KNOWN (decl1
)
13003 /* Don't try to defer nested functions for now. */
13004 && ! hack_decl_function_context (decl1
))
13005 DECL_DEFER_OUTPUT (decl1
) = 1;
13007 DECL_INTERFACE_KNOWN (decl1
) = 1;
13010 if (doing_semantic_analysis_p ())
13013 current_binding_level
->parm_flag
= 1;
13017 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13019 if (!building_stmt_tree ())
13021 GNU_xref_function (decl1
, current_function_parms
);
13022 make_function_rtl (decl1
);
13025 /* Promote the value to int before returning it. */
13026 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13027 restype
= type_promotes_to (restype
);
13029 /* If this fcn was already referenced via a block-scope `extern' decl
13030 (or an implicit decl), propagate certain information about the usage. */
13031 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13032 TREE_ADDRESSABLE (decl1
) = 1;
13034 if (DECL_RESULT (decl1
) == NULL_TREE
)
13036 DECL_RESULT (decl1
)
13037 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13038 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13039 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13044 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl1
))
13045 && DECL_LANGUAGE (decl1
) == lang_cplusplus
)
13046 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13047 else if (DECL_CONSTRUCTOR_P (decl1
))
13048 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13053 /* Called after store_parm_decls for a function-try-block. */
13056 expand_start_early_try_stmts ()
13058 expand_start_try_stmts ();
13061 /* Store the parameter declarations into the current function declaration.
13062 This is called after parsing the parameter declarations, before
13063 digesting the body of the function.
13065 Also install to binding contour return value identifier, if any. */
13068 store_parm_decls ()
13070 register tree fndecl
= current_function_decl
;
13071 register tree parm
;
13072 int parms_have_cleanups
= 0;
13073 tree cleanups
= NULL_TREE
;
13075 /* This is a list of types declared among parms in a prototype. */
13076 tree parmtags
= current_function_parm_tags
;
13078 /* This is a chain of any other decls that came in among the parm
13079 declarations. If a parm is declared with enum {foo, bar} x;
13080 then CONST_DECLs for foo and bar are put here. */
13081 tree nonparms
= NULL_TREE
;
13083 /* Create a binding level for the parms. */
13084 if (!building_stmt_tree ())
13085 expand_start_bindings (2);
13087 if (current_function_parms
)
13089 /* This case is when the function was defined with an ANSI prototype.
13090 The parms already have decls, so we need not do anything here
13091 except record them as in effect
13092 and complain if any redundant old-style parm decls were written. */
13094 tree specparms
= current_function_parms
;
13097 if (doing_semantic_analysis_p ())
13099 /* Must clear this because it might contain TYPE_DECLs declared
13101 storedecls (NULL_TREE
);
13103 /* If we're doing semantic analysis, then we'll call pushdecl
13104 for each of these. We must do them in reverse order so that
13105 they end in the correct forward order. */
13106 specparms
= nreverse (specparms
);
13109 for (parm
= specparms
; parm
; parm
= next
)
13111 next
= TREE_CHAIN (parm
);
13112 if (TREE_CODE (parm
) == PARM_DECL
)
13114 tree type
= TREE_TYPE (parm
);
13116 if (doing_semantic_analysis_p ())
13120 if (DECL_NAME (parm
) == NULL_TREE
13121 || TREE_CODE (parm
) != VOID_TYPE
)
13124 cp_error ("parameter `%D' declared void", parm
);
13126 cleanup
= maybe_build_cleanup (parm
);
13129 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13131 else if (type
!= error_mark_node
13132 && TYPE_NEEDS_DESTRUCTOR (type
))
13133 parms_have_cleanups
= 1;
13137 /* If we find an enum constant or a type tag,
13138 put it aside for the moment. */
13139 TREE_CHAIN (parm
) = NULL_TREE
;
13140 nonparms
= chainon (nonparms
, parm
);
13144 if (doing_semantic_analysis_p ())
13146 /* Get the decls in their original chain order
13147 and record in the function. This is all and only the
13148 PARM_DECLs that were pushed into scope by the loop above. */
13149 DECL_ARGUMENTS (fndecl
) = getdecls ();
13150 storetags (chainon (parmtags
, gettags ()));
13154 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13156 /* Now store the final chain of decls for the arguments
13157 as the decl-chain of the current lexical scope.
13158 Put the enumerators in as well, at the front so that
13159 DECL_ARGUMENTS is not modified. */
13160 if (doing_semantic_analysis_p ())
13161 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13163 /* Initialize the RTL code for the function. */
13164 DECL_SAVED_INSNS (fndecl
) = 0;
13165 if (! building_stmt_tree ())
13166 expand_function_start (fndecl
, parms_have_cleanups
);
13168 current_function_parms_stored
= 1;
13170 /* If this function is `main', emit a call to `__main'
13171 to run global initializers, etc. */
13172 if (DECL_MAIN_P (fndecl
) && !building_stmt_tree ())
13173 expand_main_function ();
13175 /* Now that we have initialized the parms, we can start their
13176 cleanups. We cannot do this before, since expand_decl_cleanup
13177 should not be called before the parm can be used. */
13180 finish_decl_cleanup (TREE_PURPOSE (cleanups
),
13181 TREE_VALUE (cleanups
));
13182 cleanups
= TREE_CHAIN (cleanups
);
13185 /* Create a binding contour which can be used to catch
13186 cleanup-generated temporaries. Also, if the return value needs or
13187 has initialization, deal with that now. */
13188 if (parms_have_cleanups
)
13191 if (!building_stmt_tree ())
13192 expand_start_bindings (2);
13195 /* Do the starting of the exception specifications, if we have any. */
13196 if (flag_exceptions
&& !processing_template_decl
13197 && building_stmt_tree ()
13198 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13199 current_eh_spec_try_block
= expand_start_eh_spec ();
13202 /* Bind a name and initialization to the return value of
13203 the current function. */
13206 store_return_init (decl
)
13209 /* If this named return value comes in a register, put it in a
13210 pseudo-register. */
13211 if (DECL_REGISTER (decl
))
13213 original_result_rtx
= DECL_RTL (decl
);
13214 DECL_RTL (decl
) = gen_reg_rtx (DECL_MODE (decl
));
13219 /* We have finished doing semantic analysis on DECL, but have not yet
13220 generated RTL for its body. Save away our current state, so that
13221 when we want to generate RTL later we know what to do. */
13224 save_function_data (decl
)
13227 struct language_function
*f
;
13229 /* Save the language-specific per-function data so that we can
13230 get it back when we really expand this function. */
13231 my_friendly_assert (!DECL_PENDING_INLINE_P (decl
),
13235 f
= ((struct language_function
*)
13236 xmalloc (sizeof (struct language_function
)));
13237 bcopy ((char *) cp_function_chain
, (char *) f
,
13238 sizeof (struct language_function
));
13239 DECL_SAVED_FUNCTION_DATA (decl
) = f
;
13241 /* Clear out the bits we don't need. */
13242 f
->x_base_init_list
= NULL_TREE
;
13243 f
->x_member_init_list
= NULL_TREE
;
13244 f
->x_stmt_tree
.x_last_stmt
= NULL_TREE
;
13245 f
->x_stmt_tree
.x_last_expr_type
= NULL_TREE
;
13246 f
->x_result_rtx
= NULL_RTX
;
13247 f
->x_named_label_uses
= NULL
;
13248 f
->bindings
= NULL
;
13250 /* When we get back here again, we will be expanding. */
13251 f
->x_expanding_p
= 1;
13253 /* If we've already decided that we cannot inline this function, we
13254 must remember that fact when we actually go to expand the
13256 f
->cannot_inline
= current_function_cannot_inline
;
13259 /* At the end of every constructor we generate to code to return
13260 `this'. Do that now. */
13263 finish_constructor_body ()
13265 /* Any return from a constructor will end up here. */
13266 add_tree (build_min_nt (LABEL_STMT
, ctor_label
));
13268 /* Clear CTOR_LABEL so that finish_return_stmt knows to really
13269 generate the return, rather than a goto to CTOR_LABEL. */
13270 ctor_label
= NULL_TREE
;
13271 /* In check_return_expr we translate an empty return from a
13272 constructor to a return of `this'. */
13273 finish_return_stmt (NULL_TREE
);
13276 /* At the end of every destructor we generate code to restore virtual
13277 function tables to the values desired by base classes and to call
13278 to base class destructors. Do that now. */
13281 finish_destructor_body ()
13283 tree compound_stmt
;
13288 /* Create a block to contain all the extra code. */
13289 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
13291 /* Any return from a destructor will end up here. */
13292 add_tree (build_min_nt (LABEL_STMT
, dtor_label
));
13294 /* Generate the code to call destructor on base class. If this
13295 destructor belongs to a class with virtual functions, then set
13296 the virtual function table pointer to represent the type of our
13299 /* This side-effect makes call to `build_delete' generate the code
13300 we have to have at the end of this destructor. `build_delete'
13301 will set the flag again. */
13302 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
13304 /* These are two cases where we cannot delegate deletion. */
13305 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)
13306 || TYPE_GETS_REG_DELETE (current_class_type
))
13307 in_charge
= integer_zero_node
;
13309 in_charge
= current_in_charge_parm
;
13311 exprstmt
= build_delete (current_class_type
,
13314 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
,
13317 if (exprstmt
!= error_mark_node
13318 && (TREE_CODE (exprstmt
) != NOP_EXPR
13319 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
13320 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
13322 if (exprstmt
!= void_zero_node
)
13323 /* Don't call `expand_expr_stmt' if we're not going to do
13324 anything, since -Wall will give a diagnostic. */
13325 finish_expr_stmt (exprstmt
);
13327 /* Run destructors for all virtual baseclasses. */
13328 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13330 tree vbases
= nreverse (copy_list (CLASSTYPE_VBASECLASSES (current_class_type
)));
13331 tree if_stmt
= begin_if_stmt ();
13332 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13333 current_in_charge_parm
,
13339 if (TYPE_NEEDS_DESTRUCTOR (BINFO_TYPE (vbases
)))
13341 tree vb
= get_vbase
13342 (BINFO_TYPE (vbases
),
13343 TYPE_BINFO (current_class_type
));
13345 (build_scoped_method_call
13346 (current_class_ref
, vb
, dtor_identifier
,
13347 build_expr_list (NULL_TREE
, integer_zero_node
)));
13349 vbases
= TREE_CHAIN (vbases
);
13352 finish_then_clause (if_stmt
);
13357 virtual_size
= c_sizeof (current_class_type
);
13359 /* At the end, call delete if that's what's requested. */
13361 /* FDIS sez: At the point of definition of a virtual destructor
13362 (including an implicit definition), non-placement operator delete
13363 shall be looked up in the scope of the destructor's class and if
13364 found shall be accessible and unambiguous.
13366 This is somewhat unclear, but I take it to mean that if the class
13367 only defines placement deletes we don't do anything here. So we
13368 pass LOOKUP_SPECULATIVELY; delete_sanity will complain for us if
13369 they ever try to delete one of these. */
13370 if (TYPE_GETS_REG_DELETE (current_class_type
)
13371 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13375 exprstmt
= build_op_delete_call
13376 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
13377 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
13379 if_stmt
= begin_if_stmt ();
13380 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13381 current_in_charge_parm
,
13384 finish_expr_stmt (exprstmt
);
13385 finish_then_clause (if_stmt
);
13389 /* Close the block we started above. */
13390 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
13393 /* Finish up a function declaration and compile that function
13394 all the way to assembler language output. The free the storage
13395 for the function definition.
13397 This is called after parsing the body of the function definition.
13398 LINENO is the current line number.
13400 FLAGS is a bitwise or of the following values:
13402 An extra call to poplevel (and expand_end_bindings) must be
13403 made to take care of the binding contour for the base
13404 initializers. This is only relevant for constructors.
13406 We just finished processing the body of an in-class inline
13407 function definition. (This processing will have taken place
13408 after the class definition is complete.) */
13411 finish_function (lineno
, flags
)
13415 register tree fndecl
= current_function_decl
;
13416 tree fntype
, ctype
= NULL_TREE
;
13417 /* Label to use if this function is supposed to return a value. */
13418 tree no_return_label
= NULL_TREE
;
13419 int call_poplevel
= (flags
& 1) != 0;
13420 int inclass_inline
= (flags
& 2) != 0;
13424 /* When we get some parse errors, we can end up without a
13425 current_function_decl, so cope. */
13426 if (fndecl
== NULL_TREE
)
13427 return error_mark_node
;
13429 nested
= function_depth
> 1;
13430 fntype
= TREE_TYPE (fndecl
);
13432 /* TREE_READONLY (fndecl) = 1;
13433 This caused &foo to be of type ptr-to-const-function
13434 which then got a warning when stored in a ptr-to-function variable. */
13436 /* This happens on strange parse errors. */
13437 if (! current_function_parms_stored
)
13440 store_parm_decls ();
13443 if (building_stmt_tree ())
13445 if (DECL_CONSTRUCTOR_P (fndecl
))
13447 finish_constructor_body ();
13451 else if (DECL_DESTRUCTOR_P (fndecl
) && !processing_template_decl
)
13452 finish_destructor_body ();
13453 else if (DECL_MAIN_P (fndecl
))
13455 /* Make it so that `main' always returns 0 by default. */
13457 finish_return_stmt (integer_one_node
);
13459 finish_return_stmt (integer_zero_node
);
13463 /* Finish dealing with exception specifiers. */
13464 if (flag_exceptions
&& !processing_template_decl
13465 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13466 expand_end_eh_spec (TYPE_RAISES_EXCEPTIONS
13467 (TREE_TYPE (current_function_decl
)),
13468 current_eh_spec_try_block
);
13472 if (write_symbols
!= NO_DEBUG
/*&& TREE_CODE (fntype) != METHOD_TYPE*/)
13474 tree ttype
= target_type (fntype
);
13478 /* Keep this code around in case we later want to control debug info
13479 based on whether a type is "used". (jason 1999-11-11) */
13481 if (IS_AGGR_TYPE (ttype
))
13482 /* Let debugger know it should output info for this type. */
13483 note_debug_info_needed (ttype
);
13485 for (parmdecl
= DECL_ARGUMENTS (fndecl
); parmdecl
; parmdecl
= TREE_CHAIN (parmdecl
))
13487 ttype
= target_type (TREE_TYPE (parmdecl
));
13488 if (IS_AGGR_TYPE (ttype
))
13489 /* Let debugger know it should output info for this type. */
13490 note_debug_info_needed (ttype
);
13495 /* Clean house because we will need to reorder insns here. */
13496 do_pending_stack_adjust ();
13500 else if (DECL_CONSTRUCTOR_P (fndecl
))
13502 /* All subobjects have been fully constructed at this point. */
13503 end_protect_partials ();
13508 else if (return_label
!= NULL_RTX
13509 && flag_this_is_variable
<= 0
13510 && current_function_return_value
== NULL_TREE
13511 && ! DECL_NAME (DECL_RESULT (current_function_decl
)))
13512 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13514 if (flag_exceptions
)
13515 expand_exception_blocks ();
13517 /* If this function is supposed to return a value, ensure that
13518 we do not fall into the cleanups by mistake. The end of our
13519 function will look like this:
13521 user code (may have return stmt somewhere)
13522 goto no_return_label
13527 NOTE_INSN_FUNCTION_END
13531 If the user omits a return stmt in the USER CODE section, we
13532 will have a control path which reaches NOTE_INSN_FUNCTION_END.
13533 Otherwise, we won't. */
13534 if (no_return_label
)
13536 DECL_CONTEXT (no_return_label
) = fndecl
;
13537 DECL_INITIAL (no_return_label
) = error_mark_node
;
13538 DECL_SOURCE_FILE (no_return_label
) = input_filename
;
13539 DECL_SOURCE_LINE (no_return_label
) = lineno
;
13540 expand_goto (no_return_label
);
13545 /* Remove the binding contour which is used
13546 to catch cleanup-generated temporaries. */
13547 expand_end_bindings (0, 0, 0);
13548 poplevel (0, 0, 0);
13550 /* Emit label at beginning of cleanup code for parameters. */
13551 emit_label (cleanup_label
);
13554 /* Get return value into register if that's where it's supposed
13556 if (original_result_rtx
)
13557 fixup_result_decl (DECL_RESULT (fndecl
), original_result_rtx
);
13559 /* Finish building code that will trigger warnings if users forget
13560 to make their functions return values. */
13561 if (no_return_label
|| cleanup_label
)
13562 emit_jump (return_label
);
13563 if (no_return_label
)
13565 /* We don't need to call `expand_*_return' here because we
13566 don't need any cleanups here--this path of code is only
13567 for error checking purposes. */
13568 expand_label (no_return_label
);
13571 /* We hard-wired immediate_size_expand to zero in
13572 start_function. Expand_function_end will decrement this
13573 variable. So, we set the variable to one here, so that after
13574 the decrement it will remain zero. */
13575 immediate_size_expand
= 1;
13577 /* Generate rtl for function exit. */
13578 expand_function_end (input_filename
, lineno
, 1);
13581 /* We have to save this value here in case
13582 maybe_end_member_template_processing decides to pop all the
13583 template parameters. */
13584 expand_p
= !building_stmt_tree ();
13586 /* If we're saving up tree structure, tie off the function now. */
13588 finish_stmt_tree (&DECL_SAVED_TREE (fndecl
));
13590 /* This must come after expand_function_end because cleanups might
13591 have declarations (from inline functions) that need to go into
13592 this function's blocks. */
13593 if (doing_semantic_analysis_p ())
13595 if (current_binding_level
->parm_flag
!= 1)
13596 my_friendly_abort (122);
13597 poplevel (1, 0, 1);
13600 /* Remember that we were in class scope. */
13601 if (current_class_name
)
13602 ctype
= current_class_type
;
13604 /* Must mark the RESULT_DECL as being in this function. */
13605 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
13607 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
13608 to the FUNCTION_DECL node itself. */
13609 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
13611 /* Save away current state, if appropriate. */
13612 if (!expanding_p
&& !processing_template_decl
)
13613 save_function_data (fndecl
);
13619 int saved_flag_keep_inline_functions
=
13620 flag_keep_inline_functions
;
13622 /* So we can tell if jump_optimize sets it to 1. */
13625 if (DECL_CONTEXT (fndecl
) != NULL_TREE
13626 && hack_decl_function_context (fndecl
))
13627 /* Trick rest_of_compilation into not deferring output of this
13628 function, even if it is inline, since the rtl_obstack for
13629 this function is the function_obstack of the enclosing
13630 function and will be deallocated when the enclosing
13631 function is gone. See save_tree_status. */
13632 flag_keep_inline_functions
= 1;
13634 /* Before we call rest_of_compilation (which will pop the
13635 CURRENT_FUNCTION), we must save these values. */
13636 returns_null
= current_function_returns_null
;
13637 returns_value
= current_function_returns_value
;
13639 /* If this is a nested function (like a template instantiation
13640 that we're compiling in the midst of compiling something
13641 else), push a new GC context. That will keep local variables
13642 on the stack from being collected while we're doing the
13643 compilation of this function. */
13644 if (function_depth
> 1)
13645 ggc_push_context ();
13647 /* Run the optimizers and output the assembler code for this
13649 if (DECL_ARTIFICIAL (fndecl
))
13651 /* Do we really *want* to inline this synthesized method? */
13653 int save_fif
= flag_inline_functions
;
13654 flag_inline_functions
= 1;
13656 /* Turn off DECL_INLINE for the moment so function_cannot_inline_p
13657 will check our size. */
13658 DECL_INLINE (fndecl
) = 0;
13660 rest_of_compilation (fndecl
);
13661 flag_inline_functions
= save_fif
;
13664 rest_of_compilation (fndecl
);
13666 /* Undo the call to ggc_push_context above. */
13667 if (function_depth
> 1)
13668 ggc_pop_context ();
13670 flag_keep_inline_functions
= saved_flag_keep_inline_functions
;
13672 if (DECL_SAVED_INSNS (fndecl
) && ! TREE_ASM_WRITTEN (fndecl
))
13674 /* Set DECL_EXTERNAL so that assemble_external will be called as
13675 necessary. We'll clear it again in finish_file. */
13676 if (! DECL_EXTERNAL (fndecl
))
13677 DECL_NOT_REALLY_EXTERN (fndecl
) = 1;
13678 DECL_EXTERNAL (fndecl
) = 1;
13679 mark_inline_for_output (fndecl
);
13683 /* Keep this code around in case we later want to control debug info
13684 based on whether a type is "used". (jason 1999-11-11) */
13686 if (ctype
&& TREE_ASM_WRITTEN (fndecl
))
13687 note_debug_info_needed (ctype
);
13690 returns_null
|= can_reach_end
;
13692 /* Since we don't normally go through c_expand_return for constructors,
13693 this normally gets the wrong value.
13694 Also, named return values have their return codes emitted after
13695 NOTE_INSN_FUNCTION_END, confusing jump.c. */
13696 if (DECL_CONSTRUCTOR_P (fndecl
)
13697 || DECL_NAME (DECL_RESULT (fndecl
)) != NULL_TREE
)
13700 if (TREE_THIS_VOLATILE (fndecl
) && returns_null
)
13701 cp_warning ("`noreturn' function `%D' does return", fndecl
);
13702 else if ((warn_return_type
|| pedantic
)
13704 && TREE_CODE (TREE_TYPE (fntype
)) != VOID_TYPE
)
13706 /* If this function returns non-void and control can drop through,
13708 cp_warning ("control reaches end of non-void function `%D'", fndecl
);
13710 /* With just -W, complain only if function returns both with
13711 and without a value. */
13712 else if (extra_warnings
&& returns_value
&& returns_null
)
13713 warning ("this function may return with or without a value");
13717 /* Clear out memory we no longer need. */
13718 free_after_parsing (current_function
);
13719 /* Since we never call rest_of_compilation, we never clear
13720 CURRENT_FUNCTION. Do so explicitly. */
13721 free_after_compilation (current_function
);
13722 current_function
= NULL
;
13725 /* If this is a in-class inline definition, we may have to pop the
13726 bindings for the template parameters that we added in
13727 maybe_begin_member_template_processing when start_function was
13729 if (inclass_inline
)
13730 maybe_end_member_template_processing ();
13732 /* Leave the scope of the class. */
13734 pop_nested_class ();
13738 if (!DECL_SAVED_INSNS (fndecl
) && !DECL_SAVED_FUNCTION_DATA (fndecl
))
13742 /* Stop pointing to the local nodes about to be freed. */
13743 /* But DECL_INITIAL must remain nonzero so we know this
13744 was an actual function definition. */
13745 DECL_INITIAL (fndecl
) = error_mark_node
;
13746 for (t
= DECL_ARGUMENTS (fndecl
); t
; t
= TREE_CHAIN (t
))
13747 DECL_RTL (t
) = DECL_INCOMING_RTL (t
) = NULL_RTX
;
13750 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
13751 static_ctors
= tree_cons (NULL_TREE
, fndecl
, static_ctors
);
13752 if (DECL_STATIC_DESTRUCTOR (fndecl
))
13753 static_dtors
= tree_cons (NULL_TREE
, fndecl
, static_dtors
);
13758 /* Let the error reporting routines know that we're outside a
13759 function. For a nested function, this value is used in
13760 pop_cp_function_context and then reset via pop_function_context. */
13761 current_function_decl
= NULL_TREE
;
13767 /* Create the FUNCTION_DECL for a function definition.
13768 DECLSPECS and DECLARATOR are the parts of the declaration;
13769 they describe the return type and the name of the function,
13770 but twisted together in a fashion that parallels the syntax of C.
13772 This function creates a binding context for the function body
13773 as well as setting up the FUNCTION_DECL in current_function_decl.
13775 Returns a FUNCTION_DECL on success.
13777 If the DECLARATOR is not suitable for a function (it defines a datum
13778 instead), we return 0, which tells yyparse to report a parse error.
13780 May return void_type_node indicating that this method is actually
13781 a friend. See grokfield for more details.
13783 Came here with a `.pushlevel' .
13785 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
13786 CHANGES TO CODE IN `grokfield'. */
13789 start_method (declspecs
, declarator
, attrlist
)
13790 tree declarator
, declspecs
, attrlist
;
13792 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
13795 /* Something too ugly to handle. */
13796 if (fndecl
== NULL_TREE
)
13799 /* Pass friends other than inline friend functions back. */
13800 if (fndecl
== void_type_node
)
13803 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
13804 /* Not a function, tell parser to report parse error. */
13807 if (DECL_IN_AGGR_P (fndecl
))
13809 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
13811 if (DECL_CONTEXT (fndecl
)
13812 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
13813 cp_error ("`%D' is already defined in class %s", fndecl
,
13814 TYPE_NAME_STRING (DECL_CONTEXT (fndecl
)));
13816 return void_type_node
;
13819 check_template_shadow (fndecl
);
13821 DECL_THIS_INLINE (fndecl
) = 1;
13823 if (flag_default_inline
)
13824 DECL_INLINE (fndecl
) = 1;
13826 /* We process method specializations in finish_struct_1. */
13827 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
13828 fndecl
= push_template_decl (fndecl
);
13830 /* We read in the parameters on the maybepermanent_obstack,
13831 but we won't be getting back to them until after we
13832 may have clobbered them. So the call to preserve_data
13833 will keep them safe. */
13836 if (! DECL_FRIEND_P (fndecl
))
13838 if (TREE_CHAIN (fndecl
))
13840 fndecl
= copy_node (fndecl
);
13841 TREE_CHAIN (fndecl
) = NULL_TREE
;
13844 if (DECL_CONSTRUCTOR_P (fndecl
))
13846 if (! grok_ctor_properties (current_class_type
, fndecl
))
13847 return void_type_node
;
13849 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
13850 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
13853 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0);
13855 /* Make a place for the parms */
13857 current_binding_level
->parm_flag
= 1;
13859 DECL_IN_AGGR_P (fndecl
) = 1;
13863 /* Go through the motions of finishing a function definition.
13864 We don't compile this method until after the whole class has
13867 FINISH_METHOD must return something that looks as though it
13868 came from GROKFIELD (since we are defining a method, after all).
13870 This is called after parsing the body of the function definition.
13871 STMTS is the chain of statements that makes up the function body.
13873 DECL is the ..._DECL that `start_method' provided. */
13876 finish_method (decl
)
13879 register tree fndecl
= decl
;
13882 register tree link
;
13884 if (decl
== void_type_node
)
13887 old_initial
= DECL_INITIAL (fndecl
);
13889 /* Undo the level for the parms (from start_method).
13890 This is like poplevel, but it causes nothing to be
13891 saved. Saving information here confuses symbol-table
13892 output routines. Besides, this information will
13893 be correctly output when this method is actually
13896 /* Clear out the meanings of the local variables of this level;
13897 also record in each decl which block it belongs to. */
13899 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
13901 if (DECL_NAME (link
) != NULL_TREE
)
13902 pop_binding (DECL_NAME (link
), link
);
13903 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
13904 DECL_CONTEXT (link
) = NULL_TREE
;
13907 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
13908 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
13909 current_binding_level
->parm_flag
,
13910 current_binding_level
->keep
);
13912 poplevel (0, 0, 0);
13914 DECL_INITIAL (fndecl
) = old_initial
;
13916 /* We used to check if the context of FNDECL was different from
13917 current_class_type as another way to get inside here. This didn't work
13918 for String.cc in libg++. */
13919 if (DECL_FRIEND_P (fndecl
))
13921 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
13922 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
13923 decl
= void_type_node
;
13929 /* Called when a new struct TYPE is defined.
13930 If this structure or union completes the type of any previous
13931 variable declaration, lay it out and output its rtl. */
13934 hack_incomplete_structures (type
)
13939 if (current_binding_level
->incomplete
== NULL_TREE
)
13942 if (!type
) /* Don't do this for class templates. */
13945 for (list
= ¤t_binding_level
->incomplete
; *list
; )
13947 tree decl
= TREE_VALUE (*list
);
13948 if ((decl
&& TREE_TYPE (decl
) == type
)
13949 || (TREE_TYPE (decl
)
13950 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
13951 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
13953 int toplevel
= toplevel_bindings_p ();
13954 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
13955 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
13956 layout_type (TREE_TYPE (decl
));
13957 layout_decl (decl
, 0);
13958 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
13962 expand_decl (decl
);
13963 cleanup
= maybe_build_cleanup (decl
);
13964 expand_decl_init (decl
);
13965 if (! expand_decl_cleanup (decl
, cleanup
))
13966 cp_error ("parser lost in parsing declaration of `%D'",
13969 *list
= TREE_CHAIN (*list
);
13972 list
= &TREE_CHAIN (*list
);
13976 /* If DECL is of a type which needs a cleanup, build that cleanup here.
13977 See build_delete for information about AUTO_DELETE.
13979 Don't build these on the momentary obstack; they must live
13980 the life of the binding contour. */
13983 maybe_build_cleanup_1 (decl
, auto_delete
)
13984 tree decl
, auto_delete
;
13986 tree type
= TREE_TYPE (decl
);
13987 if (type
!= error_mark_node
&& TYPE_NEEDS_DESTRUCTOR (type
))
13989 int flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
13992 if (TREE_CODE (type
) == ARRAY_TYPE
)
13996 mark_addressable (decl
);
13997 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14000 /* Optimize for space over speed here. */
14001 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14002 || flag_expensive_optimizations
)
14003 flags
|= LOOKUP_NONVIRTUAL
;
14005 rval
= build_delete (TREE_TYPE (rval
), rval
, auto_delete
, flags
, 0);
14007 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14008 && ! TYPE_HAS_DESTRUCTOR (type
))
14009 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14010 build_expr_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14017 /* If DECL is of a type which needs a cleanup, build that cleanup
14018 here. The cleanup does free the storage with a call to delete. */
14021 maybe_build_cleanup_and_delete (decl
)
14024 return maybe_build_cleanup_1 (decl
, integer_three_node
);
14027 /* If DECL is of a type which needs a cleanup, build that cleanup
14028 here. The cleanup does not free the storage with a call a delete. */
14031 maybe_build_cleanup (decl
)
14034 return maybe_build_cleanup_1 (decl
, integer_two_node
);
14037 /* Expand a C++ expression at the statement level.
14038 This is needed to ferret out nodes which have UNKNOWN_TYPE.
14039 The C++ type checker should get all of these out when
14040 expressions are combined with other, type-providing, expressions,
14041 leaving only orphan expressions, such as:
14043 &class::bar; / / takes its address, but does nothing with it. */
14046 cplus_expand_expr_stmt (exp
)
14049 if (stmts_are_full_exprs_p
)
14050 exp
= convert_to_void (exp
, "statement");
14053 /* We should do this eventually, but right now this causes regex.o from
14054 libg++ to miscompile, and tString to core dump. */
14055 exp
= build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (exp
), exp
);
14058 /* If we don't do this, we end up down inside expand_expr
14059 trying to do TYPE_MODE on the ERROR_MARK, and really
14060 go outside the bounds of the type. */
14061 if (exp
!= error_mark_node
)
14062 expand_expr_stmt (exp
);
14065 /* When a stmt has been parsed, this function is called. */
14070 /* Always assume this statement was not an expression statement. If
14071 it actually was an expression statement, its our callers
14072 responsibility to fix this up. */
14073 last_expr_type
= NULL_TREE
;
14076 /* Change a static member function definition into a FUNCTION_TYPE, instead
14077 of the METHOD_TYPE that we create when it's originally parsed.
14079 WARNING: DO NOT pass &TREE_TYPE (decl) to FN or &TYPE_ARG_TYPES
14080 (TREE_TYPE (decl)) to ARGTYPES, as doing so will corrupt the types of
14081 other decls. Either pass the addresses of local variables or NULL. */
14084 revert_static_member_fn (decl
, fn
, argtypes
)
14085 tree
*decl
, *fn
, *argtypes
;
14088 tree function
= fn
? *fn
: TREE_TYPE (*decl
);
14089 tree args
= argtypes
? *argtypes
: TYPE_ARG_TYPES (function
);
14091 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14092 != TYPE_UNQUALIFIED
)
14093 cp_error ("static member function `%#D' declared with type qualifiers",
14096 args
= TREE_CHAIN (args
);
14097 tmp
= build_function_type (TREE_TYPE (function
), args
);
14098 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14099 tmp
= build_exception_variant (tmp
,
14100 TYPE_RAISES_EXCEPTIONS (function
));
14101 TREE_TYPE (*decl
) = tmp
;
14102 if (DECL_ARGUMENTS (*decl
))
14103 DECL_ARGUMENTS (*decl
) = TREE_CHAIN (DECL_ARGUMENTS (*decl
));
14104 DECL_STATIC_FUNCTION_P (*decl
) = 1;
14111 /* Initialize the variables used during compilation of a C++
14115 push_cp_function_context (f
)
14116 struct function
*f
;
14118 struct language_function
*p
14119 = ((struct language_function
*)
14120 xcalloc (1, sizeof (struct language_function
)));
14123 /* It takes an explicit call to expand_body to generate RTL for a
14127 /* Whenever we start a new function, we destroy temporaries in the
14129 stmts_are_full_exprs_p
= 1;
14132 /* Free the language-specific parts of F, now that we've finished
14133 compiling the function. */
14136 pop_cp_function_context (f
)
14137 struct function
*f
;
14140 free (f
->language
);
14144 /* Mark P for GC. */
14147 mark_lang_function (p
)
14148 struct language_function
*p
;
14153 ggc_mark_tree (p
->x_named_labels
);
14154 ggc_mark_tree (p
->x_ctor_label
);
14155 ggc_mark_tree (p
->x_dtor_label
);
14156 ggc_mark_tree (p
->x_base_init_list
);
14157 ggc_mark_tree (p
->x_member_init_list
);
14158 ggc_mark_tree (p
->x_current_class_ptr
);
14159 ggc_mark_tree (p
->x_current_class_ref
);
14160 ggc_mark_tree (p
->x_eh_spec_try_block
);
14161 ggc_mark_tree (p
->x_scope_stmt_stack
);
14163 ggc_mark_rtx (p
->x_result_rtx
);
14165 mark_stmt_tree (&p
->x_stmt_tree
);
14166 mark_binding_level (&p
->bindings
);
14169 /* Mark the language-specific data in F for GC. */
14172 mark_cp_function_context (f
)
14173 struct function
*f
;
14175 mark_lang_function (f
->language
);
14181 return function_depth
!= 0;
14186 lang_mark_false_label_stack (l
)
14187 struct label_node
*l
;
14189 /* C++ doesn't use false_label_stack. It better be NULL. */
14190 my_friendly_assert (l
== NULL
, 19990904);
14197 enum tree_code code
= TREE_CODE (t
);
14198 if (code
== IDENTIFIER_NODE
)
14200 struct lang_identifier
*li
= (struct lang_identifier
*) t
;
14201 struct lang_id2
*li2
= li
->x
;
14202 ggc_mark_tree (li
->namespace_bindings
);
14203 ggc_mark_tree (li
->bindings
);
14204 ggc_mark_tree (li
->class_value
);
14205 ggc_mark_tree (li
->class_template_info
);
14209 ggc_mark_tree (li2
->label_value
);
14210 ggc_mark_tree (li2
->implicit_decl
);
14211 ggc_mark_tree (li2
->error_locus
);
14214 else if (code
== CPLUS_BINDING
)
14216 if (BINDING_HAS_LEVEL_P (t
))
14217 mark_binding_level (&BINDING_LEVEL (t
));
14219 ggc_mark_tree (BINDING_SCOPE (t
));
14220 ggc_mark_tree (BINDING_VALUE (t
));
14222 else if (code
== OVERLOAD
)
14223 ggc_mark_tree (OVL_FUNCTION (t
));
14224 else if (code
== TEMPLATE_PARM_INDEX
)
14225 ggc_mark_tree (TEMPLATE_PARM_DECL (t
));
14226 else if (TREE_CODE_CLASS (code
) == 'd')
14228 struct lang_decl
*ld
= DECL_LANG_SPECIFIC (t
);
14233 if (!DECL_GLOBAL_CTOR_P (t
) && !DECL_GLOBAL_DTOR_P (t
))
14234 ggc_mark_tree (ld
->decl_flags
.u2
.access
);
14235 ggc_mark_tree (ld
->decl_flags
.context
);
14236 if (TREE_CODE (t
) != NAMESPACE_DECL
)
14237 ggc_mark_tree (ld
->decl_flags
.u
.template_info
);
14239 mark_binding_level (&NAMESPACE_LEVEL (t
));
14240 if (CAN_HAVE_FULL_LANG_DECL_P (t
))
14242 ggc_mark_tree (ld
->main_decl_variant
);
14243 ggc_mark_tree (ld
->befriending_classes
);
14244 ggc_mark_tree (ld
->saved_tree
);
14245 if (TREE_CODE (t
) == TYPE_DECL
)
14246 ggc_mark_tree (ld
->u
.sorted_fields
);
14247 else if (TREE_CODE (t
) == FUNCTION_DECL
14248 && !DECL_PENDING_INLINE_P (t
))
14249 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t
));
14253 else if (TREE_CODE_CLASS (code
) == 't')
14255 struct lang_type
*lt
= TYPE_LANG_SPECIFIC (t
);
14257 if (lt
&& !(TREE_CODE (t
) == POINTER_TYPE
14258 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
14261 ggc_mark_tree (lt
->vfields
);
14262 ggc_mark_tree (lt
->vbases
);
14263 ggc_mark_tree (lt
->tags
);
14264 ggc_mark_tree (lt
->search_slot
);
14265 ggc_mark_tree (lt
->size
);
14266 ggc_mark_tree (lt
->abstract_virtuals
);
14267 ggc_mark_tree (lt
->friend_classes
);
14268 ggc_mark_tree (lt
->rtti
);
14269 ggc_mark_tree (lt
->methods
);
14270 ggc_mark_tree (lt
->template_info
);
14271 ggc_mark_tree (lt
->befriending_classes
);
14274 /* In the case of pointer-to-member function types, the
14275 TYPE_LANG_SPECIFIC is really just a tree. */
14276 ggc_mark_tree ((tree
) lt
);