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 language_function
*));
173 static void mark_stmt_tree
PARAMS ((struct 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;
205 tree vtable_entry_type;
206 tree delta_type_node;
209 tree __baselist_desc_type_node;
210 tree __i_desc_type_node, __m_desc_type_node;
211 tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type;
213 tree __t_desc_type_node;
215 tree __tp_desc_type_node;
217 tree ti_desc_type_node;
218 tree bltn_desc_type_node, ptr_desc_type_node;
219 tree ary_desc_type_node, func_desc_type_node, enum_desc_type_node;
220 tree class_desc_type_node, si_class_desc_type_node, vmi_class_desc_type_node;
221 tree ptm_desc_type_node;
222 tree base_desc_type_node;
224 Not needed yet? May be needed one day?
225 tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type;
226 tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type;
227 tree __ptmf_desc_array_type, __ptmd_desc_array_type;
230 tree class_type_node, record_type_node, union_type_node, enum_type_node;
231 tree unknown_type_node;
233 Array type `vtable_entry_type[]'
236 tree vtbl_ptr_type_node;
243 A FUNCTION_DECL which can call `abort'. Not necessarily the
244 one that the user will declare, but sufficient to be called
245 by routines that want to abort the program.
249 The FUNCTION_DECL for the default `::operator delete'.
251 tree global_delete_fndecl;
254 tree type_info_type_node, tinfo_decl_id, tinfo_decl_type;
259 tree cp_global_trees
[CPTI_MAX
];
261 /* Indicates that there is a type value in some namespace, although
262 that is not necessarily in scope at the moment. */
264 static tree global_type_node
;
269 /* Expect only namespace names now. */
270 static int only_namespace_names
;
272 /* If original DECL_RESULT of current function was a register,
273 but due to being an addressable named return value, would up
274 on the stack, this variable holds the named return value's
275 original location. */
277 #define original_result_rtx cp_function_chain->x_result_rtx
279 /* Used only for jumps to as-yet undefined labels, since jumps to
280 defined labels can have their validity checked immediately. */
282 struct named_label_use_list
284 struct binding_level
*binding_level
;
287 const char *filename_o_goto
;
289 struct named_label_use_list
*next
;
292 #define named_label_uses cp_function_chain->x_named_label_uses
294 /* A list of objects which have constructors or destructors
295 which reside in the global scope. The decl is stored in
296 the TREE_VALUE slot and the initializer is stored
297 in the TREE_PURPOSE slot. */
298 tree static_aggregates
;
302 /* A node for the integer constants 2, and 3. */
304 tree integer_two_node
, integer_three_node
;
306 /* Parsing a function declarator leaves here a chain of structure
307 and enum types declared in the parmlist. */
309 static tree last_function_parm_tags
;
311 /* Similar, for last_function_parm_tags. */
312 tree last_function_parms
;
313 static tree current_function_parm_tags
;
315 /* A list of all LABEL_DECLs in the function that have names. Here so
316 we can clear out their names' definitions at the end of the
317 function, and so we can check the validity of jumps to these labels. */
319 struct named_label_list
321 struct binding_level
*binding_level
;
327 struct named_label_list
*next
;
330 #define named_labels cp_function_chain->x_named_labels
332 /* Set to 0 at beginning of a function definition, and whenever
333 a label (case or named) is defined. Set to value of expression
334 returned from function when that value can be transformed into
335 a named return value. */
337 tree current_function_return_value
;
339 /* Nonzero means use the ISO C94 dialect of C. */
343 /* Nonzero means use the ISO C99 dialect of C. */
347 /* Nonzero means we are a hosted implementation for code shared with C. */
351 /* Nonzero means add default format_arg attributes for functions not
354 int flag_noniso_default_format_attributes
= 1;
356 /* Nonzero means give `double' the same size as `float'. */
358 extern int flag_short_double
;
360 /* Nonzero means don't recognize any builtin functions. */
362 extern int flag_no_builtin
;
364 /* Nonzero means don't recognize the non-ANSI builtin functions.
367 extern int flag_no_nonansi_builtin
;
369 /* Nonzero if we want to conserve space in the .o files. We do this
370 by putting uninitialized data and runtime initialized data into
371 .common instead of .data at the expense of not flagging multiple
373 extern int flag_conserve_space
;
375 /* C and C++ flags are in decl2.c. */
377 /* Flag used when debugging spew.c */
379 extern int spew_debug
;
381 /* A expression of value 0 with the same precision as a sizetype
383 tree signed_size_zero_node
;
385 /* The name of the anonymous namespace, throughout this translation
387 tree anonymous_namespace_name
;
389 /* The number of function bodies which we are currently processing.
390 (Zero if we are at namespace scope, one inside the body of a
391 function, two inside the body of a function in a local class, etc.) */
394 /* For each binding contour we allocate a binding_level structure
395 which records the names defined in that contour.
398 1) one for each function definition,
399 where internal declarations of the parameters appear.
400 2) one for each compound statement,
401 to record its declarations.
403 The current meaning of a name can be found by searching the levels
404 from the current one out to the global one.
406 Off to the side, may be the class_binding_level. This exists only
407 to catch class-local declarations. It is otherwise nonexistent.
409 Also there may be binding levels that catch cleanups that must be
410 run when exceptions occur. Thus, to see whether a name is bound in
411 the current scope, it is not enough to look in the
412 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
415 /* Note that the information in the `names' component of the global contour
416 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
420 /* A chain of _DECL nodes for all variables, constants, functions,
421 and typedef types. These are in the reverse of the order
422 supplied. There may be OVERLOADs on this list, too, but they
423 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
426 /* A list of structure, union and enum definitions, for looking up
428 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
429 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
430 or ENUMERAL_TYPE node.
432 C++: the TREE_VALUE nodes can be simple types for
433 component_bindings. */
436 /* A list of USING_DECL nodes. */
439 /* A list of used namespaces. PURPOSE is the namespace,
440 VALUE the common ancestor with this binding_level's namespace. */
441 tree using_directives
;
443 /* If this binding level is the binding level for a class, then
444 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
445 is the name of an entity bound in the class; the TREE_VALUE is
446 the IDENTIFIER_CLASS_VALUE before we entered the class. Thus,
447 when leaving class scope, we can restore the
448 IDENTIFIER_CLASS_VALUE by walking this list. The TREE_TYPE is
449 the DECL bound by this name in the class. */
452 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
453 is used for all binding levels. */
456 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
457 label in this scope. The TREE_PURPOSE is the previous value of
458 the IDENTIFIER_LABEL VALUE. */
459 tree shadowed_labels
;
461 /* For each level (except not the global one),
462 a chain of BLOCK nodes for all the levels
463 that were entered and exited one level down. */
466 /* The BLOCK node for this level, if one has been preallocated.
467 If 0, the BLOCK is allocated (if needed) when the level is popped. */
470 /* The _TYPE node for this level, if parm_flag == 2. */
473 /* The binding level which this one is contained in (inherits from). */
474 struct binding_level
*level_chain
;
476 /* List of decls in `names' that have incomplete
477 structure or union types. */
480 /* List of VAR_DECLS saved from a previous for statement.
481 These would be dead in ISO-conforming code, but might
482 be referenced in ARM-era code. These are stored in a
483 TREE_LIST; the TREE_VALUE is the actual declaration. */
484 tree dead_vars_from_for
;
486 /* 1 for the level that holds the parameters of a function.
487 2 for the level that holds a class declaration. */
488 unsigned parm_flag
: 2;
490 /* 1 means make a BLOCK for this level regardless of all else.
491 2 for temporary binding contours created by the compiler. */
494 /* Nonzero if this level "doesn't exist" for tags. */
495 unsigned tag_transparent
: 1;
497 /* Nonzero if this level can safely have additional
498 cleanup-needing variables added to it. */
499 unsigned more_cleanups_ok
: 1;
500 unsigned have_cleanups
: 1;
502 /* Nonzero if this scope is for storing the decls for template
503 parameters and generic decls; these decls will be discarded and
504 replaced with a TEMPLATE_DECL. */
505 unsigned template_parms_p
: 1;
507 /* Nonzero if this scope corresponds to the `<>' in a
508 `template <>' clause. Whenever this flag is set,
509 TEMPLATE_PARMS_P will be set as well. */
510 unsigned template_spec_p
: 1;
512 /* This is set for a namespace binding level. */
513 unsigned namespace_p
: 1;
515 /* True if this level is that of a for-statement where we need to
516 worry about ambiguous (ARM or ISO) scope rules. */
517 unsigned is_for_scope
: 1;
519 /* True if this level corresponds to an EH region, as for a try block.
520 Currently this information is only available while building the
522 unsigned eh_region
: 1;
524 /* Four bits left for this word. */
526 #if defined(DEBUG_CP_BINDING_LEVELS)
527 /* Binding depth at which this level began. */
528 unsigned binding_depth
;
529 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
532 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
534 /* The binding level currently in effect. */
536 #define current_binding_level \
538 ? cp_function_chain->bindings \
539 : scope_chain->bindings)
541 /* The binding level of the current class, if any. */
543 #define class_binding_level scope_chain->class_bindings
545 /* A chain of binding_level structures awaiting reuse. */
547 static struct binding_level
*free_binding_level
;
549 /* The outermost binding level, for names of file scope.
550 This is created when the compiler is started and exists
551 through the entire run. */
553 static struct binding_level
*global_binding_level
;
555 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
557 static int keep_next_level_flag
;
559 #if defined(DEBUG_CP_BINDING_LEVELS)
560 static int binding_depth
= 0;
561 static int is_class_level
= 0;
568 for (i
= 0; i
< binding_depth
*2; i
++)
571 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
573 static tree pushdecl_with_scope
PARAMS ((tree
, struct binding_level
*));
576 push_binding_level (newlevel
, tag_transparent
, keep
)
577 struct binding_level
*newlevel
;
578 int tag_transparent
, keep
;
580 /* Add this level to the front of the chain (stack) of levels that
582 bzero ((char*) newlevel
, sizeof (struct binding_level
));
583 newlevel
->level_chain
= current_binding_level
;
584 current_binding_level
= newlevel
;
585 newlevel
->tag_transparent
= tag_transparent
;
586 newlevel
->more_cleanups_ok
= 1;
588 newlevel
->keep
= keep
;
589 #if defined(DEBUG_CP_BINDING_LEVELS)
590 newlevel
->binding_depth
= binding_depth
;
592 fprintf (stderr
, "push %s level 0x%08x line %d\n",
593 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
596 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
599 /* Find the innermost enclosing class scope, and reset
600 CLASS_BINDING_LEVEL appropriately. */
603 find_class_binding_level ()
605 struct binding_level
*level
= current_binding_level
;
607 while (level
&& level
->parm_flag
!= 2)
608 level
= level
->level_chain
;
609 if (level
&& level
->parm_flag
== 2)
610 class_binding_level
= level
;
612 class_binding_level
= 0;
618 if (global_binding_level
)
620 /* Cannot pop a level, if there are none left to pop. */
621 if (current_binding_level
== global_binding_level
)
622 my_friendly_abort (123);
624 /* Pop the current level, and free the structure for reuse. */
625 #if defined(DEBUG_CP_BINDING_LEVELS)
628 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
629 (is_class_level
) ? "class" : "block",
630 current_binding_level
, lineno
);
631 if (is_class_level
!= (current_binding_level
== class_binding_level
))
634 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
637 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
639 register struct binding_level
*level
= current_binding_level
;
640 current_binding_level
= current_binding_level
->level_chain
;
641 level
->level_chain
= free_binding_level
;
642 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
643 if (level
->binding_depth
!= binding_depth
)
645 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
646 free_binding_level
= level
;
647 find_class_binding_level ();
652 suspend_binding_level ()
654 if (class_binding_level
)
655 current_binding_level
= class_binding_level
;
657 if (global_binding_level
)
659 /* Cannot suspend a level, if there are none left to suspend. */
660 if (current_binding_level
== global_binding_level
)
661 my_friendly_abort (123);
663 /* Suspend the current level. */
664 #if defined(DEBUG_CP_BINDING_LEVELS)
667 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
668 (is_class_level
) ? "class" : "block",
669 current_binding_level
, lineno
);
670 if (is_class_level
!= (current_binding_level
== class_binding_level
))
673 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
676 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
677 current_binding_level
= current_binding_level
->level_chain
;
678 find_class_binding_level ();
682 resume_binding_level (b
)
683 struct binding_level
*b
;
685 /* Resuming binding levels is meant only for namespaces,
686 and those cannot nest into classes. */
687 my_friendly_assert(!class_binding_level
, 386);
688 /* Also, resuming a non-directly nested namespace is a no-no. */
689 my_friendly_assert(b
->level_chain
== current_binding_level
, 386);
690 current_binding_level
= b
;
691 #if defined(DEBUG_CP_BINDING_LEVELS)
692 b
->binding_depth
= binding_depth
;
694 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
695 (is_class_level
) ? "class" : "block", b
, lineno
);
698 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
701 /* Create a new `struct binding_level'. */
704 struct binding_level
*
705 make_binding_level ()
708 return (struct binding_level
*) xmalloc (sizeof (struct binding_level
));
711 /* Nonzero if we are currently in the global binding level. */
716 return current_binding_level
== global_binding_level
;
719 /* Return the innermost binding level that is not for a class scope. */
721 static struct binding_level
*
722 innermost_nonclass_level ()
724 struct binding_level
*b
;
726 b
= current_binding_level
;
727 while (b
->parm_flag
== 2)
733 /* Nonzero if we are currently in a toplevel binding level. This
734 means either the global binding level or a namespace in a toplevel
735 binding level. Since there are no non-toplevel namespace levels,
736 this really means any namespace or template parameter level. We
737 also include a class whose context is toplevel. */
740 toplevel_bindings_p ()
742 struct binding_level
*b
= innermost_nonclass_level ();
744 return b
->namespace_p
|| b
->template_parms_p
;
747 /* Nonzero if this is a namespace scope, or if we are defining a class
748 which is itself at namespace scope, or whose enclosing class is
749 such a class, etc. */
752 namespace_bindings_p ()
754 struct binding_level
*b
= innermost_nonclass_level ();
756 return b
->namespace_p
;
759 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
760 unconditionally. Otherwise, use the normal logic to decide whether
761 or not to create a BLOCK. */
764 keep_next_level (keep
)
767 keep_next_level_flag
= keep
;
770 /* Nonzero if the current level needs to have a BLOCK made. */
775 return (current_binding_level
->blocks
!= NULL_TREE
776 || current_binding_level
->keep
777 || current_binding_level
->names
!= NULL_TREE
778 || (current_binding_level
->tags
!= NULL_TREE
779 && !current_binding_level
->tag_transparent
));
783 declare_namespace_level ()
785 current_binding_level
->namespace_p
= 1;
788 /* Returns non-zero if this scope was created to store template
792 template_parm_scope_p ()
794 return current_binding_level
->template_parms_p
;
797 /* Returns the kind of template specialization we are currently
798 processing, given that it's declaration contained N_CLASS_SCOPES
799 explicit scope qualifications. */
802 current_tmpl_spec_kind (n_class_scopes
)
805 int n_template_parm_scopes
= 0;
806 int seen_specialization_p
= 0;
807 int innermost_specialization_p
= 0;
808 struct binding_level
*b
;
810 /* Scan through the template parameter scopes. */
811 for (b
= current_binding_level
; b
->template_parms_p
; b
= b
->level_chain
)
813 /* If we see a specialization scope inside a parameter scope,
814 then something is wrong. That corresponds to a declaration
817 template <class T> template <> ...
819 which is always illegal since [temp.expl.spec] forbids the
820 specialization of a class member template if the enclosing
821 class templates are not explicitly specialized as well. */
822 if (b
->template_spec_p
)
824 if (n_template_parm_scopes
== 0)
825 innermost_specialization_p
= 1;
827 seen_specialization_p
= 1;
829 else if (seen_specialization_p
== 1)
830 return tsk_invalid_member_spec
;
832 ++n_template_parm_scopes
;
835 /* Handle explicit instantiations. */
836 if (processing_explicit_instantiation
)
838 if (n_template_parm_scopes
!= 0)
839 /* We've seen a template parameter list during an explicit
840 instantiation. For example:
842 template <class T> template void f(int);
844 This is erroneous. */
845 return tsk_invalid_expl_inst
;
847 return tsk_expl_inst
;
850 if (n_template_parm_scopes
< n_class_scopes
)
851 /* We've not seen enough template headers to match all the
852 specialized classes present. For example:
854 template <class T> void R<T>::S<T>::f(int);
856 This is illegal; there needs to be one set of template
857 parameters for each class. */
858 return tsk_insufficient_parms
;
859 else if (n_template_parm_scopes
== n_class_scopes
)
860 /* We're processing a non-template declaration (even though it may
861 be a member of a template class.) For example:
863 template <class T> void S<T>::f(int);
865 The `class T' maches the `S<T>', leaving no template headers
866 corresponding to the `f'. */
868 else if (n_template_parm_scopes
> n_class_scopes
+ 1)
869 /* We've got too many template headers. For example:
871 template <> template <class T> void f (T);
873 There need to be more enclosing classes. */
874 return tsk_excessive_parms
;
876 /* This must be a template. It's of the form:
878 template <class T> template <class U> void S<T>::f(U);
880 This is a specialization if the innermost level was a
881 specialization; otherwise it's just a definition of the
883 return innermost_specialization_p
? tsk_expl_spec
: tsk_template
;
887 set_class_shadows (shadows
)
890 class_binding_level
->class_shadowed
= shadows
;
893 /* Enter a new binding level.
894 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
895 not for that of tags. */
898 pushlevel (tag_transparent
)
901 struct binding_level
*newlevel
;
903 if (cfun
&& !doing_semantic_analysis_p ())
906 /* Reuse or create a struct for this binding level. */
907 #if defined(DEBUG_CP_BINDING_LEVELS)
909 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
910 if (free_binding_level
)
911 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
913 newlevel
= free_binding_level
;
914 free_binding_level
= free_binding_level
->level_chain
;
917 newlevel
= make_binding_level ();
919 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
920 GNU_xref_start_scope ((HOST_WIDE_INT
) newlevel
);
921 keep_next_level_flag
= 0;
924 /* Enter a new scope. The KIND indicates what kind of scope is being
935 case sk_template_spec
:
936 current_binding_level
->template_spec_p
= 1;
939 case sk_template_parms
:
940 current_binding_level
->template_parms_p
= 1;
944 my_friendly_abort (20000309);
948 /* Exit the current scope. */
957 note_level_for_for ()
959 current_binding_level
->is_for_scope
= 1;
962 /* Record that the current binding level represents a try block. */
967 current_binding_level
->eh_region
= 1;
970 /* For a binding between a name and an entity at a block scope,
971 this is the `struct binding_level' for the block. */
972 #define BINDING_LEVEL(NODE) \
973 (((struct tree_binding*)NODE)->scope.level)
975 /* Make DECL the innermost binding for ID. The LEVEL is the binding
976 level at which this declaration is being bound. */
979 push_binding (id
, decl
, level
)
982 struct binding_level
* level
;
986 binding
= make_node (CPLUS_BINDING
);
988 /* Now, fill in the binding information. */
989 BINDING_VALUE (binding
) = decl
;
990 BINDING_TYPE (binding
) = NULL_TREE
;
991 BINDING_LEVEL (binding
) = level
;
992 INHERITED_VALUE_BINDING_P (binding
) = 0;
993 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
994 BINDING_HAS_LEVEL_P (binding
) = 1;
996 /* And put it on the front of the list of bindings for ID. */
997 TREE_CHAIN (binding
) = IDENTIFIER_BINDING (id
);
998 IDENTIFIER_BINDING (id
) = binding
;
1001 /* ID is already bound in the current scope. But, DECL is an
1002 additional binding for ID in the same scope. This is the `struct
1003 stat' hack whereby a non-typedef class-name or enum-name can be
1004 bound at the same level as some other kind of entity. It's the
1005 responsibility of the caller to check that inserting this name is
1006 legal here. Returns nonzero if the new binding was successful. */
1008 add_binding (id
, decl
)
1012 tree binding
= IDENTIFIER_BINDING (id
);
1015 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
1016 /* The new name is the type name. */
1017 BINDING_TYPE (binding
) = decl
;
1018 else if (!BINDING_VALUE (binding
))
1019 /* This situation arises when push_class_level_binding moves an
1020 inherited type-binding out of the way to make room for a new
1022 BINDING_VALUE (binding
) = decl
;
1023 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
1024 && DECL_ARTIFICIAL (BINDING_VALUE (binding
)))
1026 /* The old binding was a type name. It was placed in
1027 BINDING_VALUE because it was thought, at the point it was
1028 declared, to be the only entity with such a name. Move the
1029 type name into the type slot; it is now hidden by the new
1031 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
1032 BINDING_VALUE (binding
) = decl
;
1033 INHERITED_VALUE_BINDING_P (binding
) = 0;
1035 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
1036 && TREE_CODE (decl
) == TYPE_DECL
1037 && DECL_NAME (decl
) == DECL_NAME (BINDING_VALUE (binding
))
1038 && same_type_p (TREE_TYPE (decl
),
1039 TREE_TYPE (BINDING_VALUE (binding
))))
1040 /* We have two typedef-names, both naming the same type to have
1041 the same name. This is OK because of:
1045 In a given scope, a typedef specifier can be used to redefine
1046 the name of any type declared in that scope to refer to the
1047 type to which it already refers. */
1049 /* There can be two block-scope declarations of the same variable,
1050 so long as they are `extern' declarations. */
1051 else if (TREE_CODE (decl
) == VAR_DECL
1052 && TREE_CODE (BINDING_VALUE (binding
)) == VAR_DECL
1053 && DECL_EXTERNAL (decl
)
1054 && DECL_EXTERNAL (BINDING_VALUE (binding
)))
1056 duplicate_decls (decl
, BINDING_VALUE (binding
));
1061 cp_error ("declaration of `%#D'", decl
);
1062 cp_error_at ("conflicts with previous declaration `%#D'",
1063 BINDING_VALUE (binding
));
1070 /* Add DECL to the list of things declared in B. */
1073 add_decl_to_level (decl
, b
)
1075 struct binding_level
*b
;
1077 /* We build up the list in reverse order, and reverse it later if
1079 TREE_CHAIN (decl
) = b
->names
;
1083 /* Bind DECL to ID in the current_binding_level, assumed to be a local
1084 binding level. If PUSH_USING is set in FLAGS, we know that DECL
1085 doesn't really belong to this binding level, that it got here
1086 through a using-declaration. */
1089 push_local_binding (id
, decl
, flags
)
1094 struct binding_level
*b
;
1096 /* Skip over any local classes. This makes sense if we call
1097 push_local_binding with a friend decl of a local class. */
1098 b
= current_binding_level
;
1099 while (b
->parm_flag
== 2)
1102 if (lookup_name_current_level (id
))
1104 /* Supplement the existing binding. */
1105 if (!add_binding (id
, decl
))
1106 /* It didn't work. Something else must be bound at this
1107 level. Do not add DECL to the list of things to pop
1112 /* Create a new binding. */
1113 push_binding (id
, decl
, b
);
1115 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
1116 /* We must put the OVERLOAD into a TREE_LIST since the
1117 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1118 decls that got here through a using-declaration. */
1119 decl
= build_tree_list (NULL_TREE
, decl
);
1121 /* And put DECL on the list of things declared by the current
1123 add_decl_to_level (decl
, b
);
1126 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
1127 binding was successful. */
1130 push_class_binding (id
, decl
)
1135 tree binding
= IDENTIFIER_BINDING (id
);
1138 /* Note that we declared this value so that we can issue an error if
1139 this an illegal redeclaration of a name already used for some
1141 note_name_declared_in_class (id
, decl
);
1143 if (binding
&& BINDING_LEVEL (binding
) == class_binding_level
)
1144 /* Supplement the existing binding. */
1145 result
= add_binding (id
, decl
);
1147 /* Create a new binding. */
1148 push_binding (id
, decl
, class_binding_level
);
1150 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1151 class-level declaration. Note that we do not use DECL here
1152 because of the possibility of the `struct stat' hack; if DECL is
1153 a class-name or enum-name we might prefer a field-name, or some
1155 IDENTIFIER_CLASS_VALUE (id
) = BINDING_VALUE (IDENTIFIER_BINDING (id
));
1157 /* If this is a binding from a base class, mark it as such. */
1158 binding
= IDENTIFIER_BINDING (id
);
1159 if (BINDING_VALUE (binding
) == decl
&& TREE_CODE (decl
) != TREE_LIST
)
1161 /* Any implicit typename must be from a base-class. The
1162 context for an implicit typename declaration is always
1163 the derived class in which the lookup was done, so the checks
1164 based on the context of DECL below will not trigger. */
1165 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl
))
1166 INHERITED_VALUE_BINDING_P (binding
) = 1;
1169 if (TREE_CODE (decl
) == OVERLOAD
)
1170 context
= CP_DECL_CONTEXT (OVL_CURRENT (decl
));
1173 my_friendly_assert (DECL_P (decl
), 0);
1174 context
= CP_DECL_CONTEXT (decl
);
1177 if (is_properly_derived_from (current_class_type
, context
))
1178 INHERITED_VALUE_BINDING_P (binding
) = 1;
1180 INHERITED_VALUE_BINDING_P (binding
) = 0;
1183 else if (BINDING_VALUE (binding
) == decl
)
1184 /* We only encounter a TREE_LIST when push_class_decls detects an
1185 ambiguity. Such an ambiguity can be overridden by a definition
1187 INHERITED_VALUE_BINDING_P (binding
) = 1;
1192 /* Remove the binding for DECL which should be the innermost binding
1196 pop_binding (id
, decl
)
1202 if (id
== NULL_TREE
)
1203 /* It's easiest to write the loops that call this function without
1204 checking whether or not the entities involved have names. We
1205 get here for such an entity. */
1208 /* Get the innermost binding for ID. */
1209 binding
= IDENTIFIER_BINDING (id
);
1211 /* The name should be bound. */
1212 my_friendly_assert (binding
!= NULL_TREE
, 0);
1214 /* The DECL will be either the ordinary binding or the type
1215 binding for this identifier. Remove that binding. */
1216 if (BINDING_VALUE (binding
) == decl
)
1217 BINDING_VALUE (binding
) = NULL_TREE
;
1218 else if (BINDING_TYPE (binding
) == decl
)
1219 BINDING_TYPE (binding
) = NULL_TREE
;
1221 my_friendly_abort (0);
1223 if (!BINDING_VALUE (binding
) && !BINDING_TYPE (binding
))
1224 /* We're completely done with the innermost binding for this
1225 identifier. Unhook it from the list of bindings. */
1226 IDENTIFIER_BINDING (id
) = TREE_CHAIN (binding
);
1229 /* When a label goes out of scope, check to see if that label was used
1230 in a valid manner, and issue any appropriate warnings or errors. */
1233 pop_label (label
, old_value
)
1237 if (!processing_template_decl
&& doing_semantic_analysis_p ())
1239 if (DECL_INITIAL (label
) == NULL_TREE
)
1241 cp_error_at ("label `%D' used but not defined", label
);
1242 /* Avoid crashing later. */
1243 define_label (input_filename
, 1, DECL_NAME (label
));
1245 else if (warn_unused_label
&& !TREE_USED (label
))
1246 cp_warning_at ("label `%D' defined but not used", label
);
1249 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), old_value
);
1252 /* At the end of a function, all labels declared within the function
1253 go out of scope. BLOCK is the top-level block for the
1260 struct named_label_list
*link
;
1262 /* Clear out the definitions of all label names, since their scopes
1264 for (link
= named_labels
; link
; link
= link
->next
)
1266 pop_label (link
->label_decl
, link
->old_value
);
1267 /* Put the labels into the "variables" of the top-level block,
1268 so debugger can see them. */
1269 TREE_CHAIN (link
->label_decl
) = BLOCK_VARS (block
);
1270 BLOCK_VARS (block
) = link
->label_decl
;
1273 named_labels
= NULL
;
1276 /* Exit a binding level.
1277 Pop the level off, and restore the state of the identifier-decl mappings
1278 that were in effect when this level was entered.
1280 If KEEP == 1, this level had explicit declarations, so
1281 and create a "block" (a BLOCK node) for the level
1282 to record its declarations and subblocks for symbol table output.
1284 If FUNCTIONBODY is nonzero, this level is the body of a function,
1285 so create a block as if KEEP were set and also clear out all
1288 If REVERSE is nonzero, reverse the order of decls before putting
1289 them into the BLOCK. */
1292 poplevel (keep
, reverse
, functionbody
)
1298 /* The chain of decls was accumulated in reverse order.
1299 Put it into forward order, just for cleanliness. */
1301 int tmp
= functionbody
;
1302 int real_functionbody
;
1305 tree block
= NULL_TREE
;
1307 int block_previously_created
;
1308 int leaving_for_scope
;
1310 if (cfun
&& !doing_semantic_analysis_p ())
1313 my_friendly_assert (current_binding_level
->parm_flag
!= 2,
1316 real_functionbody
= (current_binding_level
->keep
== 2
1317 ? ((functionbody
= 0), tmp
) : functionbody
);
1318 tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1319 subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1321 my_friendly_assert (!current_binding_level
->class_shadowed
,
1324 /* We used to use KEEP == 2 to indicate that the new block should go
1325 at the beginning of the list of blocks at this binding level,
1326 rather than the end. This hack is no longer used. */
1327 my_friendly_assert (keep
== 0 || keep
== 1, 0);
1329 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1330 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1331 current_binding_level
->parm_flag
,
1332 current_binding_level
->keep
);
1334 if (current_binding_level
->keep
== 1)
1337 /* Any uses of undefined labels, and any defined labels, now operate
1338 under constraints of next binding contour. */
1339 if (cfun
&& !functionbody
)
1341 struct binding_level
*level_chain
;
1342 level_chain
= current_binding_level
->level_chain
;
1345 struct named_label_use_list
*uses
;
1346 struct named_label_list
*labels
;
1347 for (labels
= named_labels
; labels
; labels
= labels
->next
)
1348 if (labels
->binding_level
== current_binding_level
)
1351 if (current_binding_level
->eh_region
)
1352 labels
->eh_region
= 1;
1353 for (decl
= labels
->names_in_scope
; decl
;
1354 decl
= TREE_CHAIN (decl
))
1355 if (decl_jump_unsafe (decl
))
1356 labels
->bad_decls
= tree_cons (NULL_TREE
, decl
,
1358 labels
->binding_level
= level_chain
;
1359 labels
->names_in_scope
= level_chain
->names
;
1362 for (uses
= named_label_uses
; uses
; uses
= uses
->next
)
1363 if (uses
->binding_level
== current_binding_level
)
1365 uses
->binding_level
= level_chain
;
1366 uses
->names_in_scope
= level_chain
->names
;
1371 /* Get the decls in the order they were written.
1372 Usually current_binding_level->names is in reverse order.
1373 But parameter decls were previously put in forward order. */
1376 current_binding_level
->names
1377 = decls
= nreverse (current_binding_level
->names
);
1379 decls
= current_binding_level
->names
;
1381 /* Output any nested inline functions within this block
1382 if they weren't already output. */
1383 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1384 if (TREE_CODE (decl
) == FUNCTION_DECL
1385 && ! TREE_ASM_WRITTEN (decl
)
1386 && DECL_INITIAL (decl
) != NULL_TREE
1387 && TREE_ADDRESSABLE (decl
)
1388 && decl_function_context (decl
) == current_function_decl
)
1390 /* If this decl was copied from a file-scope decl
1391 on account of a block-scope extern decl,
1392 propagate TREE_ADDRESSABLE to the file-scope decl. */
1393 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1394 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1397 push_function_context ();
1398 output_inline_function (decl
);
1399 pop_function_context ();
1403 /* When not in function-at-a-time mode, expand_end_bindings will
1404 warn about unused variables. But, in function-at-a-time mode
1405 expand_end_bindings is not passed the list of variables in the
1406 current scope, and therefore no warning is emitted. So, we
1407 explicitly warn here. */
1408 if (!processing_template_decl
)
1409 warn_about_unused_variables (getdecls ());
1411 /* If there were any declarations or structure tags in that level,
1412 or if this level is a function body,
1413 create a BLOCK to record them for the life of this function. */
1415 block_previously_created
= (current_binding_level
->this_block
!= NULL_TREE
);
1416 if (block_previously_created
)
1417 block
= current_binding_level
->this_block
;
1418 else if (keep
== 1 || functionbody
)
1419 block
= make_node (BLOCK
);
1420 if (block
!= NULL_TREE
)
1422 if (block_previously_created
)
1424 if (decls
|| tags
|| subblocks
)
1426 if (BLOCK_VARS (block
))
1427 warning ("internal compiler error: debugging info corrupted");
1429 BLOCK_VARS (block
) = decls
;
1431 /* We can have previous subblocks and new subblocks when
1432 doing fixup_gotos with complex cleanups. We chain the new
1433 subblocks onto the end of any pre-existing subblocks. */
1434 BLOCK_SUBBLOCKS (block
) = chainon (BLOCK_SUBBLOCKS (block
),
1440 BLOCK_VARS (block
) = decls
;
1441 BLOCK_SUBBLOCKS (block
) = subblocks
;
1445 /* In each subblock, record that this is its superior. */
1447 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1448 BLOCK_SUPERCONTEXT (link
) = block
;
1450 /* We still support the old for-scope rules, whereby the variables
1451 in a for-init statement were in scope after the for-statement
1452 ended. We only use the new rules in flag_new_for_scope is
1455 = current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1;
1457 /* Remove declarations for all the DECLs in this level. */
1458 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1460 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
1461 && DECL_NAME (link
))
1464 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link
)));
1468 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
1470 ns_binding
= NULL_TREE
;
1473 && (BINDING_LEVEL (outer_binding
)
1474 == current_binding_level
->level_chain
))
1475 /* We have something like:
1480 and we are leaving the `for' scope. There's no reason to
1481 keep the binding of the inner `i' in this case. */
1482 pop_binding (DECL_NAME (link
), link
);
1483 else if ((outer_binding
1484 && (TREE_CODE (BINDING_VALUE (outer_binding
))
1487 && TREE_CODE (ns_binding
) == TYPE_DECL
))
1488 /* Here, we have something like:
1496 We must pop the for-scope binding so we know what's a
1497 type and what isn't. */
1498 pop_binding (DECL_NAME (link
), link
);
1501 /* Mark this VAR_DECL as dead so that we can tell we left it
1502 there only for backward compatibility. */
1503 DECL_DEAD_FOR_LOCAL (link
) = 1;
1505 /* Keep track of what should of have happenned when we
1506 popped the binding. */
1507 if (outer_binding
&& BINDING_VALUE (outer_binding
))
1508 DECL_SHADOWED_FOR_VAR (link
)
1509 = BINDING_VALUE (outer_binding
);
1511 /* Add it to the list of dead variables in the next
1512 outermost binding to that we can remove these when we
1513 leave that binding. */
1514 current_binding_level
->level_chain
->dead_vars_from_for
1515 = tree_cons (NULL_TREE
, link
,
1516 current_binding_level
->level_chain
->
1517 dead_vars_from_for
);
1519 /* Although we don't pop the CPLUS_BINDING, we do clear
1520 its BINDING_LEVEL since the level is going away now. */
1521 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link
)))
1527 /* Remove the binding. */
1529 if (TREE_CODE (decl
) == TREE_LIST
)
1530 decl
= TREE_VALUE (decl
);
1532 pop_binding (DECL_NAME (decl
), decl
);
1533 else if (TREE_CODE (decl
) == OVERLOAD
)
1534 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
1536 my_friendly_abort (0);
1540 /* Remove declarations for any `for' variables from inner scopes
1541 that we kept around. */
1542 for (link
= current_binding_level
->dead_vars_from_for
;
1543 link
; link
= TREE_CHAIN (link
))
1544 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
1546 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1547 for (link
= current_binding_level
->type_shadowed
;
1548 link
; link
= TREE_CHAIN (link
))
1549 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1551 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1552 for (link
= current_binding_level
->shadowed_labels
;
1554 link
= TREE_CHAIN (link
))
1555 pop_label (TREE_VALUE (link
), TREE_PURPOSE (link
));
1557 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1558 list if a `using' declaration put them there. The debugging
1559 back-ends won't understand OVERLOAD, so we remove them here.
1560 Because the BLOCK_VARS are (temporarily) shared with
1561 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1562 popped all the bindings. */
1567 for (d
= &BLOCK_VARS (block
); *d
; )
1569 if (TREE_CODE (*d
) == TREE_LIST
)
1570 *d
= TREE_CHAIN (*d
);
1572 d
= &TREE_CHAIN (*d
);
1576 /* If the level being exited is the top level of a function,
1577 check over all the labels. */
1580 /* Since this is the top level block of a function, the vars are
1581 the function's parameters. Don't leave them in the BLOCK
1582 because they are found in the FUNCTION_DECL instead. */
1583 BLOCK_VARS (block
) = 0;
1587 tmp
= current_binding_level
->keep
;
1589 pop_binding_level ();
1591 DECL_INITIAL (current_function_decl
) = block
;
1594 if (!block_previously_created
)
1595 current_binding_level
->blocks
1596 = chainon (current_binding_level
->blocks
, block
);
1598 /* If we did not make a block for the level just exited,
1599 any blocks made for inner levels
1600 (since they cannot be recorded as subblocks in that level)
1601 must be carried forward so they will later become subblocks
1602 of something else. */
1604 current_binding_level
->blocks
1605 = chainon (current_binding_level
->blocks
, subblocks
);
1607 /* Each and every BLOCK node created here in `poplevel' is important
1608 (e.g. for proper debugging information) so if we created one
1609 earlier, mark it as "used". */
1611 TREE_USED (block
) = 1;
1613 /* Take care of compiler's internal binding structures. */
1619 = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/1);
1622 SCOPE_STMT_BLOCK (TREE_PURPOSE (scope_stmts
)) = block
;
1623 SCOPE_STMT_BLOCK (TREE_VALUE (scope_stmts
)) = block
;
1626 block
= poplevel (keep
, reverse
, functionbody
);
1632 /* Delete the node BLOCK from the current binding level.
1633 This is used for the block inside a stmt expr ({...})
1634 so that the block can be reinserted where appropriate. */
1637 delete_block (block
)
1641 if (current_binding_level
->blocks
== block
)
1642 current_binding_level
->blocks
= TREE_CHAIN (block
);
1643 for (t
= current_binding_level
->blocks
; t
;)
1645 if (TREE_CHAIN (t
) == block
)
1646 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1650 TREE_CHAIN (block
) = NULL_TREE
;
1651 /* Clear TREE_USED which is always set by poplevel.
1652 The flag is set again if insert_block is called. */
1653 TREE_USED (block
) = 0;
1656 /* Insert BLOCK at the end of the list of subblocks of the
1657 current binding level. This is used when a BIND_EXPR is expanded,
1658 to handle the BLOCK node inside the BIND_EXPR. */
1661 insert_block (block
)
1664 TREE_USED (block
) = 1;
1665 current_binding_level
->blocks
1666 = chainon (current_binding_level
->blocks
, block
);
1669 /* Set the BLOCK node for the innermost scope
1670 (the one we are currently in). */
1674 register tree block
;
1676 current_binding_level
->this_block
= block
;
1679 /* Do a pushlevel for class declarations. */
1684 register struct binding_level
*newlevel
;
1686 /* Reuse or create a struct for this binding level. */
1687 #if defined(DEBUG_CP_BINDING_LEVELS)
1689 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1690 if (free_binding_level
)
1691 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1693 newlevel
= free_binding_level
;
1694 free_binding_level
= free_binding_level
->level_chain
;
1697 newlevel
= make_binding_level ();
1699 #if defined(DEBUG_CP_BINDING_LEVELS)
1701 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1703 push_binding_level (newlevel
, 0, 0);
1705 class_binding_level
= current_binding_level
;
1706 class_binding_level
->parm_flag
= 2;
1707 class_binding_level
->this_class
= current_class_type
;
1710 /* ...and a poplevel for class declarations. */
1715 register struct binding_level
*level
= class_binding_level
;
1718 my_friendly_assert (level
!= 0, 354);
1720 /* If we're leaving a toplevel class, don't bother to do the setting
1721 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1722 shouldn't even be used when current_class_type isn't set, and second,
1723 if we don't touch it here, we're able to use the cache effect if the
1724 next time we're entering a class scope, it is the same class. */
1725 if (current_class_depth
!= 1)
1727 struct binding_level
* b
;
1729 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1730 for (shadowed
= level
->class_shadowed
;
1732 shadowed
= TREE_CHAIN (shadowed
))
1733 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = NULL_TREE
;
1735 /* Find the next enclosing class, and recreate
1736 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1737 b
= level
->level_chain
;
1738 while (b
&& b
->parm_flag
!= 2)
1742 for (shadowed
= b
->class_shadowed
;
1744 shadowed
= TREE_CHAIN (shadowed
))
1748 t
= IDENTIFIER_BINDING (TREE_PURPOSE (shadowed
));
1749 while (t
&& BINDING_LEVEL (t
) != b
)
1753 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
))
1754 = BINDING_VALUE (t
);
1758 /* Remember to save what IDENTIFIER's were bound in this scope so we
1759 can recover from cache misses. */
1761 previous_class_type
= current_class_type
;
1762 previous_class_values
= class_binding_level
->class_shadowed
;
1764 for (shadowed
= level
->type_shadowed
;
1766 shadowed
= TREE_CHAIN (shadowed
))
1767 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1769 /* Remove the bindings for all of the class-level declarations. */
1770 for (shadowed
= level
->class_shadowed
;
1772 shadowed
= TREE_CHAIN (shadowed
))
1773 pop_binding (TREE_PURPOSE (shadowed
), TREE_TYPE (shadowed
));
1775 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1776 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1777 class_binding_level
->parm_flag
,
1778 class_binding_level
->keep
);
1780 /* Now, pop out of the binding level which we created up in the
1781 `pushlevel_class' routine. */
1782 #if defined(DEBUG_CP_BINDING_LEVELS)
1784 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1786 pop_binding_level ();
1789 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1790 for any names in enclosing classes. */
1793 clear_identifier_class_values ()
1797 if (!class_binding_level
)
1800 for (t
= class_binding_level
->class_shadowed
;
1803 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
1806 /* Returns non-zero if T is a virtual function table. */
1809 vtable_decl_p (t
, data
)
1811 void *data ATTRIBUTE_UNUSED
;
1813 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
1816 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1820 vtype_decl_p (t
, data
)
1822 void *data ATTRIBUTE_UNUSED
;
1824 return (TREE_CODE (t
) == TYPE_DECL
1825 && TREE_CODE (TREE_TYPE (t
)) == RECORD_TYPE
1826 && TYPE_POLYMORPHIC_P (TREE_TYPE (t
)));
1829 /* Return the declarations that are members of the namespace NS. */
1832 cp_namespace_decls (ns
)
1835 return NAMESPACE_LEVEL (ns
)->names
;
1838 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1839 itself, calling F for each. The DATA is passed to F as well. */
1842 walk_namespaces_r (namespace, f
, data
)
1844 walk_namespaces_fn f
;
1850 result
|= (*f
) (namespace, data
);
1852 for (current
= cp_namespace_decls (namespace);
1854 current
= TREE_CHAIN (current
))
1856 if (TREE_CODE (current
) != NAMESPACE_DECL
1857 || DECL_NAMESPACE_ALIAS (current
))
1859 if (!DECL_LANG_SPECIFIC (current
))
1862 my_friendly_assert (current
== std_node
, 393);
1866 /* We found a namespace. */
1867 result
|= walk_namespaces_r (current
, f
, data
);
1873 /* Walk all the namespaces, calling F for each. The DATA is passed to
1877 walk_namespaces (f
, data
)
1878 walk_namespaces_fn f
;
1881 return walk_namespaces_r (global_namespace
, f
, data
);
1884 struct walk_globals_data
{
1885 walk_globals_pred p
;
1890 /* Walk the global declarations in NAMESPACE. Whenever one is found
1891 for which P returns non-zero, call F with its address. If any call
1892 to F returns a non-zero value, return a non-zero value. */
1895 walk_globals_r (namespace, data
)
1899 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1900 walk_globals_pred p
= wgd
->p
;
1901 walk_globals_fn f
= wgd
->f
;
1902 void *d
= wgd
->data
;
1906 t
= &NAMESPACE_LEVEL (namespace)->names
;
1913 result
|= (*f
) (t
, d
);
1915 /* If F changed *T, then *T still points at the next item to
1918 t
= &TREE_CHAIN (*t
);
1924 /* Walk the global declarations. Whenever one is found for which P
1925 returns non-zero, call F with its address. If any call to F
1926 returns a non-zero value, return a non-zero value. */
1929 walk_globals (p
, f
, data
)
1930 walk_globals_pred p
;
1934 struct walk_globals_data wgd
;
1939 return walk_namespaces (walk_globals_r
, &wgd
);
1942 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1943 DATA is non-NULL, this is the last time we will call
1944 wrapup_global_declarations for this NAMESPACE. */
1947 wrapup_globals_for_namespace (namespace, data
)
1951 tree globals
= cp_namespace_decls (namespace);
1952 int len
= list_length (globals
);
1953 tree
*vec
= (tree
*) alloca (sizeof (tree
) * len
);
1957 int last_time
= (data
!= 0);
1959 if (last_time
&& namespace == global_namespace
)
1960 /* Let compile_file handle the global namespace. */
1963 /* Process the decls in reverse order--earliest first.
1964 Put them into VEC from back to front, then take out from front. */
1966 for (i
= 0, decl
= globals
; i
< len
; i
++, decl
= TREE_CHAIN (decl
))
1968 /* Pretend we've output an unused static variable. This ensures
1969 that the toplevel __FUNCTION__ etc won't be emitted, unless
1971 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_ARTIFICIAL (decl
)
1972 && !TREE_PUBLIC (decl
) && !TREE_USED (decl
))
1974 TREE_ASM_WRITTEN (decl
) = 1;
1975 DECL_IGNORED_P (decl
) = 1;
1977 vec
[len
- i
- 1] = decl
;
1982 check_global_declarations (vec
, len
);
1986 /* Temporarily mark vtables as external. That prevents
1987 wrapup_global_declarations from writing them out; we must process
1988 them ourselves in finish_vtable_vardecl. */
1989 for (i
= 0; i
< len
; ++i
)
1990 if (vtable_decl_p (vec
[i
], /*data=*/0) && !DECL_EXTERNAL (vec
[i
]))
1992 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 1;
1993 DECL_EXTERNAL (vec
[i
]) = 1;
1996 /* Write out any globals that need to be output. */
1997 result
= wrapup_global_declarations (vec
, len
);
1999 /* Undo the hack to DECL_EXTERNAL above. */
2000 for (i
= 0; i
< len
; ++i
)
2001 if (vtable_decl_p (vec
[i
], /*data=*/0)
2002 && DECL_NOT_REALLY_EXTERN (vec
[i
]))
2004 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 0;
2005 DECL_EXTERNAL (vec
[i
]) = 0;
2012 /* Mark ARG (which is really a struct binding_level **) for GC. */
2015 mark_binding_level (arg
)
2018 struct binding_level
*lvl
= *(struct binding_level
**)arg
;
2020 for (; lvl
; lvl
= lvl
->level_chain
)
2022 ggc_mark_tree (lvl
->names
);
2023 ggc_mark_tree (lvl
->tags
);
2024 ggc_mark_tree (lvl
->usings
);
2025 ggc_mark_tree (lvl
->using_directives
);
2026 ggc_mark_tree (lvl
->class_shadowed
);
2027 ggc_mark_tree (lvl
->type_shadowed
);
2028 ggc_mark_tree (lvl
->shadowed_labels
);
2029 ggc_mark_tree (lvl
->blocks
);
2030 ggc_mark_tree (lvl
->this_block
);
2031 ggc_mark_tree (lvl
->this_class
);
2032 ggc_mark_tree (lvl
->incomplete
);
2033 ggc_mark_tree (lvl
->dead_vars_from_for
);
2038 mark_named_label_lists (labs
, uses
)
2042 struct named_label_list
*l
= *(struct named_label_list
**)labs
;
2043 struct named_label_use_list
*u
= *(struct named_label_use_list
**)uses
;
2045 for (; l
; l
= l
->next
)
2048 mark_binding_level (l
->binding_level
);
2049 ggc_mark_tree (l
->old_value
);
2050 ggc_mark_tree (l
->label_decl
);
2051 ggc_mark_tree (l
->bad_decls
);
2054 for (; u
; u
= u
->next
)
2058 /* For debugging. */
2059 static int no_print_functions
= 0;
2060 static int no_print_builtins
= 0;
2063 print_binding_level (lvl
)
2064 struct binding_level
*lvl
;
2068 fprintf (stderr
, " blocks=");
2069 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
2070 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
2071 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
2072 if (lvl
->tag_transparent
)
2073 fprintf (stderr
, " tag-transparent");
2074 if (lvl
->more_cleanups_ok
)
2075 fprintf (stderr
, " more-cleanups-ok");
2076 if (lvl
->have_cleanups
)
2077 fprintf (stderr
, " have-cleanups");
2078 fprintf (stderr
, "\n");
2081 fprintf (stderr
, " names:\t");
2082 /* We can probably fit 3 names to a line? */
2083 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
2085 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
2087 if (no_print_builtins
2088 && (TREE_CODE (t
) == TYPE_DECL
)
2089 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
2092 /* Function decls tend to have longer names. */
2093 if (TREE_CODE (t
) == FUNCTION_DECL
)
2100 fprintf (stderr
, "\n\t");
2103 print_node_brief (stderr
, "", t
, 0);
2104 if (t
== error_mark_node
)
2108 fprintf (stderr
, "\n");
2112 fprintf (stderr
, " tags:\t");
2114 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
2116 if (TREE_PURPOSE (t
) == NULL_TREE
)
2118 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2125 fprintf (stderr
, "\n\t");
2128 if (TREE_PURPOSE (t
) == NULL_TREE
)
2130 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
2131 fprintf (stderr
, ">");
2133 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2134 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2137 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
2138 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2139 fprintf (stderr
, ">");
2143 fprintf (stderr
, "\n");
2145 if (lvl
->class_shadowed
)
2147 fprintf (stderr
, " class-shadowed:");
2148 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
2150 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2152 fprintf (stderr
, "\n");
2154 if (lvl
->type_shadowed
)
2156 fprintf (stderr
, " type-shadowed:");
2157 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2159 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2161 fprintf (stderr
, "\n");
2166 print_other_binding_stack (stack
)
2167 struct binding_level
*stack
;
2169 struct binding_level
*level
;
2170 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
2172 fprintf (stderr
, "binding level ");
2173 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
2174 fprintf (stderr
, "\n");
2175 print_binding_level (level
);
2180 print_binding_stack ()
2182 struct binding_level
*b
;
2183 fprintf (stderr
, "current_binding_level=");
2184 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
2185 fprintf (stderr
, "\nclass_binding_level=");
2186 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
2187 fprintf (stderr
, "\nglobal_binding_level=");
2188 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
2189 fprintf (stderr
, "\n");
2190 if (class_binding_level
)
2192 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
2193 if (b
== current_binding_level
)
2196 b
= class_binding_level
;
2198 b
= current_binding_level
;
2201 b
= current_binding_level
;
2202 print_other_binding_stack (b
);
2203 fprintf (stderr
, "global:\n");
2204 print_binding_level (global_binding_level
);
2207 /* Namespace binding access routines: The namespace_bindings field of
2208 the identifier is polymorphic, with three possible values:
2209 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2210 indicating the BINDING_VALUE of global_namespace. */
2212 /* Check whether the a binding for the name to scope is known.
2213 Assumes that the bindings of the name are already a list
2214 of bindings. Returns the binding found, or NULL_TREE. */
2217 find_binding (name
, scope
)
2221 tree iter
, prev
= NULL_TREE
;
2223 scope
= ORIGINAL_NAMESPACE (scope
);
2225 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
2226 iter
= TREE_CHAIN (iter
))
2228 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
2229 if (BINDING_SCOPE (iter
) == scope
)
2231 /* Move binding found to the front of the list, so
2232 subsequent lookups will find it faster. */
2235 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
2236 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
2237 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
2246 /* Always returns a binding for name in scope. If the
2247 namespace_bindings is not a list, convert it to one first.
2248 If no binding is found, make a new one. */
2251 binding_for_name (name
, scope
)
2255 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2258 scope
= ORIGINAL_NAMESPACE (scope
);
2260 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
2262 /* Get rid of optimization for global scope. */
2263 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
2264 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
2265 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2267 if (b
&& (result
= find_binding (name
, scope
)))
2269 /* Not found, make a new one. */
2270 result
= make_node (CPLUS_BINDING
);
2271 TREE_CHAIN (result
) = b
;
2272 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2273 BINDING_SCOPE (result
) = scope
;
2274 BINDING_TYPE (result
) = NULL_TREE
;
2275 BINDING_VALUE (result
) = NULL_TREE
;
2279 /* Return the binding value for name in scope, considering that
2280 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2283 namespace_binding (name
, scope
)
2287 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2290 if (scope
== NULL_TREE
)
2291 scope
= global_namespace
;
2292 if (TREE_CODE (b
) != CPLUS_BINDING
)
2293 return (scope
== global_namespace
) ? b
: NULL_TREE
;
2294 name
= find_binding (name
,scope
);
2295 if (name
== NULL_TREE
)
2297 return BINDING_VALUE (name
);
2300 /* Set the binding value for name in scope. If modifying the binding
2301 of global_namespace is attempted, try to optimize it. */
2304 set_namespace_binding (name
, scope
, val
)
2311 if (scope
== NULL_TREE
)
2312 scope
= global_namespace
;
2314 if (scope
== global_namespace
)
2316 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2317 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
2319 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
2323 b
= binding_for_name (name
, scope
);
2324 BINDING_VALUE (b
) = val
;
2327 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2328 select a name that is unique to this compilation unit. */
2331 push_namespace (name
)
2336 int implicit_use
= 0;
2338 if (!global_namespace
)
2340 /* This must be ::. */
2341 my_friendly_assert (name
== get_identifier ("::"), 377);
2346 /* The name of anonymous namespace is unique for the translation
2348 if (!anonymous_namespace_name
)
2349 anonymous_namespace_name
= get_file_function_name ('N');
2350 name
= anonymous_namespace_name
;
2351 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2353 /* Reopening anonymous namespace. */
2357 else if (current_namespace
== global_namespace
2358 && name
== DECL_NAME (std_node
))
2365 /* Check whether this is an extended namespace definition. */
2366 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2367 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
2370 if (DECL_NAMESPACE_ALIAS (d
))
2372 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2373 d
, DECL_NAMESPACE_ALIAS (d
));
2374 d
= DECL_NAMESPACE_ALIAS (d
);
2381 /* Make a new namespace, binding the name to it. */
2382 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
2383 /* The global namespace is not pushed, and the global binding
2384 level is set elsewhere. */
2387 DECL_CONTEXT (d
) = FROB_CONTEXT (current_namespace
);
2390 declare_namespace_level ();
2391 NAMESPACE_LEVEL (d
) = current_binding_level
;
2395 resume_binding_level (NAMESPACE_LEVEL (d
));
2398 do_using_directive (d
);
2399 /* Enter the name space. */
2400 current_namespace
= d
;
2403 /* Pop from the scope of the current namespace. */
2408 if (current_namespace
== global_namespace
)
2410 my_friendly_assert (in_std
>0, 980421);
2414 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
2415 /* The binding level is not popped, as it might be re-opened later. */
2416 suspend_binding_level ();
2419 /* Push into the scope of the namespace NS, even if it is deeply
2420 nested within another namespace. */
2423 push_nested_namespace (ns
)
2426 if (ns
== global_namespace
)
2427 push_to_top_level ();
2430 push_nested_namespace (CP_DECL_CONTEXT (ns
));
2431 push_namespace (DECL_NAME (ns
));
2435 /* Pop back from the scope of the namespace NS, which was previously
2436 entered with push_nested_namespace. */
2439 pop_nested_namespace (ns
)
2442 while (ns
!= global_namespace
)
2445 ns
= CP_DECL_CONTEXT (ns
);
2448 pop_from_top_level ();
2452 /* Subroutines for reverting temporarily to top-level for instantiation
2453 of templates and such. We actually need to clear out the class- and
2454 local-value slots of all identifiers, so that only the global values
2455 are at all visible. Simply setting current_binding_level to the global
2456 scope isn't enough, because more binding levels may be pushed. */
2457 struct saved_scope
*scope_chain
;
2459 /* Mark ST for GC. */
2463 struct stmt_tree
*st
;
2465 ggc_mark_tree (st
->x_last_stmt
);
2466 ggc_mark_tree (st
->x_last_expr_type
);
2469 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2472 mark_saved_scope (arg
)
2475 struct saved_scope
*t
= *(struct saved_scope
**)arg
;
2478 mark_binding_level (&t
->class_bindings
);
2479 ggc_mark_tree (t
->old_bindings
);
2480 ggc_mark_tree (t
->old_namespace
);
2481 ggc_mark_tree (t
->class_name
);
2482 ggc_mark_tree (t
->class_type
);
2483 ggc_mark_tree (t
->access_specifier
);
2484 ggc_mark_tree (t
->function_decl
);
2486 ggc_mark_tree_varray (t
->lang_base
);
2487 ggc_mark_tree (t
->lang_name
);
2488 ggc_mark_tree (t
->x_function_parms
);
2489 ggc_mark_tree (t
->template_parms
);
2490 ggc_mark_tree (t
->x_previous_class_type
);
2491 ggc_mark_tree (t
->x_previous_class_values
);
2492 ggc_mark_tree (t
->x_saved_tree
);
2493 ggc_mark_tree (t
->incomplete
);
2494 ggc_mark_tree (t
->lookups
);
2496 mark_stmt_tree (&t
->x_stmt_tree
);
2497 mark_binding_level (&t
->bindings
);
2503 store_bindings (names
, old_bindings
)
2504 tree names
, old_bindings
;
2507 for (t
= names
; t
; t
= TREE_CHAIN (t
))
2509 tree binding
, t1
, id
;
2511 if (TREE_CODE (t
) == TREE_LIST
)
2512 id
= TREE_PURPOSE (t
);
2517 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2518 we have no IDENTIFIER_BINDING if we have left the class
2519 scope, but cached the class-level declarations. */
2520 || !(IDENTIFIER_BINDING (id
) || IDENTIFIER_CLASS_VALUE (id
)))
2523 for (t1
= old_bindings
; t1
; t1
= TREE_CHAIN (t1
))
2524 if (TREE_VEC_ELT (t1
, 0) == id
)
2527 binding
= make_tree_vec (4);
2531 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
2532 TREE_VEC_ELT (binding
, 0) = id
;
2533 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
2534 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_BINDING (id
);
2535 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
2536 IDENTIFIER_BINDING (id
) = NULL_TREE
;
2537 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
2539 TREE_CHAIN (binding
) = old_bindings
;
2540 old_bindings
= binding
;
2544 return old_bindings
;
2548 maybe_push_to_top_level (pseudo
)
2551 struct saved_scope
*s
;
2552 struct binding_level
*b
;
2556 s
= (struct saved_scope
*) xcalloc (1, sizeof (struct saved_scope
));
2558 b
= scope_chain
? current_binding_level
: 0;
2560 /* If we're in the middle of some function, save our state. */
2564 push_function_context_to (NULL_TREE
);
2569 old_bindings
= NULL_TREE
;
2570 if (scope_chain
&& previous_class_type
)
2571 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
2573 /* Have to include global_binding_level, because class-level decls
2574 aren't listed anywhere useful. */
2575 for (; b
; b
= b
->level_chain
)
2579 /* Template IDs are inserted into the global level. If they were
2580 inserted into namespace level, finish_file wouldn't find them
2581 when doing pending instantiations. Therefore, don't stop at
2582 namespace level, but continue until :: . */
2583 if (b
== global_binding_level
|| (pseudo
&& b
->template_parms_p
))
2586 old_bindings
= store_bindings (b
->names
, old_bindings
);
2587 /* We also need to check class_shadowed to save class-level type
2588 bindings, since pushclass doesn't fill in b->names. */
2589 if (b
->parm_flag
== 2)
2590 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2592 /* Unwind type-value slots back to top level. */
2593 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2594 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2596 s
->prev
= scope_chain
;
2597 s
->old_bindings
= old_bindings
;
2599 s
->need_pop_function_context
= need_pop
;
2600 s
->function_decl
= current_function_decl
;
2603 current_function_decl
= NULL_TREE
;
2604 VARRAY_TREE_INIT (current_lang_base
, 10, "current_lang_base");
2605 current_lang_stack
= &VARRAY_TREE (current_lang_base
, 0);
2606 current_lang_name
= lang_name_cplusplus
;
2607 current_namespace
= global_namespace
;
2611 push_to_top_level ()
2613 maybe_push_to_top_level (0);
2617 pop_from_top_level ()
2619 struct saved_scope
*s
= scope_chain
;
2622 /* Clear out class-level bindings cache. */
2623 if (previous_class_type
)
2624 invalidate_class_lookup_cache ();
2626 VARRAY_FREE (current_lang_base
);
2628 scope_chain
= s
->prev
;
2629 for (t
= s
->old_bindings
; t
; t
= TREE_CHAIN (t
))
2631 tree id
= TREE_VEC_ELT (t
, 0);
2634 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2635 IDENTIFIER_BINDING (id
) = TREE_VEC_ELT (t
, 2);
2636 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2640 /* If we were in the middle of compiling a function, restore our
2642 if (s
->need_pop_function_context
)
2643 pop_function_context_from (NULL_TREE
);
2644 current_function_decl
= s
->function_decl
;
2649 /* Push a definition of struct, union or enum tag "name".
2650 into binding_level "b". "type" should be the type node,
2651 We assume that the tag "name" is not already defined.
2653 Note that the definition may really be just a forward reference.
2654 In that case, the TYPE_SIZE will be a NULL_TREE.
2656 C++ gratuitously puts all these tags in the name space. */
2658 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2659 record the shadowed value for this binding contour. TYPE is
2660 the type that ID maps to. */
2663 set_identifier_type_value_with_scope (id
, type
, b
)
2666 struct binding_level
*b
;
2668 if (!b
->namespace_p
)
2670 /* Shadow the marker, not the real thing, so that the marker
2671 gets restored later. */
2672 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2674 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2678 tree binding
= binding_for_name (id
, current_namespace
);
2679 BINDING_TYPE (binding
) = type
;
2680 /* Store marker instead of real type. */
2681 type
= global_type_node
;
2683 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2686 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2689 set_identifier_type_value (id
, type
)
2693 set_identifier_type_value_with_scope (id
, type
, current_binding_level
);
2696 /* Return the type associated with id. */
2699 identifier_type_value (id
)
2702 /* There is no type with that name, anywhere. */
2703 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2705 /* This is not the type marker, but the real thing. */
2706 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2707 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2708 /* Have to search for it. It must be on the global level, now.
2709 Ask lookup_name not to return non-types. */
2710 id
= lookup_name_real (id
, 2, 1, 0);
2712 return TREE_TYPE (id
);
2716 /* Pop off extraneous binding levels left over due to syntax errors.
2718 We don't pop past namespaces, as they might be valid. */
2723 #ifdef DEBUG_CP_BINDING_LEVELS
2724 fprintf (stderr
, "XXX entering pop_everything ()\n");
2726 while (!toplevel_bindings_p ())
2728 if (current_binding_level
->parm_flag
== 2)
2729 pop_nested_class ();
2733 #ifdef DEBUG_CP_BINDING_LEVELS
2734 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2738 /* The type TYPE is being declared. If it is a class template, or a
2739 specialization of a class template, do any processing required and
2740 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2741 being declared a friend. B is the binding level at which this TYPE
2744 Returns the TYPE_DECL for TYPE, which may have been altered by this
2748 maybe_process_template_type_declaration (type
, globalize
, b
)
2751 struct binding_level
* b
;
2753 tree decl
= TYPE_NAME (type
);
2755 if (processing_template_parmlist
)
2756 /* You can't declare a new template type in a template parameter
2757 list. But, you can declare a non-template type:
2759 template <class A*> struct S;
2761 is a forward-declaration of `A'. */
2765 maybe_check_template_type (type
);
2767 my_friendly_assert (IS_AGGR_TYPE (type
)
2768 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2771 if (processing_template_decl
)
2773 /* This may change after the call to
2774 push_template_decl_real, but we want the original value. */
2775 tree name
= DECL_NAME (decl
);
2777 decl
= push_template_decl_real (decl
, globalize
);
2778 /* If the current binding level is the binding level for the
2779 template parameters (see the comment in
2780 begin_template_parm_list) and the enclosing level is a class
2781 scope, and we're not looking at a friend, push the
2782 declaration of the member class into the class scope. In the
2783 friend case, push_template_decl will already have put the
2784 friend into global scope, if appropriate. */
2785 if (TREE_CODE (type
) != ENUMERAL_TYPE
2786 && !globalize
&& b
->template_parms_p
2787 && b
->level_chain
->parm_flag
== 2)
2789 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2790 /* Put this tag on the list of tags for the class, since
2791 that won't happen below because B is not the class
2792 binding level, but is instead the pseudo-global level. */
2793 b
->level_chain
->tags
=
2794 tree_cons (name
, type
, b
->level_chain
->tags
);
2795 if (!COMPLETE_TYPE_P (current_class_type
))
2796 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2804 /* In C++, you don't have to write `struct S' to refer to `S'; you
2805 can just use `S'. We accomplish this by creating a TYPE_DECL as
2806 if the user had written `typedef struct S S'. Create and return
2807 the TYPE_DECL for TYPE. */
2810 create_implicit_typedef (name
, type
)
2816 decl
= build_decl (TYPE_DECL
, name
, type
);
2817 DECL_ARTIFICIAL (decl
) = 1;
2818 /* There are other implicit type declarations, like the one *within*
2819 a class that allows you to write `S::S'. We must distinguish
2821 SET_DECL_IMPLICIT_TYPEDEF_P (decl
);
2822 TYPE_NAME (type
) = decl
;
2827 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2828 Normally put it into the inner-most non-tag-transparent scope,
2829 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2830 The latter is needed for implicit declarations. */
2833 pushtag (name
, type
, globalize
)
2837 register struct binding_level
*b
;
2839 b
= current_binding_level
;
2840 while (b
->tag_transparent
2841 || (globalize
&& b
->parm_flag
== 2))
2844 b
->tags
= tree_cons (name
, type
, b
->tags
);
2848 /* Do C++ gratuitous typedefing. */
2849 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2851 register tree d
= NULL_TREE
;
2853 tree context
= TYPE_CONTEXT (type
);
2857 tree cs
= current_scope ();
2861 else if (cs
!= NULL_TREE
&& TYPE_P (cs
))
2862 /* When declaring a friend class of a local class, we want
2863 to inject the newly named class into the scope
2864 containing the local class, not the namespace scope. */
2865 context
= decl_function_context (get_type_decl (cs
));
2868 context
= current_namespace
;
2870 if ((b
->template_parms_p
&& b
->level_chain
->parm_flag
== 2)
2871 || b
->parm_flag
== 2)
2874 if (current_lang_name
== lang_name_java
)
2875 TYPE_FOR_JAVA (type
) = 1;
2877 d
= create_implicit_typedef (name
, type
);
2878 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2880 set_identifier_type_value_with_scope (name
, type
, b
);
2882 d
= maybe_process_template_type_declaration (type
,
2885 if (b
->parm_flag
== 2)
2887 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2888 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2889 class. But if it's a member template class, we
2890 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2892 finish_member_declaration (d
);
2894 pushdecl_class_level (d
);
2897 d
= pushdecl_with_scope (d
, b
);
2899 if (ANON_AGGRNAME_P (name
))
2900 DECL_IGNORED_P (d
) = 1;
2902 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2903 DECL_ASSEMBLER_NAME (d
) = DECL_NAME (d
);
2905 /* If this is a local class, keep track of it. We need this
2906 information for name-mangling, and so that it is possible to find
2907 all function definitions in a translation unit in a convenient
2908 way. (It's otherwise tricky to find a member function definition
2909 it's only pointed to from within a local class.) */
2910 if (TYPE_CONTEXT (type
)
2911 && TREE_CODE (TYPE_CONTEXT (type
)) == FUNCTION_DECL
2912 && !processing_template_decl
)
2913 VARRAY_PUSH_TREE (local_classes
, type
);
2915 if (!uses_template_parms (type
))
2918 DECL_ASSEMBLER_NAME (d
) = mangle_type (type
);
2920 DECL_ASSEMBLER_NAME (d
)
2921 = get_identifier (build_overload_name (type
, 1, 1));
2924 if (b
->parm_flag
== 2)
2926 if (!COMPLETE_TYPE_P (current_class_type
))
2927 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2931 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2932 /* Use the canonical TYPE_DECL for this node. */
2933 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2936 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2937 will be the tagged type we just added to the current
2938 binding level. This fake NULL-named TYPE_DECL node helps
2939 dwarfout.c to know when it needs to output a
2940 representation of a tagged type, and it also gives us a
2941 convenient place to record the "scope start" address for
2944 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2945 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2949 /* Counter used to create anonymous type names. */
2951 static int anon_cnt
= 0;
2953 /* Return an IDENTIFIER which can be used as a name for
2954 anonymous structs and unions. */
2961 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2962 return get_identifier (buf
);
2965 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2966 This keeps dbxout from getting confused. */
2971 register struct binding_level
*b
;
2973 static int last_cnt
= 0;
2975 /* Fast out if no new anon names were declared. */
2976 if (last_cnt
== anon_cnt
)
2979 b
= current_binding_level
;
2980 while (b
->tag_transparent
)
2985 /* A NULL purpose means we have already processed all tags
2986 from here to the end of the list. */
2987 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2989 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2990 TREE_PURPOSE (tags
) = NULL_TREE
;
2991 tags
= TREE_CHAIN (tags
);
2993 last_cnt
= anon_cnt
;
2996 /* Subroutine of duplicate_decls: return truthvalue of whether
2997 or not types of these decls match.
2999 For C++, we must compare the parameter list so that `int' can match
3000 `int&' in a parameter position, but `int&' is not confused with
3004 decls_match (newdecl
, olddecl
)
3005 tree newdecl
, olddecl
;
3009 if (newdecl
== olddecl
)
3012 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
3013 /* If the two DECLs are not even the same kind of thing, we're not
3014 interested in their types. */
3017 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3019 tree f1
= TREE_TYPE (newdecl
);
3020 tree f2
= TREE_TYPE (olddecl
);
3021 tree p1
= TYPE_ARG_TYPES (f1
);
3022 tree p2
= TYPE_ARG_TYPES (f2
);
3024 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
)
3025 && ! (DECL_EXTERN_C_P (newdecl
)
3026 && DECL_EXTERN_C_P (olddecl
)))
3029 if (TREE_CODE (f1
) != TREE_CODE (f2
))
3032 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
3034 if (p2
== NULL_TREE
&& DECL_EXTERN_C_P (olddecl
)
3035 && (DECL_BUILT_IN (olddecl
)
3036 #ifndef NO_IMPLICIT_EXTERN_C
3037 || (DECL_IN_SYSTEM_HEADER (newdecl
) && !DECL_CLASS_SCOPE_P (newdecl
))
3038 || (DECL_IN_SYSTEM_HEADER (olddecl
) && !DECL_CLASS_SCOPE_P (olddecl
))
3042 types_match
= self_promoting_args_p (p1
);
3043 if (p1
== void_list_node
)
3044 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
3046 #ifndef NO_IMPLICIT_EXTERN_C
3047 else if (p1
== NULL_TREE
3048 && (DECL_EXTERN_C_P (olddecl
)
3049 && DECL_IN_SYSTEM_HEADER (olddecl
)
3050 && !DECL_CLASS_SCOPE_P (olddecl
))
3051 && (DECL_EXTERN_C_P (newdecl
)
3052 && DECL_IN_SYSTEM_HEADER (newdecl
)
3053 && !DECL_CLASS_SCOPE_P (newdecl
)))
3055 types_match
= self_promoting_args_p (p2
);
3056 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
3060 types_match
= compparms (p1
, p2
);
3065 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3067 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3068 DECL_TEMPLATE_PARMS (olddecl
)))
3071 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
))
3072 != TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)))
3075 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3078 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
3079 DECL_TEMPLATE_RESULT (newdecl
));
3083 if (TREE_TYPE (newdecl
) == error_mark_node
)
3084 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
3085 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
3086 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
3087 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
3090 types_match
= comptypes (TREE_TYPE (newdecl
),
3091 TREE_TYPE (olddecl
),
3092 COMPARE_REDECLARATION
);
3098 /* If NEWDECL is `static' and an `extern' was seen previously,
3099 warn about it. OLDDECL is the previous declaration.
3101 Note that this does not apply to the C++ case of declaring
3102 a variable `extern const' and then later `const'.
3104 Don't complain about built-in functions, since they are beyond
3105 the user's control. */
3108 warn_extern_redeclared_static (newdecl
, olddecl
)
3109 tree newdecl
, olddecl
;
3111 static const char *explicit_extern_static_warning
3112 = "`%D' was declared `extern' and later `static'";
3113 static const char *implicit_extern_static_warning
3114 = "`%D' was declared implicitly `extern' and later `static'";
3118 if (TREE_CODE (newdecl
) == TYPE_DECL
3119 || TREE_CODE (newdecl
) == TEMPLATE_DECL
3120 || TREE_CODE (newdecl
) == CONST_DECL
)
3123 /* Don't get confused by static member functions; that's a different
3125 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3126 && DECL_STATIC_FUNCTION_P (newdecl
))
3129 /* If the old declaration was `static', or the new one isn't, then
3130 then everything is OK. */
3131 if (DECL_THIS_STATIC (olddecl
) || !DECL_THIS_STATIC (newdecl
))
3134 /* It's OK to declare a builtin function as `static'. */
3135 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3136 && DECL_ARTIFICIAL (olddecl
))
3139 name
= DECL_ASSEMBLER_NAME (newdecl
);
3140 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
3141 ? implicit_extern_static_warning
3142 : explicit_extern_static_warning
, newdecl
);
3143 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
3146 /* Handle when a new declaration NEWDECL has the same name as an old
3147 one OLDDECL in the same binding contour. Prints an error message
3150 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
3151 Otherwise, return 0. */
3154 duplicate_decls (newdecl
, olddecl
)
3155 tree newdecl
, olddecl
;
3157 unsigned olddecl_uid
= DECL_UID (olddecl
);
3158 int olddecl_friend
= 0, types_match
= 0;
3159 int new_defines_function
= 0;
3161 if (newdecl
== olddecl
)
3164 types_match
= decls_match (newdecl
, olddecl
);
3166 /* If either the type of the new decl or the type of the old decl is an
3167 error_mark_node, then that implies that we have already issued an
3168 error (earlier) for some bogus type specification, and in that case,
3169 it is rather pointless to harass the user with yet more error message
3170 about the same declaration, so just pretend the types match here. */
3171 if (TREE_TYPE (newdecl
) == error_mark_node
3172 || TREE_TYPE (olddecl
) == error_mark_node
)
3175 /* Check for redeclaration and other discrepancies. */
3176 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3177 && DECL_ARTIFICIAL (olddecl
))
3179 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
3181 /* If you declare a built-in or predefined function name as static,
3182 the old definition is overridden, but optionally warn this was a
3183 bad choice of name. */
3184 if (! TREE_PUBLIC (newdecl
))
3187 cp_warning ("shadowing %s function `%#D'",
3188 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3190 /* Discard the old built-in function. */
3193 /* If the built-in is not ansi, then programs can override
3194 it even globally without an error. */
3195 else if (! DECL_BUILT_IN (olddecl
))
3196 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
3200 cp_error ("declaration of `%#D'", newdecl
);
3201 cp_error ("conflicts with built-in declaration `%#D'",
3206 else if (!types_match
)
3208 if ((DECL_EXTERN_C_P (newdecl
)
3209 && DECL_EXTERN_C_P (olddecl
))
3210 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3211 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3213 /* A near match; override the builtin. */
3215 if (TREE_PUBLIC (newdecl
))
3217 cp_warning ("new declaration `%#D'", newdecl
);
3218 cp_warning ("ambiguates built-in declaration `%#D'",
3221 else if (warn_shadow
)
3222 cp_warning ("shadowing %s function `%#D'",
3223 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3227 /* Discard the old built-in function. */
3231 if (DECL_THIS_STATIC (newdecl
) && !DECL_THIS_STATIC (olddecl
))
3233 /* If a builtin function is redeclared as `static', merge
3234 the declarations, but make the original one static. */
3235 DECL_THIS_STATIC (olddecl
) = 1;
3236 TREE_PUBLIC (olddecl
) = 0;
3238 /* Make the old declaration consistent with the new one so
3239 that all remnants of the builtin-ness of this function
3240 will be banished. */
3241 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3242 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3243 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3244 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (newdecl
),
3248 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3250 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3251 && TREE_CODE (newdecl
) != TYPE_DECL
3252 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3253 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3254 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3255 && TREE_CODE (olddecl
) != TYPE_DECL
3256 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3257 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3260 /* We do nothing special here, because C++ does such nasty
3261 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3262 get shadowed, and know that if we need to find a TYPE_DECL
3263 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3264 slot of the identifier. */
3268 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3269 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3270 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3271 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3274 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
3275 if (TREE_CODE (olddecl
) == TREE_LIST
)
3276 olddecl
= TREE_VALUE (olddecl
);
3277 cp_error_at ("previous declaration of `%#D'", olddecl
);
3279 /* New decl is completely inconsistent with the old one =>
3280 tell caller to replace the old one. */
3284 else if (!types_match
)
3286 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
))
3287 /* These are certainly not duplicate declarations; they're
3288 from different scopes. */
3291 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3293 /* The name of a class template may not be declared to refer to
3294 any other template, class, function, object, namespace, value,
3295 or type in the same scope. */
3296 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3297 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3299 cp_error ("declaration of template `%#D'", newdecl
);
3300 cp_error_at ("conflicts with previous declaration `%#D'",
3303 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3304 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3305 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3306 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3307 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3308 DECL_TEMPLATE_PARMS (olddecl
)))
3310 cp_error ("new declaration `%#D'", newdecl
);
3311 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3315 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3317 if (DECL_EXTERN_C_P (newdecl
) && DECL_EXTERN_C_P (olddecl
))
3319 cp_error ("declaration of C function `%#D' conflicts with",
3321 cp_error_at ("previous declaration `%#D' here", olddecl
);
3323 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3324 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3326 cp_error ("new declaration `%#D'", newdecl
);
3327 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3333 /* Already complained about this, so don't do so again. */
3334 else if (current_class_type
== NULL_TREE
3335 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3337 cp_error ("conflicting types for `%#D'", newdecl
);
3338 cp_error_at ("previous declaration as `%#D'", olddecl
);
3341 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3342 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3343 && (!DECL_TEMPLATE_INFO (newdecl
)
3344 || (DECL_TI_TEMPLATE (newdecl
)
3345 != DECL_TI_TEMPLATE (olddecl
))))
3346 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3347 && (!DECL_TEMPLATE_INFO (olddecl
)
3348 || (DECL_TI_TEMPLATE (olddecl
)
3349 != DECL_TI_TEMPLATE (newdecl
))))))
3350 /* It's OK to have a template specialization and a non-template
3351 with the same type, or to have specializations of two
3352 different templates with the same type. Note that if one is a
3353 specialization, and the other is an instantiation of the same
3354 template, that we do not exit at this point. That situation
3355 can occur if we instantiate a template class, and then
3356 specialize one of its methods. This situation is legal, but
3357 the declarations must be merged in the usual way. */
3359 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3360 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3361 && !DECL_USE_TEMPLATE (newdecl
))
3362 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3363 && !DECL_USE_TEMPLATE (olddecl
))))
3364 /* One of the declarations is a template instantiation, and the
3365 other is not a template at all. That's OK. */
3367 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3368 && DECL_NAMESPACE_ALIAS (newdecl
)
3369 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3370 /* Redeclaration of namespace alias, ignore it. */
3374 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3377 cp_error (errmsg
, newdecl
);
3378 if (DECL_NAME (olddecl
) != NULL_TREE
)
3379 cp_error_at ((DECL_INITIAL (olddecl
)
3380 && namespace_bindings_p ())
3381 ? "`%#D' previously defined here"
3382 : "`%#D' previously declared here", olddecl
);
3384 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3385 && DECL_INITIAL (olddecl
) != NULL_TREE
3386 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3387 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3389 /* Prototype decl follows defn w/o prototype. */
3390 cp_warning_at ("prototype for `%#D'", newdecl
);
3391 cp_warning_at ("follows non-prototype definition here", olddecl
);
3393 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3394 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3396 /* extern "C" int foo ();
3397 int foo () { bar (); }
3399 if (current_lang_stack
3400 == &VARRAY_TREE (current_lang_base
, 0))
3401 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3404 cp_error_at ("previous declaration of `%#D' with %L linkage",
3405 olddecl
, DECL_LANGUAGE (olddecl
));
3406 cp_error ("conflicts with new declaration with %L linkage",
3407 DECL_LANGUAGE (newdecl
));
3411 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3413 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3415 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3416 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3419 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3420 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3422 for (; t1
&& t1
!= void_list_node
;
3423 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3424 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3426 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3431 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3433 cp_pedwarn_at ("after previous specification in `%#D'",
3439 cp_error ("default argument given for parameter %d of `%#D'",
3441 cp_error_at ("after previous specification in `%#D'",
3446 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
3447 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3449 cp_warning ("`%#D' was used before it was declared inline",
3451 cp_warning_at ("previous non-inline declaration here",
3457 /* If new decl is `static' and an `extern' was seen previously,
3459 warn_extern_redeclared_static (newdecl
, olddecl
);
3461 /* We have committed to returning 1 at this point. */
3462 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3464 /* Now that functions must hold information normally held
3465 by field decls, there is extra work to do so that
3466 declaration information does not get destroyed during
3468 if (DECL_VINDEX (olddecl
))
3469 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3470 if (DECL_VIRTUAL_CONTEXT (olddecl
))
3471 DECL_VIRTUAL_CONTEXT (newdecl
) = DECL_VIRTUAL_CONTEXT (olddecl
);
3472 if (DECL_CONTEXT (olddecl
))
3473 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3474 if (DECL_PENDING_INLINE_INFO (newdecl
) == (struct pending_inline
*)0)
3475 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3476 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3477 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3478 DECL_PURE_VIRTUAL_P (newdecl
) |= DECL_PURE_VIRTUAL_P (olddecl
);
3479 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3480 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3481 DECL_THIS_STATIC (newdecl
) |= DECL_THIS_STATIC (olddecl
);
3482 DECL_LANG_SPECIFIC (newdecl
)->u2
= DECL_LANG_SPECIFIC (olddecl
)->u2
;
3483 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3485 /* Optionally warn about more than one declaration for the same
3486 name, but don't warn about a function declaration followed by a
3488 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3489 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3490 /* Don't warn about extern decl followed by definition. */
3491 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3492 /* Don't warn about friends, let add_friend take care of it. */
3493 && ! DECL_FRIEND_P (newdecl
))
3495 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3496 cp_warning_at ("previous declaration of `%D'", olddecl
);
3500 /* Deal with C++: must preserve virtual function table size. */
3501 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3503 register tree newtype
= TREE_TYPE (newdecl
);
3504 register tree oldtype
= TREE_TYPE (olddecl
);
3506 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3507 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3509 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3510 CLASSTYPE_FRIEND_CLASSES (newtype
)
3511 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3514 DECL_ORIGINAL_TYPE (newdecl
) = DECL_ORIGINAL_TYPE (olddecl
);
3517 /* Copy all the DECL_... slots specified in the new decl
3518 except for any that we copy here from the old type. */
3519 DECL_MACHINE_ATTRIBUTES (newdecl
)
3520 = merge_machine_decl_attributes (olddecl
, newdecl
);
3522 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3524 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3525 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3526 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3527 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3534 /* Automatically handles default parameters. */
3535 tree oldtype
= TREE_TYPE (olddecl
);
3538 /* Merge the data types specified in the two decls. */
3539 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3541 /* If common_type produces a non-typedef type, just use the old type. */
3542 if (TREE_CODE (newdecl
) == TYPE_DECL
3543 && newtype
== DECL_ORIGINAL_TYPE (newdecl
))
3546 if (TREE_CODE (newdecl
) == VAR_DECL
)
3547 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3548 /* Do this after calling `common_type' so that default
3549 parameters don't confuse us. */
3550 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3551 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3552 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3554 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3555 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3556 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3557 TYPE_RAISES_EXCEPTIONS (oldtype
));
3559 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3560 && DECL_SOURCE_LINE (olddecl
) != 0
3562 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
3563 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
3565 cp_error ("declaration of `%F' throws different exceptions",
3567 cp_error_at ("than previous declaration `%F'", olddecl
);
3570 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3572 /* Lay the type out, unless already done. */
3573 if (! same_type_p (newtype
, oldtype
)
3574 && TREE_TYPE (newdecl
) != error_mark_node
3575 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3576 layout_type (TREE_TYPE (newdecl
));
3578 if ((TREE_CODE (newdecl
) == VAR_DECL
3579 || TREE_CODE (newdecl
) == PARM_DECL
3580 || TREE_CODE (newdecl
) == RESULT_DECL
3581 || TREE_CODE (newdecl
) == FIELD_DECL
3582 || TREE_CODE (newdecl
) == TYPE_DECL
)
3583 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3584 layout_decl (newdecl
, 0);
3586 /* Merge the type qualifiers. */
3587 if (TREE_READONLY (newdecl
))
3588 TREE_READONLY (olddecl
) = 1;
3589 if (TREE_THIS_VOLATILE (newdecl
))
3590 TREE_THIS_VOLATILE (olddecl
) = 1;
3592 /* Merge the initialization information. */
3593 if (DECL_INITIAL (newdecl
) == NULL_TREE
3594 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3596 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3597 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3598 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3599 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
3600 && DECL_LANG_SPECIFIC (newdecl
)
3601 && DECL_LANG_SPECIFIC (olddecl
))
3602 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3605 /* Merge the section attribute.
3606 We want to issue an error if the sections conflict but that must be
3607 done later in decl_attributes since we are called before attributes
3609 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3610 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3612 /* Keep the old rtl since we can safely use it. */
3613 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3615 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3617 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (newdecl
)
3618 |= DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (olddecl
);
3619 DECL_NO_CHECK_MEMORY_USAGE (newdecl
)
3620 |= DECL_NO_CHECK_MEMORY_USAGE (olddecl
);
3621 DECL_NO_LIMIT_STACK (newdecl
)
3622 |= DECL_NO_LIMIT_STACK (olddecl
);
3625 /* If cannot merge, then use the new type and qualifiers,
3626 and don't preserve the old rtl. */
3629 /* Clean out any memory we had of the old declaration. */
3630 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3632 TREE_VALUE (oldstatic
) = error_mark_node
;
3634 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3635 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3636 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3637 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3640 /* Merge the storage class information. */
3641 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3642 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3643 DECL_DEFER_OUTPUT (newdecl
) |= DECL_DEFER_OUTPUT (olddecl
);
3644 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3645 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3646 if (! DECL_EXTERNAL (olddecl
))
3647 DECL_EXTERNAL (newdecl
) = 0;
3649 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3651 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3652 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3653 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3654 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3655 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3656 /* Don't really know how much of the language-specific
3657 values we should copy from old to new. */
3658 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3659 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3660 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3661 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3662 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3664 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3665 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3666 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3667 DECL_BEFRIENDING_CLASSES (newdecl
)
3668 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3669 DECL_BEFRIENDING_CLASSES (olddecl
));
3672 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3674 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3675 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3677 /* If newdecl is not a specialization, then it is not a
3678 template-related function at all. And that means that we
3679 shoud have exited above, returning 0. */
3680 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3683 if (TREE_USED (olddecl
))
3684 /* From [temp.expl.spec]:
3686 If a template, a member template or the member of a class
3687 template is explicitly specialized then that
3688 specialization shall be declared before the first use of
3689 that specialization that would cause an implicit
3690 instantiation to take place, in every translation unit in
3691 which such a use occurs. */
3692 cp_error ("explicit specialization of %D after first use",
3695 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3697 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3699 /* If either decl says `inline', this fn is inline, unless its
3700 definition was passed already. */
3701 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3702 DECL_INLINE (olddecl
) = 1;
3703 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3707 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3708 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3709 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3711 if (! types_match
|| new_defines_function
)
3713 /* These need to be copied so that the names are available.
3714 Note that if the types do match, we'll preserve inline
3715 info and other bits, but if not, we won't. */
3716 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3717 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3719 if (new_defines_function
)
3720 /* If defining a function declared with other language
3721 linkage, use the previously declared language linkage. */
3722 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3723 else if (types_match
)
3725 /* If redeclaring a builtin function, and not a definition,
3726 it stays built in. */
3727 if (DECL_BUILT_IN (olddecl
))
3729 DECL_BUILT_IN_CLASS (newdecl
) = DECL_BUILT_IN_CLASS (olddecl
);
3730 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3731 /* If we're keeping the built-in definition, keep the rtl,
3732 regardless of declaration matches. */
3733 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3736 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3738 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3739 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3740 /* Previously saved insns go together with
3741 the function's previous definition. */
3742 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3743 /* Don't clear out the arguments if we're redefining a function. */
3744 if (DECL_ARGUMENTS (olddecl
))
3745 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3749 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3751 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3754 /* Now preserve various other info from the definition. */
3755 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3756 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3757 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3758 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3760 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3764 function_size
= sizeof (struct tree_decl
);
3766 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3767 (char *) olddecl
+ sizeof (struct tree_common
),
3768 function_size
- sizeof (struct tree_common
));
3770 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3772 /* If newdecl is a template instantiation, it is possible that
3773 the following sequence of events has occurred:
3775 o A friend function was declared in a class template. The
3776 class template was instantiated.
3778 o The instantiation of the friend declaration was
3779 recorded on the instantiation list, and is newdecl.
3781 o Later, however, instantiate_class_template called pushdecl
3782 on the newdecl to perform name injection. But, pushdecl in
3783 turn called duplicate_decls when it discovered that another
3784 declaration of a global function with the same name already
3787 o Here, in duplicate_decls, we decided to clobber newdecl.
3789 If we're going to do that, we'd better make sure that
3790 olddecl, and not newdecl, is on the list of
3791 instantiations so that if we try to do the instantiation
3792 again we won't get the clobbered declaration. */
3794 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3795 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3797 for (; decls
; decls
= TREE_CHAIN (decls
))
3798 if (TREE_VALUE (decls
) == newdecl
)
3799 TREE_VALUE (decls
) = olddecl
;
3804 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3805 (char *) olddecl
+ sizeof (struct tree_common
),
3806 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3807 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3810 DECL_UID (olddecl
) = olddecl_uid
;
3812 DECL_FRIEND_P (olddecl
) = 1;
3814 /* NEWDECL contains the merged attribute lists.
3815 Update OLDDECL to be the same. */
3816 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3821 /* Record a decl-node X as belonging to the current lexical scope.
3822 Check for errors (such as an incompatible declaration for the same
3823 name already seen in the same scope).
3825 Returns either X or an old decl for the same name.
3826 If an old decl is returned, it may have been smashed
3827 to agree with what X says. */
3835 int need_new_binding
;
3837 /* We shouldn't be calling pushdecl when we're generating RTL for a
3838 function that we already did semantic analysis on previously. */
3839 my_friendly_assert (!cfun
|| doing_semantic_analysis_p (),
3842 need_new_binding
= 1;
3844 if (DECL_TEMPLATE_PARM_P (x
))
3845 /* Template parameters have no context; they are not X::T even
3846 when declared within a class or namespace. */
3850 if (current_function_decl
&& x
!= current_function_decl
3851 /* A local declaration for a function doesn't constitute
3853 && !(TREE_CODE (x
) == FUNCTION_DECL
&& !DECL_INITIAL (x
))
3854 /* A local declaration for an `extern' variable is in the
3855 scoped of the current namespace, not the current
3857 && !(TREE_CODE (x
) == VAR_DECL
&& DECL_EXTERNAL (x
))
3858 && !DECL_CONTEXT (x
))
3859 DECL_CONTEXT (x
) = current_function_decl
;
3861 /* If this is the declaration for a namespace-scope function,
3862 but the declaration itself is in a local scope, mark the
3864 if (TREE_CODE (x
) == FUNCTION_DECL
3865 && DECL_NAMESPACE_SCOPE_P (x
)
3866 && current_function_decl
3867 && x
!= current_function_decl
)
3868 DECL_LOCAL_FUNCTION_P (x
) = 1;
3871 name
= DECL_NAME (x
);
3875 /* Not needed...see below. */
3879 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3880 name
= TREE_OPERAND (name
, 0);
3882 /* Namespace-scoped variables are not found in the current level. */
3883 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
))
3884 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3886 t
= lookup_name_current_level (name
);
3888 /* If we are declaring a function, and the result of name-lookup
3889 was an OVERLOAD, look for an overloaded instance that is
3890 actually the same as the function we are declaring. (If
3891 there is one, we have to merge our declaration with the
3892 previous declaration.) */
3893 if (t
&& TREE_CODE (t
) == OVERLOAD
)
3897 if (TREE_CODE (x
) == FUNCTION_DECL
)
3898 for (match
= t
; match
; match
= OVL_NEXT (match
))
3900 if (DECL_ASSEMBLER_NAME (OVL_CURRENT (t
))
3901 == DECL_ASSEMBLER_NAME (x
))
3905 /* Just choose one. */
3909 t
= OVL_CURRENT (match
);
3914 if (t
== error_mark_node
)
3916 /* error_mark_node is 0 for a while during initialization! */
3918 cp_error_at ("`%#D' used prior to declaration", x
);
3920 else if (t
!= NULL_TREE
)
3922 if (TREE_CODE (t
) == PARM_DECL
)
3924 if (DECL_CONTEXT (t
) == NULL_TREE
)
3925 fatal ("parse errors have confused me too much");
3927 /* Check for duplicate params. */
3928 if (duplicate_decls (x
, t
))
3931 else if ((DECL_EXTERN_C_FUNCTION_P (x
)
3932 || DECL_FUNCTION_TEMPLATE_P (x
))
3933 && is_overloaded_fn (t
))
3934 /* Don't do anything just yet. */;
3935 else if (t
== wchar_decl_node
)
3937 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3938 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3940 /* Throw away the redeclaration. */
3943 else if (TREE_CODE (t
) != TREE_CODE (x
))
3945 if (duplicate_decls (x
, t
))
3948 else if (duplicate_decls (x
, t
))
3950 if (TREE_CODE (t
) == TYPE_DECL
)
3951 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3952 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3953 check_default_args (t
);
3957 else if (DECL_MAIN_P (x
))
3959 /* A redeclaration of main, but not a duplicate of the
3964 This function shall not be overloaded. */
3965 cp_error_at ("invalid redeclaration of `%D'", t
);
3966 cp_error ("as `%D'", x
);
3967 /* We don't try to push this declaration since that
3973 check_template_shadow (x
);
3975 /* If this is a function conjured up by the backend, massage it
3976 so it looks friendly. */
3977 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_LANG_SPECIFIC (x
))
3979 retrofit_lang_decl (x
);
3980 DECL_LANGUAGE (x
) = lang_c
;
3983 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_FUNCTION_MEMBER_P (x
))
3985 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
3988 if (!namespace_bindings_p ())
3989 /* We do not need to create a binding for this name;
3990 push_overloaded_decl will have already done so if
3992 need_new_binding
= 0;
3994 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3996 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
3998 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
4002 /* If declaring a type as a typedef, copy the type (unless we're
4003 at line 0), and install this TYPE_DECL as the new type's typedef
4004 name. See the extensive comment in ../c-decl.c (pushdecl). */
4005 if (TREE_CODE (x
) == TYPE_DECL
)
4007 tree type
= TREE_TYPE (x
);
4008 if (DECL_SOURCE_LINE (x
) == 0)
4010 if (TYPE_NAME (type
) == 0)
4011 TYPE_NAME (type
) = x
;
4013 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
4014 /* We don't want to copy the type when all we're
4015 doing is making a TYPE_DECL for the purposes of
4017 && (!TYPE_NAME (type
)
4018 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
4020 DECL_ORIGINAL_TYPE (x
) = type
;
4021 type
= build_type_copy (type
);
4022 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
4023 TYPE_NAME (type
) = x
;
4024 TREE_TYPE (x
) = type
;
4027 if (type
!= error_mark_node
4029 && TYPE_IDENTIFIER (type
))
4030 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
4031 current_binding_level
);
4035 /* Multiple external decls of the same identifier ought to match.
4037 We get warnings about inline functions where they are defined.
4038 We get warnings about other functions from push_overloaded_decl.
4040 Avoid duplicate warnings where they are used. */
4041 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
4045 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
4046 if (decl
&& TREE_CODE (decl
) == OVERLOAD
)
4047 decl
= OVL_FUNCTION (decl
);
4049 if (decl
&& decl
!= error_mark_node
4050 && (DECL_EXTERNAL (decl
) || TREE_PUBLIC (decl
))
4051 /* If different sort of thing, we already gave an error. */
4052 && TREE_CODE (decl
) == TREE_CODE (x
)
4053 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
4055 cp_pedwarn ("type mismatch with previous external decl", x
);
4056 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
4060 /* This name is new in its binding level.
4061 Install the new declaration and return it. */
4062 if (namespace_bindings_p ())
4064 /* Install a global value. */
4066 /* If the first global decl has external linkage,
4067 warn if we later see static one. */
4068 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
4069 TREE_PUBLIC (name
) = 1;
4071 /* Bind the mangled name for the entity. In the future, we
4072 should not need to do this; mangled names are an
4073 implementation detail of which the front-end should not
4074 need to be aware. */
4075 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
4077 /* For an ordinary function, we create a binding from
4078 the mangled name (i.e., NAME) to the DECL. But, for
4079 an `extern "C"' function, the mangled name and the
4080 ordinary name are the same so we need not do this. */
4081 && !DECL_EXTERN_C_FUNCTION_P (x
))
4085 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
4086 || TREE_CODE (x
) == NAMESPACE_DECL
)
4087 mangled_name
= name
;
4089 mangled_name
= DECL_ASSEMBLER_NAME (x
);
4091 if (TREE_CODE (x
) == FUNCTION_DECL
)
4093 ((IDENTIFIER_GLOBAL_VALUE (mangled_name
) == NULL_TREE
)
4094 || (IDENTIFIER_GLOBAL_VALUE (mangled_name
) == x
), 378);
4095 SET_IDENTIFIER_NAMESPACE_VALUE (mangled_name
, x
);
4098 /* Don't forget if the function was used via an implicit decl. */
4099 if (IDENTIFIER_IMPLICIT_DECL (name
)
4100 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
4103 /* Don't forget if its address was taken in that way. */
4104 if (IDENTIFIER_IMPLICIT_DECL (name
)
4105 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
4106 TREE_ADDRESSABLE (x
) = 1;
4108 /* Warn about mismatches against previous implicit decl. */
4109 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
4110 /* If this real decl matches the implicit, don't complain. */
4111 && ! (TREE_CODE (x
) == FUNCTION_DECL
4112 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
4114 ("`%D' was previously implicitly declared to return `int'", x
);
4116 /* If new decl is `static' and an `extern' was seen previously,
4118 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
4119 warn_extern_redeclared_static (x
, t
);
4123 /* Here to install a non-global value. */
4124 tree oldlocal
= IDENTIFIER_VALUE (name
);
4125 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
4127 if (need_new_binding
)
4129 push_local_binding (name
, x
, 0);
4130 /* Because push_local_binding will hook X on to the
4131 current_binding_level's name list, we don't want to
4132 do that again below. */
4133 need_new_binding
= 0;
4136 /* If this is a TYPE_DECL, push it into the type value slot. */
4137 if (TREE_CODE (x
) == TYPE_DECL
)
4138 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
4139 current_binding_level
);
4141 /* Clear out any TYPE_DECL shadowed by a namespace so that
4142 we won't think this is a type. The C struct hack doesn't
4143 go through namespaces. */
4144 if (TREE_CODE (x
) == NAMESPACE_DECL
)
4145 set_identifier_type_value_with_scope (name
, NULL_TREE
,
4146 current_binding_level
);
4153 && TREE_CODE (oldlocal
) == VAR_DECL
4154 && DECL_DEAD_FOR_LOCAL (oldlocal
))
4155 oldlocal
= DECL_SHADOWED_FOR_VAR (oldlocal
);
4157 if (oldlocal
== NULL_TREE
)
4158 oldlocal
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (d
));
4161 /* If this is an extern function declaration, see if we
4162 have a global definition or declaration for the function. */
4163 if (oldlocal
== NULL_TREE
4164 && DECL_EXTERNAL (x
)
4165 && oldglobal
!= NULL_TREE
4166 && TREE_CODE (x
) == FUNCTION_DECL
4167 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
4169 /* We have one. Their types must agree. */
4170 if (decls_match (x
, oldglobal
))
4174 cp_warning ("extern declaration of `%#D' doesn't match", x
);
4175 cp_warning_at ("global declaration `%#D'", oldglobal
);
4178 /* If we have a local external declaration,
4179 and no file-scope declaration has yet been seen,
4180 then if we later have a file-scope decl it must not be static. */
4181 if (oldlocal
== NULL_TREE
4182 && oldglobal
== NULL_TREE
4183 && DECL_EXTERNAL (x
)
4185 TREE_PUBLIC (name
) = 1;
4187 /* Warn if shadowing an argument at the top level of the body. */
4188 if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
4189 /* Inline decls shadow nothing. */
4190 && !DECL_FROM_INLINE (x
)
4191 && TREE_CODE (oldlocal
) == PARM_DECL
4192 /* Don't complain if it's from an enclosing function. */
4193 && DECL_CONTEXT (oldlocal
) == current_function_decl
4194 && TREE_CODE (x
) != PARM_DECL
)
4196 /* Go to where the parms should be and see if we
4198 struct binding_level
*b
= current_binding_level
->level_chain
;
4204 if (b
->parm_flag
== 1)
4205 cp_error ("declaration of `%#D' shadows a parameter", name
);
4208 /* Maybe warn if shadowing something else. */
4209 if (warn_shadow
&& !DECL_EXTERNAL (x
)
4210 /* Inline decls shadow nothing. */
4211 && !DECL_FROM_INLINE (x
)
4212 /* No shadow warnings for internally generated vars. */
4213 && ! DECL_ARTIFICIAL (x
)
4214 /* No shadow warnings for vars made for inlining. */
4215 && ! DECL_FROM_INLINE (x
))
4217 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
4218 warning ("declaration of `%s' shadows a parameter",
4219 IDENTIFIER_POINTER (name
));
4220 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
4221 && current_class_ptr
4222 && !TREE_STATIC (name
))
4223 warning ("declaration of `%s' shadows a member of `this'",
4224 IDENTIFIER_POINTER (name
));
4225 else if (oldlocal
!= NULL_TREE
)
4226 warning ("declaration of `%s' shadows previous local",
4227 IDENTIFIER_POINTER (name
));
4228 else if (oldglobal
!= NULL_TREE
)
4229 /* XXX shadow warnings in outer-more namespaces */
4230 warning ("declaration of `%s' shadows global declaration",
4231 IDENTIFIER_POINTER (name
));
4235 if (TREE_CODE (x
) == FUNCTION_DECL
)
4236 check_default_args (x
);
4238 /* Keep count of variables in this level with incomplete type. */
4239 if (TREE_CODE (x
) == VAR_DECL
4240 && TREE_TYPE (x
) != error_mark_node
4241 && ((!COMPLETE_TYPE_P (TREE_TYPE (x
))
4242 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
4243 /* RTTI TD entries are created while defining the type_info. */
4244 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
4245 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
4247 if (namespace_bindings_p ())
4248 namespace_scope_incomplete
4249 = tree_cons (NULL_TREE
, x
, namespace_scope_incomplete
);
4251 current_binding_level
->incomplete
4252 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4256 if (need_new_binding
)
4257 add_decl_to_level (x
,
4258 DECL_NAMESPACE_SCOPE_P (x
)
4259 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x
))
4260 : current_binding_level
);
4265 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4266 caller to set DECL_CONTEXT properly. */
4269 pushdecl_with_scope (x
, level
)
4271 struct binding_level
*level
;
4273 register struct binding_level
*b
;
4274 tree function_decl
= current_function_decl
;
4276 current_function_decl
= NULL_TREE
;
4277 if (level
->parm_flag
== 2)
4279 b
= class_binding_level
;
4280 class_binding_level
= level
;
4281 pushdecl_class_level (x
);
4282 class_binding_level
= b
;
4286 b
= current_binding_level
;
4287 current_binding_level
= level
;
4289 current_binding_level
= b
;
4291 current_function_decl
= function_decl
;
4295 /* Like pushdecl, only it places X in the current namespace,
4299 pushdecl_namespace_level (x
)
4302 register struct binding_level
*b
= current_binding_level
;
4305 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4307 /* Now, the type_shadowed stack may screw us. Munge it so it does
4309 if (TREE_CODE (x
) == TYPE_DECL
)
4311 tree name
= DECL_NAME (x
);
4313 tree
*ptr
= (tree
*)0;
4314 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4316 tree shadowed
= b
->type_shadowed
;
4317 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4318 if (TREE_PURPOSE (shadowed
) == name
)
4320 ptr
= &TREE_VALUE (shadowed
);
4321 /* Can't break out of the loop here because sometimes
4322 a binding level will have duplicate bindings for
4323 PT names. It's gross, but I haven't time to fix it. */
4326 newval
= TREE_TYPE (x
);
4327 if (ptr
== (tree
*)0)
4329 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4330 up here if this is changed to an assertion. --KR */
4331 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4341 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4345 pushdecl_top_level (x
)
4348 push_to_top_level ();
4349 x
= pushdecl_namespace_level (x
);
4350 pop_from_top_level ();
4354 /* Make the declaration of X appear in CLASS scope. */
4357 pushdecl_class_level (x
)
4360 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4361 scope looks for the pre-mangled name. */
4364 if (TREE_CODE (x
) == OVERLOAD
)
4365 x
= OVL_CURRENT (x
);
4366 name
= DECL_NAME (x
);
4370 push_class_level_binding (name
, x
);
4371 if (TREE_CODE (x
) == TYPE_DECL
)
4372 set_identifier_type_value (name
, TREE_TYPE (x
));
4374 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4378 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4381 pushdecl_class_level (f
);
4385 /* Enter DECL into the symbol table, if that's appropriate. Returns
4386 DECL, or a modified version thereof. */
4389 maybe_push_decl (decl
)
4392 tree type
= TREE_TYPE (decl
);
4394 /* Add this decl to the current binding level, but not if it comes
4395 from another scope, e.g. a static member variable. TEM may equal
4396 DECL or it may be a previous decl of the same name. */
4397 if (decl
== error_mark_node
4398 || (TREE_CODE (decl
) != PARM_DECL
4399 && DECL_CONTEXT (decl
) != NULL_TREE
4400 /* Definitions of namespace members outside their namespace are
4402 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4403 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4404 || TREE_CODE (type
) == UNKNOWN_TYPE
4405 /* The declaration of a template specialization does not affect
4406 the functions available for overload resolution, so we do not
4408 || (TREE_CODE (decl
) == FUNCTION_DECL
4409 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4412 return pushdecl (decl
);
4415 /* Make the declaration(s) of X appear in CLASS scope
4416 under the name NAME. */
4419 push_class_level_binding (name
, x
)
4424 /* The class_binding_level will be NULL if x is a template
4425 parameter name in a member template. */
4426 if (!class_binding_level
)
4429 /* Make sure that this new member does not have the same name
4430 as a template parameter. */
4431 if (TYPE_BEING_DEFINED (current_class_type
))
4432 check_template_shadow (x
);
4434 /* If this declaration shadows a declaration from an enclosing
4435 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4436 we leave this class. Record the shadowed declaration here. */
4437 binding
= IDENTIFIER_BINDING (name
);
4439 && ((TREE_CODE (x
) == OVERLOAD
4440 && BINDING_VALUE (binding
)
4441 && is_overloaded_fn (BINDING_VALUE (binding
)))
4442 || INHERITED_VALUE_BINDING_P (binding
)))
4447 /* If the old binding was from a base class, and was for a tag
4448 name, slide it over to make room for the new binding. The
4449 old binding is still visible if explicitly qualified with a
4451 if (INHERITED_VALUE_BINDING_P (binding
)
4452 && BINDING_VALUE (binding
)
4453 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4454 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4455 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4457 old_decl
= BINDING_TYPE (binding
);
4458 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4459 BINDING_VALUE (binding
) = NULL_TREE
;
4460 INHERITED_VALUE_BINDING_P (binding
) = 0;
4463 old_decl
= BINDING_VALUE (binding
);
4465 /* There was already a binding for X containing fewer
4466 functions than are named in X. Find the previous
4467 declaration of X on the class-shadowed list, and update it. */
4468 for (shadow
= class_binding_level
->class_shadowed
;
4470 shadow
= TREE_CHAIN (shadow
))
4471 if (TREE_PURPOSE (shadow
) == name
4472 && TREE_TYPE (shadow
) == old_decl
)
4474 BINDING_VALUE (binding
) = x
;
4475 INHERITED_VALUE_BINDING_P (binding
) = 0;
4476 TREE_TYPE (shadow
) = x
;
4481 /* If we didn't replace an existing binding, put the binding on the
4482 stack of bindings for the identifier, and update
4483 IDENTIFIER_CLASS_VALUE. */
4484 if (push_class_binding (name
, x
))
4486 class_binding_level
->class_shadowed
4487 = tree_cons (name
, IDENTIFIER_CLASS_VALUE (name
),
4488 class_binding_level
->class_shadowed
);
4489 /* Record the value we are binding NAME to so that we can know
4490 what to pop later. */
4491 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4495 /* Insert another USING_DECL into the current binding level, returning
4496 this declaration. If this is a redeclaration, do nothing, and
4497 return NULL_TREE if this not in namespace scope (in namespace
4498 scope, a using decl might extend any previous bindings). */
4501 push_using_decl (scope
, name
)
4507 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4508 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4509 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4510 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4513 return namespace_bindings_p () ? decl
: NULL_TREE
;
4514 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4515 DECL_INITIAL (decl
) = scope
;
4516 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4517 current_binding_level
->usings
= decl
;
4521 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4522 changed (i.e. there was already a directive), or the fresh
4523 TREE_LIST otherwise. */
4526 push_using_directive (used
)
4529 tree ud
= current_binding_level
->using_directives
;
4530 tree iter
, ancestor
;
4532 /* Check if we already have this. */
4533 if (purpose_member (used
, ud
) != NULL_TREE
)
4536 /* Recursively add all namespaces used. */
4537 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4538 push_using_directive (TREE_PURPOSE (iter
));
4540 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4541 ud
= current_binding_level
->using_directives
;
4542 ud
= tree_cons (used
, ancestor
, ud
);
4543 current_binding_level
->using_directives
= ud
;
4547 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4548 other definitions already in place. We get around this by making
4549 the value of the identifier point to a list of all the things that
4550 want to be referenced by that name. It is then up to the users of
4551 that name to decide what to do with that list.
4553 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its
4554 DECL_TEMPLATE_RESULT. It is dealt with the same way.
4556 FLAGS is a bitwise-or of the following values:
4557 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4559 PUSH_USING: DECL is being pushed as the result of a using
4562 The value returned may be a previous declaration if we guessed wrong
4563 about what language DECL should belong to (C or C++). Otherwise,
4564 it's always DECL (and never something that's not a _DECL). */
4567 push_overloaded_decl (decl
, flags
)
4571 tree name
= DECL_NAME (decl
);
4574 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4577 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4579 old
= lookup_name_current_level (name
);
4583 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4585 tree t
= TREE_TYPE (old
);
4586 if (IS_AGGR_TYPE (t
) && warn_shadow
4587 && (! DECL_IN_SYSTEM_HEADER (decl
)
4588 || ! DECL_IN_SYSTEM_HEADER (old
)))
4589 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4592 else if (is_overloaded_fn (old
))
4596 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4598 tree fn
= OVL_CURRENT (tmp
);
4600 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4601 && !(flags
& PUSH_USING
)
4602 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4603 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4604 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4607 if (duplicate_decls (decl
, fn
))
4611 else if (old
== error_mark_node
)
4612 /* Ignore the undefined symbol marker. */
4616 cp_error_at ("previous non-function declaration `%#D'", old
);
4617 cp_error ("conflicts with function declaration `%#D'", decl
);
4622 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4624 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4625 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4627 new_binding
= ovl_cons (decl
, old
);
4628 if (flags
& PUSH_USING
)
4629 OVL_USED (new_binding
) = 1;
4632 /* NAME is not ambiguous. */
4636 set_namespace_binding (name
, current_namespace
, new_binding
);
4639 /* We only create an OVERLOAD if there was a previous binding at
4640 this level, or if decl is a template. In the former case, we
4641 need to remove the old binding and replace it with the new
4642 binding. We must also run through the NAMES on the binding
4643 level where the name was bound to update the chain. */
4645 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4649 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4651 d
= &TREE_CHAIN (*d
))
4653 || (TREE_CODE (*d
) == TREE_LIST
4654 && TREE_VALUE (*d
) == old
))
4656 if (TREE_CODE (*d
) == TREE_LIST
)
4657 /* Just replace the old binding with the new. */
4658 TREE_VALUE (*d
) = new_binding
;
4660 /* Build a TREE_LIST to wrap the OVERLOAD. */
4661 *d
= tree_cons (NULL_TREE
, new_binding
,
4664 /* And update the CPLUS_BINDING node. */
4665 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4670 /* We should always find a previous binding in this case. */
4671 my_friendly_abort (0);
4674 /* Install the new binding. */
4675 push_local_binding (name
, new_binding
, flags
);
4681 /* Generate an implicit declaration for identifier FUNCTIONID
4682 as a function of type int (). Print a warning if appropriate. */
4685 implicitly_declare (functionid
)
4690 /* We used to reuse an old implicit decl here,
4691 but this loses with inline functions because it can clobber
4692 the saved decl chains. */
4693 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4695 DECL_EXTERNAL (decl
) = 1;
4696 TREE_PUBLIC (decl
) = 1;
4698 /* ISO standard says implicit declarations are in the innermost block.
4699 So we record the decl in the standard fashion. */
4701 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4704 /* Only one warning per identifier. */
4705 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4707 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4710 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4715 /* Return zero if the declaration NEWDECL is valid
4716 when the declaration OLDDECL (assumed to be for the same name)
4717 has already been seen.
4718 Otherwise return an error message format string with a %s
4719 where the identifier should go. */
4722 redeclaration_error_message (newdecl
, olddecl
)
4723 tree newdecl
, olddecl
;
4725 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4727 /* Because C++ can put things into name space for free,
4728 constructs like "typedef struct foo { ... } foo"
4729 would look like an erroneous redeclaration. */
4730 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4733 return "redefinition of `%#D'";
4735 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4737 /* If this is a pure function, its olddecl will actually be
4738 the original initialization to `0' (which we force to call
4739 abort()). Don't complain about redefinition in this case. */
4740 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_PURE_VIRTUAL_P (olddecl
))
4743 /* If both functions come from different namespaces, this is not
4744 a redeclaration - this is a conflict with a used function. */
4745 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4746 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4747 return "`%D' conflicts with used function";
4749 /* We'll complain about linkage mismatches in
4750 warn_extern_redeclared_static. */
4752 /* Defining the same name twice is no good. */
4753 if (DECL_INITIAL (olddecl
) != NULL_TREE
4754 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4756 if (DECL_NAME (olddecl
) == NULL_TREE
)
4757 return "`%#D' not declared in class";
4759 return "redefinition of `%#D'";
4763 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4765 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4766 && (DECL_TEMPLATE_RESULT (newdecl
)
4767 != DECL_TEMPLATE_RESULT (olddecl
))
4768 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4769 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4770 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4771 && COMPLETE_TYPE_P (TREE_TYPE (newdecl
))
4772 && COMPLETE_TYPE_P (TREE_TYPE (olddecl
))))
4773 return "redefinition of `%#D'";
4776 else if (toplevel_bindings_p () || DECL_NAMESPACE_SCOPE_P (newdecl
))
4778 /* Objects declared at top level: */
4779 /* If at least one is a reference, it's ok. */
4780 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4782 /* Reject two definitions. */
4783 return "redefinition of `%#D'";
4787 /* Objects declared with block scope: */
4788 /* Reject two definitions, and reject a definition
4789 together with an external reference. */
4790 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4791 return "redeclaration of `%#D'";
4796 /* Create a new label, named ID. */
4799 make_label_decl (id
, local_p
)
4805 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4807 /* Make sure every label has an rtx. */
4810 DECL_CONTEXT (decl
) = current_function_decl
;
4811 DECL_MODE (decl
) = VOIDmode
;
4812 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
4814 /* Say where one reference is to the label, for the sake of the
4815 error if it is not defined. */
4816 DECL_SOURCE_LINE (decl
) = lineno
;
4817 DECL_SOURCE_FILE (decl
) = input_filename
;
4819 /* Record the fact that this identifier is bound to this label. */
4820 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4825 /* Record this label on the list of used labels so that we can check
4826 at the end of the function to see whether or not the label was
4827 actually defined, and so we can check when the label is defined whether
4828 this use is valid. */
4834 if (named_label_uses
== NULL
4835 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4836 || named_label_uses
->label_decl
!= decl
)
4838 struct named_label_use_list
*new_ent
;
4839 new_ent
= ((struct named_label_use_list
*)
4840 ggc_alloc (sizeof (struct named_label_use_list
)));
4841 new_ent
->label_decl
= decl
;
4842 new_ent
->names_in_scope
= current_binding_level
->names
;
4843 new_ent
->binding_level
= current_binding_level
;
4844 new_ent
->lineno_o_goto
= lineno
;
4845 new_ent
->filename_o_goto
= input_filename
;
4846 new_ent
->next
= named_label_uses
;
4847 named_label_uses
= new_ent
;
4851 /* Look for a label named ID in the current function. If one cannot
4852 be found, create one. (We keep track of used, but undefined,
4853 labels, and complain about them at the end of a function.) */
4860 struct named_label_list
*ent
;
4862 /* You can't use labels at global scope. */
4863 if (current_function_decl
== NULL_TREE
)
4865 error ("label `%s' referenced outside of any function",
4866 IDENTIFIER_POINTER (id
));
4870 /* See if we've already got this label. */
4871 decl
= IDENTIFIER_LABEL_VALUE (id
);
4872 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
4875 /* Record this label on the list of labels used in this function.
4876 We do this before calling make_label_decl so that we get the
4877 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4878 ent
= ((struct named_label_list
*)
4879 ggc_alloc_cleared (sizeof (struct named_label_list
)));
4880 ent
->old_value
= IDENTIFIER_LABEL_VALUE (id
);
4881 ent
->next
= named_labels
;
4884 /* We need a new label. */
4885 decl
= make_label_decl (id
, /*local_p=*/0);
4887 /* Now fill in the information we didn't have before. */
4888 ent
->label_decl
= decl
;
4893 /* Declare a local label named ID. */
4896 declare_local_label (id
)
4901 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4902 this scope we can restore the old value of
4903 IDENTIFIER_TYPE_VALUE. */
4904 current_binding_level
->shadowed_labels
4905 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4906 current_binding_level
->shadowed_labels
);
4907 /* Look for the label. */
4908 decl
= make_label_decl (id
, /*local_p=*/1);
4909 /* Now fill in the information we didn't have before. */
4910 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
4915 /* Returns nonzero if it is ill-formed to jump past the declaration of
4916 DECL. Returns 2 if it's also a real problem. */
4919 decl_jump_unsafe (decl
)
4922 if (TREE_CODE (decl
) != VAR_DECL
|| TREE_STATIC (decl
))
4925 if (DECL_INITIAL (decl
) == NULL_TREE
4926 && pod_type_p (TREE_TYPE (decl
)))
4929 /* This is really only important if we're crossing an initialization.
4930 The POD stuff is just pedantry; why should it matter if the class
4931 contains a field of pointer to member type? */
4932 if (DECL_INITIAL (decl
)
4933 || (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))))
4938 /* Check that a single previously seen jump to a newly defined label
4939 is OK. DECL is the LABEL_DECL or 0; LEVEL is the binding_level for
4940 the jump context; NAMES are the names in scope in LEVEL at the jump
4941 context; FILE and LINE are the source position of the jump or 0. */
4944 check_previous_goto_1 (decl
, level
, names
, file
, line
)
4946 struct binding_level
*level
;
4953 struct binding_level
*b
= current_binding_level
;
4954 for (; b
; b
= b
->level_chain
)
4956 tree new_decls
= b
->names
;
4957 tree old_decls
= (b
== level
? names
: NULL_TREE
);
4958 for (; new_decls
!= old_decls
;
4959 new_decls
= TREE_CHAIN (new_decls
))
4961 int problem
= decl_jump_unsafe (new_decls
);
4968 cp_pedwarn ("jump to label `%D'", decl
);
4970 pedwarn ("jump to case label");
4973 pedwarn_with_file_and_line (file
, line
, " from here");
4977 if (problem
> 1 && DECL_ARTIFICIAL (new_decls
))
4978 /* Can't skip init of __exception_info. */
4979 cp_error_at (" enters catch block", new_decls
);
4980 else if (problem
> 1)
4981 cp_error_at (" crosses initialization of `%#D'",
4984 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4990 if (b
->eh_region
&& ! saw_eh
)
4995 cp_pedwarn ("jump to label `%D'", decl
);
4997 pedwarn ("jump to case label");
5000 pedwarn_with_file_and_line (file
, line
, " from here");
5003 error (" enters try block");
5010 check_previous_goto (use
)
5011 struct named_label_use_list
*use
;
5013 check_previous_goto_1 (use
->label_decl
, use
->binding_level
,
5014 use
->names_in_scope
, use
->filename_o_goto
,
5015 use
->lineno_o_goto
);
5019 check_switch_goto (level
)
5020 struct binding_level
*level
;
5022 check_previous_goto_1 (NULL_TREE
, level
, level
->names
, NULL
, 0);
5025 /* Check that any previously seen jumps to a newly defined label DECL
5026 are OK. Called by define_label. */
5029 check_previous_gotos (decl
)
5032 struct named_label_use_list
**usep
;
5034 if (! TREE_USED (decl
))
5037 for (usep
= &named_label_uses
; *usep
; )
5039 struct named_label_use_list
*use
= *usep
;
5040 if (use
->label_decl
== decl
)
5042 check_previous_goto (use
);
5046 usep
= &(use
->next
);
5050 /* Check that a new jump to a label DECL is OK. Called by
5051 finish_goto_stmt. */
5059 struct named_label_list
*lab
;
5061 /* We can't know where a computed goto is jumping. So we assume
5063 if (! DECL_P (decl
))
5066 /* If the label hasn't been defined yet, defer checking. */
5067 if (! DECL_INITIAL (decl
))
5073 for (lab
= named_labels
; lab
; lab
= lab
->next
)
5074 if (decl
== lab
->label_decl
)
5077 /* If the label is not on named_labels it's a gcc local label, so
5078 it must be in an outer scope, so jumping to it is always OK. */
5082 if ((lab
->eh_region
|| lab
->bad_decls
) && !identified
)
5084 cp_pedwarn_at ("jump to label `%D'", decl
);
5085 pedwarn (" from here");
5089 for (bad
= lab
->bad_decls
; bad
; bad
= TREE_CHAIN (bad
))
5091 tree b
= TREE_VALUE (bad
);
5092 int u
= decl_jump_unsafe (b
);
5094 if (u
> 1 && DECL_ARTIFICIAL (b
))
5095 /* Can't skip init of __exception_info. */
5096 cp_error_at (" enters catch block", b
);
5098 cp_error_at (" skips initialization of `%#D'", b
);
5100 cp_pedwarn_at (" enters scope of non-POD `%#D'", b
);
5104 error (" enters try block");
5107 /* Define a label, specifying the location in the source file.
5108 Return the LABEL_DECL node for the label, if the definition is valid.
5109 Otherwise return 0. */
5112 define_label (filename
, line
, name
)
5113 const char *filename
;
5117 tree decl
= lookup_label (name
);
5118 struct named_label_list
*ent
;
5120 for (ent
= named_labels
; ent
; ent
= ent
->next
)
5121 if (ent
->label_decl
== decl
)
5124 /* After labels, make any new cleanups go into their
5125 own new (temporary) binding contour. */
5126 current_binding_level
->more_cleanups_ok
= 0;
5128 if (name
== get_identifier ("wchar_t"))
5129 cp_pedwarn ("label named wchar_t");
5131 if (DECL_INITIAL (decl
) != NULL_TREE
)
5133 cp_error ("duplicate label `%D'", decl
);
5138 /* Mark label as having been defined. */
5139 DECL_INITIAL (decl
) = error_mark_node
;
5140 /* Say where in the source. */
5141 DECL_SOURCE_FILE (decl
) = filename
;
5142 DECL_SOURCE_LINE (decl
) = line
;
5145 ent
->names_in_scope
= current_binding_level
->names
;
5146 ent
->binding_level
= current_binding_level
;
5148 check_previous_gotos (decl
);
5149 current_function_return_value
= NULL_TREE
;
5156 struct binding_level
*level
;
5157 struct cp_switch
*next
;
5160 static struct cp_switch
*switch_stack
;
5166 = (struct cp_switch
*) xmalloc (sizeof (struct cp_switch
));
5167 p
->level
= current_binding_level
;
5168 p
->next
= switch_stack
;
5175 struct cp_switch
*cs
;
5178 switch_stack
= switch_stack
->next
;
5182 /* Note that we've seen a definition of a case label, and complain if this
5183 is a bad place for one. */
5186 define_case_label ()
5188 tree cleanup
= last_cleanup_this_contour ();
5191 /* Don't crash; we'll complain in do_case. */
5196 static int explained
= 0;
5197 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup
));
5198 warning ("where case label appears here");
5201 warning ("(enclose actions of previous case statements requiring");
5202 warning ("destructors in their own binding contours.)");
5207 check_switch_goto (switch_stack
->level
);
5209 /* After labels, make any new cleanups go into their
5210 own new (temporary) binding contour. */
5212 current_binding_level
->more_cleanups_ok
= 0;
5213 current_function_return_value
= NULL_TREE
;
5216 /* Return the list of declarations of the current level.
5217 Note that this list is in reverse order unless/until
5218 you nreverse it; and when you do nreverse it, you must
5219 store the result back using `storedecls' or you will lose. */
5224 return current_binding_level
->names
;
5227 /* Return the list of type-tags (for structs, etc) of the current level. */
5232 return current_binding_level
->tags
;
5235 /* Store the list of declarations of the current level.
5236 This is done for the parameter declarations of a function being defined,
5237 after they are modified in the light of any missing parameters. */
5243 current_binding_level
->names
= decls
;
5246 /* Similarly, store the list of tags of the current level. */
5252 current_binding_level
->tags
= tags
;
5255 /* Given NAME, an IDENTIFIER_NODE,
5256 return the structure (or union or enum) definition for that name.
5257 Searches binding levels from BINDING_LEVEL up to the global level.
5258 If THISLEVEL_ONLY is nonzero, searches only the specified context
5259 (but skips any tag-transparent contexts to find one that is
5260 meaningful for tags).
5261 FORM says which kind of type the caller wants;
5262 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
5263 If the wrong kind of type is found, and it's not a template, an error is
5267 lookup_tag (form
, name
, binding_level
, thislevel_only
)
5268 enum tree_code form
;
5270 struct binding_level
*binding_level
;
5273 register struct binding_level
*level
;
5274 /* Non-zero if, we should look past a template parameter level, even
5275 if THISLEVEL_ONLY. */
5276 int allow_template_parms_p
= 1;
5278 for (level
= binding_level
; level
; level
= level
->level_chain
)
5281 if (ANON_AGGRNAME_P (name
))
5282 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5284 /* There's no need for error checking here, because
5285 anon names are unique throughout the compilation. */
5286 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
5287 return TREE_VALUE (tail
);
5289 else if (level
->namespace_p
)
5290 /* Do namespace lookup. */
5291 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
5293 tree old
= binding_for_name (name
, tail
);
5295 /* If we just skipped past a template parameter level,
5296 even though THISLEVEL_ONLY, and we find a template
5297 class declaration, then we use the _TYPE node for the
5298 template. See the example below. */
5299 if (thislevel_only
&& !allow_template_parms_p
5300 && old
&& BINDING_VALUE (old
)
5301 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
5302 old
= TREE_TYPE (BINDING_VALUE (old
));
5304 old
= BINDING_TYPE (old
);
5306 /* If it has an original type, it is a typedef, and we
5307 should not return it. */
5308 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
5310 if (old
&& TREE_CODE (old
) != form
5311 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
5313 cp_error ("`%#D' redeclared as %C", old
, form
);
5318 if (thislevel_only
|| tail
== global_namespace
)
5322 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5324 if (TREE_PURPOSE (tail
) == name
)
5326 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
5327 /* Should tighten this up; it'll probably permit
5328 UNION_TYPE and a struct template, for example. */
5330 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
5332 /* Definition isn't the kind we were looking for. */
5333 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
5337 return TREE_VALUE (tail
);
5340 if (thislevel_only
&& ! level
->tag_transparent
)
5342 if (level
->template_parms_p
&& allow_template_parms_p
)
5344 /* We must deal with cases like this:
5346 template <class T> struct S;
5347 template <class T> struct S {};
5349 When looking up `S', for the second declaration, we
5350 would like to find the first declaration. But, we
5351 are in the pseudo-global level created for the
5352 template parameters, rather than the (surrounding)
5353 namespace level. Thus, we keep going one more level,
5354 even though THISLEVEL_ONLY is non-zero. */
5355 allow_template_parms_p
= 0;
5367 set_current_level_tags_transparency (tags_transparent
)
5368 int tags_transparent
;
5370 current_binding_level
->tag_transparent
= tags_transparent
;
5374 /* Given a type, find the tag that was defined for it and return the tag name.
5375 Otherwise return 0. However, the value can never be 0
5376 in the cases in which this is used.
5378 C++: If NAME is non-zero, this is the new name to install. This is
5379 done when replacing anonymous tags with real tag names. */
5382 lookup_tag_reverse (type
, name
)
5386 register struct binding_level
*level
;
5388 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5391 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5393 if (TREE_VALUE (tail
) == type
)
5396 TREE_PURPOSE (tail
) = name
;
5397 return TREE_PURPOSE (tail
);
5404 /* Look up NAME in the NAMESPACE. */
5407 lookup_namespace_name (namespace, name
)
5408 tree
namespace, name
;
5411 tree template_id
= NULL_TREE
;
5413 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5415 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5416 /* This happens for A::B<int> when B is a namespace. */
5418 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5420 /* This happens for A::B where B is a template, and there are no
5421 template arguments. */
5422 cp_error ("invalid use of `%D'", name
);
5423 return error_mark_node
;
5426 namespace = ORIGINAL_NAMESPACE (namespace);
5428 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5431 name
= TREE_OPERAND (name
, 0);
5432 if (TREE_CODE (name
) == OVERLOAD
)
5433 name
= DECL_NAME (OVL_CURRENT (name
));
5434 else if (DECL_P (name
))
5435 name
= DECL_NAME (name
);
5438 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5440 val
= make_node (CPLUS_BINDING
);
5441 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5442 return error_mark_node
;
5444 if (BINDING_VALUE (val
))
5446 val
= BINDING_VALUE (val
);
5450 if (DECL_CLASS_TEMPLATE_P (val
))
5451 val
= lookup_template_class (val
,
5452 TREE_OPERAND (template_id
, 1),
5453 /*in_decl=*/NULL_TREE
,
5454 /*context=*/NULL_TREE
,
5455 /*entering_scope=*/0);
5456 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5457 || TREE_CODE (val
) == OVERLOAD
)
5458 val
= lookup_template_function (val
,
5459 TREE_OPERAND (template_id
, 1));
5462 cp_error ("`%D::%D' is not a template",
5464 return error_mark_node
;
5468 /* If we have a single function from a using decl, pull it out. */
5469 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5470 val
= OVL_FUNCTION (val
);
5474 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5475 return error_mark_node
;
5478 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5480 static unsigned long
5488 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5489 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5494 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5497 typename_compare (k1
, k2
)
5508 d1
= TYPE_NAME (t1
);
5509 d2
= TYPE_NAME (t2
);
5511 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5512 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5513 && ((TREE_TYPE (t1
) != NULL_TREE
)
5514 == (TREE_TYPE (t2
) != NULL_TREE
))
5515 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5516 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5519 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5520 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5521 is non-NULL, this type is being created by the implicit typename
5522 extension, and BASE_TYPE is a type named `t' in some base class of
5523 `T' which depends on template parameters.
5525 Returns the new TYPENAME_TYPE. */
5528 build_typename_type (context
, name
, fullname
, base_type
)
5536 struct hash_entry
* e
;
5538 static struct hash_table ht
;
5542 static struct hash_table
*h
= &ht
;
5543 if (!hash_table_init (&ht
, &hash_newfunc
, &typename_hash
,
5545 fatal ("virtual memory exhausted");
5546 ggc_add_tree_hash_table_root (&h
, 1);
5549 /* Build the TYPENAME_TYPE. */
5550 t
= make_aggr_type (TYPENAME_TYPE
);
5551 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5552 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5553 TREE_TYPE (t
) = base_type
;
5555 /* Build the corresponding TYPE_DECL. */
5556 d
= build_decl (TYPE_DECL
, name
, t
);
5557 TYPE_NAME (TREE_TYPE (d
)) = d
;
5558 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5559 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5560 DECL_ARTIFICIAL (d
) = 1;
5562 /* See if we already have this type. */
5563 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5567 /* Insert the type into the table. */
5568 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5573 /* Resolve `typename CONTEXT::NAME'. Returns an appropriate type,
5574 unless an error occurs, in which case error_mark_node is returned.
5575 If COMPLAIN zero, don't complain about any errors that occur. */
5578 make_typename_type (context
, name
, complain
)
5586 if (!(TYPE_LANG_SPECIFIC (name
)
5587 && (CLASSTYPE_IS_TEMPLATE (name
)
5588 || CLASSTYPE_USE_TEMPLATE (name
))))
5589 name
= TYPE_IDENTIFIER (name
);
5591 /* Create a TEMPLATE_ID_EXPR for the type. */
5592 name
= build_nt (TEMPLATE_ID_EXPR
,
5593 CLASSTYPE_TI_TEMPLATE (name
),
5594 CLASSTYPE_TI_ARGS (name
));
5596 else if (TREE_CODE (name
) == TYPE_DECL
)
5597 name
= DECL_NAME (name
);
5601 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5603 name
= TREE_OPERAND (name
, 0);
5604 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5605 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5607 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5608 my_friendly_abort (2000);
5610 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5612 /* We can get here from typename_sub0 in the explicit_template_type
5613 expansion. Just fail. */
5615 cp_error ("no class template named `%#T' in `%#T'",
5617 return error_mark_node
;
5620 if (! uses_template_parms (context
)
5621 || currently_open_class (context
))
5623 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5625 tree tmpl
= NULL_TREE
;
5626 if (IS_AGGR_TYPE (context
))
5627 tmpl
= lookup_field (context
, name
, 0, 0);
5628 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5631 cp_error ("no class template named `%#T' in `%#T'",
5633 return error_mark_node
;
5636 return lookup_template_class (tmpl
,
5637 TREE_OPERAND (fullname
, 1),
5639 /*entering_scope=*/0);
5645 if (!IS_AGGR_TYPE (context
))
5648 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5649 return error_mark_node
;
5652 t
= lookup_field (context
, name
, 0, 1);
5654 return TREE_TYPE (t
);
5658 /* If the CONTEXT is not a template type, then either the field is
5659 there now or its never going to be. */
5660 if (!uses_template_parms (context
))
5663 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5664 return error_mark_node
;
5668 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5671 /* Select the right _DECL from multiple choices. */
5674 select_decl (binding
, flags
)
5679 val
= BINDING_VALUE (binding
);
5680 if (LOOKUP_NAMESPACES_ONLY (flags
))
5682 /* We are not interested in types. */
5683 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5688 /* If we could have a type and
5689 we have nothing or we need a type and have none. */
5690 if (BINDING_TYPE (binding
)
5691 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5692 && TREE_CODE (val
) != TYPE_DECL
)))
5693 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5694 /* Don't return non-types if we really prefer types. */
5695 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5696 && (TREE_CODE (val
) != TEMPLATE_DECL
5697 || !DECL_CLASS_TEMPLATE_P (val
)))
5703 /* Unscoped lookup of a global: iterate over current namespaces,
5704 considering using-directives. If SPACESP is non-NULL, store a list
5705 of the namespaces we've considered in it. */
5708 unqualified_namespace_lookup (name
, flags
, spacesp
)
5713 tree b
= make_node (CPLUS_BINDING
);
5714 tree initial
= current_decl_namespace();
5715 tree scope
= initial
;
5717 struct binding_level
*level
;
5718 tree val
= NULL_TREE
;
5721 *spacesp
= NULL_TREE
;
5723 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5726 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5727 val
= binding_for_name (name
, scope
);
5729 /* Initialize binding for this context. */
5730 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5731 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5733 /* Add all _DECLs seen through local using-directives. */
5734 for (level
= current_binding_level
;
5735 !level
->namespace_p
;
5736 level
= level
->level_chain
)
5737 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5738 scope
, flags
, spacesp
))
5739 /* Give up because of error. */
5740 return error_mark_node
;
5742 /* Add all _DECLs seen through global using-directives. */
5743 /* XXX local and global using lists should work equally. */
5747 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5748 scope
, flags
, spacesp
))
5749 /* Give up because of error. */
5750 return error_mark_node
;
5751 if (siter
== scope
) break;
5752 siter
= CP_DECL_CONTEXT (siter
);
5755 val
= select_decl (b
, flags
);
5756 if (scope
== global_namespace
)
5762 /* Combine prefer_type and namespaces_only into flags. */
5765 lookup_flags (prefer_type
, namespaces_only
)
5766 int prefer_type
, namespaces_only
;
5768 if (namespaces_only
)
5769 return LOOKUP_PREFER_NAMESPACES
;
5770 if (prefer_type
> 1)
5771 return LOOKUP_PREFER_TYPES
;
5772 if (prefer_type
> 0)
5773 return LOOKUP_PREFER_BOTH
;
5777 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5778 ignore it or not. Subroutine of lookup_name_real. */
5781 qualify_lookup (val
, flags
)
5785 if (val
== NULL_TREE
)
5787 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5789 if ((flags
& LOOKUP_PREFER_TYPES
)
5790 && (TREE_CODE (val
) == TYPE_DECL
5791 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5792 && DECL_CLASS_TEMPLATE_P (val
))))
5794 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5799 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5803 warn_about_implicit_typename_lookup (typename
, binding
)
5807 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5808 tree name
= DECL_NAME (typename
);
5810 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5811 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5812 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5813 && ! (TREE_CODE (binding
) == TYPE_DECL
5814 && same_type_p (TREE_TYPE (binding
), subtype
)))
5816 cp_warning ("lookup of `%D' finds `%#D'",
5818 cp_warning (" instead of `%D' from dependent base class",
5820 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5821 constructor_name (current_class_type
), name
);
5825 /* Look up NAME in the current binding level and its superiors in the
5826 namespace of variables, functions and typedefs. Return a ..._DECL
5827 node of some kind representing its definition if there is only one
5828 such declaration, or return a TREE_LIST with all the overloaded
5829 definitions if there are many, or return 0 if it is undefined.
5831 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5832 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5833 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5834 Otherwise we prefer non-TYPE_DECLs.
5836 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5837 using IDENTIFIER_CLASS_VALUE. */
5840 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5842 int prefer_type
, nonclass
, namespaces_only
;
5845 tree val
= NULL_TREE
;
5847 tree from_obj
= NULL_TREE
;
5849 int val_is_implicit_typename
= 0;
5851 /* Hack: copy flag set by parser, if set. */
5852 if (only_namespace_names
)
5853 namespaces_only
= 1;
5855 if (prefer_type
== -2)
5857 extern int looking_for_typename
;
5858 tree type
= NULL_TREE
;
5861 prefer_type
= looking_for_typename
;
5863 flags
= lookup_flags (prefer_type
, namespaces_only
);
5864 /* If the next thing is '<', class templates are types. */
5865 if (looking_for_template
)
5866 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5868 /* std:: becomes :: for now. */
5869 if (got_scope
== std_node
)
5870 got_scope
= void_type_node
;
5874 else if (got_object
!= error_mark_node
)
5879 if (type
== error_mark_node
)
5880 return error_mark_node
;
5881 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5882 type
= TREE_TYPE (type
);
5885 type
= complete_type (type
);
5887 if (TREE_CODE (type
) == VOID_TYPE
)
5888 type
= global_namespace
;
5889 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5891 val
= make_node (CPLUS_BINDING
);
5892 flags
|= LOOKUP_COMPLAIN
;
5893 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5895 val
= select_decl (val
, flags
);
5897 else if (! IS_AGGR_TYPE (type
)
5898 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5899 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5900 || TREE_CODE (type
) == TYPENAME_TYPE
)
5901 /* Someone else will give an error about this if needed. */
5903 else if (type
== current_class_type
)
5904 val
= IDENTIFIER_CLASS_VALUE (name
);
5907 val
= lookup_member (type
, name
, 0, prefer_type
);
5908 type_access_control (type
, val
);
5910 /* Restore the containing TYPENAME_TYPE if we looked
5911 through it before. */
5912 if (got_scope
&& got_scope
!= type
5913 && val
&& TREE_CODE (val
) == TYPE_DECL
5914 && TREE_CODE (TREE_TYPE (val
)) == TYPENAME_TYPE
)
5915 TYPE_CONTEXT (TREE_TYPE (val
)) = got_scope
;
5923 else if (got_object
&& val
)
5928 flags
= lookup_flags (prefer_type
, namespaces_only
);
5929 /* If we're not parsing, we need to complain. */
5930 flags
|= LOOKUP_COMPLAIN
;
5933 /* First, look in non-namespace scopes. */
5935 if (current_class_type
== NULL_TREE
)
5938 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5942 if (!LOCAL_BINDING_P (t
) && nonclass
)
5943 /* We're not looking for class-scoped bindings, so keep going. */
5946 /* If this is the kind of thing we're looking for, we're done. */
5947 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5948 binding
= BINDING_VALUE (t
);
5949 else if ((flags
& LOOKUP_PREFER_TYPES
)
5950 && qualify_lookup (BINDING_TYPE (t
), flags
))
5951 binding
= BINDING_TYPE (t
);
5953 binding
= NULL_TREE
;
5955 /* Handle access control on types from enclosing or base classes. */
5956 if (binding
&& ! yylex
5957 && BINDING_LEVEL (t
) && BINDING_LEVEL (t
)->parm_flag
== 2)
5958 type_access_control (BINDING_LEVEL (t
)->this_class
, binding
);
5961 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5963 if (val_is_implicit_typename
&& !yylex
)
5964 warn_about_implicit_typename_lookup (val
, binding
);
5966 val_is_implicit_typename
5967 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5968 if (!val_is_implicit_typename
)
5973 /* Now lookup in namespace scopes. */
5974 if (!val
|| val_is_implicit_typename
)
5976 t
= unqualified_namespace_lookup (name
, flags
, 0);
5979 if (val_is_implicit_typename
&& !yylex
)
5980 warn_about_implicit_typename_lookup (val
, t
);
5988 /* This should only warn about types used in qualified-ids. */
5989 if (from_obj
&& from_obj
!= val
)
5991 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5992 && TREE_CODE (val
) == TYPE_DECL
5993 && TREE_TYPE (from_obj
) != TREE_TYPE (val
))
5995 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5996 name
, got_object
, TREE_TYPE (from_obj
));
5997 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
6001 /* We don't change val to from_obj if got_object depends on
6002 template parms because that breaks implicit typename for
6003 destructor calls. */
6004 if (! uses_template_parms (got_object
))
6008 /* If we have a single function from a using decl, pull it out. */
6009 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
6010 val
= OVL_FUNCTION (val
);
6019 lookup_name_nonclass (name
)
6022 return lookup_name_real (name
, 0, 1, 0);
6026 lookup_function_nonclass (name
, args
)
6030 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
6034 lookup_name_namespace_only (name
)
6037 /* type-or-namespace, nonclass, namespace_only */
6038 return lookup_name_real (name
, 1, 1, 1);
6042 lookup_name (name
, prefer_type
)
6046 return lookup_name_real (name
, prefer_type
, 0, 0);
6049 /* Similar to `lookup_name' but look only in the innermost non-class
6053 lookup_name_current_level (name
)
6056 struct binding_level
*b
;
6059 b
= current_binding_level
;
6060 while (b
->parm_flag
== 2)
6065 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
6067 /* extern "C" function() */
6068 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
6071 else if (IDENTIFIER_BINDING (name
)
6072 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
6076 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
6077 return IDENTIFIER_VALUE (name
);
6089 /* Like lookup_name_current_level, but for types. */
6092 lookup_type_current_level (name
)
6095 register tree t
= NULL_TREE
;
6097 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
6099 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
6100 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
6102 struct binding_level
*b
= current_binding_level
;
6105 if (purpose_member (name
, b
->type_shadowed
))
6106 return REAL_IDENTIFIER_TYPE_VALUE (name
);
6118 begin_only_namespace_names ()
6120 only_namespace_names
= 1;
6124 end_only_namespace_names ()
6126 only_namespace_names
= 0;
6129 /* Push the declarations of builtin types into the namespace.
6130 RID_INDEX, if < CP_RID_MAX is the index of the builtin type
6131 in the array RID_POINTERS. NAME is the name used when looking
6132 up the builtin type. TYPE is the _TYPE node for the builtin type. */
6135 record_builtin_type (rid_index
, name
, type
)
6140 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
6141 tree tdecl
= NULL_TREE
;
6143 if ((int) rid_index
< (int) CP_RID_MAX
)
6144 rname
= ridpointers
[(int) rid_index
];
6146 tname
= get_identifier (name
);
6148 TYPE_BUILT_IN (type
) = 1;
6152 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
6153 set_identifier_type_value (tname
, NULL_TREE
);
6154 if ((int) rid_index
< (int) CP_RID_MAX
)
6155 /* Built-in types live in the global namespace. */
6156 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
6158 if (rname
!= NULL_TREE
)
6160 if (tname
!= NULL_TREE
)
6162 set_identifier_type_value (rname
, NULL_TREE
);
6163 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
6167 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
6168 set_identifier_type_value (rname
, NULL_TREE
);
6173 /* Record one of the standard Java types.
6174 * Declare it as having the given NAME.
6175 * If SIZE > 0, it is the size of one of the integral types;
6176 * otherwise it is the negative of the size of one of the other types. */
6179 record_builtin_java_type (name
, size
)
6185 type
= make_signed_type (size
);
6186 else if (size
> -32)
6187 { /* "__java_char" or ""__java_boolean". */
6188 type
= make_unsigned_type (-size
);
6189 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
6192 { /* "__java_float" or ""__java_double". */
6193 type
= make_node (REAL_TYPE
);
6194 TYPE_PRECISION (type
) = - size
;
6197 record_builtin_type (CP_RID_MAX
, name
, type
);
6198 decl
= TYPE_NAME (type
);
6200 /* Suppress generate debug symbol entries for these types,
6201 since for normal C++ they are just clutter.
6202 However, push_lang_context undoes this if extern "Java" is seen. */
6203 DECL_IGNORED_P (decl
) = 1;
6205 TYPE_FOR_JAVA (type
) = 1;
6209 /* Push a type into the namespace so that the back-ends ignore it. */
6212 record_unknown_type (type
, name
)
6216 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
6217 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
6218 DECL_IGNORED_P (decl
) = 1;
6219 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
6220 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
6221 TYPE_ALIGN (type
) = 1;
6222 TYPE_USER_ALIGN (type
) = 0;
6223 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
6226 /* An string for which we should create an IDENTIFIER_NODE at
6229 typedef struct predefined_identifier
6231 /* The name of the identifier. */
6233 /* The place where the IDENTIFIER_NODE should be stored. */
6235 /* Non-zero if this is the name of a constructor or destructor. */
6237 } predefined_identifier
;
6239 /* Create all the predefined identifiers. */
6242 initialize_predefined_identifiers ()
6244 struct predefined_identifier
*pid
;
6246 /* A table of identifiers to create at startup. */
6247 static predefined_identifier predefined_identifiers
[] = {
6248 { "C++", &lang_name_cplusplus
, 0 },
6249 { "C", &lang_name_c
, 0 },
6250 { "Java", &lang_name_java
, 0 },
6251 { CTOR_NAME
, &ctor_identifier
, 1 },
6252 { "__base_ctor", &base_ctor_identifier
, 1 },
6253 { "__comp_ctor", &complete_ctor_identifier
, 1 },
6254 { DTOR_NAME
, &dtor_identifier
, 1 },
6255 { "__comp_dtor", &complete_dtor_identifier
, 1 },
6256 { "__base_dtor", &base_dtor_identifier
, 1 },
6257 { "__deleting_dtor", &deleting_dtor_identifier
, 1 },
6258 { VTABLE_DELTA2_NAME
, &delta2_identifier
, 0 },
6259 { VTABLE_DELTA_NAME
, &delta_identifier
, 0 },
6260 { IN_CHARGE_NAME
, &in_charge_identifier
, 0 },
6261 { VTABLE_INDEX_NAME
, &index_identifier
, 0 },
6262 { "nelts", &nelts_identifier
, 0 },
6263 { THIS_NAME
, &this_identifier
, 0 },
6264 { VTABLE_PFN_NAME
, &pfn_identifier
, 0 },
6265 { "__pfn_or_delta2", &pfn_or_delta2_identifier
, 0 },
6266 { "_vptr", &vptr_identifier
, 0 },
6267 { "__cp_push_exception", &cp_push_exception_identifier
, 0 },
6268 { "__vtt_parm", &vtt_parm_identifier
, 0 },
6269 { "std", &std_identifier
, 0 },
6273 for (pid
= predefined_identifiers
; pid
->name
; ++pid
)
6275 *pid
->node
= get_identifier (pid
->name
);
6276 if (pid
->ctor_or_dtor_p
)
6277 IDENTIFIER_CTOR_OR_DTOR_P (*pid
->node
) = 1;
6281 /* Create the predefined scalar types of C,
6282 and some nodes representing standard constants (0, 1, (void *)0).
6283 Initialize the global binding level.
6284 Make definitions for built-in primitive functions. */
6287 init_decl_processing ()
6290 int wchar_type_size
;
6291 tree array_domain_type
;
6293 /* Check to see that the user did not specify an invalid combination
6294 of command-line options. */
6295 if (flag_new_abi
&& !flag_vtable_thunks
)
6296 fatal ("the new ABI requires vtable thunks");
6298 /* Create all the identifiers we need. */
6299 initialize_predefined_identifiers ();
6301 /* Let the back-end now how to save and restore language-specific
6302 per-function globals. */
6303 init_lang_status
= &push_cp_function_context
;
6304 free_lang_status
= &pop_cp_function_context
;
6305 mark_lang_status
= &mark_cp_function_context
;
6311 /* Create the global variables. */
6312 push_to_top_level ();
6314 /* Enter the global namespace. */
6315 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
6316 push_namespace (get_identifier ("::"));
6317 global_namespace
= current_namespace
;
6318 current_lang_name
= NULL_TREE
;
6320 /* Adjust various flags based on command-line settings. */
6321 if (! flag_permissive
&& ! pedantic
)
6322 flag_pedantic_errors
= 1;
6323 if (!flag_no_inline
)
6324 flag_inline_trees
= 1;
6327 current_lang_name
= lang_name_c
;
6329 current_function_decl
= NULL_TREE
;
6330 current_binding_level
= NULL_BINDING_LEVEL
;
6331 free_binding_level
= NULL_BINDING_LEVEL
;
6333 build_common_tree_nodes (flag_signed_char
);
6335 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6336 TREE_TYPE (error_mark_list
) = error_mark_node
;
6338 /* Make the binding_level structure for global names. */
6340 global_binding_level
= current_binding_level
;
6341 /* The global level is the namespace level of ::. */
6342 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6343 declare_namespace_level ();
6345 /* Define `int' and `char' first so that dbx will output them first. */
6346 record_builtin_type (RID_INT
, NULL_PTR
, integer_type_node
);
6347 record_builtin_type (RID_CHAR
, "char", char_type_node
);
6349 /* `signed' is the same as `int' */
6350 record_builtin_type (RID_SIGNED
, NULL_PTR
, integer_type_node
);
6351 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
6352 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
6353 record_builtin_type (CP_RID_MAX
, "long unsigned int",
6354 long_unsigned_type_node
);
6355 record_builtin_type (CP_RID_MAX
, "unsigned long", long_unsigned_type_node
);
6356 record_builtin_type (CP_RID_MAX
, "long long int",
6357 long_long_integer_type_node
);
6358 record_builtin_type (CP_RID_MAX
, "long long unsigned int",
6359 long_long_unsigned_type_node
);
6360 record_builtin_type (CP_RID_MAX
, "long long unsigned",
6361 long_long_unsigned_type_node
);
6362 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
6363 record_builtin_type (CP_RID_MAX
, "short unsigned int",
6364 short_unsigned_type_node
);
6365 record_builtin_type (CP_RID_MAX
, "unsigned short",
6366 short_unsigned_type_node
);
6369 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE
)));
6371 /* Define both `signed char' and `unsigned char'. */
6372 record_builtin_type (CP_RID_MAX
, "signed char", signed_char_type_node
);
6373 record_builtin_type (CP_RID_MAX
, "unsigned char", unsigned_char_type_node
);
6375 /* `unsigned long' is the standard type for sizeof.
6376 Note that stddef.h uses `unsigned long',
6377 and this must agree, even if long and int are the same size. */
6379 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE
))));
6381 /* Create the widest literal types. */
6382 widest_integer_literal_type_node
= make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
6383 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6384 widest_integer_literal_type_node
));
6386 widest_unsigned_literal_type_node
= make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
6387 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6388 widest_unsigned_literal_type_node
));
6390 /* These are types that type_for_size and type_for_mode use. */
6391 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intQI_type_node
));
6392 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intHI_type_node
));
6393 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intSI_type_node
));
6394 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intDI_type_node
));
6395 #if HOST_BITS_PER_WIDE_INT >= 64
6396 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__int128_t"), intTI_type_node
));
6398 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intQI_type_node
));
6399 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intHI_type_node
));
6400 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intSI_type_node
));
6401 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intDI_type_node
));
6402 #if HOST_BITS_PER_WIDE_INT >= 64
6403 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__uint128_t"), unsigned_intTI_type_node
));
6406 build_common_tree_nodes_2 (flag_short_double
);
6408 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6409 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6410 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6411 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6412 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6413 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6414 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6415 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6417 integer_two_node
= build_int_2 (2, 0);
6418 TREE_TYPE (integer_two_node
) = integer_type_node
;
6419 integer_three_node
= build_int_2 (3, 0);
6420 TREE_TYPE (integer_three_node
) = integer_type_node
;
6422 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6423 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6424 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6425 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6426 TYPE_PRECISION (boolean_type_node
) = 1;
6427 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6428 boolean_false_node
= build_int_2 (0, 0);
6429 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6430 boolean_true_node
= build_int_2 (1, 0);
6431 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6433 signed_size_zero_node
= build_int_2 (0, 0);
6434 record_builtin_type (RID_FLOAT
, NULL_PTR
, float_type_node
);
6435 record_builtin_type (RID_DOUBLE
, NULL_PTR
, double_type_node
);
6436 record_builtin_type (CP_RID_MAX
, "long double", long_double_type_node
);
6438 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex int"),
6439 complex_integer_type_node
));
6440 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex float"),
6441 complex_float_type_node
));
6442 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex double"),
6443 complex_double_type_node
));
6444 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
6445 complex_long_double_type_node
));
6447 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6449 record_builtin_type (RID_VOID
, NULL_PTR
, void_type_node
);
6450 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
6451 TREE_PARMLIST (void_list_node
) = 1;
6453 /* Used for expressions that do nothing, but are not errors. */
6454 void_zero_node
= build_int_2 (0, 0);
6455 TREE_TYPE (void_zero_node
) = void_type_node
;
6457 string_type_node
= build_pointer_type (char_type_node
);
6458 const_string_type_node
6459 = build_pointer_type (build_qualified_type (char_type_node
,
6461 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6463 record_builtin_type (CP_RID_MAX
, NULL_PTR
, string_type_node
);
6466 /* Make a type to be the domain of a few array types
6467 whose domains don't really matter.
6468 200 is small enough that it always fits in size_t. */
6469 array_domain_type
= build_index_type (build_int_2 (200, 0));
6471 /* Make a type for arrays of characters.
6472 With luck nothing will ever really depend on the length of this
6474 char_array_type_node
6475 = build_array_type (char_type_node
, array_domain_type
);
6477 /* Likewise for arrays of ints. */
6479 = build_array_type (integer_type_node
, array_domain_type
);
6482 delta_type_node
= ptrdiff_type_node
;
6483 else if (flag_huge_objects
)
6484 delta_type_node
= long_integer_type_node
;
6486 delta_type_node
= short_integer_type_node
;
6489 vtable_index_type
= ptrdiff_type_node
;
6491 vtable_index_type
= delta_type_node
;
6493 default_function_type
6494 = build_function_type (integer_type_node
, NULL_TREE
);
6496 ptr_type_node
= build_pointer_type (void_type_node
);
6498 = build_pointer_type (build_qualified_type (void_type_node
,
6500 vtt_parm_type
= build_pointer_type (const_ptr_type_node
);
6501 c_common_nodes_and_builtins (1, flag_no_builtin
, flag_no_nonansi_builtin
);
6502 lang_type_promotes_to
= convert_type_from_ellipsis
;
6505 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6507 /* C++ extensions */
6509 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6510 record_unknown_type (unknown_type_node
, "unknown type");
6512 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6513 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6515 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6517 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6519 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6520 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6522 /* This is special for C++ so functions can be overloaded. */
6523 wchar_type_node
= get_identifier (flag_short_wchar
6524 ? "short unsigned int"
6526 wchar_type_node
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (wchar_type_node
));
6527 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
6528 if (TREE_UNSIGNED (wchar_type_node
))
6529 wchar_type_node
= make_signed_type (wchar_type_size
);
6531 wchar_type_node
= make_unsigned_type (wchar_type_size
);
6532 record_builtin_type (RID_WCHAR
, "__wchar_t", wchar_type_node
);
6534 /* Artificial declaration of wchar_t -- can be bashed */
6535 wchar_decl_node
= build_decl (TYPE_DECL
, get_identifier ("wchar_t"),
6537 pushdecl (wchar_decl_node
);
6539 /* This is for wide string constants. */
6540 wchar_array_type_node
6541 = build_array_type (wchar_type_node
, array_domain_type
);
6543 if (flag_vtable_thunks
)
6545 /* Make sure we get a unique function type, so we can give
6546 its pointer type a name. (This wins for gdb.) */
6547 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6548 TREE_TYPE (vfunc_type
) = integer_type_node
;
6549 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6550 layout_type (vfunc_type
);
6552 vtable_entry_type
= build_pointer_type (vfunc_type
);
6556 vtable_entry_type
= make_aggr_type (RECORD_TYPE
);
6557 fields
[0] = build_decl (FIELD_DECL
, delta_identifier
,
6559 fields
[1] = build_decl (FIELD_DECL
, index_identifier
,
6561 fields
[2] = build_decl (FIELD_DECL
, pfn_identifier
,
6563 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6566 /* Make this part of an invisible union. */
6567 fields
[3] = copy_node (fields
[2]);
6568 TREE_TYPE (fields
[3]) = delta_type_node
;
6569 DECL_NAME (fields
[3]) = delta2_identifier
;
6570 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6571 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6572 DECL_SIZE_UNIT (fields
[3]) = TYPE_SIZE_UNIT (delta_type_node
);
6573 TREE_UNSIGNED (fields
[3]) = 0;
6574 TREE_CHAIN (fields
[2]) = fields
[3];
6575 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6578 record_builtin_type (CP_RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6581 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6582 layout_type (vtbl_type_node
);
6583 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6584 record_builtin_type (CP_RID_MAX
, NULL_PTR
, vtbl_type_node
);
6585 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6586 layout_type (vtbl_ptr_type_node
);
6587 record_builtin_type (CP_RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6589 std_node
= build_decl (NAMESPACE_DECL
,
6591 ? get_identifier ("fake std") : std_identifier
,
6593 pushdecl (std_node
);
6597 push_namespace (get_identifier ("__cxxabiv1"));
6598 abi_node
= current_namespace
;
6602 global_type_node
= make_node (LANG_TYPE
);
6603 record_unknown_type (global_type_node
, "global type");
6606 current_lang_name
= lang_name_cplusplus
;
6609 tree bad_alloc_type_node
, newtype
, deltype
;
6611 push_namespace (get_identifier ("std"));
6612 bad_alloc_type_node
= xref_tag
6613 (class_type_node
, get_identifier ("bad_alloc"), 1);
6616 newtype
= build_exception_variant
6617 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6618 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6619 push_cp_library_fn (NEW_EXPR
, newtype
);
6620 push_cp_library_fn (VEC_NEW_EXPR
, newtype
);
6621 global_delete_fndecl
= push_cp_library_fn (DELETE_EXPR
, deltype
);
6622 push_cp_library_fn (VEC_DELETE_EXPR
, deltype
);
6626 = build_library_fn_ptr ("__pure_virtual", void_ftype
);
6628 /* Perform other language dependent initializations. */
6629 init_class_processing ();
6630 init_init_processing ();
6631 init_search_processing ();
6632 init_rtti_processing ();
6634 if (flag_exceptions
)
6635 init_exception_processing ();
6638 flag_inline_functions
= 0;
6641 if (! supports_one_only ())
6644 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6645 make_fname_decl
= cp_make_fname_decl
;
6646 declare_function_name ();
6648 /* Prepare to check format strings against argument lists. */
6649 init_function_format_info ();
6651 /* Show we use EH for cleanups. */
6652 using_eh_for_cleanups ();
6654 valid_lang_attribute
= cp_valid_lang_attribute
;
6656 /* Maintain consistency. Perhaps we should just complain if they
6657 say -fwritable-strings? */
6658 if (flag_writable_strings
)
6659 flag_const_strings
= 0;
6661 /* Add GC roots for all of our global variables. */
6662 ggc_add_tree_root (c_global_trees
, sizeof c_global_trees
/ sizeof(tree
));
6663 ggc_add_tree_root (cp_global_trees
, sizeof cp_global_trees
/ sizeof(tree
));
6664 ggc_add_tree_root (&integer_three_node
, 1);
6665 ggc_add_tree_root (&integer_two_node
, 1);
6666 ggc_add_tree_root (&signed_size_zero_node
, 1);
6667 ggc_add_tree_root (&size_one_node
, 1);
6668 ggc_add_tree_root (&size_zero_node
, 1);
6669 ggc_add_root (&global_binding_level
, 1, sizeof global_binding_level
,
6670 mark_binding_level
);
6671 ggc_add_root (&scope_chain
, 1, sizeof scope_chain
, &mark_saved_scope
);
6672 ggc_add_tree_root (&static_ctors
, 1);
6673 ggc_add_tree_root (&static_dtors
, 1);
6674 ggc_add_tree_root (&lastiddecl
, 1);
6676 ggc_add_tree_root (&last_function_parm_tags
, 1);
6677 ggc_add_tree_root (¤t_function_return_value
, 1);
6678 ggc_add_tree_root (¤t_function_parms
, 1);
6679 ggc_add_tree_root (¤t_function_parm_tags
, 1);
6680 ggc_add_tree_root (&last_function_parms
, 1);
6681 ggc_add_tree_root (&error_mark_list
, 1);
6683 ggc_add_tree_root (&global_namespace
, 1);
6684 ggc_add_tree_root (&global_type_node
, 1);
6685 ggc_add_tree_root (&anonymous_namespace_name
, 1);
6687 ggc_add_tree_root (&got_object
, 1);
6688 ggc_add_tree_root (&got_scope
, 1);
6690 ggc_add_tree_root (¤t_lang_name
, 1);
6691 ggc_add_tree_root (&static_aggregates
, 1);
6694 /* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the
6695 decl, NAME is the initialization string and TYPE_DEP indicates whether
6696 NAME depended on the type of the function. We make use of that to detect
6697 __PRETTY_FUNCTION__ inside a template fn. Because we build a tree for
6698 the function before emitting any of it, we don't need to treat the
6699 VAR_DECL specially. We can decide whether to emit it later, if it was
6703 cp_make_fname_decl (id
, name
, type_dep
)
6708 tree decl
, type
, init
;
6709 size_t length
= strlen (name
);
6710 tree domain
= NULL_TREE
;
6712 if (!processing_template_decl
)
6715 domain
= build_index_type (build_int_2 (length
, 0));
6717 type
= build_cplus_array_type
6718 (build_qualified_type (char_type_node
, TYPE_QUAL_CONST
),
6721 decl
= build_decl (VAR_DECL
, id
, type
);
6722 TREE_STATIC (decl
) = 1;
6723 TREE_READONLY (decl
) = 1;
6724 DECL_SOURCE_LINE (decl
) = 0;
6725 DECL_ARTIFICIAL (decl
) = 1;
6726 DECL_IN_SYSTEM_HEADER (decl
) = 1;
6728 if (processing_template_decl
)
6729 decl
= push_template_decl (decl
);
6732 init
= build (FUNCTION_NAME
, type
);
6733 DECL_PRETTY_FUNCTION_P (decl
) = 1;
6737 init
= build_string (length
+ 1, name
);
6738 TREE_TYPE (init
) = type
;
6740 DECL_INITIAL (decl
) = init
;
6741 cp_finish_decl (decl
, init
, NULL_TREE
, LOOKUP_ONLYCONVERTING
);
6743 /* We will have to make sure we only emit this, if it is actually used. */
6747 /* Entry point for the benefit of c_common_nodes_and_builtins.
6749 Make a definition for a builtin function named NAME and whose data type
6750 is TYPE. TYPE should be a function type with argument types.
6752 CLASS and CODE tell later passes how to compile calls to this function.
6753 See tree.h for possible values.
6755 If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6756 the name to be called if we can't opencode the function. */
6759 builtin_function (name
, type
, code
, class, libname
)
6763 enum built_in_class
class;
6764 const char *libname
;
6766 tree decl
= build_library_fn_1 (get_identifier (name
), ERROR_MARK
, type
);
6767 DECL_BUILT_IN_CLASS (decl
) = class;
6768 DECL_FUNCTION_CODE (decl
) = code
;
6770 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6772 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6773 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6774 function in the namespace. */
6777 DECL_ASSEMBLER_NAME (decl
) = get_identifier (libname
);
6778 make_function_rtl (decl
);
6780 /* Warn if a function in the namespace for users
6781 is used without an occasion to consider it declared. */
6782 if (name
[0] != '_' || name
[1] != '_')
6783 DECL_ANTICIPATED (decl
) = 1;
6788 /* Generate a FUNCTION_DECL with the typical flags for a runtime library
6789 function. Not called directly. */
6792 build_library_fn_1 (name
, operator_code
, type
)
6794 enum tree_code operator_code
;
6797 tree fn
= build_lang_decl (FUNCTION_DECL
, name
, type
);
6798 DECL_EXTERNAL (fn
) = 1;
6799 TREE_PUBLIC (fn
) = 1;
6800 DECL_ARTIFICIAL (fn
) = 1;
6801 TREE_NOTHROW (fn
) = 1;
6802 SET_OVERLOADED_OPERATOR_CODE (fn
, operator_code
);
6806 /* Returns the _DECL for a library function with C linkage.
6807 We assume that such functions never throw; if this is incorrect,
6808 callers should unset TREE_NOTHROW. */
6811 build_library_fn (name
, type
)
6815 tree fn
= build_library_fn_1 (name
, ERROR_MARK
, type
);
6816 make_function_rtl (fn
);
6820 /* Returns the _DECL for a library function with C++ linkage. */
6823 build_cp_library_fn (name
, operator_code
, type
)
6825 enum tree_code operator_code
;
6828 tree fn
= build_library_fn_1 (name
, operator_code
, type
);
6829 TREE_NOTHROW (fn
) = TYPE_NOTHROW_P (type
);
6830 DECL_CONTEXT (fn
) = FROB_CONTEXT (current_namespace
);
6831 set_mangled_name_for_decl (fn
);
6832 make_function_rtl (fn
);
6836 /* Like build_library_fn, but takes a C string instead of an
6840 build_library_fn_ptr (name
, type
)
6844 return build_library_fn (get_identifier (name
), type
);
6847 /* Like build_cp_library_fn, but takes a C string instead of an
6851 build_cp_library_fn_ptr (name
, type
)
6855 return build_cp_library_fn (get_identifier (name
), ERROR_MARK
, type
);
6858 /* Like build_library_fn, but also pushes the function so that we will
6859 be able to find it via IDENTIFIER_GLOBAL_VALUE. */
6862 push_library_fn (name
, type
)
6865 tree fn
= build_library_fn (name
, type
);
6866 pushdecl_top_level (fn
);
6870 /* Like build_cp_library_fn, but also pushes the function so that it
6871 will be found by normal lookup. */
6874 push_cp_library_fn (operator_code
, type
)
6875 enum tree_code operator_code
;
6878 tree fn
= build_cp_library_fn (ansi_opname (operator_code
),
6885 /* Like push_library_fn, but takes a TREE_LIST of parm types rather than
6889 push_void_library_fn (name
, parmtypes
)
6890 tree name
, parmtypes
;
6892 tree type
= build_function_type (void_type_node
, parmtypes
);
6893 return push_library_fn (name
, type
);
6896 /* Like push_library_fn, but also note that this function throws
6897 and does not return. Used for __throw_foo and the like. */
6900 push_throw_library_fn (name
, type
)
6903 tree fn
= push_library_fn (name
, type
);
6904 TREE_THIS_VOLATILE (fn
) = 1;
6905 TREE_NOTHROW (fn
) = 0;
6909 /* When we call finish_struct for an anonymous union, we create
6910 default copy constructors and such. But, an anonymous union
6911 shouldn't have such things; this function undoes the damage to the
6912 anonymous union type T.
6914 (The reason that we create the synthesized methods is that we don't
6915 distinguish `union { int i; }' from `typedef union { int i; } U'.
6916 The first is an anonymous union; the second is just an ordinary
6920 fixup_anonymous_aggr (t
)
6925 /* Wipe out memory of synthesized methods */
6926 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6927 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6928 TYPE_HAS_INIT_REF (t
) = 0;
6929 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6930 TYPE_HAS_ASSIGN_REF (t
) = 0;
6931 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6933 /* Splice the implicitly generated functions out of the TYPE_METHODS
6935 q
= &TYPE_METHODS (t
);
6938 if (DECL_ARTIFICIAL (*q
))
6939 *q
= TREE_CHAIN (*q
);
6941 q
= &TREE_CHAIN (*q
);
6944 /* ISO C++ 9.5.3. Anonymous unions may not have function members. */
6945 if (TYPE_METHODS (t
))
6946 error ("an anonymous union cannot have function members");
6949 /* Make sure that a declaration with no declarator is well-formed, i.e.
6950 just defines a tagged type or anonymous union.
6952 Returns the type defined, if any. */
6955 check_tag_decl (declspecs
)
6960 tree ob_modifier
= NULL_TREE
;
6962 register tree t
= NULL_TREE
;
6964 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6966 register tree value
= TREE_VALUE (link
);
6969 || (TREE_CODE (value
) == IDENTIFIER_NODE
6970 && IDENTIFIER_GLOBAL_VALUE (value
)
6971 && TYPE_P (IDENTIFIER_GLOBAL_VALUE (value
))))
6975 if ((TREE_CODE (value
) != TYPENAME_TYPE
&& IS_AGGR_TYPE (value
))
6976 || TREE_CODE (value
) == ENUMERAL_TYPE
)
6978 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6982 else if (value
== ridpointers
[(int) RID_FRIEND
])
6984 if (current_class_type
== NULL_TREE
6985 || current_scope () != current_class_type
)
6986 ob_modifier
= value
;
6990 else if (value
== ridpointers
[(int) RID_STATIC
]
6991 || value
== ridpointers
[(int) RID_EXTERN
]
6992 || value
== ridpointers
[(int) RID_AUTO
]
6993 || value
== ridpointers
[(int) RID_REGISTER
]
6994 || value
== ridpointers
[(int) RID_INLINE
]
6995 || value
== ridpointers
[(int) RID_VIRTUAL
]
6996 || value
== ridpointers
[(int) RID_CONST
]
6997 || value
== ridpointers
[(int) RID_VOLATILE
]
6998 || value
== ridpointers
[(int) RID_EXPLICIT
])
6999 ob_modifier
= value
;
7003 error ("multiple types in one declaration");
7005 if (t
== NULL_TREE
&& ! saw_friend
)
7006 pedwarn ("declaration does not declare anything");
7008 /* Check for an anonymous union. We're careful
7009 accessing TYPE_IDENTIFIER because some built-in types, like
7010 pointer-to-member types, do not have TYPE_NAME. */
7011 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
7013 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
7015 /* Anonymous unions are objects, so they can have specifiers. */;
7016 SET_ANON_AGGR_TYPE_P (t
);
7018 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
7019 pedwarn ("ISO C++ prohibits anonymous structs");
7022 else if (ob_modifier
)
7024 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
7025 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
7026 cp_error ("`%D' can only be specified for functions", ob_modifier
);
7027 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
7028 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
7029 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
7030 cp_error ("`%D' can only be specified for constructors",
7033 cp_error ("`%D' can only be specified for objects and functions",
7040 /* Called when a declaration is seen that contains no names to declare.
7041 If its type is a reference to a structure, union or enum inherited
7042 from a containing scope, shadow that tag name for the current scope
7043 with a forward reference.
7044 If its type defines a new named structure or union
7045 or defines an enum, it is valid but we need not do anything here.
7046 Otherwise, it is an error.
7048 C++: may have to grok the declspecs to learn about static,
7049 complain for anonymous unions. */
7052 shadow_tag (declspecs
)
7055 tree t
= check_tag_decl (declspecs
);
7058 maybe_process_partial_specialization (t
);
7060 /* This is where the variables in an anonymous union are
7061 declared. An anonymous union declaration looks like:
7063 because there is no declarator after the union, the parser
7064 sends that declaration here. */
7065 if (t
&& ANON_AGGR_TYPE_P (t
))
7067 fixup_anonymous_aggr (t
);
7069 if (TYPE_FIELDS (t
))
7071 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
7073 finish_anon_union (decl
);
7078 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
7081 groktypename (typename
)
7084 if (TREE_CODE (typename
) != TREE_LIST
)
7086 return grokdeclarator (TREE_VALUE (typename
),
7087 TREE_PURPOSE (typename
),
7088 TYPENAME
, 0, NULL_TREE
);
7091 /* Decode a declarator in an ordinary declaration or data definition.
7092 This is called as soon as the type information and variable name
7093 have been parsed, before parsing the initializer if any.
7094 Here we create the ..._DECL node, fill in its type,
7095 and put it on the list of decls for the current context.
7096 The ..._DECL node is returned as the value.
7098 Exception: for arrays where the length is not specified,
7099 the type is left null, to be filled in by `cp_finish_decl'.
7101 Function definitions do not come here; they go to start_function
7102 instead. However, external and forward declarations of functions
7103 do go through here. Structure field declarations are done by
7104 grokfield and not through here. */
7107 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
7108 tree declarator
, declspecs
;
7110 tree attributes
, prefix_attributes
;
7113 register tree type
, tem
;
7115 extern int have_extern_spec
;
7116 extern int used_extern_spec
;
7120 /* See code below that used this. */
7121 int init_written
= initialized
;
7124 /* This should only be done once on the top most decl. */
7125 if (have_extern_spec
&& !used_extern_spec
)
7127 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"),
7129 used_extern_spec
= 1;
7132 if (attributes
|| prefix_attributes
)
7133 attrlist
= build_tree_list (attributes
, prefix_attributes
);
7135 attrlist
= NULL_TREE
;
7137 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
7140 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
7143 type
= TREE_TYPE (decl
);
7145 if (type
== error_mark_node
)
7148 context
= DECL_CONTEXT (decl
);
7150 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
7151 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
7153 /* When parsing the initializer, lookup should use the object's
7155 push_decl_namespace (context
);
7158 /* We are only interested in class contexts, later. */
7159 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
7160 context
= NULL_TREE
;
7163 /* Is it valid for this decl to have an initializer at all?
7164 If not, set INITIALIZED to zero, which will indirectly
7165 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7166 switch (TREE_CODE (decl
))
7169 /* typedef foo = bar means give foo the same type as bar.
7170 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
7171 Any other case of an initialization in a TYPE_DECL is an error. */
7172 if (pedantic
|| list_length (declspecs
) > 1)
7174 cp_error ("typedef `%D' is initialized", decl
);
7180 cp_error ("function `%#D' is initialized like a variable", decl
);
7190 if (! toplevel_bindings_p ()
7191 && DECL_EXTERNAL (decl
))
7192 cp_warning ("declaration of `%#D' has `extern' and is initialized",
7194 DECL_EXTERNAL (decl
) = 0;
7195 if (toplevel_bindings_p ())
7196 TREE_STATIC (decl
) = 1;
7198 /* Tell `pushdecl' this is an initialized decl
7199 even though we don't yet have the initializer expression.
7200 Also tell `cp_finish_decl' it may store the real initializer. */
7201 DECL_INITIAL (decl
) = error_mark_node
;
7204 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
7205 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
7208 /* Set attributes here so if duplicate decl, will have proper attributes. */
7209 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
7211 if (context
&& COMPLETE_TYPE_P (complete_type (context
)))
7213 push_nested_class (context
, 2);
7215 if (TREE_CODE (decl
) == VAR_DECL
)
7217 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
7218 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
7219 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
7222 if (DECL_CONTEXT (field
) != context
)
7224 cp_pedwarn ("ISO C++ does not permit `%T::%D' to be defined as `%T::%D'",
7225 DECL_CONTEXT (field
), DECL_NAME (decl
),
7226 context
, DECL_NAME (decl
));
7227 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
7229 /* Static data member are tricky; an in-class initialization
7230 still doesn't provide a definition, so the in-class
7231 declaration will have DECL_EXTERNAL set, but will have an
7232 initialization. Thus, duplicate_decls won't warn
7233 about this situation, and so we check here. */
7234 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
7235 cp_error ("duplicate initialization of %D", decl
);
7236 if (duplicate_decls (decl
, field
))
7242 tree field
= check_classfn (context
, decl
);
7243 if (field
&& duplicate_decls (decl
, field
))
7247 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
7248 DECL_IN_AGGR_P (decl
) = 0;
7249 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
7250 || CLASSTYPE_TEMPLATE_INSTANTIATION (context
))
7252 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
7253 /* [temp.expl.spec] An explicit specialization of a static data
7254 member of a template is a definition if the declaration
7255 includes an initializer; otherwise, it is a declaration.
7257 We check for processing_specialization so this only applies
7258 to the new specialization syntax. */
7259 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
7260 DECL_EXTERNAL (decl
) = 1;
7263 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
7264 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
7268 /* Enter this declaration into the symbol table. */
7269 tem
= maybe_push_decl (decl
);
7271 if (processing_template_decl
)
7272 tem
= push_template_decl (tem
);
7274 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7275 /* Tell the back-end to use or not use .common as appropriate. If we say
7276 -fconserve-space, we want this to save .data space, at the expense of
7277 wrong semantics. If we say -fno-conserve-space, we want this to
7278 produce errors about redefs; to do this we force variables into the
7280 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
7283 if (! processing_template_decl
)
7293 tree type
= TREE_TYPE (decl
);
7294 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
7296 if (type
== error_mark_node
)
7299 /* If this type of object needs a cleanup, but we're not allowed to
7300 add any more objects with cleanups to the current scope, create a
7301 new binding level. */
7302 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
7303 && current_binding_level
->more_cleanups_ok
== 0)
7305 keep_next_level (2);
7308 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/1);
7312 /* Is it valid for this decl to have an initializer at all?
7313 If not, set INITIALIZED to zero, which will indirectly
7314 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7316 /* Don't allow initializations for incomplete types except for
7317 arrays which might be completed by the initialization. */
7318 if (COMPLETE_TYPE_P (complete_type (type
)))
7319 ; /* A complete type is ok. */
7320 else if (TREE_CODE (type
) != ARRAY_TYPE
)
7322 cp_error ("variable `%#D' has initializer but incomplete type",
7325 type
= TREE_TYPE (decl
) = error_mark_node
;
7327 else if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (type
))))
7329 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
7330 cp_error ("elements of array `%#D' have incomplete type", decl
);
7331 /* else we already gave an error in start_decl. */
7337 && TREE_CODE (decl
) != TYPE_DECL
7338 && TREE_CODE (decl
) != TEMPLATE_DECL
7339 && type
!= error_mark_node
7340 && IS_AGGR_TYPE (type
)
7341 && ! DECL_EXTERNAL (decl
))
7343 if ((! processing_template_decl
|| ! uses_template_parms (type
))
7344 && !COMPLETE_TYPE_P (complete_type (type
)))
7346 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
7348 /* Change the type so that assemble_variable will give
7349 DECL an rtl we can live with: (mem (const_int 0)). */
7350 type
= TREE_TYPE (decl
) = error_mark_node
;
7354 /* If any base type in the hierarchy of TYPE needs a constructor,
7355 then we set initialized to 1. This way any nodes which are
7356 created for the purposes of initializing this aggregate
7357 will live as long as it does. This is necessary for global
7358 aggregates which do not have their initializers processed until
7359 the end of the file. */
7360 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
7365 DECL_INITIAL (decl
) = NULL_TREE
;
7368 /* Handle initialization of references.
7369 These three arguments are from `cp_finish_decl', and have the
7370 same meaning here that they do there.
7372 Quotes on semantics can be found in ARM 8.4.3. */
7375 grok_reference_init (decl
, type
, init
)
7376 tree decl
, type
, init
;
7380 if (init
== NULL_TREE
)
7382 if ((DECL_LANG_SPECIFIC (decl
) == 0
7383 || DECL_IN_AGGR_P (decl
) == 0)
7384 && ! DECL_THIS_EXTERN (decl
))
7385 cp_error ("`%D' declared as reference but not initialized", decl
);
7389 if (init
== error_mark_node
)
7392 if (TREE_CODE (init
) == CONSTRUCTOR
)
7394 cp_error ("ISO C++ forbids use of initializer list to initialize reference `%D'", decl
);
7398 if (TREE_CODE (init
) == TREE_LIST
)
7399 init
= build_compound_expr (init
);
7401 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
7402 init
= convert_from_reference (init
);
7404 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
7405 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
7407 /* Note: default conversion is only called in very special cases. */
7408 init
= default_conversion (init
);
7411 /* Convert INIT to the reference type TYPE. This may involve the
7412 creation of a temporary, whose lifetime must be the same as that
7413 of the reference. If so, a DECL_STMT for the temporary will be
7414 added just after the DECL_STMT for DECL. That's why we don't set
7415 DECL_INITIAL for local references (instead assigning to them
7416 explicitly); we need to allow the temporary to be initialized
7418 tmp
= convert_to_reference
7419 (type
, init
, CONV_IMPLICIT
,
7420 LOOKUP_ONLYCONVERTING
|LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
,
7423 if (tmp
== error_mark_node
)
7425 else if (tmp
!= NULL_TREE
)
7428 tmp
= save_expr (tmp
);
7429 if (building_stmt_tree ())
7431 /* Initialize the declaration. */
7432 tmp
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, tmp
);
7433 finish_expr_stmt (tmp
);
7436 DECL_INITIAL (decl
) = tmp
;
7440 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7444 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
7446 expand_static_init (decl
, DECL_INITIAL (decl
));
7447 DECL_INITIAL (decl
) = NULL_TREE
;
7452 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7453 mucking with forces it does not comprehend (i.e. initialization with a
7454 constructor). If we are at global scope and won't go into COMMON, fill
7455 it in with a dummy CONSTRUCTOR to force the variable into .data;
7456 otherwise we can use error_mark_node. */
7459 obscure_complex_init (decl
, init
)
7462 if (! flag_no_inline
&& TREE_STATIC (decl
))
7464 if (extract_init (decl
, init
))
7468 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7469 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7470 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7474 DECL_INITIAL (decl
) = error_mark_node
;
7479 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7480 array until we finish parsing the initializer. If that's the
7481 situation we're in, update DECL accordingly. */
7484 maybe_deduce_size_from_array_init (decl
, init
)
7488 tree type
= TREE_TYPE (decl
);
7490 if (TREE_CODE (type
) == ARRAY_TYPE
7491 && TYPE_DOMAIN (type
) == NULL_TREE
7492 && TREE_CODE (decl
) != TYPE_DECL
)
7495 = (TREE_STATIC (decl
)
7496 /* Even if pedantic, an external linkage array
7497 may have incomplete type at first. */
7498 ? pedantic
&& ! DECL_EXTERNAL (decl
)
7499 : !DECL_EXTERNAL (decl
));
7500 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7501 int failure
= complete_array_type (type
, initializer
, do_default
);
7504 cp_error ("initializer fails to determine size of `%D'", decl
);
7509 cp_error ("array size missing in `%D'", decl
);
7510 /* If a `static' var's size isn't known, make it extern as
7511 well as static, so it does not get allocated. If it's not
7512 `static', then don't mark it extern; finish_incomplete_decl
7513 will give it a default size and it will get allocated. */
7514 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7515 DECL_EXTERNAL (decl
) = 1;
7518 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7519 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7521 cp_error ("zero-size array `%D'", decl
);
7523 layout_decl (decl
, 0);
7527 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7528 any appropriate error messages regarding the layout. */
7531 layout_var_decl (decl
)
7534 tree type
= TREE_TYPE (decl
);
7536 tree ttype
= target_type (type
);
7539 /* If we haven't already layed out this declaration, do so now.
7540 Note that we must not call complete type for an external object
7541 because it's type might involve templates that we are not
7542 supposed to isntantiate yet. (And it's perfectly legal to say
7543 `extern X x' for some incomplete type `X'.) */
7544 if (!DECL_EXTERNAL (decl
))
7545 complete_type (type
);
7546 if (!DECL_SIZE (decl
) && COMPLETE_TYPE_P (type
))
7547 layout_decl (decl
, 0);
7549 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7551 /* An automatic variable with an incomplete type: that is an error.
7552 Don't talk about array types here, since we took care of that
7553 message in grokdeclarator. */
7554 cp_error ("storage size of `%D' isn't known", decl
);
7555 TREE_TYPE (decl
) = error_mark_node
;
7558 /* Keep this code around in case we later want to control debug info
7559 based on whether a type is "used". (jason 1999-11-11) */
7561 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7562 /* Let debugger know it should output info for this type. */
7563 note_debug_info_needed (ttype
);
7565 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7566 note_debug_info_needed (DECL_CONTEXT (decl
));
7569 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7570 && DECL_SIZE (decl
) != NULL_TREE
7571 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7573 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7574 constant_expression_warning (DECL_SIZE (decl
));
7576 cp_error ("storage size of `%D' isn't constant", decl
);
7580 /* If a local static variable is declared in an inline function, or if
7581 we have a weak definition, we must endeavor to create only one
7582 instance of the variable at link-time. */
7585 maybe_commonize_var (decl
)
7588 /* Static data in a function with comdat linkage also has comdat
7590 if (TREE_STATIC (decl
)
7591 /* Don't mess with __FUNCTION__. */
7592 && ! DECL_ARTIFICIAL (decl
)
7593 && current_function_decl
7594 && DECL_CONTEXT (decl
) == current_function_decl
7595 && (DECL_THIS_INLINE (current_function_decl
)
7596 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7597 && TREE_PUBLIC (current_function_decl
))
7599 /* Rather than try to get this right with inlining, we suppress
7600 inlining of such functions. */
7601 current_function_cannot_inline
7602 = "function with static variable cannot be inline";
7604 /* If flag_weak, we don't need to mess with this, as we can just
7605 make the function weak, and let it refer to its unique local
7606 copy. This works because we don't allow the function to be
7610 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7612 TREE_PUBLIC (decl
) = 1;
7613 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7615 else if (DECL_INITIAL (decl
) == NULL_TREE
7616 || DECL_INITIAL (decl
) == error_mark_node
)
7618 TREE_PUBLIC (decl
) = 1;
7619 DECL_COMMON (decl
) = 1;
7621 /* else we lose. We can only do this if we can use common,
7622 which we can't if it has been initialized. */
7624 if (TREE_PUBLIC (decl
))
7625 DECL_ASSEMBLER_NAME (decl
)
7626 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7629 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7630 cp_warning_at (" you can work around this by removing the initializer", decl
);
7634 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7635 /* Set it up again; we might have set DECL_INITIAL since the last
7637 comdat_linkage (decl
);
7640 /* Issue an error message if DECL is an uninitialized const variable. */
7643 check_for_uninitialized_const_var (decl
)
7646 tree type
= TREE_TYPE (decl
);
7648 /* ``Unless explicitly declared extern, a const object does not have
7649 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7651 if (TREE_CODE (decl
) == VAR_DECL
7652 && TREE_CODE (type
) != REFERENCE_TYPE
7653 && CP_TYPE_CONST_P (type
)
7654 && !TYPE_NEEDS_CONSTRUCTING (type
)
7655 && !DECL_INITIAL (decl
))
7656 cp_error ("uninitialized const `%D'", decl
);
7659 /* Verify INIT (the initializer for DECL), and record the
7660 initialization in DECL_INITIAL, if appropriate. Returns a new
7664 check_initializer (decl
, init
)
7670 if (TREE_CODE (decl
) == FIELD_DECL
)
7673 type
= TREE_TYPE (decl
);
7675 /* If `start_decl' didn't like having an initialization, ignore it now. */
7676 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7679 /* Check the initializer. */
7682 /* Things that are going to be initialized need to have complete
7684 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7686 if (type
== error_mark_node
)
7687 /* We will have already complained. */
7689 else if (COMPLETE_TYPE_P (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7691 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7694 else if (TREE_CODE (type
) == ARRAY_TYPE
7695 && !COMPLETE_TYPE_P (TREE_TYPE (type
)))
7697 cp_error ("elements of array `%#D' have incomplete type", decl
);
7700 else if (!COMPLETE_TYPE_P (type
))
7702 cp_error ("`%D' has incomplete type", decl
);
7703 TREE_TYPE (decl
) = error_mark_node
;
7708 if (TREE_CODE (decl
) == CONST_DECL
)
7710 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7712 DECL_INITIAL (decl
) = init
;
7714 /* This will keep us from needing to worry about our obstacks. */
7715 my_friendly_assert (init
!= NULL_TREE
, 149);
7718 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7720 if (TREE_STATIC (decl
))
7721 make_decl_rtl (decl
, NULL_PTR
, toplevel_bindings_p ());
7722 grok_reference_init (decl
, type
, init
);
7727 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7729 if (TREE_CODE (type
) == ARRAY_TYPE
)
7730 init
= digest_init (type
, init
, (tree
*) 0);
7731 else if (TREE_CODE (init
) == CONSTRUCTOR
7732 && TREE_HAS_CONSTRUCTOR (init
))
7734 if (TYPE_NON_AGGREGATE_CLASS (type
))
7736 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7738 init
= error_mark_node
;
7741 goto dont_use_constructor
;
7746 dont_use_constructor
:
7747 if (TREE_CODE (init
) != TREE_VEC
)
7748 init
= store_init_value (decl
, init
);
7752 /* We must hide the initializer so that expand_decl
7753 won't try to do something it does not understand. */
7754 init
= obscure_complex_init (decl
, init
);
7756 else if (DECL_EXTERNAL (decl
))
7758 else if (TYPE_P (type
)
7759 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7761 tree core_type
= strip_array_types (type
);
7763 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7765 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7766 cp_error ("structure `%D' with uninitialized const members", decl
);
7767 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7768 cp_error ("structure `%D' with uninitialized reference members",
7772 check_for_uninitialized_const_var (decl
);
7774 if (COMPLETE_TYPE_P (type
) && TYPE_NEEDS_CONSTRUCTING (type
))
7775 init
= obscure_complex_init (decl
, NULL_TREE
);
7779 check_for_uninitialized_const_var (decl
);
7784 /* If DECL is not a local variable, give it RTL. */
7787 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
7790 const char *asmspec
;
7792 int toplev
= toplevel_bindings_p ();
7795 /* Handle non-variables up front. */
7796 if (TREE_CODE (decl
) != VAR_DECL
)
7798 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7802 /* If we see a class member here, it should be a static data
7804 if (DECL_LANG_SPECIFIC (decl
) && DECL_IN_AGGR_P (decl
))
7806 my_friendly_assert (TREE_STATIC (decl
), 19990828);
7807 /* An in-class declaration of a static data member should be
7808 external; it is only a declaration, and not a definition. */
7809 if (init
== NULL_TREE
)
7810 my_friendly_assert (DECL_EXTERNAL (decl
), 20000723);
7813 /* Set the DECL_ASSEMBLER_NAME for the variable. */
7815 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7817 /* We don't create any RTL for local variables. */
7818 if (DECL_FUNCTION_SCOPE_P (decl
) && !TREE_STATIC (decl
))
7821 /* We defer emission of local statics until the corresponding
7822 DECL_STMT is expanded. */
7823 defer_p
= DECL_FUNCTION_SCOPE_P (decl
) || DECL_VIRTUAL_P (decl
);
7825 /* We try to defer namespace-scope static constants so that they are
7826 not emitted into the object file unncessarily. */
7827 if (!DECL_VIRTUAL_P (decl
)
7828 && TREE_READONLY (decl
)
7829 && DECL_INITIAL (decl
) != NULL_TREE
7830 && DECL_INITIAL (decl
) != error_mark_node
7831 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
))
7833 && !TREE_PUBLIC (decl
))
7835 /* Fool with the linkage according to #pragma interface. */
7836 if (!interface_unknown
)
7838 TREE_PUBLIC (decl
) = 1;
7839 DECL_EXTERNAL (decl
) = interface_only
;
7845 /* If we're deferring the variable, just make RTL. Do not actually
7846 emit the variable. */
7848 make_decl_rtl (decl
, asmspec
, toplev
);
7849 /* If we're not deferring, go ahead and assemble the variable. */
7851 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7854 /* The old ARM scoping rules injected variables declared in the
7855 initialization statement of a for-statement into the surrounding
7856 scope. We support this usage, in order to be backward-compatible.
7857 DECL is a just-declared VAR_DECL; if necessary inject its
7858 declaration into the surrounding scope. */
7861 maybe_inject_for_scope_var (decl
)
7864 if (!DECL_NAME (decl
))
7867 if (current_binding_level
->is_for_scope
)
7869 struct binding_level
*outer
7870 = current_binding_level
->level_chain
;
7872 /* Check to see if the same name is already bound at the outer
7873 level, either because it was directly declared, or because a
7874 dead for-decl got preserved. In either case, the code would
7875 not have been valid under the ARM scope rules, so clear
7876 is_for_scope for the current_binding_level.
7878 Otherwise, we need to preserve the temp slot for decl to last
7879 into the outer binding level. */
7882 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7884 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7885 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7887 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7889 BINDING_VALUE (outer_binding
)
7890 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7891 current_binding_level
->is_for_scope
= 0;
7893 else if (DECL_IN_MEMORY_P (decl
))
7894 preserve_temp_slots (DECL_RTL (decl
));
7898 /* Generate code to initialize DECL (a local variable). */
7901 initialize_local_var (decl
, init
, flags
)
7906 tree type
= TREE_TYPE (decl
);
7908 /* If the type is bogus, don't bother initializing the variable. */
7909 if (type
== error_mark_node
)
7912 if (DECL_SIZE (decl
) == NULL_TREE
&& !TREE_STATIC (decl
))
7914 /* If we used it already as memory, it must stay in memory. */
7915 DECL_INITIAL (decl
) = NULL_TREE
;
7916 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7919 /* Local statics are handled differently from ordinary automatic
7921 if (TREE_STATIC (decl
))
7923 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7924 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7925 expand_static_init (decl
, init
);
7929 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7933 /* Compute and store the initial value. */
7934 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7936 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7938 int saved_stmts_are_full_exprs_p
;
7940 emit_line_note (DECL_SOURCE_FILE (decl
),
7941 DECL_SOURCE_LINE (decl
));
7942 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p ();
7943 current_stmt_tree
->stmts_are_full_exprs_p
= 1;
7944 if (building_stmt_tree ())
7945 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7947 genrtl_expr_stmt (build_aggr_init (decl
, init
, flags
));
7948 current_stmt_tree
->stmts_are_full_exprs_p
= saved_stmts_are_full_exprs_p
;
7951 /* Set this to 0 so we can tell whether an aggregate which was
7952 initialized was ever used. Don't do this if it has a
7953 destructor, so we don't complain about the 'resource
7954 allocation is initialization' idiom. Now set
7955 attribute((unused)) on types so decls of that type will be
7956 marked used. (see TREE_USED, above.) */
7957 if (TYPE_NEEDS_CONSTRUCTING (type
)
7959 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type
)
7960 && DECL_NAME (decl
))
7961 TREE_USED (decl
) = 0;
7962 else if (already_used
)
7963 TREE_USED (decl
) = 1;
7967 /* Generate code to destroy DECL (a local variable). */
7970 destroy_local_var (decl
)
7973 tree type
= TREE_TYPE (decl
);
7976 /* Only variables get cleaned up. */
7977 if (TREE_CODE (decl
) != VAR_DECL
)
7980 /* And only things with destructors need cleaning up. */
7981 if (type
== error_mark_node
7982 || TYPE_HAS_TRIVIAL_DESTRUCTOR (type
))
7985 if (TREE_CODE (decl
) == VAR_DECL
&&
7986 (DECL_EXTERNAL (decl
) || TREE_STATIC (decl
)))
7987 /* We don't clean up things that aren't defined in this
7988 translation unit, or that need a static cleanup. The latter
7989 are handled by finish_file. */
7992 /* Compute the cleanup. */
7993 cleanup
= maybe_build_cleanup (decl
);
7995 /* Record the cleanup required for this declaration. */
7996 if (DECL_SIZE (decl
) && TREE_TYPE (decl
) != error_mark_node
7998 finish_decl_cleanup (decl
, cleanup
);
8001 /* Finish processing of a declaration;
8002 install its line number and initial value.
8003 If the length of an array type is not known before,
8004 it must be determined now, from the initial value, or it is an error.
8006 INIT holds the value of an initializer that should be allowed to escape
8009 FLAGS is LOOKUP_ONLYCONVERTING if the = init syntax was used, else 0
8010 if the (init) syntax was used. */
8013 cp_finish_decl (decl
, init
, asmspec_tree
, flags
)
8019 tree ttype
= NULL_TREE
;
8020 const char *asmspec
= NULL
;
8021 int was_readonly
= 0;
8026 error ("assignment (not initialization) in declaration");
8030 /* If a name was specified, get the string. */
8032 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
8034 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
8036 cp_error ("cannot initialize `%D' to namespace `%D'",
8041 if (current_class_type
8042 && CP_DECL_CONTEXT (decl
) == current_class_type
8043 && TYPE_BEING_DEFINED (current_class_type
)
8044 && (DECL_INITIAL (decl
) || init
))
8045 DECL_DEFINED_IN_CLASS_P (decl
) = 1;
8047 if (TREE_CODE (decl
) == VAR_DECL
8048 && DECL_CONTEXT (decl
)
8049 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
8050 && DECL_CONTEXT (decl
) != current_namespace
8053 /* Leave the namespace of the object. */
8054 pop_decl_namespace ();
8057 type
= TREE_TYPE (decl
);
8059 if (type
== error_mark_node
)
8062 /* Add this declaration to the statement-tree. */
8063 if (building_stmt_tree () && at_function_scope_p ())
8064 add_decl_stmt (decl
);
8066 if (TYPE_HAS_MUTABLE_P (type
))
8067 TREE_READONLY (decl
) = 0;
8069 if (processing_template_decl
)
8071 if (init
&& DECL_INITIAL (decl
))
8072 DECL_INITIAL (decl
) = init
;
8076 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
8077 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
8079 /* Take care of TYPE_DECLs up front. */
8080 if (TREE_CODE (decl
) == TYPE_DECL
)
8082 if (init
&& DECL_INITIAL (decl
))
8084 /* typedef foo = bar; store the type of bar as the type of foo. */
8085 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
8086 DECL_INITIAL (decl
) = init
= NULL_TREE
;
8088 if (type
!= error_mark_node
8089 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
8091 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
8092 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
8093 set_identifier_type_value (DECL_NAME (decl
), type
);
8094 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
8096 GNU_xref_decl (current_function_decl
, decl
);
8098 /* If we have installed this as the canonical typedef for this
8099 type, and that type has not been defined yet, delay emitting
8100 the debug information for it, as we will emit it later. */
8101 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
8102 && !COMPLETE_TYPE_P (TREE_TYPE (decl
)))
8103 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
8105 rest_of_decl_compilation (decl
, NULL_PTR
,
8106 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
8110 if (TREE_CODE (decl
) != FUNCTION_DECL
)
8111 ttype
= target_type (type
);
8113 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
8114 && TYPE_NEEDS_CONSTRUCTING (type
))
8116 /* Currently, GNU C++ puts constants in text space, making them
8117 impossible to initialize. In the future, one would hope for
8118 an operating system which understood the difference between
8119 initialization and the running of a program. */
8121 TREE_READONLY (decl
) = 0;
8124 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
8126 /* This must override the asm specifier which was placed by
8127 grokclassfn. Lay this out fresh. */
8128 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
8129 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
8130 make_decl_rtl (decl
, asmspec
, 0);
8133 /* Deduce size of array from initialization, if not already known. */
8134 maybe_deduce_size_from_array_init (decl
, init
);
8135 init
= check_initializer (decl
, init
);
8137 GNU_xref_decl (current_function_decl
, decl
);
8139 if (TREE_CODE (decl
) == VAR_DECL
)
8140 layout_var_decl (decl
);
8142 /* Output the assembler code and/or RTL code for variables and functions,
8143 unless the type is an undefined structure or union.
8144 If not, it will get done when the type is completed. */
8145 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
8146 || TREE_CODE (decl
) == RESULT_DECL
)
8148 if (TREE_CODE (decl
) == VAR_DECL
)
8149 maybe_commonize_var (decl
);
8151 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
8153 if (TREE_CODE (type
) == FUNCTION_TYPE
8154 || TREE_CODE (type
) == METHOD_TYPE
)
8155 abstract_virtuals_error (decl
,
8156 strip_array_types (TREE_TYPE (type
)));
8158 abstract_virtuals_error (decl
, strip_array_types (type
));
8160 if (TREE_CODE (decl
) == FUNCTION_DECL
)
8162 else if (DECL_EXTERNAL (decl
)
8163 && ! (DECL_LANG_SPECIFIC (decl
)
8164 && DECL_NOT_REALLY_EXTERN (decl
)))
8167 DECL_INITIAL (decl
) = init
;
8169 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
8171 /* This is a local declaration. */
8172 if (doing_semantic_analysis_p ())
8173 maybe_inject_for_scope_var (decl
);
8174 /* Initialize the local variable. But, if we're building a
8175 statement-tree, we'll do the initialization when we
8177 if (processing_template_decl
)
8179 if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
8180 DECL_INITIAL (decl
) = init
;
8184 /* If we're not building RTL, then we need to do so
8186 if (!building_stmt_tree ())
8187 emit_local_var (decl
);
8188 /* Initialize the variable. */
8189 initialize_local_var (decl
, init
, flags
);
8190 /* Clean up the variable. */
8191 destroy_local_var (decl
);
8194 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
8196 /* Cleanups for static variables are handled by `finish_file'. */
8197 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
8198 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
8199 expand_static_init (decl
, init
);
8203 /* Undo call to `pushclass' that was done in `start_decl'
8204 due to initialization of qualified member variable.
8205 I.e., Foo::x = 10; */
8207 tree context
= CP_DECL_CONTEXT (decl
);
8210 && (TREE_CODE (decl
) == VAR_DECL
8211 /* We also have a pushclass done that we need to undo here
8212 if we're at top level and declare a method. */
8213 || TREE_CODE (decl
) == FUNCTION_DECL
)
8214 /* If size hasn't been set, we're still defining it,
8215 and therefore inside the class body; don't pop
8216 the binding level.. */
8217 && COMPLETE_TYPE_P (context
)
8218 && context
== current_class_type
)
8219 pop_nested_class ();
8226 TREE_READONLY (decl
) = 1;
8229 /* This is here for a midend callback from c-common.c */
8232 finish_decl (decl
, init
, asmspec_tree
)
8236 cp_finish_decl (decl
, init
, asmspec_tree
, 0);
8239 /* Returns a declaration for a VAR_DECL as if:
8241 extern "C" TYPE NAME;
8243 had been seen. Used to create compiler-generated global
8247 declare_global_var (name
, type
)
8253 push_to_top_level ();
8254 decl
= build_decl (VAR_DECL
, name
, type
);
8255 TREE_PUBLIC (decl
) = 1;
8256 DECL_EXTERNAL (decl
) = 1;
8257 DECL_ARTIFICIAL (decl
) = 1;
8259 cp_finish_decl (decl
, NULL_TREE
, NULL_TREE
, 0);
8260 pop_from_top_level ();
8265 /* Returns a pointer to the `atexit' function. Note that if
8266 FLAG_USE_CXA_ATEXIT is non-zero, then this will actually be the new
8267 `__cxa_atexit' function specified in the IA64 C++ ABI. */
8281 if (flag_use_cxa_atexit
)
8283 /* The declaration for `__cxa_atexit' is:
8285 int __cxa_atexit (void (*)(void *), void *, void *)
8287 We build up the argument types and then then function type
8290 /* First, build the pointer-to-function type for the first
8292 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8293 fn_type
= build_function_type (void_type_node
, arg_types
);
8294 fn_ptr_type
= build_pointer_type (fn_type
);
8295 /* Then, build the rest of the argument types. */
8296 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8297 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, arg_types
);
8298 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, arg_types
);
8299 /* And the final __cxa_atexit type. */
8300 fn_type
= build_function_type (integer_type_node
, arg_types
);
8301 fn_ptr_type
= build_pointer_type (fn_type
);
8302 name
= "__cxa_atexit";
8306 /* The declaration for `atexit' is:
8308 int atexit (void (*)());
8310 We build up the argument types and then then function type
8312 fn_type
= build_function_type (void_type_node
, void_list_node
);
8313 fn_ptr_type
= build_pointer_type (fn_type
);
8314 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, void_list_node
);
8315 /* Build the final atexit type. */
8316 fn_type
= build_function_type (integer_type_node
, arg_types
);
8320 /* Now, build the function declaration. */
8321 push_lang_context (lang_name_c
);
8322 atexit_fndecl
= build_library_fn_ptr (name
, fn_type
);
8323 mark_used (atexit_fndecl
);
8324 pop_lang_context ();
8325 atexit_node
= default_conversion (atexit_fndecl
);
8330 /* Returns the __dso_handle VAR_DECL. */
8333 get_dso_handle_node ()
8335 if (dso_handle_node
)
8336 return dso_handle_node
;
8338 /* Declare the variable. */
8339 dso_handle_node
= declare_global_var (get_identifier ("__dso_handle"),
8342 return dso_handle_node
;
8345 /* Begin a new function with internal linkage whose job will be simply
8346 to destroy some particular variable. */
8351 static int counter
= 0;
8352 int old_interface_unknown
= interface_unknown
;
8358 push_to_top_level ();
8360 /* No need to mangle this. */
8361 push_lang_context (lang_name_c
);
8363 interface_unknown
= 1;
8365 /* Build the parameter-types. */
8366 parmtypes
= void_list_node
;
8367 /* Functions passed to __cxa_atexit take an additional parameter.
8368 We'll just ignore it. After we implement the new calling
8369 convention for destructors, we can eliminate the use of
8370 additional cleanup functions entirely in the -fnew-abi case. */
8371 if (flag_use_cxa_atexit
)
8372 parmtypes
= tree_cons (NULL_TREE
, ptr_type_node
, parmtypes
);
8373 /* Build the function type itself. */
8374 fntype
= build_function_type (void_type_node
, parmtypes
);
8375 /* Build the name of the function. */
8376 sprintf (name
, "__tcf_%d", counter
++);
8377 /* Build the function declaration. */
8378 fndecl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), fntype
);
8379 /* It's a function with internal linkage, generated by the
8381 TREE_PUBLIC (fndecl
) = 0;
8382 DECL_ARTIFICIAL (fndecl
) = 1;
8383 /* Make the function `inline' so that it is only emitted if it is
8384 actually needed. It is unlikely that it will be inlined, since
8385 it is only called via a function pointer, but we avoid unncessary
8386 emissions this way. */
8387 DECL_INLINE (fndecl
) = 1;
8388 /* Build the parameter. */
8389 if (flag_use_cxa_atexit
)
8393 parmdecl
= build_decl (PARM_DECL
, NULL_TREE
, ptr_type_node
);
8394 DECL_CONTEXT (parmdecl
) = fndecl
;
8395 DECL_ARG_TYPE (parmdecl
) = ptr_type_node
;
8396 TREE_USED (parmdecl
) = 1;
8397 DECL_ARGUMENTS (fndecl
) = parmdecl
;
8401 start_function (/*specs=*/NULL_TREE
, fndecl
, NULL_TREE
, SF_PRE_PARSED
);
8404 interface_unknown
= old_interface_unknown
;
8406 pop_lang_context ();
8408 return current_function_decl
;
8411 /* Finish the cleanup function begun by start_cleanup_fn. */
8418 expand_body (finish_function (0));
8420 pop_from_top_level ();
8423 /* Generate code to handle the destruction of DECL, an object with
8424 static storage duration. */
8427 register_dtor_fn (decl
)
8435 int saved_flag_access_control
;
8437 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl
)))
8440 /* Call build_cleanup before we enter the anonymous function so that
8441 any access checks will be done relative to the current scope,
8442 rather than the scope of the anonymous function. */
8443 build_cleanup (decl
);
8445 /* Now start the function. */
8446 cleanup
= start_cleanup_fn ();
8448 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
8449 to the original function, rather than the anonymous one. That
8450 will make the back-end think that nested functions are in use,
8451 which causes confusion. */
8452 saved_flag_access_control
= flag_access_control
;
8453 flag_access_control
= 0;
8454 fcall
= build_cleanup (decl
);
8455 flag_access_control
= saved_flag_access_control
;
8457 /* Create the body of the anonymous function. */
8458 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
8459 finish_expr_stmt (fcall
);
8460 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
8463 /* Call atexit with the cleanup function. */
8464 mark_addressable (cleanup
);
8465 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
8466 if (flag_use_cxa_atexit
)
8468 args
= tree_cons (NULL_TREE
, get_dso_handle_node (), NULL_TREE
);
8469 args
= tree_cons (NULL_TREE
, null_pointer_node
, args
);
8470 args
= tree_cons (NULL_TREE
, cleanup
, args
);
8473 args
= tree_cons (NULL_TREE
, cleanup
, NULL_TREE
);
8474 finish_expr_stmt (build_function_call (get_atexit_node (), args
));
8478 expand_static_init (decl
, init
)
8482 tree oldstatic
= value_member (decl
, static_aggregates
);
8486 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
8487 cp_error ("multiple initializations given for `%D'", decl
);
8489 else if (! toplevel_bindings_p ())
8491 /* Emit code to perform this initialization but once. */
8498 /* Emit code to perform this initialization but once. This code
8501 static int guard = 0;
8503 // Do initialization.
8505 // Register variable for destruction at end of program.
8508 Note that the `temp' variable is only set to 1 *after* the
8509 initialization is complete. This ensures that an exception,
8510 thrown during the construction, will cause the variable to
8511 reinitialized when we pass through this code again, as per:
8515 If the initialization exits by throwing an exception, the
8516 initialization is not complete, so it will be tried again
8517 the next time control enters the declaration.
8519 In theory, this process should be thread-safe, too; multiple
8520 threads should not be able to initialize the variable more
8521 than once. We don't yet attempt to ensure thread-safety. */
8523 /* Create the guard variable. */
8524 guard
= get_guard (decl
);
8526 /* Begin the conditional initialization. */
8527 if_stmt
= begin_if_stmt ();
8528 finish_if_stmt_cond (get_guard_cond (guard
), if_stmt
);
8529 then_clause
= begin_compound_stmt (/*has_no_scope=*/0);
8531 /* Do the initialization itself. */
8532 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
8533 || (init
&& TREE_CODE (init
) == TREE_LIST
))
8534 assignment
= build_aggr_init (decl
, init
, 0);
8536 /* The initialization we're doing here is just a bitwise
8538 assignment
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
8540 assignment
= NULL_TREE
;
8542 /* Once the assignment is complete, set TEMP to 1. Since the
8543 construction of the static object is complete at this point,
8544 we want to make sure TEMP is set to 1 even if a temporary
8545 constructed during the initialization throws an exception
8546 when it is destroyed. So, we combine the initialization and
8547 the assignment to TEMP into a single expression, ensuring
8548 that when we call finish_expr_stmt the cleanups will not be
8549 run until after TEMP is set to 1. */
8550 guard_init
= set_guard (guard
);
8553 assignment
= tree_cons (NULL_TREE
, assignment
,
8554 build_tree_list (NULL_TREE
,
8556 assignment
= build_compound_expr (assignment
);
8559 assignment
= guard_init
;
8560 finish_expr_stmt (assignment
);
8562 /* Use atexit to register a function for destroying this static
8564 register_dtor_fn (decl
);
8566 finish_compound_stmt (/*has_no_scope=*/0, then_clause
);
8567 finish_then_clause (if_stmt
);
8571 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8574 /* Finish the declaration of a catch-parameter. */
8577 start_handler_parms (declspecs
, declarator
)
8584 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8586 if (decl
== NULL_TREE
)
8587 error ("invalid catch parameter");
8596 /* Make TYPE a complete type based on INITIAL_VALUE.
8597 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8598 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8601 complete_array_type (type
, initial_value
, do_default
)
8602 tree type
, initial_value
;
8605 register tree maxindex
= NULL_TREE
;
8610 /* An array of character type can be initialized from a
8611 brace-enclosed string constant. */
8612 if (char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (type
)))
8613 && TREE_CODE (initial_value
) == CONSTRUCTOR
8614 && CONSTRUCTOR_ELTS (initial_value
)
8615 && (TREE_CODE (TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
)))
8617 && TREE_CHAIN (CONSTRUCTOR_ELTS (initial_value
)) == NULL_TREE
)
8618 initial_value
= TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
));
8620 /* Note MAXINDEX is really the maximum index, one less than the
8622 if (TREE_CODE (initial_value
) == STRING_CST
)
8625 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8626 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8629 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8631 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8633 maxindex
= ssize_int (-1);
8634 for (; elts
; elts
= TREE_CHAIN (elts
))
8636 if (TREE_PURPOSE (elts
))
8637 maxindex
= TREE_PURPOSE (elts
);
8639 maxindex
= size_binop (PLUS_EXPR
, maxindex
, ssize_int (1));
8641 maxindex
= copy_node (maxindex
);
8645 /* Make an error message unless that happened already. */
8646 if (initial_value
!= error_mark_node
)
8649 initial_value
= NULL_TREE
;
8651 /* Prevent further error messages. */
8652 maxindex
= build_int_2 (0, 0);
8659 maxindex
= build_int_2 (0, 0);
8668 domain
= build_index_type (maxindex
);
8669 TYPE_DOMAIN (type
) = domain
;
8671 if (! TREE_TYPE (maxindex
))
8672 TREE_TYPE (maxindex
) = domain
;
8674 itype
= TREE_TYPE (initial_value
);
8677 if (itype
&& !TYPE_DOMAIN (itype
))
8678 TYPE_DOMAIN (itype
) = domain
;
8679 /* The type of the main variant should never be used for arrays
8680 of different sizes. It should only ever be completed with the
8681 size of the array. */
8682 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8683 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8686 /* Lay out the type now that we can get the real answer. */
8693 /* Return zero if something is declared to be a member of type
8694 CTYPE when in the context of CUR_TYPE. STRING is the error
8695 message to print in that case. Otherwise, quietly return 1. */
8698 member_function_or_else (ctype
, cur_type
, flags
)
8699 tree ctype
, cur_type
;
8700 enum overload_flags flags
;
8702 if (ctype
&& ctype
!= cur_type
)
8704 if (flags
== DTOR_FLAG
)
8705 cp_error ("destructor for alien class `%T' cannot be a member",
8708 cp_error ("constructor for alien class `%T' cannot be a member",
8715 /* Subroutine of `grokdeclarator'. */
8717 /* Generate errors possibly applicable for a given set of specifiers.
8718 This is for ARM $7.1.2. */
8721 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8724 int virtualp
, quals
, friendp
, raises
, inlinep
;
8727 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8729 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8731 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8734 cp_error_at ("`%D' declared as a friend", object
);
8736 cp_error_at ("`%D' declared with an exception specification", object
);
8739 /* CTYPE is class type, or null if non-class.
8740 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8742 DECLARATOR is the function's name.
8743 VIRTUALP is truthvalue of whether the function is virtual or not.
8744 FLAGS are to be passed through to `grokclassfn'.
8745 QUALS are qualifiers indicating whether the function is `const'
8747 RAISES is a list of exceptions that this function can raise.
8748 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8749 not look, and -1 if we should not call `grokclassfn' at all.
8751 Returns `NULL_TREE' if something goes wrong, after issuing
8752 applicable error messages. */
8755 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8756 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8757 template_count
, in_namespace
)
8760 tree orig_declarator
;
8762 enum overload_flags flags
;
8764 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8768 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8769 int has_default_arg
= 0;
8773 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8774 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8780 type
= build_exception_variant (type
, raises
);
8783 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8784 /* Propagate volatile out from type to decl. */
8785 if (TYPE_VOLATILE (type
))
8786 TREE_THIS_VOLATILE (decl
) = 1;
8788 /* If this decl has namespace scope, set that up. */
8790 set_decl_namespace (decl
, in_namespace
, friendp
);
8792 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8794 /* `main' and builtins have implicit 'C' linkage. */
8795 if ((MAIN_NAME_P (declarator
)
8796 || (IDENTIFIER_LENGTH (declarator
) > 10
8797 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8798 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8799 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8800 && current_lang_name
== lang_name_cplusplus
8801 && ctype
== NULL_TREE
8802 /* NULL_TREE means global namespace. */
8803 && DECL_CONTEXT (decl
) == NULL_TREE
)
8804 DECL_LANGUAGE (decl
) = lang_c
;
8806 /* Should probably propagate const out from type to decl I bet (mrs). */
8809 DECL_STATIC_FUNCTION_P (decl
) = 1;
8810 DECL_CONTEXT (decl
) = ctype
;
8814 DECL_CONTEXT (decl
) = ctype
;
8816 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8818 if (processing_template_decl
)
8819 error ("cannot declare `::main' to be a template");
8821 error ("cannot declare `::main' to be inline");
8823 error ("cannot declare `::main' to be static");
8824 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
8826 error ("`main' must return `int'");
8831 /* Members of anonymous types and local classes have no linkage; make
8833 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8834 || decl_function_context (TYPE_MAIN_DECL (ctype
))))
8839 /* [basic.link]: A name with no linkage (notably, the name of a class
8840 or enumeration declared in a local scope) shall not be used to
8841 declare an entity with linkage.
8843 Only check this for public decls for now. */
8844 t
= no_linkage_check (TREE_TYPE (decl
));
8847 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8849 if (DECL_EXTERN_C_P (decl
))
8850 /* Allow this; it's pretty common in C. */;
8852 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8856 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8861 TREE_PUBLIC (decl
) = publicp
;
8864 DECL_INTERFACE_KNOWN (decl
) = 1;
8865 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8869 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8871 DECL_EXTERNAL (decl
) = 1;
8872 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8874 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8875 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8879 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8880 grok_op_properties (decl
, virtualp
, check
< 0);
8882 if (ctype
&& decl_function_context (decl
))
8883 DECL_NO_STATIC_CHAIN (decl
) = 1;
8885 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8886 if (TREE_PURPOSE (t
)
8887 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8889 has_default_arg
= 1;
8894 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8898 ("defining explicit specialization `%D' in friend declaration",
8902 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8904 /* Something like `template <class T> friend void f<T>()'. */
8905 cp_error ("invalid use of template-id `%D' in declaration of primary template",
8911 /* A friend declaration of the form friend void f<>(). Record
8912 the information in the TEMPLATE_ID_EXPR. */
8913 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8914 DECL_TEMPLATE_INFO (decl
)
8915 = tree_cons (TREE_OPERAND (orig_declarator
, 0),
8916 TREE_OPERAND (orig_declarator
, 1),
8919 if (has_default_arg
)
8921 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8928 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8935 if (has_default_arg
)
8936 add_defarg_fn (decl
);
8938 /* Plain overloading: will not be grok'd by grokclassfn. */
8939 if (! ctype
&& ! processing_template_decl
8940 && !DECL_EXTERN_C_P (decl
)
8941 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8942 set_mangled_name_for_decl (decl
);
8945 /* Make the init_value nonzero so pushdecl knows this is not
8946 tentative. error_mark_node is replaced later with the BLOCK. */
8947 DECL_INITIAL (decl
) = error_mark_node
;
8949 if (TYPE_NOTHROW_P (type
) || nothrow_libfn_p (decl
))
8950 TREE_NOTHROW (decl
) = 1;
8952 /* Caller will do the rest of this. */
8956 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8957 DECL_CONSTRUCTOR_P (decl
) = 1;
8959 /* Function gets the ugly name, field gets the nice one. This call
8960 may change the type of the function (because of default
8962 if (ctype
!= NULL_TREE
)
8963 grokclassfn (ctype
, decl
, flags
, quals
);
8965 decl
= check_explicit_specialization (orig_declarator
, decl
,
8967 2 * (funcdef_flag
!= 0) +
8968 4 * (friendp
!= 0));
8969 if (decl
== error_mark_node
)
8972 if (ctype
!= NULL_TREE
8973 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8978 old_decl
= check_classfn (ctype
, decl
);
8980 if (old_decl
&& TREE_CODE (old_decl
) == TEMPLATE_DECL
)
8981 /* Because grokfndecl is always supposed to return a
8982 FUNCTION_DECL, we pull out the DECL_TEMPLATE_RESULT
8983 here. We depend on our callers to figure out that its
8984 really a template that's being returned. */
8985 old_decl
= DECL_TEMPLATE_RESULT (old_decl
);
8987 if (old_decl
&& DECL_STATIC_FUNCTION_P (old_decl
)
8988 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8990 /* Remove the `this' parm added by grokclassfn.
8991 XXX Isn't this done in start_function, too? */
8992 revert_static_member_fn (decl
);
8993 last_function_parms
= TREE_CHAIN (last_function_parms
);
8995 if (old_decl
&& DECL_ARTIFICIAL (old_decl
))
8996 cp_error ("definition of implicitly-declared `%D'", old_decl
);
9000 /* Since we've smashed OLD_DECL to its
9001 DECL_TEMPLATE_RESULT, we must do the same to DECL. */
9002 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
9003 decl
= DECL_TEMPLATE_RESULT (decl
);
9005 /* Attempt to merge the declarations. This can fail, in
9006 the case of some illegal specialization declarations. */
9007 if (!duplicate_decls (decl
, old_decl
))
9008 cp_error ("no `%#D' member function declared in class `%T'",
9014 if (DECL_CONSTRUCTOR_P (decl
) && !grok_ctor_properties (ctype
, decl
))
9017 if (ctype
== NULL_TREE
|| check
)
9022 DECL_VIRTUAL_P (decl
) = 1;
9023 if (DECL_VINDEX (decl
) == NULL_TREE
)
9024 DECL_VINDEX (decl
) = error_mark_node
;
9025 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
9032 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
9035 RID_BIT_TYPE
*specbits_in
;
9041 RID_BIT_TYPE specbits
;
9043 specbits
= *specbits_in
;
9045 if (TREE_CODE (type
) == OFFSET_TYPE
)
9047 /* If you declare a static member so that it
9048 can be initialized, the code will reach here. */
9049 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
9050 type
= TREE_TYPE (type
);
9051 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
9052 DECL_CONTEXT (decl
) = basetype
;
9053 /* DECL_ASSEMBLER_NAME is needed only for full-instantiated
9055 if (!uses_template_parms (decl
))
9058 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
9060 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
,
9069 context
= in_namespace
;
9070 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
9071 context
= current_namespace
;
9073 context
= NULL_TREE
;
9075 if (processing_template_decl
&& context
)
9076 /* For global variables, declared in a template, we need the
9078 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
9080 decl
= build_decl (VAR_DECL
, declarator
, type
);
9083 set_decl_namespace (decl
, context
, 0);
9085 context
= DECL_CONTEXT (decl
);
9086 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
9089 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
9091 DECL_ASSEMBLER_NAME (decl
)
9092 = build_static_name (context
, declarator
);
9097 set_decl_namespace (decl
, in_namespace
, 0);
9099 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
9101 DECL_THIS_EXTERN (decl
) = 1;
9102 DECL_EXTERNAL (decl
) = !initialized
;
9105 /* In class context, static means one per class,
9106 public access, and static storage. */
9107 if (DECL_CLASS_SCOPE_P (decl
))
9109 TREE_PUBLIC (decl
) = 1;
9110 TREE_STATIC (decl
) = 1;
9111 DECL_EXTERNAL (decl
) = 0;
9113 /* At top level, either `static' or no s.c. makes a definition
9114 (perhaps tentative), and absence of `static' makes it public. */
9115 else if (toplevel_bindings_p ())
9117 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
9118 && (DECL_THIS_EXTERN (decl
) || ! constp
));
9119 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
9121 /* Not at top level, only `static' makes a static definition. */
9124 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
9125 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
9128 if (TREE_PUBLIC (decl
))
9130 /* [basic.link]: A name with no linkage (notably, the name of a class
9131 or enumeration declared in a local scope) shall not be used to
9132 declare an entity with linkage.
9134 Only check this for public decls for now. */
9135 tree t
= no_linkage_check (TREE_TYPE (decl
));
9138 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
9139 /* Ignore for now; `enum { foo } e' is pretty common. */;
9141 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
9149 /* Create and return a canonical pointer to member function type, for
9150 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
9153 build_ptrmemfunc_type (type
)
9159 tree unqualified_variant
= NULL_TREE
;
9161 /* If a canonical type already exists for this type, use it. We use
9162 this method instead of type_hash_canon, because it only does a
9163 simple equality check on the list of field members. */
9165 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
9168 /* Make sure that we always have the unqualified pointer-to-member
9170 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9172 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
9174 t
= make_aggr_type (RECORD_TYPE
);
9175 /* Let the front-end know this is a pointer to member function... */
9176 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
9177 /* ... and not really an aggregate. */
9178 SET_IS_AGGR_TYPE (t
, 0);
9182 u
= make_aggr_type (UNION_TYPE
);
9183 SET_IS_AGGR_TYPE (u
, 0);
9184 fields
[0] = build_decl (FIELD_DECL
, pfn_identifier
, type
);
9185 fields
[1] = build_decl (FIELD_DECL
, delta2_identifier
,
9187 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9188 TYPE_NAME (u
) = NULL_TREE
;
9190 fields
[0] = build_decl (FIELD_DECL
, delta_identifier
,
9192 fields
[1] = build_decl (FIELD_DECL
, index_identifier
,
9194 fields
[2] = build_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
9195 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
9199 fields
[0] = build_decl (FIELD_DECL
, pfn_identifier
, type
);
9200 fields
[1] = build_decl (FIELD_DECL
, delta_identifier
,
9202 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9205 /* Zap out the name so that the back-end will give us the debugging
9206 information for this anonymous RECORD_TYPE. */
9207 TYPE_NAME (t
) = NULL_TREE
;
9209 /* If this is not the unqualified form of this pointer-to-member
9210 type, set the TYPE_MAIN_VARIANT for this type to be the
9211 unqualified type. Since they are actually RECORD_TYPEs that are
9212 not variants of each other, we must do this manually. */
9213 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9215 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
9216 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
9217 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
9218 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
9221 /* Cache this pointer-to-member type so that we can find it again
9223 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
9225 /* Seems to be wanted. */
9226 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
9231 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
9232 Check to see that the definition is valid. Issue appropriate error
9233 messages. Return 1 if the definition is particularly bad, or 0
9237 check_static_variable_definition (decl
, type
)
9241 /* Motion 10 at San Diego: If a static const integral data member is
9242 initialized with an integral constant expression, the initializer
9243 may appear either in the declaration (within the class), or in
9244 the definition, but not both. If it appears in the class, the
9245 member is a member constant. The file-scope definition is always
9247 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
9249 cp_error ("invalid in-class initialization of static data member of non-integral type `%T'",
9251 /* If we just return the declaration, crashes will sometimes
9252 occur. We therefore return void_type_node, as if this was a
9253 friend declaration, to cause callers to completely ignore
9254 this declaration. */
9257 else if (!CP_TYPE_CONST_P (type
))
9258 cp_error ("ISO C++ forbids in-class initialization of non-const static member `%D'",
9260 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
9261 cp_pedwarn ("ISO C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
9266 /* Given the SIZE (i.e., number of elements) in an array, compute an
9267 appropriate index type for the array. If non-NULL, NAME is the
9268 name of the thing being declared. */
9271 compute_array_index_type (name
, size
)
9277 /* The size might be the result of a cast. */
9278 STRIP_TYPE_NOPS (size
);
9280 /* It might be a const variable or enumeration constant. */
9281 size
= decl_constant_value (size
);
9283 /* If this involves a template parameter, it will be a constant at
9284 instantiation time, but we don't know what the value is yet.
9285 Even if no template parameters are involved, we may an expression
9286 that is not a constant; we don't even simplify `1 + 2' when
9287 processing a template. */
9288 if (processing_template_decl
)
9290 /* Resolve a qualified reference to an enumerator or static
9291 const data member of ours. */
9292 if (TREE_CODE (size
) == SCOPE_REF
9293 && TREE_OPERAND (size
, 0) == current_class_type
)
9295 tree t
= lookup_field (current_class_type
,
9296 TREE_OPERAND (size
, 1), 0, 0);
9301 return build_index_type (build_min (MINUS_EXPR
, sizetype
,
9302 size
, integer_one_node
));
9305 /* The array bound must be an integer type. */
9306 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9307 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
9308 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
9311 cp_error ("size of array `%D' has non-integer type", name
);
9313 cp_error ("size of array has non-integer type");
9314 size
= integer_one_node
;
9317 /* Normally, the array-bound will be a constant. */
9318 if (TREE_CODE (size
) == INTEGER_CST
)
9320 /* Check to see if the array bound overflowed. Make that an
9321 error, no matter how generous we're being. */
9322 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9323 int old_pedantic
= pedantic
;
9324 pedantic
= flag_pedantic_errors
= 1;
9325 constant_expression_warning (size
);
9326 pedantic
= old_pedantic
;
9327 flag_pedantic_errors
= old_flag_pedantic_errors
;
9329 /* An array must have a positive number of elements. */
9330 if (INT_CST_LT (size
, integer_zero_node
))
9333 cp_error ("size of array `%D' is negative", name
);
9335 cp_error ("size of array is negative");
9336 size
= integer_one_node
;
9338 /* Except that an extension we allow zero-sized arrays. We
9339 always allow them in system headers because glibc uses
9341 else if (integer_zerop (size
) && pedantic
&& !in_system_header
)
9344 cp_pedwarn ("ISO C++ forbids zero-size array `%D'", name
);
9346 cp_pedwarn ("ISO C++ forbids zero-size array");
9349 else if (TREE_CONSTANT (size
))
9351 /* `(int) &fn' is not a valid array bound. */
9353 cp_error ("size of array `%D' is not an integral constant-expression",
9356 cp_error ("size of array is not an integral constant-expression");
9359 /* Compute the index of the largest element in the array. It is
9360 one less than the number of elements in the array. */
9362 = fold (cp_build_binary_op (MINUS_EXPR
,
9363 cp_convert (ssizetype
, size
),
9364 cp_convert (ssizetype
,
9365 integer_one_node
)));
9367 /* Check for variable-sized arrays. We allow such things as an
9368 extension, even though they are not allowed in ANSI/ISO C++. */
9369 if (!TREE_CONSTANT (itype
))
9374 cp_pedwarn ("ISO C++ forbids variable-size array `%D'",
9377 cp_pedwarn ("ISO C++ forbids variable-size array");
9380 /* Create a variable-sized array index type. */
9381 itype
= variable_size (itype
);
9383 /* Make sure that there was no overflow when creating to a signed
9384 index type. (For example, on a 32-bit machine, an array with
9385 size 2^32 - 1 is too big.) */
9386 else if (TREE_OVERFLOW (itype
))
9388 error ("overflow in array dimension");
9389 TREE_OVERFLOW (itype
) = 0;
9392 /* Create and return the appropriate index type. */
9393 return build_index_type (itype
);
9396 /* Returns an ARRAY_TYPE for an array with SIZE elements of the
9397 indicated TYPE. If non-NULL, NAME is the NAME of the declaration
9401 create_array_type_for_decl (name
, type
, size
)
9406 tree itype
= NULL_TREE
;
9407 const char* error_msg
;
9409 /* If things have already gone awry, bail now. */
9410 if (type
== error_mark_node
|| size
== error_mark_node
)
9411 return error_mark_node
;
9413 /* Assume that everything will go OK. */
9416 /* There are some types which cannot be array elements. */
9417 switch (TREE_CODE (type
))
9420 error_msg
= "array of void";
9424 error_msg
= "array of functions";
9427 case REFERENCE_TYPE
:
9428 error_msg
= "array of references";
9432 error_msg
= "array of data members";
9436 error_msg
= "array of function members";
9443 /* If something went wrong, issue an error-message and return. */
9447 cp_error ("declaration of `%D' as %s", name
, error_msg
);
9449 cp_error ("creating %s", error_msg
);
9451 return error_mark_node
;
9456 The constant expressions that specify the bounds of the arrays
9457 can be omitted only for the first member of the sequence. */
9458 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9460 cp_error ("declaration of `%D' as multidimensional array must have bounds for all dimensions except the first",
9463 return error_mark_node
;
9466 /* Figure out the index type for the array. */
9468 itype
= compute_array_index_type (name
, size
);
9470 return build_cplus_array_type (type
, itype
);
9473 /* Check that it's OK to declare a function with the indicated TYPE.
9474 SFK indicates the kind of special function (if any) that this
9475 function is. CTYPE is the class of which this function is a
9476 member. OPTYPE is the type given in a conversion operator
9477 declaration. Returns the actual return type of the function; that
9478 may be different than TYPE if an error occurs, or for certain
9479 special functions. */
9482 check_special_function_return_type (sfk
, type
, ctype
, optype
)
9483 special_function_kind sfk
;
9490 case sfk_constructor
:
9492 cp_error ("return type specification for constructor invalid");
9494 /* In the old ABI, we return `this'; in the new ABI we don't
9496 type
= flag_new_abi
? void_type_node
: build_pointer_type (ctype
);
9499 case sfk_destructor
:
9501 cp_error ("return type specification for destructor invalid");
9502 type
= void_type_node
;
9505 case sfk_conversion
:
9506 if (type
&& !same_type_p (type
, optype
))
9507 cp_error ("operator `%T' declared to return `%T'", optype
, type
);
9509 cp_pedwarn ("return type specified for `operator %T'", optype
);
9514 my_friendly_abort (20000408);
9521 /* Given declspecs and a declarator,
9522 determine the name and type of the object declared
9523 and construct a ..._DECL node for it.
9524 (In one case we can return a ..._TYPE node instead.
9525 For invalid input we sometimes return 0.)
9527 DECLSPECS is a chain of tree_list nodes whose value fields
9528 are the storage classes and type specifiers.
9530 DECL_CONTEXT says which syntactic context this declaration is in:
9531 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
9532 FUNCDEF for a function definition. Like NORMAL but a few different
9533 error messages in each case. Return value may be zero meaning
9534 this definition is too screwy to try to parse.
9535 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
9536 handle member functions (which have FIELD context).
9537 Return value may be zero meaning this definition is too screwy to
9539 PARM for a parameter declaration (either within a function prototype
9540 or before a function body). Make a PARM_DECL, or return void_type_node.
9541 CATCHPARM for a parameter declaration before a catch clause.
9542 TYPENAME if for a typename (in a cast or sizeof).
9543 Don't make a DECL node; just return the ..._TYPE node.
9544 FIELD for a struct or union field; make a FIELD_DECL.
9545 BITFIELD for a field with specified width.
9546 INITIALIZED is 1 if the decl has an initializer.
9548 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
9549 normal attributes in TREE_PURPOSE, or NULL_TREE.
9551 In the TYPENAME case, DECLARATOR is really an abstract declarator.
9552 It may also be so in the PARM case, for a prototype where the
9553 argument type is specified but not the name.
9555 This function is where the complicated C meanings of `static'
9556 and `extern' are interpreted.
9558 For C++, if there is any monkey business to do, the function which
9559 calls this one must do it, i.e., prepending instance variables,
9560 renaming overloaded function names, etc.
9562 Note that for this C++, it is an error to define a method within a class
9563 which does not belong to that class.
9565 Except in the case where SCOPE_REFs are implicitly known (such as
9566 methods within a class being redundantly qualified),
9567 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
9568 (class_name::decl_name). The caller must also deal with this.
9570 If a constructor or destructor is seen, and the context is FIELD,
9571 then the type gains the attribute TREE_HAS_x. If such a declaration
9572 is erroneous, NULL_TREE is returned.
9574 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
9575 function, these are the qualifiers to give to the `this' pointer. We
9576 apply TYPE_QUAL_RESTRICT to the this ptr, not the object.
9578 May return void_type_node if the declarator turned out to be a friend.
9579 See grokfield for details. */
9582 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
9585 enum decl_context decl_context
;
9589 RID_BIT_TYPE specbits
;
9592 tree type
= NULL_TREE
;
9598 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
9599 int explicit_int
= 0;
9600 int explicit_char
= 0;
9601 int defaulted_int
= 0;
9602 tree typedef_decl
= NULL_TREE
;
9604 tree typedef_type
= NULL_TREE
;
9605 int funcdef_flag
= 0;
9606 enum tree_code innermost_code
= ERROR_MARK
;
9609 /* See the code below that used this. */
9610 tree decl_machine_attr
= NULL_TREE
;
9612 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
9613 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
9614 tree init
= NULL_TREE
;
9616 /* Keep track of what sort of function is being processed
9617 so that we can warn about default return values, or explicit
9618 return values which do not match prescribed defaults. */
9619 special_function_kind sfk
= sfk_none
;
9621 tree dname
= NULL_TREE
;
9622 tree ctype
= current_class_type
;
9623 tree ctor_return_type
= NULL_TREE
;
9624 enum overload_flags flags
= NO_SPECIAL
;
9625 tree quals
= NULL_TREE
;
9626 tree raises
= NULL_TREE
;
9627 int template_count
= 0;
9628 tree in_namespace
= NULL_TREE
;
9632 RIDBIT_RESET_ALL (specbits
);
9633 if (decl_context
== FUNCDEF
)
9634 funcdef_flag
= 1, decl_context
= NORMAL
;
9635 else if (decl_context
== MEMFUNCDEF
)
9636 funcdef_flag
= -1, decl_context
= FIELD
;
9637 else if (decl_context
== BITFIELD
)
9638 bitfield
= 1, decl_context
= FIELD
;
9640 /* Look inside a declarator for the name being declared
9641 and get it as a string, for an error message. */
9643 tree
*next
= &declarator
;
9647 while (next
&& *next
)
9650 switch (TREE_CODE (decl
))
9653 /* For attributes. */
9654 next
= &TREE_VALUE (decl
);
9659 next
= &TREE_OPERAND (decl
, 0);
9662 case BIT_NOT_EXPR
: /* For C++ destructors! */
9664 tree name
= TREE_OPERAND (decl
, 0);
9665 tree rename
= NULL_TREE
;
9667 my_friendly_assert (flags
== NO_SPECIAL
, 152);
9669 sfk
= sfk_destructor
;
9670 if (TREE_CODE (name
) == TYPE_DECL
)
9671 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
9672 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
9673 if (ctype
== NULL_TREE
)
9675 if (current_class_type
== NULL_TREE
)
9677 error ("destructors must be member functions");
9682 tree t
= constructor_name (current_class_name
);
9689 tree t
= constructor_name (ctype
);
9696 cp_error ("destructor `%T' must match class name `%T'",
9698 TREE_OPERAND (decl
, 0) = rename
;
9704 case ADDR_EXPR
: /* C++ reference declaration */
9709 innermost_code
= TREE_CODE (decl
);
9710 next
= &TREE_OPERAND (decl
, 0);
9714 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
9716 /* This is actually a variable declaration using
9717 constructor syntax. We need to call start_decl and
9718 cp_finish_decl so we can get the variable
9721 tree attributes
, prefix_attributes
;
9723 *next
= TREE_OPERAND (decl
, 0);
9724 init
= CALL_DECLARATOR_PARMS (decl
);
9728 attributes
= TREE_PURPOSE (attrlist
);
9729 prefix_attributes
= TREE_VALUE (attrlist
);
9733 attributes
= NULL_TREE
;
9734 prefix_attributes
= NULL_TREE
;
9737 decl
= start_decl (declarator
, declspecs
, 1,
9738 attributes
, prefix_attributes
);
9739 decl_type_access_control (decl
);
9742 /* Look for __unused__ attribute */
9743 if (TREE_USED (TREE_TYPE (decl
)))
9744 TREE_USED (decl
) = 1;
9745 finish_decl (decl
, init
, NULL_TREE
);
9748 cp_error ("invalid declarator");
9751 innermost_code
= TREE_CODE (decl
);
9752 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
9753 ctype
= current_class_type
;
9755 && TREE_OPERAND (decl
, 0)
9756 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
9757 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
9758 == constructor_name_full (ctype
))
9759 || (DECL_NAME (TREE_OPERAND (decl
, 0))
9760 == constructor_name (ctype
)))))
9761 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9762 next
= &TREE_OPERAND (decl
, 0);
9764 if (ctype
!= NULL_TREE
9765 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
9766 && decl
== constructor_name (ctype
))
9768 sfk
= sfk_constructor
;
9769 ctor_return_type
= ctype
;
9774 case TEMPLATE_ID_EXPR
:
9776 tree fns
= TREE_OPERAND (decl
, 0);
9778 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9779 fns
= TREE_OPERAND (fns
, 0);
9782 if (TREE_CODE (dname
) == COMPONENT_REF
)
9783 dname
= TREE_OPERAND (dname
, 1);
9784 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9786 my_friendly_assert (is_overloaded_fn (dname
),
9788 dname
= DECL_NAME (get_first_fn (dname
));
9793 case IDENTIFIER_NODE
:
9794 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9801 cp_error ("declarator-id missing; using reserved word `%D'",
9803 name
= IDENTIFIER_POINTER (dname
);
9805 else if (!IDENTIFIER_TYPENAME_P (dname
))
9806 name
= IDENTIFIER_POINTER (dname
);
9809 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9810 flags
= TYPENAME_FLAG
;
9811 ctor_return_type
= TREE_TYPE (dname
);
9812 sfk
= sfk_conversion
;
9813 if (IDENTIFIER_GLOBAL_VALUE (dname
)
9814 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (dname
))
9816 name
= IDENTIFIER_POINTER (dname
);
9818 name
= "<invalid operator>";
9825 /* Perform error checking, and decide on a ctype. */
9826 tree cname
= TREE_OPERAND (decl
, 0);
9827 if (cname
== NULL_TREE
)
9829 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9832 in_namespace
= TREE_OPERAND (decl
, 0);
9833 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9835 else if (! is_aggr_type (cname
, 1))
9836 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9837 /* Must test TREE_OPERAND (decl, 1), in case user gives
9838 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9839 else if (TREE_OPERAND (decl
, 1)
9840 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9842 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9843 || TREE_CODE (cname
) == TEMPLATE_TEMPLATE_PARM
)
9845 cp_error ("`%T::%D' is not a valid declarator", cname
,
9846 TREE_OPERAND (decl
, 1));
9847 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9848 cname
, TREE_OPERAND (decl
, 1));
9849 return void_type_node
;
9851 else if (ctype
== NULL_TREE
)
9853 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9854 TREE_OPERAND (decl
, 0) = ctype
;
9857 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9859 cp_error ("type `%T' is not derived from type `%T'",
9861 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9867 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9868 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9869 == constructor_name_full (ctype
))
9870 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9871 == constructor_name (ctype
))))
9872 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9873 next
= &TREE_OPERAND (decl
, 1);
9877 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9878 && constructor_name (ctype
) == decl
)
9880 sfk
= sfk_constructor
;
9881 ctor_return_type
= ctype
;
9883 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9884 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9885 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9886 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9888 sfk
= sfk_destructor
;
9889 ctor_return_type
= ctype
;
9891 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9892 next
= &TREE_OPERAND (decl
, 0);
9903 /* Parse error puts this typespec where
9904 a declarator should go. */
9905 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9906 if (TREE_TYPE (decl
) == current_class_type
)
9907 cp_error (" perhaps you want `%T' for a constructor",
9908 current_class_name
);
9909 dname
= DECL_NAME (decl
);
9910 name
= IDENTIFIER_POINTER (dname
);
9912 /* Avoid giving two errors for this. */
9913 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9915 declspecs
= tree_cons (NULL_TREE
, integer_type_node
, declspecs
);
9921 cp_compiler_error ("`%D' as declarator", decl
);
9922 return 0; /* We used to do a 155 abort here. */
9927 /* A function definition's declarator must have the form of
9928 a function declarator. */
9930 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9933 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9934 && innermost_code
!= CALL_EXPR
9935 && ! (ctype
&& declspecs
== NULL_TREE
))
9937 cp_error ("declaration of `%D' as non-function", dname
);
9938 return void_type_node
;
9941 /* Anything declared one level down from the top level
9942 must be one of the parameters of a function
9943 (because the body is at least two levels down). */
9945 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9946 by not allowing C++ class definitions to specify their parameters
9947 with xdecls (must be spec.d in the parmlist).
9949 Since we now wait to push a class scope until we are sure that
9950 we are in a legitimate method context, we must set oldcname
9951 explicitly (since current_class_name is not yet alive).
9953 We also want to avoid calling this a PARM if it is in a namespace. */
9955 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
9957 struct binding_level
*b
= current_binding_level
;
9958 current_binding_level
= b
->level_chain
;
9959 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9960 decl_context
= PARM
;
9961 current_binding_level
= b
;
9965 name
= decl_context
== PARM
? "parameter" : "type name";
9967 /* Look through the decl specs and record which ones appear.
9968 Some typespecs are defined as built-in typenames.
9969 Others, the ones that are modifiers of other types,
9970 are represented by bits in SPECBITS: set the bits for
9971 the modifiers that appear. Storage class keywords are also in SPECBITS.
9973 If there is a typedef name or a type, store the type in TYPE.
9974 This includes builtin typedefs such as `int'.
9976 Set EXPLICIT_INT if the type is `int' or `char' and did not
9977 come from a user typedef.
9979 Set LONGLONG if `long' is mentioned twice.
9981 For C++, constructors and destructors have their own fast treatment. */
9983 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
9988 /* Certain parse errors slip through. For example,
9989 `int class;' is not caught by the parser. Try
9990 weakly to recover here. */
9991 if (TREE_CODE (spec
) != TREE_LIST
)
9994 id
= TREE_VALUE (spec
);
9996 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9998 if (id
== ridpointers
[(int) RID_INT
]
9999 || id
== ridpointers
[(int) RID_CHAR
]
10000 || id
== ridpointers
[(int) RID_BOOL
]
10001 || id
== ridpointers
[(int) RID_WCHAR
])
10005 if (id
== ridpointers
[(int) RID_BOOL
])
10006 error ("`bool' is now a keyword");
10008 cp_error ("extraneous `%T' ignored", id
);
10012 if (id
== ridpointers
[(int) RID_INT
])
10014 else if (id
== ridpointers
[(int) RID_CHAR
])
10016 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
10020 /* C++ aggregate types. */
10021 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
10024 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
10026 type
= IDENTIFIER_TYPE_VALUE (id
);
10030 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
10032 if (ridpointers
[i
] == id
)
10034 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
10036 if (pedantic
&& ! in_system_header
&& warn_long_long
)
10037 pedwarn ("ISO C++ does not support `long long'");
10039 error ("`long long long' is too long for GCC");
10043 else if (RIDBIT_SETP (i
, specbits
))
10044 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
10045 RIDBIT_SET (i
, specbits
);
10050 /* C++ aggregate types. */
10051 else if (TREE_CODE (id
) == TYPE_DECL
)
10054 cp_error ("multiple declarations `%T' and `%T'", type
,
10058 type
= TREE_TYPE (id
);
10059 TREE_VALUE (spec
) = type
;
10064 error ("two or more data types in declaration of `%s'", name
);
10065 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
10067 register tree t
= lookup_name (id
, 1);
10068 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
10069 error ("`%s' fails to be a typedef or built in type",
10070 IDENTIFIER_POINTER (id
));
10073 type
= TREE_TYPE (t
);
10075 /* See the code below that used this. */
10076 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
10081 else if (id
!= error_mark_node
)
10082 /* Can't change CLASS nodes into RECORD nodes here! */
10088 typedef_type
= type
;
10090 /* No type at all: default to `int', and set DEFAULTED_INT
10091 because it was not a user-defined typedef. */
10093 if (type
== NULL_TREE
10094 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
10095 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10096 || RIDBIT_SETP (RID_LONG
, specbits
)
10097 || RIDBIT_SETP (RID_SHORT
, specbits
)))
10099 /* These imply 'int'. */
10100 type
= integer_type_node
;
10104 if (sfk
!= sfk_none
)
10105 type
= check_special_function_return_type (sfk
, type
,
10108 else if (type
== NULL_TREE
)
10114 /* We handle `main' specially here, because 'main () { }' is so
10115 common. With no options, it is allowed. With -Wreturn-type,
10116 it is a warning. It is only an error with -pedantic-errors. */
10117 is_main
= (funcdef_flag
10118 && MAIN_NAME_P (dname
)
10119 && ctype
== NULL_TREE
10120 && in_namespace
== NULL_TREE
10121 && current_namespace
== global_namespace
);
10123 if (in_system_header
|| flag_ms_extensions
)
10124 /* Allow it, sigh. */;
10125 else if (pedantic
|| ! is_main
)
10126 cp_pedwarn ("ISO C++ forbids declaration of `%s' with no type",
10128 else if (warn_return_type
)
10129 cp_warning ("ISO C++ forbids declaration of `%s' with no type",
10132 type
= integer_type_node
;
10137 /* Now process the modifiers that were specified
10138 and check for invalid combinations. */
10140 /* Long double is a special combination. */
10142 if (RIDBIT_SETP (RID_LONG
, specbits
)
10143 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
10145 RIDBIT_RESET (RID_LONG
, specbits
);
10146 type
= build_qualified_type (long_double_type_node
,
10147 CP_TYPE_QUALS (type
));
10150 /* Check all other uses of type modifiers. */
10152 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10153 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10154 || RIDBIT_SETP (RID_LONG
, specbits
)
10155 || RIDBIT_SETP (RID_SHORT
, specbits
))
10159 if (TREE_CODE (type
) == REAL_TYPE
)
10160 error ("short, signed or unsigned invalid for `%s'", name
);
10161 else if (TREE_CODE (type
) != INTEGER_TYPE
)
10162 error ("long, short, signed or unsigned invalid for `%s'", name
);
10163 else if (RIDBIT_SETP (RID_LONG
, specbits
)
10164 && RIDBIT_SETP (RID_SHORT
, specbits
))
10165 error ("long and short specified together for `%s'", name
);
10166 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10167 || RIDBIT_SETP (RID_SHORT
, specbits
))
10169 error ("long or short specified with char for `%s'", name
);
10170 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10171 || RIDBIT_SETP (RID_SHORT
, specbits
))
10172 && TREE_CODE (type
) == REAL_TYPE
)
10173 error ("long or short specified with floating type for `%s'", name
);
10174 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10175 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
10176 error ("signed and unsigned given together for `%s'", name
);
10180 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
10182 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
10184 if (flag_pedantic_errors
)
10189 /* Discard the type modifiers if they are invalid. */
10192 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
10193 RIDBIT_RESET (RID_SIGNED
, specbits
);
10194 RIDBIT_RESET (RID_LONG
, specbits
);
10195 RIDBIT_RESET (RID_SHORT
, specbits
);
10200 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
10201 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
10203 error ("complex invalid for `%s'", name
);
10204 RIDBIT_RESET (RID_COMPLEX
, specbits
);
10207 /* Decide whether an integer type is signed or not.
10208 Optionally treat bitfields as signed by default. */
10209 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10212 It is implementation-defined whether a plain (neither
10213 explicitly signed or unsigned) char, short, int, or long
10214 bit-field is signed or unsigned.
10216 Naturally, we extend this to long long as well. Note that
10217 this does not include wchar_t. */
10218 || (bitfield
&& !flag_signed_bitfields
10219 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
10220 /* A typedef for plain `int' without `signed' can be
10221 controlled just like plain `int', but a typedef for
10222 `signed int' cannot be so controlled. */
10224 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
10225 && (TREE_CODE (type
) == INTEGER_TYPE
10226 || TREE_CODE (type
) == CHAR_TYPE
)
10227 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
10230 type
= long_long_unsigned_type_node
;
10231 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10232 type
= long_unsigned_type_node
;
10233 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10234 type
= short_unsigned_type_node
;
10235 else if (type
== char_type_node
)
10236 type
= unsigned_char_type_node
;
10237 else if (typedef_decl
)
10238 type
= unsigned_type (type
);
10240 type
= unsigned_type_node
;
10242 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10243 && type
== char_type_node
)
10244 type
= signed_char_type_node
;
10246 type
= long_long_integer_type_node
;
10247 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10248 type
= long_integer_type_node
;
10249 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10250 type
= short_integer_type_node
;
10252 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
10254 /* If we just have "complex", it is equivalent to
10255 "complex double", but if any modifiers at all are specified it is
10256 the complex form of TYPE. E.g, "complex short" is
10257 "complex short int". */
10259 if (defaulted_int
&& ! longlong
10260 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
10261 || RIDBIT_SETP (RID_SHORT
, specbits
)
10262 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10263 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
10264 type
= complex_double_type_node
;
10265 else if (type
== integer_type_node
)
10266 type
= complex_integer_type_node
;
10267 else if (type
== float_type_node
)
10268 type
= complex_float_type_node
;
10269 else if (type
== double_type_node
)
10270 type
= complex_double_type_node
;
10271 else if (type
== long_double_type_node
)
10272 type
= complex_long_double_type_node
;
10274 type
= build_complex_type (type
);
10277 if (sfk
== sfk_conversion
10278 && (RIDBIT_SETP (RID_CONST
, specbits
)
10279 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
10280 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
10281 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
10284 /* Set CONSTP if this declaration is `const', whether by
10285 explicit specification or via a typedef.
10286 Likewise for VOLATILEP. */
10288 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
10290 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
10292 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
10293 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10294 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10295 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10296 type
= cp_build_qualified_type (type
, type_quals
);
10298 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
10299 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
10300 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
10301 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
10302 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
10304 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10305 staticp
= 1 + (decl_context
== FIELD
);
10307 if (virtualp
&& staticp
== 2)
10309 cp_error ("member `%D' cannot be declared both virtual and static",
10313 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
10314 RIDBIT_RESET (RID_FRIEND
, specbits
);
10316 /* Warn if two storage classes are given. Default to `auto'. */
10318 if (RIDBIT_ANY_SET (specbits
))
10320 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
10321 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
10322 if (decl_context
== PARM
&& nclasses
> 0)
10323 error ("storage class specifiers invalid in parameter declarations");
10324 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10326 if (decl_context
== PARM
)
10327 error ("typedef declaration invalid in parameter declaration");
10330 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
10331 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
10334 /* Give error if `virtual' is used outside of class declaration. */
10336 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
10338 error ("virtual outside class declaration");
10342 /* Static anonymous unions are dealt with here. */
10343 if (staticp
&& decl_context
== TYPENAME
10344 && TREE_CODE (declspecs
) == TREE_LIST
10345 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
10346 decl_context
= FIELD
;
10348 /* Warn about storage classes that are invalid for certain
10349 kinds of declarations (parameters, typenames, etc.). */
10352 error ("multiple storage classes in declaration of `%s'", name
);
10353 else if (decl_context
!= NORMAL
&& nclasses
> 0)
10355 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
10356 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
10357 || RIDBIT_SETP (RID_AUTO
, specbits
)))
10359 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10361 else if (decl_context
== FIELD
10362 /* C++ allows static class elements */
10363 && RIDBIT_SETP (RID_STATIC
, specbits
))
10364 /* C++ also allows inlines and signed and unsigned elements,
10365 but in those cases we don't come in here. */
10369 if (decl_context
== FIELD
)
10371 tree tmp
= NULL_TREE
;
10372 register int op
= 0;
10376 /* Avoid trying to get an operand off an identifier node. */
10377 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10380 tmp
= TREE_OPERAND (declarator
, 0);
10381 op
= IDENTIFIER_OPNAME_P (tmp
);
10382 if (IDENTIFIER_TYPENAME_P (tmp
))
10384 if (IDENTIFIER_GLOBAL_VALUE (tmp
)
10385 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (tmp
))
10387 name
= IDENTIFIER_POINTER (tmp
);
10389 name
= "<invalid operator>";
10392 error ("storage class specified for %s `%s'",
10393 op
? "member operator" : "field",
10398 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10399 error ("storage class specified for parameter `%s'", name
);
10401 error ("storage class specified for typename");
10403 RIDBIT_RESET (RID_REGISTER
, specbits
);
10404 RIDBIT_RESET (RID_AUTO
, specbits
);
10405 RIDBIT_RESET (RID_EXTERN
, specbits
);
10408 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
10410 if (toplevel_bindings_p ())
10412 /* It's common practice (and completely valid) to have a const
10413 be initialized and declared extern. */
10414 if (!(type_quals
& TYPE_QUAL_CONST
))
10415 warning ("`%s' initialized and declared `extern'", name
);
10418 error ("`%s' has both `extern' and initializer", name
);
10420 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
10421 && ! toplevel_bindings_p ())
10422 error ("nested function `%s' declared `extern'", name
);
10423 else if (toplevel_bindings_p ())
10425 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10426 error ("top-level declaration of `%s' specifies `auto'", name
);
10429 if (nclasses
> 0 && friendp
)
10430 error ("storage class specifiers invalid in friend function declarations");
10432 /* Now figure out the structure of the declarator proper.
10433 Descend through it, creating more complex types, until we reach
10434 the declared identifier (or NULL_TREE, in an absolute declarator). */
10436 inner_attrs
= NULL_TREE
;
10439 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
10440 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
10442 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
10443 an INDIRECT_REF (for *...),
10444 a CALL_EXPR (for ...(...)),
10445 an identifier (for the name being declared)
10446 or a null pointer (for the place in an absolute declarator
10447 where the name was omitted).
10448 For the last two cases, we have just exited the loop.
10450 For C++ it could also be
10451 a SCOPE_REF (for class :: ...). In this case, we have converted
10452 sensible names to types, and those are the values we use to
10453 qualify the member name.
10454 an ADDR_EXPR (for &...),
10455 a BIT_NOT_EXPR (for destructors)
10457 At this point, TYPE is the type of elements of an array,
10458 or for a function to return, or for a pointer to point to.
10459 After this sequence of ifs, TYPE is the type of the
10460 array or function or pointer, and DECLARATOR has had its
10461 outermost layer removed. */
10463 if (type
== error_mark_node
)
10465 if (TREE_CODE (declarator
) == SCOPE_REF
)
10466 declarator
= TREE_OPERAND (declarator
, 1);
10468 declarator
= TREE_OPERAND (declarator
, 0);
10471 if (quals
!= NULL_TREE
10472 && (declarator
== NULL_TREE
10473 || TREE_CODE (declarator
) != SCOPE_REF
))
10475 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
10476 ctype
= TYPE_METHOD_BASETYPE (type
);
10477 if (ctype
!= NULL_TREE
)
10479 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
10480 grok_method_quals (ctype
, dummy
, quals
);
10481 type
= TREE_TYPE (dummy
);
10482 ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
)));
10487 /* See the comment for the TREE_LIST case, below. */
10490 else if (inner_attrs
)
10492 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10493 inner_attrs
= NULL_TREE
;
10496 switch (TREE_CODE (declarator
))
10500 /* We encode a declarator with embedded attributes using
10501 a TREE_LIST. The attributes apply to the declarator
10502 directly inside them, so we have to skip an iteration
10503 before applying them to the type. If the declarator just
10504 inside is the declarator-id, we apply the attrs to the
10506 inner_attrs
= TREE_PURPOSE (declarator
);
10508 declarator
= TREE_VALUE (declarator
);
10514 register tree size
;
10516 size
= TREE_OPERAND (declarator
, 1);
10518 /* VC++ spells a zero-sized array with []. */
10519 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
10520 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10521 size
= integer_zero_node
;
10523 declarator
= TREE_OPERAND (declarator
, 0);
10525 type
= create_array_type_for_decl (dname
, type
, size
);
10527 /* VLAs never work as fields. */
10528 if (decl_context
== FIELD
&& !processing_template_decl
10529 && TREE_CODE (type
) == ARRAY_TYPE
10530 && TYPE_DOMAIN (type
) != NULL_TREE
10531 && !TREE_CONSTANT (TYPE_MAX_VALUE (TYPE_DOMAIN (type
))))
10533 cp_error ("size of member `%D' is not constant", dname
);
10534 /* Proceed with arbitrary constant size, so that offset
10535 computations don't get confused. */
10536 type
= create_array_type_for_decl (dname
, TREE_TYPE (type
),
10548 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
10549 tree inner_decl
= TREE_OPERAND (declarator
, 0);
10551 /* Declaring a function type.
10552 Make sure we have a valid type for the function to return. */
10554 /* We now know that the TYPE_QUALS don't apply to the
10555 decl, but to its return type. */
10556 type_quals
= TYPE_UNQUALIFIED
;
10558 /* Warn about some types functions can't return. */
10560 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10562 error ("`%s' declared as function returning a function", name
);
10563 type
= integer_type_node
;
10565 if (TREE_CODE (type
) == ARRAY_TYPE
)
10567 error ("`%s' declared as function returning an array", name
);
10568 type
= integer_type_node
;
10571 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
10572 inner_decl
= TREE_OPERAND (inner_decl
, 1);
10574 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
10575 inner_decl
= dname
;
10577 /* Pick up type qualifiers which should be applied to `this'. */
10578 quals
= CALL_DECLARATOR_QUALS (declarator
);
10580 /* Pick up the exception specifications. */
10581 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
10583 /* Say it's a definition only for the CALL_EXPR
10584 closest to the identifier. */
10587 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
10588 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
10589 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
10591 if (ctype
== NULL_TREE
10592 && decl_context
== FIELD
10594 && (friendp
== 0 || dname
== current_class_name
))
10595 ctype
= current_class_type
;
10597 if (ctype
&& sfk
== sfk_conversion
)
10598 TYPE_HAS_CONVERSION (ctype
) = 1;
10599 if (ctype
&& constructor_name (ctype
) == dname
)
10601 /* We are within a class's scope. If our declarator name
10602 is the same as the class name, and we are defining
10603 a function, then it is a constructor/destructor, and
10604 therefore returns a void type. */
10606 if (flags
== DTOR_FLAG
)
10608 /* ISO C++ 12.4/2. A destructor may not be
10609 declared const or volatile. A destructor may
10612 error ("destructor cannot be static member function");
10615 cp_error ("destructors may not be `%s'",
10616 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10619 if (decl_context
== FIELD
)
10621 if (! member_function_or_else (ctype
,
10622 current_class_type
,
10624 return void_type_node
;
10627 else /* It's a constructor. */
10629 if (explicitp
== 1)
10631 /* ISO C++ 12.1. A constructor may not be
10632 declared const or volatile. A constructor may
10633 not be virtual. A constructor may not be
10636 error ("constructor cannot be static member function");
10639 pedwarn ("constructors cannot be declared virtual");
10644 cp_error ("constructors may not be `%s'",
10645 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10649 RID_BIT_TYPE tmp_bits
;
10650 bcopy ((void*)&specbits
, (void*)&tmp_bits
, sizeof (RID_BIT_TYPE
));
10651 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10652 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10653 if (RIDBIT_ANY_SET (tmp_bits
))
10654 error ("return value type specifier for constructor ignored");
10656 if (decl_context
== FIELD
)
10658 if (! member_function_or_else (ctype
,
10659 current_class_type
,
10661 return void_type_node
;
10662 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10663 if (sfk
!= sfk_constructor
)
10667 if (decl_context
== FIELD
)
10673 error ("can't initialize friend function `%s'", name
);
10676 /* Cannot be both friend and virtual. */
10677 error ("virtual functions cannot be friends");
10678 RIDBIT_RESET (RID_FRIEND
, specbits
);
10681 if (decl_context
== NORMAL
)
10682 error ("friend declaration not in class definition");
10683 if (current_function_decl
&& funcdef_flag
)
10684 cp_error ("can't define friend function `%s' in a local class definition",
10688 /* Construct the function type and go to the next
10689 inner layer of declarator. */
10691 declarator
= TREE_OPERAND (declarator
, 0);
10693 /* FIXME: This is where default args should be fully
10696 arg_types
= grokparms (inner_parms
, funcdecl_p
? funcdef_flag
: 0);
10698 if (declarator
&& flags
== DTOR_FLAG
)
10700 /* A destructor declared in the body of a class will
10701 be represented as a BIT_NOT_EXPR. But, we just
10702 want the underlying IDENTIFIER. */
10703 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10704 declarator
= TREE_OPERAND (declarator
, 0);
10706 if (arg_types
!= void_list_node
)
10708 cp_error ("destructors may not have parameters");
10709 arg_types
= void_list_node
;
10710 last_function_parms
= NULL_TREE
;
10714 /* ANSI says that `const int foo ();'
10715 does not make the function foo const. */
10716 type
= build_function_type (type
, arg_types
);
10720 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10721 if (TREE_PURPOSE (t
)
10722 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10724 add_defarg_fn (type
);
10733 /* Filter out pointers-to-references and references-to-references.
10734 We can get these if a TYPE_DECL is used. */
10736 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10738 error ("cannot declare %s to references",
10739 TREE_CODE (declarator
) == ADDR_EXPR
10740 ? "references" : "pointers");
10741 declarator
= TREE_OPERAND (declarator
, 0);
10745 if (TREE_CODE (type
) == OFFSET_TYPE
10746 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10747 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10749 cp_error ("cannot declare pointer to `%#T' member",
10751 type
= TREE_TYPE (type
);
10754 /* Merge any constancy or volatility into the target type
10755 for the pointer. */
10757 /* We now know that the TYPE_QUALS don't apply to the decl,
10758 but to the target of the pointer. */
10759 type_quals
= TYPE_UNQUALIFIED
;
10761 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10763 if (TREE_CODE (type
) == VOID_TYPE
)
10764 error ("invalid type: `void &'");
10766 type
= build_reference_type (type
);
10768 else if (TREE_CODE (type
) == METHOD_TYPE
)
10769 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10771 type
= build_pointer_type (type
);
10773 /* Process a list of type modifier keywords (such as
10774 const or volatile) that were given inside the `*' or `&'. */
10776 if (TREE_TYPE (declarator
))
10778 register tree typemodlist
;
10784 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10785 typemodlist
= TREE_CHAIN (typemodlist
))
10787 tree qualifier
= TREE_VALUE (typemodlist
);
10789 if (qualifier
== ridpointers
[(int) RID_CONST
])
10791 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10793 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10798 error ("invalid type modifier within pointer declarator");
10802 pedwarn ("duplicate `const'");
10804 pedwarn ("duplicate `volatile'");
10806 pedwarn ("duplicate `restrict'");
10808 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10809 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10810 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10811 if (TREE_CODE (declarator
) == ADDR_EXPR
10812 && (constp
|| volatilep
))
10815 pedwarn ("discarding `const' applied to a reference");
10817 pedwarn ("discarding `volatile' applied to a reference");
10818 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10820 type
= cp_build_qualified_type (type
, type_quals
);
10822 declarator
= TREE_OPERAND (declarator
, 0);
10828 /* We have converted type names to NULL_TREE if the
10829 name was bogus, or to a _TYPE node, if not.
10831 The variable CTYPE holds the type we will ultimately
10832 resolve to. The code here just needs to build
10833 up appropriate member types. */
10834 tree sname
= TREE_OPERAND (declarator
, 1);
10837 /* Destructors can have their visibilities changed as well. */
10838 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10839 sname
= TREE_OPERAND (sname
, 0);
10841 if (TREE_COMPLEXITY (declarator
) == 0)
10842 /* This needs to be here, in case we are called
10843 multiple times. */ ;
10844 else if (TREE_COMPLEXITY (declarator
) == -1)
10845 /* Namespace member. */
10846 pop_decl_namespace ();
10847 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10848 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10849 else if (! IS_AGGR_TYPE_CODE
10850 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10852 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10854 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10855 that refer to ctype. They couldn't be resolved earlier
10856 because we hadn't pushed into the class yet.
10857 Example: resolve 'B<T>::type' in
10858 'B<typename B<T>::type> B<T>::f () { }'. */
10859 if (current_template_parms
10860 && uses_template_parms (type
)
10861 && uses_template_parms (current_class_type
))
10863 tree args
= current_template_args ();
10864 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10867 /* This pop_nested_class corresponds to the
10868 push_nested_class used to push into class scope for
10869 parsing the argument list of a function decl, in
10871 pop_nested_class ();
10872 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10875 my_friendly_abort (16);
10877 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10879 /* We had a reference to a global decl, or
10880 perhaps we were given a non-aggregate typedef,
10881 in which case we cleared this out, and should just
10882 keep going as though it wasn't there. */
10883 declarator
= sname
;
10886 ctype
= TREE_OPERAND (declarator
, 0);
10889 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10891 /* You're supposed to have one `template <...>'
10892 for every template class, but you don't need one
10893 for a full specialization. For example:
10895 template <class T> struct S{};
10896 template <> struct S<int> { void f(); };
10897 void S<int>::f () {}
10899 is correct; there shouldn't be a `template <>' for
10900 the definition of `S<int>::f'. */
10901 if (CLASSTYPE_TEMPLATE_INFO (t
)
10902 && (CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
10903 || uses_template_parms (CLASSTYPE_TI_ARGS (t
))))
10904 template_count
+= 1;
10906 t
= TYPE_MAIN_DECL (t
);
10907 if (DECL_LANG_SPECIFIC (t
))
10908 t
= DECL_CONTEXT (t
);
10913 if (sname
== NULL_TREE
)
10916 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10918 /* This is the `standard' use of the scoping operator:
10919 basetype :: member . */
10921 if (ctype
== current_class_type
)
10927 Is this ill-formed? */
10930 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10933 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10935 if (current_class_type
== NULL_TREE
10937 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10938 TYPE_ARG_TYPES (type
));
10941 cp_error ("cannot declare member function `%T::%s' within `%T'",
10942 ctype
, name
, current_class_type
);
10943 return void_type_node
;
10946 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10947 || COMPLETE_TYPE_P (complete_type (ctype
)))
10949 /* Have to move this code elsewhere in this function.
10950 this code is used for i.e., typedef int A::M; M *pm;
10952 It is? How? jason 10/2/94 */
10954 if (current_class_type
)
10956 cp_error ("cannot declare member `%T::%s' within `%T'",
10957 ctype
, name
, current_class_type
);
10958 return void_type_node
;
10960 type
= build_offset_type (ctype
, type
);
10962 else if (uses_template_parms (ctype
))
10964 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10966 = build_cplus_method_type (ctype
, TREE_TYPE (type
),
10967 TYPE_ARG_TYPES (type
));
10971 cp_error ("structure `%T' not yet defined", ctype
);
10972 return error_mark_node
;
10975 declarator
= sname
;
10977 else if (TREE_CODE (sname
) == SCOPE_REF
)
10978 my_friendly_abort (17);
10982 declarator
= TREE_OPERAND (declarator
, 1);
10983 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10984 /* In this case, we will deal with it later. */
10988 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10989 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10990 TYPE_ARG_TYPES (type
));
10992 type
= build_offset_type (ctype
, type
);
10999 declarator
= TREE_OPERAND (declarator
, 0);
11004 case ENUMERAL_TYPE
:
11005 declarator
= NULL_TREE
;
11009 declarator
= NULL_TREE
;
11013 my_friendly_abort (158);
11017 /* See the comment for the TREE_LIST case, above. */
11020 if (! ignore_attrs
)
11021 decl_attributes (type
, inner_attrs
, NULL_TREE
);
11023 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
11025 attrlist
= build_decl_list (NULL_TREE
, inner_attrs
);
11028 /* Now TYPE has the actual type. */
11030 if (explicitp
== 1 || (explicitp
&& friendp
))
11032 /* [dcl.fct.spec] The explicit specifier shall only be used in
11033 declarations of constructors within a class definition. */
11034 error ("only declarations of constructors can be `explicit'");
11038 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11040 if (current_class_name
== NULL_TREE
|| decl_context
== PARM
|| friendp
)
11042 error ("non-member `%s' cannot be declared `mutable'", name
);
11043 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11045 else if (decl_context
== TYPENAME
|| RIDBIT_SETP (RID_TYPEDEF
, specbits
))
11047 error ("non-object member `%s' cannot be declared `mutable'", name
);
11048 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11050 else if (TREE_CODE (type
) == FUNCTION_TYPE
11051 || TREE_CODE (type
) == METHOD_TYPE
)
11053 error ("function `%s' cannot be declared `mutable'", name
);
11054 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11058 error ("static `%s' cannot be declared `mutable'", name
);
11059 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11061 else if (type_quals
& TYPE_QUAL_CONST
)
11063 error ("const `%s' cannot be declared `mutable'", name
);
11064 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11068 if (declarator
== NULL_TREE
11069 || TREE_CODE (declarator
) == IDENTIFIER_NODE
11070 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
11071 && (TREE_CODE (type
) == FUNCTION_TYPE
11072 || TREE_CODE (type
) == METHOD_TYPE
)))
11074 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11076 cp_error ("template-id `%D' used as a declarator", declarator
);
11077 declarator
= dname
;
11080 /* Unexpected declarator format. */
11081 my_friendly_abort (990210);
11083 /* If this is declaring a typedef name, return a TYPE_DECL. */
11085 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
11089 /* Note that the grammar rejects storage classes
11090 in typenames, fields or parameters. */
11091 if (current_lang_name
== lang_name_java
)
11092 TYPE_FOR_JAVA (type
) = 1;
11094 if (decl_context
== FIELD
)
11096 if (declarator
== constructor_name (current_class_type
))
11097 cp_pedwarn ("ISO C++ forbids nested type `%D' with same name as enclosing class",
11099 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
11102 decl
= build_decl (TYPE_DECL
, declarator
, type
);
11104 /* If the user declares "typedef struct {...} foo" then the
11105 struct will have an anonymous name. Fill that name in now.
11106 Nothing can refer to it, so nothing needs know about the name
11108 if (type
!= error_mark_node
11110 && TYPE_NAME (type
)
11111 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
11112 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
11113 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
11115 tree oldname
= TYPE_NAME (type
);
11118 /* Replace the anonymous name with the real name everywhere. */
11119 lookup_tag_reverse (type
, declarator
);
11120 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
11121 if (TYPE_NAME (t
) == oldname
)
11122 TYPE_NAME (t
) = decl
;
11124 if (TYPE_LANG_SPECIFIC (type
))
11125 TYPE_WAS_ANONYMOUS (type
) = 1;
11127 /* If this is a typedef within a template class, the nested
11128 type is a (non-primary) template. The name for the
11129 template needs updating as well. */
11130 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
11131 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
11132 = TYPE_IDENTIFIER (type
);
11135 DECL_ASSEMBLER_NAME (decl
) = mangle_type (type
);
11138 /* XXX Temporarily set the scope.
11139 When returning, start_decl expects it as NULL_TREE,
11140 and will then then set it using pushdecl. */
11141 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
11142 if (current_class_type
)
11143 DECL_CONTEXT (decl
) = current_class_type
;
11145 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
11147 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
11148 DECL_ASSEMBLER_NAME (decl
)
11149 = get_identifier (build_overload_name (type
, 1, 1));
11150 DECL_CONTEXT (decl
) = NULL_TREE
;
11153 /* FIXME remangle member functions; member functions of a
11154 type with external linkage have external linkage. */
11157 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11159 cp_error_at ("typedef name may not be class-qualified", decl
);
11164 if (ctype
== NULL_TREE
)
11166 if (TREE_CODE (type
) != METHOD_TYPE
)
11167 cp_error_at ("invalid type qualifier for non-member function type", decl
);
11169 ctype
= TYPE_METHOD_BASETYPE (type
);
11171 if (ctype
!= NULL_TREE
)
11172 grok_method_quals (ctype
, decl
, quals
);
11175 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
11176 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
11177 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
11179 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
11180 inlinep
, friendp
, raises
!= NULL_TREE
);
11183 error ("typedef declaration includes an initializer");
11188 /* Detect the case of an array type of unspecified size
11189 which came, as such, direct from a typedef name.
11190 We must copy the type, so that each identifier gets
11191 a distinct type, so that each identifier's size can be
11192 controlled separately by its own initializer. */
11194 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
11195 && TYPE_DOMAIN (type
) == NULL_TREE
)
11197 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
11200 /* If this is a type name (such as, in a cast or sizeof),
11201 compute the type and return it now. */
11203 if (decl_context
== TYPENAME
)
11205 /* Note that the grammar rejects storage classes
11206 in typenames, fields or parameters. */
11207 if (type_quals
!= TYPE_UNQUALIFIED
)
11208 type_quals
= TYPE_UNQUALIFIED
;
11210 /* Special case: "friend class foo" looks like a TYPENAME context. */
11213 if (type_quals
!= TYPE_UNQUALIFIED
)
11215 cp_error ("type qualifiers specified for friend class declaration");
11216 type_quals
= TYPE_UNQUALIFIED
;
11220 cp_error ("`inline' specified for friend class declaration");
11223 if (!current_aggr
&& TREE_CODE (type
) != TYPENAME_TYPE
)
11225 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
11226 cp_error ("template parameters cannot be friends");
11228 cp_error ("friend declaration requires `%#T'", type
);
11231 /* Only try to do this stuff if we didn't already give up. */
11232 if (type
!= integer_type_node
)
11234 /* A friendly class? */
11235 if (current_class_type
)
11236 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
11238 cp_error ("trying to make class `%T' a friend of global scope",
11240 type
= void_type_node
;
11245 if (ctype
== NULL_TREE
)
11247 if (TREE_CODE (type
) != METHOD_TYPE
)
11248 cp_error ("invalid qualifiers on non-member function type");
11250 ctype
= TYPE_METHOD_BASETYPE (type
);
11254 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
11255 grok_method_quals (ctype
, dummy
, quals
);
11256 type
= TREE_TYPE (dummy
);
11262 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
11263 && decl_context
!= CATCHPARM
11264 && TREE_CODE (type
) != UNION_TYPE
11267 cp_error ("abstract declarator `%T' used as declaration", type
);
11268 declarator
= make_anon_name ();
11271 /* `void' at top level (not within pointer)
11272 is allowed only in typedefs or type names.
11273 We don't complain about parms either, but that is because
11274 a better error message can be made later. */
11276 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
11279 error ("unnamed variable or field declared void");
11280 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
11282 if (IDENTIFIER_OPNAME_P (declarator
))
11283 my_friendly_abort (356);
11285 error ("variable or field `%s' declared void", name
);
11288 error ("variable or field declared void");
11289 type
= integer_type_node
;
11292 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
11293 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
11295 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
11297 if (ctype
|| in_namespace
)
11298 error ("cannot use `::' in parameter declaration");
11300 /* A parameter declared as an array of T is really a pointer to T.
11301 One declared as a function is really a pointer to a function.
11302 One declared as a member is really a pointer to member. */
11304 if (TREE_CODE (type
) == ARRAY_TYPE
)
11306 /* Transfer const-ness of array into that of type pointed to. */
11307 type
= build_pointer_type (TREE_TYPE (type
));
11308 type_quals
= TYPE_UNQUALIFIED
;
11310 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11311 type
= build_pointer_type (type
);
11312 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11313 type
= build_pointer_type (type
);
11314 else if (TREE_CODE (type
) == VOID_TYPE
&& declarator
)
11316 error ("declaration of `%s' as void", name
);
11322 register tree decl
;
11324 if (decl_context
== PARM
)
11326 decl
= build_decl (PARM_DECL
, declarator
, type
);
11328 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
11329 inlinep
, friendp
, raises
!= NULL_TREE
);
11331 /* Compute the type actually passed in the parmlist,
11332 for the case where there is no prototype.
11333 (For example, shorts and chars are passed as ints.)
11334 When there is a prototype, this is overridden later. */
11336 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
11338 else if (decl_context
== FIELD
)
11340 if (type
== error_mark_node
)
11342 /* Happens when declaring arrays of sizes which
11343 are error_mark_node, for example. */
11346 else if (in_namespace
&& !friendp
)
11348 /* Something like struct S { int N::j; }; */
11349 cp_error ("invalid use of `::'");
11352 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11355 tree function_context
;
11357 /* We catch the others as conflicts with the builtin
11359 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
11361 cp_error ("function `%D' cannot be declared friend",
11368 if (ctype
== NULL_TREE
)
11369 ctype
= current_class_type
;
11371 if (ctype
== NULL_TREE
)
11373 cp_error ("can't make `%D' into a method -- not in a class",
11375 return void_type_node
;
11378 /* ``A union may [ ... ] not [ have ] virtual functions.''
11380 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
11382 cp_error ("function `%D' declared virtual inside a union",
11384 return void_type_node
;
11387 if (declarator
== ansi_opname (NEW_EXPR
)
11388 || declarator
== ansi_opname (VEC_NEW_EXPR
)
11389 || declarator
== ansi_opname (DELETE_EXPR
)
11390 || declarator
== ansi_opname (VEC_DELETE_EXPR
))
11394 cp_error ("`%D' cannot be declared virtual, since it is always static",
11399 else if (staticp
< 2)
11400 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11401 TYPE_ARG_TYPES (type
));
11404 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
11405 function_context
= (ctype
!= NULL_TREE
) ?
11406 decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
11407 publicp
= (! friendp
|| ! staticp
)
11408 && function_context
== NULL_TREE
;
11409 decl
= grokfndecl (ctype
, type
,
11410 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
11411 ? declarator
: dname
,
11413 virtualp
, flags
, quals
, raises
,
11414 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
11415 funcdef_flag
, template_count
, in_namespace
);
11416 if (decl
== NULL_TREE
)
11419 /* This clobbers the attrs stored in `decl' from `attrlist'. */
11420 /* The decl and setting of decl_machine_attr is also turned off. */
11421 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
11424 /* [class.conv.ctor]
11426 A constructor declared without the function-specifier
11427 explicit that can be called with a single parameter
11428 specifies a conversion from the type of its first
11429 parameter to the type of its class. Such a constructor
11430 is called a converting constructor. */
11431 if (explicitp
== 2)
11432 DECL_NONCONVERTING_P (decl
) = 1;
11433 else if (DECL_CONSTRUCTOR_P (decl
))
11435 /* The constructor can be called with exactly one
11436 parameter if there is at least one parameter, and
11437 any subsequent parameters have default arguments.
11438 We don't look at the first parameter, which is
11439 really just the `this' parameter for the new
11442 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
11444 /* Skip the `in_chrg' argument too, if present. */
11445 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
11446 arg_types
= TREE_CHAIN (arg_types
);
11448 if (arg_types
== void_list_node
11450 && TREE_CHAIN (arg_types
)
11451 && TREE_CHAIN (arg_types
) != void_list_node
11452 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
11453 DECL_NONCONVERTING_P (decl
) = 1;
11456 else if (TREE_CODE (type
) == METHOD_TYPE
)
11458 /* We only get here for friend declarations of
11459 members of other classes. */
11460 /* All method decls are public, so tell grokfndecl to set
11461 TREE_PUBLIC, also. */
11462 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
11463 virtualp
, flags
, quals
, raises
,
11464 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
11465 template_count
, in_namespace
);
11466 if (decl
== NULL_TREE
)
11469 else if (!staticp
&& ! processing_template_decl
11470 && !COMPLETE_TYPE_P (complete_type (type
))
11471 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
11474 cp_error ("field `%D' has incomplete type", declarator
);
11476 cp_error ("name `%T' has incomplete type", type
);
11478 /* If we're instantiating a template, tell them which
11479 instantiation made the field's type be incomplete. */
11480 if (current_class_type
11481 && TYPE_NAME (current_class_type
)
11482 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
11483 && declspecs
&& TREE_VALUE (declspecs
)
11484 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
11485 cp_error (" in instantiation of template `%T'",
11486 current_class_type
);
11488 type
= error_mark_node
;
11495 error ("`%s' is neither function nor member function; cannot be declared friend",
11496 IDENTIFIER_POINTER (declarator
));
11504 /* Friends are treated specially. */
11505 if (ctype
== current_class_type
)
11506 warning ("member functions are implicitly friends of their class");
11509 tree t
= NULL_TREE
;
11510 if (decl
&& DECL_NAME (decl
))
11512 if (template_class_depth (current_class_type
) == 0)
11515 = check_explicit_specialization
11517 template_count
, 2 * (funcdef_flag
!= 0) + 4);
11518 if (decl
== error_mark_node
)
11519 return error_mark_node
;
11522 t
= do_friend (ctype
, declarator
, decl
,
11523 last_function_parms
, attrlist
, flags
, quals
,
11526 if (t
&& funcdef_flag
)
11529 return void_type_node
;
11533 /* Structure field. It may not be a function, except for C++ */
11535 if (decl
== NULL_TREE
)
11541 /* An attempt is being made to initialize a non-static
11542 member. But, from [class.mem]:
11544 4 A member-declarator can contain a
11545 constant-initializer only if it declares a static
11546 member (_class.static_) of integral or enumeration
11547 type, see _class.static.data_.
11549 This used to be relatively common practice, but
11550 the rest of the compiler does not correctly
11551 handle the initialization unless the member is
11552 static so we make it static below. */
11553 cp_pedwarn ("ISO C++ forbids initialization of member `%D'",
11555 cp_pedwarn ("making `%D' static", declarator
);
11559 if (uses_template_parms (type
))
11560 /* We'll check at instantiation time. */
11562 else if (check_static_variable_definition (declarator
,
11564 /* If we just return the declaration, crashes
11565 will sometimes occur. We therefore return
11566 void_type_node, as if this was a friend
11567 declaration, to cause callers to completely
11568 ignore this declaration. */
11569 return void_type_node
;
11572 /* 9.2p13 [class.mem] */
11573 if (declarator
== constructor_name (current_class_type
)
11574 /* The standard does not allow non-static data members
11575 here either, but we agreed at the 10/99 meeting
11576 to change that in TC 1 so that they are allowed in
11577 classes with no user-defined constructors. */
11579 cp_pedwarn ("ISO C++ forbids static data member `%D' with same name as enclosing class",
11584 /* C++ allows static class members. All other work
11585 for this is done by grokfield. */
11586 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
11587 TREE_STATIC (decl
) = 1;
11588 /* In class context, 'static' means public access. */
11589 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
11593 decl
= build_decl (FIELD_DECL
, declarator
, type
);
11594 DECL_NONADDRESSABLE_P (decl
) = bitfield
;
11595 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11597 DECL_MUTABLE_P (decl
) = 1;
11598 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11602 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
11603 inlinep
, friendp
, raises
!= NULL_TREE
);
11606 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11608 tree original_name
;
11614 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11615 original_name
= dname
;
11617 original_name
= declarator
;
11619 if (RIDBIT_SETP (RID_AUTO
, specbits
))
11620 error ("storage class `auto' invalid for function `%s'", name
);
11621 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11622 error ("storage class `register' invalid for function `%s'", name
);
11624 /* Function declaration not at top level.
11625 Storage classes other than `extern' are not allowed
11626 and `extern' makes no difference. */
11627 if (! toplevel_bindings_p ()
11628 && (RIDBIT_SETP (RID_STATIC
, specbits
)
11629 || RIDBIT_SETP (RID_INLINE
, specbits
))
11632 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11633 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
11635 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
11638 if (ctype
== NULL_TREE
)
11642 error ("virtual non-class function `%s'", name
);
11646 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
11647 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11648 TYPE_ARG_TYPES (type
));
11650 /* Record presence of `static'. */
11651 publicp
= (ctype
!= NULL_TREE
11652 || RIDBIT_SETP (RID_EXTERN
, specbits
)
11653 || !RIDBIT_SETP (RID_STATIC
, specbits
));
11655 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
11656 virtualp
, flags
, quals
, raises
,
11658 publicp
, inlinep
, funcdef_flag
,
11659 template_count
, in_namespace
);
11660 if (decl
== NULL_TREE
)
11665 int illegal_static
= 0;
11667 /* Don't allow a static member function in a class, and forbid
11668 declaring main to be static. */
11669 if (TREE_CODE (type
) == METHOD_TYPE
)
11671 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11672 illegal_static
= 1;
11674 else if (current_function_decl
)
11676 /* FIXME need arm citation */
11677 error ("cannot declare static function inside another function");
11678 illegal_static
= 1;
11681 if (illegal_static
)
11684 RIDBIT_RESET (RID_STATIC
, specbits
);
11690 /* It's a variable. */
11692 /* An uninitialized decl with `extern' is a reference. */
11693 decl
= grokvardecl (type
, declarator
, &specbits
,
11695 (type_quals
& TYPE_QUAL_CONST
) != 0,
11697 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11698 inlinep
, friendp
, raises
!= NULL_TREE
);
11702 DECL_CONTEXT (decl
) = ctype
;
11705 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11707 RIDBIT_RESET (RID_STATIC
, specbits
);
11709 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11711 cp_error ("static member `%D' declared `register'", decl
);
11712 RIDBIT_RESET (RID_REGISTER
, specbits
);
11714 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11716 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11718 RIDBIT_RESET (RID_EXTERN
, specbits
);
11723 my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE
, specbits
), 19990927);
11725 /* Record `register' declaration for warnings on &
11726 and in case doing stupid register allocation. */
11728 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11729 DECL_REGISTER (decl
) = 1;
11731 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11732 DECL_THIS_EXTERN (decl
) = 1;
11734 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11735 DECL_THIS_STATIC (decl
) = 1;
11737 /* Record constancy and volatility. There's no need to do this
11738 when processing a template; we'll do this for the instantiated
11739 declaration based on the type of DECL. */
11740 if (!processing_template_decl
)
11741 c_apply_type_quals_to_decl (type_quals
, decl
);
11747 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11748 An empty exprlist is a parmlist. An exprlist which
11749 contains only identifiers at the global level
11750 is a parmlist. Otherwise, it is an exprlist. */
11753 parmlist_is_exprlist (exprs
)
11756 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11759 if (toplevel_bindings_p ())
11761 /* At the global level, if these are all identifiers,
11762 then it is a parmlist. */
11765 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11767 exprs
= TREE_CHAIN (exprs
);
11774 /* Subroutine of start_function. Ensure that each of the parameter
11775 types (as listed in PARMS) is complete, as is required for a
11776 function definition. */
11779 require_complete_types_for_parms (parms
)
11782 for (; parms
; parms
= TREE_CHAIN (parms
))
11784 tree type
= TREE_TYPE (parms
);
11786 /* Try to complete the TYPE. */
11787 type
= complete_type (type
);
11789 if (type
== error_mark_node
)
11792 if (!COMPLETE_TYPE_P (type
))
11794 if (DECL_NAME (parms
))
11795 error ("parameter `%s' has incomplete type",
11796 IDENTIFIER_POINTER (DECL_NAME (parms
)));
11798 error ("parameter has incomplete type");
11799 TREE_TYPE (parms
) = error_mark_node
;
11802 layout_decl (parms
, 0);
11806 /* Returns non-zero if T is a local variable. */
11809 local_variable_p (t
)
11812 if ((TREE_CODE (t
) == VAR_DECL
11813 /* A VAR_DECL with a context that is a _TYPE is a static data
11815 && !TYPE_P (CP_DECL_CONTEXT (t
))
11816 /* Any other non-local variable must be at namespace scope. */
11817 && !DECL_NAMESPACE_SCOPE_P (t
))
11818 || (TREE_CODE (t
) == PARM_DECL
))
11824 /* Returns non-zero if T is an automatic local variable or a label.
11825 (These are the declarations that need to be remapped when the code
11826 containing them is duplicated.) */
11829 nonstatic_local_decl_p (t
)
11832 return ((local_variable_p (t
) && !TREE_STATIC (t
))
11833 || TREE_CODE (t
) == LABEL_DECL
11834 || TREE_CODE (t
) == RESULT_DECL
);
11837 /* Like local_variable_p, but suitable for use as a tree-walking
11841 local_variable_p_walkfn (tp
, walk_subtrees
, data
)
11843 int *walk_subtrees ATTRIBUTE_UNUSED
;
11844 void *data ATTRIBUTE_UNUSED
;
11846 return ((local_variable_p (*tp
) && !DECL_ARTIFICIAL (*tp
))
11847 ? *tp
: NULL_TREE
);
11850 /* Check that ARG, which is a default-argument expression for a
11851 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11852 something goes wrong. DECL may also be a _TYPE node, rather than a
11853 DECL, if there is no DECL available. */
11856 check_default_argument (decl
, arg
)
11863 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11864 /* We get a DEFAULT_ARG when looking at an in-class declaration
11865 with a default argument. Ignore the argument for now; we'll
11866 deal with it after the class is complete. */
11869 if (processing_template_decl
|| uses_template_parms (arg
))
11870 /* We don't do anything checking until instantiation-time. Note
11871 that there may be uninstantiated arguments even for an
11872 instantiated function, since default arguments are not
11873 instantiated until they are needed. */
11882 decl_type
= TREE_TYPE (decl
);
11884 if (arg
== error_mark_node
11885 || decl
== error_mark_node
11886 || TREE_TYPE (arg
) == error_mark_node
11887 || decl_type
== error_mark_node
)
11888 /* Something already went wrong. There's no need to check
11890 return error_mark_node
;
11892 /* [dcl.fct.default]
11894 A default argument expression is implicitly converted to the
11896 if (!TREE_TYPE (arg
)
11897 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11900 cp_error ("default argument for `%#D' has type `%T'",
11901 decl
, TREE_TYPE (arg
));
11903 cp_error ("default argument for parameter of type `%T' has type `%T'",
11904 decl_type
, TREE_TYPE (arg
));
11906 return error_mark_node
;
11909 /* [dcl.fct.default]
11911 Local variables shall not be used in default argument
11914 The keyword `this' shall not be used in a default argument of a
11915 member function. */
11916 var
= walk_tree (&arg
, local_variable_p_walkfn
, NULL
);
11919 cp_error ("default argument `%E' uses local variable `%D'",
11921 return error_mark_node
;
11928 /* Decode the list of parameter types for a function type.
11929 Given the list of things declared inside the parens,
11930 return a list of types.
11932 The list we receive can have three kinds of elements:
11933 an IDENTIFIER_NODE for names given without types,
11934 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11935 or void_type_node, to mark the end of an argument list
11936 when additional arguments are not permitted (... was not used).
11938 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11939 a mere declaration. A nonempty identifier-list gets an error message
11940 when FUNCDEF_FLAG is zero.
11941 If FUNCDEF_FLAG is 1, then parameter types must be complete.
11942 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11944 If all elements of the input list contain types,
11945 we return a list of the types.
11946 If all elements contain no type (except perhaps a void_type_node
11947 at the end), we return a null list.
11948 If some have types and some do not, it is an error, and we
11949 return a null list.
11951 Also set last_function_parms to either
11952 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11953 A list of names is converted to a chain of PARM_DECLs
11954 by store_parm_decls so that ultimately it is always a chain of decls.
11956 Note that in C++, parameters can take default values. These default
11957 values are in the TREE_PURPOSE field of the TREE_LIST. It is
11958 an error to specify default values which are followed by parameters
11959 that have no default values, or an ELLIPSES. For simplicities sake,
11960 only parameters which are specified with their types can take on
11964 grokparms (first_parm
, funcdef_flag
)
11968 tree result
= NULL_TREE
;
11969 tree decls
= NULL_TREE
;
11971 if (first_parm
!= NULL_TREE
11972 && TREE_CODE (TREE_VALUE (first_parm
)) == IDENTIFIER_NODE
)
11974 if (! funcdef_flag
)
11975 pedwarn ("parameter names (without types) in function declaration");
11976 last_function_parms
= first_parm
;
11979 else if (first_parm
!= NULL_TREE
11980 && TREE_CODE (TREE_VALUE (first_parm
)) != TREE_LIST
11981 && TREE_CODE (TREE_VALUE (first_parm
)) != VOID_TYPE
)
11982 my_friendly_abort (145);
11985 /* Types were specified. This is a list of declarators
11986 each represented as a TREE_LIST node. */
11987 register tree parm
, chain
;
11988 int any_init
= 0, any_error
= 0;
11990 if (first_parm
!= NULL_TREE
)
11992 tree last_result
= NULL_TREE
;
11993 tree last_decl
= NULL_TREE
;
11995 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11997 tree type
= NULL_TREE
, list_node
= parm
;
11998 register tree decl
= TREE_VALUE (parm
);
11999 tree init
= TREE_PURPOSE (parm
);
12001 chain
= TREE_CHAIN (parm
);
12002 /* @@ weak defense against parse errors. */
12003 if (TREE_CODE (decl
) != VOID_TYPE
12004 && TREE_CODE (decl
) != TREE_LIST
)
12006 /* Give various messages as the need arises. */
12007 if (TREE_CODE (decl
) == STRING_CST
)
12008 cp_error ("invalid string constant `%E'", decl
);
12009 else if (TREE_CODE (decl
) == INTEGER_CST
)
12010 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
12014 if (TREE_CODE (decl
) != VOID_TYPE
)
12016 decl
= grokdeclarator (TREE_VALUE (decl
),
12017 TREE_PURPOSE (decl
),
12018 PARM
, init
!= NULL_TREE
,
12020 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
12023 /* Top-level qualifiers on the parameters are
12024 ignored for function types. */
12025 type
= TYPE_MAIN_VARIANT (TREE_TYPE (decl
));
12027 if (TREE_CODE (type
) == VOID_TYPE
)
12028 decl
= void_type_node
;
12029 else if (TREE_CODE (type
) == METHOD_TYPE
)
12031 if (DECL_NAME (decl
))
12032 /* Cannot use the decl here because
12033 we don't have DECL_CONTEXT set up yet. */
12034 cp_error ("parameter `%D' invalidly declared method type",
12037 error ("parameter invalidly declared method type");
12038 type
= build_pointer_type (type
);
12039 TREE_TYPE (decl
) = type
;
12041 else if (TREE_CODE (type
) == OFFSET_TYPE
)
12043 if (DECL_NAME (decl
))
12044 cp_error ("parameter `%D' invalidly declared offset type",
12047 error ("parameter invalidly declared offset type");
12048 type
= build_pointer_type (type
);
12049 TREE_TYPE (decl
) = type
;
12051 else if (abstract_virtuals_error (decl
, type
))
12052 any_error
= 1; /* Seems like a good idea. */
12053 else if (POINTER_TYPE_P (type
))
12056 while (POINTER_TYPE_P (t
)
12057 || (TREE_CODE (t
) == ARRAY_TYPE
12058 && TYPE_DOMAIN (t
) != NULL_TREE
))
12060 if (TREE_CODE (t
) == ARRAY_TYPE
)
12061 cp_error ("parameter type `%T' includes %s to array of unknown bound",
12063 TYPE_PTR_P (type
) ? "pointer" : "reference");
12067 if (TREE_CODE (decl
) == VOID_TYPE
)
12069 if (result
== NULL_TREE
)
12071 result
= void_list_node
;
12072 last_result
= result
;
12076 TREE_CHAIN (last_result
) = void_list_node
;
12077 last_result
= void_list_node
;
12080 && (chain
!= void_list_node
|| TREE_CHAIN (chain
)))
12081 error ("`void' in parameter list must be entire list");
12085 /* Since there is a prototype, args are passed in their own types. */
12086 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
12087 if (PROMOTE_PROTOTYPES
12088 && (TREE_CODE (type
) == INTEGER_TYPE
12089 || TREE_CODE (type
) == ENUMERAL_TYPE
)
12090 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
12091 DECL_ARG_TYPE (decl
) = integer_type_node
;
12092 if (!any_error
&& init
)
12095 init
= check_default_argument (decl
, init
);
12100 if (decls
== NULL_TREE
)
12107 TREE_CHAIN (last_decl
) = decl
;
12110 list_node
= tree_cons (init
, type
, NULL_TREE
);
12111 if (result
== NULL_TREE
)
12113 result
= list_node
;
12114 last_result
= result
;
12118 TREE_CHAIN (last_result
) = list_node
;
12119 last_result
= list_node
;
12123 TREE_CHAIN (last_result
) = NULL_TREE
;
12124 /* If there are no parameters, and the function does not end
12125 with `...', then last_decl will be NULL_TREE. */
12126 if (last_decl
!= NULL_TREE
)
12127 TREE_CHAIN (last_decl
) = NULL_TREE
;
12131 last_function_parms
= decls
;
12136 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
12137 FUNCTION_TYPE with the newly parsed version of its default argument, which
12138 was previously digested as text. See snarf_defarg et al in lex.c. */
12141 replace_defarg (arg
, init
)
12144 if (! processing_template_decl
12145 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
12146 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
12147 TREE_TYPE (init
), TREE_VALUE (arg
));
12148 TREE_PURPOSE (arg
) = init
;
12151 /* D is a constructor or overloaded `operator='. Returns non-zero if
12152 D's arguments allow it to be a copy constructor, or copy assignment
12161 if (!DECL_FUNCTION_MEMBER_P (d
))
12164 t
= FUNCTION_ARG_CHAIN (d
);
12165 if (DECL_CONSTRUCTOR_P (d
) && DECL_HAS_IN_CHARGE_PARM_P (d
))
12166 t
= TREE_CHAIN (t
);
12167 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
12168 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
12169 == DECL_CONTEXT (d
))
12170 && (TREE_CHAIN (t
) == NULL_TREE
12171 || TREE_CHAIN (t
) == void_list_node
12172 || TREE_PURPOSE (TREE_CHAIN (t
))))
12177 /* These memoizing functions keep track of special properties which
12178 a class may have. `grok_ctor_properties' notices whether a class
12179 has a constructor of the form X(X&), and also complains
12180 if the class has a constructor of the form X(X).
12181 `grok_op_properties' takes notice of the various forms of
12182 operator= which are defined, as well as what sorts of type conversion
12183 may apply. Both functions take a FUNCTION_DECL as an argument. */
12186 grok_ctor_properties (ctype
, decl
)
12189 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
12190 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
12192 /* When a type has virtual baseclasses, a magical first int argument is
12193 added to any ctor so we can tell if the class has been initialized
12194 yet. This could screw things up in this function, so we deliberately
12195 ignore the leading int if we're in that situation. */
12196 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
12198 my_friendly_assert (parmtypes
12199 && TREE_VALUE (parmtypes
) == integer_type_node
,
12201 parmtypes
= TREE_CHAIN (parmtypes
);
12202 parmtype
= TREE_VALUE (parmtypes
);
12207 A non-template constructor for class X is a copy constructor if
12208 its first parameter is of type X&, const X&, volatile X& or const
12209 volatile X&, and either there are no other parameters or else all
12210 other parameters have default arguments. */
12211 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
12212 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
12213 && (TREE_CHAIN (parmtypes
) == NULL_TREE
12214 || TREE_CHAIN (parmtypes
) == void_list_node
12215 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
12216 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12217 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12219 TYPE_HAS_INIT_REF (ctype
) = 1;
12220 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12221 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
12225 A declaration of a constructor for a class X is ill-formed if its
12226 first parameter is of type (optionally cv-qualified) X and either
12227 there are no other parameters or else all other parameters have
12230 We *don't* complain about member template instantiations that
12231 have this form, though; they can occur as we try to decide what
12232 constructor to use during overload resolution. Since overload
12233 resolution will never prefer such a constructor to the
12234 non-template copy constructor (which is either explicitly or
12235 implicitly defined), there's no need to worry about their
12236 existence. Theoretically, they should never even be
12237 instantiated, but that's hard to forestall. */
12238 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
12239 && (TREE_CHAIN (parmtypes
) == NULL_TREE
12240 || TREE_CHAIN (parmtypes
) == void_list_node
12241 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
12242 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12243 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12245 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
12247 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
12250 else if (TREE_CODE (parmtype
) == VOID_TYPE
12251 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
12252 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
12257 /* An operator with this code is unary, but can also be binary. */
12261 enum tree_code code
;
12263 return (code
== INDIRECT_REF
12264 || code
== ADDR_EXPR
12265 || code
== CONVERT_EXPR
12266 || code
== NEGATE_EXPR
12267 || code
== PREINCREMENT_EXPR
12268 || code
== PREDECREMENT_EXPR
);
12271 /* An operator with this name can only be unary. */
12275 enum tree_code code
;
12277 return (code
== TRUTH_NOT_EXPR
12278 || code
== BIT_NOT_EXPR
12279 || code
== COMPONENT_REF
12280 || code
== TYPE_EXPR
);
12283 /* Do a little sanity-checking on how they declared their operator. */
12286 grok_op_properties (decl
, virtualp
, friendp
)
12288 int virtualp
, friendp
;
12290 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
12292 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
12293 tree name
= DECL_NAME (decl
);
12294 enum tree_code operator_code
;
12297 /* Count the number of arguments. */
12298 for (argtype
= argtypes
, arity
= 0;
12299 argtype
&& argtype
!= void_list_node
;
12300 argtype
= TREE_CHAIN (argtype
))
12303 if (current_class_type
== NULL_TREE
)
12306 if (DECL_CONV_FN_P (decl
))
12307 operator_code
= TYPE_EXPR
;
12311 #define DEF_OPERATOR(NAME, CODE, NEW_MANGLING, OLD_MANGING, ARITY, ASSN_P) \
12312 if (ansi_opname (CODE) == name) \
12314 operator_code = CODE; \
12317 else if (ansi_assopname (CODE) == name) \
12319 operator_code = CODE; \
12320 DECL_ASSIGNMENT_OPERATOR_P (decl) = 1; \
12324 #include "operators.def"
12325 #undef DEF_OPERATOR
12327 my_friendly_abort (20000527);
12330 my_friendly_assert (operator_code
!= LAST_CPLUS_TREE_CODE
, 20000526);
12331 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12335 switch (operator_code
)
12338 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
12342 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
12345 case COMPONENT_REF
:
12347 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
12351 TYPE_HAS_NEW_OPERATOR (current_class_type
) = 1;
12355 TYPE_GETS_DELETE (current_class_type
) |= 1;
12359 TYPE_HAS_ARRAY_NEW_OPERATOR (current_class_type
) = 1;
12362 case VEC_DELETE_EXPR
:
12363 TYPE_GETS_DELETE (current_class_type
) |= 2;
12371 if (operator_code
== NEW_EXPR
|| operator_code
== VEC_NEW_EXPR
)
12373 /* When the compiler encounters the definition of A::operator new, it
12374 doesn't look at the class declaration to find out if it's static. */
12376 revert_static_member_fn (decl
);
12378 /* Take care of function decl if we had syntax errors. */
12379 if (argtypes
== NULL_TREE
)
12381 = build_function_type (ptr_type_node
,
12382 hash_tree_chain (integer_type_node
,
12385 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
12387 else if (operator_code
== DELETE_EXPR
|| operator_code
== VEC_DELETE_EXPR
)
12390 revert_static_member_fn (decl
);
12392 if (argtypes
== NULL_TREE
)
12394 = build_function_type (void_type_node
,
12395 hash_tree_chain (ptr_type_node
,
12398 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
12402 /* An operator function must either be a non-static member function
12403 or have at least one parameter of a class, a reference to a class,
12404 an enumeration, or a reference to an enumeration. 13.4.0.6 */
12405 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
12407 if (operator_code
== TYPE_EXPR
12408 || operator_code
== CALL_EXPR
12409 || operator_code
== COMPONENT_REF
12410 || operator_code
== ARRAY_REF
12411 || operator_code
== NOP_EXPR
)
12412 cp_error ("`%D' must be a nonstatic member function", decl
);
12417 if (DECL_STATIC_FUNCTION_P (decl
))
12418 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
12421 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
12423 tree arg
= TREE_VALUE (p
);
12424 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
12425 arg
= TREE_TYPE (arg
);
12427 /* This lets bad template code slip through. */
12428 if (IS_AGGR_TYPE (arg
)
12429 || TREE_CODE (arg
) == ENUMERAL_TYPE
12430 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
12431 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
12435 ("`%D' must have an argument of class or enumerated type",
12442 if (operator_code
== CALL_EXPR
)
12443 return; /* No restrictions on args. */
12445 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
12447 tree t
= TREE_TYPE (name
);
12450 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
12451 const char *what
= 0;
12454 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
12456 if (TREE_CODE (t
) == VOID_TYPE
)
12458 else if (t
== current_class_type
)
12459 what
= "the same type";
12460 /* Don't force t to be complete here. */
12461 else if (IS_AGGR_TYPE (t
)
12462 && COMPLETE_TYPE_P (t
)
12463 && DERIVED_FROM_P (t
, current_class_type
))
12464 what
= "a base class";
12467 warning ("conversion to %s%s will never use a type conversion operator",
12468 ref
? "a reference to " : "", what
);
12472 if (DECL_ASSIGNMENT_OPERATOR_P (decl
)
12473 && operator_code
== NOP_EXPR
)
12477 if (arity
!= 2 && methodp
)
12479 cp_error ("`%D' must take exactly one argument", decl
);
12482 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
12486 A user-declared copy assignment operator X::operator= is
12487 a non-static non-template member function of class X with
12488 exactly one parameter of type X, X&, const X&, volatile
12489 X& or const volatile X&. */
12490 if (copy_assignment_arg_p (parmtype
, virtualp
)
12491 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12492 && is_member_template (DECL_TI_TEMPLATE (decl
)))
12495 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
12496 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
12497 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12498 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
12501 else if (operator_code
== COND_EXPR
)
12504 cp_error ("ISO C++ prohibits overloading operator ?:");
12506 else if (ambi_op_p (operator_code
))
12509 /* We pick the one-argument operator codes by default, so
12510 we don't have to change anything. */
12512 else if (arity
== 2)
12514 /* If we thought this was a unary operator, we now know
12515 it to be a binary operator. */
12516 switch (operator_code
)
12519 operator_code
= MULT_EXPR
;
12523 operator_code
= BIT_AND_EXPR
;
12527 operator_code
= PLUS_EXPR
;
12531 operator_code
= MINUS_EXPR
;
12534 case PREINCREMENT_EXPR
:
12535 operator_code
= POSTINCREMENT_EXPR
;
12538 case PREDECREMENT_EXPR
:
12539 operator_code
= POSTDECREMENT_EXPR
;
12543 my_friendly_abort (20000527);
12546 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12548 if ((operator_code
== POSTINCREMENT_EXPR
12549 || operator_code
== POSTDECREMENT_EXPR
)
12550 && ! processing_template_decl
12551 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
12554 cp_error ("postfix `%D' must take `int' as its argument",
12558 ("postfix `%D' must take `int' as its second argument",
12565 cp_error ("`%D' must take either zero or one argument", decl
);
12567 cp_error ("`%D' must take either one or two arguments", decl
);
12570 /* More Effective C++ rule 6. */
12572 && (operator_code
== POSTINCREMENT_EXPR
12573 || operator_code
== POSTDECREMENT_EXPR
12574 || operator_code
== PREINCREMENT_EXPR
12575 || operator_code
== PREDECREMENT_EXPR
))
12577 tree arg
= TREE_VALUE (argtypes
);
12578 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
12579 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
12580 arg
= TREE_TYPE (arg
);
12581 arg
= TYPE_MAIN_VARIANT (arg
);
12582 if (operator_code
== PREINCREMENT_EXPR
12583 || operator_code
== PREDECREMENT_EXPR
)
12585 if (TREE_CODE (ret
) != REFERENCE_TYPE
12586 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
12588 cp_warning ("prefix `%D' should return `%T'", decl
,
12589 build_reference_type (arg
));
12593 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
12594 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
12598 else if (unary_op_p (operator_code
))
12603 cp_error ("`%D' must take `void'", decl
);
12605 cp_error ("`%D' must take exactly one argument", decl
);
12608 else /* if (binary_op_p (operator_code)) */
12613 cp_error ("`%D' must take exactly one argument", decl
);
12615 cp_error ("`%D' must take exactly two arguments", decl
);
12618 /* More Effective C++ rule 7. */
12620 && (operator_code
== TRUTH_ANDIF_EXPR
12621 || operator_code
== TRUTH_ORIF_EXPR
12622 || operator_code
== COMPOUND_EXPR
))
12623 cp_warning ("user-defined `%D' always evaluates both arguments",
12627 /* Effective C++ rule 23. */
12630 && (operator_code
== PLUS_EXPR
12631 || operator_code
== MINUS_EXPR
12632 || operator_code
== TRUNC_DIV_EXPR
12633 || operator_code
== MULT_EXPR
)
12634 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
12635 cp_warning ("`%D' should return by value", decl
);
12638 for (; argtypes
&& argtypes
!= void_list_node
;
12639 argtypes
= TREE_CHAIN (argtypes
))
12640 if (TREE_PURPOSE (argtypes
))
12642 TREE_PURPOSE (argtypes
) = NULL_TREE
;
12643 if (operator_code
== POSTINCREMENT_EXPR
12644 || operator_code
== POSTDECREMENT_EXPR
)
12647 cp_pedwarn ("`%D' cannot have default arguments", decl
);
12650 cp_error ("`%D' cannot have default arguments", decl
);
12656 static const char *
12658 enum tag_types code
;
12671 my_friendly_abort (981122);
12675 /* Get the struct, enum or union (CODE says which) with tag NAME.
12676 Define the tag as a forward-reference if it is not defined.
12678 C++: If a class derivation is given, process it here, and report
12679 an error if multiple derivation declarations are not identical.
12681 If this is a definition, come in through xref_tag and only look in
12682 the current frame for the name (since C++ allows new names in any
12686 xref_tag (code_type_node
, name
, globalize
)
12687 tree code_type_node
;
12691 enum tag_types tag_code
;
12692 enum tree_code code
;
12693 register tree ref
, t
;
12694 struct binding_level
*b
= current_binding_level
;
12696 tree attributes
= NULL_TREE
;
12697 tree context
= NULL_TREE
;
12699 /* If we are called from the parser, code_type_node will sometimes be a
12700 TREE_LIST. This indicates that the user wrote
12701 "class __attribute__ ((foo)) bar". Extract the attributes so we can
12703 if (TREE_CODE (code_type_node
) == TREE_LIST
)
12705 attributes
= TREE_PURPOSE (code_type_node
);
12706 code_type_node
= TREE_VALUE (code_type_node
);
12709 tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12714 code
= RECORD_TYPE
;
12720 code
= ENUMERAL_TYPE
;
12723 my_friendly_abort (18);
12726 /* If a cross reference is requested, look up the type
12727 already defined for this tag and return it. */
12731 name
= TYPE_IDENTIFIER (t
);
12735 t
= IDENTIFIER_TYPE_VALUE (name
);
12737 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
12738 && TREE_CODE (t
) != TEMPLATE_TEMPLATE_PARM
)
12743 /* If we know we are defining this tag, only look it up in
12744 this scope and don't try to find it as a type. */
12745 ref
= lookup_tag (code
, name
, b
, 1);
12751 /* [dcl.type.elab] If the identifier resolves to a
12752 typedef-name or a template type-parameter, the
12753 elaborated-type-specifier is ill-formed. */
12754 if (t
!= TYPE_MAIN_VARIANT (t
)
12755 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
12756 cp_pedwarn ("using typedef-name `%D' after `%s'",
12757 TYPE_NAME (t
), tag_name (tag_code
));
12758 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12759 cp_error ("using template type parameter `%T' after `%s'",
12760 t
, tag_name (tag_code
));
12765 ref
= lookup_tag (code
, name
, b
, 0);
12769 /* Try finding it as a type declaration. If that wins,
12771 ref
= lookup_name (name
, 1);
12773 if (ref
!= NULL_TREE
12774 && processing_template_decl
12775 && DECL_CLASS_TEMPLATE_P (ref
)
12776 && template_class_depth (current_class_type
) == 0)
12777 /* Since GLOBALIZE is true, we're declaring a global
12778 template, so we want this type. */
12779 ref
= DECL_TEMPLATE_RESULT (ref
);
12781 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12782 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12783 ref
= TREE_TYPE (ref
);
12788 if (ref
&& current_class_type
12789 && template_class_depth (current_class_type
)
12790 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12792 /* Since GLOBALIZE is non-zero, we are not looking at a
12793 definition of this tag. Since, in addition, we are currently
12794 processing a (member) template declaration of a template
12795 class, we must be very careful; consider:
12802 { template <class V>
12803 friend struct S1; };
12805 Here, the S2::S1 declaration should not be confused with the
12806 outer declaration. In particular, the inner version should
12807 have a template parameter of level 2, not level 1. This
12808 would be particularly important if the member declaration
12811 template <class V = U> friend struct S1;
12813 say, when we should tsubst into `U' when instantiating
12814 S2. On the other hand, when presented with:
12824 we must find the inner binding eventually. We
12825 accomplish this by making sure that the new type we
12826 create to represent this declaration has the right
12828 context
= TYPE_CONTEXT (ref
);
12835 /* If no such tag is yet defined, create a forward-reference node
12836 and record it as the "definition".
12837 When a real declaration of this type is found,
12838 the forward-reference will be altered into a real type. */
12839 if (code
== ENUMERAL_TYPE
)
12841 cp_error ("use of enum `%#D' without previous declaration", name
);
12843 ref
= make_node (ENUMERAL_TYPE
);
12845 /* Give the type a default layout like unsigned int
12846 to avoid crashing if it does not get defined. */
12847 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12848 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12849 TYPE_USER_ALIGN (ref
) = 0;
12850 TREE_UNSIGNED (ref
) = 1;
12851 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12852 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12853 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12855 /* Enable us to recognize when a type is created in class context.
12856 To do nested classes correctly, this should probably be cleared
12857 out when we leave this classes scope. Currently this in only
12858 done in `start_enum'. */
12860 pushtag (name
, ref
, globalize
);
12864 struct binding_level
*old_b
= class_binding_level
;
12866 ref
= make_aggr_type (code
);
12867 TYPE_CONTEXT (ref
) = context
;
12869 #ifdef NONNESTED_CLASSES
12870 /* Class types don't nest the way enums do. */
12871 class_binding_level
= (struct binding_level
*)0;
12873 pushtag (name
, ref
, globalize
);
12874 class_binding_level
= old_b
;
12879 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12880 redeclare_class_template (ref
, current_template_parms
);
12883 /* Until the type is defined, tentatively accept whatever
12884 structure tag the user hands us. */
12885 if (!COMPLETE_TYPE_P (ref
)
12886 && ref
!= current_class_type
12887 /* Have to check this, in case we have contradictory tag info. */
12888 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12890 if (tag_code
== class_type
)
12891 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12892 else if (tag_code
== record_type
)
12893 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12896 TREE_TYPE (ref
) = attributes
;
12902 xref_tag_from_type (old
, id
, globalize
)
12906 tree code_type_node
;
12908 if (TREE_CODE (old
) == RECORD_TYPE
)
12909 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12910 ? class_type_node
: record_type_node
);
12912 code_type_node
= union_type_node
;
12914 if (id
== NULL_TREE
)
12915 id
= TYPE_IDENTIFIER (old
);
12917 return xref_tag (code_type_node
, id
, globalize
);
12920 /* REF is a type (named NAME), for which we have just seen some
12921 baseclasses. BINFO is a list of those baseclasses; the
12922 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12923 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12924 struct, or union. */
12927 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12928 tree code_type_node
;
12932 /* In the declaration `A : X, Y, ... Z' we mark all the types
12933 (A, X, Y, ..., Z) so we can check for duplicates. */
12938 enum tag_types tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12940 if (tag_code
== union_type
)
12942 cp_error ("derived union `%T' invalid", ref
);
12946 len
= list_length (binfo
);
12948 /* First, make sure that any templates in base-classes are
12949 instantiated. This ensures that if we call ourselves recursively
12950 we do not get confused about which classes are marked and which
12952 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12953 complete_type (TREE_VALUE (base
));
12955 SET_CLASSTYPE_MARKED (ref
);
12956 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12958 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12960 /* The base of a derived struct is public by default. */
12962 = (TREE_PURPOSE (binfo
) == access_public_node
12963 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12964 || (tag_code
!= class_type
12965 && (TREE_PURPOSE (binfo
) == access_default_node
12966 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12968 = (TREE_PURPOSE (binfo
) == access_protected_node
12969 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12971 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12972 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12973 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12974 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12975 tree basetype
= TREE_VALUE (binfo
);
12978 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12979 basetype
= TREE_TYPE (basetype
);
12981 || (TREE_CODE (basetype
) != RECORD_TYPE
12982 && TREE_CODE (basetype
) != TYPENAME_TYPE
12983 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12984 && TREE_CODE (basetype
) != TEMPLATE_TEMPLATE_PARM
))
12986 cp_error ("base type `%T' fails to be a struct or class type",
12987 TREE_VALUE (binfo
));
12991 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12993 /* This code replaces similar code in layout_basetypes.
12994 We put the complete_type first for implicit `typename'. */
12995 if (!COMPLETE_TYPE_P (basetype
)
12996 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12998 cp_error ("base class `%T' has incomplete type", basetype
);
13003 if (CLASSTYPE_MARKED (basetype
))
13005 if (basetype
== ref
)
13006 cp_error ("recursive type `%T' undefined", basetype
);
13008 cp_error ("duplicate base type `%T' invalid", basetype
);
13012 if (TYPE_FOR_JAVA (basetype
)
13013 && (current_lang_stack
13014 == &VARRAY_TREE (current_lang_base
, 0)))
13015 TYPE_FOR_JAVA (ref
) = 1;
13017 /* Note that the BINFO records which describe individual
13018 inheritances are *not* shared in the lattice! They
13019 cannot be shared because a given baseclass may be
13020 inherited with different `accessibility' by different
13021 derived classes. (Each BINFO record describing an
13022 individual inheritance contains flags which say what
13023 the `accessibility' of that particular inheritance is.) */
13026 = make_binfo (size_zero_node
, basetype
,
13027 CLASS_TYPE_P (basetype
)
13028 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
13029 CLASS_TYPE_P (basetype
)
13030 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
13032 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
13033 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
13034 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
13035 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
13036 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
13038 /* We need to unshare the binfos now so that lookups during class
13039 definition work. */
13040 unshare_base_binfos (base_binfo
);
13042 SET_CLASSTYPE_MARKED (basetype
);
13044 /* We are free to modify these bits because they are meaningless
13045 at top level, and BASETYPE is a top-level type. */
13046 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
13048 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
13049 /* Converting to a virtual base class requires looking
13050 up the offset of the virtual base. */
13051 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
13054 if (CLASS_TYPE_P (basetype
))
13056 TYPE_HAS_NEW_OPERATOR (ref
)
13057 |= TYPE_HAS_NEW_OPERATOR (basetype
);
13058 TYPE_HAS_ARRAY_NEW_OPERATOR (ref
)
13059 |= TYPE_HAS_ARRAY_NEW_OPERATOR (basetype
);
13060 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
13061 /* If the base-class uses multiple inheritance, so do we. */
13062 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
13063 |= TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
13064 /* Likewise, if converting to a base of the base may require
13065 code, then we may need to generate code to convert to a
13067 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
)
13068 |= TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (basetype
);
13075 TREE_VEC_LENGTH (binfos
) = i
;
13077 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
13081 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
13082 /* If there is more than one non-empty they cannot be at the same
13084 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
13087 /* Unmark all the types. */
13089 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
13090 CLEAR_CLASSTYPE_MARKED (ref
);
13092 /* Now that we know all the base-classes, set up the list of virtual
13094 get_vbase_types (ref
);
13098 /* Begin compiling the definition of an enumeration type.
13099 NAME is its name (or null if anonymous).
13100 Returns the type object, as yet incomplete.
13101 Also records info about it so that build_enumerator
13102 may be used to declare the individual values as they are read. */
13108 register tree enumtype
= NULL_TREE
;
13109 struct binding_level
*b
= current_binding_level
;
13111 /* If this is the real definition for a previous forward reference,
13112 fill in the contents in the same object that used to be the
13113 forward reference. */
13115 if (name
!= NULL_TREE
)
13116 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
13118 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
13120 cp_error ("multiple definition of `%#T'", enumtype
);
13121 cp_error_at ("previous definition here", enumtype
);
13122 /* Clear out TYPE_VALUES, and start again. */
13123 TYPE_VALUES (enumtype
) = NULL_TREE
;
13127 enumtype
= make_node (ENUMERAL_TYPE
);
13128 pushtag (name
, enumtype
, 0);
13131 if (current_class_type
)
13132 TREE_ADDRESSABLE (b
->tags
) = 1;
13134 GNU_xref_decl (current_function_decl
, enumtype
);
13138 /* After processing and defining all the values of an enumeration type,
13139 install their decls in the enumeration type and finish it off.
13140 ENUMTYPE is the type object and VALUES a list of name-value pairs.
13141 Returns ENUMTYPE. */
13144 finish_enum (enumtype
)
13147 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
13148 /* Calculate the maximum value of any enumerator in this type. */
13150 tree values
= TYPE_VALUES (enumtype
);
13155 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
13160 /* The TREE_VALUE is a CONST_DECL for this enumeration
13162 decl
= TREE_VALUE (pair
);
13166 Following the closing brace of an enum-specifier, each
13167 enumerator has the type of its enumeration. Prior to the
13168 closing brace, the type of each enumerator is the type of
13169 its initializing value. */
13170 TREE_TYPE (decl
) = enumtype
;
13172 /* The DECL_INITIAL will be NULL if we are processing a
13173 template declaration and this enumeration constant had no
13174 explicit initializer. */
13175 value
= DECL_INITIAL (decl
);
13176 if (value
&& !processing_template_decl
)
13178 /* Set the TREE_TYPE for the VALUE as well. That's so
13179 that when we call decl_constant_value we get an
13180 entity of the right type (but with the constant
13181 value). Since we shouldn't ever call
13182 decl_constant_value on a template type, there's no
13183 reason to do that when processing_template_decl.
13184 And, if the expression is something like a
13185 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
13186 wreak havoc on the intended type of the expression.
13188 Of course, there's also no point in trying to compute
13189 minimum or maximum values if we're in a template. */
13190 TREE_TYPE (value
) = enumtype
;
13193 minnode
= maxnode
= value
;
13194 else if (tree_int_cst_lt (maxnode
, value
))
13196 else if (tree_int_cst_lt (value
, minnode
))
13200 if (processing_template_decl
)
13201 /* If this is just a template, leave the CONST_DECL
13202 alone. That way tsubst_copy will find CONST_DECLs for
13203 CONST_DECLs, and not INTEGER_CSTs. */
13206 /* In the list we're building up, we want the enumeration
13207 values, not the CONST_DECLs. */
13208 TREE_VALUE (pair
) = value
;
13212 maxnode
= minnode
= integer_zero_node
;
13214 TYPE_VALUES (enumtype
) = nreverse (values
);
13216 if (processing_template_decl
)
13218 tree scope
= current_scope ();
13219 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
13220 add_tree (build_min (TAG_DEFN
, enumtype
));
13224 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
13225 int lowprec
= min_precision (minnode
, unsignedp
);
13226 int highprec
= min_precision (maxnode
, unsignedp
);
13227 int precision
= MAX (lowprec
, highprec
);
13230 TYPE_SIZE (enumtype
) = NULL_TREE
;
13232 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
13234 TYPE_PRECISION (enumtype
) = precision
;
13236 fixup_unsigned_type (enumtype
);
13238 fixup_signed_type (enumtype
);
13240 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
13241 /* Use the width of the narrowest normal C type which is wide
13243 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
13246 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
13248 TYPE_SIZE (enumtype
) = 0;
13249 layout_type (enumtype
);
13251 /* Fix up all variant types of this enum type. */
13252 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
13253 tem
= TYPE_NEXT_VARIANT (tem
))
13255 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
13256 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
13257 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
13258 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
13259 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
13260 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
13261 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
13262 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
13263 TYPE_USER_ALIGN (tem
) = TYPE_USER_ALIGN (enumtype
);
13264 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
13267 /* Finish debugging output for this type. */
13268 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
13274 /* Build and install a CONST_DECL for an enumeration constant of the
13275 enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided.
13276 Assignment of sequential values by default is handled here. */
13279 build_enumerator (name
, value
, enumtype
)
13289 /* Remove no-op casts from the value. */
13291 STRIP_TYPE_NOPS (value
);
13293 if (! processing_template_decl
)
13295 /* Validate and default VALUE. */
13296 if (value
!= NULL_TREE
)
13298 value
= decl_constant_value (value
);
13300 if (TREE_CODE (value
) == INTEGER_CST
)
13302 value
= default_conversion (value
);
13303 constant_expression_warning (value
);
13307 cp_error ("enumerator value for `%D' not integer constant", name
);
13312 /* Default based on previous value. */
13313 if (value
== NULL_TREE
&& ! processing_template_decl
)
13317 if (TYPE_VALUES (enumtype
))
13319 /* The next value is the previous value ... */
13320 prev_value
= DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype
)));
13321 /* ... plus one. */
13322 value
= cp_build_binary_op (PLUS_EXPR
,
13326 if (tree_int_cst_lt (value
, prev_value
))
13327 cp_error ("overflow in enumeration values at `%D'", name
);
13330 value
= integer_zero_node
;
13333 /* Remove no-op casts from the value. */
13335 STRIP_TYPE_NOPS (value
);
13337 /* To fix MAX_VAL enum consts. (bkoz) */
13338 TREE_TYPE (value
) = integer_type_node
;
13342 /* We always have to copy here; not all INTEGER_CSTs are unshared.
13343 Even in other cases, we will later (in finish_enum) be setting
13344 the type of VALUE. But, we don't need to make a copy if this
13345 VALUE is one of the enumeration constants for this same
13346 enumeration type. */
13347 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
13348 if (TREE_VALUE (values
) == value
)
13350 /* If we didn't break out of the loop, then we do need a copy. */
13351 if (!values
&& value
)
13352 value
= copy_node (value
);
13354 /* C++ associates enums with global, function, or class declarations. */
13355 context
= current_scope ();
13357 /* Build the actual enumeration constant. Note that the enumeration
13358 constants have the type of their initializers until the
13359 enumeration is complete:
13363 Following the closing brace of an enum-specifier, each enumer-
13364 ator has the type of its enumeration. Prior to the closing
13365 brace, the type of each enumerator is the type of its
13366 initializing value.
13368 In finish_enum we will reset the type. Of course, if we're
13369 processing a template, there may be no value. */
13370 type
= value
? TREE_TYPE (value
) : NULL_TREE
;
13372 if (context
&& context
== current_class_type
)
13373 /* This enum declaration is local to the class. We need the full
13374 lang_decl so that we can record DECL_CLASS_CONTEXT, for example. */
13375 decl
= build_lang_decl (CONST_DECL
, name
, type
);
13377 /* It's a global enum, or it's local to a function. (Note local to
13378 a function could mean local to a class method. */
13379 decl
= build_decl (CONST_DECL
, name
, type
);
13381 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
13382 DECL_INITIAL (decl
) = value
;
13383 TREE_READONLY (decl
) = 1;
13385 if (context
&& context
== current_class_type
)
13386 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
13387 on the TYPE_FIELDS list for `S'. (That's so that you can say
13388 things like `S::i' later.) */
13389 finish_member_declaration (decl
);
13393 GNU_xref_decl (current_function_decl
, decl
);
13396 /* Add this enumeration constant to the list for this type. */
13397 TYPE_VALUES (enumtype
) = tree_cons (name
, decl
, TYPE_VALUES (enumtype
));
13401 /* We're defining DECL. Make sure that it's type is OK. */
13404 check_function_type (decl
)
13407 tree fntype
= TREE_TYPE (decl
);
13408 tree return_type
= complete_type (TREE_TYPE (fntype
));
13410 /* In a function definition, arg types must be complete. */
13411 require_complete_types_for_parms (current_function_parms
);
13413 if (!COMPLETE_OR_VOID_TYPE_P (return_type
))
13415 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
13417 /* Make it return void instead, but don't change the
13418 type of the DECL_RESULT, in case we have a named return value. */
13419 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13421 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
13423 = build_cplus_method_type (ctype
,
13425 FUNCTION_ARG_CHAIN (decl
));
13429 = build_function_type (void_type_node
,
13430 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
13432 = build_exception_variant (fntype
,
13433 TYPE_RAISES_EXCEPTIONS (fntype
));
13436 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
13439 /* Create the FUNCTION_DECL for a function definition.
13440 DECLSPECS and DECLARATOR are the parts of the declaration;
13441 they describe the function's name and the type it returns,
13442 but twisted together in a fashion that parallels the syntax of C.
13444 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
13445 DECLARATOR is really the DECL for the function we are about to
13446 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
13447 indicating that the function is an inline defined in-class, and
13448 SF_EXPAND indicating that we should generate RTL for this
13451 This function creates a binding context for the function body
13452 as well as setting up the FUNCTION_DECL in current_function_decl.
13454 Returns 1 on success. If the DECLARATOR is not suitable for a function
13455 (it defines a datum instead), we return 0, which tells
13456 yyparse to report a parse error.
13458 For C++, we must first check whether that datum makes any sense.
13459 For example, "class A local_a(1,2);" means that variable local_a
13460 is an aggregate of type A, which should have a constructor
13461 applied to it with the argument list [1, 2]. */
13464 start_function (declspecs
, declarator
, attrs
, flags
)
13465 tree declspecs
, declarator
, attrs
;
13469 tree ctype
= NULL_TREE
;
13472 extern int have_extern_spec
;
13473 extern int used_extern_spec
;
13474 int doing_friend
= 0;
13475 struct binding_level
*bl
;
13477 /* Sanity check. */
13478 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
13479 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
13481 /* This should only be done once on the top most decl. */
13482 if (have_extern_spec
&& !used_extern_spec
)
13484 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
13485 used_extern_spec
= 1;
13488 if (flags
& SF_PRE_PARSED
)
13490 decl1
= declarator
;
13492 fntype
= TREE_TYPE (decl1
);
13493 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13494 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13496 /* ISO C++ 11.4/5. A friend function defined in a class is in
13497 the (lexical) scope of the class in which it is defined. */
13498 if (!ctype
&& DECL_FRIEND_P (decl1
))
13500 ctype
= DECL_FRIEND_CONTEXT (decl1
);
13502 /* CTYPE could be null here if we're dealing with a template;
13503 for example, `inline friend float foo()' inside a template
13504 will have no CTYPE set. */
13505 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
13511 last_function_parms
= DECL_ARGUMENTS (decl1
);
13512 last_function_parm_tags
= NULL_TREE
;
13516 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
13517 /* If the declarator is not suitable for a function definition,
13518 cause a syntax error. */
13519 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
13521 fntype
= TREE_TYPE (decl1
);
13523 restype
= TREE_TYPE (fntype
);
13524 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
13526 cp_error ("semicolon missing after declaration of `%#T'", restype
);
13527 shadow_tag (build_tree_list (NULL_TREE
, restype
));
13528 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
13529 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
13530 fntype
= build_function_type (integer_type_node
,
13531 TYPE_ARG_TYPES (fntype
));
13533 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
13535 TYPE_ARG_TYPES (fntype
));
13536 TREE_TYPE (decl1
) = fntype
;
13539 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13540 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13541 else if (DECL_MAIN_P (decl1
))
13543 /* If this doesn't return integer_type, complain. */
13544 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
13546 if (pedantic
|| warn_return_type
)
13547 pedwarn ("return type for `main' changed to `int'");
13548 TREE_TYPE (decl1
) = fntype
= default_function_type
;
13553 /* Sometimes we don't notice that a function is a static member, and
13554 build a METHOD_TYPE for it. Fix that up now. */
13555 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
)
13556 && TREE_CODE (TREE_TYPE (decl1
)) == METHOD_TYPE
)
13558 revert_static_member_fn (decl1
);
13559 last_function_parms
= TREE_CHAIN (last_function_parms
);
13563 /* Warn if function was previously implicitly declared
13564 (but not if we warned then). */
13565 if (! warn_implicit
13566 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
13567 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
13569 /* Set up current_class_type, and enter the scope of the class, if
13572 push_nested_class (ctype
, 1);
13573 else if (DECL_STATIC_FUNCTION_P (decl1
))
13574 push_nested_class (DECL_CONTEXT (decl1
), 2);
13576 /* Now that we have entered the scope of the class, we must restore
13577 the bindings for any template parameters surrounding DECL1, if it
13578 is an inline member template. (Order is important; consider the
13579 case where a template parameter has the same name as a field of
13580 the class.) It is not until after this point that
13581 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
13582 if (flags
& SF_INCLASS_INLINE
)
13583 maybe_begin_member_template_processing (decl1
);
13585 /* Effective C++ rule 15. See also c_expand_return. */
13587 && DECL_OVERLOADED_OPERATOR_P (decl1
) == NOP_EXPR
13588 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
13589 cp_warning ("`operator=' should return a reference to `*this'");
13591 /* Make the init_value nonzero so pushdecl knows this is not tentative.
13592 error_mark_node is replaced below (in poplevel) with the BLOCK. */
13593 if (!DECL_INITIAL (decl1
))
13594 DECL_INITIAL (decl1
) = error_mark_node
;
13596 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
13597 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
13600 /* This function exists in static storage.
13601 (This does not mean `static' in the C sense!) */
13602 TREE_STATIC (decl1
) = 1;
13604 /* We must call push_template_decl after current_class_type is set
13605 up. (If we are processing inline definitions after exiting a
13606 class scope, current_class_type will be NULL_TREE until set above
13607 by push_nested_class.) */
13608 if (processing_template_decl
)
13609 decl1
= push_template_decl (decl1
);
13611 /* We are now in the scope of the function being defined. */
13612 current_function_decl
= decl1
;
13614 /* Save the parm names or decls from this function's declarator
13615 where store_parm_decls will find them. */
13616 current_function_parms
= last_function_parms
;
13617 current_function_parm_tags
= last_function_parm_tags
;
13619 /* Make sure the parameter and return types are reasonable. When
13620 you declare a function, these types can be incomplete, but they
13621 must be complete when you define the function. */
13622 if (! processing_template_decl
)
13623 check_function_type (decl1
);
13625 /* Build the return declaration for the function. */
13626 restype
= TREE_TYPE (fntype
);
13627 if (!processing_template_decl
)
13629 if (!DECL_RESULT (decl1
))
13631 DECL_RESULT (decl1
)
13632 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13633 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype
),
13634 DECL_RESULT (decl1
));
13638 /* Just use `void'. Nobody will ever look at this anyhow. */
13639 DECL_RESULT (decl1
) = build_decl (RESULT_DECL
, 0, void_type_node
);
13641 /* Initialize RTL machinery. We cannot do this until
13642 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
13643 even when processing a template; this is how we get
13644 CFUN set up, and our per-function variables initialized. */
13645 bl
= current_binding_level
;
13646 init_function_start (decl1
, input_filename
, lineno
);
13647 current_binding_level
= bl
;
13648 expanding_p
= (flags
& SF_EXPAND
) != 0;
13650 /* Even though we're inside a function body, we still don't want to
13651 call expand_expr to calculate the size of a variable-sized array.
13652 We haven't necessarily assigned RTL to all variables yet, so it's
13653 not safe to try to expand expressions involving them. */
13654 immediate_size_expand
= 0;
13655 cfun
->x_dont_save_pending_sizes_p
= 1;
13657 /* If we're building a statement-tree, start the tree now. */
13658 if (processing_template_decl
|| !expanding_p
)
13659 begin_stmt_tree (&DECL_SAVED_TREE (decl1
));
13661 /* Let the user know we're compiling this function. */
13662 announce_function (decl1
);
13664 /* Record the decl so that the function name is defined.
13665 If we already have a decl for this name, and it is a FUNCTION_DECL,
13666 use the old decl. */
13667 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
13669 /* A specialization is not used to guide overload resolution. */
13670 if (!DECL_TEMPLATE_SPECIALIZATION (decl1
)
13671 && ! DECL_FUNCTION_MEMBER_P (decl1
))
13672 decl1
= pushdecl (decl1
);
13675 /* We need to set the DECL_CONTEXT. */
13676 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
13677 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
13678 /* And make sure we have enough default args. */
13679 check_default_args (decl1
);
13681 fntype
= TREE_TYPE (decl1
);
13684 /* Reset these in case the call to pushdecl changed them. */
13685 current_function_decl
= decl1
;
13686 cfun
->decl
= decl1
;
13688 /* Initialize the per-function data. */
13689 if (!DECL_PENDING_INLINE_P (decl1
) && DECL_SAVED_FUNCTION_DATA (decl1
))
13691 /* If we already parsed this function, and we're just expanding it
13692 now, restore saved state. */
13693 struct binding_level
*bl
= current_binding_level
;
13694 *cp_function_chain
= *DECL_SAVED_FUNCTION_DATA (decl1
);
13695 current_binding_level
= bl
;
13697 /* This function is being processed in whole-function mode; we
13698 already did semantic analysis. */
13699 cfun
->x_whole_function_mode_p
= 1;
13701 /* If we decided that we didn't want to inline this function,
13702 make sure the back-end knows that. */
13703 if (!current_function_cannot_inline
)
13704 current_function_cannot_inline
= cp_function_chain
->cannot_inline
;
13706 /* We don't need the saved data anymore. */
13707 free (DECL_SAVED_FUNCTION_DATA (decl1
));
13708 DECL_SAVED_FUNCTION_DATA (decl1
) = NULL
;
13710 else if (ctype
&& !doing_friend
&& !DECL_STATIC_FUNCTION_P (decl1
))
13712 /* We know that this was set up by `grokclassfn'. We do not
13713 wait until `store_parm_decls', since evil parse errors may
13714 never get us to that point. Here we keep the consistency
13715 between `current_class_type' and `current_class_ptr'. */
13716 tree t
= DECL_ARGUMENTS (decl1
);
13718 my_friendly_assert (t
!= NULL_TREE
&& TREE_CODE (t
) == PARM_DECL
,
13720 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
13723 cp_function_chain
->x_current_class_ref
13724 = build_indirect_ref (t
, NULL_PTR
);
13725 cp_function_chain
->x_current_class_ptr
= t
;
13727 /* Constructors and destructors need to know whether they're "in
13728 charge" of initializing virtual base classes. */
13729 if (DECL_HAS_IN_CHARGE_PARM_P (decl1
))
13730 current_in_charge_parm
= TREE_CHAIN (t
);
13733 if (DECL_INTERFACE_KNOWN (decl1
))
13735 tree ctx
= decl_function_context (decl1
);
13737 if (DECL_NOT_REALLY_EXTERN (decl1
))
13738 DECL_EXTERNAL (decl1
) = 0;
13740 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
13741 && TREE_PUBLIC (ctx
))
13742 /* This is a function in a local class in an extern inline
13744 comdat_linkage (decl1
);
13746 /* If this function belongs to an interface, it is public.
13747 If it belongs to someone else's interface, it is also external.
13748 This only affects inlines and template instantiations. */
13749 else if (interface_unknown
== 0
13750 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13751 || flag_alt_external_templates
))
13753 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
13754 || processing_template_decl
)
13756 DECL_EXTERNAL (decl1
)
13758 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
13759 && !DECL_VINDEX (decl1
)));
13761 /* For WIN32 we also want to put these in linkonce sections. */
13762 maybe_make_one_only (decl1
);
13765 DECL_EXTERNAL (decl1
) = 0;
13766 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
13767 DECL_INTERFACE_KNOWN (decl1
) = 1;
13769 else if (interface_unknown
&& interface_only
13770 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13771 || flag_alt_external_templates
))
13773 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13774 interface, we will have interface_only set but not
13775 interface_known. In that case, we don't want to use the normal
13776 heuristics because someone will supply a #pragma implementation
13777 elsewhere, and deducing it here would produce a conflict. */
13778 comdat_linkage (decl1
);
13779 DECL_EXTERNAL (decl1
) = 0;
13780 DECL_INTERFACE_KNOWN (decl1
) = 1;
13781 DECL_DEFER_OUTPUT (decl1
) = 1;
13785 /* This is a definition, not a reference.
13786 So clear DECL_EXTERNAL. */
13787 DECL_EXTERNAL (decl1
) = 0;
13789 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
13790 && ! DECL_INTERFACE_KNOWN (decl1
)
13791 /* Don't try to defer nested functions for now. */
13792 && ! decl_function_context (decl1
))
13793 DECL_DEFER_OUTPUT (decl1
) = 1;
13795 DECL_INTERFACE_KNOWN (decl1
) = 1;
13798 if (doing_semantic_analysis_p ())
13801 current_binding_level
->parm_flag
= 1;
13805 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13807 if (!building_stmt_tree ())
13809 GNU_xref_function (decl1
, current_function_parms
);
13810 make_function_rtl (decl1
);
13813 /* Promote the value to int before returning it. */
13814 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13815 restype
= type_promotes_to (restype
);
13817 /* If this fcn was already referenced via a block-scope `extern' decl
13818 (or an implicit decl), propagate certain information about the usage. */
13819 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13820 TREE_ADDRESSABLE (decl1
) = 1;
13822 if (DECL_RESULT (decl1
) == NULL_TREE
)
13824 DECL_RESULT (decl1
)
13825 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13826 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13827 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13832 if (DECL_DESTRUCTOR_P (decl1
))
13834 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13835 DECL_CONTEXT (dtor_label
) = current_function_decl
;
13837 /* Under the old ABI we return `this' from constructors, so we make
13838 ordinary `return' statements in constructors jump to CTOR_LABEL;
13839 from there we return `this'. Under the new ABI, we don't bother
13840 with any of this. By not setting CTOR_LABEL the remainder of the
13841 machinery is automatically disabled. */
13842 else if (!flag_new_abi
&& DECL_CONSTRUCTOR_P (decl1
))
13844 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13845 DECL_CONTEXT (ctor_label
) = current_function_decl
;
13851 /* Called after store_parm_decls for a function-try-block. */
13854 expand_start_early_try_stmts ()
13856 expand_start_try_stmts ();
13859 /* Store the parameter declarations into the current function declaration.
13860 This is called after parsing the parameter declarations, before
13861 digesting the body of the function.
13863 Also install to binding contour return value identifier, if any. */
13866 store_parm_decls ()
13868 register tree fndecl
= current_function_decl
;
13869 register tree parm
;
13870 int parms_have_cleanups
= 0;
13871 tree cleanups
= NULL_TREE
;
13873 /* This is a list of types declared among parms in a prototype. */
13874 tree parmtags
= current_function_parm_tags
;
13876 /* This is a chain of any other decls that came in among the parm
13877 declarations. If a parm is declared with enum {foo, bar} x;
13878 then CONST_DECLs for foo and bar are put here. */
13879 tree nonparms
= NULL_TREE
;
13881 /* Create a binding level for the parms. */
13882 if (!building_stmt_tree ())
13883 expand_start_bindings (2);
13885 if (current_function_parms
)
13887 /* This case is when the function was defined with an ANSI prototype.
13888 The parms already have decls, so we need not do anything here
13889 except record them as in effect
13890 and complain if any redundant old-style parm decls were written. */
13892 tree specparms
= current_function_parms
;
13895 if (doing_semantic_analysis_p ())
13897 /* Must clear this because it might contain TYPE_DECLs declared
13899 storedecls (NULL_TREE
);
13901 /* If we're doing semantic analysis, then we'll call pushdecl
13902 for each of these. We must do them in reverse order so that
13903 they end in the correct forward order. */
13904 specparms
= nreverse (specparms
);
13907 for (parm
= specparms
; parm
; parm
= next
)
13909 next
= TREE_CHAIN (parm
);
13910 if (TREE_CODE (parm
) == PARM_DECL
)
13912 tree type
= TREE_TYPE (parm
);
13914 if (doing_semantic_analysis_p ())
13918 if (DECL_NAME (parm
) == NULL_TREE
13919 || TREE_CODE (parm
) != VOID_TYPE
)
13922 cp_error ("parameter `%D' declared void", parm
);
13924 cleanup
= (processing_template_decl
13926 : maybe_build_cleanup (parm
));
13929 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13931 else if (type
!= error_mark_node
13932 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
13933 parms_have_cleanups
= 1;
13937 /* If we find an enum constant or a type tag,
13938 put it aside for the moment. */
13939 TREE_CHAIN (parm
) = NULL_TREE
;
13940 nonparms
= chainon (nonparms
, parm
);
13944 if (doing_semantic_analysis_p ())
13946 /* Get the decls in their original chain order
13947 and record in the function. This is all and only the
13948 PARM_DECLs that were pushed into scope by the loop above. */
13949 DECL_ARGUMENTS (fndecl
) = getdecls ();
13950 storetags (chainon (parmtags
, gettags ()));
13954 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13956 /* Now store the final chain of decls for the arguments
13957 as the decl-chain of the current lexical scope.
13958 Put the enumerators in as well, at the front so that
13959 DECL_ARGUMENTS is not modified. */
13960 if (doing_semantic_analysis_p ())
13961 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13963 /* Initialize the RTL code for the function. */
13964 DECL_SAVED_INSNS (fndecl
) = 0;
13965 if (! building_stmt_tree ())
13966 expand_function_start (fndecl
, parms_have_cleanups
);
13968 current_function_parms_stored
= 1;
13970 /* If this function is `main', emit a call to `__main'
13971 to run global initializers, etc. */
13972 if (DECL_MAIN_P (fndecl
) && !building_stmt_tree ())
13973 expand_main_function ();
13975 /* Now that we have initialized the parms, we can start their
13976 cleanups. We cannot do this before, since expand_decl_cleanup
13977 should not be called before the parm can be used. */
13980 finish_decl_cleanup (TREE_PURPOSE (cleanups
),
13981 TREE_VALUE (cleanups
));
13982 cleanups
= TREE_CHAIN (cleanups
);
13985 /* Create a binding contour which can be used to catch
13986 cleanup-generated temporaries. Also, if the return value needs or
13987 has initialization, deal with that now. */
13988 if (parms_have_cleanups
)
13991 if (!building_stmt_tree ())
13992 expand_start_bindings (2);
13995 /* Do the starting of the exception specifications, if we have any. */
13996 if (flag_exceptions
&& !processing_template_decl
13997 && flag_enforce_eh_specs
13998 && building_stmt_tree ()
13999 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
14000 current_eh_spec_try_block
= expand_start_eh_spec ();
14003 /* Bind a name and initialization to the return value of
14004 the current function. */
14007 store_return_init (decl
)
14010 /* If this named return value comes in a register, put it in a
14011 pseudo-register. */
14012 if (DECL_REGISTER (decl
))
14014 original_result_rtx
= DECL_RTL (decl
);
14015 /* Note that the mode of the old DECL_RTL may be wider than the
14016 mode of DECL_RESULT, depending on the calling conventions for
14017 the processor. For example, on the Alpha, a 32-bit integer
14018 is returned in a DImode register -- the DECL_RESULT has
14019 SImode but the DECL_RTL for the DECL_RESULT has DImode. So,
14020 here, we use the mode the back-end has already assigned for
14021 the return value. */
14022 DECL_RTL (decl
) = gen_reg_rtx (GET_MODE (original_result_rtx
));
14023 if (TREE_ADDRESSABLE (decl
))
14024 put_var_into_stack (decl
);
14029 /* We have finished doing semantic analysis on DECL, but have not yet
14030 generated RTL for its body. Save away our current state, so that
14031 when we want to generate RTL later we know what to do. */
14034 save_function_data (decl
)
14037 struct language_function
*f
;
14039 /* Save the language-specific per-function data so that we can
14040 get it back when we really expand this function. */
14041 my_friendly_assert (!DECL_PENDING_INLINE_P (decl
),
14045 f
= ((struct language_function
*)
14046 xmalloc (sizeof (struct language_function
)));
14047 bcopy ((char *) cp_function_chain
, (char *) f
,
14048 sizeof (struct language_function
));
14049 DECL_SAVED_FUNCTION_DATA (decl
) = f
;
14051 /* Clear out the bits we don't need. */
14052 f
->x_stmt_tree
.x_last_stmt
= NULL_TREE
;
14053 f
->x_stmt_tree
.x_last_expr_type
= NULL_TREE
;
14054 f
->x_result_rtx
= NULL_RTX
;
14055 f
->x_named_label_uses
= NULL
;
14056 f
->bindings
= NULL
;
14058 /* When we get back here again, we will be expanding. */
14059 f
->x_expanding_p
= 1;
14061 /* If we've already decided that we cannot inline this function, we
14062 must remember that fact when we actually go to expand the
14064 f
->cannot_inline
= current_function_cannot_inline
;
14067 /* At the end of every constructor we generate to code to return
14068 `this'. Do that now. */
14071 finish_constructor_body ()
14073 /* Any return from a constructor will end up here. */
14075 add_tree (build_stmt (LABEL_STMT
, ctor_label
));
14077 /* Clear CTOR_LABEL so that finish_return_stmt knows to really
14078 generate the return, rather than a goto to CTOR_LABEL. */
14079 ctor_label
= NULL_TREE
;
14080 /* In check_return_expr we translate an empty return from a
14081 constructor to a return of `this'. */
14082 finish_return_stmt (NULL_TREE
);
14083 /* Mark the end of the constructor. */
14084 add_tree (build_stmt (CTOR_STMT
));
14087 /* At the end of every destructor we generate code to restore virtual
14088 function tables to the values desired by base classes and to call
14089 to base class destructors. Do that now. */
14092 finish_destructor_body ()
14094 tree compound_stmt
;
14099 /* Create a block to contain all the extra code. */
14100 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
14102 /* Any return from a destructor will end up here. */
14103 add_tree (build_stmt (LABEL_STMT
, dtor_label
));
14105 /* Generate the code to call destructor on base class. If this
14106 destructor belongs to a class with virtual functions, then set
14107 the virtual function table pointer to represent the type of our
14110 /* This side-effect makes call to `build_delete' generate the code
14111 we have to have at the end of this destructor. `build_delete'
14112 will set the flag again. */
14113 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
14115 exprstmt
= build_delete (current_class_type
,
14117 sfk_base_destructor
,
14118 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
,
14121 if (exprstmt
!= error_mark_node
14122 && (TREE_CODE (exprstmt
) != NOP_EXPR
14123 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
14124 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
14126 if (exprstmt
!= void_zero_node
)
14127 /* Don't call `expand_expr_stmt' if we're not going to do
14128 anything, since -Wall will give a diagnostic. */
14129 finish_expr_stmt (exprstmt
);
14131 /* Run destructors for all virtual baseclasses. */
14132 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
14137 if_stmt
= begin_if_stmt ();
14138 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
14139 current_in_charge_parm
,
14143 vbases
= CLASSTYPE_VBASECLASSES (current_class_type
);
14144 /* The CLASSTYPE_VBASECLASSES list is in initialization
14145 order, so we have to march through it in reverse order. */
14146 for (vbases
= nreverse (copy_list (vbases
));
14148 vbases
= TREE_CHAIN (vbases
))
14150 tree vbase
= TREE_VALUE (vbases
);
14152 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (vbase
)))
14154 tree vb
= get_vbase
14155 (BINFO_TYPE (vbase
),
14156 TYPE_BINFO (current_class_type
));
14158 (build_scoped_method_call
14159 (current_class_ref
, vb
, base_dtor_identifier
,
14164 finish_then_clause (if_stmt
);
14169 virtual_size
= c_sizeof (current_class_type
);
14171 /* At the end, call delete if that's what's requested. */
14173 /* FDIS sez: At the point of definition of a virtual destructor
14174 (including an implicit definition), non-placement operator delete
14175 shall be looked up in the scope of the destructor's class and if
14176 found shall be accessible and unambiguous.
14178 This is somewhat unclear, but I take it to mean that if the class
14179 only defines placement deletes we don't do anything here. So we
14180 pass LOOKUP_SPECULATIVELY; delete_sanity will complain for us if
14181 they ever try to delete one of these. */
14182 exprstmt
= build_op_delete_call
14183 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
14184 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
14186 if_stmt
= begin_if_stmt ();
14187 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
14188 current_in_charge_parm
,
14191 finish_expr_stmt (exprstmt
);
14192 finish_then_clause (if_stmt
);
14195 /* Close the block we started above. */
14196 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
14199 /* Finish up a function declaration and compile that function
14200 all the way to assembler language output. The free the storage
14201 for the function definition.
14203 FLAGS is a bitwise or of the following values:
14205 An extra call to poplevel (and expand_end_bindings) must be
14206 made to take care of the binding contour for the base
14207 initializers. This is only relevant for constructors.
14209 We just finished processing the body of an in-class inline
14210 function definition. (This processing will have taken place
14211 after the class definition is complete.) */
14214 finish_function (flags
)
14217 register tree fndecl
= current_function_decl
;
14218 tree fntype
, ctype
= NULL_TREE
;
14219 /* Label to use if this function is supposed to return a value. */
14220 tree no_return_label
= NULL_TREE
;
14221 int call_poplevel
= (flags
& 1) != 0;
14222 int inclass_inline
= (flags
& 2) != 0;
14225 int current_line
= lineno
;
14227 /* When we get some parse errors, we can end up without a
14228 current_function_decl, so cope. */
14229 if (fndecl
== NULL_TREE
)
14230 return error_mark_node
;
14232 nested
= function_depth
> 1;
14233 fntype
= TREE_TYPE (fndecl
);
14235 /* TREE_READONLY (fndecl) = 1;
14236 This caused &foo to be of type ptr-to-const-function
14237 which then got a warning when stored in a ptr-to-function variable. */
14239 /* This happens on strange parse errors. */
14240 if (! current_function_parms_stored
)
14243 store_parm_decls ();
14246 /* For a cloned function, we've already got all the code we need;
14247 there's no need to add any extra bits. */
14248 if (building_stmt_tree () && DECL_CLONED_FUNCTION_P (fndecl
))
14250 else if (building_stmt_tree ())
14252 if (DECL_CONSTRUCTOR_P (fndecl
))
14254 finish_constructor_body ();
14258 else if (DECL_DESTRUCTOR_P (fndecl
) && !processing_template_decl
)
14259 finish_destructor_body ();
14260 else if (DECL_MAIN_P (fndecl
))
14262 /* Make it so that `main' always returns 0 by default. */
14264 finish_return_stmt (integer_one_node
);
14266 finish_return_stmt (integer_zero_node
);
14270 /* Finish dealing with exception specifiers. */
14271 if (flag_exceptions
&& !processing_template_decl
14272 && flag_enforce_eh_specs
14273 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
14274 expand_end_eh_spec (TYPE_RAISES_EXCEPTIONS
14275 (TREE_TYPE (current_function_decl
)),
14276 current_eh_spec_try_block
);
14281 if (write_symbols
!= NO_DEBUG
/*&& TREE_CODE (fntype) != METHOD_TYPE*/)
14283 /* Keep this code around in case we later want to control debug info
14284 based on whether a type is "used". (jason 1999-11-11) */
14286 tree ttype
= target_type (fntype
);
14289 if (IS_AGGR_TYPE (ttype
))
14290 /* Let debugger know it should output info for this type. */
14291 note_debug_info_needed (ttype
);
14293 for (parmdecl
= DECL_ARGUMENTS (fndecl
); parmdecl
; parmdecl
= TREE_CHAIN (parmdecl
))
14295 ttype
= target_type (TREE_TYPE (parmdecl
));
14296 if (IS_AGGR_TYPE (ttype
))
14297 /* Let debugger know it should output info for this type. */
14298 note_debug_info_needed (ttype
);
14303 /* Clean house because we will need to reorder insns here. */
14304 do_pending_stack_adjust ();
14308 else if (DECL_CONSTRUCTOR_P (fndecl
))
14313 else if (return_label
!= NULL_RTX
14314 && flag_this_is_variable
<= 0
14315 && current_function_return_value
== NULL_TREE
14316 && ! DECL_NAME (DECL_RESULT (current_function_decl
)))
14317 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
14319 if (flag_exceptions
)
14320 expand_exception_blocks ();
14322 /* If this function is supposed to return a value, ensure that
14323 we do not fall into the cleanups by mistake. The end of our
14324 function will look like this:
14326 user code (may have return stmt somewhere)
14327 goto no_return_label
14332 NOTE_INSN_FUNCTION_END
14336 If the user omits a return stmt in the USER CODE section, we
14337 will have a control path which reaches NOTE_INSN_FUNCTION_END.
14338 Otherwise, we won't. */
14339 if (no_return_label
)
14341 DECL_CONTEXT (no_return_label
) = fndecl
;
14342 DECL_INITIAL (no_return_label
) = error_mark_node
;
14343 DECL_SOURCE_FILE (no_return_label
) = input_filename
;
14344 DECL_SOURCE_LINE (no_return_label
) = current_line
;
14345 expand_goto (no_return_label
);
14350 /* Remove the binding contour which is used
14351 to catch cleanup-generated temporaries. */
14352 expand_end_bindings (0, 0, 0);
14353 poplevel (0, 0, 0);
14355 /* Emit label at beginning of cleanup code for parameters. */
14356 emit_label (cleanup_label
);
14359 /* Get return value into register if that's where it's supposed
14361 if (original_result_rtx
)
14362 fixup_result_decl (DECL_RESULT (fndecl
), original_result_rtx
);
14364 /* Finish building code that will trigger warnings if users forget
14365 to make their functions return values. */
14366 if (no_return_label
|| cleanup_label
)
14367 emit_jump (return_label
);
14368 if (no_return_label
)
14370 /* We don't need to call `expand_*_return' here because we
14371 don't need any cleanups here--this path of code is only
14372 for error checking purposes. */
14373 expand_label (no_return_label
);
14376 /* We hard-wired immediate_size_expand to zero in
14377 start_function. Expand_function_end will decrement this
14378 variable. So, we set the variable to one here, so that after
14379 the decrement it will remain zero. */
14380 immediate_size_expand
= 1;
14382 /* Generate rtl for function exit. */
14383 expand_function_end (input_filename
, current_line
, 1);
14386 /* We have to save this value here in case
14387 maybe_end_member_template_processing decides to pop all the
14388 template parameters. */
14389 expand_p
= !building_stmt_tree ();
14391 /* If we're saving up tree structure, tie off the function now. */
14393 finish_stmt_tree (&DECL_SAVED_TREE (fndecl
));
14395 /* This must come after expand_function_end because cleanups might
14396 have declarations (from inline functions) that need to go into
14397 this function's blocks. */
14398 if (doing_semantic_analysis_p ())
14400 if (current_binding_level
->parm_flag
!= 1)
14401 my_friendly_abort (122);
14402 poplevel (1, 0, 1);
14405 /* Remember that we were in class scope. */
14406 if (current_class_name
)
14407 ctype
= current_class_type
;
14409 /* Must mark the RESULT_DECL as being in this function. */
14410 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
14412 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
14413 to the FUNCTION_DECL node itself. */
14414 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
14416 /* Save away current state, if appropriate. */
14417 if (!expanding_p
&& !processing_template_decl
)
14418 save_function_data (fndecl
);
14420 /* If this function calls `setjmp' it cannot be inlined. When
14421 `longjmp' is called it is not guaranteed to restore the value of
14422 local variables that have been modified since the call to
14423 `setjmp'. So, if were to inline this function into some caller
14424 `c', then when we `longjmp', we might not restore all variables
14425 in `c'. (It might seem, at first blush, that there's no way for
14426 this function to modify local variables in `c', but their
14427 addresses may have been stored somewhere accessible to this
14429 if (!expanding_p
&& !processing_template_decl
&& calls_setjmp_p (fndecl
))
14430 DECL_UNINLINABLE (fndecl
) = 1;
14437 /* So we can tell if jump_optimize sets it to 1. */
14440 /* Before we call rest_of_compilation (which will pop the
14441 CURRENT_FUNCTION), we must save these values. */
14442 returns_null
= current_function_returns_null
;
14443 returns_value
= current_function_returns_value
;
14445 /* If this is a nested function (like a template instantiation
14446 that we're compiling in the midst of compiling something
14447 else), push a new GC context. That will keep local variables
14448 on the stack from being collected while we're doing the
14449 compilation of this function. */
14450 if (function_depth
> 1)
14451 ggc_push_context ();
14453 /* Run the optimizers and output the assembler code for this
14455 rest_of_compilation (fndecl
);
14457 /* Undo the call to ggc_push_context above. */
14458 if (function_depth
> 1)
14459 ggc_pop_context ();
14461 if (DECL_SAVED_INSNS (fndecl
) && ! TREE_ASM_WRITTEN (fndecl
))
14463 /* Set DECL_EXTERNAL so that assemble_external will be called as
14464 necessary. We'll clear it again in finish_file. */
14465 if (! DECL_EXTERNAL (fndecl
))
14466 DECL_NOT_REALLY_EXTERN (fndecl
) = 1;
14467 DECL_EXTERNAL (fndecl
) = 1;
14472 /* Keep this code around in case we later want to control debug info
14473 based on whether a type is "used". (jason 1999-11-11) */
14475 if (ctype
&& TREE_ASM_WRITTEN (fndecl
))
14476 note_debug_info_needed (ctype
);
14479 if (DECL_NAME (DECL_RESULT (fndecl
)))
14480 returns_value
|= can_reach_end
;
14482 returns_null
|= can_reach_end
;
14484 if (TREE_THIS_VOLATILE (fndecl
) && returns_null
)
14485 warning ("`noreturn' function does return");
14486 else if (returns_null
14487 && TREE_CODE (TREE_TYPE (fntype
)) != VOID_TYPE
)
14489 /* Always complain if there's just no return statement. */
14490 if (!returns_value
)
14491 warning ("no return statement in function returning non-void");
14492 else if (warn_return_type
|| pedantic
)
14493 /* If this function returns non-void and control can drop through,
14495 warning ("control reaches end of non-void function");
14500 /* Clear out memory we no longer need. */
14501 free_after_parsing (cfun
);
14502 /* Since we never call rest_of_compilation, we never clear
14503 CFUN. Do so explicitly. */
14504 free_after_compilation (cfun
);
14508 /* If this is a in-class inline definition, we may have to pop the
14509 bindings for the template parameters that we added in
14510 maybe_begin_member_template_processing when start_function was
14512 if (inclass_inline
)
14513 maybe_end_member_template_processing ();
14515 /* Leave the scope of the class. */
14517 pop_nested_class ();
14521 if (!DECL_SAVED_INSNS (fndecl
) && !DECL_SAVED_FUNCTION_DATA (fndecl
)
14522 && !(flag_inline_trees
&& DECL_INLINE (fndecl
)))
14526 /* Stop pointing to the local nodes about to be freed. */
14527 /* But DECL_INITIAL must remain nonzero so we know this
14528 was an actual function definition. */
14529 DECL_INITIAL (fndecl
) = error_mark_node
;
14530 for (t
= DECL_ARGUMENTS (fndecl
); t
; t
= TREE_CHAIN (t
))
14531 DECL_RTL (t
) = DECL_INCOMING_RTL (t
) = NULL_RTX
;
14534 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
14535 static_ctors
= tree_cons (NULL_TREE
, fndecl
, static_ctors
);
14536 if (DECL_STATIC_DESTRUCTOR (fndecl
))
14537 static_dtors
= tree_cons (NULL_TREE
, fndecl
, static_dtors
);
14542 /* Let the error reporting routines know that we're outside a
14543 function. For a nested function, this value is used in
14544 pop_cp_function_context and then reset via pop_function_context. */
14545 current_function_decl
= NULL_TREE
;
14546 /* We don't really care about obstacks, but the middle-end
14547 sometimes cares on what obstck things are located. */
14548 permanent_allocation (1);
14554 /* Create the FUNCTION_DECL for a function definition.
14555 DECLSPECS and DECLARATOR are the parts of the declaration;
14556 they describe the return type and the name of the function,
14557 but twisted together in a fashion that parallels the syntax of C.
14559 This function creates a binding context for the function body
14560 as well as setting up the FUNCTION_DECL in current_function_decl.
14562 Returns a FUNCTION_DECL on success.
14564 If the DECLARATOR is not suitable for a function (it defines a datum
14565 instead), we return 0, which tells yyparse to report a parse error.
14567 May return void_type_node indicating that this method is actually
14568 a friend. See grokfield for more details.
14570 Came here with a `.pushlevel' .
14572 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14573 CHANGES TO CODE IN `grokfield'. */
14576 start_method (declspecs
, declarator
, attrlist
)
14577 tree declarator
, declspecs
, attrlist
;
14579 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
14582 /* Something too ugly to handle. */
14583 if (fndecl
== NULL_TREE
)
14586 /* Pass friends other than inline friend functions back. */
14587 if (fndecl
== void_type_node
)
14590 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
14591 /* Not a function, tell parser to report parse error. */
14594 if (DECL_IN_AGGR_P (fndecl
))
14596 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
14598 if (DECL_CONTEXT (fndecl
)
14599 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
14600 cp_error ("`%D' is already defined in class `%T'", fndecl
,
14601 DECL_CONTEXT (fndecl
));
14603 return void_type_node
;
14606 check_template_shadow (fndecl
);
14608 DECL_THIS_INLINE (fndecl
) = 1;
14610 if (flag_default_inline
)
14611 DECL_INLINE (fndecl
) = 1;
14613 /* We process method specializations in finish_struct_1. */
14614 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
14615 fndecl
= push_template_decl (fndecl
);
14617 if (! DECL_FRIEND_P (fndecl
))
14619 if (TREE_CHAIN (fndecl
))
14621 fndecl
= copy_node (fndecl
);
14622 TREE_CHAIN (fndecl
) = NULL_TREE
;
14625 if (DECL_CONSTRUCTOR_P (fndecl
))
14627 if (! grok_ctor_properties (current_class_type
, fndecl
))
14628 return void_type_node
;
14630 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
14631 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
14634 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0);
14636 /* Make a place for the parms */
14638 current_binding_level
->parm_flag
= 1;
14640 DECL_IN_AGGR_P (fndecl
) = 1;
14644 /* Go through the motions of finishing a function definition.
14645 We don't compile this method until after the whole class has
14648 FINISH_METHOD must return something that looks as though it
14649 came from GROKFIELD (since we are defining a method, after all).
14651 This is called after parsing the body of the function definition.
14652 STMTS is the chain of statements that makes up the function body.
14654 DECL is the ..._DECL that `start_method' provided. */
14657 finish_method (decl
)
14660 register tree fndecl
= decl
;
14663 register tree link
;
14665 if (decl
== void_type_node
)
14668 old_initial
= DECL_INITIAL (fndecl
);
14670 /* Undo the level for the parms (from start_method).
14671 This is like poplevel, but it causes nothing to be
14672 saved. Saving information here confuses symbol-table
14673 output routines. Besides, this information will
14674 be correctly output when this method is actually
14677 /* Clear out the meanings of the local variables of this level;
14678 also record in each decl which block it belongs to. */
14680 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
14682 if (DECL_NAME (link
) != NULL_TREE
)
14683 pop_binding (DECL_NAME (link
), link
);
14684 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
14685 DECL_CONTEXT (link
) = NULL_TREE
;
14688 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
14689 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
14690 current_binding_level
->parm_flag
,
14691 current_binding_level
->keep
);
14693 poplevel (0, 0, 0);
14695 DECL_INITIAL (fndecl
) = old_initial
;
14697 /* We used to check if the context of FNDECL was different from
14698 current_class_type as another way to get inside here. This didn't work
14699 for String.cc in libg++. */
14700 if (DECL_FRIEND_P (fndecl
))
14702 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
14703 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
14704 decl
= void_type_node
;
14710 /* Called when a new struct TYPE is defined.
14711 If this structure or union completes the type of any previous
14712 variable declaration, lay it out and output its rtl. */
14715 hack_incomplete_structures (type
)
14719 struct binding_level
*level
;
14721 if (!type
) /* Don't do this for class templates. */
14724 if (namespace_bindings_p ())
14727 list
= &namespace_scope_incomplete
;
14731 level
= innermost_nonclass_level ();
14732 list
= &level
->incomplete
;
14739 tree decl
= TREE_VALUE (*list
);
14740 if ((decl
&& TREE_TYPE (decl
) == type
)
14741 || (TREE_TYPE (decl
)
14742 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14743 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
14745 int toplevel
= toplevel_bindings_p ();
14746 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14747 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
14748 layout_type (TREE_TYPE (decl
));
14749 layout_decl (decl
, 0);
14750 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
14754 expand_decl (decl
);
14755 cleanup
= maybe_build_cleanup (decl
);
14756 expand_decl_init (decl
);
14757 if (! expand_decl_cleanup (decl
, cleanup
))
14758 cp_error ("parser lost in parsing declaration of `%D'",
14761 *list
= TREE_CHAIN (*list
);
14764 list
= &TREE_CHAIN (*list
);
14767 /* Keep looking through artificial binding levels generated
14768 for local variables. */
14769 if (level
&& level
->keep
== 2)
14771 level
= level
->level_chain
;
14772 list
= &level
->incomplete
;
14779 /* If DECL is of a type which needs a cleanup, build that cleanup
14783 maybe_build_cleanup (decl
)
14786 tree type
= TREE_TYPE (decl
);
14788 if (type
!= error_mark_node
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
14790 int flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14793 if (TREE_CODE (type
) == ARRAY_TYPE
)
14797 mark_addressable (decl
);
14798 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14801 /* Optimize for space over speed here. */
14802 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14803 || flag_expensive_optimizations
)
14804 flags
|= LOOKUP_NONVIRTUAL
;
14806 rval
= build_delete (TREE_TYPE (rval
), rval
,
14807 sfk_complete_destructor
, flags
, 0);
14809 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14810 && ! TYPE_HAS_DESTRUCTOR (type
))
14811 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14812 build_tree_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14819 /* Expand a C++ expression at the statement level.
14820 This is needed to ferret out nodes which have UNKNOWN_TYPE.
14821 The C++ type checker should get all of these out when
14822 expressions are combined with other, type-providing, expressions,
14823 leaving only orphan expressions, such as:
14825 &class::bar; / / takes its address, but does nothing with it. */
14828 cplus_expand_expr_stmt (exp
)
14832 /* We should do this eventually, but right now this causes regex.o from
14833 libg++ to miscompile, and tString to core dump. */
14834 exp
= build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (exp
), exp
);
14837 /* If we don't do this, we end up down inside expand_expr
14838 trying to do TYPE_MODE on the ERROR_MARK, and really
14839 go outside the bounds of the type. */
14840 if (exp
!= error_mark_node
)
14841 expand_expr_stmt (exp
);
14844 /* When a stmt has been parsed, this function is called. */
14849 /* Always assume this statement was not an expression statement. If
14850 it actually was an expression statement, its our callers
14851 responsibility to fix this up. */
14852 last_expr_type
= NULL_TREE
;
14855 /* DECL was originally constructed as a non-static member function,
14856 but turned out to be static. Update it accordingly. */
14859 revert_static_member_fn (decl
)
14863 tree function
= TREE_TYPE (decl
);
14864 tree args
= TYPE_ARG_TYPES (function
);
14866 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14867 != TYPE_UNQUALIFIED
)
14868 cp_error ("static member function `%#D' declared with type qualifiers",
14871 args
= TREE_CHAIN (args
);
14872 tmp
= build_function_type (TREE_TYPE (function
), args
);
14873 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14874 tmp
= build_exception_variant (tmp
,
14875 TYPE_RAISES_EXCEPTIONS (function
));
14876 TREE_TYPE (decl
) = tmp
;
14877 if (DECL_ARGUMENTS (decl
))
14878 DECL_ARGUMENTS (decl
) = TREE_CHAIN (DECL_ARGUMENTS (decl
));
14879 DECL_STATIC_FUNCTION_P (decl
) = 1;
14882 /* Initialize the variables used during compilation of a C++
14886 push_cp_function_context (f
)
14887 struct function
*f
;
14889 struct language_function
*p
14890 = ((struct language_function
*)
14891 xcalloc (1, sizeof (struct language_function
)));
14894 /* It takes an explicit call to expand_body to generate RTL for a
14898 /* Whenever we start a new function, we destroy temporaries in the
14900 current_stmt_tree
->stmts_are_full_exprs_p
= 1;
14903 /* Free the language-specific parts of F, now that we've finished
14904 compiling the function. */
14907 pop_cp_function_context (f
)
14908 struct function
*f
;
14911 free (f
->language
);
14915 /* Mark P for GC. */
14918 mark_lang_function (p
)
14919 struct language_function
*p
;
14924 ggc_mark_tree (p
->x_ctor_label
);
14925 ggc_mark_tree (p
->x_dtor_label
);
14926 ggc_mark_tree (p
->x_current_class_ptr
);
14927 ggc_mark_tree (p
->x_current_class_ref
);
14928 ggc_mark_tree (p
->x_eh_spec_try_block
);
14929 ggc_mark_tree (p
->x_scope_stmt_stack
);
14931 ggc_mark_rtx (p
->x_result_rtx
);
14933 mark_named_label_lists (&p
->x_named_labels
, &p
->x_named_label_uses
);
14934 mark_stmt_tree (&p
->x_stmt_tree
);
14935 mark_binding_level (&p
->bindings
);
14938 /* Mark the language-specific data in F for GC. */
14941 mark_cp_function_context (f
)
14942 struct function
*f
;
14944 mark_lang_function (f
->language
);
14948 lang_mark_false_label_stack (l
)
14949 struct label_node
*l
;
14951 /* C++ doesn't use false_label_stack. It better be NULL. */
14952 my_friendly_assert (l
== NULL
, 19990904);
14959 enum tree_code code
= TREE_CODE (t
);
14960 if (code
== IDENTIFIER_NODE
)
14962 struct lang_identifier
*li
= (struct lang_identifier
*) t
;
14963 struct lang_id2
*li2
= li
->x
;
14964 ggc_mark_tree (li
->namespace_bindings
);
14965 ggc_mark_tree (li
->bindings
);
14966 ggc_mark_tree (li
->class_value
);
14967 ggc_mark_tree (li
->class_template_info
);
14971 ggc_mark_tree (li2
->label_value
);
14972 ggc_mark_tree (li2
->implicit_decl
);
14973 ggc_mark_tree (li2
->error_locus
);
14976 else if (code
== CPLUS_BINDING
)
14978 if (BINDING_HAS_LEVEL_P (t
))
14979 mark_binding_level (&BINDING_LEVEL (t
));
14981 ggc_mark_tree (BINDING_SCOPE (t
));
14982 ggc_mark_tree (BINDING_VALUE (t
));
14984 else if (code
== OVERLOAD
)
14985 ggc_mark_tree (OVL_FUNCTION (t
));
14986 else if (code
== TEMPLATE_PARM_INDEX
)
14987 ggc_mark_tree (TEMPLATE_PARM_DECL (t
));
14988 else if (TREE_CODE_CLASS (code
) == 'd')
14990 struct lang_decl
*ld
= DECL_LANG_SPECIFIC (t
);
14995 if (!DECL_GLOBAL_CTOR_P (t
)
14996 && !DECL_GLOBAL_DTOR_P (t
)
14997 && !DECL_THUNK_P (t
))
14998 ggc_mark_tree (ld
->decl_flags
.u2
.access
);
14999 else if (DECL_THUNK_P (t
))
15000 ggc_mark_tree (ld
->decl_flags
.u2
.vcall_offset
);
15001 ggc_mark_tree (ld
->decl_flags
.context
);
15002 if (TREE_CODE (t
) != NAMESPACE_DECL
)
15003 ggc_mark_tree (ld
->decl_flags
.u
.template_info
);
15005 mark_binding_level (&NAMESPACE_LEVEL (t
));
15006 if (CAN_HAVE_FULL_LANG_DECL_P (t
))
15008 ggc_mark_tree (ld
->befriending_classes
);
15009 ggc_mark_tree (ld
->saved_tree
);
15010 ggc_mark_tree (ld
->cloned_function
);
15011 if (!DECL_OVERLOADED_OPERATOR_P (t
))
15012 ggc_mark_tree (ld
->u2
.vtt_parm
);
15013 if (TREE_CODE (t
) == TYPE_DECL
)
15014 ggc_mark_tree (ld
->u
.sorted_fields
);
15015 else if (TREE_CODE (t
) == FUNCTION_DECL
15016 && !DECL_PENDING_INLINE_P (t
))
15017 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t
));
15021 else if (TREE_CODE_CLASS (code
) == 't')
15023 struct lang_type
*lt
= TYPE_LANG_SPECIFIC (t
);
15025 if (lt
&& !(TREE_CODE (t
) == POINTER_TYPE
15026 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
15029 ggc_mark_tree (lt
->primary_base
);
15030 ggc_mark_tree (lt
->vfields
);
15031 ggc_mark_tree (lt
->vbases
);
15032 ggc_mark_tree (lt
->tags
);
15033 ggc_mark_tree (lt
->size
);
15034 ggc_mark_tree (lt
->pure_virtuals
);
15035 ggc_mark_tree (lt
->friend_classes
);
15036 ggc_mark_tree (lt
->rtti
);
15037 ggc_mark_tree (lt
->methods
);
15038 ggc_mark_tree (lt
->template_info
);
15039 ggc_mark_tree (lt
->befriending_classes
);
15042 /* In the case of pointer-to-member function types, the
15043 TYPE_LANG_SPECIFIC is really just a tree. */
15044 ggc_mark_tree ((tree
) lt
);