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. */
48 extern int current_class_depth
;
50 extern tree static_ctors
, static_dtors
;
52 extern tree global_namespace
;
54 extern int (*valid_lang_attribute
) PARAMS ((tree
, tree
, tree
, tree
));
56 /* Use garbage collection. */
60 #ifndef WCHAR_UNSIGNED
61 #define WCHAR_UNSIGNED 0
64 #ifndef CHAR_TYPE_SIZE
65 #define CHAR_TYPE_SIZE BITS_PER_UNIT
68 #ifndef BOOL_TYPE_SIZE
69 #ifdef SLOW_BYTE_ACCESS
70 /* In the new ABI, `bool' has size and alignment `1', on all
72 #define BOOL_TYPE_SIZE \
73 ((SLOW_BYTE_ACCESS && !flag_new_abi) ? (POINTER_SIZE) : (CHAR_TYPE_SIZE))
75 #define BOOL_TYPE_SIZE CHAR_TYPE_SIZE
79 /* We let tm.h override the types used here, to handle trivial differences
80 such as the choice of unsigned int or long unsigned int for size_t.
81 When machines start needing nontrivial differences in the size type,
82 it would be best to do something here to figure out automatically
83 from other information what type to use. */
86 #define SIZE_TYPE "long unsigned int"
90 #define PTRDIFF_TYPE "long int"
94 #define WCHAR_TYPE "int"
97 static tree grokparms
PARAMS ((tree
, int));
98 static const char *redeclaration_error_message
PARAMS ((tree
, tree
));
100 static void push_binding_level
PARAMS ((struct binding_level
*, int,
102 static void pop_binding_level
PARAMS ((void));
103 static void suspend_binding_level
PARAMS ((void));
104 static void resume_binding_level
PARAMS ((struct binding_level
*));
105 static struct binding_level
*make_binding_level
PARAMS ((void));
106 static void declare_namespace_level
PARAMS ((void));
107 static int decl_jump_unsafe
PARAMS ((tree
));
108 static void storedecls
PARAMS ((tree
));
109 static void require_complete_types_for_parms
PARAMS ((tree
));
110 static int ambi_op_p
PARAMS ((enum tree_code
));
111 static int unary_op_p
PARAMS ((enum tree_code
));
112 static tree store_bindings
PARAMS ((tree
, tree
));
113 static tree lookup_tag_reverse
PARAMS ((tree
, tree
));
114 static tree obscure_complex_init
PARAMS ((tree
, tree
));
115 static tree lookup_name_real
PARAMS ((tree
, int, int, int));
116 static void warn_extern_redeclared_static
PARAMS ((tree
, tree
));
117 static void grok_reference_init
PARAMS ((tree
, tree
, tree
));
118 static tree grokfndecl
PARAMS ((tree
, tree
, tree
, tree
, int,
119 enum overload_flags
, tree
,
120 tree
, int, int, int, int, int, int, tree
));
121 static tree grokvardecl
PARAMS ((tree
, tree
, RID_BIT_TYPE
*, int, int, tree
));
122 static tree lookup_tag
PARAMS ((enum tree_code
, tree
,
123 struct binding_level
*, int));
124 static void set_identifier_type_value_with_scope
125 PARAMS ((tree
, tree
, struct binding_level
*));
126 static void record_builtin_type
PARAMS ((enum rid
, const char *, tree
));
127 static void record_unknown_type
PARAMS ((tree
, const char *));
128 static tree build_library_fn_1
PARAMS ((tree
, enum tree_code
, tree
));
129 static int member_function_or_else
PARAMS ((tree
, tree
, enum overload_flags
));
130 static void bad_specifiers
PARAMS ((tree
, const char *, int, int, int, int,
132 static tree maybe_process_template_type_declaration
PARAMS ((tree
, int, struct binding_level
*));
133 static void check_for_uninitialized_const_var
PARAMS ((tree
));
134 static unsigned long typename_hash
PARAMS ((hash_table_key
));
135 static boolean typename_compare
PARAMS ((hash_table_key
, hash_table_key
));
136 static void push_binding
PARAMS ((tree
, tree
, struct binding_level
*));
137 static int add_binding
PARAMS ((tree
, tree
));
138 static void pop_binding
PARAMS ((tree
, tree
));
139 static tree local_variable_p_walkfn
PARAMS ((tree
*, int *, void *));
140 static tree find_binding
PARAMS ((tree
, tree
));
141 static tree select_decl
PARAMS ((tree
, int));
142 static int lookup_flags
PARAMS ((int, int));
143 static tree qualify_lookup
PARAMS ((tree
, int));
144 static tree record_builtin_java_type
PARAMS ((const char *, int));
145 static const char *tag_name
PARAMS ((enum tag_types code
));
146 static void find_class_binding_level
PARAMS ((void));
147 static struct binding_level
*innermost_nonclass_level
PARAMS ((void));
148 static void warn_about_implicit_typename_lookup
PARAMS ((tree
, tree
));
149 static int walk_namespaces_r
PARAMS ((tree
, walk_namespaces_fn
, void *));
150 static int walk_globals_r
PARAMS ((tree
, void *));
151 static void add_decl_to_level
PARAMS ((tree
, struct binding_level
*));
152 static tree make_label_decl
PARAMS ((tree
, int));
153 static void use_label
PARAMS ((tree
));
154 static void check_previous_goto_1
PARAMS ((tree
, struct binding_level
*, tree
,
156 static void check_previous_goto
PARAMS ((struct named_label_use_list
*));
157 static void check_switch_goto
PARAMS ((struct binding_level
*));
158 static void check_previous_gotos
PARAMS ((tree
));
159 static void pop_label
PARAMS ((tree
, tree
));
160 static void pop_labels
PARAMS ((tree
));
161 static void maybe_deduce_size_from_array_init
PARAMS ((tree
, tree
));
162 static void layout_var_decl
PARAMS ((tree
));
163 static void maybe_commonize_var
PARAMS ((tree
));
164 static tree check_initializer
PARAMS ((tree
, tree
));
165 static void make_rtl_for_nonlocal_decl
PARAMS ((tree
, tree
, const char *));
166 static void push_cp_function_context
PARAMS ((struct function
*));
167 static void pop_cp_function_context
PARAMS ((struct function
*));
168 static void mark_binding_level
PARAMS ((void *));
169 static void mark_named_label_lists
PARAMS ((void *, void *));
170 static void mark_cp_function_context
PARAMS ((struct function
*));
171 static void mark_saved_scope
PARAMS ((void *));
172 static void mark_lang_function
PARAMS ((struct cp_language_function
*));
173 static void mark_stmt_tree
PARAMS ((stmt_tree
));
174 static void save_function_data
PARAMS ((tree
));
175 static void check_function_type
PARAMS ((tree
));
176 static void destroy_local_var
PARAMS ((tree
));
177 static void finish_constructor_body
PARAMS ((void));
178 static void finish_destructor_body
PARAMS ((void));
179 static tree create_array_type_for_decl
PARAMS ((tree
, tree
, tree
));
180 static tree get_atexit_node
PARAMS ((void));
181 static tree get_dso_handle_node
PARAMS ((void));
182 static tree start_cleanup_fn
PARAMS ((void));
183 static void end_cleanup_fn
PARAMS ((void));
184 static tree cp_make_fname_decl
PARAMS ((tree
, const char *, int));
185 static void initialize_predefined_identifiers
PARAMS ((void));
186 static tree check_special_function_return_type
187 PARAMS ((special_function_kind
, tree
, tree
, tree
));
188 static tree push_cp_library_fn
PARAMS ((enum tree_code
, tree
));
189 static tree build_cp_library_fn
PARAMS ((tree
, enum tree_code
, tree
));
191 #if defined (DEBUG_CP_BINDING_LEVELS)
192 static void indent
PARAMS ((void));
195 /* Erroneous argument lists can use this *IFF* they do not modify it. */
196 tree error_mark_list
;
198 /* The following symbols are subsumed in the cp_global_trees array, and
199 listed here individually for documentation purposes.
202 tree wchar_decl_node;
204 tree vtable_entry_type;
205 tree delta_type_node;
208 tree __baselist_desc_type_node;
209 tree __i_desc_type_node, __m_desc_type_node;
210 tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type;
212 tree __t_desc_type_node;
214 tree __tp_desc_type_node;
216 tree ti_desc_type_node;
217 tree bltn_desc_type_node, ptr_desc_type_node;
218 tree ary_desc_type_node, func_desc_type_node, enum_desc_type_node;
219 tree class_desc_type_node, si_class_desc_type_node, vmi_class_desc_type_node;
220 tree ptm_desc_type_node;
221 tree base_desc_type_node;
223 Not needed yet? May be needed one day?
224 tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type;
225 tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type;
226 tree __ptmf_desc_array_type, __ptmd_desc_array_type;
229 tree class_type_node, record_type_node, union_type_node, enum_type_node;
230 tree unknown_type_node;
232 Array type `vtable_entry_type[]'
235 tree vtbl_ptr_type_node;
242 A FUNCTION_DECL which can call `abort'. Not necessarily the
243 one that the user will declare, but sufficient to be called
244 by routines that want to abort the program.
248 The FUNCTION_DECL for the default `::operator delete'.
250 tree global_delete_fndecl;
253 tree type_info_type_node, tinfo_decl_id, tinfo_decl_type;
258 tree cp_global_trees
[CPTI_MAX
];
260 /* Indicates that there is a type value in some namespace, although
261 that is not necessarily in scope at the moment. */
263 static tree global_type_node
;
268 /* Expect only namespace names now. */
269 static int only_namespace_names
;
271 /* Used only for jumps to as-yet undefined labels, since jumps to
272 defined labels can have their validity checked immediately. */
274 struct named_label_use_list
276 struct binding_level
*binding_level
;
279 const char *filename_o_goto
;
281 struct named_label_use_list
*next
;
284 #define named_label_uses cp_function_chain->x_named_label_uses
286 /* A list of objects which have constructors or destructors
287 which reside in the global scope. The decl is stored in
288 the TREE_VALUE slot and the initializer is stored
289 in the TREE_PURPOSE slot. */
290 tree static_aggregates
;
294 /* A node for the integer constants 2, and 3. */
296 tree integer_two_node
, integer_three_node
;
298 /* Parsing a function declarator leaves here a chain of structure
299 and enum types declared in the parmlist. */
301 static tree last_function_parm_tags
;
303 /* Similar, for last_function_parm_tags. */
304 tree last_function_parms
;
305 static tree current_function_parm_tags
;
307 /* A list of all LABEL_DECLs in the function that have names. Here so
308 we can clear out their names' definitions at the end of the
309 function, and so we can check the validity of jumps to these labels. */
311 struct named_label_list
313 struct binding_level
*binding_level
;
319 struct named_label_list
*next
;
322 #define named_labels cp_function_chain->x_named_labels
324 /* Set to 0 at beginning of a function definition, and whenever
325 a label (case or named) is defined. Set to value of expression
326 returned from function when that value can be transformed into
327 a named return value. */
329 tree current_function_return_value
;
331 /* Nonzero means use the ISO C94 dialect of C. */
335 /* Nonzero means use the ISO C99 dialect of C. */
339 /* Nonzero means we are a hosted implementation for code shared with C. */
343 /* Nonzero means add default format_arg attributes for functions not
346 int flag_noniso_default_format_attributes
= 1;
348 /* Nonzero means give `double' the same size as `float'. */
350 extern int flag_short_double
;
352 /* Nonzero means don't recognize any builtin functions. */
354 extern int flag_no_builtin
;
356 /* Nonzero means don't recognize the non-ANSI builtin functions.
359 extern int flag_no_nonansi_builtin
;
361 /* Nonzero if we want to conserve space in the .o files. We do this
362 by putting uninitialized data and runtime initialized data into
363 .common instead of .data at the expense of not flagging multiple
365 extern int flag_conserve_space
;
367 /* C and C++ flags are in decl2.c. */
369 /* Flag used when debugging spew.c */
371 extern int spew_debug
;
373 /* A expression of value 0 with the same precision as a sizetype
375 tree signed_size_zero_node
;
377 /* The name of the anonymous namespace, throughout this translation
379 tree anonymous_namespace_name
;
381 /* The number of function bodies which we are currently processing.
382 (Zero if we are at namespace scope, one inside the body of a
383 function, two inside the body of a function in a local class, etc.) */
386 /* For each binding contour we allocate a binding_level structure
387 which records the names defined in that contour.
390 1) one for each function definition,
391 where internal declarations of the parameters appear.
392 2) one for each compound statement,
393 to record its declarations.
395 The current meaning of a name can be found by searching the levels
396 from the current one out to the global one.
398 Off to the side, may be the class_binding_level. This exists only
399 to catch class-local declarations. It is otherwise nonexistent.
401 Also there may be binding levels that catch cleanups that must be
402 run when exceptions occur. Thus, to see whether a name is bound in
403 the current scope, it is not enough to look in the
404 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
407 /* Note that the information in the `names' component of the global contour
408 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
412 /* A chain of _DECL nodes for all variables, constants, functions,
413 and typedef types. These are in the reverse of the order
414 supplied. There may be OVERLOADs on this list, too, but they
415 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
418 /* A list of structure, union and enum definitions, for looking up
420 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
421 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
422 or ENUMERAL_TYPE node.
424 C++: the TREE_VALUE nodes can be simple types for
425 component_bindings. */
428 /* A list of USING_DECL nodes. */
431 /* A list of used namespaces. PURPOSE is the namespace,
432 VALUE the common ancestor with this binding_level's namespace. */
433 tree using_directives
;
435 /* If this binding level is the binding level for a class, then
436 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
437 is the name of an entity bound in the class; the TREE_VALUE is
438 the IDENTIFIER_CLASS_VALUE before we entered the class. Thus,
439 when leaving class scope, we can restore the
440 IDENTIFIER_CLASS_VALUE by walking this list. The TREE_TYPE is
441 the DECL bound by this name in the class. */
444 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
445 is used for all binding levels. */
448 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
449 label in this scope. The TREE_PURPOSE is the previous value of
450 the IDENTIFIER_LABEL VALUE. */
451 tree shadowed_labels
;
453 /* For each level (except not the global one),
454 a chain of BLOCK nodes for all the levels
455 that were entered and exited one level down. */
458 /* The BLOCK node for this level, if one has been preallocated.
459 If 0, the BLOCK is allocated (if needed) when the level is popped. */
462 /* The _TYPE node for this level, if parm_flag == 2. */
465 /* The binding level which this one is contained in (inherits from). */
466 struct binding_level
*level_chain
;
468 /* List of decls in `names' that have incomplete
469 structure or union types. */
472 /* List of VAR_DECLS saved from a previous for statement.
473 These would be dead in ISO-conforming code, but might
474 be referenced in ARM-era code. These are stored in a
475 TREE_LIST; the TREE_VALUE is the actual declaration. */
476 tree dead_vars_from_for
;
478 /* 1 for the level that holds the parameters of a function.
479 2 for the level that holds a class declaration. */
480 unsigned parm_flag
: 2;
482 /* 1 means make a BLOCK for this level regardless of all else.
483 2 for temporary binding contours created by the compiler. */
486 /* Nonzero if this level "doesn't exist" for tags. */
487 unsigned tag_transparent
: 1;
489 /* Nonzero if this level can safely have additional
490 cleanup-needing variables added to it. */
491 unsigned more_cleanups_ok
: 1;
492 unsigned have_cleanups
: 1;
494 /* Nonzero if this scope is for storing the decls for template
495 parameters and generic decls; these decls will be discarded and
496 replaced with a TEMPLATE_DECL. */
497 unsigned template_parms_p
: 1;
499 /* Nonzero if this scope corresponds to the `<>' in a
500 `template <>' clause. Whenever this flag is set,
501 TEMPLATE_PARMS_P will be set as well. */
502 unsigned template_spec_p
: 1;
504 /* This is set for a namespace binding level. */
505 unsigned namespace_p
: 1;
507 /* True if this level is that of a for-statement where we need to
508 worry about ambiguous (ARM or ISO) scope rules. */
509 unsigned is_for_scope
: 1;
511 /* True if this level corresponds to an EH region, as for a try block.
512 Currently this information is only available while building the
514 unsigned eh_region
: 1;
516 /* Four bits left for this word. */
518 #if defined(DEBUG_CP_BINDING_LEVELS)
519 /* Binding depth at which this level began. */
520 unsigned binding_depth
;
521 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
524 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
526 /* The binding level currently in effect. */
528 #define current_binding_level \
530 ? cp_function_chain->bindings \
531 : scope_chain->bindings)
533 /* The binding level of the current class, if any. */
535 #define class_binding_level scope_chain->class_bindings
537 /* A chain of binding_level structures awaiting reuse. */
539 static struct binding_level
*free_binding_level
;
541 /* The outermost binding level, for names of file scope.
542 This is created when the compiler is started and exists
543 through the entire run. */
545 static struct binding_level
*global_binding_level
;
547 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
549 static int keep_next_level_flag
;
551 #if defined(DEBUG_CP_BINDING_LEVELS)
552 static int binding_depth
= 0;
553 static int is_class_level
= 0;
560 for (i
= 0; i
< binding_depth
*2; i
++)
563 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
565 static tree pushdecl_with_scope
PARAMS ((tree
, struct binding_level
*));
568 push_binding_level (newlevel
, tag_transparent
, keep
)
569 struct binding_level
*newlevel
;
570 int tag_transparent
, keep
;
572 /* Add this level to the front of the chain (stack) of levels that
574 bzero ((char*) newlevel
, sizeof (struct binding_level
));
575 newlevel
->level_chain
= current_binding_level
;
576 current_binding_level
= newlevel
;
577 newlevel
->tag_transparent
= tag_transparent
;
578 newlevel
->more_cleanups_ok
= 1;
580 newlevel
->keep
= keep
;
581 #if defined(DEBUG_CP_BINDING_LEVELS)
582 newlevel
->binding_depth
= binding_depth
;
584 fprintf (stderr
, "push %s level 0x%08x line %d\n",
585 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
588 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
591 /* Find the innermost enclosing class scope, and reset
592 CLASS_BINDING_LEVEL appropriately. */
595 find_class_binding_level ()
597 struct binding_level
*level
= current_binding_level
;
599 while (level
&& level
->parm_flag
!= 2)
600 level
= level
->level_chain
;
601 if (level
&& level
->parm_flag
== 2)
602 class_binding_level
= level
;
604 class_binding_level
= 0;
610 if (global_binding_level
)
612 /* Cannot pop a level, if there are none left to pop. */
613 if (current_binding_level
== global_binding_level
)
614 my_friendly_abort (123);
616 /* Pop the current level, and free the structure for reuse. */
617 #if defined(DEBUG_CP_BINDING_LEVELS)
620 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
621 (is_class_level
) ? "class" : "block",
622 current_binding_level
, lineno
);
623 if (is_class_level
!= (current_binding_level
== class_binding_level
))
626 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
629 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
631 register struct binding_level
*level
= current_binding_level
;
632 current_binding_level
= current_binding_level
->level_chain
;
633 level
->level_chain
= free_binding_level
;
634 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
635 if (level
->binding_depth
!= binding_depth
)
637 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
638 free_binding_level
= level
;
639 find_class_binding_level ();
644 suspend_binding_level ()
646 if (class_binding_level
)
647 current_binding_level
= class_binding_level
;
649 if (global_binding_level
)
651 /* Cannot suspend a level, if there are none left to suspend. */
652 if (current_binding_level
== global_binding_level
)
653 my_friendly_abort (123);
655 /* Suspend the current level. */
656 #if defined(DEBUG_CP_BINDING_LEVELS)
659 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
660 (is_class_level
) ? "class" : "block",
661 current_binding_level
, lineno
);
662 if (is_class_level
!= (current_binding_level
== class_binding_level
))
665 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
668 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
669 current_binding_level
= current_binding_level
->level_chain
;
670 find_class_binding_level ();
674 resume_binding_level (b
)
675 struct binding_level
*b
;
677 /* Resuming binding levels is meant only for namespaces,
678 and those cannot nest into classes. */
679 my_friendly_assert(!class_binding_level
, 386);
680 /* Also, resuming a non-directly nested namespace is a no-no. */
681 my_friendly_assert(b
->level_chain
== current_binding_level
, 386);
682 current_binding_level
= b
;
683 #if defined(DEBUG_CP_BINDING_LEVELS)
684 b
->binding_depth
= binding_depth
;
686 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
687 (is_class_level
) ? "class" : "block", b
, lineno
);
690 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
693 /* Create a new `struct binding_level'. */
696 struct binding_level
*
697 make_binding_level ()
700 return (struct binding_level
*) xmalloc (sizeof (struct binding_level
));
703 /* Nonzero if we are currently in the global binding level. */
708 return current_binding_level
== global_binding_level
;
711 /* Return the innermost binding level that is not for a class scope. */
713 static struct binding_level
*
714 innermost_nonclass_level ()
716 struct binding_level
*b
;
718 b
= current_binding_level
;
719 while (b
->parm_flag
== 2)
725 /* Nonzero if we are currently in a toplevel binding level. This
726 means either the global binding level or a namespace in a toplevel
727 binding level. Since there are no non-toplevel namespace levels,
728 this really means any namespace or template parameter level. We
729 also include a class whose context is toplevel. */
732 toplevel_bindings_p ()
734 struct binding_level
*b
= innermost_nonclass_level ();
736 return b
->namespace_p
|| b
->template_parms_p
;
739 /* Nonzero if this is a namespace scope, or if we are defining a class
740 which is itself at namespace scope, or whose enclosing class is
741 such a class, etc. */
744 namespace_bindings_p ()
746 struct binding_level
*b
= innermost_nonclass_level ();
748 return b
->namespace_p
;
751 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
752 unconditionally. Otherwise, use the normal logic to decide whether
753 or not to create a BLOCK. */
756 keep_next_level (keep
)
759 keep_next_level_flag
= keep
;
762 /* Nonzero if the current level needs to have a BLOCK made. */
767 return (current_binding_level
->blocks
!= NULL_TREE
768 || current_binding_level
->keep
769 || current_binding_level
->names
!= NULL_TREE
770 || (current_binding_level
->tags
!= NULL_TREE
771 && !current_binding_level
->tag_transparent
));
775 declare_namespace_level ()
777 current_binding_level
->namespace_p
= 1;
780 /* Returns non-zero if this scope was created to store template
784 template_parm_scope_p ()
786 return current_binding_level
->template_parms_p
;
789 /* Returns the kind of template specialization we are currently
790 processing, given that it's declaration contained N_CLASS_SCOPES
791 explicit scope qualifications. */
794 current_tmpl_spec_kind (n_class_scopes
)
797 int n_template_parm_scopes
= 0;
798 int seen_specialization_p
= 0;
799 int innermost_specialization_p
= 0;
800 struct binding_level
*b
;
802 /* Scan through the template parameter scopes. */
803 for (b
= current_binding_level
; b
->template_parms_p
; b
= b
->level_chain
)
805 /* If we see a specialization scope inside a parameter scope,
806 then something is wrong. That corresponds to a declaration
809 template <class T> template <> ...
811 which is always illegal since [temp.expl.spec] forbids the
812 specialization of a class member template if the enclosing
813 class templates are not explicitly specialized as well. */
814 if (b
->template_spec_p
)
816 if (n_template_parm_scopes
== 0)
817 innermost_specialization_p
= 1;
819 seen_specialization_p
= 1;
821 else if (seen_specialization_p
== 1)
822 return tsk_invalid_member_spec
;
824 ++n_template_parm_scopes
;
827 /* Handle explicit instantiations. */
828 if (processing_explicit_instantiation
)
830 if (n_template_parm_scopes
!= 0)
831 /* We've seen a template parameter list during an explicit
832 instantiation. For example:
834 template <class T> template void f(int);
836 This is erroneous. */
837 return tsk_invalid_expl_inst
;
839 return tsk_expl_inst
;
842 if (n_template_parm_scopes
< n_class_scopes
)
843 /* We've not seen enough template headers to match all the
844 specialized classes present. For example:
846 template <class T> void R<T>::S<T>::f(int);
848 This is illegal; there needs to be one set of template
849 parameters for each class. */
850 return tsk_insufficient_parms
;
851 else if (n_template_parm_scopes
== n_class_scopes
)
852 /* We're processing a non-template declaration (even though it may
853 be a member of a template class.) For example:
855 template <class T> void S<T>::f(int);
857 The `class T' maches the `S<T>', leaving no template headers
858 corresponding to the `f'. */
860 else if (n_template_parm_scopes
> n_class_scopes
+ 1)
861 /* We've got too many template headers. For example:
863 template <> template <class T> void f (T);
865 There need to be more enclosing classes. */
866 return tsk_excessive_parms
;
868 /* This must be a template. It's of the form:
870 template <class T> template <class U> void S<T>::f(U);
872 This is a specialization if the innermost level was a
873 specialization; otherwise it's just a definition of the
875 return innermost_specialization_p
? tsk_expl_spec
: tsk_template
;
879 set_class_shadows (shadows
)
882 class_binding_level
->class_shadowed
= shadows
;
885 /* Enter a new binding level.
886 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
887 not for that of tags. */
890 pushlevel (tag_transparent
)
893 struct binding_level
*newlevel
;
895 if (cfun
&& !doing_semantic_analysis_p ())
898 /* Reuse or create a struct for this binding level. */
899 #if defined(DEBUG_CP_BINDING_LEVELS)
901 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
902 if (free_binding_level
)
903 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
905 newlevel
= free_binding_level
;
906 free_binding_level
= free_binding_level
->level_chain
;
909 newlevel
= make_binding_level ();
911 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
912 GNU_xref_start_scope ((HOST_WIDE_INT
) newlevel
);
913 keep_next_level_flag
= 0;
916 /* Enter a new scope. The KIND indicates what kind of scope is being
927 case sk_template_spec
:
928 current_binding_level
->template_spec_p
= 1;
931 case sk_template_parms
:
932 current_binding_level
->template_parms_p
= 1;
936 my_friendly_abort (20000309);
940 /* Exit the current scope. */
949 note_level_for_for ()
951 current_binding_level
->is_for_scope
= 1;
954 /* Record that the current binding level represents a try block. */
959 current_binding_level
->eh_region
= 1;
962 /* For a binding between a name and an entity at a block scope,
963 this is the `struct binding_level' for the block. */
964 #define BINDING_LEVEL(NODE) \
965 (((struct tree_binding*)NODE)->scope.level)
967 /* Make DECL the innermost binding for ID. The LEVEL is the binding
968 level at which this declaration is being bound. */
971 push_binding (id
, decl
, level
)
974 struct binding_level
* level
;
978 binding
= make_node (CPLUS_BINDING
);
980 /* Now, fill in the binding information. */
981 BINDING_VALUE (binding
) = decl
;
982 BINDING_TYPE (binding
) = NULL_TREE
;
983 BINDING_LEVEL (binding
) = level
;
984 INHERITED_VALUE_BINDING_P (binding
) = 0;
985 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
986 BINDING_HAS_LEVEL_P (binding
) = 1;
988 /* And put it on the front of the list of bindings for ID. */
989 TREE_CHAIN (binding
) = IDENTIFIER_BINDING (id
);
990 IDENTIFIER_BINDING (id
) = binding
;
993 /* ID is already bound in the current scope. But, DECL is an
994 additional binding for ID in the same scope. This is the `struct
995 stat' hack whereby a non-typedef class-name or enum-name can be
996 bound at the same level as some other kind of entity. It's the
997 responsibility of the caller to check that inserting this name is
998 legal here. Returns nonzero if the new binding was successful. */
1000 add_binding (id
, decl
)
1004 tree binding
= IDENTIFIER_BINDING (id
);
1007 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
1008 /* The new name is the type name. */
1009 BINDING_TYPE (binding
) = decl
;
1010 else if (!BINDING_VALUE (binding
))
1011 /* This situation arises when push_class_level_binding moves an
1012 inherited type-binding out of the way to make room for a new
1014 BINDING_VALUE (binding
) = decl
;
1015 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
1016 && DECL_ARTIFICIAL (BINDING_VALUE (binding
)))
1018 /* The old binding was a type name. It was placed in
1019 BINDING_VALUE because it was thought, at the point it was
1020 declared, to be the only entity with such a name. Move the
1021 type name into the type slot; it is now hidden by the new
1023 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
1024 BINDING_VALUE (binding
) = decl
;
1025 INHERITED_VALUE_BINDING_P (binding
) = 0;
1027 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
1028 && TREE_CODE (decl
) == TYPE_DECL
1029 && DECL_NAME (decl
) == DECL_NAME (BINDING_VALUE (binding
))
1030 && same_type_p (TREE_TYPE (decl
),
1031 TREE_TYPE (BINDING_VALUE (binding
))))
1032 /* We have two typedef-names, both naming the same type to have
1033 the same name. This is OK because of:
1037 In a given scope, a typedef specifier can be used to redefine
1038 the name of any type declared in that scope to refer to the
1039 type to which it already refers. */
1041 /* There can be two block-scope declarations of the same variable,
1042 so long as they are `extern' declarations. */
1043 else if (TREE_CODE (decl
) == VAR_DECL
1044 && TREE_CODE (BINDING_VALUE (binding
)) == VAR_DECL
1045 && DECL_EXTERNAL (decl
)
1046 && DECL_EXTERNAL (BINDING_VALUE (binding
)))
1048 duplicate_decls (decl
, BINDING_VALUE (binding
));
1053 cp_error ("declaration of `%#D'", decl
);
1054 cp_error_at ("conflicts with previous declaration `%#D'",
1055 BINDING_VALUE (binding
));
1062 /* Add DECL to the list of things declared in B. */
1065 add_decl_to_level (decl
, b
)
1067 struct binding_level
*b
;
1069 /* We build up the list in reverse order, and reverse it later if
1071 TREE_CHAIN (decl
) = b
->names
;
1075 /* Bind DECL to ID in the current_binding_level, assumed to be a local
1076 binding level. If PUSH_USING is set in FLAGS, we know that DECL
1077 doesn't really belong to this binding level, that it got here
1078 through a using-declaration. */
1081 push_local_binding (id
, decl
, flags
)
1086 struct binding_level
*b
;
1088 /* Skip over any local classes. This makes sense if we call
1089 push_local_binding with a friend decl of a local class. */
1090 b
= current_binding_level
;
1091 while (b
->parm_flag
== 2)
1094 if (lookup_name_current_level (id
))
1096 /* Supplement the existing binding. */
1097 if (!add_binding (id
, decl
))
1098 /* It didn't work. Something else must be bound at this
1099 level. Do not add DECL to the list of things to pop
1104 /* Create a new binding. */
1105 push_binding (id
, decl
, b
);
1107 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
1108 /* We must put the OVERLOAD into a TREE_LIST since the
1109 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1110 decls that got here through a using-declaration. */
1111 decl
= build_tree_list (NULL_TREE
, decl
);
1113 /* And put DECL on the list of things declared by the current
1115 add_decl_to_level (decl
, b
);
1118 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
1119 binding was successful. */
1122 push_class_binding (id
, decl
)
1127 tree binding
= IDENTIFIER_BINDING (id
);
1130 /* Note that we declared this value so that we can issue an error if
1131 this an illegal redeclaration of a name already used for some
1133 note_name_declared_in_class (id
, decl
);
1135 if (binding
&& BINDING_LEVEL (binding
) == class_binding_level
)
1136 /* Supplement the existing binding. */
1137 result
= add_binding (id
, decl
);
1139 /* Create a new binding. */
1140 push_binding (id
, decl
, class_binding_level
);
1142 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1143 class-level declaration. Note that we do not use DECL here
1144 because of the possibility of the `struct stat' hack; if DECL is
1145 a class-name or enum-name we might prefer a field-name, or some
1147 IDENTIFIER_CLASS_VALUE (id
) = BINDING_VALUE (IDENTIFIER_BINDING (id
));
1149 /* If this is a binding from a base class, mark it as such. */
1150 binding
= IDENTIFIER_BINDING (id
);
1151 if (BINDING_VALUE (binding
) == decl
&& TREE_CODE (decl
) != TREE_LIST
)
1153 /* Any implicit typename must be from a base-class. The
1154 context for an implicit typename declaration is always
1155 the derived class in which the lookup was done, so the checks
1156 based on the context of DECL below will not trigger. */
1157 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl
))
1158 INHERITED_VALUE_BINDING_P (binding
) = 1;
1161 if (TREE_CODE (decl
) == OVERLOAD
)
1162 context
= CP_DECL_CONTEXT (OVL_CURRENT (decl
));
1165 my_friendly_assert (DECL_P (decl
), 0);
1166 context
= CP_DECL_CONTEXT (decl
);
1169 if (is_properly_derived_from (current_class_type
, context
))
1170 INHERITED_VALUE_BINDING_P (binding
) = 1;
1172 INHERITED_VALUE_BINDING_P (binding
) = 0;
1175 else if (BINDING_VALUE (binding
) == decl
)
1176 /* We only encounter a TREE_LIST when push_class_decls detects an
1177 ambiguity. Such an ambiguity can be overridden by a definition
1179 INHERITED_VALUE_BINDING_P (binding
) = 1;
1184 /* Remove the binding for DECL which should be the innermost binding
1188 pop_binding (id
, decl
)
1194 if (id
== NULL_TREE
)
1195 /* It's easiest to write the loops that call this function without
1196 checking whether or not the entities involved have names. We
1197 get here for such an entity. */
1200 /* Get the innermost binding for ID. */
1201 binding
= IDENTIFIER_BINDING (id
);
1203 /* The name should be bound. */
1204 my_friendly_assert (binding
!= NULL_TREE
, 0);
1206 /* The DECL will be either the ordinary binding or the type
1207 binding for this identifier. Remove that binding. */
1208 if (BINDING_VALUE (binding
) == decl
)
1209 BINDING_VALUE (binding
) = NULL_TREE
;
1210 else if (BINDING_TYPE (binding
) == decl
)
1211 BINDING_TYPE (binding
) = NULL_TREE
;
1213 my_friendly_abort (0);
1215 if (!BINDING_VALUE (binding
) && !BINDING_TYPE (binding
))
1216 /* We're completely done with the innermost binding for this
1217 identifier. Unhook it from the list of bindings. */
1218 IDENTIFIER_BINDING (id
) = TREE_CHAIN (binding
);
1221 /* When a label goes out of scope, check to see if that label was used
1222 in a valid manner, and issue any appropriate warnings or errors. */
1225 pop_label (label
, old_value
)
1229 if (!processing_template_decl
&& doing_semantic_analysis_p ())
1231 if (DECL_INITIAL (label
) == NULL_TREE
)
1233 cp_error_at ("label `%D' used but not defined", label
);
1234 /* Avoid crashing later. */
1235 define_label (input_filename
, 1, DECL_NAME (label
));
1237 else if (warn_unused_label
&& !TREE_USED (label
))
1238 cp_warning_at ("label `%D' defined but not used", label
);
1241 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), old_value
);
1244 /* At the end of a function, all labels declared within the function
1245 go out of scope. BLOCK is the top-level block for the
1252 struct named_label_list
*link
;
1254 /* Clear out the definitions of all label names, since their scopes
1256 for (link
= named_labels
; link
; link
= link
->next
)
1258 pop_label (link
->label_decl
, link
->old_value
);
1259 /* Put the labels into the "variables" of the top-level block,
1260 so debugger can see them. */
1261 TREE_CHAIN (link
->label_decl
) = BLOCK_VARS (block
);
1262 BLOCK_VARS (block
) = link
->label_decl
;
1265 named_labels
= NULL
;
1268 /* Exit a binding level.
1269 Pop the level off, and restore the state of the identifier-decl mappings
1270 that were in effect when this level was entered.
1272 If KEEP == 1, this level had explicit declarations, so
1273 and create a "block" (a BLOCK node) for the level
1274 to record its declarations and subblocks for symbol table output.
1276 If FUNCTIONBODY is nonzero, this level is the body of a function,
1277 so create a block as if KEEP were set and also clear out all
1280 If REVERSE is nonzero, reverse the order of decls before putting
1281 them into the BLOCK. */
1284 poplevel (keep
, reverse
, functionbody
)
1290 /* The chain of decls was accumulated in reverse order.
1291 Put it into forward order, just for cleanliness. */
1293 int tmp
= functionbody
;
1294 int real_functionbody
;
1297 tree block
= NULL_TREE
;
1299 int block_previously_created
;
1300 int leaving_for_scope
;
1302 if (cfun
&& !doing_semantic_analysis_p ())
1305 my_friendly_assert (current_binding_level
->parm_flag
!= 2,
1308 real_functionbody
= (current_binding_level
->keep
== 2
1309 ? ((functionbody
= 0), tmp
) : functionbody
);
1310 tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1311 subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1313 my_friendly_assert (!current_binding_level
->class_shadowed
,
1316 /* We used to use KEEP == 2 to indicate that the new block should go
1317 at the beginning of the list of blocks at this binding level,
1318 rather than the end. This hack is no longer used. */
1319 my_friendly_assert (keep
== 0 || keep
== 1, 0);
1321 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1322 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1323 current_binding_level
->parm_flag
,
1324 current_binding_level
->keep
);
1326 if (current_binding_level
->keep
== 1)
1329 /* Any uses of undefined labels, and any defined labels, now operate
1330 under constraints of next binding contour. */
1331 if (cfun
&& !functionbody
)
1333 struct binding_level
*level_chain
;
1334 level_chain
= current_binding_level
->level_chain
;
1337 struct named_label_use_list
*uses
;
1338 struct named_label_list
*labels
;
1339 for (labels
= named_labels
; labels
; labels
= labels
->next
)
1340 if (labels
->binding_level
== current_binding_level
)
1343 if (current_binding_level
->eh_region
)
1344 labels
->eh_region
= 1;
1345 for (decl
= labels
->names_in_scope
; decl
;
1346 decl
= TREE_CHAIN (decl
))
1347 if (decl_jump_unsafe (decl
))
1348 labels
->bad_decls
= tree_cons (NULL_TREE
, decl
,
1350 labels
->binding_level
= level_chain
;
1351 labels
->names_in_scope
= level_chain
->names
;
1354 for (uses
= named_label_uses
; uses
; uses
= uses
->next
)
1355 if (uses
->binding_level
== current_binding_level
)
1357 uses
->binding_level
= level_chain
;
1358 uses
->names_in_scope
= level_chain
->names
;
1363 /* Get the decls in the order they were written.
1364 Usually current_binding_level->names is in reverse order.
1365 But parameter decls were previously put in forward order. */
1368 current_binding_level
->names
1369 = decls
= nreverse (current_binding_level
->names
);
1371 decls
= current_binding_level
->names
;
1373 /* Output any nested inline functions within this block
1374 if they weren't already output. */
1375 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1376 if (TREE_CODE (decl
) == FUNCTION_DECL
1377 && ! TREE_ASM_WRITTEN (decl
)
1378 && DECL_INITIAL (decl
) != NULL_TREE
1379 && TREE_ADDRESSABLE (decl
)
1380 && decl_function_context (decl
) == current_function_decl
)
1382 /* If this decl was copied from a file-scope decl
1383 on account of a block-scope extern decl,
1384 propagate TREE_ADDRESSABLE to the file-scope decl. */
1385 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1386 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1389 push_function_context ();
1390 output_inline_function (decl
);
1391 pop_function_context ();
1395 /* When not in function-at-a-time mode, expand_end_bindings will
1396 warn about unused variables. But, in function-at-a-time mode
1397 expand_end_bindings is not passed the list of variables in the
1398 current scope, and therefore no warning is emitted. So, we
1399 explicitly warn here. */
1400 if (!processing_template_decl
)
1401 warn_about_unused_variables (getdecls ());
1403 /* If there were any declarations or structure tags in that level,
1404 or if this level is a function body,
1405 create a BLOCK to record them for the life of this function. */
1407 block_previously_created
= (current_binding_level
->this_block
!= NULL_TREE
);
1408 if (block_previously_created
)
1409 block
= current_binding_level
->this_block
;
1410 else if (keep
== 1 || functionbody
)
1411 block
= make_node (BLOCK
);
1412 if (block
!= NULL_TREE
)
1414 if (block_previously_created
)
1416 if (decls
|| tags
|| subblocks
)
1418 if (BLOCK_VARS (block
))
1419 warning ("internal compiler error: debugging info corrupted");
1421 BLOCK_VARS (block
) = decls
;
1423 /* We can have previous subblocks and new subblocks when
1424 doing fixup_gotos with complex cleanups. We chain the new
1425 subblocks onto the end of any pre-existing subblocks. */
1426 BLOCK_SUBBLOCKS (block
) = chainon (BLOCK_SUBBLOCKS (block
),
1432 BLOCK_VARS (block
) = decls
;
1433 BLOCK_SUBBLOCKS (block
) = subblocks
;
1437 /* In each subblock, record that this is its superior. */
1439 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1440 BLOCK_SUPERCONTEXT (link
) = block
;
1442 /* We still support the old for-scope rules, whereby the variables
1443 in a for-init statement were in scope after the for-statement
1444 ended. We only use the new rules in flag_new_for_scope is
1447 = current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1;
1449 /* Remove declarations for all the DECLs in this level. */
1450 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1452 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
1453 && DECL_NAME (link
))
1456 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link
)));
1460 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
1462 ns_binding
= NULL_TREE
;
1465 && (BINDING_LEVEL (outer_binding
)
1466 == current_binding_level
->level_chain
))
1467 /* We have something like:
1472 and we are leaving the `for' scope. There's no reason to
1473 keep the binding of the inner `i' in this case. */
1474 pop_binding (DECL_NAME (link
), link
);
1475 else if ((outer_binding
1476 && (TREE_CODE (BINDING_VALUE (outer_binding
))
1479 && TREE_CODE (ns_binding
) == TYPE_DECL
))
1480 /* Here, we have something like:
1488 We must pop the for-scope binding so we know what's a
1489 type and what isn't. */
1490 pop_binding (DECL_NAME (link
), link
);
1493 /* Mark this VAR_DECL as dead so that we can tell we left it
1494 there only for backward compatibility. */
1495 DECL_DEAD_FOR_LOCAL (link
) = 1;
1497 /* Keep track of what should of have happenned when we
1498 popped the binding. */
1499 if (outer_binding
&& BINDING_VALUE (outer_binding
))
1500 DECL_SHADOWED_FOR_VAR (link
)
1501 = BINDING_VALUE (outer_binding
);
1503 /* Add it to the list of dead variables in the next
1504 outermost binding to that we can remove these when we
1505 leave that binding. */
1506 current_binding_level
->level_chain
->dead_vars_from_for
1507 = tree_cons (NULL_TREE
, link
,
1508 current_binding_level
->level_chain
->
1509 dead_vars_from_for
);
1511 /* Although we don't pop the CPLUS_BINDING, we do clear
1512 its BINDING_LEVEL since the level is going away now. */
1513 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link
)))
1519 /* Remove the binding. */
1521 if (TREE_CODE (decl
) == TREE_LIST
)
1522 decl
= TREE_VALUE (decl
);
1524 pop_binding (DECL_NAME (decl
), decl
);
1525 else if (TREE_CODE (decl
) == OVERLOAD
)
1526 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
1528 my_friendly_abort (0);
1532 /* Remove declarations for any `for' variables from inner scopes
1533 that we kept around. */
1534 for (link
= current_binding_level
->dead_vars_from_for
;
1535 link
; link
= TREE_CHAIN (link
))
1536 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
1538 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1539 for (link
= current_binding_level
->type_shadowed
;
1540 link
; link
= TREE_CHAIN (link
))
1541 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1543 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1544 for (link
= current_binding_level
->shadowed_labels
;
1546 link
= TREE_CHAIN (link
))
1547 pop_label (TREE_VALUE (link
), TREE_PURPOSE (link
));
1549 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1550 list if a `using' declaration put them there. The debugging
1551 back-ends won't understand OVERLOAD, so we remove them here.
1552 Because the BLOCK_VARS are (temporarily) shared with
1553 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1554 popped all the bindings. */
1559 for (d
= &BLOCK_VARS (block
); *d
; )
1561 if (TREE_CODE (*d
) == TREE_LIST
)
1562 *d
= TREE_CHAIN (*d
);
1564 d
= &TREE_CHAIN (*d
);
1568 /* If the level being exited is the top level of a function,
1569 check over all the labels. */
1572 /* Since this is the top level block of a function, the vars are
1573 the function's parameters. Don't leave them in the BLOCK
1574 because they are found in the FUNCTION_DECL instead. */
1575 BLOCK_VARS (block
) = 0;
1579 tmp
= current_binding_level
->keep
;
1581 pop_binding_level ();
1583 DECL_INITIAL (current_function_decl
) = block
;
1586 if (!block_previously_created
)
1587 current_binding_level
->blocks
1588 = chainon (current_binding_level
->blocks
, block
);
1590 /* If we did not make a block for the level just exited,
1591 any blocks made for inner levels
1592 (since they cannot be recorded as subblocks in that level)
1593 must be carried forward so they will later become subblocks
1594 of something else. */
1596 current_binding_level
->blocks
1597 = chainon (current_binding_level
->blocks
, subblocks
);
1599 /* Each and every BLOCK node created here in `poplevel' is important
1600 (e.g. for proper debugging information) so if we created one
1601 earlier, mark it as "used". */
1603 TREE_USED (block
) = 1;
1605 /* Take care of compiler's internal binding structures. */
1611 = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/1);
1614 SCOPE_STMT_BLOCK (TREE_PURPOSE (scope_stmts
)) = block
;
1615 SCOPE_STMT_BLOCK (TREE_VALUE (scope_stmts
)) = block
;
1618 block
= poplevel (keep
, reverse
, functionbody
);
1624 /* Delete the node BLOCK from the current binding level.
1625 This is used for the block inside a stmt expr ({...})
1626 so that the block can be reinserted where appropriate. */
1629 delete_block (block
)
1633 if (current_binding_level
->blocks
== block
)
1634 current_binding_level
->blocks
= TREE_CHAIN (block
);
1635 for (t
= current_binding_level
->blocks
; t
;)
1637 if (TREE_CHAIN (t
) == block
)
1638 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1642 TREE_CHAIN (block
) = NULL_TREE
;
1643 /* Clear TREE_USED which is always set by poplevel.
1644 The flag is set again if insert_block is called. */
1645 TREE_USED (block
) = 0;
1648 /* Insert BLOCK at the end of the list of subblocks of the
1649 current binding level. This is used when a BIND_EXPR is expanded,
1650 to handle the BLOCK node inside the BIND_EXPR. */
1653 insert_block (block
)
1656 TREE_USED (block
) = 1;
1657 current_binding_level
->blocks
1658 = chainon (current_binding_level
->blocks
, block
);
1661 /* Set the BLOCK node for the innermost scope
1662 (the one we are currently in). */
1666 register tree block
;
1668 current_binding_level
->this_block
= block
;
1671 /* Do a pushlevel for class declarations. */
1676 register struct binding_level
*newlevel
;
1678 /* Reuse or create a struct for this binding level. */
1679 #if defined(DEBUG_CP_BINDING_LEVELS)
1681 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1682 if (free_binding_level
)
1683 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1685 newlevel
= free_binding_level
;
1686 free_binding_level
= free_binding_level
->level_chain
;
1689 newlevel
= make_binding_level ();
1691 #if defined(DEBUG_CP_BINDING_LEVELS)
1693 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1695 push_binding_level (newlevel
, 0, 0);
1697 class_binding_level
= current_binding_level
;
1698 class_binding_level
->parm_flag
= 2;
1699 class_binding_level
->this_class
= current_class_type
;
1702 /* ...and a poplevel for class declarations. */
1707 register struct binding_level
*level
= class_binding_level
;
1710 my_friendly_assert (level
!= 0, 354);
1712 /* If we're leaving a toplevel class, don't bother to do the setting
1713 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1714 shouldn't even be used when current_class_type isn't set, and second,
1715 if we don't touch it here, we're able to use the cache effect if the
1716 next time we're entering a class scope, it is the same class. */
1717 if (current_class_depth
!= 1)
1719 struct binding_level
* b
;
1721 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1722 for (shadowed
= level
->class_shadowed
;
1724 shadowed
= TREE_CHAIN (shadowed
))
1725 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = NULL_TREE
;
1727 /* Find the next enclosing class, and recreate
1728 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1729 b
= level
->level_chain
;
1730 while (b
&& b
->parm_flag
!= 2)
1734 for (shadowed
= b
->class_shadowed
;
1736 shadowed
= TREE_CHAIN (shadowed
))
1740 t
= IDENTIFIER_BINDING (TREE_PURPOSE (shadowed
));
1741 while (t
&& BINDING_LEVEL (t
) != b
)
1745 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
))
1746 = BINDING_VALUE (t
);
1750 /* Remember to save what IDENTIFIER's were bound in this scope so we
1751 can recover from cache misses. */
1753 previous_class_type
= current_class_type
;
1754 previous_class_values
= class_binding_level
->class_shadowed
;
1756 for (shadowed
= level
->type_shadowed
;
1758 shadowed
= TREE_CHAIN (shadowed
))
1759 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1761 /* Remove the bindings for all of the class-level declarations. */
1762 for (shadowed
= level
->class_shadowed
;
1764 shadowed
= TREE_CHAIN (shadowed
))
1765 pop_binding (TREE_PURPOSE (shadowed
), TREE_TYPE (shadowed
));
1767 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1768 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1769 class_binding_level
->parm_flag
,
1770 class_binding_level
->keep
);
1772 /* Now, pop out of the binding level which we created up in the
1773 `pushlevel_class' routine. */
1774 #if defined(DEBUG_CP_BINDING_LEVELS)
1776 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1778 pop_binding_level ();
1781 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1782 for any names in enclosing classes. */
1785 clear_identifier_class_values ()
1789 if (!class_binding_level
)
1792 for (t
= class_binding_level
->class_shadowed
;
1795 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
1798 /* Returns non-zero if T is a virtual function table. */
1801 vtable_decl_p (t
, data
)
1803 void *data ATTRIBUTE_UNUSED
;
1805 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
1808 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1812 vtype_decl_p (t
, data
)
1814 void *data ATTRIBUTE_UNUSED
;
1816 return (TREE_CODE (t
) == TYPE_DECL
1817 && TREE_CODE (TREE_TYPE (t
)) == RECORD_TYPE
1818 && TYPE_POLYMORPHIC_P (TREE_TYPE (t
)));
1821 /* Return the declarations that are members of the namespace NS. */
1824 cp_namespace_decls (ns
)
1827 return NAMESPACE_LEVEL (ns
)->names
;
1830 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1831 itself, calling F for each. The DATA is passed to F as well. */
1834 walk_namespaces_r (namespace, f
, data
)
1836 walk_namespaces_fn f
;
1842 result
|= (*f
) (namespace, data
);
1844 for (current
= cp_namespace_decls (namespace);
1846 current
= TREE_CHAIN (current
))
1848 if (TREE_CODE (current
) != NAMESPACE_DECL
1849 || DECL_NAMESPACE_ALIAS (current
))
1851 if (!DECL_LANG_SPECIFIC (current
))
1854 my_friendly_assert (current
== std_node
, 393);
1858 /* We found a namespace. */
1859 result
|= walk_namespaces_r (current
, f
, data
);
1865 /* Walk all the namespaces, calling F for each. The DATA is passed to
1869 walk_namespaces (f
, data
)
1870 walk_namespaces_fn f
;
1873 return walk_namespaces_r (global_namespace
, f
, data
);
1876 struct walk_globals_data
{
1877 walk_globals_pred p
;
1882 /* Walk the global declarations in NAMESPACE. Whenever one is found
1883 for which P returns non-zero, call F with its address. If any call
1884 to F returns a non-zero value, return a non-zero value. */
1887 walk_globals_r (namespace, data
)
1891 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1892 walk_globals_pred p
= wgd
->p
;
1893 walk_globals_fn f
= wgd
->f
;
1894 void *d
= wgd
->data
;
1898 t
= &NAMESPACE_LEVEL (namespace)->names
;
1905 result
|= (*f
) (t
, d
);
1907 /* If F changed *T, then *T still points at the next item to
1910 t
= &TREE_CHAIN (*t
);
1916 /* Walk the global declarations. Whenever one is found for which P
1917 returns non-zero, call F with its address. If any call to F
1918 returns a non-zero value, return a non-zero value. */
1921 walk_globals (p
, f
, data
)
1922 walk_globals_pred p
;
1926 struct walk_globals_data wgd
;
1931 return walk_namespaces (walk_globals_r
, &wgd
);
1934 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1935 DATA is non-NULL, this is the last time we will call
1936 wrapup_global_declarations for this NAMESPACE. */
1939 wrapup_globals_for_namespace (namespace, data
)
1943 tree globals
= cp_namespace_decls (namespace);
1944 int len
= list_length (globals
);
1945 tree
*vec
= (tree
*) alloca (sizeof (tree
) * len
);
1949 int last_time
= (data
!= 0);
1951 if (last_time
&& namespace == global_namespace
)
1952 /* Let compile_file handle the global namespace. */
1955 /* Process the decls in reverse order--earliest first.
1956 Put them into VEC from back to front, then take out from front. */
1958 for (i
= 0, decl
= globals
; i
< len
; i
++, decl
= TREE_CHAIN (decl
))
1960 /* Pretend we've output an unused static variable. This ensures
1961 that the toplevel __FUNCTION__ etc won't be emitted, unless
1963 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_ARTIFICIAL (decl
)
1964 && !TREE_PUBLIC (decl
) && !TREE_USED (decl
))
1966 TREE_ASM_WRITTEN (decl
) = 1;
1967 DECL_IGNORED_P (decl
) = 1;
1969 vec
[len
- i
- 1] = decl
;
1974 check_global_declarations (vec
, len
);
1978 /* Temporarily mark vtables as external. That prevents
1979 wrapup_global_declarations from writing them out; we must process
1980 them ourselves in finish_vtable_vardecl. */
1981 for (i
= 0; i
< len
; ++i
)
1982 if (vtable_decl_p (vec
[i
], /*data=*/0) && !DECL_EXTERNAL (vec
[i
]))
1984 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 1;
1985 DECL_EXTERNAL (vec
[i
]) = 1;
1988 /* Write out any globals that need to be output. */
1989 result
= wrapup_global_declarations (vec
, len
);
1991 /* Undo the hack to DECL_EXTERNAL above. */
1992 for (i
= 0; i
< len
; ++i
)
1993 if (vtable_decl_p (vec
[i
], /*data=*/0)
1994 && DECL_NOT_REALLY_EXTERN (vec
[i
]))
1996 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 0;
1997 DECL_EXTERNAL (vec
[i
]) = 0;
2004 /* Mark ARG (which is really a struct binding_level **) for GC. */
2007 mark_binding_level (arg
)
2010 struct binding_level
*lvl
= *(struct binding_level
**)arg
;
2012 for (; lvl
; lvl
= lvl
->level_chain
)
2014 ggc_mark_tree (lvl
->names
);
2015 ggc_mark_tree (lvl
->tags
);
2016 ggc_mark_tree (lvl
->usings
);
2017 ggc_mark_tree (lvl
->using_directives
);
2018 ggc_mark_tree (lvl
->class_shadowed
);
2019 ggc_mark_tree (lvl
->type_shadowed
);
2020 ggc_mark_tree (lvl
->shadowed_labels
);
2021 ggc_mark_tree (lvl
->blocks
);
2022 ggc_mark_tree (lvl
->this_block
);
2023 ggc_mark_tree (lvl
->this_class
);
2024 ggc_mark_tree (lvl
->incomplete
);
2025 ggc_mark_tree (lvl
->dead_vars_from_for
);
2030 mark_named_label_lists (labs
, uses
)
2034 struct named_label_list
*l
= *(struct named_label_list
**)labs
;
2035 struct named_label_use_list
*u
= *(struct named_label_use_list
**)uses
;
2037 for (; l
; l
= l
->next
)
2040 mark_binding_level (l
->binding_level
);
2041 ggc_mark_tree (l
->old_value
);
2042 ggc_mark_tree (l
->label_decl
);
2043 ggc_mark_tree (l
->bad_decls
);
2046 for (; u
; u
= u
->next
)
2050 /* For debugging. */
2051 static int no_print_functions
= 0;
2052 static int no_print_builtins
= 0;
2055 print_binding_level (lvl
)
2056 struct binding_level
*lvl
;
2060 fprintf (stderr
, " blocks=");
2061 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
2062 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
2063 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
2064 if (lvl
->tag_transparent
)
2065 fprintf (stderr
, " tag-transparent");
2066 if (lvl
->more_cleanups_ok
)
2067 fprintf (stderr
, " more-cleanups-ok");
2068 if (lvl
->have_cleanups
)
2069 fprintf (stderr
, " have-cleanups");
2070 fprintf (stderr
, "\n");
2073 fprintf (stderr
, " names:\t");
2074 /* We can probably fit 3 names to a line? */
2075 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
2077 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
2079 if (no_print_builtins
2080 && (TREE_CODE (t
) == TYPE_DECL
)
2081 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
2084 /* Function decls tend to have longer names. */
2085 if (TREE_CODE (t
) == FUNCTION_DECL
)
2092 fprintf (stderr
, "\n\t");
2095 print_node_brief (stderr
, "", t
, 0);
2096 if (t
== error_mark_node
)
2100 fprintf (stderr
, "\n");
2104 fprintf (stderr
, " tags:\t");
2106 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
2108 if (TREE_PURPOSE (t
) == NULL_TREE
)
2110 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2117 fprintf (stderr
, "\n\t");
2120 if (TREE_PURPOSE (t
) == NULL_TREE
)
2122 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
2123 fprintf (stderr
, ">");
2125 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2126 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2129 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
2130 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2131 fprintf (stderr
, ">");
2135 fprintf (stderr
, "\n");
2137 if (lvl
->class_shadowed
)
2139 fprintf (stderr
, " class-shadowed:");
2140 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
2142 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2144 fprintf (stderr
, "\n");
2146 if (lvl
->type_shadowed
)
2148 fprintf (stderr
, " type-shadowed:");
2149 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2151 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2153 fprintf (stderr
, "\n");
2158 print_other_binding_stack (stack
)
2159 struct binding_level
*stack
;
2161 struct binding_level
*level
;
2162 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
2164 fprintf (stderr
, "binding level ");
2165 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
2166 fprintf (stderr
, "\n");
2167 print_binding_level (level
);
2172 print_binding_stack ()
2174 struct binding_level
*b
;
2175 fprintf (stderr
, "current_binding_level=");
2176 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
2177 fprintf (stderr
, "\nclass_binding_level=");
2178 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
2179 fprintf (stderr
, "\nglobal_binding_level=");
2180 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
2181 fprintf (stderr
, "\n");
2182 if (class_binding_level
)
2184 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
2185 if (b
== current_binding_level
)
2188 b
= class_binding_level
;
2190 b
= current_binding_level
;
2193 b
= current_binding_level
;
2194 print_other_binding_stack (b
);
2195 fprintf (stderr
, "global:\n");
2196 print_binding_level (global_binding_level
);
2199 /* Namespace binding access routines: The namespace_bindings field of
2200 the identifier is polymorphic, with three possible values:
2201 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2202 indicating the BINDING_VALUE of global_namespace. */
2204 /* Check whether the a binding for the name to scope is known.
2205 Assumes that the bindings of the name are already a list
2206 of bindings. Returns the binding found, or NULL_TREE. */
2209 find_binding (name
, scope
)
2213 tree iter
, prev
= NULL_TREE
;
2215 scope
= ORIGINAL_NAMESPACE (scope
);
2217 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
2218 iter
= TREE_CHAIN (iter
))
2220 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
2221 if (BINDING_SCOPE (iter
) == scope
)
2223 /* Move binding found to the front of the list, so
2224 subsequent lookups will find it faster. */
2227 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
2228 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
2229 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
2238 /* Always returns a binding for name in scope. If the
2239 namespace_bindings is not a list, convert it to one first.
2240 If no binding is found, make a new one. */
2243 binding_for_name (name
, scope
)
2247 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2250 scope
= ORIGINAL_NAMESPACE (scope
);
2252 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
2254 /* Get rid of optimization for global scope. */
2255 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
2256 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
2257 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2259 if (b
&& (result
= find_binding (name
, scope
)))
2261 /* Not found, make a new one. */
2262 result
= make_node (CPLUS_BINDING
);
2263 TREE_CHAIN (result
) = b
;
2264 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2265 BINDING_SCOPE (result
) = scope
;
2266 BINDING_TYPE (result
) = NULL_TREE
;
2267 BINDING_VALUE (result
) = NULL_TREE
;
2271 /* Return the binding value for name in scope, considering that
2272 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2275 namespace_binding (name
, scope
)
2279 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2282 if (scope
== NULL_TREE
)
2283 scope
= global_namespace
;
2284 if (TREE_CODE (b
) != CPLUS_BINDING
)
2285 return (scope
== global_namespace
) ? b
: NULL_TREE
;
2286 name
= find_binding (name
,scope
);
2287 if (name
== NULL_TREE
)
2289 return BINDING_VALUE (name
);
2292 /* Set the binding value for name in scope. If modifying the binding
2293 of global_namespace is attempted, try to optimize it. */
2296 set_namespace_binding (name
, scope
, val
)
2303 if (scope
== NULL_TREE
)
2304 scope
= global_namespace
;
2306 if (scope
== global_namespace
)
2308 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2309 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
2311 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
2315 b
= binding_for_name (name
, scope
);
2316 BINDING_VALUE (b
) = val
;
2319 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2320 select a name that is unique to this compilation unit. */
2323 push_namespace (name
)
2328 int implicit_use
= 0;
2330 if (!global_namespace
)
2332 /* This must be ::. */
2333 my_friendly_assert (name
== get_identifier ("::"), 377);
2338 /* The name of anonymous namespace is unique for the translation
2340 if (!anonymous_namespace_name
)
2341 anonymous_namespace_name
= get_file_function_name ('N');
2342 name
= anonymous_namespace_name
;
2343 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2345 /* Reopening anonymous namespace. */
2349 else if (current_namespace
== global_namespace
2350 && name
== DECL_NAME (std_node
))
2357 /* Check whether this is an extended namespace definition. */
2358 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2359 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
2362 if (DECL_NAMESPACE_ALIAS (d
))
2364 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2365 d
, DECL_NAMESPACE_ALIAS (d
));
2366 d
= DECL_NAMESPACE_ALIAS (d
);
2373 /* Make a new namespace, binding the name to it. */
2374 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
2375 /* The global namespace is not pushed, and the global binding
2376 level is set elsewhere. */
2379 DECL_CONTEXT (d
) = FROB_CONTEXT (current_namespace
);
2382 declare_namespace_level ();
2383 NAMESPACE_LEVEL (d
) = current_binding_level
;
2387 resume_binding_level (NAMESPACE_LEVEL (d
));
2390 do_using_directive (d
);
2391 /* Enter the name space. */
2392 current_namespace
= d
;
2395 /* Pop from the scope of the current namespace. */
2400 if (current_namespace
== global_namespace
)
2402 my_friendly_assert (in_std
>0, 980421);
2406 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
2407 /* The binding level is not popped, as it might be re-opened later. */
2408 suspend_binding_level ();
2411 /* Push into the scope of the namespace NS, even if it is deeply
2412 nested within another namespace. */
2415 push_nested_namespace (ns
)
2418 if (ns
== global_namespace
)
2419 push_to_top_level ();
2422 push_nested_namespace (CP_DECL_CONTEXT (ns
));
2423 push_namespace (DECL_NAME (ns
));
2427 /* Pop back from the scope of the namespace NS, which was previously
2428 entered with push_nested_namespace. */
2431 pop_nested_namespace (ns
)
2434 while (ns
!= global_namespace
)
2437 ns
= CP_DECL_CONTEXT (ns
);
2440 pop_from_top_level ();
2444 /* Subroutines for reverting temporarily to top-level for instantiation
2445 of templates and such. We actually need to clear out the class- and
2446 local-value slots of all identifiers, so that only the global values
2447 are at all visible. Simply setting current_binding_level to the global
2448 scope isn't enough, because more binding levels may be pushed. */
2449 struct saved_scope
*scope_chain
;
2451 /* Mark ST for GC. */
2457 ggc_mark_tree (st
->x_last_stmt
);
2458 ggc_mark_tree (st
->x_last_expr_type
);
2461 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2464 mark_saved_scope (arg
)
2467 struct saved_scope
*t
= *(struct saved_scope
**)arg
;
2470 mark_binding_level (&t
->class_bindings
);
2471 ggc_mark_tree (t
->old_bindings
);
2472 ggc_mark_tree (t
->old_namespace
);
2473 ggc_mark_tree (t
->class_name
);
2474 ggc_mark_tree (t
->class_type
);
2475 ggc_mark_tree (t
->access_specifier
);
2476 ggc_mark_tree (t
->function_decl
);
2478 ggc_mark_tree_varray (t
->lang_base
);
2479 ggc_mark_tree (t
->lang_name
);
2480 ggc_mark_tree (t
->x_function_parms
);
2481 ggc_mark_tree (t
->template_parms
);
2482 ggc_mark_tree (t
->x_previous_class_type
);
2483 ggc_mark_tree (t
->x_previous_class_values
);
2484 ggc_mark_tree (t
->x_saved_tree
);
2485 ggc_mark_tree (t
->incomplete
);
2486 ggc_mark_tree (t
->lookups
);
2488 mark_stmt_tree (&t
->x_stmt_tree
);
2489 mark_binding_level (&t
->bindings
);
2495 store_bindings (names
, old_bindings
)
2496 tree names
, old_bindings
;
2499 for (t
= names
; t
; t
= TREE_CHAIN (t
))
2501 tree binding
, t1
, id
;
2503 if (TREE_CODE (t
) == TREE_LIST
)
2504 id
= TREE_PURPOSE (t
);
2509 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2510 we have no IDENTIFIER_BINDING if we have left the class
2511 scope, but cached the class-level declarations. */
2512 || !(IDENTIFIER_BINDING (id
) || IDENTIFIER_CLASS_VALUE (id
)))
2515 for (t1
= old_bindings
; t1
; t1
= TREE_CHAIN (t1
))
2516 if (TREE_VEC_ELT (t1
, 0) == id
)
2519 binding
= make_tree_vec (4);
2523 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
2524 TREE_VEC_ELT (binding
, 0) = id
;
2525 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
2526 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_BINDING (id
);
2527 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
2528 IDENTIFIER_BINDING (id
) = NULL_TREE
;
2529 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
2531 TREE_CHAIN (binding
) = old_bindings
;
2532 old_bindings
= binding
;
2536 return old_bindings
;
2540 maybe_push_to_top_level (pseudo
)
2543 struct saved_scope
*s
;
2544 struct binding_level
*b
;
2548 s
= (struct saved_scope
*) xcalloc (1, sizeof (struct saved_scope
));
2550 b
= scope_chain
? current_binding_level
: 0;
2552 /* If we're in the middle of some function, save our state. */
2556 push_function_context_to (NULL_TREE
);
2561 old_bindings
= NULL_TREE
;
2562 if (scope_chain
&& previous_class_type
)
2563 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
2565 /* Have to include global_binding_level, because class-level decls
2566 aren't listed anywhere useful. */
2567 for (; b
; b
= b
->level_chain
)
2571 /* Template IDs are inserted into the global level. If they were
2572 inserted into namespace level, finish_file wouldn't find them
2573 when doing pending instantiations. Therefore, don't stop at
2574 namespace level, but continue until :: . */
2575 if (b
== global_binding_level
|| (pseudo
&& b
->template_parms_p
))
2578 old_bindings
= store_bindings (b
->names
, old_bindings
);
2579 /* We also need to check class_shadowed to save class-level type
2580 bindings, since pushclass doesn't fill in b->names. */
2581 if (b
->parm_flag
== 2)
2582 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2584 /* Unwind type-value slots back to top level. */
2585 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2586 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2588 s
->prev
= scope_chain
;
2589 s
->old_bindings
= old_bindings
;
2591 s
->need_pop_function_context
= need_pop
;
2592 s
->function_decl
= current_function_decl
;
2595 current_function_decl
= NULL_TREE
;
2596 VARRAY_TREE_INIT (current_lang_base
, 10, "current_lang_base");
2597 current_lang_stack
= &VARRAY_TREE (current_lang_base
, 0);
2598 current_lang_name
= lang_name_cplusplus
;
2599 current_namespace
= global_namespace
;
2603 push_to_top_level ()
2605 maybe_push_to_top_level (0);
2609 pop_from_top_level ()
2611 struct saved_scope
*s
= scope_chain
;
2614 /* Clear out class-level bindings cache. */
2615 if (previous_class_type
)
2616 invalidate_class_lookup_cache ();
2618 VARRAY_FREE (current_lang_base
);
2620 scope_chain
= s
->prev
;
2621 for (t
= s
->old_bindings
; t
; t
= TREE_CHAIN (t
))
2623 tree id
= TREE_VEC_ELT (t
, 0);
2626 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2627 IDENTIFIER_BINDING (id
) = TREE_VEC_ELT (t
, 2);
2628 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2632 /* If we were in the middle of compiling a function, restore our
2634 if (s
->need_pop_function_context
)
2635 pop_function_context_from (NULL_TREE
);
2636 current_function_decl
= s
->function_decl
;
2641 /* Push a definition of struct, union or enum tag "name".
2642 into binding_level "b". "type" should be the type node,
2643 We assume that the tag "name" is not already defined.
2645 Note that the definition may really be just a forward reference.
2646 In that case, the TYPE_SIZE will be a NULL_TREE.
2648 C++ gratuitously puts all these tags in the name space. */
2650 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2651 record the shadowed value for this binding contour. TYPE is
2652 the type that ID maps to. */
2655 set_identifier_type_value_with_scope (id
, type
, b
)
2658 struct binding_level
*b
;
2660 if (!b
->namespace_p
)
2662 /* Shadow the marker, not the real thing, so that the marker
2663 gets restored later. */
2664 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2666 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2670 tree binding
= binding_for_name (id
, current_namespace
);
2671 BINDING_TYPE (binding
) = type
;
2672 /* Store marker instead of real type. */
2673 type
= global_type_node
;
2675 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2678 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2681 set_identifier_type_value (id
, type
)
2685 set_identifier_type_value_with_scope (id
, type
, current_binding_level
);
2688 /* Return the type associated with id. */
2691 identifier_type_value (id
)
2694 /* There is no type with that name, anywhere. */
2695 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2697 /* This is not the type marker, but the real thing. */
2698 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2699 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2700 /* Have to search for it. It must be on the global level, now.
2701 Ask lookup_name not to return non-types. */
2702 id
= lookup_name_real (id
, 2, 1, 0);
2704 return TREE_TYPE (id
);
2708 /* Pop off extraneous binding levels left over due to syntax errors.
2710 We don't pop past namespaces, as they might be valid. */
2715 #ifdef DEBUG_CP_BINDING_LEVELS
2716 fprintf (stderr
, "XXX entering pop_everything ()\n");
2718 while (!toplevel_bindings_p ())
2720 if (current_binding_level
->parm_flag
== 2)
2721 pop_nested_class ();
2725 #ifdef DEBUG_CP_BINDING_LEVELS
2726 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2730 /* The type TYPE is being declared. If it is a class template, or a
2731 specialization of a class template, do any processing required and
2732 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2733 being declared a friend. B is the binding level at which this TYPE
2736 Returns the TYPE_DECL for TYPE, which may have been altered by this
2740 maybe_process_template_type_declaration (type
, globalize
, b
)
2743 struct binding_level
* b
;
2745 tree decl
= TYPE_NAME (type
);
2747 if (processing_template_parmlist
)
2748 /* You can't declare a new template type in a template parameter
2749 list. But, you can declare a non-template type:
2751 template <class A*> struct S;
2753 is a forward-declaration of `A'. */
2757 maybe_check_template_type (type
);
2759 my_friendly_assert (IS_AGGR_TYPE (type
)
2760 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2763 if (processing_template_decl
)
2765 /* This may change after the call to
2766 push_template_decl_real, but we want the original value. */
2767 tree name
= DECL_NAME (decl
);
2769 decl
= push_template_decl_real (decl
, globalize
);
2770 /* If the current binding level is the binding level for the
2771 template parameters (see the comment in
2772 begin_template_parm_list) and the enclosing level is a class
2773 scope, and we're not looking at a friend, push the
2774 declaration of the member class into the class scope. In the
2775 friend case, push_template_decl will already have put the
2776 friend into global scope, if appropriate. */
2777 if (TREE_CODE (type
) != ENUMERAL_TYPE
2778 && !globalize
&& b
->template_parms_p
2779 && b
->level_chain
->parm_flag
== 2)
2781 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2782 /* Put this tag on the list of tags for the class, since
2783 that won't happen below because B is not the class
2784 binding level, but is instead the pseudo-global level. */
2785 b
->level_chain
->tags
=
2786 tree_cons (name
, type
, b
->level_chain
->tags
);
2787 if (!COMPLETE_TYPE_P (current_class_type
))
2788 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2796 /* In C++, you don't have to write `struct S' to refer to `S'; you
2797 can just use `S'. We accomplish this by creating a TYPE_DECL as
2798 if the user had written `typedef struct S S'. Create and return
2799 the TYPE_DECL for TYPE. */
2802 create_implicit_typedef (name
, type
)
2808 decl
= build_decl (TYPE_DECL
, name
, type
);
2809 DECL_ARTIFICIAL (decl
) = 1;
2810 /* There are other implicit type declarations, like the one *within*
2811 a class that allows you to write `S::S'. We must distinguish
2813 SET_DECL_IMPLICIT_TYPEDEF_P (decl
);
2814 TYPE_NAME (type
) = decl
;
2819 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2820 Normally put it into the inner-most non-tag-transparent scope,
2821 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2822 The latter is needed for implicit declarations. */
2825 pushtag (name
, type
, globalize
)
2829 register struct binding_level
*b
;
2831 b
= current_binding_level
;
2832 while (b
->tag_transparent
2833 || (globalize
&& b
->parm_flag
== 2))
2836 b
->tags
= tree_cons (name
, type
, b
->tags
);
2840 /* Do C++ gratuitous typedefing. */
2841 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2843 register tree d
= NULL_TREE
;
2845 tree context
= TYPE_CONTEXT (type
);
2849 tree cs
= current_scope ();
2853 else if (cs
!= NULL_TREE
&& TYPE_P (cs
))
2854 /* When declaring a friend class of a local class, we want
2855 to inject the newly named class into the scope
2856 containing the local class, not the namespace scope. */
2857 context
= decl_function_context (get_type_decl (cs
));
2860 context
= current_namespace
;
2862 if ((b
->template_parms_p
&& b
->level_chain
->parm_flag
== 2)
2863 || b
->parm_flag
== 2)
2866 if (current_lang_name
== lang_name_java
)
2867 TYPE_FOR_JAVA (type
) = 1;
2869 d
= create_implicit_typedef (name
, type
);
2870 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2872 set_identifier_type_value_with_scope (name
, type
, b
);
2874 d
= maybe_process_template_type_declaration (type
,
2877 if (b
->parm_flag
== 2)
2879 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2880 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2881 class. But if it's a member template class, we
2882 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2884 finish_member_declaration (d
);
2886 pushdecl_class_level (d
);
2889 d
= pushdecl_with_scope (d
, b
);
2891 if (ANON_AGGRNAME_P (name
))
2892 DECL_IGNORED_P (d
) = 1;
2894 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2895 DECL_ASSEMBLER_NAME (d
) = DECL_NAME (d
);
2897 /* If this is a local class, keep track of it. We need this
2898 information for name-mangling, and so that it is possible to find
2899 all function definitions in a translation unit in a convenient
2900 way. (It's otherwise tricky to find a member function definition
2901 it's only pointed to from within a local class.) */
2902 if (TYPE_CONTEXT (type
)
2903 && TREE_CODE (TYPE_CONTEXT (type
)) == FUNCTION_DECL
2904 && !processing_template_decl
)
2905 VARRAY_PUSH_TREE (local_classes
, type
);
2907 if (!uses_template_parms (type
))
2910 DECL_ASSEMBLER_NAME (d
) = mangle_type (type
);
2912 DECL_ASSEMBLER_NAME (d
)
2913 = get_identifier (build_overload_name (type
, 1, 1));
2916 if (b
->parm_flag
== 2)
2918 if (!COMPLETE_TYPE_P (current_class_type
))
2919 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2923 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2924 /* Use the canonical TYPE_DECL for this node. */
2925 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2928 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2929 will be the tagged type we just added to the current
2930 binding level. This fake NULL-named TYPE_DECL node helps
2931 dwarfout.c to know when it needs to output a
2932 representation of a tagged type, and it also gives us a
2933 convenient place to record the "scope start" address for
2936 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2937 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2941 /* Counter used to create anonymous type names. */
2943 static int anon_cnt
= 0;
2945 /* Return an IDENTIFIER which can be used as a name for
2946 anonymous structs and unions. */
2953 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2954 return get_identifier (buf
);
2957 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2958 This keeps dbxout from getting confused. */
2963 register struct binding_level
*b
;
2965 static int last_cnt
= 0;
2967 /* Fast out if no new anon names were declared. */
2968 if (last_cnt
== anon_cnt
)
2971 b
= current_binding_level
;
2972 while (b
->tag_transparent
)
2977 /* A NULL purpose means we have already processed all tags
2978 from here to the end of the list. */
2979 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2981 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2982 TREE_PURPOSE (tags
) = NULL_TREE
;
2983 tags
= TREE_CHAIN (tags
);
2985 last_cnt
= anon_cnt
;
2988 /* Subroutine of duplicate_decls: return truthvalue of whether
2989 or not types of these decls match.
2991 For C++, we must compare the parameter list so that `int' can match
2992 `int&' in a parameter position, but `int&' is not confused with
2996 decls_match (newdecl
, olddecl
)
2997 tree newdecl
, olddecl
;
3001 if (newdecl
== olddecl
)
3004 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
3005 /* If the two DECLs are not even the same kind of thing, we're not
3006 interested in their types. */
3009 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3011 tree f1
= TREE_TYPE (newdecl
);
3012 tree f2
= TREE_TYPE (olddecl
);
3013 tree p1
= TYPE_ARG_TYPES (f1
);
3014 tree p2
= TYPE_ARG_TYPES (f2
);
3016 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
)
3017 && ! (DECL_EXTERN_C_P (newdecl
)
3018 && DECL_EXTERN_C_P (olddecl
)))
3021 if (TREE_CODE (f1
) != TREE_CODE (f2
))
3024 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
3026 if (p2
== NULL_TREE
&& DECL_EXTERN_C_P (olddecl
)
3027 && (DECL_BUILT_IN (olddecl
)
3028 #ifndef NO_IMPLICIT_EXTERN_C
3029 || (DECL_IN_SYSTEM_HEADER (newdecl
) && !DECL_CLASS_SCOPE_P (newdecl
))
3030 || (DECL_IN_SYSTEM_HEADER (olddecl
) && !DECL_CLASS_SCOPE_P (olddecl
))
3034 types_match
= self_promoting_args_p (p1
);
3035 if (p1
== void_list_node
)
3036 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
3038 #ifndef NO_IMPLICIT_EXTERN_C
3039 else if (p1
== NULL_TREE
3040 && (DECL_EXTERN_C_P (olddecl
)
3041 && DECL_IN_SYSTEM_HEADER (olddecl
)
3042 && !DECL_CLASS_SCOPE_P (olddecl
))
3043 && (DECL_EXTERN_C_P (newdecl
)
3044 && DECL_IN_SYSTEM_HEADER (newdecl
)
3045 && !DECL_CLASS_SCOPE_P (newdecl
)))
3047 types_match
= self_promoting_args_p (p2
);
3048 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
3052 types_match
= compparms (p1
, p2
);
3057 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3059 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3060 DECL_TEMPLATE_PARMS (olddecl
)))
3063 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
))
3064 != TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)))
3067 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3070 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
3071 DECL_TEMPLATE_RESULT (newdecl
));
3075 if (TREE_TYPE (newdecl
) == error_mark_node
)
3076 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
3077 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
3078 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
3079 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
3082 types_match
= comptypes (TREE_TYPE (newdecl
),
3083 TREE_TYPE (olddecl
),
3084 COMPARE_REDECLARATION
);
3090 /* If NEWDECL is `static' and an `extern' was seen previously,
3091 warn about it. OLDDECL is the previous declaration.
3093 Note that this does not apply to the C++ case of declaring
3094 a variable `extern const' and then later `const'.
3096 Don't complain about built-in functions, since they are beyond
3097 the user's control. */
3100 warn_extern_redeclared_static (newdecl
, olddecl
)
3101 tree newdecl
, olddecl
;
3103 static const char *explicit_extern_static_warning
3104 = "`%D' was declared `extern' and later `static'";
3105 static const char *implicit_extern_static_warning
3106 = "`%D' was declared implicitly `extern' and later `static'";
3110 if (TREE_CODE (newdecl
) == TYPE_DECL
3111 || TREE_CODE (newdecl
) == TEMPLATE_DECL
3112 || TREE_CODE (newdecl
) == CONST_DECL
)
3115 /* Don't get confused by static member functions; that's a different
3117 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3118 && DECL_STATIC_FUNCTION_P (newdecl
))
3121 /* If the old declaration was `static', or the new one isn't, then
3122 then everything is OK. */
3123 if (DECL_THIS_STATIC (olddecl
) || !DECL_THIS_STATIC (newdecl
))
3126 /* It's OK to declare a builtin function as `static'. */
3127 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3128 && DECL_ARTIFICIAL (olddecl
))
3131 name
= DECL_ASSEMBLER_NAME (newdecl
);
3132 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
3133 ? implicit_extern_static_warning
3134 : explicit_extern_static_warning
, newdecl
);
3135 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
3138 /* Handle when a new declaration NEWDECL has the same name as an old
3139 one OLDDECL in the same binding contour. Prints an error message
3142 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
3143 Otherwise, return 0. */
3146 duplicate_decls (newdecl
, olddecl
)
3147 tree newdecl
, olddecl
;
3149 unsigned olddecl_uid
= DECL_UID (olddecl
);
3150 int olddecl_friend
= 0, types_match
= 0;
3151 int new_defines_function
= 0;
3153 if (newdecl
== olddecl
)
3156 types_match
= decls_match (newdecl
, olddecl
);
3158 /* If either the type of the new decl or the type of the old decl is an
3159 error_mark_node, then that implies that we have already issued an
3160 error (earlier) for some bogus type specification, and in that case,
3161 it is rather pointless to harass the user with yet more error message
3162 about the same declaration, so just pretend the types match here. */
3163 if (TREE_TYPE (newdecl
) == error_mark_node
3164 || TREE_TYPE (olddecl
) == error_mark_node
)
3167 /* Check for redeclaration and other discrepancies. */
3168 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3169 && DECL_ARTIFICIAL (olddecl
))
3171 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
3173 /* If you declare a built-in or predefined function name as static,
3174 the old definition is overridden, but optionally warn this was a
3175 bad choice of name. */
3176 if (! TREE_PUBLIC (newdecl
))
3179 cp_warning ("shadowing %s function `%#D'",
3180 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3182 /* Discard the old built-in function. */
3185 /* If the built-in is not ansi, then programs can override
3186 it even globally without an error. */
3187 else if (! DECL_BUILT_IN (olddecl
))
3188 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
3192 cp_error ("declaration of `%#D'", newdecl
);
3193 cp_error ("conflicts with built-in declaration `%#D'",
3198 else if (!types_match
)
3200 if ((DECL_EXTERN_C_P (newdecl
)
3201 && DECL_EXTERN_C_P (olddecl
))
3202 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3203 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3205 /* A near match; override the builtin. */
3207 if (TREE_PUBLIC (newdecl
))
3209 cp_warning ("new declaration `%#D'", newdecl
);
3210 cp_warning ("ambiguates built-in declaration `%#D'",
3213 else if (warn_shadow
)
3214 cp_warning ("shadowing %s function `%#D'",
3215 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3219 /* Discard the old built-in function. */
3223 if (DECL_THIS_STATIC (newdecl
) && !DECL_THIS_STATIC (olddecl
))
3225 /* If a builtin function is redeclared as `static', merge
3226 the declarations, but make the original one static. */
3227 DECL_THIS_STATIC (olddecl
) = 1;
3228 TREE_PUBLIC (olddecl
) = 0;
3230 /* Make the old declaration consistent with the new one so
3231 that all remnants of the builtin-ness of this function
3232 will be banished. */
3233 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3234 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3235 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3236 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (newdecl
),
3240 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3242 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3243 && TREE_CODE (newdecl
) != TYPE_DECL
3244 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3245 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3246 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3247 && TREE_CODE (olddecl
) != TYPE_DECL
3248 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3249 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3252 /* We do nothing special here, because C++ does such nasty
3253 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3254 get shadowed, and know that if we need to find a TYPE_DECL
3255 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3256 slot of the identifier. */
3260 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3261 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3262 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3263 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3266 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
3267 if (TREE_CODE (olddecl
) == TREE_LIST
)
3268 olddecl
= TREE_VALUE (olddecl
);
3269 cp_error_at ("previous declaration of `%#D'", olddecl
);
3271 /* New decl is completely inconsistent with the old one =>
3272 tell caller to replace the old one. */
3276 else if (!types_match
)
3278 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
))
3279 /* These are certainly not duplicate declarations; they're
3280 from different scopes. */
3283 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3285 /* The name of a class template may not be declared to refer to
3286 any other template, class, function, object, namespace, value,
3287 or type in the same scope. */
3288 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3289 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3291 cp_error ("declaration of template `%#D'", newdecl
);
3292 cp_error_at ("conflicts with previous declaration `%#D'",
3295 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3296 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3297 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3298 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3299 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3300 DECL_TEMPLATE_PARMS (olddecl
)))
3302 cp_error ("new declaration `%#D'", newdecl
);
3303 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3307 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3309 if (DECL_EXTERN_C_P (newdecl
) && DECL_EXTERN_C_P (olddecl
))
3311 cp_error ("declaration of C function `%#D' conflicts with",
3313 cp_error_at ("previous declaration `%#D' here", olddecl
);
3315 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3316 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3318 cp_error ("new declaration `%#D'", newdecl
);
3319 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3325 /* Already complained about this, so don't do so again. */
3326 else if (current_class_type
== NULL_TREE
3327 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3329 cp_error ("conflicting types for `%#D'", newdecl
);
3330 cp_error_at ("previous declaration as `%#D'", olddecl
);
3333 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3334 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3335 && (!DECL_TEMPLATE_INFO (newdecl
)
3336 || (DECL_TI_TEMPLATE (newdecl
)
3337 != DECL_TI_TEMPLATE (olddecl
))))
3338 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3339 && (!DECL_TEMPLATE_INFO (olddecl
)
3340 || (DECL_TI_TEMPLATE (olddecl
)
3341 != DECL_TI_TEMPLATE (newdecl
))))))
3342 /* It's OK to have a template specialization and a non-template
3343 with the same type, or to have specializations of two
3344 different templates with the same type. Note that if one is a
3345 specialization, and the other is an instantiation of the same
3346 template, that we do not exit at this point. That situation
3347 can occur if we instantiate a template class, and then
3348 specialize one of its methods. This situation is legal, but
3349 the declarations must be merged in the usual way. */
3351 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3352 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3353 && !DECL_USE_TEMPLATE (newdecl
))
3354 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3355 && !DECL_USE_TEMPLATE (olddecl
))))
3356 /* One of the declarations is a template instantiation, and the
3357 other is not a template at all. That's OK. */
3359 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3360 && DECL_NAMESPACE_ALIAS (newdecl
)
3361 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3362 /* Redeclaration of namespace alias, ignore it. */
3366 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3369 cp_error (errmsg
, newdecl
);
3370 if (DECL_NAME (olddecl
) != NULL_TREE
)
3371 cp_error_at ((DECL_INITIAL (olddecl
)
3372 && namespace_bindings_p ())
3373 ? "`%#D' previously defined here"
3374 : "`%#D' previously declared here", olddecl
);
3376 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3377 && DECL_INITIAL (olddecl
) != NULL_TREE
3378 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3379 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3381 /* Prototype decl follows defn w/o prototype. */
3382 cp_warning_at ("prototype for `%#D'", newdecl
);
3383 cp_warning_at ("follows non-prototype definition here", olddecl
);
3385 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3386 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3388 /* extern "C" int foo ();
3389 int foo () { bar (); }
3391 if (current_lang_stack
3392 == &VARRAY_TREE (current_lang_base
, 0))
3393 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3396 cp_error_at ("previous declaration of `%#D' with %L linkage",
3397 olddecl
, DECL_LANGUAGE (olddecl
));
3398 cp_error ("conflicts with new declaration with %L linkage",
3399 DECL_LANGUAGE (newdecl
));
3403 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3405 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3407 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3408 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3411 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3412 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3414 for (; t1
&& t1
!= void_list_node
;
3415 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3416 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3418 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3423 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3425 cp_pedwarn_at ("after previous specification in `%#D'",
3431 cp_error ("default argument given for parameter %d of `%#D'",
3433 cp_error_at ("after previous specification in `%#D'",
3438 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
3439 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3441 cp_warning ("`%#D' was used before it was declared inline",
3443 cp_warning_at ("previous non-inline declaration here",
3449 /* If new decl is `static' and an `extern' was seen previously,
3451 warn_extern_redeclared_static (newdecl
, olddecl
);
3453 /* We have committed to returning 1 at this point. */
3454 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3456 /* Now that functions must hold information normally held
3457 by field decls, there is extra work to do so that
3458 declaration information does not get destroyed during
3460 if (DECL_VINDEX (olddecl
))
3461 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3462 if (DECL_VIRTUAL_CONTEXT (olddecl
))
3463 DECL_VIRTUAL_CONTEXT (newdecl
) = DECL_VIRTUAL_CONTEXT (olddecl
);
3464 if (DECL_CONTEXT (olddecl
))
3465 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3466 if (DECL_PENDING_INLINE_INFO (newdecl
) == 0)
3467 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3468 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3469 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3470 DECL_PURE_VIRTUAL_P (newdecl
) |= DECL_PURE_VIRTUAL_P (olddecl
);
3471 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3472 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3473 DECL_THIS_STATIC (newdecl
) |= DECL_THIS_STATIC (olddecl
);
3474 DECL_LANG_SPECIFIC (newdecl
)->u2
= DECL_LANG_SPECIFIC (olddecl
)->u2
;
3475 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3477 /* Optionally warn about more than one declaration for the same
3478 name, but don't warn about a function declaration followed by a
3480 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3481 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3482 /* Don't warn about extern decl followed by definition. */
3483 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3484 /* Don't warn about friends, let add_friend take care of it. */
3485 && ! DECL_FRIEND_P (newdecl
))
3487 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3488 cp_warning_at ("previous declaration of `%D'", olddecl
);
3492 /* Deal with C++: must preserve virtual function table size. */
3493 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3495 register tree newtype
= TREE_TYPE (newdecl
);
3496 register tree oldtype
= TREE_TYPE (olddecl
);
3498 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3499 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3501 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3502 CLASSTYPE_FRIEND_CLASSES (newtype
)
3503 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3506 DECL_ORIGINAL_TYPE (newdecl
) = DECL_ORIGINAL_TYPE (olddecl
);
3509 /* Copy all the DECL_... slots specified in the new decl
3510 except for any that we copy here from the old type. */
3511 DECL_MACHINE_ATTRIBUTES (newdecl
)
3512 = merge_machine_decl_attributes (olddecl
, newdecl
);
3514 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3516 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3517 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3518 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3519 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3526 /* Automatically handles default parameters. */
3527 tree oldtype
= TREE_TYPE (olddecl
);
3530 /* Merge the data types specified in the two decls. */
3531 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3533 /* If common_type produces a non-typedef type, just use the old type. */
3534 if (TREE_CODE (newdecl
) == TYPE_DECL
3535 && newtype
== DECL_ORIGINAL_TYPE (newdecl
))
3538 if (TREE_CODE (newdecl
) == VAR_DECL
)
3539 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3540 /* Do this after calling `common_type' so that default
3541 parameters don't confuse us. */
3542 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3543 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3544 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3546 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3547 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3548 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3549 TYPE_RAISES_EXCEPTIONS (oldtype
));
3551 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3552 && DECL_SOURCE_LINE (olddecl
) != 0
3554 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
3555 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
3557 cp_error ("declaration of `%F' throws different exceptions",
3559 cp_error_at ("than previous declaration `%F'", olddecl
);
3562 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3564 /* Lay the type out, unless already done. */
3565 if (! same_type_p (newtype
, oldtype
)
3566 && TREE_TYPE (newdecl
) != error_mark_node
3567 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3568 layout_type (TREE_TYPE (newdecl
));
3570 if ((TREE_CODE (newdecl
) == VAR_DECL
3571 || TREE_CODE (newdecl
) == PARM_DECL
3572 || TREE_CODE (newdecl
) == RESULT_DECL
3573 || TREE_CODE (newdecl
) == FIELD_DECL
3574 || TREE_CODE (newdecl
) == TYPE_DECL
)
3575 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3576 layout_decl (newdecl
, 0);
3578 /* Merge the type qualifiers. */
3579 if (TREE_READONLY (newdecl
))
3580 TREE_READONLY (olddecl
) = 1;
3581 if (TREE_THIS_VOLATILE (newdecl
))
3582 TREE_THIS_VOLATILE (olddecl
) = 1;
3584 /* Merge the initialization information. */
3585 if (DECL_INITIAL (newdecl
) == NULL_TREE
3586 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3588 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3589 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3590 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3591 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
3592 && DECL_LANG_SPECIFIC (newdecl
)
3593 && DECL_LANG_SPECIFIC (olddecl
))
3594 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3597 /* Merge the section attribute.
3598 We want to issue an error if the sections conflict but that must be
3599 done later in decl_attributes since we are called before attributes
3601 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3602 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3604 /* Keep the old rtl since we can safely use it. */
3605 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3607 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3609 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (newdecl
)
3610 |= DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (olddecl
);
3611 DECL_NO_CHECK_MEMORY_USAGE (newdecl
)
3612 |= DECL_NO_CHECK_MEMORY_USAGE (olddecl
);
3613 DECL_NO_LIMIT_STACK (newdecl
)
3614 |= DECL_NO_LIMIT_STACK (olddecl
);
3617 /* If cannot merge, then use the new type and qualifiers,
3618 and don't preserve the old rtl. */
3621 /* Clean out any memory we had of the old declaration. */
3622 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3624 TREE_VALUE (oldstatic
) = error_mark_node
;
3626 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3627 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3628 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3629 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3632 /* Merge the storage class information. */
3633 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3634 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3635 DECL_DEFER_OUTPUT (newdecl
) |= DECL_DEFER_OUTPUT (olddecl
);
3636 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3637 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3638 if (! DECL_EXTERNAL (olddecl
))
3639 DECL_EXTERNAL (newdecl
) = 0;
3641 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3643 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3644 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3645 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3646 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3647 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3648 /* Don't really know how much of the language-specific
3649 values we should copy from old to new. */
3650 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3651 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3652 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3653 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3654 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3656 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3657 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3658 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3659 DECL_BEFRIENDING_CLASSES (newdecl
)
3660 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3661 DECL_BEFRIENDING_CLASSES (olddecl
));
3664 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3666 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3667 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3669 /* If newdecl is not a specialization, then it is not a
3670 template-related function at all. And that means that we
3671 shoud have exited above, returning 0. */
3672 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3675 if (TREE_USED (olddecl
))
3676 /* From [temp.expl.spec]:
3678 If a template, a member template or the member of a class
3679 template is explicitly specialized then that
3680 specialization shall be declared before the first use of
3681 that specialization that would cause an implicit
3682 instantiation to take place, in every translation unit in
3683 which such a use occurs. */
3684 cp_error ("explicit specialization of %D after first use",
3687 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3689 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3691 /* If either decl says `inline', this fn is inline, unless its
3692 definition was passed already. */
3693 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3694 DECL_INLINE (olddecl
) = 1;
3695 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3699 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3700 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3701 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3703 if (! types_match
|| new_defines_function
)
3705 /* These need to be copied so that the names are available.
3706 Note that if the types do match, we'll preserve inline
3707 info and other bits, but if not, we won't. */
3708 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3709 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3711 if (new_defines_function
)
3712 /* If defining a function declared with other language
3713 linkage, use the previously declared language linkage. */
3714 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3715 else if (types_match
)
3717 /* If redeclaring a builtin function, and not a definition,
3718 it stays built in. */
3719 if (DECL_BUILT_IN (olddecl
))
3721 DECL_BUILT_IN_CLASS (newdecl
) = DECL_BUILT_IN_CLASS (olddecl
);
3722 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3723 /* If we're keeping the built-in definition, keep the rtl,
3724 regardless of declaration matches. */
3725 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3728 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3730 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3731 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3732 /* Previously saved insns go together with
3733 the function's previous definition. */
3734 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3735 /* Don't clear out the arguments if we're redefining a function. */
3736 if (DECL_ARGUMENTS (olddecl
))
3737 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3741 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3743 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3746 /* Now preserve various other info from the definition. */
3747 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3748 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3749 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3750 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3752 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3756 function_size
= sizeof (struct tree_decl
);
3758 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3759 (char *) olddecl
+ sizeof (struct tree_common
),
3760 function_size
- sizeof (struct tree_common
));
3762 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3764 /* If newdecl is a template instantiation, it is possible that
3765 the following sequence of events has occurred:
3767 o A friend function was declared in a class template. The
3768 class template was instantiated.
3770 o The instantiation of the friend declaration was
3771 recorded on the instantiation list, and is newdecl.
3773 o Later, however, instantiate_class_template called pushdecl
3774 on the newdecl to perform name injection. But, pushdecl in
3775 turn called duplicate_decls when it discovered that another
3776 declaration of a global function with the same name already
3779 o Here, in duplicate_decls, we decided to clobber newdecl.
3781 If we're going to do that, we'd better make sure that
3782 olddecl, and not newdecl, is on the list of
3783 instantiations so that if we try to do the instantiation
3784 again we won't get the clobbered declaration. */
3786 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3787 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3789 for (; decls
; decls
= TREE_CHAIN (decls
))
3790 if (TREE_VALUE (decls
) == newdecl
)
3791 TREE_VALUE (decls
) = olddecl
;
3796 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3797 (char *) olddecl
+ sizeof (struct tree_common
),
3798 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3799 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3802 DECL_UID (olddecl
) = olddecl_uid
;
3804 DECL_FRIEND_P (olddecl
) = 1;
3806 /* NEWDECL contains the merged attribute lists.
3807 Update OLDDECL to be the same. */
3808 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3813 /* Record a decl-node X as belonging to the current lexical scope.
3814 Check for errors (such as an incompatible declaration for the same
3815 name already seen in the same scope).
3817 Returns either X or an old decl for the same name.
3818 If an old decl is returned, it may have been smashed
3819 to agree with what X says. */
3827 int need_new_binding
;
3829 /* We shouldn't be calling pushdecl when we're generating RTL for a
3830 function that we already did semantic analysis on previously. */
3831 my_friendly_assert (!cfun
|| doing_semantic_analysis_p (),
3834 need_new_binding
= 1;
3836 if (DECL_TEMPLATE_PARM_P (x
))
3837 /* Template parameters have no context; they are not X::T even
3838 when declared within a class or namespace. */
3842 if (current_function_decl
&& x
!= current_function_decl
3843 /* A local declaration for a function doesn't constitute
3845 && !(TREE_CODE (x
) == FUNCTION_DECL
&& !DECL_INITIAL (x
))
3846 /* A local declaration for an `extern' variable is in the
3847 scope of the current namespace, not the current
3849 && !(TREE_CODE (x
) == VAR_DECL
&& DECL_EXTERNAL (x
))
3850 && !DECL_CONTEXT (x
))
3851 DECL_CONTEXT (x
) = current_function_decl
;
3853 /* If this is the declaration for a namespace-scope function,
3854 but the declaration itself is in a local scope, mark the
3856 if (TREE_CODE (x
) == FUNCTION_DECL
3857 && DECL_NAMESPACE_SCOPE_P (x
)
3858 && current_function_decl
3859 && x
!= current_function_decl
)
3860 DECL_LOCAL_FUNCTION_P (x
) = 1;
3863 name
= DECL_NAME (x
);
3866 int different_binding_level
= 0;
3868 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3869 name
= TREE_OPERAND (name
, 0);
3871 /* In case this decl was explicitly namespace-qualified, look it
3872 up in its namespace context. */
3873 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
)
3874 && namespace_bindings_p ())
3875 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3877 t
= lookup_name_current_level (name
);
3879 /* [basic.link] If there is a visible declaration of an entity
3880 with linkage having the same name and type, ignoring entities
3881 declared outside the innermost enclosing namespace scope, the
3882 block scope declaration declares that same entity and
3883 receives the linkage of the previous declaration. */
3884 if (! t
&& current_function_decl
&& x
!= current_function_decl
3885 && (TREE_CODE (x
) == FUNCTION_DECL
|| TREE_CODE (x
) == VAR_DECL
)
3886 && DECL_EXTERNAL (x
))
3888 /* Look in block scope. */
3889 t
= IDENTIFIER_VALUE (name
);
3890 /* Or in the innermost namespace. */
3892 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3893 /* Does it have linkage? */
3894 if (t
&& ! (TREE_STATIC (t
) || DECL_EXTERNAL (t
)))
3897 different_binding_level
= 1;
3900 /* If we are declaring a function, and the result of name-lookup
3901 was an OVERLOAD, look for an overloaded instance that is
3902 actually the same as the function we are declaring. (If
3903 there is one, we have to merge our declaration with the
3904 previous declaration.) */
3905 if (t
&& TREE_CODE (t
) == OVERLOAD
)
3909 if (TREE_CODE (x
) == FUNCTION_DECL
)
3910 for (match
= t
; match
; match
= OVL_NEXT (match
))
3912 if (DECL_ASSEMBLER_NAME (OVL_CURRENT (t
))
3913 == DECL_ASSEMBLER_NAME (x
))
3917 /* Just choose one. */
3921 t
= OVL_CURRENT (match
);
3926 if (t
== error_mark_node
)
3928 /* error_mark_node is 0 for a while during initialization! */
3930 cp_error_at ("`%#D' used prior to declaration", x
);
3932 else if (t
!= NULL_TREE
)
3934 if (different_binding_level
)
3936 if (decls_match (x
, t
))
3937 /* The standard only says that the local extern
3938 inherits linkage from the previous decl; in
3939 particular, default args are not shared. It would
3940 be nice to propagate inlining info, though. FIXME. */
3941 TREE_PUBLIC (x
) = TREE_PUBLIC (t
);
3943 else if (TREE_CODE (t
) == PARM_DECL
)
3945 if (DECL_CONTEXT (t
) == NULL_TREE
)
3946 fatal ("parse errors have confused me too much");
3948 /* Check for duplicate params. */
3949 if (duplicate_decls (x
, t
))
3952 else if ((DECL_EXTERN_C_FUNCTION_P (x
)
3953 || DECL_FUNCTION_TEMPLATE_P (x
))
3954 && is_overloaded_fn (t
))
3955 /* Don't do anything just yet. */;
3956 else if (t
== wchar_decl_node
)
3958 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3959 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3961 /* Throw away the redeclaration. */
3964 else if (TREE_CODE (t
) != TREE_CODE (x
))
3966 if (duplicate_decls (x
, t
))
3969 else if (duplicate_decls (x
, t
))
3971 if (TREE_CODE (t
) == TYPE_DECL
)
3972 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3973 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3974 check_default_args (t
);
3978 else if (DECL_MAIN_P (x
))
3980 /* A redeclaration of main, but not a duplicate of the
3985 This function shall not be overloaded. */
3986 cp_error_at ("invalid redeclaration of `%D'", t
);
3987 cp_error ("as `%D'", x
);
3988 /* We don't try to push this declaration since that
3994 check_template_shadow (x
);
3996 /* If this is a function conjured up by the backend, massage it
3997 so it looks friendly. */
3998 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_LANG_SPECIFIC (x
))
4000 retrofit_lang_decl (x
);
4001 DECL_LANGUAGE (x
) = lang_c
;
4004 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_FUNCTION_MEMBER_P (x
))
4006 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
4009 if (!namespace_bindings_p ())
4010 /* We do not need to create a binding for this name;
4011 push_overloaded_decl will have already done so if
4013 need_new_binding
= 0;
4015 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
4017 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
4019 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
4023 /* If declaring a type as a typedef, copy the type (unless we're
4024 at line 0), and install this TYPE_DECL as the new type's typedef
4025 name. See the extensive comment in ../c-decl.c (pushdecl). */
4026 if (TREE_CODE (x
) == TYPE_DECL
)
4028 tree type
= TREE_TYPE (x
);
4029 if (DECL_SOURCE_LINE (x
) == 0)
4031 if (TYPE_NAME (type
) == 0)
4032 TYPE_NAME (type
) = x
;
4034 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
4035 /* We don't want to copy the type when all we're
4036 doing is making a TYPE_DECL for the purposes of
4038 && (!TYPE_NAME (type
)
4039 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
4041 DECL_ORIGINAL_TYPE (x
) = type
;
4042 type
= build_type_copy (type
);
4043 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
4044 TYPE_NAME (type
) = x
;
4045 TREE_TYPE (x
) = type
;
4048 if (type
!= error_mark_node
4050 && TYPE_IDENTIFIER (type
))
4051 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
4052 current_binding_level
);
4056 /* Multiple external decls of the same identifier ought to match.
4058 We get warnings about inline functions where they are defined.
4059 We get warnings about other functions from push_overloaded_decl.
4061 Avoid duplicate warnings where they are used. */
4062 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
4066 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
4067 if (decl
&& TREE_CODE (decl
) == OVERLOAD
)
4068 decl
= OVL_FUNCTION (decl
);
4070 if (decl
&& decl
!= error_mark_node
4071 && (DECL_EXTERNAL (decl
) || TREE_PUBLIC (decl
))
4072 /* If different sort of thing, we already gave an error. */
4073 && TREE_CODE (decl
) == TREE_CODE (x
)
4074 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
4076 cp_pedwarn ("type mismatch with previous external decl", x
);
4077 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
4081 /* This name is new in its binding level.
4082 Install the new declaration and return it. */
4083 if (namespace_bindings_p ())
4085 /* Install a global value. */
4087 /* If the first global decl has external linkage,
4088 warn if we later see static one. */
4089 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
4090 TREE_PUBLIC (name
) = 1;
4092 /* Bind the mangled name for the entity. In the future, we
4093 should not need to do this; mangled names are an
4094 implementation detail of which the front-end should not
4095 need to be aware. */
4096 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
4098 /* For an ordinary function, we create a binding from
4099 the mangled name (i.e., NAME) to the DECL. But, for
4100 an `extern "C"' function, the mangled name and the
4101 ordinary name are the same so we need not do this. */
4102 && !DECL_EXTERN_C_FUNCTION_P (x
))
4106 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
4107 || TREE_CODE (x
) == NAMESPACE_DECL
)
4108 mangled_name
= name
;
4110 mangled_name
= DECL_ASSEMBLER_NAME (x
);
4112 if (TREE_CODE (x
) == FUNCTION_DECL
)
4114 ((IDENTIFIER_GLOBAL_VALUE (mangled_name
) == NULL_TREE
)
4115 || (IDENTIFIER_GLOBAL_VALUE (mangled_name
) == x
), 378);
4116 SET_IDENTIFIER_NAMESPACE_VALUE (mangled_name
, x
);
4119 /* Don't forget if the function was used via an implicit decl. */
4120 if (IDENTIFIER_IMPLICIT_DECL (name
)
4121 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
4124 /* Don't forget if its address was taken in that way. */
4125 if (IDENTIFIER_IMPLICIT_DECL (name
)
4126 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
4127 TREE_ADDRESSABLE (x
) = 1;
4129 /* Warn about mismatches against previous implicit decl. */
4130 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
4131 /* If this real decl matches the implicit, don't complain. */
4132 && ! (TREE_CODE (x
) == FUNCTION_DECL
4133 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
4135 ("`%D' was previously implicitly declared to return `int'", x
);
4137 /* If new decl is `static' and an `extern' was seen previously,
4139 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
4140 warn_extern_redeclared_static (x
, t
);
4144 /* Here to install a non-global value. */
4145 tree oldlocal
= IDENTIFIER_VALUE (name
);
4146 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
4148 if (need_new_binding
)
4150 push_local_binding (name
, x
, 0);
4151 /* Because push_local_binding will hook X on to the
4152 current_binding_level's name list, we don't want to
4153 do that again below. */
4154 need_new_binding
= 0;
4157 /* If this is a TYPE_DECL, push it into the type value slot. */
4158 if (TREE_CODE (x
) == TYPE_DECL
)
4159 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
4160 current_binding_level
);
4162 /* Clear out any TYPE_DECL shadowed by a namespace so that
4163 we won't think this is a type. The C struct hack doesn't
4164 go through namespaces. */
4165 if (TREE_CODE (x
) == NAMESPACE_DECL
)
4166 set_identifier_type_value_with_scope (name
, NULL_TREE
,
4167 current_binding_level
);
4174 && TREE_CODE (oldlocal
) == VAR_DECL
4175 && DECL_DEAD_FOR_LOCAL (oldlocal
))
4176 oldlocal
= DECL_SHADOWED_FOR_VAR (oldlocal
);
4178 if (oldlocal
== NULL_TREE
)
4179 oldlocal
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (d
));
4182 /* If this is an extern function declaration, see if we
4183 have a global definition or declaration for the function. */
4184 if (oldlocal
== NULL_TREE
4185 && DECL_EXTERNAL (x
)
4186 && oldglobal
!= NULL_TREE
4187 && TREE_CODE (x
) == FUNCTION_DECL
4188 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
4190 /* We have one. Their types must agree. */
4191 if (decls_match (x
, oldglobal
))
4195 cp_warning ("extern declaration of `%#D' doesn't match", x
);
4196 cp_warning_at ("global declaration `%#D'", oldglobal
);
4199 /* If we have a local external declaration,
4200 and no file-scope declaration has yet been seen,
4201 then if we later have a file-scope decl it must not be static. */
4202 if (oldlocal
== NULL_TREE
4203 && oldglobal
== NULL_TREE
4204 && DECL_EXTERNAL (x
)
4206 TREE_PUBLIC (name
) = 1;
4208 /* Warn if shadowing an argument at the top level of the body. */
4209 if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
4210 /* Inline decls shadow nothing. */
4211 && !DECL_FROM_INLINE (x
)
4212 && TREE_CODE (oldlocal
) == PARM_DECL
4213 /* Don't complain if it's from an enclosing function. */
4214 && DECL_CONTEXT (oldlocal
) == current_function_decl
4215 && TREE_CODE (x
) != PARM_DECL
)
4217 /* Go to where the parms should be and see if we
4219 struct binding_level
*b
= current_binding_level
->level_chain
;
4225 if (b
->parm_flag
== 1)
4226 cp_error ("declaration of `%#D' shadows a parameter", name
);
4229 /* Maybe warn if shadowing something else. */
4230 if (warn_shadow
&& !DECL_EXTERNAL (x
)
4231 /* Inline decls shadow nothing. */
4232 && !DECL_FROM_INLINE (x
)
4233 /* No shadow warnings for internally generated vars. */
4234 && ! DECL_ARTIFICIAL (x
)
4235 /* No shadow warnings for vars made for inlining. */
4236 && ! DECL_FROM_INLINE (x
))
4238 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
4239 warning ("declaration of `%s' shadows a parameter",
4240 IDENTIFIER_POINTER (name
));
4241 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
4242 && current_class_ptr
4243 && !TREE_STATIC (name
))
4244 warning ("declaration of `%s' shadows a member of `this'",
4245 IDENTIFIER_POINTER (name
));
4246 else if (oldlocal
!= NULL_TREE
)
4247 warning ("declaration of `%s' shadows previous local",
4248 IDENTIFIER_POINTER (name
));
4249 else if (oldglobal
!= NULL_TREE
)
4250 /* XXX shadow warnings in outer-more namespaces */
4251 warning ("declaration of `%s' shadows global declaration",
4252 IDENTIFIER_POINTER (name
));
4256 if (TREE_CODE (x
) == FUNCTION_DECL
)
4257 check_default_args (x
);
4259 /* Keep count of variables in this level with incomplete type. */
4260 if (TREE_CODE (x
) == VAR_DECL
4261 && TREE_TYPE (x
) != error_mark_node
4262 && ((!COMPLETE_TYPE_P (TREE_TYPE (x
))
4263 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
4264 /* RTTI TD entries are created while defining the type_info. */
4265 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
4266 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
4268 if (namespace_bindings_p ())
4269 namespace_scope_incomplete
4270 = tree_cons (NULL_TREE
, x
, namespace_scope_incomplete
);
4272 current_binding_level
->incomplete
4273 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4277 if (need_new_binding
)
4278 add_decl_to_level (x
,
4279 DECL_NAMESPACE_SCOPE_P (x
)
4280 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x
))
4281 : current_binding_level
);
4286 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4287 caller to set DECL_CONTEXT properly. */
4290 pushdecl_with_scope (x
, level
)
4292 struct binding_level
*level
;
4294 register struct binding_level
*b
;
4295 tree function_decl
= current_function_decl
;
4297 current_function_decl
= NULL_TREE
;
4298 if (level
->parm_flag
== 2)
4300 b
= class_binding_level
;
4301 class_binding_level
= level
;
4302 pushdecl_class_level (x
);
4303 class_binding_level
= b
;
4307 b
= current_binding_level
;
4308 current_binding_level
= level
;
4310 current_binding_level
= b
;
4312 current_function_decl
= function_decl
;
4316 /* Like pushdecl, only it places X in the current namespace,
4320 pushdecl_namespace_level (x
)
4323 register struct binding_level
*b
= current_binding_level
;
4326 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4328 /* Now, the type_shadowed stack may screw us. Munge it so it does
4330 if (TREE_CODE (x
) == TYPE_DECL
)
4332 tree name
= DECL_NAME (x
);
4334 tree
*ptr
= (tree
*)0;
4335 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4337 tree shadowed
= b
->type_shadowed
;
4338 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4339 if (TREE_PURPOSE (shadowed
) == name
)
4341 ptr
= &TREE_VALUE (shadowed
);
4342 /* Can't break out of the loop here because sometimes
4343 a binding level will have duplicate bindings for
4344 PT names. It's gross, but I haven't time to fix it. */
4347 newval
= TREE_TYPE (x
);
4348 if (ptr
== (tree
*)0)
4350 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4351 up here if this is changed to an assertion. --KR */
4352 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4362 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4366 pushdecl_top_level (x
)
4369 push_to_top_level ();
4370 x
= pushdecl_namespace_level (x
);
4371 pop_from_top_level ();
4375 /* Make the declaration of X appear in CLASS scope. */
4378 pushdecl_class_level (x
)
4381 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4382 scope looks for the pre-mangled name. */
4385 if (TREE_CODE (x
) == OVERLOAD
)
4386 x
= OVL_CURRENT (x
);
4387 name
= DECL_NAME (x
);
4391 push_class_level_binding (name
, x
);
4392 if (TREE_CODE (x
) == TYPE_DECL
)
4393 set_identifier_type_value (name
, TREE_TYPE (x
));
4395 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4399 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4402 pushdecl_class_level (f
);
4406 /* Enter DECL into the symbol table, if that's appropriate. Returns
4407 DECL, or a modified version thereof. */
4410 maybe_push_decl (decl
)
4413 tree type
= TREE_TYPE (decl
);
4415 /* Add this decl to the current binding level, but not if it comes
4416 from another scope, e.g. a static member variable. TEM may equal
4417 DECL or it may be a previous decl of the same name. */
4418 if (decl
== error_mark_node
4419 || (TREE_CODE (decl
) != PARM_DECL
4420 && DECL_CONTEXT (decl
) != NULL_TREE
4421 /* Definitions of namespace members outside their namespace are
4423 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4424 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4425 || TREE_CODE (type
) == UNKNOWN_TYPE
4426 /* The declaration of a template specialization does not affect
4427 the functions available for overload resolution, so we do not
4429 || (TREE_CODE (decl
) == FUNCTION_DECL
4430 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4433 return pushdecl (decl
);
4436 /* Make the declaration(s) of X appear in CLASS scope
4437 under the name NAME. */
4440 push_class_level_binding (name
, x
)
4445 /* The class_binding_level will be NULL if x is a template
4446 parameter name in a member template. */
4447 if (!class_binding_level
)
4450 /* Make sure that this new member does not have the same name
4451 as a template parameter. */
4452 if (TYPE_BEING_DEFINED (current_class_type
))
4453 check_template_shadow (x
);
4455 /* If this declaration shadows a declaration from an enclosing
4456 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4457 we leave this class. Record the shadowed declaration here. */
4458 binding
= IDENTIFIER_BINDING (name
);
4460 && ((TREE_CODE (x
) == OVERLOAD
4461 && BINDING_VALUE (binding
)
4462 && is_overloaded_fn (BINDING_VALUE (binding
)))
4463 || INHERITED_VALUE_BINDING_P (binding
)))
4468 /* If the old binding was from a base class, and was for a tag
4469 name, slide it over to make room for the new binding. The
4470 old binding is still visible if explicitly qualified with a
4472 if (INHERITED_VALUE_BINDING_P (binding
)
4473 && BINDING_VALUE (binding
)
4474 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4475 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4476 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4478 old_decl
= BINDING_TYPE (binding
);
4479 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4480 BINDING_VALUE (binding
) = NULL_TREE
;
4481 INHERITED_VALUE_BINDING_P (binding
) = 0;
4484 old_decl
= BINDING_VALUE (binding
);
4486 /* There was already a binding for X containing fewer
4487 functions than are named in X. Find the previous
4488 declaration of X on the class-shadowed list, and update it. */
4489 for (shadow
= class_binding_level
->class_shadowed
;
4491 shadow
= TREE_CHAIN (shadow
))
4492 if (TREE_PURPOSE (shadow
) == name
4493 && TREE_TYPE (shadow
) == old_decl
)
4495 BINDING_VALUE (binding
) = x
;
4496 INHERITED_VALUE_BINDING_P (binding
) = 0;
4497 TREE_TYPE (shadow
) = x
;
4502 /* If we didn't replace an existing binding, put the binding on the
4503 stack of bindings for the identifier, and update
4504 IDENTIFIER_CLASS_VALUE. */
4505 if (push_class_binding (name
, x
))
4507 class_binding_level
->class_shadowed
4508 = tree_cons (name
, IDENTIFIER_CLASS_VALUE (name
),
4509 class_binding_level
->class_shadowed
);
4510 /* Record the value we are binding NAME to so that we can know
4511 what to pop later. */
4512 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4516 /* Insert another USING_DECL into the current binding level, returning
4517 this declaration. If this is a redeclaration, do nothing, and
4518 return NULL_TREE if this not in namespace scope (in namespace
4519 scope, a using decl might extend any previous bindings). */
4522 push_using_decl (scope
, name
)
4528 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4529 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4530 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4531 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4534 return namespace_bindings_p () ? decl
: NULL_TREE
;
4535 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4536 DECL_INITIAL (decl
) = scope
;
4537 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4538 current_binding_level
->usings
= decl
;
4542 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4543 changed (i.e. there was already a directive), or the fresh
4544 TREE_LIST otherwise. */
4547 push_using_directive (used
)
4550 tree ud
= current_binding_level
->using_directives
;
4551 tree iter
, ancestor
;
4553 /* Check if we already have this. */
4554 if (purpose_member (used
, ud
) != NULL_TREE
)
4557 /* Recursively add all namespaces used. */
4558 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4559 push_using_directive (TREE_PURPOSE (iter
));
4561 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4562 ud
= current_binding_level
->using_directives
;
4563 ud
= tree_cons (used
, ancestor
, ud
);
4564 current_binding_level
->using_directives
= ud
;
4568 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4569 other definitions already in place. We get around this by making
4570 the value of the identifier point to a list of all the things that
4571 want to be referenced by that name. It is then up to the users of
4572 that name to decide what to do with that list.
4574 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its
4575 DECL_TEMPLATE_RESULT. It is dealt with the same way.
4577 FLAGS is a bitwise-or of the following values:
4578 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4580 PUSH_USING: DECL is being pushed as the result of a using
4583 The value returned may be a previous declaration if we guessed wrong
4584 about what language DECL should belong to (C or C++). Otherwise,
4585 it's always DECL (and never something that's not a _DECL). */
4588 push_overloaded_decl (decl
, flags
)
4592 tree name
= DECL_NAME (decl
);
4595 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4598 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4600 old
= lookup_name_current_level (name
);
4604 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4606 tree t
= TREE_TYPE (old
);
4607 if (IS_AGGR_TYPE (t
) && warn_shadow
4608 && (! DECL_IN_SYSTEM_HEADER (decl
)
4609 || ! DECL_IN_SYSTEM_HEADER (old
)))
4610 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4613 else if (is_overloaded_fn (old
))
4617 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4619 tree fn
= OVL_CURRENT (tmp
);
4621 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4622 && !(flags
& PUSH_USING
)
4623 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4624 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4625 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4628 if (duplicate_decls (decl
, fn
))
4632 else if (old
== error_mark_node
)
4633 /* Ignore the undefined symbol marker. */
4637 cp_error_at ("previous non-function declaration `%#D'", old
);
4638 cp_error ("conflicts with function declaration `%#D'", decl
);
4643 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4645 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4646 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4648 new_binding
= ovl_cons (decl
, old
);
4649 if (flags
& PUSH_USING
)
4650 OVL_USED (new_binding
) = 1;
4653 /* NAME is not ambiguous. */
4657 set_namespace_binding (name
, current_namespace
, new_binding
);
4660 /* We only create an OVERLOAD if there was a previous binding at
4661 this level, or if decl is a template. In the former case, we
4662 need to remove the old binding and replace it with the new
4663 binding. We must also run through the NAMES on the binding
4664 level where the name was bound to update the chain. */
4666 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4670 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4672 d
= &TREE_CHAIN (*d
))
4674 || (TREE_CODE (*d
) == TREE_LIST
4675 && TREE_VALUE (*d
) == old
))
4677 if (TREE_CODE (*d
) == TREE_LIST
)
4678 /* Just replace the old binding with the new. */
4679 TREE_VALUE (*d
) = new_binding
;
4681 /* Build a TREE_LIST to wrap the OVERLOAD. */
4682 *d
= tree_cons (NULL_TREE
, new_binding
,
4685 /* And update the CPLUS_BINDING node. */
4686 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4691 /* We should always find a previous binding in this case. */
4692 my_friendly_abort (0);
4695 /* Install the new binding. */
4696 push_local_binding (name
, new_binding
, flags
);
4702 /* Generate an implicit declaration for identifier FUNCTIONID
4703 as a function of type int (). Print a warning if appropriate. */
4706 implicitly_declare (functionid
)
4711 /* We used to reuse an old implicit decl here,
4712 but this loses with inline functions because it can clobber
4713 the saved decl chains. */
4714 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4716 DECL_EXTERNAL (decl
) = 1;
4717 TREE_PUBLIC (decl
) = 1;
4719 /* ISO standard says implicit declarations are in the innermost block.
4720 So we record the decl in the standard fashion. */
4722 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4725 /* Only one warning per identifier. */
4726 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4728 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4731 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4736 /* Return zero if the declaration NEWDECL is valid
4737 when the declaration OLDDECL (assumed to be for the same name)
4738 has already been seen.
4739 Otherwise return an error message format string with a %s
4740 where the identifier should go. */
4743 redeclaration_error_message (newdecl
, olddecl
)
4744 tree newdecl
, olddecl
;
4746 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4748 /* Because C++ can put things into name space for free,
4749 constructs like "typedef struct foo { ... } foo"
4750 would look like an erroneous redeclaration. */
4751 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4754 return "redefinition of `%#D'";
4756 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4758 /* If this is a pure function, its olddecl will actually be
4759 the original initialization to `0' (which we force to call
4760 abort()). Don't complain about redefinition in this case. */
4761 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_PURE_VIRTUAL_P (olddecl
))
4764 /* If both functions come from different namespaces, this is not
4765 a redeclaration - this is a conflict with a used function. */
4766 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4767 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4768 return "`%D' conflicts with used function";
4770 /* We'll complain about linkage mismatches in
4771 warn_extern_redeclared_static. */
4773 /* Defining the same name twice is no good. */
4774 if (DECL_INITIAL (olddecl
) != NULL_TREE
4775 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4777 if (DECL_NAME (olddecl
) == NULL_TREE
)
4778 return "`%#D' not declared in class";
4780 return "redefinition of `%#D'";
4784 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4786 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4787 && (DECL_TEMPLATE_RESULT (newdecl
)
4788 != DECL_TEMPLATE_RESULT (olddecl
))
4789 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4790 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4791 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4792 && COMPLETE_TYPE_P (TREE_TYPE (newdecl
))
4793 && COMPLETE_TYPE_P (TREE_TYPE (olddecl
))))
4794 return "redefinition of `%#D'";
4797 else if (toplevel_bindings_p () || DECL_NAMESPACE_SCOPE_P (newdecl
))
4799 /* Objects declared at top level: */
4800 /* If at least one is a reference, it's ok. */
4801 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4803 /* Reject two definitions. */
4804 return "redefinition of `%#D'";
4808 /* Objects declared with block scope: */
4809 /* Reject two definitions, and reject a definition
4810 together with an external reference. */
4811 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4812 return "redeclaration of `%#D'";
4817 /* Create a new label, named ID. */
4820 make_label_decl (id
, local_p
)
4826 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4828 /* Make sure every label has an rtx. */
4831 DECL_CONTEXT (decl
) = current_function_decl
;
4832 DECL_MODE (decl
) = VOIDmode
;
4833 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
4835 /* Say where one reference is to the label, for the sake of the
4836 error if it is not defined. */
4837 DECL_SOURCE_LINE (decl
) = lineno
;
4838 DECL_SOURCE_FILE (decl
) = input_filename
;
4840 /* Record the fact that this identifier is bound to this label. */
4841 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4846 /* Record this label on the list of used labels so that we can check
4847 at the end of the function to see whether or not the label was
4848 actually defined, and so we can check when the label is defined whether
4849 this use is valid. */
4855 if (named_label_uses
== NULL
4856 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4857 || named_label_uses
->label_decl
!= decl
)
4859 struct named_label_use_list
*new_ent
;
4860 new_ent
= ((struct named_label_use_list
*)
4861 ggc_alloc (sizeof (struct named_label_use_list
)));
4862 new_ent
->label_decl
= decl
;
4863 new_ent
->names_in_scope
= current_binding_level
->names
;
4864 new_ent
->binding_level
= current_binding_level
;
4865 new_ent
->lineno_o_goto
= lineno
;
4866 new_ent
->filename_o_goto
= input_filename
;
4867 new_ent
->next
= named_label_uses
;
4868 named_label_uses
= new_ent
;
4872 /* Look for a label named ID in the current function. If one cannot
4873 be found, create one. (We keep track of used, but undefined,
4874 labels, and complain about them at the end of a function.) */
4881 struct named_label_list
*ent
;
4883 /* You can't use labels at global scope. */
4884 if (current_function_decl
== NULL_TREE
)
4886 error ("label `%s' referenced outside of any function",
4887 IDENTIFIER_POINTER (id
));
4891 /* See if we've already got this label. */
4892 decl
= IDENTIFIER_LABEL_VALUE (id
);
4893 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
4896 /* Record this label on the list of labels used in this function.
4897 We do this before calling make_label_decl so that we get the
4898 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4899 ent
= ((struct named_label_list
*)
4900 ggc_alloc_cleared (sizeof (struct named_label_list
)));
4901 ent
->old_value
= IDENTIFIER_LABEL_VALUE (id
);
4902 ent
->next
= named_labels
;
4905 /* We need a new label. */
4906 decl
= make_label_decl (id
, /*local_p=*/0);
4908 /* Now fill in the information we didn't have before. */
4909 ent
->label_decl
= decl
;
4914 /* Declare a local label named ID. */
4917 declare_local_label (id
)
4922 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4923 this scope we can restore the old value of
4924 IDENTIFIER_TYPE_VALUE. */
4925 current_binding_level
->shadowed_labels
4926 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4927 current_binding_level
->shadowed_labels
);
4928 /* Look for the label. */
4929 decl
= make_label_decl (id
, /*local_p=*/1);
4930 /* Now fill in the information we didn't have before. */
4931 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
4936 /* Returns nonzero if it is ill-formed to jump past the declaration of
4937 DECL. Returns 2 if it's also a real problem. */
4940 decl_jump_unsafe (decl
)
4943 if (TREE_CODE (decl
) != VAR_DECL
|| TREE_STATIC (decl
))
4946 if (DECL_INITIAL (decl
) == NULL_TREE
4947 && pod_type_p (TREE_TYPE (decl
)))
4950 /* This is really only important if we're crossing an initialization.
4951 The POD stuff is just pedantry; why should it matter if the class
4952 contains a field of pointer to member type? */
4953 if (DECL_INITIAL (decl
)
4954 || (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))))
4959 /* Check that a single previously seen jump to a newly defined label
4960 is OK. DECL is the LABEL_DECL or 0; LEVEL is the binding_level for
4961 the jump context; NAMES are the names in scope in LEVEL at the jump
4962 context; FILE and LINE are the source position of the jump or 0. */
4965 check_previous_goto_1 (decl
, level
, names
, file
, line
)
4967 struct binding_level
*level
;
4974 struct binding_level
*b
= current_binding_level
;
4975 for (; b
; b
= b
->level_chain
)
4977 tree new_decls
= b
->names
;
4978 tree old_decls
= (b
== level
? names
: NULL_TREE
);
4979 for (; new_decls
!= old_decls
;
4980 new_decls
= TREE_CHAIN (new_decls
))
4982 int problem
= decl_jump_unsafe (new_decls
);
4989 cp_pedwarn ("jump to label `%D'", decl
);
4991 pedwarn ("jump to case label");
4994 pedwarn_with_file_and_line (file
, line
, " from here");
4998 if (problem
> 1 && DECL_ARTIFICIAL (new_decls
))
4999 /* Can't skip init of __exception_info. */
5000 cp_error_at (" enters catch block", new_decls
);
5001 else if (problem
> 1)
5002 cp_error_at (" crosses initialization of `%#D'",
5005 cp_pedwarn_at (" enters scope of non-POD `%#D'",
5011 if (b
->eh_region
&& ! saw_eh
)
5016 cp_pedwarn ("jump to label `%D'", decl
);
5018 pedwarn ("jump to case label");
5021 pedwarn_with_file_and_line (file
, line
, " from here");
5024 error (" enters try block");
5031 check_previous_goto (use
)
5032 struct named_label_use_list
*use
;
5034 check_previous_goto_1 (use
->label_decl
, use
->binding_level
,
5035 use
->names_in_scope
, use
->filename_o_goto
,
5036 use
->lineno_o_goto
);
5040 check_switch_goto (level
)
5041 struct binding_level
*level
;
5043 check_previous_goto_1 (NULL_TREE
, level
, level
->names
, NULL
, 0);
5046 /* Check that any previously seen jumps to a newly defined label DECL
5047 are OK. Called by define_label. */
5050 check_previous_gotos (decl
)
5053 struct named_label_use_list
**usep
;
5055 if (! TREE_USED (decl
))
5058 for (usep
= &named_label_uses
; *usep
; )
5060 struct named_label_use_list
*use
= *usep
;
5061 if (use
->label_decl
== decl
)
5063 check_previous_goto (use
);
5067 usep
= &(use
->next
);
5071 /* Check that a new jump to a label DECL is OK. Called by
5072 finish_goto_stmt. */
5080 struct named_label_list
*lab
;
5082 /* We can't know where a computed goto is jumping. So we assume
5084 if (! DECL_P (decl
))
5087 /* If the label hasn't been defined yet, defer checking. */
5088 if (! DECL_INITIAL (decl
))
5094 for (lab
= named_labels
; lab
; lab
= lab
->next
)
5095 if (decl
== lab
->label_decl
)
5098 /* If the label is not on named_labels it's a gcc local label, so
5099 it must be in an outer scope, so jumping to it is always OK. */
5103 if ((lab
->eh_region
|| lab
->bad_decls
) && !identified
)
5105 cp_pedwarn_at ("jump to label `%D'", decl
);
5106 pedwarn (" from here");
5110 for (bad
= lab
->bad_decls
; bad
; bad
= TREE_CHAIN (bad
))
5112 tree b
= TREE_VALUE (bad
);
5113 int u
= decl_jump_unsafe (b
);
5115 if (u
> 1 && DECL_ARTIFICIAL (b
))
5116 /* Can't skip init of __exception_info. */
5117 cp_error_at (" enters catch block", b
);
5119 cp_error_at (" skips initialization of `%#D'", b
);
5121 cp_pedwarn_at (" enters scope of non-POD `%#D'", b
);
5125 error (" enters try block");
5128 /* Define a label, specifying the location in the source file.
5129 Return the LABEL_DECL node for the label, if the definition is valid.
5130 Otherwise return 0. */
5133 define_label (filename
, line
, name
)
5134 const char *filename
;
5138 tree decl
= lookup_label (name
);
5139 struct named_label_list
*ent
;
5141 for (ent
= named_labels
; ent
; ent
= ent
->next
)
5142 if (ent
->label_decl
== decl
)
5145 /* After labels, make any new cleanups go into their
5146 own new (temporary) binding contour. */
5147 current_binding_level
->more_cleanups_ok
= 0;
5149 if (name
== get_identifier ("wchar_t"))
5150 cp_pedwarn ("label named wchar_t");
5152 if (DECL_INITIAL (decl
) != NULL_TREE
)
5154 cp_error ("duplicate label `%D'", decl
);
5159 /* Mark label as having been defined. */
5160 DECL_INITIAL (decl
) = error_mark_node
;
5161 /* Say where in the source. */
5162 DECL_SOURCE_FILE (decl
) = filename
;
5163 DECL_SOURCE_LINE (decl
) = line
;
5166 ent
->names_in_scope
= current_binding_level
->names
;
5167 ent
->binding_level
= current_binding_level
;
5169 check_previous_gotos (decl
);
5170 current_function_return_value
= NULL_TREE
;
5177 struct binding_level
*level
;
5178 struct cp_switch
*next
;
5181 static struct cp_switch
*switch_stack
;
5187 = (struct cp_switch
*) xmalloc (sizeof (struct cp_switch
));
5188 p
->level
= current_binding_level
;
5189 p
->next
= switch_stack
;
5196 struct cp_switch
*cs
;
5199 switch_stack
= switch_stack
->next
;
5203 /* Note that we've seen a definition of a case label, and complain if this
5204 is a bad place for one. */
5207 define_case_label ()
5209 tree cleanup
= last_cleanup_this_contour ();
5212 /* Don't crash; we'll complain in do_case. */
5217 static int explained
= 0;
5218 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup
));
5219 warning ("where case label appears here");
5222 warning ("(enclose actions of previous case statements requiring destructors in their own scope.)");
5227 check_switch_goto (switch_stack
->level
);
5229 /* After labels, make any new cleanups go into their
5230 own new (temporary) binding contour. */
5232 current_binding_level
->more_cleanups_ok
= 0;
5233 current_function_return_value
= NULL_TREE
;
5236 /* Return the list of declarations of the current level.
5237 Note that this list is in reverse order unless/until
5238 you nreverse it; and when you do nreverse it, you must
5239 store the result back using `storedecls' or you will lose. */
5244 return current_binding_level
->names
;
5247 /* Return the list of type-tags (for structs, etc) of the current level. */
5252 return current_binding_level
->tags
;
5255 /* Store the list of declarations of the current level.
5256 This is done for the parameter declarations of a function being defined,
5257 after they are modified in the light of any missing parameters. */
5263 current_binding_level
->names
= decls
;
5266 /* Similarly, store the list of tags of the current level. */
5272 current_binding_level
->tags
= tags
;
5275 /* Given NAME, an IDENTIFIER_NODE,
5276 return the structure (or union or enum) definition for that name.
5277 Searches binding levels from BINDING_LEVEL up to the global level.
5278 If THISLEVEL_ONLY is nonzero, searches only the specified context
5279 (but skips any tag-transparent contexts to find one that is
5280 meaningful for tags).
5281 FORM says which kind of type the caller wants;
5282 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
5283 If the wrong kind of type is found, and it's not a template, an error is
5287 lookup_tag (form
, name
, binding_level
, thislevel_only
)
5288 enum tree_code form
;
5290 struct binding_level
*binding_level
;
5293 register struct binding_level
*level
;
5294 /* Non-zero if, we should look past a template parameter level, even
5295 if THISLEVEL_ONLY. */
5296 int allow_template_parms_p
= 1;
5298 for (level
= binding_level
; level
; level
= level
->level_chain
)
5301 if (ANON_AGGRNAME_P (name
))
5302 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5304 /* There's no need for error checking here, because
5305 anon names are unique throughout the compilation. */
5306 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
5307 return TREE_VALUE (tail
);
5309 else if (level
->namespace_p
)
5310 /* Do namespace lookup. */
5311 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
5313 tree old
= binding_for_name (name
, tail
);
5315 /* If we just skipped past a template parameter level,
5316 even though THISLEVEL_ONLY, and we find a template
5317 class declaration, then we use the _TYPE node for the
5318 template. See the example below. */
5319 if (thislevel_only
&& !allow_template_parms_p
5320 && old
&& BINDING_VALUE (old
)
5321 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
5322 old
= TREE_TYPE (BINDING_VALUE (old
));
5324 old
= BINDING_TYPE (old
);
5326 /* If it has an original type, it is a typedef, and we
5327 should not return it. */
5328 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
5330 if (old
&& TREE_CODE (old
) != form
5331 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
5333 cp_error ("`%#D' redeclared as %C", old
, form
);
5338 if (thislevel_only
|| tail
== global_namespace
)
5342 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5344 if (TREE_PURPOSE (tail
) == name
)
5346 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
5347 /* Should tighten this up; it'll probably permit
5348 UNION_TYPE and a struct template, for example. */
5350 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
5352 /* Definition isn't the kind we were looking for. */
5353 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
5357 return TREE_VALUE (tail
);
5360 if (thislevel_only
&& ! level
->tag_transparent
)
5362 if (level
->template_parms_p
&& allow_template_parms_p
)
5364 /* We must deal with cases like this:
5366 template <class T> struct S;
5367 template <class T> struct S {};
5369 When looking up `S', for the second declaration, we
5370 would like to find the first declaration. But, we
5371 are in the pseudo-global level created for the
5372 template parameters, rather than the (surrounding)
5373 namespace level. Thus, we keep going one more level,
5374 even though THISLEVEL_ONLY is non-zero. */
5375 allow_template_parms_p
= 0;
5387 set_current_level_tags_transparency (tags_transparent
)
5388 int tags_transparent
;
5390 current_binding_level
->tag_transparent
= tags_transparent
;
5394 /* Given a type, find the tag that was defined for it and return the tag name.
5395 Otherwise return 0. However, the value can never be 0
5396 in the cases in which this is used.
5398 C++: If NAME is non-zero, this is the new name to install. This is
5399 done when replacing anonymous tags with real tag names. */
5402 lookup_tag_reverse (type
, name
)
5406 register struct binding_level
*level
;
5408 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5411 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5413 if (TREE_VALUE (tail
) == type
)
5416 TREE_PURPOSE (tail
) = name
;
5417 return TREE_PURPOSE (tail
);
5424 /* Look up NAME in the NAMESPACE. */
5427 lookup_namespace_name (namespace, name
)
5428 tree
namespace, name
;
5431 tree template_id
= NULL_TREE
;
5433 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5435 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5436 /* This happens for A::B<int> when B is a namespace. */
5438 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5440 /* This happens for A::B where B is a template, and there are no
5441 template arguments. */
5442 cp_error ("invalid use of `%D'", name
);
5443 return error_mark_node
;
5446 namespace = ORIGINAL_NAMESPACE (namespace);
5448 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5451 name
= TREE_OPERAND (name
, 0);
5452 if (TREE_CODE (name
) == OVERLOAD
)
5453 name
= DECL_NAME (OVL_CURRENT (name
));
5454 else if (DECL_P (name
))
5455 name
= DECL_NAME (name
);
5458 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5460 val
= make_node (CPLUS_BINDING
);
5461 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5462 return error_mark_node
;
5464 if (BINDING_VALUE (val
))
5466 val
= BINDING_VALUE (val
);
5470 if (DECL_CLASS_TEMPLATE_P (val
))
5471 val
= lookup_template_class (val
,
5472 TREE_OPERAND (template_id
, 1),
5473 /*in_decl=*/NULL_TREE
,
5474 /*context=*/NULL_TREE
,
5475 /*entering_scope=*/0);
5476 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5477 || TREE_CODE (val
) == OVERLOAD
)
5478 val
= lookup_template_function (val
,
5479 TREE_OPERAND (template_id
, 1));
5482 cp_error ("`%D::%D' is not a template",
5484 return error_mark_node
;
5488 /* If we have a single function from a using decl, pull it out. */
5489 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5490 val
= OVL_FUNCTION (val
);
5494 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5495 return error_mark_node
;
5498 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5500 static unsigned long
5508 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5509 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5514 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5517 typename_compare (k1
, k2
)
5528 d1
= TYPE_NAME (t1
);
5529 d2
= TYPE_NAME (t2
);
5531 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5532 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5533 && ((TREE_TYPE (t1
) != NULL_TREE
)
5534 == (TREE_TYPE (t2
) != NULL_TREE
))
5535 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5536 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5539 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5540 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5541 is non-NULL, this type is being created by the implicit typename
5542 extension, and BASE_TYPE is a type named `t' in some base class of
5543 `T' which depends on template parameters.
5545 Returns the new TYPENAME_TYPE. */
5548 build_typename_type (context
, name
, fullname
, base_type
)
5556 struct hash_entry
* e
;
5558 static struct hash_table ht
;
5562 static struct hash_table
*h
= &ht
;
5563 if (!hash_table_init (&ht
, &hash_newfunc
, &typename_hash
,
5565 fatal ("virtual memory exhausted");
5566 ggc_add_tree_hash_table_root (&h
, 1);
5569 /* Build the TYPENAME_TYPE. */
5570 t
= make_aggr_type (TYPENAME_TYPE
);
5571 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5572 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5573 TREE_TYPE (t
) = base_type
;
5575 /* Build the corresponding TYPE_DECL. */
5576 d
= build_decl (TYPE_DECL
, name
, t
);
5577 TYPE_NAME (TREE_TYPE (d
)) = d
;
5578 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5579 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5580 DECL_ARTIFICIAL (d
) = 1;
5582 /* See if we already have this type. */
5583 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5587 /* Insert the type into the table. */
5588 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5593 /* Resolve `typename CONTEXT::NAME'. Returns an appropriate type,
5594 unless an error occurs, in which case error_mark_node is returned.
5595 If COMPLAIN zero, don't complain about any errors that occur. */
5598 make_typename_type (context
, name
, complain
)
5606 if (!(TYPE_LANG_SPECIFIC (name
)
5607 && (CLASSTYPE_IS_TEMPLATE (name
)
5608 || CLASSTYPE_USE_TEMPLATE (name
))))
5609 name
= TYPE_IDENTIFIER (name
);
5611 /* Create a TEMPLATE_ID_EXPR for the type. */
5612 name
= build_nt (TEMPLATE_ID_EXPR
,
5613 CLASSTYPE_TI_TEMPLATE (name
),
5614 CLASSTYPE_TI_ARGS (name
));
5616 else if (TREE_CODE (name
) == TYPE_DECL
)
5617 name
= DECL_NAME (name
);
5621 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5623 name
= TREE_OPERAND (name
, 0);
5624 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5625 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5627 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5628 my_friendly_abort (2000);
5630 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5632 /* We can get here from typename_sub0 in the explicit_template_type
5633 expansion. Just fail. */
5635 cp_error ("no class template named `%#T' in `%#T'",
5637 return error_mark_node
;
5640 if (! uses_template_parms (context
)
5641 || currently_open_class (context
))
5643 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5645 tree tmpl
= NULL_TREE
;
5646 if (IS_AGGR_TYPE (context
))
5647 tmpl
= lookup_field (context
, name
, 0, 0);
5648 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5651 cp_error ("no class template named `%#T' in `%#T'",
5653 return error_mark_node
;
5656 return lookup_template_class (tmpl
,
5657 TREE_OPERAND (fullname
, 1),
5659 /*entering_scope=*/0);
5665 if (!IS_AGGR_TYPE (context
))
5668 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5669 return error_mark_node
;
5672 t
= lookup_field (context
, name
, 0, 1);
5674 return TREE_TYPE (t
);
5678 /* If the CONTEXT is not a template type, then either the field is
5679 there now or its never going to be. */
5680 if (!uses_template_parms (context
))
5683 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5684 return error_mark_node
;
5688 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5691 /* Select the right _DECL from multiple choices. */
5694 select_decl (binding
, flags
)
5699 val
= BINDING_VALUE (binding
);
5700 if (LOOKUP_NAMESPACES_ONLY (flags
))
5702 /* We are not interested in types. */
5703 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5708 /* If we could have a type and
5709 we have nothing or we need a type and have none. */
5710 if (BINDING_TYPE (binding
)
5711 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5712 && TREE_CODE (val
) != TYPE_DECL
)))
5713 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5714 /* Don't return non-types if we really prefer types. */
5715 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5716 && (TREE_CODE (val
) != TEMPLATE_DECL
5717 || !DECL_CLASS_TEMPLATE_P (val
)))
5723 /* Unscoped lookup of a global: iterate over current namespaces,
5724 considering using-directives. If SPACESP is non-NULL, store a list
5725 of the namespaces we've considered in it. */
5728 unqualified_namespace_lookup (name
, flags
, spacesp
)
5733 tree b
= make_node (CPLUS_BINDING
);
5734 tree initial
= current_decl_namespace();
5735 tree scope
= initial
;
5737 struct binding_level
*level
;
5738 tree val
= NULL_TREE
;
5741 *spacesp
= NULL_TREE
;
5743 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5746 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5747 val
= binding_for_name (name
, scope
);
5749 /* Initialize binding for this context. */
5750 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5751 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5753 /* Add all _DECLs seen through local using-directives. */
5754 for (level
= current_binding_level
;
5755 !level
->namespace_p
;
5756 level
= level
->level_chain
)
5757 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5758 scope
, flags
, spacesp
))
5759 /* Give up because of error. */
5760 return error_mark_node
;
5762 /* Add all _DECLs seen through global using-directives. */
5763 /* XXX local and global using lists should work equally. */
5767 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5768 scope
, flags
, spacesp
))
5769 /* Give up because of error. */
5770 return error_mark_node
;
5771 if (siter
== scope
) break;
5772 siter
= CP_DECL_CONTEXT (siter
);
5775 val
= select_decl (b
, flags
);
5776 if (scope
== global_namespace
)
5782 /* Combine prefer_type and namespaces_only into flags. */
5785 lookup_flags (prefer_type
, namespaces_only
)
5786 int prefer_type
, namespaces_only
;
5788 if (namespaces_only
)
5789 return LOOKUP_PREFER_NAMESPACES
;
5790 if (prefer_type
> 1)
5791 return LOOKUP_PREFER_TYPES
;
5792 if (prefer_type
> 0)
5793 return LOOKUP_PREFER_BOTH
;
5797 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5798 ignore it or not. Subroutine of lookup_name_real. */
5801 qualify_lookup (val
, flags
)
5805 if (val
== NULL_TREE
)
5807 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5809 if ((flags
& LOOKUP_PREFER_TYPES
)
5810 && (TREE_CODE (val
) == TYPE_DECL
5811 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5812 && DECL_CLASS_TEMPLATE_P (val
))))
5814 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5819 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5823 warn_about_implicit_typename_lookup (typename
, binding
)
5827 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5828 tree name
= DECL_NAME (typename
);
5830 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5831 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5832 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5833 && ! (TREE_CODE (binding
) == TYPE_DECL
5834 && same_type_p (TREE_TYPE (binding
), subtype
)))
5836 cp_warning ("lookup of `%D' finds `%#D'",
5838 cp_warning (" instead of `%D' from dependent base class",
5840 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5841 constructor_name (current_class_type
), name
);
5845 /* Look up NAME in the current binding level and its superiors in the
5846 namespace of variables, functions and typedefs. Return a ..._DECL
5847 node of some kind representing its definition if there is only one
5848 such declaration, or return a TREE_LIST with all the overloaded
5849 definitions if there are many, or return 0 if it is undefined.
5851 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5852 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5853 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5854 Otherwise we prefer non-TYPE_DECLs.
5856 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5857 using IDENTIFIER_CLASS_VALUE. */
5860 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5862 int prefer_type
, nonclass
, namespaces_only
;
5865 tree val
= NULL_TREE
;
5867 tree from_obj
= NULL_TREE
;
5869 int val_is_implicit_typename
= 0;
5871 /* Hack: copy flag set by parser, if set. */
5872 if (only_namespace_names
)
5873 namespaces_only
= 1;
5875 if (prefer_type
== -2)
5877 extern int looking_for_typename
;
5878 tree type
= NULL_TREE
;
5881 prefer_type
= looking_for_typename
;
5883 flags
= lookup_flags (prefer_type
, namespaces_only
);
5884 /* If the next thing is '<', class templates are types. */
5885 if (looking_for_template
)
5886 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5888 /* std:: becomes :: for now. */
5889 if (got_scope
== std_node
)
5890 got_scope
= void_type_node
;
5894 else if (got_object
!= error_mark_node
)
5899 if (type
== error_mark_node
)
5900 return error_mark_node
;
5901 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5902 type
= TREE_TYPE (type
);
5905 type
= complete_type (type
);
5907 if (TREE_CODE (type
) == VOID_TYPE
)
5908 type
= global_namespace
;
5909 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5911 val
= make_node (CPLUS_BINDING
);
5912 flags
|= LOOKUP_COMPLAIN
;
5913 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5915 val
= select_decl (val
, flags
);
5917 else if (! IS_AGGR_TYPE (type
)
5918 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5919 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
5920 || TREE_CODE (type
) == TYPENAME_TYPE
)
5921 /* Someone else will give an error about this if needed. */
5923 else if (type
== current_class_type
)
5924 val
= IDENTIFIER_CLASS_VALUE (name
);
5927 val
= lookup_member (type
, name
, 0, prefer_type
);
5928 type_access_control (type
, val
);
5930 /* Restore the containing TYPENAME_TYPE if we looked
5931 through it before. */
5932 if (got_scope
&& got_scope
!= type
5933 && val
&& TREE_CODE (val
) == TYPE_DECL
5934 && TREE_CODE (TREE_TYPE (val
)) == TYPENAME_TYPE
)
5935 TYPE_CONTEXT (TREE_TYPE (val
)) = got_scope
;
5943 else if (got_object
&& val
)
5948 flags
= lookup_flags (prefer_type
, namespaces_only
);
5949 /* If we're not parsing, we need to complain. */
5950 flags
|= LOOKUP_COMPLAIN
;
5953 /* First, look in non-namespace scopes. */
5955 if (current_class_type
== NULL_TREE
)
5958 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5962 if (!LOCAL_BINDING_P (t
) && nonclass
)
5963 /* We're not looking for class-scoped bindings, so keep going. */
5966 /* If this is the kind of thing we're looking for, we're done. */
5967 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5968 binding
= BINDING_VALUE (t
);
5969 else if ((flags
& LOOKUP_PREFER_TYPES
)
5970 && qualify_lookup (BINDING_TYPE (t
), flags
))
5971 binding
= BINDING_TYPE (t
);
5973 binding
= NULL_TREE
;
5975 /* Handle access control on types from enclosing or base classes. */
5976 if (binding
&& ! yylex
5977 && BINDING_LEVEL (t
) && BINDING_LEVEL (t
)->parm_flag
== 2)
5978 type_access_control (BINDING_LEVEL (t
)->this_class
, binding
);
5981 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5983 if (val_is_implicit_typename
&& !yylex
)
5984 warn_about_implicit_typename_lookup (val
, binding
);
5986 val_is_implicit_typename
5987 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5988 if (!val_is_implicit_typename
)
5993 /* Now lookup in namespace scopes. */
5994 if (!val
|| val_is_implicit_typename
)
5996 t
= unqualified_namespace_lookup (name
, flags
, 0);
5999 if (val_is_implicit_typename
&& !yylex
)
6000 warn_about_implicit_typename_lookup (val
, t
);
6008 /* This should only warn about types used in qualified-ids. */
6009 if (from_obj
&& from_obj
!= val
)
6011 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
6012 && TREE_CODE (val
) == TYPE_DECL
6013 && TREE_TYPE (from_obj
) != TREE_TYPE (val
))
6015 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
6016 name
, got_object
, TREE_TYPE (from_obj
));
6017 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
6021 /* We don't change val to from_obj if got_object depends on
6022 template parms because that breaks implicit typename for
6023 destructor calls. */
6024 if (! uses_template_parms (got_object
))
6028 /* If we have a single function from a using decl, pull it out. */
6029 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
6030 val
= OVL_FUNCTION (val
);
6039 lookup_name_nonclass (name
)
6042 return lookup_name_real (name
, 0, 1, 0);
6046 lookup_function_nonclass (name
, args
)
6050 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
6054 lookup_name_namespace_only (name
)
6057 /* type-or-namespace, nonclass, namespace_only */
6058 return lookup_name_real (name
, 1, 1, 1);
6062 lookup_name (name
, prefer_type
)
6066 return lookup_name_real (name
, prefer_type
, 0, 0);
6069 /* Similar to `lookup_name' but look only in the innermost non-class
6073 lookup_name_current_level (name
)
6076 struct binding_level
*b
;
6079 b
= current_binding_level
;
6080 while (b
->parm_flag
== 2)
6085 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
6087 /* extern "C" function() */
6088 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
6091 else if (IDENTIFIER_BINDING (name
)
6092 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
6096 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
6097 return IDENTIFIER_VALUE (name
);
6109 /* Like lookup_name_current_level, but for types. */
6112 lookup_type_current_level (name
)
6115 register tree t
= NULL_TREE
;
6117 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
6119 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
6120 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
6122 struct binding_level
*b
= current_binding_level
;
6125 if (purpose_member (name
, b
->type_shadowed
))
6126 return REAL_IDENTIFIER_TYPE_VALUE (name
);
6138 begin_only_namespace_names ()
6140 only_namespace_names
= 1;
6144 end_only_namespace_names ()
6146 only_namespace_names
= 0;
6149 /* Push the declarations of builtin types into the namespace.
6150 RID_INDEX is the index of the builtin type
6151 in the array RID_POINTERS. NAME is the name used when looking
6152 up the builtin type. TYPE is the _TYPE node for the builtin type. */
6155 record_builtin_type (rid_index
, name
, type
)
6160 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
6161 tree tdecl
= NULL_TREE
;
6163 if ((int) rid_index
< (int) RID_MAX
)
6164 rname
= ridpointers
[(int) rid_index
];
6166 tname
= get_identifier (name
);
6168 TYPE_BUILT_IN (type
) = 1;
6172 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
6173 set_identifier_type_value (tname
, NULL_TREE
);
6174 if ((int) rid_index
< (int) RID_MAX
)
6175 /* Built-in types live in the global namespace. */
6176 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
6178 if (rname
!= NULL_TREE
)
6180 if (tname
!= NULL_TREE
)
6182 set_identifier_type_value (rname
, NULL_TREE
);
6183 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
6187 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
6188 set_identifier_type_value (rname
, NULL_TREE
);
6193 /* Record one of the standard Java types.
6194 * Declare it as having the given NAME.
6195 * If SIZE > 0, it is the size of one of the integral types;
6196 * otherwise it is the negative of the size of one of the other types. */
6199 record_builtin_java_type (name
, size
)
6205 type
= make_signed_type (size
);
6206 else if (size
> -32)
6207 { /* "__java_char" or ""__java_boolean". */
6208 type
= make_unsigned_type (-size
);
6209 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
6212 { /* "__java_float" or ""__java_double". */
6213 type
= make_node (REAL_TYPE
);
6214 TYPE_PRECISION (type
) = - size
;
6217 record_builtin_type (RID_MAX
, name
, type
);
6218 decl
= TYPE_NAME (type
);
6220 /* Suppress generate debug symbol entries for these types,
6221 since for normal C++ they are just clutter.
6222 However, push_lang_context undoes this if extern "Java" is seen. */
6223 DECL_IGNORED_P (decl
) = 1;
6225 TYPE_FOR_JAVA (type
) = 1;
6229 /* Push a type into the namespace so that the back-ends ignore it. */
6232 record_unknown_type (type
, name
)
6236 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
6237 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
6238 DECL_IGNORED_P (decl
) = 1;
6239 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
6240 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
6241 TYPE_ALIGN (type
) = 1;
6242 TYPE_USER_ALIGN (type
) = 0;
6243 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
6246 /* An string for which we should create an IDENTIFIER_NODE at
6249 typedef struct predefined_identifier
6251 /* The name of the identifier. */
6253 /* The place where the IDENTIFIER_NODE should be stored. */
6255 /* Non-zero if this is the name of a constructor or destructor. */
6257 } predefined_identifier
;
6259 /* Create all the predefined identifiers. */
6262 initialize_predefined_identifiers ()
6264 struct predefined_identifier
*pid
;
6266 /* A table of identifiers to create at startup. */
6267 static predefined_identifier predefined_identifiers
[] = {
6268 { "C++", &lang_name_cplusplus
, 0 },
6269 { "C", &lang_name_c
, 0 },
6270 { "Java", &lang_name_java
, 0 },
6271 { CTOR_NAME
, &ctor_identifier
, 1 },
6272 { "__base_ctor", &base_ctor_identifier
, 1 },
6273 { "__comp_ctor", &complete_ctor_identifier
, 1 },
6274 { DTOR_NAME
, &dtor_identifier
, 1 },
6275 { "__comp_dtor", &complete_dtor_identifier
, 1 },
6276 { "__base_dtor", &base_dtor_identifier
, 1 },
6277 { "__deleting_dtor", &deleting_dtor_identifier
, 1 },
6278 { VTABLE_DELTA2_NAME
, &delta2_identifier
, 0 },
6279 { VTABLE_DELTA_NAME
, &delta_identifier
, 0 },
6280 { IN_CHARGE_NAME
, &in_charge_identifier
, 0 },
6281 { VTABLE_INDEX_NAME
, &index_identifier
, 0 },
6282 { "nelts", &nelts_identifier
, 0 },
6283 { THIS_NAME
, &this_identifier
, 0 },
6284 { VTABLE_PFN_NAME
, &pfn_identifier
, 0 },
6285 { "__pfn_or_delta2", &pfn_or_delta2_identifier
, 0 },
6286 { "_vptr", &vptr_identifier
, 0 },
6287 { "__cp_push_exception", &cp_push_exception_identifier
, 0 },
6288 { "__vtt_parm", &vtt_parm_identifier
, 0 },
6289 { "std", &std_identifier
, 0 },
6293 for (pid
= predefined_identifiers
; pid
->name
; ++pid
)
6295 *pid
->node
= get_identifier (pid
->name
);
6296 if (pid
->ctor_or_dtor_p
)
6297 IDENTIFIER_CTOR_OR_DTOR_P (*pid
->node
) = 1;
6301 /* Create the predefined scalar types of C,
6302 and some nodes representing standard constants (0, 1, (void *)0).
6303 Initialize the global binding level.
6304 Make definitions for built-in primitive functions. */
6307 init_decl_processing ()
6310 int wchar_type_size
;
6311 tree array_domain_type
;
6313 /* Check to see that the user did not specify an invalid combination
6314 of command-line options. */
6315 if (flag_new_abi
&& !flag_vtable_thunks
)
6316 fatal ("the new ABI requires vtable thunks");
6318 /* Create all the identifiers we need. */
6319 initialize_predefined_identifiers ();
6321 /* Let the back-end now how to save and restore language-specific
6322 per-function globals. */
6323 init_lang_status
= &push_cp_function_context
;
6324 free_lang_status
= &pop_cp_function_context
;
6325 mark_lang_status
= &mark_cp_function_context
;
6331 /* Create the global variables. */
6332 push_to_top_level ();
6334 /* Enter the global namespace. */
6335 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
6336 push_namespace (get_identifier ("::"));
6337 global_namespace
= current_namespace
;
6338 current_lang_name
= NULL_TREE
;
6340 /* Adjust various flags based on command-line settings. */
6341 if (! flag_permissive
&& ! pedantic
)
6342 flag_pedantic_errors
= 1;
6343 if (!flag_no_inline
)
6344 flag_inline_trees
= 1;
6347 current_lang_name
= lang_name_c
;
6349 current_function_decl
= NULL_TREE
;
6350 current_binding_level
= NULL_BINDING_LEVEL
;
6351 free_binding_level
= NULL_BINDING_LEVEL
;
6353 build_common_tree_nodes (flag_signed_char
);
6355 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6356 TREE_TYPE (error_mark_list
) = error_mark_node
;
6358 /* Make the binding_level structure for global names. */
6360 global_binding_level
= current_binding_level
;
6361 /* The global level is the namespace level of ::. */
6362 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6363 declare_namespace_level ();
6365 /* Define `int' and `char' first so that dbx will output them first. */
6366 record_builtin_type (RID_INT
, NULL_PTR
, integer_type_node
);
6367 record_builtin_type (RID_CHAR
, "char", char_type_node
);
6369 /* `signed' is the same as `int' */
6370 record_builtin_type (RID_SIGNED
, NULL_PTR
, integer_type_node
);
6371 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
6372 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
6373 record_builtin_type (RID_MAX
, "long unsigned int",
6374 long_unsigned_type_node
);
6375 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
6376 record_builtin_type (RID_MAX
, "long long int",
6377 long_long_integer_type_node
);
6378 record_builtin_type (RID_MAX
, "long long unsigned int",
6379 long_long_unsigned_type_node
);
6380 record_builtin_type (RID_MAX
, "long long unsigned",
6381 long_long_unsigned_type_node
);
6382 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
6383 record_builtin_type (RID_MAX
, "short unsigned int",
6384 short_unsigned_type_node
);
6385 record_builtin_type (RID_MAX
, "unsigned short",
6386 short_unsigned_type_node
);
6389 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE
)));
6391 /* Define both `signed char' and `unsigned char'. */
6392 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
6393 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
6395 /* `unsigned long' is the standard type for sizeof.
6396 Note that stddef.h uses `unsigned long',
6397 and this must agree, even if long and int are the same size. */
6399 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE
))));
6401 /* Create the widest literal types. */
6402 widest_integer_literal_type_node
= make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
6403 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6404 widest_integer_literal_type_node
));
6406 widest_unsigned_literal_type_node
= make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
6407 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6408 widest_unsigned_literal_type_node
));
6410 /* These are types that type_for_size and type_for_mode use. */
6411 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intQI_type_node
));
6412 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intHI_type_node
));
6413 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intSI_type_node
));
6414 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intDI_type_node
));
6415 #if HOST_BITS_PER_WIDE_INT >= 64
6416 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__int128_t"), intTI_type_node
));
6418 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intQI_type_node
));
6419 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intHI_type_node
));
6420 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intSI_type_node
));
6421 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intDI_type_node
));
6422 #if HOST_BITS_PER_WIDE_INT >= 64
6423 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__uint128_t"), unsigned_intTI_type_node
));
6426 build_common_tree_nodes_2 (flag_short_double
);
6428 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6429 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6430 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6431 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6432 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6433 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6434 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6435 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6437 integer_two_node
= build_int_2 (2, 0);
6438 TREE_TYPE (integer_two_node
) = integer_type_node
;
6439 integer_three_node
= build_int_2 (3, 0);
6440 TREE_TYPE (integer_three_node
) = integer_type_node
;
6442 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6443 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6444 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6445 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6446 TYPE_PRECISION (boolean_type_node
) = 1;
6447 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6448 boolean_false_node
= build_int_2 (0, 0);
6449 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6450 boolean_true_node
= build_int_2 (1, 0);
6451 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6453 signed_size_zero_node
= build_int_2 (0, 0);
6454 record_builtin_type (RID_FLOAT
, NULL_PTR
, float_type_node
);
6455 record_builtin_type (RID_DOUBLE
, NULL_PTR
, double_type_node
);
6456 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
6458 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex int"),
6459 complex_integer_type_node
));
6460 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex float"),
6461 complex_float_type_node
));
6462 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex double"),
6463 complex_double_type_node
));
6464 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
6465 complex_long_double_type_node
));
6467 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6469 record_builtin_type (RID_VOID
, NULL_PTR
, void_type_node
);
6470 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
6471 TREE_PARMLIST (void_list_node
) = 1;
6473 string_type_node
= build_pointer_type (char_type_node
);
6474 const_string_type_node
6475 = build_pointer_type (build_qualified_type (char_type_node
,
6477 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6479 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
6482 /* Make a type to be the domain of a few array types
6483 whose domains don't really matter.
6484 200 is small enough that it always fits in size_t. */
6485 array_domain_type
= build_index_type (build_int_2 (200, 0));
6487 /* Make a type for arrays of characters.
6488 With luck nothing will ever really depend on the length of this
6490 char_array_type_node
6491 = build_array_type (char_type_node
, array_domain_type
);
6493 /* Likewise for arrays of ints. */
6495 = build_array_type (integer_type_node
, array_domain_type
);
6498 delta_type_node
= ptrdiff_type_node
;
6499 else if (flag_huge_objects
)
6500 delta_type_node
= long_integer_type_node
;
6502 delta_type_node
= short_integer_type_node
;
6505 vtable_index_type
= ptrdiff_type_node
;
6507 vtable_index_type
= delta_type_node
;
6509 default_function_type
6510 = build_function_type (integer_type_node
, NULL_TREE
);
6512 ptr_type_node
= build_pointer_type (void_type_node
);
6514 = build_pointer_type (build_qualified_type (void_type_node
,
6516 vtt_parm_type
= build_pointer_type (const_ptr_type_node
);
6517 c_common_nodes_and_builtins (1, flag_no_builtin
, flag_no_nonansi_builtin
);
6518 lang_type_promotes_to
= convert_type_from_ellipsis
;
6521 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6523 /* C++ extensions */
6525 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6526 record_unknown_type (unknown_type_node
, "unknown type");
6528 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6529 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6531 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6533 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6535 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6536 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6538 /* This is special for C++ so functions can be overloaded. */
6539 wchar_type_node
= get_identifier (flag_short_wchar
6540 ? "short unsigned int"
6542 wchar_type_node
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (wchar_type_node
));
6543 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
6544 if (TREE_UNSIGNED (wchar_type_node
))
6545 wchar_type_node
= make_signed_type (wchar_type_size
);
6547 wchar_type_node
= make_unsigned_type (wchar_type_size
);
6548 record_builtin_type (RID_WCHAR
, "__wchar_t", wchar_type_node
);
6550 /* Artificial declaration of wchar_t -- can be bashed */
6551 wchar_decl_node
= build_decl (TYPE_DECL
, get_identifier ("wchar_t"),
6553 pushdecl (wchar_decl_node
);
6555 /* This is for wide string constants. */
6556 wchar_array_type_node
6557 = build_array_type (wchar_type_node
, array_domain_type
);
6559 if (flag_vtable_thunks
)
6561 /* Make sure we get a unique function type, so we can give
6562 its pointer type a name. (This wins for gdb.) */
6563 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6564 TREE_TYPE (vfunc_type
) = integer_type_node
;
6565 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6566 layout_type (vfunc_type
);
6568 vtable_entry_type
= build_pointer_type (vfunc_type
);
6572 vtable_entry_type
= make_aggr_type (RECORD_TYPE
);
6573 fields
[0] = build_decl (FIELD_DECL
, delta_identifier
,
6575 fields
[1] = build_decl (FIELD_DECL
, index_identifier
,
6577 fields
[2] = build_decl (FIELD_DECL
, pfn_identifier
,
6579 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6582 /* Make this part of an invisible union. */
6583 fields
[3] = copy_node (fields
[2]);
6584 TREE_TYPE (fields
[3]) = delta_type_node
;
6585 DECL_NAME (fields
[3]) = delta2_identifier
;
6586 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6587 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6588 DECL_SIZE_UNIT (fields
[3]) = TYPE_SIZE_UNIT (delta_type_node
);
6589 TREE_UNSIGNED (fields
[3]) = 0;
6590 TREE_CHAIN (fields
[2]) = fields
[3];
6591 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6594 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6597 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6598 layout_type (vtbl_type_node
);
6599 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6600 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6601 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6602 layout_type (vtbl_ptr_type_node
);
6603 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6605 std_node
= build_decl (NAMESPACE_DECL
,
6607 ? get_identifier ("fake std") : std_identifier
,
6609 pushdecl (std_node
);
6613 push_namespace (get_identifier ("__cxxabiv1"));
6614 abi_node
= current_namespace
;
6618 global_type_node
= make_node (LANG_TYPE
);
6619 record_unknown_type (global_type_node
, "global type");
6622 current_lang_name
= lang_name_cplusplus
;
6625 tree bad_alloc_type_node
, newtype
, deltype
;
6627 push_namespace (get_identifier ("std"));
6628 bad_alloc_type_node
= xref_tag
6629 (class_type_node
, get_identifier ("bad_alloc"), 1);
6632 newtype
= build_exception_variant
6633 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6634 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6635 push_cp_library_fn (NEW_EXPR
, newtype
);
6636 push_cp_library_fn (VEC_NEW_EXPR
, newtype
);
6637 global_delete_fndecl
= push_cp_library_fn (DELETE_EXPR
, deltype
);
6638 push_cp_library_fn (VEC_DELETE_EXPR
, deltype
);
6642 = build_library_fn_ptr ("__pure_virtual", void_ftype
);
6644 /* Perform other language dependent initializations. */
6645 init_class_processing ();
6646 init_init_processing ();
6647 init_search_processing ();
6648 init_rtti_processing ();
6650 if (flag_exceptions
)
6651 init_exception_processing ();
6654 flag_inline_functions
= 0;
6657 if (! supports_one_only ())
6660 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6661 function_id_node
= get_identifier ("__FUNCTION__");
6662 pretty_function_id_node
= get_identifier ("__PRETTY_FUNCTION__");
6663 func_id_node
= get_identifier ("__func__");
6665 make_fname_decl
= cp_make_fname_decl
;
6666 declare_function_name ();
6668 /* Prepare to check format strings against argument lists. */
6669 init_function_format_info ();
6671 /* Show we use EH for cleanups. */
6672 using_eh_for_cleanups ();
6674 valid_lang_attribute
= cp_valid_lang_attribute
;
6676 /* Maintain consistency. Perhaps we should just complain if they
6677 say -fwritable-strings? */
6678 if (flag_writable_strings
)
6679 flag_const_strings
= 0;
6681 /* Add GC roots for all of our global variables. */
6682 ggc_add_tree_root (c_global_trees
, sizeof c_global_trees
/ sizeof(tree
));
6683 ggc_add_tree_root (cp_global_trees
, sizeof cp_global_trees
/ sizeof(tree
));
6684 ggc_add_tree_root (&integer_three_node
, 1);
6685 ggc_add_tree_root (&integer_two_node
, 1);
6686 ggc_add_tree_root (&signed_size_zero_node
, 1);
6687 ggc_add_tree_root (&size_one_node
, 1);
6688 ggc_add_tree_root (&size_zero_node
, 1);
6689 ggc_add_root (&global_binding_level
, 1, sizeof global_binding_level
,
6690 mark_binding_level
);
6691 ggc_add_root (&scope_chain
, 1, sizeof scope_chain
, &mark_saved_scope
);
6692 ggc_add_tree_root (&static_ctors
, 1);
6693 ggc_add_tree_root (&static_dtors
, 1);
6694 ggc_add_tree_root (&lastiddecl
, 1);
6696 ggc_add_tree_root (&last_function_parm_tags
, 1);
6697 ggc_add_tree_root (¤t_function_return_value
, 1);
6698 ggc_add_tree_root (¤t_function_parms
, 1);
6699 ggc_add_tree_root (¤t_function_parm_tags
, 1);
6700 ggc_add_tree_root (&last_function_parms
, 1);
6701 ggc_add_tree_root (&error_mark_list
, 1);
6703 ggc_add_tree_root (&global_namespace
, 1);
6704 ggc_add_tree_root (&global_type_node
, 1);
6705 ggc_add_tree_root (&anonymous_namespace_name
, 1);
6707 ggc_add_tree_root (&got_object
, 1);
6708 ggc_add_tree_root (&got_scope
, 1);
6710 ggc_add_tree_root (¤t_lang_name
, 1);
6711 ggc_add_tree_root (&static_aggregates
, 1);
6714 /* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the
6715 decl, NAME is the initialization string and TYPE_DEP indicates whether
6716 NAME depended on the type of the function. We make use of that to detect
6717 __PRETTY_FUNCTION__ inside a template fn. Because we build a tree for
6718 the function before emitting any of it, we don't need to treat the
6719 VAR_DECL specially. We can decide whether to emit it later, if it was
6723 cp_make_fname_decl (id
, name
, type_dep
)
6728 tree decl
, type
, init
;
6729 size_t length
= strlen (name
);
6730 tree domain
= NULL_TREE
;
6732 if (!processing_template_decl
)
6735 domain
= build_index_type (build_int_2 (length
, 0));
6737 type
= build_cplus_array_type
6738 (build_qualified_type (char_type_node
, TYPE_QUAL_CONST
),
6741 decl
= build_decl (VAR_DECL
, id
, type
);
6742 TREE_STATIC (decl
) = 1;
6743 TREE_READONLY (decl
) = 1;
6744 DECL_SOURCE_LINE (decl
) = 0;
6745 DECL_ARTIFICIAL (decl
) = 1;
6746 DECL_IN_SYSTEM_HEADER (decl
) = 1;
6748 if (processing_template_decl
)
6749 decl
= push_template_decl (decl
);
6752 init
= build (FUNCTION_NAME
, type
);
6753 DECL_PRETTY_FUNCTION_P (decl
) = 1;
6757 init
= build_string (length
+ 1, name
);
6758 TREE_TYPE (init
) = type
;
6760 DECL_INITIAL (decl
) = init
;
6761 cp_finish_decl (decl
, init
, NULL_TREE
, LOOKUP_ONLYCONVERTING
);
6763 /* We will have to make sure we only emit this, if it is actually used. */
6767 /* Entry point for the benefit of c_common_nodes_and_builtins.
6769 Make a definition for a builtin function named NAME and whose data type
6770 is TYPE. TYPE should be a function type with argument types.
6772 CLASS and CODE tell later passes how to compile calls to this function.
6773 See tree.h for possible values.
6775 If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6776 the name to be called if we can't opencode the function. */
6779 builtin_function (name
, type
, code
, class, libname
)
6783 enum built_in_class
class;
6784 const char *libname
;
6786 tree decl
= build_library_fn_1 (get_identifier (name
), ERROR_MARK
, type
);
6787 DECL_BUILT_IN_CLASS (decl
) = class;
6788 DECL_FUNCTION_CODE (decl
) = code
;
6790 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6792 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6793 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6794 function in the namespace. */
6797 DECL_ASSEMBLER_NAME (decl
) = get_identifier (libname
);
6798 make_function_rtl (decl
);
6800 /* Warn if a function in the namespace for users
6801 is used without an occasion to consider it declared. */
6802 if (name
[0] != '_' || name
[1] != '_')
6803 DECL_ANTICIPATED (decl
) = 1;
6808 /* Generate a FUNCTION_DECL with the typical flags for a runtime library
6809 function. Not called directly. */
6812 build_library_fn_1 (name
, operator_code
, type
)
6814 enum tree_code operator_code
;
6817 tree fn
= build_lang_decl (FUNCTION_DECL
, name
, type
);
6818 DECL_EXTERNAL (fn
) = 1;
6819 TREE_PUBLIC (fn
) = 1;
6820 DECL_ARTIFICIAL (fn
) = 1;
6821 TREE_NOTHROW (fn
) = 1;
6822 SET_OVERLOADED_OPERATOR_CODE (fn
, operator_code
);
6826 /* Returns the _DECL for a library function with C linkage.
6827 We assume that such functions never throw; if this is incorrect,
6828 callers should unset TREE_NOTHROW. */
6831 build_library_fn (name
, type
)
6835 tree fn
= build_library_fn_1 (name
, ERROR_MARK
, type
);
6836 make_function_rtl (fn
);
6840 /* Returns the _DECL for a library function with C++ linkage. */
6843 build_cp_library_fn (name
, operator_code
, type
)
6845 enum tree_code operator_code
;
6848 tree fn
= build_library_fn_1 (name
, operator_code
, type
);
6849 TREE_NOTHROW (fn
) = TYPE_NOTHROW_P (type
);
6850 DECL_CONTEXT (fn
) = FROB_CONTEXT (current_namespace
);
6851 set_mangled_name_for_decl (fn
);
6852 make_function_rtl (fn
);
6856 /* Like build_library_fn, but takes a C string instead of an
6860 build_library_fn_ptr (name
, type
)
6864 return build_library_fn (get_identifier (name
), type
);
6867 /* Like build_cp_library_fn, but takes a C string instead of an
6871 build_cp_library_fn_ptr (name
, type
)
6875 return build_cp_library_fn (get_identifier (name
), ERROR_MARK
, type
);
6878 /* Like build_library_fn, but also pushes the function so that we will
6879 be able to find it via IDENTIFIER_GLOBAL_VALUE. */
6882 push_library_fn (name
, type
)
6885 tree fn
= build_library_fn (name
, type
);
6886 pushdecl_top_level (fn
);
6890 /* Like build_cp_library_fn, but also pushes the function so that it
6891 will be found by normal lookup. */
6894 push_cp_library_fn (operator_code
, type
)
6895 enum tree_code operator_code
;
6898 tree fn
= build_cp_library_fn (ansi_opname (operator_code
),
6905 /* Like push_library_fn, but takes a TREE_LIST of parm types rather than
6909 push_void_library_fn (name
, parmtypes
)
6910 tree name
, parmtypes
;
6912 tree type
= build_function_type (void_type_node
, parmtypes
);
6913 return push_library_fn (name
, type
);
6916 /* Like push_library_fn, but also note that this function throws
6917 and does not return. Used for __throw_foo and the like. */
6920 push_throw_library_fn (name
, type
)
6923 tree fn
= push_library_fn (name
, type
);
6924 TREE_THIS_VOLATILE (fn
) = 1;
6925 TREE_NOTHROW (fn
) = 0;
6929 /* When we call finish_struct for an anonymous union, we create
6930 default copy constructors and such. But, an anonymous union
6931 shouldn't have such things; this function undoes the damage to the
6932 anonymous union type T.
6934 (The reason that we create the synthesized methods is that we don't
6935 distinguish `union { int i; }' from `typedef union { int i; } U'.
6936 The first is an anonymous union; the second is just an ordinary
6940 fixup_anonymous_aggr (t
)
6945 /* Wipe out memory of synthesized methods */
6946 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6947 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6948 TYPE_HAS_INIT_REF (t
) = 0;
6949 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6950 TYPE_HAS_ASSIGN_REF (t
) = 0;
6951 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6953 /* Splice the implicitly generated functions out of the TYPE_METHODS
6955 q
= &TYPE_METHODS (t
);
6958 if (DECL_ARTIFICIAL (*q
))
6959 *q
= TREE_CHAIN (*q
);
6961 q
= &TREE_CHAIN (*q
);
6964 /* ISO C++ 9.5.3. Anonymous unions may not have function members. */
6965 if (TYPE_METHODS (t
))
6966 error ("an anonymous union cannot have function members");
6969 /* Make sure that a declaration with no declarator is well-formed, i.e.
6970 just defines a tagged type or anonymous union.
6972 Returns the type defined, if any. */
6975 check_tag_decl (declspecs
)
6980 tree ob_modifier
= NULL_TREE
;
6982 register tree t
= NULL_TREE
;
6984 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6986 register tree value
= TREE_VALUE (link
);
6989 || (TREE_CODE (value
) == IDENTIFIER_NODE
6990 && IDENTIFIER_GLOBAL_VALUE (value
)
6991 && TYPE_P (IDENTIFIER_GLOBAL_VALUE (value
))))
6995 if ((TREE_CODE (value
) != TYPENAME_TYPE
&& IS_AGGR_TYPE (value
))
6996 || TREE_CODE (value
) == ENUMERAL_TYPE
)
6998 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
7002 else if (value
== ridpointers
[(int) RID_FRIEND
])
7004 if (current_class_type
== NULL_TREE
7005 || current_scope () != current_class_type
)
7006 ob_modifier
= value
;
7010 else if (value
== ridpointers
[(int) RID_STATIC
]
7011 || value
== ridpointers
[(int) RID_EXTERN
]
7012 || value
== ridpointers
[(int) RID_AUTO
]
7013 || value
== ridpointers
[(int) RID_REGISTER
]
7014 || value
== ridpointers
[(int) RID_INLINE
]
7015 || value
== ridpointers
[(int) RID_VIRTUAL
]
7016 || value
== ridpointers
[(int) RID_CONST
]
7017 || value
== ridpointers
[(int) RID_VOLATILE
]
7018 || value
== ridpointers
[(int) RID_EXPLICIT
])
7019 ob_modifier
= value
;
7023 error ("multiple types in one declaration");
7025 if (t
== NULL_TREE
&& ! saw_friend
)
7026 pedwarn ("declaration does not declare anything");
7028 /* Check for an anonymous union. We're careful
7029 accessing TYPE_IDENTIFIER because some built-in types, like
7030 pointer-to-member types, do not have TYPE_NAME. */
7031 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
7033 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
7035 /* Anonymous unions are objects, so they can have specifiers. */;
7036 SET_ANON_AGGR_TYPE_P (t
);
7038 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
7039 pedwarn ("ISO C++ prohibits anonymous structs");
7042 else if (ob_modifier
)
7044 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
7045 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
7046 cp_error ("`%D' can only be specified for functions", ob_modifier
);
7047 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
7048 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
7049 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
7050 cp_error ("`%D' can only be specified for constructors",
7053 cp_error ("`%D' can only be specified for objects and functions",
7060 /* Called when a declaration is seen that contains no names to declare.
7061 If its type is a reference to a structure, union or enum inherited
7062 from a containing scope, shadow that tag name for the current scope
7063 with a forward reference.
7064 If its type defines a new named structure or union
7065 or defines an enum, it is valid but we need not do anything here.
7066 Otherwise, it is an error.
7068 C++: may have to grok the declspecs to learn about static,
7069 complain for anonymous unions. */
7072 shadow_tag (declspecs
)
7075 tree t
= check_tag_decl (declspecs
);
7078 maybe_process_partial_specialization (t
);
7080 /* This is where the variables in an anonymous union are
7081 declared. An anonymous union declaration looks like:
7083 because there is no declarator after the union, the parser
7084 sends that declaration here. */
7085 if (t
&& ANON_AGGR_TYPE_P (t
))
7087 fixup_anonymous_aggr (t
);
7089 if (TYPE_FIELDS (t
))
7091 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
7093 finish_anon_union (decl
);
7098 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
7101 groktypename (typename
)
7104 if (TREE_CODE (typename
) != TREE_LIST
)
7106 return grokdeclarator (TREE_VALUE (typename
),
7107 TREE_PURPOSE (typename
),
7108 TYPENAME
, 0, NULL_TREE
);
7111 /* Decode a declarator in an ordinary declaration or data definition.
7112 This is called as soon as the type information and variable name
7113 have been parsed, before parsing the initializer if any.
7114 Here we create the ..._DECL node, fill in its type,
7115 and put it on the list of decls for the current context.
7116 The ..._DECL node is returned as the value.
7118 Exception: for arrays where the length is not specified,
7119 the type is left null, to be filled in by `cp_finish_decl'.
7121 Function definitions do not come here; they go to start_function
7122 instead. However, external and forward declarations of functions
7123 do go through here. Structure field declarations are done by
7124 grokfield and not through here. */
7127 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
7128 tree declarator
, declspecs
;
7130 tree attributes
, prefix_attributes
;
7133 register tree type
, tem
;
7135 extern int have_extern_spec
;
7136 extern int used_extern_spec
;
7140 /* See code below that used this. */
7141 int init_written
= initialized
;
7144 /* This should only be done once on the top most decl. */
7145 if (have_extern_spec
&& !used_extern_spec
)
7147 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"),
7149 used_extern_spec
= 1;
7152 if (attributes
|| prefix_attributes
)
7153 attrlist
= build_tree_list (attributes
, prefix_attributes
);
7155 attrlist
= NULL_TREE
;
7157 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
7160 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
7163 type
= TREE_TYPE (decl
);
7165 if (type
== error_mark_node
)
7168 context
= DECL_CONTEXT (decl
);
7170 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
7171 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
7173 /* When parsing the initializer, lookup should use the object's
7175 push_decl_namespace (context
);
7178 /* We are only interested in class contexts, later. */
7179 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
7180 context
= NULL_TREE
;
7183 /* Is it valid for this decl to have an initializer at all?
7184 If not, set INITIALIZED to zero, which will indirectly
7185 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7186 switch (TREE_CODE (decl
))
7189 /* typedef foo = bar means give foo the same type as bar.
7190 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
7191 Any other case of an initialization in a TYPE_DECL is an error. */
7192 if (pedantic
|| list_length (declspecs
) > 1)
7194 cp_error ("typedef `%D' is initialized", decl
);
7200 cp_error ("function `%#D' is initialized like a variable", decl
);
7210 if (! toplevel_bindings_p ()
7211 && DECL_EXTERNAL (decl
))
7212 cp_warning ("declaration of `%#D' has `extern' and is initialized",
7214 DECL_EXTERNAL (decl
) = 0;
7215 if (toplevel_bindings_p ())
7216 TREE_STATIC (decl
) = 1;
7218 /* Tell `pushdecl' this is an initialized decl
7219 even though we don't yet have the initializer expression.
7220 Also tell `cp_finish_decl' it may store the real initializer. */
7221 DECL_INITIAL (decl
) = error_mark_node
;
7224 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
7225 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
7228 /* Set attributes here so if duplicate decl, will have proper attributes. */
7229 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
7231 if (context
&& COMPLETE_TYPE_P (complete_type (context
)))
7233 push_nested_class (context
, 2);
7235 if (TREE_CODE (decl
) == VAR_DECL
)
7237 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
7238 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
7239 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
7242 if (DECL_CONTEXT (field
) != context
)
7244 cp_pedwarn ("ISO C++ does not permit `%T::%D' to be defined as `%T::%D'",
7245 DECL_CONTEXT (field
), DECL_NAME (decl
),
7246 context
, DECL_NAME (decl
));
7247 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
7249 /* Static data member are tricky; an in-class initialization
7250 still doesn't provide a definition, so the in-class
7251 declaration will have DECL_EXTERNAL set, but will have an
7252 initialization. Thus, duplicate_decls won't warn
7253 about this situation, and so we check here. */
7254 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
7255 cp_error ("duplicate initialization of %D", decl
);
7256 if (duplicate_decls (decl
, field
))
7262 tree field
= check_classfn (context
, decl
);
7263 if (field
&& duplicate_decls (decl
, field
))
7267 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
7268 DECL_IN_AGGR_P (decl
) = 0;
7269 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
7270 || CLASSTYPE_TEMPLATE_INSTANTIATION (context
))
7272 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
7273 /* [temp.expl.spec] An explicit specialization of a static data
7274 member of a template is a definition if the declaration
7275 includes an initializer; otherwise, it is a declaration.
7277 We check for processing_specialization so this only applies
7278 to the new specialization syntax. */
7279 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
7280 DECL_EXTERNAL (decl
) = 1;
7283 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
7284 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
7288 /* Enter this declaration into the symbol table. */
7289 tem
= maybe_push_decl (decl
);
7291 if (processing_template_decl
)
7292 tem
= push_template_decl (tem
);
7294 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7295 /* Tell the back-end to use or not use .common as appropriate. If we say
7296 -fconserve-space, we want this to save .data space, at the expense of
7297 wrong semantics. If we say -fno-conserve-space, we want this to
7298 produce errors about redefs; to do this we force variables into the
7300 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
7303 if (! processing_template_decl
)
7313 tree type
= TREE_TYPE (decl
);
7314 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
7316 if (type
== error_mark_node
)
7319 /* If this type of object needs a cleanup, but we're not allowed to
7320 add any more objects with cleanups to the current scope, create a
7321 new binding level. */
7322 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
7323 && current_binding_level
->more_cleanups_ok
== 0)
7325 keep_next_level (2);
7328 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/1);
7332 /* Is it valid for this decl to have an initializer at all?
7333 If not, set INITIALIZED to zero, which will indirectly
7334 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7336 /* Don't allow initializations for incomplete types except for
7337 arrays which might be completed by the initialization. */
7338 if (COMPLETE_TYPE_P (complete_type (type
)))
7339 ; /* A complete type is ok. */
7340 else if (TREE_CODE (type
) != ARRAY_TYPE
)
7342 cp_error ("variable `%#D' has initializer but incomplete type",
7345 type
= TREE_TYPE (decl
) = error_mark_node
;
7347 else if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (type
))))
7349 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
7350 cp_error ("elements of array `%#D' have incomplete type", decl
);
7351 /* else we already gave an error in start_decl. */
7357 && TREE_CODE (decl
) != TYPE_DECL
7358 && TREE_CODE (decl
) != TEMPLATE_DECL
7359 && type
!= error_mark_node
7360 && IS_AGGR_TYPE (type
)
7361 && ! DECL_EXTERNAL (decl
))
7363 if ((! processing_template_decl
|| ! uses_template_parms (type
))
7364 && !COMPLETE_TYPE_P (complete_type (type
)))
7366 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
7368 /* Change the type so that assemble_variable will give
7369 DECL an rtl we can live with: (mem (const_int 0)). */
7370 type
= TREE_TYPE (decl
) = error_mark_node
;
7374 /* If any base type in the hierarchy of TYPE needs a constructor,
7375 then we set initialized to 1. This way any nodes which are
7376 created for the purposes of initializing this aggregate
7377 will live as long as it does. This is necessary for global
7378 aggregates which do not have their initializers processed until
7379 the end of the file. */
7380 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
7385 DECL_INITIAL (decl
) = NULL_TREE
;
7388 /* Handle initialization of references.
7389 These three arguments are from `cp_finish_decl', and have the
7390 same meaning here that they do there.
7392 Quotes on semantics can be found in ARM 8.4.3. */
7395 grok_reference_init (decl
, type
, init
)
7396 tree decl
, type
, init
;
7400 if (init
== NULL_TREE
)
7402 if ((DECL_LANG_SPECIFIC (decl
) == 0
7403 || DECL_IN_AGGR_P (decl
) == 0)
7404 && ! DECL_THIS_EXTERN (decl
))
7405 cp_error ("`%D' declared as reference but not initialized", decl
);
7409 if (init
== error_mark_node
)
7412 if (TREE_CODE (init
) == CONSTRUCTOR
)
7414 cp_error ("ISO C++ forbids use of initializer list to initialize reference `%D'", decl
);
7418 if (TREE_CODE (init
) == TREE_LIST
)
7419 init
= build_compound_expr (init
);
7421 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
7422 init
= convert_from_reference (init
);
7424 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
7425 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
7427 /* Note: default conversion is only called in very special cases. */
7428 init
= default_conversion (init
);
7431 /* Convert INIT to the reference type TYPE. This may involve the
7432 creation of a temporary, whose lifetime must be the same as that
7433 of the reference. If so, a DECL_STMT for the temporary will be
7434 added just after the DECL_STMT for DECL. That's why we don't set
7435 DECL_INITIAL for local references (instead assigning to them
7436 explicitly); we need to allow the temporary to be initialized
7438 tmp
= convert_to_reference
7439 (type
, init
, CONV_IMPLICIT
,
7440 LOOKUP_ONLYCONVERTING
|LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
,
7443 if (tmp
== error_mark_node
)
7445 else if (tmp
!= NULL_TREE
)
7448 tmp
= save_expr (tmp
);
7449 if (building_stmt_tree ())
7451 /* Initialize the declaration. */
7452 tmp
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, tmp
);
7453 finish_expr_stmt (tmp
);
7456 DECL_INITIAL (decl
) = tmp
;
7460 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7464 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
7466 expand_static_init (decl
, DECL_INITIAL (decl
));
7467 DECL_INITIAL (decl
) = NULL_TREE
;
7472 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7473 mucking with forces it does not comprehend (i.e. initialization with a
7474 constructor). If we are at global scope and won't go into COMMON, fill
7475 it in with a dummy CONSTRUCTOR to force the variable into .data;
7476 otherwise we can use error_mark_node. */
7479 obscure_complex_init (decl
, init
)
7482 if (! flag_no_inline
&& TREE_STATIC (decl
))
7484 if (extract_init (decl
, init
))
7488 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7489 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7490 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7494 DECL_INITIAL (decl
) = error_mark_node
;
7499 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7500 array until we finish parsing the initializer. If that's the
7501 situation we're in, update DECL accordingly. */
7504 maybe_deduce_size_from_array_init (decl
, init
)
7508 tree type
= TREE_TYPE (decl
);
7510 if (TREE_CODE (type
) == ARRAY_TYPE
7511 && TYPE_DOMAIN (type
) == NULL_TREE
7512 && TREE_CODE (decl
) != TYPE_DECL
)
7515 = (TREE_STATIC (decl
)
7516 /* Even if pedantic, an external linkage array
7517 may have incomplete type at first. */
7518 ? pedantic
&& ! DECL_EXTERNAL (decl
)
7519 : !DECL_EXTERNAL (decl
));
7520 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7521 int failure
= complete_array_type (type
, initializer
, do_default
);
7524 cp_error ("initializer fails to determine size of `%D'", decl
);
7529 cp_error ("array size missing in `%D'", decl
);
7530 /* If a `static' var's size isn't known, make it extern as
7531 well as static, so it does not get allocated. If it's not
7532 `static', then don't mark it extern; finish_incomplete_decl
7533 will give it a default size and it will get allocated. */
7534 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7535 DECL_EXTERNAL (decl
) = 1;
7538 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7539 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7541 cp_error ("zero-size array `%D'", decl
);
7543 layout_decl (decl
, 0);
7547 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7548 any appropriate error messages regarding the layout. */
7551 layout_var_decl (decl
)
7554 tree type
= TREE_TYPE (decl
);
7556 tree ttype
= target_type (type
);
7559 /* If we haven't already layed out this declaration, do so now.
7560 Note that we must not call complete type for an external object
7561 because it's type might involve templates that we are not
7562 supposed to isntantiate yet. (And it's perfectly legal to say
7563 `extern X x' for some incomplete type `X'.) */
7564 if (!DECL_EXTERNAL (decl
))
7565 complete_type (type
);
7566 if (!DECL_SIZE (decl
) && COMPLETE_TYPE_P (type
))
7567 layout_decl (decl
, 0);
7569 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7571 /* An automatic variable with an incomplete type: that is an error.
7572 Don't talk about array types here, since we took care of that
7573 message in grokdeclarator. */
7574 cp_error ("storage size of `%D' isn't known", decl
);
7575 TREE_TYPE (decl
) = error_mark_node
;
7578 /* Keep this code around in case we later want to control debug info
7579 based on whether a type is "used". (jason 1999-11-11) */
7581 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7582 /* Let debugger know it should output info for this type. */
7583 note_debug_info_needed (ttype
);
7585 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7586 note_debug_info_needed (DECL_CONTEXT (decl
));
7589 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7590 && DECL_SIZE (decl
) != NULL_TREE
7591 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7593 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7594 constant_expression_warning (DECL_SIZE (decl
));
7596 cp_error ("storage size of `%D' isn't constant", decl
);
7600 /* If a local static variable is declared in an inline function, or if
7601 we have a weak definition, we must endeavor to create only one
7602 instance of the variable at link-time. */
7605 maybe_commonize_var (decl
)
7608 /* Static data in a function with comdat linkage also has comdat
7610 if (TREE_STATIC (decl
)
7611 /* Don't mess with __FUNCTION__. */
7612 && ! DECL_ARTIFICIAL (decl
)
7613 && current_function_decl
7614 && DECL_CONTEXT (decl
) == current_function_decl
7615 && (DECL_THIS_INLINE (current_function_decl
)
7616 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7617 && TREE_PUBLIC (current_function_decl
))
7619 /* Rather than try to get this right with inlining, we suppress
7620 inlining of such functions. */
7621 current_function_cannot_inline
7622 = "function with static variable cannot be inline";
7624 /* If flag_weak, we don't need to mess with this, as we can just
7625 make the function weak, and let it refer to its unique local
7626 copy. This works because we don't allow the function to be
7630 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7632 TREE_PUBLIC (decl
) = 1;
7633 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7635 else if (DECL_INITIAL (decl
) == NULL_TREE
7636 || DECL_INITIAL (decl
) == error_mark_node
)
7638 TREE_PUBLIC (decl
) = 1;
7639 DECL_COMMON (decl
) = 1;
7641 /* else we lose. We can only do this if we can use common,
7642 which we can't if it has been initialized. */
7644 if (TREE_PUBLIC (decl
))
7645 DECL_ASSEMBLER_NAME (decl
)
7646 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7649 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7650 cp_warning_at (" you can work around this by removing the initializer", decl
);
7654 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7655 /* Set it up again; we might have set DECL_INITIAL since the last
7657 comdat_linkage (decl
);
7660 /* Issue an error message if DECL is an uninitialized const variable. */
7663 check_for_uninitialized_const_var (decl
)
7666 tree type
= TREE_TYPE (decl
);
7668 /* ``Unless explicitly declared extern, a const object does not have
7669 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7671 if (TREE_CODE (decl
) == VAR_DECL
7672 && TREE_CODE (type
) != REFERENCE_TYPE
7673 && CP_TYPE_CONST_P (type
)
7674 && !TYPE_NEEDS_CONSTRUCTING (type
)
7675 && !DECL_INITIAL (decl
))
7676 cp_error ("uninitialized const `%D'", decl
);
7679 /* Verify INIT (the initializer for DECL), and record the
7680 initialization in DECL_INITIAL, if appropriate. Returns a new
7684 check_initializer (decl
, init
)
7690 if (TREE_CODE (decl
) == FIELD_DECL
)
7693 type
= TREE_TYPE (decl
);
7695 /* If `start_decl' didn't like having an initialization, ignore it now. */
7696 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7699 /* Check the initializer. */
7702 /* Things that are going to be initialized need to have complete
7704 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7706 if (type
== error_mark_node
)
7707 /* We will have already complained. */
7709 else if (COMPLETE_TYPE_P (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7711 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7714 else if (TREE_CODE (type
) == ARRAY_TYPE
7715 && !COMPLETE_TYPE_P (TREE_TYPE (type
)))
7717 cp_error ("elements of array `%#D' have incomplete type", decl
);
7720 else if (!COMPLETE_TYPE_P (type
))
7722 cp_error ("`%D' has incomplete type", decl
);
7723 TREE_TYPE (decl
) = error_mark_node
;
7728 if (TREE_CODE (decl
) == CONST_DECL
)
7730 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7732 DECL_INITIAL (decl
) = init
;
7734 /* This will keep us from needing to worry about our obstacks. */
7735 my_friendly_assert (init
!= NULL_TREE
, 149);
7738 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7740 if (TREE_STATIC (decl
))
7741 make_decl_rtl (decl
, NULL_PTR
, toplevel_bindings_p ());
7742 grok_reference_init (decl
, type
, init
);
7747 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7749 if (TREE_CODE (type
) == ARRAY_TYPE
)
7750 init
= digest_init (type
, init
, (tree
*) 0);
7751 else if (TREE_CODE (init
) == CONSTRUCTOR
7752 && TREE_HAS_CONSTRUCTOR (init
))
7754 if (TYPE_NON_AGGREGATE_CLASS (type
))
7756 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7758 init
= error_mark_node
;
7761 goto dont_use_constructor
;
7766 dont_use_constructor
:
7767 if (TREE_CODE (init
) != TREE_VEC
)
7768 init
= store_init_value (decl
, init
);
7772 /* We must hide the initializer so that expand_decl
7773 won't try to do something it does not understand. */
7774 init
= obscure_complex_init (decl
, init
);
7776 else if (DECL_EXTERNAL (decl
))
7778 else if (TYPE_P (type
)
7779 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7781 tree core_type
= strip_array_types (type
);
7783 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7785 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7786 cp_error ("structure `%D' with uninitialized const members", decl
);
7787 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7788 cp_error ("structure `%D' with uninitialized reference members",
7792 check_for_uninitialized_const_var (decl
);
7794 if (COMPLETE_TYPE_P (type
) && TYPE_NEEDS_CONSTRUCTING (type
))
7795 init
= obscure_complex_init (decl
, NULL_TREE
);
7799 check_for_uninitialized_const_var (decl
);
7804 /* If DECL is not a local variable, give it RTL. */
7807 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
7810 const char *asmspec
;
7812 int toplev
= toplevel_bindings_p ();
7815 /* Handle non-variables up front. */
7816 if (TREE_CODE (decl
) != VAR_DECL
)
7818 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7822 /* If we see a class member here, it should be a static data
7824 if (DECL_LANG_SPECIFIC (decl
) && DECL_IN_AGGR_P (decl
))
7826 my_friendly_assert (TREE_STATIC (decl
), 19990828);
7827 /* An in-class declaration of a static data member should be
7828 external; it is only a declaration, and not a definition. */
7829 if (init
== NULL_TREE
)
7830 my_friendly_assert (DECL_EXTERNAL (decl
), 20000723);
7833 /* Set the DECL_ASSEMBLER_NAME for the variable. */
7835 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7837 /* We don't create any RTL for local variables. */
7838 if (DECL_FUNCTION_SCOPE_P (decl
) && !TREE_STATIC (decl
))
7841 /* We defer emission of local statics until the corresponding
7842 DECL_STMT is expanded. */
7843 defer_p
= DECL_FUNCTION_SCOPE_P (decl
) || DECL_VIRTUAL_P (decl
);
7845 /* We try to defer namespace-scope static constants so that they are
7846 not emitted into the object file unncessarily. */
7847 if (!DECL_VIRTUAL_P (decl
)
7848 && TREE_READONLY (decl
)
7849 && DECL_INITIAL (decl
) != NULL_TREE
7850 && DECL_INITIAL (decl
) != error_mark_node
7851 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
))
7853 && !TREE_PUBLIC (decl
))
7855 /* Fool with the linkage according to #pragma interface. */
7856 if (!interface_unknown
)
7858 TREE_PUBLIC (decl
) = 1;
7859 DECL_EXTERNAL (decl
) = interface_only
;
7865 /* If we're deferring the variable, just make RTL. Do not actually
7866 emit the variable. */
7868 make_decl_rtl (decl
, asmspec
, toplev
);
7869 /* If we're not deferring, go ahead and assemble the variable. */
7871 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7874 /* The old ARM scoping rules injected variables declared in the
7875 initialization statement of a for-statement into the surrounding
7876 scope. We support this usage, in order to be backward-compatible.
7877 DECL is a just-declared VAR_DECL; if necessary inject its
7878 declaration into the surrounding scope. */
7881 maybe_inject_for_scope_var (decl
)
7884 if (!DECL_NAME (decl
))
7887 if (current_binding_level
->is_for_scope
)
7889 struct binding_level
*outer
7890 = current_binding_level
->level_chain
;
7892 /* Check to see if the same name is already bound at the outer
7893 level, either because it was directly declared, or because a
7894 dead for-decl got preserved. In either case, the code would
7895 not have been valid under the ARM scope rules, so clear
7896 is_for_scope for the current_binding_level.
7898 Otherwise, we need to preserve the temp slot for decl to last
7899 into the outer binding level. */
7902 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7904 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7905 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7907 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7909 BINDING_VALUE (outer_binding
)
7910 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7911 current_binding_level
->is_for_scope
= 0;
7913 else if (DECL_IN_MEMORY_P (decl
))
7914 preserve_temp_slots (DECL_RTL (decl
));
7918 /* Generate code to initialize DECL (a local variable). */
7921 initialize_local_var (decl
, init
, flags
)
7926 tree type
= TREE_TYPE (decl
);
7928 /* If the type is bogus, don't bother initializing the variable. */
7929 if (type
== error_mark_node
)
7932 if (DECL_SIZE (decl
) == NULL_TREE
&& !TREE_STATIC (decl
))
7934 /* If we used it already as memory, it must stay in memory. */
7935 DECL_INITIAL (decl
) = NULL_TREE
;
7936 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7939 /* Local statics are handled differently from ordinary automatic
7941 if (TREE_STATIC (decl
))
7943 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7944 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7945 expand_static_init (decl
, init
);
7949 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7953 /* Compute and store the initial value. */
7954 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7956 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7958 int saved_stmts_are_full_exprs_p
;
7960 my_friendly_assert (building_stmt_tree (), 20000906);
7961 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p ();
7962 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
7963 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7964 current_stmt_tree ()->stmts_are_full_exprs_p
=
7965 saved_stmts_are_full_exprs_p
;
7968 /* Set this to 0 so we can tell whether an aggregate which was
7969 initialized was ever used. Don't do this if it has a
7970 destructor, so we don't complain about the 'resource
7971 allocation is initialization' idiom. Now set
7972 attribute((unused)) on types so decls of that type will be
7973 marked used. (see TREE_USED, above.) */
7974 if (TYPE_NEEDS_CONSTRUCTING (type
)
7976 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type
)
7977 && DECL_NAME (decl
))
7978 TREE_USED (decl
) = 0;
7979 else if (already_used
)
7980 TREE_USED (decl
) = 1;
7984 /* Generate code to destroy DECL (a local variable). */
7987 destroy_local_var (decl
)
7990 tree type
= TREE_TYPE (decl
);
7993 /* Only variables get cleaned up. */
7994 if (TREE_CODE (decl
) != VAR_DECL
)
7997 /* And only things with destructors need cleaning up. */
7998 if (type
== error_mark_node
7999 || TYPE_HAS_TRIVIAL_DESTRUCTOR (type
))
8002 if (TREE_CODE (decl
) == VAR_DECL
&&
8003 (DECL_EXTERNAL (decl
) || TREE_STATIC (decl
)))
8004 /* We don't clean up things that aren't defined in this
8005 translation unit, or that need a static cleanup. The latter
8006 are handled by finish_file. */
8009 /* Compute the cleanup. */
8010 cleanup
= maybe_build_cleanup (decl
);
8012 /* Record the cleanup required for this declaration. */
8013 if (DECL_SIZE (decl
) && TREE_TYPE (decl
) != error_mark_node
8015 finish_decl_cleanup (decl
, cleanup
);
8018 /* Finish processing of a declaration;
8019 install its line number and initial value.
8020 If the length of an array type is not known before,
8021 it must be determined now, from the initial value, or it is an error.
8023 INIT holds the value of an initializer that should be allowed to escape
8026 FLAGS is LOOKUP_ONLYCONVERTING if the = init syntax was used, else 0
8027 if the (init) syntax was used. */
8030 cp_finish_decl (decl
, init
, asmspec_tree
, flags
)
8036 tree ttype
= NULL_TREE
;
8037 const char *asmspec
= NULL
;
8038 int was_readonly
= 0;
8043 error ("assignment (not initialization) in declaration");
8047 /* If a name was specified, get the string. */
8049 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
8051 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
8053 cp_error ("cannot initialize `%D' to namespace `%D'",
8058 if (current_class_type
8059 && CP_DECL_CONTEXT (decl
) == current_class_type
8060 && TYPE_BEING_DEFINED (current_class_type
)
8061 && (DECL_INITIAL (decl
) || init
))
8062 DECL_DEFINED_IN_CLASS_P (decl
) = 1;
8064 if (TREE_CODE (decl
) == VAR_DECL
8065 && DECL_CONTEXT (decl
)
8066 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
8067 && DECL_CONTEXT (decl
) != current_namespace
8070 /* Leave the namespace of the object. */
8071 pop_decl_namespace ();
8074 type
= TREE_TYPE (decl
);
8076 if (type
== error_mark_node
)
8079 /* Add this declaration to the statement-tree. */
8080 if (building_stmt_tree ()
8081 && at_function_scope_p ()
8082 && TREE_CODE (decl
) != RESULT_DECL
)
8083 add_decl_stmt (decl
);
8085 if (TYPE_HAS_MUTABLE_P (type
))
8086 TREE_READONLY (decl
) = 0;
8088 if (processing_template_decl
)
8090 if (init
&& DECL_INITIAL (decl
))
8091 DECL_INITIAL (decl
) = init
;
8095 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
8096 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
8098 /* Take care of TYPE_DECLs up front. */
8099 if (TREE_CODE (decl
) == TYPE_DECL
)
8101 if (init
&& DECL_INITIAL (decl
))
8103 /* typedef foo = bar; store the type of bar as the type of foo. */
8104 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
8105 DECL_INITIAL (decl
) = init
= NULL_TREE
;
8107 if (type
!= error_mark_node
8108 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
8110 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
8111 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
8112 set_identifier_type_value (DECL_NAME (decl
), type
);
8113 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
8115 GNU_xref_decl (current_function_decl
, decl
);
8117 /* If we have installed this as the canonical typedef for this
8118 type, and that type has not been defined yet, delay emitting
8119 the debug information for it, as we will emit it later. */
8120 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
8121 && !COMPLETE_TYPE_P (TREE_TYPE (decl
)))
8122 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
8124 rest_of_decl_compilation (decl
, NULL_PTR
,
8125 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
8129 if (TREE_CODE (decl
) != FUNCTION_DECL
)
8130 ttype
= target_type (type
);
8132 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
8133 && TYPE_NEEDS_CONSTRUCTING (type
))
8135 /* Currently, GNU C++ puts constants in text space, making them
8136 impossible to initialize. In the future, one would hope for
8137 an operating system which understood the difference between
8138 initialization and the running of a program. */
8140 TREE_READONLY (decl
) = 0;
8143 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
8145 /* This must override the asm specifier which was placed by
8146 grokclassfn. Lay this out fresh. */
8147 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
8148 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
8149 make_decl_rtl (decl
, asmspec
, 0);
8152 /* Deduce size of array from initialization, if not already known. */
8153 maybe_deduce_size_from_array_init (decl
, init
);
8154 init
= check_initializer (decl
, init
);
8156 GNU_xref_decl (current_function_decl
, decl
);
8158 if (TREE_CODE (decl
) == VAR_DECL
)
8159 layout_var_decl (decl
);
8161 /* Output the assembler code and/or RTL code for variables and functions,
8162 unless the type is an undefined structure or union.
8163 If not, it will get done when the type is completed. */
8164 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
8165 || TREE_CODE (decl
) == RESULT_DECL
)
8167 if (TREE_CODE (decl
) == VAR_DECL
)
8168 maybe_commonize_var (decl
);
8170 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
8172 if (TREE_CODE (type
) == FUNCTION_TYPE
8173 || TREE_CODE (type
) == METHOD_TYPE
)
8174 abstract_virtuals_error (decl
,
8175 strip_array_types (TREE_TYPE (type
)));
8177 abstract_virtuals_error (decl
, strip_array_types (type
));
8179 if (TREE_CODE (decl
) == FUNCTION_DECL
)
8181 else if (DECL_EXTERNAL (decl
)
8182 && ! (DECL_LANG_SPECIFIC (decl
)
8183 && DECL_NOT_REALLY_EXTERN (decl
)))
8186 DECL_INITIAL (decl
) = init
;
8188 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
8190 /* This is a local declaration. */
8191 if (doing_semantic_analysis_p ())
8192 maybe_inject_for_scope_var (decl
);
8193 /* Initialize the local variable. But, if we're building a
8194 statement-tree, we'll do the initialization when we
8196 if (processing_template_decl
)
8198 if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
8199 DECL_INITIAL (decl
) = init
;
8203 /* If we're not building RTL, then we need to do so
8205 my_friendly_assert (building_stmt_tree (), 20000906);
8206 /* Initialize the variable. */
8207 initialize_local_var (decl
, init
, flags
);
8208 /* Clean up the variable. */
8209 destroy_local_var (decl
);
8212 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
8214 /* Cleanups for static variables are handled by `finish_file'. */
8215 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
8216 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
8217 expand_static_init (decl
, init
);
8221 /* Undo call to `pushclass' that was done in `start_decl'
8222 due to initialization of qualified member variable.
8223 I.e., Foo::x = 10; */
8225 tree context
= CP_DECL_CONTEXT (decl
);
8228 && (TREE_CODE (decl
) == VAR_DECL
8229 /* We also have a pushclass done that we need to undo here
8230 if we're at top level and declare a method. */
8231 || TREE_CODE (decl
) == FUNCTION_DECL
)
8232 /* If size hasn't been set, we're still defining it,
8233 and therefore inside the class body; don't pop
8234 the binding level.. */
8235 && COMPLETE_TYPE_P (context
)
8236 && context
== current_class_type
)
8237 pop_nested_class ();
8244 TREE_READONLY (decl
) = 1;
8247 /* This is here for a midend callback from c-common.c */
8250 finish_decl (decl
, init
, asmspec_tree
)
8254 cp_finish_decl (decl
, init
, asmspec_tree
, 0);
8257 /* Returns a declaration for a VAR_DECL as if:
8259 extern "C" TYPE NAME;
8261 had been seen. Used to create compiler-generated global
8265 declare_global_var (name
, type
)
8271 push_to_top_level ();
8272 decl
= build_decl (VAR_DECL
, name
, type
);
8273 TREE_PUBLIC (decl
) = 1;
8274 DECL_EXTERNAL (decl
) = 1;
8275 DECL_ARTIFICIAL (decl
) = 1;
8277 cp_finish_decl (decl
, NULL_TREE
, NULL_TREE
, 0);
8278 pop_from_top_level ();
8283 /* Returns a pointer to the `atexit' function. Note that if
8284 FLAG_USE_CXA_ATEXIT is non-zero, then this will actually be the new
8285 `__cxa_atexit' function specified in the IA64 C++ ABI. */
8299 if (flag_use_cxa_atexit
)
8301 /* The declaration for `__cxa_atexit' is:
8303 int __cxa_atexit (void (*)(void *), void *, void *)
8305 We build up the argument types and then then function type
8308 /* First, build the pointer-to-function type for the first
8310 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8311 fn_type
= build_function_type (void_type_node
, arg_types
);
8312 fn_ptr_type
= build_pointer_type (fn_type
);
8313 /* Then, build the rest of the argument types. */
8314 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8315 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, arg_types
);
8316 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, arg_types
);
8317 /* And the final __cxa_atexit type. */
8318 fn_type
= build_function_type (integer_type_node
, arg_types
);
8319 fn_ptr_type
= build_pointer_type (fn_type
);
8320 name
= "__cxa_atexit";
8324 /* The declaration for `atexit' is:
8326 int atexit (void (*)());
8328 We build up the argument types and then then function type
8330 fn_type
= build_function_type (void_type_node
, void_list_node
);
8331 fn_ptr_type
= build_pointer_type (fn_type
);
8332 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, void_list_node
);
8333 /* Build the final atexit type. */
8334 fn_type
= build_function_type (integer_type_node
, arg_types
);
8338 /* Now, build the function declaration. */
8339 push_lang_context (lang_name_c
);
8340 atexit_fndecl
= build_library_fn_ptr (name
, fn_type
);
8341 mark_used (atexit_fndecl
);
8342 pop_lang_context ();
8343 atexit_node
= default_conversion (atexit_fndecl
);
8348 /* Returns the __dso_handle VAR_DECL. */
8351 get_dso_handle_node ()
8353 if (dso_handle_node
)
8354 return dso_handle_node
;
8356 /* Declare the variable. */
8357 dso_handle_node
= declare_global_var (get_identifier ("__dso_handle"),
8360 return dso_handle_node
;
8363 /* Begin a new function with internal linkage whose job will be simply
8364 to destroy some particular variable. */
8369 static int counter
= 0;
8370 int old_interface_unknown
= interface_unknown
;
8376 push_to_top_level ();
8378 /* No need to mangle this. */
8379 push_lang_context (lang_name_c
);
8381 interface_unknown
= 1;
8383 /* Build the parameter-types. */
8384 parmtypes
= void_list_node
;
8385 /* Functions passed to __cxa_atexit take an additional parameter.
8386 We'll just ignore it. After we implement the new calling
8387 convention for destructors, we can eliminate the use of
8388 additional cleanup functions entirely in the -fnew-abi case. */
8389 if (flag_use_cxa_atexit
)
8390 parmtypes
= tree_cons (NULL_TREE
, ptr_type_node
, parmtypes
);
8391 /* Build the function type itself. */
8392 fntype
= build_function_type (void_type_node
, parmtypes
);
8393 /* Build the name of the function. */
8394 sprintf (name
, "__tcf_%d", counter
++);
8395 /* Build the function declaration. */
8396 fndecl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), fntype
);
8397 /* It's a function with internal linkage, generated by the
8399 TREE_PUBLIC (fndecl
) = 0;
8400 DECL_ARTIFICIAL (fndecl
) = 1;
8401 /* Make the function `inline' so that it is only emitted if it is
8402 actually needed. It is unlikely that it will be inlined, since
8403 it is only called via a function pointer, but we avoid unncessary
8404 emissions this way. */
8405 DECL_INLINE (fndecl
) = 1;
8406 /* Build the parameter. */
8407 if (flag_use_cxa_atexit
)
8411 parmdecl
= build_decl (PARM_DECL
, NULL_TREE
, ptr_type_node
);
8412 DECL_CONTEXT (parmdecl
) = fndecl
;
8413 DECL_ARG_TYPE (parmdecl
) = ptr_type_node
;
8414 TREE_USED (parmdecl
) = 1;
8415 DECL_ARGUMENTS (fndecl
) = parmdecl
;
8419 start_function (/*specs=*/NULL_TREE
, fndecl
, NULL_TREE
, SF_PRE_PARSED
);
8422 interface_unknown
= old_interface_unknown
;
8424 pop_lang_context ();
8426 return current_function_decl
;
8429 /* Finish the cleanup function begun by start_cleanup_fn. */
8436 expand_body (finish_function (0));
8438 pop_from_top_level ();
8441 /* Generate code to handle the destruction of DECL, an object with
8442 static storage duration. */
8445 register_dtor_fn (decl
)
8453 int saved_flag_access_control
;
8455 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl
)))
8458 /* Call build_cleanup before we enter the anonymous function so that
8459 any access checks will be done relative to the current scope,
8460 rather than the scope of the anonymous function. */
8461 build_cleanup (decl
);
8463 /* Now start the function. */
8464 cleanup
= start_cleanup_fn ();
8466 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
8467 to the original function, rather than the anonymous one. That
8468 will make the back-end think that nested functions are in use,
8469 which causes confusion. */
8470 saved_flag_access_control
= flag_access_control
;
8471 flag_access_control
= 0;
8472 fcall
= build_cleanup (decl
);
8473 flag_access_control
= saved_flag_access_control
;
8475 /* Create the body of the anonymous function. */
8476 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
8477 finish_expr_stmt (fcall
);
8478 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
8481 /* Call atexit with the cleanup function. */
8482 mark_addressable (cleanup
);
8483 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
8484 if (flag_use_cxa_atexit
)
8486 args
= tree_cons (NULL_TREE
, get_dso_handle_node (), NULL_TREE
);
8487 args
= tree_cons (NULL_TREE
, null_pointer_node
, args
);
8488 args
= tree_cons (NULL_TREE
, cleanup
, args
);
8491 args
= tree_cons (NULL_TREE
, cleanup
, NULL_TREE
);
8492 finish_expr_stmt (build_function_call (get_atexit_node (), args
));
8496 expand_static_init (decl
, init
)
8500 tree oldstatic
= value_member (decl
, static_aggregates
);
8504 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
8505 cp_error ("multiple initializations given for `%D'", decl
);
8507 else if (! toplevel_bindings_p ())
8509 /* Emit code to perform this initialization but once. */
8516 /* Emit code to perform this initialization but once. This code
8519 static int guard = 0;
8521 // Do initialization.
8523 // Register variable for destruction at end of program.
8526 Note that the `temp' variable is only set to 1 *after* the
8527 initialization is complete. This ensures that an exception,
8528 thrown during the construction, will cause the variable to
8529 reinitialized when we pass through this code again, as per:
8533 If the initialization exits by throwing an exception, the
8534 initialization is not complete, so it will be tried again
8535 the next time control enters the declaration.
8537 In theory, this process should be thread-safe, too; multiple
8538 threads should not be able to initialize the variable more
8539 than once. We don't yet attempt to ensure thread-safety. */
8541 /* Create the guard variable. */
8542 guard
= get_guard (decl
);
8544 /* Begin the conditional initialization. */
8545 if_stmt
= begin_if_stmt ();
8546 finish_if_stmt_cond (get_guard_cond (guard
), if_stmt
);
8547 then_clause
= begin_compound_stmt (/*has_no_scope=*/0);
8549 /* Do the initialization itself. */
8550 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
8551 || (init
&& TREE_CODE (init
) == TREE_LIST
))
8552 assignment
= build_aggr_init (decl
, init
, 0);
8554 /* The initialization we're doing here is just a bitwise
8556 assignment
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
8558 assignment
= NULL_TREE
;
8560 /* Once the assignment is complete, set TEMP to 1. Since the
8561 construction of the static object is complete at this point,
8562 we want to make sure TEMP is set to 1 even if a temporary
8563 constructed during the initialization throws an exception
8564 when it is destroyed. So, we combine the initialization and
8565 the assignment to TEMP into a single expression, ensuring
8566 that when we call finish_expr_stmt the cleanups will not be
8567 run until after TEMP is set to 1. */
8568 guard_init
= set_guard (guard
);
8571 assignment
= tree_cons (NULL_TREE
, assignment
,
8572 build_tree_list (NULL_TREE
,
8574 assignment
= build_compound_expr (assignment
);
8577 assignment
= guard_init
;
8578 finish_expr_stmt (assignment
);
8580 /* Use atexit to register a function for destroying this static
8582 register_dtor_fn (decl
);
8584 finish_compound_stmt (/*has_no_scope=*/0, then_clause
);
8585 finish_then_clause (if_stmt
);
8589 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8592 /* Finish the declaration of a catch-parameter. */
8595 start_handler_parms (declspecs
, declarator
)
8602 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8604 if (decl
== NULL_TREE
)
8605 error ("invalid catch parameter");
8614 /* Make TYPE a complete type based on INITIAL_VALUE.
8615 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8616 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8619 complete_array_type (type
, initial_value
, do_default
)
8620 tree type
, initial_value
;
8623 register tree maxindex
= NULL_TREE
;
8628 /* An array of character type can be initialized from a
8629 brace-enclosed string constant. */
8630 if (char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (type
)))
8631 && TREE_CODE (initial_value
) == CONSTRUCTOR
8632 && CONSTRUCTOR_ELTS (initial_value
)
8633 && (TREE_CODE (TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
)))
8635 && TREE_CHAIN (CONSTRUCTOR_ELTS (initial_value
)) == NULL_TREE
)
8636 initial_value
= TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
));
8638 /* Note MAXINDEX is really the maximum index, one less than the
8640 if (TREE_CODE (initial_value
) == STRING_CST
)
8643 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8644 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8647 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8649 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8651 maxindex
= ssize_int (-1);
8652 for (; elts
; elts
= TREE_CHAIN (elts
))
8654 if (TREE_PURPOSE (elts
))
8655 maxindex
= TREE_PURPOSE (elts
);
8657 maxindex
= size_binop (PLUS_EXPR
, maxindex
, ssize_int (1));
8659 maxindex
= copy_node (maxindex
);
8663 /* Make an error message unless that happened already. */
8664 if (initial_value
!= error_mark_node
)
8667 initial_value
= NULL_TREE
;
8669 /* Prevent further error messages. */
8670 maxindex
= build_int_2 (0, 0);
8677 maxindex
= build_int_2 (0, 0);
8686 domain
= build_index_type (maxindex
);
8687 TYPE_DOMAIN (type
) = domain
;
8689 if (! TREE_TYPE (maxindex
))
8690 TREE_TYPE (maxindex
) = domain
;
8692 itype
= TREE_TYPE (initial_value
);
8695 if (itype
&& !TYPE_DOMAIN (itype
))
8696 TYPE_DOMAIN (itype
) = domain
;
8697 /* The type of the main variant should never be used for arrays
8698 of different sizes. It should only ever be completed with the
8699 size of the array. */
8700 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8701 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8704 /* Lay out the type now that we can get the real answer. */
8711 /* Return zero if something is declared to be a member of type
8712 CTYPE when in the context of CUR_TYPE. STRING is the error
8713 message to print in that case. Otherwise, quietly return 1. */
8716 member_function_or_else (ctype
, cur_type
, flags
)
8717 tree ctype
, cur_type
;
8718 enum overload_flags flags
;
8720 if (ctype
&& ctype
!= cur_type
)
8722 if (flags
== DTOR_FLAG
)
8723 cp_error ("destructor for alien class `%T' cannot be a member",
8726 cp_error ("constructor for alien class `%T' cannot be a member",
8733 /* Subroutine of `grokdeclarator'. */
8735 /* Generate errors possibly applicable for a given set of specifiers.
8736 This is for ARM $7.1.2. */
8739 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8742 int virtualp
, quals
, friendp
, raises
, inlinep
;
8745 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8747 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8749 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8752 cp_error_at ("`%D' declared as a friend", object
);
8754 cp_error_at ("`%D' declared with an exception specification", object
);
8757 /* CTYPE is class type, or null if non-class.
8758 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8760 DECLARATOR is the function's name.
8761 VIRTUALP is truthvalue of whether the function is virtual or not.
8762 FLAGS are to be passed through to `grokclassfn'.
8763 QUALS are qualifiers indicating whether the function is `const'
8765 RAISES is a list of exceptions that this function can raise.
8766 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8767 not look, and -1 if we should not call `grokclassfn' at all.
8769 Returns `NULL_TREE' if something goes wrong, after issuing
8770 applicable error messages. */
8773 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8774 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8775 template_count
, in_namespace
)
8778 tree orig_declarator
;
8780 enum overload_flags flags
;
8782 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8786 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8787 int has_default_arg
= 0;
8791 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8792 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8798 type
= build_exception_variant (type
, raises
);
8801 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8802 /* Propagate volatile out from type to decl. */
8803 if (TYPE_VOLATILE (type
))
8804 TREE_THIS_VOLATILE (decl
) = 1;
8806 /* If this decl has namespace scope, set that up. */
8808 set_decl_namespace (decl
, in_namespace
, friendp
);
8810 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8812 /* `main' and builtins have implicit 'C' linkage. */
8813 if ((MAIN_NAME_P (declarator
)
8814 || (IDENTIFIER_LENGTH (declarator
) > 10
8815 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8816 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8817 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8818 && current_lang_name
== lang_name_cplusplus
8819 && ctype
== NULL_TREE
8820 /* NULL_TREE means global namespace. */
8821 && DECL_CONTEXT (decl
) == NULL_TREE
)
8822 DECL_LANGUAGE (decl
) = lang_c
;
8824 /* Should probably propagate const out from type to decl I bet (mrs). */
8827 DECL_STATIC_FUNCTION_P (decl
) = 1;
8828 DECL_CONTEXT (decl
) = ctype
;
8832 DECL_CONTEXT (decl
) = ctype
;
8834 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8836 if (processing_template_decl
)
8837 error ("cannot declare `::main' to be a template");
8839 error ("cannot declare `::main' to be inline");
8841 error ("cannot declare `::main' to be static");
8842 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
8844 error ("`main' must return `int'");
8849 /* Members of anonymous types and local classes have no linkage; make
8851 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8852 || decl_function_context (TYPE_MAIN_DECL (ctype
))))
8857 /* [basic.link]: A name with no linkage (notably, the name of a class
8858 or enumeration declared in a local scope) shall not be used to
8859 declare an entity with linkage.
8861 Only check this for public decls for now. */
8862 t
= no_linkage_check (TREE_TYPE (decl
));
8865 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8867 if (DECL_EXTERN_C_P (decl
))
8868 /* Allow this; it's pretty common in C. */;
8870 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8874 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8879 TREE_PUBLIC (decl
) = publicp
;
8882 DECL_INTERFACE_KNOWN (decl
) = 1;
8883 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8887 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8889 DECL_EXTERNAL (decl
) = 1;
8890 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8892 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8893 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8897 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8898 grok_op_properties (decl
, virtualp
, check
< 0);
8900 if (ctype
&& decl_function_context (decl
))
8901 DECL_NO_STATIC_CHAIN (decl
) = 1;
8903 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8904 if (TREE_PURPOSE (t
)
8905 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8907 has_default_arg
= 1;
8912 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8916 ("defining explicit specialization `%D' in friend declaration",
8920 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8922 /* Something like `template <class T> friend void f<T>()'. */
8923 cp_error ("invalid use of template-id `%D' in declaration of primary template",
8929 /* A friend declaration of the form friend void f<>(). Record
8930 the information in the TEMPLATE_ID_EXPR. */
8931 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8932 DECL_TEMPLATE_INFO (decl
)
8933 = tree_cons (TREE_OPERAND (orig_declarator
, 0),
8934 TREE_OPERAND (orig_declarator
, 1),
8937 if (has_default_arg
)
8939 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8946 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8953 if (has_default_arg
)
8954 add_defarg_fn (decl
);
8956 /* Plain overloading: will not be grok'd by grokclassfn. */
8957 if (! ctype
&& ! processing_template_decl
8958 && !DECL_EXTERN_C_P (decl
)
8959 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8960 set_mangled_name_for_decl (decl
);
8963 /* Make the init_value nonzero so pushdecl knows this is not
8964 tentative. error_mark_node is replaced later with the BLOCK. */
8965 DECL_INITIAL (decl
) = error_mark_node
;
8967 if (TYPE_NOTHROW_P (type
) || nothrow_libfn_p (decl
))
8968 TREE_NOTHROW (decl
) = 1;
8970 /* Caller will do the rest of this. */
8974 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8975 DECL_CONSTRUCTOR_P (decl
) = 1;
8977 /* Function gets the ugly name, field gets the nice one. This call
8978 may change the type of the function (because of default
8980 if (ctype
!= NULL_TREE
)
8981 grokclassfn (ctype
, decl
, flags
, quals
);
8983 decl
= check_explicit_specialization (orig_declarator
, decl
,
8985 2 * (funcdef_flag
!= 0) +
8986 4 * (friendp
!= 0));
8987 if (decl
== error_mark_node
)
8990 if (ctype
!= NULL_TREE
8991 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8996 old_decl
= check_classfn (ctype
, decl
);
8998 if (old_decl
&& TREE_CODE (old_decl
) == TEMPLATE_DECL
)
8999 /* Because grokfndecl is always supposed to return a
9000 FUNCTION_DECL, we pull out the DECL_TEMPLATE_RESULT
9001 here. We depend on our callers to figure out that its
9002 really a template that's being returned. */
9003 old_decl
= DECL_TEMPLATE_RESULT (old_decl
);
9005 if (old_decl
&& DECL_STATIC_FUNCTION_P (old_decl
)
9006 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
9008 /* Remove the `this' parm added by grokclassfn.
9009 XXX Isn't this done in start_function, too? */
9010 revert_static_member_fn (decl
);
9011 last_function_parms
= TREE_CHAIN (last_function_parms
);
9013 if (old_decl
&& DECL_ARTIFICIAL (old_decl
))
9014 cp_error ("definition of implicitly-declared `%D'", old_decl
);
9018 /* Since we've smashed OLD_DECL to its
9019 DECL_TEMPLATE_RESULT, we must do the same to DECL. */
9020 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
9021 decl
= DECL_TEMPLATE_RESULT (decl
);
9023 /* Attempt to merge the declarations. This can fail, in
9024 the case of some illegal specialization declarations. */
9025 if (!duplicate_decls (decl
, old_decl
))
9026 cp_error ("no `%#D' member function declared in class `%T'",
9032 if (DECL_CONSTRUCTOR_P (decl
) && !grok_ctor_properties (ctype
, decl
))
9035 if (ctype
== NULL_TREE
|| check
)
9040 DECL_VIRTUAL_P (decl
) = 1;
9041 if (DECL_VINDEX (decl
) == NULL_TREE
)
9042 DECL_VINDEX (decl
) = error_mark_node
;
9043 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
9050 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
9053 RID_BIT_TYPE
*specbits_in
;
9059 RID_BIT_TYPE specbits
;
9061 specbits
= *specbits_in
;
9063 if (TREE_CODE (type
) == OFFSET_TYPE
)
9065 /* If you declare a static member so that it
9066 can be initialized, the code will reach here. */
9067 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
9068 type
= TREE_TYPE (type
);
9069 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
9070 DECL_CONTEXT (decl
) = basetype
;
9071 /* DECL_ASSEMBLER_NAME is needed only for full-instantiated
9073 if (!uses_template_parms (decl
))
9076 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
9078 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
,
9087 context
= in_namespace
;
9088 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
9089 context
= current_namespace
;
9091 context
= NULL_TREE
;
9093 if (processing_template_decl
&& context
)
9094 /* For global variables, declared in a template, we need the
9096 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
9098 decl
= build_decl (VAR_DECL
, declarator
, type
);
9101 set_decl_namespace (decl
, context
, 0);
9103 context
= DECL_CONTEXT (decl
);
9104 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
9107 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
9109 DECL_ASSEMBLER_NAME (decl
)
9110 = build_static_name (context
, declarator
);
9115 set_decl_namespace (decl
, in_namespace
, 0);
9117 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
9119 DECL_THIS_EXTERN (decl
) = 1;
9120 DECL_EXTERNAL (decl
) = !initialized
;
9123 /* In class context, static means one per class,
9124 public access, and static storage. */
9125 if (DECL_CLASS_SCOPE_P (decl
))
9127 TREE_PUBLIC (decl
) = 1;
9128 TREE_STATIC (decl
) = 1;
9129 DECL_EXTERNAL (decl
) = 0;
9131 /* At top level, either `static' or no s.c. makes a definition
9132 (perhaps tentative), and absence of `static' makes it public. */
9133 else if (toplevel_bindings_p ())
9135 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
9136 && (DECL_THIS_EXTERN (decl
) || ! constp
));
9137 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
9139 /* Not at top level, only `static' makes a static definition. */
9142 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
9143 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
9146 if (TREE_PUBLIC (decl
))
9148 /* [basic.link]: A name with no linkage (notably, the name of a class
9149 or enumeration declared in a local scope) shall not be used to
9150 declare an entity with linkage.
9152 Only check this for public decls for now. */
9153 tree t
= no_linkage_check (TREE_TYPE (decl
));
9156 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
9157 /* Ignore for now; `enum { foo } e' is pretty common. */;
9159 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
9167 /* Create and return a canonical pointer to member function type, for
9168 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
9171 build_ptrmemfunc_type (type
)
9177 tree unqualified_variant
= NULL_TREE
;
9179 /* If a canonical type already exists for this type, use it. We use
9180 this method instead of type_hash_canon, because it only does a
9181 simple equality check on the list of field members. */
9183 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
9186 /* Make sure that we always have the unqualified pointer-to-member
9188 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9190 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
9192 t
= make_aggr_type (RECORD_TYPE
);
9193 /* Let the front-end know this is a pointer to member function... */
9194 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
9195 /* ... and not really an aggregate. */
9196 SET_IS_AGGR_TYPE (t
, 0);
9200 u
= make_aggr_type (UNION_TYPE
);
9201 SET_IS_AGGR_TYPE (u
, 0);
9202 fields
[0] = build_decl (FIELD_DECL
, pfn_identifier
, type
);
9203 fields
[1] = build_decl (FIELD_DECL
, delta2_identifier
,
9205 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9206 TYPE_NAME (u
) = NULL_TREE
;
9208 fields
[0] = build_decl (FIELD_DECL
, delta_identifier
,
9210 fields
[1] = build_decl (FIELD_DECL
, index_identifier
,
9212 fields
[2] = build_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
9213 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
9217 fields
[0] = build_decl (FIELD_DECL
, pfn_identifier
, type
);
9218 fields
[1] = build_decl (FIELD_DECL
, delta_identifier
,
9220 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9223 /* Zap out the name so that the back-end will give us the debugging
9224 information for this anonymous RECORD_TYPE. */
9225 TYPE_NAME (t
) = NULL_TREE
;
9227 /* If this is not the unqualified form of this pointer-to-member
9228 type, set the TYPE_MAIN_VARIANT for this type to be the
9229 unqualified type. Since they are actually RECORD_TYPEs that are
9230 not variants of each other, we must do this manually. */
9231 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9233 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
9234 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
9235 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
9236 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
9239 /* Cache this pointer-to-member type so that we can find it again
9241 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
9243 /* Seems to be wanted. */
9244 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
9249 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
9250 Check to see that the definition is valid. Issue appropriate error
9251 messages. Return 1 if the definition is particularly bad, or 0
9255 check_static_variable_definition (decl
, type
)
9259 /* Motion 10 at San Diego: If a static const integral data member is
9260 initialized with an integral constant expression, the initializer
9261 may appear either in the declaration (within the class), or in
9262 the definition, but not both. If it appears in the class, the
9263 member is a member constant. The file-scope definition is always
9265 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
9267 cp_error ("invalid in-class initialization of static data member of non-integral type `%T'",
9269 /* If we just return the declaration, crashes will sometimes
9270 occur. We therefore return void_type_node, as if this was a
9271 friend declaration, to cause callers to completely ignore
9272 this declaration. */
9275 else if (!CP_TYPE_CONST_P (type
))
9276 cp_error ("ISO C++ forbids in-class initialization of non-const static member `%D'",
9278 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
9279 cp_pedwarn ("ISO C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
9284 /* Given the SIZE (i.e., number of elements) in an array, compute an
9285 appropriate index type for the array. If non-NULL, NAME is the
9286 name of the thing being declared. */
9289 compute_array_index_type (name
, size
)
9295 /* The size might be the result of a cast. */
9296 STRIP_TYPE_NOPS (size
);
9298 /* It might be a const variable or enumeration constant. */
9299 size
= decl_constant_value (size
);
9301 /* If this involves a template parameter, it will be a constant at
9302 instantiation time, but we don't know what the value is yet.
9303 Even if no template parameters are involved, we may an expression
9304 that is not a constant; we don't even simplify `1 + 2' when
9305 processing a template. */
9306 if (processing_template_decl
)
9308 /* Resolve a qualified reference to an enumerator or static
9309 const data member of ours. */
9310 if (TREE_CODE (size
) == SCOPE_REF
9311 && TREE_OPERAND (size
, 0) == current_class_type
)
9313 tree t
= lookup_field (current_class_type
,
9314 TREE_OPERAND (size
, 1), 0, 0);
9319 return build_index_type (build_min (MINUS_EXPR
, sizetype
,
9320 size
, integer_one_node
));
9323 /* The array bound must be an integer type. */
9324 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9325 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
9326 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
9329 cp_error ("size of array `%D' has non-integer type", name
);
9331 cp_error ("size of array has non-integer type");
9332 size
= integer_one_node
;
9335 /* Normally, the array-bound will be a constant. */
9336 if (TREE_CODE (size
) == INTEGER_CST
)
9338 /* Check to see if the array bound overflowed. Make that an
9339 error, no matter how generous we're being. */
9340 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9341 int old_pedantic
= pedantic
;
9342 pedantic
= flag_pedantic_errors
= 1;
9343 constant_expression_warning (size
);
9344 pedantic
= old_pedantic
;
9345 flag_pedantic_errors
= old_flag_pedantic_errors
;
9347 /* An array must have a positive number of elements. */
9348 if (INT_CST_LT (size
, integer_zero_node
))
9351 cp_error ("size of array `%D' is negative", name
);
9353 cp_error ("size of array is negative");
9354 size
= integer_one_node
;
9356 /* Except that an extension we allow zero-sized arrays. We
9357 always allow them in system headers because glibc uses
9359 else if (integer_zerop (size
) && pedantic
&& !in_system_header
)
9362 cp_pedwarn ("ISO C++ forbids zero-size array `%D'", name
);
9364 cp_pedwarn ("ISO C++ forbids zero-size array");
9367 else if (TREE_CONSTANT (size
))
9369 /* `(int) &fn' is not a valid array bound. */
9371 cp_error ("size of array `%D' is not an integral constant-expression",
9374 cp_error ("size of array is not an integral constant-expression");
9377 /* Compute the index of the largest element in the array. It is
9378 one less than the number of elements in the array. */
9380 = fold (cp_build_binary_op (MINUS_EXPR
,
9381 cp_convert (ssizetype
, size
),
9382 cp_convert (ssizetype
,
9383 integer_one_node
)));
9385 /* Check for variable-sized arrays. We allow such things as an
9386 extension, even though they are not allowed in ANSI/ISO C++. */
9387 if (!TREE_CONSTANT (itype
))
9392 cp_pedwarn ("ISO C++ forbids variable-size array `%D'",
9395 cp_pedwarn ("ISO C++ forbids variable-size array");
9398 /* Create a variable-sized array index type. */
9399 itype
= variable_size (itype
);
9401 /* Make sure that there was no overflow when creating to a signed
9402 index type. (For example, on a 32-bit machine, an array with
9403 size 2^32 - 1 is too big.) */
9404 else if (TREE_OVERFLOW (itype
))
9406 error ("overflow in array dimension");
9407 TREE_OVERFLOW (itype
) = 0;
9410 /* Create and return the appropriate index type. */
9411 return build_index_type (itype
);
9414 /* Returns an ARRAY_TYPE for an array with SIZE elements of the
9415 indicated TYPE. If non-NULL, NAME is the NAME of the declaration
9419 create_array_type_for_decl (name
, type
, size
)
9424 tree itype
= NULL_TREE
;
9425 const char* error_msg
;
9427 /* If things have already gone awry, bail now. */
9428 if (type
== error_mark_node
|| size
== error_mark_node
)
9429 return error_mark_node
;
9431 /* Assume that everything will go OK. */
9434 /* There are some types which cannot be array elements. */
9435 switch (TREE_CODE (type
))
9438 error_msg
= "array of void";
9442 error_msg
= "array of functions";
9445 case REFERENCE_TYPE
:
9446 error_msg
= "array of references";
9450 error_msg
= "array of data members";
9454 error_msg
= "array of function members";
9461 /* If something went wrong, issue an error-message and return. */
9465 cp_error ("declaration of `%D' as %s", name
, error_msg
);
9467 cp_error ("creating %s", error_msg
);
9469 return error_mark_node
;
9474 The constant expressions that specify the bounds of the arrays
9475 can be omitted only for the first member of the sequence. */
9476 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9478 cp_error ("declaration of `%D' as multidimensional array must have bounds for all dimensions except the first",
9481 return error_mark_node
;
9484 /* Figure out the index type for the array. */
9486 itype
= compute_array_index_type (name
, size
);
9488 return build_cplus_array_type (type
, itype
);
9491 /* Check that it's OK to declare a function with the indicated TYPE.
9492 SFK indicates the kind of special function (if any) that this
9493 function is. CTYPE is the class of which this function is a
9494 member. OPTYPE is the type given in a conversion operator
9495 declaration. Returns the actual return type of the function; that
9496 may be different than TYPE if an error occurs, or for certain
9497 special functions. */
9500 check_special_function_return_type (sfk
, type
, ctype
, optype
)
9501 special_function_kind sfk
;
9508 case sfk_constructor
:
9510 cp_error ("return type specification for constructor invalid");
9512 /* In the old ABI, we return `this'; in the new ABI we don't
9514 type
= flag_new_abi
? void_type_node
: build_pointer_type (ctype
);
9517 case sfk_destructor
:
9519 cp_error ("return type specification for destructor invalid");
9520 type
= void_type_node
;
9523 case sfk_conversion
:
9524 if (type
&& !same_type_p (type
, optype
))
9525 cp_error ("operator `%T' declared to return `%T'", optype
, type
);
9527 cp_pedwarn ("return type specified for `operator %T'", optype
);
9532 my_friendly_abort (20000408);
9539 /* Given declspecs and a declarator,
9540 determine the name and type of the object declared
9541 and construct a ..._DECL node for it.
9542 (In one case we can return a ..._TYPE node instead.
9543 For invalid input we sometimes return 0.)
9545 DECLSPECS is a chain of tree_list nodes whose value fields
9546 are the storage classes and type specifiers.
9548 DECL_CONTEXT says which syntactic context this declaration is in:
9549 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
9550 FUNCDEF for a function definition. Like NORMAL but a few different
9551 error messages in each case. Return value may be zero meaning
9552 this definition is too screwy to try to parse.
9553 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
9554 handle member functions (which have FIELD context).
9555 Return value may be zero meaning this definition is too screwy to
9557 PARM for a parameter declaration (either within a function prototype
9558 or before a function body). Make a PARM_DECL, or return void_type_node.
9559 CATCHPARM for a parameter declaration before a catch clause.
9560 TYPENAME if for a typename (in a cast or sizeof).
9561 Don't make a DECL node; just return the ..._TYPE node.
9562 FIELD for a struct or union field; make a FIELD_DECL.
9563 BITFIELD for a field with specified width.
9564 INITIALIZED is 1 if the decl has an initializer.
9566 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
9567 normal attributes in TREE_PURPOSE, or NULL_TREE.
9569 In the TYPENAME case, DECLARATOR is really an abstract declarator.
9570 It may also be so in the PARM case, for a prototype where the
9571 argument type is specified but not the name.
9573 This function is where the complicated C meanings of `static'
9574 and `extern' are interpreted.
9576 For C++, if there is any monkey business to do, the function which
9577 calls this one must do it, i.e., prepending instance variables,
9578 renaming overloaded function names, etc.
9580 Note that for this C++, it is an error to define a method within a class
9581 which does not belong to that class.
9583 Except in the case where SCOPE_REFs are implicitly known (such as
9584 methods within a class being redundantly qualified),
9585 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
9586 (class_name::decl_name). The caller must also deal with this.
9588 If a constructor or destructor is seen, and the context is FIELD,
9589 then the type gains the attribute TREE_HAS_x. If such a declaration
9590 is erroneous, NULL_TREE is returned.
9592 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
9593 function, these are the qualifiers to give to the `this' pointer. We
9594 apply TYPE_QUAL_RESTRICT to the this ptr, not the object.
9596 May return void_type_node if the declarator turned out to be a friend.
9597 See grokfield for details. */
9600 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
9603 enum decl_context decl_context
;
9607 RID_BIT_TYPE specbits
;
9610 tree type
= NULL_TREE
;
9616 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
9617 int explicit_int
= 0;
9618 int explicit_char
= 0;
9619 int defaulted_int
= 0;
9620 tree typedef_decl
= NULL_TREE
;
9622 tree typedef_type
= NULL_TREE
;
9623 int funcdef_flag
= 0;
9624 enum tree_code innermost_code
= ERROR_MARK
;
9627 /* See the code below that used this. */
9628 tree decl_machine_attr
= NULL_TREE
;
9630 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
9631 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
9632 tree init
= NULL_TREE
;
9634 /* Keep track of what sort of function is being processed
9635 so that we can warn about default return values, or explicit
9636 return values which do not match prescribed defaults. */
9637 special_function_kind sfk
= sfk_none
;
9639 tree dname
= NULL_TREE
;
9640 tree ctype
= current_class_type
;
9641 tree ctor_return_type
= NULL_TREE
;
9642 enum overload_flags flags
= NO_SPECIAL
;
9643 tree quals
= NULL_TREE
;
9644 tree raises
= NULL_TREE
;
9645 int template_count
= 0;
9646 tree in_namespace
= NULL_TREE
;
9650 RIDBIT_RESET_ALL (specbits
);
9651 if (decl_context
== FUNCDEF
)
9652 funcdef_flag
= 1, decl_context
= NORMAL
;
9653 else if (decl_context
== MEMFUNCDEF
)
9654 funcdef_flag
= -1, decl_context
= FIELD
;
9655 else if (decl_context
== BITFIELD
)
9656 bitfield
= 1, decl_context
= FIELD
;
9658 /* Look inside a declarator for the name being declared
9659 and get it as a string, for an error message. */
9661 tree
*next
= &declarator
;
9665 while (next
&& *next
)
9668 switch (TREE_CODE (decl
))
9671 /* For attributes. */
9672 next
= &TREE_VALUE (decl
);
9677 next
= &TREE_OPERAND (decl
, 0);
9680 case BIT_NOT_EXPR
: /* For C++ destructors! */
9682 tree name
= TREE_OPERAND (decl
, 0);
9683 tree rename
= NULL_TREE
;
9685 my_friendly_assert (flags
== NO_SPECIAL
, 152);
9687 sfk
= sfk_destructor
;
9688 if (TREE_CODE (name
) == TYPE_DECL
)
9689 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
9690 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
9691 if (ctype
== NULL_TREE
)
9693 if (current_class_type
== NULL_TREE
)
9695 error ("destructors must be member functions");
9700 tree t
= constructor_name (current_class_name
);
9707 tree t
= constructor_name (ctype
);
9714 cp_error ("destructor `%T' must match class name `%T'",
9716 TREE_OPERAND (decl
, 0) = rename
;
9722 case ADDR_EXPR
: /* C++ reference declaration */
9727 innermost_code
= TREE_CODE (decl
);
9728 next
= &TREE_OPERAND (decl
, 0);
9732 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
9734 /* This is actually a variable declaration using
9735 constructor syntax. We need to call start_decl and
9736 cp_finish_decl so we can get the variable
9739 tree attributes
, prefix_attributes
;
9741 *next
= TREE_OPERAND (decl
, 0);
9742 init
= CALL_DECLARATOR_PARMS (decl
);
9746 attributes
= TREE_PURPOSE (attrlist
);
9747 prefix_attributes
= TREE_VALUE (attrlist
);
9751 attributes
= NULL_TREE
;
9752 prefix_attributes
= NULL_TREE
;
9755 decl
= start_decl (declarator
, declspecs
, 1,
9756 attributes
, prefix_attributes
);
9757 decl_type_access_control (decl
);
9760 /* Look for __unused__ attribute */
9761 if (TREE_USED (TREE_TYPE (decl
)))
9762 TREE_USED (decl
) = 1;
9763 finish_decl (decl
, init
, NULL_TREE
);
9766 cp_error ("invalid declarator");
9769 innermost_code
= TREE_CODE (decl
);
9770 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
9771 ctype
= current_class_type
;
9773 && TREE_OPERAND (decl
, 0)
9774 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
9775 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
9776 == constructor_name_full (ctype
))
9777 || (DECL_NAME (TREE_OPERAND (decl
, 0))
9778 == constructor_name (ctype
)))))
9779 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9780 next
= &TREE_OPERAND (decl
, 0);
9782 if (ctype
!= NULL_TREE
9783 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
9784 && decl
== constructor_name (ctype
))
9786 sfk
= sfk_constructor
;
9787 ctor_return_type
= ctype
;
9792 case TEMPLATE_ID_EXPR
:
9794 tree fns
= TREE_OPERAND (decl
, 0);
9796 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9797 fns
= TREE_OPERAND (fns
, 0);
9800 if (TREE_CODE (dname
) == COMPONENT_REF
)
9801 dname
= TREE_OPERAND (dname
, 1);
9802 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9804 my_friendly_assert (is_overloaded_fn (dname
),
9806 dname
= DECL_NAME (get_first_fn (dname
));
9811 case IDENTIFIER_NODE
:
9812 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9817 if (C_IS_RESERVED_WORD (dname
))
9819 cp_error ("declarator-id missing; using reserved word `%D'",
9821 name
= IDENTIFIER_POINTER (dname
);
9823 else if (!IDENTIFIER_TYPENAME_P (dname
))
9824 name
= IDENTIFIER_POINTER (dname
);
9827 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9828 flags
= TYPENAME_FLAG
;
9829 ctor_return_type
= TREE_TYPE (dname
);
9830 sfk
= sfk_conversion
;
9831 if (IDENTIFIER_GLOBAL_VALUE (dname
)
9832 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (dname
))
9834 name
= IDENTIFIER_POINTER (dname
);
9836 name
= "<invalid operator>";
9843 /* Perform error checking, and decide on a ctype. */
9844 tree cname
= TREE_OPERAND (decl
, 0);
9845 if (cname
== NULL_TREE
)
9847 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9850 in_namespace
= TREE_OPERAND (decl
, 0);
9851 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9853 else if (! is_aggr_type (cname
, 1))
9854 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9855 /* Must test TREE_OPERAND (decl, 1), in case user gives
9856 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9857 else if (TREE_OPERAND (decl
, 1)
9858 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9860 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9861 || TREE_CODE (cname
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
9863 cp_error ("`%T::%D' is not a valid declarator", cname
,
9864 TREE_OPERAND (decl
, 1));
9865 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9866 cname
, TREE_OPERAND (decl
, 1));
9867 return void_type_node
;
9869 else if (ctype
== NULL_TREE
)
9871 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9872 TREE_OPERAND (decl
, 0) = ctype
;
9875 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9877 cp_error ("type `%T' is not derived from type `%T'",
9879 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9885 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9886 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9887 == constructor_name_full (ctype
))
9888 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9889 == constructor_name (ctype
))))
9890 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9891 next
= &TREE_OPERAND (decl
, 1);
9895 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9896 && constructor_name (ctype
) == decl
)
9898 sfk
= sfk_constructor
;
9899 ctor_return_type
= ctype
;
9901 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9902 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9903 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9904 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9906 sfk
= sfk_destructor
;
9907 ctor_return_type
= ctype
;
9909 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9910 next
= &TREE_OPERAND (decl
, 0);
9921 /* Parse error puts this typespec where
9922 a declarator should go. */
9923 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9924 if (TREE_TYPE (decl
) == current_class_type
)
9925 cp_error (" perhaps you want `%T' for a constructor",
9926 current_class_name
);
9927 dname
= DECL_NAME (decl
);
9928 name
= IDENTIFIER_POINTER (dname
);
9930 /* Avoid giving two errors for this. */
9931 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9933 declspecs
= tree_cons (NULL_TREE
, integer_type_node
, declspecs
);
9939 cp_compiler_error ("`%D' as declarator", decl
);
9940 return 0; /* We used to do a 155 abort here. */
9945 /* A function definition's declarator must have the form of
9946 a function declarator. */
9948 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9951 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9952 && innermost_code
!= CALL_EXPR
9953 && ! (ctype
&& declspecs
== NULL_TREE
))
9955 cp_error ("declaration of `%D' as non-function", dname
);
9956 return void_type_node
;
9959 /* Anything declared one level down from the top level
9960 must be one of the parameters of a function
9961 (because the body is at least two levels down). */
9963 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9964 by not allowing C++ class definitions to specify their parameters
9965 with xdecls (must be spec.d in the parmlist).
9967 Since we now wait to push a class scope until we are sure that
9968 we are in a legitimate method context, we must set oldcname
9969 explicitly (since current_class_name is not yet alive).
9971 We also want to avoid calling this a PARM if it is in a namespace. */
9973 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
9975 struct binding_level
*b
= current_binding_level
;
9976 current_binding_level
= b
->level_chain
;
9977 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9978 decl_context
= PARM
;
9979 current_binding_level
= b
;
9983 name
= decl_context
== PARM
? "parameter" : "type name";
9985 /* Look through the decl specs and record which ones appear.
9986 Some typespecs are defined as built-in typenames.
9987 Others, the ones that are modifiers of other types,
9988 are represented by bits in SPECBITS: set the bits for
9989 the modifiers that appear. Storage class keywords are also in SPECBITS.
9991 If there is a typedef name or a type, store the type in TYPE.
9992 This includes builtin typedefs such as `int'.
9994 Set EXPLICIT_INT if the type is `int' or `char' and did not
9995 come from a user typedef.
9997 Set LONGLONG if `long' is mentioned twice.
9999 For C++, constructors and destructors have their own fast treatment. */
10001 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
10006 /* Certain parse errors slip through. For example,
10007 `int class;' is not caught by the parser. Try
10008 weakly to recover here. */
10009 if (TREE_CODE (spec
) != TREE_LIST
)
10012 id
= TREE_VALUE (spec
);
10014 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
10016 if (id
== ridpointers
[(int) RID_INT
]
10017 || id
== ridpointers
[(int) RID_CHAR
]
10018 || id
== ridpointers
[(int) RID_BOOL
]
10019 || id
== ridpointers
[(int) RID_WCHAR
])
10023 if (id
== ridpointers
[(int) RID_BOOL
])
10024 error ("`bool' is now a keyword");
10026 cp_error ("extraneous `%T' ignored", id
);
10030 if (id
== ridpointers
[(int) RID_INT
])
10032 else if (id
== ridpointers
[(int) RID_CHAR
])
10034 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
10038 /* C++ aggregate types. */
10039 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
10042 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
10044 type
= IDENTIFIER_TYPE_VALUE (id
);
10048 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
10050 if (ridpointers
[i
] == id
)
10052 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
10054 if (pedantic
&& ! in_system_header
&& warn_long_long
)
10055 pedwarn ("ISO C++ does not support `long long'");
10057 error ("`long long long' is too long for GCC");
10061 else if (RIDBIT_SETP (i
, specbits
))
10062 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
10063 RIDBIT_SET (i
, specbits
);
10068 /* C++ aggregate types. */
10069 else if (TREE_CODE (id
) == TYPE_DECL
)
10072 cp_error ("multiple declarations `%T' and `%T'", type
,
10076 type
= TREE_TYPE (id
);
10077 TREE_VALUE (spec
) = type
;
10082 error ("two or more data types in declaration of `%s'", name
);
10083 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
10085 register tree t
= lookup_name (id
, 1);
10086 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
10087 error ("`%s' fails to be a typedef or built in type",
10088 IDENTIFIER_POINTER (id
));
10091 type
= TREE_TYPE (t
);
10093 /* See the code below that used this. */
10094 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
10099 else if (id
!= error_mark_node
)
10100 /* Can't change CLASS nodes into RECORD nodes here! */
10106 typedef_type
= type
;
10108 /* No type at all: default to `int', and set DEFAULTED_INT
10109 because it was not a user-defined typedef. */
10111 if (type
== NULL_TREE
10112 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
10113 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10114 || RIDBIT_SETP (RID_LONG
, specbits
)
10115 || RIDBIT_SETP (RID_SHORT
, specbits
)))
10117 /* These imply 'int'. */
10118 type
= integer_type_node
;
10122 if (sfk
!= sfk_none
)
10123 type
= check_special_function_return_type (sfk
, type
,
10126 else if (type
== NULL_TREE
)
10132 /* We handle `main' specially here, because 'main () { }' is so
10133 common. With no options, it is allowed. With -Wreturn-type,
10134 it is a warning. It is only an error with -pedantic-errors. */
10135 is_main
= (funcdef_flag
10136 && MAIN_NAME_P (dname
)
10137 && ctype
== NULL_TREE
10138 && in_namespace
== NULL_TREE
10139 && current_namespace
== global_namespace
);
10141 if (in_system_header
|| flag_ms_extensions
)
10142 /* Allow it, sigh. */;
10143 else if (pedantic
|| ! is_main
)
10144 cp_pedwarn ("ISO C++ forbids declaration of `%s' with no type",
10146 else if (warn_return_type
)
10147 cp_warning ("ISO C++ forbids declaration of `%s' with no type",
10150 type
= integer_type_node
;
10155 /* Now process the modifiers that were specified
10156 and check for invalid combinations. */
10158 /* Long double is a special combination. */
10160 if (RIDBIT_SETP (RID_LONG
, specbits
)
10161 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
10163 RIDBIT_RESET (RID_LONG
, specbits
);
10164 type
= build_qualified_type (long_double_type_node
,
10165 CP_TYPE_QUALS (type
));
10168 /* Check all other uses of type modifiers. */
10170 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10171 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10172 || RIDBIT_SETP (RID_LONG
, specbits
)
10173 || RIDBIT_SETP (RID_SHORT
, specbits
))
10177 if (TREE_CODE (type
) == REAL_TYPE
)
10178 error ("short, signed or unsigned invalid for `%s'", name
);
10179 else if (TREE_CODE (type
) != INTEGER_TYPE
)
10180 error ("long, short, signed or unsigned invalid for `%s'", name
);
10181 else if (RIDBIT_SETP (RID_LONG
, specbits
)
10182 && RIDBIT_SETP (RID_SHORT
, specbits
))
10183 error ("long and short specified together for `%s'", name
);
10184 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10185 || RIDBIT_SETP (RID_SHORT
, specbits
))
10187 error ("long or short specified with char for `%s'", name
);
10188 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10189 || RIDBIT_SETP (RID_SHORT
, specbits
))
10190 && TREE_CODE (type
) == REAL_TYPE
)
10191 error ("long or short specified with floating type for `%s'", name
);
10192 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10193 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
10194 error ("signed and unsigned given together for `%s'", name
);
10198 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
10200 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
10202 if (flag_pedantic_errors
)
10207 /* Discard the type modifiers if they are invalid. */
10210 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
10211 RIDBIT_RESET (RID_SIGNED
, specbits
);
10212 RIDBIT_RESET (RID_LONG
, specbits
);
10213 RIDBIT_RESET (RID_SHORT
, specbits
);
10218 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
10219 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
10221 error ("complex invalid for `%s'", name
);
10222 RIDBIT_RESET (RID_COMPLEX
, specbits
);
10225 /* Decide whether an integer type is signed or not.
10226 Optionally treat bitfields as signed by default. */
10227 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10230 It is implementation-defined whether a plain (neither
10231 explicitly signed or unsigned) char, short, int, or long
10232 bit-field is signed or unsigned.
10234 Naturally, we extend this to long long as well. Note that
10235 this does not include wchar_t. */
10236 || (bitfield
&& !flag_signed_bitfields
10237 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
10238 /* A typedef for plain `int' without `signed' can be
10239 controlled just like plain `int', but a typedef for
10240 `signed int' cannot be so controlled. */
10242 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
10243 && (TREE_CODE (type
) == INTEGER_TYPE
10244 || TREE_CODE (type
) == CHAR_TYPE
)
10245 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
10248 type
= long_long_unsigned_type_node
;
10249 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10250 type
= long_unsigned_type_node
;
10251 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10252 type
= short_unsigned_type_node
;
10253 else if (type
== char_type_node
)
10254 type
= unsigned_char_type_node
;
10255 else if (typedef_decl
)
10256 type
= unsigned_type (type
);
10258 type
= unsigned_type_node
;
10260 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10261 && type
== char_type_node
)
10262 type
= signed_char_type_node
;
10264 type
= long_long_integer_type_node
;
10265 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10266 type
= long_integer_type_node
;
10267 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10268 type
= short_integer_type_node
;
10270 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
10272 /* If we just have "complex", it is equivalent to
10273 "complex double", but if any modifiers at all are specified it is
10274 the complex form of TYPE. E.g, "complex short" is
10275 "complex short int". */
10277 if (defaulted_int
&& ! longlong
10278 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
10279 || RIDBIT_SETP (RID_SHORT
, specbits
)
10280 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10281 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
10282 type
= complex_double_type_node
;
10283 else if (type
== integer_type_node
)
10284 type
= complex_integer_type_node
;
10285 else if (type
== float_type_node
)
10286 type
= complex_float_type_node
;
10287 else if (type
== double_type_node
)
10288 type
= complex_double_type_node
;
10289 else if (type
== long_double_type_node
)
10290 type
= complex_long_double_type_node
;
10292 type
= build_complex_type (type
);
10295 if (sfk
== sfk_conversion
10296 && (RIDBIT_SETP (RID_CONST
, specbits
)
10297 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
10298 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
10299 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
10302 /* Set CONSTP if this declaration is `const', whether by
10303 explicit specification or via a typedef.
10304 Likewise for VOLATILEP. */
10306 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
10308 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
10310 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
10311 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10312 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10313 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10314 type
= cp_build_qualified_type (type
, type_quals
);
10316 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
10317 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
10318 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
10319 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
10320 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
10322 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10323 staticp
= 1 + (decl_context
== FIELD
);
10325 if (virtualp
&& staticp
== 2)
10327 cp_error ("member `%D' cannot be declared both virtual and static",
10331 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
10332 RIDBIT_RESET (RID_FRIEND
, specbits
);
10334 /* Warn if two storage classes are given. Default to `auto'. */
10336 if (RIDBIT_ANY_SET (specbits
))
10338 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
10339 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
10340 if (decl_context
== PARM
&& nclasses
> 0)
10341 error ("storage class specifiers invalid in parameter declarations");
10342 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10344 if (decl_context
== PARM
)
10345 error ("typedef declaration invalid in parameter declaration");
10348 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
10349 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
10352 /* Give error if `virtual' is used outside of class declaration. */
10354 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
10356 error ("virtual outside class declaration");
10360 /* Static anonymous unions are dealt with here. */
10361 if (staticp
&& decl_context
== TYPENAME
10362 && TREE_CODE (declspecs
) == TREE_LIST
10363 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
10364 decl_context
= FIELD
;
10366 /* Warn about storage classes that are invalid for certain
10367 kinds of declarations (parameters, typenames, etc.). */
10370 error ("multiple storage classes in declaration of `%s'", name
);
10371 else if (decl_context
!= NORMAL
&& nclasses
> 0)
10373 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
10374 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
10375 || RIDBIT_SETP (RID_AUTO
, specbits
)))
10377 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10379 else if (decl_context
== FIELD
10380 /* C++ allows static class elements */
10381 && RIDBIT_SETP (RID_STATIC
, specbits
))
10382 /* C++ also allows inlines and signed and unsigned elements,
10383 but in those cases we don't come in here. */
10387 if (decl_context
== FIELD
)
10389 tree tmp
= NULL_TREE
;
10390 register int op
= 0;
10394 /* Avoid trying to get an operand off an identifier node. */
10395 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10398 tmp
= TREE_OPERAND (declarator
, 0);
10399 op
= IDENTIFIER_OPNAME_P (tmp
);
10400 if (IDENTIFIER_TYPENAME_P (tmp
))
10402 if (IDENTIFIER_GLOBAL_VALUE (tmp
)
10403 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (tmp
))
10405 name
= IDENTIFIER_POINTER (tmp
);
10407 name
= "<invalid operator>";
10410 error ("storage class specified for %s `%s'",
10411 op
? "member operator" : "field",
10416 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10417 error ("storage class specified for parameter `%s'", name
);
10419 error ("storage class specified for typename");
10421 RIDBIT_RESET (RID_REGISTER
, specbits
);
10422 RIDBIT_RESET (RID_AUTO
, specbits
);
10423 RIDBIT_RESET (RID_EXTERN
, specbits
);
10426 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
10428 if (toplevel_bindings_p ())
10430 /* It's common practice (and completely valid) to have a const
10431 be initialized and declared extern. */
10432 if (!(type_quals
& TYPE_QUAL_CONST
))
10433 warning ("`%s' initialized and declared `extern'", name
);
10436 error ("`%s' has both `extern' and initializer", name
);
10438 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
10439 && ! toplevel_bindings_p ())
10440 error ("nested function `%s' declared `extern'", name
);
10441 else if (toplevel_bindings_p ())
10443 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10444 error ("top-level declaration of `%s' specifies `auto'", name
);
10447 if (nclasses
> 0 && friendp
)
10448 error ("storage class specifiers invalid in friend function declarations");
10450 /* Now figure out the structure of the declarator proper.
10451 Descend through it, creating more complex types, until we reach
10452 the declared identifier (or NULL_TREE, in an absolute declarator). */
10454 inner_attrs
= NULL_TREE
;
10457 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
10458 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
10460 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
10461 an INDIRECT_REF (for *...),
10462 a CALL_EXPR (for ...(...)),
10463 an identifier (for the name being declared)
10464 or a null pointer (for the place in an absolute declarator
10465 where the name was omitted).
10466 For the last two cases, we have just exited the loop.
10468 For C++ it could also be
10469 a SCOPE_REF (for class :: ...). In this case, we have converted
10470 sensible names to types, and those are the values we use to
10471 qualify the member name.
10472 an ADDR_EXPR (for &...),
10473 a BIT_NOT_EXPR (for destructors)
10475 At this point, TYPE is the type of elements of an array,
10476 or for a function to return, or for a pointer to point to.
10477 After this sequence of ifs, TYPE is the type of the
10478 array or function or pointer, and DECLARATOR has had its
10479 outermost layer removed. */
10481 if (type
== error_mark_node
)
10483 if (TREE_CODE (declarator
) == SCOPE_REF
)
10484 declarator
= TREE_OPERAND (declarator
, 1);
10486 declarator
= TREE_OPERAND (declarator
, 0);
10489 if (quals
!= NULL_TREE
10490 && (declarator
== NULL_TREE
10491 || TREE_CODE (declarator
) != SCOPE_REF
))
10493 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
10494 ctype
= TYPE_METHOD_BASETYPE (type
);
10495 if (ctype
!= NULL_TREE
)
10497 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
10498 grok_method_quals (ctype
, dummy
, quals
);
10499 type
= TREE_TYPE (dummy
);
10500 ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
)));
10505 /* See the comment for the TREE_LIST case, below. */
10508 else if (inner_attrs
)
10510 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10511 inner_attrs
= NULL_TREE
;
10514 switch (TREE_CODE (declarator
))
10518 /* We encode a declarator with embedded attributes using
10519 a TREE_LIST. The attributes apply to the declarator
10520 directly inside them, so we have to skip an iteration
10521 before applying them to the type. If the declarator just
10522 inside is the declarator-id, we apply the attrs to the
10524 inner_attrs
= TREE_PURPOSE (declarator
);
10526 declarator
= TREE_VALUE (declarator
);
10532 register tree size
;
10534 size
= TREE_OPERAND (declarator
, 1);
10536 /* VC++ spells a zero-sized array with []. */
10537 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
10538 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10539 size
= integer_zero_node
;
10541 declarator
= TREE_OPERAND (declarator
, 0);
10543 type
= create_array_type_for_decl (dname
, type
, size
);
10545 /* VLAs never work as fields. */
10546 if (decl_context
== FIELD
&& !processing_template_decl
10547 && TREE_CODE (type
) == ARRAY_TYPE
10548 && TYPE_DOMAIN (type
) != NULL_TREE
10549 && !TREE_CONSTANT (TYPE_MAX_VALUE (TYPE_DOMAIN (type
))))
10551 cp_error ("size of member `%D' is not constant", dname
);
10552 /* Proceed with arbitrary constant size, so that offset
10553 computations don't get confused. */
10554 type
= create_array_type_for_decl (dname
, TREE_TYPE (type
),
10566 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
10567 tree inner_decl
= TREE_OPERAND (declarator
, 0);
10569 /* Declaring a function type.
10570 Make sure we have a valid type for the function to return. */
10572 /* We now know that the TYPE_QUALS don't apply to the
10573 decl, but to its return type. */
10574 type_quals
= TYPE_UNQUALIFIED
;
10576 /* Warn about some types functions can't return. */
10578 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10580 error ("`%s' declared as function returning a function", name
);
10581 type
= integer_type_node
;
10583 if (TREE_CODE (type
) == ARRAY_TYPE
)
10585 error ("`%s' declared as function returning an array", name
);
10586 type
= integer_type_node
;
10589 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
10590 inner_decl
= TREE_OPERAND (inner_decl
, 1);
10592 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
10593 inner_decl
= dname
;
10595 /* Pick up type qualifiers which should be applied to `this'. */
10596 quals
= CALL_DECLARATOR_QUALS (declarator
);
10598 /* Pick up the exception specifications. */
10599 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
10601 /* Say it's a definition only for the CALL_EXPR
10602 closest to the identifier. */
10605 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
10606 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
10607 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
10609 if (ctype
== NULL_TREE
10610 && decl_context
== FIELD
10612 && (friendp
== 0 || dname
== current_class_name
))
10613 ctype
= current_class_type
;
10615 if (ctype
&& sfk
== sfk_conversion
)
10616 TYPE_HAS_CONVERSION (ctype
) = 1;
10617 if (ctype
&& constructor_name (ctype
) == dname
)
10619 /* We are within a class's scope. If our declarator name
10620 is the same as the class name, and we are defining
10621 a function, then it is a constructor/destructor, and
10622 therefore returns a void type. */
10624 if (flags
== DTOR_FLAG
)
10626 /* ISO C++ 12.4/2. A destructor may not be
10627 declared const or volatile. A destructor may
10630 error ("destructor cannot be static member function");
10633 cp_error ("destructors may not be `%s'",
10634 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10637 if (decl_context
== FIELD
)
10639 if (! member_function_or_else (ctype
,
10640 current_class_type
,
10642 return void_type_node
;
10645 else /* It's a constructor. */
10647 if (explicitp
== 1)
10649 /* ISO C++ 12.1. A constructor may not be
10650 declared const or volatile. A constructor may
10651 not be virtual. A constructor may not be
10654 error ("constructor cannot be static member function");
10657 pedwarn ("constructors cannot be declared virtual");
10662 cp_error ("constructors may not be `%s'",
10663 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10667 RID_BIT_TYPE tmp_bits
;
10668 bcopy ((void*)&specbits
, (void*)&tmp_bits
, sizeof (RID_BIT_TYPE
));
10669 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10670 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10671 if (RIDBIT_ANY_SET (tmp_bits
))
10672 error ("return value type specifier for constructor ignored");
10674 if (decl_context
== FIELD
)
10676 if (! member_function_or_else (ctype
,
10677 current_class_type
,
10679 return void_type_node
;
10680 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10681 if (sfk
!= sfk_constructor
)
10685 if (decl_context
== FIELD
)
10691 error ("can't initialize friend function `%s'", name
);
10694 /* Cannot be both friend and virtual. */
10695 error ("virtual functions cannot be friends");
10696 RIDBIT_RESET (RID_FRIEND
, specbits
);
10699 if (decl_context
== NORMAL
)
10700 error ("friend declaration not in class definition");
10701 if (current_function_decl
&& funcdef_flag
)
10702 cp_error ("can't define friend function `%s' in a local class definition",
10706 /* Construct the function type and go to the next
10707 inner layer of declarator. */
10709 declarator
= TREE_OPERAND (declarator
, 0);
10711 /* FIXME: This is where default args should be fully
10714 arg_types
= grokparms (inner_parms
, funcdecl_p
? funcdef_flag
: 0);
10716 if (declarator
&& flags
== DTOR_FLAG
)
10718 /* A destructor declared in the body of a class will
10719 be represented as a BIT_NOT_EXPR. But, we just
10720 want the underlying IDENTIFIER. */
10721 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10722 declarator
= TREE_OPERAND (declarator
, 0);
10724 if (arg_types
!= void_list_node
)
10726 cp_error ("destructors may not have parameters");
10727 arg_types
= void_list_node
;
10728 last_function_parms
= NULL_TREE
;
10732 /* ANSI says that `const int foo ();'
10733 does not make the function foo const. */
10734 type
= build_function_type (type
, arg_types
);
10738 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10739 if (TREE_PURPOSE (t
)
10740 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10742 add_defarg_fn (type
);
10751 /* Filter out pointers-to-references and references-to-references.
10752 We can get these if a TYPE_DECL is used. */
10754 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10756 error ("cannot declare %s to references",
10757 TREE_CODE (declarator
) == ADDR_EXPR
10758 ? "references" : "pointers");
10759 declarator
= TREE_OPERAND (declarator
, 0);
10763 if (TREE_CODE (type
) == OFFSET_TYPE
10764 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10765 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10767 cp_error ("cannot declare pointer to `%#T' member",
10769 type
= TREE_TYPE (type
);
10772 /* Merge any constancy or volatility into the target type
10773 for the pointer. */
10775 /* We now know that the TYPE_QUALS don't apply to the decl,
10776 but to the target of the pointer. */
10777 type_quals
= TYPE_UNQUALIFIED
;
10779 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10781 if (TREE_CODE (type
) == VOID_TYPE
)
10782 error ("invalid type: `void &'");
10784 type
= build_reference_type (type
);
10786 else if (TREE_CODE (type
) == METHOD_TYPE
)
10787 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10789 type
= build_pointer_type (type
);
10791 /* Process a list of type modifier keywords (such as
10792 const or volatile) that were given inside the `*' or `&'. */
10794 if (TREE_TYPE (declarator
))
10796 register tree typemodlist
;
10802 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10803 typemodlist
= TREE_CHAIN (typemodlist
))
10805 tree qualifier
= TREE_VALUE (typemodlist
);
10807 if (qualifier
== ridpointers
[(int) RID_CONST
])
10809 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10811 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10816 error ("invalid type modifier within pointer declarator");
10820 pedwarn ("duplicate `const'");
10822 pedwarn ("duplicate `volatile'");
10824 pedwarn ("duplicate `restrict'");
10826 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10827 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10828 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10829 if (TREE_CODE (declarator
) == ADDR_EXPR
10830 && (constp
|| volatilep
))
10833 pedwarn ("discarding `const' applied to a reference");
10835 pedwarn ("discarding `volatile' applied to a reference");
10836 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10838 type
= cp_build_qualified_type (type
, type_quals
);
10840 declarator
= TREE_OPERAND (declarator
, 0);
10846 /* We have converted type names to NULL_TREE if the
10847 name was bogus, or to a _TYPE node, if not.
10849 The variable CTYPE holds the type we will ultimately
10850 resolve to. The code here just needs to build
10851 up appropriate member types. */
10852 tree sname
= TREE_OPERAND (declarator
, 1);
10855 /* Destructors can have their visibilities changed as well. */
10856 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10857 sname
= TREE_OPERAND (sname
, 0);
10859 if (TREE_COMPLEXITY (declarator
) == 0)
10860 /* This needs to be here, in case we are called
10861 multiple times. */ ;
10862 else if (TREE_COMPLEXITY (declarator
) == -1)
10863 /* Namespace member. */
10864 pop_decl_namespace ();
10865 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10866 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10867 else if (! IS_AGGR_TYPE_CODE
10868 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10870 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10872 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10873 that refer to ctype. They couldn't be resolved earlier
10874 because we hadn't pushed into the class yet.
10875 Example: resolve 'B<T>::type' in
10876 'B<typename B<T>::type> B<T>::f () { }'. */
10877 if (current_template_parms
10878 && uses_template_parms (type
)
10879 && uses_template_parms (current_class_type
))
10881 tree args
= current_template_args ();
10882 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10885 /* This pop_nested_class corresponds to the
10886 push_nested_class used to push into class scope for
10887 parsing the argument list of a function decl, in
10889 pop_nested_class ();
10890 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10893 my_friendly_abort (16);
10895 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10897 /* We had a reference to a global decl, or
10898 perhaps we were given a non-aggregate typedef,
10899 in which case we cleared this out, and should just
10900 keep going as though it wasn't there. */
10901 declarator
= sname
;
10904 ctype
= TREE_OPERAND (declarator
, 0);
10907 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10909 /* You're supposed to have one `template <...>'
10910 for every template class, but you don't need one
10911 for a full specialization. For example:
10913 template <class T> struct S{};
10914 template <> struct S<int> { void f(); };
10915 void S<int>::f () {}
10917 is correct; there shouldn't be a `template <>' for
10918 the definition of `S<int>::f'. */
10919 if (CLASSTYPE_TEMPLATE_INFO (t
)
10920 && (CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
10921 || uses_template_parms (CLASSTYPE_TI_ARGS (t
))))
10922 template_count
+= 1;
10924 t
= TYPE_MAIN_DECL (t
);
10925 if (DECL_LANG_SPECIFIC (t
))
10926 t
= DECL_CONTEXT (t
);
10931 if (sname
== NULL_TREE
)
10934 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10936 /* This is the `standard' use of the scoping operator:
10937 basetype :: member . */
10939 if (ctype
== current_class_type
)
10945 Is this ill-formed? */
10948 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10951 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10953 if (current_class_type
== NULL_TREE
10955 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10956 TYPE_ARG_TYPES (type
));
10959 cp_error ("cannot declare member function `%T::%s' within `%T'",
10960 ctype
, name
, current_class_type
);
10961 return void_type_node
;
10964 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10965 || COMPLETE_TYPE_P (complete_type (ctype
)))
10967 /* Have to move this code elsewhere in this function.
10968 this code is used for i.e., typedef int A::M; M *pm;
10970 It is? How? jason 10/2/94 */
10972 if (current_class_type
)
10974 cp_error ("cannot declare member `%T::%s' within `%T'",
10975 ctype
, name
, current_class_type
);
10976 return void_type_node
;
10978 type
= build_offset_type (ctype
, type
);
10980 else if (uses_template_parms (ctype
))
10982 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10984 = build_cplus_method_type (ctype
, TREE_TYPE (type
),
10985 TYPE_ARG_TYPES (type
));
10989 cp_error ("structure `%T' not yet defined", ctype
);
10990 return error_mark_node
;
10993 declarator
= sname
;
10995 else if (TREE_CODE (sname
) == SCOPE_REF
)
10996 my_friendly_abort (17);
11000 declarator
= TREE_OPERAND (declarator
, 1);
11001 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
11002 /* In this case, we will deal with it later. */
11006 if (TREE_CODE (type
) == FUNCTION_TYPE
)
11007 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11008 TYPE_ARG_TYPES (type
));
11010 type
= build_offset_type (ctype
, type
);
11017 declarator
= TREE_OPERAND (declarator
, 0);
11022 case ENUMERAL_TYPE
:
11023 declarator
= NULL_TREE
;
11027 declarator
= NULL_TREE
;
11031 my_friendly_abort (158);
11035 /* See the comment for the TREE_LIST case, above. */
11038 if (! ignore_attrs
)
11039 decl_attributes (type
, inner_attrs
, NULL_TREE
);
11041 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
11043 attrlist
= build_decl_list (NULL_TREE
, inner_attrs
);
11046 /* Now TYPE has the actual type. */
11048 if (explicitp
== 1 || (explicitp
&& friendp
))
11050 /* [dcl.fct.spec] The explicit specifier shall only be used in
11051 declarations of constructors within a class definition. */
11052 error ("only declarations of constructors can be `explicit'");
11056 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11058 if (current_class_name
== NULL_TREE
|| decl_context
== PARM
|| friendp
)
11060 error ("non-member `%s' cannot be declared `mutable'", name
);
11061 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11063 else if (decl_context
== TYPENAME
|| RIDBIT_SETP (RID_TYPEDEF
, specbits
))
11065 error ("non-object member `%s' cannot be declared `mutable'", name
);
11066 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11068 else if (TREE_CODE (type
) == FUNCTION_TYPE
11069 || TREE_CODE (type
) == METHOD_TYPE
)
11071 error ("function `%s' cannot be declared `mutable'", name
);
11072 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11076 error ("static `%s' cannot be declared `mutable'", name
);
11077 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11079 else if (type_quals
& TYPE_QUAL_CONST
)
11081 error ("const `%s' cannot be declared `mutable'", name
);
11082 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11086 if (declarator
== NULL_TREE
11087 || TREE_CODE (declarator
) == IDENTIFIER_NODE
11088 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
11089 && (TREE_CODE (type
) == FUNCTION_TYPE
11090 || TREE_CODE (type
) == METHOD_TYPE
)))
11092 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11094 cp_error ("template-id `%D' used as a declarator", declarator
);
11095 declarator
= dname
;
11098 /* Unexpected declarator format. */
11099 my_friendly_abort (990210);
11101 /* If this is declaring a typedef name, return a TYPE_DECL. */
11103 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
11107 /* Note that the grammar rejects storage classes
11108 in typenames, fields or parameters. */
11109 if (current_lang_name
== lang_name_java
)
11110 TYPE_FOR_JAVA (type
) = 1;
11112 if (decl_context
== FIELD
)
11114 if (declarator
== constructor_name (current_class_type
))
11115 cp_pedwarn ("ISO C++ forbids nested type `%D' with same name as enclosing class",
11117 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
11120 decl
= build_decl (TYPE_DECL
, declarator
, type
);
11122 /* If the user declares "typedef struct {...} foo" then the
11123 struct will have an anonymous name. Fill that name in now.
11124 Nothing can refer to it, so nothing needs know about the name
11126 if (type
!= error_mark_node
11128 && TYPE_NAME (type
)
11129 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
11130 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
11131 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
11133 tree oldname
= TYPE_NAME (type
);
11136 /* Replace the anonymous name with the real name everywhere. */
11137 lookup_tag_reverse (type
, declarator
);
11138 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
11139 if (TYPE_NAME (t
) == oldname
)
11140 TYPE_NAME (t
) = decl
;
11142 if (TYPE_LANG_SPECIFIC (type
))
11143 TYPE_WAS_ANONYMOUS (type
) = 1;
11145 /* If this is a typedef within a template class, the nested
11146 type is a (non-primary) template. The name for the
11147 template needs updating as well. */
11148 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
11149 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
11150 = TYPE_IDENTIFIER (type
);
11153 DECL_ASSEMBLER_NAME (decl
) = mangle_type (type
);
11156 /* XXX Temporarily set the scope.
11157 When returning, start_decl expects it as NULL_TREE,
11158 and will then then set it using pushdecl. */
11159 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
11160 if (current_class_type
)
11161 DECL_CONTEXT (decl
) = current_class_type
;
11163 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
11165 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
11166 DECL_ASSEMBLER_NAME (decl
)
11167 = get_identifier (build_overload_name (type
, 1, 1));
11168 DECL_CONTEXT (decl
) = NULL_TREE
;
11171 /* FIXME remangle member functions; member functions of a
11172 type with external linkage have external linkage. */
11175 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11177 cp_error_at ("typedef name may not be class-qualified", decl
);
11182 if (ctype
== NULL_TREE
)
11184 if (TREE_CODE (type
) != METHOD_TYPE
)
11185 cp_error_at ("invalid type qualifier for non-member function type", decl
);
11187 ctype
= TYPE_METHOD_BASETYPE (type
);
11189 if (ctype
!= NULL_TREE
)
11190 grok_method_quals (ctype
, decl
, quals
);
11193 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
11194 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
11195 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
11197 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
11198 inlinep
, friendp
, raises
!= NULL_TREE
);
11201 error ("typedef declaration includes an initializer");
11206 /* Detect the case of an array type of unspecified size
11207 which came, as such, direct from a typedef name.
11208 We must copy the type, so that each identifier gets
11209 a distinct type, so that each identifier's size can be
11210 controlled separately by its own initializer. */
11212 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
11213 && TYPE_DOMAIN (type
) == NULL_TREE
)
11215 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
11218 /* If this is a type name (such as, in a cast or sizeof),
11219 compute the type and return it now. */
11221 if (decl_context
== TYPENAME
)
11223 /* Note that the grammar rejects storage classes
11224 in typenames, fields or parameters. */
11225 if (type_quals
!= TYPE_UNQUALIFIED
)
11226 type_quals
= TYPE_UNQUALIFIED
;
11228 /* Special case: "friend class foo" looks like a TYPENAME context. */
11231 if (type_quals
!= TYPE_UNQUALIFIED
)
11233 cp_error ("type qualifiers specified for friend class declaration");
11234 type_quals
= TYPE_UNQUALIFIED
;
11238 cp_error ("`inline' specified for friend class declaration");
11241 if (!current_aggr
&& TREE_CODE (type
) != TYPENAME_TYPE
)
11243 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
11244 cp_error ("template parameters cannot be friends");
11246 cp_error ("friend declaration requires `%#T'", type
);
11249 /* Only try to do this stuff if we didn't already give up. */
11250 if (type
!= integer_type_node
)
11252 /* A friendly class? */
11253 if (current_class_type
)
11254 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
11256 cp_error ("trying to make class `%T' a friend of global scope",
11258 type
= void_type_node
;
11263 if (ctype
== NULL_TREE
)
11265 if (TREE_CODE (type
) != METHOD_TYPE
)
11266 cp_error ("invalid qualifiers on non-member function type");
11268 ctype
= TYPE_METHOD_BASETYPE (type
);
11272 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
11273 grok_method_quals (ctype
, dummy
, quals
);
11274 type
= TREE_TYPE (dummy
);
11280 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
11281 && decl_context
!= CATCHPARM
11282 && TREE_CODE (type
) != UNION_TYPE
11285 cp_error ("abstract declarator `%T' used as declaration", type
);
11286 declarator
= make_anon_name ();
11289 /* `void' at top level (not within pointer)
11290 is allowed only in typedefs or type names.
11291 We don't complain about parms either, but that is because
11292 a better error message can be made later. */
11294 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
11297 error ("unnamed variable or field declared void");
11298 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
11300 if (IDENTIFIER_OPNAME_P (declarator
))
11301 my_friendly_abort (356);
11303 error ("variable or field `%s' declared void", name
);
11306 error ("variable or field declared void");
11307 type
= integer_type_node
;
11310 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
11311 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
11313 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
11315 if (ctype
|| in_namespace
)
11316 error ("cannot use `::' in parameter declaration");
11318 /* A parameter declared as an array of T is really a pointer to T.
11319 One declared as a function is really a pointer to a function.
11320 One declared as a member is really a pointer to member. */
11322 if (TREE_CODE (type
) == ARRAY_TYPE
)
11324 /* Transfer const-ness of array into that of type pointed to. */
11325 type
= build_pointer_type (TREE_TYPE (type
));
11326 type_quals
= TYPE_UNQUALIFIED
;
11328 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11329 type
= build_pointer_type (type
);
11330 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11331 type
= build_pointer_type (type
);
11332 else if (TREE_CODE (type
) == VOID_TYPE
&& declarator
)
11334 error ("declaration of `%s' as void", name
);
11340 register tree decl
;
11342 if (decl_context
== PARM
)
11344 decl
= build_decl (PARM_DECL
, declarator
, type
);
11346 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
11347 inlinep
, friendp
, raises
!= NULL_TREE
);
11349 /* Compute the type actually passed in the parmlist,
11350 for the case where there is no prototype.
11351 (For example, shorts and chars are passed as ints.)
11352 When there is a prototype, this is overridden later. */
11354 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
11356 else if (decl_context
== FIELD
)
11358 if (type
== error_mark_node
)
11360 /* Happens when declaring arrays of sizes which
11361 are error_mark_node, for example. */
11364 else if (in_namespace
&& !friendp
)
11366 /* Something like struct S { int N::j; }; */
11367 cp_error ("invalid use of `::'");
11370 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11373 tree function_context
;
11375 /* We catch the others as conflicts with the builtin
11377 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
11379 cp_error ("function `%D' cannot be declared friend",
11386 if (ctype
== NULL_TREE
)
11387 ctype
= current_class_type
;
11389 if (ctype
== NULL_TREE
)
11391 cp_error ("can't make `%D' into a method -- not in a class",
11393 return void_type_node
;
11396 /* ``A union may [ ... ] not [ have ] virtual functions.''
11398 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
11400 cp_error ("function `%D' declared virtual inside a union",
11402 return void_type_node
;
11405 if (declarator
== ansi_opname (NEW_EXPR
)
11406 || declarator
== ansi_opname (VEC_NEW_EXPR
)
11407 || declarator
== ansi_opname (DELETE_EXPR
)
11408 || declarator
== ansi_opname (VEC_DELETE_EXPR
))
11412 cp_error ("`%D' cannot be declared virtual, since it is always static",
11417 else if (staticp
< 2)
11418 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11419 TYPE_ARG_TYPES (type
));
11422 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
11423 function_context
= (ctype
!= NULL_TREE
) ?
11424 decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
11425 publicp
= (! friendp
|| ! staticp
)
11426 && function_context
== NULL_TREE
;
11427 decl
= grokfndecl (ctype
, type
,
11428 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
11429 ? declarator
: dname
,
11431 virtualp
, flags
, quals
, raises
,
11432 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
11433 funcdef_flag
, template_count
, in_namespace
);
11434 if (decl
== NULL_TREE
)
11437 /* This clobbers the attrs stored in `decl' from `attrlist'. */
11438 /* The decl and setting of decl_machine_attr is also turned off. */
11439 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
11442 /* [class.conv.ctor]
11444 A constructor declared without the function-specifier
11445 explicit that can be called with a single parameter
11446 specifies a conversion from the type of its first
11447 parameter to the type of its class. Such a constructor
11448 is called a converting constructor. */
11449 if (explicitp
== 2)
11450 DECL_NONCONVERTING_P (decl
) = 1;
11451 else if (DECL_CONSTRUCTOR_P (decl
))
11453 /* The constructor can be called with exactly one
11454 parameter if there is at least one parameter, and
11455 any subsequent parameters have default arguments.
11456 We don't look at the first parameter, which is
11457 really just the `this' parameter for the new
11460 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
11462 /* Skip the `in_chrg' argument too, if present. */
11463 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
11464 arg_types
= TREE_CHAIN (arg_types
);
11466 if (arg_types
== void_list_node
11468 && TREE_CHAIN (arg_types
)
11469 && TREE_CHAIN (arg_types
) != void_list_node
11470 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
11471 DECL_NONCONVERTING_P (decl
) = 1;
11474 else if (TREE_CODE (type
) == METHOD_TYPE
)
11476 /* We only get here for friend declarations of
11477 members of other classes. */
11478 /* All method decls are public, so tell grokfndecl to set
11479 TREE_PUBLIC, also. */
11480 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
11481 virtualp
, flags
, quals
, raises
,
11482 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
11483 template_count
, in_namespace
);
11484 if (decl
== NULL_TREE
)
11487 else if (!staticp
&& ! processing_template_decl
11488 && !COMPLETE_TYPE_P (complete_type (type
))
11489 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
11492 cp_error ("field `%D' has incomplete type", declarator
);
11494 cp_error ("name `%T' has incomplete type", type
);
11496 /* If we're instantiating a template, tell them which
11497 instantiation made the field's type be incomplete. */
11498 if (current_class_type
11499 && TYPE_NAME (current_class_type
)
11500 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
11501 && declspecs
&& TREE_VALUE (declspecs
)
11502 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
11503 cp_error (" in instantiation of template `%T'",
11504 current_class_type
);
11506 type
= error_mark_node
;
11513 error ("`%s' is neither function nor member function; cannot be declared friend",
11514 IDENTIFIER_POINTER (declarator
));
11522 /* Friends are treated specially. */
11523 if (ctype
== current_class_type
)
11524 warning ("member functions are implicitly friends of their class");
11527 tree t
= NULL_TREE
;
11528 if (decl
&& DECL_NAME (decl
))
11530 if (template_class_depth (current_class_type
) == 0)
11533 = check_explicit_specialization
11535 template_count
, 2 * (funcdef_flag
!= 0) + 4);
11536 if (decl
== error_mark_node
)
11537 return error_mark_node
;
11540 t
= do_friend (ctype
, declarator
, decl
,
11541 last_function_parms
, attrlist
, flags
, quals
,
11544 if (t
&& funcdef_flag
)
11547 return void_type_node
;
11551 /* Structure field. It may not be a function, except for C++ */
11553 if (decl
== NULL_TREE
)
11559 /* An attempt is being made to initialize a non-static
11560 member. But, from [class.mem]:
11562 4 A member-declarator can contain a
11563 constant-initializer only if it declares a static
11564 member (_class.static_) of integral or enumeration
11565 type, see _class.static.data_.
11567 This used to be relatively common practice, but
11568 the rest of the compiler does not correctly
11569 handle the initialization unless the member is
11570 static so we make it static below. */
11571 cp_pedwarn ("ISO C++ forbids initialization of member `%D'",
11573 cp_pedwarn ("making `%D' static", declarator
);
11577 if (uses_template_parms (type
))
11578 /* We'll check at instantiation time. */
11580 else if (check_static_variable_definition (declarator
,
11582 /* If we just return the declaration, crashes
11583 will sometimes occur. We therefore return
11584 void_type_node, as if this was a friend
11585 declaration, to cause callers to completely
11586 ignore this declaration. */
11587 return void_type_node
;
11590 /* 9.2p13 [class.mem] */
11591 if (declarator
== constructor_name (current_class_type
)
11592 /* The standard does not allow non-static data members
11593 here either, but we agreed at the 10/99 meeting
11594 to change that in TC 1 so that they are allowed in
11595 classes with no user-defined constructors. */
11597 cp_pedwarn ("ISO C++ forbids static data member `%D' with same name as enclosing class",
11602 /* C++ allows static class members. All other work
11603 for this is done by grokfield. */
11604 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
11605 TREE_STATIC (decl
) = 1;
11606 /* In class context, 'static' means public access. */
11607 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
11611 decl
= build_decl (FIELD_DECL
, declarator
, type
);
11612 DECL_NONADDRESSABLE_P (decl
) = bitfield
;
11613 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11615 DECL_MUTABLE_P (decl
) = 1;
11616 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11620 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
11621 inlinep
, friendp
, raises
!= NULL_TREE
);
11624 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11626 tree original_name
;
11632 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11633 original_name
= dname
;
11635 original_name
= declarator
;
11637 if (RIDBIT_SETP (RID_AUTO
, specbits
))
11638 error ("storage class `auto' invalid for function `%s'", name
);
11639 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11640 error ("storage class `register' invalid for function `%s'", name
);
11642 /* Function declaration not at top level.
11643 Storage classes other than `extern' are not allowed
11644 and `extern' makes no difference. */
11645 if (! toplevel_bindings_p ()
11646 && (RIDBIT_SETP (RID_STATIC
, specbits
)
11647 || RIDBIT_SETP (RID_INLINE
, specbits
))
11650 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11651 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
11653 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
11656 if (ctype
== NULL_TREE
)
11660 error ("virtual non-class function `%s'", name
);
11664 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
11665 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11666 TYPE_ARG_TYPES (type
));
11668 /* Record presence of `static'. */
11669 publicp
= (ctype
!= NULL_TREE
11670 || RIDBIT_SETP (RID_EXTERN
, specbits
)
11671 || !RIDBIT_SETP (RID_STATIC
, specbits
));
11673 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
11674 virtualp
, flags
, quals
, raises
,
11676 publicp
, inlinep
, funcdef_flag
,
11677 template_count
, in_namespace
);
11678 if (decl
== NULL_TREE
)
11683 int illegal_static
= 0;
11685 /* Don't allow a static member function in a class, and forbid
11686 declaring main to be static. */
11687 if (TREE_CODE (type
) == METHOD_TYPE
)
11689 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11690 illegal_static
= 1;
11692 else if (current_function_decl
)
11694 /* FIXME need arm citation */
11695 error ("cannot declare static function inside another function");
11696 illegal_static
= 1;
11699 if (illegal_static
)
11702 RIDBIT_RESET (RID_STATIC
, specbits
);
11708 /* It's a variable. */
11710 /* An uninitialized decl with `extern' is a reference. */
11711 decl
= grokvardecl (type
, declarator
, &specbits
,
11713 (type_quals
& TYPE_QUAL_CONST
) != 0,
11715 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11716 inlinep
, friendp
, raises
!= NULL_TREE
);
11720 DECL_CONTEXT (decl
) = ctype
;
11723 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11725 RIDBIT_RESET (RID_STATIC
, specbits
);
11727 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11729 cp_error ("static member `%D' declared `register'", decl
);
11730 RIDBIT_RESET (RID_REGISTER
, specbits
);
11732 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11734 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11736 RIDBIT_RESET (RID_EXTERN
, specbits
);
11741 my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE
, specbits
), 19990927);
11743 /* Record `register' declaration for warnings on &
11744 and in case doing stupid register allocation. */
11746 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11747 DECL_REGISTER (decl
) = 1;
11749 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11750 DECL_THIS_EXTERN (decl
) = 1;
11752 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11753 DECL_THIS_STATIC (decl
) = 1;
11755 /* Record constancy and volatility. There's no need to do this
11756 when processing a template; we'll do this for the instantiated
11757 declaration based on the type of DECL. */
11758 if (!processing_template_decl
)
11759 c_apply_type_quals_to_decl (type_quals
, decl
);
11765 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11766 An empty exprlist is a parmlist. An exprlist which
11767 contains only identifiers at the global level
11768 is a parmlist. Otherwise, it is an exprlist. */
11771 parmlist_is_exprlist (exprs
)
11774 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11777 if (toplevel_bindings_p ())
11779 /* At the global level, if these are all identifiers,
11780 then it is a parmlist. */
11783 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11785 exprs
= TREE_CHAIN (exprs
);
11792 /* Subroutine of start_function. Ensure that each of the parameter
11793 types (as listed in PARMS) is complete, as is required for a
11794 function definition. */
11797 require_complete_types_for_parms (parms
)
11800 for (; parms
; parms
= TREE_CHAIN (parms
))
11802 tree type
= TREE_TYPE (parms
);
11804 /* Try to complete the TYPE. */
11805 type
= complete_type (type
);
11807 if (type
== error_mark_node
)
11810 if (!COMPLETE_TYPE_P (type
))
11812 if (DECL_NAME (parms
))
11813 error ("parameter `%s' has incomplete type",
11814 IDENTIFIER_POINTER (DECL_NAME (parms
)));
11816 error ("parameter has incomplete type");
11817 TREE_TYPE (parms
) = error_mark_node
;
11820 layout_decl (parms
, 0);
11824 /* Returns non-zero if T is a local variable. */
11827 local_variable_p (t
)
11830 if ((TREE_CODE (t
) == VAR_DECL
11831 /* A VAR_DECL with a context that is a _TYPE is a static data
11833 && !TYPE_P (CP_DECL_CONTEXT (t
))
11834 /* Any other non-local variable must be at namespace scope. */
11835 && !DECL_NAMESPACE_SCOPE_P (t
))
11836 || (TREE_CODE (t
) == PARM_DECL
))
11842 /* Returns non-zero if T is an automatic local variable or a label.
11843 (These are the declarations that need to be remapped when the code
11844 containing them is duplicated.) */
11847 nonstatic_local_decl_p (t
)
11850 return ((local_variable_p (t
) && !TREE_STATIC (t
))
11851 || TREE_CODE (t
) == LABEL_DECL
11852 || TREE_CODE (t
) == RESULT_DECL
);
11855 /* Like local_variable_p, but suitable for use as a tree-walking
11859 local_variable_p_walkfn (tp
, walk_subtrees
, data
)
11861 int *walk_subtrees ATTRIBUTE_UNUSED
;
11862 void *data ATTRIBUTE_UNUSED
;
11864 return ((local_variable_p (*tp
) && !DECL_ARTIFICIAL (*tp
))
11865 ? *tp
: NULL_TREE
);
11868 /* Check that ARG, which is a default-argument expression for a
11869 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11870 something goes wrong. DECL may also be a _TYPE node, rather than a
11871 DECL, if there is no DECL available. */
11874 check_default_argument (decl
, arg
)
11881 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11882 /* We get a DEFAULT_ARG when looking at an in-class declaration
11883 with a default argument. Ignore the argument for now; we'll
11884 deal with it after the class is complete. */
11887 if (processing_template_decl
|| uses_template_parms (arg
))
11888 /* We don't do anything checking until instantiation-time. Note
11889 that there may be uninstantiated arguments even for an
11890 instantiated function, since default arguments are not
11891 instantiated until they are needed. */
11900 decl_type
= TREE_TYPE (decl
);
11902 if (arg
== error_mark_node
11903 || decl
== error_mark_node
11904 || TREE_TYPE (arg
) == error_mark_node
11905 || decl_type
== error_mark_node
)
11906 /* Something already went wrong. There's no need to check
11908 return error_mark_node
;
11910 /* [dcl.fct.default]
11912 A default argument expression is implicitly converted to the
11914 if (!TREE_TYPE (arg
)
11915 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11918 cp_error ("default argument for `%#D' has type `%T'",
11919 decl
, TREE_TYPE (arg
));
11921 cp_error ("default argument for parameter of type `%T' has type `%T'",
11922 decl_type
, TREE_TYPE (arg
));
11924 return error_mark_node
;
11927 /* [dcl.fct.default]
11929 Local variables shall not be used in default argument
11932 The keyword `this' shall not be used in a default argument of a
11933 member function. */
11934 var
= walk_tree_without_duplicates (&arg
, local_variable_p_walkfn
,
11938 cp_error ("default argument `%E' uses local variable `%D'",
11940 return error_mark_node
;
11947 /* Decode the list of parameter types for a function type.
11948 Given the list of things declared inside the parens,
11949 return a list of types.
11951 The list we receive can have three kinds of elements:
11952 an IDENTIFIER_NODE for names given without types,
11953 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11954 or void_type_node, to mark the end of an argument list
11955 when additional arguments are not permitted (... was not used).
11957 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11958 a mere declaration. A nonempty identifier-list gets an error message
11959 when FUNCDEF_FLAG is zero.
11960 If FUNCDEF_FLAG is 1, then parameter types must be complete.
11961 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11963 If all elements of the input list contain types,
11964 we return a list of the types.
11965 If all elements contain no type (except perhaps a void_type_node
11966 at the end), we return a null list.
11967 If some have types and some do not, it is an error, and we
11968 return a null list.
11970 Also set last_function_parms to either
11971 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11972 A list of names is converted to a chain of PARM_DECLs
11973 by store_parm_decls so that ultimately it is always a chain of decls.
11975 Note that in C++, parameters can take default values. These default
11976 values are in the TREE_PURPOSE field of the TREE_LIST. It is
11977 an error to specify default values which are followed by parameters
11978 that have no default values, or an ELLIPSES. For simplicities sake,
11979 only parameters which are specified with their types can take on
11983 grokparms (first_parm
, funcdef_flag
)
11987 tree result
= NULL_TREE
;
11988 tree decls
= NULL_TREE
;
11990 if (first_parm
!= NULL_TREE
11991 && TREE_CODE (TREE_VALUE (first_parm
)) == IDENTIFIER_NODE
)
11993 if (! funcdef_flag
)
11994 pedwarn ("parameter names (without types) in function declaration");
11995 last_function_parms
= first_parm
;
11998 else if (first_parm
!= NULL_TREE
11999 && TREE_CODE (TREE_VALUE (first_parm
)) != TREE_LIST
12000 && TREE_CODE (TREE_VALUE (first_parm
)) != VOID_TYPE
)
12001 my_friendly_abort (145);
12004 /* Types were specified. This is a list of declarators
12005 each represented as a TREE_LIST node. */
12006 register tree parm
, chain
;
12007 int any_init
= 0, any_error
= 0;
12009 if (first_parm
!= NULL_TREE
)
12011 tree last_result
= NULL_TREE
;
12012 tree last_decl
= NULL_TREE
;
12014 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
12016 tree type
= NULL_TREE
, list_node
= parm
;
12017 register tree decl
= TREE_VALUE (parm
);
12018 tree init
= TREE_PURPOSE (parm
);
12020 chain
= TREE_CHAIN (parm
);
12021 /* @@ weak defense against parse errors. */
12022 if (TREE_CODE (decl
) != VOID_TYPE
12023 && TREE_CODE (decl
) != TREE_LIST
)
12025 /* Give various messages as the need arises. */
12026 if (TREE_CODE (decl
) == STRING_CST
)
12027 cp_error ("invalid string constant `%E'", decl
);
12028 else if (TREE_CODE (decl
) == INTEGER_CST
)
12029 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
12033 if (TREE_CODE (decl
) != VOID_TYPE
)
12035 decl
= grokdeclarator (TREE_VALUE (decl
),
12036 TREE_PURPOSE (decl
),
12037 PARM
, init
!= NULL_TREE
,
12039 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
12042 /* Top-level qualifiers on the parameters are
12043 ignored for function types. */
12044 type
= TYPE_MAIN_VARIANT (TREE_TYPE (decl
));
12046 if (TREE_CODE (type
) == VOID_TYPE
)
12047 decl
= void_type_node
;
12048 else if (TREE_CODE (type
) == METHOD_TYPE
)
12050 if (DECL_NAME (decl
))
12051 /* Cannot use the decl here because
12052 we don't have DECL_CONTEXT set up yet. */
12053 cp_error ("parameter `%D' invalidly declared method type",
12056 error ("parameter invalidly declared method type");
12057 type
= build_pointer_type (type
);
12058 TREE_TYPE (decl
) = type
;
12060 else if (TREE_CODE (type
) == OFFSET_TYPE
)
12062 if (DECL_NAME (decl
))
12063 cp_error ("parameter `%D' invalidly declared offset type",
12066 error ("parameter invalidly declared offset type");
12067 type
= build_pointer_type (type
);
12068 TREE_TYPE (decl
) = type
;
12070 else if (abstract_virtuals_error (decl
, type
))
12071 any_error
= 1; /* Seems like a good idea. */
12072 else if (POINTER_TYPE_P (type
))
12075 while (POINTER_TYPE_P (t
)
12076 || (TREE_CODE (t
) == ARRAY_TYPE
12077 && TYPE_DOMAIN (t
) != NULL_TREE
))
12079 if (TREE_CODE (t
) == ARRAY_TYPE
)
12080 cp_error ("parameter type `%T' includes %s to array of unknown bound",
12082 TYPE_PTR_P (type
) ? "pointer" : "reference");
12086 if (TREE_CODE (decl
) == VOID_TYPE
)
12088 if (result
== NULL_TREE
)
12090 result
= void_list_node
;
12091 last_result
= result
;
12095 TREE_CHAIN (last_result
) = void_list_node
;
12096 last_result
= void_list_node
;
12099 && (chain
!= void_list_node
|| TREE_CHAIN (chain
)))
12100 error ("`void' in parameter list must be entire list");
12104 /* Since there is a prototype, args are passed in their own types. */
12105 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
12106 if (PROMOTE_PROTOTYPES
12107 && (TREE_CODE (type
) == INTEGER_TYPE
12108 || TREE_CODE (type
) == ENUMERAL_TYPE
)
12109 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
12110 DECL_ARG_TYPE (decl
) = integer_type_node
;
12111 if (!any_error
&& init
)
12114 init
= check_default_argument (decl
, init
);
12119 if (decls
== NULL_TREE
)
12126 TREE_CHAIN (last_decl
) = decl
;
12129 list_node
= tree_cons (init
, type
, NULL_TREE
);
12130 if (result
== NULL_TREE
)
12132 result
= list_node
;
12133 last_result
= result
;
12137 TREE_CHAIN (last_result
) = list_node
;
12138 last_result
= list_node
;
12142 TREE_CHAIN (last_result
) = NULL_TREE
;
12143 /* If there are no parameters, and the function does not end
12144 with `...', then last_decl will be NULL_TREE. */
12145 if (last_decl
!= NULL_TREE
)
12146 TREE_CHAIN (last_decl
) = NULL_TREE
;
12150 last_function_parms
= decls
;
12155 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
12156 FUNCTION_TYPE with the newly parsed version of its default argument, which
12157 was previously digested as text. See snarf_defarg et al in lex.c. */
12160 replace_defarg (arg
, init
)
12163 if (! processing_template_decl
12164 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
12165 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
12166 TREE_TYPE (init
), TREE_VALUE (arg
));
12167 TREE_PURPOSE (arg
) = init
;
12170 /* D is a constructor or overloaded `operator='. Returns non-zero if
12171 D's arguments allow it to be a copy constructor, or copy assignment
12180 if (!DECL_FUNCTION_MEMBER_P (d
))
12183 t
= FUNCTION_ARG_CHAIN (d
);
12184 if (DECL_CONSTRUCTOR_P (d
) && DECL_HAS_IN_CHARGE_PARM_P (d
))
12185 t
= TREE_CHAIN (t
);
12186 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
12187 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
12188 == DECL_CONTEXT (d
))
12189 && (TREE_CHAIN (t
) == NULL_TREE
12190 || TREE_CHAIN (t
) == void_list_node
12191 || TREE_PURPOSE (TREE_CHAIN (t
))))
12196 /* These memoizing functions keep track of special properties which
12197 a class may have. `grok_ctor_properties' notices whether a class
12198 has a constructor of the form X(X&), and also complains
12199 if the class has a constructor of the form X(X).
12200 `grok_op_properties' takes notice of the various forms of
12201 operator= which are defined, as well as what sorts of type conversion
12202 may apply. Both functions take a FUNCTION_DECL as an argument. */
12205 grok_ctor_properties (ctype
, decl
)
12208 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
12209 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
12211 /* When a type has virtual baseclasses, a magical first int argument is
12212 added to any ctor so we can tell if the class has been initialized
12213 yet. This could screw things up in this function, so we deliberately
12214 ignore the leading int if we're in that situation. */
12215 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
12217 my_friendly_assert (parmtypes
12218 && TREE_VALUE (parmtypes
) == integer_type_node
,
12220 parmtypes
= TREE_CHAIN (parmtypes
);
12221 parmtype
= TREE_VALUE (parmtypes
);
12226 A non-template constructor for class X is a copy constructor if
12227 its first parameter is of type X&, const X&, volatile X& or const
12228 volatile X&, and either there are no other parameters or else all
12229 other parameters have default arguments. */
12230 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
12231 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
12232 && (TREE_CHAIN (parmtypes
) == NULL_TREE
12233 || TREE_CHAIN (parmtypes
) == void_list_node
12234 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
12235 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12236 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12238 TYPE_HAS_INIT_REF (ctype
) = 1;
12239 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12240 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
12244 A declaration of a constructor for a class X is ill-formed if its
12245 first parameter is of type (optionally cv-qualified) X and either
12246 there are no other parameters or else all other parameters have
12249 We *don't* complain about member template instantiations that
12250 have this form, though; they can occur as we try to decide what
12251 constructor to use during overload resolution. Since overload
12252 resolution will never prefer such a constructor to the
12253 non-template copy constructor (which is either explicitly or
12254 implicitly defined), there's no need to worry about their
12255 existence. Theoretically, they should never even be
12256 instantiated, but that's hard to forestall. */
12257 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
12258 && (TREE_CHAIN (parmtypes
) == NULL_TREE
12259 || TREE_CHAIN (parmtypes
) == void_list_node
12260 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
12261 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12262 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12264 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
12266 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
12269 else if (TREE_CODE (parmtype
) == VOID_TYPE
12270 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
12271 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
12276 /* An operator with this code is unary, but can also be binary. */
12280 enum tree_code code
;
12282 return (code
== INDIRECT_REF
12283 || code
== ADDR_EXPR
12284 || code
== CONVERT_EXPR
12285 || code
== NEGATE_EXPR
12286 || code
== PREINCREMENT_EXPR
12287 || code
== PREDECREMENT_EXPR
);
12290 /* An operator with this name can only be unary. */
12294 enum tree_code code
;
12296 return (code
== TRUTH_NOT_EXPR
12297 || code
== BIT_NOT_EXPR
12298 || code
== COMPONENT_REF
12299 || code
== TYPE_EXPR
);
12302 /* Do a little sanity-checking on how they declared their operator. */
12305 grok_op_properties (decl
, virtualp
, friendp
)
12307 int virtualp
, friendp
;
12309 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
12311 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
12312 tree name
= DECL_NAME (decl
);
12313 enum tree_code operator_code
;
12316 /* Count the number of arguments. */
12317 for (argtype
= argtypes
, arity
= 0;
12318 argtype
&& argtype
!= void_list_node
;
12319 argtype
= TREE_CHAIN (argtype
))
12322 if (current_class_type
== NULL_TREE
)
12325 if (DECL_CONV_FN_P (decl
))
12326 operator_code
= TYPE_EXPR
;
12330 #define DEF_OPERATOR(NAME, CODE, NEW_MANGLING, OLD_MANGING, ARITY, ASSN_P) \
12331 if (ansi_opname (CODE) == name) \
12333 operator_code = CODE; \
12336 else if (ansi_assopname (CODE) == name) \
12338 operator_code = CODE; \
12339 DECL_ASSIGNMENT_OPERATOR_P (decl) = 1; \
12343 #include "operators.def"
12344 #undef DEF_OPERATOR
12346 my_friendly_abort (20000527);
12349 my_friendly_assert (operator_code
!= LAST_CPLUS_TREE_CODE
, 20000526);
12350 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12354 switch (operator_code
)
12357 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
12361 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
12364 case COMPONENT_REF
:
12366 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
12370 TYPE_HAS_NEW_OPERATOR (current_class_type
) = 1;
12374 TYPE_GETS_DELETE (current_class_type
) |= 1;
12378 TYPE_HAS_ARRAY_NEW_OPERATOR (current_class_type
) = 1;
12381 case VEC_DELETE_EXPR
:
12382 TYPE_GETS_DELETE (current_class_type
) |= 2;
12390 if (operator_code
== NEW_EXPR
|| operator_code
== VEC_NEW_EXPR
)
12392 /* When the compiler encounters the definition of A::operator new, it
12393 doesn't look at the class declaration to find out if it's static. */
12395 revert_static_member_fn (decl
);
12397 /* Take care of function decl if we had syntax errors. */
12398 if (argtypes
== NULL_TREE
)
12400 = build_function_type (ptr_type_node
,
12401 hash_tree_chain (integer_type_node
,
12404 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
12406 else if (operator_code
== DELETE_EXPR
|| operator_code
== VEC_DELETE_EXPR
)
12409 revert_static_member_fn (decl
);
12411 if (argtypes
== NULL_TREE
)
12413 = build_function_type (void_type_node
,
12414 hash_tree_chain (ptr_type_node
,
12417 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
12421 /* An operator function must either be a non-static member function
12422 or have at least one parameter of a class, a reference to a class,
12423 an enumeration, or a reference to an enumeration. 13.4.0.6 */
12424 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
12426 if (operator_code
== TYPE_EXPR
12427 || operator_code
== CALL_EXPR
12428 || operator_code
== COMPONENT_REF
12429 || operator_code
== ARRAY_REF
12430 || operator_code
== NOP_EXPR
)
12431 cp_error ("`%D' must be a nonstatic member function", decl
);
12436 if (DECL_STATIC_FUNCTION_P (decl
))
12437 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
12440 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
12442 tree arg
= TREE_VALUE (p
);
12443 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
12444 arg
= TREE_TYPE (arg
);
12446 /* This lets bad template code slip through. */
12447 if (IS_AGGR_TYPE (arg
)
12448 || TREE_CODE (arg
) == ENUMERAL_TYPE
12449 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
12450 || TREE_CODE (arg
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
12454 ("`%D' must have an argument of class or enumerated type",
12461 if (operator_code
== CALL_EXPR
)
12462 return; /* No restrictions on args. */
12464 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
12466 tree t
= TREE_TYPE (name
);
12469 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
12470 const char *what
= 0;
12473 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
12475 if (TREE_CODE (t
) == VOID_TYPE
)
12477 else if (t
== current_class_type
)
12478 what
= "the same type";
12479 /* Don't force t to be complete here. */
12480 else if (IS_AGGR_TYPE (t
)
12481 && COMPLETE_TYPE_P (t
)
12482 && DERIVED_FROM_P (t
, current_class_type
))
12483 what
= "a base class";
12486 warning ("conversion to %s%s will never use a type conversion operator",
12487 ref
? "a reference to " : "", what
);
12491 if (DECL_ASSIGNMENT_OPERATOR_P (decl
)
12492 && operator_code
== NOP_EXPR
)
12496 if (arity
!= 2 && methodp
)
12498 cp_error ("`%D' must take exactly one argument", decl
);
12501 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
12505 A user-declared copy assignment operator X::operator= is
12506 a non-static non-template member function of class X with
12507 exactly one parameter of type X, X&, const X&, volatile
12508 X& or const volatile X&. */
12509 if (copy_assignment_arg_p (parmtype
, virtualp
)
12510 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12511 && is_member_template (DECL_TI_TEMPLATE (decl
)))
12514 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
12515 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
12516 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12517 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
12520 else if (operator_code
== COND_EXPR
)
12523 cp_error ("ISO C++ prohibits overloading operator ?:");
12525 else if (ambi_op_p (operator_code
))
12528 /* We pick the one-argument operator codes by default, so
12529 we don't have to change anything. */
12531 else if (arity
== 2)
12533 /* If we thought this was a unary operator, we now know
12534 it to be a binary operator. */
12535 switch (operator_code
)
12538 operator_code
= MULT_EXPR
;
12542 operator_code
= BIT_AND_EXPR
;
12546 operator_code
= PLUS_EXPR
;
12550 operator_code
= MINUS_EXPR
;
12553 case PREINCREMENT_EXPR
:
12554 operator_code
= POSTINCREMENT_EXPR
;
12557 case PREDECREMENT_EXPR
:
12558 operator_code
= POSTDECREMENT_EXPR
;
12562 my_friendly_abort (20000527);
12565 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12567 if ((operator_code
== POSTINCREMENT_EXPR
12568 || operator_code
== POSTDECREMENT_EXPR
)
12569 && ! processing_template_decl
12570 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
12573 cp_error ("postfix `%D' must take `int' as its argument",
12577 ("postfix `%D' must take `int' as its second argument",
12584 cp_error ("`%D' must take either zero or one argument", decl
);
12586 cp_error ("`%D' must take either one or two arguments", decl
);
12589 /* More Effective C++ rule 6. */
12591 && (operator_code
== POSTINCREMENT_EXPR
12592 || operator_code
== POSTDECREMENT_EXPR
12593 || operator_code
== PREINCREMENT_EXPR
12594 || operator_code
== PREDECREMENT_EXPR
))
12596 tree arg
= TREE_VALUE (argtypes
);
12597 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
12598 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
12599 arg
= TREE_TYPE (arg
);
12600 arg
= TYPE_MAIN_VARIANT (arg
);
12601 if (operator_code
== PREINCREMENT_EXPR
12602 || operator_code
== PREDECREMENT_EXPR
)
12604 if (TREE_CODE (ret
) != REFERENCE_TYPE
12605 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
12607 cp_warning ("prefix `%D' should return `%T'", decl
,
12608 build_reference_type (arg
));
12612 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
12613 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
12617 else if (unary_op_p (operator_code
))
12622 cp_error ("`%D' must take `void'", decl
);
12624 cp_error ("`%D' must take exactly one argument", decl
);
12627 else /* if (binary_op_p (operator_code)) */
12632 cp_error ("`%D' must take exactly one argument", decl
);
12634 cp_error ("`%D' must take exactly two arguments", decl
);
12637 /* More Effective C++ rule 7. */
12639 && (operator_code
== TRUTH_ANDIF_EXPR
12640 || operator_code
== TRUTH_ORIF_EXPR
12641 || operator_code
== COMPOUND_EXPR
))
12642 cp_warning ("user-defined `%D' always evaluates both arguments",
12646 /* Effective C++ rule 23. */
12649 && (operator_code
== PLUS_EXPR
12650 || operator_code
== MINUS_EXPR
12651 || operator_code
== TRUNC_DIV_EXPR
12652 || operator_code
== MULT_EXPR
)
12653 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
12654 cp_warning ("`%D' should return by value", decl
);
12657 for (; argtypes
&& argtypes
!= void_list_node
;
12658 argtypes
= TREE_CHAIN (argtypes
))
12659 if (TREE_PURPOSE (argtypes
))
12661 TREE_PURPOSE (argtypes
) = NULL_TREE
;
12662 if (operator_code
== POSTINCREMENT_EXPR
12663 || operator_code
== POSTDECREMENT_EXPR
)
12666 cp_pedwarn ("`%D' cannot have default arguments", decl
);
12669 cp_error ("`%D' cannot have default arguments", decl
);
12675 static const char *
12677 enum tag_types code
;
12690 my_friendly_abort (981122);
12694 /* Get the struct, enum or union (CODE says which) with tag NAME.
12695 Define the tag as a forward-reference if it is not defined.
12697 C++: If a class derivation is given, process it here, and report
12698 an error if multiple derivation declarations are not identical.
12700 If this is a definition, come in through xref_tag and only look in
12701 the current frame for the name (since C++ allows new names in any
12705 xref_tag (code_type_node
, name
, globalize
)
12706 tree code_type_node
;
12710 enum tag_types tag_code
;
12711 enum tree_code code
;
12712 register tree ref
, t
;
12713 struct binding_level
*b
= current_binding_level
;
12715 tree attributes
= NULL_TREE
;
12716 tree context
= NULL_TREE
;
12718 /* If we are called from the parser, code_type_node will sometimes be a
12719 TREE_LIST. This indicates that the user wrote
12720 "class __attribute__ ((foo)) bar". Extract the attributes so we can
12722 if (TREE_CODE (code_type_node
) == TREE_LIST
)
12724 attributes
= TREE_PURPOSE (code_type_node
);
12725 code_type_node
= TREE_VALUE (code_type_node
);
12728 tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12733 code
= RECORD_TYPE
;
12739 code
= ENUMERAL_TYPE
;
12742 my_friendly_abort (18);
12745 /* If a cross reference is requested, look up the type
12746 already defined for this tag and return it. */
12750 name
= TYPE_IDENTIFIER (t
);
12754 t
= IDENTIFIER_TYPE_VALUE (name
);
12756 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
12757 && TREE_CODE (t
) != BOUND_TEMPLATE_TEMPLATE_PARM
)
12762 /* If we know we are defining this tag, only look it up in
12763 this scope and don't try to find it as a type. */
12764 ref
= lookup_tag (code
, name
, b
, 1);
12770 /* [dcl.type.elab] If the identifier resolves to a
12771 typedef-name or a template type-parameter, the
12772 elaborated-type-specifier is ill-formed. */
12773 if (t
!= TYPE_MAIN_VARIANT (t
)
12774 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
12775 cp_pedwarn ("using typedef-name `%D' after `%s'",
12776 TYPE_NAME (t
), tag_name (tag_code
));
12777 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12778 cp_error ("using template type parameter `%T' after `%s'",
12779 t
, tag_name (tag_code
));
12784 ref
= lookup_tag (code
, name
, b
, 0);
12788 /* Try finding it as a type declaration. If that wins,
12790 ref
= lookup_name (name
, 1);
12792 if (ref
!= NULL_TREE
12793 && processing_template_decl
12794 && DECL_CLASS_TEMPLATE_P (ref
)
12795 && template_class_depth (current_class_type
) == 0)
12796 /* Since GLOBALIZE is true, we're declaring a global
12797 template, so we want this type. */
12798 ref
= DECL_TEMPLATE_RESULT (ref
);
12800 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12801 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12802 ref
= TREE_TYPE (ref
);
12807 if (ref
&& current_class_type
12808 && template_class_depth (current_class_type
)
12809 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12811 /* Since GLOBALIZE is non-zero, we are not looking at a
12812 definition of this tag. Since, in addition, we are currently
12813 processing a (member) template declaration of a template
12814 class, we must be very careful; consider:
12821 { template <class V>
12822 friend struct S1; };
12824 Here, the S2::S1 declaration should not be confused with the
12825 outer declaration. In particular, the inner version should
12826 have a template parameter of level 2, not level 1. This
12827 would be particularly important if the member declaration
12830 template <class V = U> friend struct S1;
12832 say, when we should tsubst into `U' when instantiating
12833 S2. On the other hand, when presented with:
12843 we must find the inner binding eventually. We
12844 accomplish this by making sure that the new type we
12845 create to represent this declaration has the right
12847 context
= TYPE_CONTEXT (ref
);
12854 /* If no such tag is yet defined, create a forward-reference node
12855 and record it as the "definition".
12856 When a real declaration of this type is found,
12857 the forward-reference will be altered into a real type. */
12858 if (code
== ENUMERAL_TYPE
)
12860 cp_error ("use of enum `%#D' without previous declaration", name
);
12862 ref
= make_node (ENUMERAL_TYPE
);
12864 /* Give the type a default layout like unsigned int
12865 to avoid crashing if it does not get defined. */
12866 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12867 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12868 TYPE_USER_ALIGN (ref
) = 0;
12869 TREE_UNSIGNED (ref
) = 1;
12870 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12871 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12872 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12874 /* Enable us to recognize when a type is created in class context.
12875 To do nested classes correctly, this should probably be cleared
12876 out when we leave this classes scope. Currently this in only
12877 done in `start_enum'. */
12879 pushtag (name
, ref
, globalize
);
12883 struct binding_level
*old_b
= class_binding_level
;
12885 ref
= make_aggr_type (code
);
12886 TYPE_CONTEXT (ref
) = context
;
12888 #ifdef NONNESTED_CLASSES
12889 /* Class types don't nest the way enums do. */
12890 class_binding_level
= (struct binding_level
*)0;
12892 pushtag (name
, ref
, globalize
);
12893 class_binding_level
= old_b
;
12898 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12899 redeclare_class_template (ref
, current_template_parms
);
12902 /* Until the type is defined, tentatively accept whatever
12903 structure tag the user hands us. */
12904 if (!COMPLETE_TYPE_P (ref
)
12905 && ref
!= current_class_type
12906 /* Have to check this, in case we have contradictory tag info. */
12907 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12909 if (tag_code
== class_type
)
12910 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12911 else if (tag_code
== record_type
)
12912 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12915 TREE_TYPE (ref
) = attributes
;
12921 xref_tag_from_type (old
, id
, globalize
)
12925 tree code_type_node
;
12927 if (TREE_CODE (old
) == RECORD_TYPE
)
12928 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12929 ? class_type_node
: record_type_node
);
12931 code_type_node
= union_type_node
;
12933 if (id
== NULL_TREE
)
12934 id
= TYPE_IDENTIFIER (old
);
12936 return xref_tag (code_type_node
, id
, globalize
);
12939 /* REF is a type (named NAME), for which we have just seen some
12940 baseclasses. BINFO is a list of those baseclasses; the
12941 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12942 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12943 struct, or union. */
12946 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12947 tree code_type_node
;
12951 /* In the declaration `A : X, Y, ... Z' we mark all the types
12952 (A, X, Y, ..., Z) so we can check for duplicates. */
12957 enum tag_types tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12959 if (tag_code
== union_type
)
12961 cp_error ("derived union `%T' invalid", ref
);
12965 len
= list_length (binfo
);
12967 /* First, make sure that any templates in base-classes are
12968 instantiated. This ensures that if we call ourselves recursively
12969 we do not get confused about which classes are marked and which
12971 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12972 complete_type (TREE_VALUE (base
));
12974 SET_CLASSTYPE_MARKED (ref
);
12975 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12977 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12979 /* The base of a derived struct is public by default. */
12981 = (TREE_PURPOSE (binfo
) == access_public_node
12982 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12983 || (tag_code
!= class_type
12984 && (TREE_PURPOSE (binfo
) == access_default_node
12985 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12987 = (TREE_PURPOSE (binfo
) == access_protected_node
12988 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12990 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12991 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12992 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12993 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12994 tree basetype
= TREE_VALUE (binfo
);
12997 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12998 basetype
= TREE_TYPE (basetype
);
13000 || (TREE_CODE (basetype
) != RECORD_TYPE
13001 && TREE_CODE (basetype
) != TYPENAME_TYPE
13002 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
13003 && TREE_CODE (basetype
) != BOUND_TEMPLATE_TEMPLATE_PARM
))
13005 cp_error ("base type `%T' fails to be a struct or class type",
13006 TREE_VALUE (binfo
));
13010 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
13012 /* This code replaces similar code in layout_basetypes.
13013 We put the complete_type first for implicit `typename'. */
13014 if (!COMPLETE_TYPE_P (basetype
)
13015 && ! (current_template_parms
&& uses_template_parms (basetype
)))
13017 cp_error ("base class `%T' has incomplete type", basetype
);
13022 if (CLASSTYPE_MARKED (basetype
))
13024 if (basetype
== ref
)
13025 cp_error ("recursive type `%T' undefined", basetype
);
13027 cp_error ("duplicate base type `%T' invalid", basetype
);
13031 if (TYPE_FOR_JAVA (basetype
)
13032 && (current_lang_stack
13033 == &VARRAY_TREE (current_lang_base
, 0)))
13034 TYPE_FOR_JAVA (ref
) = 1;
13036 /* Note that the BINFO records which describe individual
13037 inheritances are *not* shared in the lattice! They
13038 cannot be shared because a given baseclass may be
13039 inherited with different `accessibility' by different
13040 derived classes. (Each BINFO record describing an
13041 individual inheritance contains flags which say what
13042 the `accessibility' of that particular inheritance is.) */
13045 = make_binfo (size_zero_node
, basetype
,
13046 CLASS_TYPE_P (basetype
)
13047 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
13048 CLASS_TYPE_P (basetype
)
13049 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
13051 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
13052 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
13053 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
13054 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
13055 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
13057 /* We need to unshare the binfos now so that lookups during class
13058 definition work. */
13059 unshare_base_binfos (base_binfo
);
13061 SET_CLASSTYPE_MARKED (basetype
);
13063 /* We are free to modify these bits because they are meaningless
13064 at top level, and BASETYPE is a top-level type. */
13065 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
13067 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
13068 /* Converting to a virtual base class requires looking
13069 up the offset of the virtual base. */
13070 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
13073 if (CLASS_TYPE_P (basetype
))
13075 TYPE_HAS_NEW_OPERATOR (ref
)
13076 |= TYPE_HAS_NEW_OPERATOR (basetype
);
13077 TYPE_HAS_ARRAY_NEW_OPERATOR (ref
)
13078 |= TYPE_HAS_ARRAY_NEW_OPERATOR (basetype
);
13079 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
13080 /* If the base-class uses multiple inheritance, so do we. */
13081 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
13082 |= TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
13083 /* Likewise, if converting to a base of the base may require
13084 code, then we may need to generate code to convert to a
13086 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
)
13087 |= TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (basetype
);
13094 TREE_VEC_LENGTH (binfos
) = i
;
13096 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
13100 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
13101 /* If there is more than one non-empty they cannot be at the same
13103 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
13106 /* Unmark all the types. */
13108 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
13109 CLEAR_CLASSTYPE_MARKED (ref
);
13111 /* Now that we know all the base-classes, set up the list of virtual
13113 get_vbase_types (ref
);
13117 /* Begin compiling the definition of an enumeration type.
13118 NAME is its name (or null if anonymous).
13119 Returns the type object, as yet incomplete.
13120 Also records info about it so that build_enumerator
13121 may be used to declare the individual values as they are read. */
13127 register tree enumtype
= NULL_TREE
;
13128 struct binding_level
*b
= current_binding_level
;
13130 /* If this is the real definition for a previous forward reference,
13131 fill in the contents in the same object that used to be the
13132 forward reference. */
13134 if (name
!= NULL_TREE
)
13135 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
13137 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
13139 cp_error ("multiple definition of `%#T'", enumtype
);
13140 cp_error_at ("previous definition here", enumtype
);
13141 /* Clear out TYPE_VALUES, and start again. */
13142 TYPE_VALUES (enumtype
) = NULL_TREE
;
13146 enumtype
= make_node (ENUMERAL_TYPE
);
13147 pushtag (name
, enumtype
, 0);
13150 if (current_class_type
)
13151 TREE_ADDRESSABLE (b
->tags
) = 1;
13153 GNU_xref_decl (current_function_decl
, enumtype
);
13157 /* After processing and defining all the values of an enumeration type,
13158 install their decls in the enumeration type and finish it off.
13159 ENUMTYPE is the type object and VALUES a list of name-value pairs.
13160 Returns ENUMTYPE. */
13163 finish_enum (enumtype
)
13166 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
13167 /* Calculate the maximum value of any enumerator in this type. */
13169 tree values
= TYPE_VALUES (enumtype
);
13174 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
13179 /* The TREE_VALUE is a CONST_DECL for this enumeration
13181 decl
= TREE_VALUE (pair
);
13185 Following the closing brace of an enum-specifier, each
13186 enumerator has the type of its enumeration. Prior to the
13187 closing brace, the type of each enumerator is the type of
13188 its initializing value. */
13189 TREE_TYPE (decl
) = enumtype
;
13191 /* The DECL_INITIAL will be NULL if we are processing a
13192 template declaration and this enumeration constant had no
13193 explicit initializer. */
13194 value
= DECL_INITIAL (decl
);
13195 if (value
&& !processing_template_decl
)
13197 /* Set the TREE_TYPE for the VALUE as well. That's so
13198 that when we call decl_constant_value we get an
13199 entity of the right type (but with the constant
13200 value). Since we shouldn't ever call
13201 decl_constant_value on a template type, there's no
13202 reason to do that when processing_template_decl.
13203 And, if the expression is something like a
13204 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
13205 wreak havoc on the intended type of the expression.
13207 Of course, there's also no point in trying to compute
13208 minimum or maximum values if we're in a template. */
13209 TREE_TYPE (value
) = enumtype
;
13212 minnode
= maxnode
= value
;
13213 else if (tree_int_cst_lt (maxnode
, value
))
13215 else if (tree_int_cst_lt (value
, minnode
))
13219 if (processing_template_decl
)
13220 /* If this is just a template, leave the CONST_DECL
13221 alone. That way tsubst_copy will find CONST_DECLs for
13222 CONST_DECLs, and not INTEGER_CSTs. */
13225 /* In the list we're building up, we want the enumeration
13226 values, not the CONST_DECLs. */
13227 TREE_VALUE (pair
) = value
;
13231 maxnode
= minnode
= integer_zero_node
;
13233 TYPE_VALUES (enumtype
) = nreverse (values
);
13235 if (processing_template_decl
)
13237 tree scope
= current_scope ();
13238 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
13239 add_stmt (build_min (TAG_DEFN
, enumtype
));
13243 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
13244 int lowprec
= min_precision (minnode
, unsignedp
);
13245 int highprec
= min_precision (maxnode
, unsignedp
);
13246 int precision
= MAX (lowprec
, highprec
);
13249 TYPE_SIZE (enumtype
) = NULL_TREE
;
13251 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
13253 TYPE_PRECISION (enumtype
) = precision
;
13255 fixup_unsigned_type (enumtype
);
13257 fixup_signed_type (enumtype
);
13259 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
13260 /* Use the width of the narrowest normal C type which is wide
13262 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
13265 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
13267 TYPE_SIZE (enumtype
) = 0;
13268 layout_type (enumtype
);
13270 /* Fix up all variant types of this enum type. */
13271 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
13272 tem
= TYPE_NEXT_VARIANT (tem
))
13274 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
13275 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
13276 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
13277 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
13278 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
13279 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
13280 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
13281 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
13282 TYPE_USER_ALIGN (tem
) = TYPE_USER_ALIGN (enumtype
);
13283 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
13286 /* Finish debugging output for this type. */
13287 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
13293 /* Build and install a CONST_DECL for an enumeration constant of the
13294 enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided.
13295 Assignment of sequential values by default is handled here. */
13298 build_enumerator (name
, value
, enumtype
)
13308 /* Remove no-op casts from the value. */
13310 STRIP_TYPE_NOPS (value
);
13312 if (! processing_template_decl
)
13314 /* Validate and default VALUE. */
13315 if (value
!= NULL_TREE
)
13317 value
= decl_constant_value (value
);
13319 if (TREE_CODE (value
) == INTEGER_CST
)
13321 value
= default_conversion (value
);
13322 constant_expression_warning (value
);
13326 cp_error ("enumerator value for `%D' not integer constant", name
);
13331 /* Default based on previous value. */
13332 if (value
== NULL_TREE
&& ! processing_template_decl
)
13336 if (TYPE_VALUES (enumtype
))
13338 /* The next value is the previous value ... */
13339 prev_value
= DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype
)));
13340 /* ... plus one. */
13341 value
= cp_build_binary_op (PLUS_EXPR
,
13345 if (tree_int_cst_lt (value
, prev_value
))
13346 cp_error ("overflow in enumeration values at `%D'", name
);
13349 value
= integer_zero_node
;
13352 /* Remove no-op casts from the value. */
13354 STRIP_TYPE_NOPS (value
);
13356 /* To fix MAX_VAL enum consts. (bkoz) */
13357 TREE_TYPE (value
) = integer_type_node
;
13361 /* We always have to copy here; not all INTEGER_CSTs are unshared.
13362 Even in other cases, we will later (in finish_enum) be setting
13363 the type of VALUE. But, we don't need to make a copy if this
13364 VALUE is one of the enumeration constants for this same
13365 enumeration type. */
13366 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
13367 if (TREE_VALUE (values
) == value
)
13369 /* If we didn't break out of the loop, then we do need a copy. */
13370 if (!values
&& value
)
13371 value
= copy_node (value
);
13373 /* C++ associates enums with global, function, or class declarations. */
13374 context
= current_scope ();
13376 /* Build the actual enumeration constant. Note that the enumeration
13377 constants have the type of their initializers until the
13378 enumeration is complete:
13382 Following the closing brace of an enum-specifier, each enumer-
13383 ator has the type of its enumeration. Prior to the closing
13384 brace, the type of each enumerator is the type of its
13385 initializing value.
13387 In finish_enum we will reset the type. Of course, if we're
13388 processing a template, there may be no value. */
13389 type
= value
? TREE_TYPE (value
) : NULL_TREE
;
13391 if (context
&& context
== current_class_type
)
13392 /* This enum declaration is local to the class. We need the full
13393 lang_decl so that we can record DECL_CLASS_CONTEXT, for example. */
13394 decl
= build_lang_decl (CONST_DECL
, name
, type
);
13396 /* It's a global enum, or it's local to a function. (Note local to
13397 a function could mean local to a class method. */
13398 decl
= build_decl (CONST_DECL
, name
, type
);
13400 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
13401 DECL_INITIAL (decl
) = value
;
13402 TREE_READONLY (decl
) = 1;
13404 if (context
&& context
== current_class_type
)
13405 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
13406 on the TYPE_FIELDS list for `S'. (That's so that you can say
13407 things like `S::i' later.) */
13408 finish_member_declaration (decl
);
13412 GNU_xref_decl (current_function_decl
, decl
);
13415 /* Add this enumeration constant to the list for this type. */
13416 TYPE_VALUES (enumtype
) = tree_cons (name
, decl
, TYPE_VALUES (enumtype
));
13420 /* We're defining DECL. Make sure that it's type is OK. */
13423 check_function_type (decl
)
13426 tree fntype
= TREE_TYPE (decl
);
13427 tree return_type
= complete_type (TREE_TYPE (fntype
));
13429 /* In a function definition, arg types must be complete. */
13430 require_complete_types_for_parms (current_function_parms
);
13432 if (!COMPLETE_OR_VOID_TYPE_P (return_type
))
13434 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
13436 /* Make it return void instead, but don't change the
13437 type of the DECL_RESULT, in case we have a named return value. */
13438 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13440 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
13442 = build_cplus_method_type (ctype
,
13444 FUNCTION_ARG_CHAIN (decl
));
13448 = build_function_type (void_type_node
,
13449 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
13451 = build_exception_variant (fntype
,
13452 TYPE_RAISES_EXCEPTIONS (fntype
));
13455 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
13458 /* Create the FUNCTION_DECL for a function definition.
13459 DECLSPECS and DECLARATOR are the parts of the declaration;
13460 they describe the function's name and the type it returns,
13461 but twisted together in a fashion that parallels the syntax of C.
13463 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
13464 DECLARATOR is really the DECL for the function we are about to
13465 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
13466 indicating that the function is an inline defined in-class, and
13467 SF_EXPAND indicating that we should generate RTL for this
13470 This function creates a binding context for the function body
13471 as well as setting up the FUNCTION_DECL in current_function_decl.
13473 Returns 1 on success. If the DECLARATOR is not suitable for a function
13474 (it defines a datum instead), we return 0, which tells
13475 yyparse to report a parse error.
13477 For C++, we must first check whether that datum makes any sense.
13478 For example, "class A local_a(1,2);" means that variable local_a
13479 is an aggregate of type A, which should have a constructor
13480 applied to it with the argument list [1, 2]. */
13483 start_function (declspecs
, declarator
, attrs
, flags
)
13484 tree declspecs
, declarator
, attrs
;
13488 tree ctype
= NULL_TREE
;
13491 extern int have_extern_spec
;
13492 extern int used_extern_spec
;
13493 int doing_friend
= 0;
13494 struct binding_level
*bl
;
13496 /* Sanity check. */
13497 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
13498 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
13500 /* This should only be done once on the top most decl. */
13501 if (have_extern_spec
&& !used_extern_spec
)
13503 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
13504 used_extern_spec
= 1;
13507 if (flags
& SF_PRE_PARSED
)
13509 decl1
= declarator
;
13511 fntype
= TREE_TYPE (decl1
);
13512 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13513 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13515 /* ISO C++ 11.4/5. A friend function defined in a class is in
13516 the (lexical) scope of the class in which it is defined. */
13517 if (!ctype
&& DECL_FRIEND_P (decl1
))
13519 ctype
= DECL_FRIEND_CONTEXT (decl1
);
13521 /* CTYPE could be null here if we're dealing with a template;
13522 for example, `inline friend float foo()' inside a template
13523 will have no CTYPE set. */
13524 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
13530 last_function_parms
= DECL_ARGUMENTS (decl1
);
13531 last_function_parm_tags
= NULL_TREE
;
13535 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
13536 /* If the declarator is not suitable for a function definition,
13537 cause a syntax error. */
13538 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
13540 fntype
= TREE_TYPE (decl1
);
13542 restype
= TREE_TYPE (fntype
);
13543 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
13545 cp_error ("semicolon missing after declaration of `%#T'", restype
);
13546 shadow_tag (build_tree_list (NULL_TREE
, restype
));
13547 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
13548 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
13549 fntype
= build_function_type (integer_type_node
,
13550 TYPE_ARG_TYPES (fntype
));
13552 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
13554 TYPE_ARG_TYPES (fntype
));
13555 TREE_TYPE (decl1
) = fntype
;
13558 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13559 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13560 else if (DECL_MAIN_P (decl1
))
13562 /* If this doesn't return integer_type, complain. */
13563 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
13565 if (pedantic
|| warn_return_type
)
13566 pedwarn ("return type for `main' changed to `int'");
13567 TREE_TYPE (decl1
) = fntype
= default_function_type
;
13572 /* Sometimes we don't notice that a function is a static member, and
13573 build a METHOD_TYPE for it. Fix that up now. */
13574 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
)
13575 && TREE_CODE (TREE_TYPE (decl1
)) == METHOD_TYPE
)
13577 revert_static_member_fn (decl1
);
13578 last_function_parms
= TREE_CHAIN (last_function_parms
);
13582 /* Warn if function was previously implicitly declared
13583 (but not if we warned then). */
13584 if (! warn_implicit
13585 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
13586 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
13588 /* Set up current_class_type, and enter the scope of the class, if
13591 push_nested_class (ctype
, 1);
13592 else if (DECL_STATIC_FUNCTION_P (decl1
))
13593 push_nested_class (DECL_CONTEXT (decl1
), 2);
13595 /* Now that we have entered the scope of the class, we must restore
13596 the bindings for any template parameters surrounding DECL1, if it
13597 is an inline member template. (Order is important; consider the
13598 case where a template parameter has the same name as a field of
13599 the class.) It is not until after this point that
13600 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
13601 if (flags
& SF_INCLASS_INLINE
)
13602 maybe_begin_member_template_processing (decl1
);
13604 /* Effective C++ rule 15. See also c_expand_return. */
13606 && DECL_OVERLOADED_OPERATOR_P (decl1
) == NOP_EXPR
13607 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
13608 cp_warning ("`operator=' should return a reference to `*this'");
13610 /* Make the init_value nonzero so pushdecl knows this is not tentative.
13611 error_mark_node is replaced below (in poplevel) with the BLOCK. */
13612 if (!DECL_INITIAL (decl1
))
13613 DECL_INITIAL (decl1
) = error_mark_node
;
13615 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
13616 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
13619 /* This function exists in static storage.
13620 (This does not mean `static' in the C sense!) */
13621 TREE_STATIC (decl1
) = 1;
13623 /* We must call push_template_decl after current_class_type is set
13624 up. (If we are processing inline definitions after exiting a
13625 class scope, current_class_type will be NULL_TREE until set above
13626 by push_nested_class.) */
13627 if (processing_template_decl
)
13628 decl1
= push_template_decl (decl1
);
13630 /* We are now in the scope of the function being defined. */
13631 current_function_decl
= decl1
;
13633 /* Save the parm names or decls from this function's declarator
13634 where store_parm_decls will find them. */
13635 current_function_parms
= last_function_parms
;
13636 current_function_parm_tags
= last_function_parm_tags
;
13638 /* Make sure the parameter and return types are reasonable. When
13639 you declare a function, these types can be incomplete, but they
13640 must be complete when you define the function. */
13641 if (! processing_template_decl
)
13642 check_function_type (decl1
);
13644 /* Build the return declaration for the function. */
13645 restype
= TREE_TYPE (fntype
);
13646 if (!processing_template_decl
)
13648 if (!DECL_RESULT (decl1
))
13650 DECL_RESULT (decl1
)
13651 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13652 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype
),
13653 DECL_RESULT (decl1
));
13657 /* Just use `void'. Nobody will ever look at this anyhow. */
13658 DECL_RESULT (decl1
) = build_decl (RESULT_DECL
, 0, void_type_node
);
13660 /* Initialize RTL machinery. We cannot do this until
13661 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
13662 even when processing a template; this is how we get
13663 CFUN set up, and our per-function variables initialized. */
13664 bl
= current_binding_level
;
13665 init_function_start (decl1
, input_filename
, lineno
);
13666 current_binding_level
= bl
;
13667 expanding_p
= (flags
& SF_EXPAND
) != 0;
13669 /* Even though we're inside a function body, we still don't want to
13670 call expand_expr to calculate the size of a variable-sized array.
13671 We haven't necessarily assigned RTL to all variables yet, so it's
13672 not safe to try to expand expressions involving them. */
13673 immediate_size_expand
= 0;
13674 cfun
->x_dont_save_pending_sizes_p
= 1;
13676 /* If we're building a statement-tree, start the tree now. */
13677 if (processing_template_decl
|| !expanding_p
)
13678 begin_stmt_tree (&DECL_SAVED_TREE (decl1
));
13680 /* Let the user know we're compiling this function. */
13681 announce_function (decl1
);
13683 /* Record the decl so that the function name is defined.
13684 If we already have a decl for this name, and it is a FUNCTION_DECL,
13685 use the old decl. */
13686 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
13688 /* A specialization is not used to guide overload resolution. */
13689 if (!DECL_TEMPLATE_SPECIALIZATION (decl1
)
13690 && ! DECL_FUNCTION_MEMBER_P (decl1
))
13691 decl1
= pushdecl (decl1
);
13694 /* We need to set the DECL_CONTEXT. */
13695 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
13696 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
13697 /* And make sure we have enough default args. */
13698 check_default_args (decl1
);
13700 fntype
= TREE_TYPE (decl1
);
13703 /* Reset these in case the call to pushdecl changed them. */
13704 current_function_decl
= decl1
;
13705 cfun
->decl
= decl1
;
13707 /* Initialize the per-function data. */
13708 if (!DECL_PENDING_INLINE_P (decl1
) && DECL_SAVED_FUNCTION_DATA (decl1
))
13710 /* If we already parsed this function, and we're just expanding it
13711 now, restore saved state. */
13712 struct binding_level
*bl
= current_binding_level
;
13713 *cp_function_chain
= *DECL_SAVED_FUNCTION_DATA (decl1
);
13714 current_binding_level
= bl
;
13716 /* This function is being processed in whole-function mode; we
13717 already did semantic analysis. */
13718 cfun
->x_whole_function_mode_p
= 1;
13720 /* If we decided that we didn't want to inline this function,
13721 make sure the back-end knows that. */
13722 if (!current_function_cannot_inline
)
13723 current_function_cannot_inline
= cp_function_chain
->cannot_inline
;
13725 /* We don't need the saved data anymore. */
13726 free (DECL_SAVED_FUNCTION_DATA (decl1
));
13727 DECL_SAVED_FUNCTION_DATA (decl1
) = NULL
;
13729 else if (ctype
&& !doing_friend
&& !DECL_STATIC_FUNCTION_P (decl1
))
13731 /* We know that this was set up by `grokclassfn'. We do not
13732 wait until `store_parm_decls', since evil parse errors may
13733 never get us to that point. Here we keep the consistency
13734 between `current_class_type' and `current_class_ptr'. */
13735 tree t
= DECL_ARGUMENTS (decl1
);
13737 my_friendly_assert (t
!= NULL_TREE
&& TREE_CODE (t
) == PARM_DECL
,
13739 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
13742 cp_function_chain
->x_current_class_ref
13743 = build_indirect_ref (t
, NULL_PTR
);
13744 cp_function_chain
->x_current_class_ptr
= t
;
13746 /* Constructors and destructors need to know whether they're "in
13747 charge" of initializing virtual base classes. */
13748 if (DECL_HAS_IN_CHARGE_PARM_P (decl1
))
13749 current_in_charge_parm
= TREE_CHAIN (t
);
13752 if (DECL_INTERFACE_KNOWN (decl1
))
13754 tree ctx
= decl_function_context (decl1
);
13756 if (DECL_NOT_REALLY_EXTERN (decl1
))
13757 DECL_EXTERNAL (decl1
) = 0;
13759 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
13760 && TREE_PUBLIC (ctx
))
13761 /* This is a function in a local class in an extern inline
13763 comdat_linkage (decl1
);
13765 /* If this function belongs to an interface, it is public.
13766 If it belongs to someone else's interface, it is also external.
13767 This only affects inlines and template instantiations. */
13768 else if (interface_unknown
== 0
13769 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13770 || flag_alt_external_templates
))
13772 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
13773 || processing_template_decl
)
13775 DECL_EXTERNAL (decl1
)
13777 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
13778 && !DECL_VINDEX (decl1
)));
13780 /* For WIN32 we also want to put these in linkonce sections. */
13781 maybe_make_one_only (decl1
);
13784 DECL_EXTERNAL (decl1
) = 0;
13785 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
13786 DECL_INTERFACE_KNOWN (decl1
) = 1;
13788 else if (interface_unknown
&& interface_only
13789 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13790 || flag_alt_external_templates
))
13792 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13793 interface, we will have interface_only set but not
13794 interface_known. In that case, we don't want to use the normal
13795 heuristics because someone will supply a #pragma implementation
13796 elsewhere, and deducing it here would produce a conflict. */
13797 comdat_linkage (decl1
);
13798 DECL_EXTERNAL (decl1
) = 0;
13799 DECL_INTERFACE_KNOWN (decl1
) = 1;
13800 DECL_DEFER_OUTPUT (decl1
) = 1;
13804 /* This is a definition, not a reference.
13805 So clear DECL_EXTERNAL. */
13806 DECL_EXTERNAL (decl1
) = 0;
13808 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
13809 && ! DECL_INTERFACE_KNOWN (decl1
)
13810 /* Don't try to defer nested functions for now. */
13811 && ! decl_function_context (decl1
))
13812 DECL_DEFER_OUTPUT (decl1
) = 1;
13814 DECL_INTERFACE_KNOWN (decl1
) = 1;
13817 if (doing_semantic_analysis_p ())
13820 current_binding_level
->parm_flag
= 1;
13824 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13826 if (!building_stmt_tree ())
13827 GNU_xref_function (decl1
, current_function_parms
);
13829 /* We need to do this even if we aren't expanding yet so that
13830 assemble_external works. */
13831 make_function_rtl (decl1
);
13833 /* Promote the value to int before returning it. */
13834 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13835 restype
= type_promotes_to (restype
);
13837 /* If this fcn was already referenced via a block-scope `extern' decl
13838 (or an implicit decl), propagate certain information about the usage. */
13839 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13840 TREE_ADDRESSABLE (decl1
) = 1;
13842 if (DECL_RESULT (decl1
) == NULL_TREE
)
13844 DECL_RESULT (decl1
)
13845 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13846 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13847 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13852 if (DECL_DESTRUCTOR_P (decl1
))
13854 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13855 DECL_CONTEXT (dtor_label
) = current_function_decl
;
13857 /* Under the old ABI we return `this' from constructors, so we make
13858 ordinary `return' statements in constructors jump to CTOR_LABEL;
13859 from there we return `this'. Under the new ABI, we don't bother
13860 with any of this. By not setting CTOR_LABEL the remainder of the
13861 machinery is automatically disabled. */
13862 else if (!flag_new_abi
&& DECL_CONSTRUCTOR_P (decl1
))
13864 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13865 DECL_CONTEXT (ctor_label
) = current_function_decl
;
13871 /* Called after store_parm_decls for a function-try-block. */
13874 expand_start_early_try_stmts ()
13876 expand_start_try_stmts ();
13879 /* Store the parameter declarations into the current function declaration.
13880 This is called after parsing the parameter declarations, before
13881 digesting the body of the function.
13883 Also install to binding contour return value identifier, if any. */
13886 store_parm_decls ()
13888 register tree fndecl
= current_function_decl
;
13889 register tree parm
;
13890 int parms_have_cleanups
= 0;
13891 tree cleanups
= NULL_TREE
;
13893 /* This is a list of types declared among parms in a prototype. */
13894 tree parmtags
= current_function_parm_tags
;
13896 /* This is a chain of any other decls that came in among the parm
13897 declarations. If a parm is declared with enum {foo, bar} x;
13898 then CONST_DECLs for foo and bar are put here. */
13899 tree nonparms
= NULL_TREE
;
13901 /* Create a binding level for the parms. */
13902 if (!building_stmt_tree ())
13903 expand_start_bindings (2);
13905 if (current_function_parms
)
13907 /* This case is when the function was defined with an ANSI prototype.
13908 The parms already have decls, so we need not do anything here
13909 except record them as in effect
13910 and complain if any redundant old-style parm decls were written. */
13912 tree specparms
= current_function_parms
;
13915 if (doing_semantic_analysis_p ())
13917 /* Must clear this because it might contain TYPE_DECLs declared
13919 storedecls (NULL_TREE
);
13921 /* If we're doing semantic analysis, then we'll call pushdecl
13922 for each of these. We must do them in reverse order so that
13923 they end in the correct forward order. */
13924 specparms
= nreverse (specparms
);
13927 for (parm
= specparms
; parm
; parm
= next
)
13929 next
= TREE_CHAIN (parm
);
13930 if (TREE_CODE (parm
) == PARM_DECL
)
13932 tree type
= TREE_TYPE (parm
);
13934 if (doing_semantic_analysis_p ())
13938 if (DECL_NAME (parm
) == NULL_TREE
13939 || TREE_CODE (parm
) != VOID_TYPE
)
13942 cp_error ("parameter `%D' declared void", parm
);
13944 cleanup
= (processing_template_decl
13946 : maybe_build_cleanup (parm
));
13949 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13951 else if (type
!= error_mark_node
13952 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
13953 parms_have_cleanups
= 1;
13957 /* If we find an enum constant or a type tag,
13958 put it aside for the moment. */
13959 TREE_CHAIN (parm
) = NULL_TREE
;
13960 nonparms
= chainon (nonparms
, parm
);
13964 if (doing_semantic_analysis_p ())
13966 /* Get the decls in their original chain order
13967 and record in the function. This is all and only the
13968 PARM_DECLs that were pushed into scope by the loop above. */
13969 DECL_ARGUMENTS (fndecl
) = getdecls ();
13970 storetags (chainon (parmtags
, gettags ()));
13974 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13976 /* Now store the final chain of decls for the arguments
13977 as the decl-chain of the current lexical scope.
13978 Put the enumerators in as well, at the front so that
13979 DECL_ARGUMENTS is not modified. */
13980 if (doing_semantic_analysis_p ())
13981 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13983 /* Initialize the RTL code for the function. */
13984 DECL_SAVED_INSNS (fndecl
) = 0;
13985 if (! building_stmt_tree ())
13986 expand_function_start (fndecl
, parms_have_cleanups
);
13988 current_function_parms_stored
= 1;
13990 /* If this function is `main', emit a call to `__main'
13991 to run global initializers, etc. */
13992 if (DECL_MAIN_P (fndecl
) && !building_stmt_tree ())
13993 expand_main_function ();
13995 /* Now that we have initialized the parms, we can start their
13996 cleanups. We cannot do this before, since expand_decl_cleanup
13997 should not be called before the parm can be used. */
14000 finish_decl_cleanup (TREE_PURPOSE (cleanups
),
14001 TREE_VALUE (cleanups
));
14002 cleanups
= TREE_CHAIN (cleanups
);
14005 /* Create a binding contour which can be used to catch
14006 cleanup-generated temporaries. Also, if the return value needs or
14007 has initialization, deal with that now. */
14008 if (parms_have_cleanups
)
14011 if (!building_stmt_tree ())
14012 expand_start_bindings (2);
14015 /* Do the starting of the exception specifications, if we have any. */
14016 if (flag_exceptions
&& !processing_template_decl
14017 && flag_enforce_eh_specs
14018 && building_stmt_tree ()
14019 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
14020 current_eh_spec_try_block
= expand_start_eh_spec ();
14024 /* We have finished doing semantic analysis on DECL, but have not yet
14025 generated RTL for its body. Save away our current state, so that
14026 when we want to generate RTL later we know what to do. */
14029 save_function_data (decl
)
14032 struct cp_language_function
*f
;
14034 /* Save the language-specific per-function data so that we can
14035 get it back when we really expand this function. */
14036 my_friendly_assert (!DECL_PENDING_INLINE_P (decl
),
14040 f
= ((struct cp_language_function
*)
14041 xmalloc (sizeof (struct cp_language_function
)));
14042 bcopy ((char *) cp_function_chain
, (char *) f
,
14043 sizeof (struct cp_language_function
));
14044 DECL_SAVED_FUNCTION_DATA (decl
) = f
;
14046 /* Clear out the bits we don't need. */
14047 f
->base
.x_stmt_tree
.x_last_stmt
= NULL_TREE
;
14048 f
->base
.x_stmt_tree
.x_last_expr_type
= NULL_TREE
;
14049 f
->x_result_rtx
= NULL_RTX
;
14050 f
->x_named_label_uses
= NULL
;
14051 f
->bindings
= NULL
;
14053 /* When we get back here again, we will be expanding. */
14054 f
->x_expanding_p
= 1;
14056 /* If we've already decided that we cannot inline this function, we
14057 must remember that fact when we actually go to expand the
14059 f
->cannot_inline
= current_function_cannot_inline
;
14062 /* At the end of every constructor we generate to code to return
14063 `this'. Do that now. */
14066 finish_constructor_body ()
14068 /* Any return from a constructor will end up here. */
14070 add_stmt (build_stmt (LABEL_STMT
, ctor_label
));
14072 /* Clear CTOR_LABEL so that finish_return_stmt knows to really
14073 generate the return, rather than a goto to CTOR_LABEL. */
14074 ctor_label
= NULL_TREE
;
14075 /* In check_return_expr we translate an empty return from a
14076 constructor to a return of `this'. */
14077 finish_return_stmt (NULL_TREE
);
14078 /* Mark the end of the constructor. */
14079 add_stmt (build_stmt (CTOR_STMT
));
14082 /* At the end of every destructor we generate code to restore virtual
14083 function tables to the values desired by base classes and to call
14084 to base class destructors. Do that now. */
14087 finish_destructor_body ()
14089 tree compound_stmt
;
14094 /* Create a block to contain all the extra code. */
14095 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
14097 /* Any return from a destructor will end up here. */
14098 add_stmt (build_stmt (LABEL_STMT
, dtor_label
));
14100 /* Generate the code to call destructor on base class. If this
14101 destructor belongs to a class with virtual functions, then set
14102 the virtual function table pointer to represent the type of our
14105 /* This side-effect makes call to `build_delete' generate the code
14106 we have to have at the end of this destructor. `build_delete'
14107 will set the flag again. */
14108 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
14110 exprstmt
= build_delete (current_class_type
,
14112 sfk_base_destructor
,
14113 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
,
14116 if (exprstmt
!= error_mark_node
14117 && (TREE_CODE (exprstmt
) != NOP_EXPR
14118 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
14119 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
14121 if (exprstmt
!= void_zero_node
)
14122 /* Don't call `expand_expr_stmt' if we're not going to do
14123 anything, since -Wall will give a diagnostic. */
14124 finish_expr_stmt (exprstmt
);
14126 /* Run destructors for all virtual baseclasses. */
14127 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
14132 if_stmt
= begin_if_stmt ();
14133 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
14134 current_in_charge_parm
,
14138 vbases
= CLASSTYPE_VBASECLASSES (current_class_type
);
14139 /* The CLASSTYPE_VBASECLASSES list is in initialization
14140 order, so we have to march through it in reverse order. */
14141 for (vbases
= nreverse (copy_list (vbases
));
14143 vbases
= TREE_CHAIN (vbases
))
14145 tree vbase
= TREE_VALUE (vbases
);
14147 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (vbase
)))
14149 tree vb
= get_vbase
14150 (BINFO_TYPE (vbase
),
14151 TYPE_BINFO (current_class_type
));
14153 (build_scoped_method_call
14154 (current_class_ref
, vb
, base_dtor_identifier
,
14159 finish_then_clause (if_stmt
);
14164 virtual_size
= c_sizeof (current_class_type
);
14166 /* At the end, call delete if that's what's requested. */
14168 /* FDIS sez: At the point of definition of a virtual destructor
14169 (including an implicit definition), non-placement operator delete
14170 shall be looked up in the scope of the destructor's class and if
14171 found shall be accessible and unambiguous.
14173 This is somewhat unclear, but I take it to mean that if the class
14174 only defines placement deletes we don't do anything here. So we
14175 pass LOOKUP_SPECULATIVELY; delete_sanity will complain for us if
14176 they ever try to delete one of these. */
14177 exprstmt
= build_op_delete_call
14178 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
14179 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
14181 if_stmt
= begin_if_stmt ();
14182 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
14183 current_in_charge_parm
,
14186 finish_expr_stmt (exprstmt
);
14187 finish_then_clause (if_stmt
);
14190 /* Close the block we started above. */
14191 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
14194 /* Finish up a function declaration and compile that function
14195 all the way to assembler language output. The free the storage
14196 for the function definition.
14198 FLAGS is a bitwise or of the following values:
14200 An extra call to poplevel (and expand_end_bindings) must be
14201 made to take care of the binding contour for the base
14202 initializers. This is only relevant for constructors.
14204 We just finished processing the body of an in-class inline
14205 function definition. (This processing will have taken place
14206 after the class definition is complete.) */
14209 finish_function (flags
)
14212 register tree fndecl
= current_function_decl
;
14213 tree fntype
, ctype
= NULL_TREE
;
14214 /* Label to use if this function is supposed to return a value. */
14215 tree no_return_label
= NULL_TREE
;
14216 int call_poplevel
= (flags
& 1) != 0;
14217 int inclass_inline
= (flags
& 2) != 0;
14220 int current_line
= lineno
;
14222 /* When we get some parse errors, we can end up without a
14223 current_function_decl, so cope. */
14224 if (fndecl
== NULL_TREE
)
14225 return error_mark_node
;
14227 nested
= function_depth
> 1;
14228 fntype
= TREE_TYPE (fndecl
);
14230 /* TREE_READONLY (fndecl) = 1;
14231 This caused &foo to be of type ptr-to-const-function
14232 which then got a warning when stored in a ptr-to-function variable. */
14234 /* This happens on strange parse errors. */
14235 if (! current_function_parms_stored
)
14238 store_parm_decls ();
14241 /* For a cloned function, we've already got all the code we need;
14242 there's no need to add any extra bits. */
14243 if (building_stmt_tree () && DECL_CLONED_FUNCTION_P (fndecl
))
14245 else if (building_stmt_tree ())
14247 if (DECL_CONSTRUCTOR_P (fndecl
))
14249 finish_constructor_body ();
14253 else if (DECL_DESTRUCTOR_P (fndecl
) && !processing_template_decl
)
14254 finish_destructor_body ();
14255 else if (DECL_MAIN_P (fndecl
))
14257 /* Make it so that `main' always returns 0 by default. */
14259 finish_return_stmt (integer_one_node
);
14261 finish_return_stmt (integer_zero_node
);
14265 /* Finish dealing with exception specifiers. */
14266 if (flag_exceptions
&& !processing_template_decl
14267 && flag_enforce_eh_specs
14268 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
14269 expand_end_eh_spec (TYPE_RAISES_EXCEPTIONS
14270 (TREE_TYPE (current_function_decl
)),
14271 current_eh_spec_try_block
);
14276 if (write_symbols
!= NO_DEBUG
/*&& TREE_CODE (fntype) != METHOD_TYPE*/)
14278 /* Keep this code around in case we later want to control debug info
14279 based on whether a type is "used". (jason 1999-11-11) */
14281 tree ttype
= target_type (fntype
);
14284 if (IS_AGGR_TYPE (ttype
))
14285 /* Let debugger know it should output info for this type. */
14286 note_debug_info_needed (ttype
);
14288 for (parmdecl
= DECL_ARGUMENTS (fndecl
); parmdecl
; parmdecl
= TREE_CHAIN (parmdecl
))
14290 ttype
= target_type (TREE_TYPE (parmdecl
));
14291 if (IS_AGGR_TYPE (ttype
))
14292 /* Let debugger know it should output info for this type. */
14293 note_debug_info_needed (ttype
);
14298 /* Clean house because we will need to reorder insns here. */
14299 do_pending_stack_adjust ();
14303 else if (DECL_CONSTRUCTOR_P (fndecl
))
14308 else if (return_label
!= NULL_RTX
14309 && flag_this_is_variable
<= 0
14310 && current_function_return_value
== NULL_TREE
14311 && ! DECL_NAME (DECL_RESULT (current_function_decl
)))
14312 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
14314 if (flag_exceptions
)
14315 expand_exception_blocks ();
14317 /* If this function is supposed to return a value, ensure that
14318 we do not fall into the cleanups by mistake. The end of our
14319 function will look like this:
14321 user code (may have return stmt somewhere)
14322 goto no_return_label
14327 NOTE_INSN_FUNCTION_END
14331 If the user omits a return stmt in the USER CODE section, we
14332 will have a control path which reaches NOTE_INSN_FUNCTION_END.
14333 Otherwise, we won't. */
14334 if (no_return_label
)
14336 DECL_CONTEXT (no_return_label
) = fndecl
;
14337 DECL_INITIAL (no_return_label
) = error_mark_node
;
14338 DECL_SOURCE_FILE (no_return_label
) = input_filename
;
14339 DECL_SOURCE_LINE (no_return_label
) = current_line
;
14340 expand_goto (no_return_label
);
14345 /* Remove the binding contour which is used
14346 to catch cleanup-generated temporaries. */
14347 expand_end_bindings (0, 0, 0);
14348 poplevel (0, 0, 0);
14350 /* Emit label at beginning of cleanup code for parameters. */
14351 emit_label (cleanup_label
);
14354 /* Get return value into register if that's where it's supposed
14356 if (original_result_rtx
)
14357 fixup_result_decl (DECL_RESULT (fndecl
), original_result_rtx
);
14359 /* Finish building code that will trigger warnings if users forget
14360 to make their functions return values. */
14361 if (no_return_label
|| cleanup_label
)
14362 emit_jump (return_label
);
14363 if (no_return_label
)
14365 /* We don't need to call `expand_*_return' here because we
14366 don't need any cleanups here--this path of code is only
14367 for error checking purposes. */
14368 expand_label (no_return_label
);
14371 /* We hard-wired immediate_size_expand to zero in
14372 start_function. Expand_function_end will decrement this
14373 variable. So, we set the variable to one here, so that after
14374 the decrement it will remain zero. */
14375 immediate_size_expand
= 1;
14377 /* Generate rtl for function exit. */
14378 expand_function_end (input_filename
, current_line
, 1);
14381 /* We have to save this value here in case
14382 maybe_end_member_template_processing decides to pop all the
14383 template parameters. */
14384 expand_p
= !building_stmt_tree ();
14386 /* If we're saving up tree structure, tie off the function now. */
14388 finish_stmt_tree (&DECL_SAVED_TREE (fndecl
));
14390 /* This must come after expand_function_end because cleanups might
14391 have declarations (from inline functions) that need to go into
14392 this function's blocks. */
14393 if (doing_semantic_analysis_p ())
14395 if (current_binding_level
->parm_flag
!= 1)
14396 my_friendly_abort (122);
14397 poplevel (1, 0, 1);
14400 /* Remember that we were in class scope. */
14401 if (current_class_name
)
14402 ctype
= current_class_type
;
14404 /* Must mark the RESULT_DECL as being in this function. */
14405 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
14407 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
14408 to the FUNCTION_DECL node itself. */
14409 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
14411 /* Save away current state, if appropriate. */
14412 if (!expanding_p
&& !processing_template_decl
)
14413 save_function_data (fndecl
);
14415 /* If this function calls `setjmp' it cannot be inlined. When
14416 `longjmp' is called it is not guaranteed to restore the value of
14417 local variables that have been modified since the call to
14418 `setjmp'. So, if were to inline this function into some caller
14419 `c', then when we `longjmp', we might not restore all variables
14420 in `c'. (It might seem, at first blush, that there's no way for
14421 this function to modify local variables in `c', but their
14422 addresses may have been stored somewhere accessible to this
14424 if (!expanding_p
&& !processing_template_decl
&& calls_setjmp_p (fndecl
))
14425 DECL_UNINLINABLE (fndecl
) = 1;
14432 /* So we can tell if jump_optimize sets it to 1. */
14435 /* Before we call rest_of_compilation (which will pop the
14436 CURRENT_FUNCTION), we must save these values. */
14437 returns_null
= current_function_returns_null
;
14438 returns_value
= current_function_returns_value
;
14440 /* If this is a nested function (like a template instantiation
14441 that we're compiling in the midst of compiling something
14442 else), push a new GC context. That will keep local variables
14443 on the stack from being collected while we're doing the
14444 compilation of this function. */
14445 if (function_depth
> 1)
14446 ggc_push_context ();
14448 /* Run the optimizers and output the assembler code for this
14450 rest_of_compilation (fndecl
);
14452 /* Undo the call to ggc_push_context above. */
14453 if (function_depth
> 1)
14454 ggc_pop_context ();
14456 if (DECL_SAVED_INSNS (fndecl
) && ! TREE_ASM_WRITTEN (fndecl
))
14458 /* Set DECL_EXTERNAL so that assemble_external will be called as
14459 necessary. We'll clear it again in finish_file. */
14460 if (! DECL_EXTERNAL (fndecl
))
14461 DECL_NOT_REALLY_EXTERN (fndecl
) = 1;
14462 DECL_EXTERNAL (fndecl
) = 1;
14467 /* Keep this code around in case we later want to control debug info
14468 based on whether a type is "used". (jason 1999-11-11) */
14470 if (ctype
&& TREE_ASM_WRITTEN (fndecl
))
14471 note_debug_info_needed (ctype
);
14474 /* If this function is marked with the constructor attribute,
14475 add it to the list of functions to be called along with
14476 constructors from static duration objects. */
14477 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
14478 static_ctors
= tree_cons (NULL_TREE
, fndecl
, static_ctors
);
14480 /* If this function is marked with the destructor attribute,
14481 add it to the list of functions to be called along with
14482 destructors from static duration objects. */
14483 if (DECL_STATIC_DESTRUCTOR (fndecl
))
14484 static_dtors
= tree_cons (NULL_TREE
, fndecl
, static_dtors
);
14486 if (DECL_NAME (DECL_RESULT (fndecl
)))
14487 returns_value
|= can_reach_end
;
14489 returns_null
|= can_reach_end
;
14491 if (TREE_THIS_VOLATILE (fndecl
) && returns_null
)
14492 warning ("`noreturn' function does return");
14493 else if (returns_null
14494 && TREE_CODE (TREE_TYPE (fntype
)) != VOID_TYPE
)
14496 /* Always complain if there's just no return statement. */
14497 if (!returns_value
)
14498 warning ("no return statement in function returning non-void");
14499 else if (warn_return_type
|| pedantic
)
14500 /* If this function returns non-void and control can drop through,
14502 warning ("control reaches end of non-void function");
14507 /* Clear out memory we no longer need. */
14508 free_after_parsing (cfun
);
14509 /* Since we never call rest_of_compilation, we never clear
14510 CFUN. Do so explicitly. */
14511 free_after_compilation (cfun
);
14515 /* If this is a in-class inline definition, we may have to pop the
14516 bindings for the template parameters that we added in
14517 maybe_begin_member_template_processing when start_function was
14519 if (inclass_inline
)
14520 maybe_end_member_template_processing ();
14522 /* Leave the scope of the class. */
14524 pop_nested_class ();
14528 if (!DECL_SAVED_INSNS (fndecl
) && !DECL_SAVED_FUNCTION_DATA (fndecl
)
14529 && !(flag_inline_trees
&& DECL_INLINE (fndecl
)))
14533 /* Stop pointing to the local nodes about to be freed. */
14534 /* But DECL_INITIAL must remain nonzero so we know this
14535 was an actual function definition. */
14536 DECL_INITIAL (fndecl
) = error_mark_node
;
14537 for (t
= DECL_ARGUMENTS (fndecl
); t
; t
= TREE_CHAIN (t
))
14538 DECL_RTL (t
) = DECL_INCOMING_RTL (t
) = NULL_RTX
;
14544 /* Let the error reporting routines know that we're outside a
14545 function. For a nested function, this value is used in
14546 pop_cp_function_context and then reset via pop_function_context. */
14547 current_function_decl
= NULL_TREE
;
14548 /* We don't really care about obstacks, but the middle-end
14549 sometimes cares on what obstck things are located. */
14550 permanent_allocation (1);
14556 /* Create the FUNCTION_DECL for a function definition.
14557 DECLSPECS and DECLARATOR are the parts of the declaration;
14558 they describe the return type and the name of the function,
14559 but twisted together in a fashion that parallels the syntax of C.
14561 This function creates a binding context for the function body
14562 as well as setting up the FUNCTION_DECL in current_function_decl.
14564 Returns a FUNCTION_DECL on success.
14566 If the DECLARATOR is not suitable for a function (it defines a datum
14567 instead), we return 0, which tells yyparse to report a parse error.
14569 May return void_type_node indicating that this method is actually
14570 a friend. See grokfield for more details.
14572 Came here with a `.pushlevel' .
14574 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14575 CHANGES TO CODE IN `grokfield'. */
14578 start_method (declspecs
, declarator
, attrlist
)
14579 tree declarator
, declspecs
, attrlist
;
14581 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
14584 /* Something too ugly to handle. */
14585 if (fndecl
== NULL_TREE
)
14588 /* Pass friends other than inline friend functions back. */
14589 if (fndecl
== void_type_node
)
14592 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
14593 /* Not a function, tell parser to report parse error. */
14596 if (DECL_IN_AGGR_P (fndecl
))
14598 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
14600 if (DECL_CONTEXT (fndecl
)
14601 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
14602 cp_error ("`%D' is already defined in class `%T'", fndecl
,
14603 DECL_CONTEXT (fndecl
));
14605 return void_type_node
;
14608 check_template_shadow (fndecl
);
14610 DECL_THIS_INLINE (fndecl
) = 1;
14612 if (flag_default_inline
)
14613 DECL_INLINE (fndecl
) = 1;
14615 /* We process method specializations in finish_struct_1. */
14616 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
14617 fndecl
= push_template_decl (fndecl
);
14619 if (! DECL_FRIEND_P (fndecl
))
14621 if (TREE_CHAIN (fndecl
))
14623 fndecl
= copy_node (fndecl
);
14624 TREE_CHAIN (fndecl
) = NULL_TREE
;
14627 if (DECL_CONSTRUCTOR_P (fndecl
))
14629 if (! grok_ctor_properties (current_class_type
, fndecl
))
14630 return void_type_node
;
14632 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
14633 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
14636 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0);
14638 /* Make a place for the parms */
14640 current_binding_level
->parm_flag
= 1;
14642 DECL_IN_AGGR_P (fndecl
) = 1;
14646 /* Go through the motions of finishing a function definition.
14647 We don't compile this method until after the whole class has
14650 FINISH_METHOD must return something that looks as though it
14651 came from GROKFIELD (since we are defining a method, after all).
14653 This is called after parsing the body of the function definition.
14654 STMTS is the chain of statements that makes up the function body.
14656 DECL is the ..._DECL that `start_method' provided. */
14659 finish_method (decl
)
14662 register tree fndecl
= decl
;
14665 register tree link
;
14667 if (decl
== void_type_node
)
14670 old_initial
= DECL_INITIAL (fndecl
);
14672 /* Undo the level for the parms (from start_method).
14673 This is like poplevel, but it causes nothing to be
14674 saved. Saving information here confuses symbol-table
14675 output routines. Besides, this information will
14676 be correctly output when this method is actually
14679 /* Clear out the meanings of the local variables of this level;
14680 also record in each decl which block it belongs to. */
14682 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
14684 if (DECL_NAME (link
) != NULL_TREE
)
14685 pop_binding (DECL_NAME (link
), link
);
14686 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
14687 DECL_CONTEXT (link
) = NULL_TREE
;
14690 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
14691 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
14692 current_binding_level
->parm_flag
,
14693 current_binding_level
->keep
);
14695 poplevel (0, 0, 0);
14697 DECL_INITIAL (fndecl
) = old_initial
;
14699 /* We used to check if the context of FNDECL was different from
14700 current_class_type as another way to get inside here. This didn't work
14701 for String.cc in libg++. */
14702 if (DECL_FRIEND_P (fndecl
))
14704 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
14705 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
14706 decl
= void_type_node
;
14712 /* Called when a new struct TYPE is defined.
14713 If this structure or union completes the type of any previous
14714 variable declaration, lay it out and output its rtl. */
14717 hack_incomplete_structures (type
)
14721 struct binding_level
*level
;
14723 if (!type
) /* Don't do this for class templates. */
14726 if (namespace_bindings_p ())
14729 list
= &namespace_scope_incomplete
;
14733 level
= innermost_nonclass_level ();
14734 list
= &level
->incomplete
;
14741 tree decl
= TREE_VALUE (*list
);
14742 if ((decl
&& TREE_TYPE (decl
) == type
)
14743 || (TREE_TYPE (decl
)
14744 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14745 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
14747 int toplevel
= toplevel_bindings_p ();
14748 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14749 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
14750 layout_type (TREE_TYPE (decl
));
14751 layout_decl (decl
, 0);
14752 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
14756 expand_decl (decl
);
14757 cleanup
= maybe_build_cleanup (decl
);
14758 expand_decl_init (decl
);
14759 if (! expand_decl_cleanup (decl
, cleanup
))
14760 cp_error ("parser lost in parsing declaration of `%D'",
14763 *list
= TREE_CHAIN (*list
);
14766 list
= &TREE_CHAIN (*list
);
14769 /* Keep looking through artificial binding levels generated
14770 for local variables. */
14771 if (level
&& level
->keep
== 2)
14773 level
= level
->level_chain
;
14774 list
= &level
->incomplete
;
14781 /* If DECL is of a type which needs a cleanup, build that cleanup
14785 maybe_build_cleanup (decl
)
14788 tree type
= TREE_TYPE (decl
);
14790 if (type
!= error_mark_node
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
14792 int flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14795 if (TREE_CODE (type
) == ARRAY_TYPE
)
14799 mark_addressable (decl
);
14800 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14803 /* Optimize for space over speed here. */
14804 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14805 || flag_expensive_optimizations
)
14806 flags
|= LOOKUP_NONVIRTUAL
;
14808 rval
= build_delete (TREE_TYPE (rval
), rval
,
14809 sfk_complete_destructor
, flags
, 0);
14811 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14812 && ! TYPE_HAS_DESTRUCTOR (type
))
14813 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14814 build_tree_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14821 /* Expand a C++ expression at the statement level.
14822 This is needed to ferret out nodes which have UNKNOWN_TYPE.
14823 The C++ type checker should get all of these out when
14824 expressions are combined with other, type-providing, expressions,
14825 leaving only orphan expressions, such as:
14827 &class::bar; / / takes its address, but does nothing with it. */
14830 cplus_expand_expr_stmt (exp
)
14834 /* We should do this eventually, but right now this causes regex.o from
14835 libg++ to miscompile, and tString to core dump. */
14836 exp
= build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (exp
), exp
);
14839 /* If we don't do this, we end up down inside expand_expr
14840 trying to do TYPE_MODE on the ERROR_MARK, and really
14841 go outside the bounds of the type. */
14842 if (exp
!= error_mark_node
)
14843 expand_expr_stmt (exp
);
14846 /* When a stmt has been parsed, this function is called. */
14851 /* Always assume this statement was not an expression statement. If
14852 it actually was an expression statement, its our callers
14853 responsibility to fix this up. */
14854 last_expr_type
= NULL_TREE
;
14857 /* DECL was originally constructed as a non-static member function,
14858 but turned out to be static. Update it accordingly. */
14861 revert_static_member_fn (decl
)
14865 tree function
= TREE_TYPE (decl
);
14866 tree args
= TYPE_ARG_TYPES (function
);
14868 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14869 != TYPE_UNQUALIFIED
)
14870 cp_error ("static member function `%#D' declared with type qualifiers",
14873 args
= TREE_CHAIN (args
);
14874 tmp
= build_function_type (TREE_TYPE (function
), args
);
14875 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14876 tmp
= build_exception_variant (tmp
,
14877 TYPE_RAISES_EXCEPTIONS (function
));
14878 TREE_TYPE (decl
) = tmp
;
14879 if (DECL_ARGUMENTS (decl
))
14880 DECL_ARGUMENTS (decl
) = TREE_CHAIN (DECL_ARGUMENTS (decl
));
14881 DECL_STATIC_FUNCTION_P (decl
) = 1;
14884 /* Initialize the variables used during compilation of a C++
14888 push_cp_function_context (f
)
14889 struct function
*f
;
14891 struct cp_language_function
*p
14892 = ((struct cp_language_function
*)
14893 xcalloc (1, sizeof (struct cp_language_function
)));
14894 f
->language
= (struct language_function
*) p
;
14896 /* It takes an explicit call to expand_body to generate RTL for a
14900 /* Whenever we start a new function, we destroy temporaries in the
14902 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
14905 /* Free the language-specific parts of F, now that we've finished
14906 compiling the function. */
14909 pop_cp_function_context (f
)
14910 struct function
*f
;
14913 free (f
->language
);
14917 /* Mark P for GC. */
14920 mark_lang_function (p
)
14921 struct cp_language_function
*p
;
14926 ggc_mark_tree (p
->x_ctor_label
);
14927 ggc_mark_tree (p
->x_dtor_label
);
14928 ggc_mark_tree (p
->x_current_class_ptr
);
14929 ggc_mark_tree (p
->x_current_class_ref
);
14930 ggc_mark_tree (p
->x_eh_spec_try_block
);
14931 ggc_mark_tree (p
->x_scope_stmt_stack
);
14933 ggc_mark_rtx (p
->x_result_rtx
);
14935 mark_named_label_lists (&p
->x_named_labels
, &p
->x_named_label_uses
);
14936 mark_stmt_tree (&p
->base
.x_stmt_tree
);
14937 mark_binding_level (&p
->bindings
);
14940 /* Mark the language-specific data in F for GC. */
14943 mark_cp_function_context (f
)
14944 struct function
*f
;
14946 mark_lang_function ((struct cp_language_function
*) f
->language
);
14950 lang_mark_false_label_stack (l
)
14951 struct label_node
*l
;
14953 /* C++ doesn't use false_label_stack. It better be NULL. */
14954 my_friendly_assert (l
== NULL
, 19990904);
14961 enum tree_code code
= TREE_CODE (t
);
14962 if (code
== IDENTIFIER_NODE
)
14964 struct lang_identifier
*li
= (struct lang_identifier
*) t
;
14965 struct lang_id2
*li2
= li
->x
;
14966 ggc_mark_tree (li
->namespace_bindings
);
14967 ggc_mark_tree (li
->bindings
);
14968 ggc_mark_tree (li
->class_value
);
14969 ggc_mark_tree (li
->class_template_info
);
14973 ggc_mark_tree (li2
->label_value
);
14974 ggc_mark_tree (li2
->implicit_decl
);
14975 ggc_mark_tree (li2
->error_locus
);
14978 else if (code
== CPLUS_BINDING
)
14980 if (BINDING_HAS_LEVEL_P (t
))
14981 mark_binding_level (&BINDING_LEVEL (t
));
14983 ggc_mark_tree (BINDING_SCOPE (t
));
14984 ggc_mark_tree (BINDING_VALUE (t
));
14986 else if (code
== OVERLOAD
)
14987 ggc_mark_tree (OVL_FUNCTION (t
));
14988 else if (code
== TEMPLATE_PARM_INDEX
)
14989 ggc_mark_tree (TEMPLATE_PARM_DECL (t
));
14990 else if (TREE_CODE_CLASS (code
) == 'd')
14992 struct lang_decl
*ld
= DECL_LANG_SPECIFIC (t
);
14997 if (!DECL_GLOBAL_CTOR_P (t
)
14998 && !DECL_GLOBAL_DTOR_P (t
)
14999 && !DECL_THUNK_P (t
))
15000 ggc_mark_tree (ld
->decl_flags
.u2
.access
);
15001 else if (DECL_THUNK_P (t
))
15002 ggc_mark_tree (ld
->decl_flags
.u2
.vcall_offset
);
15003 ggc_mark_tree (ld
->decl_flags
.context
);
15004 if (TREE_CODE (t
) != NAMESPACE_DECL
)
15005 ggc_mark_tree (ld
->decl_flags
.u
.template_info
);
15007 mark_binding_level (&NAMESPACE_LEVEL (t
));
15008 if (CAN_HAVE_FULL_LANG_DECL_P (t
))
15010 ggc_mark_tree (ld
->befriending_classes
);
15011 ggc_mark_tree (ld
->saved_tree
);
15012 ggc_mark_tree (ld
->cloned_function
);
15013 if (!DECL_OVERLOADED_OPERATOR_P (t
))
15014 ggc_mark_tree (ld
->u2
.vtt_parm
);
15015 if (TREE_CODE (t
) == TYPE_DECL
)
15016 ggc_mark_tree (ld
->u
.sorted_fields
);
15017 else if (TREE_CODE (t
) == FUNCTION_DECL
15018 && !DECL_PENDING_INLINE_P (t
))
15019 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t
));
15023 else if (TREE_CODE_CLASS (code
) == 't')
15025 struct lang_type
*lt
= TYPE_LANG_SPECIFIC (t
);
15027 if (lt
&& !(TREE_CODE (t
) == POINTER_TYPE
15028 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
15031 ggc_mark_tree (lt
->primary_base
);
15032 ggc_mark_tree (lt
->vfields
);
15033 ggc_mark_tree (lt
->vbases
);
15034 ggc_mark_tree (lt
->tags
);
15035 ggc_mark_tree (lt
->size
);
15036 ggc_mark_tree (lt
->pure_virtuals
);
15037 ggc_mark_tree (lt
->friend_classes
);
15038 ggc_mark_tree (lt
->rtti
);
15039 ggc_mark_tree (lt
->methods
);
15040 ggc_mark_tree (lt
->template_info
);
15041 ggc_mark_tree (lt
->befriending_classes
);
15044 /* In the case of pointer-to-member function types, the
15045 TYPE_LANG_SPECIFIC is really just a tree. */
15046 ggc_mark_tree ((tree
) lt
);