1 /* Process declarations and variables for C compiler.
2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000
3 Free Software Foundation, Inc.
4 Contributed by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GNU CC.
8 GNU CC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GNU CC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GNU CC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
24 /* Process declarations and symbol lookup for C front end.
25 Also constructs types; the standard scalar types at initialization,
26 and structure, union, array and enum types when they are declared. */
28 /* ??? not all decl nodes are given the most useful possible
29 line numbers. For example, the CONST_DECLs for enum values. */
49 #define obstack_chunk_alloc xmalloc
50 #define obstack_chunk_free free
52 extern struct obstack permanent_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
) PARAMS ((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 /* In the new ABI, `bool' has size and alignment `1', on all
78 #define BOOL_TYPE_SIZE \
79 ((SLOW_BYTE_ACCESS && !flag_new_abi) ? (POINTER_SIZE) : (CHAR_TYPE_SIZE))
81 #define BOOL_TYPE_SIZE CHAR_TYPE_SIZE
85 /* We let tm.h override the types used here, to handle trivial differences
86 such as the choice of unsigned int or long unsigned int for size_t.
87 When machines start needing nontrivial differences in the size type,
88 it would be best to do something here to figure out automatically
89 from other information what type to use. */
92 #define SIZE_TYPE "long unsigned int"
96 #define PTRDIFF_TYPE "long int"
100 #define WCHAR_TYPE "int"
103 static tree grokparms
PARAMS ((tree
, int));
104 static const char *redeclaration_error_message
PARAMS ((tree
, tree
));
106 static void push_binding_level
PARAMS ((struct binding_level
*, int,
108 static void pop_binding_level
PARAMS ((void));
109 static void suspend_binding_level
PARAMS ((void));
110 static void resume_binding_level
PARAMS ((struct binding_level
*));
111 static struct binding_level
*make_binding_level
PARAMS ((void));
112 static void declare_namespace_level
PARAMS ((void));
113 static void signal_catch
PARAMS ((int)) ATTRIBUTE_NORETURN
;
114 static void storedecls
PARAMS ((tree
));
115 static void require_complete_types_for_parms
PARAMS ((tree
));
116 static int ambi_op_p
PARAMS ((tree
));
117 static int unary_op_p
PARAMS ((tree
));
118 static tree store_bindings
PARAMS ((tree
, tree
));
119 static tree lookup_tag_reverse
PARAMS ((tree
, tree
));
120 static tree obscure_complex_init
PARAMS ((tree
, tree
));
121 static tree maybe_build_cleanup_1
PARAMS ((tree
, tree
));
122 static tree lookup_name_real
PARAMS ((tree
, int, int, int));
123 static void warn_extern_redeclared_static
PARAMS ((tree
, tree
));
124 static void grok_reference_init
PARAMS ((tree
, tree
, tree
));
125 static tree grokfndecl
PARAMS ((tree
, tree
, tree
, tree
, int,
126 enum overload_flags
, tree
,
127 tree
, int, int, int, int, int, int, tree
));
128 static tree grokvardecl
PARAMS ((tree
, tree
, RID_BIT_TYPE
*, int, int, tree
));
129 static tree lookup_tag
PARAMS ((enum tree_code
, tree
,
130 struct binding_level
*, int));
131 static void set_identifier_type_value_with_scope
132 PARAMS ((tree
, tree
, struct binding_level
*));
133 static void record_builtin_type
PARAMS ((enum rid
, const char *, tree
));
134 static void record_unknown_type
PARAMS ((tree
, const char *));
135 static tree build_library_fn_1
PARAMS ((tree
, tree
));
136 static int member_function_or_else
PARAMS ((tree
, tree
, enum overload_flags
));
137 static void bad_specifiers
PARAMS ((tree
, const char *, int, int, int, int,
139 static void lang_print_error_function
PARAMS ((const char *));
140 static tree maybe_process_template_type_declaration
PARAMS ((tree
, int, struct binding_level
*));
141 static void check_for_uninitialized_const_var
PARAMS ((tree
));
142 static unsigned long typename_hash
PARAMS ((hash_table_key
));
143 static boolean typename_compare
PARAMS ((hash_table_key
, hash_table_key
));
144 static void push_binding
PARAMS ((tree
, tree
, struct binding_level
*));
145 static int add_binding
PARAMS ((tree
, tree
));
146 static void pop_binding
PARAMS ((tree
, tree
));
147 static tree local_variable_p_walkfn
PARAMS ((tree
*, int *, void *));
148 static tree find_binding
PARAMS ((tree
, tree
));
149 static tree select_decl
PARAMS ((tree
, int));
150 static int lookup_flags
PARAMS ((int, int));
151 static tree qualify_lookup
PARAMS ((tree
, int));
152 static tree record_builtin_java_type
PARAMS ((const char *, int));
153 static const char *tag_name
PARAMS ((enum tag_types code
));
154 static void find_class_binding_level
PARAMS ((void));
155 static struct binding_level
*innermost_nonclass_level
PARAMS ((void));
156 static void warn_about_implicit_typename_lookup
PARAMS ((tree
, tree
));
157 static int walk_namespaces_r
PARAMS ((tree
, walk_namespaces_fn
, void *));
158 static int walk_globals_r
PARAMS ((tree
, void *));
159 static void add_decl_to_level
PARAMS ((tree
, struct binding_level
*));
160 static tree make_label_decl
PARAMS ((tree
, int));
161 static void pop_label
PARAMS ((tree
));
162 static void pop_labels
PARAMS ((tree
));
163 static void maybe_deduce_size_from_array_init
PARAMS ((tree
, tree
));
164 static void layout_var_decl
PARAMS ((tree
));
165 static void maybe_commonize_var
PARAMS ((tree
));
166 static tree check_initializer
PARAMS ((tree
, tree
));
167 static void make_rtl_for_nonlocal_decl
PARAMS ((tree
, tree
, const char *));
168 static void push_cp_function_context
PARAMS ((struct function
*));
169 static void pop_cp_function_context
PARAMS ((struct function
*));
170 static void mark_binding_level
PARAMS ((void *));
171 static void mark_cp_function_context
PARAMS ((struct function
*));
172 static void mark_saved_scope
PARAMS ((void *));
173 static void mark_lang_function
PARAMS ((struct language_function
*));
174 static void mark_stmt_tree
PARAMS ((struct stmt_tree
*));
175 static void save_function_data
PARAMS ((tree
));
176 static void check_function_type
PARAMS ((tree
));
177 static void destroy_local_var
PARAMS ((tree
));
178 static void finish_constructor_body
PARAMS ((void));
179 static void finish_destructor_body
PARAMS ((void));
180 static tree create_array_type_for_decl
PARAMS ((tree
, tree
, tree
));
181 static tree get_atexit_node
PARAMS ((void));
182 static tree get_dso_handle_node
PARAMS ((void));
183 static tree start_cleanup_fn
PARAMS ((void));
184 static void end_cleanup_fn
PARAMS ((void));
185 static tree cp_make_fname_decl
PARAMS ((tree
, const char *, int));
187 #if defined (DEBUG_CP_BINDING_LEVELS)
188 static void indent
PARAMS ((void));
191 /* Erroneous argument lists can use this *IFF* they do not modify it. */
192 tree error_mark_list
;
194 /* The following symbols are subsumed in the cp_global_trees array, and
195 listed here individually for documentation purposes.
198 tree wchar_decl_node;
201 tree vtable_entry_type;
202 tree delta_type_node;
205 tree __baselist_desc_type_node;
206 tree __i_desc_type_node, __m_desc_type_node;
207 tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type;
209 tree __t_desc_type_node;
211 tree __tp_desc_type_node;
213 tree ti_desc_type_node;
214 tree bltn_desc_type_node, ptr_desc_type_node, ref_desc_type_node;
215 tree ary_desc_type_node, func_desc_type_node, enum_desc_type_node;
216 tree class_desc_type_node, si_class_desc_type_node, vmi_class_desc_type_node;
217 tree ptmd_desc_type_node;
218 tree base_desc_type_node;
220 Not needed yet? May be needed one day?
221 tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type;
222 tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type;
223 tree __ptmf_desc_array_type, __ptmd_desc_array_type;
226 tree class_type_node, record_type_node, union_type_node, enum_type_node;
227 tree unknown_type_node;
229 Array type `vtable_entry_type[]'
232 tree vtbl_ptr_type_node;
238 A FUNCTION_DECL which can call `abort'. Not necessarily the
239 one that the user will declare, but sufficient to be called
240 by routines that want to abort the program.
244 The FUNCTION_DECL for the default `::operator delete'.
246 tree global_delete_fndecl;
249 tree type_info_type_node, tinfo_decl_id, tinfo_decl_type;
254 tree cp_global_trees
[CPTI_MAX
];
256 /* Indicates that there is a type value in some namespace, although
257 that is not necessarily in scope at the moment. */
259 static tree global_type_node
;
264 /* Expect only namespace names now. */
265 static int only_namespace_names
;
267 /* If original DECL_RESULT of current function was a register,
268 but due to being an addressable named return value, would up
269 on the stack, this variable holds the named return value's
270 original location. */
272 #define original_result_rtx cp_function_chain->x_result_rtx
274 struct named_label_list
276 struct binding_level
*binding_level
;
279 const char *filename_o_goto
;
281 struct named_label_list
*next
;
284 /* Used only for jumps to as-yet undefined labels, since jumps to
285 defined labels can have their validity checked by stmt.c. */
287 #define named_label_uses cp_function_chain->x_named_label_uses
289 /* A list of objects which have constructors or destructors
290 which reside in the global scope. The decl is stored in
291 the TREE_VALUE slot and the initializer is stored
292 in the TREE_PURPOSE slot. */
293 tree static_aggregates
;
297 /* A node for the integer constants 2, and 3. */
299 tree integer_two_node
, integer_three_node
;
301 /* Parsing a function declarator leaves here a chain of structure
302 and enum types declared in the parmlist. */
304 static tree last_function_parm_tags
;
306 /* Similar, for last_function_parm_tags. */
307 tree last_function_parms
;
308 static tree current_function_parm_tags
;
310 /* A list (chain of TREE_LIST nodes) of all LABEL_DECLs in the function
311 that have names. Here so we can clear out their names' definitions
312 at the end of the function. The TREE_VALUE is a LABEL_DECL; the
313 TREE_PURPOSE is the previous binding of the label. */
315 #define named_labels cp_function_chain->x_named_labels
317 /* Set to 0 at beginning of a function definition, and whenever
318 a label (case or named) is defined. Set to value of expression
319 returned from function when that value can be transformed into
320 a named return value. */
322 tree current_function_return_value
;
324 /* Nonzero means use the ISO C99 dialect of C. */
328 /* Nonzero means give `double' the same size as `float'. */
330 extern int flag_short_double
;
332 /* Nonzero means don't recognize any builtin functions. */
334 extern int flag_no_builtin
;
336 /* Nonzero means don't recognize the non-ANSI builtin functions.
339 extern int flag_no_nonansi_builtin
;
341 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
343 extern int flag_huge_objects
;
345 /* Nonzero if we want to conserve space in the .o files. We do this
346 by putting uninitialized data and runtime initialized data into
347 .common instead of .data at the expense of not flagging multiple
349 extern int flag_conserve_space
;
351 /* C and C++ flags are in decl2.c. */
353 /* Flag used when debugging spew.c */
355 extern int spew_debug
;
357 /* A expression of value 0 with the same precision as a sizetype
359 tree signed_size_zero_node
;
361 /* The name of the anonymous namespace, throughout this translation
363 tree anonymous_namespace_name
;
366 /* For each binding contour we allocate a binding_level structure
367 which records the names defined in that contour.
370 1) one for each function definition,
371 where internal declarations of the parameters appear.
372 2) one for each compound statement,
373 to record its declarations.
375 The current meaning of a name can be found by searching the levels
376 from the current one out to the global one.
378 Off to the side, may be the class_binding_level. This exists only
379 to catch class-local declarations. It is otherwise nonexistent.
381 Also there may be binding levels that catch cleanups that must be
382 run when exceptions occur. Thus, to see whether a name is bound in
383 the current scope, it is not enough to look in the
384 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
387 /* Note that the information in the `names' component of the global contour
388 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
392 /* A chain of _DECL nodes for all variables, constants, functions,
393 and typedef types. These are in the reverse of the order
394 supplied. There may be OVERLOADs on this list, too, but they
395 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
398 /* A list of structure, union and enum definitions, for looking up
400 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
401 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
402 or ENUMERAL_TYPE node.
404 C++: the TREE_VALUE nodes can be simple types for
405 component_bindings. */
408 /* A list of USING_DECL nodes. */
411 /* A list of used namespaces. PURPOSE is the namespace,
412 VALUE the common ancestor with this binding_level's namespace. */
413 tree using_directives
;
415 /* If this binding level is the binding level for a class, then
416 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
417 is the name of an entity bound in the class; the TREE_VALUE is
418 the IDENTIFIER_CLASS_VALUE before we entered the class. Thus,
419 when leaving class scope, we can restore the
420 IDENTIFIER_CLASS_VALUE by walking this list. The TREE_TYPE is
421 the DECL bound by this name in the class. */
424 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
425 is used for all binding levels. */
428 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
429 label in this scope. The TREE_PURPOSE is the previous value of
430 the IDENTIFIER_LABEL VALUE. */
431 tree shadowed_labels
;
433 /* For each level (except not the global one),
434 a chain of BLOCK nodes for all the levels
435 that were entered and exited one level down. */
438 /* The BLOCK node for this level, if one has been preallocated.
439 If 0, the BLOCK is allocated (if needed) when the level is popped. */
442 /* The _TYPE node for this level, if parm_flag == 2. */
445 /* The binding level which this one is contained in (inherits from). */
446 struct binding_level
*level_chain
;
448 /* List of decls in `names' that have incomplete
449 structure or union types. */
452 /* List of VAR_DECLS saved from a previous for statement.
453 These would be dead in ISO-conforming code, but might
454 be referenced in ARM-era code. These are stored in a
455 TREE_LIST; the TREE_VALUE is the actual declaration. */
456 tree dead_vars_from_for
;
458 /* 1 for the level that holds the parameters of a function.
459 2 for the level that holds a class declaration.
460 3 for levels that hold parameter declarations. */
461 unsigned parm_flag
: 4;
463 /* 1 means make a BLOCK for this level regardless of all else.
464 2 for temporary binding contours created by the compiler. */
467 /* Nonzero if this level "doesn't exist" for tags. */
468 unsigned tag_transparent
: 1;
470 /* Nonzero if this level can safely have additional
471 cleanup-needing variables added to it. */
472 unsigned more_cleanups_ok
: 1;
473 unsigned have_cleanups
: 1;
475 /* Nonzero if this level is for storing the decls for template
476 parameters and generic decls; these decls will be discarded and
477 replaced with a TEMPLATE_DECL. */
478 unsigned pseudo_global
: 1;
480 /* This is set for a namespace binding level. */
481 unsigned namespace_p
: 1;
483 /* True if this level is that of a for-statement where we need to
484 worry about ambiguous (ARM or ISO) scope rules. */
485 unsigned is_for_scope
: 1;
487 /* True if this level corresponds to an EH region, as for a try block. */
488 unsigned eh_region
: 1;
490 /* One bit left for this word. */
492 #if defined(DEBUG_CP_BINDING_LEVELS)
493 /* Binding depth at which this level began. */
494 unsigned binding_depth
;
495 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
498 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
500 /* The binding level currently in effect. */
502 #define current_binding_level \
504 ? cp_function_chain->bindings \
505 : scope_chain->bindings)
507 /* The binding level of the current class, if any. */
509 #define class_binding_level scope_chain->class_bindings
511 /* A chain of binding_level structures awaiting reuse. */
513 static struct binding_level
*free_binding_level
;
515 /* The outermost binding level, for names of file scope.
516 This is created when the compiler is started and exists
517 through the entire run. */
519 static struct binding_level
*global_binding_level
;
521 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
523 static int keep_next_level_flag
;
525 #if defined(DEBUG_CP_BINDING_LEVELS)
526 static int binding_depth
= 0;
527 static int is_class_level
= 0;
534 for (i
= 0; i
< binding_depth
*2; i
++)
537 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
539 static tree pushdecl_with_scope
PARAMS ((tree
, struct binding_level
*));
542 push_binding_level (newlevel
, tag_transparent
, keep
)
543 struct binding_level
*newlevel
;
544 int tag_transparent
, keep
;
546 /* Add this level to the front of the chain (stack) of levels that
548 bzero ((char*) newlevel
, sizeof (struct binding_level
));
549 newlevel
->level_chain
= current_binding_level
;
550 current_binding_level
= newlevel
;
551 newlevel
->tag_transparent
= tag_transparent
;
552 newlevel
->more_cleanups_ok
= 1;
554 /* We are called before expand_start_bindings, but after
555 expand_eh_region_start for a try block; so we check this now,
556 before the EH block is covered up. */
557 newlevel
->eh_region
= is_eh_region ();
559 newlevel
->keep
= keep
;
560 #if defined(DEBUG_CP_BINDING_LEVELS)
561 newlevel
->binding_depth
= binding_depth
;
563 fprintf (stderr
, "push %s level 0x%08x line %d\n",
564 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
567 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
570 /* Find the innermost enclosing class scope, and reset
571 CLASS_BINDING_LEVEL appropriately. */
574 find_class_binding_level ()
576 struct binding_level
*level
= current_binding_level
;
578 while (level
&& level
->parm_flag
!= 2)
579 level
= level
->level_chain
;
580 if (level
&& level
->parm_flag
== 2)
581 class_binding_level
= level
;
583 class_binding_level
= 0;
589 if (global_binding_level
)
591 /* Cannot pop a level, if there are none left to pop. */
592 if (current_binding_level
== global_binding_level
)
593 my_friendly_abort (123);
595 /* Pop the current level, and free the structure for reuse. */
596 #if defined(DEBUG_CP_BINDING_LEVELS)
599 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
600 (is_class_level
) ? "class" : "block",
601 current_binding_level
, lineno
);
602 if (is_class_level
!= (current_binding_level
== class_binding_level
))
605 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
608 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
610 register struct binding_level
*level
= current_binding_level
;
611 current_binding_level
= current_binding_level
->level_chain
;
612 level
->level_chain
= free_binding_level
;
613 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
614 if (level
->binding_depth
!= binding_depth
)
616 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
617 free_binding_level
= level
;
618 find_class_binding_level ();
623 suspend_binding_level ()
625 if (class_binding_level
)
626 current_binding_level
= class_binding_level
;
628 if (global_binding_level
)
630 /* Cannot suspend a level, if there are none left to suspend. */
631 if (current_binding_level
== global_binding_level
)
632 my_friendly_abort (123);
634 /* Suspend the current level. */
635 #if defined(DEBUG_CP_BINDING_LEVELS)
638 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
639 (is_class_level
) ? "class" : "block",
640 current_binding_level
, lineno
);
641 if (is_class_level
!= (current_binding_level
== class_binding_level
))
644 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
647 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
648 current_binding_level
= current_binding_level
->level_chain
;
649 find_class_binding_level ();
653 resume_binding_level (b
)
654 struct binding_level
*b
;
656 /* Resuming binding levels is meant only for namespaces,
657 and those cannot nest into classes. */
658 my_friendly_assert(!class_binding_level
, 386);
659 /* Also, resuming a non-directly nested namespace is a no-no. */
660 my_friendly_assert(b
->level_chain
== current_binding_level
, 386);
661 current_binding_level
= b
;
662 #if defined(DEBUG_CP_BINDING_LEVELS)
663 b
->binding_depth
= binding_depth
;
665 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
666 (is_class_level
) ? "class" : "block", b
, lineno
);
669 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
672 /* Create a new `struct binding_level'. */
675 struct binding_level
*
676 make_binding_level ()
679 return (struct binding_level
*) xmalloc (sizeof (struct binding_level
));
682 /* Nonzero if we are currently in the global binding level. */
687 return current_binding_level
== global_binding_level
;
690 /* Return the innermost binding level that is not for a class scope. */
692 static struct binding_level
*
693 innermost_nonclass_level ()
695 struct binding_level
*b
;
697 b
= current_binding_level
;
698 while (b
->parm_flag
== 2)
704 /* Nonzero if we are currently in a toplevel binding level. This
705 means either the global binding level or a namespace in a toplevel
706 binding level. Since there are no non-toplevel namespace levels,
707 this really means any namespace or pseudo-global level. We also
708 include a class whose context is toplevel. */
711 toplevel_bindings_p ()
713 struct binding_level
*b
= innermost_nonclass_level ();
715 return b
->namespace_p
|| b
->pseudo_global
;
718 /* Nonzero if this is a namespace scope, or if we are defining a class
719 which is itself at namespace scope, or whose enclosing class is
720 such a class, etc. */
723 namespace_bindings_p ()
725 struct binding_level
*b
= innermost_nonclass_level ();
727 return b
->namespace_p
;
730 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
731 unconditionally. Otherwise, use the normal logic to decide whether
732 or not to create a BLOCK. */
735 keep_next_level (keep
)
738 keep_next_level_flag
= keep
;
741 /* Nonzero if the current level needs to have a BLOCK made. */
746 return (current_binding_level
->blocks
!= NULL_TREE
747 || current_binding_level
->keep
748 || current_binding_level
->names
!= NULL_TREE
749 || (current_binding_level
->tags
!= NULL_TREE
750 && !current_binding_level
->tag_transparent
));
754 declare_pseudo_global_level ()
756 current_binding_level
->pseudo_global
= 1;
760 declare_namespace_level ()
762 current_binding_level
->namespace_p
= 1;
766 pseudo_global_level_p ()
768 return current_binding_level
->pseudo_global
;
772 set_class_shadows (shadows
)
775 class_binding_level
->class_shadowed
= shadows
;
778 /* Enter a new binding level.
779 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
780 not for that of tags. */
783 pushlevel (tag_transparent
)
786 struct binding_level
*newlevel
;
788 if (cfun
&& !doing_semantic_analysis_p ())
791 /* Reuse or create a struct for this binding level. */
792 #if defined(DEBUG_CP_BINDING_LEVELS)
794 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
795 if (free_binding_level
)
796 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
798 newlevel
= free_binding_level
;
799 free_binding_level
= free_binding_level
->level_chain
;
802 newlevel
= make_binding_level ();
804 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
805 GNU_xref_start_scope ((HOST_WIDE_INT
) newlevel
);
806 keep_next_level_flag
= 0;
810 note_level_for_for ()
812 current_binding_level
->is_for_scope
= 1;
815 /* For a binding between a name and an entity at a block scope,
816 this is the `struct binding_level' for the block. */
817 #define BINDING_LEVEL(NODE) \
818 (((struct tree_binding*)NODE)->scope.level)
820 /* Make DECL the innermost binding for ID. The LEVEL is the binding
821 level at which this declaration is being bound. */
824 push_binding (id
, decl
, level
)
827 struct binding_level
* level
;
831 binding
= make_node (CPLUS_BINDING
);
833 /* Now, fill in the binding information. */
834 BINDING_VALUE (binding
) = decl
;
835 BINDING_TYPE (binding
) = NULL_TREE
;
836 BINDING_LEVEL (binding
) = level
;
837 INHERITED_VALUE_BINDING_P (binding
) = 0;
838 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
839 BINDING_HAS_LEVEL_P (binding
) = 1;
841 /* And put it on the front of the list of bindings for ID. */
842 TREE_CHAIN (binding
) = IDENTIFIER_BINDING (id
);
843 IDENTIFIER_BINDING (id
) = binding
;
846 /* ID is already bound in the current scope. But, DECL is an
847 additional binding for ID in the same scope. This is the `struct
848 stat' hack whereby a non-typedef class-name or enum-name can be
849 bound at the same level as some other kind of entity. It's the
850 responsibility of the caller to check that inserting this name is
851 legal here. Returns nonzero if the new binding was successful. */
853 add_binding (id
, decl
)
857 tree binding
= IDENTIFIER_BINDING (id
);
860 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
861 /* The new name is the type name. */
862 BINDING_TYPE (binding
) = decl
;
863 else if (!BINDING_VALUE (binding
))
864 /* This situation arises when push_class_level_binding moves an
865 inherited type-binding out of the way to make room for a new
867 BINDING_VALUE (binding
) = decl
;
868 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
869 && DECL_ARTIFICIAL (BINDING_VALUE (binding
)))
871 /* The old binding was a type name. It was placed in
872 BINDING_VALUE because it was thought, at the point it was
873 declared, to be the only entity with such a name. Move the
874 type name into the type slot; it is now hidden by the new
876 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
877 BINDING_VALUE (binding
) = decl
;
878 INHERITED_VALUE_BINDING_P (binding
) = 0;
880 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
881 && TREE_CODE (decl
) == TYPE_DECL
882 && DECL_NAME (decl
) == DECL_NAME (BINDING_VALUE (binding
))
883 && same_type_p (TREE_TYPE (decl
),
884 TREE_TYPE (BINDING_VALUE (binding
))))
885 /* We have two typedef-names, both naming the same type to have
886 the same name. This is OK because of:
890 In a given scope, a typedef specifier can be used to redefine
891 the name of any type declared in that scope to refer to the
892 type to which it already refers. */
896 cp_error ("declaration of `%#D'", decl
);
897 cp_error_at ("conflicts with previous declaration `%#D'",
898 BINDING_VALUE (binding
));
905 /* Add DECL to the list of things declared in B. */
908 add_decl_to_level (decl
, b
)
910 struct binding_level
*b
;
912 /* We build up the list in reverse order, and reverse it later if
914 TREE_CHAIN (decl
) = b
->names
;
918 /* Bind DECL to ID in the current_binding_level, assumed to be a local
919 binding level. If PUSH_USING is set in FLAGS, we know that DECL
920 doesn't really belong to this binding level, that it got here
921 through a using-declaration. */
924 push_local_binding (id
, decl
, flags
)
929 struct binding_level
*b
;
931 /* Skip over any local classes. This makes sense if we call
932 push_local_binding with a friend decl of a local class. */
933 b
= current_binding_level
;
934 while (b
->parm_flag
== 2)
937 if (lookup_name_current_level (id
))
939 /* Supplement the existing binding. */
940 if (!add_binding (id
, decl
))
941 /* It didn't work. Something else must be bound at this
942 level. Do not add DECL to the list of things to pop
947 /* Create a new binding. */
948 push_binding (id
, decl
, b
);
950 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
951 /* We must put the OVERLOAD into a TREE_LIST since the
952 TREE_CHAIN of an OVERLOAD is already used. Similarly for
953 decls that got here through a using-declaration. */
954 decl
= build_tree_list (NULL_TREE
, decl
);
956 /* And put DECL on the list of things declared by the current
958 add_decl_to_level (decl
, b
);
961 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
962 binding was successful. */
965 push_class_binding (id
, decl
)
970 tree binding
= IDENTIFIER_BINDING (id
);
973 /* Note that we declared this value so that we can issue an error if
974 this an illegal redeclaration of a name already used for some
976 note_name_declared_in_class (id
, decl
);
978 if (binding
&& BINDING_LEVEL (binding
) == class_binding_level
)
979 /* Supplement the existing binding. */
980 result
= add_binding (id
, decl
);
982 /* Create a new binding. */
983 push_binding (id
, decl
, class_binding_level
);
985 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
986 class-level declaration. Note that we do not use DECL here
987 because of the possibility of the `struct stat' hack; if DECL is
988 a class-name or enum-name we might prefer a field-name, or some
990 IDENTIFIER_CLASS_VALUE (id
) = BINDING_VALUE (IDENTIFIER_BINDING (id
));
992 /* If this is a binding from a base class, mark it as such. */
993 binding
= IDENTIFIER_BINDING (id
);
994 if (BINDING_VALUE (binding
) == decl
&& TREE_CODE (decl
) != TREE_LIST
)
996 /* Any implicit typename must be from a base-class. The
997 context for an implicit typename declaration is always
998 the derived class in which the lookup was done, so the checks
999 based on the context of DECL below will not trigger. */
1000 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl
))
1001 INHERITED_VALUE_BINDING_P (binding
) = 1;
1004 if (TREE_CODE (decl
) == OVERLOAD
)
1005 context
= CP_DECL_CONTEXT (OVL_CURRENT (decl
));
1008 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd',
1010 context
= CP_DECL_CONTEXT (decl
);
1013 if (is_properly_derived_from (current_class_type
, context
))
1014 INHERITED_VALUE_BINDING_P (binding
) = 1;
1016 INHERITED_VALUE_BINDING_P (binding
) = 0;
1019 else if (BINDING_VALUE (binding
) == decl
)
1020 /* We only encounter a TREE_LIST when push_class_decls detects an
1021 ambiguity. Such an ambiguity can be overridden by a definition
1023 INHERITED_VALUE_BINDING_P (binding
) = 1;
1028 /* Remove the binding for DECL which should be the innermost binding
1032 pop_binding (id
, decl
)
1038 if (id
== NULL_TREE
)
1039 /* It's easiest to write the loops that call this function without
1040 checking whether or not the entities involved have names. We
1041 get here for such an entity. */
1044 /* Get the innermost binding for ID. */
1045 binding
= IDENTIFIER_BINDING (id
);
1047 /* The name should be bound. */
1048 my_friendly_assert (binding
!= NULL_TREE
, 0);
1050 /* The DECL will be either the ordinary binding or the type
1051 binding for this identifier. Remove that binding. */
1052 if (BINDING_VALUE (binding
) == decl
)
1053 BINDING_VALUE (binding
) = NULL_TREE
;
1054 else if (BINDING_TYPE (binding
) == decl
)
1055 BINDING_TYPE (binding
) = NULL_TREE
;
1057 my_friendly_abort (0);
1059 if (!BINDING_VALUE (binding
) && !BINDING_TYPE (binding
))
1060 /* We're completely done with the innermost binding for this
1061 identifier. Unhook it from the list of bindings. */
1062 IDENTIFIER_BINDING (id
) = TREE_CHAIN (binding
);
1065 /* When a label goes out of scope, check to see if that label was used
1066 in a valid manner, and issue any appropriate warnings or errors. */
1072 tree label
= TREE_VALUE (link
);
1074 if (!processing_template_decl
&& doing_semantic_analysis_p ())
1076 if (DECL_INITIAL (label
) == NULL_TREE
)
1078 cp_error_at ("label `%D' used but not defined", label
);
1079 /* Avoid crashing later. */
1080 define_label (input_filename
, 1, DECL_NAME (label
));
1082 else if (warn_unused
&& !TREE_USED (label
))
1083 cp_warning_at ("label `%D' defined but not used", label
);
1086 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), TREE_PURPOSE (link
));
1089 /* At the end of a function, all labels declared within the fucntion
1090 go out of scope. BLOCK is the top-level block for the
1099 /* Clear out the definitions of all label names, since their scopes
1101 for (link
= named_labels
; link
; link
= TREE_CHAIN (link
))
1104 /* Put the labels into the "variables" of the top-level block,
1105 so debugger can see them. */
1106 TREE_CHAIN (TREE_VALUE (link
)) = BLOCK_VARS (block
);
1107 BLOCK_VARS (block
) = TREE_VALUE (link
);
1110 named_labels
= NULL_TREE
;
1113 /* Exit a binding level.
1114 Pop the level off, and restore the state of the identifier-decl mappings
1115 that were in effect when this level was entered.
1117 If KEEP == 1, this level had explicit declarations, so
1118 and create a "block" (a BLOCK node) for the level
1119 to record its declarations and subblocks for symbol table output.
1121 If FUNCTIONBODY is nonzero, this level is the body of a function,
1122 so create a block as if KEEP were set and also clear out all
1125 If REVERSE is nonzero, reverse the order of decls before putting
1126 them into the BLOCK. */
1129 poplevel (keep
, reverse
, functionbody
)
1135 /* The chain of decls was accumulated in reverse order.
1136 Put it into forward order, just for cleanliness. */
1138 int tmp
= functionbody
;
1139 int real_functionbody
;
1142 tree block
= NULL_TREE
;
1144 int block_previously_created
;
1145 int leaving_for_scope
;
1147 if (cfun
&& !doing_semantic_analysis_p ())
1150 my_friendly_assert (current_binding_level
->parm_flag
!= 2,
1153 real_functionbody
= (current_binding_level
->keep
== 2
1154 ? ((functionbody
= 0), tmp
) : functionbody
);
1155 tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1156 subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1158 my_friendly_assert (!current_binding_level
->class_shadowed
,
1161 /* We used to use KEEP == 2 to indicate that the new block should go
1162 at the beginning of the list of blocks at this binding level,
1163 rather than the end. This hack is no longer used. */
1164 my_friendly_assert (keep
== 0 || keep
== 1, 0);
1166 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1167 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1168 current_binding_level
->parm_flag
,
1169 current_binding_level
->keep
);
1171 if (current_binding_level
->keep
== 1)
1174 /* Get the decls in the order they were written.
1175 Usually current_binding_level->names is in reverse order.
1176 But parameter decls were previously put in forward order. */
1179 current_binding_level
->names
1180 = decls
= nreverse (current_binding_level
->names
);
1182 decls
= current_binding_level
->names
;
1184 /* Output any nested inline functions within this block
1185 if they weren't already output. */
1186 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1187 if (TREE_CODE (decl
) == FUNCTION_DECL
1188 && ! TREE_ASM_WRITTEN (decl
)
1189 && DECL_INITIAL (decl
) != NULL_TREE
1190 && TREE_ADDRESSABLE (decl
)
1191 && decl_function_context (decl
) == current_function_decl
)
1193 /* If this decl was copied from a file-scope decl
1194 on account of a block-scope extern decl,
1195 propagate TREE_ADDRESSABLE to the file-scope decl. */
1196 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1197 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1200 push_function_context ();
1201 output_inline_function (decl
);
1202 pop_function_context ();
1206 /* When not in function-at-a-time mode, expand_end_bindings will
1207 warn about unused variables. But, in function-at-a-time mode
1208 expand_end_bindings is not passed the list of variables in the
1209 current scope, and therefore no warning is emitted. So, we
1210 explicitly warn here. */
1211 if (!processing_template_decl
)
1212 warn_about_unused_variables (getdecls ());
1214 /* If there were any declarations or structure tags in that level,
1215 or if this level is a function body,
1216 create a BLOCK to record them for the life of this function. */
1218 block_previously_created
= (current_binding_level
->this_block
!= NULL_TREE
);
1219 if (block_previously_created
)
1220 block
= current_binding_level
->this_block
;
1221 else if (keep
== 1 || functionbody
)
1222 block
= make_node (BLOCK
);
1223 if (block
!= NULL_TREE
)
1225 if (block_previously_created
)
1227 if (decls
|| tags
|| subblocks
)
1229 if (BLOCK_VARS (block
))
1230 warning ("internal compiler error: debugging info corrupted");
1232 BLOCK_VARS (block
) = decls
;
1234 /* We can have previous subblocks and new subblocks when
1235 doing fixup_gotos with complex cleanups. We chain the new
1236 subblocks onto the end of any pre-existing subblocks. */
1237 BLOCK_SUBBLOCKS (block
) = chainon (BLOCK_SUBBLOCKS (block
),
1243 BLOCK_VARS (block
) = decls
;
1244 BLOCK_SUBBLOCKS (block
) = subblocks
;
1248 /* In each subblock, record that this is its superior. */
1250 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1251 BLOCK_SUPERCONTEXT (link
) = block
;
1253 /* We still support the old for-scope rules, whereby the variables
1254 in a for-init statement were in scope after the for-statement
1255 ended. We only use the new rules in flag_new_for_scope is
1258 = current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1;
1260 /* Remove declarations for all the DECLs in this level. */
1261 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1263 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
)
1266 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link
)));
1270 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
1272 ns_binding
= NULL_TREE
;
1275 && (BINDING_LEVEL (outer_binding
)
1276 == current_binding_level
->level_chain
))
1277 /* We have something like:
1282 and we are leaving the `for' scope. There's no reason to
1283 keep the binding of the inner `i' in this case. */
1284 pop_binding (DECL_NAME (link
), link
);
1285 else if ((outer_binding
1286 && (TREE_CODE (BINDING_VALUE (outer_binding
))
1289 && TREE_CODE (ns_binding
) == TYPE_DECL
))
1290 /* Here, we have something like:
1298 We must pop the for-scope binding so we know what's a
1299 type and what isn't. */
1300 pop_binding (DECL_NAME (link
), link
);
1303 /* Mark this VAR_DECL as dead so that we can tell we left it
1304 there only for backward compatibility. */
1305 DECL_DEAD_FOR_LOCAL (link
) = 1;
1307 /* Keep track of what should of have happenned when we
1308 popped the binding. */
1309 if (outer_binding
&& BINDING_VALUE (outer_binding
))
1310 DECL_SHADOWED_FOR_VAR (link
)
1311 = BINDING_VALUE (outer_binding
);
1313 /* Add it to the list of dead variables in the next
1314 outermost binding to that we can remove these when we
1315 leave that binding. */
1316 current_binding_level
->level_chain
->dead_vars_from_for
1317 = tree_cons (NULL_TREE
, link
,
1318 current_binding_level
->level_chain
->
1319 dead_vars_from_for
);
1321 /* Although we don't pop the CPLUS_BINDING, we do clear
1322 its BINDING_LEVEL since the level is going away now. */
1323 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link
)))
1329 /* Remove the binding. */
1331 if (TREE_CODE (decl
) == TREE_LIST
)
1332 decl
= TREE_VALUE (decl
);
1333 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd')
1334 pop_binding (DECL_NAME (decl
), decl
);
1335 else if (TREE_CODE (decl
) == OVERLOAD
)
1336 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
1338 my_friendly_abort (0);
1342 /* Remove declarations for any `for' variables from inner scopes
1343 that we kept around. */
1344 for (link
= current_binding_level
->dead_vars_from_for
;
1345 link
; link
= TREE_CHAIN (link
))
1346 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
1348 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1349 for (link
= current_binding_level
->type_shadowed
;
1350 link
; link
= TREE_CHAIN (link
))
1351 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1353 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1354 for (link
= current_binding_level
->shadowed_labels
;
1356 link
= TREE_CHAIN (link
))
1359 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1360 list if a `using' declaration put them there. The debugging
1361 back-ends won't understand OVERLOAD, so we remove them here.
1362 Because the BLOCK_VARS are (temporarily) shared with
1363 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1364 popped all the bindings. */
1369 for (d
= &BLOCK_VARS (block
); *d
; )
1371 if (TREE_CODE (*d
) == TREE_LIST
)
1372 *d
= TREE_CHAIN (*d
);
1374 d
= &TREE_CHAIN (*d
);
1378 /* If the level being exited is the top level of a function,
1379 check over all the labels. */
1382 /* Since this is the top level block of a function, the vars are
1383 the function's parameters. Don't leave them in the BLOCK
1384 because they are found in the FUNCTION_DECL instead. */
1385 BLOCK_VARS (block
) = 0;
1389 /* Any uses of undefined labels now operate under constraints
1390 of next binding contour. */
1393 struct binding_level
*level_chain
;
1394 level_chain
= current_binding_level
->level_chain
;
1397 struct named_label_list
*labels
;
1398 for (labels
= named_label_uses
; labels
; labels
= labels
->next
)
1399 if (labels
->binding_level
== current_binding_level
)
1401 labels
->binding_level
= level_chain
;
1402 labels
->names_in_scope
= level_chain
->names
;
1407 tmp
= current_binding_level
->keep
;
1409 pop_binding_level ();
1411 DECL_INITIAL (current_function_decl
) = block
;
1414 if (!block_previously_created
)
1415 current_binding_level
->blocks
1416 = chainon (current_binding_level
->blocks
, block
);
1418 /* If we did not make a block for the level just exited,
1419 any blocks made for inner levels
1420 (since they cannot be recorded as subblocks in that level)
1421 must be carried forward so they will later become subblocks
1422 of something else. */
1424 current_binding_level
->blocks
1425 = chainon (current_binding_level
->blocks
, subblocks
);
1427 /* Each and every BLOCK node created here in `poplevel' is important
1428 (e.g. for proper debugging information) so if we created one
1429 earlier, mark it as "used". */
1431 TREE_USED (block
) = 1;
1433 /* Take care of compiler's internal binding structures. */
1439 = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/1);
1442 SCOPE_STMT_BLOCK (TREE_PURPOSE (scope_stmts
)) = block
;
1443 SCOPE_STMT_BLOCK (TREE_VALUE (scope_stmts
)) = block
;
1446 block
= poplevel (keep
, reverse
, functionbody
);
1452 /* Delete the node BLOCK from the current binding level.
1453 This is used for the block inside a stmt expr ({...})
1454 so that the block can be reinserted where appropriate. */
1457 delete_block (block
)
1461 if (current_binding_level
->blocks
== block
)
1462 current_binding_level
->blocks
= TREE_CHAIN (block
);
1463 for (t
= current_binding_level
->blocks
; t
;)
1465 if (TREE_CHAIN (t
) == block
)
1466 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1470 TREE_CHAIN (block
) = NULL_TREE
;
1471 /* Clear TREE_USED which is always set by poplevel.
1472 The flag is set again if insert_block is called. */
1473 TREE_USED (block
) = 0;
1476 /* Insert BLOCK at the end of the list of subblocks of the
1477 current binding level. This is used when a BIND_EXPR is expanded,
1478 to handle the BLOCK node inside the BIND_EXPR. */
1481 insert_block (block
)
1484 TREE_USED (block
) = 1;
1485 current_binding_level
->blocks
1486 = chainon (current_binding_level
->blocks
, block
);
1489 /* Set the BLOCK node for the innermost scope
1490 (the one we are currently in). */
1494 register tree block
;
1496 current_binding_level
->this_block
= block
;
1499 /* Do a pushlevel for class declarations. */
1504 register struct binding_level
*newlevel
;
1506 /* Reuse or create a struct for this binding level. */
1507 #if defined(DEBUG_CP_BINDING_LEVELS)
1509 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1510 if (free_binding_level
)
1511 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1513 newlevel
= free_binding_level
;
1514 free_binding_level
= free_binding_level
->level_chain
;
1517 newlevel
= make_binding_level ();
1519 #if defined(DEBUG_CP_BINDING_LEVELS)
1521 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1523 push_binding_level (newlevel
, 0, 0);
1525 class_binding_level
= current_binding_level
;
1526 class_binding_level
->parm_flag
= 2;
1527 class_binding_level
->this_class
= current_class_type
;
1530 /* ...and a poplevel for class declarations. */
1535 register struct binding_level
*level
= class_binding_level
;
1538 my_friendly_assert (level
!= 0, 354);
1540 /* If we're leaving a toplevel class, don't bother to do the setting
1541 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1542 shouldn't even be used when current_class_type isn't set, and second,
1543 if we don't touch it here, we're able to use the cache effect if the
1544 next time we're entering a class scope, it is the same class. */
1545 if (current_class_depth
!= 1)
1547 struct binding_level
* b
;
1549 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1550 for (shadowed
= level
->class_shadowed
;
1552 shadowed
= TREE_CHAIN (shadowed
))
1553 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = NULL_TREE
;
1555 /* Find the next enclosing class, and recreate
1556 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1557 b
= level
->level_chain
;
1558 while (b
&& b
->parm_flag
!= 2)
1562 for (shadowed
= b
->class_shadowed
;
1564 shadowed
= TREE_CHAIN (shadowed
))
1568 t
= IDENTIFIER_BINDING (TREE_PURPOSE (shadowed
));
1569 while (t
&& BINDING_LEVEL (t
) != b
)
1573 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
))
1574 = BINDING_VALUE (t
);
1578 /* Remember to save what IDENTIFIER's were bound in this scope so we
1579 can recover from cache misses. */
1581 previous_class_type
= current_class_type
;
1582 previous_class_values
= class_binding_level
->class_shadowed
;
1584 for (shadowed
= level
->type_shadowed
;
1586 shadowed
= TREE_CHAIN (shadowed
))
1587 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1589 /* Remove the bindings for all of the class-level declarations. */
1590 for (shadowed
= level
->class_shadowed
;
1592 shadowed
= TREE_CHAIN (shadowed
))
1593 pop_binding (TREE_PURPOSE (shadowed
), TREE_TYPE (shadowed
));
1595 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1596 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1597 class_binding_level
->parm_flag
,
1598 class_binding_level
->keep
);
1600 /* Now, pop out of the binding level which we created up in the
1601 `pushlevel_class' routine. */
1602 #if defined(DEBUG_CP_BINDING_LEVELS)
1604 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1606 pop_binding_level ();
1609 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1610 for any names in enclosing classes. */
1613 clear_identifier_class_values ()
1617 if (!class_binding_level
)
1620 for (t
= class_binding_level
->class_shadowed
;
1623 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
1626 /* Returns non-zero if T is a virtual function table. */
1629 vtable_decl_p (t
, data
)
1631 void *data ATTRIBUTE_UNUSED
;
1633 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
1636 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1640 vtype_decl_p (t
, data
)
1642 void *data ATTRIBUTE_UNUSED
;
1644 return (TREE_CODE (t
) == TYPE_DECL
1645 && TREE_TYPE (t
) != error_mark_node
1646 && TYPE_LANG_SPECIFIC (TREE_TYPE (t
))
1647 && CLASSTYPE_VSIZE (TREE_TYPE (t
)));
1650 /* Return the declarations that are members of the namespace NS. */
1653 cp_namespace_decls (ns
)
1656 return NAMESPACE_LEVEL (ns
)->names
;
1659 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1660 itself, calling F for each. The DATA is passed to F as well. */
1663 walk_namespaces_r (namespace, f
, data
)
1665 walk_namespaces_fn f
;
1671 result
|= (*f
) (namespace, data
);
1673 for (current
= cp_namespace_decls (namespace);
1675 current
= TREE_CHAIN (current
))
1677 if (TREE_CODE (current
) != NAMESPACE_DECL
1678 || DECL_NAMESPACE_ALIAS (current
))
1680 if (!DECL_LANG_SPECIFIC (current
))
1683 my_friendly_assert (current
== std_node
, 393);
1687 /* We found a namespace. */
1688 result
|= walk_namespaces_r (current
, f
, data
);
1694 /* Walk all the namespaces, calling F for each. The DATA is passed to
1698 walk_namespaces (f
, data
)
1699 walk_namespaces_fn f
;
1702 return walk_namespaces_r (global_namespace
, f
, data
);
1705 struct walk_globals_data
{
1706 walk_globals_pred p
;
1711 /* Walk the global declarations in NAMESPACE. Whenever one is found
1712 for which P returns non-zero, call F with its address. If any call
1713 to F returns a non-zero value, return a non-zero value. */
1716 walk_globals_r (namespace, data
)
1720 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1721 walk_globals_pred p
= wgd
->p
;
1722 walk_globals_fn f
= wgd
->f
;
1723 void *d
= wgd
->data
;
1727 t
= &NAMESPACE_LEVEL (namespace)->names
;
1734 result
|= (*f
) (t
, d
);
1736 /* If F changed *T, then *T still points at the next item to
1739 t
= &TREE_CHAIN (*t
);
1745 /* Walk the global declarations. Whenever one is found for which P
1746 returns non-zero, call F with its address. If any call to F
1747 returns a non-zero value, return a non-zero value. */
1750 walk_globals (p
, f
, data
)
1751 walk_globals_pred p
;
1755 struct walk_globals_data wgd
;
1760 return walk_namespaces (walk_globals_r
, &wgd
);
1763 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1764 DATA is non-NULL, this is the last time we will call
1765 wrapup_global_declarations for this NAMESPACE. */
1768 wrapup_globals_for_namespace (namespace, data
)
1772 tree globals
= cp_namespace_decls (namespace);
1773 int len
= list_length (globals
);
1774 tree
*vec
= (tree
*) alloca (sizeof (tree
) * len
);
1778 int last_time
= (data
!= 0);
1780 if (last_time
&& namespace == global_namespace
)
1781 /* Let compile_file handle the global namespace. */
1784 /* Process the decls in reverse order--earliest first.
1785 Put them into VEC from back to front, then take out from front. */
1787 for (i
= 0, decl
= globals
; i
< len
; i
++, decl
= TREE_CHAIN (decl
))
1789 /* Pretend we've output an unused static variable. This ensures
1790 that the toplevel __FUNCTION__ etc won't be emitted, unless
1792 if (TREE_CODE (decl
) == VAR_DECL
&& TREE_STATIC (decl
)
1793 && !TREE_USED (decl
))
1794 TREE_ASM_WRITTEN (decl
) = 1;
1795 vec
[len
- i
- 1] = decl
;
1800 check_global_declarations (vec
, len
);
1804 /* Temporarily mark vtables as external. That prevents
1805 wrapup_global_declarations from writing them out; we must process
1806 them ourselves in finish_vtable_vardecl. */
1807 for (i
= 0; i
< len
; ++i
)
1808 if (vtable_decl_p (vec
[i
], /*data=*/0) && !DECL_EXTERNAL (vec
[i
]))
1810 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 1;
1811 DECL_EXTERNAL (vec
[i
]) = 1;
1814 /* Write out any globals that need to be output. */
1815 result
= wrapup_global_declarations (vec
, len
);
1817 /* Undo the hack to DECL_EXTERNAL above. */
1818 for (i
= 0; i
< len
; ++i
)
1819 if (vtable_decl_p (vec
[i
], /*data=*/0)
1820 && DECL_NOT_REALLY_EXTERN (vec
[i
]))
1822 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 0;
1823 DECL_EXTERNAL (vec
[i
]) = 0;
1830 /* Mark ARG (which is really a struct binding_level **) for GC. */
1833 mark_binding_level (arg
)
1836 struct binding_level
*lvl
= *(struct binding_level
**)arg
;
1840 ggc_mark_tree (lvl
->names
);
1841 ggc_mark_tree (lvl
->tags
);
1842 ggc_mark_tree (lvl
->usings
);
1843 ggc_mark_tree (lvl
->using_directives
);
1844 ggc_mark_tree (lvl
->class_shadowed
);
1845 ggc_mark_tree (lvl
->type_shadowed
);
1846 ggc_mark_tree (lvl
->shadowed_labels
);
1847 ggc_mark_tree (lvl
->blocks
);
1848 ggc_mark_tree (lvl
->this_block
);
1849 ggc_mark_tree (lvl
->this_class
);
1850 ggc_mark_tree (lvl
->incomplete
);
1851 ggc_mark_tree (lvl
->dead_vars_from_for
);
1853 lvl
= lvl
->level_chain
;
1857 /* For debugging. */
1858 static int no_print_functions
= 0;
1859 static int no_print_builtins
= 0;
1862 print_binding_level (lvl
)
1863 struct binding_level
*lvl
;
1867 fprintf (stderr
, " blocks=");
1868 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
1869 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
1870 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
1871 if (lvl
->tag_transparent
)
1872 fprintf (stderr
, " tag-transparent");
1873 if (lvl
->more_cleanups_ok
)
1874 fprintf (stderr
, " more-cleanups-ok");
1875 if (lvl
->have_cleanups
)
1876 fprintf (stderr
, " have-cleanups");
1877 fprintf (stderr
, "\n");
1880 fprintf (stderr
, " names:\t");
1881 /* We can probably fit 3 names to a line? */
1882 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
1884 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
1886 if (no_print_builtins
1887 && (TREE_CODE (t
) == TYPE_DECL
)
1888 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
1891 /* Function decls tend to have longer names. */
1892 if (TREE_CODE (t
) == FUNCTION_DECL
)
1899 fprintf (stderr
, "\n\t");
1902 print_node_brief (stderr
, "", t
, 0);
1903 if (t
== error_mark_node
)
1907 fprintf (stderr
, "\n");
1911 fprintf (stderr
, " tags:\t");
1913 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
1915 if (TREE_PURPOSE (t
) == NULL_TREE
)
1917 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
1924 fprintf (stderr
, "\n\t");
1927 if (TREE_PURPOSE (t
) == NULL_TREE
)
1929 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
1930 fprintf (stderr
, ">");
1932 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
1933 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
1936 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
1937 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
1938 fprintf (stderr
, ">");
1942 fprintf (stderr
, "\n");
1944 if (lvl
->class_shadowed
)
1946 fprintf (stderr
, " class-shadowed:");
1947 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
1949 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1951 fprintf (stderr
, "\n");
1953 if (lvl
->type_shadowed
)
1955 fprintf (stderr
, " type-shadowed:");
1956 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
1958 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
1960 fprintf (stderr
, "\n");
1965 print_other_binding_stack (stack
)
1966 struct binding_level
*stack
;
1968 struct binding_level
*level
;
1969 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
1971 fprintf (stderr
, "binding level ");
1972 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
1973 fprintf (stderr
, "\n");
1974 print_binding_level (level
);
1979 print_binding_stack ()
1981 struct binding_level
*b
;
1982 fprintf (stderr
, "current_binding_level=");
1983 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
1984 fprintf (stderr
, "\nclass_binding_level=");
1985 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
1986 fprintf (stderr
, "\nglobal_binding_level=");
1987 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
1988 fprintf (stderr
, "\n");
1989 if (class_binding_level
)
1991 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
1992 if (b
== current_binding_level
)
1995 b
= class_binding_level
;
1997 b
= current_binding_level
;
2000 b
= current_binding_level
;
2001 print_other_binding_stack (b
);
2002 fprintf (stderr
, "global:\n");
2003 print_binding_level (global_binding_level
);
2006 /* Namespace binding access routines: The namespace_bindings field of
2007 the identifier is polymorphic, with three possible values:
2008 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2009 indicating the BINDING_VALUE of global_namespace. */
2011 /* Check whether the a binding for the name to scope is known.
2012 Assumes that the bindings of the name are already a list
2013 of bindings. Returns the binding found, or NULL_TREE. */
2016 find_binding (name
, scope
)
2020 tree iter
, prev
= NULL_TREE
;
2022 scope
= ORIGINAL_NAMESPACE (scope
);
2024 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
2025 iter
= TREE_CHAIN (iter
))
2027 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
2028 if (BINDING_SCOPE (iter
) == scope
)
2030 /* Move binding found to the front of the list, so
2031 subsequent lookups will find it faster. */
2034 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
2035 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
2036 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
2045 /* Always returns a binding for name in scope. If the
2046 namespace_bindings is not a list, convert it to one first.
2047 If no binding is found, make a new one. */
2050 binding_for_name (name
, scope
)
2054 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2057 scope
= ORIGINAL_NAMESPACE (scope
);
2059 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
2061 /* Get rid of optimization for global scope. */
2062 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
2063 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
2064 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2066 if (b
&& (result
= find_binding (name
, scope
)))
2068 /* Not found, make a new one. */
2069 result
= make_node (CPLUS_BINDING
);
2070 TREE_CHAIN (result
) = b
;
2071 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2072 BINDING_SCOPE (result
) = scope
;
2073 BINDING_TYPE (result
) = NULL_TREE
;
2074 BINDING_VALUE (result
) = NULL_TREE
;
2078 /* Return the binding value for name in scope, considering that
2079 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2082 namespace_binding (name
, scope
)
2086 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2089 if (scope
== NULL_TREE
)
2090 scope
= global_namespace
;
2091 if (TREE_CODE (b
) != CPLUS_BINDING
)
2092 return (scope
== global_namespace
) ? b
: NULL_TREE
;
2093 name
= find_binding (name
,scope
);
2094 if (name
== NULL_TREE
)
2096 return BINDING_VALUE (name
);
2099 /* Set the binding value for name in scope. If modifying the binding
2100 of global_namespace is attempted, try to optimize it. */
2103 set_namespace_binding (name
, scope
, val
)
2110 if (scope
== NULL_TREE
)
2111 scope
= global_namespace
;
2113 if (scope
== global_namespace
)
2115 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2116 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
2118 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
2122 b
= binding_for_name (name
, scope
);
2123 BINDING_VALUE (b
) = val
;
2126 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2127 select a name that is unique to this compilation unit. */
2130 push_namespace (name
)
2135 int implicit_use
= 0;
2137 if (!global_namespace
)
2139 /* This must be ::. */
2140 my_friendly_assert (name
== get_identifier ("::"), 377);
2145 /* The name of anonymous namespace is unique for the translation
2147 if (!anonymous_namespace_name
)
2148 anonymous_namespace_name
= get_file_function_name ('N');
2149 name
= anonymous_namespace_name
;
2150 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2152 /* Reopening anonymous namespace. */
2156 else if (current_namespace
== global_namespace
2157 && name
== DECL_NAME (std_node
))
2164 /* Check whether this is an extended namespace definition. */
2165 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2166 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
2169 if (DECL_NAMESPACE_ALIAS (d
))
2171 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2172 d
, DECL_NAMESPACE_ALIAS (d
));
2173 d
= DECL_NAMESPACE_ALIAS (d
);
2180 /* Make a new namespace, binding the name to it. */
2181 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
2182 /* The global namespace is not pushed, and the global binding
2183 level is set elsewhere. */
2188 declare_namespace_level ();
2189 NAMESPACE_LEVEL (d
) = current_binding_level
;
2193 resume_binding_level (NAMESPACE_LEVEL (d
));
2196 do_using_directive (d
);
2197 /* Enter the name space. */
2198 current_namespace
= d
;
2201 /* Pop from the scope of the current namespace. */
2206 if (current_namespace
== global_namespace
)
2208 my_friendly_assert (in_std
>0, 980421);
2212 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
2213 /* The binding level is not popped, as it might be re-opened later. */
2214 suspend_binding_level ();
2217 /* Push into the scope of the namespace NS, even if it is deeply
2218 nested within another namespace. */
2221 push_nested_namespace (ns
)
2224 if (ns
== global_namespace
)
2225 push_to_top_level ();
2228 push_nested_namespace (CP_DECL_CONTEXT (ns
));
2229 push_namespace (DECL_NAME (ns
));
2233 /* Pop back from the scope of the namespace NS, which was previously
2234 entered with push_nested_namespace. */
2237 pop_nested_namespace (ns
)
2240 while (ns
!= global_namespace
)
2243 ns
= CP_DECL_CONTEXT (ns
);
2246 pop_from_top_level ();
2250 /* Subroutines for reverting temporarily to top-level for instantiation
2251 of templates and such. We actually need to clear out the class- and
2252 local-value slots of all identifiers, so that only the global values
2253 are at all visible. Simply setting current_binding_level to the global
2254 scope isn't enough, because more binding levels may be pushed. */
2255 struct saved_scope
*scope_chain
;
2257 /* Mark ST for GC. */
2261 struct stmt_tree
*st
;
2263 ggc_mark_tree (st
->x_last_stmt
);
2264 ggc_mark_tree (st
->x_last_expr_type
);
2267 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2270 mark_saved_scope (arg
)
2273 struct saved_scope
*t
= *(struct saved_scope
**)arg
;
2276 mark_binding_level (&t
->class_bindings
);
2277 ggc_mark_tree (t
->old_bindings
);
2278 ggc_mark_tree (t
->old_namespace
);
2279 ggc_mark_tree (t
->class_name
);
2280 ggc_mark_tree (t
->class_type
);
2281 ggc_mark_tree (t
->access_specifier
);
2282 ggc_mark_tree (t
->function_decl
);
2284 ggc_mark_tree_varray (t
->lang_base
);
2285 ggc_mark_tree (t
->lang_name
);
2286 ggc_mark_tree (t
->x_function_parms
);
2287 ggc_mark_tree (t
->template_parms
);
2288 ggc_mark_tree (t
->x_previous_class_type
);
2289 ggc_mark_tree (t
->x_previous_class_values
);
2290 ggc_mark_tree (t
->x_saved_tree
);
2291 ggc_mark_tree (t
->incomplete
);
2292 ggc_mark_tree (t
->lookups
);
2294 mark_stmt_tree (&t
->x_stmt_tree
);
2295 mark_binding_level (&t
->bindings
);
2301 store_bindings (names
, old_bindings
)
2302 tree names
, old_bindings
;
2305 for (t
= names
; t
; t
= TREE_CHAIN (t
))
2307 tree binding
, t1
, id
;
2309 if (TREE_CODE (t
) == TREE_LIST
)
2310 id
= TREE_PURPOSE (t
);
2315 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2316 we have no IDENTIFIER_BINDING if we have left the class
2317 scope, but cached the class-level declarations. */
2318 || !(IDENTIFIER_BINDING (id
) || IDENTIFIER_CLASS_VALUE (id
)))
2321 for (t1
= old_bindings
; t1
; t1
= TREE_CHAIN (t1
))
2322 if (TREE_VEC_ELT (t1
, 0) == id
)
2325 binding
= make_tree_vec (4);
2329 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
2330 TREE_VEC_ELT (binding
, 0) = id
;
2331 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
2332 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_BINDING (id
);
2333 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
2334 IDENTIFIER_BINDING (id
) = NULL_TREE
;
2335 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
2337 TREE_CHAIN (binding
) = old_bindings
;
2338 old_bindings
= binding
;
2342 return old_bindings
;
2346 maybe_push_to_top_level (pseudo
)
2349 struct saved_scope
*s
;
2350 struct binding_level
*b
;
2354 s
= (struct saved_scope
*) xcalloc (1, sizeof (struct saved_scope
));
2356 b
= scope_chain
? current_binding_level
: 0;
2358 /* If we're in the middle of some function, save our state. */
2362 push_function_context_to (NULL_TREE
);
2367 old_bindings
= NULL_TREE
;
2368 if (scope_chain
&& previous_class_type
)
2369 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
2371 /* Have to include global_binding_level, because class-level decls
2372 aren't listed anywhere useful. */
2373 for (; b
; b
= b
->level_chain
)
2377 /* Template IDs are inserted into the global level. If they were
2378 inserted into namespace level, finish_file wouldn't find them
2379 when doing pending instantiations. Therefore, don't stop at
2380 namespace level, but continue until :: . */
2381 if (b
== global_binding_level
|| (pseudo
&& b
->pseudo_global
))
2384 old_bindings
= store_bindings (b
->names
, old_bindings
);
2385 /* We also need to check class_shadowed to save class-level type
2386 bindings, since pushclass doesn't fill in b->names. */
2387 if (b
->parm_flag
== 2)
2388 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2390 /* Unwind type-value slots back to top level. */
2391 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2392 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2394 s
->prev
= scope_chain
;
2395 s
->old_bindings
= old_bindings
;
2397 s
->need_pop_function_context
= need_pop
;
2398 s
->function_decl
= current_function_decl
;
2401 current_function_decl
= NULL_TREE
;
2402 VARRAY_TREE_INIT (current_lang_base
, 10, "current_lang_base");
2403 current_lang_stack
= &VARRAY_TREE (current_lang_base
, 0);
2404 current_lang_name
= lang_name_cplusplus
;
2405 strict_prototype
= strict_prototypes_lang_cplusplus
;
2406 current_namespace
= global_namespace
;
2410 push_to_top_level ()
2412 maybe_push_to_top_level (0);
2416 pop_from_top_level ()
2418 struct saved_scope
*s
= scope_chain
;
2421 /* Clear out class-level bindings cache. */
2422 if (previous_class_type
)
2423 invalidate_class_lookup_cache ();
2425 VARRAY_FREE (current_lang_base
);
2427 scope_chain
= s
->prev
;
2428 for (t
= s
->old_bindings
; t
; t
= TREE_CHAIN (t
))
2430 tree id
= TREE_VEC_ELT (t
, 0);
2433 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2434 IDENTIFIER_BINDING (id
) = TREE_VEC_ELT (t
, 2);
2435 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2439 if (current_lang_name
== lang_name_cplusplus
)
2440 strict_prototype
= strict_prototypes_lang_cplusplus
;
2441 else if (current_lang_name
== lang_name_c
)
2442 strict_prototype
= strict_prototypes_lang_c
;
2444 /* If we were in the middle of compiling a function, restore our
2446 if (s
->need_pop_function_context
)
2447 pop_function_context_from (NULL_TREE
);
2448 current_function_decl
= s
->function_decl
;
2453 /* Push a definition of struct, union or enum tag "name".
2454 into binding_level "b". "type" should be the type node,
2455 We assume that the tag "name" is not already defined.
2457 Note that the definition may really be just a forward reference.
2458 In that case, the TYPE_SIZE will be a NULL_TREE.
2460 C++ gratuitously puts all these tags in the name space. */
2462 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2463 record the shadowed value for this binding contour. TYPE is
2464 the type that ID maps to. */
2467 set_identifier_type_value_with_scope (id
, type
, b
)
2470 struct binding_level
*b
;
2472 if (!b
->namespace_p
)
2474 /* Shadow the marker, not the real thing, so that the marker
2475 gets restored later. */
2476 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2478 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2482 tree binding
= binding_for_name (id
, current_namespace
);
2483 BINDING_TYPE (binding
) = type
;
2484 /* Store marker instead of real type. */
2485 type
= global_type_node
;
2487 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2490 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2493 set_identifier_type_value (id
, type
)
2497 set_identifier_type_value_with_scope (id
, type
, current_binding_level
);
2500 /* Return the type associated with id. */
2503 identifier_type_value (id
)
2506 /* There is no type with that name, anywhere. */
2507 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2509 /* This is not the type marker, but the real thing. */
2510 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2511 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2512 /* Have to search for it. It must be on the global level, now.
2513 Ask lookup_name not to return non-types. */
2514 id
= lookup_name_real (id
, 2, 1, 0);
2516 return TREE_TYPE (id
);
2520 /* Pop off extraneous binding levels left over due to syntax errors.
2522 We don't pop past namespaces, as they might be valid. */
2527 #ifdef DEBUG_CP_BINDING_LEVELS
2528 fprintf (stderr
, "XXX entering pop_everything ()\n");
2530 while (!toplevel_bindings_p ())
2532 if (current_binding_level
->parm_flag
== 2)
2533 pop_nested_class ();
2537 #ifdef DEBUG_CP_BINDING_LEVELS
2538 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2542 /* The type TYPE is being declared. If it is a class template, or a
2543 specialization of a class template, do any processing required and
2544 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2545 being declared a friend. B is the binding level at which this TYPE
2548 Returns the TYPE_DECL for TYPE, which may have been altered by this
2552 maybe_process_template_type_declaration (type
, globalize
, b
)
2555 struct binding_level
* b
;
2557 tree decl
= TYPE_NAME (type
);
2559 if (processing_template_parmlist
)
2560 /* You can't declare a new template type in a template parameter
2561 list. But, you can declare a non-template type:
2563 template <class A*> struct S;
2565 is a forward-declaration of `A'. */
2569 maybe_check_template_type (type
);
2571 my_friendly_assert (IS_AGGR_TYPE (type
)
2572 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2575 if (processing_template_decl
)
2577 /* This may change after the call to
2578 push_template_decl_real, but we want the original value. */
2579 tree name
= DECL_NAME (decl
);
2581 decl
= push_template_decl_real (decl
, globalize
);
2582 /* If the current binding level is the binding level for the
2583 template parameters (see the comment in
2584 begin_template_parm_list) and the enclosing level is a class
2585 scope, and we're not looking at a friend, push the
2586 declaration of the member class into the class scope. In the
2587 friend case, push_template_decl will already have put the
2588 friend into global scope, if appropriate. */
2589 if (TREE_CODE (type
) != ENUMERAL_TYPE
2590 && !globalize
&& b
->pseudo_global
2591 && b
->level_chain
->parm_flag
== 2)
2593 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2594 /* Put this tag on the list of tags for the class, since
2595 that won't happen below because B is not the class
2596 binding level, but is instead the pseudo-global level. */
2597 b
->level_chain
->tags
=
2598 tree_cons (name
, type
, b
->level_chain
->tags
);
2599 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2600 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2608 /* In C++, you don't have to write `struct S' to refer to `S'; you
2609 can just use `S'. We accomplish this by creating a TYPE_DECL as
2610 if the user had written `typedef struct S S'. Create and return
2611 the TYPE_DECL for TYPE. */
2614 create_implicit_typedef (name
, type
)
2620 decl
= build_decl (TYPE_DECL
, name
, type
);
2621 SET_DECL_ARTIFICIAL (decl
);
2622 /* There are other implicit type declarations, like the one *within*
2623 a class that allows you to write `S::S'. We must distinguish
2625 SET_DECL_IMPLICIT_TYPEDEF_P (decl
);
2626 TYPE_NAME (type
) = decl
;
2631 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2632 Normally put it into the inner-most non-tag-transparent scope,
2633 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2634 The latter is needed for implicit declarations. */
2637 pushtag (name
, type
, globalize
)
2641 register struct binding_level
*b
;
2643 b
= current_binding_level
;
2644 while (b
->tag_transparent
2645 || (globalize
&& b
->parm_flag
== 2))
2648 b
->tags
= tree_cons (name
, type
, b
->tags
);
2652 /* Do C++ gratuitous typedefing. */
2653 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2655 register tree d
= NULL_TREE
;
2657 tree context
= TYPE_CONTEXT (type
);
2661 tree cs
= current_scope ();
2665 else if (cs
!= NULL_TREE
2666 && TREE_CODE_CLASS (TREE_CODE (cs
)) == 't')
2667 /* When declaring a friend class of a local class, we want
2668 to inject the newly named class into the scope
2669 containing the local class, not the namespace scope. */
2670 context
= decl_function_context (get_type_decl (cs
));
2673 context
= current_namespace
;
2675 if ((b
->pseudo_global
&& b
->level_chain
->parm_flag
== 2)
2676 || b
->parm_flag
== 2)
2679 if (current_lang_name
== lang_name_java
)
2680 TYPE_FOR_JAVA (type
) = 1;
2682 d
= create_implicit_typedef (name
, type
);
2683 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2685 set_identifier_type_value_with_scope (name
, type
, b
);
2687 d
= maybe_process_template_type_declaration (type
,
2690 if (b
->parm_flag
== 2)
2692 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2693 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2694 class. But if it's a member template class, we
2695 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2697 finish_member_declaration (d
);
2699 pushdecl_class_level (d
);
2702 d
= pushdecl_with_scope (d
, b
);
2704 if (ANON_AGGRNAME_P (name
))
2705 DECL_IGNORED_P (d
) = 1;
2707 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2708 DECL_ASSEMBLER_NAME (d
) = DECL_NAME (d
);
2709 if (!uses_template_parms (type
))
2710 DECL_ASSEMBLER_NAME (d
)
2711 = get_identifier (build_overload_name (type
, 1, 1));
2713 if (b
->parm_flag
== 2)
2715 if (TYPE_SIZE (current_class_type
) == NULL_TREE
)
2716 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2720 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2721 /* Use the canonical TYPE_DECL for this node. */
2722 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2725 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2726 will be the tagged type we just added to the current
2727 binding level. This fake NULL-named TYPE_DECL node helps
2728 dwarfout.c to know when it needs to output a
2729 representation of a tagged type, and it also gives us a
2730 convenient place to record the "scope start" address for
2733 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2734 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2738 /* Counter used to create anonymous type names. */
2740 static int anon_cnt
= 0;
2742 /* Return an IDENTIFIER which can be used as a name for
2743 anonymous structs and unions. */
2750 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2751 return get_identifier (buf
);
2754 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2755 This keeps dbxout from getting confused. */
2760 register struct binding_level
*b
;
2762 static int last_cnt
= 0;
2764 /* Fast out if no new anon names were declared. */
2765 if (last_cnt
== anon_cnt
)
2768 b
= current_binding_level
;
2769 while (b
->tag_transparent
)
2774 /* A NULL purpose means we have already processed all tags
2775 from here to the end of the list. */
2776 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2778 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2779 TREE_PURPOSE (tags
) = NULL_TREE
;
2780 tags
= TREE_CHAIN (tags
);
2782 last_cnt
= anon_cnt
;
2785 /* Subroutine of duplicate_decls: return truthvalue of whether
2786 or not types of these decls match.
2788 For C++, we must compare the parameter list so that `int' can match
2789 `int&' in a parameter position, but `int&' is not confused with
2793 decls_match (newdecl
, olddecl
)
2794 tree newdecl
, olddecl
;
2798 if (newdecl
== olddecl
)
2801 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
2802 /* If the two DECLs are not even the same kind of thing, we're not
2803 interested in their types. */
2806 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2808 tree f1
= TREE_TYPE (newdecl
);
2809 tree f2
= TREE_TYPE (olddecl
);
2810 tree p1
= TYPE_ARG_TYPES (f1
);
2811 tree p2
= TYPE_ARG_TYPES (f2
);
2813 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
)
2814 && ! (DECL_LANGUAGE (newdecl
) == lang_c
2815 && DECL_LANGUAGE (olddecl
) == lang_c
))
2818 if (TREE_CODE (f1
) != TREE_CODE (f2
))
2821 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
2823 if (! strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
) == lang_c
2826 types_match
= self_promoting_args_p (p1
);
2827 if (p1
== void_list_node
)
2828 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2830 else if (!strict_prototypes_lang_c
&& DECL_LANGUAGE (olddecl
)==lang_c
2831 && DECL_LANGUAGE (newdecl
) == lang_c
&& p1
== NULL_TREE
)
2833 types_match
= self_promoting_args_p (p2
);
2834 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2837 types_match
= compparms (p1
, p2
);
2842 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2844 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
2845 DECL_TEMPLATE_PARMS (olddecl
)))
2848 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
2851 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
2852 DECL_TEMPLATE_RESULT (newdecl
));
2856 if (TREE_TYPE (newdecl
) == error_mark_node
)
2857 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
2858 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
2859 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
2860 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
2863 types_match
= comptypes (TREE_TYPE (newdecl
),
2864 TREE_TYPE (olddecl
),
2865 COMPARE_REDECLARATION
);
2871 /* If NEWDECL is `static' and an `extern' was seen previously,
2872 warn about it. OLDDECL is the previous declaration.
2874 Note that this does not apply to the C++ case of declaring
2875 a variable `extern const' and then later `const'.
2877 Don't complain about built-in functions, since they are beyond
2878 the user's control. */
2881 warn_extern_redeclared_static (newdecl
, olddecl
)
2882 tree newdecl
, olddecl
;
2884 static const char *explicit_extern_static_warning
2885 = "`%D' was declared `extern' and later `static'";
2886 static const char *implicit_extern_static_warning
2887 = "`%D' was declared implicitly `extern' and later `static'";
2891 if (TREE_CODE (newdecl
) == TYPE_DECL
2892 || TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2895 /* Don't get confused by static member functions; that's a different
2897 if (TREE_CODE (newdecl
) == FUNCTION_DECL
2898 && DECL_STATIC_FUNCTION_P (newdecl
))
2901 /* If the old declaration was `static', or the new one isn't, then
2902 then everything is OK. */
2903 if (DECL_THIS_STATIC (olddecl
) || !DECL_THIS_STATIC (newdecl
))
2906 /* It's OK to declare a builtin function as `static'. */
2907 if (TREE_CODE (olddecl
) == FUNCTION_DECL
2908 && DECL_ARTIFICIAL (olddecl
))
2911 name
= DECL_ASSEMBLER_NAME (newdecl
);
2912 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
2913 ? implicit_extern_static_warning
2914 : explicit_extern_static_warning
, newdecl
);
2915 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
2918 /* Handle when a new declaration NEWDECL has the same name as an old
2919 one OLDDECL in the same binding contour. Prints an error message
2922 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
2923 Otherwise, return 0. */
2926 duplicate_decls (newdecl
, olddecl
)
2927 tree newdecl
, olddecl
;
2929 unsigned olddecl_uid
= DECL_UID (olddecl
);
2930 int olddecl_friend
= 0, types_match
= 0;
2931 int new_defines_function
= 0;
2933 if (newdecl
== olddecl
)
2936 types_match
= decls_match (newdecl
, olddecl
);
2938 /* If either the type of the new decl or the type of the old decl is an
2939 error_mark_node, then that implies that we have already issued an
2940 error (earlier) for some bogus type specification, and in that case,
2941 it is rather pointless to harass the user with yet more error message
2942 about the same declaration, so just pretend the types match here. */
2943 if (TREE_TYPE (newdecl
) == error_mark_node
2944 || TREE_TYPE (olddecl
) == error_mark_node
)
2947 /* Check for redeclaration and other discrepancies. */
2948 if (TREE_CODE (olddecl
) == FUNCTION_DECL
2949 && DECL_ARTIFICIAL (olddecl
))
2951 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
2953 /* If you declare a built-in or predefined function name as static,
2954 the old definition is overridden, but optionally warn this was a
2955 bad choice of name. */
2956 if (! TREE_PUBLIC (newdecl
))
2959 cp_warning ("shadowing %s function `%#D'",
2960 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
2962 /* Discard the old built-in function. */
2965 /* If the built-in is not ansi, then programs can override
2966 it even globally without an error. */
2967 else if (! DECL_BUILT_IN (olddecl
))
2968 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
2972 cp_error ("declaration of `%#D'", newdecl
);
2973 cp_error ("conflicts with built-in declaration `%#D'",
2978 else if (!types_match
)
2980 if ((DECL_LANGUAGE (newdecl
) == lang_c
2981 && DECL_LANGUAGE (olddecl
) == lang_c
)
2982 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
2983 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
2985 /* A near match; override the builtin. */
2987 if (TREE_PUBLIC (newdecl
))
2989 cp_warning ("new declaration `%#D'", newdecl
);
2990 cp_warning ("ambiguates built-in declaration `%#D'",
2993 else if (warn_shadow
)
2994 cp_warning ("shadowing %s function `%#D'",
2995 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
2999 /* Discard the old built-in function. */
3003 if (DECL_THIS_STATIC (newdecl
) && !DECL_THIS_STATIC (olddecl
))
3005 /* If a builtin function is redeclared as `static', merge
3006 the declarations, but make the original one static. */
3007 DECL_THIS_STATIC (olddecl
) = 1;
3008 TREE_PUBLIC (olddecl
) = 0;
3010 /* Make the olddeclaration consistent with the new one so that
3011 all remnants of the builtin-ness of this function will be
3013 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3014 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3015 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3016 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (newdecl
),
3020 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3022 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3023 && TREE_CODE (newdecl
) != TYPE_DECL
3024 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3025 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3026 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3027 && TREE_CODE (olddecl
) != TYPE_DECL
3028 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3029 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3032 /* We do nothing special here, because C++ does such nasty
3033 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3034 get shadowed, and know that if we need to find a TYPE_DECL
3035 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3036 slot of the identifier. */
3040 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3041 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3042 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3043 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3046 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
3047 if (TREE_CODE (olddecl
) == TREE_LIST
)
3048 olddecl
= TREE_VALUE (olddecl
);
3049 cp_error_at ("previous declaration of `%#D'", olddecl
);
3051 /* New decl is completely inconsistent with the old one =>
3052 tell caller to replace the old one. */
3056 else if (!types_match
)
3058 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
))
3059 /* These are certainly not duplicate declarations; they're
3060 from different scopes. */
3063 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3065 /* The name of a class template may not be declared to refer to
3066 any other template, class, function, object, namespace, value,
3067 or type in the same scope. */
3068 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3069 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3071 cp_error ("declaration of template `%#D'", newdecl
);
3072 cp_error_at ("conflicts with previous declaration `%#D'",
3075 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3076 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3077 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3078 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3079 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3080 DECL_TEMPLATE_PARMS (olddecl
)))
3082 cp_error ("new declaration `%#D'", newdecl
);
3083 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3087 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3089 if (DECL_LANGUAGE (newdecl
) == lang_c
3090 && DECL_LANGUAGE (olddecl
) == lang_c
)
3092 cp_error ("declaration of C function `%#D' conflicts with",
3094 cp_error_at ("previous declaration `%#D' here", olddecl
);
3096 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3097 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3099 cp_error ("new declaration `%#D'", newdecl
);
3100 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3106 /* Already complained about this, so don't do so again. */
3107 else if (current_class_type
== NULL_TREE
3108 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3110 cp_error ("conflicting types for `%#D'", newdecl
);
3111 cp_error_at ("previous declaration as `%#D'", olddecl
);
3114 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3115 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3116 && (!DECL_TEMPLATE_INFO (newdecl
)
3117 || (DECL_TI_TEMPLATE (newdecl
)
3118 != DECL_TI_TEMPLATE (olddecl
))))
3119 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3120 && (!DECL_TEMPLATE_INFO (olddecl
)
3121 || (DECL_TI_TEMPLATE (olddecl
)
3122 != DECL_TI_TEMPLATE (newdecl
))))))
3123 /* It's OK to have a template specialization and a non-template
3124 with the same type, or to have specializations of two
3125 different templates with the same type. Note that if one is a
3126 specialization, and the other is an instantiation of the same
3127 template, that we do not exit at this point. That situation
3128 can occur if we instantiate a template class, and then
3129 specialize one of its methods. This situation is legal, but
3130 the declarations must be merged in the usual way. */
3132 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3133 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3134 && !DECL_USE_TEMPLATE (newdecl
))
3135 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3136 && !DECL_USE_TEMPLATE (olddecl
))))
3137 /* One of the declarations is a template instantiation, and the
3138 other is not a template at all. That's OK. */
3140 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3141 && DECL_NAMESPACE_ALIAS (newdecl
)
3142 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3143 /* Redeclaration of namespace alias, ignore it. */
3147 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3150 cp_error (errmsg
, newdecl
);
3151 if (DECL_NAME (olddecl
) != NULL_TREE
)
3152 cp_error_at ((DECL_INITIAL (olddecl
)
3153 && namespace_bindings_p ())
3154 ? "`%#D' previously defined here"
3155 : "`%#D' previously declared here", olddecl
);
3157 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3158 && DECL_INITIAL (olddecl
) != NULL_TREE
3159 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3160 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3162 /* Prototype decl follows defn w/o prototype. */
3163 cp_warning_at ("prototype for `%#D'", newdecl
);
3164 cp_warning_at ("follows non-prototype definition here", olddecl
);
3166 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3167 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3169 /* extern "C" int foo ();
3170 int foo () { bar (); }
3172 if (current_lang_stack
3173 == &VARRAY_TREE (current_lang_base
, 0))
3174 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3177 cp_error_at ("previous declaration of `%#D' with %L linkage",
3178 olddecl
, DECL_LANGUAGE (olddecl
));
3179 cp_error ("conflicts with new declaration with %L linkage",
3180 DECL_LANGUAGE (newdecl
));
3184 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3186 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3188 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3189 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3192 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3193 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3195 for (; t1
&& t1
!= void_list_node
;
3196 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3197 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3199 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3204 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3206 cp_pedwarn_at ("after previous specification in `%#D'",
3212 cp_error ("default argument given for parameter %d of `%#D'",
3214 cp_error_at ("after previous specification in `%#D'",
3219 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
3220 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3222 cp_warning ("`%#D' was used before it was declared inline",
3224 cp_warning_at ("previous non-inline declaration here",
3230 /* If new decl is `static' and an `extern' was seen previously,
3232 warn_extern_redeclared_static (newdecl
, olddecl
);
3234 /* We have committed to returning 1 at this point. */
3235 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3237 /* Now that functions must hold information normally held
3238 by field decls, there is extra work to do so that
3239 declaration information does not get destroyed during
3241 if (DECL_VINDEX (olddecl
))
3242 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3243 if (DECL_VIRTUAL_CONTEXT (olddecl
))
3244 DECL_VIRTUAL_CONTEXT (newdecl
) = DECL_VIRTUAL_CONTEXT (olddecl
);
3245 if (DECL_CONTEXT (olddecl
))
3246 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3247 if (DECL_PENDING_INLINE_INFO (newdecl
) == (struct pending_inline
*)0)
3248 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3249 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3250 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3251 DECL_PURE_VIRTUAL_P (newdecl
) |= DECL_PURE_VIRTUAL_P (olddecl
);
3252 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3253 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3254 DECL_THIS_STATIC (newdecl
) |= DECL_THIS_STATIC (olddecl
);
3255 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3257 /* Optionally warn about more than one declaration for the same
3258 name, but don't warn about a function declaration followed by a
3260 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3261 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3262 /* Don't warn about extern decl followed by definition. */
3263 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3264 /* Don't warn about friends, let add_friend take care of it. */
3265 && ! DECL_FRIEND_P (newdecl
))
3267 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3268 cp_warning_at ("previous declaration of `%D'", olddecl
);
3272 /* Deal with C++: must preserve virtual function table size. */
3273 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3275 register tree newtype
= TREE_TYPE (newdecl
);
3276 register tree oldtype
= TREE_TYPE (olddecl
);
3278 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3279 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3281 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3282 CLASSTYPE_FRIEND_CLASSES (newtype
)
3283 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3287 /* Copy all the DECL_... slots specified in the new decl
3288 except for any that we copy here from the old type. */
3289 DECL_MACHINE_ATTRIBUTES (newdecl
)
3290 = merge_machine_decl_attributes (olddecl
, newdecl
);
3292 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3294 if (! duplicate_decls (DECL_TEMPLATE_RESULT (newdecl
),
3295 DECL_TEMPLATE_RESULT (olddecl
)))
3296 cp_error ("invalid redeclaration of %D", newdecl
);
3297 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3298 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3299 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3300 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3307 /* Automatically handles default parameters. */
3308 tree oldtype
= TREE_TYPE (olddecl
);
3311 /* Merge the data types specified in the two decls. */
3312 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3314 if (TREE_CODE (newdecl
) == VAR_DECL
)
3315 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3316 /* Do this after calling `common_type' so that default
3317 parameters don't confuse us. */
3318 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3319 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3320 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3322 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3323 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3324 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3325 TYPE_RAISES_EXCEPTIONS (oldtype
));
3327 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3328 && DECL_SOURCE_LINE (olddecl
) != 0
3330 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
3331 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
3333 cp_error ("declaration of `%F' throws different exceptions",
3335 cp_error_at ("than previous declaration `%F'", olddecl
);
3338 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3340 /* Lay the type out, unless already done. */
3341 if (! same_type_p (newtype
, oldtype
)
3342 && TREE_TYPE (newdecl
) != error_mark_node
3343 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3344 layout_type (TREE_TYPE (newdecl
));
3346 if ((TREE_CODE (newdecl
) == VAR_DECL
3347 || TREE_CODE (newdecl
) == PARM_DECL
3348 || TREE_CODE (newdecl
) == RESULT_DECL
3349 || TREE_CODE (newdecl
) == FIELD_DECL
3350 || TREE_CODE (newdecl
) == TYPE_DECL
)
3351 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3352 layout_decl (newdecl
, 0);
3354 /* Merge the type qualifiers. */
3355 if (TREE_READONLY (newdecl
))
3356 TREE_READONLY (olddecl
) = 1;
3357 if (TREE_THIS_VOLATILE (newdecl
))
3358 TREE_THIS_VOLATILE (olddecl
) = 1;
3360 /* Merge the initialization information. */
3361 if (DECL_INITIAL (newdecl
) == NULL_TREE
3362 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3364 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3365 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3366 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3367 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
3368 && DECL_LANG_SPECIFIC (newdecl
)
3369 && DECL_LANG_SPECIFIC (olddecl
))
3370 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3373 /* Merge the section attribute.
3374 We want to issue an error if the sections conflict but that must be
3375 done later in decl_attributes since we are called before attributes
3377 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3378 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3380 /* Keep the old rtl since we can safely use it. */
3381 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3383 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3385 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (newdecl
)
3386 |= DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (olddecl
);
3387 DECL_NO_CHECK_MEMORY_USAGE (newdecl
)
3388 |= DECL_NO_CHECK_MEMORY_USAGE (olddecl
);
3389 DECL_NO_LIMIT_STACK (newdecl
)
3390 |= DECL_NO_LIMIT_STACK (olddecl
);
3393 /* If cannot merge, then use the new type and qualifiers,
3394 and don't preserve the old rtl. */
3397 /* Clean out any memory we had of the old declaration. */
3398 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3400 TREE_VALUE (oldstatic
) = error_mark_node
;
3402 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3403 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3404 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3405 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3408 /* Merge the storage class information. */
3409 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3410 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3411 DECL_DEFER_OUTPUT (newdecl
) |= DECL_DEFER_OUTPUT (olddecl
);
3412 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3413 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3414 if (! DECL_EXTERNAL (olddecl
))
3415 DECL_EXTERNAL (newdecl
) = 0;
3417 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3419 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3420 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3421 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3422 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3423 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3424 /* Don't really know how much of the language-specific
3425 values we should copy from old to new. */
3426 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3427 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3428 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3429 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3430 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3432 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3433 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3434 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3435 DECL_BEFRIENDING_CLASSES (newdecl
)
3436 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3437 DECL_BEFRIENDING_CLASSES (olddecl
));
3440 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3442 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3443 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3445 /* If newdecl is not a specialization, then it is not a
3446 template-related function at all. And that means that we
3447 shoud have exited above, returning 0. */
3448 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3451 if (TREE_USED (olddecl
))
3452 /* From [temp.expl.spec]:
3454 If a template, a member template or the member of a class
3455 template is explicitly specialized then that
3456 specialization shall be declared before the first use of
3457 that specialization that would cause an implicit
3458 instantiation to take place, in every translation unit in
3459 which such a use occurs. */
3460 cp_error ("explicit specialization of %D after first use",
3463 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3465 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3467 /* If either decl says `inline', this fn is inline, unless its
3468 definition was passed already. */
3469 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3470 DECL_INLINE (olddecl
) = 1;
3471 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3475 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3476 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3477 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3479 if (! types_match
|| new_defines_function
)
3481 /* These need to be copied so that the names are available.
3482 Note that if the types do match, we'll preserve inline
3483 info and other bits, but if not, we won't. */
3484 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3485 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3487 if (new_defines_function
)
3488 /* If defining a function declared with other language
3489 linkage, use the previously declared language linkage. */
3490 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3491 else if (types_match
)
3493 /* If redeclaring a builtin function, and not a definition,
3494 it stays built in. */
3495 if (DECL_BUILT_IN (olddecl
))
3497 DECL_BUILT_IN_CLASS (newdecl
) = DECL_BUILT_IN_CLASS (olddecl
);
3498 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3499 /* If we're keeping the built-in definition, keep the rtl,
3500 regardless of declaration matches. */
3501 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3504 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3506 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3507 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3508 /* Previously saved insns go together with
3509 the function's previous definition. */
3510 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3511 /* Don't clear out the arguments if we're redefining a function. */
3512 if (DECL_ARGUMENTS (olddecl
))
3513 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3515 if (DECL_LANG_SPECIFIC (olddecl
))
3516 DECL_MAIN_VARIANT (newdecl
) = DECL_MAIN_VARIANT (olddecl
);
3519 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3521 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3524 /* Now preserve various other info from the definition. */
3525 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3526 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3527 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3528 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3530 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3534 function_size
= sizeof (struct tree_decl
);
3536 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3537 (char *) olddecl
+ sizeof (struct tree_common
),
3538 function_size
- sizeof (struct tree_common
));
3540 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3542 /* If newdecl is a template instantiation, it is possible that
3543 the following sequence of events has occurred:
3545 o A friend function was declared in a class template. The
3546 class template was instantiated.
3548 o The instantiation of the friend declaration was
3549 recorded on the instantiation list, and is newdecl.
3551 o Later, however, instantiate_class_template called pushdecl
3552 on the newdecl to perform name injection. But, pushdecl in
3553 turn called duplicate_decls when it discovered that another
3554 declaration of a global function with the same name already
3557 o Here, in duplicate_decls, we decided to clobber newdecl.
3559 If we're going to do that, we'd better make sure that
3560 olddecl, and not newdecl, is on the list of
3561 instantiations so that if we try to do the instantiation
3562 again we won't get the clobbered declaration. */
3564 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3565 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3567 for (; decls
; decls
= TREE_CHAIN (decls
))
3568 if (TREE_VALUE (decls
) == newdecl
)
3569 TREE_VALUE (decls
) = olddecl
;
3574 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3575 (char *) olddecl
+ sizeof (struct tree_common
),
3576 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3577 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3580 DECL_UID (olddecl
) = olddecl_uid
;
3582 DECL_FRIEND_P (olddecl
) = 1;
3584 /* NEWDECL contains the merged attribute lists.
3585 Update OLDDECL to be the same. */
3586 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3591 /* Record a decl-node X as belonging to the current lexical scope.
3592 Check for errors (such as an incompatible declaration for the same
3593 name already seen in the same scope).
3595 Returns either X or an old decl for the same name.
3596 If an old decl is returned, it may have been smashed
3597 to agree with what X says. */
3605 int need_new_binding
;
3607 /* We shouldn't be calling pushdecl when we're generating RTL for a
3608 function that we already did semantic analysis on previously. */
3609 my_friendly_assert (!cfun
|| doing_semantic_analysis_p (),
3612 name
= DECL_ASSEMBLER_NAME (x
);
3613 need_new_binding
= 1;
3615 if (DECL_TEMPLATE_PARM_P (x
))
3616 /* Template parameters have no context; they are not X::T even
3617 when declared within a class or namespace. */
3621 if (current_function_decl
&& x
!= current_function_decl
3622 /* A local declaration for a function doesn't constitute
3624 && !(TREE_CODE (x
) == FUNCTION_DECL
&& !DECL_INITIAL (x
))
3625 /* A local declaration for an `extern' variable is in the
3626 scoped of the current namespace, not the current
3628 && !(TREE_CODE (x
) == VAR_DECL
&& DECL_EXTERNAL (x
))
3629 && !DECL_CONTEXT (x
))
3630 DECL_CONTEXT (x
) = current_function_decl
;
3631 if (!DECL_CONTEXT (x
))
3632 DECL_CONTEXT (x
) = FROB_CONTEXT (current_namespace
);
3634 /* If this is the declaration for a namespace-scope function,
3635 but the declaration itself is in a local scope, mark the
3637 if (TREE_CODE (x
) == FUNCTION_DECL
3638 && DECL_NAMESPACE_SCOPE_P (x
)
3639 && current_function_decl
3640 && x
!= current_function_decl
)
3641 DECL_LOCAL_FUNCTION_P (x
) = 1;
3644 /* Type are looked up using the DECL_NAME, as that is what the rest of the
3645 compiler wants to use. */
3646 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
3647 || TREE_CODE (x
) == NAMESPACE_DECL
)
3648 name
= DECL_NAME (x
);
3653 /* Not needed...see below. */
3657 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3658 name
= TREE_OPERAND (name
, 0);
3660 /* Namespace-scoped variables are not found in the current level. */
3661 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
))
3662 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3664 t
= lookup_name_current_level (name
);
3665 if (t
== error_mark_node
)
3667 /* error_mark_node is 0 for a while during initialization! */
3669 cp_error_at ("`%#D' used prior to declaration", x
);
3672 else if (t
!= NULL_TREE
)
3675 /* This is turned off until I have time to do it right (bpk). */
3676 /* With the code below that uses it... */
3677 file
= DECL_SOURCE_FILE (t
);
3678 line
= DECL_SOURCE_LINE (t
);
3680 if (TREE_CODE (t
) == PARM_DECL
)
3682 if (DECL_CONTEXT (t
) == NULL_TREE
)
3683 fatal ("parse errors have confused me too much");
3685 /* Check for duplicate params. */
3686 if (duplicate_decls (x
, t
))
3689 else if (((TREE_CODE (x
) == FUNCTION_DECL
&& DECL_LANGUAGE (x
) == lang_c
)
3690 || DECL_FUNCTION_TEMPLATE_P (x
))
3691 && is_overloaded_fn (t
))
3692 /* Don't do anything just yet. */;
3693 else if (t
== wchar_decl_node
)
3695 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3696 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3698 /* Throw away the redeclaration. */
3701 else if (TREE_CODE (t
) != TREE_CODE (x
))
3703 if (duplicate_decls (x
, t
))
3706 else if (duplicate_decls (x
, t
))
3709 /* This is turned off until I have time to do it right (bpk). */
3711 /* Also warn if they did a prototype with `static' on it, but
3712 then later left the `static' off. */
3713 if (! TREE_PUBLIC (name
) && TREE_PUBLIC (x
))
3715 if (DECL_LANG_SPECIFIC (t
) && DECL_FRIEND_P (t
))
3720 cp_warning ("`static' missing from declaration of `%D'",
3722 warning_with_file_and_line (file
, line
,
3723 "previous declaration of `%s'",
3724 decl_as_string (t
, 0));
3727 /* Now fix things so it'll do what they expect. */
3728 if (current_function_decl
)
3729 TREE_PUBLIC (current_function_decl
) = 0;
3731 /* Due to interference in memory reclamation (X may be
3732 obstack-deallocated at this point), we must guard against
3733 one really special case. [jason: This should be handled
3734 by start_function] */
3735 if (current_function_decl
== x
)
3736 current_function_decl
= t
;
3738 if (TREE_CODE (t
) == TYPE_DECL
)
3739 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3740 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3741 check_default_args (t
);
3745 else if (DECL_MAIN_P (x
))
3747 /* A redeclaration of main, but not a duplicate of the
3752 This function shall not be overloaded. */
3753 cp_error_at ("invalid redeclaration of `%D'", t
);
3754 cp_error ("as `%D'", x
);
3755 /* We don't try to push this declaration since that
3761 check_template_shadow (x
);
3763 /* If this is a function conjured up by the backend, massage it
3764 so it looks friendly. */
3765 if (TREE_CODE (x
) == FUNCTION_DECL
3766 && ! DECL_LANG_SPECIFIC (x
))
3768 retrofit_lang_decl (x
);
3769 DECL_LANGUAGE (x
) = lang_c
;
3772 if (TREE_CODE (x
) == FUNCTION_DECL
&& ! DECL_FUNCTION_MEMBER_P (x
))
3774 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
3777 if (!namespace_bindings_p ())
3778 /* We do not need to create a binding for this name;
3779 push_overloaded_decl will have already done so if
3781 need_new_binding
= 0;
3783 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3785 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
3787 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
3791 /* If declaring a type as a typedef, copy the type (unless we're
3792 at line 0), and install this TYPE_DECL as the new type's typedef
3793 name. See the extensive comment in ../c-decl.c (pushdecl). */
3794 if (TREE_CODE (x
) == TYPE_DECL
)
3796 tree type
= TREE_TYPE (x
);
3797 if (DECL_SOURCE_LINE (x
) == 0)
3799 if (TYPE_NAME (type
) == 0)
3800 TYPE_NAME (type
) = x
;
3802 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
3803 /* We don't want to copy the type when all we're
3804 doing is making a TYPE_DECL for the purposes of
3806 && (!TYPE_NAME (type
)
3807 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
3809 DECL_ORIGINAL_TYPE (x
) = type
;
3810 type
= build_type_copy (type
);
3811 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
3812 TYPE_NAME (type
) = x
;
3813 TREE_TYPE (x
) = type
;
3816 if (type
!= error_mark_node
3818 && TYPE_IDENTIFIER (type
))
3819 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
3820 current_binding_level
);
3824 /* Multiple external decls of the same identifier ought to match.
3826 We get warnings about inline functions where they are defined.
3827 We get warnings about other functions from push_overloaded_decl.
3829 Avoid duplicate warnings where they are used. */
3830 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
3834 if (IDENTIFIER_NAMESPACE_VALUE (name
) != NULL_TREE
3835 && (DECL_EXTERNAL (IDENTIFIER_NAMESPACE_VALUE (name
))
3836 || TREE_PUBLIC (IDENTIFIER_NAMESPACE_VALUE (name
))))
3837 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
3842 /* If different sort of thing, we already gave an error. */
3843 && TREE_CODE (decl
) == TREE_CODE (x
)
3844 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
3846 cp_pedwarn ("type mismatch with previous external decl", x
);
3847 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
3851 /* This name is new in its binding level.
3852 Install the new declaration and return it. */
3853 if (namespace_bindings_p ())
3855 /* Install a global value. */
3857 /* If the first global decl has external linkage,
3858 warn if we later see static one. */
3859 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
3860 TREE_PUBLIC (name
) = 1;
3862 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
3864 /* For an ordinary function, we create a binding from
3865 the mangled name (i.e., NAME) to the DECL. But, for
3866 an `extern "C"' function, the mangled name and the
3867 ordinary name are the same so we need not do this. */
3868 && !(TREE_CODE (x
) == FUNCTION_DECL
&&
3869 DECL_LANGUAGE (x
) == lang_c
))
3871 if (TREE_CODE (x
) == FUNCTION_DECL
)
3873 ((IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
)
3874 || (IDENTIFIER_GLOBAL_VALUE (name
) == x
), 378);
3875 SET_IDENTIFIER_NAMESPACE_VALUE (name
, x
);
3878 /* Don't forget if the function was used via an implicit decl. */
3879 if (IDENTIFIER_IMPLICIT_DECL (name
)
3880 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
3883 /* Don't forget if its address was taken in that way. */
3884 if (IDENTIFIER_IMPLICIT_DECL (name
)
3885 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
3886 TREE_ADDRESSABLE (x
) = 1;
3888 /* Warn about mismatches against previous implicit decl. */
3889 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
3890 /* If this real decl matches the implicit, don't complain. */
3891 && ! (TREE_CODE (x
) == FUNCTION_DECL
3892 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
3894 ("`%D' was previously implicitly declared to return `int'", x
);
3896 /* If new decl is `static' and an `extern' was seen previously,
3898 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
3899 warn_extern_redeclared_static (x
, t
);
3903 /* Here to install a non-global value. */
3904 tree oldlocal
= IDENTIFIER_VALUE (name
);
3905 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
3907 if (need_new_binding
)
3909 push_local_binding (name
, x
, 0);
3910 /* Because push_local_binding will hook X on to the
3911 current_binding_level's name list, we don't want to
3912 do that again below. */
3913 need_new_binding
= 0;
3916 /* If this is a TYPE_DECL, push it into the type value slot. */
3917 if (TREE_CODE (x
) == TYPE_DECL
)
3918 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
3919 current_binding_level
);
3921 /* Clear out any TYPE_DECL shadowed by a namespace so that
3922 we won't think this is a type. The C struct hack doesn't
3923 go through namespaces. */
3924 if (TREE_CODE (x
) == NAMESPACE_DECL
)
3925 set_identifier_type_value_with_scope (name
, NULL_TREE
,
3926 current_binding_level
);
3932 && TREE_CODE (oldlocal
) == VAR_DECL
3933 && DECL_DEAD_FOR_LOCAL (oldlocal
))
3935 oldlocal
= DECL_SHADOWED_FOR_VAR (oldlocal
);
3937 if (oldlocal
== NULL_TREE
)
3938 oldlocal
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (d
));
3941 /* If this is an extern function declaration, see if we
3942 have a global definition or declaration for the function. */
3943 if (oldlocal
== NULL_TREE
3944 && DECL_EXTERNAL (x
)
3945 && oldglobal
!= NULL_TREE
3946 && TREE_CODE (x
) == FUNCTION_DECL
3947 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
3949 /* We have one. Their types must agree. */
3950 if (decls_match (x
, oldglobal
))
3954 cp_warning ("extern declaration of `%#D' doesn't match", x
);
3955 cp_warning_at ("global declaration `%#D'", oldglobal
);
3958 /* If we have a local external declaration,
3959 and no file-scope declaration has yet been seen,
3960 then if we later have a file-scope decl it must not be static. */
3961 if (oldlocal
== NULL_TREE
3962 && oldglobal
== NULL_TREE
3963 && DECL_EXTERNAL (x
)
3965 TREE_PUBLIC (name
) = 1;
3967 /* Warn if shadowing an argument at the top level of the body. */
3968 if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
3969 /* Inline decls shadow nothing. */
3970 && !DECL_FROM_INLINE (x
)
3971 && TREE_CODE (oldlocal
) == PARM_DECL
3972 /* Don't complain if it's from an enclosing function. */
3973 && DECL_CONTEXT (oldlocal
) == current_function_decl
3974 && TREE_CODE (x
) != PARM_DECL
)
3976 /* Go to where the parms should be and see if we
3978 struct binding_level
*b
= current_binding_level
->level_chain
;
3984 if (b
->parm_flag
== 1)
3985 cp_error ("declaration of `%#D' shadows a parameter", name
);
3988 /* Maybe warn if shadowing something else. */
3989 if (warn_shadow
&& !DECL_EXTERNAL (x
)
3990 /* Inline decls shadow nothing. */
3991 && !DECL_FROM_INLINE (x
)
3992 /* No shadow warnings for internally generated vars. */
3993 && ! DECL_ARTIFICIAL (x
)
3994 /* No shadow warnings for vars made for inlining. */
3995 && ! DECL_FROM_INLINE (x
))
3997 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
3998 warning ("declaration of `%s' shadows a parameter",
3999 IDENTIFIER_POINTER (name
));
4000 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
4001 && current_class_ptr
4002 && !TREE_STATIC (name
))
4003 warning ("declaration of `%s' shadows a member of `this'",
4004 IDENTIFIER_POINTER (name
));
4005 else if (oldlocal
!= NULL_TREE
)
4006 warning ("declaration of `%s' shadows previous local",
4007 IDENTIFIER_POINTER (name
));
4008 else if (oldglobal
!= NULL_TREE
)
4009 /* XXX shadow warnings in outer-more namespaces */
4010 warning ("declaration of `%s' shadows global declaration",
4011 IDENTIFIER_POINTER (name
));
4015 if (TREE_CODE (x
) == FUNCTION_DECL
)
4016 check_default_args (x
);
4018 /* Keep count of variables in this level with incomplete type. */
4019 if (TREE_CODE (x
) == VAR_DECL
4020 && TREE_TYPE (x
) != error_mark_node
4021 && ((TYPE_SIZE (TREE_TYPE (x
)) == NULL_TREE
4022 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
4023 /* RTTI TD entries are created while defining the type_info. */
4024 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
4025 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
4027 if (namespace_bindings_p ())
4028 namespace_scope_incomplete
4029 = tree_cons (NULL_TREE
, x
, namespace_scope_incomplete
);
4031 current_binding_level
->incomplete
4032 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4036 if (need_new_binding
)
4037 add_decl_to_level (x
,
4038 DECL_NAMESPACE_SCOPE_P (x
)
4039 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x
))
4040 : current_binding_level
);
4045 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4046 caller to set DECL_CONTEXT properly. */
4049 pushdecl_with_scope (x
, level
)
4051 struct binding_level
*level
;
4053 register struct binding_level
*b
;
4054 tree function_decl
= current_function_decl
;
4056 current_function_decl
= NULL_TREE
;
4057 if (level
->parm_flag
== 2)
4059 b
= class_binding_level
;
4060 class_binding_level
= level
;
4061 pushdecl_class_level (x
);
4062 class_binding_level
= b
;
4066 b
= current_binding_level
;
4067 current_binding_level
= level
;
4069 current_binding_level
= b
;
4071 current_function_decl
= function_decl
;
4075 /* Like pushdecl, only it places X in the current namespace,
4079 pushdecl_namespace_level (x
)
4082 register struct binding_level
*b
= current_binding_level
;
4085 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4087 /* Now, the type_shadowed stack may screw us. Munge it so it does
4089 if (TREE_CODE (x
) == TYPE_DECL
)
4091 tree name
= DECL_NAME (x
);
4093 tree
*ptr
= (tree
*)0;
4094 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4096 tree shadowed
= b
->type_shadowed
;
4097 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4098 if (TREE_PURPOSE (shadowed
) == name
)
4100 ptr
= &TREE_VALUE (shadowed
);
4101 /* Can't break out of the loop here because sometimes
4102 a binding level will have duplicate bindings for
4103 PT names. It's gross, but I haven't time to fix it. */
4106 newval
= TREE_TYPE (x
);
4107 if (ptr
== (tree
*)0)
4109 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4110 up here if this is changed to an assertion. --KR */
4111 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4121 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4125 pushdecl_top_level (x
)
4128 push_to_top_level ();
4129 x
= pushdecl_namespace_level (x
);
4130 pop_from_top_level ();
4134 /* Make the declaration of X appear in CLASS scope. */
4137 pushdecl_class_level (x
)
4140 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4141 scope looks for the pre-mangled name. */
4144 if (TREE_CODE (x
) == OVERLOAD
)
4145 x
= OVL_CURRENT (x
);
4146 name
= DECL_NAME (x
);
4150 push_class_level_binding (name
, x
);
4151 if (TREE_CODE (x
) == TYPE_DECL
)
4152 set_identifier_type_value (name
, TREE_TYPE (x
));
4154 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4158 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4161 pushdecl_class_level (f
);
4165 /* Enter DECL into the symbol table, if that's appropriate. Returns
4166 DECL, or a modified version thereof. */
4169 maybe_push_decl (decl
)
4172 tree type
= TREE_TYPE (decl
);
4174 /* Add this decl to the current binding level, but not if it comes
4175 from another scope, e.g. a static member variable. TEM may equal
4176 DECL or it may be a previous decl of the same name. */
4177 if (decl
== error_mark_node
4178 || (TREE_CODE (decl
) != PARM_DECL
4179 && DECL_CONTEXT (decl
) != NULL_TREE
4180 /* Definitions of namespace members outside their namespace are
4182 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4183 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4184 || TREE_CODE (type
) == UNKNOWN_TYPE
4185 /* The declaration of a template specialization does not affect
4186 the functions available for overload resolution, so we do not
4188 || (TREE_CODE (decl
) == FUNCTION_DECL
4189 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4192 return pushdecl (decl
);
4196 /* This function is used to push the mangled decls for nested types into
4197 the appropriate scope. Previously pushdecl_top_level was used, but that
4198 is incorrect for members of local classes. */
4201 pushdecl_nonclass_level (x
)
4204 struct binding_level
*b
= current_binding_level
;
4206 my_friendly_assert (b
->parm_flag
!= 2, 180);
4209 /* Get out of template binding levels */
4210 while (b
->pseudo_global
)
4214 pushdecl_with_scope (x
, b
);
4218 /* Make the declaration(s) of X appear in CLASS scope
4219 under the name NAME. */
4222 push_class_level_binding (name
, x
)
4227 /* The class_binding_level will be NULL if x is a template
4228 parameter name in a member template. */
4229 if (!class_binding_level
)
4232 /* Make sure that this new member does not have the same name
4233 as a template parameter. */
4234 if (TYPE_BEING_DEFINED (current_class_type
))
4235 check_template_shadow (x
);
4237 /* If this declaration shadows a declaration from an enclosing
4238 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4239 we leave this class. Record the shadowed declaration here. */
4240 binding
= IDENTIFIER_BINDING (name
);
4242 && ((TREE_CODE (x
) == OVERLOAD
4243 && BINDING_VALUE (binding
)
4244 && is_overloaded_fn (BINDING_VALUE (binding
)))
4245 || INHERITED_VALUE_BINDING_P (binding
)))
4250 /* If the old binding was from a base class, and was for a tag
4251 name, slide it over to make room for the new binding. The
4252 old binding is still visible if explicitly qualified with a
4254 if (INHERITED_VALUE_BINDING_P (binding
)
4255 && BINDING_VALUE (binding
)
4256 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4257 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4258 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4260 old_decl
= BINDING_TYPE (binding
);
4261 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4262 BINDING_VALUE (binding
) = NULL_TREE
;
4263 INHERITED_VALUE_BINDING_P (binding
) = 0;
4266 old_decl
= BINDING_VALUE (binding
);
4268 /* There was already a binding for X containing fewer
4269 functions than are named in X. Find the previous
4270 declaration of X on the class-shadowed list, and update it. */
4271 for (shadow
= class_binding_level
->class_shadowed
;
4273 shadow
= TREE_CHAIN (shadow
))
4274 if (TREE_PURPOSE (shadow
) == name
4275 && TREE_TYPE (shadow
) == old_decl
)
4277 BINDING_VALUE (binding
) = x
;
4278 INHERITED_VALUE_BINDING_P (binding
) = 0;
4279 TREE_TYPE (shadow
) = x
;
4284 /* If we didn't replace an existing binding, put the binding on the
4285 stack of bindings for the identifier, and update
4286 IDENTIFIER_CLASS_VALUE. */
4287 if (push_class_binding (name
, x
))
4289 class_binding_level
->class_shadowed
4290 = tree_cons (name
, IDENTIFIER_CLASS_VALUE (name
),
4291 class_binding_level
->class_shadowed
);
4292 /* Record the value we are binding NAME to so that we can know
4293 what to pop later. */
4294 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4298 /* Insert another USING_DECL into the current binding level,
4299 returning this declaration. If this is a redeclaration,
4300 do nothing and return NULL_TREE. */
4303 push_using_decl (scope
, name
)
4309 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4310 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4311 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4312 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4316 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4317 DECL_INITIAL (decl
) = scope
;
4318 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4319 current_binding_level
->usings
= decl
;
4323 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4324 changed (i.e. there was already a directive), or the fresh
4325 TREE_LIST otherwise. */
4328 push_using_directive (used
)
4331 tree ud
= current_binding_level
->using_directives
;
4332 tree iter
, ancestor
;
4334 /* Check if we already have this. */
4335 if (purpose_member (used
, ud
) != NULL_TREE
)
4338 /* Recursively add all namespaces used. */
4339 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4340 push_using_directive (TREE_PURPOSE (iter
));
4342 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4343 ud
= current_binding_level
->using_directives
;
4344 ud
= tree_cons (used
, ancestor
, ud
);
4345 current_binding_level
->using_directives
= ud
;
4349 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4350 other definitions already in place. We get around this by making
4351 the value of the identifier point to a list of all the things that
4352 want to be referenced by that name. It is then up to the users of
4353 that name to decide what to do with that list.
4355 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its DECL_RESULT
4356 slot. It is dealt with the same way.
4358 FLAGS is a bitwise-or of the following values:
4359 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4361 PUSH_USING: DECL is being pushed as the result of a using
4364 The value returned may be a previous declaration if we guessed wrong
4365 about what language DECL should belong to (C or C++). Otherwise,
4366 it's always DECL (and never something that's not a _DECL). */
4369 push_overloaded_decl (decl
, flags
)
4373 tree name
= DECL_NAME (decl
);
4376 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4379 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4381 old
= lookup_name_current_level (name
);
4385 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4387 tree t
= TREE_TYPE (old
);
4388 if (IS_AGGR_TYPE (t
) && warn_shadow
4389 && (! DECL_IN_SYSTEM_HEADER (decl
)
4390 || ! DECL_IN_SYSTEM_HEADER (old
)))
4391 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4394 else if (is_overloaded_fn (old
))
4398 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4400 tree fn
= OVL_CURRENT (tmp
);
4402 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4403 && !(flags
& PUSH_USING
)
4404 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4405 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4406 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4409 if (duplicate_decls (decl
, fn
))
4415 cp_error_at ("previous non-function declaration `%#D'", old
);
4416 cp_error ("conflicts with function declaration `%#D'", decl
);
4421 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4423 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4424 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4426 new_binding
= ovl_cons (decl
, old
);
4427 if (flags
& PUSH_USING
)
4428 OVL_USED (new_binding
) = 1;
4431 /* NAME is not ambiguous. */
4435 set_namespace_binding (name
, current_namespace
, new_binding
);
4438 /* We only create an OVERLOAD if there was a previous binding at
4439 this level, or if decl is a template. In the former case, we
4440 need to remove the old binding and replace it with the new
4441 binding. We must also run through the NAMES on the binding
4442 level where the name was bound to update the chain. */
4444 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4448 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4450 d
= &TREE_CHAIN (*d
))
4452 || (TREE_CODE (*d
) == TREE_LIST
4453 && TREE_VALUE (*d
) == old
))
4455 if (TREE_CODE (*d
) == TREE_LIST
)
4456 /* Just replace the old binding with the new. */
4457 TREE_VALUE (*d
) = new_binding
;
4459 /* Build a TREE_LIST to wrap the OVERLOAD. */
4460 *d
= tree_cons (NULL_TREE
, new_binding
,
4463 /* And update the CPLUS_BINDING node. */
4464 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4469 /* We should always find a previous binding in this case. */
4470 my_friendly_abort (0);
4473 /* Install the new binding. */
4474 push_local_binding (name
, new_binding
, flags
);
4480 /* Generate an implicit declaration for identifier FUNCTIONID
4481 as a function of type int (). Print a warning if appropriate. */
4484 implicitly_declare (functionid
)
4489 /* We used to reuse an old implicit decl here,
4490 but this loses with inline functions because it can clobber
4491 the saved decl chains. */
4492 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4494 DECL_EXTERNAL (decl
) = 1;
4495 TREE_PUBLIC (decl
) = 1;
4497 /* ISO standard says implicit declarations are in the innermost block.
4498 So we record the decl in the standard fashion. */
4500 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4503 /* Only one warning per identifier. */
4504 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4506 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4509 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4514 /* Return zero if the declaration NEWDECL is valid
4515 when the declaration OLDDECL (assumed to be for the same name)
4516 has already been seen.
4517 Otherwise return an error message format string with a %s
4518 where the identifier should go. */
4521 redeclaration_error_message (newdecl
, olddecl
)
4522 tree newdecl
, olddecl
;
4524 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4526 /* Because C++ can put things into name space for free,
4527 constructs like "typedef struct foo { ... } foo"
4528 would look like an erroneous redeclaration. */
4529 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4532 return "redefinition of `%#D'";
4534 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4536 /* If this is a pure function, its olddecl will actually be
4537 the original initialization to `0' (which we force to call
4538 abort()). Don't complain about redefinition in this case. */
4539 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_PURE_VIRTUAL_P (olddecl
))
4542 /* If both functions come from different namespaces, this is not
4543 a redeclaration - this is a conflict with a used function. */
4544 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4545 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4546 return "`%D' conflicts with used function";
4548 /* We'll complain about linkage mismatches in
4549 warn_extern_redeclared_static. */
4551 /* Defining the same name twice is no good. */
4552 if (DECL_INITIAL (olddecl
) != NULL_TREE
4553 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4555 if (DECL_NAME (olddecl
) == NULL_TREE
)
4556 return "`%#D' not declared in class";
4558 return "redefinition of `%#D'";
4562 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4564 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4565 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4566 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4567 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4568 && TYPE_SIZE (TREE_TYPE (newdecl
))
4569 && TYPE_SIZE (TREE_TYPE (olddecl
))))
4570 return "redefinition of `%#D'";
4573 else if (toplevel_bindings_p () || DECL_NAMESPACE_SCOPE_P (newdecl
))
4575 /* Objects declared at top level: */
4576 /* If at least one is a reference, it's ok. */
4577 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4579 /* Reject two definitions. */
4580 return "redefinition of `%#D'";
4584 /* Objects declared with block scope: */
4585 /* Reject two definitions, and reject a definition
4586 together with an external reference. */
4587 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4588 return "redeclaration of `%#D'";
4593 /* Create a new label, named ID. */
4596 make_label_decl (id
, local_p
)
4602 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4604 /* Make sure every label has an rtx. */
4607 DECL_CONTEXT (decl
) = current_function_decl
;
4608 DECL_MODE (decl
) = VOIDmode
;
4609 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
4611 /* Say where one reference is to the label, for the sake of the
4612 error if it is not defined. */
4613 DECL_SOURCE_LINE (decl
) = lineno
;
4614 DECL_SOURCE_FILE (decl
) = input_filename
;
4616 /* Record the fact that this identifier is bound to this label. */
4617 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4619 /* Record this label on the list of used labels so that we can check
4620 at the end of the function to see whether or not the label was
4621 actually defined. */
4622 if ((named_label_uses
== NULL
|| named_label_uses
->label_decl
!= decl
)
4623 && (named_label_uses
== NULL
4624 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4625 || named_label_uses
->label_decl
!= decl
))
4627 struct named_label_list
*new_ent
;
4629 = (struct named_label_list
*)oballoc (sizeof (struct named_label_list
));
4630 new_ent
->label_decl
= decl
;
4631 new_ent
->names_in_scope
= current_binding_level
->names
;
4632 new_ent
->binding_level
= current_binding_level
;
4633 new_ent
->lineno_o_goto
= lineno
;
4634 new_ent
->filename_o_goto
= input_filename
;
4635 new_ent
->next
= named_label_uses
;
4636 named_label_uses
= new_ent
;
4642 /* Look for a label named ID in the current function. If one cannot
4643 be found, create one. (We keep track of used, but undefined,
4644 labels, and complain about them at the end of a function.) */
4652 /* You can't use labels at global scope. */
4653 if (current_function_decl
== NULL_TREE
)
4655 error ("label `%s' referenced outside of any function",
4656 IDENTIFIER_POINTER (id
));
4660 /* See if we've already got this label. */
4661 decl
= IDENTIFIER_LABEL_VALUE (id
);
4662 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
4665 /* Record this label on the list of labels used in this function.
4666 We do this before calling make_label_decl so that we get the
4667 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4668 named_labels
= tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4670 /* We need a new label. */
4671 decl
= make_label_decl (id
, /*local_p=*/0);
4672 /* Now fill in the information we didn't have before. */
4673 TREE_VALUE (named_labels
) = decl
;
4678 /* Declare a local label named ID. */
4681 declare_local_label (id
)
4686 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4687 this scope we can restore the old value of
4688 IDENTIFIER_TYPE_VALUE. */
4689 current_binding_level
->shadowed_labels
4690 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4691 current_binding_level
->shadowed_labels
);
4692 /* Look for the label. */
4693 decl
= make_label_decl (id
, /*local_p=*/1);
4694 /* Now fill in the information we didn't have before. */
4695 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
4700 /* Define a label, specifying the location in the source file.
4701 Return the LABEL_DECL node for the label, if the definition is valid.
4702 Otherwise return 0. */
4705 define_label (filename
, line
, name
)
4710 tree decl
= lookup_label (name
);
4712 /* After labels, make any new cleanups go into their
4713 own new (temporary) binding contour. */
4714 current_binding_level
->more_cleanups_ok
= 0;
4716 if (name
== get_identifier ("wchar_t"))
4717 cp_pedwarn ("label named wchar_t");
4719 if (DECL_INITIAL (decl
) != NULL_TREE
)
4721 cp_error ("duplicate label `%D'", decl
);
4726 struct named_label_list
*uses
, *prev
;
4730 /* Mark label as having been defined. */
4731 DECL_INITIAL (decl
) = error_mark_node
;
4732 /* Say where in the source. */
4733 DECL_SOURCE_FILE (decl
) = filename
;
4734 DECL_SOURCE_LINE (decl
) = line
;
4737 uses
= named_label_uses
;
4738 while (uses
!= NULL
)
4739 if (uses
->label_decl
== decl
)
4741 struct binding_level
*b
= current_binding_level
;
4744 tree new_decls
= b
->names
;
4745 tree old_decls
= (b
== uses
->binding_level
)
4746 ? uses
->names_in_scope
: NULL_TREE
;
4747 while (new_decls
!= old_decls
)
4749 if (TREE_CODE (new_decls
) == VAR_DECL
4750 /* Don't complain about crossing initialization
4751 of internal entities. They can't be accessed,
4752 and they should be cleaned up
4753 by the time we get to the label. */
4754 && ! DECL_ARTIFICIAL (new_decls
)
4755 && !(DECL_INITIAL (new_decls
) == NULL_TREE
4756 && pod_type_p (TREE_TYPE (new_decls
))))
4758 /* This is really only important if we're crossing
4759 an initialization. The POD stuff is just
4760 pedantry; why should it matter if the class
4761 contains a field of pointer to member type? */
4762 int problem
= (DECL_INITIAL (new_decls
)
4763 || (TYPE_NEEDS_CONSTRUCTING
4764 (TREE_TYPE (new_decls
))));
4770 cp_error ("jump to label `%D'", decl
);
4771 error_with_file_and_line
4772 (uses
->filename_o_goto
,
4773 uses
->lineno_o_goto
, " from here");
4777 cp_pedwarn ("jump to label `%D'", decl
);
4778 pedwarn_with_file_and_line
4779 (uses
->filename_o_goto
,
4780 uses
->lineno_o_goto
, " from here");
4786 cp_error_at (" crosses initialization of `%#D'",
4789 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4792 new_decls
= TREE_CHAIN (new_decls
);
4794 if (b
== uses
->binding_level
)
4796 if (b
->eh_region
&& ! saw_eh
)
4800 cp_error ("jump to label `%D'", decl
);
4801 error_with_file_and_line
4802 (uses
->filename_o_goto
,
4803 uses
->lineno_o_goto
, " from here");
4806 error (" enters exception handling block");
4813 prev
->next
= uses
->next
;
4815 named_label_uses
= uses
->next
;
4824 current_function_return_value
= NULL_TREE
;
4831 struct binding_level
*level
;
4832 struct cp_switch
*next
;
4835 static struct cp_switch
*switch_stack
;
4841 = (struct cp_switch
*) oballoc (sizeof (struct cp_switch
));
4842 p
->level
= current_binding_level
;
4843 p
->next
= switch_stack
;
4850 switch_stack
= switch_stack
->next
;
4853 /* Note that we've seen a definition of a case label, and complain if this
4854 is a bad place for one. */
4857 define_case_label ()
4859 tree cleanup
= last_cleanup_this_contour ();
4860 struct binding_level
*b
= current_binding_level
;
4864 /* Don't crash; we'll complain in do_case. */
4869 static int explained
= 0;
4870 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup
));
4871 warning ("where case label appears here");
4874 warning ("(enclose actions of previous case statements requiring");
4875 warning ("destructors in their own binding contours.)");
4880 for (; b
&& b
!= switch_stack
->level
; b
= b
->level_chain
)
4882 tree new_decls
= b
->names
;
4883 for (; new_decls
; new_decls
= TREE_CHAIN (new_decls
))
4885 if (TREE_CODE (new_decls
) == VAR_DECL
4886 /* Don't complain about crossing initialization
4887 of internal entities. They can't be accessed,
4888 and they should be cleaned up
4889 by the time we get to the label. */
4890 && ! DECL_ARTIFICIAL (new_decls
)
4891 && ((DECL_INITIAL (new_decls
) != NULL_TREE
4892 && DECL_INITIAL (new_decls
) != error_mark_node
)
4893 || TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (new_decls
))))
4896 error ("jump to case label");
4898 cp_error_at (" crosses initialization of `%#D'",
4904 /* After labels, make any new cleanups go into their
4905 own new (temporary) binding contour. */
4907 current_binding_level
->more_cleanups_ok
= 0;
4908 current_function_return_value
= NULL_TREE
;
4911 /* Return the list of declarations of the current level.
4912 Note that this list is in reverse order unless/until
4913 you nreverse it; and when you do nreverse it, you must
4914 store the result back using `storedecls' or you will lose. */
4919 return current_binding_level
->names
;
4922 /* Return the list of type-tags (for structs, etc) of the current level. */
4927 return current_binding_level
->tags
;
4930 /* Store the list of declarations of the current level.
4931 This is done for the parameter declarations of a function being defined,
4932 after they are modified in the light of any missing parameters. */
4938 current_binding_level
->names
= decls
;
4941 /* Similarly, store the list of tags of the current level. */
4947 current_binding_level
->tags
= tags
;
4950 /* Given NAME, an IDENTIFIER_NODE,
4951 return the structure (or union or enum) definition for that name.
4952 Searches binding levels from BINDING_LEVEL up to the global level.
4953 If THISLEVEL_ONLY is nonzero, searches only the specified context
4954 (but skips any tag-transparent contexts to find one that is
4955 meaningful for tags).
4956 FORM says which kind of type the caller wants;
4957 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
4958 If the wrong kind of type is found, and it's not a template, an error is
4962 lookup_tag (form
, name
, binding_level
, thislevel_only
)
4963 enum tree_code form
;
4965 struct binding_level
*binding_level
;
4968 register struct binding_level
*level
;
4969 /* Non-zero if, we should look past a pseudo-global level, even if
4971 int allow_pseudo_global
= 1;
4973 for (level
= binding_level
; level
; level
= level
->level_chain
)
4976 if (ANON_AGGRNAME_P (name
))
4977 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
4979 /* There's no need for error checking here, because
4980 anon names are unique throughout the compilation. */
4981 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
4982 return TREE_VALUE (tail
);
4984 else if (level
->namespace_p
)
4985 /* Do namespace lookup. */
4986 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
4988 tree old
= binding_for_name (name
, tail
);
4990 /* If we just skipped past a pseudo global level, even
4991 though THISLEVEL_ONLY, and we find a template class
4992 declaration, then we use the _TYPE node for the
4993 template. See the example below. */
4994 if (thislevel_only
&& !allow_pseudo_global
4995 && old
&& BINDING_VALUE (old
)
4996 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
4997 old
= TREE_TYPE (BINDING_VALUE (old
));
4999 old
= BINDING_TYPE (old
);
5001 /* If it has an original type, it is a typedef, and we
5002 should not return it. */
5003 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
5005 if (old
&& TREE_CODE (old
) != form
5006 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
5008 cp_error ("`%#D' redeclared as %C", old
, form
);
5013 if (thislevel_only
|| tail
== global_namespace
)
5017 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5019 if (TREE_PURPOSE (tail
) == name
)
5021 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
5022 /* Should tighten this up; it'll probably permit
5023 UNION_TYPE and a struct template, for example. */
5025 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
5027 /* Definition isn't the kind we were looking for. */
5028 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
5032 return TREE_VALUE (tail
);
5035 if (thislevel_only
&& ! level
->tag_transparent
)
5037 if (level
->pseudo_global
&& allow_pseudo_global
)
5039 /* We must deal with cases like this:
5041 template <class T> struct S;
5042 template <class T> struct S {};
5044 When looking up `S', for the second declaration, we
5045 would like to find the first declaration. But, we
5046 are in the pseudo-global level created for the
5047 template parameters, rather than the (surrounding)
5048 namespace level. Thus, we keep going one more level,
5049 even though THISLEVEL_ONLY is non-zero. */
5050 allow_pseudo_global
= 0;
5062 set_current_level_tags_transparency (tags_transparent
)
5063 int tags_transparent
;
5065 current_binding_level
->tag_transparent
= tags_transparent
;
5069 /* Given a type, find the tag that was defined for it and return the tag name.
5070 Otherwise return 0. However, the value can never be 0
5071 in the cases in which this is used.
5073 C++: If NAME is non-zero, this is the new name to install. This is
5074 done when replacing anonymous tags with real tag names. */
5077 lookup_tag_reverse (type
, name
)
5081 register struct binding_level
*level
;
5083 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5086 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5088 if (TREE_VALUE (tail
) == type
)
5091 TREE_PURPOSE (tail
) = name
;
5092 return TREE_PURPOSE (tail
);
5099 /* Look up NAME in the NAMESPACE. */
5102 lookup_namespace_name (namespace, name
)
5103 tree
namespace, name
;
5106 tree template_id
= NULL_TREE
;
5108 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5110 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5111 /* This happens for A::B<int> when B is a namespace. */
5113 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5115 /* This happens for A::B where B is a template, and there are no
5116 template arguments. */
5117 cp_error ("invalid use of `%D'", name
);
5118 return error_mark_node
;
5121 namespace = ORIGINAL_NAMESPACE (namespace);
5123 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5126 name
= TREE_OPERAND (name
, 0);
5127 if (TREE_CODE (name
) == OVERLOAD
)
5128 name
= DECL_NAME (OVL_CURRENT (name
));
5129 else if (TREE_CODE_CLASS (TREE_CODE (name
)) == 'd')
5130 name
= DECL_NAME (name
);
5133 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5135 val
= make_node (CPLUS_BINDING
);
5136 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5137 return error_mark_node
;
5139 if (BINDING_VALUE (val
))
5141 val
= BINDING_VALUE (val
);
5145 if (DECL_CLASS_TEMPLATE_P (val
))
5146 val
= lookup_template_class (val
,
5147 TREE_OPERAND (template_id
, 1),
5148 /*in_decl=*/NULL_TREE
,
5149 /*context=*/NULL_TREE
,
5150 /*entering_scope=*/0);
5151 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5152 || TREE_CODE (val
) == OVERLOAD
)
5153 val
= lookup_template_function (val
,
5154 TREE_OPERAND (template_id
, 1));
5157 cp_error ("`%D::%D' is not a template",
5159 return error_mark_node
;
5163 /* If we have a single function from a using decl, pull it out. */
5164 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5165 val
= OVL_FUNCTION (val
);
5169 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5170 return error_mark_node
;
5173 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5175 static unsigned long
5183 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5184 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5189 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5192 typename_compare (k1
, k2
)
5203 d1
= TYPE_NAME (t1
);
5204 d2
= TYPE_NAME (t2
);
5206 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5207 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5208 && ((TREE_TYPE (t1
) != NULL_TREE
)
5209 == (TREE_TYPE (t2
) != NULL_TREE
))
5210 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5211 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5214 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5215 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5216 is non-NULL, this type is being created by the implicit typename
5217 extension, and BASE_TYPE is a type named `t' in some base class of
5218 `T' which depends on template parameters.
5220 Returns the new TYPENAME_TYPE. */
5223 build_typename_type (context
, name
, fullname
, base_type
)
5231 struct hash_entry
* e
;
5233 static struct hash_table ht
;
5237 static struct hash_table
*h
= &ht
;
5238 if (!hash_table_init (&ht
, &hash_newfunc
, &typename_hash
,
5240 fatal ("virtual memory exhausted");
5241 ggc_add_tree_hash_table_root (&h
, 1);
5244 /* Build the TYPENAME_TYPE. */
5245 t
= make_aggr_type (TYPENAME_TYPE
);
5246 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5247 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5248 TREE_TYPE (t
) = base_type
;
5250 /* Build the corresponding TYPE_DECL. */
5251 d
= build_decl (TYPE_DECL
, name
, t
);
5252 TYPE_NAME (TREE_TYPE (d
)) = d
;
5253 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5254 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5255 DECL_ARTIFICIAL (d
) = 1;
5257 /* See if we already have this type. */
5258 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5262 /* Insert the type into the table. */
5263 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5268 /* Resolve `typename CONTEXT::NAME'. Returns an appropriate type,
5269 unless an error occurs, in which case error_mark_node is returned.
5270 If COMPLAIN zero, don't complain about any errors that occur. */
5273 make_typename_type (context
, name
, complain
)
5279 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
5281 if (!(TYPE_LANG_SPECIFIC (name
)
5282 && (CLASSTYPE_IS_TEMPLATE (name
)
5283 || CLASSTYPE_USE_TEMPLATE (name
))))
5284 name
= TYPE_IDENTIFIER (name
);
5286 /* Create a TEMPLATE_ID_EXPR for the type. */
5287 name
= build_nt (TEMPLATE_ID_EXPR
,
5288 CLASSTYPE_TI_TEMPLATE (name
),
5289 CLASSTYPE_TI_ARGS (name
));
5291 else if (TREE_CODE (name
) == TYPE_DECL
)
5292 name
= DECL_NAME (name
);
5296 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5298 name
= TREE_OPERAND (name
, 0);
5299 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5300 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5302 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5303 my_friendly_abort (2000);
5305 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5307 /* We can get here from typename_sub0 in the explicit_template_type
5308 expansion. Just fail. */
5310 cp_error ("no class template named `%#T' in `%#T'",
5312 return error_mark_node
;
5315 if (! uses_template_parms (context
)
5316 || currently_open_class (context
))
5318 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5320 tree tmpl
= NULL_TREE
;
5321 if (IS_AGGR_TYPE (context
))
5322 tmpl
= lookup_field (context
, name
, 0, 0);
5323 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5326 cp_error ("no class template named `%#T' in `%#T'",
5328 return error_mark_node
;
5331 return lookup_template_class (tmpl
,
5332 TREE_OPERAND (fullname
, 1),
5334 /*entering_scope=*/0);
5340 if (!IS_AGGR_TYPE (context
))
5343 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5344 return error_mark_node
;
5347 t
= lookup_field (context
, name
, 0, 1);
5349 return TREE_TYPE (t
);
5353 /* If the CONTEXT is not a template type, then either the field is
5354 there now or its never going to be. */
5355 if (!uses_template_parms (context
))
5358 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5359 return error_mark_node
;
5363 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5366 /* Select the right _DECL from multiple choices. */
5369 select_decl (binding
, flags
)
5374 val
= BINDING_VALUE (binding
);
5375 if (LOOKUP_NAMESPACES_ONLY (flags
))
5377 /* We are not interested in types. */
5378 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5383 /* If we could have a type and
5384 we have nothing or we need a type and have none. */
5385 if (BINDING_TYPE (binding
)
5386 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5387 && TREE_CODE (val
) != TYPE_DECL
)))
5388 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5389 /* Don't return non-types if we really prefer types. */
5390 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5391 && (TREE_CODE (val
) != TEMPLATE_DECL
5392 || !DECL_CLASS_TEMPLATE_P (val
)))
5398 /* Unscoped lookup of a global: iterate over current namespaces,
5399 considering using-directives. If SPACESP is non-NULL, store a list
5400 of the namespaces we've considered in it. */
5403 unqualified_namespace_lookup (name
, flags
, spacesp
)
5408 tree b
= make_node (CPLUS_BINDING
);
5409 tree initial
= current_decl_namespace();
5410 tree scope
= initial
;
5412 struct binding_level
*level
;
5413 tree val
= NULL_TREE
;
5416 *spacesp
= NULL_TREE
;
5418 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5421 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5422 val
= binding_for_name (name
, scope
);
5424 /* Initialize binding for this context. */
5425 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5426 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5428 /* Add all _DECLs seen through local using-directives. */
5429 for (level
= current_binding_level
;
5430 !level
->namespace_p
;
5431 level
= level
->level_chain
)
5432 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5433 scope
, flags
, spacesp
))
5434 /* Give up because of error. */
5435 return error_mark_node
;
5437 /* Add all _DECLs seen through global using-directives. */
5438 /* XXX local and global using lists should work equally. */
5442 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5443 scope
, flags
, spacesp
))
5444 /* Give up because of error. */
5445 return error_mark_node
;
5446 if (siter
== scope
) break;
5447 siter
= CP_DECL_CONTEXT (siter
);
5450 val
= select_decl (b
, flags
);
5451 if (scope
== global_namespace
)
5457 /* Combine prefer_type and namespaces_only into flags. */
5460 lookup_flags (prefer_type
, namespaces_only
)
5461 int prefer_type
, namespaces_only
;
5463 if (namespaces_only
)
5464 return LOOKUP_PREFER_NAMESPACES
;
5465 if (prefer_type
> 1)
5466 return LOOKUP_PREFER_TYPES
;
5467 if (prefer_type
> 0)
5468 return LOOKUP_PREFER_BOTH
;
5472 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5473 ignore it or not. Subroutine of lookup_name_real. */
5476 qualify_lookup (val
, flags
)
5480 if (val
== NULL_TREE
)
5482 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5484 if ((flags
& LOOKUP_PREFER_TYPES
)
5485 && (TREE_CODE (val
) == TYPE_DECL
5486 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5487 && DECL_CLASS_TEMPLATE_P (val
))))
5489 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5494 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5498 warn_about_implicit_typename_lookup (typename
, binding
)
5502 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5503 tree name
= DECL_NAME (typename
);
5505 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5506 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5507 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5508 && ! (TREE_CODE (binding
) == TYPE_DECL
5509 && same_type_p (TREE_TYPE (binding
), subtype
)))
5511 cp_warning ("lookup of `%D' finds `%#D'",
5513 cp_warning (" instead of `%D' from dependent base class",
5515 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5516 constructor_name (current_class_type
), name
);
5520 /* Look up NAME in the current binding level and its superiors in the
5521 namespace of variables, functions and typedefs. Return a ..._DECL
5522 node of some kind representing its definition if there is only one
5523 such declaration, or return a TREE_LIST with all the overloaded
5524 definitions if there are many, or return 0 if it is undefined.
5526 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5527 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5528 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5529 Otherwise we prefer non-TYPE_DECLs.
5531 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5532 using IDENTIFIER_CLASS_VALUE. */
5535 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5537 int prefer_type
, nonclass
, namespaces_only
;
5540 tree val
= NULL_TREE
;
5542 tree from_obj
= NULL_TREE
;
5544 int val_is_implicit_typename
= 0;
5546 /* Hack: copy flag set by parser, if set. */
5547 if (only_namespace_names
)
5548 namespaces_only
= 1;
5550 if (prefer_type
== -2)
5552 extern int looking_for_typename
;
5553 tree type
= NULL_TREE
;
5556 prefer_type
= looking_for_typename
;
5558 flags
= lookup_flags (prefer_type
, namespaces_only
);
5559 /* If the next thing is '<', class templates are types. */
5560 if (looking_for_template
)
5561 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5563 /* std:: becomes :: for now. */
5564 if (got_scope
== std_node
)
5565 got_scope
= void_type_node
;
5569 else if (got_object
!= error_mark_node
)
5574 if (type
== error_mark_node
)
5575 return error_mark_node
;
5576 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5577 type
= TREE_TYPE (type
);
5580 type
= complete_type (type
);
5582 if (TREE_CODE (type
) == VOID_TYPE
)
5583 type
= global_namespace
;
5584 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5586 val
= make_node (CPLUS_BINDING
);
5587 flags
|= LOOKUP_COMPLAIN
;
5588 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5590 val
= select_decl (val
, flags
);
5592 else if (! IS_AGGR_TYPE (type
)
5593 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5594 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5595 || TREE_CODE (type
) == TYPENAME_TYPE
)
5596 /* Someone else will give an error about this if needed. */
5598 else if (type
== current_class_type
)
5599 val
= IDENTIFIER_CLASS_VALUE (name
);
5602 val
= lookup_member (type
, name
, 0, prefer_type
);
5603 type_access_control (type
, val
);
5611 else if (got_object
&& val
)
5616 flags
= lookup_flags (prefer_type
, namespaces_only
);
5617 /* If we're not parsing, we need to complain. */
5618 flags
|= LOOKUP_COMPLAIN
;
5621 /* First, look in non-namespace scopes. */
5623 if (current_class_type
== NULL_TREE
)
5626 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5630 if (!LOCAL_BINDING_P (t
) && nonclass
)
5631 /* We're not looking for class-scoped bindings, so keep going. */
5634 /* If this is the kind of thing we're looking for, we're done. */
5635 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5636 binding
= BINDING_VALUE (t
);
5637 else if ((flags
& LOOKUP_PREFER_TYPES
)
5638 && qualify_lookup (BINDING_TYPE (t
), flags
))
5639 binding
= BINDING_TYPE (t
);
5641 binding
= NULL_TREE
;
5643 /* Handle access control on types from enclosing or base classes. */
5644 if (binding
&& ! yylex
5645 && BINDING_LEVEL (t
) && BINDING_LEVEL (t
)->parm_flag
== 2)
5646 type_access_control (BINDING_LEVEL (t
)->this_class
, binding
);
5649 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5651 if (val_is_implicit_typename
&& !yylex
)
5652 warn_about_implicit_typename_lookup (val
, binding
);
5654 val_is_implicit_typename
5655 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5656 if (!val_is_implicit_typename
)
5661 /* Now lookup in namespace scopes. */
5662 if (!val
|| val_is_implicit_typename
)
5664 t
= unqualified_namespace_lookup (name
, flags
, 0);
5667 if (val_is_implicit_typename
&& !yylex
)
5668 warn_about_implicit_typename_lookup (val
, t
);
5676 /* This should only warn about types used in qualified-ids. */
5677 if (from_obj
&& from_obj
!= val
)
5679 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5680 && TREE_CODE (val
) == TYPE_DECL
5681 && TREE_TYPE (from_obj
) != TREE_TYPE (val
))
5683 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5684 name
, got_object
, TREE_TYPE (from_obj
));
5685 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
5689 /* We don't change val to from_obj if got_object depends on
5690 template parms because that breaks implicit typename for
5691 destructor calls. */
5692 if (! uses_template_parms (got_object
))
5696 /* If we have a single function from a using decl, pull it out. */
5697 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5698 val
= OVL_FUNCTION (val
);
5707 lookup_name_nonclass (name
)
5710 return lookup_name_real (name
, 0, 1, 0);
5714 lookup_function_nonclass (name
, args
)
5718 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
5722 lookup_name_namespace_only (name
)
5725 /* type-or-namespace, nonclass, namespace_only */
5726 return lookup_name_real (name
, 1, 1, 1);
5730 lookup_name (name
, prefer_type
)
5734 return lookup_name_real (name
, prefer_type
, 0, 0);
5737 /* Similar to `lookup_name' but look only in the innermost non-class
5741 lookup_name_current_level (name
)
5744 struct binding_level
*b
;
5747 b
= current_binding_level
;
5748 while (b
->parm_flag
== 2)
5753 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
5755 /* extern "C" function() */
5756 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
5759 else if (IDENTIFIER_BINDING (name
)
5760 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
5764 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
5765 return IDENTIFIER_VALUE (name
);
5777 /* Like lookup_name_current_level, but for types. */
5780 lookup_type_current_level (name
)
5783 register tree t
= NULL_TREE
;
5785 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
5787 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
5788 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
5790 struct binding_level
*b
= current_binding_level
;
5793 if (purpose_member (name
, b
->type_shadowed
))
5794 return REAL_IDENTIFIER_TYPE_VALUE (name
);
5806 begin_only_namespace_names ()
5808 only_namespace_names
= 1;
5812 end_only_namespace_names ()
5814 only_namespace_names
= 0;
5817 /* Arrange for the user to get a source line number, even when the
5818 compiler is going down in flames, so that she at least has a
5819 chance of working around problems in the compiler. We used to
5820 call error(), but that let the segmentation fault continue
5821 through; now, it's much more passive by asking them to send the
5822 maintainers mail about the problem. */
5826 int sig ATTRIBUTE_UNUSED
;
5828 signal (SIGSEGV
, SIG_DFL
);
5830 signal (SIGIOT
, SIG_DFL
);
5833 signal (SIGILL
, SIG_DFL
);
5836 signal (SIGABRT
, SIG_DFL
);
5839 signal (SIGBUS
, SIG_DFL
);
5841 my_friendly_abort (0);
5844 /* Push the declarations of builtin types into the namespace.
5845 RID_INDEX, if < RID_MAX is the index of the builtin type
5846 in the array RID_POINTERS. NAME is the name used when looking
5847 up the builtin type. TYPE is the _TYPE node for the builtin type. */
5850 record_builtin_type (rid_index
, name
, type
)
5855 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
5856 tree tdecl
= NULL_TREE
;
5858 if ((int) rid_index
< (int) RID_MAX
)
5859 rname
= ridpointers
[(int) rid_index
];
5861 tname
= get_identifier (name
);
5863 TYPE_BUILT_IN (type
) = 1;
5867 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
5868 set_identifier_type_value (tname
, NULL_TREE
);
5869 if ((int) rid_index
< (int) RID_MAX
)
5870 /* Built-in types live in the global namespace. */
5871 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
5873 if (rname
!= NULL_TREE
)
5875 if (tname
!= NULL_TREE
)
5877 set_identifier_type_value (rname
, NULL_TREE
);
5878 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
5882 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
5883 set_identifier_type_value (rname
, NULL_TREE
);
5888 /* Record one of the standard Java types.
5889 * Declare it as having the given NAME.
5890 * If SIZE > 0, it is the size of one of the integral types;
5891 * otherwise it is the negative of the size of one of the other types. */
5894 record_builtin_java_type (name
, size
)
5900 type
= make_signed_type (size
);
5901 else if (size
> -32)
5902 { /* "__java_char" or ""__java_boolean". */
5903 type
= make_unsigned_type (-size
);
5904 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
5907 { /* "__java_float" or ""__java_double". */
5908 type
= make_node (REAL_TYPE
);
5909 TYPE_PRECISION (type
) = - size
;
5912 record_builtin_type (RID_MAX
, name
, type
);
5913 decl
= TYPE_NAME (type
);
5915 /* Suppress generate debug symbol entries for these types,
5916 since for normal C++ they are just clutter.
5917 However, push_lang_context undoes this if extern "Java" is seen. */
5918 DECL_IGNORED_P (decl
) = 1;
5920 TYPE_FOR_JAVA (type
) = 1;
5924 /* Push a type into the namespace so that the back-ends ignore it. */
5927 record_unknown_type (type
, name
)
5931 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
5932 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
5933 DECL_IGNORED_P (decl
) = 1;
5934 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
5935 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
5936 TYPE_ALIGN (type
) = 1;
5937 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
5940 /* Create the predefined scalar types of C,
5941 and some nodes representing standard constants (0, 1, (void *)0).
5942 Initialize the global binding level.
5943 Make definitions for built-in primitive functions. */
5946 init_decl_processing ()
5949 int wchar_type_size
;
5950 tree array_domain_type
;
5952 /* Check to see that the user did not specify an invalid combination
5953 of command-line options. */
5954 if (flag_new_abi
&& !flag_vtable_thunks
)
5955 fatal ("the new ABI requires vtable thunks");
5957 /* Have to make these distinct before we try using them. */
5958 lang_name_cplusplus
= get_identifier ("C++");
5959 lang_name_c
= get_identifier ("C");
5960 lang_name_java
= get_identifier ("Java");
5962 /* Let the back-end now how to save and restore language-specific
5963 per-function globals. */
5964 init_lang_status
= &push_cp_function_context
;
5965 free_lang_status
= &pop_cp_function_context
;
5966 mark_lang_status
= &mark_cp_function_context
;
5972 /* Create the global variables. */
5973 push_to_top_level ();
5975 /* Enter the global namespace. */
5976 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
5977 push_namespace (get_identifier ("::"));
5978 global_namespace
= current_namespace
;
5979 current_lang_name
= NULL_TREE
;
5981 /* Adjust various flags based on command-line settings. */
5982 if (flag_strict_prototype
== 2)
5983 flag_strict_prototype
= pedantic
;
5984 if (! flag_permissive
&& ! pedantic
)
5985 flag_pedantic_errors
= 1;
5986 if (!flag_no_inline
)
5987 flag_inline_trees
= 1;
5989 strict_prototypes_lang_c
= flag_strict_prototype
;
5992 current_lang_name
= lang_name_c
;
5994 current_function_decl
= NULL_TREE
;
5995 current_binding_level
= NULL_BINDING_LEVEL
;
5996 free_binding_level
= NULL_BINDING_LEVEL
;
5998 /* Because most segmentation signals can be traced back into user
5999 code, catch them and at least give the user a chance of working
6000 around compiler bugs. */
6001 signal (SIGSEGV
, signal_catch
);
6003 /* We will also catch aborts in the back-end through signal_catch and
6004 give the user a chance to see where the error might be, and to defeat
6005 aborts in the back-end when there have been errors previously in their
6008 signal (SIGIOT
, signal_catch
);
6011 signal (SIGILL
, signal_catch
);
6014 signal (SIGABRT
, signal_catch
);
6017 signal (SIGBUS
, signal_catch
);
6020 build_common_tree_nodes (flag_signed_char
);
6022 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6023 TREE_TYPE (error_mark_list
) = error_mark_node
;
6025 /* Make the binding_level structure for global names. */
6027 global_binding_level
= current_binding_level
;
6028 /* The global level is the namespace level of ::. */
6029 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6030 declare_namespace_level ();
6032 this_identifier
= get_identifier (THIS_NAME
);
6033 in_charge_identifier
= get_identifier (IN_CHARGE_NAME
);
6034 ctor_identifier
= get_identifier (CTOR_NAME
);
6035 dtor_identifier
= get_identifier (DTOR_NAME
);
6036 pfn_identifier
= get_identifier (VTABLE_PFN_NAME
);
6037 index_identifier
= get_identifier (VTABLE_INDEX_NAME
);
6038 delta_identifier
= get_identifier (VTABLE_DELTA_NAME
);
6039 delta2_identifier
= get_identifier (VTABLE_DELTA2_NAME
);
6040 pfn_or_delta2_identifier
= get_identifier ("__pfn_or_delta2");
6042 /* Define `int' and `char' first so that dbx will output them first. */
6043 record_builtin_type (RID_INT
, NULL_PTR
, integer_type_node
);
6044 record_builtin_type (RID_CHAR
, "char", char_type_node
);
6046 /* `signed' is the same as `int' */
6047 record_builtin_type (RID_SIGNED
, NULL_PTR
, integer_type_node
);
6048 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
6049 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
6050 record_builtin_type (RID_MAX
, "long unsigned int", long_unsigned_type_node
);
6051 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
6052 record_builtin_type (RID_MAX
, "long long int", long_long_integer_type_node
);
6053 record_builtin_type (RID_MAX
, "long long unsigned int",
6054 long_long_unsigned_type_node
);
6055 record_builtin_type (RID_MAX
, "long long unsigned",
6056 long_long_unsigned_type_node
);
6057 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
6058 record_builtin_type (RID_MAX
, "short unsigned int", short_unsigned_type_node
);
6059 record_builtin_type (RID_MAX
, "unsigned short", short_unsigned_type_node
);
6062 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE
)));
6064 /* Define both `signed char' and `unsigned char'. */
6065 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
6066 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
6068 /* `unsigned long' is the standard type for sizeof.
6069 Note that stddef.h uses `unsigned long',
6070 and this must agree, even if long and int are the same size. */
6072 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE
))));
6074 /* Create the widest literal types. */
6075 widest_integer_literal_type_node
= make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
6076 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6077 widest_integer_literal_type_node
));
6079 widest_unsigned_literal_type_node
= make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
6080 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6081 widest_unsigned_literal_type_node
));
6083 /* These are types that type_for_size and type_for_mode use. */
6084 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intQI_type_node
));
6085 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intHI_type_node
));
6086 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intSI_type_node
));
6087 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intDI_type_node
));
6088 #if HOST_BITS_PER_WIDE_INT >= 64
6089 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__int128_t"), intTI_type_node
));
6091 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intQI_type_node
));
6092 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intHI_type_node
));
6093 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intSI_type_node
));
6094 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intDI_type_node
));
6095 #if HOST_BITS_PER_WIDE_INT >= 64
6096 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__uint128_t"), unsigned_intTI_type_node
));
6099 build_common_tree_nodes_2 (flag_short_double
);
6101 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6102 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6103 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6104 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6105 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6106 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6107 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6108 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6110 integer_two_node
= build_int_2 (2, 0);
6111 TREE_TYPE (integer_two_node
) = integer_type_node
;
6112 integer_three_node
= build_int_2 (3, 0);
6113 TREE_TYPE (integer_three_node
) = integer_type_node
;
6115 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6116 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6117 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6118 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6119 TYPE_PRECISION (boolean_type_node
) = 1;
6120 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6121 boolean_false_node
= build_int_2 (0, 0);
6122 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6123 boolean_true_node
= build_int_2 (1, 0);
6124 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6126 signed_size_zero_node
= build_int_2 (0, 0); record_builtin_type (RID_FLOAT
, NULL_PTR
, float_type_node
);
6127 record_builtin_type (RID_DOUBLE
, NULL_PTR
, double_type_node
);
6128 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
6130 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex int"),
6131 complex_integer_type_node
));
6132 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex float"),
6133 complex_float_type_node
));
6134 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex double"),
6135 complex_double_type_node
));
6136 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
6137 complex_long_double_type_node
));
6139 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6141 record_builtin_type (RID_VOID
, NULL_PTR
, void_type_node
);
6142 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
6143 TREE_PARMLIST (void_list_node
) = 1;
6145 /* Used for expressions that do nothing, but are not errors. */
6146 void_zero_node
= build_int_2 (0, 0);
6147 TREE_TYPE (void_zero_node
) = void_type_node
;
6149 string_type_node
= build_pointer_type (char_type_node
);
6150 const_string_type_node
6151 = build_pointer_type (build_qualified_type (char_type_node
,
6153 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6155 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
6158 /* Make a type to be the domain of a few array types
6159 whose domains don't really matter.
6160 200 is small enough that it always fits in size_t. */
6161 array_domain_type
= build_index_type (build_int_2 (200, 0));
6163 /* Make a type for arrays of characters.
6164 With luck nothing will ever really depend on the length of this
6166 char_array_type_node
6167 = build_array_type (char_type_node
, array_domain_type
);
6168 /* Likewise for arrays of ints. */
6170 = build_array_type (integer_type_node
, array_domain_type
);
6173 delta_type_node
= ptrdiff_type_node
;
6174 else if (flag_huge_objects
)
6175 delta_type_node
= long_integer_type_node
;
6177 delta_type_node
= short_integer_type_node
;
6180 vtable_index_type
= ptrdiff_type_node
;
6182 vtable_index_type
= delta_type_node
;
6184 default_function_type
6185 = build_function_type (integer_type_node
, NULL_TREE
);
6187 ptr_type_node
= build_pointer_type (void_type_node
);
6189 = build_pointer_type (build_qualified_type (void_type_node
,
6191 c_common_nodes_and_builtins (1, flag_no_builtin
, flag_no_nonansi_builtin
);
6192 lang_type_promotes_to
= convert_type_from_ellipsis
;
6195 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6197 /* C++ extensions */
6199 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6200 record_unknown_type (unknown_type_node
, "unknown type");
6202 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6203 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6205 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6207 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6209 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6210 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6212 /* This is special for C++ so functions can be overloaded. */
6213 wchar_type_node
= get_identifier (flag_short_wchar
6214 ? "short unsigned int"
6216 wchar_type_node
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (wchar_type_node
));
6217 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
6218 signed_wchar_type_node
= make_signed_type (wchar_type_size
);
6219 unsigned_wchar_type_node
= make_unsigned_type (wchar_type_size
);
6221 = TREE_UNSIGNED (wchar_type_node
)
6222 ? unsigned_wchar_type_node
6223 : signed_wchar_type_node
;
6224 record_builtin_type (RID_WCHAR
, "__wchar_t", wchar_type_node
);
6226 /* Artificial declaration of wchar_t -- can be bashed */
6227 wchar_decl_node
= build_decl (TYPE_DECL
, get_identifier ("wchar_t"),
6229 pushdecl (wchar_decl_node
);
6231 /* This is for wide string constants. */
6232 wchar_array_type_node
6233 = build_array_type (wchar_type_node
, array_domain_type
);
6235 if (flag_vtable_thunks
)
6237 /* Make sure we get a unique function type, so we can give
6238 its pointer type a name. (This wins for gdb.) */
6239 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6240 TREE_TYPE (vfunc_type
) = integer_type_node
;
6241 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6242 layout_type (vfunc_type
);
6244 vtable_entry_type
= build_pointer_type (vfunc_type
);
6248 vtable_entry_type
= make_aggr_type (RECORD_TYPE
);
6249 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
6251 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
6253 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_identifier
,
6255 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6258 /* Make this part of an invisible union. */
6259 fields
[3] = copy_node (fields
[2]);
6260 TREE_TYPE (fields
[3]) = delta_type_node
;
6261 DECL_NAME (fields
[3]) = delta2_identifier
;
6262 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6263 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6264 DECL_SIZE_UNIT (fields
[3]) = TYPE_SIZE_UNIT (delta_type_node
);
6265 TREE_UNSIGNED (fields
[3]) = 0;
6266 TREE_CHAIN (fields
[2]) = fields
[3];
6267 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6270 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6273 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6274 layout_type (vtbl_type_node
);
6275 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6276 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6277 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6278 layout_type (vtbl_ptr_type_node
);
6279 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6281 std_node
= build_decl (NAMESPACE_DECL
,
6282 get_identifier (flag_honor_std
? "fake std":"std"),
6284 pushdecl (std_node
);
6286 global_type_node
= make_node (LANG_TYPE
);
6287 record_unknown_type (global_type_node
, "global type");
6290 current_lang_name
= lang_name_cplusplus
;
6293 tree bad_alloc_type_node
, newtype
, deltype
;
6295 push_namespace (get_identifier ("std"));
6296 bad_alloc_type_node
= xref_tag
6297 (class_type_node
, get_identifier ("bad_alloc"), 1);
6300 newtype
= build_exception_variant
6301 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6302 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6303 push_cp_library_fn (ansi_opname
[(int) NEW_EXPR
], newtype
);
6304 push_cp_library_fn (ansi_opname
[(int) VEC_NEW_EXPR
], newtype
);
6305 global_delete_fndecl
= push_cp_library_fn (ansi_opname
[(int) DELETE_EXPR
],
6307 push_cp_library_fn (ansi_opname
[(int) VEC_DELETE_EXPR
], deltype
);
6311 = build_library_fn_ptr ("__pure_virtual", void_ftype
);
6313 /* Perform other language dependent initializations. */
6314 init_class_processing ();
6315 init_init_processing ();
6316 init_search_processing ();
6317 init_rtti_processing ();
6319 if (flag_exceptions
)
6320 init_exception_processing ();
6323 flag_inline_functions
= 0;
6326 if (! supports_one_only ())
6329 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6330 make_fname_decl
= cp_make_fname_decl
;
6331 declare_function_name ();
6333 /* Prepare to check format strings against argument lists. */
6334 init_function_format_info ();
6336 /* Show we use EH for cleanups. */
6337 using_eh_for_cleanups ();
6339 print_error_function
= lang_print_error_function
;
6340 lang_get_alias_set
= &c_get_alias_set
;
6341 valid_lang_attribute
= cp_valid_lang_attribute
;
6343 /* Maintain consistency. Perhaps we should just complain if they
6344 say -fwritable-strings? */
6345 if (flag_writable_strings
)
6346 flag_const_strings
= 0;
6348 /* Add GC roots for all of our global variables. */
6349 ggc_add_tree_root (c_global_trees
, sizeof c_global_trees
/ sizeof(tree
));
6350 ggc_add_tree_root (cp_global_trees
, sizeof cp_global_trees
/ sizeof(tree
));
6351 ggc_add_tree_root (&integer_three_node
, 1);
6352 ggc_add_tree_root (&integer_two_node
, 1);
6353 ggc_add_tree_root (&signed_size_zero_node
, 1);
6354 ggc_add_tree_root (&size_one_node
, 1);
6355 ggc_add_tree_root (&size_zero_node
, 1);
6356 ggc_add_root (&global_binding_level
, 1, sizeof global_binding_level
,
6357 mark_binding_level
);
6358 ggc_add_root (&scope_chain
, 1, sizeof scope_chain
, &mark_saved_scope
);
6359 ggc_add_tree_root (&static_ctors
, 1);
6360 ggc_add_tree_root (&static_dtors
, 1);
6361 ggc_add_tree_root (&lastiddecl
, 1);
6363 ggc_add_tree_root (&last_function_parm_tags
, 1);
6364 ggc_add_tree_root (¤t_function_return_value
, 1);
6365 ggc_add_tree_root (¤t_function_parms
, 1);
6366 ggc_add_tree_root (¤t_function_parm_tags
, 1);
6367 ggc_add_tree_root (&last_function_parms
, 1);
6368 ggc_add_tree_root (&error_mark_list
, 1);
6370 ggc_add_tree_root (&global_namespace
, 1);
6371 ggc_add_tree_root (&global_type_node
, 1);
6372 ggc_add_tree_root (&anonymous_namespace_name
, 1);
6374 ggc_add_tree_root (&got_object
, 1);
6375 ggc_add_tree_root (&got_scope
, 1);
6377 ggc_add_tree_root (¤t_lang_name
, 1);
6378 ggc_add_tree_root (&static_aggregates
, 1);
6381 /* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the
6382 decl, NAME is the initialization string and TYPE_DEP indicates whether
6383 NAME depended on the type of the function. We make use of that to detect
6384 __PRETTY_FUNCTION__ inside a template fn. Because we build a tree for
6385 the function before emitting any of it, we don't need to treat the
6386 VAR_DECL specially. We can decide whether to emit it later, if it was
6390 cp_make_fname_decl (id
, name
, type_dep
)
6395 tree decl
, type
, init
;
6396 size_t length
= strlen (name
);
6397 tree domain
= NULL_TREE
;
6399 if (!processing_template_decl
)
6402 domain
= build_index_type (build_int_2 (length
, 0));
6404 type
= build_cplus_array_type
6405 (build_qualified_type (char_type_node
, TYPE_QUAL_CONST
),
6408 decl
= build_lang_decl (VAR_DECL
, id
, type
);
6409 TREE_STATIC (decl
) = 1;
6410 TREE_READONLY (decl
) = 1;
6411 DECL_SOURCE_LINE (decl
) = 0;
6412 DECL_ARTIFICIAL (decl
) = 1;
6413 DECL_IN_SYSTEM_HEADER (decl
) = 1;
6415 if (processing_template_decl
)
6416 decl
= push_template_decl (decl
);
6419 init
= build (FUNCTION_NAME
, type
);
6420 DECL_PRETTY_FUNCTION_P (decl
) = 1;
6424 init
= build_string (length
+ 1, name
);
6425 TREE_TYPE (init
) = type
;
6427 DECL_INITIAL (decl
) = init
;
6428 cp_finish_decl (decl
, init
, NULL_TREE
, LOOKUP_ONLYCONVERTING
);
6430 /* We will have to make sure we only emit this, if it is actually used. */
6434 /* Function to print any language-specific context for an error message. */
6437 lang_print_error_function (file
)
6440 default_print_error_function (file
);
6441 maybe_print_template_context ();
6444 /* Entry point for the benefit of c_common_nodes_and_builtins.
6446 Make a definition for a builtin function named NAME and whose data type
6447 is TYPE. TYPE should be a function type with argument types.
6449 CLASS and CODE tell later passes how to compile calls to this function.
6450 See tree.h for possible values.
6452 If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6453 the name to be called if we can't opencode the function. */
6456 builtin_function (name
, type
, code
, class, libname
)
6460 enum built_in_class
class;
6461 const char *libname
;
6463 tree decl
= build_library_fn_1 (get_identifier (name
), type
);
6464 DECL_BUILT_IN_CLASS (decl
) = class;
6465 DECL_FUNCTION_CODE (decl
) = code
;
6467 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6469 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6470 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6471 function in the namespace. */
6474 DECL_ASSEMBLER_NAME (decl
) = get_identifier (libname
);
6475 make_function_rtl (decl
);
6479 /* Generate a FUNCTION_DECL with the typical flags for a runtime library
6480 function. Not called directly. */
6483 build_library_fn_1 (name
, type
)
6487 tree fn
= build_lang_decl (FUNCTION_DECL
, name
, type
);
6488 DECL_EXTERNAL (fn
) = 1;
6489 TREE_PUBLIC (fn
) = 1;
6490 DECL_ARTIFICIAL (fn
) = 1;
6491 TREE_NOTHROW (fn
) = 1;
6495 /* Returns the _DECL for a library function with C linkage.
6496 We assume that such functions never throw; if this is incorrect,
6497 callers should unset TREE_NOTHROW. */
6500 build_library_fn (name
, type
)
6504 tree fn
= build_library_fn_1 (name
, type
);
6505 make_function_rtl (fn
);
6509 /* Returns the _DECL for a library function with C++ linkage. */
6512 build_cp_library_fn (name
, type
)
6516 tree fn
= build_library_fn_1 (name
, type
);
6517 TREE_NOTHROW (fn
) = TYPE_NOTHROW_P (type
);
6518 set_mangled_name_for_decl (fn
);
6519 make_function_rtl (fn
);
6523 /* Like build_library_fn, but takes a C string instead of an
6527 build_library_fn_ptr (name
, type
)
6531 return build_library_fn (get_identifier (name
), type
);
6534 /* Like build_cp_library_fn, but takes a C string instead of an
6538 build_cp_library_fn_ptr (name
, type
)
6542 return build_cp_library_fn (get_identifier (name
), type
);
6545 /* Like build_library_fn, but also pushes the function so that we will
6546 be able to find it via IDENTIFIER_GLOBAL_VALUE. */
6549 push_library_fn (name
, type
)
6552 tree fn
= build_library_fn (name
, type
);
6553 pushdecl_top_level (fn
);
6557 /* Like build_cp_library_fn, but also pushes the function so that it
6558 will be found by normal lookup. */
6561 push_cp_library_fn (name
, type
)
6565 tree fn
= build_cp_library_fn (name
, type
);
6570 /* Like push_library_fn, but takes a TREE_LIST of parm types rather than
6574 push_void_library_fn (name
, parmtypes
)
6575 tree name
, parmtypes
;
6577 tree type
= build_function_type (void_type_node
, parmtypes
);
6578 return push_library_fn (name
, type
);
6581 /* Like push_void_library_fn, but also note that this function throws
6582 and does not return. Used for __throw_foo and the like. */
6585 push_throw_library_fn (name
, parmtypes
)
6586 tree name
, parmtypes
;
6588 tree fn
= push_void_library_fn (name
, parmtypes
);
6589 TREE_THIS_VOLATILE (fn
) = 1;
6590 TREE_NOTHROW (fn
) = 0;
6594 /* When we call finish_struct for an anonymous union, we create
6595 default copy constructors and such. But, an anonymous union
6596 shouldn't have such things; this function undoes the damage to the
6597 anonymous union type T.
6599 (The reason that we create the synthesized methods is that we don't
6600 distinguish `union { int i; }' from `typedef union { int i; } U'.
6601 The first is an anonymous union; the second is just an ordinary
6605 fixup_anonymous_aggr (t
)
6610 /* Wipe out memory of synthesized methods */
6611 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6612 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6613 TYPE_HAS_INIT_REF (t
) = 0;
6614 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6615 TYPE_HAS_ASSIGN_REF (t
) = 0;
6616 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6618 /* Splice the implicitly generated functions out of the TYPE_METHODS
6620 q
= &TYPE_METHODS (t
);
6623 if (DECL_ARTIFICIAL (*q
))
6624 *q
= TREE_CHAIN (*q
);
6626 q
= &TREE_CHAIN (*q
);
6629 /* ISO C++ 9.5.3. Anonymous unions may not have function members. */
6630 if (TYPE_METHODS (t
))
6631 error ("an anonymous union cannot have function members");
6634 /* Make sure that a declaration with no declarator is well-formed, i.e.
6635 just defines a tagged type or anonymous union.
6637 Returns the type defined, if any. */
6640 check_tag_decl (declspecs
)
6644 tree ob_modifier
= NULL_TREE
;
6646 register tree t
= NULL_TREE
;
6648 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6650 register tree value
= TREE_VALUE (link
);
6656 if (IS_AGGR_TYPE (value
) || TREE_CODE (value
) == ENUMERAL_TYPE
)
6658 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6662 else if (value
== ridpointers
[(int) RID_FRIEND
])
6664 if (current_class_type
== NULL_TREE
6665 || current_scope () != current_class_type
)
6666 ob_modifier
= value
;
6668 else if (value
== ridpointers
[(int) RID_STATIC
]
6669 || value
== ridpointers
[(int) RID_EXTERN
]
6670 || value
== ridpointers
[(int) RID_AUTO
]
6671 || value
== ridpointers
[(int) RID_REGISTER
]
6672 || value
== ridpointers
[(int) RID_INLINE
]
6673 || value
== ridpointers
[(int) RID_VIRTUAL
]
6674 || value
== ridpointers
[(int) RID_CONST
]
6675 || value
== ridpointers
[(int) RID_VOLATILE
]
6676 || value
== ridpointers
[(int) RID_EXPLICIT
])
6677 ob_modifier
= value
;
6681 error ("multiple types in one declaration");
6683 /* Inside a class, we might be in a friend or access declaration.
6684 Until we have a good way of detecting the latter, don't warn. */
6685 if (t
== NULL_TREE
&& ! current_class_type
)
6686 pedwarn ("declaration does not declare anything");
6688 /* Check for an anonymous union. We're careful
6689 accessing TYPE_IDENTIFIER because some built-in types, like
6690 pointer-to-member types, do not have TYPE_NAME. */
6691 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
6693 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
6695 /* Anonymous unions are objects, so they can have specifiers. */;
6696 SET_ANON_AGGR_TYPE_P (t
);
6698 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
6699 pedwarn ("ISO C++ prohibits anonymous structs");
6702 else if (ob_modifier
)
6704 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
6705 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
6706 cp_error ("`%D' can only be specified for functions", ob_modifier
);
6707 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
6708 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
6709 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
6710 cp_error ("`%D' can only be specified for constructors",
6713 cp_error ("`%D' can only be specified for objects and functions",
6720 /* Called when a declaration is seen that contains no names to declare.
6721 If its type is a reference to a structure, union or enum inherited
6722 from a containing scope, shadow that tag name for the current scope
6723 with a forward reference.
6724 If its type defines a new named structure or union
6725 or defines an enum, it is valid but we need not do anything here.
6726 Otherwise, it is an error.
6728 C++: may have to grok the declspecs to learn about static,
6729 complain for anonymous unions. */
6732 shadow_tag (declspecs
)
6735 tree t
= check_tag_decl (declspecs
);
6738 maybe_process_partial_specialization (t
);
6740 /* This is where the variables in an anonymous union are
6741 declared. An anonymous union declaration looks like:
6743 because there is no declarator after the union, the parser
6744 sends that declaration here. */
6745 if (t
&& ANON_AGGR_TYPE_P (t
))
6747 fixup_anonymous_aggr (t
);
6749 if (TYPE_FIELDS (t
))
6751 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
6753 finish_anon_union (decl
);
6758 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6761 groktypename (typename
)
6764 if (TREE_CODE (typename
) != TREE_LIST
)
6766 return grokdeclarator (TREE_VALUE (typename
),
6767 TREE_PURPOSE (typename
),
6768 TYPENAME
, 0, NULL_TREE
);
6771 /* Decode a declarator in an ordinary declaration or data definition.
6772 This is called as soon as the type information and variable name
6773 have been parsed, before parsing the initializer if any.
6774 Here we create the ..._DECL node, fill in its type,
6775 and put it on the list of decls for the current context.
6776 The ..._DECL node is returned as the value.
6778 Exception: for arrays where the length is not specified,
6779 the type is left null, to be filled in by `cp_finish_decl'.
6781 Function definitions do not come here; they go to start_function
6782 instead. However, external and forward declarations of functions
6783 do go through here. Structure field declarations are done by
6784 grokfield and not through here. */
6786 /* Set this to zero to debug not using the temporary obstack
6787 to parse initializers. */
6788 int debug_temp_inits
= 1;
6791 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
6792 tree declarator
, declspecs
;
6794 tree attributes
, prefix_attributes
;
6797 register tree type
, tem
;
6799 extern int have_extern_spec
;
6800 extern int used_extern_spec
;
6804 /* See code below that used this. */
6805 int init_written
= initialized
;
6808 /* This should only be done once on the top most decl. */
6809 if (have_extern_spec
&& !used_extern_spec
)
6811 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"),
6813 used_extern_spec
= 1;
6816 if (attributes
|| prefix_attributes
)
6817 attrlist
= build_tree_list (attributes
, prefix_attributes
);
6819 attrlist
= NULL_TREE
;
6821 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
6824 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
6827 type
= TREE_TYPE (decl
);
6829 if (type
== error_mark_node
)
6832 context
= DECL_CONTEXT (decl
);
6834 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
6835 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
6837 /* When parsing the initializer, lookup should use the object's
6839 push_decl_namespace (context
);
6842 /* We are only interested in class contexts, later. */
6843 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
6844 context
= NULL_TREE
;
6847 /* Is it valid for this decl to have an initializer at all?
6848 If not, set INITIALIZED to zero, which will indirectly
6849 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
6850 switch (TREE_CODE (decl
))
6853 /* typedef foo = bar means give foo the same type as bar.
6854 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
6855 Any other case of an initialization in a TYPE_DECL is an error. */
6856 if (pedantic
|| list_length (declspecs
) > 1)
6858 cp_error ("typedef `%D' is initialized", decl
);
6864 cp_error ("function `%#D' is initialized like a variable", decl
);
6874 if (! toplevel_bindings_p ()
6875 && DECL_EXTERNAL (decl
))
6876 cp_warning ("declaration of `%#D' has `extern' and is initialized",
6878 DECL_EXTERNAL (decl
) = 0;
6879 if (toplevel_bindings_p ())
6880 TREE_STATIC (decl
) = 1;
6882 /* Tell `pushdecl' this is an initialized decl
6883 even though we don't yet have the initializer expression.
6884 Also tell `cp_finish_decl' it may store the real initializer. */
6885 DECL_INITIAL (decl
) = error_mark_node
;
6888 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
6889 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
6892 /* Set attributes here so if duplicate decl, will have proper attributes. */
6893 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
6895 if (context
&& TYPE_SIZE (complete_type (context
)) != NULL_TREE
)
6897 push_nested_class (context
, 2);
6899 if (TREE_CODE (decl
) == VAR_DECL
)
6901 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
6902 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
6903 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
6906 if (DECL_CONTEXT (field
) != context
)
6908 cp_pedwarn ("ISO C++ does not permit `%T::%D' to be defined as `%T::%D'",
6909 DECL_CONTEXT (field
), DECL_NAME (decl
),
6910 context
, DECL_NAME (decl
));
6911 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
6913 /* Static data member are tricky; an in-class initialization
6914 still doesn't provide a definition, so the in-class
6915 declaration will have DECL_EXTERNAL set, but will have an
6916 initialization. Thus, duplicate_decls won't warn
6917 about this situation, and so we check here. */
6918 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
6919 cp_error ("duplicate initialization of %D", decl
);
6920 if (duplicate_decls (decl
, field
))
6926 tree field
= check_classfn (context
, decl
);
6927 if (field
&& duplicate_decls (decl
, field
))
6931 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
6932 DECL_IN_AGGR_P (decl
) = 0;
6933 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
6934 || CLASSTYPE_USE_TEMPLATE (context
))
6936 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
6937 /* [temp.expl.spec] An explicit specialization of a static data
6938 member of a template is a definition if the declaration
6939 includes an initializer; otherwise, it is a declaration.
6941 We check for processing_specialization so this only applies
6942 to the new specialization syntax. */
6943 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
6944 DECL_EXTERNAL (decl
) = 1;
6947 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
6948 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
6952 /* Enter this declaration into the symbol table. */
6953 tem
= maybe_push_decl (decl
);
6955 if (processing_template_decl
)
6956 tem
= push_template_decl (tem
);
6958 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
6959 /* Tell the back-end to use or not use .common as appropriate. If we say
6960 -fconserve-space, we want this to save .data space, at the expense of
6961 wrong semantics. If we say -fno-conserve-space, we want this to
6962 produce errors about redefs; to do this we force variables into the
6964 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
6967 if (! processing_template_decl
)
6977 tree type
= TREE_TYPE (decl
);
6978 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
6980 if (type
== error_mark_node
)
6983 /* If this type of object needs a cleanup, but we're not allowed to
6984 add any more objects with cleanups to the current scope, create a
6985 new binding level. */
6986 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
6987 && current_binding_level
->more_cleanups_ok
== 0)
6989 keep_next_level (2);
6992 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/1);
6996 /* Is it valid for this decl to have an initializer at all?
6997 If not, set INITIALIZED to zero, which will indirectly
6998 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7000 /* Don't allow initializations for incomplete types except for
7001 arrays which might be completed by the initialization. */
7002 if (TYPE_SIZE (complete_type (type
)) != NULL_TREE
)
7003 ; /* A complete type is ok. */
7004 else if (TREE_CODE (type
) != ARRAY_TYPE
)
7006 cp_error ("variable `%#D' has initializer but incomplete type",
7009 type
= TREE_TYPE (decl
) = error_mark_node
;
7011 else if (TYPE_SIZE (complete_type (TREE_TYPE (type
))) == NULL_TREE
)
7013 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
7014 cp_error ("elements of array `%#D' have incomplete type", decl
);
7015 /* else we already gave an error in start_decl. */
7021 && TREE_CODE (decl
) != TYPE_DECL
7022 && TREE_CODE (decl
) != TEMPLATE_DECL
7023 && type
!= error_mark_node
7024 && IS_AGGR_TYPE (type
)
7025 && ! DECL_EXTERNAL (decl
))
7027 if ((! processing_template_decl
|| ! uses_template_parms (type
))
7028 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
)
7030 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
7032 /* Change the type so that assemble_variable will give
7033 DECL an rtl we can live with: (mem (const_int 0)). */
7034 type
= TREE_TYPE (decl
) = error_mark_node
;
7038 /* If any base type in the hierarchy of TYPE needs a constructor,
7039 then we set initialized to 1. This way any nodes which are
7040 created for the purposes of initializing this aggregate
7041 will live as long as it does. This is necessary for global
7042 aggregates which do not have their initializers processed until
7043 the end of the file. */
7044 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
7049 DECL_INITIAL (decl
) = NULL_TREE
;
7052 /* Handle initialization of references.
7053 These three arguments are from `cp_finish_decl', and have the
7054 same meaning here that they do there.
7056 Quotes on semantics can be found in ARM 8.4.3. */
7059 grok_reference_init (decl
, type
, init
)
7060 tree decl
, type
, init
;
7064 if (init
== NULL_TREE
)
7066 if ((DECL_LANG_SPECIFIC (decl
) == 0
7067 || DECL_IN_AGGR_P (decl
) == 0)
7068 && ! DECL_THIS_EXTERN (decl
))
7069 cp_error ("`%D' declared as reference but not initialized", decl
);
7073 if (init
== error_mark_node
)
7076 if (TREE_CODE (init
) == CONSTRUCTOR
)
7078 cp_error ("ISO C++ forbids use of initializer list to initialize reference `%D'", decl
);
7082 if (TREE_CODE (init
) == TREE_LIST
)
7083 init
= build_compound_expr (init
);
7085 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
7086 init
= convert_from_reference (init
);
7088 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
7089 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
7091 /* Note: default conversion is only called in very special cases. */
7092 init
= default_conversion (init
);
7095 /* Convert INIT to the reference type TYPE. This may involve the
7096 creation of a temporary, whose lifetime must be the same as that
7097 of the reference. If so, a DECL_STMT for the temporary will be
7098 added just after the DECL_STMT for DECL. That's why we don't set
7099 DECL_INITIAL for local references (instead assigning to them
7100 explicitly); we need to allow the temporary to be initialized
7102 tmp
= convert_to_reference
7103 (type
, init
, CONV_IMPLICIT
,
7104 LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
, decl
);
7106 if (tmp
== error_mark_node
)
7108 else if (tmp
!= NULL_TREE
)
7111 tmp
= save_expr (tmp
);
7112 if (building_stmt_tree ())
7114 /* Initialize the declaration. */
7115 tmp
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, tmp
);
7116 finish_expr_stmt (tmp
);
7119 DECL_INITIAL (decl
) = tmp
;
7123 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7127 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
7129 expand_static_init (decl
, DECL_INITIAL (decl
));
7130 DECL_INITIAL (decl
) = NULL_TREE
;
7135 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7136 mucking with forces it does not comprehend (i.e. initialization with a
7137 constructor). If we are at global scope and won't go into COMMON, fill
7138 it in with a dummy CONSTRUCTOR to force the variable into .data;
7139 otherwise we can use error_mark_node. */
7142 obscure_complex_init (decl
, init
)
7145 if (! flag_no_inline
&& TREE_STATIC (decl
))
7147 if (extract_init (decl
, init
))
7151 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7152 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7153 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7157 DECL_INITIAL (decl
) = error_mark_node
;
7162 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7163 array until we finish parsing the initializer. If that's the
7164 situation we're in, update DECL accordingly. */
7167 maybe_deduce_size_from_array_init (decl
, init
)
7171 tree type
= TREE_TYPE (decl
);
7173 if (TREE_CODE (type
) == ARRAY_TYPE
7174 && TYPE_DOMAIN (type
) == NULL_TREE
7175 && TREE_CODE (decl
) != TYPE_DECL
)
7178 = (TREE_STATIC (decl
)
7179 /* Even if pedantic, an external linkage array
7180 may have incomplete type at first. */
7181 ? pedantic
&& ! DECL_EXTERNAL (decl
)
7182 : !DECL_EXTERNAL (decl
));
7183 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7184 int failure
= complete_array_type (type
, initializer
, do_default
);
7187 cp_error ("initializer fails to determine size of `%D'", decl
);
7192 cp_error ("array size missing in `%D'", decl
);
7193 /* If a `static' var's size isn't known, make it extern as
7194 well as static, so it does not get allocated. If it's not
7195 `static', then don't mark it extern; finish_incomplete_decl
7196 will give it a default size and it will get allocated. */
7197 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7198 DECL_EXTERNAL (decl
) = 1;
7201 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7202 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7204 cp_error ("zero-size array `%D'", decl
);
7206 layout_decl (decl
, 0);
7210 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7211 any appropriate error messages regarding the layout. */
7214 layout_var_decl (decl
)
7217 tree type
= TREE_TYPE (decl
);
7219 tree ttype
= target_type (type
);
7222 /* If we haven't already layed out this declaration, do so now.
7223 Note that we must not call complete type for an external object
7224 because it's type might involve templates that we are not
7225 supposed to isntantiate yet. (And it's perfectly legal to say
7226 `extern X x' for some incomplete type `X'.) */
7227 if (!DECL_EXTERNAL (decl
))
7228 complete_type (type
);
7229 if (!DECL_SIZE (decl
) && TYPE_SIZE (type
))
7230 layout_decl (decl
, 0);
7232 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7234 /* An automatic variable with an incomplete type: that is an error.
7235 Don't talk about array types here, since we took care of that
7236 message in grokdeclarator. */
7237 cp_error ("storage size of `%D' isn't known", decl
);
7238 TREE_TYPE (decl
) = error_mark_node
;
7241 /* Keep this code around in case we later want to control debug info
7242 based on whether a type is "used". (jason 1999-11-11) */
7244 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7245 /* Let debugger know it should output info for this type. */
7246 note_debug_info_needed (ttype
);
7248 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7249 note_debug_info_needed (DECL_CONTEXT (decl
));
7252 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7253 && DECL_SIZE (decl
) != NULL_TREE
7254 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7256 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7257 constant_expression_warning (DECL_SIZE (decl
));
7259 cp_error ("storage size of `%D' isn't constant", decl
);
7263 /* If a local static variable is declared in an inline function, or if
7264 we have a weak definition, we must endeavor to create only one
7265 instance of the variable at link-time. */
7268 maybe_commonize_var (decl
)
7271 /* Static data in a function with comdat linkage also has comdat
7273 if (TREE_STATIC (decl
)
7274 /* Don't mess with __FUNCTION__. */
7275 && ! TREE_ASM_WRITTEN (decl
)
7276 && current_function_decl
7277 && DECL_CONTEXT (decl
) == current_function_decl
7278 && (DECL_THIS_INLINE (current_function_decl
)
7279 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7280 && TREE_PUBLIC (current_function_decl
))
7282 /* Rather than try to get this right with inlining, we suppress
7283 inlining of such functions. */
7284 current_function_cannot_inline
7285 = "function with static variable cannot be inline";
7287 /* If flag_weak, we don't need to mess with this, as we can just
7288 make the function weak, and let it refer to its unique local
7289 copy. This works because we don't allow the function to be
7293 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7295 TREE_PUBLIC (decl
) = 1;
7296 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7298 else if (DECL_INITIAL (decl
) == NULL_TREE
7299 || DECL_INITIAL (decl
) == error_mark_node
)
7301 TREE_PUBLIC (decl
) = 1;
7302 DECL_COMMON (decl
) = 1;
7304 /* else we lose. We can only do this if we can use common,
7305 which we can't if it has been initialized. */
7307 if (TREE_PUBLIC (decl
))
7308 DECL_ASSEMBLER_NAME (decl
)
7309 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7310 else if (! DECL_ARTIFICIAL (decl
))
7312 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7313 cp_warning_at (" you can work around this by removing the initializer", decl
);
7317 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7318 /* Set it up again; we might have set DECL_INITIAL since the last
7320 comdat_linkage (decl
);
7323 /* Issue an error message if DECL is an uninitialized const variable. */
7326 check_for_uninitialized_const_var (decl
)
7329 tree type
= TREE_TYPE (decl
);
7331 /* ``Unless explicitly declared extern, a const object does not have
7332 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7334 if (TREE_CODE (decl
) == VAR_DECL
7335 && TREE_CODE (type
) != REFERENCE_TYPE
7336 && CP_TYPE_CONST_P (type
)
7337 && !TYPE_NEEDS_CONSTRUCTING (type
)
7338 && !DECL_INITIAL (decl
))
7339 cp_error ("uninitialized const `%D'", decl
);
7342 /* Verify INIT (the initializer for DECL), and record the
7343 initialization in DECL_INITIAL, if appropriate. Returns a new
7347 check_initializer (decl
, init
)
7353 if (TREE_CODE (decl
) == FIELD_DECL
)
7356 type
= TREE_TYPE (decl
);
7358 /* If `start_decl' didn't like having an initialization, ignore it now. */
7359 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7362 /* Check the initializer. */
7365 /* Things that are going to be initialized need to have complete
7367 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7369 if (type
== error_mark_node
)
7370 /* We will have already complained. */
7372 else if (TYPE_SIZE (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7374 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7377 else if (TREE_CODE (type
) == ARRAY_TYPE
7378 && !TYPE_SIZE (TREE_TYPE (type
)))
7380 cp_error ("elements of array `%#D' have incomplete type", decl
);
7383 else if (!TYPE_SIZE (type
))
7385 cp_error ("`%D' has incomplete type", decl
);
7386 TREE_TYPE (decl
) = error_mark_node
;
7391 if (TREE_CODE (decl
) == CONST_DECL
)
7393 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7395 DECL_INITIAL (decl
) = init
;
7397 /* This will keep us from needing to worry about our obstacks. */
7398 my_friendly_assert (init
!= NULL_TREE
, 149);
7401 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7403 if (TREE_STATIC (decl
))
7404 make_decl_rtl (decl
, NULL_PTR
, toplevel_bindings_p ());
7405 grok_reference_init (decl
, type
, init
);
7410 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7412 if (TREE_CODE (type
) == ARRAY_TYPE
)
7413 init
= digest_init (type
, init
, (tree
*) 0);
7414 else if (TREE_CODE (init
) == CONSTRUCTOR
7415 && TREE_HAS_CONSTRUCTOR (init
))
7417 if (TYPE_NON_AGGREGATE_CLASS (type
))
7419 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7421 init
= error_mark_node
;
7424 goto dont_use_constructor
;
7429 dont_use_constructor
:
7430 if (TREE_CODE (init
) != TREE_VEC
)
7431 init
= store_init_value (decl
, init
);
7435 /* We must hide the initializer so that expand_decl
7436 won't try to do something it does not understand. */
7437 init
= obscure_complex_init (decl
, init
);
7439 else if (DECL_EXTERNAL (decl
))
7441 else if (TREE_CODE_CLASS (TREE_CODE (type
)) == 't'
7442 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7444 tree core_type
= strip_array_types (type
);
7446 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7448 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7449 cp_error ("structure `%D' with uninitialized const members", decl
);
7450 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7451 cp_error ("structure `%D' with uninitialized reference members",
7455 check_for_uninitialized_const_var (decl
);
7457 if (TYPE_SIZE (type
) != NULL_TREE
7458 && TYPE_NEEDS_CONSTRUCTING (type
))
7459 init
= obscure_complex_init (decl
, NULL_TREE
);
7463 check_for_uninitialized_const_var (decl
);
7468 /* If DECL is not a local variable, give it RTL. */
7471 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
7474 const char *asmspec
;
7479 type
= TREE_TYPE (decl
);
7480 toplev
= toplevel_bindings_p ();
7482 /* Handle non-variables up front. */
7483 if (TREE_CODE (decl
) != VAR_DECL
)
7485 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7489 /* Set the DECL_ASSEMBLER_NAME for the variable. */
7491 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7493 if (DECL_VIRTUAL_P (decl
))
7494 make_decl_rtl (decl
, NULL_PTR
, toplev
);
7495 else if (TREE_READONLY (decl
)
7496 && DECL_INITIAL (decl
) != NULL_TREE
7497 && DECL_INITIAL (decl
) != error_mark_node
7498 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
7500 DECL_INITIAL (decl
) = save_expr (DECL_INITIAL (decl
));
7502 if (toplev
&& ! TREE_PUBLIC (decl
))
7504 /* If this is a static const, change its apparent linkage
7505 if it belongs to a #pragma interface. */
7506 if (!interface_unknown
)
7508 TREE_PUBLIC (decl
) = 1;
7509 DECL_EXTERNAL (decl
) = interface_only
;
7511 make_decl_rtl (decl
, asmspec
, toplev
);
7514 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7516 else if (DECL_LANG_SPECIFIC (decl
) && DECL_IN_AGGR_P (decl
))
7518 my_friendly_assert (TREE_STATIC (decl
), 19990828);
7520 if (init
== NULL_TREE
7521 #ifdef DEFAULT_STATIC_DEFS
7522 /* If this code is dead, then users must
7523 explicitly declare static member variables
7524 outside the class def'n as well. */
7525 && TYPE_NEEDS_CONSTRUCTING (type
)
7529 DECL_EXTERNAL (decl
) = 1;
7530 make_decl_rtl (decl
, asmspec
, 1);
7533 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7535 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7536 || (TREE_CODE (decl
) == VAR_DECL
&& TREE_STATIC (decl
)))
7537 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7540 /* Create RTL for the local static variable DECL. */
7543 make_rtl_for_local_static (decl
)
7546 const char *asmspec
= NULL
;
7548 /* If we inlined this variable, we could see it's declaration
7550 if (DECL_RTL (decl
))
7553 if (DECL_ASSEMBLER_NAME (decl
) != DECL_NAME (decl
))
7555 /* The only way this situaton can occur is if the
7556 user specified a name for this DECL using the
7557 `attribute' syntax. */
7558 asmspec
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
7559 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
7562 rest_of_decl_compilation (decl
, asmspec
, /*top_level=*/0, /*at_end=*/0);
7565 /* The old ARM scoping rules injected variables declared in the
7566 initialization statement of a for-statement into the surrounding
7567 scope. We support this usage, in order to be backward-compatible.
7568 DECL is a just-declared VAR_DECL; if necessary inject its
7569 declaration into the surrounding scope. */
7572 maybe_inject_for_scope_var (decl
)
7575 if (current_binding_level
->is_for_scope
)
7577 struct binding_level
*outer
7578 = current_binding_level
->level_chain
;
7580 /* Check to see if the same name is already bound at the outer
7581 level, either because it was directly declared, or because a
7582 dead for-decl got preserved. In either case, the code would
7583 not have been valid under the ARM scope rules, so clear
7584 is_for_scope for the current_binding_level.
7586 Otherwise, we need to preserve the temp slot for decl to last
7587 into the outer binding level. */
7590 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7592 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7593 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7595 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7597 BINDING_VALUE (outer_binding
)
7598 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7599 current_binding_level
->is_for_scope
= 0;
7601 else if (DECL_IN_MEMORY_P (decl
))
7602 preserve_temp_slots (DECL_RTL (decl
));
7606 /* Generate code to initialize DECL (a local variable). */
7609 initialize_local_var (decl
, init
, flags
)
7614 tree type
= TREE_TYPE (decl
);
7616 /* If the type is bogus, don't bother initializing the variable. */
7617 if (type
== error_mark_node
)
7620 if (DECL_SIZE (decl
) == NULL_TREE
&& !TREE_STATIC (decl
))
7622 /* If we used it already as memory, it must stay in memory. */
7623 DECL_INITIAL (decl
) = NULL_TREE
;
7624 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7627 /* Local statics are handled differently from ordinary automatic
7629 if (TREE_STATIC (decl
))
7631 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7632 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7633 expand_static_init (decl
, init
);
7637 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7641 /* Compute and store the initial value. */
7642 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7644 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7646 int saved_stmts_are_full_exprs_p
;
7648 emit_line_note (DECL_SOURCE_FILE (decl
),
7649 DECL_SOURCE_LINE (decl
));
7650 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p
;
7651 stmts_are_full_exprs_p
= 1;
7652 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7653 stmts_are_full_exprs_p
= saved_stmts_are_full_exprs_p
;
7656 /* Set this to 0 so we can tell whether an aggregate which was
7657 initialized was ever used. Don't do this if it has a
7658 destructor, so we don't complain about the 'resource
7659 allocation is initialization' idiom. Now set
7660 attribute((unused)) on types so decls of that type will be
7661 marked used. (see TREE_USED, above.) */
7662 if (TYPE_NEEDS_CONSTRUCTING (type
)
7664 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type
)
7665 && DECL_NAME (decl
))
7666 TREE_USED (decl
) = 0;
7667 else if (already_used
)
7668 TREE_USED (decl
) = 1;
7672 /* Generate code to destroy DECL (a local variable). */
7675 destroy_local_var (decl
)
7678 tree type
= TREE_TYPE (decl
);
7681 /* Only variables get cleaned up. */
7682 if (TREE_CODE (decl
) != VAR_DECL
)
7685 /* And only things with destructors need cleaning up. */
7686 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (type
))
7689 if (TREE_CODE (decl
) == VAR_DECL
&&
7690 (DECL_EXTERNAL (decl
) || TREE_STATIC (decl
)))
7691 /* We don't clean up things that aren't defined in this
7692 translation unit, or that need a static cleanup. The latter
7693 are handled by finish_file. */
7696 /* Compute the cleanup. */
7697 cleanup
= maybe_build_cleanup (decl
);
7699 /* Record the cleanup required for this declaration. */
7700 if (DECL_SIZE (decl
) && TREE_TYPE (decl
) != error_mark_node
7702 finish_decl_cleanup (decl
, cleanup
);
7705 /* Let the back-end know about DECL. */
7708 emit_local_var (decl
)
7711 /* Create RTL for this variable. */
7712 if (DECL_RTL (decl
))
7713 /* Only a RESULT_DECL should have non-NULL RTL when arriving here.
7714 All other local variables are assigned RTL in this function. */
7715 my_friendly_assert (TREE_CODE (decl
) == RESULT_DECL
,
7719 if (DECL_ASSEMBLER_NAME (decl
) != DECL_NAME (decl
))
7720 /* The user must have specified an assembler name for this
7721 variable. Set that up now. */
7722 rest_of_decl_compilation
7723 (decl
, IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)),
7724 /*top_level=*/0, /*at_end=*/0);
7729 /* Actually do the initialization. */
7730 expand_start_target_temps ();
7731 expand_decl_init (decl
);
7732 expand_end_target_temps ();
7735 /* Finish processing of a declaration;
7736 install its line number and initial value.
7737 If the length of an array type is not known before,
7738 it must be determined now, from the initial value, or it is an error.
7740 INIT0 holds the value of an initializer that should be allowed to escape
7743 FLAGS is LOOKUP_ONLYCONVERTING if the = init syntax was used, else 0
7744 if the (init) syntax was used.
7746 For functions that take default parameters, DECL points to its
7747 "maximal" instantiation. `cp_finish_decl' must then also declared its
7748 subsequently lower and lower forms of instantiation, checking for
7749 ambiguity as it goes. This can be sped up later. */
7752 cp_finish_decl (decl
, init
, asmspec_tree
, flags
)
7758 tree ttype
= NULL_TREE
;
7759 const char *asmspec
= NULL
;
7760 int was_readonly
= 0;
7765 error ("assignment (not initialization) in declaration");
7769 /* If a name was specified, get the string. */
7771 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
7773 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
7775 cp_error ("cannot initialize `%D' to namespace `%D'",
7780 if (current_class_type
7781 && CP_DECL_CONTEXT (decl
) == current_class_type
7782 && TYPE_BEING_DEFINED (current_class_type
)
7783 && (DECL_INITIAL (decl
) || init
))
7784 DECL_DEFINED_IN_CLASS_P (decl
) = 1;
7786 if (TREE_CODE (decl
) == VAR_DECL
7787 && DECL_CONTEXT (decl
)
7788 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7789 && DECL_CONTEXT (decl
) != current_namespace
7792 /* Leave the namespace of the object. */
7793 pop_decl_namespace ();
7796 type
= TREE_TYPE (decl
);
7798 if (type
== error_mark_node
)
7801 /* Add this declaration to the statement-tree. */
7802 if (building_stmt_tree () && at_function_scope_p ())
7803 add_decl_stmt (decl
);
7805 if (TYPE_HAS_MUTABLE_P (type
))
7806 TREE_READONLY (decl
) = 0;
7808 if (processing_template_decl
)
7810 if (init
&& DECL_INITIAL (decl
))
7811 DECL_INITIAL (decl
) = init
;
7815 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
7816 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
7818 /* Take care of TYPE_DECLs up front. */
7819 if (TREE_CODE (decl
) == TYPE_DECL
)
7821 if (init
&& DECL_INITIAL (decl
))
7823 /* typedef foo = bar; store the type of bar as the type of foo. */
7824 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
7825 DECL_INITIAL (decl
) = init
= NULL_TREE
;
7827 if (type
!= error_mark_node
7828 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
7830 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
7831 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
7832 set_identifier_type_value (DECL_NAME (decl
), type
);
7833 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
7835 GNU_xref_decl (current_function_decl
, decl
);
7837 /* If we have installed this as the canonical typedef for this
7838 type, and that type has not been defined yet, delay emitting
7839 the debug information for it, as we will emit it later. */
7840 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
7841 && TYPE_SIZE (TREE_TYPE (decl
)) == NULL_TREE
)
7842 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
7844 rest_of_decl_compilation (decl
, NULL_PTR
,
7845 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
7849 if (TREE_CODE (decl
) != FUNCTION_DECL
)
7850 ttype
= target_type (type
);
7852 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
7853 && TYPE_NEEDS_CONSTRUCTING (type
))
7855 /* Currently, GNU C++ puts constants in text space, making them
7856 impossible to initialize. In the future, one would hope for
7857 an operating system which understood the difference between
7858 initialization and the running of a program. */
7860 TREE_READONLY (decl
) = 0;
7863 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
7865 /* This must override the asm specifier which was placed by
7866 grokclassfn. Lay this out fresh. */
7867 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
7868 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7869 make_decl_rtl (decl
, asmspec
, 0);
7872 /* Deduce size of array from initialization, if not already known. */
7873 maybe_deduce_size_from_array_init (decl
, init
);
7874 init
= check_initializer (decl
, init
);
7876 GNU_xref_decl (current_function_decl
, decl
);
7878 if (TREE_CODE (decl
) == VAR_DECL
)
7879 layout_var_decl (decl
);
7881 /* Output the assembler code and/or RTL code for variables and functions,
7882 unless the type is an undefined structure or union.
7883 If not, it will get done when the type is completed. */
7884 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
7885 || TREE_CODE (decl
) == RESULT_DECL
)
7887 if (TREE_CODE (decl
) == VAR_DECL
)
7888 maybe_commonize_var (decl
);
7890 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
7892 if (TREE_CODE (type
) == FUNCTION_TYPE
7893 || TREE_CODE (type
) == METHOD_TYPE
)
7894 abstract_virtuals_error (decl
,
7895 strip_array_types (TREE_TYPE (type
)));
7897 abstract_virtuals_error (decl
, strip_array_types (type
));
7899 if (TREE_CODE (decl
) == FUNCTION_DECL
)
7901 else if (DECL_EXTERNAL (decl
)
7902 && ! (DECL_LANG_SPECIFIC (decl
)
7903 && DECL_NOT_REALLY_EXTERN (decl
)))
7906 DECL_INITIAL (decl
) = init
;
7908 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
7910 /* This is a local declaration. */
7911 if (doing_semantic_analysis_p ())
7912 maybe_inject_for_scope_var (decl
);
7913 /* Initialize the local variable. But, if we're building a
7914 statement-tree, we'll do the initialization when we
7916 if (processing_template_decl
)
7918 if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
7919 DECL_INITIAL (decl
) = init
;
7923 /* If we're not building RTL, then we need to do so
7925 if (!building_stmt_tree ())
7926 emit_local_var (decl
);
7927 /* Initialize the variable. */
7928 initialize_local_var (decl
, init
, flags
);
7929 /* Clean up the variable. */
7930 destroy_local_var (decl
);
7933 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
7935 /* Cleanups for static variables are handled by `finish_file'. */
7936 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7937 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7938 expand_static_init (decl
, init
);
7942 /* Undo call to `pushclass' that was done in `start_decl'
7943 due to initialization of qualified member variable.
7944 I.e., Foo::x = 10; */
7946 tree context
= CP_DECL_CONTEXT (decl
);
7948 && TREE_CODE_CLASS (TREE_CODE (context
)) == 't'
7949 && (TREE_CODE (decl
) == VAR_DECL
7950 /* We also have a pushclass done that we need to undo here
7951 if we're at top level and declare a method. */
7952 || TREE_CODE (decl
) == FUNCTION_DECL
)
7953 /* If size hasn't been set, we're still defining it,
7954 and therefore inside the class body; don't pop
7955 the binding level.. */
7956 && TYPE_SIZE (context
) != NULL_TREE
7957 && context
== current_class_type
)
7958 pop_nested_class ();
7965 TREE_READONLY (decl
) = 1;
7968 /* This is here for a midend callback from c-common.c */
7971 finish_decl (decl
, init
, asmspec_tree
)
7975 cp_finish_decl (decl
, init
, asmspec_tree
, 0);
7978 /* Returns a declaration for a VAR_DECL as if:
7980 extern "C" TYPE NAME;
7982 had been seen. Used to create compiler-generated global
7986 declare_global_var (name
, type
)
7992 push_to_top_level ();
7993 decl
= build_decl (VAR_DECL
, name
, type
);
7994 TREE_PUBLIC (decl
) = 1;
7995 DECL_EXTERNAL (decl
) = 1;
7996 DECL_ARTIFICIAL (decl
) = 1;
7998 cp_finish_decl (decl
, NULL_TREE
, NULL_TREE
, 0);
7999 pop_from_top_level ();
8004 /* Returns a pointer to the `atexit' function. Note that if
8005 FLAG_USE_CXA_ATEXIT is non-zero, then this will actually be the new
8006 `__cxa_atexit' function specified in the IA64 C++ ABI. */
8020 if (flag_use_cxa_atexit
)
8022 /* The declaration for `__cxa_atexit' is:
8024 int __cxa_atexit (void (*)(void *), void *, void *)
8026 We build up the argument types and then then function type
8029 /* First, build the pointer-to-function type for the first
8031 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8032 fn_type
= build_function_type (void_type_node
, arg_types
);
8033 fn_ptr_type
= build_pointer_type (fn_type
);
8034 /* Then, build the rest of the argument types. */
8035 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8036 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, arg_types
);
8037 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, arg_types
);
8038 /* And the final __cxa_atexit type. */
8039 fn_type
= build_function_type (integer_type_node
, arg_types
);
8040 fn_ptr_type
= build_pointer_type (fn_type
);
8041 name
= "__cxa_atexit";
8045 /* The declaration for `atexit' is:
8047 int atexit (void (*)());
8049 We build up the argument types and then then function type
8051 fn_type
= build_function_type (void_type_node
, void_list_node
);
8052 fn_ptr_type
= build_pointer_type (fn_type
);
8053 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, void_list_node
);
8054 /* Build the final atexit type. */
8055 fn_type
= build_function_type (integer_type_node
, arg_types
);
8059 /* Now, build the function declaration. */
8060 push_lang_context (lang_name_c
);
8061 atexit_fndecl
= build_library_fn_ptr (name
, fn_type
);
8062 mark_used (atexit_fndecl
);
8063 pop_lang_context ();
8064 atexit_node
= default_conversion (atexit_fndecl
);
8069 /* Returns the __dso_handle VAR_DECL. */
8072 get_dso_handle_node ()
8074 if (dso_handle_node
)
8075 return dso_handle_node
;
8077 /* Declare the variable. */
8078 dso_handle_node
= declare_global_var (get_identifier ("__dso_handle"),
8081 return dso_handle_node
;
8084 /* Begin a new function with internal linkage whose job will be simply
8085 to destroy some particular variable. */
8090 static int counter
= 0;
8091 int old_interface_unknown
= interface_unknown
;
8097 push_to_top_level ();
8099 /* No need to mangle this. */
8100 push_lang_context (lang_name_c
);
8102 interface_unknown
= 1;
8104 /* Build the parameter-types. */
8105 parmtypes
= void_list_node
;
8106 /* Functions passed to __cxa_atexit take an additional parameter.
8107 We'll just ignore it. After we implement the new calling
8108 convention for destructors, we can eliminate the use of
8109 additional cleanup functions entirely in the -fnew-abi case. */
8110 if (flag_use_cxa_atexit
)
8111 parmtypes
= tree_cons (NULL_TREE
, ptr_type_node
, parmtypes
);
8112 /* Build the function type itself. */
8113 fntype
= build_function_type (void_type_node
, parmtypes
);
8114 /* Build the name of the function. */
8115 sprintf (name
, "__tcf_%d", counter
++);
8116 /* Build the function declaration. */
8117 fndecl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), fntype
);
8118 /* It's a function with internal linkage, generated by the
8120 TREE_PUBLIC (fndecl
) = 0;
8121 DECL_ARTIFICIAL (fndecl
) = 1;
8122 /* Build the parameter. */
8123 if (flag_use_cxa_atexit
)
8127 parmdecl
= build_decl (PARM_DECL
, NULL_TREE
, ptr_type_node
);
8128 DECL_CONTEXT (parmdecl
) = fndecl
;
8129 DECL_ARG_TYPE (parmdecl
) = ptr_type_node
;
8130 TREE_USED (parmdecl
) = 1;
8131 DECL_ARGUMENTS (fndecl
) = parmdecl
;
8135 start_function (/*specs=*/NULL_TREE
, fndecl
, NULL_TREE
, SF_PRE_PARSED
);
8138 interface_unknown
= old_interface_unknown
;
8140 pop_lang_context ();
8142 return current_function_decl
;
8145 /* Finish the cleanup function begun by start_cleanup_fn. */
8152 expand_body (finish_function (lineno
, 0));
8154 pop_from_top_level ();
8157 /* Generate code to handle the destruction of DECL, an object with
8158 static storage duration. */
8161 register_dtor_fn (decl
)
8169 int saved_flag_access_control
;
8171 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl
)))
8174 /* Call build_cleanup before we enter the anonymous function so that
8175 any access checks will be done relative to the current scope,
8176 rather than the scope of the anonymous function. */
8177 build_cleanup (decl
);
8179 /* Now start the function. */
8180 cleanup
= start_cleanup_fn ();
8182 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
8183 to the original function, rather than the anonymous one. That
8184 will make the back-end think that nested functions are in use,
8185 which causes confusion. */
8186 saved_flag_access_control
= flag_access_control
;
8187 flag_access_control
= 0;
8188 fcall
= build_cleanup (decl
);
8189 flag_access_control
= saved_flag_access_control
;
8191 /* Create the body of the anonymous function. */
8192 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
8193 finish_expr_stmt (fcall
);
8194 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
8197 /* Call atexit with the cleanup function. */
8198 mark_addressable (cleanup
);
8199 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
8200 if (flag_use_cxa_atexit
)
8202 args
= tree_cons (NULL_TREE
, get_dso_handle_node (), NULL_TREE
);
8203 args
= tree_cons (NULL_TREE
, null_pointer_node
, args
);
8204 args
= tree_cons (NULL_TREE
, cleanup
, args
);
8207 args
= tree_cons (NULL_TREE
, cleanup
, NULL_TREE
);
8208 finish_expr_stmt (build_function_call (get_atexit_node (), args
));
8212 expand_static_init (decl
, init
)
8216 tree oldstatic
= value_member (decl
, static_aggregates
);
8220 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
8221 cp_error ("multiple initializations given for `%D'", decl
);
8223 else if (! toplevel_bindings_p ())
8225 /* Emit code to perform this initialization but once. */
8232 /* Emit code to perform this initialization but once. This code
8235 static int temp = 0;
8237 // Do initialization.
8239 // Register variable for destruction at end of program.
8242 Note that the `temp' variable is only set to 1 *after* the
8243 initialization is complete. This ensures that an exception,
8244 thrown during the construction, will cause the variable to
8245 reinitialized when we pass through this code again, as per:
8249 If the initialization exits by throwing an exception, the
8250 initialization is not complete, so it will be tried again
8251 the next time control enters the declaration.
8253 In theory, this process should be thread-safe, too; multiple
8254 threads should not be able to initialize the variable more
8255 than once. We don't yet attempt to ensure thread-safety. */
8256 temp
= get_temp_name (integer_type_node
, 1);
8257 rest_of_decl_compilation (temp
, NULL_PTR
, 0, 0);
8259 /* Begin the conditional initialization. */
8260 if_stmt
= begin_if_stmt ();
8261 finish_if_stmt_cond (build_binary_op (EQ_EXPR
, temp
,
8264 then_clause
= begin_compound_stmt (/*has_no_scope=*/0);
8266 /* Do the initialization itself. */
8267 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
8268 || (init
&& TREE_CODE (init
) == TREE_LIST
))
8269 assignment
= build_aggr_init (decl
, init
, 0);
8271 /* The initialization we're doing here is just a bitwise
8273 assignment
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
8275 assignment
= NULL_TREE
;
8277 /* Once the assignment is complete, set TEMP to 1. Since the
8278 construction of the static object is complete at this point,
8279 we want to make sure TEMP is set to 1 even if a temporary
8280 constructed during the initialization throws an exception
8281 when it is destroyed. So, we combine the initialization and
8282 the assignment to TEMP into a single expression, ensuring
8283 that when we call finish_expr_stmt the cleanups will not be
8284 run until after TEMP is set to 1. */
8285 temp_init
= build_modify_expr (temp
, NOP_EXPR
, integer_one_node
);
8288 assignment
= tree_cons (NULL_TREE
, assignment
,
8289 build_tree_list (NULL_TREE
,
8291 assignment
= build_compound_expr (assignment
);
8294 assignment
= temp_init
;
8295 finish_expr_stmt (assignment
);
8297 /* Use atexit to register a function for destroying this static
8299 register_dtor_fn (decl
);
8301 finish_compound_stmt (/*has_no_scope=*/0, then_clause
);
8302 finish_then_clause (if_stmt
);
8306 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8309 /* Finish the declaration of a catch-parameter. */
8312 start_handler_parms (declspecs
, declarator
)
8319 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8321 if (decl
== NULL_TREE
)
8322 error ("invalid catch parameter");
8331 /* Make TYPE a complete type based on INITIAL_VALUE.
8332 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8333 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8336 complete_array_type (type
, initial_value
, do_default
)
8337 tree type
, initial_value
;
8340 register tree maxindex
= NULL_TREE
;
8345 /* Note MAXINDEX is really the maximum index,
8346 one less than the size. */
8347 if (TREE_CODE (initial_value
) == STRING_CST
)
8350 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8351 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8354 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8356 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8358 maxindex
= ssize_int (-1);
8359 for (; elts
; elts
= TREE_CHAIN (elts
))
8361 if (TREE_PURPOSE (elts
))
8362 maxindex
= TREE_PURPOSE (elts
);
8364 maxindex
= size_binop (PLUS_EXPR
, maxindex
, ssize_int (1));
8366 maxindex
= copy_node (maxindex
);
8370 /* Make an error message unless that happened already. */
8371 if (initial_value
!= error_mark_node
)
8374 initial_value
= NULL_TREE
;
8376 /* Prevent further error messages. */
8377 maxindex
= build_int_2 (0, 0);
8384 maxindex
= build_int_2 (0, 0);
8393 domain
= build_index_type (maxindex
);
8394 TYPE_DOMAIN (type
) = domain
;
8396 if (! TREE_TYPE (maxindex
))
8397 TREE_TYPE (maxindex
) = domain
;
8399 itype
= TREE_TYPE (initial_value
);
8402 if (itype
&& !TYPE_DOMAIN (itype
))
8403 TYPE_DOMAIN (itype
) = domain
;
8404 /* The type of the main variant should never be used for arrays
8405 of different sizes. It should only ever be completed with the
8406 size of the array. */
8407 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8408 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8411 /* Lay out the type now that we can get the real answer. */
8418 /* Return zero if something is declared to be a member of type
8419 CTYPE when in the context of CUR_TYPE. STRING is the error
8420 message to print in that case. Otherwise, quietly return 1. */
8423 member_function_or_else (ctype
, cur_type
, flags
)
8424 tree ctype
, cur_type
;
8425 enum overload_flags flags
;
8427 if (ctype
&& ctype
!= cur_type
)
8429 if (flags
== DTOR_FLAG
)
8430 error ("destructor for alien class `%s' cannot be a member",
8431 TYPE_NAME_STRING (ctype
));
8433 error ("constructor for alien class `%s' cannot be a member",
8434 TYPE_NAME_STRING (ctype
));
8440 /* Subroutine of `grokdeclarator'. */
8442 /* Generate errors possibly applicable for a given set of specifiers.
8443 This is for ARM $7.1.2. */
8446 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8449 int virtualp
, quals
, friendp
, raises
, inlinep
;
8452 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8454 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8456 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8459 cp_error_at ("`%D' declared as a friend", object
);
8461 cp_error_at ("`%D' declared with an exception specification", object
);
8464 /* CTYPE is class type, or null if non-class.
8465 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8467 DECLARATOR is the function's name.
8468 VIRTUALP is truthvalue of whether the function is virtual or not.
8469 FLAGS are to be passed through to `grokclassfn'.
8470 QUALS are qualifiers indicating whether the function is `const'
8472 RAISES is a list of exceptions that this function can raise.
8473 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8474 not look, and -1 if we should not call `grokclassfn' at all.
8476 Returns `NULL_TREE' if something goes wrong, after issuing
8477 applicable error messages. */
8480 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8481 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8482 template_count
, in_namespace
)
8485 tree orig_declarator
;
8487 enum overload_flags flags
;
8489 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8493 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8494 int has_default_arg
= 0;
8498 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8499 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8505 type
= build_exception_variant (type
, raises
);
8508 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8509 /* Propagate volatile out from type to decl. */
8510 if (TYPE_VOLATILE (type
))
8511 TREE_THIS_VOLATILE (decl
) = 1;
8513 /* If this decl has namespace scope, set that up. */
8515 set_decl_namespace (decl
, in_namespace
, friendp
);
8516 else if (publicp
&& ! ctype
)
8517 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8519 /* `main' and builtins have implicit 'C' linkage. */
8520 if ((MAIN_NAME_P (declarator
)
8521 || (IDENTIFIER_LENGTH (declarator
) > 10
8522 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8523 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8524 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8525 && current_lang_name
== lang_name_cplusplus
8526 && ctype
== NULL_TREE
8527 /* NULL_TREE means global namespace. */
8528 && DECL_CONTEXT (decl
) == NULL_TREE
)
8529 DECL_LANGUAGE (decl
) = lang_c
;
8531 /* Should probably propagate const out from type to decl I bet (mrs). */
8534 DECL_STATIC_FUNCTION_P (decl
) = 1;
8535 DECL_CONTEXT (decl
) = ctype
;
8539 DECL_CONTEXT (decl
) = ctype
;
8541 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8543 if (processing_template_decl
)
8544 error ("cannot declare `::main' to be a template");
8546 error ("cannot declare `::main' to be inline");
8548 error ("cannot declare `::main' to be static");
8553 /* Members of anonymous types and local classes have no linkage; make
8555 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8556 || decl_function_context (TYPE_MAIN_DECL (ctype
))))
8561 /* [basic.link]: A name with no linkage (notably, the name of a class
8562 or enumeration declared in a local scope) shall not be used to
8563 declare an entity with linkage.
8565 Only check this for public decls for now. */
8566 t
= no_linkage_check (TREE_TYPE (decl
));
8569 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8571 if (DECL_LANGUAGE (decl
) == lang_c
)
8572 /* Allow this; it's pretty common in C. */;
8574 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8578 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8583 TREE_PUBLIC (decl
) = publicp
;
8586 DECL_INTERFACE_KNOWN (decl
) = 1;
8587 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8591 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8593 DECL_EXTERNAL (decl
) = 1;
8594 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8596 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8597 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8601 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8602 grok_op_properties (decl
, virtualp
, check
< 0);
8604 if (ctype
&& decl_function_context (decl
))
8605 DECL_NO_STATIC_CHAIN (decl
) = 1;
8607 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8608 if (TREE_PURPOSE (t
)
8609 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8611 has_default_arg
= 1;
8616 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8620 ("defining explicit specialization `%D' in friend declaration",
8624 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8626 /* Something like `template <class T> friend void f<T>()'. */
8627 cp_error ("invalid use of template-id `%D' in declaration of primary template",
8633 /* A friend declaration of the form friend void f<>(). Record
8634 the information in the TEMPLATE_ID_EXPR. */
8635 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8636 DECL_TEMPLATE_INFO (decl
)
8637 = tree_cons (TREE_OPERAND (orig_declarator
, 0),
8638 TREE_OPERAND (orig_declarator
, 1),
8641 if (has_default_arg
)
8643 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8650 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8657 if (has_default_arg
)
8658 add_defarg_fn (decl
);
8660 /* Plain overloading: will not be grok'd by grokclassfn. */
8661 if (! ctype
&& ! processing_template_decl
8662 && DECL_LANGUAGE (decl
) != lang_c
8663 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8664 set_mangled_name_for_decl (decl
);
8667 /* Make the init_value nonzero so pushdecl knows this is not
8668 tentative. error_mark_node is replaced later with the BLOCK. */
8669 DECL_INITIAL (decl
) = error_mark_node
;
8671 /* Caller will do the rest of this. */
8675 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8678 /* Just handle constructors here. We could do this
8679 inside the following if stmt, but I think
8680 that the code is more legible by breaking this
8681 case out. See comments below for what each of
8682 the following calls is supposed to do. */
8683 DECL_CONSTRUCTOR_P (decl
) = 1;
8685 grokclassfn (ctype
, decl
, flags
, quals
);
8687 decl
= check_explicit_specialization (orig_declarator
, decl
,
8689 2 * (funcdef_flag
!= 0) +
8690 4 * (friendp
!= 0));
8691 if (decl
== error_mark_node
)
8694 if ((! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8697 tmp
= check_classfn (ctype
, decl
);
8699 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8700 tmp
= DECL_TEMPLATE_RESULT(tmp
);
8702 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8703 cp_error ("definition of implicitly-declared `%D'", tmp
);
8704 if (tmp
&& duplicate_decls (decl
, tmp
))
8707 if (! grok_ctor_properties (ctype
, decl
))
8714 /* Function gets the ugly name, field gets the nice one.
8715 This call may change the type of the function (because
8716 of default parameters)! */
8717 if (ctype
!= NULL_TREE
)
8718 grokclassfn (ctype
, decl
, flags
, quals
);
8720 decl
= check_explicit_specialization (orig_declarator
, decl
,
8722 2 * (funcdef_flag
!= 0) +
8723 4 * (friendp
!= 0));
8724 if (decl
== error_mark_node
)
8727 if (ctype
!= NULL_TREE
8728 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8731 tmp
= check_classfn (ctype
, decl
);
8733 if (tmp
&& TREE_CODE (tmp
) == TEMPLATE_DECL
)
8734 tmp
= DECL_TEMPLATE_RESULT (tmp
);
8736 if (tmp
&& DECL_STATIC_FUNCTION_P (tmp
)
8737 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8739 /* Remove the `this' parm added by grokclassfn.
8740 XXX Isn't this done in start_function, too? */
8741 revert_static_member_fn (&decl
, NULL
, NULL
);
8742 last_function_parms
= TREE_CHAIN (last_function_parms
);
8744 if (tmp
&& DECL_ARTIFICIAL (tmp
))
8745 cp_error ("definition of implicitly-declared `%D'", tmp
);
8748 /* Attempt to merge the declarations. This can fail, in
8749 the case of some illegal specialization declarations. */
8750 if (!duplicate_decls (decl
, tmp
))
8751 cp_error ("no `%#D' member function declared in class `%T'",
8757 if (ctype
== NULL_TREE
|| check
)
8762 DECL_VIRTUAL_P (decl
) = 1;
8763 if (DECL_VINDEX (decl
) == NULL_TREE
)
8764 DECL_VINDEX (decl
) = error_mark_node
;
8765 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
8772 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
8775 RID_BIT_TYPE
*specbits_in
;
8781 RID_BIT_TYPE specbits
;
8783 specbits
= *specbits_in
;
8785 if (TREE_CODE (type
) == OFFSET_TYPE
)
8787 /* If you declare a static member so that it
8788 can be initialized, the code will reach here. */
8789 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
8790 type
= TREE_TYPE (type
);
8791 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8792 DECL_CONTEXT (decl
) = basetype
;
8793 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
, declarator
);
8800 context
= in_namespace
;
8801 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
8802 context
= current_namespace
;
8804 context
= NULL_TREE
;
8806 if (processing_template_decl
)
8807 /* If we're in a template, we need DECL_LANG_SPECIFIC so that
8808 we can call push_template_decl. */
8809 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8811 decl
= build_decl (VAR_DECL
, declarator
, type
);
8814 set_decl_namespace (decl
, context
, 0);
8816 context
= DECL_CONTEXT (decl
);
8817 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
8818 DECL_ASSEMBLER_NAME (decl
) = build_static_name (context
, declarator
);
8822 set_decl_namespace (decl
, in_namespace
, 0);
8824 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
8826 DECL_THIS_EXTERN (decl
) = 1;
8827 DECL_EXTERNAL (decl
) = !initialized
;
8830 /* In class context, static means one per class,
8831 public access, and static storage. */
8832 if (DECL_CLASS_SCOPE_P (decl
))
8834 TREE_PUBLIC (decl
) = 1;
8835 TREE_STATIC (decl
) = 1;
8836 DECL_EXTERNAL (decl
) = 0;
8838 /* At top level, either `static' or no s.c. makes a definition
8839 (perhaps tentative), and absence of `static' makes it public. */
8840 else if (toplevel_bindings_p ())
8842 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
8843 && (DECL_THIS_EXTERN (decl
) || ! constp
));
8844 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
8846 /* Not at top level, only `static' makes a static definition. */
8849 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
8850 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
8853 if (TREE_PUBLIC (decl
))
8855 /* [basic.link]: A name with no linkage (notably, the name of a class
8856 or enumeration declared in a local scope) shall not be used to
8857 declare an entity with linkage.
8859 Only check this for public decls for now. */
8860 tree t
= no_linkage_check (TREE_TYPE (decl
));
8863 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8864 /* Ignore for now; `enum { foo } e' is pretty common. */;
8866 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
8874 /* Create and return a canonical pointer to member function type, for
8875 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
8878 build_ptrmemfunc_type (type
)
8884 tree unqualified_variant
= NULL_TREE
;
8886 /* If a canonical type already exists for this type, use it. We use
8887 this method instead of type_hash_canon, because it only does a
8888 simple equality check on the list of field members. */
8890 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
8893 /* Make sure that we always have the unqualified pointer-to-member
8895 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8897 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
8899 t
= make_aggr_type (RECORD_TYPE
);
8900 /* Let the front-end know this is a pointer to member function... */
8901 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
8902 /* ... and not really an aggregate. */
8903 SET_IS_AGGR_TYPE (t
, 0);
8907 u
= make_aggr_type (UNION_TYPE
);
8908 SET_IS_AGGR_TYPE (u
, 0);
8909 fields
[0] = build_lang_decl (FIELD_DECL
, pfn_identifier
, type
);
8910 fields
[1] = build_lang_decl (FIELD_DECL
, delta2_identifier
,
8912 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
8913 TYPE_NAME (u
) = NULL_TREE
;
8915 fields
[0] = build_lang_decl (FIELD_DECL
, delta_identifier
,
8917 fields
[1] = build_lang_decl (FIELD_DECL
, index_identifier
,
8919 fields
[2] = build_lang_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
8920 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
8924 fields
[0] = build_lang_decl (FIELD_DECL
, pfn_identifier
, type
);
8925 fields
[1] = build_lang_decl (FIELD_DECL
, delta_identifier
,
8927 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
8930 /* Zap out the name so that the back-end will give us the debugging
8931 information for this anonymous RECORD_TYPE. */
8932 TYPE_NAME (t
) = NULL_TREE
;
8934 /* If this is not the unqualified form of this pointer-to-member
8935 type, set the TYPE_MAIN_VARIANT for this type to be the
8936 unqualified type. Since they are actually RECORD_TYPEs that are
8937 not variants of each other, we must do this manually. */
8938 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
8940 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
8941 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
8942 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
8943 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
8946 /* Cache this pointer-to-member type so that we can find it again
8948 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
8950 /* Seems to be wanted. */
8951 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
8956 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
8957 Check to see that the definition is valid. Issue appropriate error
8958 messages. Return 1 if the definition is particularly bad, or 0
8962 check_static_variable_definition (decl
, type
)
8966 /* Motion 10 at San Diego: If a static const integral data member is
8967 initialized with an integral constant expression, the initializer
8968 may appear either in the declaration (within the class), or in
8969 the definition, but not both. If it appears in the class, the
8970 member is a member constant. The file-scope definition is always
8972 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
8974 cp_error ("invalid in-class initialization of static data member of non-integral type `%T'",
8976 /* If we just return the declaration, crashes will sometimes
8977 occur. We therefore return void_type_node, as if this was a
8978 friend declaration, to cause callers to completely ignore
8979 this declaration. */
8982 else if (!CP_TYPE_CONST_P (type
))
8983 cp_error ("ISO C++ forbids in-class initialization of non-const static member `%D'",
8985 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
8986 cp_pedwarn ("ISO C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
8991 /* Given the SIZE (i.e., number of elements) in an array, compute an
8992 appropriate index type for the array. If non-NULL, NAME is the
8993 name of the thing being declared. */
8996 compute_array_index_type (name
, size
)
9002 /* The size might be the result of a cast. */
9003 STRIP_TYPE_NOPS (size
);
9005 /* It might be a const variable or enumeration constant. */
9006 if (TREE_READONLY_DECL_P (size
))
9007 size
= decl_constant_value (size
);
9009 /* If this involves a template parameter, it will be a constant at
9010 instantiation time, but we don't know what the value is yet.
9011 Even if no template parameters are involved, we may an expression
9012 that is not a constant; we don't even simplify `1 + 2' when
9013 processing a template. */
9014 if (processing_template_decl
)
9016 /* Resolve a qualified reference to an enumerator or static
9017 const data member of ours. */
9018 if (TREE_CODE (size
) == SCOPE_REF
9019 && TREE_OPERAND (size
, 0) == current_class_type
)
9021 tree t
= lookup_field (current_class_type
,
9022 TREE_OPERAND (size
, 1), 0, 0);
9027 return build_index_type (build_min (MINUS_EXPR
, sizetype
,
9028 size
, integer_one_node
));
9031 /* The array bound must be an integer type. */
9032 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9033 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
9034 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
9037 cp_error ("size of array `%D' has non-integer type", name
);
9039 cp_error ("size of array has non-integer type");
9040 size
= integer_one_node
;
9043 /* Normally, the array-bound will be a constant. */
9044 if (TREE_CONSTANT (size
))
9046 /* Check to see if the array bound overflowed. Make that an
9047 error, no matter how generous we're being. */
9048 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9049 int old_pedantic
= pedantic
;
9050 pedantic
= flag_pedantic_errors
= 1;
9051 constant_expression_warning (size
);
9052 pedantic
= old_pedantic
;
9053 flag_pedantic_errors
= old_flag_pedantic_errors
;
9055 /* An array must have a positive number of elements. */
9056 if (INT_CST_LT (size
, integer_zero_node
))
9059 cp_error ("size of array `%D' is negative", name
);
9061 cp_error ("size of array is negative");
9062 size
= integer_one_node
;
9064 /* Except that an extension we allow zero-sized arrays. We
9065 always allow them in system headers because glibc uses
9067 else if (integer_zerop (size
) && pedantic
&& !in_system_header
)
9070 cp_pedwarn ("ISO C++ forbids zero-size array `%D'", name
);
9072 cp_pedwarn ("ISO C++ forbids zero-size array");
9076 /* Compute the index of the largest element in the array. It is
9077 one less than the number of elements in the array. */
9079 = fold (build_binary_op (MINUS_EXPR
,
9080 cp_convert (ssizetype
, size
),
9081 cp_convert (ssizetype
,
9082 integer_one_node
)));
9084 /* Check for variable-sized arrays. We allow such things as an
9085 extension, even though they are not allowed in ANSI/ISO C++. */
9086 if (!TREE_CONSTANT (itype
))
9091 cp_pedwarn ("ISO C++ forbids variable-size array `%D'",
9094 cp_pedwarn ("ISO C++ forbids variable-size array");
9097 /* Create a variable-sized array index type. */
9098 itype
= variable_size (itype
);
9100 /* Make sure that there was no overflow when creating to a signed
9101 index type. (For example, on a 32-bit machine, an array with
9102 size 2^32 - 1 is too big.) */
9103 else if (TREE_OVERFLOW (itype
))
9105 error ("overflow in array dimension");
9106 TREE_OVERFLOW (itype
) = 0;
9109 /* Create and return the appropriate index type. */
9110 return build_index_type (itype
);
9113 /* Returns an ARRAY_TYPE for an array with SIZE elements of the
9114 indicated TYPE. If non-NULL, NAME is the NAME of the declaration
9118 create_array_type_for_decl (name
, type
, size
)
9123 tree itype
= NULL_TREE
;
9124 const char* error_msg
;
9126 /* If things have already gone awry, bail now. */
9127 if (type
== error_mark_node
|| size
== error_mark_node
)
9128 return error_mark_node
;
9130 /* Assume that everything will go OK. */
9133 /* There are some types which cannot be array elements. */
9134 switch (TREE_CODE (type
))
9137 error_msg
= "array of void";
9141 error_msg
= "array of functions";
9144 case REFERENCE_TYPE
:
9145 error_msg
= "array of references";
9149 error_msg
= "array of data members";
9153 error_msg
= "array of function members";
9160 /* If something went wrong, issue an error-message and return. */
9164 cp_error ("declaration of `%D' as %s", name
, error_msg
);
9166 cp_error ("creating %s", error_msg
);
9168 return error_mark_node
;
9173 The constant expressions that specify the bounds of the arrays
9174 can be omitted only for the first member of the sequence. */
9175 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9177 cp_error ("declaration of `%D' as multidimensional array must have bounds for all dimensions except the first",
9180 return error_mark_node
;
9183 /* Figure out the index type for the array. */
9185 itype
= compute_array_index_type (name
, size
);
9187 return build_cplus_array_type (type
, itype
);
9190 /* Given declspecs and a declarator,
9191 determine the name and type of the object declared
9192 and construct a ..._DECL node for it.
9193 (In one case we can return a ..._TYPE node instead.
9194 For invalid input we sometimes return 0.)
9196 DECLSPECS is a chain of tree_list nodes whose value fields
9197 are the storage classes and type specifiers.
9199 DECL_CONTEXT says which syntactic context this declaration is in:
9200 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
9201 FUNCDEF for a function definition. Like NORMAL but a few different
9202 error messages in each case. Return value may be zero meaning
9203 this definition is too screwy to try to parse.
9204 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
9205 handle member functions (which have FIELD context).
9206 Return value may be zero meaning this definition is too screwy to
9208 PARM for a parameter declaration (either within a function prototype
9209 or before a function body). Make a PARM_DECL, or return void_type_node.
9210 CATCHPARM for a parameter declaration before a catch clause.
9211 TYPENAME if for a typename (in a cast or sizeof).
9212 Don't make a DECL node; just return the ..._TYPE node.
9213 FIELD for a struct or union field; make a FIELD_DECL.
9214 BITFIELD for a field with specified width.
9215 INITIALIZED is 1 if the decl has an initializer.
9217 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
9218 normal attributes in TREE_PURPOSE, or NULL_TREE.
9220 In the TYPENAME case, DECLARATOR is really an abstract declarator.
9221 It may also be so in the PARM case, for a prototype where the
9222 argument type is specified but not the name.
9224 This function is where the complicated C meanings of `static'
9225 and `extern' are interpreted.
9227 For C++, if there is any monkey business to do, the function which
9228 calls this one must do it, i.e., prepending instance variables,
9229 renaming overloaded function names, etc.
9231 Note that for this C++, it is an error to define a method within a class
9232 which does not belong to that class.
9234 Except in the case where SCOPE_REFs are implicitly known (such as
9235 methods within a class being redundantly qualified),
9236 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
9237 (class_name::decl_name). The caller must also deal with this.
9239 If a constructor or destructor is seen, and the context is FIELD,
9240 then the type gains the attribute TREE_HAS_x. If such a declaration
9241 is erroneous, NULL_TREE is returned.
9243 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
9244 function, these are the qualifiers to give to the `this' pointer. We
9245 apply TYPE_QUAL_RESTRICT to the this ptr, not the object.
9247 May return void_type_node if the declarator turned out to be a friend.
9248 See grokfield for details. */
9250 enum return_types
{ return_normal
, return_ctor
, return_dtor
, return_conversion
};
9253 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
9256 enum decl_context decl_context
;
9260 RID_BIT_TYPE specbits
;
9263 tree type
= NULL_TREE
;
9269 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
9270 int explicit_int
= 0;
9271 int explicit_char
= 0;
9272 int defaulted_int
= 0;
9273 tree typedef_decl
= NULL_TREE
;
9275 tree typedef_type
= NULL_TREE
;
9276 int funcdef_flag
= 0;
9277 enum tree_code innermost_code
= ERROR_MARK
;
9280 /* See the code below that used this. */
9281 tree decl_machine_attr
= NULL_TREE
;
9283 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
9284 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
9285 tree init
= NULL_TREE
;
9287 /* Keep track of what sort of function is being processed
9288 so that we can warn about default return values, or explicit
9289 return values which do not match prescribed defaults. */
9290 enum return_types return_type
= return_normal
;
9292 tree dname
= NULL_TREE
;
9293 tree ctype
= current_class_type
;
9294 tree ctor_return_type
= NULL_TREE
;
9295 enum overload_flags flags
= NO_SPECIAL
;
9296 tree quals
= NULL_TREE
;
9297 tree raises
= NULL_TREE
;
9298 int template_count
= 0;
9299 tree in_namespace
= NULL_TREE
;
9303 RIDBIT_RESET_ALL (specbits
);
9304 if (decl_context
== FUNCDEF
)
9305 funcdef_flag
= 1, decl_context
= NORMAL
;
9306 else if (decl_context
== MEMFUNCDEF
)
9307 funcdef_flag
= -1, decl_context
= FIELD
;
9308 else if (decl_context
== BITFIELD
)
9309 bitfield
= 1, decl_context
= FIELD
;
9311 /* Look inside a declarator for the name being declared
9312 and get it as a string, for an error message. */
9314 tree
*next
= &declarator
;
9318 while (next
&& *next
)
9321 switch (TREE_CODE (decl
))
9324 /* For attributes. */
9325 next
= &TREE_VALUE (decl
);
9330 next
= &TREE_OPERAND (decl
, 0);
9333 case BIT_NOT_EXPR
: /* For C++ destructors! */
9335 tree name
= TREE_OPERAND (decl
, 0);
9336 tree rename
= NULL_TREE
;
9338 my_friendly_assert (flags
== NO_SPECIAL
, 152);
9340 return_type
= return_dtor
;
9341 if (TREE_CODE (name
) == TYPE_DECL
)
9342 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
9343 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
9344 if (ctype
== NULL_TREE
)
9346 if (current_class_type
== NULL_TREE
)
9348 error ("destructors must be member functions");
9353 tree t
= constructor_name (current_class_name
);
9360 tree t
= constructor_name (ctype
);
9367 cp_error ("destructor `%T' must match class name `%T'",
9369 TREE_OPERAND (decl
, 0) = rename
;
9375 case ADDR_EXPR
: /* C++ reference declaration */
9380 innermost_code
= TREE_CODE (decl
);
9381 next
= &TREE_OPERAND (decl
, 0);
9385 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
9387 /* This is actually a variable declaration using
9388 constructor syntax. We need to call start_decl and
9389 cp_finish_decl so we can get the variable
9392 tree attributes
, prefix_attributes
;
9394 *next
= TREE_OPERAND (decl
, 0);
9395 init
= CALL_DECLARATOR_PARMS (decl
);
9399 attributes
= TREE_PURPOSE (attrlist
);
9400 prefix_attributes
= TREE_VALUE (attrlist
);
9404 attributes
= NULL_TREE
;
9405 prefix_attributes
= NULL_TREE
;
9408 decl
= start_decl (declarator
, declspecs
, 1,
9409 attributes
, prefix_attributes
);
9410 decl_type_access_control (decl
);
9413 /* Look for __unused__ attribute */
9414 if (TREE_USED (TREE_TYPE (decl
)))
9415 TREE_USED (decl
) = 1;
9416 finish_decl (decl
, init
, NULL_TREE
);
9419 cp_error ("invalid declarator");
9422 innermost_code
= TREE_CODE (decl
);
9423 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
9424 ctype
= current_class_type
;
9426 && TREE_OPERAND (decl
, 0)
9427 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
9428 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
9429 == constructor_name_full (ctype
))
9430 || (DECL_NAME (TREE_OPERAND (decl
, 0))
9431 == constructor_name (ctype
)))))
9432 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9433 next
= &TREE_OPERAND (decl
, 0);
9435 if (ctype
!= NULL_TREE
9436 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
9437 && decl
== constructor_name (ctype
))
9439 return_type
= return_ctor
;
9440 ctor_return_type
= ctype
;
9445 case TEMPLATE_ID_EXPR
:
9447 tree fns
= TREE_OPERAND (decl
, 0);
9449 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9450 fns
= TREE_OPERAND (fns
, 0);
9453 if (TREE_CODE (dname
) == COMPONENT_REF
)
9454 dname
= TREE_OPERAND (dname
, 1);
9455 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9457 my_friendly_assert (is_overloaded_fn (dname
),
9459 dname
= DECL_NAME (get_first_fn (dname
));
9464 case IDENTIFIER_NODE
:
9465 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9472 cp_error ("declarator-id missing; using reserved word `%D'",
9474 name
= IDENTIFIER_POINTER (dname
);
9476 if (! IDENTIFIER_OPNAME_P (dname
)
9477 /* GNU/Linux headers use '__op'. Arrgh. */
9478 || (IDENTIFIER_TYPENAME_P (dname
) && ! TREE_TYPE (dname
)))
9479 name
= IDENTIFIER_POINTER (dname
);
9482 if (IDENTIFIER_TYPENAME_P (dname
))
9484 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9485 flags
= TYPENAME_FLAG
;
9486 ctor_return_type
= TREE_TYPE (dname
);
9487 return_type
= return_conversion
;
9489 name
= operator_name_string (dname
);
9496 /* Perform error checking, and decide on a ctype. */
9497 tree cname
= TREE_OPERAND (decl
, 0);
9498 if (cname
== NULL_TREE
)
9500 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9503 in_namespace
= TREE_OPERAND (decl
, 0);
9504 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9506 else if (! is_aggr_type (cname
, 1))
9507 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9508 /* Must test TREE_OPERAND (decl, 1), in case user gives
9509 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9510 else if (TREE_OPERAND (decl
, 1)
9511 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9513 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9514 || TREE_CODE (cname
) == TEMPLATE_TEMPLATE_PARM
)
9516 cp_error ("`%T::%D' is not a valid declarator", cname
,
9517 TREE_OPERAND (decl
, 1));
9518 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9519 cname
, TREE_OPERAND (decl
, 1));
9520 return void_type_node
;
9522 else if (ctype
== NULL_TREE
)
9524 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9525 TREE_OPERAND (decl
, 0) = ctype
;
9528 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9530 cp_error ("type `%T' is not derived from type `%T'",
9532 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9538 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9539 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9540 == constructor_name_full (ctype
))
9541 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9542 == constructor_name (ctype
))))
9543 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9544 next
= &TREE_OPERAND (decl
, 1);
9548 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9549 && constructor_name (ctype
) == decl
)
9551 return_type
= return_ctor
;
9552 ctor_return_type
= ctype
;
9554 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9555 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9556 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9557 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9559 return_type
= return_dtor
;
9560 ctor_return_type
= ctype
;
9562 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9563 next
= &TREE_OPERAND (decl
, 0);
9574 /* Parse error puts this typespec where
9575 a declarator should go. */
9576 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9577 if (TREE_TYPE (decl
) == current_class_type
)
9578 cp_error (" perhaps you want `%T' for a constructor",
9579 current_class_name
);
9580 dname
= DECL_NAME (decl
);
9581 name
= IDENTIFIER_POINTER (dname
);
9583 /* Avoid giving two errors for this. */
9584 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9586 declspecs
= tree_cons (NULL_TREE
, integer_type_node
, declspecs
);
9592 cp_compiler_error ("`%D' as declarator", decl
);
9593 return 0; /* We used to do a 155 abort here. */
9598 /* A function definition's declarator must have the form of
9599 a function declarator. */
9601 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9604 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9605 && innermost_code
!= CALL_EXPR
9606 && ! (ctype
&& declspecs
== NULL_TREE
))
9608 cp_error ("declaration of `%D' as non-function", dname
);
9609 return void_type_node
;
9612 /* Anything declared one level down from the top level
9613 must be one of the parameters of a function
9614 (because the body is at least two levels down). */
9616 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9617 by not allowing C++ class definitions to specify their parameters
9618 with xdecls (must be spec.d in the parmlist).
9620 Since we now wait to push a class scope until we are sure that
9621 we are in a legitimate method context, we must set oldcname
9622 explicitly (since current_class_name is not yet alive).
9624 We also want to avoid calling this a PARM if it is in a namespace. */
9626 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
9628 struct binding_level
*b
= current_binding_level
;
9629 current_binding_level
= b
->level_chain
;
9630 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9631 decl_context
= PARM
;
9632 current_binding_level
= b
;
9636 name
= decl_context
== PARM
? "parameter" : "type name";
9638 /* Look through the decl specs and record which ones appear.
9639 Some typespecs are defined as built-in typenames.
9640 Others, the ones that are modifiers of other types,
9641 are represented by bits in SPECBITS: set the bits for
9642 the modifiers that appear. Storage class keywords are also in SPECBITS.
9644 If there is a typedef name or a type, store the type in TYPE.
9645 This includes builtin typedefs such as `int'.
9647 Set EXPLICIT_INT if the type is `int' or `char' and did not
9648 come from a user typedef.
9650 Set LONGLONG if `long' is mentioned twice.
9652 For C++, constructors and destructors have their own fast treatment. */
9654 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
9659 /* Certain parse errors slip through. For example,
9660 `int class;' is not caught by the parser. Try
9661 weakly to recover here. */
9662 if (TREE_CODE (spec
) != TREE_LIST
)
9665 id
= TREE_VALUE (spec
);
9667 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9669 if (id
== ridpointers
[(int) RID_INT
]
9670 || id
== ridpointers
[(int) RID_CHAR
]
9671 || id
== ridpointers
[(int) RID_BOOL
]
9672 || id
== ridpointers
[(int) RID_WCHAR
])
9676 if (id
== ridpointers
[(int) RID_BOOL
])
9677 error ("`bool' is now a keyword");
9679 cp_error ("extraneous `%T' ignored", id
);
9683 if (id
== ridpointers
[(int) RID_INT
])
9685 else if (id
== ridpointers
[(int) RID_CHAR
])
9687 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
9691 /* C++ aggregate types. */
9692 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
9695 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
9697 type
= IDENTIFIER_TYPE_VALUE (id
);
9701 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
9703 if (ridpointers
[i
] == id
)
9705 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
9707 if (pedantic
&& ! in_system_header
&& warn_long_long
)
9708 pedwarn ("ISO C++ does not support `long long'");
9710 error ("`long long long' is too long for GCC");
9714 else if (RIDBIT_SETP (i
, specbits
))
9715 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
9716 RIDBIT_SET (i
, specbits
);
9721 /* C++ aggregate types. */
9722 else if (TREE_CODE (id
) == TYPE_DECL
|| TREE_CODE (id
) == TEMPLATE_DECL
)
9725 cp_error ("multiple declarations `%T' and `%T'", type
,
9729 type
= TREE_TYPE (id
);
9730 TREE_VALUE (spec
) = type
;
9735 error ("two or more data types in declaration of `%s'", name
);
9736 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9738 register tree t
= lookup_name (id
, 1);
9739 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
9740 error ("`%s' fails to be a typedef or built in type",
9741 IDENTIFIER_POINTER (id
));
9744 type
= TREE_TYPE (t
);
9746 /* See the code below that used this. */
9747 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
9752 else if (id
!= error_mark_node
)
9753 /* Can't change CLASS nodes into RECORD nodes here! */
9759 typedef_type
= type
;
9761 /* No type at all: default to `int', and set DEFAULTED_INT
9762 because it was not a user-defined typedef. */
9764 if (type
== NULL_TREE
9765 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
9766 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9767 || RIDBIT_SETP (RID_LONG
, specbits
)
9768 || RIDBIT_SETP (RID_SHORT
, specbits
)))
9770 /* These imply 'int'. */
9771 type
= integer_type_node
;
9775 if (type
== NULL_TREE
)
9778 if (return_type
== return_dtor
)
9779 type
= void_type_node
;
9780 else if (return_type
== return_ctor
)
9781 type
= build_pointer_type (ctor_return_type
);
9782 else if (return_type
== return_conversion
)
9783 type
= ctor_return_type
;
9786 /* We handle `main' specially here, because 'main () { }' is so
9787 common. With no options, it is allowed. With -Wreturn-type,
9788 it is a warning. It is only an error with -pedantic-errors. */
9789 int is_main
= (funcdef_flag
9790 && MAIN_NAME_P (dname
)
9791 && ctype
== NULL_TREE
9792 && in_namespace
== NULL_TREE
9793 && current_namespace
== global_namespace
);
9795 if (in_system_header
|| flag_ms_extensions
)
9796 /* Allow it, sigh. */;
9797 else if (pedantic
|| ! is_main
)
9798 cp_pedwarn ("ISO C++ forbids declaration of `%s' with no type",
9800 else if (warn_return_type
)
9801 cp_warning ("ISO C++ forbids declaration of `%s' with no type",
9804 type
= integer_type_node
;
9807 else if (return_type
== return_dtor
)
9809 error ("return type specification for destructor invalid");
9810 type
= void_type_node
;
9812 else if (return_type
== return_ctor
)
9814 error ("return type specification for constructor invalid");
9815 type
= build_pointer_type (ctor_return_type
);
9817 else if (return_type
== return_conversion
)
9819 if (!same_type_p (type
, ctor_return_type
))
9820 cp_error ("operator `%T' declared to return `%T'",
9821 ctor_return_type
, type
);
9823 cp_pedwarn ("return type specified for `operator %T'",
9826 type
= ctor_return_type
;
9831 /* Now process the modifiers that were specified
9832 and check for invalid combinations. */
9834 /* Long double is a special combination. */
9836 if (RIDBIT_SETP (RID_LONG
, specbits
)
9837 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
9839 RIDBIT_RESET (RID_LONG
, specbits
);
9840 type
= build_qualified_type (long_double_type_node
,
9841 CP_TYPE_QUALS (type
));
9844 /* Check all other uses of type modifiers. */
9846 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9847 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9848 || RIDBIT_SETP (RID_LONG
, specbits
)
9849 || RIDBIT_SETP (RID_SHORT
, specbits
))
9853 if (TREE_CODE (type
) == REAL_TYPE
)
9854 error ("short, signed or unsigned invalid for `%s'", name
);
9855 else if (TREE_CODE (type
) != INTEGER_TYPE
)
9856 error ("long, short, signed or unsigned invalid for `%s'", name
);
9857 else if (RIDBIT_SETP (RID_LONG
, specbits
)
9858 && RIDBIT_SETP (RID_SHORT
, specbits
))
9859 error ("long and short specified together for `%s'", name
);
9860 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9861 || RIDBIT_SETP (RID_SHORT
, specbits
))
9863 error ("long or short specified with char for `%s'", name
);
9864 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
9865 || RIDBIT_SETP (RID_SHORT
, specbits
))
9866 && TREE_CODE (type
) == REAL_TYPE
)
9867 error ("long or short specified with floating type for `%s'", name
);
9868 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9869 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
9870 error ("signed and unsigned given together for `%s'", name
);
9874 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
9876 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
9878 if (flag_pedantic_errors
)
9883 /* Discard the type modifiers if they are invalid. */
9886 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
9887 RIDBIT_RESET (RID_SIGNED
, specbits
);
9888 RIDBIT_RESET (RID_LONG
, specbits
);
9889 RIDBIT_RESET (RID_SHORT
, specbits
);
9894 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
9895 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
9897 error ("complex invalid for `%s'", name
);
9898 RIDBIT_RESET (RID_COMPLEX
, specbits
);
9901 /* Decide whether an integer type is signed or not.
9902 Optionally treat bitfields as signed by default. */
9903 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9906 It is implementation-defined whether a plain (neither
9907 explicitly signed or unsigned) char, short, int, or long
9908 bit-field is signed or unsigned.
9910 Naturally, we extend this to long long as well. Note that
9911 this does not include wchar_t. */
9912 || (bitfield
&& !flag_signed_bitfields
9913 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
9914 /* A typedef for plain `int' without `signed' can be
9915 controlled just like plain `int', but a typedef for
9916 `signed int' cannot be so controlled. */
9918 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
9919 && (TREE_CODE (type
) == INTEGER_TYPE
9920 || TREE_CODE (type
) == CHAR_TYPE
)
9921 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
9924 type
= long_long_unsigned_type_node
;
9925 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9926 type
= long_unsigned_type_node
;
9927 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9928 type
= short_unsigned_type_node
;
9929 else if (type
== char_type_node
)
9930 type
= unsigned_char_type_node
;
9931 else if (typedef_decl
)
9932 type
= unsigned_type (type
);
9934 type
= unsigned_type_node
;
9936 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
9937 && type
== char_type_node
)
9938 type
= signed_char_type_node
;
9940 type
= long_long_integer_type_node
;
9941 else if (RIDBIT_SETP (RID_LONG
, specbits
))
9942 type
= long_integer_type_node
;
9943 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
9944 type
= short_integer_type_node
;
9946 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
9948 /* If we just have "complex", it is equivalent to
9949 "complex double", but if any modifiers at all are specified it is
9950 the complex form of TYPE. E.g, "complex short" is
9951 "complex short int". */
9953 if (defaulted_int
&& ! longlong
9954 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
9955 || RIDBIT_SETP (RID_SHORT
, specbits
)
9956 || RIDBIT_SETP (RID_SIGNED
, specbits
)
9957 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
9958 type
= complex_double_type_node
;
9959 else if (type
== integer_type_node
)
9960 type
= complex_integer_type_node
;
9961 else if (type
== float_type_node
)
9962 type
= complex_float_type_node
;
9963 else if (type
== double_type_node
)
9964 type
= complex_double_type_node
;
9965 else if (type
== long_double_type_node
)
9966 type
= complex_long_double_type_node
;
9968 type
= build_complex_type (type
);
9971 if (return_type
== return_conversion
9972 && (RIDBIT_SETP (RID_CONST
, specbits
)
9973 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
9974 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
9975 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
9978 /* Set CONSTP if this declaration is `const', whether by
9979 explicit specification or via a typedef.
9980 Likewise for VOLATILEP. */
9982 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
9984 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
9986 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
9987 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
9988 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
9989 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
9990 type
= cp_build_qualified_type (type
, type_quals
);
9992 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
9993 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
9994 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
9995 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
9996 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
9998 if (RIDBIT_SETP (RID_STATIC
, specbits
))
9999 staticp
= 1 + (decl_context
== FIELD
);
10001 if (virtualp
&& staticp
== 2)
10003 cp_error ("member `%D' cannot be declared both virtual and static",
10007 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
10008 RIDBIT_RESET (RID_FRIEND
, specbits
);
10010 /* Warn if two storage classes are given. Default to `auto'. */
10012 if (RIDBIT_ANY_SET (specbits
))
10014 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
10015 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
10016 if (decl_context
== PARM
&& nclasses
> 0)
10017 error ("storage class specifiers invalid in parameter declarations");
10018 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10020 if (decl_context
== PARM
)
10021 error ("typedef declaration invalid in parameter declaration");
10024 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
10025 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
10028 /* Give error if `virtual' is used outside of class declaration. */
10030 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
10032 error ("virtual outside class declaration");
10036 /* Static anonymous unions are dealt with here. */
10037 if (staticp
&& decl_context
== TYPENAME
10038 && TREE_CODE (declspecs
) == TREE_LIST
10039 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
10040 decl_context
= FIELD
;
10042 /* Warn about storage classes that are invalid for certain
10043 kinds of declarations (parameters, typenames, etc.). */
10046 error ("multiple storage classes in declaration of `%s'", name
);
10047 else if (decl_context
!= NORMAL
&& nclasses
> 0)
10049 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
10050 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
10051 || RIDBIT_SETP (RID_AUTO
, specbits
)))
10053 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10055 else if (decl_context
== FIELD
10056 /* C++ allows static class elements */
10057 && RIDBIT_SETP (RID_STATIC
, specbits
))
10058 /* C++ also allows inlines and signed and unsigned elements,
10059 but in those cases we don't come in here. */
10063 if (decl_context
== FIELD
)
10065 tree tmp
= NULL_TREE
;
10066 register int op
= 0;
10070 /* Avoid trying to get an operand off an identifier node. */
10071 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10074 tmp
= TREE_OPERAND (declarator
, 0);
10075 op
= IDENTIFIER_OPNAME_P (tmp
);
10077 error ("storage class specified for %s `%s'",
10078 op
? "member operator" : "field",
10079 op
? operator_name_string (tmp
) : name
);
10083 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10084 error ("storage class specified for parameter `%s'", name
);
10086 error ("storage class specified for typename");
10088 RIDBIT_RESET (RID_REGISTER
, specbits
);
10089 RIDBIT_RESET (RID_AUTO
, specbits
);
10090 RIDBIT_RESET (RID_EXTERN
, specbits
);
10093 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
10095 if (toplevel_bindings_p ())
10097 /* It's common practice (and completely valid) to have a const
10098 be initialized and declared extern. */
10099 if (!(type_quals
& TYPE_QUAL_CONST
))
10100 warning ("`%s' initialized and declared `extern'", name
);
10103 error ("`%s' has both `extern' and initializer", name
);
10105 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
10106 && ! toplevel_bindings_p ())
10107 error ("nested function `%s' declared `extern'", name
);
10108 else if (toplevel_bindings_p ())
10110 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10111 error ("top-level declaration of `%s' specifies `auto'", name
);
10114 if (nclasses
> 0 && friendp
)
10115 error ("storage class specifiers invalid in friend function declarations");
10117 /* Now figure out the structure of the declarator proper.
10118 Descend through it, creating more complex types, until we reach
10119 the declared identifier (or NULL_TREE, in an absolute declarator). */
10121 inner_attrs
= NULL_TREE
;
10124 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
10125 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
10127 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
10128 an INDIRECT_REF (for *...),
10129 a CALL_EXPR (for ...(...)),
10130 an identifier (for the name being declared)
10131 or a null pointer (for the place in an absolute declarator
10132 where the name was omitted).
10133 For the last two cases, we have just exited the loop.
10135 For C++ it could also be
10136 a SCOPE_REF (for class :: ...). In this case, we have converted
10137 sensible names to types, and those are the values we use to
10138 qualify the member name.
10139 an ADDR_EXPR (for &...),
10140 a BIT_NOT_EXPR (for destructors)
10142 At this point, TYPE is the type of elements of an array,
10143 or for a function to return, or for a pointer to point to.
10144 After this sequence of ifs, TYPE is the type of the
10145 array or function or pointer, and DECLARATOR has had its
10146 outermost layer removed. */
10148 if (type
== error_mark_node
)
10150 if (TREE_CODE (declarator
) == SCOPE_REF
)
10151 declarator
= TREE_OPERAND (declarator
, 1);
10153 declarator
= TREE_OPERAND (declarator
, 0);
10156 if (quals
!= NULL_TREE
10157 && (declarator
== NULL_TREE
10158 || TREE_CODE (declarator
) != SCOPE_REF
))
10160 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
10161 ctype
= TYPE_METHOD_BASETYPE (type
);
10162 if (ctype
!= NULL_TREE
)
10164 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
10165 grok_method_quals (ctype
, dummy
, quals
);
10166 type
= TREE_TYPE (dummy
);
10167 ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
)));
10172 /* See the comment for the TREE_LIST case, below. */
10175 else if (inner_attrs
)
10177 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10178 inner_attrs
= NULL_TREE
;
10181 switch (TREE_CODE (declarator
))
10185 /* We encode a declarator with embedded attributes using
10186 a TREE_LIST. The attributes apply to the declarator
10187 directly inside them, so we have to skip an iteration
10188 before applying them to the type. If the declarator just
10189 inside is the declarator-id, we apply the attrs to the
10191 inner_attrs
= TREE_PURPOSE (declarator
);
10193 declarator
= TREE_VALUE (declarator
);
10199 register tree size
;
10201 size
= TREE_OPERAND (declarator
, 1);
10203 /* VC++ spells a zero-sized array with []. */
10204 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
10205 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10206 size
= integer_zero_node
;
10208 declarator
= TREE_OPERAND (declarator
, 0);
10210 type
= create_array_type_for_decl (dname
, type
, size
);
10219 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
10220 tree inner_decl
= TREE_OPERAND (declarator
, 0);
10222 /* Declaring a function type.
10223 Make sure we have a valid type for the function to return. */
10225 /* We now know that the TYPE_QUALS don't apply to the
10226 decl, but to its return type. */
10227 type_quals
= TYPE_UNQUALIFIED
;
10229 /* Warn about some types functions can't return. */
10231 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10233 error ("`%s' declared as function returning a function", name
);
10234 type
= integer_type_node
;
10236 if (TREE_CODE (type
) == ARRAY_TYPE
)
10238 error ("`%s' declared as function returning an array", name
);
10239 type
= integer_type_node
;
10242 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
10243 inner_decl
= TREE_OPERAND (inner_decl
, 1);
10245 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
10246 inner_decl
= dname
;
10248 /* Pick up type qualifiers which should be applied to `this'. */
10249 quals
= CALL_DECLARATOR_QUALS (declarator
);
10251 /* Pick up the exception specifications. */
10252 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
10254 /* Say it's a definition only for the CALL_EXPR
10255 closest to the identifier. */
10258 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
10259 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
10260 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
10262 if (ctype
== NULL_TREE
10263 && decl_context
== FIELD
10265 && (friendp
== 0 || dname
== current_class_name
))
10266 ctype
= current_class_type
;
10268 if (ctype
&& return_type
== return_conversion
)
10269 TYPE_HAS_CONVERSION (ctype
) = 1;
10270 if (ctype
&& constructor_name (ctype
) == dname
)
10272 /* We are within a class's scope. If our declarator name
10273 is the same as the class name, and we are defining
10274 a function, then it is a constructor/destructor, and
10275 therefore returns a void type. */
10277 if (flags
== DTOR_FLAG
)
10279 /* ISO C++ 12.4/2. A destructor may not be
10280 declared const or volatile. A destructor may
10283 error ("destructor cannot be static member function");
10286 cp_error ("destructors may not be `%s'",
10287 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10290 if (decl_context
== FIELD
)
10292 if (! member_function_or_else (ctype
,
10293 current_class_type
,
10295 return void_type_node
;
10298 else /* It's a constructor. */
10300 if (explicitp
== 1)
10302 /* ISO C++ 12.1. A constructor may not be
10303 declared const or volatile. A constructor may
10304 not be virtual. A constructor may not be
10307 error ("constructor cannot be static member function");
10310 pedwarn ("constructors cannot be declared virtual");
10315 cp_error ("constructors may not be `%s'",
10316 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10320 RID_BIT_TYPE tmp_bits
;
10321 bcopy ((void*)&specbits
, (void*)&tmp_bits
, sizeof (RID_BIT_TYPE
));
10322 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10323 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10324 if (RIDBIT_ANY_SET (tmp_bits
))
10325 error ("return value type specifier for constructor ignored");
10327 type
= build_pointer_type (ctype
);
10328 if (decl_context
== FIELD
)
10330 if (! member_function_or_else (ctype
,
10331 current_class_type
,
10333 return void_type_node
;
10334 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10335 if (return_type
!= return_ctor
)
10339 if (decl_context
== FIELD
)
10345 error ("can't initialize friend function `%s'", name
);
10348 /* Cannot be both friend and virtual. */
10349 error ("virtual functions cannot be friends");
10350 RIDBIT_RESET (RID_FRIEND
, specbits
);
10353 if (decl_context
== NORMAL
)
10354 error ("friend declaration not in class definition");
10355 if (current_function_decl
&& funcdef_flag
)
10356 cp_error ("can't define friend function `%s' in a local class definition",
10360 /* Construct the function type and go to the next
10361 inner layer of declarator. */
10363 declarator
= TREE_OPERAND (declarator
, 0);
10365 /* FIXME: This is where default args should be fully
10368 arg_types
= grokparms (inner_parms
, funcdecl_p
? funcdef_flag
: 0);
10370 if (declarator
&& flags
== DTOR_FLAG
)
10372 /* A destructor declared in the body of a class will
10373 be represented as a BIT_NOT_EXPR. But, we just
10374 want the underlying IDENTIFIER. */
10375 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10376 declarator
= TREE_OPERAND (declarator
, 0);
10378 if (strict_prototype
== 0 && arg_types
== NULL_TREE
)
10379 arg_types
= void_list_node
;
10380 else if (arg_types
== NULL_TREE
10381 || arg_types
!= void_list_node
)
10383 cp_error ("destructors may not have parameters");
10384 arg_types
= void_list_node
;
10385 last_function_parms
= NULL_TREE
;
10389 /* ANSI says that `const int foo ();'
10390 does not make the function foo const. */
10391 type
= build_function_type (type
, arg_types
);
10395 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10396 if (TREE_PURPOSE (t
)
10397 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10399 add_defarg_fn (type
);
10408 /* Filter out pointers-to-references and references-to-references.
10409 We can get these if a TYPE_DECL is used. */
10411 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10413 error ("cannot declare %s to references",
10414 TREE_CODE (declarator
) == ADDR_EXPR
10415 ? "references" : "pointers");
10416 declarator
= TREE_OPERAND (declarator
, 0);
10420 if (TREE_CODE (type
) == OFFSET_TYPE
10421 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10422 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10424 cp_error ("cannot declare pointer to `%#T' member",
10426 type
= TREE_TYPE (type
);
10429 /* Merge any constancy or volatility into the target type
10430 for the pointer. */
10432 /* We now know that the TYPE_QUALS don't apply to the decl,
10433 but to the target of the pointer. */
10434 type_quals
= TYPE_UNQUALIFIED
;
10436 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10438 if (TREE_CODE (type
) == VOID_TYPE
)
10439 error ("invalid type: `void &'");
10441 type
= build_reference_type (type
);
10443 else if (TREE_CODE (type
) == METHOD_TYPE
)
10444 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10446 type
= build_pointer_type (type
);
10448 /* Process a list of type modifier keywords (such as
10449 const or volatile) that were given inside the `*' or `&'. */
10451 if (TREE_TYPE (declarator
))
10453 register tree typemodlist
;
10459 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10460 typemodlist
= TREE_CHAIN (typemodlist
))
10462 tree qualifier
= TREE_VALUE (typemodlist
);
10464 if (qualifier
== ridpointers
[(int) RID_CONST
])
10466 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10468 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10473 error ("invalid type modifier within pointer declarator");
10477 pedwarn ("duplicate `const'");
10479 pedwarn ("duplicate `volatile'");
10481 pedwarn ("duplicate `restrict'");
10483 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10484 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10485 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10486 if (TREE_CODE (declarator
) == ADDR_EXPR
10487 && (constp
|| volatilep
))
10490 pedwarn ("discarding `const' applied to a reference");
10492 pedwarn ("discarding `volatile' applied to a reference");
10493 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10495 type
= cp_build_qualified_type (type
, type_quals
);
10497 declarator
= TREE_OPERAND (declarator
, 0);
10503 /* We have converted type names to NULL_TREE if the
10504 name was bogus, or to a _TYPE node, if not.
10506 The variable CTYPE holds the type we will ultimately
10507 resolve to. The code here just needs to build
10508 up appropriate member types. */
10509 tree sname
= TREE_OPERAND (declarator
, 1);
10512 /* Destructors can have their visibilities changed as well. */
10513 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10514 sname
= TREE_OPERAND (sname
, 0);
10516 if (TREE_COMPLEXITY (declarator
) == 0)
10517 /* This needs to be here, in case we are called
10518 multiple times. */ ;
10519 else if (TREE_COMPLEXITY (declarator
) == -1)
10520 /* Namespace member. */
10521 pop_decl_namespace ();
10522 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10523 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10524 else if (! IS_AGGR_TYPE_CODE
10525 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10527 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10529 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10530 that refer to ctype. They couldn't be resolved earlier
10531 because we hadn't pushed into the class yet.
10532 Example: resolve 'B<T>::type' in
10533 'B<typename B<T>::type> B<T>::f () { }'. */
10534 if (current_template_parms
10535 && uses_template_parms (type
)
10536 && uses_template_parms (current_class_type
))
10538 tree args
= current_template_args ();
10539 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10542 /* This pop_nested_class corresponds to the
10543 push_nested_class used to push into class scope for
10544 parsing the argument list of a function decl, in
10546 pop_nested_class ();
10547 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10550 my_friendly_abort (16);
10552 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10554 /* We had a reference to a global decl, or
10555 perhaps we were given a non-aggregate typedef,
10556 in which case we cleared this out, and should just
10557 keep going as though it wasn't there. */
10558 declarator
= sname
;
10561 ctype
= TREE_OPERAND (declarator
, 0);
10564 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10566 if (CLASSTYPE_TEMPLATE_INFO (t
) &&
10567 !CLASSTYPE_TEMPLATE_SPECIALIZATION (t
))
10568 template_count
+= 1;
10569 t
= TYPE_MAIN_DECL (t
);
10570 if (DECL_LANG_SPECIFIC (t
))
10571 t
= DECL_CONTEXT (t
);
10576 if (sname
== NULL_TREE
)
10579 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10581 /* This is the `standard' use of the scoping operator:
10582 basetype :: member . */
10584 if (ctype
== current_class_type
)
10590 Is this ill-formed? */
10593 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10596 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10598 if (current_class_type
== NULL_TREE
10600 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10601 TYPE_ARG_TYPES (type
));
10604 cp_error ("cannot declare member function `%T::%s' within `%T'",
10605 ctype
, name
, current_class_type
);
10606 return void_type_node
;
10609 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10610 || TYPE_SIZE (complete_type (ctype
)) != NULL_TREE
)
10612 /* Have to move this code elsewhere in this function.
10613 this code is used for i.e., typedef int A::M; M *pm;
10615 It is? How? jason 10/2/94 */
10617 if (current_class_type
)
10619 cp_error ("cannot declare member `%T::%s' within `%T'",
10620 ctype
, name
, current_class_type
);
10621 return void_type_node
;
10623 type
= build_offset_type (ctype
, type
);
10625 else if (uses_template_parms (ctype
))
10627 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10629 = build_cplus_method_type (ctype
, TREE_TYPE (type
),
10630 TYPE_ARG_TYPES (type
));
10634 cp_error ("structure `%T' not yet defined", ctype
);
10635 return error_mark_node
;
10638 declarator
= sname
;
10640 else if (TREE_CODE (sname
) == SCOPE_REF
)
10641 my_friendly_abort (17);
10645 declarator
= TREE_OPERAND (declarator
, 1);
10646 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10647 /* In this case, we will deal with it later. */
10651 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10652 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10653 TYPE_ARG_TYPES (type
));
10655 type
= build_offset_type (ctype
, type
);
10662 declarator
= TREE_OPERAND (declarator
, 0);
10667 case ENUMERAL_TYPE
:
10668 declarator
= NULL_TREE
;
10672 declarator
= NULL_TREE
;
10676 my_friendly_abort (158);
10680 /* See the comment for the TREE_LIST case, above. */
10683 if (! ignore_attrs
)
10684 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10686 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
10688 attrlist
= build_decl_list (NULL_TREE
, inner_attrs
);
10691 /* Now TYPE has the actual type. */
10693 if (explicitp
== 1 || (explicitp
&& friendp
))
10695 /* [dcl.fct.spec] The explicit specifier shall only be used in
10696 declarations of constructors within a class definition. */
10697 error ("only declarations of constructors can be `explicit'");
10701 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10703 if (current_class_name
== NULL_TREE
|| decl_context
== PARM
|| friendp
)
10705 error ("non-member `%s' cannot be declared `mutable'", name
);
10706 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10708 else if (decl_context
== TYPENAME
|| RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10710 error ("non-object member `%s' cannot be declared `mutable'", name
);
10711 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10713 else if (TREE_CODE (type
) == FUNCTION_TYPE
10714 || TREE_CODE (type
) == METHOD_TYPE
)
10716 error ("function `%s' cannot be declared `mutable'", name
);
10717 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10721 error ("static `%s' cannot be declared `mutable'", name
);
10722 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10724 else if (type_quals
& TYPE_QUAL_CONST
)
10726 error ("const `%s' cannot be declared `mutable'", name
);
10727 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10731 if (declarator
== NULL_TREE
10732 || TREE_CODE (declarator
) == IDENTIFIER_NODE
10733 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
10734 && (TREE_CODE (type
) == FUNCTION_TYPE
10735 || TREE_CODE (type
) == METHOD_TYPE
)))
10737 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10739 cp_error ("template-id `%D' used as a declarator", declarator
);
10740 declarator
= dname
;
10743 /* Unexpected declarator format. */
10744 my_friendly_abort (990210);
10746 /* If this is declaring a typedef name, return a TYPE_DECL. */
10748 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
10752 /* Note that the grammar rejects storage classes
10753 in typenames, fields or parameters. */
10754 if (current_lang_name
== lang_name_java
)
10755 TYPE_FOR_JAVA (type
) = 1;
10757 if (decl_context
== FIELD
)
10759 if (declarator
== constructor_name (current_class_type
))
10760 cp_pedwarn ("ISO C++ forbids nested type `%D' with same name as enclosing class",
10762 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10766 /* Make sure this typedef lives as long as its type,
10767 since it might be used as a template parameter. */
10768 if (processing_template_decl
)
10769 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10771 decl
= build_decl (TYPE_DECL
, declarator
, type
);
10774 /* If the user declares "typedef struct {...} foo" then the
10775 struct will have an anonymous name. Fill that name in now.
10776 Nothing can refer to it, so nothing needs know about the name
10778 if (type
!= error_mark_node
10779 && TYPE_NAME (type
)
10780 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
10781 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
10782 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
10784 tree oldname
= TYPE_NAME (type
);
10787 /* Replace the anonymous name with the real name everywhere. */
10788 lookup_tag_reverse (type
, declarator
);
10789 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
10790 if (TYPE_NAME (t
) == oldname
)
10791 TYPE_NAME (t
) = decl
;
10793 if (TYPE_LANG_SPECIFIC (type
))
10794 TYPE_WAS_ANONYMOUS (type
) = 1;
10796 /* If this is a typedef within a template class, the nested
10797 type is a (non-primary) template. The name for the
10798 template needs updating as well. */
10799 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
10800 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
10801 = TYPE_IDENTIFIER (type
);
10803 /* XXX Temporarily set the scope.
10804 When returning, start_decl expects it as NULL_TREE,
10805 and will then then set it using pushdecl. */
10806 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
10807 if (current_class_type
)
10808 DECL_CONTEXT (decl
) = current_class_type
;
10810 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
10812 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
10813 DECL_ASSEMBLER_NAME (decl
)
10814 = get_identifier (build_overload_name (type
, 1, 1));
10815 DECL_CONTEXT (decl
) = NULL_TREE
;
10817 /* FIXME remangle member functions; member functions of a
10818 type with external linkage have external linkage. */
10821 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
10823 cp_error_at ("typedef name may not be class-qualified", decl
);
10828 if (ctype
== NULL_TREE
)
10830 if (TREE_CODE (type
) != METHOD_TYPE
)
10831 cp_error_at ("invalid type qualifier for non-member function type", decl
);
10833 ctype
= TYPE_METHOD_BASETYPE (type
);
10835 if (ctype
!= NULL_TREE
)
10836 grok_method_quals (ctype
, decl
, quals
);
10839 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10840 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
10841 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
10843 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
10844 inlinep
, friendp
, raises
!= NULL_TREE
);
10847 error ("typedef declaration includes an initializer");
10852 /* Detect the case of an array type of unspecified size
10853 which came, as such, direct from a typedef name.
10854 We must copy the type, so that each identifier gets
10855 a distinct type, so that each identifier's size can be
10856 controlled separately by its own initializer. */
10858 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
10859 && TYPE_DOMAIN (type
) == NULL_TREE
)
10861 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
10864 /* If this is a type name (such as, in a cast or sizeof),
10865 compute the type and return it now. */
10867 if (decl_context
== TYPENAME
)
10869 /* Note that the grammar rejects storage classes
10870 in typenames, fields or parameters. */
10871 if (type_quals
!= TYPE_UNQUALIFIED
)
10872 type_quals
= TYPE_UNQUALIFIED
;
10874 /* Special case: "friend class foo" looks like a TYPENAME context. */
10877 if (type_quals
!= TYPE_UNQUALIFIED
)
10879 cp_error ("type qualifiers specified for friend class declaration");
10880 type_quals
= TYPE_UNQUALIFIED
;
10884 cp_error ("`inline' specified for friend class declaration");
10888 /* Only try to do this stuff if we didn't already give up. */
10889 if (type
!= integer_type_node
)
10891 /* A friendly class? */
10892 if (current_class_type
)
10893 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
10895 error ("trying to make class `%s' a friend of global scope",
10896 TYPE_NAME_STRING (type
));
10897 type
= void_type_node
;
10902 if (ctype
== NULL_TREE
)
10904 if (TREE_CODE (type
) != METHOD_TYPE
)
10905 cp_error ("invalid qualifiers on non-member function type");
10907 ctype
= TYPE_METHOD_BASETYPE (type
);
10911 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
10912 grok_method_quals (ctype
, dummy
, quals
);
10913 type
= TREE_TYPE (dummy
);
10919 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
10920 && decl_context
!= CATCHPARM
10921 && TREE_CODE (type
) != UNION_TYPE
10924 cp_error ("abstract declarator `%T' used as declaration", type
);
10925 declarator
= make_anon_name ();
10928 /* `void' at top level (not within pointer)
10929 is allowed only in typedefs or type names.
10930 We don't complain about parms either, but that is because
10931 a better error message can be made later. */
10933 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
10936 error ("unnamed variable or field declared void");
10937 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10939 if (IDENTIFIER_OPNAME_P (declarator
))
10940 my_friendly_abort (356);
10942 error ("variable or field `%s' declared void", name
);
10945 error ("variable or field declared void");
10946 type
= integer_type_node
;
10949 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
10950 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
10952 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10954 if (ctype
|| in_namespace
)
10955 error ("cannot use `::' in parameter declaration");
10957 /* A parameter declared as an array of T is really a pointer to T.
10958 One declared as a function is really a pointer to a function.
10959 One declared as a member is really a pointer to member. */
10961 if (TREE_CODE (type
) == ARRAY_TYPE
)
10963 /* Transfer const-ness of array into that of type pointed to. */
10964 type
= build_pointer_type (TREE_TYPE (type
));
10965 type_quals
= TYPE_UNQUALIFIED
;
10967 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10968 type
= build_pointer_type (type
);
10969 else if (TREE_CODE (type
) == OFFSET_TYPE
)
10970 type
= build_pointer_type (type
);
10971 else if (TREE_CODE (type
) == VOID_TYPE
&& declarator
)
10973 error ("declaration of `%s' as void", name
);
10979 register tree decl
;
10981 if (decl_context
== PARM
)
10983 decl
= build_decl (PARM_DECL
, declarator
, type
);
10985 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
10986 inlinep
, friendp
, raises
!= NULL_TREE
);
10988 /* Compute the type actually passed in the parmlist,
10989 for the case where there is no prototype.
10990 (For example, shorts and chars are passed as ints.)
10991 When there is a prototype, this is overridden later. */
10993 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
10995 else if (decl_context
== FIELD
)
10997 if (type
== error_mark_node
)
10999 /* Happens when declaring arrays of sizes which
11000 are error_mark_node, for example. */
11003 else if (in_namespace
&& !friendp
)
11005 /* Something like struct S { int N::j; }; */
11006 cp_error ("invalid use of `::'");
11009 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11012 tree function_context
;
11014 /* We catch the others as conflicts with the builtin
11016 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
11018 cp_error ("function `%D' cannot be declared friend",
11025 if (ctype
== NULL_TREE
)
11026 ctype
= current_class_type
;
11028 if (ctype
== NULL_TREE
)
11030 cp_error ("can't make `%D' into a method -- not in a class",
11032 return void_type_node
;
11035 /* ``A union may [ ... ] not [ have ] virtual functions.''
11037 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
11039 cp_error ("function `%D' declared virtual inside a union",
11041 return void_type_node
;
11044 if (declarator
== ansi_opname
[(int) NEW_EXPR
]
11045 || declarator
== ansi_opname
[(int) VEC_NEW_EXPR
]
11046 || declarator
== ansi_opname
[(int) DELETE_EXPR
]
11047 || declarator
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11051 cp_error ("`%D' cannot be declared virtual, since it is always static",
11056 else if (staticp
< 2)
11057 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11058 TYPE_ARG_TYPES (type
));
11061 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
11062 function_context
= (ctype
!= NULL_TREE
) ?
11063 decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
11064 publicp
= (! friendp
|| ! staticp
)
11065 && function_context
== NULL_TREE
;
11066 decl
= grokfndecl (ctype
, type
,
11067 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
11068 ? declarator
: dname
,
11070 virtualp
, flags
, quals
, raises
,
11071 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
11072 funcdef_flag
, template_count
, in_namespace
);
11073 if (decl
== NULL_TREE
)
11076 /* This clobbers the attrs stored in `decl' from `attrlist'. */
11077 /* The decl and setting of decl_machine_attr is also turned off. */
11078 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
11081 /* [class.conv.ctor]
11083 A constructor declared without the function-specifier
11084 explicit that can be called with a single parameter
11085 specifies a conversion from the type of its first
11086 parameter to the type of its class. Such a constructor
11087 is called a converting constructor. */
11088 if (explicitp
== 2)
11089 DECL_NONCONVERTING_P (decl
) = 1;
11090 else if (DECL_CONSTRUCTOR_P (decl
))
11092 /* The constructor can be called with exactly one
11093 parameter if there is at least one parameter, and
11094 any subsequent parameters have default arguments.
11095 We don't look at the first parameter, which is
11096 really just the `this' parameter for the new
11099 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
11101 /* Skip the `in_chrg' argument too, if present. */
11102 if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (decl
)))
11103 arg_types
= TREE_CHAIN (arg_types
);
11105 if (arg_types
== void_list_node
11107 && TREE_CHAIN (arg_types
)
11108 && TREE_CHAIN (arg_types
) != void_list_node
11109 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
11110 DECL_NONCONVERTING_P (decl
) = 1;
11113 else if (TREE_CODE (type
) == METHOD_TYPE
)
11115 /* We only get here for friend declarations of
11116 members of other classes. */
11117 /* All method decls are public, so tell grokfndecl to set
11118 TREE_PUBLIC, also. */
11119 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
11120 virtualp
, flags
, quals
, raises
,
11121 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
11122 template_count
, in_namespace
);
11123 if (decl
== NULL_TREE
)
11126 else if (!staticp
&& ! processing_template_decl
11127 && TYPE_SIZE (complete_type (type
)) == NULL_TREE
11128 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
11131 cp_error ("field `%D' has incomplete type", declarator
);
11133 cp_error ("name `%T' has incomplete type", type
);
11135 /* If we're instantiating a template, tell them which
11136 instantiation made the field's type be incomplete. */
11137 if (current_class_type
11138 && TYPE_NAME (current_class_type
)
11139 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
11140 && declspecs
&& TREE_VALUE (declspecs
)
11141 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
11142 cp_error (" in instantiation of template `%T'",
11143 current_class_type
);
11145 type
= error_mark_node
;
11152 error ("`%s' is neither function nor member function; cannot be declared friend",
11153 IDENTIFIER_POINTER (declarator
));
11161 /* Friends are treated specially. */
11162 if (ctype
== current_class_type
)
11163 warning ("member functions are implicitly friends of their class");
11166 tree t
= NULL_TREE
;
11167 if (decl
&& DECL_NAME (decl
))
11169 if (template_class_depth (current_class_type
) == 0)
11172 = check_explicit_specialization
11174 template_count
, 2 * (funcdef_flag
!= 0) + 4);
11175 if (decl
== error_mark_node
)
11176 return error_mark_node
;
11179 t
= do_friend (ctype
, declarator
, decl
,
11180 last_function_parms
, attrlist
, flags
, quals
,
11183 if (t
&& funcdef_flag
)
11186 return void_type_node
;
11190 /* Structure field. It may not be a function, except for C++ */
11192 if (decl
== NULL_TREE
)
11198 /* An attempt is being made to initialize a non-static
11199 member. But, from [class.mem]:
11201 4 A member-declarator can contain a
11202 constant-initializer only if it declares a static
11203 member (_class.static_) of integral or enumeration
11204 type, see _class.static.data_.
11206 This used to be relatively common practice, but
11207 the rest of the compiler does not correctly
11208 handle the initialization unless the member is
11209 static so we make it static below. */
11210 cp_pedwarn ("ISO C++ forbids initialization of member `%D'",
11212 cp_pedwarn ("making `%D' static", declarator
);
11216 if (uses_template_parms (type
))
11217 /* We'll check at instantiation time. */
11219 else if (check_static_variable_definition (declarator
,
11221 /* If we just return the declaration, crashes
11222 will sometimes occur. We therefore return
11223 void_type_node, as if this was a friend
11224 declaration, to cause callers to completely
11225 ignore this declaration. */
11226 return void_type_node
;
11229 /* 9.2p13 [class.mem] */
11230 if (declarator
== constructor_name (current_class_type
)
11231 /* Divergence from the standard: In extern "C", we
11232 allow non-static data members here, because C does
11233 and /usr/include/netinet/in.h uses that. */
11234 && (staticp
|| ! in_system_header
))
11235 cp_pedwarn ("ISO C++ forbids data member `%D' with same name as enclosing class",
11240 /* C++ allows static class members. All other work
11241 for this is done by grokfield. */
11242 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
11243 TREE_STATIC (decl
) = 1;
11244 /* In class context, 'static' means public access. */
11245 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
11249 decl
= build_lang_decl (FIELD_DECL
, declarator
, type
);
11250 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11252 DECL_MUTABLE_P (decl
) = 1;
11253 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11257 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
11258 inlinep
, friendp
, raises
!= NULL_TREE
);
11261 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11263 tree original_name
;
11269 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11270 original_name
= dname
;
11272 original_name
= declarator
;
11274 if (RIDBIT_SETP (RID_AUTO
, specbits
))
11275 error ("storage class `auto' invalid for function `%s'", name
);
11276 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11277 error ("storage class `register' invalid for function `%s'", name
);
11279 /* Function declaration not at top level.
11280 Storage classes other than `extern' are not allowed
11281 and `extern' makes no difference. */
11282 if (! toplevel_bindings_p ()
11283 && (RIDBIT_SETP (RID_STATIC
, specbits
)
11284 || RIDBIT_SETP (RID_INLINE
, specbits
))
11287 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11288 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
11290 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
11293 if (ctype
== NULL_TREE
)
11297 error ("virtual non-class function `%s'", name
);
11301 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
11302 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11303 TYPE_ARG_TYPES (type
));
11305 /* Record presence of `static'. */
11306 publicp
= (ctype
!= NULL_TREE
11307 || RIDBIT_SETP (RID_EXTERN
, specbits
)
11308 || !RIDBIT_SETP (RID_STATIC
, specbits
));
11310 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
11311 virtualp
, flags
, quals
, raises
,
11313 publicp
, inlinep
, funcdef_flag
,
11314 template_count
, in_namespace
);
11315 if (decl
== NULL_TREE
)
11320 int illegal_static
= 0;
11322 /* Don't allow a static member function in a class, and forbid
11323 declaring main to be static. */
11324 if (TREE_CODE (type
) == METHOD_TYPE
)
11326 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11327 illegal_static
= 1;
11329 else if (current_function_decl
)
11331 /* FIXME need arm citation */
11332 error ("cannot declare static function inside another function");
11333 illegal_static
= 1;
11336 if (illegal_static
)
11339 RIDBIT_RESET (RID_STATIC
, specbits
);
11345 /* It's a variable. */
11347 /* An uninitialized decl with `extern' is a reference. */
11348 decl
= grokvardecl (type
, declarator
, &specbits
,
11350 (type_quals
& TYPE_QUAL_CONST
) != 0,
11352 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11353 inlinep
, friendp
, raises
!= NULL_TREE
);
11357 DECL_CONTEXT (decl
) = ctype
;
11360 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11362 RIDBIT_RESET (RID_STATIC
, specbits
);
11364 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11366 cp_error ("static member `%D' declared `register'", decl
);
11367 RIDBIT_RESET (RID_REGISTER
, specbits
);
11369 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11371 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11373 RIDBIT_RESET (RID_EXTERN
, specbits
);
11378 my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE
, specbits
), 19990927);
11380 /* Record `register' declaration for warnings on &
11381 and in case doing stupid register allocation. */
11383 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11384 DECL_REGISTER (decl
) = 1;
11386 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11387 DECL_THIS_EXTERN (decl
) = 1;
11389 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11390 DECL_THIS_STATIC (decl
) = 1;
11392 /* Record constancy and volatility. There's no need to do this
11393 when processing a template; we'll do this for the instantiated
11394 declaration based on the type of DECL. */
11395 if (!processing_template_decl
)
11396 c_apply_type_quals_to_decl (type_quals
, decl
);
11402 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11403 An empty exprlist is a parmlist. An exprlist which
11404 contains only identifiers at the global level
11405 is a parmlist. Otherwise, it is an exprlist. */
11408 parmlist_is_exprlist (exprs
)
11411 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11414 if (toplevel_bindings_p ())
11416 /* At the global level, if these are all identifiers,
11417 then it is a parmlist. */
11420 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11422 exprs
= TREE_CHAIN (exprs
);
11429 /* Subroutine of start_function. Ensure that each of the parameter
11430 types (as listed in PARMS) is complete, as is required for a
11431 function definition. */
11434 require_complete_types_for_parms (parms
)
11437 for (; parms
; parms
= TREE_CHAIN (parms
))
11439 tree type
= TREE_TYPE (parms
);
11441 /* Try to complete the TYPE. */
11442 type
= complete_type (type
);
11444 if (type
== error_mark_node
)
11447 if (TYPE_SIZE (type
) == NULL_TREE
)
11449 if (DECL_NAME (parms
))
11450 error ("parameter `%s' has incomplete type",
11451 IDENTIFIER_POINTER (DECL_NAME (parms
)));
11453 error ("parameter has incomplete type");
11454 TREE_TYPE (parms
) = error_mark_node
;
11457 layout_decl (parms
, 0);
11461 /* Returns non-zero if T is a local variable. */
11464 local_variable_p (t
)
11467 if ((TREE_CODE (t
) == VAR_DECL
11468 /* A VAR_DECL with a context that is a _TYPE is a static data
11470 && !TYPE_P (CP_DECL_CONTEXT (t
))
11471 /* Any other non-local variable must be at namespace scope. */
11472 && !DECL_NAMESPACE_SCOPE_P (t
))
11473 || (TREE_CODE (t
) == PARM_DECL
))
11479 /* Returns non-zero if T is an automatic local variable or a label.
11480 (These are the declarations that need to be remapped when the code
11481 containing them is duplicated.) */
11484 nonstatic_local_decl_p (t
)
11487 return ((local_variable_p (t
) && !TREE_STATIC (t
))
11488 || TREE_CODE (t
) == LABEL_DECL
11489 || TREE_CODE (t
) == RESULT_DECL
);
11492 /* Like local_variable_p, but suitable for use as a tree-walking
11496 local_variable_p_walkfn (tp
, walk_subtrees
, data
)
11498 int *walk_subtrees ATTRIBUTE_UNUSED
;
11499 void *data ATTRIBUTE_UNUSED
;
11501 return ((local_variable_p (*tp
) && !DECL_ARTIFICIAL (*tp
))
11502 ? *tp
: NULL_TREE
);
11505 /* Check that ARG, which is a default-argument expression for a
11506 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11507 something goes wrong. DECL may also be a _TYPE node, rather than a
11508 DECL, if there is no DECL available. */
11511 check_default_argument (decl
, arg
)
11518 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11519 /* We get a DEFAULT_ARG when looking at an in-class declaration
11520 with a default argument. Ignore the argument for now; we'll
11521 deal with it after the class is complete. */
11524 if (processing_template_decl
|| uses_template_parms (arg
))
11525 /* We don't do anything checking until instantiation-time. Note
11526 that there may be uninstantiated arguments even for an
11527 instantiated function, since default arguments are not
11528 instantiated until they are needed. */
11537 decl_type
= TREE_TYPE (decl
);
11539 if (arg
== error_mark_node
11540 || decl
== error_mark_node
11541 || TREE_TYPE (arg
) == error_mark_node
11542 || decl_type
== error_mark_node
)
11543 /* Something already went wrong. There's no need to check
11545 return error_mark_node
;
11547 /* [dcl.fct.default]
11549 A default argument expression is implicitly converted to the
11551 if (!TREE_TYPE (arg
)
11552 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11555 cp_error ("default argument for `%#D' has type `%T'",
11556 decl
, TREE_TYPE (arg
));
11558 cp_error ("default argument for parameter of type `%T' has type `%T'",
11559 decl_type
, TREE_TYPE (arg
));
11561 return error_mark_node
;
11564 /* [dcl.fct.default]
11566 Local variables shall not be used in default argument
11569 The keyword `this' shall not be used in a default argument of a
11570 member function. */
11571 var
= walk_tree (&arg
, local_variable_p_walkfn
, NULL
);
11574 cp_error ("default argument `%E' uses local variable `%D'",
11576 return error_mark_node
;
11583 /* Decode the list of parameter types for a function type.
11584 Given the list of things declared inside the parens,
11585 return a list of types.
11587 The list we receive can have three kinds of elements:
11588 an IDENTIFIER_NODE for names given without types,
11589 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11590 or void_type_node, to mark the end of an argument list
11591 when additional arguments are not permitted (... was not used).
11593 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11594 a mere declaration. A nonempty identifier-list gets an error message
11595 when FUNCDEF_FLAG is zero.
11596 If FUNCDEF_FLAG is 1, then parameter types must be complete.
11597 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11599 If all elements of the input list contain types,
11600 we return a list of the types.
11601 If all elements contain no type (except perhaps a void_type_node
11602 at the end), we return a null list.
11603 If some have types and some do not, it is an error, and we
11604 return a null list.
11606 Also set last_function_parms to either
11607 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11608 A list of names is converted to a chain of PARM_DECLs
11609 by store_parm_decls so that ultimately it is always a chain of decls.
11611 Note that in C++, parameters can take default values. These default
11612 values are in the TREE_PURPOSE field of the TREE_LIST. It is
11613 an error to specify default values which are followed by parameters
11614 that have no default values, or an ELLIPSES. For simplicities sake,
11615 only parameters which are specified with their types can take on
11619 grokparms (first_parm
, funcdef_flag
)
11623 tree result
= NULL_TREE
;
11624 tree decls
= NULL_TREE
;
11626 if (first_parm
!= NULL_TREE
11627 && TREE_CODE (TREE_VALUE (first_parm
)) == IDENTIFIER_NODE
)
11629 if (! funcdef_flag
)
11630 pedwarn ("parameter names (without types) in function declaration");
11631 last_function_parms
= first_parm
;
11634 else if (first_parm
!= NULL_TREE
11635 && TREE_CODE (TREE_VALUE (first_parm
)) != TREE_LIST
11636 && TREE_CODE (TREE_VALUE (first_parm
)) != VOID_TYPE
)
11637 my_friendly_abort (145);
11640 /* Types were specified. This is a list of declarators
11641 each represented as a TREE_LIST node. */
11642 register tree parm
, chain
;
11643 int any_init
= 0, any_error
= 0;
11645 if (first_parm
!= NULL_TREE
)
11647 tree last_result
= NULL_TREE
;
11648 tree last_decl
= NULL_TREE
;
11650 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11652 tree type
= NULL_TREE
, list_node
= parm
;
11653 register tree decl
= TREE_VALUE (parm
);
11654 tree init
= TREE_PURPOSE (parm
);
11656 chain
= TREE_CHAIN (parm
);
11657 /* @@ weak defense against parse errors. */
11658 if (TREE_CODE (decl
) != VOID_TYPE
11659 && TREE_CODE (decl
) != TREE_LIST
)
11661 /* Give various messages as the need arises. */
11662 if (TREE_CODE (decl
) == STRING_CST
)
11663 cp_error ("invalid string constant `%E'", decl
);
11664 else if (TREE_CODE (decl
) == INTEGER_CST
)
11665 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11669 if (TREE_CODE (decl
) != VOID_TYPE
)
11671 decl
= grokdeclarator (TREE_VALUE (decl
),
11672 TREE_PURPOSE (decl
),
11673 PARM
, init
!= NULL_TREE
,
11675 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
11678 /* Top-level qualifiers on the parameters are
11679 ignored for function types. */
11680 type
= TYPE_MAIN_VARIANT (TREE_TYPE (decl
));
11682 if (TREE_CODE (type
) == VOID_TYPE
)
11683 decl
= void_type_node
;
11684 else if (TREE_CODE (type
) == METHOD_TYPE
)
11686 if (DECL_NAME (decl
))
11687 /* Cannot use the decl here because
11688 we don't have DECL_CONTEXT set up yet. */
11689 cp_error ("parameter `%D' invalidly declared method type",
11692 error ("parameter invalidly declared method type");
11693 type
= build_pointer_type (type
);
11694 TREE_TYPE (decl
) = type
;
11696 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11698 if (DECL_NAME (decl
))
11699 cp_error ("parameter `%D' invalidly declared offset type",
11702 error ("parameter invalidly declared offset type");
11703 type
= build_pointer_type (type
);
11704 TREE_TYPE (decl
) = type
;
11706 else if (abstract_virtuals_error (decl
, type
))
11707 any_error
= 1; /* Seems like a good idea. */
11708 else if (POINTER_TYPE_P (type
))
11711 while (POINTER_TYPE_P (t
)
11712 || (TREE_CODE (t
) == ARRAY_TYPE
11713 && TYPE_DOMAIN (t
) != NULL_TREE
))
11715 if (TREE_CODE (t
) == ARRAY_TYPE
)
11716 cp_error ("parameter type `%T' includes %s to array of unknown bound",
11718 TYPE_PTR_P (type
) ? "pointer" : "reference");
11722 if (TREE_CODE (decl
) == VOID_TYPE
)
11724 if (result
== NULL_TREE
)
11726 result
= void_list_node
;
11727 last_result
= result
;
11731 TREE_CHAIN (last_result
) = void_list_node
;
11732 last_result
= void_list_node
;
11735 && (chain
!= void_list_node
|| TREE_CHAIN (chain
)))
11736 error ("`void' in parameter list must be entire list");
11740 /* Since there is a prototype, args are passed in their own types. */
11741 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
11742 if (PROMOTE_PROTOTYPES
11743 && (TREE_CODE (type
) == INTEGER_TYPE
11744 || TREE_CODE (type
) == ENUMERAL_TYPE
)
11745 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
11746 DECL_ARG_TYPE (decl
) = integer_type_node
;
11747 if (!any_error
&& init
)
11750 init
= check_default_argument (decl
, init
);
11755 if (decls
== NULL_TREE
)
11762 TREE_CHAIN (last_decl
) = decl
;
11765 list_node
= tree_cons (init
, type
, NULL_TREE
);
11766 if (result
== NULL_TREE
)
11768 result
= list_node
;
11769 last_result
= result
;
11773 TREE_CHAIN (last_result
) = list_node
;
11774 last_result
= list_node
;
11778 TREE_CHAIN (last_result
) = NULL_TREE
;
11779 /* If there are no parameters, and the function does not end
11780 with `...', then last_decl will be NULL_TREE. */
11781 if (last_decl
!= NULL_TREE
)
11782 TREE_CHAIN (last_decl
) = NULL_TREE
;
11786 last_function_parms
= decls
;
11791 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
11792 FUNCTION_TYPE with the newly parsed version of its default argument, which
11793 was previously digested as text. See snarf_defarg et al in lex.c. */
11796 replace_defarg (arg
, init
)
11799 if (! processing_template_decl
11800 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
11801 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
11802 TREE_TYPE (init
), TREE_VALUE (arg
));
11803 TREE_PURPOSE (arg
) = init
;
11806 /* D is a constructor or overloaded `operator='. Returns non-zero if
11807 D's arguments allow it to be a copy constructor, or copy assignment
11816 if (!DECL_FUNCTION_MEMBER_P (d
))
11819 t
= FUNCTION_ARG_CHAIN (d
);
11820 if (DECL_CONSTRUCTOR_P (d
)
11821 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (d
)))
11822 t
= TREE_CHAIN (t
);
11823 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
11824 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
11825 == DECL_CONTEXT (d
))
11826 && (TREE_CHAIN (t
) == NULL_TREE
11827 || TREE_CHAIN (t
) == void_list_node
11828 || TREE_PURPOSE (TREE_CHAIN (t
))))
11833 /* These memoizing functions keep track of special properties which
11834 a class may have. `grok_ctor_properties' notices whether a class
11835 has a constructor of the form X(X&), and also complains
11836 if the class has a constructor of the form X(X).
11837 `grok_op_properties' takes notice of the various forms of
11838 operator= which are defined, as well as what sorts of type conversion
11839 may apply. Both functions take a FUNCTION_DECL as an argument. */
11842 grok_ctor_properties (ctype
, decl
)
11845 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
11846 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
11848 /* When a type has virtual baseclasses, a magical first int argument is
11849 added to any ctor so we can tell if the class has been initialized
11850 yet. This could screw things up in this function, so we deliberately
11851 ignore the leading int if we're in that situation. */
11852 if (TYPE_USES_VIRTUAL_BASECLASSES (ctype
))
11854 my_friendly_assert (parmtypes
11855 && TREE_VALUE (parmtypes
) == integer_type_node
,
11857 parmtypes
= TREE_CHAIN (parmtypes
);
11858 parmtype
= TREE_VALUE (parmtypes
);
11863 A non-template constructor for class X is a copy constructor if
11864 its first parameter is of type X&, const X&, volatile X& or const
11865 volatile X&, and either there are no other parameters or else all
11866 other parameters have default arguments. */
11867 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
11868 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
11869 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11870 || TREE_CHAIN (parmtypes
) == void_list_node
11871 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11872 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11873 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11875 TYPE_HAS_INIT_REF (ctype
) = 1;
11876 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11877 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
11881 A declaration of a constructor for a class X is ill-formed if its
11882 first parameter is of type (optionally cv-qualified) X and either
11883 there are no other parameters or else all other parameters have
11886 We *don't* complain about member template instantiations that
11887 have this form, though; they can occur as we try to decide what
11888 constructor to use during overload resolution. Since overload
11889 resolution will never prefer such a constructor to the
11890 non-template copy constructor (which is either explicitly or
11891 implicitly defined), there's no need to worry about their
11892 existence. Theoretically, they should never even be
11893 instantiated, but that's hard to forestall. */
11894 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
11895 && (TREE_CHAIN (parmtypes
) == NULL_TREE
11896 || TREE_CHAIN (parmtypes
) == void_list_node
11897 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
11898 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11899 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11901 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
11903 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
11906 else if (TREE_CODE (parmtype
) == VOID_TYPE
11907 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
11908 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
11913 /* An operator with this name can be either unary or binary. */
11919 return (name
== ansi_opname
[(int) INDIRECT_REF
]
11920 || name
== ansi_opname
[(int) ADDR_EXPR
]
11921 || name
== ansi_opname
[(int) NEGATE_EXPR
]
11922 || name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
11923 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]
11924 || name
== ansi_opname
[(int) CONVERT_EXPR
]);
11927 /* An operator with this name can only be unary. */
11933 return (name
== ansi_opname
[(int) TRUTH_NOT_EXPR
]
11934 || name
== ansi_opname
[(int) BIT_NOT_EXPR
]
11935 || name
== ansi_opname
[(int) COMPONENT_REF
]
11936 || IDENTIFIER_TYPENAME_P (name
));
11939 /* Do a little sanity-checking on how they declared their operator. */
11942 grok_op_properties (decl
, virtualp
, friendp
)
11944 int virtualp
, friendp
;
11946 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
11947 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
11948 tree name
= DECL_NAME (decl
);
11950 if (current_class_type
== NULL_TREE
)
11957 A user-declared copy assignment operator X::operator= is a
11958 non-static non-template member function of class X with
11959 exactly one parameter of type X, X&, const X&, volatile X& or
11960 const volatile X&. */
11961 if (name
== ansi_opname
[(int) MODIFY_EXPR
]
11962 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11963 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11965 else if (name
== ansi_opname
[(int) CALL_EXPR
])
11966 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
11967 else if (name
== ansi_opname
[(int) ARRAY_REF
])
11968 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
11969 else if (name
== ansi_opname
[(int) COMPONENT_REF
]
11970 || name
== ansi_opname
[(int) MEMBER_REF
])
11971 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
11972 else if (name
== ansi_opname
[(int) NEW_EXPR
])
11973 TYPE_HAS_NEW_OPERATOR (current_class_type
) = 1;
11974 else if (name
== ansi_opname
[(int) DELETE_EXPR
])
11975 TYPE_GETS_DELETE (current_class_type
) |= 1;
11976 else if (name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11977 TYPE_HAS_ARRAY_NEW_OPERATOR (current_class_type
) = 1;
11978 else if (name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
11979 TYPE_GETS_DELETE (current_class_type
) |= 2;
11982 if (name
== ansi_opname
[(int) NEW_EXPR
]
11983 || name
== ansi_opname
[(int) VEC_NEW_EXPR
])
11985 /* When the compiler encounters the definition of A::operator new, it
11986 doesn't look at the class declaration to find out if it's static. */
11988 revert_static_member_fn (&decl
, NULL
, NULL
);
11990 /* Take care of function decl if we had syntax errors. */
11991 if (argtypes
== NULL_TREE
)
11993 = build_function_type (ptr_type_node
,
11994 hash_tree_chain (integer_type_node
,
11997 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
11999 else if (name
== ansi_opname
[(int) DELETE_EXPR
]
12000 || name
== ansi_opname
[(int) VEC_DELETE_EXPR
])
12003 revert_static_member_fn (&decl
, NULL
, NULL
);
12005 if (argtypes
== NULL_TREE
)
12007 = build_function_type (void_type_node
,
12008 hash_tree_chain (ptr_type_node
,
12011 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
12015 /* An operator function must either be a non-static member function
12016 or have at least one parameter of a class, a reference to a class,
12017 an enumeration, or a reference to an enumeration. 13.4.0.6 */
12018 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
12020 if (IDENTIFIER_TYPENAME_P (name
)
12021 || name
== ansi_opname
[(int) CALL_EXPR
]
12022 || name
== ansi_opname
[(int) MODIFY_EXPR
]
12023 || name
== ansi_opname
[(int) COMPONENT_REF
]
12024 || name
== ansi_opname
[(int) ARRAY_REF
])
12025 cp_error ("`%D' must be a nonstatic member function", decl
);
12030 if (DECL_STATIC_FUNCTION_P (decl
))
12031 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
12034 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
12036 tree arg
= TREE_VALUE (p
);
12037 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
12038 arg
= TREE_TYPE (arg
);
12040 /* This lets bad template code slip through. */
12041 if (IS_AGGR_TYPE (arg
)
12042 || TREE_CODE (arg
) == ENUMERAL_TYPE
12043 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
12044 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
12048 ("`%D' must have an argument of class or enumerated type",
12055 if (name
== ansi_opname
[(int) CALL_EXPR
])
12056 return; /* No restrictions on args. */
12058 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
12060 tree t
= TREE_TYPE (name
);
12063 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
12064 const char *what
= 0;
12067 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
12069 if (TREE_CODE (t
) == VOID_TYPE
)
12071 else if (t
== current_class_type
)
12072 what
= "the same type";
12073 /* Don't force t to be complete here. */
12074 else if (IS_AGGR_TYPE (t
)
12076 && DERIVED_FROM_P (t
, current_class_type
))
12077 what
= "a base class";
12080 warning ("conversion to %s%s will never use a type conversion operator",
12081 ref
? "a reference to " : "", what
);
12085 if (name
== ansi_opname
[(int) MODIFY_EXPR
])
12089 if (list_length (argtypes
) != 3 && methodp
)
12091 cp_error ("`%D' must take exactly one argument", decl
);
12094 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
12096 if (copy_assignment_arg_p (parmtype
, virtualp
)
12099 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
12100 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
12101 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12102 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
12105 else if (name
== ansi_opname
[(int) COND_EXPR
])
12108 cp_error ("ISO C++ prohibits overloading operator ?:");
12110 else if (ambi_op_p (name
))
12112 if (list_length (argtypes
) == 2)
12114 else if (list_length (argtypes
) == 3)
12116 if ((name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
12117 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
12118 && ! processing_template_decl
12119 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
12122 cp_error ("postfix `%D' must take `int' as its argument",
12126 ("postfix `%D' must take `int' as its second argument",
12133 cp_error ("`%D' must take either zero or one argument", decl
);
12135 cp_error ("`%D' must take either one or two arguments", decl
);
12138 /* More Effective C++ rule 6. */
12140 && (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
12141 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
]))
12143 tree arg
= TREE_VALUE (argtypes
);
12144 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
12145 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
12146 arg
= TREE_TYPE (arg
);
12147 arg
= TYPE_MAIN_VARIANT (arg
);
12148 if (list_length (argtypes
) == 2)
12150 if (TREE_CODE (ret
) != REFERENCE_TYPE
12151 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
12153 cp_warning ("prefix `%D' should return `%T'", decl
,
12154 build_reference_type (arg
));
12158 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
12159 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
12163 else if (unary_op_p (name
))
12165 if (list_length (argtypes
) != 2)
12168 cp_error ("`%D' must take `void'", decl
);
12170 cp_error ("`%D' must take exactly one argument", decl
);
12173 else /* if (binary_op_p (name)) */
12175 if (list_length (argtypes
) != 3)
12178 cp_error ("`%D' must take exactly one argument", decl
);
12180 cp_error ("`%D' must take exactly two arguments", decl
);
12183 /* More Effective C++ rule 7. */
12185 && (name
== ansi_opname
[TRUTH_ANDIF_EXPR
]
12186 || name
== ansi_opname
[TRUTH_ORIF_EXPR
]
12187 || name
== ansi_opname
[COMPOUND_EXPR
]))
12188 cp_warning ("user-defined `%D' always evaluates both arguments",
12192 /* Effective C++ rule 23. */
12194 && list_length (argtypes
) == 3
12195 && (name
== ansi_opname
[PLUS_EXPR
]
12196 || name
== ansi_opname
[MINUS_EXPR
]
12197 || name
== ansi_opname
[TRUNC_DIV_EXPR
]
12198 || name
== ansi_opname
[MULT_EXPR
])
12199 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
12200 cp_warning ("`%D' should return by value", decl
);
12204 for (; argtypes
!= void_list_node
; argtypes
= TREE_CHAIN (argtypes
))
12205 if (TREE_PURPOSE (argtypes
))
12207 TREE_PURPOSE (argtypes
) = NULL_TREE
;
12208 if (name
== ansi_opname
[(int) POSTINCREMENT_EXPR
]
12209 || name
== ansi_opname
[(int) POSTDECREMENT_EXPR
])
12212 cp_pedwarn ("`%D' cannot have default arguments", decl
);
12215 cp_error ("`%D' cannot have default arguments", decl
);
12220 static const char *
12222 enum tag_types code
;
12235 my_friendly_abort (981122);
12239 /* Get the struct, enum or union (CODE says which) with tag NAME.
12240 Define the tag as a forward-reference if it is not defined.
12242 C++: If a class derivation is given, process it here, and report
12243 an error if multiple derivation declarations are not identical.
12245 If this is a definition, come in through xref_tag and only look in
12246 the current frame for the name (since C++ allows new names in any
12250 xref_tag (code_type_node
, name
, globalize
)
12251 tree code_type_node
;
12255 enum tag_types tag_code
;
12256 enum tree_code code
;
12257 register tree ref
, t
;
12258 struct binding_level
*b
= current_binding_level
;
12260 tree attributes
= NULL_TREE
;
12261 tree context
= NULL_TREE
;
12263 /* If we are called from the parser, code_type_node will sometimes be a
12264 TREE_LIST. This indicates that the user wrote
12265 "class __attribute__ ((foo)) bar". Extract the attributes so we can
12267 if (TREE_CODE (code_type_node
) == TREE_LIST
)
12269 attributes
= TREE_PURPOSE (code_type_node
);
12270 code_type_node
= TREE_VALUE (code_type_node
);
12273 tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
12278 code
= RECORD_TYPE
;
12284 code
= ENUMERAL_TYPE
;
12287 my_friendly_abort (18);
12290 /* If a cross reference is requested, look up the type
12291 already defined for this tag and return it. */
12292 if (TREE_CODE_CLASS (TREE_CODE (name
)) == 't')
12295 name
= TYPE_IDENTIFIER (t
);
12299 t
= IDENTIFIER_TYPE_VALUE (name
);
12301 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
12302 && TREE_CODE (t
) != TEMPLATE_TEMPLATE_PARM
)
12307 /* If we know we are defining this tag, only look it up in
12308 this scope and don't try to find it as a type. */
12309 ref
= lookup_tag (code
, name
, b
, 1);
12315 /* [dcl.type.elab] If the identifier resolves to a
12316 typedef-name or a template type-parameter, the
12317 elaborated-type-specifier is ill-formed. */
12318 if (t
!= TYPE_MAIN_VARIANT (t
)
12319 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
12320 cp_pedwarn ("using typedef-name `%D' after `%s'",
12321 TYPE_NAME (t
), tag_name (tag_code
));
12322 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12323 cp_error ("using template type parameter `%T' after `%s'",
12324 t
, tag_name (tag_code
));
12329 ref
= lookup_tag (code
, name
, b
, 0);
12333 /* Try finding it as a type declaration. If that wins,
12335 ref
= lookup_name (name
, 1);
12337 if (ref
!= NULL_TREE
12338 && processing_template_decl
12339 && DECL_CLASS_TEMPLATE_P (ref
)
12340 && template_class_depth (current_class_type
) == 0)
12341 /* Since GLOBALIZE is true, we're declaring a global
12342 template, so we want this type. */
12343 ref
= DECL_RESULT (ref
);
12345 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12346 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12347 ref
= TREE_TYPE (ref
);
12352 if (ref
&& current_class_type
12353 && template_class_depth (current_class_type
)
12354 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12356 /* Since GLOBALIZE is non-zero, we are not looking at a
12357 definition of this tag. Since, in addition, we are currently
12358 processing a (member) template declaration of a template
12359 class, we must be very careful; consider:
12366 { template <class V>
12367 friend struct S1; };
12369 Here, the S2::S1 declaration should not be confused with the
12370 outer declaration. In particular, the inner version should
12371 have a template parameter of level 2, not level 1. This
12372 would be particularly important if the member declaration
12375 template <class V = U> friend struct S1;
12377 say, when we should tsubst into `U' when instantiating
12378 S2. On the other hand, when presented with:
12388 we must find the inner binding eventually. We
12389 accomplish this by making sure that the new type we
12390 create to represent this declaration has the right
12392 context
= TYPE_CONTEXT (ref
);
12399 /* If no such tag is yet defined, create a forward-reference node
12400 and record it as the "definition".
12401 When a real declaration of this type is found,
12402 the forward-reference will be altered into a real type. */
12403 if (code
== ENUMERAL_TYPE
)
12405 cp_error ("use of enum `%#D' without previous declaration", name
);
12407 ref
= make_node (ENUMERAL_TYPE
);
12409 /* Give the type a default layout like unsigned int
12410 to avoid crashing if it does not get defined. */
12411 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12412 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12413 TREE_UNSIGNED (ref
) = 1;
12414 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12415 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12416 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12418 /* Enable us to recognize when a type is created in class context.
12419 To do nested classes correctly, this should probably be cleared
12420 out when we leave this classes scope. Currently this in only
12421 done in `start_enum'. */
12423 pushtag (name
, ref
, globalize
);
12427 struct binding_level
*old_b
= class_binding_level
;
12429 ref
= make_aggr_type (code
);
12430 TYPE_CONTEXT (ref
) = context
;
12432 #ifdef NONNESTED_CLASSES
12433 /* Class types don't nest the way enums do. */
12434 class_binding_level
= (struct binding_level
*)0;
12436 pushtag (name
, ref
, globalize
);
12437 class_binding_level
= old_b
;
12442 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12443 redeclare_class_template (ref
, current_template_parms
);
12446 /* Until the type is defined, tentatively accept whatever
12447 structure tag the user hands us. */
12448 if (TYPE_SIZE (ref
) == NULL_TREE
12449 && ref
!= current_class_type
12450 /* Have to check this, in case we have contradictory tag info. */
12451 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12453 if (tag_code
== class_type
)
12454 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12455 else if (tag_code
== record_type
)
12456 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12459 TREE_TYPE (ref
) = attributes
;
12465 xref_tag_from_type (old
, id
, globalize
)
12469 tree code_type_node
;
12471 if (TREE_CODE (old
) == RECORD_TYPE
)
12472 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12473 ? class_type_node
: record_type_node
);
12475 code_type_node
= union_type_node
;
12477 if (id
== NULL_TREE
)
12478 id
= TYPE_IDENTIFIER (old
);
12480 return xref_tag (code_type_node
, id
, globalize
);
12483 /* REF is a type (named NAME), for which we have just seen some
12484 baseclasses. BINFO is a list of those baseclasses; the
12485 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12486 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12487 struct, or union. */
12490 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12491 tree code_type_node
;
12495 /* In the declaration `A : X, Y, ... Z' we mark all the types
12496 (A, X, Y, ..., Z) so we can check for duplicates. */
12501 enum tag_types tag_code
= (enum tag_types
) TREE_INT_CST_LOW (code_type_node
);
12503 if (tag_code
== union_type
)
12505 cp_error ("derived union `%T' invalid", ref
);
12509 len
= list_length (binfo
);
12511 /* First, make sure that any templates in base-classes are
12512 instantiated. This ensures that if we call ourselves recursively
12513 we do not get confused about which classes are marked and which
12515 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12516 complete_type (TREE_VALUE (base
));
12518 SET_CLASSTYPE_MARKED (ref
);
12519 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12521 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12523 /* The base of a derived struct is public by default. */
12525 = (TREE_PURPOSE (binfo
) == access_public_node
12526 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12527 || (tag_code
!= class_type
12528 && (TREE_PURPOSE (binfo
) == access_default_node
12529 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12531 = (TREE_PURPOSE (binfo
) == access_protected_node
12532 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12534 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12535 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12536 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12537 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12538 tree basetype
= TREE_VALUE (binfo
);
12541 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12542 basetype
= TREE_TYPE (basetype
);
12544 || (TREE_CODE (basetype
) != RECORD_TYPE
12545 && TREE_CODE (basetype
) != TYPENAME_TYPE
12546 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12547 && TREE_CODE (basetype
) != TEMPLATE_TEMPLATE_PARM
))
12549 cp_error ("base type `%T' fails to be a struct or class type",
12550 TREE_VALUE (binfo
));
12554 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12556 /* This code replaces similar code in layout_basetypes.
12557 We put the complete_type first for implicit `typename'. */
12558 if (TYPE_SIZE (basetype
) == NULL_TREE
12559 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12561 cp_error ("base class `%T' has incomplete type", basetype
);
12566 if (CLASSTYPE_MARKED (basetype
))
12568 if (basetype
== ref
)
12569 cp_error ("recursive type `%T' undefined", basetype
);
12571 cp_error ("duplicate base type `%T' invalid", basetype
);
12575 if (TYPE_FOR_JAVA (basetype
)
12576 && (current_lang_stack
12577 == &VARRAY_TREE (current_lang_base
, 0)))
12578 TYPE_FOR_JAVA (ref
) = 1;
12580 /* Note that the BINFO records which describe individual
12581 inheritances are *not* shared in the lattice! They
12582 cannot be shared because a given baseclass may be
12583 inherited with different `accessibility' by different
12584 derived classes. (Each BINFO record describing an
12585 individual inheritance contains flags which say what
12586 the `accessibility' of that particular inheritance is.) */
12589 = make_binfo (size_zero_node
, basetype
,
12590 CLASS_TYPE_P (basetype
)
12591 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
12592 CLASS_TYPE_P (basetype
)
12593 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
12595 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
12596 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
12597 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
12598 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
12599 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
12601 /* We need to unshare the binfos now so that lookups during class
12602 definition work. */
12603 unshare_base_binfos (base_binfo
);
12605 SET_CLASSTYPE_MARKED (basetype
);
12607 /* We are free to modify these bits because they are meaningless
12608 at top level, and BASETYPE is a top-level type. */
12609 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
12611 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
12612 /* Converting to a virtual base class requires looking
12613 up the offset of the virtual base. */
12614 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
12617 if (CLASS_TYPE_P (basetype
))
12619 TYPE_HAS_NEW_OPERATOR (ref
)
12620 |= TYPE_HAS_NEW_OPERATOR (basetype
);
12621 TYPE_HAS_ARRAY_NEW_OPERATOR (ref
)
12622 |= TYPE_HAS_ARRAY_NEW_OPERATOR (basetype
);
12623 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
12624 /* If the base-class uses multiple inheritance, so do we. */
12625 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
12626 |= TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
12627 /* Likewise, if converting to a base of the base may require
12628 code, then we may need to generate code to convert to a
12630 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
)
12631 |= TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (basetype
);
12638 TREE_VEC_LENGTH (binfos
) = i
;
12640 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
12644 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
12645 /* If there is more than one non-empty they cannot be at the same
12647 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
12650 /* Unmark all the types. */
12652 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
12653 CLEAR_CLASSTYPE_MARKED (ref
);
12655 /* Now that we know all the base-classes, set up the list of virtual
12657 get_vbase_types (ref
);
12661 /* Begin compiling the definition of an enumeration type.
12662 NAME is its name (or null if anonymous).
12663 Returns the type object, as yet incomplete.
12664 Also records info about it so that build_enumerator
12665 may be used to declare the individual values as they are read. */
12671 register tree enumtype
= NULL_TREE
;
12672 struct binding_level
*b
= current_binding_level
;
12674 /* If this is the real definition for a previous forward reference,
12675 fill in the contents in the same object that used to be the
12676 forward reference. */
12678 if (name
!= NULL_TREE
)
12679 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
12681 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
12683 cp_error ("multiple definition of `%#T'", enumtype
);
12684 cp_error_at ("previous definition here", enumtype
);
12685 /* Clear out TYPE_VALUES, and start again. */
12686 TYPE_VALUES (enumtype
) = NULL_TREE
;
12690 enumtype
= make_node (ENUMERAL_TYPE
);
12691 pushtag (name
, enumtype
, 0);
12694 if (current_class_type
)
12695 TREE_ADDRESSABLE (b
->tags
) = 1;
12697 GNU_xref_decl (current_function_decl
, enumtype
);
12701 /* After processing and defining all the values of an enumeration type,
12702 install their decls in the enumeration type and finish it off.
12703 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12704 Returns ENUMTYPE. */
12707 finish_enum (enumtype
)
12710 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
12711 /* Calculate the maximum value of any enumerator in this type. */
12713 tree values
= TYPE_VALUES (enumtype
);
12718 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
12723 /* The TREE_VALUE is a CONST_DECL for this enumeration
12725 decl
= TREE_VALUE (pair
);
12729 Following the closing brace of an enum-specifier, each
12730 enumerator has the type of its enumeration. Prior to the
12731 closing brace, the type of each enumerator is the type of
12732 its initializing value. */
12733 TREE_TYPE (decl
) = enumtype
;
12735 /* The DECL_INITIAL will be NULL if we are processing a
12736 template declaration and this enumeration constant had no
12737 explicit initializer. */
12738 value
= DECL_INITIAL (decl
);
12739 if (value
&& !processing_template_decl
)
12741 /* Set the TREE_TYPE for the VALUE as well. That's so
12742 that when we call decl_constant_value we get an
12743 entity of the right type (but with the constant
12744 value). Since we shouldn't ever call
12745 decl_constant_value on a template type, there's no
12746 reason to do that when processing_template_decl.
12747 And, if the expression is something like a
12748 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12749 wreak havoc on the intended type of the expression.
12751 Of course, there's also no point in trying to compute
12752 minimum or maximum values if we're in a template. */
12753 TREE_TYPE (value
) = enumtype
;
12756 minnode
= maxnode
= value
;
12757 else if (tree_int_cst_lt (maxnode
, value
))
12759 else if (tree_int_cst_lt (value
, minnode
))
12763 if (processing_template_decl
)
12764 /* If this is just a template, leave the CONST_DECL
12765 alone. That way tsubst_copy will find CONST_DECLs for
12766 CONST_DECLs, and not INTEGER_CSTs. */
12769 /* In the list we're building up, we want the enumeration
12770 values, not the CONST_DECLs. */
12771 TREE_VALUE (pair
) = value
;
12775 maxnode
= minnode
= integer_zero_node
;
12777 TYPE_VALUES (enumtype
) = nreverse (values
);
12779 if (processing_template_decl
)
12781 tree scope
= current_scope ();
12782 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
12783 add_tree (build_min (TAG_DEFN
, enumtype
));
12787 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
12788 int lowprec
= min_precision (minnode
, unsignedp
);
12789 int highprec
= min_precision (maxnode
, unsignedp
);
12790 int precision
= MAX (lowprec
, highprec
);
12793 TYPE_SIZE (enumtype
) = NULL_TREE
;
12795 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
12797 TYPE_PRECISION (enumtype
) = precision
;
12799 fixup_unsigned_type (enumtype
);
12801 fixup_signed_type (enumtype
);
12803 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
12804 /* Use the width of the narrowest normal C type which is wide
12806 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
12809 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
12811 TYPE_SIZE (enumtype
) = 0;
12812 layout_type (enumtype
);
12814 /* Fix up all variant types of this enum type. */
12815 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
12816 tem
= TYPE_NEXT_VARIANT (tem
))
12818 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
12819 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
12820 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
12821 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
12822 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
12823 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
12824 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
12825 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
12826 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
12829 /* Finish debugging output for this type. */
12830 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
12836 /* Build and install a CONST_DECL for an enumeration constant of the
12837 enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided.
12838 Assignment of sequential values by default is handled here. */
12841 build_enumerator (name
, value
, enumtype
)
12851 /* Remove no-op casts from the value. */
12853 STRIP_TYPE_NOPS (value
);
12855 if (! processing_template_decl
)
12857 /* Validate and default VALUE. */
12858 if (value
!= NULL_TREE
)
12860 if (TREE_READONLY_DECL_P (value
))
12861 value
= decl_constant_value (value
);
12863 if (TREE_CODE (value
) == INTEGER_CST
)
12865 value
= default_conversion (value
);
12866 constant_expression_warning (value
);
12870 cp_error ("enumerator value for `%D' not integer constant", name
);
12875 /* Default based on previous value. */
12876 if (value
== NULL_TREE
&& ! processing_template_decl
)
12880 if (TYPE_VALUES (enumtype
))
12882 /* The next value is the previous value ... */
12883 prev_value
= DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype
)));
12884 /* ... plus one. */
12885 value
= build_binary_op (PLUS_EXPR
,
12889 if (tree_int_cst_lt (value
, prev_value
))
12890 cp_error ("overflow in enumeration values at `%D'", name
);
12893 value
= integer_zero_node
;
12896 /* Remove no-op casts from the value. */
12898 STRIP_TYPE_NOPS (value
);
12900 /* To fix MAX_VAL enum consts. (bkoz) */
12901 TREE_TYPE (value
) = integer_type_node
;
12905 /* We always have to copy here; not all INTEGER_CSTs are unshared.
12906 Even in other cases, we will later (in finish_enum) be setting
12907 the type of VALUE. But, we don't need to make a copy if this
12908 VALUE is one of the enumeration constants for this same
12909 enumeration type. */
12910 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
12911 if (TREE_VALUE (values
) == value
)
12913 /* If we didn't break out of the loop, then we do need a copy. */
12914 if (!values
&& value
)
12915 value
= copy_node (value
);
12917 /* C++ associates enums with global, function, or class declarations. */
12918 context
= current_scope ();
12920 /* Build the actual enumeration constant. Note that the enumeration
12921 constants have the type of their initializers until the
12922 enumeration is complete:
12926 Following the closing brace of an enum-specifier, each enumer-
12927 ator has the type of its enumeration. Prior to the closing
12928 brace, the type of each enumerator is the type of its
12929 initializing value.
12931 In finish_enum we will reset the type. Of course, if we're
12932 processing a template, there may be no value. */
12933 type
= value
? TREE_TYPE (value
) : NULL_TREE
;
12935 if (context
&& context
== current_class_type
)
12936 /* This enum declaration is local to the class. We need the full
12937 lang_decl so that we can record DECL_CLASS_CONTEXT, for example. */
12938 decl
= build_lang_decl (CONST_DECL
, name
, type
);
12940 /* It's a global enum, or it's local to a function. (Note local to
12941 a function could mean local to a class method. */
12942 decl
= build_decl (CONST_DECL
, name
, type
);
12944 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
12945 DECL_INITIAL (decl
) = value
;
12946 TREE_READONLY (decl
) = 1;
12948 if (context
&& context
== current_class_type
)
12949 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
12950 on the TYPE_FIELDS list for `S'. (That's so that you can say
12951 things like `S::i' later.) */
12952 finish_member_declaration (decl
);
12956 GNU_xref_decl (current_function_decl
, decl
);
12959 /* Add this enumeration constant to the list for this type. */
12960 TYPE_VALUES (enumtype
) = tree_cons (name
, decl
, TYPE_VALUES (enumtype
));
12964 static int function_depth
;
12966 /* We're defining DECL. Make sure that it's type is OK. */
12969 check_function_type (decl
)
12972 tree fntype
= TREE_TYPE (decl
);
12974 /* In a function definition, arg types must be complete. */
12975 require_complete_types_for_parms (current_function_parms
);
12977 if (TYPE_SIZE (complete_type (TREE_TYPE (fntype
))) == NULL_TREE
)
12979 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
12981 /* Make it return void instead, but don't change the
12982 type of the DECL_RESULT, in case we have a named return value. */
12983 if (TREE_CODE (fntype
) == METHOD_TYPE
)
12985 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
12987 = build_cplus_method_type (ctype
,
12989 FUNCTION_ARG_CHAIN (decl
));
12993 = build_function_type (void_type_node
,
12994 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
12996 = build_exception_variant (fntype
,
12997 TYPE_RAISES_EXCEPTIONS (fntype
));
13000 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
13003 /* Create the FUNCTION_DECL for a function definition.
13004 DECLSPECS and DECLARATOR are the parts of the declaration;
13005 they describe the function's name and the type it returns,
13006 but twisted together in a fashion that parallels the syntax of C.
13008 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
13009 DECLARATOR is really the DECL for the function we are about to
13010 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
13011 indicating that the function is an inline defined in-class, and
13012 SF_EXPAND indicating that we should generate RTL for this
13015 This function creates a binding context for the function body
13016 as well as setting up the FUNCTION_DECL in current_function_decl.
13018 Returns 1 on success. If the DECLARATOR is not suitable for a function
13019 (it defines a datum instead), we return 0, which tells
13020 yyparse to report a parse error.
13022 For C++, we must first check whether that datum makes any sense.
13023 For example, "class A local_a(1,2);" means that variable local_a
13024 is an aggregate of type A, which should have a constructor
13025 applied to it with the argument list [1, 2]. */
13028 start_function (declspecs
, declarator
, attrs
, flags
)
13029 tree declspecs
, declarator
, attrs
;
13033 tree ctype
= NULL_TREE
;
13036 extern int have_extern_spec
;
13037 extern int used_extern_spec
;
13038 int doing_friend
= 0;
13039 struct binding_level
*bl
;
13041 /* Sanity check. */
13042 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
13043 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
13045 /* This should only be done once on the top most decl. */
13046 if (have_extern_spec
&& !used_extern_spec
)
13048 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
13049 used_extern_spec
= 1;
13052 if (flags
& SF_PRE_PARSED
)
13054 decl1
= declarator
;
13056 fntype
= TREE_TYPE (decl1
);
13057 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13058 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13060 /* ISO C++ 11.4/5. A friend function defined in a class is in
13061 the (lexical) scope of the class in which it is defined. */
13062 if (!ctype
&& DECL_FRIEND_P (decl1
))
13064 ctype
= DECL_FRIEND_CONTEXT (decl1
);
13066 /* CTYPE could be null here if we're dealing with a template;
13067 for example, `inline friend float foo()' inside a template
13068 will have no CTYPE set. */
13069 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
13075 last_function_parms
= DECL_ARGUMENTS (decl1
);
13076 last_function_parm_tags
= NULL_TREE
;
13080 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
13081 /* If the declarator is not suitable for a function definition,
13082 cause a syntax error. */
13083 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
13085 fntype
= TREE_TYPE (decl1
);
13087 restype
= TREE_TYPE (fntype
);
13088 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
13090 cp_error ("semicolon missing after declaration of `%#T'", restype
);
13091 shadow_tag (build_tree_list (NULL_TREE
, restype
));
13092 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
13093 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
13094 fntype
= build_function_type (integer_type_node
,
13095 TYPE_ARG_TYPES (fntype
));
13097 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
13099 TYPE_ARG_TYPES (fntype
));
13100 TREE_TYPE (decl1
) = fntype
;
13103 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13104 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13105 else if (DECL_MAIN_P (decl1
))
13107 /* If this doesn't return integer_type, complain. */
13108 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
13110 if (pedantic
|| warn_return_type
)
13111 pedwarn ("return type for `main' changed to `int'");
13112 TREE_TYPE (decl1
) = fntype
= default_function_type
;
13117 /* Sometimes we don't notice that a function is a static member, and
13118 build a METHOD_TYPE for it. Fix that up now. */
13119 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
)
13120 && TREE_CODE (TREE_TYPE (decl1
)) == METHOD_TYPE
)
13122 revert_static_member_fn (&decl1
, NULL
, NULL
);
13123 last_function_parms
= TREE_CHAIN (last_function_parms
);
13127 /* Warn if function was previously implicitly declared
13128 (but not if we warned then). */
13129 if (! warn_implicit
13130 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
13131 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
13133 /* Set up current_class_type, and enter the scope of the class, if
13136 push_nested_class (ctype
, 1);
13137 else if (DECL_STATIC_FUNCTION_P (decl1
))
13138 push_nested_class (DECL_CONTEXT (decl1
), 2);
13140 /* Now that we have entered the scope of the class, we must restore
13141 the bindings for any template parameters surrounding DECL1, if it
13142 is an inline member template. (Order is important; consider the
13143 case where a template parameter has the same name as a field of
13144 the class.) It is not until after this point that
13145 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
13146 if (flags
& SF_INCLASS_INLINE
)
13147 maybe_begin_member_template_processing (decl1
);
13149 /* Effective C++ rule 15. See also c_expand_return. */
13151 && DECL_NAME (decl1
) == ansi_opname
[(int) MODIFY_EXPR
]
13152 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
13153 cp_warning ("`operator=' should return a reference to `*this'");
13155 /* Make the init_value nonzero so pushdecl knows this is not tentative.
13156 error_mark_node is replaced below (in poplevel) with the BLOCK. */
13157 if (!DECL_INITIAL (decl1
))
13158 DECL_INITIAL (decl1
) = error_mark_node
;
13160 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
13161 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
13164 /* This function exists in static storage.
13165 (This does not mean `static' in the C sense!) */
13166 TREE_STATIC (decl1
) = 1;
13168 /* We must call push_template_decl after current_class_type is set
13169 up. (If we are processing inline definitions after exiting a
13170 class scope, current_class_type will be NULL_TREE until set above
13171 by push_nested_class.) */
13172 if (processing_template_decl
)
13173 decl1
= push_template_decl (decl1
);
13175 /* We are now in the scope of the function being defined. */
13176 current_function_decl
= decl1
;
13178 /* Save the parm names or decls from this function's declarator
13179 where store_parm_decls will find them. */
13180 current_function_parms
= last_function_parms
;
13181 current_function_parm_tags
= last_function_parm_tags
;
13183 /* Make sure the parameter and return types are reasonable. When
13184 you declare a function, these types can be incomplete, but they
13185 must be complete when you define the function. */
13186 if (! processing_template_decl
)
13187 check_function_type (decl1
);
13189 /* Build the return declaration for the function. */
13190 restype
= TREE_TYPE (fntype
);
13191 if (!processing_template_decl
)
13193 if (!DECL_RESULT (decl1
))
13195 DECL_RESULT (decl1
)
13196 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13197 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype
),
13198 DECL_RESULT (decl1
));
13202 /* Just use `void'. Nobody will ever look at this anyhow. */
13203 DECL_RESULT (decl1
) = build_decl (RESULT_DECL
, 0, void_type_node
);
13205 /* Initialize RTL machinery. We cannot do this until
13206 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
13207 even when processing a template; this is how we get
13208 CFUN set up, and our per-function variables initialized. */
13209 bl
= current_binding_level
;
13210 init_function_start (decl1
, input_filename
, lineno
);
13211 current_binding_level
= bl
;
13212 expanding_p
= (flags
& SF_EXPAND
) != 0;
13214 /* Even though we're inside a function body, we still don't want to
13215 call expand_expr to calculate the size of a variable-sized array.
13216 We haven't necessarily assigned RTL to all variables yet, so it's
13217 not safe to try to expand expressions involving them. */
13218 immediate_size_expand
= 0;
13219 cfun
->x_dont_save_pending_sizes_p
= 1;
13221 /* If we're building a statement-tree, start the tree now. */
13222 if (processing_template_decl
|| !expanding_p
)
13223 begin_stmt_tree (&DECL_SAVED_TREE (decl1
));
13225 /* Let the user know we're compiling this function. */
13226 if (processing_template_decl
|| !building_stmt_tree ())
13227 announce_function (decl1
);
13229 /* Record the decl so that the function name is defined.
13230 If we already have a decl for this name, and it is a FUNCTION_DECL,
13231 use the old decl. */
13232 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
13234 /* A specialization is not used to guide overload resolution. */
13235 if ((flag_guiding_decls
13236 || !DECL_TEMPLATE_SPECIALIZATION (decl1
))
13237 && ! DECL_FUNCTION_MEMBER_P (decl1
))
13238 decl1
= pushdecl (decl1
);
13241 /* We need to set the DECL_CONTEXT. */
13242 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
13243 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
13244 /* And make sure we have enough default args. */
13245 check_default_args (decl1
);
13247 DECL_MAIN_VARIANT (decl1
) = decl1
;
13248 fntype
= TREE_TYPE (decl1
);
13251 /* Reset these in case the call to pushdecl changed them. */
13252 current_function_decl
= decl1
;
13253 cfun
->decl
= decl1
;
13255 /* Initialize the per-function data. */
13256 if (!DECL_PENDING_INLINE_P (decl1
) && DECL_SAVED_FUNCTION_DATA (decl1
))
13258 /* If we already parsed this function, and we're just expanding it
13259 now, restore saved state. */
13260 struct binding_level
*bl
= current_binding_level
;
13261 *cp_function_chain
= *DECL_SAVED_FUNCTION_DATA (decl1
);
13262 current_binding_level
= bl
;
13264 /* This function is being processed in whole-function mode; we
13265 already did semantic analysis. */
13266 cfun
->x_whole_function_mode_p
= 1;
13268 /* If we decided that we didn't want to inline this function,
13269 make sure the back-end knows that. */
13270 if (!current_function_cannot_inline
)
13271 current_function_cannot_inline
= cp_function_chain
->cannot_inline
;
13273 /* We don't need the saved data anymore. */
13274 free (DECL_SAVED_FUNCTION_DATA (decl1
));
13275 DECL_SAVED_FUNCTION_DATA (decl1
) = NULL
;
13277 else if (ctype
&& !doing_friend
&& !DECL_STATIC_FUNCTION_P (decl1
))
13279 /* We know that this was set up by `grokclassfn'. We do not
13280 wait until `store_parm_decls', since evil parse errors may
13281 never get us to that point. Here we keep the consistency
13282 between `current_class_type' and `current_class_ptr'. */
13283 tree t
= DECL_ARGUMENTS (decl1
);
13285 my_friendly_assert (t
!= NULL_TREE
&& TREE_CODE (t
) == PARM_DECL
,
13287 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
13290 cp_function_chain
->x_current_class_ref
13291 = build_indirect_ref (t
, NULL_PTR
);
13292 cp_function_chain
->x_current_class_ptr
= t
;
13294 /* Constructors and destructors need to know whether they're "in
13295 charge" of initializing virtual base classes. */
13296 if (DECL_DESTRUCTOR_P (decl1
))
13297 current_in_charge_parm
= TREE_CHAIN (t
);
13298 else if (DECL_CONSTRUCTOR_P (decl1
)
13300 && DECL_ARTIFICIAL (TREE_CHAIN (t
))
13301 && (DECL_NAME (TREE_CHAIN (t
))
13302 == in_charge_identifier
))
13303 current_in_charge_parm
= TREE_CHAIN (t
);
13306 if (DECL_INTERFACE_KNOWN (decl1
))
13308 tree ctx
= decl_function_context (decl1
);
13310 if (DECL_NOT_REALLY_EXTERN (decl1
))
13311 DECL_EXTERNAL (decl1
) = 0;
13313 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
13314 && TREE_PUBLIC (ctx
))
13315 /* This is a function in a local class in an extern inline
13317 comdat_linkage (decl1
);
13319 /* If this function belongs to an interface, it is public.
13320 If it belongs to someone else's interface, it is also external.
13321 This only affects inlines and template instantiations. */
13322 else if (interface_unknown
== 0
13323 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13324 || flag_alt_external_templates
))
13326 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
13327 || processing_template_decl
)
13329 DECL_EXTERNAL (decl1
)
13331 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
13332 && !DECL_VINDEX (decl1
)));
13334 /* For WIN32 we also want to put these in linkonce sections. */
13335 maybe_make_one_only (decl1
);
13338 DECL_EXTERNAL (decl1
) = 0;
13339 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
13340 DECL_INTERFACE_KNOWN (decl1
) = 1;
13342 else if (interface_unknown
&& interface_only
13343 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13344 || flag_alt_external_templates
))
13346 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13347 interface, we will have interface_only set but not
13348 interface_known. In that case, we don't want to use the normal
13349 heuristics because someone will supply a #pragma implementation
13350 elsewhere, and deducing it here would produce a conflict. */
13351 comdat_linkage (decl1
);
13352 DECL_EXTERNAL (decl1
) = 0;
13353 DECL_INTERFACE_KNOWN (decl1
) = 1;
13354 DECL_DEFER_OUTPUT (decl1
) = 1;
13358 /* This is a definition, not a reference.
13359 So clear DECL_EXTERNAL. */
13360 DECL_EXTERNAL (decl1
) = 0;
13362 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
13363 && ! DECL_INTERFACE_KNOWN (decl1
)
13364 /* Don't try to defer nested functions for now. */
13365 && ! decl_function_context (decl1
))
13366 DECL_DEFER_OUTPUT (decl1
) = 1;
13368 DECL_INTERFACE_KNOWN (decl1
) = 1;
13371 if (doing_semantic_analysis_p ())
13374 current_binding_level
->parm_flag
= 1;
13378 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13380 if (!building_stmt_tree ())
13382 GNU_xref_function (decl1
, current_function_parms
);
13383 make_function_rtl (decl1
);
13386 /* Promote the value to int before returning it. */
13387 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13388 restype
= type_promotes_to (restype
);
13390 /* If this fcn was already referenced via a block-scope `extern' decl
13391 (or an implicit decl), propagate certain information about the usage. */
13392 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13393 TREE_ADDRESSABLE (decl1
) = 1;
13395 if (DECL_RESULT (decl1
) == NULL_TREE
)
13397 DECL_RESULT (decl1
)
13398 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13399 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13400 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13405 if (DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl1
))
13406 && DECL_LANGUAGE (decl1
) == lang_cplusplus
)
13408 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13409 DECL_CONTEXT (dtor_label
) = current_function_decl
;
13411 else if (DECL_CONSTRUCTOR_P (decl1
))
13413 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13414 DECL_CONTEXT (ctor_label
) = current_function_decl
;
13420 /* Called after store_parm_decls for a function-try-block. */
13423 expand_start_early_try_stmts ()
13425 expand_start_try_stmts ();
13428 /* Store the parameter declarations into the current function declaration.
13429 This is called after parsing the parameter declarations, before
13430 digesting the body of the function.
13432 Also install to binding contour return value identifier, if any. */
13435 store_parm_decls ()
13437 register tree fndecl
= current_function_decl
;
13438 register tree parm
;
13439 int parms_have_cleanups
= 0;
13440 tree cleanups
= NULL_TREE
;
13442 /* This is a list of types declared among parms in a prototype. */
13443 tree parmtags
= current_function_parm_tags
;
13445 /* This is a chain of any other decls that came in among the parm
13446 declarations. If a parm is declared with enum {foo, bar} x;
13447 then CONST_DECLs for foo and bar are put here. */
13448 tree nonparms
= NULL_TREE
;
13450 /* Create a binding level for the parms. */
13451 if (!building_stmt_tree ())
13452 expand_start_bindings (2);
13454 if (current_function_parms
)
13456 /* This case is when the function was defined with an ANSI prototype.
13457 The parms already have decls, so we need not do anything here
13458 except record them as in effect
13459 and complain if any redundant old-style parm decls were written. */
13461 tree specparms
= current_function_parms
;
13464 if (doing_semantic_analysis_p ())
13466 /* Must clear this because it might contain TYPE_DECLs declared
13468 storedecls (NULL_TREE
);
13470 /* If we're doing semantic analysis, then we'll call pushdecl
13471 for each of these. We must do them in reverse order so that
13472 they end in the correct forward order. */
13473 specparms
= nreverse (specparms
);
13476 for (parm
= specparms
; parm
; parm
= next
)
13478 next
= TREE_CHAIN (parm
);
13479 if (TREE_CODE (parm
) == PARM_DECL
)
13481 tree type
= TREE_TYPE (parm
);
13483 if (doing_semantic_analysis_p ())
13487 if (DECL_NAME (parm
) == NULL_TREE
13488 || TREE_CODE (parm
) != VOID_TYPE
)
13491 cp_error ("parameter `%D' declared void", parm
);
13493 cleanup
= (processing_template_decl
13495 : maybe_build_cleanup (parm
));
13498 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13500 else if (type
!= error_mark_node
13501 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
13502 parms_have_cleanups
= 1;
13506 /* If we find an enum constant or a type tag,
13507 put it aside for the moment. */
13508 TREE_CHAIN (parm
) = NULL_TREE
;
13509 nonparms
= chainon (nonparms
, parm
);
13513 if (doing_semantic_analysis_p ())
13515 /* Get the decls in their original chain order
13516 and record in the function. This is all and only the
13517 PARM_DECLs that were pushed into scope by the loop above. */
13518 DECL_ARGUMENTS (fndecl
) = getdecls ();
13519 storetags (chainon (parmtags
, gettags ()));
13523 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13525 /* Now store the final chain of decls for the arguments
13526 as the decl-chain of the current lexical scope.
13527 Put the enumerators in as well, at the front so that
13528 DECL_ARGUMENTS is not modified. */
13529 if (doing_semantic_analysis_p ())
13530 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13532 /* Initialize the RTL code for the function. */
13533 DECL_SAVED_INSNS (fndecl
) = 0;
13534 if (! building_stmt_tree ())
13535 expand_function_start (fndecl
, parms_have_cleanups
);
13537 current_function_parms_stored
= 1;
13539 /* If this function is `main', emit a call to `__main'
13540 to run global initializers, etc. */
13541 if (DECL_MAIN_P (fndecl
) && !building_stmt_tree ())
13542 expand_main_function ();
13544 /* Now that we have initialized the parms, we can start their
13545 cleanups. We cannot do this before, since expand_decl_cleanup
13546 should not be called before the parm can be used. */
13549 finish_decl_cleanup (TREE_PURPOSE (cleanups
),
13550 TREE_VALUE (cleanups
));
13551 cleanups
= TREE_CHAIN (cleanups
);
13554 /* Create a binding contour which can be used to catch
13555 cleanup-generated temporaries. Also, if the return value needs or
13556 has initialization, deal with that now. */
13557 if (parms_have_cleanups
)
13560 if (!building_stmt_tree ())
13561 expand_start_bindings (2);
13564 /* Do the starting of the exception specifications, if we have any. */
13565 if (flag_exceptions
&& !processing_template_decl
13566 && building_stmt_tree ()
13567 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13568 current_eh_spec_try_block
= expand_start_eh_spec ();
13571 /* Bind a name and initialization to the return value of
13572 the current function. */
13575 store_return_init (decl
)
13578 /* If this named return value comes in a register, put it in a
13579 pseudo-register. */
13580 if (DECL_REGISTER (decl
))
13582 original_result_rtx
= DECL_RTL (decl
);
13583 /* Note that the mode of the old DECL_RTL may be wider than the
13584 mode of DECL_RESULT, depending on the calling conventions for
13585 the processor. For example, on the Alpha, a 32-bit integer
13586 is returned in a DImode register -- the DECL_RESULT has
13587 SImode but the DECL_RTL for the DECL_RESULT has DImode. So,
13588 here, we use the mode the back-end has already assigned for
13589 the return value. */
13590 DECL_RTL (decl
) = gen_reg_rtx (GET_MODE (original_result_rtx
));
13595 /* We have finished doing semantic analysis on DECL, but have not yet
13596 generated RTL for its body. Save away our current state, so that
13597 when we want to generate RTL later we know what to do. */
13600 save_function_data (decl
)
13603 struct language_function
*f
;
13605 /* Save the language-specific per-function data so that we can
13606 get it back when we really expand this function. */
13607 my_friendly_assert (!DECL_PENDING_INLINE_P (decl
),
13611 f
= ((struct language_function
*)
13612 xmalloc (sizeof (struct language_function
)));
13613 bcopy ((char *) cp_function_chain
, (char *) f
,
13614 sizeof (struct language_function
));
13615 DECL_SAVED_FUNCTION_DATA (decl
) = f
;
13617 /* Clear out the bits we don't need. */
13618 f
->x_base_init_list
= NULL_TREE
;
13619 f
->x_member_init_list
= NULL_TREE
;
13620 f
->x_stmt_tree
.x_last_stmt
= NULL_TREE
;
13621 f
->x_stmt_tree
.x_last_expr_type
= NULL_TREE
;
13622 f
->x_result_rtx
= NULL_RTX
;
13623 f
->x_named_label_uses
= NULL
;
13624 f
->bindings
= NULL
;
13626 /* When we get back here again, we will be expanding. */
13627 f
->x_expanding_p
= 1;
13629 /* If we've already decided that we cannot inline this function, we
13630 must remember that fact when we actually go to expand the
13632 f
->cannot_inline
= current_function_cannot_inline
;
13635 /* At the end of every constructor we generate to code to return
13636 `this'. Do that now. */
13639 finish_constructor_body ()
13641 /* Any return from a constructor will end up here. */
13642 add_tree (build_min_nt (LABEL_STMT
, ctor_label
));
13644 /* Clear CTOR_LABEL so that finish_return_stmt knows to really
13645 generate the return, rather than a goto to CTOR_LABEL. */
13646 ctor_label
= NULL_TREE
;
13647 /* In check_return_expr we translate an empty return from a
13648 constructor to a return of `this'. */
13649 finish_return_stmt (NULL_TREE
);
13650 /* Mark the end of the constructor. */
13651 add_tree (build_min_nt (CTOR_STMT
));
13654 /* At the end of every destructor we generate code to restore virtual
13655 function tables to the values desired by base classes and to call
13656 to base class destructors. Do that now. */
13659 finish_destructor_body ()
13661 tree compound_stmt
;
13666 /* Create a block to contain all the extra code. */
13667 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
13669 /* Any return from a destructor will end up here. */
13670 add_tree (build_min_nt (LABEL_STMT
, dtor_label
));
13672 /* Generate the code to call destructor on base class. If this
13673 destructor belongs to a class with virtual functions, then set
13674 the virtual function table pointer to represent the type of our
13677 /* This side-effect makes call to `build_delete' generate the code
13678 we have to have at the end of this destructor. `build_delete'
13679 will set the flag again. */
13680 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
13682 /* These are two cases where we cannot delegate deletion. */
13683 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)
13684 || TYPE_GETS_REG_DELETE (current_class_type
))
13685 in_charge
= integer_zero_node
;
13687 in_charge
= current_in_charge_parm
;
13689 exprstmt
= build_delete (current_class_type
,
13692 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
,
13695 if (exprstmt
!= error_mark_node
13696 && (TREE_CODE (exprstmt
) != NOP_EXPR
13697 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
13698 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
13700 if (exprstmt
!= void_zero_node
)
13701 /* Don't call `expand_expr_stmt' if we're not going to do
13702 anything, since -Wall will give a diagnostic. */
13703 finish_expr_stmt (exprstmt
);
13705 /* Run destructors for all virtual baseclasses. */
13706 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13708 tree vbases
= nreverse (copy_list (CLASSTYPE_VBASECLASSES (current_class_type
)));
13709 tree if_stmt
= begin_if_stmt ();
13710 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13711 current_in_charge_parm
,
13717 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (vbases
)))
13719 tree vb
= get_vbase
13720 (BINFO_TYPE (vbases
),
13721 TYPE_BINFO (current_class_type
));
13723 (build_scoped_method_call
13724 (current_class_ref
, vb
, dtor_identifier
,
13725 build_tree_list (NULL_TREE
, integer_zero_node
)));
13727 vbases
= TREE_CHAIN (vbases
);
13730 finish_then_clause (if_stmt
);
13735 virtual_size
= c_sizeof (current_class_type
);
13737 /* At the end, call delete if that's what's requested. */
13739 /* FDIS sez: At the point of definition of a virtual destructor
13740 (including an implicit definition), non-placement operator delete
13741 shall be looked up in the scope of the destructor's class and if
13742 found shall be accessible and unambiguous.
13744 This is somewhat unclear, but I take it to mean that if the class
13745 only defines placement deletes we don't do anything here. So we
13746 pass LOOKUP_SPECULATIVELY; delete_sanity will complain for us if
13747 they ever try to delete one of these. */
13748 if (TYPE_GETS_REG_DELETE (current_class_type
)
13749 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13753 exprstmt
= build_op_delete_call
13754 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
13755 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
13757 if_stmt
= begin_if_stmt ();
13758 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13759 current_in_charge_parm
,
13762 finish_expr_stmt (exprstmt
);
13763 finish_then_clause (if_stmt
);
13767 /* Close the block we started above. */
13768 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
13771 /* Finish up a function declaration and compile that function
13772 all the way to assembler language output. The free the storage
13773 for the function definition.
13775 This is called after parsing the body of the function definition.
13776 LINENO is the current line number.
13778 FLAGS is a bitwise or of the following values:
13780 An extra call to poplevel (and expand_end_bindings) must be
13781 made to take care of the binding contour for the base
13782 initializers. This is only relevant for constructors.
13784 We just finished processing the body of an in-class inline
13785 function definition. (This processing will have taken place
13786 after the class definition is complete.) */
13789 finish_function (lineno
, flags
)
13793 register tree fndecl
= current_function_decl
;
13794 tree fntype
, ctype
= NULL_TREE
;
13795 /* Label to use if this function is supposed to return a value. */
13796 tree no_return_label
= NULL_TREE
;
13797 int call_poplevel
= (flags
& 1) != 0;
13798 int inclass_inline
= (flags
& 2) != 0;
13802 /* When we get some parse errors, we can end up without a
13803 current_function_decl, so cope. */
13804 if (fndecl
== NULL_TREE
)
13805 return error_mark_node
;
13807 nested
= function_depth
> 1;
13808 fntype
= TREE_TYPE (fndecl
);
13810 /* TREE_READONLY (fndecl) = 1;
13811 This caused &foo to be of type ptr-to-const-function
13812 which then got a warning when stored in a ptr-to-function variable. */
13814 /* This happens on strange parse errors. */
13815 if (! current_function_parms_stored
)
13818 store_parm_decls ();
13821 if (building_stmt_tree ())
13823 if (DECL_CONSTRUCTOR_P (fndecl
))
13825 finish_constructor_body ();
13829 else if (DECL_DESTRUCTOR_P (fndecl
) && !processing_template_decl
)
13830 finish_destructor_body ();
13831 else if (DECL_MAIN_P (fndecl
))
13833 /* Make it so that `main' always returns 0 by default. */
13835 finish_return_stmt (integer_one_node
);
13837 finish_return_stmt (integer_zero_node
);
13841 /* Finish dealing with exception specifiers. */
13842 if (flag_exceptions
&& !processing_template_decl
13843 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13844 expand_end_eh_spec (TYPE_RAISES_EXCEPTIONS
13845 (TREE_TYPE (current_function_decl
)),
13846 current_eh_spec_try_block
);
13851 if (write_symbols
!= NO_DEBUG
/*&& TREE_CODE (fntype) != METHOD_TYPE*/)
13853 /* Keep this code around in case we later want to control debug info
13854 based on whether a type is "used". (jason 1999-11-11) */
13856 tree ttype
= target_type (fntype
);
13859 if (IS_AGGR_TYPE (ttype
))
13860 /* Let debugger know it should output info for this type. */
13861 note_debug_info_needed (ttype
);
13863 for (parmdecl
= DECL_ARGUMENTS (fndecl
); parmdecl
; parmdecl
= TREE_CHAIN (parmdecl
))
13865 ttype
= target_type (TREE_TYPE (parmdecl
));
13866 if (IS_AGGR_TYPE (ttype
))
13867 /* Let debugger know it should output info for this type. */
13868 note_debug_info_needed (ttype
);
13873 /* Clean house because we will need to reorder insns here. */
13874 do_pending_stack_adjust ();
13878 else if (DECL_CONSTRUCTOR_P (fndecl
))
13883 else if (return_label
!= NULL_RTX
13884 && flag_this_is_variable
<= 0
13885 && current_function_return_value
== NULL_TREE
13886 && ! DECL_NAME (DECL_RESULT (current_function_decl
)))
13887 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13889 if (flag_exceptions
)
13890 expand_exception_blocks ();
13892 /* If this function is supposed to return a value, ensure that
13893 we do not fall into the cleanups by mistake. The end of our
13894 function will look like this:
13896 user code (may have return stmt somewhere)
13897 goto no_return_label
13902 NOTE_INSN_FUNCTION_END
13906 If the user omits a return stmt in the USER CODE section, we
13907 will have a control path which reaches NOTE_INSN_FUNCTION_END.
13908 Otherwise, we won't. */
13909 if (no_return_label
)
13911 DECL_CONTEXT (no_return_label
) = fndecl
;
13912 DECL_INITIAL (no_return_label
) = error_mark_node
;
13913 DECL_SOURCE_FILE (no_return_label
) = input_filename
;
13914 DECL_SOURCE_LINE (no_return_label
) = lineno
;
13915 expand_goto (no_return_label
);
13920 /* Remove the binding contour which is used
13921 to catch cleanup-generated temporaries. */
13922 expand_end_bindings (0, 0, 0);
13923 poplevel (0, 0, 0);
13925 /* Emit label at beginning of cleanup code for parameters. */
13926 emit_label (cleanup_label
);
13929 /* Get return value into register if that's where it's supposed
13931 if (original_result_rtx
)
13932 fixup_result_decl (DECL_RESULT (fndecl
), original_result_rtx
);
13934 /* Finish building code that will trigger warnings if users forget
13935 to make their functions return values. */
13936 if (no_return_label
|| cleanup_label
)
13937 emit_jump (return_label
);
13938 if (no_return_label
)
13940 /* We don't need to call `expand_*_return' here because we
13941 don't need any cleanups here--this path of code is only
13942 for error checking purposes. */
13943 expand_label (no_return_label
);
13946 /* We hard-wired immediate_size_expand to zero in
13947 start_function. Expand_function_end will decrement this
13948 variable. So, we set the variable to one here, so that after
13949 the decrement it will remain zero. */
13950 immediate_size_expand
= 1;
13952 /* Generate rtl for function exit. */
13953 expand_function_end (input_filename
, lineno
, 1);
13956 /* We have to save this value here in case
13957 maybe_end_member_template_processing decides to pop all the
13958 template parameters. */
13959 expand_p
= !building_stmt_tree ();
13961 /* If we're saving up tree structure, tie off the function now. */
13963 finish_stmt_tree (&DECL_SAVED_TREE (fndecl
));
13965 /* This must come after expand_function_end because cleanups might
13966 have declarations (from inline functions) that need to go into
13967 this function's blocks. */
13968 if (doing_semantic_analysis_p ())
13970 if (current_binding_level
->parm_flag
!= 1)
13971 my_friendly_abort (122);
13972 poplevel (1, 0, 1);
13975 /* Remember that we were in class scope. */
13976 if (current_class_name
)
13977 ctype
= current_class_type
;
13979 /* Must mark the RESULT_DECL as being in this function. */
13980 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
13982 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
13983 to the FUNCTION_DECL node itself. */
13984 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
13986 /* Save away current state, if appropriate. */
13987 if (!expanding_p
&& !processing_template_decl
)
13988 save_function_data (fndecl
);
13990 /* If this function calls `setjmp' it cannot be inlined. When
13991 `longjmp' is called it is not guaranteed to restore the value of
13992 local variables that have been modified since the call to
13993 `setjmp'. So, if were to inline this function into some caller
13994 `c', then when we `longjmp', we might not restore all variables
13995 in `c'. (It might seem, at first blush, that there's no way for
13996 this function to modify local variables in `c', but their
13997 addresses may have been stored somewhere accessible to this
13999 if (!expanding_p
&& !processing_template_decl
&& calls_setjmp_p (fndecl
))
14000 DECL_UNINLINABLE (fndecl
) = 1;
14007 /* So we can tell if jump_optimize sets it to 1. */
14010 /* Before we call rest_of_compilation (which will pop the
14011 CURRENT_FUNCTION), we must save these values. */
14012 returns_null
= current_function_returns_null
;
14013 returns_value
= current_function_returns_value
;
14015 /* If this is a nested function (like a template instantiation
14016 that we're compiling in the midst of compiling something
14017 else), push a new GC context. That will keep local variables
14018 on the stack from being collected while we're doing the
14019 compilation of this function. */
14020 if (function_depth
> 1)
14021 ggc_push_context ();
14023 /* Run the optimizers and output the assembler code for this
14025 if (DECL_ARTIFICIAL (fndecl
))
14027 /* Do we really *want* to inline this synthesized method? */
14029 int save_fif
= flag_inline_functions
;
14030 flag_inline_functions
= 1;
14032 /* Turn off DECL_INLINE for the moment so function_cannot_inline_p
14033 will check our size. */
14034 DECL_INLINE (fndecl
) = 0;
14036 rest_of_compilation (fndecl
);
14037 flag_inline_functions
= save_fif
;
14040 rest_of_compilation (fndecl
);
14042 /* Undo the call to ggc_push_context above. */
14043 if (function_depth
> 1)
14044 ggc_pop_context ();
14046 if (DECL_SAVED_INSNS (fndecl
) && ! TREE_ASM_WRITTEN (fndecl
))
14048 /* Set DECL_EXTERNAL so that assemble_external will be called as
14049 necessary. We'll clear it again in finish_file. */
14050 if (! DECL_EXTERNAL (fndecl
))
14051 DECL_NOT_REALLY_EXTERN (fndecl
) = 1;
14052 DECL_EXTERNAL (fndecl
) = 1;
14053 mark_inline_for_output (fndecl
);
14057 /* Keep this code around in case we later want to control debug info
14058 based on whether a type is "used". (jason 1999-11-11) */
14060 if (ctype
&& TREE_ASM_WRITTEN (fndecl
))
14061 note_debug_info_needed (ctype
);
14064 returns_null
|= can_reach_end
;
14066 /* Since we don't normally go through c_expand_return for constructors,
14067 this normally gets the wrong value.
14068 Also, named return values have their return codes emitted after
14069 NOTE_INSN_FUNCTION_END, confusing jump.c. */
14070 if (DECL_CONSTRUCTOR_P (fndecl
)
14071 || DECL_NAME (DECL_RESULT (fndecl
)) != NULL_TREE
)
14074 if (TREE_THIS_VOLATILE (fndecl
) && returns_null
)
14075 cp_warning ("`noreturn' function `%D' does return", fndecl
);
14076 else if ((warn_return_type
|| pedantic
)
14078 && TREE_CODE (TREE_TYPE (fntype
)) != VOID_TYPE
)
14080 /* If this function returns non-void and control can drop through,
14082 cp_warning ("control reaches end of non-void function `%D'", fndecl
);
14084 /* With just -W, complain only if function returns both with
14085 and without a value. */
14086 else if (extra_warnings
&& returns_value
&& returns_null
)
14087 warning ("this function may return with or without a value");
14091 /* Clear out memory we no longer need. */
14092 free_after_parsing (cfun
);
14093 /* Since we never call rest_of_compilation, we never clear
14094 CFUN. Do so explicitly. */
14095 free_after_compilation (cfun
);
14099 /* If this is a in-class inline definition, we may have to pop the
14100 bindings for the template parameters that we added in
14101 maybe_begin_member_template_processing when start_function was
14103 if (inclass_inline
)
14104 maybe_end_member_template_processing ();
14106 /* Leave the scope of the class. */
14108 pop_nested_class ();
14112 if (!DECL_SAVED_INSNS (fndecl
) && !DECL_SAVED_FUNCTION_DATA (fndecl
)
14113 && !(flag_inline_trees
&& DECL_INLINE (fndecl
)))
14117 /* Stop pointing to the local nodes about to be freed. */
14118 /* But DECL_INITIAL must remain nonzero so we know this
14119 was an actual function definition. */
14120 DECL_INITIAL (fndecl
) = error_mark_node
;
14121 for (t
= DECL_ARGUMENTS (fndecl
); t
; t
= TREE_CHAIN (t
))
14122 DECL_RTL (t
) = DECL_INCOMING_RTL (t
) = NULL_RTX
;
14125 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
14126 static_ctors
= tree_cons (NULL_TREE
, fndecl
, static_ctors
);
14127 if (DECL_STATIC_DESTRUCTOR (fndecl
))
14128 static_dtors
= tree_cons (NULL_TREE
, fndecl
, static_dtors
);
14133 /* Let the error reporting routines know that we're outside a
14134 function. For a nested function, this value is used in
14135 pop_cp_function_context and then reset via pop_function_context. */
14136 current_function_decl
= NULL_TREE
;
14137 /* We don't really care about obstacks, but the middle-end
14138 sometimes cares on what obstck things are located. */
14139 permanent_allocation (1);
14145 /* Create the FUNCTION_DECL for a function definition.
14146 DECLSPECS and DECLARATOR are the parts of the declaration;
14147 they describe the return type and the name of the function,
14148 but twisted together in a fashion that parallels the syntax of C.
14150 This function creates a binding context for the function body
14151 as well as setting up the FUNCTION_DECL in current_function_decl.
14153 Returns a FUNCTION_DECL on success.
14155 If the DECLARATOR is not suitable for a function (it defines a datum
14156 instead), we return 0, which tells yyparse to report a parse error.
14158 May return void_type_node indicating that this method is actually
14159 a friend. See grokfield for more details.
14161 Came here with a `.pushlevel' .
14163 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14164 CHANGES TO CODE IN `grokfield'. */
14167 start_method (declspecs
, declarator
, attrlist
)
14168 tree declarator
, declspecs
, attrlist
;
14170 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
14173 /* Something too ugly to handle. */
14174 if (fndecl
== NULL_TREE
)
14177 /* Pass friends other than inline friend functions back. */
14178 if (fndecl
== void_type_node
)
14181 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
14182 /* Not a function, tell parser to report parse error. */
14185 if (DECL_IN_AGGR_P (fndecl
))
14187 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
14189 if (DECL_CONTEXT (fndecl
)
14190 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
14191 cp_error ("`%D' is already defined in class %s", fndecl
,
14192 TYPE_NAME_STRING (DECL_CONTEXT (fndecl
)));
14194 return void_type_node
;
14197 check_template_shadow (fndecl
);
14199 DECL_THIS_INLINE (fndecl
) = 1;
14201 if (flag_default_inline
)
14202 DECL_INLINE (fndecl
) = 1;
14204 /* We process method specializations in finish_struct_1. */
14205 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
14206 fndecl
= push_template_decl (fndecl
);
14208 /* We read in the parameters on the maybepermanent_obstack,
14209 but we won't be getting back to them until after we
14210 may have clobbered them. So the call to preserve_data
14211 will keep them safe. */
14214 if (! DECL_FRIEND_P (fndecl
))
14216 if (TREE_CHAIN (fndecl
))
14218 fndecl
= copy_node (fndecl
);
14219 TREE_CHAIN (fndecl
) = NULL_TREE
;
14222 if (DECL_CONSTRUCTOR_P (fndecl
))
14224 if (! grok_ctor_properties (current_class_type
, fndecl
))
14225 return void_type_node
;
14227 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
14228 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
14231 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0);
14233 /* Make a place for the parms */
14235 current_binding_level
->parm_flag
= 1;
14237 DECL_IN_AGGR_P (fndecl
) = 1;
14241 /* Go through the motions of finishing a function definition.
14242 We don't compile this method until after the whole class has
14245 FINISH_METHOD must return something that looks as though it
14246 came from GROKFIELD (since we are defining a method, after all).
14248 This is called after parsing the body of the function definition.
14249 STMTS is the chain of statements that makes up the function body.
14251 DECL is the ..._DECL that `start_method' provided. */
14254 finish_method (decl
)
14257 register tree fndecl
= decl
;
14260 register tree link
;
14262 if (decl
== void_type_node
)
14265 old_initial
= DECL_INITIAL (fndecl
);
14267 /* Undo the level for the parms (from start_method).
14268 This is like poplevel, but it causes nothing to be
14269 saved. Saving information here confuses symbol-table
14270 output routines. Besides, this information will
14271 be correctly output when this method is actually
14274 /* Clear out the meanings of the local variables of this level;
14275 also record in each decl which block it belongs to. */
14277 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
14279 if (DECL_NAME (link
) != NULL_TREE
)
14280 pop_binding (DECL_NAME (link
), link
);
14281 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
14282 DECL_CONTEXT (link
) = NULL_TREE
;
14285 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
14286 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
14287 current_binding_level
->parm_flag
,
14288 current_binding_level
->keep
);
14290 poplevel (0, 0, 0);
14292 DECL_INITIAL (fndecl
) = old_initial
;
14294 /* We used to check if the context of FNDECL was different from
14295 current_class_type as another way to get inside here. This didn't work
14296 for String.cc in libg++. */
14297 if (DECL_FRIEND_P (fndecl
))
14299 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
14300 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
14301 decl
= void_type_node
;
14307 /* Called when a new struct TYPE is defined.
14308 If this structure or union completes the type of any previous
14309 variable declaration, lay it out and output its rtl. */
14312 hack_incomplete_structures (type
)
14316 struct binding_level
*level
;
14318 if (!type
) /* Don't do this for class templates. */
14321 if (namespace_bindings_p ())
14324 list
= &namespace_scope_incomplete
;
14328 level
= innermost_nonclass_level ();
14329 list
= &level
->incomplete
;
14336 tree decl
= TREE_VALUE (*list
);
14337 if ((decl
&& TREE_TYPE (decl
) == type
)
14338 || (TREE_TYPE (decl
)
14339 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14340 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
14342 int toplevel
= toplevel_bindings_p ();
14343 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14344 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
14345 layout_type (TREE_TYPE (decl
));
14346 layout_decl (decl
, 0);
14347 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
14351 expand_decl (decl
);
14352 cleanup
= maybe_build_cleanup (decl
);
14353 expand_decl_init (decl
);
14354 if (! expand_decl_cleanup (decl
, cleanup
))
14355 cp_error ("parser lost in parsing declaration of `%D'",
14358 *list
= TREE_CHAIN (*list
);
14361 list
= &TREE_CHAIN (*list
);
14364 /* Keep looking through artificial binding levels generated
14365 for local variables. */
14366 if (level
&& level
->keep
== 2)
14368 level
= level
->level_chain
;
14369 list
= &level
->incomplete
;
14376 /* If DECL is of a type which needs a cleanup, build that cleanup here.
14377 See build_delete for information about AUTO_DELETE.
14379 Don't build these on the momentary obstack; they must live
14380 the life of the binding contour. */
14383 maybe_build_cleanup_1 (decl
, auto_delete
)
14384 tree decl
, auto_delete
;
14386 tree type
= TREE_TYPE (decl
);
14387 if (type
!= error_mark_node
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
14389 int flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14392 if (TREE_CODE (type
) == ARRAY_TYPE
)
14396 mark_addressable (decl
);
14397 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14400 /* Optimize for space over speed here. */
14401 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14402 || flag_expensive_optimizations
)
14403 flags
|= LOOKUP_NONVIRTUAL
;
14405 rval
= build_delete (TREE_TYPE (rval
), rval
, auto_delete
, flags
, 0);
14407 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14408 && ! TYPE_HAS_DESTRUCTOR (type
))
14409 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14410 build_tree_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14417 /* If DECL is of a type which needs a cleanup, build that cleanup
14418 here. The cleanup does free the storage with a call to delete. */
14421 maybe_build_cleanup_and_delete (decl
)
14424 return maybe_build_cleanup_1 (decl
, integer_three_node
);
14427 /* If DECL is of a type which needs a cleanup, build that cleanup
14428 here. The cleanup does not free the storage with a call a delete. */
14431 maybe_build_cleanup (decl
)
14434 return maybe_build_cleanup_1 (decl
, integer_two_node
);
14437 /* Expand a C++ expression at the statement level.
14438 This is needed to ferret out nodes which have UNKNOWN_TYPE.
14439 The C++ type checker should get all of these out when
14440 expressions are combined with other, type-providing, expressions,
14441 leaving only orphan expressions, such as:
14443 &class::bar; / / takes its address, but does nothing with it. */
14446 cplus_expand_expr_stmt (exp
)
14449 if (stmts_are_full_exprs_p
)
14450 exp
= convert_to_void (exp
, "statement");
14453 /* We should do this eventually, but right now this causes regex.o from
14454 libg++ to miscompile, and tString to core dump. */
14455 exp
= build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (exp
), exp
);
14458 /* If we don't do this, we end up down inside expand_expr
14459 trying to do TYPE_MODE on the ERROR_MARK, and really
14460 go outside the bounds of the type. */
14461 if (exp
!= error_mark_node
)
14462 expand_expr_stmt (exp
);
14465 /* When a stmt has been parsed, this function is called. */
14470 /* Always assume this statement was not an expression statement. If
14471 it actually was an expression statement, its our callers
14472 responsibility to fix this up. */
14473 last_expr_type
= NULL_TREE
;
14476 /* Change a static member function definition into a FUNCTION_TYPE, instead
14477 of the METHOD_TYPE that we create when it's originally parsed.
14479 WARNING: DO NOT pass &TREE_TYPE (decl) to FN or &TYPE_ARG_TYPES
14480 (TREE_TYPE (decl)) to ARGTYPES, as doing so will corrupt the types of
14481 other decls. Either pass the addresses of local variables or NULL. */
14484 revert_static_member_fn (decl
, fn
, argtypes
)
14485 tree
*decl
, *fn
, *argtypes
;
14488 tree function
= fn
? *fn
: TREE_TYPE (*decl
);
14489 tree args
= argtypes
? *argtypes
: TYPE_ARG_TYPES (function
);
14491 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14492 != TYPE_UNQUALIFIED
)
14493 cp_error ("static member function `%#D' declared with type qualifiers",
14496 args
= TREE_CHAIN (args
);
14497 tmp
= build_function_type (TREE_TYPE (function
), args
);
14498 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14499 tmp
= build_exception_variant (tmp
,
14500 TYPE_RAISES_EXCEPTIONS (function
));
14501 TREE_TYPE (*decl
) = tmp
;
14502 if (DECL_ARGUMENTS (*decl
))
14503 DECL_ARGUMENTS (*decl
) = TREE_CHAIN (DECL_ARGUMENTS (*decl
));
14504 DECL_STATIC_FUNCTION_P (*decl
) = 1;
14511 /* Initialize the variables used during compilation of a C++
14515 push_cp_function_context (f
)
14516 struct function
*f
;
14518 struct language_function
*p
14519 = ((struct language_function
*)
14520 xcalloc (1, sizeof (struct language_function
)));
14523 /* It takes an explicit call to expand_body to generate RTL for a
14527 /* Whenever we start a new function, we destroy temporaries in the
14529 stmts_are_full_exprs_p
= 1;
14532 /* Free the language-specific parts of F, now that we've finished
14533 compiling the function. */
14536 pop_cp_function_context (f
)
14537 struct function
*f
;
14540 free (f
->language
);
14544 /* Mark P for GC. */
14547 mark_lang_function (p
)
14548 struct language_function
*p
;
14553 ggc_mark_tree (p
->x_named_labels
);
14554 ggc_mark_tree (p
->x_ctor_label
);
14555 ggc_mark_tree (p
->x_dtor_label
);
14556 ggc_mark_tree (p
->x_base_init_list
);
14557 ggc_mark_tree (p
->x_member_init_list
);
14558 ggc_mark_tree (p
->x_current_class_ptr
);
14559 ggc_mark_tree (p
->x_current_class_ref
);
14560 ggc_mark_tree (p
->x_eh_spec_try_block
);
14561 ggc_mark_tree (p
->x_scope_stmt_stack
);
14563 ggc_mark_rtx (p
->x_result_rtx
);
14565 mark_stmt_tree (&p
->x_stmt_tree
);
14566 mark_binding_level (&p
->bindings
);
14569 /* Mark the language-specific data in F for GC. */
14572 mark_cp_function_context (f
)
14573 struct function
*f
;
14575 mark_lang_function (f
->language
);
14581 return function_depth
!= 0;
14586 lang_mark_false_label_stack (l
)
14587 struct label_node
*l
;
14589 /* C++ doesn't use false_label_stack. It better be NULL. */
14590 my_friendly_assert (l
== NULL
, 19990904);
14597 enum tree_code code
= TREE_CODE (t
);
14598 if (code
== IDENTIFIER_NODE
)
14600 struct lang_identifier
*li
= (struct lang_identifier
*) t
;
14601 struct lang_id2
*li2
= li
->x
;
14602 ggc_mark_tree (li
->namespace_bindings
);
14603 ggc_mark_tree (li
->bindings
);
14604 ggc_mark_tree (li
->class_value
);
14605 ggc_mark_tree (li
->class_template_info
);
14609 ggc_mark_tree (li2
->label_value
);
14610 ggc_mark_tree (li2
->implicit_decl
);
14611 ggc_mark_tree (li2
->error_locus
);
14614 else if (code
== CPLUS_BINDING
)
14616 if (BINDING_HAS_LEVEL_P (t
))
14617 mark_binding_level (&BINDING_LEVEL (t
));
14619 ggc_mark_tree (BINDING_SCOPE (t
));
14620 ggc_mark_tree (BINDING_VALUE (t
));
14622 else if (code
== OVERLOAD
)
14623 ggc_mark_tree (OVL_FUNCTION (t
));
14624 else if (code
== TEMPLATE_PARM_INDEX
)
14625 ggc_mark_tree (TEMPLATE_PARM_DECL (t
));
14626 else if (TREE_CODE_CLASS (code
) == 'd')
14628 struct lang_decl
*ld
= DECL_LANG_SPECIFIC (t
);
14633 if (!DECL_GLOBAL_CTOR_P (t
) && !DECL_GLOBAL_DTOR_P (t
))
14634 ggc_mark_tree (ld
->decl_flags
.u2
.access
);
14635 ggc_mark_tree (ld
->decl_flags
.context
);
14636 if (TREE_CODE (t
) != NAMESPACE_DECL
)
14637 ggc_mark_tree (ld
->decl_flags
.u
.template_info
);
14639 mark_binding_level (&NAMESPACE_LEVEL (t
));
14640 if (CAN_HAVE_FULL_LANG_DECL_P (t
))
14642 ggc_mark_tree (ld
->main_decl_variant
);
14643 ggc_mark_tree (ld
->befriending_classes
);
14644 ggc_mark_tree (ld
->saved_tree
);
14645 if (TREE_CODE (t
) == TYPE_DECL
)
14646 ggc_mark_tree (ld
->u
.sorted_fields
);
14647 else if (TREE_CODE (t
) == FUNCTION_DECL
14648 && !DECL_PENDING_INLINE_P (t
))
14649 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t
));
14653 else if (TREE_CODE_CLASS (code
) == 't')
14655 struct lang_type
*lt
= TYPE_LANG_SPECIFIC (t
);
14657 if (lt
&& !(TREE_CODE (t
) == POINTER_TYPE
14658 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
14661 ggc_mark_tree (lt
->vfields
);
14662 ggc_mark_tree (lt
->vbases
);
14663 ggc_mark_tree (lt
->tags
);
14664 ggc_mark_tree (lt
->search_slot
);
14665 ggc_mark_tree (lt
->size
);
14666 ggc_mark_tree (lt
->pure_virtuals
);
14667 ggc_mark_tree (lt
->friend_classes
);
14668 ggc_mark_tree (lt
->rtti
);
14669 ggc_mark_tree (lt
->methods
);
14670 ggc_mark_tree (lt
->template_info
);
14671 ggc_mark_tree (lt
->befriending_classes
);
14674 /* In the case of pointer-to-member function types, the
14675 TYPE_LANG_SPECIFIC is really just a tree. */
14676 ggc_mark_tree ((tree
) lt
);