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 /* Used only for jumps to as-yet undefined labels, since jumps to
273 defined labels can have their validity checked immediately. */
275 struct named_label_use_list
277 struct binding_level
*binding_level
;
280 const char *filename_o_goto
;
282 struct named_label_use_list
*next
;
285 #define named_label_uses cp_function_chain->x_named_label_uses
287 /* A list of objects which have constructors or destructors
288 which reside in the global scope. The decl is stored in
289 the TREE_VALUE slot and the initializer is stored
290 in the TREE_PURPOSE slot. */
291 tree static_aggregates
;
295 /* A node for the integer constants 2, and 3. */
297 tree integer_two_node
, integer_three_node
;
299 /* Parsing a function declarator leaves here a chain of structure
300 and enum types declared in the parmlist. */
302 static tree last_function_parm_tags
;
304 /* Similar, for last_function_parm_tags. */
305 tree last_function_parms
;
306 static tree current_function_parm_tags
;
308 /* A list of all LABEL_DECLs in the function that have names. Here so
309 we can clear out their names' definitions at the end of the
310 function, and so we can check the validity of jumps to these labels. */
312 struct named_label_list
314 struct binding_level
*binding_level
;
320 struct named_label_list
*next
;
323 #define named_labels cp_function_chain->x_named_labels
325 /* Set to 0 at beginning of a function definition, and whenever
326 a label (case or named) is defined. Set to value of expression
327 returned from function when that value can be transformed into
328 a named return value. */
330 tree current_function_return_value
;
332 /* Nonzero means use the ISO C94 dialect of C. */
336 /* Nonzero means use the ISO C99 dialect of C. */
340 /* Nonzero means we are a hosted implementation for code shared with C. */
344 /* Nonzero means add default format_arg attributes for functions not
347 int flag_noniso_default_format_attributes
= 1;
349 /* Nonzero means give `double' the same size as `float'. */
351 extern int flag_short_double
;
353 /* Nonzero means don't recognize any builtin functions. */
355 extern int flag_no_builtin
;
357 /* Nonzero means don't recognize the non-ANSI builtin functions.
360 extern int flag_no_nonansi_builtin
;
362 /* Nonzero if we want to conserve space in the .o files. We do this
363 by putting uninitialized data and runtime initialized data into
364 .common instead of .data at the expense of not flagging multiple
366 extern int flag_conserve_space
;
368 /* C and C++ flags are in decl2.c. */
370 /* Flag used when debugging spew.c */
372 extern int spew_debug
;
374 /* A expression of value 0 with the same precision as a sizetype
376 tree signed_size_zero_node
;
378 /* The name of the anonymous namespace, throughout this translation
380 tree anonymous_namespace_name
;
382 /* The number of function bodies which we are currently processing.
383 (Zero if we are at namespace scope, one inside the body of a
384 function, two inside the body of a function in a local class, etc.) */
387 /* For each binding contour we allocate a binding_level structure
388 which records the names defined in that contour.
391 1) one for each function definition,
392 where internal declarations of the parameters appear.
393 2) one for each compound statement,
394 to record its declarations.
396 The current meaning of a name can be found by searching the levels
397 from the current one out to the global one.
399 Off to the side, may be the class_binding_level. This exists only
400 to catch class-local declarations. It is otherwise nonexistent.
402 Also there may be binding levels that catch cleanups that must be
403 run when exceptions occur. Thus, to see whether a name is bound in
404 the current scope, it is not enough to look in the
405 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
408 /* Note that the information in the `names' component of the global contour
409 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
413 /* A chain of _DECL nodes for all variables, constants, functions,
414 and typedef types. These are in the reverse of the order
415 supplied. There may be OVERLOADs on this list, too, but they
416 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
419 /* A list of structure, union and enum definitions, for looking up
421 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
422 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
423 or ENUMERAL_TYPE node.
425 C++: the TREE_VALUE nodes can be simple types for
426 component_bindings. */
429 /* A list of USING_DECL nodes. */
432 /* A list of used namespaces. PURPOSE is the namespace,
433 VALUE the common ancestor with this binding_level's namespace. */
434 tree using_directives
;
436 /* If this binding level is the binding level for a class, then
437 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
438 is the name of an entity bound in the class; the TREE_VALUE is
439 the IDENTIFIER_CLASS_VALUE before we entered the class. Thus,
440 when leaving class scope, we can restore the
441 IDENTIFIER_CLASS_VALUE by walking this list. The TREE_TYPE is
442 the DECL bound by this name in the class. */
445 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
446 is used for all binding levels. */
449 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
450 label in this scope. The TREE_PURPOSE is the previous value of
451 the IDENTIFIER_LABEL VALUE. */
452 tree shadowed_labels
;
454 /* For each level (except not the global one),
455 a chain of BLOCK nodes for all the levels
456 that were entered and exited one level down. */
459 /* The BLOCK node for this level, if one has been preallocated.
460 If 0, the BLOCK is allocated (if needed) when the level is popped. */
463 /* The _TYPE node for this level, if parm_flag == 2. */
466 /* The binding level which this one is contained in (inherits from). */
467 struct binding_level
*level_chain
;
469 /* List of decls in `names' that have incomplete
470 structure or union types. */
473 /* List of VAR_DECLS saved from a previous for statement.
474 These would be dead in ISO-conforming code, but might
475 be referenced in ARM-era code. These are stored in a
476 TREE_LIST; the TREE_VALUE is the actual declaration. */
477 tree dead_vars_from_for
;
479 /* 1 for the level that holds the parameters of a function.
480 2 for the level that holds a class declaration. */
481 unsigned parm_flag
: 2;
483 /* 1 means make a BLOCK for this level regardless of all else.
484 2 for temporary binding contours created by the compiler. */
487 /* Nonzero if this level "doesn't exist" for tags. */
488 unsigned tag_transparent
: 1;
490 /* Nonzero if this level can safely have additional
491 cleanup-needing variables added to it. */
492 unsigned more_cleanups_ok
: 1;
493 unsigned have_cleanups
: 1;
495 /* Nonzero if this scope is for storing the decls for template
496 parameters and generic decls; these decls will be discarded and
497 replaced with a TEMPLATE_DECL. */
498 unsigned template_parms_p
: 1;
500 /* Nonzero if this scope corresponds to the `<>' in a
501 `template <>' clause. Whenever this flag is set,
502 TEMPLATE_PARMS_P will be set as well. */
503 unsigned template_spec_p
: 1;
505 /* This is set for a namespace binding level. */
506 unsigned namespace_p
: 1;
508 /* True if this level is that of a for-statement where we need to
509 worry about ambiguous (ARM or ISO) scope rules. */
510 unsigned is_for_scope
: 1;
512 /* True if this level corresponds to an EH region, as for a try block.
513 Currently this information is only available while building the
515 unsigned eh_region
: 1;
517 /* Four bits left for this word. */
519 #if defined(DEBUG_CP_BINDING_LEVELS)
520 /* Binding depth at which this level began. */
521 unsigned binding_depth
;
522 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
525 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
527 /* The binding level currently in effect. */
529 #define current_binding_level \
531 ? cp_function_chain->bindings \
532 : scope_chain->bindings)
534 /* The binding level of the current class, if any. */
536 #define class_binding_level scope_chain->class_bindings
538 /* A chain of binding_level structures awaiting reuse. */
540 static struct binding_level
*free_binding_level
;
542 /* The outermost binding level, for names of file scope.
543 This is created when the compiler is started and exists
544 through the entire run. */
546 static struct binding_level
*global_binding_level
;
548 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
550 static int keep_next_level_flag
;
552 #if defined(DEBUG_CP_BINDING_LEVELS)
553 static int binding_depth
= 0;
554 static int is_class_level
= 0;
561 for (i
= 0; i
< binding_depth
*2; i
++)
564 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
566 static tree pushdecl_with_scope
PARAMS ((tree
, struct binding_level
*));
569 push_binding_level (newlevel
, tag_transparent
, keep
)
570 struct binding_level
*newlevel
;
571 int tag_transparent
, keep
;
573 /* Add this level to the front of the chain (stack) of levels that
575 bzero ((char*) newlevel
, sizeof (struct binding_level
));
576 newlevel
->level_chain
= current_binding_level
;
577 current_binding_level
= newlevel
;
578 newlevel
->tag_transparent
= tag_transparent
;
579 newlevel
->more_cleanups_ok
= 1;
581 newlevel
->keep
= keep
;
582 #if defined(DEBUG_CP_BINDING_LEVELS)
583 newlevel
->binding_depth
= binding_depth
;
585 fprintf (stderr
, "push %s level 0x%08x line %d\n",
586 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
589 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
592 /* Find the innermost enclosing class scope, and reset
593 CLASS_BINDING_LEVEL appropriately. */
596 find_class_binding_level ()
598 struct binding_level
*level
= current_binding_level
;
600 while (level
&& level
->parm_flag
!= 2)
601 level
= level
->level_chain
;
602 if (level
&& level
->parm_flag
== 2)
603 class_binding_level
= level
;
605 class_binding_level
= 0;
611 if (global_binding_level
)
613 /* Cannot pop a level, if there are none left to pop. */
614 if (current_binding_level
== global_binding_level
)
615 my_friendly_abort (123);
617 /* Pop the current level, and free the structure for reuse. */
618 #if defined(DEBUG_CP_BINDING_LEVELS)
621 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
622 (is_class_level
) ? "class" : "block",
623 current_binding_level
, lineno
);
624 if (is_class_level
!= (current_binding_level
== class_binding_level
))
627 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
630 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
632 register struct binding_level
*level
= current_binding_level
;
633 current_binding_level
= current_binding_level
->level_chain
;
634 level
->level_chain
= free_binding_level
;
635 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
636 if (level
->binding_depth
!= binding_depth
)
638 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
639 free_binding_level
= level
;
640 find_class_binding_level ();
645 suspend_binding_level ()
647 if (class_binding_level
)
648 current_binding_level
= class_binding_level
;
650 if (global_binding_level
)
652 /* Cannot suspend a level, if there are none left to suspend. */
653 if (current_binding_level
== global_binding_level
)
654 my_friendly_abort (123);
656 /* Suspend the current level. */
657 #if defined(DEBUG_CP_BINDING_LEVELS)
660 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
661 (is_class_level
) ? "class" : "block",
662 current_binding_level
, lineno
);
663 if (is_class_level
!= (current_binding_level
== class_binding_level
))
666 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
669 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
670 current_binding_level
= current_binding_level
->level_chain
;
671 find_class_binding_level ();
675 resume_binding_level (b
)
676 struct binding_level
*b
;
678 /* Resuming binding levels is meant only for namespaces,
679 and those cannot nest into classes. */
680 my_friendly_assert(!class_binding_level
, 386);
681 /* Also, resuming a non-directly nested namespace is a no-no. */
682 my_friendly_assert(b
->level_chain
== current_binding_level
, 386);
683 current_binding_level
= b
;
684 #if defined(DEBUG_CP_BINDING_LEVELS)
685 b
->binding_depth
= binding_depth
;
687 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
688 (is_class_level
) ? "class" : "block", b
, lineno
);
691 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
694 /* Create a new `struct binding_level'. */
697 struct binding_level
*
698 make_binding_level ()
701 return (struct binding_level
*) xmalloc (sizeof (struct binding_level
));
704 /* Nonzero if we are currently in the global binding level. */
709 return current_binding_level
== global_binding_level
;
712 /* Return the innermost binding level that is not for a class scope. */
714 static struct binding_level
*
715 innermost_nonclass_level ()
717 struct binding_level
*b
;
719 b
= current_binding_level
;
720 while (b
->parm_flag
== 2)
726 /* Nonzero if we are currently in a toplevel binding level. This
727 means either the global binding level or a namespace in a toplevel
728 binding level. Since there are no non-toplevel namespace levels,
729 this really means any namespace or template parameter level. We
730 also include a class whose context is toplevel. */
733 toplevel_bindings_p ()
735 struct binding_level
*b
= innermost_nonclass_level ();
737 return b
->namespace_p
|| b
->template_parms_p
;
740 /* Nonzero if this is a namespace scope, or if we are defining a class
741 which is itself at namespace scope, or whose enclosing class is
742 such a class, etc. */
745 namespace_bindings_p ()
747 struct binding_level
*b
= innermost_nonclass_level ();
749 return b
->namespace_p
;
752 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
753 unconditionally. Otherwise, use the normal logic to decide whether
754 or not to create a BLOCK. */
757 keep_next_level (keep
)
760 keep_next_level_flag
= keep
;
763 /* Nonzero if the current level needs to have a BLOCK made. */
768 return (current_binding_level
->blocks
!= NULL_TREE
769 || current_binding_level
->keep
770 || current_binding_level
->names
!= NULL_TREE
771 || (current_binding_level
->tags
!= NULL_TREE
772 && !current_binding_level
->tag_transparent
));
776 declare_namespace_level ()
778 current_binding_level
->namespace_p
= 1;
781 /* Returns non-zero if this scope was created to store template
785 template_parm_scope_p ()
787 return current_binding_level
->template_parms_p
;
790 /* Returns the kind of template specialization we are currently
791 processing, given that it's declaration contained N_CLASS_SCOPES
792 explicit scope qualifications. */
795 current_tmpl_spec_kind (n_class_scopes
)
798 int n_template_parm_scopes
= 0;
799 int seen_specialization_p
= 0;
800 int innermost_specialization_p
= 0;
801 struct binding_level
*b
;
803 /* Scan through the template parameter scopes. */
804 for (b
= current_binding_level
; b
->template_parms_p
; b
= b
->level_chain
)
806 /* If we see a specialization scope inside a parameter scope,
807 then something is wrong. That corresponds to a declaration
810 template <class T> template <> ...
812 which is always illegal since [temp.expl.spec] forbids the
813 specialization of a class member template if the enclosing
814 class templates are not explicitly specialized as well. */
815 if (b
->template_spec_p
)
817 if (n_template_parm_scopes
== 0)
818 innermost_specialization_p
= 1;
820 seen_specialization_p
= 1;
822 else if (seen_specialization_p
== 1)
823 return tsk_invalid_member_spec
;
825 ++n_template_parm_scopes
;
828 /* Handle explicit instantiations. */
829 if (processing_explicit_instantiation
)
831 if (n_template_parm_scopes
!= 0)
832 /* We've seen a template parameter list during an explicit
833 instantiation. For example:
835 template <class T> template void f(int);
837 This is erroneous. */
838 return tsk_invalid_expl_inst
;
840 return tsk_expl_inst
;
843 if (n_template_parm_scopes
< n_class_scopes
)
844 /* We've not seen enough template headers to match all the
845 specialized classes present. For example:
847 template <class T> void R<T>::S<T>::f(int);
849 This is illegal; there needs to be one set of template
850 parameters for each class. */
851 return tsk_insufficient_parms
;
852 else if (n_template_parm_scopes
== n_class_scopes
)
853 /* We're processing a non-template declaration (even though it may
854 be a member of a template class.) For example:
856 template <class T> void S<T>::f(int);
858 The `class T' maches the `S<T>', leaving no template headers
859 corresponding to the `f'. */
861 else if (n_template_parm_scopes
> n_class_scopes
+ 1)
862 /* We've got too many template headers. For example:
864 template <> template <class T> void f (T);
866 There need to be more enclosing classes. */
867 return tsk_excessive_parms
;
869 /* This must be a template. It's of the form:
871 template <class T> template <class U> void S<T>::f(U);
873 This is a specialization if the innermost level was a
874 specialization; otherwise it's just a definition of the
876 return innermost_specialization_p
? tsk_expl_spec
: tsk_template
;
880 set_class_shadows (shadows
)
883 class_binding_level
->class_shadowed
= shadows
;
886 /* Enter a new binding level.
887 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
888 not for that of tags. */
891 pushlevel (tag_transparent
)
894 struct binding_level
*newlevel
;
896 if (cfun
&& !doing_semantic_analysis_p ())
899 /* Reuse or create a struct for this binding level. */
900 #if defined(DEBUG_CP_BINDING_LEVELS)
902 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
903 if (free_binding_level
)
904 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
906 newlevel
= free_binding_level
;
907 free_binding_level
= free_binding_level
->level_chain
;
910 newlevel
= make_binding_level ();
912 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
913 GNU_xref_start_scope ((HOST_WIDE_INT
) newlevel
);
914 keep_next_level_flag
= 0;
917 /* Enter a new scope. The KIND indicates what kind of scope is being
928 case sk_template_spec
:
929 current_binding_level
->template_spec_p
= 1;
932 case sk_template_parms
:
933 current_binding_level
->template_parms_p
= 1;
937 my_friendly_abort (20000309);
941 /* Exit the current scope. */
950 note_level_for_for ()
952 current_binding_level
->is_for_scope
= 1;
955 /* Record that the current binding level represents a try block. */
960 current_binding_level
->eh_region
= 1;
963 /* For a binding between a name and an entity at a block scope,
964 this is the `struct binding_level' for the block. */
965 #define BINDING_LEVEL(NODE) \
966 (((struct tree_binding*)NODE)->scope.level)
968 /* Make DECL the innermost binding for ID. The LEVEL is the binding
969 level at which this declaration is being bound. */
972 push_binding (id
, decl
, level
)
975 struct binding_level
* level
;
979 binding
= make_node (CPLUS_BINDING
);
981 /* Now, fill in the binding information. */
982 BINDING_VALUE (binding
) = decl
;
983 BINDING_TYPE (binding
) = NULL_TREE
;
984 BINDING_LEVEL (binding
) = level
;
985 INHERITED_VALUE_BINDING_P (binding
) = 0;
986 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
987 BINDING_HAS_LEVEL_P (binding
) = 1;
989 /* And put it on the front of the list of bindings for ID. */
990 TREE_CHAIN (binding
) = IDENTIFIER_BINDING (id
);
991 IDENTIFIER_BINDING (id
) = binding
;
994 /* ID is already bound in the current scope. But, DECL is an
995 additional binding for ID in the same scope. This is the `struct
996 stat' hack whereby a non-typedef class-name or enum-name can be
997 bound at the same level as some other kind of entity. It's the
998 responsibility of the caller to check that inserting this name is
999 legal here. Returns nonzero if the new binding was successful. */
1001 add_binding (id
, decl
)
1005 tree binding
= IDENTIFIER_BINDING (id
);
1008 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
1009 /* The new name is the type name. */
1010 BINDING_TYPE (binding
) = decl
;
1011 else if (!BINDING_VALUE (binding
))
1012 /* This situation arises when push_class_level_binding moves an
1013 inherited type-binding out of the way to make room for a new
1015 BINDING_VALUE (binding
) = decl
;
1016 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
1017 && DECL_ARTIFICIAL (BINDING_VALUE (binding
)))
1019 /* The old binding was a type name. It was placed in
1020 BINDING_VALUE because it was thought, at the point it was
1021 declared, to be the only entity with such a name. Move the
1022 type name into the type slot; it is now hidden by the new
1024 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
1025 BINDING_VALUE (binding
) = decl
;
1026 INHERITED_VALUE_BINDING_P (binding
) = 0;
1028 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
1029 && TREE_CODE (decl
) == TYPE_DECL
1030 && DECL_NAME (decl
) == DECL_NAME (BINDING_VALUE (binding
))
1031 && same_type_p (TREE_TYPE (decl
),
1032 TREE_TYPE (BINDING_VALUE (binding
))))
1033 /* We have two typedef-names, both naming the same type to have
1034 the same name. This is OK because of:
1038 In a given scope, a typedef specifier can be used to redefine
1039 the name of any type declared in that scope to refer to the
1040 type to which it already refers. */
1042 /* There can be two block-scope declarations of the same variable,
1043 so long as they are `extern' declarations. */
1044 else if (TREE_CODE (decl
) == VAR_DECL
1045 && TREE_CODE (BINDING_VALUE (binding
)) == VAR_DECL
1046 && DECL_EXTERNAL (decl
)
1047 && DECL_EXTERNAL (BINDING_VALUE (binding
)))
1049 duplicate_decls (decl
, BINDING_VALUE (binding
));
1054 cp_error ("declaration of `%#D'", decl
);
1055 cp_error_at ("conflicts with previous declaration `%#D'",
1056 BINDING_VALUE (binding
));
1063 /* Add DECL to the list of things declared in B. */
1066 add_decl_to_level (decl
, b
)
1068 struct binding_level
*b
;
1070 /* We build up the list in reverse order, and reverse it later if
1072 TREE_CHAIN (decl
) = b
->names
;
1076 /* Bind DECL to ID in the current_binding_level, assumed to be a local
1077 binding level. If PUSH_USING is set in FLAGS, we know that DECL
1078 doesn't really belong to this binding level, that it got here
1079 through a using-declaration. */
1082 push_local_binding (id
, decl
, flags
)
1087 struct binding_level
*b
;
1089 /* Skip over any local classes. This makes sense if we call
1090 push_local_binding with a friend decl of a local class. */
1091 b
= current_binding_level
;
1092 while (b
->parm_flag
== 2)
1095 if (lookup_name_current_level (id
))
1097 /* Supplement the existing binding. */
1098 if (!add_binding (id
, decl
))
1099 /* It didn't work. Something else must be bound at this
1100 level. Do not add DECL to the list of things to pop
1105 /* Create a new binding. */
1106 push_binding (id
, decl
, b
);
1108 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
1109 /* We must put the OVERLOAD into a TREE_LIST since the
1110 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1111 decls that got here through a using-declaration. */
1112 decl
= build_tree_list (NULL_TREE
, decl
);
1114 /* And put DECL on the list of things declared by the current
1116 add_decl_to_level (decl
, b
);
1119 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
1120 binding was successful. */
1123 push_class_binding (id
, decl
)
1128 tree binding
= IDENTIFIER_BINDING (id
);
1131 /* Note that we declared this value so that we can issue an error if
1132 this an illegal redeclaration of a name already used for some
1134 note_name_declared_in_class (id
, decl
);
1136 if (binding
&& BINDING_LEVEL (binding
) == class_binding_level
)
1137 /* Supplement the existing binding. */
1138 result
= add_binding (id
, decl
);
1140 /* Create a new binding. */
1141 push_binding (id
, decl
, class_binding_level
);
1143 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1144 class-level declaration. Note that we do not use DECL here
1145 because of the possibility of the `struct stat' hack; if DECL is
1146 a class-name or enum-name we might prefer a field-name, or some
1148 IDENTIFIER_CLASS_VALUE (id
) = BINDING_VALUE (IDENTIFIER_BINDING (id
));
1150 /* If this is a binding from a base class, mark it as such. */
1151 binding
= IDENTIFIER_BINDING (id
);
1152 if (BINDING_VALUE (binding
) == decl
&& TREE_CODE (decl
) != TREE_LIST
)
1154 /* Any implicit typename must be from a base-class. The
1155 context for an implicit typename declaration is always
1156 the derived class in which the lookup was done, so the checks
1157 based on the context of DECL below will not trigger. */
1158 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl
))
1159 INHERITED_VALUE_BINDING_P (binding
) = 1;
1162 if (TREE_CODE (decl
) == OVERLOAD
)
1163 context
= CP_DECL_CONTEXT (OVL_CURRENT (decl
));
1166 my_friendly_assert (DECL_P (decl
), 0);
1167 context
= CP_DECL_CONTEXT (decl
);
1170 if (is_properly_derived_from (current_class_type
, context
))
1171 INHERITED_VALUE_BINDING_P (binding
) = 1;
1173 INHERITED_VALUE_BINDING_P (binding
) = 0;
1176 else if (BINDING_VALUE (binding
) == decl
)
1177 /* We only encounter a TREE_LIST when push_class_decls detects an
1178 ambiguity. Such an ambiguity can be overridden by a definition
1180 INHERITED_VALUE_BINDING_P (binding
) = 1;
1185 /* Remove the binding for DECL which should be the innermost binding
1189 pop_binding (id
, decl
)
1195 if (id
== NULL_TREE
)
1196 /* It's easiest to write the loops that call this function without
1197 checking whether or not the entities involved have names. We
1198 get here for such an entity. */
1201 /* Get the innermost binding for ID. */
1202 binding
= IDENTIFIER_BINDING (id
);
1204 /* The name should be bound. */
1205 my_friendly_assert (binding
!= NULL_TREE
, 0);
1207 /* The DECL will be either the ordinary binding or the type
1208 binding for this identifier. Remove that binding. */
1209 if (BINDING_VALUE (binding
) == decl
)
1210 BINDING_VALUE (binding
) = NULL_TREE
;
1211 else if (BINDING_TYPE (binding
) == decl
)
1212 BINDING_TYPE (binding
) = NULL_TREE
;
1214 my_friendly_abort (0);
1216 if (!BINDING_VALUE (binding
) && !BINDING_TYPE (binding
))
1217 /* We're completely done with the innermost binding for this
1218 identifier. Unhook it from the list of bindings. */
1219 IDENTIFIER_BINDING (id
) = TREE_CHAIN (binding
);
1222 /* When a label goes out of scope, check to see if that label was used
1223 in a valid manner, and issue any appropriate warnings or errors. */
1226 pop_label (label
, old_value
)
1230 if (!processing_template_decl
&& doing_semantic_analysis_p ())
1232 if (DECL_INITIAL (label
) == NULL_TREE
)
1234 cp_error_at ("label `%D' used but not defined", label
);
1235 /* Avoid crashing later. */
1236 define_label (input_filename
, 1, DECL_NAME (label
));
1238 else if (warn_unused_label
&& !TREE_USED (label
))
1239 cp_warning_at ("label `%D' defined but not used", label
);
1242 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), old_value
);
1245 /* At the end of a function, all labels declared within the function
1246 go out of scope. BLOCK is the top-level block for the
1253 struct named_label_list
*link
;
1255 /* Clear out the definitions of all label names, since their scopes
1257 for (link
= named_labels
; link
; link
= link
->next
)
1259 pop_label (link
->label_decl
, link
->old_value
);
1260 /* Put the labels into the "variables" of the top-level block,
1261 so debugger can see them. */
1262 TREE_CHAIN (link
->label_decl
) = BLOCK_VARS (block
);
1263 BLOCK_VARS (block
) = link
->label_decl
;
1266 named_labels
= NULL
;
1269 /* Exit a binding level.
1270 Pop the level off, and restore the state of the identifier-decl mappings
1271 that were in effect when this level was entered.
1273 If KEEP == 1, this level had explicit declarations, so
1274 and create a "block" (a BLOCK node) for the level
1275 to record its declarations and subblocks for symbol table output.
1277 If FUNCTIONBODY is nonzero, this level is the body of a function,
1278 so create a block as if KEEP were set and also clear out all
1281 If REVERSE is nonzero, reverse the order of decls before putting
1282 them into the BLOCK. */
1285 poplevel (keep
, reverse
, functionbody
)
1291 /* The chain of decls was accumulated in reverse order.
1292 Put it into forward order, just for cleanliness. */
1294 int tmp
= functionbody
;
1295 int real_functionbody
;
1298 tree block
= NULL_TREE
;
1300 int block_previously_created
;
1301 int leaving_for_scope
;
1303 if (cfun
&& !doing_semantic_analysis_p ())
1306 my_friendly_assert (current_binding_level
->parm_flag
!= 2,
1309 real_functionbody
= (current_binding_level
->keep
== 2
1310 ? ((functionbody
= 0), tmp
) : functionbody
);
1311 tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1312 subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1314 my_friendly_assert (!current_binding_level
->class_shadowed
,
1317 /* We used to use KEEP == 2 to indicate that the new block should go
1318 at the beginning of the list of blocks at this binding level,
1319 rather than the end. This hack is no longer used. */
1320 my_friendly_assert (keep
== 0 || keep
== 1, 0);
1322 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1323 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1324 current_binding_level
->parm_flag
,
1325 current_binding_level
->keep
);
1327 if (current_binding_level
->keep
== 1)
1330 /* Any uses of undefined labels, and any defined labels, now operate
1331 under constraints of next binding contour. */
1332 if (cfun
&& !functionbody
)
1334 struct binding_level
*level_chain
;
1335 level_chain
= current_binding_level
->level_chain
;
1338 struct named_label_use_list
*uses
;
1339 struct named_label_list
*labels
;
1340 for (labels
= named_labels
; labels
; labels
= labels
->next
)
1341 if (labels
->binding_level
== current_binding_level
)
1344 if (current_binding_level
->eh_region
)
1345 labels
->eh_region
= 1;
1346 for (decl
= labels
->names_in_scope
; decl
;
1347 decl
= TREE_CHAIN (decl
))
1348 if (decl_jump_unsafe (decl
))
1349 labels
->bad_decls
= tree_cons (NULL_TREE
, decl
,
1351 labels
->binding_level
= level_chain
;
1352 labels
->names_in_scope
= level_chain
->names
;
1355 for (uses
= named_label_uses
; uses
; uses
= uses
->next
)
1356 if (uses
->binding_level
== current_binding_level
)
1358 uses
->binding_level
= level_chain
;
1359 uses
->names_in_scope
= level_chain
->names
;
1364 /* Get the decls in the order they were written.
1365 Usually current_binding_level->names is in reverse order.
1366 But parameter decls were previously put in forward order. */
1369 current_binding_level
->names
1370 = decls
= nreverse (current_binding_level
->names
);
1372 decls
= current_binding_level
->names
;
1374 /* Output any nested inline functions within this block
1375 if they weren't already output. */
1376 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1377 if (TREE_CODE (decl
) == FUNCTION_DECL
1378 && ! TREE_ASM_WRITTEN (decl
)
1379 && DECL_INITIAL (decl
) != NULL_TREE
1380 && TREE_ADDRESSABLE (decl
)
1381 && decl_function_context (decl
) == current_function_decl
)
1383 /* If this decl was copied from a file-scope decl
1384 on account of a block-scope extern decl,
1385 propagate TREE_ADDRESSABLE to the file-scope decl. */
1386 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1387 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1390 push_function_context ();
1391 output_inline_function (decl
);
1392 pop_function_context ();
1396 /* When not in function-at-a-time mode, expand_end_bindings will
1397 warn about unused variables. But, in function-at-a-time mode
1398 expand_end_bindings is not passed the list of variables in the
1399 current scope, and therefore no warning is emitted. So, we
1400 explicitly warn here. */
1401 if (!processing_template_decl
)
1402 warn_about_unused_variables (getdecls ());
1404 /* If there were any declarations or structure tags in that level,
1405 or if this level is a function body,
1406 create a BLOCK to record them for the life of this function. */
1408 block_previously_created
= (current_binding_level
->this_block
!= NULL_TREE
);
1409 if (block_previously_created
)
1410 block
= current_binding_level
->this_block
;
1411 else if (keep
== 1 || functionbody
)
1412 block
= make_node (BLOCK
);
1413 if (block
!= NULL_TREE
)
1415 if (block_previously_created
)
1417 if (decls
|| tags
|| subblocks
)
1419 if (BLOCK_VARS (block
))
1420 warning ("internal compiler error: debugging info corrupted");
1422 BLOCK_VARS (block
) = decls
;
1424 /* We can have previous subblocks and new subblocks when
1425 doing fixup_gotos with complex cleanups. We chain the new
1426 subblocks onto the end of any pre-existing subblocks. */
1427 BLOCK_SUBBLOCKS (block
) = chainon (BLOCK_SUBBLOCKS (block
),
1433 BLOCK_VARS (block
) = decls
;
1434 BLOCK_SUBBLOCKS (block
) = subblocks
;
1438 /* In each subblock, record that this is its superior. */
1440 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1441 BLOCK_SUPERCONTEXT (link
) = block
;
1443 /* We still support the old for-scope rules, whereby the variables
1444 in a for-init statement were in scope after the for-statement
1445 ended. We only use the new rules in flag_new_for_scope is
1448 = current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1;
1450 /* Remove declarations for all the DECLs in this level. */
1451 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1453 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
1454 && DECL_NAME (link
))
1457 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link
)));
1461 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
1463 ns_binding
= NULL_TREE
;
1466 && (BINDING_LEVEL (outer_binding
)
1467 == current_binding_level
->level_chain
))
1468 /* We have something like:
1473 and we are leaving the `for' scope. There's no reason to
1474 keep the binding of the inner `i' in this case. */
1475 pop_binding (DECL_NAME (link
), link
);
1476 else if ((outer_binding
1477 && (TREE_CODE (BINDING_VALUE (outer_binding
))
1480 && TREE_CODE (ns_binding
) == TYPE_DECL
))
1481 /* Here, we have something like:
1489 We must pop the for-scope binding so we know what's a
1490 type and what isn't. */
1491 pop_binding (DECL_NAME (link
), link
);
1494 /* Mark this VAR_DECL as dead so that we can tell we left it
1495 there only for backward compatibility. */
1496 DECL_DEAD_FOR_LOCAL (link
) = 1;
1498 /* Keep track of what should of have happenned when we
1499 popped the binding. */
1500 if (outer_binding
&& BINDING_VALUE (outer_binding
))
1501 DECL_SHADOWED_FOR_VAR (link
)
1502 = BINDING_VALUE (outer_binding
);
1504 /* Add it to the list of dead variables in the next
1505 outermost binding to that we can remove these when we
1506 leave that binding. */
1507 current_binding_level
->level_chain
->dead_vars_from_for
1508 = tree_cons (NULL_TREE
, link
,
1509 current_binding_level
->level_chain
->
1510 dead_vars_from_for
);
1512 /* Although we don't pop the CPLUS_BINDING, we do clear
1513 its BINDING_LEVEL since the level is going away now. */
1514 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link
)))
1520 /* Remove the binding. */
1522 if (TREE_CODE (decl
) == TREE_LIST
)
1523 decl
= TREE_VALUE (decl
);
1525 pop_binding (DECL_NAME (decl
), decl
);
1526 else if (TREE_CODE (decl
) == OVERLOAD
)
1527 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
1529 my_friendly_abort (0);
1533 /* Remove declarations for any `for' variables from inner scopes
1534 that we kept around. */
1535 for (link
= current_binding_level
->dead_vars_from_for
;
1536 link
; link
= TREE_CHAIN (link
))
1537 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
1539 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1540 for (link
= current_binding_level
->type_shadowed
;
1541 link
; link
= TREE_CHAIN (link
))
1542 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1544 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1545 for (link
= current_binding_level
->shadowed_labels
;
1547 link
= TREE_CHAIN (link
))
1548 pop_label (TREE_VALUE (link
), TREE_PURPOSE (link
));
1550 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1551 list if a `using' declaration put them there. The debugging
1552 back-ends won't understand OVERLOAD, so we remove them here.
1553 Because the BLOCK_VARS are (temporarily) shared with
1554 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1555 popped all the bindings. */
1560 for (d
= &BLOCK_VARS (block
); *d
; )
1562 if (TREE_CODE (*d
) == TREE_LIST
)
1563 *d
= TREE_CHAIN (*d
);
1565 d
= &TREE_CHAIN (*d
);
1569 /* If the level being exited is the top level of a function,
1570 check over all the labels. */
1573 /* Since this is the top level block of a function, the vars are
1574 the function's parameters. Don't leave them in the BLOCK
1575 because they are found in the FUNCTION_DECL instead. */
1576 BLOCK_VARS (block
) = 0;
1580 tmp
= current_binding_level
->keep
;
1582 pop_binding_level ();
1584 DECL_INITIAL (current_function_decl
) = block
;
1587 if (!block_previously_created
)
1588 current_binding_level
->blocks
1589 = chainon (current_binding_level
->blocks
, block
);
1591 /* If we did not make a block for the level just exited,
1592 any blocks made for inner levels
1593 (since they cannot be recorded as subblocks in that level)
1594 must be carried forward so they will later become subblocks
1595 of something else. */
1597 current_binding_level
->blocks
1598 = chainon (current_binding_level
->blocks
, subblocks
);
1600 /* Each and every BLOCK node created here in `poplevel' is important
1601 (e.g. for proper debugging information) so if we created one
1602 earlier, mark it as "used". */
1604 TREE_USED (block
) = 1;
1606 /* Take care of compiler's internal binding structures. */
1612 = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/1);
1615 SCOPE_STMT_BLOCK (TREE_PURPOSE (scope_stmts
)) = block
;
1616 SCOPE_STMT_BLOCK (TREE_VALUE (scope_stmts
)) = block
;
1619 block
= poplevel (keep
, reverse
, functionbody
);
1625 /* Delete the node BLOCK from the current binding level.
1626 This is used for the block inside a stmt expr ({...})
1627 so that the block can be reinserted where appropriate. */
1630 delete_block (block
)
1634 if (current_binding_level
->blocks
== block
)
1635 current_binding_level
->blocks
= TREE_CHAIN (block
);
1636 for (t
= current_binding_level
->blocks
; t
;)
1638 if (TREE_CHAIN (t
) == block
)
1639 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1643 TREE_CHAIN (block
) = NULL_TREE
;
1644 /* Clear TREE_USED which is always set by poplevel.
1645 The flag is set again if insert_block is called. */
1646 TREE_USED (block
) = 0;
1649 /* Insert BLOCK at the end of the list of subblocks of the
1650 current binding level. This is used when a BIND_EXPR is expanded,
1651 to handle the BLOCK node inside the BIND_EXPR. */
1654 insert_block (block
)
1657 TREE_USED (block
) = 1;
1658 current_binding_level
->blocks
1659 = chainon (current_binding_level
->blocks
, block
);
1662 /* Set the BLOCK node for the innermost scope
1663 (the one we are currently in). */
1667 register tree block
;
1669 current_binding_level
->this_block
= block
;
1672 /* Do a pushlevel for class declarations. */
1677 register struct binding_level
*newlevel
;
1679 /* Reuse or create a struct for this binding level. */
1680 #if defined(DEBUG_CP_BINDING_LEVELS)
1682 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1683 if (free_binding_level
)
1684 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1686 newlevel
= free_binding_level
;
1687 free_binding_level
= free_binding_level
->level_chain
;
1690 newlevel
= make_binding_level ();
1692 #if defined(DEBUG_CP_BINDING_LEVELS)
1694 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1696 push_binding_level (newlevel
, 0, 0);
1698 class_binding_level
= current_binding_level
;
1699 class_binding_level
->parm_flag
= 2;
1700 class_binding_level
->this_class
= current_class_type
;
1703 /* ...and a poplevel for class declarations. */
1708 register struct binding_level
*level
= class_binding_level
;
1711 my_friendly_assert (level
!= 0, 354);
1713 /* If we're leaving a toplevel class, don't bother to do the setting
1714 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1715 shouldn't even be used when current_class_type isn't set, and second,
1716 if we don't touch it here, we're able to use the cache effect if the
1717 next time we're entering a class scope, it is the same class. */
1718 if (current_class_depth
!= 1)
1720 struct binding_level
* b
;
1722 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1723 for (shadowed
= level
->class_shadowed
;
1725 shadowed
= TREE_CHAIN (shadowed
))
1726 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = NULL_TREE
;
1728 /* Find the next enclosing class, and recreate
1729 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1730 b
= level
->level_chain
;
1731 while (b
&& b
->parm_flag
!= 2)
1735 for (shadowed
= b
->class_shadowed
;
1737 shadowed
= TREE_CHAIN (shadowed
))
1741 t
= IDENTIFIER_BINDING (TREE_PURPOSE (shadowed
));
1742 while (t
&& BINDING_LEVEL (t
) != b
)
1746 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
))
1747 = BINDING_VALUE (t
);
1751 /* Remember to save what IDENTIFIER's were bound in this scope so we
1752 can recover from cache misses. */
1754 previous_class_type
= current_class_type
;
1755 previous_class_values
= class_binding_level
->class_shadowed
;
1757 for (shadowed
= level
->type_shadowed
;
1759 shadowed
= TREE_CHAIN (shadowed
))
1760 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1762 /* Remove the bindings for all of the class-level declarations. */
1763 for (shadowed
= level
->class_shadowed
;
1765 shadowed
= TREE_CHAIN (shadowed
))
1766 pop_binding (TREE_PURPOSE (shadowed
), TREE_TYPE (shadowed
));
1768 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1769 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1770 class_binding_level
->parm_flag
,
1771 class_binding_level
->keep
);
1773 /* Now, pop out of the binding level which we created up in the
1774 `pushlevel_class' routine. */
1775 #if defined(DEBUG_CP_BINDING_LEVELS)
1777 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1779 pop_binding_level ();
1782 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1783 for any names in enclosing classes. */
1786 clear_identifier_class_values ()
1790 if (!class_binding_level
)
1793 for (t
= class_binding_level
->class_shadowed
;
1796 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
1799 /* Returns non-zero if T is a virtual function table. */
1802 vtable_decl_p (t
, data
)
1804 void *data ATTRIBUTE_UNUSED
;
1806 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
1809 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1813 vtype_decl_p (t
, data
)
1815 void *data ATTRIBUTE_UNUSED
;
1817 return (TREE_CODE (t
) == TYPE_DECL
1818 && TREE_CODE (TREE_TYPE (t
)) == RECORD_TYPE
1819 && TYPE_POLYMORPHIC_P (TREE_TYPE (t
)));
1822 /* Return the declarations that are members of the namespace NS. */
1825 cp_namespace_decls (ns
)
1828 return NAMESPACE_LEVEL (ns
)->names
;
1831 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1832 itself, calling F for each. The DATA is passed to F as well. */
1835 walk_namespaces_r (namespace, f
, data
)
1837 walk_namespaces_fn f
;
1843 result
|= (*f
) (namespace, data
);
1845 for (current
= cp_namespace_decls (namespace);
1847 current
= TREE_CHAIN (current
))
1849 if (TREE_CODE (current
) != NAMESPACE_DECL
1850 || DECL_NAMESPACE_ALIAS (current
))
1852 if (!DECL_LANG_SPECIFIC (current
))
1855 my_friendly_assert (current
== std_node
, 393);
1859 /* We found a namespace. */
1860 result
|= walk_namespaces_r (current
, f
, data
);
1866 /* Walk all the namespaces, calling F for each. The DATA is passed to
1870 walk_namespaces (f
, data
)
1871 walk_namespaces_fn f
;
1874 return walk_namespaces_r (global_namespace
, f
, data
);
1877 struct walk_globals_data
{
1878 walk_globals_pred p
;
1883 /* Walk the global declarations in NAMESPACE. Whenever one is found
1884 for which P returns non-zero, call F with its address. If any call
1885 to F returns a non-zero value, return a non-zero value. */
1888 walk_globals_r (namespace, data
)
1892 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1893 walk_globals_pred p
= wgd
->p
;
1894 walk_globals_fn f
= wgd
->f
;
1895 void *d
= wgd
->data
;
1899 t
= &NAMESPACE_LEVEL (namespace)->names
;
1906 result
|= (*f
) (t
, d
);
1908 /* If F changed *T, then *T still points at the next item to
1911 t
= &TREE_CHAIN (*t
);
1917 /* Walk the global declarations. Whenever one is found for which P
1918 returns non-zero, call F with its address. If any call to F
1919 returns a non-zero value, return a non-zero value. */
1922 walk_globals (p
, f
, data
)
1923 walk_globals_pred p
;
1927 struct walk_globals_data wgd
;
1932 return walk_namespaces (walk_globals_r
, &wgd
);
1935 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1936 DATA is non-NULL, this is the last time we will call
1937 wrapup_global_declarations for this NAMESPACE. */
1940 wrapup_globals_for_namespace (namespace, data
)
1944 tree globals
= cp_namespace_decls (namespace);
1945 int len
= list_length (globals
);
1946 tree
*vec
= (tree
*) alloca (sizeof (tree
) * len
);
1950 int last_time
= (data
!= 0);
1952 if (last_time
&& namespace == global_namespace
)
1953 /* Let compile_file handle the global namespace. */
1956 /* Process the decls in reverse order--earliest first.
1957 Put them into VEC from back to front, then take out from front. */
1959 for (i
= 0, decl
= globals
; i
< len
; i
++, decl
= TREE_CHAIN (decl
))
1961 /* Pretend we've output an unused static variable. This ensures
1962 that the toplevel __FUNCTION__ etc won't be emitted, unless
1964 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_ARTIFICIAL (decl
)
1965 && !TREE_PUBLIC (decl
) && !TREE_USED (decl
))
1967 TREE_ASM_WRITTEN (decl
) = 1;
1968 DECL_IGNORED_P (decl
) = 1;
1970 vec
[len
- i
- 1] = decl
;
1975 check_global_declarations (vec
, len
);
1979 /* Temporarily mark vtables as external. That prevents
1980 wrapup_global_declarations from writing them out; we must process
1981 them ourselves in finish_vtable_vardecl. */
1982 for (i
= 0; i
< len
; ++i
)
1983 if (vtable_decl_p (vec
[i
], /*data=*/0) && !DECL_EXTERNAL (vec
[i
]))
1985 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 1;
1986 DECL_EXTERNAL (vec
[i
]) = 1;
1989 /* Write out any globals that need to be output. */
1990 result
= wrapup_global_declarations (vec
, len
);
1992 /* Undo the hack to DECL_EXTERNAL above. */
1993 for (i
= 0; i
< len
; ++i
)
1994 if (vtable_decl_p (vec
[i
], /*data=*/0)
1995 && DECL_NOT_REALLY_EXTERN (vec
[i
]))
1997 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 0;
1998 DECL_EXTERNAL (vec
[i
]) = 0;
2005 /* Mark ARG (which is really a struct binding_level **) for GC. */
2008 mark_binding_level (arg
)
2011 struct binding_level
*lvl
= *(struct binding_level
**)arg
;
2013 for (; lvl
; lvl
= lvl
->level_chain
)
2015 ggc_mark_tree (lvl
->names
);
2016 ggc_mark_tree (lvl
->tags
);
2017 ggc_mark_tree (lvl
->usings
);
2018 ggc_mark_tree (lvl
->using_directives
);
2019 ggc_mark_tree (lvl
->class_shadowed
);
2020 ggc_mark_tree (lvl
->type_shadowed
);
2021 ggc_mark_tree (lvl
->shadowed_labels
);
2022 ggc_mark_tree (lvl
->blocks
);
2023 ggc_mark_tree (lvl
->this_block
);
2024 ggc_mark_tree (lvl
->this_class
);
2025 ggc_mark_tree (lvl
->incomplete
);
2026 ggc_mark_tree (lvl
->dead_vars_from_for
);
2031 mark_named_label_lists (labs
, uses
)
2035 struct named_label_list
*l
= *(struct named_label_list
**)labs
;
2036 struct named_label_use_list
*u
= *(struct named_label_use_list
**)uses
;
2038 for (; l
; l
= l
->next
)
2041 mark_binding_level (l
->binding_level
);
2042 ggc_mark_tree (l
->old_value
);
2043 ggc_mark_tree (l
->label_decl
);
2044 ggc_mark_tree (l
->bad_decls
);
2047 for (; u
; u
= u
->next
)
2051 /* For debugging. */
2052 static int no_print_functions
= 0;
2053 static int no_print_builtins
= 0;
2056 print_binding_level (lvl
)
2057 struct binding_level
*lvl
;
2061 fprintf (stderr
, " blocks=");
2062 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
2063 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
2064 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
2065 if (lvl
->tag_transparent
)
2066 fprintf (stderr
, " tag-transparent");
2067 if (lvl
->more_cleanups_ok
)
2068 fprintf (stderr
, " more-cleanups-ok");
2069 if (lvl
->have_cleanups
)
2070 fprintf (stderr
, " have-cleanups");
2071 fprintf (stderr
, "\n");
2074 fprintf (stderr
, " names:\t");
2075 /* We can probably fit 3 names to a line? */
2076 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
2078 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
2080 if (no_print_builtins
2081 && (TREE_CODE (t
) == TYPE_DECL
)
2082 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
2085 /* Function decls tend to have longer names. */
2086 if (TREE_CODE (t
) == FUNCTION_DECL
)
2093 fprintf (stderr
, "\n\t");
2096 print_node_brief (stderr
, "", t
, 0);
2097 if (t
== error_mark_node
)
2101 fprintf (stderr
, "\n");
2105 fprintf (stderr
, " tags:\t");
2107 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
2109 if (TREE_PURPOSE (t
) == NULL_TREE
)
2111 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2118 fprintf (stderr
, "\n\t");
2121 if (TREE_PURPOSE (t
) == NULL_TREE
)
2123 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
2124 fprintf (stderr
, ">");
2126 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2127 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2130 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
2131 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2132 fprintf (stderr
, ">");
2136 fprintf (stderr
, "\n");
2138 if (lvl
->class_shadowed
)
2140 fprintf (stderr
, " class-shadowed:");
2141 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
2143 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2145 fprintf (stderr
, "\n");
2147 if (lvl
->type_shadowed
)
2149 fprintf (stderr
, " type-shadowed:");
2150 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2152 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2154 fprintf (stderr
, "\n");
2159 print_other_binding_stack (stack
)
2160 struct binding_level
*stack
;
2162 struct binding_level
*level
;
2163 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
2165 fprintf (stderr
, "binding level ");
2166 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
2167 fprintf (stderr
, "\n");
2168 print_binding_level (level
);
2173 print_binding_stack ()
2175 struct binding_level
*b
;
2176 fprintf (stderr
, "current_binding_level=");
2177 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
2178 fprintf (stderr
, "\nclass_binding_level=");
2179 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
2180 fprintf (stderr
, "\nglobal_binding_level=");
2181 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
2182 fprintf (stderr
, "\n");
2183 if (class_binding_level
)
2185 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
2186 if (b
== current_binding_level
)
2189 b
= class_binding_level
;
2191 b
= current_binding_level
;
2194 b
= current_binding_level
;
2195 print_other_binding_stack (b
);
2196 fprintf (stderr
, "global:\n");
2197 print_binding_level (global_binding_level
);
2200 /* Namespace binding access routines: The namespace_bindings field of
2201 the identifier is polymorphic, with three possible values:
2202 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2203 indicating the BINDING_VALUE of global_namespace. */
2205 /* Check whether the a binding for the name to scope is known.
2206 Assumes that the bindings of the name are already a list
2207 of bindings. Returns the binding found, or NULL_TREE. */
2210 find_binding (name
, scope
)
2214 tree iter
, prev
= NULL_TREE
;
2216 scope
= ORIGINAL_NAMESPACE (scope
);
2218 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
2219 iter
= TREE_CHAIN (iter
))
2221 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
2222 if (BINDING_SCOPE (iter
) == scope
)
2224 /* Move binding found to the front of the list, so
2225 subsequent lookups will find it faster. */
2228 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
2229 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
2230 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
2239 /* Always returns a binding for name in scope. If the
2240 namespace_bindings is not a list, convert it to one first.
2241 If no binding is found, make a new one. */
2244 binding_for_name (name
, scope
)
2248 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2251 scope
= ORIGINAL_NAMESPACE (scope
);
2253 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
2255 /* Get rid of optimization for global scope. */
2256 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
2257 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
2258 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2260 if (b
&& (result
= find_binding (name
, scope
)))
2262 /* Not found, make a new one. */
2263 result
= make_node (CPLUS_BINDING
);
2264 TREE_CHAIN (result
) = b
;
2265 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2266 BINDING_SCOPE (result
) = scope
;
2267 BINDING_TYPE (result
) = NULL_TREE
;
2268 BINDING_VALUE (result
) = NULL_TREE
;
2272 /* Return the binding value for name in scope, considering that
2273 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2276 namespace_binding (name
, scope
)
2280 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2283 if (scope
== NULL_TREE
)
2284 scope
= global_namespace
;
2285 if (TREE_CODE (b
) != CPLUS_BINDING
)
2286 return (scope
== global_namespace
) ? b
: NULL_TREE
;
2287 name
= find_binding (name
,scope
);
2288 if (name
== NULL_TREE
)
2290 return BINDING_VALUE (name
);
2293 /* Set the binding value for name in scope. If modifying the binding
2294 of global_namespace is attempted, try to optimize it. */
2297 set_namespace_binding (name
, scope
, val
)
2304 if (scope
== NULL_TREE
)
2305 scope
= global_namespace
;
2307 if (scope
== global_namespace
)
2309 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2310 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
2312 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
2316 b
= binding_for_name (name
, scope
);
2317 BINDING_VALUE (b
) = val
;
2320 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2321 select a name that is unique to this compilation unit. */
2324 push_namespace (name
)
2329 int implicit_use
= 0;
2331 if (!global_namespace
)
2333 /* This must be ::. */
2334 my_friendly_assert (name
== get_identifier ("::"), 377);
2339 /* The name of anonymous namespace is unique for the translation
2341 if (!anonymous_namespace_name
)
2342 anonymous_namespace_name
= get_file_function_name ('N');
2343 name
= anonymous_namespace_name
;
2344 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2346 /* Reopening anonymous namespace. */
2350 else if (current_namespace
== global_namespace
2351 && name
== DECL_NAME (std_node
))
2358 /* Check whether this is an extended namespace definition. */
2359 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2360 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
2363 if (DECL_NAMESPACE_ALIAS (d
))
2365 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2366 d
, DECL_NAMESPACE_ALIAS (d
));
2367 d
= DECL_NAMESPACE_ALIAS (d
);
2374 /* Make a new namespace, binding the name to it. */
2375 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
2376 /* The global namespace is not pushed, and the global binding
2377 level is set elsewhere. */
2380 DECL_CONTEXT (d
) = FROB_CONTEXT (current_namespace
);
2383 declare_namespace_level ();
2384 NAMESPACE_LEVEL (d
) = current_binding_level
;
2388 resume_binding_level (NAMESPACE_LEVEL (d
));
2391 do_using_directive (d
);
2392 /* Enter the name space. */
2393 current_namespace
= d
;
2396 /* Pop from the scope of the current namespace. */
2401 if (current_namespace
== global_namespace
)
2403 my_friendly_assert (in_std
>0, 980421);
2407 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
2408 /* The binding level is not popped, as it might be re-opened later. */
2409 suspend_binding_level ();
2412 /* Push into the scope of the namespace NS, even if it is deeply
2413 nested within another namespace. */
2416 push_nested_namespace (ns
)
2419 if (ns
== global_namespace
)
2420 push_to_top_level ();
2423 push_nested_namespace (CP_DECL_CONTEXT (ns
));
2424 push_namespace (DECL_NAME (ns
));
2428 /* Pop back from the scope of the namespace NS, which was previously
2429 entered with push_nested_namespace. */
2432 pop_nested_namespace (ns
)
2435 while (ns
!= global_namespace
)
2438 ns
= CP_DECL_CONTEXT (ns
);
2441 pop_from_top_level ();
2445 /* Subroutines for reverting temporarily to top-level for instantiation
2446 of templates and such. We actually need to clear out the class- and
2447 local-value slots of all identifiers, so that only the global values
2448 are at all visible. Simply setting current_binding_level to the global
2449 scope isn't enough, because more binding levels may be pushed. */
2450 struct saved_scope
*scope_chain
;
2452 /* Mark ST for GC. */
2456 struct stmt_tree
*st
;
2458 ggc_mark_tree (st
->x_last_stmt
);
2459 ggc_mark_tree (st
->x_last_expr_type
);
2462 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2465 mark_saved_scope (arg
)
2468 struct saved_scope
*t
= *(struct saved_scope
**)arg
;
2471 mark_binding_level (&t
->class_bindings
);
2472 ggc_mark_tree (t
->old_bindings
);
2473 ggc_mark_tree (t
->old_namespace
);
2474 ggc_mark_tree (t
->class_name
);
2475 ggc_mark_tree (t
->class_type
);
2476 ggc_mark_tree (t
->access_specifier
);
2477 ggc_mark_tree (t
->function_decl
);
2479 ggc_mark_tree_varray (t
->lang_base
);
2480 ggc_mark_tree (t
->lang_name
);
2481 ggc_mark_tree (t
->x_function_parms
);
2482 ggc_mark_tree (t
->template_parms
);
2483 ggc_mark_tree (t
->x_previous_class_type
);
2484 ggc_mark_tree (t
->x_previous_class_values
);
2485 ggc_mark_tree (t
->x_saved_tree
);
2486 ggc_mark_tree (t
->incomplete
);
2487 ggc_mark_tree (t
->lookups
);
2489 mark_stmt_tree (&t
->x_stmt_tree
);
2490 mark_binding_level (&t
->bindings
);
2496 store_bindings (names
, old_bindings
)
2497 tree names
, old_bindings
;
2500 for (t
= names
; t
; t
= TREE_CHAIN (t
))
2502 tree binding
, t1
, id
;
2504 if (TREE_CODE (t
) == TREE_LIST
)
2505 id
= TREE_PURPOSE (t
);
2510 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2511 we have no IDENTIFIER_BINDING if we have left the class
2512 scope, but cached the class-level declarations. */
2513 || !(IDENTIFIER_BINDING (id
) || IDENTIFIER_CLASS_VALUE (id
)))
2516 for (t1
= old_bindings
; t1
; t1
= TREE_CHAIN (t1
))
2517 if (TREE_VEC_ELT (t1
, 0) == id
)
2520 binding
= make_tree_vec (4);
2524 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
2525 TREE_VEC_ELT (binding
, 0) = id
;
2526 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
2527 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_BINDING (id
);
2528 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
2529 IDENTIFIER_BINDING (id
) = NULL_TREE
;
2530 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
2532 TREE_CHAIN (binding
) = old_bindings
;
2533 old_bindings
= binding
;
2537 return old_bindings
;
2541 maybe_push_to_top_level (pseudo
)
2544 struct saved_scope
*s
;
2545 struct binding_level
*b
;
2549 s
= (struct saved_scope
*) xcalloc (1, sizeof (struct saved_scope
));
2551 b
= scope_chain
? current_binding_level
: 0;
2553 /* If we're in the middle of some function, save our state. */
2557 push_function_context_to (NULL_TREE
);
2562 old_bindings
= NULL_TREE
;
2563 if (scope_chain
&& previous_class_type
)
2564 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
2566 /* Have to include global_binding_level, because class-level decls
2567 aren't listed anywhere useful. */
2568 for (; b
; b
= b
->level_chain
)
2572 /* Template IDs are inserted into the global level. If they were
2573 inserted into namespace level, finish_file wouldn't find them
2574 when doing pending instantiations. Therefore, don't stop at
2575 namespace level, but continue until :: . */
2576 if (b
== global_binding_level
|| (pseudo
&& b
->template_parms_p
))
2579 old_bindings
= store_bindings (b
->names
, old_bindings
);
2580 /* We also need to check class_shadowed to save class-level type
2581 bindings, since pushclass doesn't fill in b->names. */
2582 if (b
->parm_flag
== 2)
2583 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2585 /* Unwind type-value slots back to top level. */
2586 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2587 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2589 s
->prev
= scope_chain
;
2590 s
->old_bindings
= old_bindings
;
2592 s
->need_pop_function_context
= need_pop
;
2593 s
->function_decl
= current_function_decl
;
2596 current_function_decl
= NULL_TREE
;
2597 VARRAY_TREE_INIT (current_lang_base
, 10, "current_lang_base");
2598 current_lang_stack
= &VARRAY_TREE (current_lang_base
, 0);
2599 current_lang_name
= lang_name_cplusplus
;
2600 current_namespace
= global_namespace
;
2604 push_to_top_level ()
2606 maybe_push_to_top_level (0);
2610 pop_from_top_level ()
2612 struct saved_scope
*s
= scope_chain
;
2615 /* Clear out class-level bindings cache. */
2616 if (previous_class_type
)
2617 invalidate_class_lookup_cache ();
2619 VARRAY_FREE (current_lang_base
);
2621 scope_chain
= s
->prev
;
2622 for (t
= s
->old_bindings
; t
; t
= TREE_CHAIN (t
))
2624 tree id
= TREE_VEC_ELT (t
, 0);
2627 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2628 IDENTIFIER_BINDING (id
) = TREE_VEC_ELT (t
, 2);
2629 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2633 /* If we were in the middle of compiling a function, restore our
2635 if (s
->need_pop_function_context
)
2636 pop_function_context_from (NULL_TREE
);
2637 current_function_decl
= s
->function_decl
;
2642 /* Push a definition of struct, union or enum tag "name".
2643 into binding_level "b". "type" should be the type node,
2644 We assume that the tag "name" is not already defined.
2646 Note that the definition may really be just a forward reference.
2647 In that case, the TYPE_SIZE will be a NULL_TREE.
2649 C++ gratuitously puts all these tags in the name space. */
2651 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2652 record the shadowed value for this binding contour. TYPE is
2653 the type that ID maps to. */
2656 set_identifier_type_value_with_scope (id
, type
, b
)
2659 struct binding_level
*b
;
2661 if (!b
->namespace_p
)
2663 /* Shadow the marker, not the real thing, so that the marker
2664 gets restored later. */
2665 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2667 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2671 tree binding
= binding_for_name (id
, current_namespace
);
2672 BINDING_TYPE (binding
) = type
;
2673 /* Store marker instead of real type. */
2674 type
= global_type_node
;
2676 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2679 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2682 set_identifier_type_value (id
, type
)
2686 set_identifier_type_value_with_scope (id
, type
, current_binding_level
);
2689 /* Return the type associated with id. */
2692 identifier_type_value (id
)
2695 /* There is no type with that name, anywhere. */
2696 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2698 /* This is not the type marker, but the real thing. */
2699 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2700 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2701 /* Have to search for it. It must be on the global level, now.
2702 Ask lookup_name not to return non-types. */
2703 id
= lookup_name_real (id
, 2, 1, 0);
2705 return TREE_TYPE (id
);
2709 /* Pop off extraneous binding levels left over due to syntax errors.
2711 We don't pop past namespaces, as they might be valid. */
2716 #ifdef DEBUG_CP_BINDING_LEVELS
2717 fprintf (stderr
, "XXX entering pop_everything ()\n");
2719 while (!toplevel_bindings_p ())
2721 if (current_binding_level
->parm_flag
== 2)
2722 pop_nested_class ();
2726 #ifdef DEBUG_CP_BINDING_LEVELS
2727 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2731 /* The type TYPE is being declared. If it is a class template, or a
2732 specialization of a class template, do any processing required and
2733 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2734 being declared a friend. B is the binding level at which this TYPE
2737 Returns the TYPE_DECL for TYPE, which may have been altered by this
2741 maybe_process_template_type_declaration (type
, globalize
, b
)
2744 struct binding_level
* b
;
2746 tree decl
= TYPE_NAME (type
);
2748 if (processing_template_parmlist
)
2749 /* You can't declare a new template type in a template parameter
2750 list. But, you can declare a non-template type:
2752 template <class A*> struct S;
2754 is a forward-declaration of `A'. */
2758 maybe_check_template_type (type
);
2760 my_friendly_assert (IS_AGGR_TYPE (type
)
2761 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2764 if (processing_template_decl
)
2766 /* This may change after the call to
2767 push_template_decl_real, but we want the original value. */
2768 tree name
= DECL_NAME (decl
);
2770 decl
= push_template_decl_real (decl
, globalize
);
2771 /* If the current binding level is the binding level for the
2772 template parameters (see the comment in
2773 begin_template_parm_list) and the enclosing level is a class
2774 scope, and we're not looking at a friend, push the
2775 declaration of the member class into the class scope. In the
2776 friend case, push_template_decl will already have put the
2777 friend into global scope, if appropriate. */
2778 if (TREE_CODE (type
) != ENUMERAL_TYPE
2779 && !globalize
&& b
->template_parms_p
2780 && b
->level_chain
->parm_flag
== 2)
2782 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2783 /* Put this tag on the list of tags for the class, since
2784 that won't happen below because B is not the class
2785 binding level, but is instead the pseudo-global level. */
2786 b
->level_chain
->tags
=
2787 tree_cons (name
, type
, b
->level_chain
->tags
);
2788 if (!COMPLETE_TYPE_P (current_class_type
))
2789 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2797 /* In C++, you don't have to write `struct S' to refer to `S'; you
2798 can just use `S'. We accomplish this by creating a TYPE_DECL as
2799 if the user had written `typedef struct S S'. Create and return
2800 the TYPE_DECL for TYPE. */
2803 create_implicit_typedef (name
, type
)
2809 decl
= build_decl (TYPE_DECL
, name
, type
);
2810 DECL_ARTIFICIAL (decl
) = 1;
2811 /* There are other implicit type declarations, like the one *within*
2812 a class that allows you to write `S::S'. We must distinguish
2814 SET_DECL_IMPLICIT_TYPEDEF_P (decl
);
2815 TYPE_NAME (type
) = decl
;
2820 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2821 Normally put it into the inner-most non-tag-transparent scope,
2822 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2823 The latter is needed for implicit declarations. */
2826 pushtag (name
, type
, globalize
)
2830 register struct binding_level
*b
;
2832 b
= current_binding_level
;
2833 while (b
->tag_transparent
2834 || (globalize
&& b
->parm_flag
== 2))
2837 b
->tags
= tree_cons (name
, type
, b
->tags
);
2841 /* Do C++ gratuitous typedefing. */
2842 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2844 register tree d
= NULL_TREE
;
2846 tree context
= TYPE_CONTEXT (type
);
2850 tree cs
= current_scope ();
2854 else if (cs
!= NULL_TREE
&& TYPE_P (cs
))
2855 /* When declaring a friend class of a local class, we want
2856 to inject the newly named class into the scope
2857 containing the local class, not the namespace scope. */
2858 context
= decl_function_context (get_type_decl (cs
));
2861 context
= current_namespace
;
2863 if ((b
->template_parms_p
&& b
->level_chain
->parm_flag
== 2)
2864 || b
->parm_flag
== 2)
2867 if (current_lang_name
== lang_name_java
)
2868 TYPE_FOR_JAVA (type
) = 1;
2870 d
= create_implicit_typedef (name
, type
);
2871 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2873 set_identifier_type_value_with_scope (name
, type
, b
);
2875 d
= maybe_process_template_type_declaration (type
,
2878 if (b
->parm_flag
== 2)
2880 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2881 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2882 class. But if it's a member template class, we
2883 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2885 finish_member_declaration (d
);
2887 pushdecl_class_level (d
);
2890 d
= pushdecl_with_scope (d
, b
);
2892 if (ANON_AGGRNAME_P (name
))
2893 DECL_IGNORED_P (d
) = 1;
2895 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2896 DECL_ASSEMBLER_NAME (d
) = DECL_NAME (d
);
2898 /* If this is a local class, keep track of it. We need this
2899 information for name-mangling, and so that it is possible to find
2900 all function definitions in a translation unit in a convenient
2901 way. (It's otherwise tricky to find a member function definition
2902 it's only pointed to from within a local class.) */
2903 if (TYPE_CONTEXT (type
)
2904 && TREE_CODE (TYPE_CONTEXT (type
)) == FUNCTION_DECL
2905 && !processing_template_decl
)
2906 VARRAY_PUSH_TREE (local_classes
, type
);
2908 if (!uses_template_parms (type
))
2911 DECL_ASSEMBLER_NAME (d
) = mangle_type (type
);
2913 DECL_ASSEMBLER_NAME (d
)
2914 = get_identifier (build_overload_name (type
, 1, 1));
2917 if (b
->parm_flag
== 2)
2919 if (!COMPLETE_TYPE_P (current_class_type
))
2920 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2924 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2925 /* Use the canonical TYPE_DECL for this node. */
2926 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2929 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2930 will be the tagged type we just added to the current
2931 binding level. This fake NULL-named TYPE_DECL node helps
2932 dwarfout.c to know when it needs to output a
2933 representation of a tagged type, and it also gives us a
2934 convenient place to record the "scope start" address for
2937 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2938 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2942 /* Counter used to create anonymous type names. */
2944 static int anon_cnt
= 0;
2946 /* Return an IDENTIFIER which can be used as a name for
2947 anonymous structs and unions. */
2954 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2955 return get_identifier (buf
);
2958 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2959 This keeps dbxout from getting confused. */
2964 register struct binding_level
*b
;
2966 static int last_cnt
= 0;
2968 /* Fast out if no new anon names were declared. */
2969 if (last_cnt
== anon_cnt
)
2972 b
= current_binding_level
;
2973 while (b
->tag_transparent
)
2978 /* A NULL purpose means we have already processed all tags
2979 from here to the end of the list. */
2980 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2982 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2983 TREE_PURPOSE (tags
) = NULL_TREE
;
2984 tags
= TREE_CHAIN (tags
);
2986 last_cnt
= anon_cnt
;
2989 /* Subroutine of duplicate_decls: return truthvalue of whether
2990 or not types of these decls match.
2992 For C++, we must compare the parameter list so that `int' can match
2993 `int&' in a parameter position, but `int&' is not confused with
2997 decls_match (newdecl
, olddecl
)
2998 tree newdecl
, olddecl
;
3002 if (newdecl
== olddecl
)
3005 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
3006 /* If the two DECLs are not even the same kind of thing, we're not
3007 interested in their types. */
3010 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3012 tree f1
= TREE_TYPE (newdecl
);
3013 tree f2
= TREE_TYPE (olddecl
);
3014 tree p1
= TYPE_ARG_TYPES (f1
);
3015 tree p2
= TYPE_ARG_TYPES (f2
);
3017 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
)
3018 && ! (DECL_EXTERN_C_P (newdecl
)
3019 && DECL_EXTERN_C_P (olddecl
)))
3022 if (TREE_CODE (f1
) != TREE_CODE (f2
))
3025 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
3027 if (p2
== NULL_TREE
&& DECL_EXTERN_C_P (olddecl
)
3028 && (DECL_BUILT_IN (olddecl
)
3029 #ifndef NO_IMPLICIT_EXTERN_C
3030 || (DECL_IN_SYSTEM_HEADER (newdecl
) && !DECL_CLASS_SCOPE_P (newdecl
))
3031 || (DECL_IN_SYSTEM_HEADER (olddecl
) && !DECL_CLASS_SCOPE_P (olddecl
))
3035 types_match
= self_promoting_args_p (p1
);
3036 if (p1
== void_list_node
)
3037 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
3039 #ifndef NO_IMPLICIT_EXTERN_C
3040 else if (p1
== NULL_TREE
3041 && (DECL_EXTERN_C_P (olddecl
)
3042 && DECL_IN_SYSTEM_HEADER (olddecl
)
3043 && !DECL_CLASS_SCOPE_P (olddecl
))
3044 && (DECL_EXTERN_C_P (newdecl
)
3045 && DECL_IN_SYSTEM_HEADER (newdecl
)
3046 && !DECL_CLASS_SCOPE_P (newdecl
)))
3048 types_match
= self_promoting_args_p (p2
);
3049 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
3053 types_match
= compparms (p1
, p2
);
3058 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3060 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3061 DECL_TEMPLATE_PARMS (olddecl
)))
3064 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
))
3065 != TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)))
3068 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3071 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
3072 DECL_TEMPLATE_RESULT (newdecl
));
3076 if (TREE_TYPE (newdecl
) == error_mark_node
)
3077 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
3078 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
3079 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
3080 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
3083 types_match
= comptypes (TREE_TYPE (newdecl
),
3084 TREE_TYPE (olddecl
),
3085 COMPARE_REDECLARATION
);
3091 /* If NEWDECL is `static' and an `extern' was seen previously,
3092 warn about it. OLDDECL is the previous declaration.
3094 Note that this does not apply to the C++ case of declaring
3095 a variable `extern const' and then later `const'.
3097 Don't complain about built-in functions, since they are beyond
3098 the user's control. */
3101 warn_extern_redeclared_static (newdecl
, olddecl
)
3102 tree newdecl
, olddecl
;
3104 static const char *explicit_extern_static_warning
3105 = "`%D' was declared `extern' and later `static'";
3106 static const char *implicit_extern_static_warning
3107 = "`%D' was declared implicitly `extern' and later `static'";
3111 if (TREE_CODE (newdecl
) == TYPE_DECL
3112 || TREE_CODE (newdecl
) == TEMPLATE_DECL
3113 || TREE_CODE (newdecl
) == CONST_DECL
)
3116 /* Don't get confused by static member functions; that's a different
3118 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3119 && DECL_STATIC_FUNCTION_P (newdecl
))
3122 /* If the old declaration was `static', or the new one isn't, then
3123 then everything is OK. */
3124 if (DECL_THIS_STATIC (olddecl
) || !DECL_THIS_STATIC (newdecl
))
3127 /* It's OK to declare a builtin function as `static'. */
3128 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3129 && DECL_ARTIFICIAL (olddecl
))
3132 name
= DECL_ASSEMBLER_NAME (newdecl
);
3133 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
3134 ? implicit_extern_static_warning
3135 : explicit_extern_static_warning
, newdecl
);
3136 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
3139 /* Handle when a new declaration NEWDECL has the same name as an old
3140 one OLDDECL in the same binding contour. Prints an error message
3143 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
3144 Otherwise, return 0. */
3147 duplicate_decls (newdecl
, olddecl
)
3148 tree newdecl
, olddecl
;
3150 unsigned olddecl_uid
= DECL_UID (olddecl
);
3151 int olddecl_friend
= 0, types_match
= 0;
3152 int new_defines_function
= 0;
3154 if (newdecl
== olddecl
)
3157 types_match
= decls_match (newdecl
, olddecl
);
3159 /* If either the type of the new decl or the type of the old decl is an
3160 error_mark_node, then that implies that we have already issued an
3161 error (earlier) for some bogus type specification, and in that case,
3162 it is rather pointless to harass the user with yet more error message
3163 about the same declaration, so just pretend the types match here. */
3164 if (TREE_TYPE (newdecl
) == error_mark_node
3165 || TREE_TYPE (olddecl
) == error_mark_node
)
3168 /* Check for redeclaration and other discrepancies. */
3169 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3170 && DECL_ARTIFICIAL (olddecl
))
3172 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
3174 /* If you declare a built-in or predefined function name as static,
3175 the old definition is overridden, but optionally warn this was a
3176 bad choice of name. */
3177 if (! TREE_PUBLIC (newdecl
))
3180 cp_warning ("shadowing %s function `%#D'",
3181 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3183 /* Discard the old built-in function. */
3186 /* If the built-in is not ansi, then programs can override
3187 it even globally without an error. */
3188 else if (! DECL_BUILT_IN (olddecl
))
3189 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
3193 cp_error ("declaration of `%#D'", newdecl
);
3194 cp_error ("conflicts with built-in declaration `%#D'",
3199 else if (!types_match
)
3201 if ((DECL_EXTERN_C_P (newdecl
)
3202 && DECL_EXTERN_C_P (olddecl
))
3203 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3204 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3206 /* A near match; override the builtin. */
3208 if (TREE_PUBLIC (newdecl
))
3210 cp_warning ("new declaration `%#D'", newdecl
);
3211 cp_warning ("ambiguates built-in declaration `%#D'",
3214 else if (warn_shadow
)
3215 cp_warning ("shadowing %s function `%#D'",
3216 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3220 /* Discard the old built-in function. */
3224 if (DECL_THIS_STATIC (newdecl
) && !DECL_THIS_STATIC (olddecl
))
3226 /* If a builtin function is redeclared as `static', merge
3227 the declarations, but make the original one static. */
3228 DECL_THIS_STATIC (olddecl
) = 1;
3229 TREE_PUBLIC (olddecl
) = 0;
3231 /* Make the old declaration consistent with the new one so
3232 that all remnants of the builtin-ness of this function
3233 will be banished. */
3234 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3235 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3236 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3237 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (newdecl
),
3241 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3243 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3244 && TREE_CODE (newdecl
) != TYPE_DECL
3245 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3246 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3247 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3248 && TREE_CODE (olddecl
) != TYPE_DECL
3249 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3250 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3253 /* We do nothing special here, because C++ does such nasty
3254 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3255 get shadowed, and know that if we need to find a TYPE_DECL
3256 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3257 slot of the identifier. */
3261 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3262 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3263 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3264 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3267 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
3268 if (TREE_CODE (olddecl
) == TREE_LIST
)
3269 olddecl
= TREE_VALUE (olddecl
);
3270 cp_error_at ("previous declaration of `%#D'", olddecl
);
3272 /* New decl is completely inconsistent with the old one =>
3273 tell caller to replace the old one. */
3277 else if (!types_match
)
3279 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
))
3280 /* These are certainly not duplicate declarations; they're
3281 from different scopes. */
3284 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3286 /* The name of a class template may not be declared to refer to
3287 any other template, class, function, object, namespace, value,
3288 or type in the same scope. */
3289 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3290 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3292 cp_error ("declaration of template `%#D'", newdecl
);
3293 cp_error_at ("conflicts with previous declaration `%#D'",
3296 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3297 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3298 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3299 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3300 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3301 DECL_TEMPLATE_PARMS (olddecl
)))
3303 cp_error ("new declaration `%#D'", newdecl
);
3304 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3308 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3310 if (DECL_EXTERN_C_P (newdecl
) && DECL_EXTERN_C_P (olddecl
))
3312 cp_error ("declaration of C function `%#D' conflicts with",
3314 cp_error_at ("previous declaration `%#D' here", olddecl
);
3316 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3317 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3319 cp_error ("new declaration `%#D'", newdecl
);
3320 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3326 /* Already complained about this, so don't do so again. */
3327 else if (current_class_type
== NULL_TREE
3328 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3330 cp_error ("conflicting types for `%#D'", newdecl
);
3331 cp_error_at ("previous declaration as `%#D'", olddecl
);
3334 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3335 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3336 && (!DECL_TEMPLATE_INFO (newdecl
)
3337 || (DECL_TI_TEMPLATE (newdecl
)
3338 != DECL_TI_TEMPLATE (olddecl
))))
3339 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3340 && (!DECL_TEMPLATE_INFO (olddecl
)
3341 || (DECL_TI_TEMPLATE (olddecl
)
3342 != DECL_TI_TEMPLATE (newdecl
))))))
3343 /* It's OK to have a template specialization and a non-template
3344 with the same type, or to have specializations of two
3345 different templates with the same type. Note that if one is a
3346 specialization, and the other is an instantiation of the same
3347 template, that we do not exit at this point. That situation
3348 can occur if we instantiate a template class, and then
3349 specialize one of its methods. This situation is legal, but
3350 the declarations must be merged in the usual way. */
3352 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3353 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3354 && !DECL_USE_TEMPLATE (newdecl
))
3355 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3356 && !DECL_USE_TEMPLATE (olddecl
))))
3357 /* One of the declarations is a template instantiation, and the
3358 other is not a template at all. That's OK. */
3360 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3361 && DECL_NAMESPACE_ALIAS (newdecl
)
3362 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3363 /* Redeclaration of namespace alias, ignore it. */
3367 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3370 cp_error (errmsg
, newdecl
);
3371 if (DECL_NAME (olddecl
) != NULL_TREE
)
3372 cp_error_at ((DECL_INITIAL (olddecl
)
3373 && namespace_bindings_p ())
3374 ? "`%#D' previously defined here"
3375 : "`%#D' previously declared here", olddecl
);
3377 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3378 && DECL_INITIAL (olddecl
) != NULL_TREE
3379 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3380 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3382 /* Prototype decl follows defn w/o prototype. */
3383 cp_warning_at ("prototype for `%#D'", newdecl
);
3384 cp_warning_at ("follows non-prototype definition here", olddecl
);
3386 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3387 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3389 /* extern "C" int foo ();
3390 int foo () { bar (); }
3392 if (current_lang_stack
3393 == &VARRAY_TREE (current_lang_base
, 0))
3394 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3397 cp_error_at ("previous declaration of `%#D' with %L linkage",
3398 olddecl
, DECL_LANGUAGE (olddecl
));
3399 cp_error ("conflicts with new declaration with %L linkage",
3400 DECL_LANGUAGE (newdecl
));
3404 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3406 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3408 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3409 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3412 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3413 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3415 for (; t1
&& t1
!= void_list_node
;
3416 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3417 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3419 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3424 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3426 cp_pedwarn_at ("after previous specification in `%#D'",
3432 cp_error ("default argument given for parameter %d of `%#D'",
3434 cp_error_at ("after previous specification in `%#D'",
3439 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
3440 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3442 cp_warning ("`%#D' was used before it was declared inline",
3444 cp_warning_at ("previous non-inline declaration here",
3450 /* If new decl is `static' and an `extern' was seen previously,
3452 warn_extern_redeclared_static (newdecl
, olddecl
);
3454 /* We have committed to returning 1 at this point. */
3455 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3457 /* Now that functions must hold information normally held
3458 by field decls, there is extra work to do so that
3459 declaration information does not get destroyed during
3461 if (DECL_VINDEX (olddecl
))
3462 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3463 if (DECL_VIRTUAL_CONTEXT (olddecl
))
3464 DECL_VIRTUAL_CONTEXT (newdecl
) = DECL_VIRTUAL_CONTEXT (olddecl
);
3465 if (DECL_CONTEXT (olddecl
))
3466 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3467 if (DECL_PENDING_INLINE_INFO (newdecl
) == (struct pending_inline
*)0)
3468 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3469 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3470 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3471 DECL_PURE_VIRTUAL_P (newdecl
) |= DECL_PURE_VIRTUAL_P (olddecl
);
3472 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3473 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3474 DECL_THIS_STATIC (newdecl
) |= DECL_THIS_STATIC (olddecl
);
3475 DECL_LANG_SPECIFIC (newdecl
)->u2
= DECL_LANG_SPECIFIC (olddecl
)->u2
;
3476 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3478 /* Optionally warn about more than one declaration for the same
3479 name, but don't warn about a function declaration followed by a
3481 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3482 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3483 /* Don't warn about extern decl followed by definition. */
3484 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3485 /* Don't warn about friends, let add_friend take care of it. */
3486 && ! DECL_FRIEND_P (newdecl
))
3488 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3489 cp_warning_at ("previous declaration of `%D'", olddecl
);
3493 /* Deal with C++: must preserve virtual function table size. */
3494 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3496 register tree newtype
= TREE_TYPE (newdecl
);
3497 register tree oldtype
= TREE_TYPE (olddecl
);
3499 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3500 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3502 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3503 CLASSTYPE_FRIEND_CLASSES (newtype
)
3504 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3507 DECL_ORIGINAL_TYPE (newdecl
) = DECL_ORIGINAL_TYPE (olddecl
);
3510 /* Copy all the DECL_... slots specified in the new decl
3511 except for any that we copy here from the old type. */
3512 DECL_MACHINE_ATTRIBUTES (newdecl
)
3513 = merge_machine_decl_attributes (olddecl
, newdecl
);
3515 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3517 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3518 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3519 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3520 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3527 /* Automatically handles default parameters. */
3528 tree oldtype
= TREE_TYPE (olddecl
);
3531 /* Merge the data types specified in the two decls. */
3532 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3534 /* If common_type produces a non-typedef type, just use the old type. */
3535 if (TREE_CODE (newdecl
) == TYPE_DECL
3536 && newtype
== DECL_ORIGINAL_TYPE (newdecl
))
3539 if (TREE_CODE (newdecl
) == VAR_DECL
)
3540 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3541 /* Do this after calling `common_type' so that default
3542 parameters don't confuse us. */
3543 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3544 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3545 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3547 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3548 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3549 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3550 TYPE_RAISES_EXCEPTIONS (oldtype
));
3552 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3553 && DECL_SOURCE_LINE (olddecl
) != 0
3555 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
3556 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
3558 cp_error ("declaration of `%F' throws different exceptions",
3560 cp_error_at ("than previous declaration `%F'", olddecl
);
3563 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3565 /* Lay the type out, unless already done. */
3566 if (! same_type_p (newtype
, oldtype
)
3567 && TREE_TYPE (newdecl
) != error_mark_node
3568 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3569 layout_type (TREE_TYPE (newdecl
));
3571 if ((TREE_CODE (newdecl
) == VAR_DECL
3572 || TREE_CODE (newdecl
) == PARM_DECL
3573 || TREE_CODE (newdecl
) == RESULT_DECL
3574 || TREE_CODE (newdecl
) == FIELD_DECL
3575 || TREE_CODE (newdecl
) == TYPE_DECL
)
3576 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3577 layout_decl (newdecl
, 0);
3579 /* Merge the type qualifiers. */
3580 if (TREE_READONLY (newdecl
))
3581 TREE_READONLY (olddecl
) = 1;
3582 if (TREE_THIS_VOLATILE (newdecl
))
3583 TREE_THIS_VOLATILE (olddecl
) = 1;
3585 /* Merge the initialization information. */
3586 if (DECL_INITIAL (newdecl
) == NULL_TREE
3587 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3589 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3590 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3591 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3592 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
3593 && DECL_LANG_SPECIFIC (newdecl
)
3594 && DECL_LANG_SPECIFIC (olddecl
))
3595 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3598 /* Merge the section attribute.
3599 We want to issue an error if the sections conflict but that must be
3600 done later in decl_attributes since we are called before attributes
3602 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3603 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3605 /* Keep the old rtl since we can safely use it. */
3606 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3608 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3610 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (newdecl
)
3611 |= DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (olddecl
);
3612 DECL_NO_CHECK_MEMORY_USAGE (newdecl
)
3613 |= DECL_NO_CHECK_MEMORY_USAGE (olddecl
);
3614 DECL_NO_LIMIT_STACK (newdecl
)
3615 |= DECL_NO_LIMIT_STACK (olddecl
);
3618 /* If cannot merge, then use the new type and qualifiers,
3619 and don't preserve the old rtl. */
3622 /* Clean out any memory we had of the old declaration. */
3623 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3625 TREE_VALUE (oldstatic
) = error_mark_node
;
3627 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3628 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3629 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3630 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3633 /* Merge the storage class information. */
3634 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3635 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3636 DECL_DEFER_OUTPUT (newdecl
) |= DECL_DEFER_OUTPUT (olddecl
);
3637 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3638 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3639 if (! DECL_EXTERNAL (olddecl
))
3640 DECL_EXTERNAL (newdecl
) = 0;
3642 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3644 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3645 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3646 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3647 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3648 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3649 /* Don't really know how much of the language-specific
3650 values we should copy from old to new. */
3651 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3652 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3653 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3654 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3655 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3657 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3658 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3659 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3660 DECL_BEFRIENDING_CLASSES (newdecl
)
3661 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3662 DECL_BEFRIENDING_CLASSES (olddecl
));
3665 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3667 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3668 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3670 /* If newdecl is not a specialization, then it is not a
3671 template-related function at all. And that means that we
3672 shoud have exited above, returning 0. */
3673 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3676 if (TREE_USED (olddecl
))
3677 /* From [temp.expl.spec]:
3679 If a template, a member template or the member of a class
3680 template is explicitly specialized then that
3681 specialization shall be declared before the first use of
3682 that specialization that would cause an implicit
3683 instantiation to take place, in every translation unit in
3684 which such a use occurs. */
3685 cp_error ("explicit specialization of %D after first use",
3688 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3690 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3692 /* If either decl says `inline', this fn is inline, unless its
3693 definition was passed already. */
3694 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3695 DECL_INLINE (olddecl
) = 1;
3696 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3700 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3701 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3702 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3704 if (! types_match
|| new_defines_function
)
3706 /* These need to be copied so that the names are available.
3707 Note that if the types do match, we'll preserve inline
3708 info and other bits, but if not, we won't. */
3709 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3710 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3712 if (new_defines_function
)
3713 /* If defining a function declared with other language
3714 linkage, use the previously declared language linkage. */
3715 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3716 else if (types_match
)
3718 /* If redeclaring a builtin function, and not a definition,
3719 it stays built in. */
3720 if (DECL_BUILT_IN (olddecl
))
3722 DECL_BUILT_IN_CLASS (newdecl
) = DECL_BUILT_IN_CLASS (olddecl
);
3723 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3724 /* If we're keeping the built-in definition, keep the rtl,
3725 regardless of declaration matches. */
3726 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3729 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3731 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3732 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3733 /* Previously saved insns go together with
3734 the function's previous definition. */
3735 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3736 /* Don't clear out the arguments if we're redefining a function. */
3737 if (DECL_ARGUMENTS (olddecl
))
3738 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3742 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3744 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3747 /* Now preserve various other info from the definition. */
3748 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3749 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3750 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3751 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3753 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3757 function_size
= sizeof (struct tree_decl
);
3759 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3760 (char *) olddecl
+ sizeof (struct tree_common
),
3761 function_size
- sizeof (struct tree_common
));
3763 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3765 /* If newdecl is a template instantiation, it is possible that
3766 the following sequence of events has occurred:
3768 o A friend function was declared in a class template. The
3769 class template was instantiated.
3771 o The instantiation of the friend declaration was
3772 recorded on the instantiation list, and is newdecl.
3774 o Later, however, instantiate_class_template called pushdecl
3775 on the newdecl to perform name injection. But, pushdecl in
3776 turn called duplicate_decls when it discovered that another
3777 declaration of a global function with the same name already
3780 o Here, in duplicate_decls, we decided to clobber newdecl.
3782 If we're going to do that, we'd better make sure that
3783 olddecl, and not newdecl, is on the list of
3784 instantiations so that if we try to do the instantiation
3785 again we won't get the clobbered declaration. */
3787 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3788 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3790 for (; decls
; decls
= TREE_CHAIN (decls
))
3791 if (TREE_VALUE (decls
) == newdecl
)
3792 TREE_VALUE (decls
) = olddecl
;
3797 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3798 (char *) olddecl
+ sizeof (struct tree_common
),
3799 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3800 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3803 DECL_UID (olddecl
) = olddecl_uid
;
3805 DECL_FRIEND_P (olddecl
) = 1;
3807 /* NEWDECL contains the merged attribute lists.
3808 Update OLDDECL to be the same. */
3809 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3814 /* Record a decl-node X as belonging to the current lexical scope.
3815 Check for errors (such as an incompatible declaration for the same
3816 name already seen in the same scope).
3818 Returns either X or an old decl for the same name.
3819 If an old decl is returned, it may have been smashed
3820 to agree with what X says. */
3828 int need_new_binding
;
3830 /* We shouldn't be calling pushdecl when we're generating RTL for a
3831 function that we already did semantic analysis on previously. */
3832 my_friendly_assert (!cfun
|| doing_semantic_analysis_p (),
3835 need_new_binding
= 1;
3837 if (DECL_TEMPLATE_PARM_P (x
))
3838 /* Template parameters have no context; they are not X::T even
3839 when declared within a class or namespace. */
3843 if (current_function_decl
&& x
!= current_function_decl
3844 /* A local declaration for a function doesn't constitute
3846 && !(TREE_CODE (x
) == FUNCTION_DECL
&& !DECL_INITIAL (x
))
3847 /* A local declaration for an `extern' variable is in the
3848 scope of the current namespace, not the current
3850 && !(TREE_CODE (x
) == VAR_DECL
&& DECL_EXTERNAL (x
))
3851 && !DECL_CONTEXT (x
))
3852 DECL_CONTEXT (x
) = current_function_decl
;
3854 /* If this is the declaration for a namespace-scope function,
3855 but the declaration itself is in a local scope, mark the
3857 if (TREE_CODE (x
) == FUNCTION_DECL
3858 && DECL_NAMESPACE_SCOPE_P (x
)
3859 && current_function_decl
3860 && x
!= current_function_decl
)
3861 DECL_LOCAL_FUNCTION_P (x
) = 1;
3864 name
= DECL_NAME (x
);
3867 int different_binding_level
= 0;
3869 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3870 name
= TREE_OPERAND (name
, 0);
3872 /* In case this decl was explicitly namespace-qualified, look it
3873 up in its namespace context. */
3874 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
)
3875 && namespace_bindings_p ())
3876 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3878 t
= lookup_name_current_level (name
);
3880 /* [basic.link] If there is a visible declaration of an entity
3881 with linkage having the same name and type, ignoring entities
3882 declared outside the innermost enclosing namespace scope, the
3883 block scope declaration declares that same entity and
3884 receives the linkage of the previous declaration. */
3885 if (! t
&& current_function_decl
&& x
!= current_function_decl
3886 && (TREE_CODE (x
) == FUNCTION_DECL
|| TREE_CODE (x
) == VAR_DECL
)
3887 && DECL_EXTERNAL (x
))
3889 /* Look in block scope. */
3890 t
= IDENTIFIER_VALUE (name
);
3891 /* Or in the innermost namespace. */
3893 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3894 /* Does it have linkage? */
3895 if (t
&& ! (TREE_STATIC (t
) || DECL_EXTERNAL (t
)))
3898 different_binding_level
= 1;
3901 /* If we are declaring a function, and the result of name-lookup
3902 was an OVERLOAD, look for an overloaded instance that is
3903 actually the same as the function we are declaring. (If
3904 there is one, we have to merge our declaration with the
3905 previous declaration.) */
3906 if (t
&& TREE_CODE (t
) == OVERLOAD
)
3910 if (TREE_CODE (x
) == FUNCTION_DECL
)
3911 for (match
= t
; match
; match
= OVL_NEXT (match
))
3913 if (DECL_ASSEMBLER_NAME (OVL_CURRENT (t
))
3914 == DECL_ASSEMBLER_NAME (x
))
3918 /* Just choose one. */
3922 t
= OVL_CURRENT (match
);
3927 if (t
== error_mark_node
)
3929 /* error_mark_node is 0 for a while during initialization! */
3931 cp_error_at ("`%#D' used prior to declaration", x
);
3933 else if (t
!= NULL_TREE
)
3935 if (different_binding_level
)
3937 if (decls_match (x
, t
))
3938 /* The standard only says that the local extern
3939 inherits linkage from the previous decl; in
3940 particular, default args are not shared. It would
3941 be nice to propagate inlining info, though. FIXME. */
3942 TREE_PUBLIC (x
) = TREE_PUBLIC (t
);
3944 else if (TREE_CODE (t
) == PARM_DECL
)
3946 if (DECL_CONTEXT (t
) == NULL_TREE
)
3947 fatal ("parse errors have confused me too much");
3949 /* Check for duplicate params. */
3950 if (duplicate_decls (x
, t
))
3953 else if ((DECL_EXTERN_C_FUNCTION_P (x
)
3954 || DECL_FUNCTION_TEMPLATE_P (x
))
3955 && is_overloaded_fn (t
))
3956 /* Don't do anything just yet. */;
3957 else if (t
== wchar_decl_node
)
3959 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3960 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3962 /* Throw away the redeclaration. */
3965 else if (TREE_CODE (t
) != TREE_CODE (x
))
3967 if (duplicate_decls (x
, t
))
3970 else if (duplicate_decls (x
, t
))
3972 if (TREE_CODE (t
) == TYPE_DECL
)
3973 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3974 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3975 check_default_args (t
);
3979 else if (DECL_MAIN_P (x
))
3981 /* A redeclaration of main, but not a duplicate of the
3986 This function shall not be overloaded. */
3987 cp_error_at ("invalid redeclaration of `%D'", t
);
3988 cp_error ("as `%D'", x
);
3989 /* We don't try to push this declaration since that
3995 check_template_shadow (x
);
3997 /* If this is a function conjured up by the backend, massage it
3998 so it looks friendly. */
3999 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_LANG_SPECIFIC (x
))
4001 retrofit_lang_decl (x
);
4002 DECL_LANGUAGE (x
) = lang_c
;
4005 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_FUNCTION_MEMBER_P (x
))
4007 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
4010 if (!namespace_bindings_p ())
4011 /* We do not need to create a binding for this name;
4012 push_overloaded_decl will have already done so if
4014 need_new_binding
= 0;
4016 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
4018 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
4020 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
4024 /* If declaring a type as a typedef, copy the type (unless we're
4025 at line 0), and install this TYPE_DECL as the new type's typedef
4026 name. See the extensive comment in ../c-decl.c (pushdecl). */
4027 if (TREE_CODE (x
) == TYPE_DECL
)
4029 tree type
= TREE_TYPE (x
);
4030 if (DECL_SOURCE_LINE (x
) == 0)
4032 if (TYPE_NAME (type
) == 0)
4033 TYPE_NAME (type
) = x
;
4035 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
4036 /* We don't want to copy the type when all we're
4037 doing is making a TYPE_DECL for the purposes of
4039 && (!TYPE_NAME (type
)
4040 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
4042 DECL_ORIGINAL_TYPE (x
) = type
;
4043 type
= build_type_copy (type
);
4044 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
4045 TYPE_NAME (type
) = x
;
4046 TREE_TYPE (x
) = type
;
4049 if (type
!= error_mark_node
4051 && TYPE_IDENTIFIER (type
))
4052 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
4053 current_binding_level
);
4057 /* Multiple external decls of the same identifier ought to match.
4059 We get warnings about inline functions where they are defined.
4060 We get warnings about other functions from push_overloaded_decl.
4062 Avoid duplicate warnings where they are used. */
4063 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
4067 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
4068 if (decl
&& TREE_CODE (decl
) == OVERLOAD
)
4069 decl
= OVL_FUNCTION (decl
);
4071 if (decl
&& decl
!= error_mark_node
4072 && (DECL_EXTERNAL (decl
) || TREE_PUBLIC (decl
))
4073 /* If different sort of thing, we already gave an error. */
4074 && TREE_CODE (decl
) == TREE_CODE (x
)
4075 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
4077 cp_pedwarn ("type mismatch with previous external decl", x
);
4078 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
4082 /* This name is new in its binding level.
4083 Install the new declaration and return it. */
4084 if (namespace_bindings_p ())
4086 /* Install a global value. */
4088 /* If the first global decl has external linkage,
4089 warn if we later see static one. */
4090 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
4091 TREE_PUBLIC (name
) = 1;
4093 /* Bind the mangled name for the entity. In the future, we
4094 should not need to do this; mangled names are an
4095 implementation detail of which the front-end should not
4096 need to be aware. */
4097 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
4099 /* For an ordinary function, we create a binding from
4100 the mangled name (i.e., NAME) to the DECL. But, for
4101 an `extern "C"' function, the mangled name and the
4102 ordinary name are the same so we need not do this. */
4103 && !DECL_EXTERN_C_FUNCTION_P (x
))
4107 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
4108 || TREE_CODE (x
) == NAMESPACE_DECL
)
4109 mangled_name
= name
;
4111 mangled_name
= DECL_ASSEMBLER_NAME (x
);
4113 if (TREE_CODE (x
) == FUNCTION_DECL
)
4115 ((IDENTIFIER_GLOBAL_VALUE (mangled_name
) == NULL_TREE
)
4116 || (IDENTIFIER_GLOBAL_VALUE (mangled_name
) == x
), 378);
4117 SET_IDENTIFIER_NAMESPACE_VALUE (mangled_name
, x
);
4120 /* Don't forget if the function was used via an implicit decl. */
4121 if (IDENTIFIER_IMPLICIT_DECL (name
)
4122 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
4125 /* Don't forget if its address was taken in that way. */
4126 if (IDENTIFIER_IMPLICIT_DECL (name
)
4127 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
4128 TREE_ADDRESSABLE (x
) = 1;
4130 /* Warn about mismatches against previous implicit decl. */
4131 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
4132 /* If this real decl matches the implicit, don't complain. */
4133 && ! (TREE_CODE (x
) == FUNCTION_DECL
4134 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
4136 ("`%D' was previously implicitly declared to return `int'", x
);
4138 /* If new decl is `static' and an `extern' was seen previously,
4140 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
4141 warn_extern_redeclared_static (x
, t
);
4145 /* Here to install a non-global value. */
4146 tree oldlocal
= IDENTIFIER_VALUE (name
);
4147 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
4149 if (need_new_binding
)
4151 push_local_binding (name
, x
, 0);
4152 /* Because push_local_binding will hook X on to the
4153 current_binding_level's name list, we don't want to
4154 do that again below. */
4155 need_new_binding
= 0;
4158 /* If this is a TYPE_DECL, push it into the type value slot. */
4159 if (TREE_CODE (x
) == TYPE_DECL
)
4160 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
4161 current_binding_level
);
4163 /* Clear out any TYPE_DECL shadowed by a namespace so that
4164 we won't think this is a type. The C struct hack doesn't
4165 go through namespaces. */
4166 if (TREE_CODE (x
) == NAMESPACE_DECL
)
4167 set_identifier_type_value_with_scope (name
, NULL_TREE
,
4168 current_binding_level
);
4175 && TREE_CODE (oldlocal
) == VAR_DECL
4176 && DECL_DEAD_FOR_LOCAL (oldlocal
))
4177 oldlocal
= DECL_SHADOWED_FOR_VAR (oldlocal
);
4179 if (oldlocal
== NULL_TREE
)
4180 oldlocal
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (d
));
4183 /* If this is an extern function declaration, see if we
4184 have a global definition or declaration for the function. */
4185 if (oldlocal
== NULL_TREE
4186 && DECL_EXTERNAL (x
)
4187 && oldglobal
!= NULL_TREE
4188 && TREE_CODE (x
) == FUNCTION_DECL
4189 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
4191 /* We have one. Their types must agree. */
4192 if (decls_match (x
, oldglobal
))
4196 cp_warning ("extern declaration of `%#D' doesn't match", x
);
4197 cp_warning_at ("global declaration `%#D'", oldglobal
);
4200 /* If we have a local external declaration,
4201 and no file-scope declaration has yet been seen,
4202 then if we later have a file-scope decl it must not be static. */
4203 if (oldlocal
== NULL_TREE
4204 && oldglobal
== NULL_TREE
4205 && DECL_EXTERNAL (x
)
4207 TREE_PUBLIC (name
) = 1;
4209 /* Warn if shadowing an argument at the top level of the body. */
4210 if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
4211 /* Inline decls shadow nothing. */
4212 && !DECL_FROM_INLINE (x
)
4213 && TREE_CODE (oldlocal
) == PARM_DECL
4214 /* Don't complain if it's from an enclosing function. */
4215 && DECL_CONTEXT (oldlocal
) == current_function_decl
4216 && TREE_CODE (x
) != PARM_DECL
)
4218 /* Go to where the parms should be and see if we
4220 struct binding_level
*b
= current_binding_level
->level_chain
;
4226 if (b
->parm_flag
== 1)
4227 cp_error ("declaration of `%#D' shadows a parameter", name
);
4230 /* Maybe warn if shadowing something else. */
4231 if (warn_shadow
&& !DECL_EXTERNAL (x
)
4232 /* Inline decls shadow nothing. */
4233 && !DECL_FROM_INLINE (x
)
4234 /* No shadow warnings for internally generated vars. */
4235 && ! DECL_ARTIFICIAL (x
)
4236 /* No shadow warnings for vars made for inlining. */
4237 && ! DECL_FROM_INLINE (x
))
4239 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
4240 warning ("declaration of `%s' shadows a parameter",
4241 IDENTIFIER_POINTER (name
));
4242 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
4243 && current_class_ptr
4244 && !TREE_STATIC (name
))
4245 warning ("declaration of `%s' shadows a member of `this'",
4246 IDENTIFIER_POINTER (name
));
4247 else if (oldlocal
!= NULL_TREE
)
4248 warning ("declaration of `%s' shadows previous local",
4249 IDENTIFIER_POINTER (name
));
4250 else if (oldglobal
!= NULL_TREE
)
4251 /* XXX shadow warnings in outer-more namespaces */
4252 warning ("declaration of `%s' shadows global declaration",
4253 IDENTIFIER_POINTER (name
));
4257 if (TREE_CODE (x
) == FUNCTION_DECL
)
4258 check_default_args (x
);
4260 /* Keep count of variables in this level with incomplete type. */
4261 if (TREE_CODE (x
) == VAR_DECL
4262 && TREE_TYPE (x
) != error_mark_node
4263 && ((!COMPLETE_TYPE_P (TREE_TYPE (x
))
4264 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
4265 /* RTTI TD entries are created while defining the type_info. */
4266 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
4267 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
4269 if (namespace_bindings_p ())
4270 namespace_scope_incomplete
4271 = tree_cons (NULL_TREE
, x
, namespace_scope_incomplete
);
4273 current_binding_level
->incomplete
4274 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4278 if (need_new_binding
)
4279 add_decl_to_level (x
,
4280 DECL_NAMESPACE_SCOPE_P (x
)
4281 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x
))
4282 : current_binding_level
);
4287 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4288 caller to set DECL_CONTEXT properly. */
4291 pushdecl_with_scope (x
, level
)
4293 struct binding_level
*level
;
4295 register struct binding_level
*b
;
4296 tree function_decl
= current_function_decl
;
4298 current_function_decl
= NULL_TREE
;
4299 if (level
->parm_flag
== 2)
4301 b
= class_binding_level
;
4302 class_binding_level
= level
;
4303 pushdecl_class_level (x
);
4304 class_binding_level
= b
;
4308 b
= current_binding_level
;
4309 current_binding_level
= level
;
4311 current_binding_level
= b
;
4313 current_function_decl
= function_decl
;
4317 /* Like pushdecl, only it places X in the current namespace,
4321 pushdecl_namespace_level (x
)
4324 register struct binding_level
*b
= current_binding_level
;
4327 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4329 /* Now, the type_shadowed stack may screw us. Munge it so it does
4331 if (TREE_CODE (x
) == TYPE_DECL
)
4333 tree name
= DECL_NAME (x
);
4335 tree
*ptr
= (tree
*)0;
4336 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4338 tree shadowed
= b
->type_shadowed
;
4339 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4340 if (TREE_PURPOSE (shadowed
) == name
)
4342 ptr
= &TREE_VALUE (shadowed
);
4343 /* Can't break out of the loop here because sometimes
4344 a binding level will have duplicate bindings for
4345 PT names. It's gross, but I haven't time to fix it. */
4348 newval
= TREE_TYPE (x
);
4349 if (ptr
== (tree
*)0)
4351 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4352 up here if this is changed to an assertion. --KR */
4353 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4363 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4367 pushdecl_top_level (x
)
4370 push_to_top_level ();
4371 x
= pushdecl_namespace_level (x
);
4372 pop_from_top_level ();
4376 /* Make the declaration of X appear in CLASS scope. */
4379 pushdecl_class_level (x
)
4382 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4383 scope looks for the pre-mangled name. */
4386 if (TREE_CODE (x
) == OVERLOAD
)
4387 x
= OVL_CURRENT (x
);
4388 name
= DECL_NAME (x
);
4392 push_class_level_binding (name
, x
);
4393 if (TREE_CODE (x
) == TYPE_DECL
)
4394 set_identifier_type_value (name
, TREE_TYPE (x
));
4396 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4400 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4403 pushdecl_class_level (f
);
4407 /* Enter DECL into the symbol table, if that's appropriate. Returns
4408 DECL, or a modified version thereof. */
4411 maybe_push_decl (decl
)
4414 tree type
= TREE_TYPE (decl
);
4416 /* Add this decl to the current binding level, but not if it comes
4417 from another scope, e.g. a static member variable. TEM may equal
4418 DECL or it may be a previous decl of the same name. */
4419 if (decl
== error_mark_node
4420 || (TREE_CODE (decl
) != PARM_DECL
4421 && DECL_CONTEXT (decl
) != NULL_TREE
4422 /* Definitions of namespace members outside their namespace are
4424 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4425 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4426 || TREE_CODE (type
) == UNKNOWN_TYPE
4427 /* The declaration of a template specialization does not affect
4428 the functions available for overload resolution, so we do not
4430 || (TREE_CODE (decl
) == FUNCTION_DECL
4431 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4434 return pushdecl (decl
);
4437 /* Make the declaration(s) of X appear in CLASS scope
4438 under the name NAME. */
4441 push_class_level_binding (name
, x
)
4446 /* The class_binding_level will be NULL if x is a template
4447 parameter name in a member template. */
4448 if (!class_binding_level
)
4451 /* Make sure that this new member does not have the same name
4452 as a template parameter. */
4453 if (TYPE_BEING_DEFINED (current_class_type
))
4454 check_template_shadow (x
);
4456 /* If this declaration shadows a declaration from an enclosing
4457 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4458 we leave this class. Record the shadowed declaration here. */
4459 binding
= IDENTIFIER_BINDING (name
);
4461 && ((TREE_CODE (x
) == OVERLOAD
4462 && BINDING_VALUE (binding
)
4463 && is_overloaded_fn (BINDING_VALUE (binding
)))
4464 || INHERITED_VALUE_BINDING_P (binding
)))
4469 /* If the old binding was from a base class, and was for a tag
4470 name, slide it over to make room for the new binding. The
4471 old binding is still visible if explicitly qualified with a
4473 if (INHERITED_VALUE_BINDING_P (binding
)
4474 && BINDING_VALUE (binding
)
4475 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4476 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4477 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4479 old_decl
= BINDING_TYPE (binding
);
4480 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4481 BINDING_VALUE (binding
) = NULL_TREE
;
4482 INHERITED_VALUE_BINDING_P (binding
) = 0;
4485 old_decl
= BINDING_VALUE (binding
);
4487 /* There was already a binding for X containing fewer
4488 functions than are named in X. Find the previous
4489 declaration of X on the class-shadowed list, and update it. */
4490 for (shadow
= class_binding_level
->class_shadowed
;
4492 shadow
= TREE_CHAIN (shadow
))
4493 if (TREE_PURPOSE (shadow
) == name
4494 && TREE_TYPE (shadow
) == old_decl
)
4496 BINDING_VALUE (binding
) = x
;
4497 INHERITED_VALUE_BINDING_P (binding
) = 0;
4498 TREE_TYPE (shadow
) = x
;
4503 /* If we didn't replace an existing binding, put the binding on the
4504 stack of bindings for the identifier, and update
4505 IDENTIFIER_CLASS_VALUE. */
4506 if (push_class_binding (name
, x
))
4508 class_binding_level
->class_shadowed
4509 = tree_cons (name
, IDENTIFIER_CLASS_VALUE (name
),
4510 class_binding_level
->class_shadowed
);
4511 /* Record the value we are binding NAME to so that we can know
4512 what to pop later. */
4513 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4517 /* Insert another USING_DECL into the current binding level, returning
4518 this declaration. If this is a redeclaration, do nothing, and
4519 return NULL_TREE if this not in namespace scope (in namespace
4520 scope, a using decl might extend any previous bindings). */
4523 push_using_decl (scope
, name
)
4529 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4530 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4531 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4532 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4535 return namespace_bindings_p () ? decl
: NULL_TREE
;
4536 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4537 DECL_INITIAL (decl
) = scope
;
4538 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4539 current_binding_level
->usings
= decl
;
4543 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4544 changed (i.e. there was already a directive), or the fresh
4545 TREE_LIST otherwise. */
4548 push_using_directive (used
)
4551 tree ud
= current_binding_level
->using_directives
;
4552 tree iter
, ancestor
;
4554 /* Check if we already have this. */
4555 if (purpose_member (used
, ud
) != NULL_TREE
)
4558 /* Recursively add all namespaces used. */
4559 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4560 push_using_directive (TREE_PURPOSE (iter
));
4562 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4563 ud
= current_binding_level
->using_directives
;
4564 ud
= tree_cons (used
, ancestor
, ud
);
4565 current_binding_level
->using_directives
= ud
;
4569 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4570 other definitions already in place. We get around this by making
4571 the value of the identifier point to a list of all the things that
4572 want to be referenced by that name. It is then up to the users of
4573 that name to decide what to do with that list.
4575 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its
4576 DECL_TEMPLATE_RESULT. It is dealt with the same way.
4578 FLAGS is a bitwise-or of the following values:
4579 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4581 PUSH_USING: DECL is being pushed as the result of a using
4584 The value returned may be a previous declaration if we guessed wrong
4585 about what language DECL should belong to (C or C++). Otherwise,
4586 it's always DECL (and never something that's not a _DECL). */
4589 push_overloaded_decl (decl
, flags
)
4593 tree name
= DECL_NAME (decl
);
4596 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4599 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4601 old
= lookup_name_current_level (name
);
4605 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4607 tree t
= TREE_TYPE (old
);
4608 if (IS_AGGR_TYPE (t
) && warn_shadow
4609 && (! DECL_IN_SYSTEM_HEADER (decl
)
4610 || ! DECL_IN_SYSTEM_HEADER (old
)))
4611 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4614 else if (is_overloaded_fn (old
))
4618 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4620 tree fn
= OVL_CURRENT (tmp
);
4622 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4623 && !(flags
& PUSH_USING
)
4624 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4625 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4626 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4629 if (duplicate_decls (decl
, fn
))
4633 else if (old
== error_mark_node
)
4634 /* Ignore the undefined symbol marker. */
4638 cp_error_at ("previous non-function declaration `%#D'", old
);
4639 cp_error ("conflicts with function declaration `%#D'", decl
);
4644 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4646 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4647 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4649 new_binding
= ovl_cons (decl
, old
);
4650 if (flags
& PUSH_USING
)
4651 OVL_USED (new_binding
) = 1;
4654 /* NAME is not ambiguous. */
4658 set_namespace_binding (name
, current_namespace
, new_binding
);
4661 /* We only create an OVERLOAD if there was a previous binding at
4662 this level, or if decl is a template. In the former case, we
4663 need to remove the old binding and replace it with the new
4664 binding. We must also run through the NAMES on the binding
4665 level where the name was bound to update the chain. */
4667 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4671 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4673 d
= &TREE_CHAIN (*d
))
4675 || (TREE_CODE (*d
) == TREE_LIST
4676 && TREE_VALUE (*d
) == old
))
4678 if (TREE_CODE (*d
) == TREE_LIST
)
4679 /* Just replace the old binding with the new. */
4680 TREE_VALUE (*d
) = new_binding
;
4682 /* Build a TREE_LIST to wrap the OVERLOAD. */
4683 *d
= tree_cons (NULL_TREE
, new_binding
,
4686 /* And update the CPLUS_BINDING node. */
4687 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4692 /* We should always find a previous binding in this case. */
4693 my_friendly_abort (0);
4696 /* Install the new binding. */
4697 push_local_binding (name
, new_binding
, flags
);
4703 /* Generate an implicit declaration for identifier FUNCTIONID
4704 as a function of type int (). Print a warning if appropriate. */
4707 implicitly_declare (functionid
)
4712 /* We used to reuse an old implicit decl here,
4713 but this loses with inline functions because it can clobber
4714 the saved decl chains. */
4715 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4717 DECL_EXTERNAL (decl
) = 1;
4718 TREE_PUBLIC (decl
) = 1;
4720 /* ISO standard says implicit declarations are in the innermost block.
4721 So we record the decl in the standard fashion. */
4723 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4726 /* Only one warning per identifier. */
4727 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4729 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4732 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4737 /* Return zero if the declaration NEWDECL is valid
4738 when the declaration OLDDECL (assumed to be for the same name)
4739 has already been seen.
4740 Otherwise return an error message format string with a %s
4741 where the identifier should go. */
4744 redeclaration_error_message (newdecl
, olddecl
)
4745 tree newdecl
, olddecl
;
4747 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4749 /* Because C++ can put things into name space for free,
4750 constructs like "typedef struct foo { ... } foo"
4751 would look like an erroneous redeclaration. */
4752 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4755 return "redefinition of `%#D'";
4757 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4759 /* If this is a pure function, its olddecl will actually be
4760 the original initialization to `0' (which we force to call
4761 abort()). Don't complain about redefinition in this case. */
4762 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_PURE_VIRTUAL_P (olddecl
))
4765 /* If both functions come from different namespaces, this is not
4766 a redeclaration - this is a conflict with a used function. */
4767 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4768 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4769 return "`%D' conflicts with used function";
4771 /* We'll complain about linkage mismatches in
4772 warn_extern_redeclared_static. */
4774 /* Defining the same name twice is no good. */
4775 if (DECL_INITIAL (olddecl
) != NULL_TREE
4776 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4778 if (DECL_NAME (olddecl
) == NULL_TREE
)
4779 return "`%#D' not declared in class";
4781 return "redefinition of `%#D'";
4785 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4787 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4788 && (DECL_TEMPLATE_RESULT (newdecl
)
4789 != DECL_TEMPLATE_RESULT (olddecl
))
4790 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4791 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4792 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4793 && COMPLETE_TYPE_P (TREE_TYPE (newdecl
))
4794 && COMPLETE_TYPE_P (TREE_TYPE (olddecl
))))
4795 return "redefinition of `%#D'";
4798 else if (toplevel_bindings_p () || DECL_NAMESPACE_SCOPE_P (newdecl
))
4800 /* Objects declared at top level: */
4801 /* If at least one is a reference, it's ok. */
4802 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4804 /* Reject two definitions. */
4805 return "redefinition of `%#D'";
4809 /* Objects declared with block scope: */
4810 /* Reject two definitions, and reject a definition
4811 together with an external reference. */
4812 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4813 return "redeclaration of `%#D'";
4818 /* Create a new label, named ID. */
4821 make_label_decl (id
, local_p
)
4827 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4829 /* Make sure every label has an rtx. */
4832 DECL_CONTEXT (decl
) = current_function_decl
;
4833 DECL_MODE (decl
) = VOIDmode
;
4834 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
4836 /* Say where one reference is to the label, for the sake of the
4837 error if it is not defined. */
4838 DECL_SOURCE_LINE (decl
) = lineno
;
4839 DECL_SOURCE_FILE (decl
) = input_filename
;
4841 /* Record the fact that this identifier is bound to this label. */
4842 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4847 /* Record this label on the list of used labels so that we can check
4848 at the end of the function to see whether or not the label was
4849 actually defined, and so we can check when the label is defined whether
4850 this use is valid. */
4856 if (named_label_uses
== NULL
4857 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4858 || named_label_uses
->label_decl
!= decl
)
4860 struct named_label_use_list
*new_ent
;
4861 new_ent
= ((struct named_label_use_list
*)
4862 ggc_alloc (sizeof (struct named_label_use_list
)));
4863 new_ent
->label_decl
= decl
;
4864 new_ent
->names_in_scope
= current_binding_level
->names
;
4865 new_ent
->binding_level
= current_binding_level
;
4866 new_ent
->lineno_o_goto
= lineno
;
4867 new_ent
->filename_o_goto
= input_filename
;
4868 new_ent
->next
= named_label_uses
;
4869 named_label_uses
= new_ent
;
4873 /* Look for a label named ID in the current function. If one cannot
4874 be found, create one. (We keep track of used, but undefined,
4875 labels, and complain about them at the end of a function.) */
4882 struct named_label_list
*ent
;
4884 /* You can't use labels at global scope. */
4885 if (current_function_decl
== NULL_TREE
)
4887 error ("label `%s' referenced outside of any function",
4888 IDENTIFIER_POINTER (id
));
4892 /* See if we've already got this label. */
4893 decl
= IDENTIFIER_LABEL_VALUE (id
);
4894 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
4897 /* Record this label on the list of labels used in this function.
4898 We do this before calling make_label_decl so that we get the
4899 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4900 ent
= ((struct named_label_list
*)
4901 ggc_alloc_cleared (sizeof (struct named_label_list
)));
4902 ent
->old_value
= IDENTIFIER_LABEL_VALUE (id
);
4903 ent
->next
= named_labels
;
4906 /* We need a new label. */
4907 decl
= make_label_decl (id
, /*local_p=*/0);
4909 /* Now fill in the information we didn't have before. */
4910 ent
->label_decl
= decl
;
4915 /* Declare a local label named ID. */
4918 declare_local_label (id
)
4923 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4924 this scope we can restore the old value of
4925 IDENTIFIER_TYPE_VALUE. */
4926 current_binding_level
->shadowed_labels
4927 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4928 current_binding_level
->shadowed_labels
);
4929 /* Look for the label. */
4930 decl
= make_label_decl (id
, /*local_p=*/1);
4931 /* Now fill in the information we didn't have before. */
4932 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
4937 /* Returns nonzero if it is ill-formed to jump past the declaration of
4938 DECL. Returns 2 if it's also a real problem. */
4941 decl_jump_unsafe (decl
)
4944 if (TREE_CODE (decl
) != VAR_DECL
|| TREE_STATIC (decl
))
4947 if (DECL_INITIAL (decl
) == NULL_TREE
4948 && pod_type_p (TREE_TYPE (decl
)))
4951 /* This is really only important if we're crossing an initialization.
4952 The POD stuff is just pedantry; why should it matter if the class
4953 contains a field of pointer to member type? */
4954 if (DECL_INITIAL (decl
)
4955 || (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))))
4960 /* Check that a single previously seen jump to a newly defined label
4961 is OK. DECL is the LABEL_DECL or 0; LEVEL is the binding_level for
4962 the jump context; NAMES are the names in scope in LEVEL at the jump
4963 context; FILE and LINE are the source position of the jump or 0. */
4966 check_previous_goto_1 (decl
, level
, names
, file
, line
)
4968 struct binding_level
*level
;
4975 struct binding_level
*b
= current_binding_level
;
4976 for (; b
; b
= b
->level_chain
)
4978 tree new_decls
= b
->names
;
4979 tree old_decls
= (b
== level
? names
: NULL_TREE
);
4980 for (; new_decls
!= old_decls
;
4981 new_decls
= TREE_CHAIN (new_decls
))
4983 int problem
= decl_jump_unsafe (new_decls
);
4990 cp_pedwarn ("jump to label `%D'", decl
);
4992 pedwarn ("jump to case label");
4995 pedwarn_with_file_and_line (file
, line
, " from here");
4999 if (problem
> 1 && DECL_ARTIFICIAL (new_decls
))
5000 /* Can't skip init of __exception_info. */
5001 cp_error_at (" enters catch block", new_decls
);
5002 else if (problem
> 1)
5003 cp_error_at (" crosses initialization of `%#D'",
5006 cp_pedwarn_at (" enters scope of non-POD `%#D'",
5012 if (b
->eh_region
&& ! saw_eh
)
5017 cp_pedwarn ("jump to label `%D'", decl
);
5019 pedwarn ("jump to case label");
5022 pedwarn_with_file_and_line (file
, line
, " from here");
5025 error (" enters try block");
5032 check_previous_goto (use
)
5033 struct named_label_use_list
*use
;
5035 check_previous_goto_1 (use
->label_decl
, use
->binding_level
,
5036 use
->names_in_scope
, use
->filename_o_goto
,
5037 use
->lineno_o_goto
);
5041 check_switch_goto (level
)
5042 struct binding_level
*level
;
5044 check_previous_goto_1 (NULL_TREE
, level
, level
->names
, NULL
, 0);
5047 /* Check that any previously seen jumps to a newly defined label DECL
5048 are OK. Called by define_label. */
5051 check_previous_gotos (decl
)
5054 struct named_label_use_list
**usep
;
5056 if (! TREE_USED (decl
))
5059 for (usep
= &named_label_uses
; *usep
; )
5061 struct named_label_use_list
*use
= *usep
;
5062 if (use
->label_decl
== decl
)
5064 check_previous_goto (use
);
5068 usep
= &(use
->next
);
5072 /* Check that a new jump to a label DECL is OK. Called by
5073 finish_goto_stmt. */
5081 struct named_label_list
*lab
;
5083 /* We can't know where a computed goto is jumping. So we assume
5085 if (! DECL_P (decl
))
5088 /* If the label hasn't been defined yet, defer checking. */
5089 if (! DECL_INITIAL (decl
))
5095 for (lab
= named_labels
; lab
; lab
= lab
->next
)
5096 if (decl
== lab
->label_decl
)
5099 /* If the label is not on named_labels it's a gcc local label, so
5100 it must be in an outer scope, so jumping to it is always OK. */
5104 if ((lab
->eh_region
|| lab
->bad_decls
) && !identified
)
5106 cp_pedwarn_at ("jump to label `%D'", decl
);
5107 pedwarn (" from here");
5111 for (bad
= lab
->bad_decls
; bad
; bad
= TREE_CHAIN (bad
))
5113 tree b
= TREE_VALUE (bad
);
5114 int u
= decl_jump_unsafe (b
);
5116 if (u
> 1 && DECL_ARTIFICIAL (b
))
5117 /* Can't skip init of __exception_info. */
5118 cp_error_at (" enters catch block", b
);
5120 cp_error_at (" skips initialization of `%#D'", b
);
5122 cp_pedwarn_at (" enters scope of non-POD `%#D'", b
);
5126 error (" enters try block");
5129 /* Define a label, specifying the location in the source file.
5130 Return the LABEL_DECL node for the label, if the definition is valid.
5131 Otherwise return 0. */
5134 define_label (filename
, line
, name
)
5135 const char *filename
;
5139 tree decl
= lookup_label (name
);
5140 struct named_label_list
*ent
;
5142 for (ent
= named_labels
; ent
; ent
= ent
->next
)
5143 if (ent
->label_decl
== decl
)
5146 /* After labels, make any new cleanups go into their
5147 own new (temporary) binding contour. */
5148 current_binding_level
->more_cleanups_ok
= 0;
5150 if (name
== get_identifier ("wchar_t"))
5151 cp_pedwarn ("label named wchar_t");
5153 if (DECL_INITIAL (decl
) != NULL_TREE
)
5155 cp_error ("duplicate label `%D'", decl
);
5160 /* Mark label as having been defined. */
5161 DECL_INITIAL (decl
) = error_mark_node
;
5162 /* Say where in the source. */
5163 DECL_SOURCE_FILE (decl
) = filename
;
5164 DECL_SOURCE_LINE (decl
) = line
;
5167 ent
->names_in_scope
= current_binding_level
->names
;
5168 ent
->binding_level
= current_binding_level
;
5170 check_previous_gotos (decl
);
5171 current_function_return_value
= NULL_TREE
;
5178 struct binding_level
*level
;
5179 struct cp_switch
*next
;
5182 static struct cp_switch
*switch_stack
;
5188 = (struct cp_switch
*) xmalloc (sizeof (struct cp_switch
));
5189 p
->level
= current_binding_level
;
5190 p
->next
= switch_stack
;
5197 struct cp_switch
*cs
;
5200 switch_stack
= switch_stack
->next
;
5204 /* Note that we've seen a definition of a case label, and complain if this
5205 is a bad place for one. */
5208 define_case_label ()
5210 tree cleanup
= last_cleanup_this_contour ();
5213 /* Don't crash; we'll complain in do_case. */
5218 static int explained
= 0;
5219 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup
));
5220 warning ("where case label appears here");
5223 warning ("(enclose actions of previous case statements requiring destructors in their own scope.)");
5228 check_switch_goto (switch_stack
->level
);
5230 /* After labels, make any new cleanups go into their
5231 own new (temporary) binding contour. */
5233 current_binding_level
->more_cleanups_ok
= 0;
5234 current_function_return_value
= NULL_TREE
;
5237 /* Return the list of declarations of the current level.
5238 Note that this list is in reverse order unless/until
5239 you nreverse it; and when you do nreverse it, you must
5240 store the result back using `storedecls' or you will lose. */
5245 return current_binding_level
->names
;
5248 /* Return the list of type-tags (for structs, etc) of the current level. */
5253 return current_binding_level
->tags
;
5256 /* Store the list of declarations of the current level.
5257 This is done for the parameter declarations of a function being defined,
5258 after they are modified in the light of any missing parameters. */
5264 current_binding_level
->names
= decls
;
5267 /* Similarly, store the list of tags of the current level. */
5273 current_binding_level
->tags
= tags
;
5276 /* Given NAME, an IDENTIFIER_NODE,
5277 return the structure (or union or enum) definition for that name.
5278 Searches binding levels from BINDING_LEVEL up to the global level.
5279 If THISLEVEL_ONLY is nonzero, searches only the specified context
5280 (but skips any tag-transparent contexts to find one that is
5281 meaningful for tags).
5282 FORM says which kind of type the caller wants;
5283 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
5284 If the wrong kind of type is found, and it's not a template, an error is
5288 lookup_tag (form
, name
, binding_level
, thislevel_only
)
5289 enum tree_code form
;
5291 struct binding_level
*binding_level
;
5294 register struct binding_level
*level
;
5295 /* Non-zero if, we should look past a template parameter level, even
5296 if THISLEVEL_ONLY. */
5297 int allow_template_parms_p
= 1;
5299 for (level
= binding_level
; level
; level
= level
->level_chain
)
5302 if (ANON_AGGRNAME_P (name
))
5303 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5305 /* There's no need for error checking here, because
5306 anon names are unique throughout the compilation. */
5307 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
5308 return TREE_VALUE (tail
);
5310 else if (level
->namespace_p
)
5311 /* Do namespace lookup. */
5312 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
5314 tree old
= binding_for_name (name
, tail
);
5316 /* If we just skipped past a template parameter level,
5317 even though THISLEVEL_ONLY, and we find a template
5318 class declaration, then we use the _TYPE node for the
5319 template. See the example below. */
5320 if (thislevel_only
&& !allow_template_parms_p
5321 && old
&& BINDING_VALUE (old
)
5322 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
5323 old
= TREE_TYPE (BINDING_VALUE (old
));
5325 old
= BINDING_TYPE (old
);
5327 /* If it has an original type, it is a typedef, and we
5328 should not return it. */
5329 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
5331 if (old
&& TREE_CODE (old
) != form
5332 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
5334 cp_error ("`%#D' redeclared as %C", old
, form
);
5339 if (thislevel_only
|| tail
== global_namespace
)
5343 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5345 if (TREE_PURPOSE (tail
) == name
)
5347 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
5348 /* Should tighten this up; it'll probably permit
5349 UNION_TYPE and a struct template, for example. */
5351 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
5353 /* Definition isn't the kind we were looking for. */
5354 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
5358 return TREE_VALUE (tail
);
5361 if (thislevel_only
&& ! level
->tag_transparent
)
5363 if (level
->template_parms_p
&& allow_template_parms_p
)
5365 /* We must deal with cases like this:
5367 template <class T> struct S;
5368 template <class T> struct S {};
5370 When looking up `S', for the second declaration, we
5371 would like to find the first declaration. But, we
5372 are in the pseudo-global level created for the
5373 template parameters, rather than the (surrounding)
5374 namespace level. Thus, we keep going one more level,
5375 even though THISLEVEL_ONLY is non-zero. */
5376 allow_template_parms_p
= 0;
5388 set_current_level_tags_transparency (tags_transparent
)
5389 int tags_transparent
;
5391 current_binding_level
->tag_transparent
= tags_transparent
;
5395 /* Given a type, find the tag that was defined for it and return the tag name.
5396 Otherwise return 0. However, the value can never be 0
5397 in the cases in which this is used.
5399 C++: If NAME is non-zero, this is the new name to install. This is
5400 done when replacing anonymous tags with real tag names. */
5403 lookup_tag_reverse (type
, name
)
5407 register struct binding_level
*level
;
5409 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5412 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5414 if (TREE_VALUE (tail
) == type
)
5417 TREE_PURPOSE (tail
) = name
;
5418 return TREE_PURPOSE (tail
);
5425 /* Look up NAME in the NAMESPACE. */
5428 lookup_namespace_name (namespace, name
)
5429 tree
namespace, name
;
5432 tree template_id
= NULL_TREE
;
5434 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5436 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5437 /* This happens for A::B<int> when B is a namespace. */
5439 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5441 /* This happens for A::B where B is a template, and there are no
5442 template arguments. */
5443 cp_error ("invalid use of `%D'", name
);
5444 return error_mark_node
;
5447 namespace = ORIGINAL_NAMESPACE (namespace);
5449 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5452 name
= TREE_OPERAND (name
, 0);
5453 if (TREE_CODE (name
) == OVERLOAD
)
5454 name
= DECL_NAME (OVL_CURRENT (name
));
5455 else if (DECL_P (name
))
5456 name
= DECL_NAME (name
);
5459 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5461 val
= make_node (CPLUS_BINDING
);
5462 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5463 return error_mark_node
;
5465 if (BINDING_VALUE (val
))
5467 val
= BINDING_VALUE (val
);
5471 if (DECL_CLASS_TEMPLATE_P (val
))
5472 val
= lookup_template_class (val
,
5473 TREE_OPERAND (template_id
, 1),
5474 /*in_decl=*/NULL_TREE
,
5475 /*context=*/NULL_TREE
,
5476 /*entering_scope=*/0);
5477 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5478 || TREE_CODE (val
) == OVERLOAD
)
5479 val
= lookup_template_function (val
,
5480 TREE_OPERAND (template_id
, 1));
5483 cp_error ("`%D::%D' is not a template",
5485 return error_mark_node
;
5489 /* If we have a single function from a using decl, pull it out. */
5490 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5491 val
= OVL_FUNCTION (val
);
5495 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5496 return error_mark_node
;
5499 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5501 static unsigned long
5509 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5510 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5515 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5518 typename_compare (k1
, k2
)
5529 d1
= TYPE_NAME (t1
);
5530 d2
= TYPE_NAME (t2
);
5532 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5533 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5534 && ((TREE_TYPE (t1
) != NULL_TREE
)
5535 == (TREE_TYPE (t2
) != NULL_TREE
))
5536 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5537 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5540 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5541 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5542 is non-NULL, this type is being created by the implicit typename
5543 extension, and BASE_TYPE is a type named `t' in some base class of
5544 `T' which depends on template parameters.
5546 Returns the new TYPENAME_TYPE. */
5549 build_typename_type (context
, name
, fullname
, base_type
)
5557 struct hash_entry
* e
;
5559 static struct hash_table ht
;
5563 static struct hash_table
*h
= &ht
;
5564 if (!hash_table_init (&ht
, &hash_newfunc
, &typename_hash
,
5566 fatal ("virtual memory exhausted");
5567 ggc_add_tree_hash_table_root (&h
, 1);
5570 /* Build the TYPENAME_TYPE. */
5571 t
= make_aggr_type (TYPENAME_TYPE
);
5572 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5573 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5574 TREE_TYPE (t
) = base_type
;
5576 /* Build the corresponding TYPE_DECL. */
5577 d
= build_decl (TYPE_DECL
, name
, t
);
5578 TYPE_NAME (TREE_TYPE (d
)) = d
;
5579 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5580 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5581 DECL_ARTIFICIAL (d
) = 1;
5583 /* See if we already have this type. */
5584 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5588 /* Insert the type into the table. */
5589 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5594 /* Resolve `typename CONTEXT::NAME'. Returns an appropriate type,
5595 unless an error occurs, in which case error_mark_node is returned.
5596 If COMPLAIN zero, don't complain about any errors that occur. */
5599 make_typename_type (context
, name
, complain
)
5607 if (!(TYPE_LANG_SPECIFIC (name
)
5608 && (CLASSTYPE_IS_TEMPLATE (name
)
5609 || CLASSTYPE_USE_TEMPLATE (name
))))
5610 name
= TYPE_IDENTIFIER (name
);
5612 /* Create a TEMPLATE_ID_EXPR for the type. */
5613 name
= build_nt (TEMPLATE_ID_EXPR
,
5614 CLASSTYPE_TI_TEMPLATE (name
),
5615 CLASSTYPE_TI_ARGS (name
));
5617 else if (TREE_CODE (name
) == TYPE_DECL
)
5618 name
= DECL_NAME (name
);
5622 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5624 name
= TREE_OPERAND (name
, 0);
5625 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5626 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5628 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5629 my_friendly_abort (2000);
5631 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5633 /* We can get here from typename_sub0 in the explicit_template_type
5634 expansion. Just fail. */
5636 cp_error ("no class template named `%#T' in `%#T'",
5638 return error_mark_node
;
5641 if (! uses_template_parms (context
)
5642 || currently_open_class (context
))
5644 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5646 tree tmpl
= NULL_TREE
;
5647 if (IS_AGGR_TYPE (context
))
5648 tmpl
= lookup_field (context
, name
, 0, 0);
5649 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5652 cp_error ("no class template named `%#T' in `%#T'",
5654 return error_mark_node
;
5657 return lookup_template_class (tmpl
,
5658 TREE_OPERAND (fullname
, 1),
5660 /*entering_scope=*/0);
5666 if (!IS_AGGR_TYPE (context
))
5669 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5670 return error_mark_node
;
5673 t
= lookup_field (context
, name
, 0, 1);
5675 return TREE_TYPE (t
);
5679 /* If the CONTEXT is not a template type, then either the field is
5680 there now or its never going to be. */
5681 if (!uses_template_parms (context
))
5684 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5685 return error_mark_node
;
5689 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5692 /* Select the right _DECL from multiple choices. */
5695 select_decl (binding
, flags
)
5700 val
= BINDING_VALUE (binding
);
5701 if (LOOKUP_NAMESPACES_ONLY (flags
))
5703 /* We are not interested in types. */
5704 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5709 /* If we could have a type and
5710 we have nothing or we need a type and have none. */
5711 if (BINDING_TYPE (binding
)
5712 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5713 && TREE_CODE (val
) != TYPE_DECL
)))
5714 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5715 /* Don't return non-types if we really prefer types. */
5716 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5717 && (TREE_CODE (val
) != TEMPLATE_DECL
5718 || !DECL_CLASS_TEMPLATE_P (val
)))
5724 /* Unscoped lookup of a global: iterate over current namespaces,
5725 considering using-directives. If SPACESP is non-NULL, store a list
5726 of the namespaces we've considered in it. */
5729 unqualified_namespace_lookup (name
, flags
, spacesp
)
5734 tree b
= make_node (CPLUS_BINDING
);
5735 tree initial
= current_decl_namespace();
5736 tree scope
= initial
;
5738 struct binding_level
*level
;
5739 tree val
= NULL_TREE
;
5742 *spacesp
= NULL_TREE
;
5744 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5747 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5748 val
= binding_for_name (name
, scope
);
5750 /* Initialize binding for this context. */
5751 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5752 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5754 /* Add all _DECLs seen through local using-directives. */
5755 for (level
= current_binding_level
;
5756 !level
->namespace_p
;
5757 level
= level
->level_chain
)
5758 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5759 scope
, flags
, spacesp
))
5760 /* Give up because of error. */
5761 return error_mark_node
;
5763 /* Add all _DECLs seen through global using-directives. */
5764 /* XXX local and global using lists should work equally. */
5768 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5769 scope
, flags
, spacesp
))
5770 /* Give up because of error. */
5771 return error_mark_node
;
5772 if (siter
== scope
) break;
5773 siter
= CP_DECL_CONTEXT (siter
);
5776 val
= select_decl (b
, flags
);
5777 if (scope
== global_namespace
)
5783 /* Combine prefer_type and namespaces_only into flags. */
5786 lookup_flags (prefer_type
, namespaces_only
)
5787 int prefer_type
, namespaces_only
;
5789 if (namespaces_only
)
5790 return LOOKUP_PREFER_NAMESPACES
;
5791 if (prefer_type
> 1)
5792 return LOOKUP_PREFER_TYPES
;
5793 if (prefer_type
> 0)
5794 return LOOKUP_PREFER_BOTH
;
5798 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5799 ignore it or not. Subroutine of lookup_name_real. */
5802 qualify_lookup (val
, flags
)
5806 if (val
== NULL_TREE
)
5808 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5810 if ((flags
& LOOKUP_PREFER_TYPES
)
5811 && (TREE_CODE (val
) == TYPE_DECL
5812 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5813 && DECL_CLASS_TEMPLATE_P (val
))))
5815 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5820 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5824 warn_about_implicit_typename_lookup (typename
, binding
)
5828 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5829 tree name
= DECL_NAME (typename
);
5831 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5832 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5833 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5834 && ! (TREE_CODE (binding
) == TYPE_DECL
5835 && same_type_p (TREE_TYPE (binding
), subtype
)))
5837 cp_warning ("lookup of `%D' finds `%#D'",
5839 cp_warning (" instead of `%D' from dependent base class",
5841 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5842 constructor_name (current_class_type
), name
);
5846 /* Look up NAME in the current binding level and its superiors in the
5847 namespace of variables, functions and typedefs. Return a ..._DECL
5848 node of some kind representing its definition if there is only one
5849 such declaration, or return a TREE_LIST with all the overloaded
5850 definitions if there are many, or return 0 if it is undefined.
5852 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5853 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5854 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5855 Otherwise we prefer non-TYPE_DECLs.
5857 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5858 using IDENTIFIER_CLASS_VALUE. */
5861 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5863 int prefer_type
, nonclass
, namespaces_only
;
5866 tree val
= NULL_TREE
;
5868 tree from_obj
= NULL_TREE
;
5870 int val_is_implicit_typename
= 0;
5872 /* Hack: copy flag set by parser, if set. */
5873 if (only_namespace_names
)
5874 namespaces_only
= 1;
5876 if (prefer_type
== -2)
5878 extern int looking_for_typename
;
5879 tree type
= NULL_TREE
;
5882 prefer_type
= looking_for_typename
;
5884 flags
= lookup_flags (prefer_type
, namespaces_only
);
5885 /* If the next thing is '<', class templates are types. */
5886 if (looking_for_template
)
5887 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5889 /* std:: becomes :: for now. */
5890 if (got_scope
== std_node
)
5891 got_scope
= void_type_node
;
5895 else if (got_object
!= error_mark_node
)
5900 if (type
== error_mark_node
)
5901 return error_mark_node
;
5902 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5903 type
= TREE_TYPE (type
);
5906 type
= complete_type (type
);
5908 if (TREE_CODE (type
) == VOID_TYPE
)
5909 type
= global_namespace
;
5910 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5912 val
= make_node (CPLUS_BINDING
);
5913 flags
|= LOOKUP_COMPLAIN
;
5914 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5916 val
= select_decl (val
, flags
);
5918 else if (! IS_AGGR_TYPE (type
)
5919 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5920 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
5921 || TREE_CODE (type
) == TYPENAME_TYPE
)
5922 /* Someone else will give an error about this if needed. */
5924 else if (type
== current_class_type
)
5925 val
= IDENTIFIER_CLASS_VALUE (name
);
5928 val
= lookup_member (type
, name
, 0, prefer_type
);
5929 type_access_control (type
, val
);
5931 /* Restore the containing TYPENAME_TYPE if we looked
5932 through it before. */
5933 if (got_scope
&& got_scope
!= type
5934 && val
&& TREE_CODE (val
) == TYPE_DECL
5935 && TREE_CODE (TREE_TYPE (val
)) == TYPENAME_TYPE
)
5936 TYPE_CONTEXT (TREE_TYPE (val
)) = got_scope
;
5944 else if (got_object
&& val
)
5949 flags
= lookup_flags (prefer_type
, namespaces_only
);
5950 /* If we're not parsing, we need to complain. */
5951 flags
|= LOOKUP_COMPLAIN
;
5954 /* First, look in non-namespace scopes. */
5956 if (current_class_type
== NULL_TREE
)
5959 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5963 if (!LOCAL_BINDING_P (t
) && nonclass
)
5964 /* We're not looking for class-scoped bindings, so keep going. */
5967 /* If this is the kind of thing we're looking for, we're done. */
5968 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5969 binding
= BINDING_VALUE (t
);
5970 else if ((flags
& LOOKUP_PREFER_TYPES
)
5971 && qualify_lookup (BINDING_TYPE (t
), flags
))
5972 binding
= BINDING_TYPE (t
);
5974 binding
= NULL_TREE
;
5976 /* Handle access control on types from enclosing or base classes. */
5977 if (binding
&& ! yylex
5978 && BINDING_LEVEL (t
) && BINDING_LEVEL (t
)->parm_flag
== 2)
5979 type_access_control (BINDING_LEVEL (t
)->this_class
, binding
);
5982 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5984 if (val_is_implicit_typename
&& !yylex
)
5985 warn_about_implicit_typename_lookup (val
, binding
);
5987 val_is_implicit_typename
5988 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5989 if (!val_is_implicit_typename
)
5994 /* Now lookup in namespace scopes. */
5995 if (!val
|| val_is_implicit_typename
)
5997 t
= unqualified_namespace_lookup (name
, flags
, 0);
6000 if (val_is_implicit_typename
&& !yylex
)
6001 warn_about_implicit_typename_lookup (val
, t
);
6009 /* This should only warn about types used in qualified-ids. */
6010 if (from_obj
&& from_obj
!= val
)
6012 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
6013 && TREE_CODE (val
) == TYPE_DECL
6014 && TREE_TYPE (from_obj
) != TREE_TYPE (val
))
6016 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
6017 name
, got_object
, TREE_TYPE (from_obj
));
6018 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
6022 /* We don't change val to from_obj if got_object depends on
6023 template parms because that breaks implicit typename for
6024 destructor calls. */
6025 if (! uses_template_parms (got_object
))
6029 /* If we have a single function from a using decl, pull it out. */
6030 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
6031 val
= OVL_FUNCTION (val
);
6040 lookup_name_nonclass (name
)
6043 return lookup_name_real (name
, 0, 1, 0);
6047 lookup_function_nonclass (name
, args
)
6051 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
6055 lookup_name_namespace_only (name
)
6058 /* type-or-namespace, nonclass, namespace_only */
6059 return lookup_name_real (name
, 1, 1, 1);
6063 lookup_name (name
, prefer_type
)
6067 return lookup_name_real (name
, prefer_type
, 0, 0);
6070 /* Similar to `lookup_name' but look only in the innermost non-class
6074 lookup_name_current_level (name
)
6077 struct binding_level
*b
;
6080 b
= current_binding_level
;
6081 while (b
->parm_flag
== 2)
6086 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
6088 /* extern "C" function() */
6089 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
6092 else if (IDENTIFIER_BINDING (name
)
6093 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
6097 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
6098 return IDENTIFIER_VALUE (name
);
6110 /* Like lookup_name_current_level, but for types. */
6113 lookup_type_current_level (name
)
6116 register tree t
= NULL_TREE
;
6118 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
6120 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
6121 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
6123 struct binding_level
*b
= current_binding_level
;
6126 if (purpose_member (name
, b
->type_shadowed
))
6127 return REAL_IDENTIFIER_TYPE_VALUE (name
);
6139 begin_only_namespace_names ()
6141 only_namespace_names
= 1;
6145 end_only_namespace_names ()
6147 only_namespace_names
= 0;
6150 /* Push the declarations of builtin types into the namespace.
6151 RID_INDEX, if < CP_RID_MAX is the index of the builtin type
6152 in the array RID_POINTERS. NAME is the name used when looking
6153 up the builtin type. TYPE is the _TYPE node for the builtin type. */
6156 record_builtin_type (rid_index
, name
, type
)
6161 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
6162 tree tdecl
= NULL_TREE
;
6164 if ((int) rid_index
< (int) CP_RID_MAX
)
6165 rname
= ridpointers
[(int) rid_index
];
6167 tname
= get_identifier (name
);
6169 TYPE_BUILT_IN (type
) = 1;
6173 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
6174 set_identifier_type_value (tname
, NULL_TREE
);
6175 if ((int) rid_index
< (int) CP_RID_MAX
)
6176 /* Built-in types live in the global namespace. */
6177 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
6179 if (rname
!= NULL_TREE
)
6181 if (tname
!= NULL_TREE
)
6183 set_identifier_type_value (rname
, NULL_TREE
);
6184 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
6188 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
6189 set_identifier_type_value (rname
, NULL_TREE
);
6194 /* Record one of the standard Java types.
6195 * Declare it as having the given NAME.
6196 * If SIZE > 0, it is the size of one of the integral types;
6197 * otherwise it is the negative of the size of one of the other types. */
6200 record_builtin_java_type (name
, size
)
6206 type
= make_signed_type (size
);
6207 else if (size
> -32)
6208 { /* "__java_char" or ""__java_boolean". */
6209 type
= make_unsigned_type (-size
);
6210 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
6213 { /* "__java_float" or ""__java_double". */
6214 type
= make_node (REAL_TYPE
);
6215 TYPE_PRECISION (type
) = - size
;
6218 record_builtin_type (CP_RID_MAX
, name
, type
);
6219 decl
= TYPE_NAME (type
);
6221 /* Suppress generate debug symbol entries for these types,
6222 since for normal C++ they are just clutter.
6223 However, push_lang_context undoes this if extern "Java" is seen. */
6224 DECL_IGNORED_P (decl
) = 1;
6226 TYPE_FOR_JAVA (type
) = 1;
6230 /* Push a type into the namespace so that the back-ends ignore it. */
6233 record_unknown_type (type
, name
)
6237 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
6238 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
6239 DECL_IGNORED_P (decl
) = 1;
6240 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
6241 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
6242 TYPE_ALIGN (type
) = 1;
6243 TYPE_USER_ALIGN (type
) = 0;
6244 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
6247 /* An string for which we should create an IDENTIFIER_NODE at
6250 typedef struct predefined_identifier
6252 /* The name of the identifier. */
6254 /* The place where the IDENTIFIER_NODE should be stored. */
6256 /* Non-zero if this is the name of a constructor or destructor. */
6258 } predefined_identifier
;
6260 /* Create all the predefined identifiers. */
6263 initialize_predefined_identifiers ()
6265 struct predefined_identifier
*pid
;
6267 /* A table of identifiers to create at startup. */
6268 static predefined_identifier predefined_identifiers
[] = {
6269 { "C++", &lang_name_cplusplus
, 0 },
6270 { "C", &lang_name_c
, 0 },
6271 { "Java", &lang_name_java
, 0 },
6272 { CTOR_NAME
, &ctor_identifier
, 1 },
6273 { "__base_ctor", &base_ctor_identifier
, 1 },
6274 { "__comp_ctor", &complete_ctor_identifier
, 1 },
6275 { DTOR_NAME
, &dtor_identifier
, 1 },
6276 { "__comp_dtor", &complete_dtor_identifier
, 1 },
6277 { "__base_dtor", &base_dtor_identifier
, 1 },
6278 { "__deleting_dtor", &deleting_dtor_identifier
, 1 },
6279 { VTABLE_DELTA2_NAME
, &delta2_identifier
, 0 },
6280 { VTABLE_DELTA_NAME
, &delta_identifier
, 0 },
6281 { IN_CHARGE_NAME
, &in_charge_identifier
, 0 },
6282 { VTABLE_INDEX_NAME
, &index_identifier
, 0 },
6283 { "nelts", &nelts_identifier
, 0 },
6284 { THIS_NAME
, &this_identifier
, 0 },
6285 { VTABLE_PFN_NAME
, &pfn_identifier
, 0 },
6286 { "__pfn_or_delta2", &pfn_or_delta2_identifier
, 0 },
6287 { "_vptr", &vptr_identifier
, 0 },
6288 { "__cp_push_exception", &cp_push_exception_identifier
, 0 },
6289 { "__vtt_parm", &vtt_parm_identifier
, 0 },
6290 { "std", &std_identifier
, 0 },
6294 for (pid
= predefined_identifiers
; pid
->name
; ++pid
)
6296 *pid
->node
= get_identifier (pid
->name
);
6297 if (pid
->ctor_or_dtor_p
)
6298 IDENTIFIER_CTOR_OR_DTOR_P (*pid
->node
) = 1;
6302 /* Create the predefined scalar types of C,
6303 and some nodes representing standard constants (0, 1, (void *)0).
6304 Initialize the global binding level.
6305 Make definitions for built-in primitive functions. */
6308 init_decl_processing ()
6311 int wchar_type_size
;
6312 tree array_domain_type
;
6314 /* Check to see that the user did not specify an invalid combination
6315 of command-line options. */
6316 if (flag_new_abi
&& !flag_vtable_thunks
)
6317 fatal ("the new ABI requires vtable thunks");
6319 /* Create all the identifiers we need. */
6320 initialize_predefined_identifiers ();
6322 /* Let the back-end now how to save and restore language-specific
6323 per-function globals. */
6324 init_lang_status
= &push_cp_function_context
;
6325 free_lang_status
= &pop_cp_function_context
;
6326 mark_lang_status
= &mark_cp_function_context
;
6332 /* Create the global variables. */
6333 push_to_top_level ();
6335 /* Enter the global namespace. */
6336 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
6337 push_namespace (get_identifier ("::"));
6338 global_namespace
= current_namespace
;
6339 current_lang_name
= NULL_TREE
;
6341 /* Adjust various flags based on command-line settings. */
6342 if (! flag_permissive
&& ! pedantic
)
6343 flag_pedantic_errors
= 1;
6344 if (!flag_no_inline
)
6345 flag_inline_trees
= 1;
6348 current_lang_name
= lang_name_c
;
6350 current_function_decl
= NULL_TREE
;
6351 current_binding_level
= NULL_BINDING_LEVEL
;
6352 free_binding_level
= NULL_BINDING_LEVEL
;
6354 build_common_tree_nodes (flag_signed_char
);
6356 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6357 TREE_TYPE (error_mark_list
) = error_mark_node
;
6359 /* Make the binding_level structure for global names. */
6361 global_binding_level
= current_binding_level
;
6362 /* The global level is the namespace level of ::. */
6363 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6364 declare_namespace_level ();
6366 /* Define `int' and `char' first so that dbx will output them first. */
6367 record_builtin_type (RID_INT
, NULL_PTR
, integer_type_node
);
6368 record_builtin_type (RID_CHAR
, "char", char_type_node
);
6370 /* `signed' is the same as `int' */
6371 record_builtin_type (RID_SIGNED
, NULL_PTR
, integer_type_node
);
6372 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
6373 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
6374 record_builtin_type (CP_RID_MAX
, "long unsigned int",
6375 long_unsigned_type_node
);
6376 record_builtin_type (CP_RID_MAX
, "unsigned long", long_unsigned_type_node
);
6377 record_builtin_type (CP_RID_MAX
, "long long int",
6378 long_long_integer_type_node
);
6379 record_builtin_type (CP_RID_MAX
, "long long unsigned int",
6380 long_long_unsigned_type_node
);
6381 record_builtin_type (CP_RID_MAX
, "long long unsigned",
6382 long_long_unsigned_type_node
);
6383 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
6384 record_builtin_type (CP_RID_MAX
, "short unsigned int",
6385 short_unsigned_type_node
);
6386 record_builtin_type (CP_RID_MAX
, "unsigned short",
6387 short_unsigned_type_node
);
6390 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE
)));
6392 /* Define both `signed char' and `unsigned char'. */
6393 record_builtin_type (CP_RID_MAX
, "signed char", signed_char_type_node
);
6394 record_builtin_type (CP_RID_MAX
, "unsigned char", unsigned_char_type_node
);
6396 /* `unsigned long' is the standard type for sizeof.
6397 Note that stddef.h uses `unsigned long',
6398 and this must agree, even if long and int are the same size. */
6400 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE
))));
6402 /* Create the widest literal types. */
6403 widest_integer_literal_type_node
= make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
6404 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6405 widest_integer_literal_type_node
));
6407 widest_unsigned_literal_type_node
= make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
6408 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6409 widest_unsigned_literal_type_node
));
6411 /* These are types that type_for_size and type_for_mode use. */
6412 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intQI_type_node
));
6413 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intHI_type_node
));
6414 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intSI_type_node
));
6415 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intDI_type_node
));
6416 #if HOST_BITS_PER_WIDE_INT >= 64
6417 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__int128_t"), intTI_type_node
));
6419 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intQI_type_node
));
6420 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intHI_type_node
));
6421 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intSI_type_node
));
6422 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intDI_type_node
));
6423 #if HOST_BITS_PER_WIDE_INT >= 64
6424 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__uint128_t"), unsigned_intTI_type_node
));
6427 build_common_tree_nodes_2 (flag_short_double
);
6429 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6430 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6431 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6432 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6433 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6434 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6435 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6436 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6438 integer_two_node
= build_int_2 (2, 0);
6439 TREE_TYPE (integer_two_node
) = integer_type_node
;
6440 integer_three_node
= build_int_2 (3, 0);
6441 TREE_TYPE (integer_three_node
) = integer_type_node
;
6443 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6444 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6445 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6446 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6447 TYPE_PRECISION (boolean_type_node
) = 1;
6448 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6449 boolean_false_node
= build_int_2 (0, 0);
6450 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6451 boolean_true_node
= build_int_2 (1, 0);
6452 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6454 signed_size_zero_node
= build_int_2 (0, 0);
6455 record_builtin_type (RID_FLOAT
, NULL_PTR
, float_type_node
);
6456 record_builtin_type (RID_DOUBLE
, NULL_PTR
, double_type_node
);
6457 record_builtin_type (CP_RID_MAX
, "long double", long_double_type_node
);
6459 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex int"),
6460 complex_integer_type_node
));
6461 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex float"),
6462 complex_float_type_node
));
6463 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex double"),
6464 complex_double_type_node
));
6465 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
6466 complex_long_double_type_node
));
6468 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6470 record_builtin_type (RID_VOID
, NULL_PTR
, void_type_node
);
6471 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
6472 TREE_PARMLIST (void_list_node
) = 1;
6474 /* Used for expressions that do nothing, but are not errors. */
6475 void_zero_node
= build_int_2 (0, 0);
6476 TREE_TYPE (void_zero_node
) = void_type_node
;
6478 string_type_node
= build_pointer_type (char_type_node
);
6479 const_string_type_node
6480 = build_pointer_type (build_qualified_type (char_type_node
,
6482 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6484 record_builtin_type (CP_RID_MAX
, NULL_PTR
, string_type_node
);
6487 /* Make a type to be the domain of a few array types
6488 whose domains don't really matter.
6489 200 is small enough that it always fits in size_t. */
6490 array_domain_type
= build_index_type (build_int_2 (200, 0));
6492 /* Make a type for arrays of characters.
6493 With luck nothing will ever really depend on the length of this
6495 char_array_type_node
6496 = build_array_type (char_type_node
, array_domain_type
);
6498 /* Likewise for arrays of ints. */
6500 = build_array_type (integer_type_node
, array_domain_type
);
6503 delta_type_node
= ptrdiff_type_node
;
6504 else if (flag_huge_objects
)
6505 delta_type_node
= long_integer_type_node
;
6507 delta_type_node
= short_integer_type_node
;
6510 vtable_index_type
= ptrdiff_type_node
;
6512 vtable_index_type
= delta_type_node
;
6514 default_function_type
6515 = build_function_type (integer_type_node
, NULL_TREE
);
6517 ptr_type_node
= build_pointer_type (void_type_node
);
6519 = build_pointer_type (build_qualified_type (void_type_node
,
6521 vtt_parm_type
= build_pointer_type (const_ptr_type_node
);
6522 c_common_nodes_and_builtins (1, flag_no_builtin
, flag_no_nonansi_builtin
);
6523 lang_type_promotes_to
= convert_type_from_ellipsis
;
6526 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6528 /* C++ extensions */
6530 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6531 record_unknown_type (unknown_type_node
, "unknown type");
6533 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6534 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6536 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6538 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6540 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6541 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6543 /* This is special for C++ so functions can be overloaded. */
6544 wchar_type_node
= get_identifier (flag_short_wchar
6545 ? "short unsigned int"
6547 wchar_type_node
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (wchar_type_node
));
6548 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
6549 if (TREE_UNSIGNED (wchar_type_node
))
6550 wchar_type_node
= make_signed_type (wchar_type_size
);
6552 wchar_type_node
= make_unsigned_type (wchar_type_size
);
6553 record_builtin_type (RID_WCHAR
, "__wchar_t", wchar_type_node
);
6555 /* Artificial declaration of wchar_t -- can be bashed */
6556 wchar_decl_node
= build_decl (TYPE_DECL
, get_identifier ("wchar_t"),
6558 pushdecl (wchar_decl_node
);
6560 /* This is for wide string constants. */
6561 wchar_array_type_node
6562 = build_array_type (wchar_type_node
, array_domain_type
);
6564 if (flag_vtable_thunks
)
6566 /* Make sure we get a unique function type, so we can give
6567 its pointer type a name. (This wins for gdb.) */
6568 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6569 TREE_TYPE (vfunc_type
) = integer_type_node
;
6570 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6571 layout_type (vfunc_type
);
6573 vtable_entry_type
= build_pointer_type (vfunc_type
);
6577 vtable_entry_type
= make_aggr_type (RECORD_TYPE
);
6578 fields
[0] = build_decl (FIELD_DECL
, delta_identifier
,
6580 fields
[1] = build_decl (FIELD_DECL
, index_identifier
,
6582 fields
[2] = build_decl (FIELD_DECL
, pfn_identifier
,
6584 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6587 /* Make this part of an invisible union. */
6588 fields
[3] = copy_node (fields
[2]);
6589 TREE_TYPE (fields
[3]) = delta_type_node
;
6590 DECL_NAME (fields
[3]) = delta2_identifier
;
6591 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6592 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6593 DECL_SIZE_UNIT (fields
[3]) = TYPE_SIZE_UNIT (delta_type_node
);
6594 TREE_UNSIGNED (fields
[3]) = 0;
6595 TREE_CHAIN (fields
[2]) = fields
[3];
6596 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6599 record_builtin_type (CP_RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6602 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6603 layout_type (vtbl_type_node
);
6604 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6605 record_builtin_type (CP_RID_MAX
, NULL_PTR
, vtbl_type_node
);
6606 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6607 layout_type (vtbl_ptr_type_node
);
6608 record_builtin_type (CP_RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6610 std_node
= build_decl (NAMESPACE_DECL
,
6612 ? get_identifier ("fake std") : std_identifier
,
6614 pushdecl (std_node
);
6618 push_namespace (get_identifier ("__cxxabiv1"));
6619 abi_node
= current_namespace
;
6623 global_type_node
= make_node (LANG_TYPE
);
6624 record_unknown_type (global_type_node
, "global type");
6627 current_lang_name
= lang_name_cplusplus
;
6630 tree bad_alloc_type_node
, newtype
, deltype
;
6632 push_namespace (get_identifier ("std"));
6633 bad_alloc_type_node
= xref_tag
6634 (class_type_node
, get_identifier ("bad_alloc"), 1);
6637 newtype
= build_exception_variant
6638 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6639 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6640 push_cp_library_fn (NEW_EXPR
, newtype
);
6641 push_cp_library_fn (VEC_NEW_EXPR
, newtype
);
6642 global_delete_fndecl
= push_cp_library_fn (DELETE_EXPR
, deltype
);
6643 push_cp_library_fn (VEC_DELETE_EXPR
, deltype
);
6647 = build_library_fn_ptr ("__pure_virtual", void_ftype
);
6649 /* Perform other language dependent initializations. */
6650 init_class_processing ();
6651 init_init_processing ();
6652 init_search_processing ();
6653 init_rtti_processing ();
6655 if (flag_exceptions
)
6656 init_exception_processing ();
6659 flag_inline_functions
= 0;
6662 if (! supports_one_only ())
6665 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6666 function_id_node
= get_identifier ("__FUNCTION__");
6667 pretty_function_id_node
= get_identifier ("__PRETTY_FUNCTION__");
6668 func_id_node
= get_identifier ("__func__");
6670 make_fname_decl
= cp_make_fname_decl
;
6671 declare_function_name ();
6673 /* Prepare to check format strings against argument lists. */
6674 init_function_format_info ();
6676 /* Show we use EH for cleanups. */
6677 using_eh_for_cleanups ();
6679 valid_lang_attribute
= cp_valid_lang_attribute
;
6681 /* Maintain consistency. Perhaps we should just complain if they
6682 say -fwritable-strings? */
6683 if (flag_writable_strings
)
6684 flag_const_strings
= 0;
6686 /* Add GC roots for all of our global variables. */
6687 ggc_add_tree_root (c_global_trees
, sizeof c_global_trees
/ sizeof(tree
));
6688 ggc_add_tree_root (cp_global_trees
, sizeof cp_global_trees
/ sizeof(tree
));
6689 ggc_add_tree_root (&integer_three_node
, 1);
6690 ggc_add_tree_root (&integer_two_node
, 1);
6691 ggc_add_tree_root (&signed_size_zero_node
, 1);
6692 ggc_add_tree_root (&size_one_node
, 1);
6693 ggc_add_tree_root (&size_zero_node
, 1);
6694 ggc_add_root (&global_binding_level
, 1, sizeof global_binding_level
,
6695 mark_binding_level
);
6696 ggc_add_root (&scope_chain
, 1, sizeof scope_chain
, &mark_saved_scope
);
6697 ggc_add_tree_root (&static_ctors
, 1);
6698 ggc_add_tree_root (&static_dtors
, 1);
6699 ggc_add_tree_root (&lastiddecl
, 1);
6701 ggc_add_tree_root (&last_function_parm_tags
, 1);
6702 ggc_add_tree_root (¤t_function_return_value
, 1);
6703 ggc_add_tree_root (¤t_function_parms
, 1);
6704 ggc_add_tree_root (¤t_function_parm_tags
, 1);
6705 ggc_add_tree_root (&last_function_parms
, 1);
6706 ggc_add_tree_root (&error_mark_list
, 1);
6708 ggc_add_tree_root (&global_namespace
, 1);
6709 ggc_add_tree_root (&global_type_node
, 1);
6710 ggc_add_tree_root (&anonymous_namespace_name
, 1);
6712 ggc_add_tree_root (&got_object
, 1);
6713 ggc_add_tree_root (&got_scope
, 1);
6715 ggc_add_tree_root (¤t_lang_name
, 1);
6716 ggc_add_tree_root (&static_aggregates
, 1);
6719 /* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the
6720 decl, NAME is the initialization string and TYPE_DEP indicates whether
6721 NAME depended on the type of the function. We make use of that to detect
6722 __PRETTY_FUNCTION__ inside a template fn. Because we build a tree for
6723 the function before emitting any of it, we don't need to treat the
6724 VAR_DECL specially. We can decide whether to emit it later, if it was
6728 cp_make_fname_decl (id
, name
, type_dep
)
6733 tree decl
, type
, init
;
6734 size_t length
= strlen (name
);
6735 tree domain
= NULL_TREE
;
6737 if (!processing_template_decl
)
6740 domain
= build_index_type (build_int_2 (length
, 0));
6742 type
= build_cplus_array_type
6743 (build_qualified_type (char_type_node
, TYPE_QUAL_CONST
),
6746 decl
= build_decl (VAR_DECL
, id
, type
);
6747 TREE_STATIC (decl
) = 1;
6748 TREE_READONLY (decl
) = 1;
6749 DECL_SOURCE_LINE (decl
) = 0;
6750 DECL_ARTIFICIAL (decl
) = 1;
6751 DECL_IN_SYSTEM_HEADER (decl
) = 1;
6753 if (processing_template_decl
)
6754 decl
= push_template_decl (decl
);
6757 init
= build (FUNCTION_NAME
, type
);
6758 DECL_PRETTY_FUNCTION_P (decl
) = 1;
6762 init
= build_string (length
+ 1, name
);
6763 TREE_TYPE (init
) = type
;
6765 DECL_INITIAL (decl
) = init
;
6766 cp_finish_decl (decl
, init
, NULL_TREE
, LOOKUP_ONLYCONVERTING
);
6768 /* We will have to make sure we only emit this, if it is actually used. */
6772 /* Entry point for the benefit of c_common_nodes_and_builtins.
6774 Make a definition for a builtin function named NAME and whose data type
6775 is TYPE. TYPE should be a function type with argument types.
6777 CLASS and CODE tell later passes how to compile calls to this function.
6778 See tree.h for possible values.
6780 If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6781 the name to be called if we can't opencode the function. */
6784 builtin_function (name
, type
, code
, class, libname
)
6788 enum built_in_class
class;
6789 const char *libname
;
6791 tree decl
= build_library_fn_1 (get_identifier (name
), ERROR_MARK
, type
);
6792 DECL_BUILT_IN_CLASS (decl
) = class;
6793 DECL_FUNCTION_CODE (decl
) = code
;
6795 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6797 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6798 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6799 function in the namespace. */
6802 DECL_ASSEMBLER_NAME (decl
) = get_identifier (libname
);
6803 make_function_rtl (decl
);
6805 /* Warn if a function in the namespace for users
6806 is used without an occasion to consider it declared. */
6807 if (name
[0] != '_' || name
[1] != '_')
6808 DECL_ANTICIPATED (decl
) = 1;
6813 /* Generate a FUNCTION_DECL with the typical flags for a runtime library
6814 function. Not called directly. */
6817 build_library_fn_1 (name
, operator_code
, type
)
6819 enum tree_code operator_code
;
6822 tree fn
= build_lang_decl (FUNCTION_DECL
, name
, type
);
6823 DECL_EXTERNAL (fn
) = 1;
6824 TREE_PUBLIC (fn
) = 1;
6825 DECL_ARTIFICIAL (fn
) = 1;
6826 TREE_NOTHROW (fn
) = 1;
6827 SET_OVERLOADED_OPERATOR_CODE (fn
, operator_code
);
6831 /* Returns the _DECL for a library function with C linkage.
6832 We assume that such functions never throw; if this is incorrect,
6833 callers should unset TREE_NOTHROW. */
6836 build_library_fn (name
, type
)
6840 tree fn
= build_library_fn_1 (name
, ERROR_MARK
, type
);
6841 make_function_rtl (fn
);
6845 /* Returns the _DECL for a library function with C++ linkage. */
6848 build_cp_library_fn (name
, operator_code
, type
)
6850 enum tree_code operator_code
;
6853 tree fn
= build_library_fn_1 (name
, operator_code
, type
);
6854 TREE_NOTHROW (fn
) = TYPE_NOTHROW_P (type
);
6855 DECL_CONTEXT (fn
) = FROB_CONTEXT (current_namespace
);
6856 set_mangled_name_for_decl (fn
);
6857 make_function_rtl (fn
);
6861 /* Like build_library_fn, but takes a C string instead of an
6865 build_library_fn_ptr (name
, type
)
6869 return build_library_fn (get_identifier (name
), type
);
6872 /* Like build_cp_library_fn, but takes a C string instead of an
6876 build_cp_library_fn_ptr (name
, type
)
6880 return build_cp_library_fn (get_identifier (name
), ERROR_MARK
, type
);
6883 /* Like build_library_fn, but also pushes the function so that we will
6884 be able to find it via IDENTIFIER_GLOBAL_VALUE. */
6887 push_library_fn (name
, type
)
6890 tree fn
= build_library_fn (name
, type
);
6891 pushdecl_top_level (fn
);
6895 /* Like build_cp_library_fn, but also pushes the function so that it
6896 will be found by normal lookup. */
6899 push_cp_library_fn (operator_code
, type
)
6900 enum tree_code operator_code
;
6903 tree fn
= build_cp_library_fn (ansi_opname (operator_code
),
6910 /* Like push_library_fn, but takes a TREE_LIST of parm types rather than
6914 push_void_library_fn (name
, parmtypes
)
6915 tree name
, parmtypes
;
6917 tree type
= build_function_type (void_type_node
, parmtypes
);
6918 return push_library_fn (name
, type
);
6921 /* Like push_library_fn, but also note that this function throws
6922 and does not return. Used for __throw_foo and the like. */
6925 push_throw_library_fn (name
, type
)
6928 tree fn
= push_library_fn (name
, type
);
6929 TREE_THIS_VOLATILE (fn
) = 1;
6930 TREE_NOTHROW (fn
) = 0;
6934 /* When we call finish_struct for an anonymous union, we create
6935 default copy constructors and such. But, an anonymous union
6936 shouldn't have such things; this function undoes the damage to the
6937 anonymous union type T.
6939 (The reason that we create the synthesized methods is that we don't
6940 distinguish `union { int i; }' from `typedef union { int i; } U'.
6941 The first is an anonymous union; the second is just an ordinary
6945 fixup_anonymous_aggr (t
)
6950 /* Wipe out memory of synthesized methods */
6951 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6952 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6953 TYPE_HAS_INIT_REF (t
) = 0;
6954 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6955 TYPE_HAS_ASSIGN_REF (t
) = 0;
6956 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6958 /* Splice the implicitly generated functions out of the TYPE_METHODS
6960 q
= &TYPE_METHODS (t
);
6963 if (DECL_ARTIFICIAL (*q
))
6964 *q
= TREE_CHAIN (*q
);
6966 q
= &TREE_CHAIN (*q
);
6969 /* ISO C++ 9.5.3. Anonymous unions may not have function members. */
6970 if (TYPE_METHODS (t
))
6971 error ("an anonymous union cannot have function members");
6974 /* Make sure that a declaration with no declarator is well-formed, i.e.
6975 just defines a tagged type or anonymous union.
6977 Returns the type defined, if any. */
6980 check_tag_decl (declspecs
)
6985 tree ob_modifier
= NULL_TREE
;
6987 register tree t
= NULL_TREE
;
6989 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6991 register tree value
= TREE_VALUE (link
);
6994 || (TREE_CODE (value
) == IDENTIFIER_NODE
6995 && IDENTIFIER_GLOBAL_VALUE (value
)
6996 && TYPE_P (IDENTIFIER_GLOBAL_VALUE (value
))))
7000 if ((TREE_CODE (value
) != TYPENAME_TYPE
&& IS_AGGR_TYPE (value
))
7001 || TREE_CODE (value
) == ENUMERAL_TYPE
)
7003 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
7007 else if (value
== ridpointers
[(int) RID_FRIEND
])
7009 if (current_class_type
== NULL_TREE
7010 || current_scope () != current_class_type
)
7011 ob_modifier
= value
;
7015 else if (value
== ridpointers
[(int) RID_STATIC
]
7016 || value
== ridpointers
[(int) RID_EXTERN
]
7017 || value
== ridpointers
[(int) RID_AUTO
]
7018 || value
== ridpointers
[(int) RID_REGISTER
]
7019 || value
== ridpointers
[(int) RID_INLINE
]
7020 || value
== ridpointers
[(int) RID_VIRTUAL
]
7021 || value
== ridpointers
[(int) RID_CONST
]
7022 || value
== ridpointers
[(int) RID_VOLATILE
]
7023 || value
== ridpointers
[(int) RID_EXPLICIT
])
7024 ob_modifier
= value
;
7028 error ("multiple types in one declaration");
7030 if (t
== NULL_TREE
&& ! saw_friend
)
7031 pedwarn ("declaration does not declare anything");
7033 /* Check for an anonymous union. We're careful
7034 accessing TYPE_IDENTIFIER because some built-in types, like
7035 pointer-to-member types, do not have TYPE_NAME. */
7036 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
7038 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
7040 /* Anonymous unions are objects, so they can have specifiers. */;
7041 SET_ANON_AGGR_TYPE_P (t
);
7043 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
7044 pedwarn ("ISO C++ prohibits anonymous structs");
7047 else if (ob_modifier
)
7049 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
7050 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
7051 cp_error ("`%D' can only be specified for functions", ob_modifier
);
7052 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
7053 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
7054 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
7055 cp_error ("`%D' can only be specified for constructors",
7058 cp_error ("`%D' can only be specified for objects and functions",
7065 /* Called when a declaration is seen that contains no names to declare.
7066 If its type is a reference to a structure, union or enum inherited
7067 from a containing scope, shadow that tag name for the current scope
7068 with a forward reference.
7069 If its type defines a new named structure or union
7070 or defines an enum, it is valid but we need not do anything here.
7071 Otherwise, it is an error.
7073 C++: may have to grok the declspecs to learn about static,
7074 complain for anonymous unions. */
7077 shadow_tag (declspecs
)
7080 tree t
= check_tag_decl (declspecs
);
7083 maybe_process_partial_specialization (t
);
7085 /* This is where the variables in an anonymous union are
7086 declared. An anonymous union declaration looks like:
7088 because there is no declarator after the union, the parser
7089 sends that declaration here. */
7090 if (t
&& ANON_AGGR_TYPE_P (t
))
7092 fixup_anonymous_aggr (t
);
7094 if (TYPE_FIELDS (t
))
7096 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
7098 finish_anon_union (decl
);
7103 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
7106 groktypename (typename
)
7109 if (TREE_CODE (typename
) != TREE_LIST
)
7111 return grokdeclarator (TREE_VALUE (typename
),
7112 TREE_PURPOSE (typename
),
7113 TYPENAME
, 0, NULL_TREE
);
7116 /* Decode a declarator in an ordinary declaration or data definition.
7117 This is called as soon as the type information and variable name
7118 have been parsed, before parsing the initializer if any.
7119 Here we create the ..._DECL node, fill in its type,
7120 and put it on the list of decls for the current context.
7121 The ..._DECL node is returned as the value.
7123 Exception: for arrays where the length is not specified,
7124 the type is left null, to be filled in by `cp_finish_decl'.
7126 Function definitions do not come here; they go to start_function
7127 instead. However, external and forward declarations of functions
7128 do go through here. Structure field declarations are done by
7129 grokfield and not through here. */
7132 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
7133 tree declarator
, declspecs
;
7135 tree attributes
, prefix_attributes
;
7138 register tree type
, tem
;
7140 extern int have_extern_spec
;
7141 extern int used_extern_spec
;
7145 /* See code below that used this. */
7146 int init_written
= initialized
;
7149 /* This should only be done once on the top most decl. */
7150 if (have_extern_spec
&& !used_extern_spec
)
7152 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"),
7154 used_extern_spec
= 1;
7157 if (attributes
|| prefix_attributes
)
7158 attrlist
= build_tree_list (attributes
, prefix_attributes
);
7160 attrlist
= NULL_TREE
;
7162 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
7165 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
7168 type
= TREE_TYPE (decl
);
7170 if (type
== error_mark_node
)
7173 context
= DECL_CONTEXT (decl
);
7175 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
7176 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
7178 /* When parsing the initializer, lookup should use the object's
7180 push_decl_namespace (context
);
7183 /* We are only interested in class contexts, later. */
7184 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
7185 context
= NULL_TREE
;
7188 /* Is it valid for this decl to have an initializer at all?
7189 If not, set INITIALIZED to zero, which will indirectly
7190 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7191 switch (TREE_CODE (decl
))
7194 /* typedef foo = bar means give foo the same type as bar.
7195 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
7196 Any other case of an initialization in a TYPE_DECL is an error. */
7197 if (pedantic
|| list_length (declspecs
) > 1)
7199 cp_error ("typedef `%D' is initialized", decl
);
7205 cp_error ("function `%#D' is initialized like a variable", decl
);
7215 if (! toplevel_bindings_p ()
7216 && DECL_EXTERNAL (decl
))
7217 cp_warning ("declaration of `%#D' has `extern' and is initialized",
7219 DECL_EXTERNAL (decl
) = 0;
7220 if (toplevel_bindings_p ())
7221 TREE_STATIC (decl
) = 1;
7223 /* Tell `pushdecl' this is an initialized decl
7224 even though we don't yet have the initializer expression.
7225 Also tell `cp_finish_decl' it may store the real initializer. */
7226 DECL_INITIAL (decl
) = error_mark_node
;
7229 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
7230 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
7233 /* Set attributes here so if duplicate decl, will have proper attributes. */
7234 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
7236 if (context
&& COMPLETE_TYPE_P (complete_type (context
)))
7238 push_nested_class (context
, 2);
7240 if (TREE_CODE (decl
) == VAR_DECL
)
7242 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
7243 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
7244 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
7247 if (DECL_CONTEXT (field
) != context
)
7249 cp_pedwarn ("ISO C++ does not permit `%T::%D' to be defined as `%T::%D'",
7250 DECL_CONTEXT (field
), DECL_NAME (decl
),
7251 context
, DECL_NAME (decl
));
7252 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
7254 /* Static data member are tricky; an in-class initialization
7255 still doesn't provide a definition, so the in-class
7256 declaration will have DECL_EXTERNAL set, but will have an
7257 initialization. Thus, duplicate_decls won't warn
7258 about this situation, and so we check here. */
7259 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
7260 cp_error ("duplicate initialization of %D", decl
);
7261 if (duplicate_decls (decl
, field
))
7267 tree field
= check_classfn (context
, decl
);
7268 if (field
&& duplicate_decls (decl
, field
))
7272 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
7273 DECL_IN_AGGR_P (decl
) = 0;
7274 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
7275 || CLASSTYPE_TEMPLATE_INSTANTIATION (context
))
7277 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
7278 /* [temp.expl.spec] An explicit specialization of a static data
7279 member of a template is a definition if the declaration
7280 includes an initializer; otherwise, it is a declaration.
7282 We check for processing_specialization so this only applies
7283 to the new specialization syntax. */
7284 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
7285 DECL_EXTERNAL (decl
) = 1;
7288 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
7289 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
7293 /* Enter this declaration into the symbol table. */
7294 tem
= maybe_push_decl (decl
);
7296 if (processing_template_decl
)
7297 tem
= push_template_decl (tem
);
7299 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7300 /* Tell the back-end to use or not use .common as appropriate. If we say
7301 -fconserve-space, we want this to save .data space, at the expense of
7302 wrong semantics. If we say -fno-conserve-space, we want this to
7303 produce errors about redefs; to do this we force variables into the
7305 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
7308 if (! processing_template_decl
)
7318 tree type
= TREE_TYPE (decl
);
7319 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
7321 if (type
== error_mark_node
)
7324 /* If this type of object needs a cleanup, but we're not allowed to
7325 add any more objects with cleanups to the current scope, create a
7326 new binding level. */
7327 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
7328 && current_binding_level
->more_cleanups_ok
== 0)
7330 keep_next_level (2);
7333 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/1);
7337 /* Is it valid for this decl to have an initializer at all?
7338 If not, set INITIALIZED to zero, which will indirectly
7339 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7341 /* Don't allow initializations for incomplete types except for
7342 arrays which might be completed by the initialization. */
7343 if (COMPLETE_TYPE_P (complete_type (type
)))
7344 ; /* A complete type is ok. */
7345 else if (TREE_CODE (type
) != ARRAY_TYPE
)
7347 cp_error ("variable `%#D' has initializer but incomplete type",
7350 type
= TREE_TYPE (decl
) = error_mark_node
;
7352 else if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (type
))))
7354 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
7355 cp_error ("elements of array `%#D' have incomplete type", decl
);
7356 /* else we already gave an error in start_decl. */
7362 && TREE_CODE (decl
) != TYPE_DECL
7363 && TREE_CODE (decl
) != TEMPLATE_DECL
7364 && type
!= error_mark_node
7365 && IS_AGGR_TYPE (type
)
7366 && ! DECL_EXTERNAL (decl
))
7368 if ((! processing_template_decl
|| ! uses_template_parms (type
))
7369 && !COMPLETE_TYPE_P (complete_type (type
)))
7371 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
7373 /* Change the type so that assemble_variable will give
7374 DECL an rtl we can live with: (mem (const_int 0)). */
7375 type
= TREE_TYPE (decl
) = error_mark_node
;
7379 /* If any base type in the hierarchy of TYPE needs a constructor,
7380 then we set initialized to 1. This way any nodes which are
7381 created for the purposes of initializing this aggregate
7382 will live as long as it does. This is necessary for global
7383 aggregates which do not have their initializers processed until
7384 the end of the file. */
7385 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
7390 DECL_INITIAL (decl
) = NULL_TREE
;
7393 /* Handle initialization of references.
7394 These three arguments are from `cp_finish_decl', and have the
7395 same meaning here that they do there.
7397 Quotes on semantics can be found in ARM 8.4.3. */
7400 grok_reference_init (decl
, type
, init
)
7401 tree decl
, type
, init
;
7405 if (init
== NULL_TREE
)
7407 if ((DECL_LANG_SPECIFIC (decl
) == 0
7408 || DECL_IN_AGGR_P (decl
) == 0)
7409 && ! DECL_THIS_EXTERN (decl
))
7410 cp_error ("`%D' declared as reference but not initialized", decl
);
7414 if (init
== error_mark_node
)
7417 if (TREE_CODE (init
) == CONSTRUCTOR
)
7419 cp_error ("ISO C++ forbids use of initializer list to initialize reference `%D'", decl
);
7423 if (TREE_CODE (init
) == TREE_LIST
)
7424 init
= build_compound_expr (init
);
7426 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
7427 init
= convert_from_reference (init
);
7429 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
7430 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
7432 /* Note: default conversion is only called in very special cases. */
7433 init
= default_conversion (init
);
7436 /* Convert INIT to the reference type TYPE. This may involve the
7437 creation of a temporary, whose lifetime must be the same as that
7438 of the reference. If so, a DECL_STMT for the temporary will be
7439 added just after the DECL_STMT for DECL. That's why we don't set
7440 DECL_INITIAL for local references (instead assigning to them
7441 explicitly); we need to allow the temporary to be initialized
7443 tmp
= convert_to_reference
7444 (type
, init
, CONV_IMPLICIT
,
7445 LOOKUP_ONLYCONVERTING
|LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
,
7448 if (tmp
== error_mark_node
)
7450 else if (tmp
!= NULL_TREE
)
7453 tmp
= save_expr (tmp
);
7454 if (building_stmt_tree ())
7456 /* Initialize the declaration. */
7457 tmp
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, tmp
);
7458 finish_expr_stmt (tmp
);
7461 DECL_INITIAL (decl
) = tmp
;
7465 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7469 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
7471 expand_static_init (decl
, DECL_INITIAL (decl
));
7472 DECL_INITIAL (decl
) = NULL_TREE
;
7477 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7478 mucking with forces it does not comprehend (i.e. initialization with a
7479 constructor). If we are at global scope and won't go into COMMON, fill
7480 it in with a dummy CONSTRUCTOR to force the variable into .data;
7481 otherwise we can use error_mark_node. */
7484 obscure_complex_init (decl
, init
)
7487 if (! flag_no_inline
&& TREE_STATIC (decl
))
7489 if (extract_init (decl
, init
))
7493 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7494 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7495 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7499 DECL_INITIAL (decl
) = error_mark_node
;
7504 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7505 array until we finish parsing the initializer. If that's the
7506 situation we're in, update DECL accordingly. */
7509 maybe_deduce_size_from_array_init (decl
, init
)
7513 tree type
= TREE_TYPE (decl
);
7515 if (TREE_CODE (type
) == ARRAY_TYPE
7516 && TYPE_DOMAIN (type
) == NULL_TREE
7517 && TREE_CODE (decl
) != TYPE_DECL
)
7520 = (TREE_STATIC (decl
)
7521 /* Even if pedantic, an external linkage array
7522 may have incomplete type at first. */
7523 ? pedantic
&& ! DECL_EXTERNAL (decl
)
7524 : !DECL_EXTERNAL (decl
));
7525 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7526 int failure
= complete_array_type (type
, initializer
, do_default
);
7529 cp_error ("initializer fails to determine size of `%D'", decl
);
7534 cp_error ("array size missing in `%D'", decl
);
7535 /* If a `static' var's size isn't known, make it extern as
7536 well as static, so it does not get allocated. If it's not
7537 `static', then don't mark it extern; finish_incomplete_decl
7538 will give it a default size and it will get allocated. */
7539 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7540 DECL_EXTERNAL (decl
) = 1;
7543 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7544 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7546 cp_error ("zero-size array `%D'", decl
);
7548 layout_decl (decl
, 0);
7552 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7553 any appropriate error messages regarding the layout. */
7556 layout_var_decl (decl
)
7559 tree type
= TREE_TYPE (decl
);
7561 tree ttype
= target_type (type
);
7564 /* If we haven't already layed out this declaration, do so now.
7565 Note that we must not call complete type for an external object
7566 because it's type might involve templates that we are not
7567 supposed to isntantiate yet. (And it's perfectly legal to say
7568 `extern X x' for some incomplete type `X'.) */
7569 if (!DECL_EXTERNAL (decl
))
7570 complete_type (type
);
7571 if (!DECL_SIZE (decl
) && COMPLETE_TYPE_P (type
))
7572 layout_decl (decl
, 0);
7574 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7576 /* An automatic variable with an incomplete type: that is an error.
7577 Don't talk about array types here, since we took care of that
7578 message in grokdeclarator. */
7579 cp_error ("storage size of `%D' isn't known", decl
);
7580 TREE_TYPE (decl
) = error_mark_node
;
7583 /* Keep this code around in case we later want to control debug info
7584 based on whether a type is "used". (jason 1999-11-11) */
7586 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7587 /* Let debugger know it should output info for this type. */
7588 note_debug_info_needed (ttype
);
7590 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7591 note_debug_info_needed (DECL_CONTEXT (decl
));
7594 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7595 && DECL_SIZE (decl
) != NULL_TREE
7596 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7598 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7599 constant_expression_warning (DECL_SIZE (decl
));
7601 cp_error ("storage size of `%D' isn't constant", decl
);
7605 /* If a local static variable is declared in an inline function, or if
7606 we have a weak definition, we must endeavor to create only one
7607 instance of the variable at link-time. */
7610 maybe_commonize_var (decl
)
7613 /* Static data in a function with comdat linkage also has comdat
7615 if (TREE_STATIC (decl
)
7616 /* Don't mess with __FUNCTION__. */
7617 && ! DECL_ARTIFICIAL (decl
)
7618 && current_function_decl
7619 && DECL_CONTEXT (decl
) == current_function_decl
7620 && (DECL_THIS_INLINE (current_function_decl
)
7621 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7622 && TREE_PUBLIC (current_function_decl
))
7624 /* Rather than try to get this right with inlining, we suppress
7625 inlining of such functions. */
7626 current_function_cannot_inline
7627 = "function with static variable cannot be inline";
7629 /* If flag_weak, we don't need to mess with this, as we can just
7630 make the function weak, and let it refer to its unique local
7631 copy. This works because we don't allow the function to be
7635 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7637 TREE_PUBLIC (decl
) = 1;
7638 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7640 else if (DECL_INITIAL (decl
) == NULL_TREE
7641 || DECL_INITIAL (decl
) == error_mark_node
)
7643 TREE_PUBLIC (decl
) = 1;
7644 DECL_COMMON (decl
) = 1;
7646 /* else we lose. We can only do this if we can use common,
7647 which we can't if it has been initialized. */
7649 if (TREE_PUBLIC (decl
))
7650 DECL_ASSEMBLER_NAME (decl
)
7651 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7654 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7655 cp_warning_at (" you can work around this by removing the initializer", decl
);
7659 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7660 /* Set it up again; we might have set DECL_INITIAL since the last
7662 comdat_linkage (decl
);
7665 /* Issue an error message if DECL is an uninitialized const variable. */
7668 check_for_uninitialized_const_var (decl
)
7671 tree type
= TREE_TYPE (decl
);
7673 /* ``Unless explicitly declared extern, a const object does not have
7674 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7676 if (TREE_CODE (decl
) == VAR_DECL
7677 && TREE_CODE (type
) != REFERENCE_TYPE
7678 && CP_TYPE_CONST_P (type
)
7679 && !TYPE_NEEDS_CONSTRUCTING (type
)
7680 && !DECL_INITIAL (decl
))
7681 cp_error ("uninitialized const `%D'", decl
);
7684 /* Verify INIT (the initializer for DECL), and record the
7685 initialization in DECL_INITIAL, if appropriate. Returns a new
7689 check_initializer (decl
, init
)
7695 if (TREE_CODE (decl
) == FIELD_DECL
)
7698 type
= TREE_TYPE (decl
);
7700 /* If `start_decl' didn't like having an initialization, ignore it now. */
7701 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7704 /* Check the initializer. */
7707 /* Things that are going to be initialized need to have complete
7709 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7711 if (type
== error_mark_node
)
7712 /* We will have already complained. */
7714 else if (COMPLETE_TYPE_P (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7716 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7719 else if (TREE_CODE (type
) == ARRAY_TYPE
7720 && !COMPLETE_TYPE_P (TREE_TYPE (type
)))
7722 cp_error ("elements of array `%#D' have incomplete type", decl
);
7725 else if (!COMPLETE_TYPE_P (type
))
7727 cp_error ("`%D' has incomplete type", decl
);
7728 TREE_TYPE (decl
) = error_mark_node
;
7733 if (TREE_CODE (decl
) == CONST_DECL
)
7735 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7737 DECL_INITIAL (decl
) = init
;
7739 /* This will keep us from needing to worry about our obstacks. */
7740 my_friendly_assert (init
!= NULL_TREE
, 149);
7743 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7745 if (TREE_STATIC (decl
))
7746 make_decl_rtl (decl
, NULL_PTR
, toplevel_bindings_p ());
7747 grok_reference_init (decl
, type
, init
);
7752 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7754 if (TREE_CODE (type
) == ARRAY_TYPE
)
7755 init
= digest_init (type
, init
, (tree
*) 0);
7756 else if (TREE_CODE (init
) == CONSTRUCTOR
7757 && TREE_HAS_CONSTRUCTOR (init
))
7759 if (TYPE_NON_AGGREGATE_CLASS (type
))
7761 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7763 init
= error_mark_node
;
7766 goto dont_use_constructor
;
7771 dont_use_constructor
:
7772 if (TREE_CODE (init
) != TREE_VEC
)
7773 init
= store_init_value (decl
, init
);
7777 /* We must hide the initializer so that expand_decl
7778 won't try to do something it does not understand. */
7779 init
= obscure_complex_init (decl
, init
);
7781 else if (DECL_EXTERNAL (decl
))
7783 else if (TYPE_P (type
)
7784 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7786 tree core_type
= strip_array_types (type
);
7788 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7790 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7791 cp_error ("structure `%D' with uninitialized const members", decl
);
7792 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7793 cp_error ("structure `%D' with uninitialized reference members",
7797 check_for_uninitialized_const_var (decl
);
7799 if (COMPLETE_TYPE_P (type
) && TYPE_NEEDS_CONSTRUCTING (type
))
7800 init
= obscure_complex_init (decl
, NULL_TREE
);
7804 check_for_uninitialized_const_var (decl
);
7809 /* If DECL is not a local variable, give it RTL. */
7812 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
7815 const char *asmspec
;
7817 int toplev
= toplevel_bindings_p ();
7820 /* Handle non-variables up front. */
7821 if (TREE_CODE (decl
) != VAR_DECL
)
7823 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7827 /* If we see a class member here, it should be a static data
7829 if (DECL_LANG_SPECIFIC (decl
) && DECL_IN_AGGR_P (decl
))
7831 my_friendly_assert (TREE_STATIC (decl
), 19990828);
7832 /* An in-class declaration of a static data member should be
7833 external; it is only a declaration, and not a definition. */
7834 if (init
== NULL_TREE
)
7835 my_friendly_assert (DECL_EXTERNAL (decl
), 20000723);
7838 /* Set the DECL_ASSEMBLER_NAME for the variable. */
7840 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7842 /* We don't create any RTL for local variables. */
7843 if (DECL_FUNCTION_SCOPE_P (decl
) && !TREE_STATIC (decl
))
7846 /* We defer emission of local statics until the corresponding
7847 DECL_STMT is expanded. */
7848 defer_p
= DECL_FUNCTION_SCOPE_P (decl
) || DECL_VIRTUAL_P (decl
);
7850 /* We try to defer namespace-scope static constants so that they are
7851 not emitted into the object file unncessarily. */
7852 if (!DECL_VIRTUAL_P (decl
)
7853 && TREE_READONLY (decl
)
7854 && DECL_INITIAL (decl
) != NULL_TREE
7855 && DECL_INITIAL (decl
) != error_mark_node
7856 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
))
7858 && !TREE_PUBLIC (decl
))
7860 /* Fool with the linkage according to #pragma interface. */
7861 if (!interface_unknown
)
7863 TREE_PUBLIC (decl
) = 1;
7864 DECL_EXTERNAL (decl
) = interface_only
;
7870 /* If we're deferring the variable, just make RTL. Do not actually
7871 emit the variable. */
7873 make_decl_rtl (decl
, asmspec
, toplev
);
7874 /* If we're not deferring, go ahead and assemble the variable. */
7876 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7879 /* The old ARM scoping rules injected variables declared in the
7880 initialization statement of a for-statement into the surrounding
7881 scope. We support this usage, in order to be backward-compatible.
7882 DECL is a just-declared VAR_DECL; if necessary inject its
7883 declaration into the surrounding scope. */
7886 maybe_inject_for_scope_var (decl
)
7889 if (!DECL_NAME (decl
))
7892 if (current_binding_level
->is_for_scope
)
7894 struct binding_level
*outer
7895 = current_binding_level
->level_chain
;
7897 /* Check to see if the same name is already bound at the outer
7898 level, either because it was directly declared, or because a
7899 dead for-decl got preserved. In either case, the code would
7900 not have been valid under the ARM scope rules, so clear
7901 is_for_scope for the current_binding_level.
7903 Otherwise, we need to preserve the temp slot for decl to last
7904 into the outer binding level. */
7907 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7909 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7910 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7912 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7914 BINDING_VALUE (outer_binding
)
7915 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7916 current_binding_level
->is_for_scope
= 0;
7918 else if (DECL_IN_MEMORY_P (decl
))
7919 preserve_temp_slots (DECL_RTL (decl
));
7923 /* Generate code to initialize DECL (a local variable). */
7926 initialize_local_var (decl
, init
, flags
)
7931 tree type
= TREE_TYPE (decl
);
7933 /* If the type is bogus, don't bother initializing the variable. */
7934 if (type
== error_mark_node
)
7937 if (DECL_SIZE (decl
) == NULL_TREE
&& !TREE_STATIC (decl
))
7939 /* If we used it already as memory, it must stay in memory. */
7940 DECL_INITIAL (decl
) = NULL_TREE
;
7941 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7944 /* Local statics are handled differently from ordinary automatic
7946 if (TREE_STATIC (decl
))
7948 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7949 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7950 expand_static_init (decl
, init
);
7954 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7958 /* Compute and store the initial value. */
7959 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7961 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7963 int saved_stmts_are_full_exprs_p
;
7965 emit_line_note (DECL_SOURCE_FILE (decl
),
7966 DECL_SOURCE_LINE (decl
));
7967 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p ();
7968 current_stmt_tree
->stmts_are_full_exprs_p
= 1;
7969 if (building_stmt_tree ())
7970 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7972 genrtl_expr_stmt (build_aggr_init (decl
, init
, flags
));
7973 current_stmt_tree
->stmts_are_full_exprs_p
= saved_stmts_are_full_exprs_p
;
7976 /* Set this to 0 so we can tell whether an aggregate which was
7977 initialized was ever used. Don't do this if it has a
7978 destructor, so we don't complain about the 'resource
7979 allocation is initialization' idiom. Now set
7980 attribute((unused)) on types so decls of that type will be
7981 marked used. (see TREE_USED, above.) */
7982 if (TYPE_NEEDS_CONSTRUCTING (type
)
7984 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type
)
7985 && DECL_NAME (decl
))
7986 TREE_USED (decl
) = 0;
7987 else if (already_used
)
7988 TREE_USED (decl
) = 1;
7992 /* Generate code to destroy DECL (a local variable). */
7995 destroy_local_var (decl
)
7998 tree type
= TREE_TYPE (decl
);
8001 /* Only variables get cleaned up. */
8002 if (TREE_CODE (decl
) != VAR_DECL
)
8005 /* And only things with destructors need cleaning up. */
8006 if (type
== error_mark_node
8007 || TYPE_HAS_TRIVIAL_DESTRUCTOR (type
))
8010 if (TREE_CODE (decl
) == VAR_DECL
&&
8011 (DECL_EXTERNAL (decl
) || TREE_STATIC (decl
)))
8012 /* We don't clean up things that aren't defined in this
8013 translation unit, or that need a static cleanup. The latter
8014 are handled by finish_file. */
8017 /* Compute the cleanup. */
8018 cleanup
= maybe_build_cleanup (decl
);
8020 /* Record the cleanup required for this declaration. */
8021 if (DECL_SIZE (decl
) && TREE_TYPE (decl
) != error_mark_node
8023 finish_decl_cleanup (decl
, cleanup
);
8026 /* Finish processing of a declaration;
8027 install its line number and initial value.
8028 If the length of an array type is not known before,
8029 it must be determined now, from the initial value, or it is an error.
8031 INIT holds the value of an initializer that should be allowed to escape
8034 FLAGS is LOOKUP_ONLYCONVERTING if the = init syntax was used, else 0
8035 if the (init) syntax was used. */
8038 cp_finish_decl (decl
, init
, asmspec_tree
, flags
)
8044 tree ttype
= NULL_TREE
;
8045 const char *asmspec
= NULL
;
8046 int was_readonly
= 0;
8051 error ("assignment (not initialization) in declaration");
8055 /* If a name was specified, get the string. */
8057 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
8059 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
8061 cp_error ("cannot initialize `%D' to namespace `%D'",
8066 if (current_class_type
8067 && CP_DECL_CONTEXT (decl
) == current_class_type
8068 && TYPE_BEING_DEFINED (current_class_type
)
8069 && (DECL_INITIAL (decl
) || init
))
8070 DECL_DEFINED_IN_CLASS_P (decl
) = 1;
8072 if (TREE_CODE (decl
) == VAR_DECL
8073 && DECL_CONTEXT (decl
)
8074 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
8075 && DECL_CONTEXT (decl
) != current_namespace
8078 /* Leave the namespace of the object. */
8079 pop_decl_namespace ();
8082 type
= TREE_TYPE (decl
);
8084 if (type
== error_mark_node
)
8087 /* Add this declaration to the statement-tree. */
8088 if (building_stmt_tree ()
8089 && at_function_scope_p ()
8090 && TREE_CODE (decl
) != RESULT_DECL
)
8091 add_decl_stmt (decl
);
8093 if (TYPE_HAS_MUTABLE_P (type
))
8094 TREE_READONLY (decl
) = 0;
8096 if (processing_template_decl
)
8098 if (init
&& DECL_INITIAL (decl
))
8099 DECL_INITIAL (decl
) = init
;
8103 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
8104 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
8106 /* Take care of TYPE_DECLs up front. */
8107 if (TREE_CODE (decl
) == TYPE_DECL
)
8109 if (init
&& DECL_INITIAL (decl
))
8111 /* typedef foo = bar; store the type of bar as the type of foo. */
8112 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
8113 DECL_INITIAL (decl
) = init
= NULL_TREE
;
8115 if (type
!= error_mark_node
8116 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
8118 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
8119 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
8120 set_identifier_type_value (DECL_NAME (decl
), type
);
8121 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
8123 GNU_xref_decl (current_function_decl
, decl
);
8125 /* If we have installed this as the canonical typedef for this
8126 type, and that type has not been defined yet, delay emitting
8127 the debug information for it, as we will emit it later. */
8128 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
8129 && !COMPLETE_TYPE_P (TREE_TYPE (decl
)))
8130 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
8132 rest_of_decl_compilation (decl
, NULL_PTR
,
8133 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
8137 if (TREE_CODE (decl
) != FUNCTION_DECL
)
8138 ttype
= target_type (type
);
8140 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
8141 && TYPE_NEEDS_CONSTRUCTING (type
))
8143 /* Currently, GNU C++ puts constants in text space, making them
8144 impossible to initialize. In the future, one would hope for
8145 an operating system which understood the difference between
8146 initialization and the running of a program. */
8148 TREE_READONLY (decl
) = 0;
8151 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
8153 /* This must override the asm specifier which was placed by
8154 grokclassfn. Lay this out fresh. */
8155 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
8156 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
8157 make_decl_rtl (decl
, asmspec
, 0);
8160 /* Deduce size of array from initialization, if not already known. */
8161 maybe_deduce_size_from_array_init (decl
, init
);
8162 init
= check_initializer (decl
, init
);
8164 GNU_xref_decl (current_function_decl
, decl
);
8166 if (TREE_CODE (decl
) == VAR_DECL
)
8167 layout_var_decl (decl
);
8169 /* Output the assembler code and/or RTL code for variables and functions,
8170 unless the type is an undefined structure or union.
8171 If not, it will get done when the type is completed. */
8172 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
8173 || TREE_CODE (decl
) == RESULT_DECL
)
8175 if (TREE_CODE (decl
) == VAR_DECL
)
8176 maybe_commonize_var (decl
);
8178 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
8180 if (TREE_CODE (type
) == FUNCTION_TYPE
8181 || TREE_CODE (type
) == METHOD_TYPE
)
8182 abstract_virtuals_error (decl
,
8183 strip_array_types (TREE_TYPE (type
)));
8185 abstract_virtuals_error (decl
, strip_array_types (type
));
8187 if (TREE_CODE (decl
) == FUNCTION_DECL
)
8189 else if (DECL_EXTERNAL (decl
)
8190 && ! (DECL_LANG_SPECIFIC (decl
)
8191 && DECL_NOT_REALLY_EXTERN (decl
)))
8194 DECL_INITIAL (decl
) = init
;
8196 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
8198 /* This is a local declaration. */
8199 if (doing_semantic_analysis_p ())
8200 maybe_inject_for_scope_var (decl
);
8201 /* Initialize the local variable. But, if we're building a
8202 statement-tree, we'll do the initialization when we
8204 if (processing_template_decl
)
8206 if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
8207 DECL_INITIAL (decl
) = init
;
8211 /* If we're not building RTL, then we need to do so
8213 my_friendly_assert (building_stmt_tree (), 20000906);
8214 /* Initialize the variable. */
8215 initialize_local_var (decl
, init
, flags
);
8216 /* Clean up the variable. */
8217 destroy_local_var (decl
);
8220 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
8222 /* Cleanups for static variables are handled by `finish_file'. */
8223 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
8224 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
8225 expand_static_init (decl
, init
);
8229 /* Undo call to `pushclass' that was done in `start_decl'
8230 due to initialization of qualified member variable.
8231 I.e., Foo::x = 10; */
8233 tree context
= CP_DECL_CONTEXT (decl
);
8236 && (TREE_CODE (decl
) == VAR_DECL
8237 /* We also have a pushclass done that we need to undo here
8238 if we're at top level and declare a method. */
8239 || TREE_CODE (decl
) == FUNCTION_DECL
)
8240 /* If size hasn't been set, we're still defining it,
8241 and therefore inside the class body; don't pop
8242 the binding level.. */
8243 && COMPLETE_TYPE_P (context
)
8244 && context
== current_class_type
)
8245 pop_nested_class ();
8252 TREE_READONLY (decl
) = 1;
8255 /* This is here for a midend callback from c-common.c */
8258 finish_decl (decl
, init
, asmspec_tree
)
8262 cp_finish_decl (decl
, init
, asmspec_tree
, 0);
8265 /* Returns a declaration for a VAR_DECL as if:
8267 extern "C" TYPE NAME;
8269 had been seen. Used to create compiler-generated global
8273 declare_global_var (name
, type
)
8279 push_to_top_level ();
8280 decl
= build_decl (VAR_DECL
, name
, type
);
8281 TREE_PUBLIC (decl
) = 1;
8282 DECL_EXTERNAL (decl
) = 1;
8283 DECL_ARTIFICIAL (decl
) = 1;
8285 cp_finish_decl (decl
, NULL_TREE
, NULL_TREE
, 0);
8286 pop_from_top_level ();
8291 /* Returns a pointer to the `atexit' function. Note that if
8292 FLAG_USE_CXA_ATEXIT is non-zero, then this will actually be the new
8293 `__cxa_atexit' function specified in the IA64 C++ ABI. */
8307 if (flag_use_cxa_atexit
)
8309 /* The declaration for `__cxa_atexit' is:
8311 int __cxa_atexit (void (*)(void *), void *, void *)
8313 We build up the argument types and then then function type
8316 /* First, build the pointer-to-function type for the first
8318 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8319 fn_type
= build_function_type (void_type_node
, arg_types
);
8320 fn_ptr_type
= build_pointer_type (fn_type
);
8321 /* Then, build the rest of the argument types. */
8322 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8323 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, arg_types
);
8324 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, arg_types
);
8325 /* And the final __cxa_atexit type. */
8326 fn_type
= build_function_type (integer_type_node
, arg_types
);
8327 fn_ptr_type
= build_pointer_type (fn_type
);
8328 name
= "__cxa_atexit";
8332 /* The declaration for `atexit' is:
8334 int atexit (void (*)());
8336 We build up the argument types and then then function type
8338 fn_type
= build_function_type (void_type_node
, void_list_node
);
8339 fn_ptr_type
= build_pointer_type (fn_type
);
8340 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, void_list_node
);
8341 /* Build the final atexit type. */
8342 fn_type
= build_function_type (integer_type_node
, arg_types
);
8346 /* Now, build the function declaration. */
8347 push_lang_context (lang_name_c
);
8348 atexit_fndecl
= build_library_fn_ptr (name
, fn_type
);
8349 mark_used (atexit_fndecl
);
8350 pop_lang_context ();
8351 atexit_node
= default_conversion (atexit_fndecl
);
8356 /* Returns the __dso_handle VAR_DECL. */
8359 get_dso_handle_node ()
8361 if (dso_handle_node
)
8362 return dso_handle_node
;
8364 /* Declare the variable. */
8365 dso_handle_node
= declare_global_var (get_identifier ("__dso_handle"),
8368 return dso_handle_node
;
8371 /* Begin a new function with internal linkage whose job will be simply
8372 to destroy some particular variable. */
8377 static int counter
= 0;
8378 int old_interface_unknown
= interface_unknown
;
8384 push_to_top_level ();
8386 /* No need to mangle this. */
8387 push_lang_context (lang_name_c
);
8389 interface_unknown
= 1;
8391 /* Build the parameter-types. */
8392 parmtypes
= void_list_node
;
8393 /* Functions passed to __cxa_atexit take an additional parameter.
8394 We'll just ignore it. After we implement the new calling
8395 convention for destructors, we can eliminate the use of
8396 additional cleanup functions entirely in the -fnew-abi case. */
8397 if (flag_use_cxa_atexit
)
8398 parmtypes
= tree_cons (NULL_TREE
, ptr_type_node
, parmtypes
);
8399 /* Build the function type itself. */
8400 fntype
= build_function_type (void_type_node
, parmtypes
);
8401 /* Build the name of the function. */
8402 sprintf (name
, "__tcf_%d", counter
++);
8403 /* Build the function declaration. */
8404 fndecl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), fntype
);
8405 /* It's a function with internal linkage, generated by the
8407 TREE_PUBLIC (fndecl
) = 0;
8408 DECL_ARTIFICIAL (fndecl
) = 1;
8409 /* Make the function `inline' so that it is only emitted if it is
8410 actually needed. It is unlikely that it will be inlined, since
8411 it is only called via a function pointer, but we avoid unncessary
8412 emissions this way. */
8413 DECL_INLINE (fndecl
) = 1;
8414 /* Build the parameter. */
8415 if (flag_use_cxa_atexit
)
8419 parmdecl
= build_decl (PARM_DECL
, NULL_TREE
, ptr_type_node
);
8420 DECL_CONTEXT (parmdecl
) = fndecl
;
8421 DECL_ARG_TYPE (parmdecl
) = ptr_type_node
;
8422 TREE_USED (parmdecl
) = 1;
8423 DECL_ARGUMENTS (fndecl
) = parmdecl
;
8427 start_function (/*specs=*/NULL_TREE
, fndecl
, NULL_TREE
, SF_PRE_PARSED
);
8430 interface_unknown
= old_interface_unknown
;
8432 pop_lang_context ();
8434 return current_function_decl
;
8437 /* Finish the cleanup function begun by start_cleanup_fn. */
8444 expand_body (finish_function (0));
8446 pop_from_top_level ();
8449 /* Generate code to handle the destruction of DECL, an object with
8450 static storage duration. */
8453 register_dtor_fn (decl
)
8461 int saved_flag_access_control
;
8463 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl
)))
8466 /* Call build_cleanup before we enter the anonymous function so that
8467 any access checks will be done relative to the current scope,
8468 rather than the scope of the anonymous function. */
8469 build_cleanup (decl
);
8471 /* Now start the function. */
8472 cleanup
= start_cleanup_fn ();
8474 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
8475 to the original function, rather than the anonymous one. That
8476 will make the back-end think that nested functions are in use,
8477 which causes confusion. */
8478 saved_flag_access_control
= flag_access_control
;
8479 flag_access_control
= 0;
8480 fcall
= build_cleanup (decl
);
8481 flag_access_control
= saved_flag_access_control
;
8483 /* Create the body of the anonymous function. */
8484 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
8485 finish_expr_stmt (fcall
);
8486 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
8489 /* Call atexit with the cleanup function. */
8490 mark_addressable (cleanup
);
8491 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
8492 if (flag_use_cxa_atexit
)
8494 args
= tree_cons (NULL_TREE
, get_dso_handle_node (), NULL_TREE
);
8495 args
= tree_cons (NULL_TREE
, null_pointer_node
, args
);
8496 args
= tree_cons (NULL_TREE
, cleanup
, args
);
8499 args
= tree_cons (NULL_TREE
, cleanup
, NULL_TREE
);
8500 finish_expr_stmt (build_function_call (get_atexit_node (), args
));
8504 expand_static_init (decl
, init
)
8508 tree oldstatic
= value_member (decl
, static_aggregates
);
8512 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
8513 cp_error ("multiple initializations given for `%D'", decl
);
8515 else if (! toplevel_bindings_p ())
8517 /* Emit code to perform this initialization but once. */
8524 /* Emit code to perform this initialization but once. This code
8527 static int guard = 0;
8529 // Do initialization.
8531 // Register variable for destruction at end of program.
8534 Note that the `temp' variable is only set to 1 *after* the
8535 initialization is complete. This ensures that an exception,
8536 thrown during the construction, will cause the variable to
8537 reinitialized when we pass through this code again, as per:
8541 If the initialization exits by throwing an exception, the
8542 initialization is not complete, so it will be tried again
8543 the next time control enters the declaration.
8545 In theory, this process should be thread-safe, too; multiple
8546 threads should not be able to initialize the variable more
8547 than once. We don't yet attempt to ensure thread-safety. */
8549 /* Create the guard variable. */
8550 guard
= get_guard (decl
);
8552 /* Begin the conditional initialization. */
8553 if_stmt
= begin_if_stmt ();
8554 finish_if_stmt_cond (get_guard_cond (guard
), if_stmt
);
8555 then_clause
= begin_compound_stmt (/*has_no_scope=*/0);
8557 /* Do the initialization itself. */
8558 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
8559 || (init
&& TREE_CODE (init
) == TREE_LIST
))
8560 assignment
= build_aggr_init (decl
, init
, 0);
8562 /* The initialization we're doing here is just a bitwise
8564 assignment
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
8566 assignment
= NULL_TREE
;
8568 /* Once the assignment is complete, set TEMP to 1. Since the
8569 construction of the static object is complete at this point,
8570 we want to make sure TEMP is set to 1 even if a temporary
8571 constructed during the initialization throws an exception
8572 when it is destroyed. So, we combine the initialization and
8573 the assignment to TEMP into a single expression, ensuring
8574 that when we call finish_expr_stmt the cleanups will not be
8575 run until after TEMP is set to 1. */
8576 guard_init
= set_guard (guard
);
8579 assignment
= tree_cons (NULL_TREE
, assignment
,
8580 build_tree_list (NULL_TREE
,
8582 assignment
= build_compound_expr (assignment
);
8585 assignment
= guard_init
;
8586 finish_expr_stmt (assignment
);
8588 /* Use atexit to register a function for destroying this static
8590 register_dtor_fn (decl
);
8592 finish_compound_stmt (/*has_no_scope=*/0, then_clause
);
8593 finish_then_clause (if_stmt
);
8597 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8600 /* Finish the declaration of a catch-parameter. */
8603 start_handler_parms (declspecs
, declarator
)
8610 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8612 if (decl
== NULL_TREE
)
8613 error ("invalid catch parameter");
8622 /* Make TYPE a complete type based on INITIAL_VALUE.
8623 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8624 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8627 complete_array_type (type
, initial_value
, do_default
)
8628 tree type
, initial_value
;
8631 register tree maxindex
= NULL_TREE
;
8636 /* An array of character type can be initialized from a
8637 brace-enclosed string constant. */
8638 if (char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (type
)))
8639 && TREE_CODE (initial_value
) == CONSTRUCTOR
8640 && CONSTRUCTOR_ELTS (initial_value
)
8641 && (TREE_CODE (TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
)))
8643 && TREE_CHAIN (CONSTRUCTOR_ELTS (initial_value
)) == NULL_TREE
)
8644 initial_value
= TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
));
8646 /* Note MAXINDEX is really the maximum index, one less than the
8648 if (TREE_CODE (initial_value
) == STRING_CST
)
8651 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8652 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8655 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8657 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8659 maxindex
= ssize_int (-1);
8660 for (; elts
; elts
= TREE_CHAIN (elts
))
8662 if (TREE_PURPOSE (elts
))
8663 maxindex
= TREE_PURPOSE (elts
);
8665 maxindex
= size_binop (PLUS_EXPR
, maxindex
, ssize_int (1));
8667 maxindex
= copy_node (maxindex
);
8671 /* Make an error message unless that happened already. */
8672 if (initial_value
!= error_mark_node
)
8675 initial_value
= NULL_TREE
;
8677 /* Prevent further error messages. */
8678 maxindex
= build_int_2 (0, 0);
8685 maxindex
= build_int_2 (0, 0);
8694 domain
= build_index_type (maxindex
);
8695 TYPE_DOMAIN (type
) = domain
;
8697 if (! TREE_TYPE (maxindex
))
8698 TREE_TYPE (maxindex
) = domain
;
8700 itype
= TREE_TYPE (initial_value
);
8703 if (itype
&& !TYPE_DOMAIN (itype
))
8704 TYPE_DOMAIN (itype
) = domain
;
8705 /* The type of the main variant should never be used for arrays
8706 of different sizes. It should only ever be completed with the
8707 size of the array. */
8708 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8709 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8712 /* Lay out the type now that we can get the real answer. */
8719 /* Return zero if something is declared to be a member of type
8720 CTYPE when in the context of CUR_TYPE. STRING is the error
8721 message to print in that case. Otherwise, quietly return 1. */
8724 member_function_or_else (ctype
, cur_type
, flags
)
8725 tree ctype
, cur_type
;
8726 enum overload_flags flags
;
8728 if (ctype
&& ctype
!= cur_type
)
8730 if (flags
== DTOR_FLAG
)
8731 cp_error ("destructor for alien class `%T' cannot be a member",
8734 cp_error ("constructor for alien class `%T' cannot be a member",
8741 /* Subroutine of `grokdeclarator'. */
8743 /* Generate errors possibly applicable for a given set of specifiers.
8744 This is for ARM $7.1.2. */
8747 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8750 int virtualp
, quals
, friendp
, raises
, inlinep
;
8753 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8755 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8757 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8760 cp_error_at ("`%D' declared as a friend", object
);
8762 cp_error_at ("`%D' declared with an exception specification", object
);
8765 /* CTYPE is class type, or null if non-class.
8766 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8768 DECLARATOR is the function's name.
8769 VIRTUALP is truthvalue of whether the function is virtual or not.
8770 FLAGS are to be passed through to `grokclassfn'.
8771 QUALS are qualifiers indicating whether the function is `const'
8773 RAISES is a list of exceptions that this function can raise.
8774 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8775 not look, and -1 if we should not call `grokclassfn' at all.
8777 Returns `NULL_TREE' if something goes wrong, after issuing
8778 applicable error messages. */
8781 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8782 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8783 template_count
, in_namespace
)
8786 tree orig_declarator
;
8788 enum overload_flags flags
;
8790 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8794 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8795 int has_default_arg
= 0;
8799 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8800 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8806 type
= build_exception_variant (type
, raises
);
8809 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8810 /* Propagate volatile out from type to decl. */
8811 if (TYPE_VOLATILE (type
))
8812 TREE_THIS_VOLATILE (decl
) = 1;
8814 /* If this decl has namespace scope, set that up. */
8816 set_decl_namespace (decl
, in_namespace
, friendp
);
8818 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8820 /* `main' and builtins have implicit 'C' linkage. */
8821 if ((MAIN_NAME_P (declarator
)
8822 || (IDENTIFIER_LENGTH (declarator
) > 10
8823 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8824 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8825 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8826 && current_lang_name
== lang_name_cplusplus
8827 && ctype
== NULL_TREE
8828 /* NULL_TREE means global namespace. */
8829 && DECL_CONTEXT (decl
) == NULL_TREE
)
8830 DECL_LANGUAGE (decl
) = lang_c
;
8832 /* Should probably propagate const out from type to decl I bet (mrs). */
8835 DECL_STATIC_FUNCTION_P (decl
) = 1;
8836 DECL_CONTEXT (decl
) = ctype
;
8840 DECL_CONTEXT (decl
) = ctype
;
8842 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8844 if (processing_template_decl
)
8845 error ("cannot declare `::main' to be a template");
8847 error ("cannot declare `::main' to be inline");
8849 error ("cannot declare `::main' to be static");
8850 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
8852 error ("`main' must return `int'");
8857 /* Members of anonymous types and local classes have no linkage; make
8859 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8860 || decl_function_context (TYPE_MAIN_DECL (ctype
))))
8865 /* [basic.link]: A name with no linkage (notably, the name of a class
8866 or enumeration declared in a local scope) shall not be used to
8867 declare an entity with linkage.
8869 Only check this for public decls for now. */
8870 t
= no_linkage_check (TREE_TYPE (decl
));
8873 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8875 if (DECL_EXTERN_C_P (decl
))
8876 /* Allow this; it's pretty common in C. */;
8878 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8882 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8887 TREE_PUBLIC (decl
) = publicp
;
8890 DECL_INTERFACE_KNOWN (decl
) = 1;
8891 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8895 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8897 DECL_EXTERNAL (decl
) = 1;
8898 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8900 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8901 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8905 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8906 grok_op_properties (decl
, virtualp
, check
< 0);
8908 if (ctype
&& decl_function_context (decl
))
8909 DECL_NO_STATIC_CHAIN (decl
) = 1;
8911 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8912 if (TREE_PURPOSE (t
)
8913 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8915 has_default_arg
= 1;
8920 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8924 ("defining explicit specialization `%D' in friend declaration",
8928 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8930 /* Something like `template <class T> friend void f<T>()'. */
8931 cp_error ("invalid use of template-id `%D' in declaration of primary template",
8937 /* A friend declaration of the form friend void f<>(). Record
8938 the information in the TEMPLATE_ID_EXPR. */
8939 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8940 DECL_TEMPLATE_INFO (decl
)
8941 = tree_cons (TREE_OPERAND (orig_declarator
, 0),
8942 TREE_OPERAND (orig_declarator
, 1),
8945 if (has_default_arg
)
8947 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8954 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8961 if (has_default_arg
)
8962 add_defarg_fn (decl
);
8964 /* Plain overloading: will not be grok'd by grokclassfn. */
8965 if (! ctype
&& ! processing_template_decl
8966 && !DECL_EXTERN_C_P (decl
)
8967 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8968 set_mangled_name_for_decl (decl
);
8971 /* Make the init_value nonzero so pushdecl knows this is not
8972 tentative. error_mark_node is replaced later with the BLOCK. */
8973 DECL_INITIAL (decl
) = error_mark_node
;
8975 if (TYPE_NOTHROW_P (type
) || nothrow_libfn_p (decl
))
8976 TREE_NOTHROW (decl
) = 1;
8978 /* Caller will do the rest of this. */
8982 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8983 DECL_CONSTRUCTOR_P (decl
) = 1;
8985 /* Function gets the ugly name, field gets the nice one. This call
8986 may change the type of the function (because of default
8988 if (ctype
!= NULL_TREE
)
8989 grokclassfn (ctype
, decl
, flags
, quals
);
8991 decl
= check_explicit_specialization (orig_declarator
, decl
,
8993 2 * (funcdef_flag
!= 0) +
8994 4 * (friendp
!= 0));
8995 if (decl
== error_mark_node
)
8998 if (ctype
!= NULL_TREE
8999 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
9004 old_decl
= check_classfn (ctype
, decl
);
9006 if (old_decl
&& TREE_CODE (old_decl
) == TEMPLATE_DECL
)
9007 /* Because grokfndecl is always supposed to return a
9008 FUNCTION_DECL, we pull out the DECL_TEMPLATE_RESULT
9009 here. We depend on our callers to figure out that its
9010 really a template that's being returned. */
9011 old_decl
= DECL_TEMPLATE_RESULT (old_decl
);
9013 if (old_decl
&& DECL_STATIC_FUNCTION_P (old_decl
)
9014 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
9016 /* Remove the `this' parm added by grokclassfn.
9017 XXX Isn't this done in start_function, too? */
9018 revert_static_member_fn (decl
);
9019 last_function_parms
= TREE_CHAIN (last_function_parms
);
9021 if (old_decl
&& DECL_ARTIFICIAL (old_decl
))
9022 cp_error ("definition of implicitly-declared `%D'", old_decl
);
9026 /* Since we've smashed OLD_DECL to its
9027 DECL_TEMPLATE_RESULT, we must do the same to DECL. */
9028 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
9029 decl
= DECL_TEMPLATE_RESULT (decl
);
9031 /* Attempt to merge the declarations. This can fail, in
9032 the case of some illegal specialization declarations. */
9033 if (!duplicate_decls (decl
, old_decl
))
9034 cp_error ("no `%#D' member function declared in class `%T'",
9040 if (DECL_CONSTRUCTOR_P (decl
) && !grok_ctor_properties (ctype
, decl
))
9043 if (ctype
== NULL_TREE
|| check
)
9048 DECL_VIRTUAL_P (decl
) = 1;
9049 if (DECL_VINDEX (decl
) == NULL_TREE
)
9050 DECL_VINDEX (decl
) = error_mark_node
;
9051 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
9058 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
9061 RID_BIT_TYPE
*specbits_in
;
9067 RID_BIT_TYPE specbits
;
9069 specbits
= *specbits_in
;
9071 if (TREE_CODE (type
) == OFFSET_TYPE
)
9073 /* If you declare a static member so that it
9074 can be initialized, the code will reach here. */
9075 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
9076 type
= TREE_TYPE (type
);
9077 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
9078 DECL_CONTEXT (decl
) = basetype
;
9079 /* DECL_ASSEMBLER_NAME is needed only for full-instantiated
9081 if (!uses_template_parms (decl
))
9084 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
9086 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
,
9095 context
= in_namespace
;
9096 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
9097 context
= current_namespace
;
9099 context
= NULL_TREE
;
9101 if (processing_template_decl
&& context
)
9102 /* For global variables, declared in a template, we need the
9104 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
9106 decl
= build_decl (VAR_DECL
, declarator
, type
);
9109 set_decl_namespace (decl
, context
, 0);
9111 context
= DECL_CONTEXT (decl
);
9112 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
9115 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
9117 DECL_ASSEMBLER_NAME (decl
)
9118 = build_static_name (context
, declarator
);
9123 set_decl_namespace (decl
, in_namespace
, 0);
9125 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
9127 DECL_THIS_EXTERN (decl
) = 1;
9128 DECL_EXTERNAL (decl
) = !initialized
;
9131 /* In class context, static means one per class,
9132 public access, and static storage. */
9133 if (DECL_CLASS_SCOPE_P (decl
))
9135 TREE_PUBLIC (decl
) = 1;
9136 TREE_STATIC (decl
) = 1;
9137 DECL_EXTERNAL (decl
) = 0;
9139 /* At top level, either `static' or no s.c. makes a definition
9140 (perhaps tentative), and absence of `static' makes it public. */
9141 else if (toplevel_bindings_p ())
9143 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
9144 && (DECL_THIS_EXTERN (decl
) || ! constp
));
9145 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
9147 /* Not at top level, only `static' makes a static definition. */
9150 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
9151 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
9154 if (TREE_PUBLIC (decl
))
9156 /* [basic.link]: A name with no linkage (notably, the name of a class
9157 or enumeration declared in a local scope) shall not be used to
9158 declare an entity with linkage.
9160 Only check this for public decls for now. */
9161 tree t
= no_linkage_check (TREE_TYPE (decl
));
9164 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
9165 /* Ignore for now; `enum { foo } e' is pretty common. */;
9167 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
9175 /* Create and return a canonical pointer to member function type, for
9176 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
9179 build_ptrmemfunc_type (type
)
9185 tree unqualified_variant
= NULL_TREE
;
9187 /* If a canonical type already exists for this type, use it. We use
9188 this method instead of type_hash_canon, because it only does a
9189 simple equality check on the list of field members. */
9191 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
9194 /* Make sure that we always have the unqualified pointer-to-member
9196 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9198 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
9200 t
= make_aggr_type (RECORD_TYPE
);
9201 /* Let the front-end know this is a pointer to member function... */
9202 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
9203 /* ... and not really an aggregate. */
9204 SET_IS_AGGR_TYPE (t
, 0);
9208 u
= make_aggr_type (UNION_TYPE
);
9209 SET_IS_AGGR_TYPE (u
, 0);
9210 fields
[0] = build_decl (FIELD_DECL
, pfn_identifier
, type
);
9211 fields
[1] = build_decl (FIELD_DECL
, delta2_identifier
,
9213 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9214 TYPE_NAME (u
) = NULL_TREE
;
9216 fields
[0] = build_decl (FIELD_DECL
, delta_identifier
,
9218 fields
[1] = build_decl (FIELD_DECL
, index_identifier
,
9220 fields
[2] = build_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
9221 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
9225 fields
[0] = build_decl (FIELD_DECL
, pfn_identifier
, type
);
9226 fields
[1] = build_decl (FIELD_DECL
, delta_identifier
,
9228 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9231 /* Zap out the name so that the back-end will give us the debugging
9232 information for this anonymous RECORD_TYPE. */
9233 TYPE_NAME (t
) = NULL_TREE
;
9235 /* If this is not the unqualified form of this pointer-to-member
9236 type, set the TYPE_MAIN_VARIANT for this type to be the
9237 unqualified type. Since they are actually RECORD_TYPEs that are
9238 not variants of each other, we must do this manually. */
9239 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9241 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
9242 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
9243 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
9244 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
9247 /* Cache this pointer-to-member type so that we can find it again
9249 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
9251 /* Seems to be wanted. */
9252 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
9257 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
9258 Check to see that the definition is valid. Issue appropriate error
9259 messages. Return 1 if the definition is particularly bad, or 0
9263 check_static_variable_definition (decl
, type
)
9267 /* Motion 10 at San Diego: If a static const integral data member is
9268 initialized with an integral constant expression, the initializer
9269 may appear either in the declaration (within the class), or in
9270 the definition, but not both. If it appears in the class, the
9271 member is a member constant. The file-scope definition is always
9273 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
9275 cp_error ("invalid in-class initialization of static data member of non-integral type `%T'",
9277 /* If we just return the declaration, crashes will sometimes
9278 occur. We therefore return void_type_node, as if this was a
9279 friend declaration, to cause callers to completely ignore
9280 this declaration. */
9283 else if (!CP_TYPE_CONST_P (type
))
9284 cp_error ("ISO C++ forbids in-class initialization of non-const static member `%D'",
9286 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
9287 cp_pedwarn ("ISO C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
9292 /* Given the SIZE (i.e., number of elements) in an array, compute an
9293 appropriate index type for the array. If non-NULL, NAME is the
9294 name of the thing being declared. */
9297 compute_array_index_type (name
, size
)
9303 /* The size might be the result of a cast. */
9304 STRIP_TYPE_NOPS (size
);
9306 /* It might be a const variable or enumeration constant. */
9307 size
= decl_constant_value (size
);
9309 /* If this involves a template parameter, it will be a constant at
9310 instantiation time, but we don't know what the value is yet.
9311 Even if no template parameters are involved, we may an expression
9312 that is not a constant; we don't even simplify `1 + 2' when
9313 processing a template. */
9314 if (processing_template_decl
)
9316 /* Resolve a qualified reference to an enumerator or static
9317 const data member of ours. */
9318 if (TREE_CODE (size
) == SCOPE_REF
9319 && TREE_OPERAND (size
, 0) == current_class_type
)
9321 tree t
= lookup_field (current_class_type
,
9322 TREE_OPERAND (size
, 1), 0, 0);
9327 return build_index_type (build_min (MINUS_EXPR
, sizetype
,
9328 size
, integer_one_node
));
9331 /* The array bound must be an integer type. */
9332 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9333 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
9334 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
9337 cp_error ("size of array `%D' has non-integer type", name
);
9339 cp_error ("size of array has non-integer type");
9340 size
= integer_one_node
;
9343 /* Normally, the array-bound will be a constant. */
9344 if (TREE_CODE (size
) == INTEGER_CST
)
9346 /* Check to see if the array bound overflowed. Make that an
9347 error, no matter how generous we're being. */
9348 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9349 int old_pedantic
= pedantic
;
9350 pedantic
= flag_pedantic_errors
= 1;
9351 constant_expression_warning (size
);
9352 pedantic
= old_pedantic
;
9353 flag_pedantic_errors
= old_flag_pedantic_errors
;
9355 /* An array must have a positive number of elements. */
9356 if (INT_CST_LT (size
, integer_zero_node
))
9359 cp_error ("size of array `%D' is negative", name
);
9361 cp_error ("size of array is negative");
9362 size
= integer_one_node
;
9364 /* Except that an extension we allow zero-sized arrays. We
9365 always allow them in system headers because glibc uses
9367 else if (integer_zerop (size
) && pedantic
&& !in_system_header
)
9370 cp_pedwarn ("ISO C++ forbids zero-size array `%D'", name
);
9372 cp_pedwarn ("ISO C++ forbids zero-size array");
9375 else if (TREE_CONSTANT (size
))
9377 /* `(int) &fn' is not a valid array bound. */
9379 cp_error ("size of array `%D' is not an integral constant-expression",
9382 cp_error ("size of array is not an integral constant-expression");
9385 /* Compute the index of the largest element in the array. It is
9386 one less than the number of elements in the array. */
9388 = fold (cp_build_binary_op (MINUS_EXPR
,
9389 cp_convert (ssizetype
, size
),
9390 cp_convert (ssizetype
,
9391 integer_one_node
)));
9393 /* Check for variable-sized arrays. We allow such things as an
9394 extension, even though they are not allowed in ANSI/ISO C++. */
9395 if (!TREE_CONSTANT (itype
))
9400 cp_pedwarn ("ISO C++ forbids variable-size array `%D'",
9403 cp_pedwarn ("ISO C++ forbids variable-size array");
9406 /* Create a variable-sized array index type. */
9407 itype
= variable_size (itype
);
9409 /* Make sure that there was no overflow when creating to a signed
9410 index type. (For example, on a 32-bit machine, an array with
9411 size 2^32 - 1 is too big.) */
9412 else if (TREE_OVERFLOW (itype
))
9414 error ("overflow in array dimension");
9415 TREE_OVERFLOW (itype
) = 0;
9418 /* Create and return the appropriate index type. */
9419 return build_index_type (itype
);
9422 /* Returns an ARRAY_TYPE for an array with SIZE elements of the
9423 indicated TYPE. If non-NULL, NAME is the NAME of the declaration
9427 create_array_type_for_decl (name
, type
, size
)
9432 tree itype
= NULL_TREE
;
9433 const char* error_msg
;
9435 /* If things have already gone awry, bail now. */
9436 if (type
== error_mark_node
|| size
== error_mark_node
)
9437 return error_mark_node
;
9439 /* Assume that everything will go OK. */
9442 /* There are some types which cannot be array elements. */
9443 switch (TREE_CODE (type
))
9446 error_msg
= "array of void";
9450 error_msg
= "array of functions";
9453 case REFERENCE_TYPE
:
9454 error_msg
= "array of references";
9458 error_msg
= "array of data members";
9462 error_msg
= "array of function members";
9469 /* If something went wrong, issue an error-message and return. */
9473 cp_error ("declaration of `%D' as %s", name
, error_msg
);
9475 cp_error ("creating %s", error_msg
);
9477 return error_mark_node
;
9482 The constant expressions that specify the bounds of the arrays
9483 can be omitted only for the first member of the sequence. */
9484 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9486 cp_error ("declaration of `%D' as multidimensional array must have bounds for all dimensions except the first",
9489 return error_mark_node
;
9492 /* Figure out the index type for the array. */
9494 itype
= compute_array_index_type (name
, size
);
9496 return build_cplus_array_type (type
, itype
);
9499 /* Check that it's OK to declare a function with the indicated TYPE.
9500 SFK indicates the kind of special function (if any) that this
9501 function is. CTYPE is the class of which this function is a
9502 member. OPTYPE is the type given in a conversion operator
9503 declaration. Returns the actual return type of the function; that
9504 may be different than TYPE if an error occurs, or for certain
9505 special functions. */
9508 check_special_function_return_type (sfk
, type
, ctype
, optype
)
9509 special_function_kind sfk
;
9516 case sfk_constructor
:
9518 cp_error ("return type specification for constructor invalid");
9520 /* In the old ABI, we return `this'; in the new ABI we don't
9522 type
= flag_new_abi
? void_type_node
: build_pointer_type (ctype
);
9525 case sfk_destructor
:
9527 cp_error ("return type specification for destructor invalid");
9528 type
= void_type_node
;
9531 case sfk_conversion
:
9532 if (type
&& !same_type_p (type
, optype
))
9533 cp_error ("operator `%T' declared to return `%T'", optype
, type
);
9535 cp_pedwarn ("return type specified for `operator %T'", optype
);
9540 my_friendly_abort (20000408);
9547 /* Given declspecs and a declarator,
9548 determine the name and type of the object declared
9549 and construct a ..._DECL node for it.
9550 (In one case we can return a ..._TYPE node instead.
9551 For invalid input we sometimes return 0.)
9553 DECLSPECS is a chain of tree_list nodes whose value fields
9554 are the storage classes and type specifiers.
9556 DECL_CONTEXT says which syntactic context this declaration is in:
9557 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
9558 FUNCDEF for a function definition. Like NORMAL but a few different
9559 error messages in each case. Return value may be zero meaning
9560 this definition is too screwy to try to parse.
9561 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
9562 handle member functions (which have FIELD context).
9563 Return value may be zero meaning this definition is too screwy to
9565 PARM for a parameter declaration (either within a function prototype
9566 or before a function body). Make a PARM_DECL, or return void_type_node.
9567 CATCHPARM for a parameter declaration before a catch clause.
9568 TYPENAME if for a typename (in a cast or sizeof).
9569 Don't make a DECL node; just return the ..._TYPE node.
9570 FIELD for a struct or union field; make a FIELD_DECL.
9571 BITFIELD for a field with specified width.
9572 INITIALIZED is 1 if the decl has an initializer.
9574 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
9575 normal attributes in TREE_PURPOSE, or NULL_TREE.
9577 In the TYPENAME case, DECLARATOR is really an abstract declarator.
9578 It may also be so in the PARM case, for a prototype where the
9579 argument type is specified but not the name.
9581 This function is where the complicated C meanings of `static'
9582 and `extern' are interpreted.
9584 For C++, if there is any monkey business to do, the function which
9585 calls this one must do it, i.e., prepending instance variables,
9586 renaming overloaded function names, etc.
9588 Note that for this C++, it is an error to define a method within a class
9589 which does not belong to that class.
9591 Except in the case where SCOPE_REFs are implicitly known (such as
9592 methods within a class being redundantly qualified),
9593 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
9594 (class_name::decl_name). The caller must also deal with this.
9596 If a constructor or destructor is seen, and the context is FIELD,
9597 then the type gains the attribute TREE_HAS_x. If such a declaration
9598 is erroneous, NULL_TREE is returned.
9600 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
9601 function, these are the qualifiers to give to the `this' pointer. We
9602 apply TYPE_QUAL_RESTRICT to the this ptr, not the object.
9604 May return void_type_node if the declarator turned out to be a friend.
9605 See grokfield for details. */
9608 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
9611 enum decl_context decl_context
;
9615 RID_BIT_TYPE specbits
;
9618 tree type
= NULL_TREE
;
9624 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
9625 int explicit_int
= 0;
9626 int explicit_char
= 0;
9627 int defaulted_int
= 0;
9628 tree typedef_decl
= NULL_TREE
;
9630 tree typedef_type
= NULL_TREE
;
9631 int funcdef_flag
= 0;
9632 enum tree_code innermost_code
= ERROR_MARK
;
9635 /* See the code below that used this. */
9636 tree decl_machine_attr
= NULL_TREE
;
9638 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
9639 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
9640 tree init
= NULL_TREE
;
9642 /* Keep track of what sort of function is being processed
9643 so that we can warn about default return values, or explicit
9644 return values which do not match prescribed defaults. */
9645 special_function_kind sfk
= sfk_none
;
9647 tree dname
= NULL_TREE
;
9648 tree ctype
= current_class_type
;
9649 tree ctor_return_type
= NULL_TREE
;
9650 enum overload_flags flags
= NO_SPECIAL
;
9651 tree quals
= NULL_TREE
;
9652 tree raises
= NULL_TREE
;
9653 int template_count
= 0;
9654 tree in_namespace
= NULL_TREE
;
9658 RIDBIT_RESET_ALL (specbits
);
9659 if (decl_context
== FUNCDEF
)
9660 funcdef_flag
= 1, decl_context
= NORMAL
;
9661 else if (decl_context
== MEMFUNCDEF
)
9662 funcdef_flag
= -1, decl_context
= FIELD
;
9663 else if (decl_context
== BITFIELD
)
9664 bitfield
= 1, decl_context
= FIELD
;
9666 /* Look inside a declarator for the name being declared
9667 and get it as a string, for an error message. */
9669 tree
*next
= &declarator
;
9673 while (next
&& *next
)
9676 switch (TREE_CODE (decl
))
9679 /* For attributes. */
9680 next
= &TREE_VALUE (decl
);
9685 next
= &TREE_OPERAND (decl
, 0);
9688 case BIT_NOT_EXPR
: /* For C++ destructors! */
9690 tree name
= TREE_OPERAND (decl
, 0);
9691 tree rename
= NULL_TREE
;
9693 my_friendly_assert (flags
== NO_SPECIAL
, 152);
9695 sfk
= sfk_destructor
;
9696 if (TREE_CODE (name
) == TYPE_DECL
)
9697 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
9698 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
9699 if (ctype
== NULL_TREE
)
9701 if (current_class_type
== NULL_TREE
)
9703 error ("destructors must be member functions");
9708 tree t
= constructor_name (current_class_name
);
9715 tree t
= constructor_name (ctype
);
9722 cp_error ("destructor `%T' must match class name `%T'",
9724 TREE_OPERAND (decl
, 0) = rename
;
9730 case ADDR_EXPR
: /* C++ reference declaration */
9735 innermost_code
= TREE_CODE (decl
);
9736 next
= &TREE_OPERAND (decl
, 0);
9740 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
9742 /* This is actually a variable declaration using
9743 constructor syntax. We need to call start_decl and
9744 cp_finish_decl so we can get the variable
9747 tree attributes
, prefix_attributes
;
9749 *next
= TREE_OPERAND (decl
, 0);
9750 init
= CALL_DECLARATOR_PARMS (decl
);
9754 attributes
= TREE_PURPOSE (attrlist
);
9755 prefix_attributes
= TREE_VALUE (attrlist
);
9759 attributes
= NULL_TREE
;
9760 prefix_attributes
= NULL_TREE
;
9763 decl
= start_decl (declarator
, declspecs
, 1,
9764 attributes
, prefix_attributes
);
9765 decl_type_access_control (decl
);
9768 /* Look for __unused__ attribute */
9769 if (TREE_USED (TREE_TYPE (decl
)))
9770 TREE_USED (decl
) = 1;
9771 finish_decl (decl
, init
, NULL_TREE
);
9774 cp_error ("invalid declarator");
9777 innermost_code
= TREE_CODE (decl
);
9778 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
9779 ctype
= current_class_type
;
9781 && TREE_OPERAND (decl
, 0)
9782 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
9783 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
9784 == constructor_name_full (ctype
))
9785 || (DECL_NAME (TREE_OPERAND (decl
, 0))
9786 == constructor_name (ctype
)))))
9787 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9788 next
= &TREE_OPERAND (decl
, 0);
9790 if (ctype
!= NULL_TREE
9791 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
9792 && decl
== constructor_name (ctype
))
9794 sfk
= sfk_constructor
;
9795 ctor_return_type
= ctype
;
9800 case TEMPLATE_ID_EXPR
:
9802 tree fns
= TREE_OPERAND (decl
, 0);
9804 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9805 fns
= TREE_OPERAND (fns
, 0);
9808 if (TREE_CODE (dname
) == COMPONENT_REF
)
9809 dname
= TREE_OPERAND (dname
, 1);
9810 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9812 my_friendly_assert (is_overloaded_fn (dname
),
9814 dname
= DECL_NAME (get_first_fn (dname
));
9819 case IDENTIFIER_NODE
:
9820 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9827 cp_error ("declarator-id missing; using reserved word `%D'",
9829 name
= IDENTIFIER_POINTER (dname
);
9831 else if (!IDENTIFIER_TYPENAME_P (dname
))
9832 name
= IDENTIFIER_POINTER (dname
);
9835 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9836 flags
= TYPENAME_FLAG
;
9837 ctor_return_type
= TREE_TYPE (dname
);
9838 sfk
= sfk_conversion
;
9839 if (IDENTIFIER_GLOBAL_VALUE (dname
)
9840 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (dname
))
9842 name
= IDENTIFIER_POINTER (dname
);
9844 name
= "<invalid operator>";
9851 /* Perform error checking, and decide on a ctype. */
9852 tree cname
= TREE_OPERAND (decl
, 0);
9853 if (cname
== NULL_TREE
)
9855 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9858 in_namespace
= TREE_OPERAND (decl
, 0);
9859 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9861 else if (! is_aggr_type (cname
, 1))
9862 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9863 /* Must test TREE_OPERAND (decl, 1), in case user gives
9864 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9865 else if (TREE_OPERAND (decl
, 1)
9866 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9868 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9869 || TREE_CODE (cname
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
9871 cp_error ("`%T::%D' is not a valid declarator", cname
,
9872 TREE_OPERAND (decl
, 1));
9873 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9874 cname
, TREE_OPERAND (decl
, 1));
9875 return void_type_node
;
9877 else if (ctype
== NULL_TREE
)
9879 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9880 TREE_OPERAND (decl
, 0) = ctype
;
9883 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9885 cp_error ("type `%T' is not derived from type `%T'",
9887 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9893 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9894 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9895 == constructor_name_full (ctype
))
9896 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9897 == constructor_name (ctype
))))
9898 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9899 next
= &TREE_OPERAND (decl
, 1);
9903 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9904 && constructor_name (ctype
) == decl
)
9906 sfk
= sfk_constructor
;
9907 ctor_return_type
= ctype
;
9909 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9910 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9911 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9912 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9914 sfk
= sfk_destructor
;
9915 ctor_return_type
= ctype
;
9917 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9918 next
= &TREE_OPERAND (decl
, 0);
9929 /* Parse error puts this typespec where
9930 a declarator should go. */
9931 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9932 if (TREE_TYPE (decl
) == current_class_type
)
9933 cp_error (" perhaps you want `%T' for a constructor",
9934 current_class_name
);
9935 dname
= DECL_NAME (decl
);
9936 name
= IDENTIFIER_POINTER (dname
);
9938 /* Avoid giving two errors for this. */
9939 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9941 declspecs
= tree_cons (NULL_TREE
, integer_type_node
, declspecs
);
9947 cp_compiler_error ("`%D' as declarator", decl
);
9948 return 0; /* We used to do a 155 abort here. */
9953 /* A function definition's declarator must have the form of
9954 a function declarator. */
9956 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9959 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9960 && innermost_code
!= CALL_EXPR
9961 && ! (ctype
&& declspecs
== NULL_TREE
))
9963 cp_error ("declaration of `%D' as non-function", dname
);
9964 return void_type_node
;
9967 /* Anything declared one level down from the top level
9968 must be one of the parameters of a function
9969 (because the body is at least two levels down). */
9971 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9972 by not allowing C++ class definitions to specify their parameters
9973 with xdecls (must be spec.d in the parmlist).
9975 Since we now wait to push a class scope until we are sure that
9976 we are in a legitimate method context, we must set oldcname
9977 explicitly (since current_class_name is not yet alive).
9979 We also want to avoid calling this a PARM if it is in a namespace. */
9981 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
9983 struct binding_level
*b
= current_binding_level
;
9984 current_binding_level
= b
->level_chain
;
9985 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9986 decl_context
= PARM
;
9987 current_binding_level
= b
;
9991 name
= decl_context
== PARM
? "parameter" : "type name";
9993 /* Look through the decl specs and record which ones appear.
9994 Some typespecs are defined as built-in typenames.
9995 Others, the ones that are modifiers of other types,
9996 are represented by bits in SPECBITS: set the bits for
9997 the modifiers that appear. Storage class keywords are also in SPECBITS.
9999 If there is a typedef name or a type, store the type in TYPE.
10000 This includes builtin typedefs such as `int'.
10002 Set EXPLICIT_INT if the type is `int' or `char' and did not
10003 come from a user typedef.
10005 Set LONGLONG if `long' is mentioned twice.
10007 For C++, constructors and destructors have their own fast treatment. */
10009 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
10014 /* Certain parse errors slip through. For example,
10015 `int class;' is not caught by the parser. Try
10016 weakly to recover here. */
10017 if (TREE_CODE (spec
) != TREE_LIST
)
10020 id
= TREE_VALUE (spec
);
10022 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
10024 if (id
== ridpointers
[(int) RID_INT
]
10025 || id
== ridpointers
[(int) RID_CHAR
]
10026 || id
== ridpointers
[(int) RID_BOOL
]
10027 || id
== ridpointers
[(int) RID_WCHAR
])
10031 if (id
== ridpointers
[(int) RID_BOOL
])
10032 error ("`bool' is now a keyword");
10034 cp_error ("extraneous `%T' ignored", id
);
10038 if (id
== ridpointers
[(int) RID_INT
])
10040 else if (id
== ridpointers
[(int) RID_CHAR
])
10042 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
10046 /* C++ aggregate types. */
10047 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
10050 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
10052 type
= IDENTIFIER_TYPE_VALUE (id
);
10056 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
10058 if (ridpointers
[i
] == id
)
10060 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
10062 if (pedantic
&& ! in_system_header
&& warn_long_long
)
10063 pedwarn ("ISO C++ does not support `long long'");
10065 error ("`long long long' is too long for GCC");
10069 else if (RIDBIT_SETP (i
, specbits
))
10070 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
10071 RIDBIT_SET (i
, specbits
);
10076 /* C++ aggregate types. */
10077 else if (TREE_CODE (id
) == TYPE_DECL
)
10080 cp_error ("multiple declarations `%T' and `%T'", type
,
10084 type
= TREE_TYPE (id
);
10085 TREE_VALUE (spec
) = type
;
10090 error ("two or more data types in declaration of `%s'", name
);
10091 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
10093 register tree t
= lookup_name (id
, 1);
10094 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
10095 error ("`%s' fails to be a typedef or built in type",
10096 IDENTIFIER_POINTER (id
));
10099 type
= TREE_TYPE (t
);
10101 /* See the code below that used this. */
10102 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
10107 else if (id
!= error_mark_node
)
10108 /* Can't change CLASS nodes into RECORD nodes here! */
10114 typedef_type
= type
;
10116 /* No type at all: default to `int', and set DEFAULTED_INT
10117 because it was not a user-defined typedef. */
10119 if (type
== NULL_TREE
10120 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
10121 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10122 || RIDBIT_SETP (RID_LONG
, specbits
)
10123 || RIDBIT_SETP (RID_SHORT
, specbits
)))
10125 /* These imply 'int'. */
10126 type
= integer_type_node
;
10130 if (sfk
!= sfk_none
)
10131 type
= check_special_function_return_type (sfk
, type
,
10134 else if (type
== NULL_TREE
)
10140 /* We handle `main' specially here, because 'main () { }' is so
10141 common. With no options, it is allowed. With -Wreturn-type,
10142 it is a warning. It is only an error with -pedantic-errors. */
10143 is_main
= (funcdef_flag
10144 && MAIN_NAME_P (dname
)
10145 && ctype
== NULL_TREE
10146 && in_namespace
== NULL_TREE
10147 && current_namespace
== global_namespace
);
10149 if (in_system_header
|| flag_ms_extensions
)
10150 /* Allow it, sigh. */;
10151 else if (pedantic
|| ! is_main
)
10152 cp_pedwarn ("ISO C++ forbids declaration of `%s' with no type",
10154 else if (warn_return_type
)
10155 cp_warning ("ISO C++ forbids declaration of `%s' with no type",
10158 type
= integer_type_node
;
10163 /* Now process the modifiers that were specified
10164 and check for invalid combinations. */
10166 /* Long double is a special combination. */
10168 if (RIDBIT_SETP (RID_LONG
, specbits
)
10169 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
10171 RIDBIT_RESET (RID_LONG
, specbits
);
10172 type
= build_qualified_type (long_double_type_node
,
10173 CP_TYPE_QUALS (type
));
10176 /* Check all other uses of type modifiers. */
10178 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10179 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10180 || RIDBIT_SETP (RID_LONG
, specbits
)
10181 || RIDBIT_SETP (RID_SHORT
, specbits
))
10185 if (TREE_CODE (type
) == REAL_TYPE
)
10186 error ("short, signed or unsigned invalid for `%s'", name
);
10187 else if (TREE_CODE (type
) != INTEGER_TYPE
)
10188 error ("long, short, signed or unsigned invalid for `%s'", name
);
10189 else if (RIDBIT_SETP (RID_LONG
, specbits
)
10190 && RIDBIT_SETP (RID_SHORT
, specbits
))
10191 error ("long and short specified together for `%s'", name
);
10192 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10193 || RIDBIT_SETP (RID_SHORT
, specbits
))
10195 error ("long or short specified with char for `%s'", name
);
10196 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10197 || RIDBIT_SETP (RID_SHORT
, specbits
))
10198 && TREE_CODE (type
) == REAL_TYPE
)
10199 error ("long or short specified with floating type for `%s'", name
);
10200 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10201 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
10202 error ("signed and unsigned given together for `%s'", name
);
10206 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
10208 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
10210 if (flag_pedantic_errors
)
10215 /* Discard the type modifiers if they are invalid. */
10218 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
10219 RIDBIT_RESET (RID_SIGNED
, specbits
);
10220 RIDBIT_RESET (RID_LONG
, specbits
);
10221 RIDBIT_RESET (RID_SHORT
, specbits
);
10226 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
10227 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
10229 error ("complex invalid for `%s'", name
);
10230 RIDBIT_RESET (RID_COMPLEX
, specbits
);
10233 /* Decide whether an integer type is signed or not.
10234 Optionally treat bitfields as signed by default. */
10235 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10238 It is implementation-defined whether a plain (neither
10239 explicitly signed or unsigned) char, short, int, or long
10240 bit-field is signed or unsigned.
10242 Naturally, we extend this to long long as well. Note that
10243 this does not include wchar_t. */
10244 || (bitfield
&& !flag_signed_bitfields
10245 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
10246 /* A typedef for plain `int' without `signed' can be
10247 controlled just like plain `int', but a typedef for
10248 `signed int' cannot be so controlled. */
10250 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
10251 && (TREE_CODE (type
) == INTEGER_TYPE
10252 || TREE_CODE (type
) == CHAR_TYPE
)
10253 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
10256 type
= long_long_unsigned_type_node
;
10257 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10258 type
= long_unsigned_type_node
;
10259 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10260 type
= short_unsigned_type_node
;
10261 else if (type
== char_type_node
)
10262 type
= unsigned_char_type_node
;
10263 else if (typedef_decl
)
10264 type
= unsigned_type (type
);
10266 type
= unsigned_type_node
;
10268 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10269 && type
== char_type_node
)
10270 type
= signed_char_type_node
;
10272 type
= long_long_integer_type_node
;
10273 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10274 type
= long_integer_type_node
;
10275 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10276 type
= short_integer_type_node
;
10278 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
10280 /* If we just have "complex", it is equivalent to
10281 "complex double", but if any modifiers at all are specified it is
10282 the complex form of TYPE. E.g, "complex short" is
10283 "complex short int". */
10285 if (defaulted_int
&& ! longlong
10286 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
10287 || RIDBIT_SETP (RID_SHORT
, specbits
)
10288 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10289 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
10290 type
= complex_double_type_node
;
10291 else if (type
== integer_type_node
)
10292 type
= complex_integer_type_node
;
10293 else if (type
== float_type_node
)
10294 type
= complex_float_type_node
;
10295 else if (type
== double_type_node
)
10296 type
= complex_double_type_node
;
10297 else if (type
== long_double_type_node
)
10298 type
= complex_long_double_type_node
;
10300 type
= build_complex_type (type
);
10303 if (sfk
== sfk_conversion
10304 && (RIDBIT_SETP (RID_CONST
, specbits
)
10305 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
10306 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
10307 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
10310 /* Set CONSTP if this declaration is `const', whether by
10311 explicit specification or via a typedef.
10312 Likewise for VOLATILEP. */
10314 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
10316 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
10318 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
10319 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10320 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10321 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10322 type
= cp_build_qualified_type (type
, type_quals
);
10324 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
10325 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
10326 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
10327 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
10328 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
10330 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10331 staticp
= 1 + (decl_context
== FIELD
);
10333 if (virtualp
&& staticp
== 2)
10335 cp_error ("member `%D' cannot be declared both virtual and static",
10339 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
10340 RIDBIT_RESET (RID_FRIEND
, specbits
);
10342 /* Warn if two storage classes are given. Default to `auto'. */
10344 if (RIDBIT_ANY_SET (specbits
))
10346 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
10347 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
10348 if (decl_context
== PARM
&& nclasses
> 0)
10349 error ("storage class specifiers invalid in parameter declarations");
10350 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10352 if (decl_context
== PARM
)
10353 error ("typedef declaration invalid in parameter declaration");
10356 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
10357 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
10360 /* Give error if `virtual' is used outside of class declaration. */
10362 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
10364 error ("virtual outside class declaration");
10368 /* Static anonymous unions are dealt with here. */
10369 if (staticp
&& decl_context
== TYPENAME
10370 && TREE_CODE (declspecs
) == TREE_LIST
10371 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
10372 decl_context
= FIELD
;
10374 /* Warn about storage classes that are invalid for certain
10375 kinds of declarations (parameters, typenames, etc.). */
10378 error ("multiple storage classes in declaration of `%s'", name
);
10379 else if (decl_context
!= NORMAL
&& nclasses
> 0)
10381 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
10382 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
10383 || RIDBIT_SETP (RID_AUTO
, specbits
)))
10385 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10387 else if (decl_context
== FIELD
10388 /* C++ allows static class elements */
10389 && RIDBIT_SETP (RID_STATIC
, specbits
))
10390 /* C++ also allows inlines and signed and unsigned elements,
10391 but in those cases we don't come in here. */
10395 if (decl_context
== FIELD
)
10397 tree tmp
= NULL_TREE
;
10398 register int op
= 0;
10402 /* Avoid trying to get an operand off an identifier node. */
10403 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10406 tmp
= TREE_OPERAND (declarator
, 0);
10407 op
= IDENTIFIER_OPNAME_P (tmp
);
10408 if (IDENTIFIER_TYPENAME_P (tmp
))
10410 if (IDENTIFIER_GLOBAL_VALUE (tmp
)
10411 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (tmp
))
10413 name
= IDENTIFIER_POINTER (tmp
);
10415 name
= "<invalid operator>";
10418 error ("storage class specified for %s `%s'",
10419 op
? "member operator" : "field",
10424 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10425 error ("storage class specified for parameter `%s'", name
);
10427 error ("storage class specified for typename");
10429 RIDBIT_RESET (RID_REGISTER
, specbits
);
10430 RIDBIT_RESET (RID_AUTO
, specbits
);
10431 RIDBIT_RESET (RID_EXTERN
, specbits
);
10434 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
10436 if (toplevel_bindings_p ())
10438 /* It's common practice (and completely valid) to have a const
10439 be initialized and declared extern. */
10440 if (!(type_quals
& TYPE_QUAL_CONST
))
10441 warning ("`%s' initialized and declared `extern'", name
);
10444 error ("`%s' has both `extern' and initializer", name
);
10446 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
10447 && ! toplevel_bindings_p ())
10448 error ("nested function `%s' declared `extern'", name
);
10449 else if (toplevel_bindings_p ())
10451 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10452 error ("top-level declaration of `%s' specifies `auto'", name
);
10455 if (nclasses
> 0 && friendp
)
10456 error ("storage class specifiers invalid in friend function declarations");
10458 /* Now figure out the structure of the declarator proper.
10459 Descend through it, creating more complex types, until we reach
10460 the declared identifier (or NULL_TREE, in an absolute declarator). */
10462 inner_attrs
= NULL_TREE
;
10465 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
10466 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
10468 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
10469 an INDIRECT_REF (for *...),
10470 a CALL_EXPR (for ...(...)),
10471 an identifier (for the name being declared)
10472 or a null pointer (for the place in an absolute declarator
10473 where the name was omitted).
10474 For the last two cases, we have just exited the loop.
10476 For C++ it could also be
10477 a SCOPE_REF (for class :: ...). In this case, we have converted
10478 sensible names to types, and those are the values we use to
10479 qualify the member name.
10480 an ADDR_EXPR (for &...),
10481 a BIT_NOT_EXPR (for destructors)
10483 At this point, TYPE is the type of elements of an array,
10484 or for a function to return, or for a pointer to point to.
10485 After this sequence of ifs, TYPE is the type of the
10486 array or function or pointer, and DECLARATOR has had its
10487 outermost layer removed. */
10489 if (type
== error_mark_node
)
10491 if (TREE_CODE (declarator
) == SCOPE_REF
)
10492 declarator
= TREE_OPERAND (declarator
, 1);
10494 declarator
= TREE_OPERAND (declarator
, 0);
10497 if (quals
!= NULL_TREE
10498 && (declarator
== NULL_TREE
10499 || TREE_CODE (declarator
) != SCOPE_REF
))
10501 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
10502 ctype
= TYPE_METHOD_BASETYPE (type
);
10503 if (ctype
!= NULL_TREE
)
10505 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
10506 grok_method_quals (ctype
, dummy
, quals
);
10507 type
= TREE_TYPE (dummy
);
10508 ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
)));
10513 /* See the comment for the TREE_LIST case, below. */
10516 else if (inner_attrs
)
10518 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10519 inner_attrs
= NULL_TREE
;
10522 switch (TREE_CODE (declarator
))
10526 /* We encode a declarator with embedded attributes using
10527 a TREE_LIST. The attributes apply to the declarator
10528 directly inside them, so we have to skip an iteration
10529 before applying them to the type. If the declarator just
10530 inside is the declarator-id, we apply the attrs to the
10532 inner_attrs
= TREE_PURPOSE (declarator
);
10534 declarator
= TREE_VALUE (declarator
);
10540 register tree size
;
10542 size
= TREE_OPERAND (declarator
, 1);
10544 /* VC++ spells a zero-sized array with []. */
10545 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
10546 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10547 size
= integer_zero_node
;
10549 declarator
= TREE_OPERAND (declarator
, 0);
10551 type
= create_array_type_for_decl (dname
, type
, size
);
10553 /* VLAs never work as fields. */
10554 if (decl_context
== FIELD
&& !processing_template_decl
10555 && TREE_CODE (type
) == ARRAY_TYPE
10556 && TYPE_DOMAIN (type
) != NULL_TREE
10557 && !TREE_CONSTANT (TYPE_MAX_VALUE (TYPE_DOMAIN (type
))))
10559 cp_error ("size of member `%D' is not constant", dname
);
10560 /* Proceed with arbitrary constant size, so that offset
10561 computations don't get confused. */
10562 type
= create_array_type_for_decl (dname
, TREE_TYPE (type
),
10574 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
10575 tree inner_decl
= TREE_OPERAND (declarator
, 0);
10577 /* Declaring a function type.
10578 Make sure we have a valid type for the function to return. */
10580 /* We now know that the TYPE_QUALS don't apply to the
10581 decl, but to its return type. */
10582 type_quals
= TYPE_UNQUALIFIED
;
10584 /* Warn about some types functions can't return. */
10586 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10588 error ("`%s' declared as function returning a function", name
);
10589 type
= integer_type_node
;
10591 if (TREE_CODE (type
) == ARRAY_TYPE
)
10593 error ("`%s' declared as function returning an array", name
);
10594 type
= integer_type_node
;
10597 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
10598 inner_decl
= TREE_OPERAND (inner_decl
, 1);
10600 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
10601 inner_decl
= dname
;
10603 /* Pick up type qualifiers which should be applied to `this'. */
10604 quals
= CALL_DECLARATOR_QUALS (declarator
);
10606 /* Pick up the exception specifications. */
10607 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
10609 /* Say it's a definition only for the CALL_EXPR
10610 closest to the identifier. */
10613 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
10614 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
10615 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
10617 if (ctype
== NULL_TREE
10618 && decl_context
== FIELD
10620 && (friendp
== 0 || dname
== current_class_name
))
10621 ctype
= current_class_type
;
10623 if (ctype
&& sfk
== sfk_conversion
)
10624 TYPE_HAS_CONVERSION (ctype
) = 1;
10625 if (ctype
&& constructor_name (ctype
) == dname
)
10627 /* We are within a class's scope. If our declarator name
10628 is the same as the class name, and we are defining
10629 a function, then it is a constructor/destructor, and
10630 therefore returns a void type. */
10632 if (flags
== DTOR_FLAG
)
10634 /* ISO C++ 12.4/2. A destructor may not be
10635 declared const or volatile. A destructor may
10638 error ("destructor cannot be static member function");
10641 cp_error ("destructors may not be `%s'",
10642 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10645 if (decl_context
== FIELD
)
10647 if (! member_function_or_else (ctype
,
10648 current_class_type
,
10650 return void_type_node
;
10653 else /* It's a constructor. */
10655 if (explicitp
== 1)
10657 /* ISO C++ 12.1. A constructor may not be
10658 declared const or volatile. A constructor may
10659 not be virtual. A constructor may not be
10662 error ("constructor cannot be static member function");
10665 pedwarn ("constructors cannot be declared virtual");
10670 cp_error ("constructors may not be `%s'",
10671 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10675 RID_BIT_TYPE tmp_bits
;
10676 bcopy ((void*)&specbits
, (void*)&tmp_bits
, sizeof (RID_BIT_TYPE
));
10677 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10678 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10679 if (RIDBIT_ANY_SET (tmp_bits
))
10680 error ("return value type specifier for constructor ignored");
10682 if (decl_context
== FIELD
)
10684 if (! member_function_or_else (ctype
,
10685 current_class_type
,
10687 return void_type_node
;
10688 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10689 if (sfk
!= sfk_constructor
)
10693 if (decl_context
== FIELD
)
10699 error ("can't initialize friend function `%s'", name
);
10702 /* Cannot be both friend and virtual. */
10703 error ("virtual functions cannot be friends");
10704 RIDBIT_RESET (RID_FRIEND
, specbits
);
10707 if (decl_context
== NORMAL
)
10708 error ("friend declaration not in class definition");
10709 if (current_function_decl
&& funcdef_flag
)
10710 cp_error ("can't define friend function `%s' in a local class definition",
10714 /* Construct the function type and go to the next
10715 inner layer of declarator. */
10717 declarator
= TREE_OPERAND (declarator
, 0);
10719 /* FIXME: This is where default args should be fully
10722 arg_types
= grokparms (inner_parms
, funcdecl_p
? funcdef_flag
: 0);
10724 if (declarator
&& flags
== DTOR_FLAG
)
10726 /* A destructor declared in the body of a class will
10727 be represented as a BIT_NOT_EXPR. But, we just
10728 want the underlying IDENTIFIER. */
10729 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10730 declarator
= TREE_OPERAND (declarator
, 0);
10732 if (arg_types
!= void_list_node
)
10734 cp_error ("destructors may not have parameters");
10735 arg_types
= void_list_node
;
10736 last_function_parms
= NULL_TREE
;
10740 /* ANSI says that `const int foo ();'
10741 does not make the function foo const. */
10742 type
= build_function_type (type
, arg_types
);
10746 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10747 if (TREE_PURPOSE (t
)
10748 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10750 add_defarg_fn (type
);
10759 /* Filter out pointers-to-references and references-to-references.
10760 We can get these if a TYPE_DECL is used. */
10762 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10764 error ("cannot declare %s to references",
10765 TREE_CODE (declarator
) == ADDR_EXPR
10766 ? "references" : "pointers");
10767 declarator
= TREE_OPERAND (declarator
, 0);
10771 if (TREE_CODE (type
) == OFFSET_TYPE
10772 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10773 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10775 cp_error ("cannot declare pointer to `%#T' member",
10777 type
= TREE_TYPE (type
);
10780 /* Merge any constancy or volatility into the target type
10781 for the pointer. */
10783 /* We now know that the TYPE_QUALS don't apply to the decl,
10784 but to the target of the pointer. */
10785 type_quals
= TYPE_UNQUALIFIED
;
10787 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10789 if (TREE_CODE (type
) == VOID_TYPE
)
10790 error ("invalid type: `void &'");
10792 type
= build_reference_type (type
);
10794 else if (TREE_CODE (type
) == METHOD_TYPE
)
10795 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10797 type
= build_pointer_type (type
);
10799 /* Process a list of type modifier keywords (such as
10800 const or volatile) that were given inside the `*' or `&'. */
10802 if (TREE_TYPE (declarator
))
10804 register tree typemodlist
;
10810 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10811 typemodlist
= TREE_CHAIN (typemodlist
))
10813 tree qualifier
= TREE_VALUE (typemodlist
);
10815 if (qualifier
== ridpointers
[(int) RID_CONST
])
10817 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10819 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10824 error ("invalid type modifier within pointer declarator");
10828 pedwarn ("duplicate `const'");
10830 pedwarn ("duplicate `volatile'");
10832 pedwarn ("duplicate `restrict'");
10834 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10835 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10836 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10837 if (TREE_CODE (declarator
) == ADDR_EXPR
10838 && (constp
|| volatilep
))
10841 pedwarn ("discarding `const' applied to a reference");
10843 pedwarn ("discarding `volatile' applied to a reference");
10844 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10846 type
= cp_build_qualified_type (type
, type_quals
);
10848 declarator
= TREE_OPERAND (declarator
, 0);
10854 /* We have converted type names to NULL_TREE if the
10855 name was bogus, or to a _TYPE node, if not.
10857 The variable CTYPE holds the type we will ultimately
10858 resolve to. The code here just needs to build
10859 up appropriate member types. */
10860 tree sname
= TREE_OPERAND (declarator
, 1);
10863 /* Destructors can have their visibilities changed as well. */
10864 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10865 sname
= TREE_OPERAND (sname
, 0);
10867 if (TREE_COMPLEXITY (declarator
) == 0)
10868 /* This needs to be here, in case we are called
10869 multiple times. */ ;
10870 else if (TREE_COMPLEXITY (declarator
) == -1)
10871 /* Namespace member. */
10872 pop_decl_namespace ();
10873 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10874 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10875 else if (! IS_AGGR_TYPE_CODE
10876 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10878 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10880 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10881 that refer to ctype. They couldn't be resolved earlier
10882 because we hadn't pushed into the class yet.
10883 Example: resolve 'B<T>::type' in
10884 'B<typename B<T>::type> B<T>::f () { }'. */
10885 if (current_template_parms
10886 && uses_template_parms (type
)
10887 && uses_template_parms (current_class_type
))
10889 tree args
= current_template_args ();
10890 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10893 /* This pop_nested_class corresponds to the
10894 push_nested_class used to push into class scope for
10895 parsing the argument list of a function decl, in
10897 pop_nested_class ();
10898 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10901 my_friendly_abort (16);
10903 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10905 /* We had a reference to a global decl, or
10906 perhaps we were given a non-aggregate typedef,
10907 in which case we cleared this out, and should just
10908 keep going as though it wasn't there. */
10909 declarator
= sname
;
10912 ctype
= TREE_OPERAND (declarator
, 0);
10915 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10917 /* You're supposed to have one `template <...>'
10918 for every template class, but you don't need one
10919 for a full specialization. For example:
10921 template <class T> struct S{};
10922 template <> struct S<int> { void f(); };
10923 void S<int>::f () {}
10925 is correct; there shouldn't be a `template <>' for
10926 the definition of `S<int>::f'. */
10927 if (CLASSTYPE_TEMPLATE_INFO (t
)
10928 && (CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
10929 || uses_template_parms (CLASSTYPE_TI_ARGS (t
))))
10930 template_count
+= 1;
10932 t
= TYPE_MAIN_DECL (t
);
10933 if (DECL_LANG_SPECIFIC (t
))
10934 t
= DECL_CONTEXT (t
);
10939 if (sname
== NULL_TREE
)
10942 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10944 /* This is the `standard' use of the scoping operator:
10945 basetype :: member . */
10947 if (ctype
== current_class_type
)
10953 Is this ill-formed? */
10956 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10959 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10961 if (current_class_type
== NULL_TREE
10963 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10964 TYPE_ARG_TYPES (type
));
10967 cp_error ("cannot declare member function `%T::%s' within `%T'",
10968 ctype
, name
, current_class_type
);
10969 return void_type_node
;
10972 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10973 || COMPLETE_TYPE_P (complete_type (ctype
)))
10975 /* Have to move this code elsewhere in this function.
10976 this code is used for i.e., typedef int A::M; M *pm;
10978 It is? How? jason 10/2/94 */
10980 if (current_class_type
)
10982 cp_error ("cannot declare member `%T::%s' within `%T'",
10983 ctype
, name
, current_class_type
);
10984 return void_type_node
;
10986 type
= build_offset_type (ctype
, type
);
10988 else if (uses_template_parms (ctype
))
10990 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10992 = build_cplus_method_type (ctype
, TREE_TYPE (type
),
10993 TYPE_ARG_TYPES (type
));
10997 cp_error ("structure `%T' not yet defined", ctype
);
10998 return error_mark_node
;
11001 declarator
= sname
;
11003 else if (TREE_CODE (sname
) == SCOPE_REF
)
11004 my_friendly_abort (17);
11008 declarator
= TREE_OPERAND (declarator
, 1);
11009 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
11010 /* In this case, we will deal with it later. */
11014 if (TREE_CODE (type
) == FUNCTION_TYPE
)
11015 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11016 TYPE_ARG_TYPES (type
));
11018 type
= build_offset_type (ctype
, type
);
11025 declarator
= TREE_OPERAND (declarator
, 0);
11030 case ENUMERAL_TYPE
:
11031 declarator
= NULL_TREE
;
11035 declarator
= NULL_TREE
;
11039 my_friendly_abort (158);
11043 /* See the comment for the TREE_LIST case, above. */
11046 if (! ignore_attrs
)
11047 decl_attributes (type
, inner_attrs
, NULL_TREE
);
11049 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
11051 attrlist
= build_decl_list (NULL_TREE
, inner_attrs
);
11054 /* Now TYPE has the actual type. */
11056 if (explicitp
== 1 || (explicitp
&& friendp
))
11058 /* [dcl.fct.spec] The explicit specifier shall only be used in
11059 declarations of constructors within a class definition. */
11060 error ("only declarations of constructors can be `explicit'");
11064 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11066 if (current_class_name
== NULL_TREE
|| decl_context
== PARM
|| friendp
)
11068 error ("non-member `%s' cannot be declared `mutable'", name
);
11069 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11071 else if (decl_context
== TYPENAME
|| RIDBIT_SETP (RID_TYPEDEF
, specbits
))
11073 error ("non-object member `%s' cannot be declared `mutable'", name
);
11074 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11076 else if (TREE_CODE (type
) == FUNCTION_TYPE
11077 || TREE_CODE (type
) == METHOD_TYPE
)
11079 error ("function `%s' cannot be declared `mutable'", name
);
11080 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11084 error ("static `%s' cannot be declared `mutable'", name
);
11085 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11087 else if (type_quals
& TYPE_QUAL_CONST
)
11089 error ("const `%s' cannot be declared `mutable'", name
);
11090 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11094 if (declarator
== NULL_TREE
11095 || TREE_CODE (declarator
) == IDENTIFIER_NODE
11096 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
11097 && (TREE_CODE (type
) == FUNCTION_TYPE
11098 || TREE_CODE (type
) == METHOD_TYPE
)))
11100 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11102 cp_error ("template-id `%D' used as a declarator", declarator
);
11103 declarator
= dname
;
11106 /* Unexpected declarator format. */
11107 my_friendly_abort (990210);
11109 /* If this is declaring a typedef name, return a TYPE_DECL. */
11111 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
11115 /* Note that the grammar rejects storage classes
11116 in typenames, fields or parameters. */
11117 if (current_lang_name
== lang_name_java
)
11118 TYPE_FOR_JAVA (type
) = 1;
11120 if (decl_context
== FIELD
)
11122 if (declarator
== constructor_name (current_class_type
))
11123 cp_pedwarn ("ISO C++ forbids nested type `%D' with same name as enclosing class",
11125 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
11128 decl
= build_decl (TYPE_DECL
, declarator
, type
);
11130 /* If the user declares "typedef struct {...} foo" then the
11131 struct will have an anonymous name. Fill that name in now.
11132 Nothing can refer to it, so nothing needs know about the name
11134 if (type
!= error_mark_node
11136 && TYPE_NAME (type
)
11137 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
11138 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
11139 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
11141 tree oldname
= TYPE_NAME (type
);
11144 /* Replace the anonymous name with the real name everywhere. */
11145 lookup_tag_reverse (type
, declarator
);
11146 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
11147 if (TYPE_NAME (t
) == oldname
)
11148 TYPE_NAME (t
) = decl
;
11150 if (TYPE_LANG_SPECIFIC (type
))
11151 TYPE_WAS_ANONYMOUS (type
) = 1;
11153 /* If this is a typedef within a template class, the nested
11154 type is a (non-primary) template. The name for the
11155 template needs updating as well. */
11156 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
11157 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
11158 = TYPE_IDENTIFIER (type
);
11161 DECL_ASSEMBLER_NAME (decl
) = mangle_type (type
);
11164 /* XXX Temporarily set the scope.
11165 When returning, start_decl expects it as NULL_TREE,
11166 and will then then set it using pushdecl. */
11167 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
11168 if (current_class_type
)
11169 DECL_CONTEXT (decl
) = current_class_type
;
11171 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
11173 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
11174 DECL_ASSEMBLER_NAME (decl
)
11175 = get_identifier (build_overload_name (type
, 1, 1));
11176 DECL_CONTEXT (decl
) = NULL_TREE
;
11179 /* FIXME remangle member functions; member functions of a
11180 type with external linkage have external linkage. */
11183 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11185 cp_error_at ("typedef name may not be class-qualified", decl
);
11190 if (ctype
== NULL_TREE
)
11192 if (TREE_CODE (type
) != METHOD_TYPE
)
11193 cp_error_at ("invalid type qualifier for non-member function type", decl
);
11195 ctype
= TYPE_METHOD_BASETYPE (type
);
11197 if (ctype
!= NULL_TREE
)
11198 grok_method_quals (ctype
, decl
, quals
);
11201 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
11202 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
11203 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
11205 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
11206 inlinep
, friendp
, raises
!= NULL_TREE
);
11209 error ("typedef declaration includes an initializer");
11214 /* Detect the case of an array type of unspecified size
11215 which came, as such, direct from a typedef name.
11216 We must copy the type, so that each identifier gets
11217 a distinct type, so that each identifier's size can be
11218 controlled separately by its own initializer. */
11220 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
11221 && TYPE_DOMAIN (type
) == NULL_TREE
)
11223 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
11226 /* If this is a type name (such as, in a cast or sizeof),
11227 compute the type and return it now. */
11229 if (decl_context
== TYPENAME
)
11231 /* Note that the grammar rejects storage classes
11232 in typenames, fields or parameters. */
11233 if (type_quals
!= TYPE_UNQUALIFIED
)
11234 type_quals
= TYPE_UNQUALIFIED
;
11236 /* Special case: "friend class foo" looks like a TYPENAME context. */
11239 if (type_quals
!= TYPE_UNQUALIFIED
)
11241 cp_error ("type qualifiers specified for friend class declaration");
11242 type_quals
= TYPE_UNQUALIFIED
;
11246 cp_error ("`inline' specified for friend class declaration");
11249 if (!current_aggr
&& TREE_CODE (type
) != TYPENAME_TYPE
)
11251 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
11252 cp_error ("template parameters cannot be friends");
11254 cp_error ("friend declaration requires `%#T'", type
);
11257 /* Only try to do this stuff if we didn't already give up. */
11258 if (type
!= integer_type_node
)
11260 /* A friendly class? */
11261 if (current_class_type
)
11262 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
11264 cp_error ("trying to make class `%T' a friend of global scope",
11266 type
= void_type_node
;
11271 if (ctype
== NULL_TREE
)
11273 if (TREE_CODE (type
) != METHOD_TYPE
)
11274 cp_error ("invalid qualifiers on non-member function type");
11276 ctype
= TYPE_METHOD_BASETYPE (type
);
11280 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
11281 grok_method_quals (ctype
, dummy
, quals
);
11282 type
= TREE_TYPE (dummy
);
11288 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
11289 && decl_context
!= CATCHPARM
11290 && TREE_CODE (type
) != UNION_TYPE
11293 cp_error ("abstract declarator `%T' used as declaration", type
);
11294 declarator
= make_anon_name ();
11297 /* `void' at top level (not within pointer)
11298 is allowed only in typedefs or type names.
11299 We don't complain about parms either, but that is because
11300 a better error message can be made later. */
11302 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
11305 error ("unnamed variable or field declared void");
11306 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
11308 if (IDENTIFIER_OPNAME_P (declarator
))
11309 my_friendly_abort (356);
11311 error ("variable or field `%s' declared void", name
);
11314 error ("variable or field declared void");
11315 type
= integer_type_node
;
11318 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
11319 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
11321 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
11323 if (ctype
|| in_namespace
)
11324 error ("cannot use `::' in parameter declaration");
11326 /* A parameter declared as an array of T is really a pointer to T.
11327 One declared as a function is really a pointer to a function.
11328 One declared as a member is really a pointer to member. */
11330 if (TREE_CODE (type
) == ARRAY_TYPE
)
11332 /* Transfer const-ness of array into that of type pointed to. */
11333 type
= build_pointer_type (TREE_TYPE (type
));
11334 type_quals
= TYPE_UNQUALIFIED
;
11336 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11337 type
= build_pointer_type (type
);
11338 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11339 type
= build_pointer_type (type
);
11340 else if (TREE_CODE (type
) == VOID_TYPE
&& declarator
)
11342 error ("declaration of `%s' as void", name
);
11348 register tree decl
;
11350 if (decl_context
== PARM
)
11352 decl
= build_decl (PARM_DECL
, declarator
, type
);
11354 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
11355 inlinep
, friendp
, raises
!= NULL_TREE
);
11357 /* Compute the type actually passed in the parmlist,
11358 for the case where there is no prototype.
11359 (For example, shorts and chars are passed as ints.)
11360 When there is a prototype, this is overridden later. */
11362 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
11364 else if (decl_context
== FIELD
)
11366 if (type
== error_mark_node
)
11368 /* Happens when declaring arrays of sizes which
11369 are error_mark_node, for example. */
11372 else if (in_namespace
&& !friendp
)
11374 /* Something like struct S { int N::j; }; */
11375 cp_error ("invalid use of `::'");
11378 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11381 tree function_context
;
11383 /* We catch the others as conflicts with the builtin
11385 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
11387 cp_error ("function `%D' cannot be declared friend",
11394 if (ctype
== NULL_TREE
)
11395 ctype
= current_class_type
;
11397 if (ctype
== NULL_TREE
)
11399 cp_error ("can't make `%D' into a method -- not in a class",
11401 return void_type_node
;
11404 /* ``A union may [ ... ] not [ have ] virtual functions.''
11406 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
11408 cp_error ("function `%D' declared virtual inside a union",
11410 return void_type_node
;
11413 if (declarator
== ansi_opname (NEW_EXPR
)
11414 || declarator
== ansi_opname (VEC_NEW_EXPR
)
11415 || declarator
== ansi_opname (DELETE_EXPR
)
11416 || declarator
== ansi_opname (VEC_DELETE_EXPR
))
11420 cp_error ("`%D' cannot be declared virtual, since it is always static",
11425 else if (staticp
< 2)
11426 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11427 TYPE_ARG_TYPES (type
));
11430 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
11431 function_context
= (ctype
!= NULL_TREE
) ?
11432 decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
11433 publicp
= (! friendp
|| ! staticp
)
11434 && function_context
== NULL_TREE
;
11435 decl
= grokfndecl (ctype
, type
,
11436 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
11437 ? declarator
: dname
,
11439 virtualp
, flags
, quals
, raises
,
11440 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
11441 funcdef_flag
, template_count
, in_namespace
);
11442 if (decl
== NULL_TREE
)
11445 /* This clobbers the attrs stored in `decl' from `attrlist'. */
11446 /* The decl and setting of decl_machine_attr is also turned off. */
11447 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
11450 /* [class.conv.ctor]
11452 A constructor declared without the function-specifier
11453 explicit that can be called with a single parameter
11454 specifies a conversion from the type of its first
11455 parameter to the type of its class. Such a constructor
11456 is called a converting constructor. */
11457 if (explicitp
== 2)
11458 DECL_NONCONVERTING_P (decl
) = 1;
11459 else if (DECL_CONSTRUCTOR_P (decl
))
11461 /* The constructor can be called with exactly one
11462 parameter if there is at least one parameter, and
11463 any subsequent parameters have default arguments.
11464 We don't look at the first parameter, which is
11465 really just the `this' parameter for the new
11468 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
11470 /* Skip the `in_chrg' argument too, if present. */
11471 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
11472 arg_types
= TREE_CHAIN (arg_types
);
11474 if (arg_types
== void_list_node
11476 && TREE_CHAIN (arg_types
)
11477 && TREE_CHAIN (arg_types
) != void_list_node
11478 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
11479 DECL_NONCONVERTING_P (decl
) = 1;
11482 else if (TREE_CODE (type
) == METHOD_TYPE
)
11484 /* We only get here for friend declarations of
11485 members of other classes. */
11486 /* All method decls are public, so tell grokfndecl to set
11487 TREE_PUBLIC, also. */
11488 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
11489 virtualp
, flags
, quals
, raises
,
11490 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
11491 template_count
, in_namespace
);
11492 if (decl
== NULL_TREE
)
11495 else if (!staticp
&& ! processing_template_decl
11496 && !COMPLETE_TYPE_P (complete_type (type
))
11497 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
11500 cp_error ("field `%D' has incomplete type", declarator
);
11502 cp_error ("name `%T' has incomplete type", type
);
11504 /* If we're instantiating a template, tell them which
11505 instantiation made the field's type be incomplete. */
11506 if (current_class_type
11507 && TYPE_NAME (current_class_type
)
11508 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
11509 && declspecs
&& TREE_VALUE (declspecs
)
11510 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
11511 cp_error (" in instantiation of template `%T'",
11512 current_class_type
);
11514 type
= error_mark_node
;
11521 error ("`%s' is neither function nor member function; cannot be declared friend",
11522 IDENTIFIER_POINTER (declarator
));
11530 /* Friends are treated specially. */
11531 if (ctype
== current_class_type
)
11532 warning ("member functions are implicitly friends of their class");
11535 tree t
= NULL_TREE
;
11536 if (decl
&& DECL_NAME (decl
))
11538 if (template_class_depth (current_class_type
) == 0)
11541 = check_explicit_specialization
11543 template_count
, 2 * (funcdef_flag
!= 0) + 4);
11544 if (decl
== error_mark_node
)
11545 return error_mark_node
;
11548 t
= do_friend (ctype
, declarator
, decl
,
11549 last_function_parms
, attrlist
, flags
, quals
,
11552 if (t
&& funcdef_flag
)
11555 return void_type_node
;
11559 /* Structure field. It may not be a function, except for C++ */
11561 if (decl
== NULL_TREE
)
11567 /* An attempt is being made to initialize a non-static
11568 member. But, from [class.mem]:
11570 4 A member-declarator can contain a
11571 constant-initializer only if it declares a static
11572 member (_class.static_) of integral or enumeration
11573 type, see _class.static.data_.
11575 This used to be relatively common practice, but
11576 the rest of the compiler does not correctly
11577 handle the initialization unless the member is
11578 static so we make it static below. */
11579 cp_pedwarn ("ISO C++ forbids initialization of member `%D'",
11581 cp_pedwarn ("making `%D' static", declarator
);
11585 if (uses_template_parms (type
))
11586 /* We'll check at instantiation time. */
11588 else if (check_static_variable_definition (declarator
,
11590 /* If we just return the declaration, crashes
11591 will sometimes occur. We therefore return
11592 void_type_node, as if this was a friend
11593 declaration, to cause callers to completely
11594 ignore this declaration. */
11595 return void_type_node
;
11598 /* 9.2p13 [class.mem] */
11599 if (declarator
== constructor_name (current_class_type
)
11600 /* The standard does not allow non-static data members
11601 here either, but we agreed at the 10/99 meeting
11602 to change that in TC 1 so that they are allowed in
11603 classes with no user-defined constructors. */
11605 cp_pedwarn ("ISO C++ forbids static data member `%D' with same name as enclosing class",
11610 /* C++ allows static class members. All other work
11611 for this is done by grokfield. */
11612 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
11613 TREE_STATIC (decl
) = 1;
11614 /* In class context, 'static' means public access. */
11615 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
11619 decl
= build_decl (FIELD_DECL
, declarator
, type
);
11620 DECL_NONADDRESSABLE_P (decl
) = bitfield
;
11621 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11623 DECL_MUTABLE_P (decl
) = 1;
11624 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11628 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
11629 inlinep
, friendp
, raises
!= NULL_TREE
);
11632 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11634 tree original_name
;
11640 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11641 original_name
= dname
;
11643 original_name
= declarator
;
11645 if (RIDBIT_SETP (RID_AUTO
, specbits
))
11646 error ("storage class `auto' invalid for function `%s'", name
);
11647 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11648 error ("storage class `register' invalid for function `%s'", name
);
11650 /* Function declaration not at top level.
11651 Storage classes other than `extern' are not allowed
11652 and `extern' makes no difference. */
11653 if (! toplevel_bindings_p ()
11654 && (RIDBIT_SETP (RID_STATIC
, specbits
)
11655 || RIDBIT_SETP (RID_INLINE
, specbits
))
11658 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11659 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
11661 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
11664 if (ctype
== NULL_TREE
)
11668 error ("virtual non-class function `%s'", name
);
11672 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
11673 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11674 TYPE_ARG_TYPES (type
));
11676 /* Record presence of `static'. */
11677 publicp
= (ctype
!= NULL_TREE
11678 || RIDBIT_SETP (RID_EXTERN
, specbits
)
11679 || !RIDBIT_SETP (RID_STATIC
, specbits
));
11681 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
11682 virtualp
, flags
, quals
, raises
,
11684 publicp
, inlinep
, funcdef_flag
,
11685 template_count
, in_namespace
);
11686 if (decl
== NULL_TREE
)
11691 int illegal_static
= 0;
11693 /* Don't allow a static member function in a class, and forbid
11694 declaring main to be static. */
11695 if (TREE_CODE (type
) == METHOD_TYPE
)
11697 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11698 illegal_static
= 1;
11700 else if (current_function_decl
)
11702 /* FIXME need arm citation */
11703 error ("cannot declare static function inside another function");
11704 illegal_static
= 1;
11707 if (illegal_static
)
11710 RIDBIT_RESET (RID_STATIC
, specbits
);
11716 /* It's a variable. */
11718 /* An uninitialized decl with `extern' is a reference. */
11719 decl
= grokvardecl (type
, declarator
, &specbits
,
11721 (type_quals
& TYPE_QUAL_CONST
) != 0,
11723 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11724 inlinep
, friendp
, raises
!= NULL_TREE
);
11728 DECL_CONTEXT (decl
) = ctype
;
11731 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11733 RIDBIT_RESET (RID_STATIC
, specbits
);
11735 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11737 cp_error ("static member `%D' declared `register'", decl
);
11738 RIDBIT_RESET (RID_REGISTER
, specbits
);
11740 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11742 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11744 RIDBIT_RESET (RID_EXTERN
, specbits
);
11749 my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE
, specbits
), 19990927);
11751 /* Record `register' declaration for warnings on &
11752 and in case doing stupid register allocation. */
11754 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11755 DECL_REGISTER (decl
) = 1;
11757 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11758 DECL_THIS_EXTERN (decl
) = 1;
11760 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11761 DECL_THIS_STATIC (decl
) = 1;
11763 /* Record constancy and volatility. There's no need to do this
11764 when processing a template; we'll do this for the instantiated
11765 declaration based on the type of DECL. */
11766 if (!processing_template_decl
)
11767 c_apply_type_quals_to_decl (type_quals
, decl
);
11773 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11774 An empty exprlist is a parmlist. An exprlist which
11775 contains only identifiers at the global level
11776 is a parmlist. Otherwise, it is an exprlist. */
11779 parmlist_is_exprlist (exprs
)
11782 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11785 if (toplevel_bindings_p ())
11787 /* At the global level, if these are all identifiers,
11788 then it is a parmlist. */
11791 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11793 exprs
= TREE_CHAIN (exprs
);
11800 /* Subroutine of start_function. Ensure that each of the parameter
11801 types (as listed in PARMS) is complete, as is required for a
11802 function definition. */
11805 require_complete_types_for_parms (parms
)
11808 for (; parms
; parms
= TREE_CHAIN (parms
))
11810 tree type
= TREE_TYPE (parms
);
11812 /* Try to complete the TYPE. */
11813 type
= complete_type (type
);
11815 if (type
== error_mark_node
)
11818 if (!COMPLETE_TYPE_P (type
))
11820 if (DECL_NAME (parms
))
11821 error ("parameter `%s' has incomplete type",
11822 IDENTIFIER_POINTER (DECL_NAME (parms
)));
11824 error ("parameter has incomplete type");
11825 TREE_TYPE (parms
) = error_mark_node
;
11828 layout_decl (parms
, 0);
11832 /* Returns non-zero if T is a local variable. */
11835 local_variable_p (t
)
11838 if ((TREE_CODE (t
) == VAR_DECL
11839 /* A VAR_DECL with a context that is a _TYPE is a static data
11841 && !TYPE_P (CP_DECL_CONTEXT (t
))
11842 /* Any other non-local variable must be at namespace scope. */
11843 && !DECL_NAMESPACE_SCOPE_P (t
))
11844 || (TREE_CODE (t
) == PARM_DECL
))
11850 /* Returns non-zero if T is an automatic local variable or a label.
11851 (These are the declarations that need to be remapped when the code
11852 containing them is duplicated.) */
11855 nonstatic_local_decl_p (t
)
11858 return ((local_variable_p (t
) && !TREE_STATIC (t
))
11859 || TREE_CODE (t
) == LABEL_DECL
11860 || TREE_CODE (t
) == RESULT_DECL
);
11863 /* Like local_variable_p, but suitable for use as a tree-walking
11867 local_variable_p_walkfn (tp
, walk_subtrees
, data
)
11869 int *walk_subtrees ATTRIBUTE_UNUSED
;
11870 void *data ATTRIBUTE_UNUSED
;
11872 return ((local_variable_p (*tp
) && !DECL_ARTIFICIAL (*tp
))
11873 ? *tp
: NULL_TREE
);
11876 /* Check that ARG, which is a default-argument expression for a
11877 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11878 something goes wrong. DECL may also be a _TYPE node, rather than a
11879 DECL, if there is no DECL available. */
11882 check_default_argument (decl
, arg
)
11889 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11890 /* We get a DEFAULT_ARG when looking at an in-class declaration
11891 with a default argument. Ignore the argument for now; we'll
11892 deal with it after the class is complete. */
11895 if (processing_template_decl
|| uses_template_parms (arg
))
11896 /* We don't do anything checking until instantiation-time. Note
11897 that there may be uninstantiated arguments even for an
11898 instantiated function, since default arguments are not
11899 instantiated until they are needed. */
11908 decl_type
= TREE_TYPE (decl
);
11910 if (arg
== error_mark_node
11911 || decl
== error_mark_node
11912 || TREE_TYPE (arg
) == error_mark_node
11913 || decl_type
== error_mark_node
)
11914 /* Something already went wrong. There's no need to check
11916 return error_mark_node
;
11918 /* [dcl.fct.default]
11920 A default argument expression is implicitly converted to the
11922 if (!TREE_TYPE (arg
)
11923 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11926 cp_error ("default argument for `%#D' has type `%T'",
11927 decl
, TREE_TYPE (arg
));
11929 cp_error ("default argument for parameter of type `%T' has type `%T'",
11930 decl_type
, TREE_TYPE (arg
));
11932 return error_mark_node
;
11935 /* [dcl.fct.default]
11937 Local variables shall not be used in default argument
11940 The keyword `this' shall not be used in a default argument of a
11941 member function. */
11942 var
= walk_tree_without_duplicates (&arg
, local_variable_p_walkfn
,
11946 cp_error ("default argument `%E' uses local variable `%D'",
11948 return error_mark_node
;
11955 /* Decode the list of parameter types for a function type.
11956 Given the list of things declared inside the parens,
11957 return a list of types.
11959 The list we receive can have three kinds of elements:
11960 an IDENTIFIER_NODE for names given without types,
11961 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11962 or void_type_node, to mark the end of an argument list
11963 when additional arguments are not permitted (... was not used).
11965 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11966 a mere declaration. A nonempty identifier-list gets an error message
11967 when FUNCDEF_FLAG is zero.
11968 If FUNCDEF_FLAG is 1, then parameter types must be complete.
11969 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11971 If all elements of the input list contain types,
11972 we return a list of the types.
11973 If all elements contain no type (except perhaps a void_type_node
11974 at the end), we return a null list.
11975 If some have types and some do not, it is an error, and we
11976 return a null list.
11978 Also set last_function_parms to either
11979 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11980 A list of names is converted to a chain of PARM_DECLs
11981 by store_parm_decls so that ultimately it is always a chain of decls.
11983 Note that in C++, parameters can take default values. These default
11984 values are in the TREE_PURPOSE field of the TREE_LIST. It is
11985 an error to specify default values which are followed by parameters
11986 that have no default values, or an ELLIPSES. For simplicities sake,
11987 only parameters which are specified with their types can take on
11991 grokparms (first_parm
, funcdef_flag
)
11995 tree result
= NULL_TREE
;
11996 tree decls
= NULL_TREE
;
11998 if (first_parm
!= NULL_TREE
11999 && TREE_CODE (TREE_VALUE (first_parm
)) == IDENTIFIER_NODE
)
12001 if (! funcdef_flag
)
12002 pedwarn ("parameter names (without types) in function declaration");
12003 last_function_parms
= first_parm
;
12006 else if (first_parm
!= NULL_TREE
12007 && TREE_CODE (TREE_VALUE (first_parm
)) != TREE_LIST
12008 && TREE_CODE (TREE_VALUE (first_parm
)) != VOID_TYPE
)
12009 my_friendly_abort (145);
12012 /* Types were specified. This is a list of declarators
12013 each represented as a TREE_LIST node. */
12014 register tree parm
, chain
;
12015 int any_init
= 0, any_error
= 0;
12017 if (first_parm
!= NULL_TREE
)
12019 tree last_result
= NULL_TREE
;
12020 tree last_decl
= NULL_TREE
;
12022 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
12024 tree type
= NULL_TREE
, list_node
= parm
;
12025 register tree decl
= TREE_VALUE (parm
);
12026 tree init
= TREE_PURPOSE (parm
);
12028 chain
= TREE_CHAIN (parm
);
12029 /* @@ weak defense against parse errors. */
12030 if (TREE_CODE (decl
) != VOID_TYPE
12031 && TREE_CODE (decl
) != TREE_LIST
)
12033 /* Give various messages as the need arises. */
12034 if (TREE_CODE (decl
) == STRING_CST
)
12035 cp_error ("invalid string constant `%E'", decl
);
12036 else if (TREE_CODE (decl
) == INTEGER_CST
)
12037 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
12041 if (TREE_CODE (decl
) != VOID_TYPE
)
12043 decl
= grokdeclarator (TREE_VALUE (decl
),
12044 TREE_PURPOSE (decl
),
12045 PARM
, init
!= NULL_TREE
,
12047 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
12050 /* Top-level qualifiers on the parameters are
12051 ignored for function types. */
12052 type
= TYPE_MAIN_VARIANT (TREE_TYPE (decl
));
12054 if (TREE_CODE (type
) == VOID_TYPE
)
12055 decl
= void_type_node
;
12056 else if (TREE_CODE (type
) == METHOD_TYPE
)
12058 if (DECL_NAME (decl
))
12059 /* Cannot use the decl here because
12060 we don't have DECL_CONTEXT set up yet. */
12061 cp_error ("parameter `%D' invalidly declared method type",
12064 error ("parameter invalidly declared method type");
12065 type
= build_pointer_type (type
);
12066 TREE_TYPE (decl
) = type
;
12068 else if (TREE_CODE (type
) == OFFSET_TYPE
)
12070 if (DECL_NAME (decl
))
12071 cp_error ("parameter `%D' invalidly declared offset type",
12074 error ("parameter invalidly declared offset type");
12075 type
= build_pointer_type (type
);
12076 TREE_TYPE (decl
) = type
;
12078 else if (abstract_virtuals_error (decl
, type
))
12079 any_error
= 1; /* Seems like a good idea. */
12080 else if (POINTER_TYPE_P (type
))
12083 while (POINTER_TYPE_P (t
)
12084 || (TREE_CODE (t
) == ARRAY_TYPE
12085 && TYPE_DOMAIN (t
) != NULL_TREE
))
12087 if (TREE_CODE (t
) == ARRAY_TYPE
)
12088 cp_error ("parameter type `%T' includes %s to array of unknown bound",
12090 TYPE_PTR_P (type
) ? "pointer" : "reference");
12094 if (TREE_CODE (decl
) == VOID_TYPE
)
12096 if (result
== NULL_TREE
)
12098 result
= void_list_node
;
12099 last_result
= result
;
12103 TREE_CHAIN (last_result
) = void_list_node
;
12104 last_result
= void_list_node
;
12107 && (chain
!= void_list_node
|| TREE_CHAIN (chain
)))
12108 error ("`void' in parameter list must be entire list");
12112 /* Since there is a prototype, args are passed in their own types. */
12113 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
12114 if (PROMOTE_PROTOTYPES
12115 && (TREE_CODE (type
) == INTEGER_TYPE
12116 || TREE_CODE (type
) == ENUMERAL_TYPE
)
12117 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
12118 DECL_ARG_TYPE (decl
) = integer_type_node
;
12119 if (!any_error
&& init
)
12122 init
= check_default_argument (decl
, init
);
12127 if (decls
== NULL_TREE
)
12134 TREE_CHAIN (last_decl
) = decl
;
12137 list_node
= tree_cons (init
, type
, NULL_TREE
);
12138 if (result
== NULL_TREE
)
12140 result
= list_node
;
12141 last_result
= result
;
12145 TREE_CHAIN (last_result
) = list_node
;
12146 last_result
= list_node
;
12150 TREE_CHAIN (last_result
) = NULL_TREE
;
12151 /* If there are no parameters, and the function does not end
12152 with `...', then last_decl will be NULL_TREE. */
12153 if (last_decl
!= NULL_TREE
)
12154 TREE_CHAIN (last_decl
) = NULL_TREE
;
12158 last_function_parms
= decls
;
12163 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
12164 FUNCTION_TYPE with the newly parsed version of its default argument, which
12165 was previously digested as text. See snarf_defarg et al in lex.c. */
12168 replace_defarg (arg
, init
)
12171 if (! processing_template_decl
12172 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
12173 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
12174 TREE_TYPE (init
), TREE_VALUE (arg
));
12175 TREE_PURPOSE (arg
) = init
;
12178 /* D is a constructor or overloaded `operator='. Returns non-zero if
12179 D's arguments allow it to be a copy constructor, or copy assignment
12188 if (!DECL_FUNCTION_MEMBER_P (d
))
12191 t
= FUNCTION_ARG_CHAIN (d
);
12192 if (DECL_CONSTRUCTOR_P (d
) && DECL_HAS_IN_CHARGE_PARM_P (d
))
12193 t
= TREE_CHAIN (t
);
12194 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
12195 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
12196 == DECL_CONTEXT (d
))
12197 && (TREE_CHAIN (t
) == NULL_TREE
12198 || TREE_CHAIN (t
) == void_list_node
12199 || TREE_PURPOSE (TREE_CHAIN (t
))))
12204 /* These memoizing functions keep track of special properties which
12205 a class may have. `grok_ctor_properties' notices whether a class
12206 has a constructor of the form X(X&), and also complains
12207 if the class has a constructor of the form X(X).
12208 `grok_op_properties' takes notice of the various forms of
12209 operator= which are defined, as well as what sorts of type conversion
12210 may apply. Both functions take a FUNCTION_DECL as an argument. */
12213 grok_ctor_properties (ctype
, decl
)
12216 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
12217 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
12219 /* When a type has virtual baseclasses, a magical first int argument is
12220 added to any ctor so we can tell if the class has been initialized
12221 yet. This could screw things up in this function, so we deliberately
12222 ignore the leading int if we're in that situation. */
12223 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
12225 my_friendly_assert (parmtypes
12226 && TREE_VALUE (parmtypes
) == integer_type_node
,
12228 parmtypes
= TREE_CHAIN (parmtypes
);
12229 parmtype
= TREE_VALUE (parmtypes
);
12234 A non-template constructor for class X is a copy constructor if
12235 its first parameter is of type X&, const X&, volatile X& or const
12236 volatile X&, and either there are no other parameters or else all
12237 other parameters have default arguments. */
12238 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
12239 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
12240 && (TREE_CHAIN (parmtypes
) == NULL_TREE
12241 || TREE_CHAIN (parmtypes
) == void_list_node
12242 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
12243 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12244 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12246 TYPE_HAS_INIT_REF (ctype
) = 1;
12247 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12248 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
12252 A declaration of a constructor for a class X is ill-formed if its
12253 first parameter is of type (optionally cv-qualified) X and either
12254 there are no other parameters or else all other parameters have
12257 We *don't* complain about member template instantiations that
12258 have this form, though; they can occur as we try to decide what
12259 constructor to use during overload resolution. Since overload
12260 resolution will never prefer such a constructor to the
12261 non-template copy constructor (which is either explicitly or
12262 implicitly defined), there's no need to worry about their
12263 existence. Theoretically, they should never even be
12264 instantiated, but that's hard to forestall. */
12265 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
12266 && (TREE_CHAIN (parmtypes
) == NULL_TREE
12267 || TREE_CHAIN (parmtypes
) == void_list_node
12268 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
12269 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12270 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12272 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
12274 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
12277 else if (TREE_CODE (parmtype
) == VOID_TYPE
12278 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
12279 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
12284 /* An operator with this code is unary, but can also be binary. */
12288 enum tree_code code
;
12290 return (code
== INDIRECT_REF
12291 || code
== ADDR_EXPR
12292 || code
== CONVERT_EXPR
12293 || code
== NEGATE_EXPR
12294 || code
== PREINCREMENT_EXPR
12295 || code
== PREDECREMENT_EXPR
);
12298 /* An operator with this name can only be unary. */
12302 enum tree_code code
;
12304 return (code
== TRUTH_NOT_EXPR
12305 || code
== BIT_NOT_EXPR
12306 || code
== COMPONENT_REF
12307 || code
== TYPE_EXPR
);
12310 /* Do a little sanity-checking on how they declared their operator. */
12313 grok_op_properties (decl
, virtualp
, friendp
)
12315 int virtualp
, friendp
;
12317 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
12319 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
12320 tree name
= DECL_NAME (decl
);
12321 enum tree_code operator_code
;
12324 /* Count the number of arguments. */
12325 for (argtype
= argtypes
, arity
= 0;
12326 argtype
&& argtype
!= void_list_node
;
12327 argtype
= TREE_CHAIN (argtype
))
12330 if (current_class_type
== NULL_TREE
)
12333 if (DECL_CONV_FN_P (decl
))
12334 operator_code
= TYPE_EXPR
;
12338 #define DEF_OPERATOR(NAME, CODE, NEW_MANGLING, OLD_MANGING, ARITY, ASSN_P) \
12339 if (ansi_opname (CODE) == name) \
12341 operator_code = CODE; \
12344 else if (ansi_assopname (CODE) == name) \
12346 operator_code = CODE; \
12347 DECL_ASSIGNMENT_OPERATOR_P (decl) = 1; \
12351 #include "operators.def"
12352 #undef DEF_OPERATOR
12354 my_friendly_abort (20000527);
12357 my_friendly_assert (operator_code
!= LAST_CPLUS_TREE_CODE
, 20000526);
12358 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12362 switch (operator_code
)
12365 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
12369 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
12372 case COMPONENT_REF
:
12374 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
12378 TYPE_HAS_NEW_OPERATOR (current_class_type
) = 1;
12382 TYPE_GETS_DELETE (current_class_type
) |= 1;
12386 TYPE_HAS_ARRAY_NEW_OPERATOR (current_class_type
) = 1;
12389 case VEC_DELETE_EXPR
:
12390 TYPE_GETS_DELETE (current_class_type
) |= 2;
12398 if (operator_code
== NEW_EXPR
|| operator_code
== VEC_NEW_EXPR
)
12400 /* When the compiler encounters the definition of A::operator new, it
12401 doesn't look at the class declaration to find out if it's static. */
12403 revert_static_member_fn (decl
);
12405 /* Take care of function decl if we had syntax errors. */
12406 if (argtypes
== NULL_TREE
)
12408 = build_function_type (ptr_type_node
,
12409 hash_tree_chain (integer_type_node
,
12412 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
12414 else if (operator_code
== DELETE_EXPR
|| operator_code
== VEC_DELETE_EXPR
)
12417 revert_static_member_fn (decl
);
12419 if (argtypes
== NULL_TREE
)
12421 = build_function_type (void_type_node
,
12422 hash_tree_chain (ptr_type_node
,
12425 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
12429 /* An operator function must either be a non-static member function
12430 or have at least one parameter of a class, a reference to a class,
12431 an enumeration, or a reference to an enumeration. 13.4.0.6 */
12432 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
12434 if (operator_code
== TYPE_EXPR
12435 || operator_code
== CALL_EXPR
12436 || operator_code
== COMPONENT_REF
12437 || operator_code
== ARRAY_REF
12438 || operator_code
== NOP_EXPR
)
12439 cp_error ("`%D' must be a nonstatic member function", decl
);
12444 if (DECL_STATIC_FUNCTION_P (decl
))
12445 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
12448 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
12450 tree arg
= TREE_VALUE (p
);
12451 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
12452 arg
= TREE_TYPE (arg
);
12454 /* This lets bad template code slip through. */
12455 if (IS_AGGR_TYPE (arg
)
12456 || TREE_CODE (arg
) == ENUMERAL_TYPE
12457 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
12458 || TREE_CODE (arg
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
12462 ("`%D' must have an argument of class or enumerated type",
12469 if (operator_code
== CALL_EXPR
)
12470 return; /* No restrictions on args. */
12472 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
12474 tree t
= TREE_TYPE (name
);
12477 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
12478 const char *what
= 0;
12481 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
12483 if (TREE_CODE (t
) == VOID_TYPE
)
12485 else if (t
== current_class_type
)
12486 what
= "the same type";
12487 /* Don't force t to be complete here. */
12488 else if (IS_AGGR_TYPE (t
)
12489 && COMPLETE_TYPE_P (t
)
12490 && DERIVED_FROM_P (t
, current_class_type
))
12491 what
= "a base class";
12494 warning ("conversion to %s%s will never use a type conversion operator",
12495 ref
? "a reference to " : "", what
);
12499 if (DECL_ASSIGNMENT_OPERATOR_P (decl
)
12500 && operator_code
== NOP_EXPR
)
12504 if (arity
!= 2 && methodp
)
12506 cp_error ("`%D' must take exactly one argument", decl
);
12509 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
12513 A user-declared copy assignment operator X::operator= is
12514 a non-static non-template member function of class X with
12515 exactly one parameter of type X, X&, const X&, volatile
12516 X& or const volatile X&. */
12517 if (copy_assignment_arg_p (parmtype
, virtualp
)
12518 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12519 && is_member_template (DECL_TI_TEMPLATE (decl
)))
12522 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
12523 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
12524 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12525 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
12528 else if (operator_code
== COND_EXPR
)
12531 cp_error ("ISO C++ prohibits overloading operator ?:");
12533 else if (ambi_op_p (operator_code
))
12536 /* We pick the one-argument operator codes by default, so
12537 we don't have to change anything. */
12539 else if (arity
== 2)
12541 /* If we thought this was a unary operator, we now know
12542 it to be a binary operator. */
12543 switch (operator_code
)
12546 operator_code
= MULT_EXPR
;
12550 operator_code
= BIT_AND_EXPR
;
12554 operator_code
= PLUS_EXPR
;
12558 operator_code
= MINUS_EXPR
;
12561 case PREINCREMENT_EXPR
:
12562 operator_code
= POSTINCREMENT_EXPR
;
12565 case PREDECREMENT_EXPR
:
12566 operator_code
= POSTDECREMENT_EXPR
;
12570 my_friendly_abort (20000527);
12573 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12575 if ((operator_code
== POSTINCREMENT_EXPR
12576 || operator_code
== POSTDECREMENT_EXPR
)
12577 && ! processing_template_decl
12578 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
12581 cp_error ("postfix `%D' must take `int' as its argument",
12585 ("postfix `%D' must take `int' as its second argument",
12592 cp_error ("`%D' must take either zero or one argument", decl
);
12594 cp_error ("`%D' must take either one or two arguments", decl
);
12597 /* More Effective C++ rule 6. */
12599 && (operator_code
== POSTINCREMENT_EXPR
12600 || operator_code
== POSTDECREMENT_EXPR
12601 || operator_code
== PREINCREMENT_EXPR
12602 || operator_code
== PREDECREMENT_EXPR
))
12604 tree arg
= TREE_VALUE (argtypes
);
12605 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
12606 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
12607 arg
= TREE_TYPE (arg
);
12608 arg
= TYPE_MAIN_VARIANT (arg
);
12609 if (operator_code
== PREINCREMENT_EXPR
12610 || operator_code
== PREDECREMENT_EXPR
)
12612 if (TREE_CODE (ret
) != REFERENCE_TYPE
12613 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
12615 cp_warning ("prefix `%D' should return `%T'", decl
,
12616 build_reference_type (arg
));
12620 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
12621 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
12625 else if (unary_op_p (operator_code
))
12630 cp_error ("`%D' must take `void'", decl
);
12632 cp_error ("`%D' must take exactly one argument", decl
);
12635 else /* if (binary_op_p (operator_code)) */
12640 cp_error ("`%D' must take exactly one argument", decl
);
12642 cp_error ("`%D' must take exactly two arguments", decl
);
12645 /* More Effective C++ rule 7. */
12647 && (operator_code
== TRUTH_ANDIF_EXPR
12648 || operator_code
== TRUTH_ORIF_EXPR
12649 || operator_code
== COMPOUND_EXPR
))
12650 cp_warning ("user-defined `%D' always evaluates both arguments",
12654 /* Effective C++ rule 23. */
12657 && (operator_code
== PLUS_EXPR
12658 || operator_code
== MINUS_EXPR
12659 || operator_code
== TRUNC_DIV_EXPR
12660 || operator_code
== MULT_EXPR
)
12661 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
12662 cp_warning ("`%D' should return by value", decl
);
12665 for (; argtypes
&& argtypes
!= void_list_node
;
12666 argtypes
= TREE_CHAIN (argtypes
))
12667 if (TREE_PURPOSE (argtypes
))
12669 TREE_PURPOSE (argtypes
) = NULL_TREE
;
12670 if (operator_code
== POSTINCREMENT_EXPR
12671 || operator_code
== POSTDECREMENT_EXPR
)
12674 cp_pedwarn ("`%D' cannot have default arguments", decl
);
12677 cp_error ("`%D' cannot have default arguments", decl
);
12683 static const char *
12685 enum tag_types code
;
12698 my_friendly_abort (981122);
12702 /* Get the struct, enum or union (CODE says which) with tag NAME.
12703 Define the tag as a forward-reference if it is not defined.
12705 C++: If a class derivation is given, process it here, and report
12706 an error if multiple derivation declarations are not identical.
12708 If this is a definition, come in through xref_tag and only look in
12709 the current frame for the name (since C++ allows new names in any
12713 xref_tag (code_type_node
, name
, globalize
)
12714 tree code_type_node
;
12718 enum tag_types tag_code
;
12719 enum tree_code code
;
12720 register tree ref
, t
;
12721 struct binding_level
*b
= current_binding_level
;
12723 tree attributes
= NULL_TREE
;
12724 tree context
= NULL_TREE
;
12726 /* If we are called from the parser, code_type_node will sometimes be a
12727 TREE_LIST. This indicates that the user wrote
12728 "class __attribute__ ((foo)) bar". Extract the attributes so we can
12730 if (TREE_CODE (code_type_node
) == TREE_LIST
)
12732 attributes
= TREE_PURPOSE (code_type_node
);
12733 code_type_node
= TREE_VALUE (code_type_node
);
12736 tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12741 code
= RECORD_TYPE
;
12747 code
= ENUMERAL_TYPE
;
12750 my_friendly_abort (18);
12753 /* If a cross reference is requested, look up the type
12754 already defined for this tag and return it. */
12758 name
= TYPE_IDENTIFIER (t
);
12762 t
= IDENTIFIER_TYPE_VALUE (name
);
12764 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
12765 && TREE_CODE (t
) != BOUND_TEMPLATE_TEMPLATE_PARM
)
12770 /* If we know we are defining this tag, only look it up in
12771 this scope and don't try to find it as a type. */
12772 ref
= lookup_tag (code
, name
, b
, 1);
12778 /* [dcl.type.elab] If the identifier resolves to a
12779 typedef-name or a template type-parameter, the
12780 elaborated-type-specifier is ill-formed. */
12781 if (t
!= TYPE_MAIN_VARIANT (t
)
12782 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
12783 cp_pedwarn ("using typedef-name `%D' after `%s'",
12784 TYPE_NAME (t
), tag_name (tag_code
));
12785 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12786 cp_error ("using template type parameter `%T' after `%s'",
12787 t
, tag_name (tag_code
));
12792 ref
= lookup_tag (code
, name
, b
, 0);
12796 /* Try finding it as a type declaration. If that wins,
12798 ref
= lookup_name (name
, 1);
12800 if (ref
!= NULL_TREE
12801 && processing_template_decl
12802 && DECL_CLASS_TEMPLATE_P (ref
)
12803 && template_class_depth (current_class_type
) == 0)
12804 /* Since GLOBALIZE is true, we're declaring a global
12805 template, so we want this type. */
12806 ref
= DECL_TEMPLATE_RESULT (ref
);
12808 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12809 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12810 ref
= TREE_TYPE (ref
);
12815 if (ref
&& current_class_type
12816 && template_class_depth (current_class_type
)
12817 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12819 /* Since GLOBALIZE is non-zero, we are not looking at a
12820 definition of this tag. Since, in addition, we are currently
12821 processing a (member) template declaration of a template
12822 class, we must be very careful; consider:
12829 { template <class V>
12830 friend struct S1; };
12832 Here, the S2::S1 declaration should not be confused with the
12833 outer declaration. In particular, the inner version should
12834 have a template parameter of level 2, not level 1. This
12835 would be particularly important if the member declaration
12838 template <class V = U> friend struct S1;
12840 say, when we should tsubst into `U' when instantiating
12841 S2. On the other hand, when presented with:
12851 we must find the inner binding eventually. We
12852 accomplish this by making sure that the new type we
12853 create to represent this declaration has the right
12855 context
= TYPE_CONTEXT (ref
);
12862 /* If no such tag is yet defined, create a forward-reference node
12863 and record it as the "definition".
12864 When a real declaration of this type is found,
12865 the forward-reference will be altered into a real type. */
12866 if (code
== ENUMERAL_TYPE
)
12868 cp_error ("use of enum `%#D' without previous declaration", name
);
12870 ref
= make_node (ENUMERAL_TYPE
);
12872 /* Give the type a default layout like unsigned int
12873 to avoid crashing if it does not get defined. */
12874 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12875 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12876 TYPE_USER_ALIGN (ref
) = 0;
12877 TREE_UNSIGNED (ref
) = 1;
12878 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12879 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12880 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12882 /* Enable us to recognize when a type is created in class context.
12883 To do nested classes correctly, this should probably be cleared
12884 out when we leave this classes scope. Currently this in only
12885 done in `start_enum'. */
12887 pushtag (name
, ref
, globalize
);
12891 struct binding_level
*old_b
= class_binding_level
;
12893 ref
= make_aggr_type (code
);
12894 TYPE_CONTEXT (ref
) = context
;
12896 #ifdef NONNESTED_CLASSES
12897 /* Class types don't nest the way enums do. */
12898 class_binding_level
= (struct binding_level
*)0;
12900 pushtag (name
, ref
, globalize
);
12901 class_binding_level
= old_b
;
12906 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12907 redeclare_class_template (ref
, current_template_parms
);
12910 /* Until the type is defined, tentatively accept whatever
12911 structure tag the user hands us. */
12912 if (!COMPLETE_TYPE_P (ref
)
12913 && ref
!= current_class_type
12914 /* Have to check this, in case we have contradictory tag info. */
12915 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12917 if (tag_code
== class_type
)
12918 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12919 else if (tag_code
== record_type
)
12920 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12923 TREE_TYPE (ref
) = attributes
;
12929 xref_tag_from_type (old
, id
, globalize
)
12933 tree code_type_node
;
12935 if (TREE_CODE (old
) == RECORD_TYPE
)
12936 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12937 ? class_type_node
: record_type_node
);
12939 code_type_node
= union_type_node
;
12941 if (id
== NULL_TREE
)
12942 id
= TYPE_IDENTIFIER (old
);
12944 return xref_tag (code_type_node
, id
, globalize
);
12947 /* REF is a type (named NAME), for which we have just seen some
12948 baseclasses. BINFO is a list of those baseclasses; the
12949 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12950 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12951 struct, or union. */
12954 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12955 tree code_type_node
;
12959 /* In the declaration `A : X, Y, ... Z' we mark all the types
12960 (A, X, Y, ..., Z) so we can check for duplicates. */
12965 enum tag_types tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12967 if (tag_code
== union_type
)
12969 cp_error ("derived union `%T' invalid", ref
);
12973 len
= list_length (binfo
);
12975 /* First, make sure that any templates in base-classes are
12976 instantiated. This ensures that if we call ourselves recursively
12977 we do not get confused about which classes are marked and which
12979 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12980 complete_type (TREE_VALUE (base
));
12982 SET_CLASSTYPE_MARKED (ref
);
12983 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12985 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12987 /* The base of a derived struct is public by default. */
12989 = (TREE_PURPOSE (binfo
) == access_public_node
12990 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12991 || (tag_code
!= class_type
12992 && (TREE_PURPOSE (binfo
) == access_default_node
12993 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12995 = (TREE_PURPOSE (binfo
) == access_protected_node
12996 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12998 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12999 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
13000 || TREE_PURPOSE (binfo
) == access_public_virtual_node
13001 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
13002 tree basetype
= TREE_VALUE (binfo
);
13005 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
13006 basetype
= TREE_TYPE (basetype
);
13008 || (TREE_CODE (basetype
) != RECORD_TYPE
13009 && TREE_CODE (basetype
) != TYPENAME_TYPE
13010 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
13011 && TREE_CODE (basetype
) != BOUND_TEMPLATE_TEMPLATE_PARM
))
13013 cp_error ("base type `%T' fails to be a struct or class type",
13014 TREE_VALUE (binfo
));
13018 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
13020 /* This code replaces similar code in layout_basetypes.
13021 We put the complete_type first for implicit `typename'. */
13022 if (!COMPLETE_TYPE_P (basetype
)
13023 && ! (current_template_parms
&& uses_template_parms (basetype
)))
13025 cp_error ("base class `%T' has incomplete type", basetype
);
13030 if (CLASSTYPE_MARKED (basetype
))
13032 if (basetype
== ref
)
13033 cp_error ("recursive type `%T' undefined", basetype
);
13035 cp_error ("duplicate base type `%T' invalid", basetype
);
13039 if (TYPE_FOR_JAVA (basetype
)
13040 && (current_lang_stack
13041 == &VARRAY_TREE (current_lang_base
, 0)))
13042 TYPE_FOR_JAVA (ref
) = 1;
13044 /* Note that the BINFO records which describe individual
13045 inheritances are *not* shared in the lattice! They
13046 cannot be shared because a given baseclass may be
13047 inherited with different `accessibility' by different
13048 derived classes. (Each BINFO record describing an
13049 individual inheritance contains flags which say what
13050 the `accessibility' of that particular inheritance is.) */
13053 = make_binfo (size_zero_node
, basetype
,
13054 CLASS_TYPE_P (basetype
)
13055 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
13056 CLASS_TYPE_P (basetype
)
13057 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
13059 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
13060 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
13061 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
13062 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
13063 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
13065 /* We need to unshare the binfos now so that lookups during class
13066 definition work. */
13067 unshare_base_binfos (base_binfo
);
13069 SET_CLASSTYPE_MARKED (basetype
);
13071 /* We are free to modify these bits because they are meaningless
13072 at top level, and BASETYPE is a top-level type. */
13073 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
13075 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
13076 /* Converting to a virtual base class requires looking
13077 up the offset of the virtual base. */
13078 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
13081 if (CLASS_TYPE_P (basetype
))
13083 TYPE_HAS_NEW_OPERATOR (ref
)
13084 |= TYPE_HAS_NEW_OPERATOR (basetype
);
13085 TYPE_HAS_ARRAY_NEW_OPERATOR (ref
)
13086 |= TYPE_HAS_ARRAY_NEW_OPERATOR (basetype
);
13087 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
13088 /* If the base-class uses multiple inheritance, so do we. */
13089 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
13090 |= TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
13091 /* Likewise, if converting to a base of the base may require
13092 code, then we may need to generate code to convert to a
13094 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
)
13095 |= TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (basetype
);
13102 TREE_VEC_LENGTH (binfos
) = i
;
13104 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
13108 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
13109 /* If there is more than one non-empty they cannot be at the same
13111 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
13114 /* Unmark all the types. */
13116 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
13117 CLEAR_CLASSTYPE_MARKED (ref
);
13119 /* Now that we know all the base-classes, set up the list of virtual
13121 get_vbase_types (ref
);
13125 /* Begin compiling the definition of an enumeration type.
13126 NAME is its name (or null if anonymous).
13127 Returns the type object, as yet incomplete.
13128 Also records info about it so that build_enumerator
13129 may be used to declare the individual values as they are read. */
13135 register tree enumtype
= NULL_TREE
;
13136 struct binding_level
*b
= current_binding_level
;
13138 /* If this is the real definition for a previous forward reference,
13139 fill in the contents in the same object that used to be the
13140 forward reference. */
13142 if (name
!= NULL_TREE
)
13143 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
13145 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
13147 cp_error ("multiple definition of `%#T'", enumtype
);
13148 cp_error_at ("previous definition here", enumtype
);
13149 /* Clear out TYPE_VALUES, and start again. */
13150 TYPE_VALUES (enumtype
) = NULL_TREE
;
13154 enumtype
= make_node (ENUMERAL_TYPE
);
13155 pushtag (name
, enumtype
, 0);
13158 if (current_class_type
)
13159 TREE_ADDRESSABLE (b
->tags
) = 1;
13161 GNU_xref_decl (current_function_decl
, enumtype
);
13165 /* After processing and defining all the values of an enumeration type,
13166 install their decls in the enumeration type and finish it off.
13167 ENUMTYPE is the type object and VALUES a list of name-value pairs.
13168 Returns ENUMTYPE. */
13171 finish_enum (enumtype
)
13174 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
13175 /* Calculate the maximum value of any enumerator in this type. */
13177 tree values
= TYPE_VALUES (enumtype
);
13182 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
13187 /* The TREE_VALUE is a CONST_DECL for this enumeration
13189 decl
= TREE_VALUE (pair
);
13193 Following the closing brace of an enum-specifier, each
13194 enumerator has the type of its enumeration. Prior to the
13195 closing brace, the type of each enumerator is the type of
13196 its initializing value. */
13197 TREE_TYPE (decl
) = enumtype
;
13199 /* The DECL_INITIAL will be NULL if we are processing a
13200 template declaration and this enumeration constant had no
13201 explicit initializer. */
13202 value
= DECL_INITIAL (decl
);
13203 if (value
&& !processing_template_decl
)
13205 /* Set the TREE_TYPE for the VALUE as well. That's so
13206 that when we call decl_constant_value we get an
13207 entity of the right type (but with the constant
13208 value). Since we shouldn't ever call
13209 decl_constant_value on a template type, there's no
13210 reason to do that when processing_template_decl.
13211 And, if the expression is something like a
13212 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
13213 wreak havoc on the intended type of the expression.
13215 Of course, there's also no point in trying to compute
13216 minimum or maximum values if we're in a template. */
13217 TREE_TYPE (value
) = enumtype
;
13220 minnode
= maxnode
= value
;
13221 else if (tree_int_cst_lt (maxnode
, value
))
13223 else if (tree_int_cst_lt (value
, minnode
))
13227 if (processing_template_decl
)
13228 /* If this is just a template, leave the CONST_DECL
13229 alone. That way tsubst_copy will find CONST_DECLs for
13230 CONST_DECLs, and not INTEGER_CSTs. */
13233 /* In the list we're building up, we want the enumeration
13234 values, not the CONST_DECLs. */
13235 TREE_VALUE (pair
) = value
;
13239 maxnode
= minnode
= integer_zero_node
;
13241 TYPE_VALUES (enumtype
) = nreverse (values
);
13243 if (processing_template_decl
)
13245 tree scope
= current_scope ();
13246 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
13247 add_tree (build_min (TAG_DEFN
, enumtype
));
13251 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
13252 int lowprec
= min_precision (minnode
, unsignedp
);
13253 int highprec
= min_precision (maxnode
, unsignedp
);
13254 int precision
= MAX (lowprec
, highprec
);
13257 TYPE_SIZE (enumtype
) = NULL_TREE
;
13259 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
13261 TYPE_PRECISION (enumtype
) = precision
;
13263 fixup_unsigned_type (enumtype
);
13265 fixup_signed_type (enumtype
);
13267 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
13268 /* Use the width of the narrowest normal C type which is wide
13270 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
13273 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
13275 TYPE_SIZE (enumtype
) = 0;
13276 layout_type (enumtype
);
13278 /* Fix up all variant types of this enum type. */
13279 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
13280 tem
= TYPE_NEXT_VARIANT (tem
))
13282 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
13283 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
13284 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
13285 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
13286 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
13287 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
13288 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
13289 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
13290 TYPE_USER_ALIGN (tem
) = TYPE_USER_ALIGN (enumtype
);
13291 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
13294 /* Finish debugging output for this type. */
13295 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
13301 /* Build and install a CONST_DECL for an enumeration constant of the
13302 enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided.
13303 Assignment of sequential values by default is handled here. */
13306 build_enumerator (name
, value
, enumtype
)
13316 /* Remove no-op casts from the value. */
13318 STRIP_TYPE_NOPS (value
);
13320 if (! processing_template_decl
)
13322 /* Validate and default VALUE. */
13323 if (value
!= NULL_TREE
)
13325 value
= decl_constant_value (value
);
13327 if (TREE_CODE (value
) == INTEGER_CST
)
13329 value
= default_conversion (value
);
13330 constant_expression_warning (value
);
13334 cp_error ("enumerator value for `%D' not integer constant", name
);
13339 /* Default based on previous value. */
13340 if (value
== NULL_TREE
&& ! processing_template_decl
)
13344 if (TYPE_VALUES (enumtype
))
13346 /* The next value is the previous value ... */
13347 prev_value
= DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype
)));
13348 /* ... plus one. */
13349 value
= cp_build_binary_op (PLUS_EXPR
,
13353 if (tree_int_cst_lt (value
, prev_value
))
13354 cp_error ("overflow in enumeration values at `%D'", name
);
13357 value
= integer_zero_node
;
13360 /* Remove no-op casts from the value. */
13362 STRIP_TYPE_NOPS (value
);
13364 /* To fix MAX_VAL enum consts. (bkoz) */
13365 TREE_TYPE (value
) = integer_type_node
;
13369 /* We always have to copy here; not all INTEGER_CSTs are unshared.
13370 Even in other cases, we will later (in finish_enum) be setting
13371 the type of VALUE. But, we don't need to make a copy if this
13372 VALUE is one of the enumeration constants for this same
13373 enumeration type. */
13374 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
13375 if (TREE_VALUE (values
) == value
)
13377 /* If we didn't break out of the loop, then we do need a copy. */
13378 if (!values
&& value
)
13379 value
= copy_node (value
);
13381 /* C++ associates enums with global, function, or class declarations. */
13382 context
= current_scope ();
13384 /* Build the actual enumeration constant. Note that the enumeration
13385 constants have the type of their initializers until the
13386 enumeration is complete:
13390 Following the closing brace of an enum-specifier, each enumer-
13391 ator has the type of its enumeration. Prior to the closing
13392 brace, the type of each enumerator is the type of its
13393 initializing value.
13395 In finish_enum we will reset the type. Of course, if we're
13396 processing a template, there may be no value. */
13397 type
= value
? TREE_TYPE (value
) : NULL_TREE
;
13399 if (context
&& context
== current_class_type
)
13400 /* This enum declaration is local to the class. We need the full
13401 lang_decl so that we can record DECL_CLASS_CONTEXT, for example. */
13402 decl
= build_lang_decl (CONST_DECL
, name
, type
);
13404 /* It's a global enum, or it's local to a function. (Note local to
13405 a function could mean local to a class method. */
13406 decl
= build_decl (CONST_DECL
, name
, type
);
13408 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
13409 DECL_INITIAL (decl
) = value
;
13410 TREE_READONLY (decl
) = 1;
13412 if (context
&& context
== current_class_type
)
13413 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
13414 on the TYPE_FIELDS list for `S'. (That's so that you can say
13415 things like `S::i' later.) */
13416 finish_member_declaration (decl
);
13420 GNU_xref_decl (current_function_decl
, decl
);
13423 /* Add this enumeration constant to the list for this type. */
13424 TYPE_VALUES (enumtype
) = tree_cons (name
, decl
, TYPE_VALUES (enumtype
));
13428 /* We're defining DECL. Make sure that it's type is OK. */
13431 check_function_type (decl
)
13434 tree fntype
= TREE_TYPE (decl
);
13435 tree return_type
= complete_type (TREE_TYPE (fntype
));
13437 /* In a function definition, arg types must be complete. */
13438 require_complete_types_for_parms (current_function_parms
);
13440 if (!COMPLETE_OR_VOID_TYPE_P (return_type
))
13442 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
13444 /* Make it return void instead, but don't change the
13445 type of the DECL_RESULT, in case we have a named return value. */
13446 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13448 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
13450 = build_cplus_method_type (ctype
,
13452 FUNCTION_ARG_CHAIN (decl
));
13456 = build_function_type (void_type_node
,
13457 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
13459 = build_exception_variant (fntype
,
13460 TYPE_RAISES_EXCEPTIONS (fntype
));
13463 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
13466 /* Create the FUNCTION_DECL for a function definition.
13467 DECLSPECS and DECLARATOR are the parts of the declaration;
13468 they describe the function's name and the type it returns,
13469 but twisted together in a fashion that parallels the syntax of C.
13471 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
13472 DECLARATOR is really the DECL for the function we are about to
13473 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
13474 indicating that the function is an inline defined in-class, and
13475 SF_EXPAND indicating that we should generate RTL for this
13478 This function creates a binding context for the function body
13479 as well as setting up the FUNCTION_DECL in current_function_decl.
13481 Returns 1 on success. If the DECLARATOR is not suitable for a function
13482 (it defines a datum instead), we return 0, which tells
13483 yyparse to report a parse error.
13485 For C++, we must first check whether that datum makes any sense.
13486 For example, "class A local_a(1,2);" means that variable local_a
13487 is an aggregate of type A, which should have a constructor
13488 applied to it with the argument list [1, 2]. */
13491 start_function (declspecs
, declarator
, attrs
, flags
)
13492 tree declspecs
, declarator
, attrs
;
13496 tree ctype
= NULL_TREE
;
13499 extern int have_extern_spec
;
13500 extern int used_extern_spec
;
13501 int doing_friend
= 0;
13502 struct binding_level
*bl
;
13504 /* Sanity check. */
13505 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
13506 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
13508 /* This should only be done once on the top most decl. */
13509 if (have_extern_spec
&& !used_extern_spec
)
13511 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
13512 used_extern_spec
= 1;
13515 if (flags
& SF_PRE_PARSED
)
13517 decl1
= declarator
;
13519 fntype
= TREE_TYPE (decl1
);
13520 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13521 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13523 /* ISO C++ 11.4/5. A friend function defined in a class is in
13524 the (lexical) scope of the class in which it is defined. */
13525 if (!ctype
&& DECL_FRIEND_P (decl1
))
13527 ctype
= DECL_FRIEND_CONTEXT (decl1
);
13529 /* CTYPE could be null here if we're dealing with a template;
13530 for example, `inline friend float foo()' inside a template
13531 will have no CTYPE set. */
13532 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
13538 last_function_parms
= DECL_ARGUMENTS (decl1
);
13539 last_function_parm_tags
= NULL_TREE
;
13543 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
13544 /* If the declarator is not suitable for a function definition,
13545 cause a syntax error. */
13546 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
13548 fntype
= TREE_TYPE (decl1
);
13550 restype
= TREE_TYPE (fntype
);
13551 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
13553 cp_error ("semicolon missing after declaration of `%#T'", restype
);
13554 shadow_tag (build_tree_list (NULL_TREE
, restype
));
13555 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
13556 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
13557 fntype
= build_function_type (integer_type_node
,
13558 TYPE_ARG_TYPES (fntype
));
13560 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
13562 TYPE_ARG_TYPES (fntype
));
13563 TREE_TYPE (decl1
) = fntype
;
13566 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13567 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13568 else if (DECL_MAIN_P (decl1
))
13570 /* If this doesn't return integer_type, complain. */
13571 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
13573 if (pedantic
|| warn_return_type
)
13574 pedwarn ("return type for `main' changed to `int'");
13575 TREE_TYPE (decl1
) = fntype
= default_function_type
;
13580 /* Sometimes we don't notice that a function is a static member, and
13581 build a METHOD_TYPE for it. Fix that up now. */
13582 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
)
13583 && TREE_CODE (TREE_TYPE (decl1
)) == METHOD_TYPE
)
13585 revert_static_member_fn (decl1
);
13586 last_function_parms
= TREE_CHAIN (last_function_parms
);
13590 /* Warn if function was previously implicitly declared
13591 (but not if we warned then). */
13592 if (! warn_implicit
13593 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
13594 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
13596 /* Set up current_class_type, and enter the scope of the class, if
13599 push_nested_class (ctype
, 1);
13600 else if (DECL_STATIC_FUNCTION_P (decl1
))
13601 push_nested_class (DECL_CONTEXT (decl1
), 2);
13603 /* Now that we have entered the scope of the class, we must restore
13604 the bindings for any template parameters surrounding DECL1, if it
13605 is an inline member template. (Order is important; consider the
13606 case where a template parameter has the same name as a field of
13607 the class.) It is not until after this point that
13608 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
13609 if (flags
& SF_INCLASS_INLINE
)
13610 maybe_begin_member_template_processing (decl1
);
13612 /* Effective C++ rule 15. See also c_expand_return. */
13614 && DECL_OVERLOADED_OPERATOR_P (decl1
) == NOP_EXPR
13615 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
13616 cp_warning ("`operator=' should return a reference to `*this'");
13618 /* Make the init_value nonzero so pushdecl knows this is not tentative.
13619 error_mark_node is replaced below (in poplevel) with the BLOCK. */
13620 if (!DECL_INITIAL (decl1
))
13621 DECL_INITIAL (decl1
) = error_mark_node
;
13623 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
13624 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
13627 /* This function exists in static storage.
13628 (This does not mean `static' in the C sense!) */
13629 TREE_STATIC (decl1
) = 1;
13631 /* We must call push_template_decl after current_class_type is set
13632 up. (If we are processing inline definitions after exiting a
13633 class scope, current_class_type will be NULL_TREE until set above
13634 by push_nested_class.) */
13635 if (processing_template_decl
)
13636 decl1
= push_template_decl (decl1
);
13638 /* We are now in the scope of the function being defined. */
13639 current_function_decl
= decl1
;
13641 /* Save the parm names or decls from this function's declarator
13642 where store_parm_decls will find them. */
13643 current_function_parms
= last_function_parms
;
13644 current_function_parm_tags
= last_function_parm_tags
;
13646 /* Make sure the parameter and return types are reasonable. When
13647 you declare a function, these types can be incomplete, but they
13648 must be complete when you define the function. */
13649 if (! processing_template_decl
)
13650 check_function_type (decl1
);
13652 /* Build the return declaration for the function. */
13653 restype
= TREE_TYPE (fntype
);
13654 if (!processing_template_decl
)
13656 if (!DECL_RESULT (decl1
))
13658 DECL_RESULT (decl1
)
13659 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13660 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype
),
13661 DECL_RESULT (decl1
));
13665 /* Just use `void'. Nobody will ever look at this anyhow. */
13666 DECL_RESULT (decl1
) = build_decl (RESULT_DECL
, 0, void_type_node
);
13668 /* Initialize RTL machinery. We cannot do this until
13669 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
13670 even when processing a template; this is how we get
13671 CFUN set up, and our per-function variables initialized. */
13672 bl
= current_binding_level
;
13673 init_function_start (decl1
, input_filename
, lineno
);
13674 current_binding_level
= bl
;
13675 expanding_p
= (flags
& SF_EXPAND
) != 0;
13677 /* Even though we're inside a function body, we still don't want to
13678 call expand_expr to calculate the size of a variable-sized array.
13679 We haven't necessarily assigned RTL to all variables yet, so it's
13680 not safe to try to expand expressions involving them. */
13681 immediate_size_expand
= 0;
13682 cfun
->x_dont_save_pending_sizes_p
= 1;
13684 /* If we're building a statement-tree, start the tree now. */
13685 if (processing_template_decl
|| !expanding_p
)
13686 begin_stmt_tree (&DECL_SAVED_TREE (decl1
));
13688 /* Let the user know we're compiling this function. */
13689 announce_function (decl1
);
13691 /* Record the decl so that the function name is defined.
13692 If we already have a decl for this name, and it is a FUNCTION_DECL,
13693 use the old decl. */
13694 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
13696 /* A specialization is not used to guide overload resolution. */
13697 if (!DECL_TEMPLATE_SPECIALIZATION (decl1
)
13698 && ! DECL_FUNCTION_MEMBER_P (decl1
))
13699 decl1
= pushdecl (decl1
);
13702 /* We need to set the DECL_CONTEXT. */
13703 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
13704 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
13705 /* And make sure we have enough default args. */
13706 check_default_args (decl1
);
13708 fntype
= TREE_TYPE (decl1
);
13711 /* Reset these in case the call to pushdecl changed them. */
13712 current_function_decl
= decl1
;
13713 cfun
->decl
= decl1
;
13715 /* Initialize the per-function data. */
13716 if (!DECL_PENDING_INLINE_P (decl1
) && DECL_SAVED_FUNCTION_DATA (decl1
))
13718 /* If we already parsed this function, and we're just expanding it
13719 now, restore saved state. */
13720 struct binding_level
*bl
= current_binding_level
;
13721 *cp_function_chain
= *DECL_SAVED_FUNCTION_DATA (decl1
);
13722 current_binding_level
= bl
;
13724 /* This function is being processed in whole-function mode; we
13725 already did semantic analysis. */
13726 cfun
->x_whole_function_mode_p
= 1;
13728 /* If we decided that we didn't want to inline this function,
13729 make sure the back-end knows that. */
13730 if (!current_function_cannot_inline
)
13731 current_function_cannot_inline
= cp_function_chain
->cannot_inline
;
13733 /* We don't need the saved data anymore. */
13734 free (DECL_SAVED_FUNCTION_DATA (decl1
));
13735 DECL_SAVED_FUNCTION_DATA (decl1
) = NULL
;
13737 else if (ctype
&& !doing_friend
&& !DECL_STATIC_FUNCTION_P (decl1
))
13739 /* We know that this was set up by `grokclassfn'. We do not
13740 wait until `store_parm_decls', since evil parse errors may
13741 never get us to that point. Here we keep the consistency
13742 between `current_class_type' and `current_class_ptr'. */
13743 tree t
= DECL_ARGUMENTS (decl1
);
13745 my_friendly_assert (t
!= NULL_TREE
&& TREE_CODE (t
) == PARM_DECL
,
13747 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
13750 cp_function_chain
->x_current_class_ref
13751 = build_indirect_ref (t
, NULL_PTR
);
13752 cp_function_chain
->x_current_class_ptr
= t
;
13754 /* Constructors and destructors need to know whether they're "in
13755 charge" of initializing virtual base classes. */
13756 if (DECL_HAS_IN_CHARGE_PARM_P (decl1
))
13757 current_in_charge_parm
= TREE_CHAIN (t
);
13760 if (DECL_INTERFACE_KNOWN (decl1
))
13762 tree ctx
= decl_function_context (decl1
);
13764 if (DECL_NOT_REALLY_EXTERN (decl1
))
13765 DECL_EXTERNAL (decl1
) = 0;
13767 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
13768 && TREE_PUBLIC (ctx
))
13769 /* This is a function in a local class in an extern inline
13771 comdat_linkage (decl1
);
13773 /* If this function belongs to an interface, it is public.
13774 If it belongs to someone else's interface, it is also external.
13775 This only affects inlines and template instantiations. */
13776 else if (interface_unknown
== 0
13777 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13778 || flag_alt_external_templates
))
13780 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
13781 || processing_template_decl
)
13783 DECL_EXTERNAL (decl1
)
13785 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
13786 && !DECL_VINDEX (decl1
)));
13788 /* For WIN32 we also want to put these in linkonce sections. */
13789 maybe_make_one_only (decl1
);
13792 DECL_EXTERNAL (decl1
) = 0;
13793 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
13794 DECL_INTERFACE_KNOWN (decl1
) = 1;
13796 else if (interface_unknown
&& interface_only
13797 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13798 || flag_alt_external_templates
))
13800 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13801 interface, we will have interface_only set but not
13802 interface_known. In that case, we don't want to use the normal
13803 heuristics because someone will supply a #pragma implementation
13804 elsewhere, and deducing it here would produce a conflict. */
13805 comdat_linkage (decl1
);
13806 DECL_EXTERNAL (decl1
) = 0;
13807 DECL_INTERFACE_KNOWN (decl1
) = 1;
13808 DECL_DEFER_OUTPUT (decl1
) = 1;
13812 /* This is a definition, not a reference.
13813 So clear DECL_EXTERNAL. */
13814 DECL_EXTERNAL (decl1
) = 0;
13816 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
13817 && ! DECL_INTERFACE_KNOWN (decl1
)
13818 /* Don't try to defer nested functions for now. */
13819 && ! decl_function_context (decl1
))
13820 DECL_DEFER_OUTPUT (decl1
) = 1;
13822 DECL_INTERFACE_KNOWN (decl1
) = 1;
13825 if (doing_semantic_analysis_p ())
13828 current_binding_level
->parm_flag
= 1;
13832 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13834 if (!building_stmt_tree ())
13835 GNU_xref_function (decl1
, current_function_parms
);
13837 /* We need to do this even if we aren't expanding yet so that
13838 assemble_external works. */
13839 make_function_rtl (decl1
);
13841 /* Promote the value to int before returning it. */
13842 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13843 restype
= type_promotes_to (restype
);
13845 /* If this fcn was already referenced via a block-scope `extern' decl
13846 (or an implicit decl), propagate certain information about the usage. */
13847 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13848 TREE_ADDRESSABLE (decl1
) = 1;
13850 if (DECL_RESULT (decl1
) == NULL_TREE
)
13852 DECL_RESULT (decl1
)
13853 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13854 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13855 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13860 if (DECL_DESTRUCTOR_P (decl1
))
13862 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13863 DECL_CONTEXT (dtor_label
) = current_function_decl
;
13865 /* Under the old ABI we return `this' from constructors, so we make
13866 ordinary `return' statements in constructors jump to CTOR_LABEL;
13867 from there we return `this'. Under the new ABI, we don't bother
13868 with any of this. By not setting CTOR_LABEL the remainder of the
13869 machinery is automatically disabled. */
13870 else if (!flag_new_abi
&& DECL_CONSTRUCTOR_P (decl1
))
13872 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13873 DECL_CONTEXT (ctor_label
) = current_function_decl
;
13879 /* Called after store_parm_decls for a function-try-block. */
13882 expand_start_early_try_stmts ()
13884 expand_start_try_stmts ();
13887 /* Store the parameter declarations into the current function declaration.
13888 This is called after parsing the parameter declarations, before
13889 digesting the body of the function.
13891 Also install to binding contour return value identifier, if any. */
13894 store_parm_decls ()
13896 register tree fndecl
= current_function_decl
;
13897 register tree parm
;
13898 int parms_have_cleanups
= 0;
13899 tree cleanups
= NULL_TREE
;
13901 /* This is a list of types declared among parms in a prototype. */
13902 tree parmtags
= current_function_parm_tags
;
13904 /* This is a chain of any other decls that came in among the parm
13905 declarations. If a parm is declared with enum {foo, bar} x;
13906 then CONST_DECLs for foo and bar are put here. */
13907 tree nonparms
= NULL_TREE
;
13909 /* Create a binding level for the parms. */
13910 if (!building_stmt_tree ())
13911 expand_start_bindings (2);
13913 if (current_function_parms
)
13915 /* This case is when the function was defined with an ANSI prototype.
13916 The parms already have decls, so we need not do anything here
13917 except record them as in effect
13918 and complain if any redundant old-style parm decls were written. */
13920 tree specparms
= current_function_parms
;
13923 if (doing_semantic_analysis_p ())
13925 /* Must clear this because it might contain TYPE_DECLs declared
13927 storedecls (NULL_TREE
);
13929 /* If we're doing semantic analysis, then we'll call pushdecl
13930 for each of these. We must do them in reverse order so that
13931 they end in the correct forward order. */
13932 specparms
= nreverse (specparms
);
13935 for (parm
= specparms
; parm
; parm
= next
)
13937 next
= TREE_CHAIN (parm
);
13938 if (TREE_CODE (parm
) == PARM_DECL
)
13940 tree type
= TREE_TYPE (parm
);
13942 if (doing_semantic_analysis_p ())
13946 if (DECL_NAME (parm
) == NULL_TREE
13947 || TREE_CODE (parm
) != VOID_TYPE
)
13950 cp_error ("parameter `%D' declared void", parm
);
13952 cleanup
= (processing_template_decl
13954 : maybe_build_cleanup (parm
));
13957 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13959 else if (type
!= error_mark_node
13960 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
13961 parms_have_cleanups
= 1;
13965 /* If we find an enum constant or a type tag,
13966 put it aside for the moment. */
13967 TREE_CHAIN (parm
) = NULL_TREE
;
13968 nonparms
= chainon (nonparms
, parm
);
13972 if (doing_semantic_analysis_p ())
13974 /* Get the decls in their original chain order
13975 and record in the function. This is all and only the
13976 PARM_DECLs that were pushed into scope by the loop above. */
13977 DECL_ARGUMENTS (fndecl
) = getdecls ();
13978 storetags (chainon (parmtags
, gettags ()));
13982 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13984 /* Now store the final chain of decls for the arguments
13985 as the decl-chain of the current lexical scope.
13986 Put the enumerators in as well, at the front so that
13987 DECL_ARGUMENTS is not modified. */
13988 if (doing_semantic_analysis_p ())
13989 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13991 /* Initialize the RTL code for the function. */
13992 DECL_SAVED_INSNS (fndecl
) = 0;
13993 if (! building_stmt_tree ())
13994 expand_function_start (fndecl
, parms_have_cleanups
);
13996 current_function_parms_stored
= 1;
13998 /* If this function is `main', emit a call to `__main'
13999 to run global initializers, etc. */
14000 if (DECL_MAIN_P (fndecl
) && !building_stmt_tree ())
14001 expand_main_function ();
14003 /* Now that we have initialized the parms, we can start their
14004 cleanups. We cannot do this before, since expand_decl_cleanup
14005 should not be called before the parm can be used. */
14008 finish_decl_cleanup (TREE_PURPOSE (cleanups
),
14009 TREE_VALUE (cleanups
));
14010 cleanups
= TREE_CHAIN (cleanups
);
14013 /* Create a binding contour which can be used to catch
14014 cleanup-generated temporaries. Also, if the return value needs or
14015 has initialization, deal with that now. */
14016 if (parms_have_cleanups
)
14019 if (!building_stmt_tree ())
14020 expand_start_bindings (2);
14023 /* Do the starting of the exception specifications, if we have any. */
14024 if (flag_exceptions
&& !processing_template_decl
14025 && flag_enforce_eh_specs
14026 && building_stmt_tree ()
14027 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
14028 current_eh_spec_try_block
= expand_start_eh_spec ();
14032 /* We have finished doing semantic analysis on DECL, but have not yet
14033 generated RTL for its body. Save away our current state, so that
14034 when we want to generate RTL later we know what to do. */
14037 save_function_data (decl
)
14040 struct language_function
*f
;
14042 /* Save the language-specific per-function data so that we can
14043 get it back when we really expand this function. */
14044 my_friendly_assert (!DECL_PENDING_INLINE_P (decl
),
14048 f
= ((struct language_function
*)
14049 xmalloc (sizeof (struct language_function
)));
14050 bcopy ((char *) cp_function_chain
, (char *) f
,
14051 sizeof (struct language_function
));
14052 DECL_SAVED_FUNCTION_DATA (decl
) = f
;
14054 /* Clear out the bits we don't need. */
14055 f
->x_stmt_tree
.x_last_stmt
= NULL_TREE
;
14056 f
->x_stmt_tree
.x_last_expr_type
= NULL_TREE
;
14057 f
->x_result_rtx
= NULL_RTX
;
14058 f
->x_named_label_uses
= NULL
;
14059 f
->bindings
= NULL
;
14061 /* When we get back here again, we will be expanding. */
14062 f
->x_expanding_p
= 1;
14064 /* If we've already decided that we cannot inline this function, we
14065 must remember that fact when we actually go to expand the
14067 f
->cannot_inline
= current_function_cannot_inline
;
14070 /* At the end of every constructor we generate to code to return
14071 `this'. Do that now. */
14074 finish_constructor_body ()
14076 /* Any return from a constructor will end up here. */
14078 add_tree (build_stmt (LABEL_STMT
, ctor_label
));
14080 /* Clear CTOR_LABEL so that finish_return_stmt knows to really
14081 generate the return, rather than a goto to CTOR_LABEL. */
14082 ctor_label
= NULL_TREE
;
14083 /* In check_return_expr we translate an empty return from a
14084 constructor to a return of `this'. */
14085 finish_return_stmt (NULL_TREE
);
14086 /* Mark the end of the constructor. */
14087 add_tree (build_stmt (CTOR_STMT
));
14090 /* At the end of every destructor we generate code to restore virtual
14091 function tables to the values desired by base classes and to call
14092 to base class destructors. Do that now. */
14095 finish_destructor_body ()
14097 tree compound_stmt
;
14102 /* Create a block to contain all the extra code. */
14103 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
14105 /* Any return from a destructor will end up here. */
14106 add_tree (build_stmt (LABEL_STMT
, dtor_label
));
14108 /* Generate the code to call destructor on base class. If this
14109 destructor belongs to a class with virtual functions, then set
14110 the virtual function table pointer to represent the type of our
14113 /* This side-effect makes call to `build_delete' generate the code
14114 we have to have at the end of this destructor. `build_delete'
14115 will set the flag again. */
14116 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
14118 exprstmt
= build_delete (current_class_type
,
14120 sfk_base_destructor
,
14121 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
,
14124 if (exprstmt
!= error_mark_node
14125 && (TREE_CODE (exprstmt
) != NOP_EXPR
14126 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
14127 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
14129 if (exprstmt
!= void_zero_node
)
14130 /* Don't call `expand_expr_stmt' if we're not going to do
14131 anything, since -Wall will give a diagnostic. */
14132 finish_expr_stmt (exprstmt
);
14134 /* Run destructors for all virtual baseclasses. */
14135 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
14140 if_stmt
= begin_if_stmt ();
14141 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
14142 current_in_charge_parm
,
14146 vbases
= CLASSTYPE_VBASECLASSES (current_class_type
);
14147 /* The CLASSTYPE_VBASECLASSES list is in initialization
14148 order, so we have to march through it in reverse order. */
14149 for (vbases
= nreverse (copy_list (vbases
));
14151 vbases
= TREE_CHAIN (vbases
))
14153 tree vbase
= TREE_VALUE (vbases
);
14155 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (vbase
)))
14157 tree vb
= get_vbase
14158 (BINFO_TYPE (vbase
),
14159 TYPE_BINFO (current_class_type
));
14161 (build_scoped_method_call
14162 (current_class_ref
, vb
, base_dtor_identifier
,
14167 finish_then_clause (if_stmt
);
14172 virtual_size
= c_sizeof (current_class_type
);
14174 /* At the end, call delete if that's what's requested. */
14176 /* FDIS sez: At the point of definition of a virtual destructor
14177 (including an implicit definition), non-placement operator delete
14178 shall be looked up in the scope of the destructor's class and if
14179 found shall be accessible and unambiguous.
14181 This is somewhat unclear, but I take it to mean that if the class
14182 only defines placement deletes we don't do anything here. So we
14183 pass LOOKUP_SPECULATIVELY; delete_sanity will complain for us if
14184 they ever try to delete one of these. */
14185 exprstmt
= build_op_delete_call
14186 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
14187 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
14189 if_stmt
= begin_if_stmt ();
14190 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
14191 current_in_charge_parm
,
14194 finish_expr_stmt (exprstmt
);
14195 finish_then_clause (if_stmt
);
14198 /* Close the block we started above. */
14199 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
14202 /* Finish up a function declaration and compile that function
14203 all the way to assembler language output. The free the storage
14204 for the function definition.
14206 FLAGS is a bitwise or of the following values:
14208 An extra call to poplevel (and expand_end_bindings) must be
14209 made to take care of the binding contour for the base
14210 initializers. This is only relevant for constructors.
14212 We just finished processing the body of an in-class inline
14213 function definition. (This processing will have taken place
14214 after the class definition is complete.) */
14217 finish_function (flags
)
14220 register tree fndecl
= current_function_decl
;
14221 tree fntype
, ctype
= NULL_TREE
;
14222 /* Label to use if this function is supposed to return a value. */
14223 tree no_return_label
= NULL_TREE
;
14224 int call_poplevel
= (flags
& 1) != 0;
14225 int inclass_inline
= (flags
& 2) != 0;
14228 int current_line
= lineno
;
14230 /* When we get some parse errors, we can end up without a
14231 current_function_decl, so cope. */
14232 if (fndecl
== NULL_TREE
)
14233 return error_mark_node
;
14235 nested
= function_depth
> 1;
14236 fntype
= TREE_TYPE (fndecl
);
14238 /* TREE_READONLY (fndecl) = 1;
14239 This caused &foo to be of type ptr-to-const-function
14240 which then got a warning when stored in a ptr-to-function variable. */
14242 /* This happens on strange parse errors. */
14243 if (! current_function_parms_stored
)
14246 store_parm_decls ();
14249 /* For a cloned function, we've already got all the code we need;
14250 there's no need to add any extra bits. */
14251 if (building_stmt_tree () && DECL_CLONED_FUNCTION_P (fndecl
))
14253 else if (building_stmt_tree ())
14255 if (DECL_CONSTRUCTOR_P (fndecl
))
14257 finish_constructor_body ();
14261 else if (DECL_DESTRUCTOR_P (fndecl
) && !processing_template_decl
)
14262 finish_destructor_body ();
14263 else if (DECL_MAIN_P (fndecl
))
14265 /* Make it so that `main' always returns 0 by default. */
14267 finish_return_stmt (integer_one_node
);
14269 finish_return_stmt (integer_zero_node
);
14273 /* Finish dealing with exception specifiers. */
14274 if (flag_exceptions
&& !processing_template_decl
14275 && flag_enforce_eh_specs
14276 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
14277 expand_end_eh_spec (TYPE_RAISES_EXCEPTIONS
14278 (TREE_TYPE (current_function_decl
)),
14279 current_eh_spec_try_block
);
14284 if (write_symbols
!= NO_DEBUG
/*&& TREE_CODE (fntype) != METHOD_TYPE*/)
14286 /* Keep this code around in case we later want to control debug info
14287 based on whether a type is "used". (jason 1999-11-11) */
14289 tree ttype
= target_type (fntype
);
14292 if (IS_AGGR_TYPE (ttype
))
14293 /* Let debugger know it should output info for this type. */
14294 note_debug_info_needed (ttype
);
14296 for (parmdecl
= DECL_ARGUMENTS (fndecl
); parmdecl
; parmdecl
= TREE_CHAIN (parmdecl
))
14298 ttype
= target_type (TREE_TYPE (parmdecl
));
14299 if (IS_AGGR_TYPE (ttype
))
14300 /* Let debugger know it should output info for this type. */
14301 note_debug_info_needed (ttype
);
14306 /* Clean house because we will need to reorder insns here. */
14307 do_pending_stack_adjust ();
14311 else if (DECL_CONSTRUCTOR_P (fndecl
))
14316 else if (return_label
!= NULL_RTX
14317 && flag_this_is_variable
<= 0
14318 && current_function_return_value
== NULL_TREE
14319 && ! DECL_NAME (DECL_RESULT (current_function_decl
)))
14320 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
14322 if (flag_exceptions
)
14323 expand_exception_blocks ();
14325 /* If this function is supposed to return a value, ensure that
14326 we do not fall into the cleanups by mistake. The end of our
14327 function will look like this:
14329 user code (may have return stmt somewhere)
14330 goto no_return_label
14335 NOTE_INSN_FUNCTION_END
14339 If the user omits a return stmt in the USER CODE section, we
14340 will have a control path which reaches NOTE_INSN_FUNCTION_END.
14341 Otherwise, we won't. */
14342 if (no_return_label
)
14344 DECL_CONTEXT (no_return_label
) = fndecl
;
14345 DECL_INITIAL (no_return_label
) = error_mark_node
;
14346 DECL_SOURCE_FILE (no_return_label
) = input_filename
;
14347 DECL_SOURCE_LINE (no_return_label
) = current_line
;
14348 expand_goto (no_return_label
);
14353 /* Remove the binding contour which is used
14354 to catch cleanup-generated temporaries. */
14355 expand_end_bindings (0, 0, 0);
14356 poplevel (0, 0, 0);
14358 /* Emit label at beginning of cleanup code for parameters. */
14359 emit_label (cleanup_label
);
14362 /* Get return value into register if that's where it's supposed
14364 if (original_result_rtx
)
14365 fixup_result_decl (DECL_RESULT (fndecl
), original_result_rtx
);
14367 /* Finish building code that will trigger warnings if users forget
14368 to make their functions return values. */
14369 if (no_return_label
|| cleanup_label
)
14370 emit_jump (return_label
);
14371 if (no_return_label
)
14373 /* We don't need to call `expand_*_return' here because we
14374 don't need any cleanups here--this path of code is only
14375 for error checking purposes. */
14376 expand_label (no_return_label
);
14379 /* We hard-wired immediate_size_expand to zero in
14380 start_function. Expand_function_end will decrement this
14381 variable. So, we set the variable to one here, so that after
14382 the decrement it will remain zero. */
14383 immediate_size_expand
= 1;
14385 /* Generate rtl for function exit. */
14386 expand_function_end (input_filename
, current_line
, 1);
14389 /* We have to save this value here in case
14390 maybe_end_member_template_processing decides to pop all the
14391 template parameters. */
14392 expand_p
= !building_stmt_tree ();
14394 /* If we're saving up tree structure, tie off the function now. */
14396 finish_stmt_tree (&DECL_SAVED_TREE (fndecl
));
14398 /* This must come after expand_function_end because cleanups might
14399 have declarations (from inline functions) that need to go into
14400 this function's blocks. */
14401 if (doing_semantic_analysis_p ())
14403 if (current_binding_level
->parm_flag
!= 1)
14404 my_friendly_abort (122);
14405 poplevel (1, 0, 1);
14408 /* Remember that we were in class scope. */
14409 if (current_class_name
)
14410 ctype
= current_class_type
;
14412 /* Must mark the RESULT_DECL as being in this function. */
14413 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
14415 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
14416 to the FUNCTION_DECL node itself. */
14417 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
14419 /* Save away current state, if appropriate. */
14420 if (!expanding_p
&& !processing_template_decl
)
14421 save_function_data (fndecl
);
14423 /* If this function calls `setjmp' it cannot be inlined. When
14424 `longjmp' is called it is not guaranteed to restore the value of
14425 local variables that have been modified since the call to
14426 `setjmp'. So, if were to inline this function into some caller
14427 `c', then when we `longjmp', we might not restore all variables
14428 in `c'. (It might seem, at first blush, that there's no way for
14429 this function to modify local variables in `c', but their
14430 addresses may have been stored somewhere accessible to this
14432 if (!expanding_p
&& !processing_template_decl
&& calls_setjmp_p (fndecl
))
14433 DECL_UNINLINABLE (fndecl
) = 1;
14440 /* So we can tell if jump_optimize sets it to 1. */
14443 /* Before we call rest_of_compilation (which will pop the
14444 CURRENT_FUNCTION), we must save these values. */
14445 returns_null
= current_function_returns_null
;
14446 returns_value
= current_function_returns_value
;
14448 /* If this is a nested function (like a template instantiation
14449 that we're compiling in the midst of compiling something
14450 else), push a new GC context. That will keep local variables
14451 on the stack from being collected while we're doing the
14452 compilation of this function. */
14453 if (function_depth
> 1)
14454 ggc_push_context ();
14456 /* Run the optimizers and output the assembler code for this
14458 rest_of_compilation (fndecl
);
14460 /* Undo the call to ggc_push_context above. */
14461 if (function_depth
> 1)
14462 ggc_pop_context ();
14464 if (DECL_SAVED_INSNS (fndecl
) && ! TREE_ASM_WRITTEN (fndecl
))
14466 /* Set DECL_EXTERNAL so that assemble_external will be called as
14467 necessary. We'll clear it again in finish_file. */
14468 if (! DECL_EXTERNAL (fndecl
))
14469 DECL_NOT_REALLY_EXTERN (fndecl
) = 1;
14470 DECL_EXTERNAL (fndecl
) = 1;
14475 /* Keep this code around in case we later want to control debug info
14476 based on whether a type is "used". (jason 1999-11-11) */
14478 if (ctype
&& TREE_ASM_WRITTEN (fndecl
))
14479 note_debug_info_needed (ctype
);
14482 /* If this function is marked with the constructor attribute,
14483 add it to the list of functions to be called along with
14484 constructors from static duration objects. */
14485 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
14486 static_ctors
= tree_cons (NULL_TREE
, fndecl
, static_ctors
);
14488 /* If this function is marked with the destructor attribute,
14489 add it to the list of functions to be called along with
14490 destructors from static duration objects. */
14491 if (DECL_STATIC_DESTRUCTOR (fndecl
))
14492 static_dtors
= tree_cons (NULL_TREE
, fndecl
, static_dtors
);
14494 if (DECL_NAME (DECL_RESULT (fndecl
)))
14495 returns_value
|= can_reach_end
;
14497 returns_null
|= can_reach_end
;
14499 if (TREE_THIS_VOLATILE (fndecl
) && returns_null
)
14500 warning ("`noreturn' function does return");
14501 else if (returns_null
14502 && TREE_CODE (TREE_TYPE (fntype
)) != VOID_TYPE
)
14504 /* Always complain if there's just no return statement. */
14505 if (!returns_value
)
14506 warning ("no return statement in function returning non-void");
14507 else if (warn_return_type
|| pedantic
)
14508 /* If this function returns non-void and control can drop through,
14510 warning ("control reaches end of non-void function");
14515 /* Clear out memory we no longer need. */
14516 free_after_parsing (cfun
);
14517 /* Since we never call rest_of_compilation, we never clear
14518 CFUN. Do so explicitly. */
14519 free_after_compilation (cfun
);
14523 /* If this is a in-class inline definition, we may have to pop the
14524 bindings for the template parameters that we added in
14525 maybe_begin_member_template_processing when start_function was
14527 if (inclass_inline
)
14528 maybe_end_member_template_processing ();
14530 /* Leave the scope of the class. */
14532 pop_nested_class ();
14536 if (!DECL_SAVED_INSNS (fndecl
) && !DECL_SAVED_FUNCTION_DATA (fndecl
)
14537 && !(flag_inline_trees
&& DECL_INLINE (fndecl
)))
14541 /* Stop pointing to the local nodes about to be freed. */
14542 /* But DECL_INITIAL must remain nonzero so we know this
14543 was an actual function definition. */
14544 DECL_INITIAL (fndecl
) = error_mark_node
;
14545 for (t
= DECL_ARGUMENTS (fndecl
); t
; t
= TREE_CHAIN (t
))
14546 DECL_RTL (t
) = DECL_INCOMING_RTL (t
) = NULL_RTX
;
14552 /* Let the error reporting routines know that we're outside a
14553 function. For a nested function, this value is used in
14554 pop_cp_function_context and then reset via pop_function_context. */
14555 current_function_decl
= NULL_TREE
;
14556 /* We don't really care about obstacks, but the middle-end
14557 sometimes cares on what obstck things are located. */
14558 permanent_allocation (1);
14564 /* Create the FUNCTION_DECL for a function definition.
14565 DECLSPECS and DECLARATOR are the parts of the declaration;
14566 they describe the return type and the name of the function,
14567 but twisted together in a fashion that parallels the syntax of C.
14569 This function creates a binding context for the function body
14570 as well as setting up the FUNCTION_DECL in current_function_decl.
14572 Returns a FUNCTION_DECL on success.
14574 If the DECLARATOR is not suitable for a function (it defines a datum
14575 instead), we return 0, which tells yyparse to report a parse error.
14577 May return void_type_node indicating that this method is actually
14578 a friend. See grokfield for more details.
14580 Came here with a `.pushlevel' .
14582 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14583 CHANGES TO CODE IN `grokfield'. */
14586 start_method (declspecs
, declarator
, attrlist
)
14587 tree declarator
, declspecs
, attrlist
;
14589 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
14592 /* Something too ugly to handle. */
14593 if (fndecl
== NULL_TREE
)
14596 /* Pass friends other than inline friend functions back. */
14597 if (fndecl
== void_type_node
)
14600 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
14601 /* Not a function, tell parser to report parse error. */
14604 if (DECL_IN_AGGR_P (fndecl
))
14606 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
14608 if (DECL_CONTEXT (fndecl
)
14609 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
14610 cp_error ("`%D' is already defined in class `%T'", fndecl
,
14611 DECL_CONTEXT (fndecl
));
14613 return void_type_node
;
14616 check_template_shadow (fndecl
);
14618 DECL_THIS_INLINE (fndecl
) = 1;
14620 if (flag_default_inline
)
14621 DECL_INLINE (fndecl
) = 1;
14623 /* We process method specializations in finish_struct_1. */
14624 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
14625 fndecl
= push_template_decl (fndecl
);
14627 if (! DECL_FRIEND_P (fndecl
))
14629 if (TREE_CHAIN (fndecl
))
14631 fndecl
= copy_node (fndecl
);
14632 TREE_CHAIN (fndecl
) = NULL_TREE
;
14635 if (DECL_CONSTRUCTOR_P (fndecl
))
14637 if (! grok_ctor_properties (current_class_type
, fndecl
))
14638 return void_type_node
;
14640 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
14641 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
14644 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0);
14646 /* Make a place for the parms */
14648 current_binding_level
->parm_flag
= 1;
14650 DECL_IN_AGGR_P (fndecl
) = 1;
14654 /* Go through the motions of finishing a function definition.
14655 We don't compile this method until after the whole class has
14658 FINISH_METHOD must return something that looks as though it
14659 came from GROKFIELD (since we are defining a method, after all).
14661 This is called after parsing the body of the function definition.
14662 STMTS is the chain of statements that makes up the function body.
14664 DECL is the ..._DECL that `start_method' provided. */
14667 finish_method (decl
)
14670 register tree fndecl
= decl
;
14673 register tree link
;
14675 if (decl
== void_type_node
)
14678 old_initial
= DECL_INITIAL (fndecl
);
14680 /* Undo the level for the parms (from start_method).
14681 This is like poplevel, but it causes nothing to be
14682 saved. Saving information here confuses symbol-table
14683 output routines. Besides, this information will
14684 be correctly output when this method is actually
14687 /* Clear out the meanings of the local variables of this level;
14688 also record in each decl which block it belongs to. */
14690 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
14692 if (DECL_NAME (link
) != NULL_TREE
)
14693 pop_binding (DECL_NAME (link
), link
);
14694 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
14695 DECL_CONTEXT (link
) = NULL_TREE
;
14698 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
14699 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
14700 current_binding_level
->parm_flag
,
14701 current_binding_level
->keep
);
14703 poplevel (0, 0, 0);
14705 DECL_INITIAL (fndecl
) = old_initial
;
14707 /* We used to check if the context of FNDECL was different from
14708 current_class_type as another way to get inside here. This didn't work
14709 for String.cc in libg++. */
14710 if (DECL_FRIEND_P (fndecl
))
14712 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
14713 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
14714 decl
= void_type_node
;
14720 /* Called when a new struct TYPE is defined.
14721 If this structure or union completes the type of any previous
14722 variable declaration, lay it out and output its rtl. */
14725 hack_incomplete_structures (type
)
14729 struct binding_level
*level
;
14731 if (!type
) /* Don't do this for class templates. */
14734 if (namespace_bindings_p ())
14737 list
= &namespace_scope_incomplete
;
14741 level
= innermost_nonclass_level ();
14742 list
= &level
->incomplete
;
14749 tree decl
= TREE_VALUE (*list
);
14750 if ((decl
&& TREE_TYPE (decl
) == type
)
14751 || (TREE_TYPE (decl
)
14752 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14753 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
14755 int toplevel
= toplevel_bindings_p ();
14756 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14757 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
14758 layout_type (TREE_TYPE (decl
));
14759 layout_decl (decl
, 0);
14760 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
14764 expand_decl (decl
);
14765 cleanup
= maybe_build_cleanup (decl
);
14766 expand_decl_init (decl
);
14767 if (! expand_decl_cleanup (decl
, cleanup
))
14768 cp_error ("parser lost in parsing declaration of `%D'",
14771 *list
= TREE_CHAIN (*list
);
14774 list
= &TREE_CHAIN (*list
);
14777 /* Keep looking through artificial binding levels generated
14778 for local variables. */
14779 if (level
&& level
->keep
== 2)
14781 level
= level
->level_chain
;
14782 list
= &level
->incomplete
;
14789 /* If DECL is of a type which needs a cleanup, build that cleanup
14793 maybe_build_cleanup (decl
)
14796 tree type
= TREE_TYPE (decl
);
14798 if (type
!= error_mark_node
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
14800 int flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14803 if (TREE_CODE (type
) == ARRAY_TYPE
)
14807 mark_addressable (decl
);
14808 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14811 /* Optimize for space over speed here. */
14812 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14813 || flag_expensive_optimizations
)
14814 flags
|= LOOKUP_NONVIRTUAL
;
14816 rval
= build_delete (TREE_TYPE (rval
), rval
,
14817 sfk_complete_destructor
, flags
, 0);
14819 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14820 && ! TYPE_HAS_DESTRUCTOR (type
))
14821 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14822 build_tree_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14829 /* Expand a C++ expression at the statement level.
14830 This is needed to ferret out nodes which have UNKNOWN_TYPE.
14831 The C++ type checker should get all of these out when
14832 expressions are combined with other, type-providing, expressions,
14833 leaving only orphan expressions, such as:
14835 &class::bar; / / takes its address, but does nothing with it. */
14838 cplus_expand_expr_stmt (exp
)
14842 /* We should do this eventually, but right now this causes regex.o from
14843 libg++ to miscompile, and tString to core dump. */
14844 exp
= build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (exp
), exp
);
14847 /* If we don't do this, we end up down inside expand_expr
14848 trying to do TYPE_MODE on the ERROR_MARK, and really
14849 go outside the bounds of the type. */
14850 if (exp
!= error_mark_node
)
14851 expand_expr_stmt (exp
);
14854 /* When a stmt has been parsed, this function is called. */
14859 /* Always assume this statement was not an expression statement. If
14860 it actually was an expression statement, its our callers
14861 responsibility to fix this up. */
14862 last_expr_type
= NULL_TREE
;
14865 /* DECL was originally constructed as a non-static member function,
14866 but turned out to be static. Update it accordingly. */
14869 revert_static_member_fn (decl
)
14873 tree function
= TREE_TYPE (decl
);
14874 tree args
= TYPE_ARG_TYPES (function
);
14876 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14877 != TYPE_UNQUALIFIED
)
14878 cp_error ("static member function `%#D' declared with type qualifiers",
14881 args
= TREE_CHAIN (args
);
14882 tmp
= build_function_type (TREE_TYPE (function
), args
);
14883 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14884 tmp
= build_exception_variant (tmp
,
14885 TYPE_RAISES_EXCEPTIONS (function
));
14886 TREE_TYPE (decl
) = tmp
;
14887 if (DECL_ARGUMENTS (decl
))
14888 DECL_ARGUMENTS (decl
) = TREE_CHAIN (DECL_ARGUMENTS (decl
));
14889 DECL_STATIC_FUNCTION_P (decl
) = 1;
14892 /* Initialize the variables used during compilation of a C++
14896 push_cp_function_context (f
)
14897 struct function
*f
;
14899 struct language_function
*p
14900 = ((struct language_function
*)
14901 xcalloc (1, sizeof (struct language_function
)));
14904 /* It takes an explicit call to expand_body to generate RTL for a
14908 /* Whenever we start a new function, we destroy temporaries in the
14910 current_stmt_tree
->stmts_are_full_exprs_p
= 1;
14913 /* Free the language-specific parts of F, now that we've finished
14914 compiling the function. */
14917 pop_cp_function_context (f
)
14918 struct function
*f
;
14921 free (f
->language
);
14925 /* Mark P for GC. */
14928 mark_lang_function (p
)
14929 struct language_function
*p
;
14934 ggc_mark_tree (p
->x_ctor_label
);
14935 ggc_mark_tree (p
->x_dtor_label
);
14936 ggc_mark_tree (p
->x_current_class_ptr
);
14937 ggc_mark_tree (p
->x_current_class_ref
);
14938 ggc_mark_tree (p
->x_eh_spec_try_block
);
14939 ggc_mark_tree (p
->x_scope_stmt_stack
);
14941 ggc_mark_rtx (p
->x_result_rtx
);
14943 mark_named_label_lists (&p
->x_named_labels
, &p
->x_named_label_uses
);
14944 mark_stmt_tree (&p
->x_stmt_tree
);
14945 mark_binding_level (&p
->bindings
);
14948 /* Mark the language-specific data in F for GC. */
14951 mark_cp_function_context (f
)
14952 struct function
*f
;
14954 mark_lang_function (f
->language
);
14958 lang_mark_false_label_stack (l
)
14959 struct label_node
*l
;
14961 /* C++ doesn't use false_label_stack. It better be NULL. */
14962 my_friendly_assert (l
== NULL
, 19990904);
14969 enum tree_code code
= TREE_CODE (t
);
14970 if (code
== IDENTIFIER_NODE
)
14972 struct lang_identifier
*li
= (struct lang_identifier
*) t
;
14973 struct lang_id2
*li2
= li
->x
;
14974 ggc_mark_tree (li
->namespace_bindings
);
14975 ggc_mark_tree (li
->bindings
);
14976 ggc_mark_tree (li
->class_value
);
14977 ggc_mark_tree (li
->class_template_info
);
14981 ggc_mark_tree (li2
->label_value
);
14982 ggc_mark_tree (li2
->implicit_decl
);
14983 ggc_mark_tree (li2
->error_locus
);
14986 else if (code
== CPLUS_BINDING
)
14988 if (BINDING_HAS_LEVEL_P (t
))
14989 mark_binding_level (&BINDING_LEVEL (t
));
14991 ggc_mark_tree (BINDING_SCOPE (t
));
14992 ggc_mark_tree (BINDING_VALUE (t
));
14994 else if (code
== OVERLOAD
)
14995 ggc_mark_tree (OVL_FUNCTION (t
));
14996 else if (code
== TEMPLATE_PARM_INDEX
)
14997 ggc_mark_tree (TEMPLATE_PARM_DECL (t
));
14998 else if (TREE_CODE_CLASS (code
) == 'd')
15000 struct lang_decl
*ld
= DECL_LANG_SPECIFIC (t
);
15005 if (!DECL_GLOBAL_CTOR_P (t
)
15006 && !DECL_GLOBAL_DTOR_P (t
)
15007 && !DECL_THUNK_P (t
))
15008 ggc_mark_tree (ld
->decl_flags
.u2
.access
);
15009 else if (DECL_THUNK_P (t
))
15010 ggc_mark_tree (ld
->decl_flags
.u2
.vcall_offset
);
15011 ggc_mark_tree (ld
->decl_flags
.context
);
15012 if (TREE_CODE (t
) != NAMESPACE_DECL
)
15013 ggc_mark_tree (ld
->decl_flags
.u
.template_info
);
15015 mark_binding_level (&NAMESPACE_LEVEL (t
));
15016 if (CAN_HAVE_FULL_LANG_DECL_P (t
))
15018 ggc_mark_tree (ld
->befriending_classes
);
15019 ggc_mark_tree (ld
->saved_tree
);
15020 ggc_mark_tree (ld
->cloned_function
);
15021 if (!DECL_OVERLOADED_OPERATOR_P (t
))
15022 ggc_mark_tree (ld
->u2
.vtt_parm
);
15023 if (TREE_CODE (t
) == TYPE_DECL
)
15024 ggc_mark_tree (ld
->u
.sorted_fields
);
15025 else if (TREE_CODE (t
) == FUNCTION_DECL
15026 && !DECL_PENDING_INLINE_P (t
))
15027 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t
));
15031 else if (TREE_CODE_CLASS (code
) == 't')
15033 struct lang_type
*lt
= TYPE_LANG_SPECIFIC (t
);
15035 if (lt
&& !(TREE_CODE (t
) == POINTER_TYPE
15036 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
15039 ggc_mark_tree (lt
->primary_base
);
15040 ggc_mark_tree (lt
->vfields
);
15041 ggc_mark_tree (lt
->vbases
);
15042 ggc_mark_tree (lt
->tags
);
15043 ggc_mark_tree (lt
->size
);
15044 ggc_mark_tree (lt
->pure_virtuals
);
15045 ggc_mark_tree (lt
->friend_classes
);
15046 ggc_mark_tree (lt
->rtti
);
15047 ggc_mark_tree (lt
->methods
);
15048 ggc_mark_tree (lt
->template_info
);
15049 ggc_mark_tree (lt
->befriending_classes
);
15052 /* In the case of pointer-to-member function types, the
15053 TYPE_LANG_SPECIFIC is really just a tree. */
15054 ggc_mark_tree ((tree
) lt
);