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 void lang_print_error_function
PARAMS ((const char *));
133 static tree maybe_process_template_type_declaration
PARAMS ((tree
, int, struct binding_level
*));
134 static void check_for_uninitialized_const_var
PARAMS ((tree
));
135 static unsigned long typename_hash
PARAMS ((hash_table_key
));
136 static boolean typename_compare
PARAMS ((hash_table_key
, hash_table_key
));
137 static void push_binding
PARAMS ((tree
, tree
, struct binding_level
*));
138 static int add_binding
PARAMS ((tree
, tree
));
139 static void pop_binding
PARAMS ((tree
, tree
));
140 static tree local_variable_p_walkfn
PARAMS ((tree
*, int *, void *));
141 static tree find_binding
PARAMS ((tree
, tree
));
142 static tree select_decl
PARAMS ((tree
, int));
143 static int lookup_flags
PARAMS ((int, int));
144 static tree qualify_lookup
PARAMS ((tree
, int));
145 static tree record_builtin_java_type
PARAMS ((const char *, int));
146 static const char *tag_name
PARAMS ((enum tag_types code
));
147 static void find_class_binding_level
PARAMS ((void));
148 static struct binding_level
*innermost_nonclass_level
PARAMS ((void));
149 static void warn_about_implicit_typename_lookup
PARAMS ((tree
, tree
));
150 static int walk_namespaces_r
PARAMS ((tree
, walk_namespaces_fn
, void *));
151 static int walk_globals_r
PARAMS ((tree
, void *));
152 static void add_decl_to_level
PARAMS ((tree
, struct binding_level
*));
153 static tree make_label_decl
PARAMS ((tree
, int));
154 static void use_label
PARAMS ((tree
));
155 static void check_previous_goto_1
PARAMS ((tree
, struct binding_level
*, tree
,
157 static void check_previous_goto
PARAMS ((struct named_label_use_list
*));
158 static void check_switch_goto
PARAMS ((struct binding_level
*));
159 static void check_previous_gotos
PARAMS ((tree
));
160 static void pop_label
PARAMS ((tree
, tree
));
161 static void pop_labels
PARAMS ((tree
));
162 static void maybe_deduce_size_from_array_init
PARAMS ((tree
, tree
));
163 static void layout_var_decl
PARAMS ((tree
));
164 static void maybe_commonize_var
PARAMS ((tree
));
165 static tree check_initializer
PARAMS ((tree
, tree
));
166 static void make_rtl_for_nonlocal_decl
PARAMS ((tree
, tree
, const char *));
167 static void push_cp_function_context
PARAMS ((struct function
*));
168 static void pop_cp_function_context
PARAMS ((struct function
*));
169 static void mark_binding_level
PARAMS ((void *));
170 static void mark_named_label_lists
PARAMS ((void *, void *));
171 static void mark_cp_function_context
PARAMS ((struct function
*));
172 static void mark_saved_scope
PARAMS ((void *));
173 static void mark_lang_function
PARAMS ((struct language_function
*));
174 static void mark_stmt_tree
PARAMS ((struct stmt_tree
*));
175 static void save_function_data
PARAMS ((tree
));
176 static void check_function_type
PARAMS ((tree
));
177 static void destroy_local_var
PARAMS ((tree
));
178 static void finish_constructor_body
PARAMS ((void));
179 static void finish_destructor_body
PARAMS ((void));
180 static tree create_array_type_for_decl
PARAMS ((tree
, tree
, tree
));
181 static tree get_atexit_node
PARAMS ((void));
182 static tree get_dso_handle_node
PARAMS ((void));
183 static tree start_cleanup_fn
PARAMS ((void));
184 static void end_cleanup_fn
PARAMS ((void));
185 static tree cp_make_fname_decl
PARAMS ((tree
, const char *, int));
186 static void initialize_predefined_identifiers
PARAMS ((void));
187 static tree check_special_function_return_type
188 PARAMS ((special_function_kind
, tree
, tree
, tree
));
189 static tree push_cp_library_fn
PARAMS ((enum tree_code
, tree
));
190 static tree build_cp_library_fn
PARAMS ((tree
, enum tree_code
, tree
));
192 #if defined (DEBUG_CP_BINDING_LEVELS)
193 static void indent
PARAMS ((void));
196 /* Erroneous argument lists can use this *IFF* they do not modify it. */
197 tree error_mark_list
;
199 /* The following symbols are subsumed in the cp_global_trees array, and
200 listed here individually for documentation purposes.
203 tree wchar_decl_node;
206 tree vtable_entry_type;
207 tree delta_type_node;
210 tree __baselist_desc_type_node;
211 tree __i_desc_type_node, __m_desc_type_node;
212 tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type;
214 tree __t_desc_type_node;
216 tree __tp_desc_type_node;
218 tree ti_desc_type_node;
219 tree bltn_desc_type_node, ptr_desc_type_node;
220 tree ary_desc_type_node, func_desc_type_node, enum_desc_type_node;
221 tree class_desc_type_node, si_class_desc_type_node, vmi_class_desc_type_node;
222 tree ptm_desc_type_node;
223 tree base_desc_type_node;
225 Not needed yet? May be needed one day?
226 tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type;
227 tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type;
228 tree __ptmf_desc_array_type, __ptmd_desc_array_type;
231 tree class_type_node, record_type_node, union_type_node, enum_type_node;
232 tree unknown_type_node;
234 Array type `vtable_entry_type[]'
237 tree vtbl_ptr_type_node;
244 A FUNCTION_DECL which can call `abort'. Not necessarily the
245 one that the user will declare, but sufficient to be called
246 by routines that want to abort the program.
250 The FUNCTION_DECL for the default `::operator delete'.
252 tree global_delete_fndecl;
255 tree type_info_type_node, tinfo_decl_id, tinfo_decl_type;
260 tree cp_global_trees
[CPTI_MAX
];
262 /* Indicates that there is a type value in some namespace, although
263 that is not necessarily in scope at the moment. */
265 static tree global_type_node
;
270 /* Expect only namespace names now. */
271 static int only_namespace_names
;
273 /* If original DECL_RESULT of current function was a register,
274 but due to being an addressable named return value, would up
275 on the stack, this variable holds the named return value's
276 original location. */
278 #define original_result_rtx cp_function_chain->x_result_rtx
280 /* Used only for jumps to as-yet undefined labels, since jumps to
281 defined labels can have their validity checked immediately. */
283 struct named_label_use_list
285 struct binding_level
*binding_level
;
288 const char *filename_o_goto
;
290 struct named_label_use_list
*next
;
293 #define named_label_uses cp_function_chain->x_named_label_uses
295 /* A list of objects which have constructors or destructors
296 which reside in the global scope. The decl is stored in
297 the TREE_VALUE slot and the initializer is stored
298 in the TREE_PURPOSE slot. */
299 tree static_aggregates
;
303 /* A node for the integer constants 2, and 3. */
305 tree integer_two_node
, integer_three_node
;
307 /* Parsing a function declarator leaves here a chain of structure
308 and enum types declared in the parmlist. */
310 static tree last_function_parm_tags
;
312 /* Similar, for last_function_parm_tags. */
313 tree last_function_parms
;
314 static tree current_function_parm_tags
;
316 /* A list of all LABEL_DECLs in the function that have names. Here so
317 we can clear out their names' definitions at the end of the
318 function, and so we can check the validity of jumps to these labels. */
320 struct named_label_list
322 struct binding_level
*binding_level
;
328 struct named_label_list
*next
;
331 #define named_labels cp_function_chain->x_named_labels
333 /* Set to 0 at beginning of a function definition, and whenever
334 a label (case or named) is defined. Set to value of expression
335 returned from function when that value can be transformed into
336 a named return value. */
338 tree current_function_return_value
;
340 /* Nonzero means use the ISO C99 dialect of C. */
344 /* Nonzero means give `double' the same size as `float'. */
346 extern int flag_short_double
;
348 /* Nonzero means don't recognize any builtin functions. */
350 extern int flag_no_builtin
;
352 /* Nonzero means don't recognize the non-ANSI builtin functions.
355 extern int flag_no_nonansi_builtin
;
357 /* Nonzero if we want to conserve space in the .o files. We do this
358 by putting uninitialized data and runtime initialized data into
359 .common instead of .data at the expense of not flagging multiple
361 extern int flag_conserve_space
;
363 /* C and C++ flags are in decl2.c. */
365 /* Flag used when debugging spew.c */
367 extern int spew_debug
;
369 /* A expression of value 0 with the same precision as a sizetype
371 tree signed_size_zero_node
;
373 /* The name of the anonymous namespace, throughout this translation
375 tree anonymous_namespace_name
;
378 /* For each binding contour we allocate a binding_level structure
379 which records the names defined in that contour.
382 1) one for each function definition,
383 where internal declarations of the parameters appear.
384 2) one for each compound statement,
385 to record its declarations.
387 The current meaning of a name can be found by searching the levels
388 from the current one out to the global one.
390 Off to the side, may be the class_binding_level. This exists only
391 to catch class-local declarations. It is otherwise nonexistent.
393 Also there may be binding levels that catch cleanups that must be
394 run when exceptions occur. Thus, to see whether a name is bound in
395 the current scope, it is not enough to look in the
396 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
399 /* Note that the information in the `names' component of the global contour
400 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
404 /* A chain of _DECL nodes for all variables, constants, functions,
405 and typedef types. These are in the reverse of the order
406 supplied. There may be OVERLOADs on this list, too, but they
407 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
410 /* A list of structure, union and enum definitions, for looking up
412 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
413 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
414 or ENUMERAL_TYPE node.
416 C++: the TREE_VALUE nodes can be simple types for
417 component_bindings. */
420 /* A list of USING_DECL nodes. */
423 /* A list of used namespaces. PURPOSE is the namespace,
424 VALUE the common ancestor with this binding_level's namespace. */
425 tree using_directives
;
427 /* If this binding level is the binding level for a class, then
428 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
429 is the name of an entity bound in the class; the TREE_VALUE is
430 the IDENTIFIER_CLASS_VALUE before we entered the class. Thus,
431 when leaving class scope, we can restore the
432 IDENTIFIER_CLASS_VALUE by walking this list. The TREE_TYPE is
433 the DECL bound by this name in the class. */
436 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
437 is used for all binding levels. */
440 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
441 label in this scope. The TREE_PURPOSE is the previous value of
442 the IDENTIFIER_LABEL VALUE. */
443 tree shadowed_labels
;
445 /* For each level (except not the global one),
446 a chain of BLOCK nodes for all the levels
447 that were entered and exited one level down. */
450 /* The BLOCK node for this level, if one has been preallocated.
451 If 0, the BLOCK is allocated (if needed) when the level is popped. */
454 /* The _TYPE node for this level, if parm_flag == 2. */
457 /* The binding level which this one is contained in (inherits from). */
458 struct binding_level
*level_chain
;
460 /* List of decls in `names' that have incomplete
461 structure or union types. */
464 /* List of VAR_DECLS saved from a previous for statement.
465 These would be dead in ISO-conforming code, but might
466 be referenced in ARM-era code. These are stored in a
467 TREE_LIST; the TREE_VALUE is the actual declaration. */
468 tree dead_vars_from_for
;
470 /* 1 for the level that holds the parameters of a function.
471 2 for the level that holds a class declaration. */
472 unsigned parm_flag
: 2;
474 /* 1 means make a BLOCK for this level regardless of all else.
475 2 for temporary binding contours created by the compiler. */
478 /* Nonzero if this level "doesn't exist" for tags. */
479 unsigned tag_transparent
: 1;
481 /* Nonzero if this level can safely have additional
482 cleanup-needing variables added to it. */
483 unsigned more_cleanups_ok
: 1;
484 unsigned have_cleanups
: 1;
486 /* Nonzero if this scope is for storing the decls for template
487 parameters and generic decls; these decls will be discarded and
488 replaced with a TEMPLATE_DECL. */
489 unsigned template_parms_p
: 1;
491 /* Nonzero if this scope corresponds to the `<>' in a
492 `template <>' clause. Whenever this flag is set,
493 TEMPLATE_PARMS_P will be set as well. */
494 unsigned template_spec_p
: 1;
496 /* This is set for a namespace binding level. */
497 unsigned namespace_p
: 1;
499 /* True if this level is that of a for-statement where we need to
500 worry about ambiguous (ARM or ISO) scope rules. */
501 unsigned is_for_scope
: 1;
503 /* True if this level corresponds to an EH region, as for a try block.
504 Currently this information is only available while building the
506 unsigned eh_region
: 1;
508 /* Four bits left for this word. */
510 #if defined(DEBUG_CP_BINDING_LEVELS)
511 /* Binding depth at which this level began. */
512 unsigned binding_depth
;
513 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
516 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
518 /* The binding level currently in effect. */
520 #define current_binding_level \
522 ? cp_function_chain->bindings \
523 : scope_chain->bindings)
525 /* The binding level of the current class, if any. */
527 #define class_binding_level scope_chain->class_bindings
529 /* A chain of binding_level structures awaiting reuse. */
531 static struct binding_level
*free_binding_level
;
533 /* The outermost binding level, for names of file scope.
534 This is created when the compiler is started and exists
535 through the entire run. */
537 static struct binding_level
*global_binding_level
;
539 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
541 static int keep_next_level_flag
;
543 #if defined(DEBUG_CP_BINDING_LEVELS)
544 static int binding_depth
= 0;
545 static int is_class_level
= 0;
552 for (i
= 0; i
< binding_depth
*2; i
++)
555 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
557 static tree pushdecl_with_scope
PARAMS ((tree
, struct binding_level
*));
560 push_binding_level (newlevel
, tag_transparent
, keep
)
561 struct binding_level
*newlevel
;
562 int tag_transparent
, keep
;
564 /* Add this level to the front of the chain (stack) of levels that
566 bzero ((char*) newlevel
, sizeof (struct binding_level
));
567 newlevel
->level_chain
= current_binding_level
;
568 current_binding_level
= newlevel
;
569 newlevel
->tag_transparent
= tag_transparent
;
570 newlevel
->more_cleanups_ok
= 1;
572 newlevel
->keep
= keep
;
573 #if defined(DEBUG_CP_BINDING_LEVELS)
574 newlevel
->binding_depth
= binding_depth
;
576 fprintf (stderr
, "push %s level 0x%08x line %d\n",
577 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
580 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
583 /* Find the innermost enclosing class scope, and reset
584 CLASS_BINDING_LEVEL appropriately. */
587 find_class_binding_level ()
589 struct binding_level
*level
= current_binding_level
;
591 while (level
&& level
->parm_flag
!= 2)
592 level
= level
->level_chain
;
593 if (level
&& level
->parm_flag
== 2)
594 class_binding_level
= level
;
596 class_binding_level
= 0;
602 if (global_binding_level
)
604 /* Cannot pop a level, if there are none left to pop. */
605 if (current_binding_level
== global_binding_level
)
606 my_friendly_abort (123);
608 /* Pop the current level, and free the structure for reuse. */
609 #if defined(DEBUG_CP_BINDING_LEVELS)
612 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
613 (is_class_level
) ? "class" : "block",
614 current_binding_level
, lineno
);
615 if (is_class_level
!= (current_binding_level
== class_binding_level
))
618 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
621 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
623 register struct binding_level
*level
= current_binding_level
;
624 current_binding_level
= current_binding_level
->level_chain
;
625 level
->level_chain
= free_binding_level
;
626 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
627 if (level
->binding_depth
!= binding_depth
)
629 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
630 free_binding_level
= level
;
631 find_class_binding_level ();
636 suspend_binding_level ()
638 if (class_binding_level
)
639 current_binding_level
= class_binding_level
;
641 if (global_binding_level
)
643 /* Cannot suspend a level, if there are none left to suspend. */
644 if (current_binding_level
== global_binding_level
)
645 my_friendly_abort (123);
647 /* Suspend the current level. */
648 #if defined(DEBUG_CP_BINDING_LEVELS)
651 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
652 (is_class_level
) ? "class" : "block",
653 current_binding_level
, lineno
);
654 if (is_class_level
!= (current_binding_level
== class_binding_level
))
657 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
660 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
661 current_binding_level
= current_binding_level
->level_chain
;
662 find_class_binding_level ();
666 resume_binding_level (b
)
667 struct binding_level
*b
;
669 /* Resuming binding levels is meant only for namespaces,
670 and those cannot nest into classes. */
671 my_friendly_assert(!class_binding_level
, 386);
672 /* Also, resuming a non-directly nested namespace is a no-no. */
673 my_friendly_assert(b
->level_chain
== current_binding_level
, 386);
674 current_binding_level
= b
;
675 #if defined(DEBUG_CP_BINDING_LEVELS)
676 b
->binding_depth
= binding_depth
;
678 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
679 (is_class_level
) ? "class" : "block", b
, lineno
);
682 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
685 /* Create a new `struct binding_level'. */
688 struct binding_level
*
689 make_binding_level ()
692 return (struct binding_level
*) xmalloc (sizeof (struct binding_level
));
695 /* Nonzero if we are currently in the global binding level. */
700 return current_binding_level
== global_binding_level
;
703 /* Return the innermost binding level that is not for a class scope. */
705 static struct binding_level
*
706 innermost_nonclass_level ()
708 struct binding_level
*b
;
710 b
= current_binding_level
;
711 while (b
->parm_flag
== 2)
717 /* Nonzero if we are currently in a toplevel binding level. This
718 means either the global binding level or a namespace in a toplevel
719 binding level. Since there are no non-toplevel namespace levels,
720 this really means any namespace or template parameter level. We
721 also include a class whose context is toplevel. */
724 toplevel_bindings_p ()
726 struct binding_level
*b
= innermost_nonclass_level ();
728 return b
->namespace_p
|| b
->template_parms_p
;
731 /* Nonzero if this is a namespace scope, or if we are defining a class
732 which is itself at namespace scope, or whose enclosing class is
733 such a class, etc. */
736 namespace_bindings_p ()
738 struct binding_level
*b
= innermost_nonclass_level ();
740 return b
->namespace_p
;
743 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
744 unconditionally. Otherwise, use the normal logic to decide whether
745 or not to create a BLOCK. */
748 keep_next_level (keep
)
751 keep_next_level_flag
= keep
;
754 /* Nonzero if the current level needs to have a BLOCK made. */
759 return (current_binding_level
->blocks
!= NULL_TREE
760 || current_binding_level
->keep
761 || current_binding_level
->names
!= NULL_TREE
762 || (current_binding_level
->tags
!= NULL_TREE
763 && !current_binding_level
->tag_transparent
));
767 declare_namespace_level ()
769 current_binding_level
->namespace_p
= 1;
772 /* Returns non-zero if this scope was created to store template
776 template_parm_scope_p ()
778 return current_binding_level
->template_parms_p
;
781 /* Returns the kind of template specialization we are currently
782 processing, given that it's declaration contained N_CLASS_SCOPES
783 explicit scope qualifications. */
786 current_tmpl_spec_kind (n_class_scopes
)
789 int n_template_parm_scopes
= 0;
790 int seen_specialization_p
= 0;
791 int innermost_specialization_p
= 0;
792 struct binding_level
*b
;
794 /* Scan through the template parameter scopes. */
795 for (b
= current_binding_level
; b
->template_parms_p
; b
= b
->level_chain
)
797 /* If we see a specialization scope inside a parameter scope,
798 then something is wrong. That corresponds to a declaration
801 template <class T> template <> ...
803 which is always illegal since [temp.expl.spec] forbids the
804 specialization of a class member template if the enclosing
805 class templates are not explicitly specialized as well. */
806 if (b
->template_spec_p
)
808 if (n_template_parm_scopes
== 0)
809 innermost_specialization_p
= 1;
811 seen_specialization_p
= 1;
813 else if (seen_specialization_p
== 1)
814 return tsk_invalid_member_spec
;
816 ++n_template_parm_scopes
;
819 /* Handle explicit instantiations. */
820 if (processing_explicit_instantiation
)
822 if (n_template_parm_scopes
!= 0)
823 /* We've seen a template parameter list during an explicit
824 instantiation. For example:
826 template <class T> template void f(int);
828 This is erroneous. */
829 return tsk_invalid_expl_inst
;
831 return tsk_expl_inst
;
834 if (n_template_parm_scopes
< n_class_scopes
)
835 /* We've not seen enough template headers to match all the
836 specialized classes present. For example:
838 template <class T> void R<T>::S<T>::f(int);
840 This is illegal; there needs to be one set of template
841 parameters for each class. */
842 return tsk_insufficient_parms
;
843 else if (n_template_parm_scopes
== n_class_scopes
)
844 /* We're processing a non-template declaration (even though it may
845 be a member of a template class.) For example:
847 template <class T> void S<T>::f(int);
849 The `class T' maches the `S<T>', leaving no template headers
850 corresponding to the `f'. */
852 else if (n_template_parm_scopes
> n_class_scopes
+ 1)
853 /* We've got too many template headers. For example:
855 template <> template <class T> void f (T);
857 There need to be more enclosing classes. */
858 return tsk_excessive_parms
;
860 /* This must be a template. It's of the form:
862 template <class T> template <class U> void S<T>::f(U);
864 This is a specialization if the innermost level was a
865 specialization; otherwise it's just a definition of the
867 return innermost_specialization_p
? tsk_expl_spec
: tsk_template
;
871 set_class_shadows (shadows
)
874 class_binding_level
->class_shadowed
= shadows
;
877 /* Enter a new binding level.
878 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
879 not for that of tags. */
882 pushlevel (tag_transparent
)
885 struct binding_level
*newlevel
;
887 if (cfun
&& !doing_semantic_analysis_p ())
890 /* Reuse or create a struct for this binding level. */
891 #if defined(DEBUG_CP_BINDING_LEVELS)
893 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
894 if (free_binding_level
)
895 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
897 newlevel
= free_binding_level
;
898 free_binding_level
= free_binding_level
->level_chain
;
901 newlevel
= make_binding_level ();
903 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
904 GNU_xref_start_scope ((HOST_WIDE_INT
) newlevel
);
905 keep_next_level_flag
= 0;
908 /* Enter a new scope. The KIND indicates what kind of scope is being
919 case sk_template_spec
:
920 current_binding_level
->template_spec_p
= 1;
923 case sk_template_parms
:
924 current_binding_level
->template_parms_p
= 1;
928 my_friendly_abort (20000309);
932 /* Exit the current scope. */
941 note_level_for_for ()
943 current_binding_level
->is_for_scope
= 1;
946 /* Record that the current binding level represents a try block. */
951 current_binding_level
->eh_region
= 1;
954 /* For a binding between a name and an entity at a block scope,
955 this is the `struct binding_level' for the block. */
956 #define BINDING_LEVEL(NODE) \
957 (((struct tree_binding*)NODE)->scope.level)
959 /* Make DECL the innermost binding for ID. The LEVEL is the binding
960 level at which this declaration is being bound. */
963 push_binding (id
, decl
, level
)
966 struct binding_level
* level
;
970 binding
= make_node (CPLUS_BINDING
);
972 /* Now, fill in the binding information. */
973 BINDING_VALUE (binding
) = decl
;
974 BINDING_TYPE (binding
) = NULL_TREE
;
975 BINDING_LEVEL (binding
) = level
;
976 INHERITED_VALUE_BINDING_P (binding
) = 0;
977 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
978 BINDING_HAS_LEVEL_P (binding
) = 1;
980 /* And put it on the front of the list of bindings for ID. */
981 TREE_CHAIN (binding
) = IDENTIFIER_BINDING (id
);
982 IDENTIFIER_BINDING (id
) = binding
;
985 /* ID is already bound in the current scope. But, DECL is an
986 additional binding for ID in the same scope. This is the `struct
987 stat' hack whereby a non-typedef class-name or enum-name can be
988 bound at the same level as some other kind of entity. It's the
989 responsibility of the caller to check that inserting this name is
990 legal here. Returns nonzero if the new binding was successful. */
992 add_binding (id
, decl
)
996 tree binding
= IDENTIFIER_BINDING (id
);
999 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
1000 /* The new name is the type name. */
1001 BINDING_TYPE (binding
) = decl
;
1002 else if (!BINDING_VALUE (binding
))
1003 /* This situation arises when push_class_level_binding moves an
1004 inherited type-binding out of the way to make room for a new
1006 BINDING_VALUE (binding
) = decl
;
1007 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
1008 && DECL_ARTIFICIAL (BINDING_VALUE (binding
)))
1010 /* The old binding was a type name. It was placed in
1011 BINDING_VALUE because it was thought, at the point it was
1012 declared, to be the only entity with such a name. Move the
1013 type name into the type slot; it is now hidden by the new
1015 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
1016 BINDING_VALUE (binding
) = decl
;
1017 INHERITED_VALUE_BINDING_P (binding
) = 0;
1019 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
1020 && TREE_CODE (decl
) == TYPE_DECL
1021 && DECL_NAME (decl
) == DECL_NAME (BINDING_VALUE (binding
))
1022 && same_type_p (TREE_TYPE (decl
),
1023 TREE_TYPE (BINDING_VALUE (binding
))))
1024 /* We have two typedef-names, both naming the same type to have
1025 the same name. This is OK because of:
1029 In a given scope, a typedef specifier can be used to redefine
1030 the name of any type declared in that scope to refer to the
1031 type to which it already refers. */
1033 /* There can be two block-scope declarations of the same variable,
1034 so long as they are `extern' declarations. */
1035 else if (TREE_CODE (decl
) == VAR_DECL
1036 && TREE_CODE (BINDING_VALUE (binding
)) == VAR_DECL
1037 && DECL_EXTERNAL (decl
)
1038 && DECL_EXTERNAL (BINDING_VALUE (binding
)))
1040 duplicate_decls (decl
, BINDING_VALUE (binding
));
1045 cp_error ("declaration of `%#D'", decl
);
1046 cp_error_at ("conflicts with previous declaration `%#D'",
1047 BINDING_VALUE (binding
));
1054 /* Add DECL to the list of things declared in B. */
1057 add_decl_to_level (decl
, b
)
1059 struct binding_level
*b
;
1061 /* We build up the list in reverse order, and reverse it later if
1063 TREE_CHAIN (decl
) = b
->names
;
1067 /* Bind DECL to ID in the current_binding_level, assumed to be a local
1068 binding level. If PUSH_USING is set in FLAGS, we know that DECL
1069 doesn't really belong to this binding level, that it got here
1070 through a using-declaration. */
1073 push_local_binding (id
, decl
, flags
)
1078 struct binding_level
*b
;
1080 /* Skip over any local classes. This makes sense if we call
1081 push_local_binding with a friend decl of a local class. */
1082 b
= current_binding_level
;
1083 while (b
->parm_flag
== 2)
1086 if (lookup_name_current_level (id
))
1088 /* Supplement the existing binding. */
1089 if (!add_binding (id
, decl
))
1090 /* It didn't work. Something else must be bound at this
1091 level. Do not add DECL to the list of things to pop
1096 /* Create a new binding. */
1097 push_binding (id
, decl
, b
);
1099 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
1100 /* We must put the OVERLOAD into a TREE_LIST since the
1101 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1102 decls that got here through a using-declaration. */
1103 decl
= build_tree_list (NULL_TREE
, decl
);
1105 /* And put DECL on the list of things declared by the current
1107 add_decl_to_level (decl
, b
);
1110 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
1111 binding was successful. */
1114 push_class_binding (id
, decl
)
1119 tree binding
= IDENTIFIER_BINDING (id
);
1122 /* Note that we declared this value so that we can issue an error if
1123 this an illegal redeclaration of a name already used for some
1125 note_name_declared_in_class (id
, decl
);
1127 if (binding
&& BINDING_LEVEL (binding
) == class_binding_level
)
1128 /* Supplement the existing binding. */
1129 result
= add_binding (id
, decl
);
1131 /* Create a new binding. */
1132 push_binding (id
, decl
, class_binding_level
);
1134 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1135 class-level declaration. Note that we do not use DECL here
1136 because of the possibility of the `struct stat' hack; if DECL is
1137 a class-name or enum-name we might prefer a field-name, or some
1139 IDENTIFIER_CLASS_VALUE (id
) = BINDING_VALUE (IDENTIFIER_BINDING (id
));
1141 /* If this is a binding from a base class, mark it as such. */
1142 binding
= IDENTIFIER_BINDING (id
);
1143 if (BINDING_VALUE (binding
) == decl
&& TREE_CODE (decl
) != TREE_LIST
)
1145 /* Any implicit typename must be from a base-class. The
1146 context for an implicit typename declaration is always
1147 the derived class in which the lookup was done, so the checks
1148 based on the context of DECL below will not trigger. */
1149 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl
))
1150 INHERITED_VALUE_BINDING_P (binding
) = 1;
1153 if (TREE_CODE (decl
) == OVERLOAD
)
1154 context
= CP_DECL_CONTEXT (OVL_CURRENT (decl
));
1157 my_friendly_assert (DECL_P (decl
), 0);
1158 context
= CP_DECL_CONTEXT (decl
);
1161 if (is_properly_derived_from (current_class_type
, context
))
1162 INHERITED_VALUE_BINDING_P (binding
) = 1;
1164 INHERITED_VALUE_BINDING_P (binding
) = 0;
1167 else if (BINDING_VALUE (binding
) == decl
)
1168 /* We only encounter a TREE_LIST when push_class_decls detects an
1169 ambiguity. Such an ambiguity can be overridden by a definition
1171 INHERITED_VALUE_BINDING_P (binding
) = 1;
1176 /* Remove the binding for DECL which should be the innermost binding
1180 pop_binding (id
, decl
)
1186 if (id
== NULL_TREE
)
1187 /* It's easiest to write the loops that call this function without
1188 checking whether or not the entities involved have names. We
1189 get here for such an entity. */
1192 /* Get the innermost binding for ID. */
1193 binding
= IDENTIFIER_BINDING (id
);
1195 /* The name should be bound. */
1196 my_friendly_assert (binding
!= NULL_TREE
, 0);
1198 /* The DECL will be either the ordinary binding or the type
1199 binding for this identifier. Remove that binding. */
1200 if (BINDING_VALUE (binding
) == decl
)
1201 BINDING_VALUE (binding
) = NULL_TREE
;
1202 else if (BINDING_TYPE (binding
) == decl
)
1203 BINDING_TYPE (binding
) = NULL_TREE
;
1205 my_friendly_abort (0);
1207 if (!BINDING_VALUE (binding
) && !BINDING_TYPE (binding
))
1208 /* We're completely done with the innermost binding for this
1209 identifier. Unhook it from the list of bindings. */
1210 IDENTIFIER_BINDING (id
) = TREE_CHAIN (binding
);
1213 /* When a label goes out of scope, check to see if that label was used
1214 in a valid manner, and issue any appropriate warnings or errors. */
1217 pop_label (label
, old_value
)
1221 if (!processing_template_decl
&& doing_semantic_analysis_p ())
1223 if (DECL_INITIAL (label
) == NULL_TREE
)
1225 cp_error_at ("label `%D' used but not defined", label
);
1226 /* Avoid crashing later. */
1227 define_label (input_filename
, 1, DECL_NAME (label
));
1229 else if (warn_unused_label
&& !TREE_USED (label
))
1230 cp_warning_at ("label `%D' defined but not used", label
);
1233 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), old_value
);
1236 /* At the end of a function, all labels declared within the fucntion
1237 go out of scope. BLOCK is the top-level block for the
1244 struct named_label_list
*link
;
1246 /* Clear out the definitions of all label names, since their scopes
1248 for (link
= named_labels
; link
; link
= link
->next
)
1250 pop_label (link
->label_decl
, link
->old_value
);
1251 /* Put the labels into the "variables" of the top-level block,
1252 so debugger can see them. */
1253 TREE_CHAIN (link
->label_decl
) = BLOCK_VARS (block
);
1254 BLOCK_VARS (block
) = link
->label_decl
;
1257 named_labels
= NULL
;
1260 /* Exit a binding level.
1261 Pop the level off, and restore the state of the identifier-decl mappings
1262 that were in effect when this level was entered.
1264 If KEEP == 1, this level had explicit declarations, so
1265 and create a "block" (a BLOCK node) for the level
1266 to record its declarations and subblocks for symbol table output.
1268 If FUNCTIONBODY is nonzero, this level is the body of a function,
1269 so create a block as if KEEP were set and also clear out all
1272 If REVERSE is nonzero, reverse the order of decls before putting
1273 them into the BLOCK. */
1276 poplevel (keep
, reverse
, functionbody
)
1282 /* The chain of decls was accumulated in reverse order.
1283 Put it into forward order, just for cleanliness. */
1285 int tmp
= functionbody
;
1286 int real_functionbody
;
1289 tree block
= NULL_TREE
;
1291 int block_previously_created
;
1292 int leaving_for_scope
;
1294 if (cfun
&& !doing_semantic_analysis_p ())
1297 my_friendly_assert (current_binding_level
->parm_flag
!= 2,
1300 real_functionbody
= (current_binding_level
->keep
== 2
1301 ? ((functionbody
= 0), tmp
) : functionbody
);
1302 tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1303 subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1305 my_friendly_assert (!current_binding_level
->class_shadowed
,
1308 /* We used to use KEEP == 2 to indicate that the new block should go
1309 at the beginning of the list of blocks at this binding level,
1310 rather than the end. This hack is no longer used. */
1311 my_friendly_assert (keep
== 0 || keep
== 1, 0);
1313 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1314 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1315 current_binding_level
->parm_flag
,
1316 current_binding_level
->keep
);
1318 if (current_binding_level
->keep
== 1)
1321 /* Any uses of undefined labels, and any defined labels, now operate
1322 under constraints of next binding contour. */
1323 if (cfun
&& !functionbody
)
1325 struct binding_level
*level_chain
;
1326 level_chain
= current_binding_level
->level_chain
;
1329 struct named_label_use_list
*uses
;
1330 struct named_label_list
*labels
;
1331 for (labels
= named_labels
; labels
; labels
= labels
->next
)
1332 if (labels
->binding_level
== current_binding_level
)
1335 if (current_binding_level
->eh_region
)
1336 labels
->eh_region
= 1;
1337 for (decl
= labels
->names_in_scope
; decl
;
1338 decl
= TREE_CHAIN (decl
))
1339 if (decl_jump_unsafe (decl
))
1340 labels
->bad_decls
= tree_cons (NULL_TREE
, decl
,
1342 labels
->binding_level
= level_chain
;
1343 labels
->names_in_scope
= level_chain
->names
;
1346 for (uses
= named_label_uses
; uses
; uses
= uses
->next
)
1347 if (uses
->binding_level
== current_binding_level
)
1349 uses
->binding_level
= level_chain
;
1350 uses
->names_in_scope
= level_chain
->names
;
1355 /* Get the decls in the order they were written.
1356 Usually current_binding_level->names is in reverse order.
1357 But parameter decls were previously put in forward order. */
1360 current_binding_level
->names
1361 = decls
= nreverse (current_binding_level
->names
);
1363 decls
= current_binding_level
->names
;
1365 /* Output any nested inline functions within this block
1366 if they weren't already output. */
1367 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1368 if (TREE_CODE (decl
) == FUNCTION_DECL
1369 && ! TREE_ASM_WRITTEN (decl
)
1370 && DECL_INITIAL (decl
) != NULL_TREE
1371 && TREE_ADDRESSABLE (decl
)
1372 && decl_function_context (decl
) == current_function_decl
)
1374 /* If this decl was copied from a file-scope decl
1375 on account of a block-scope extern decl,
1376 propagate TREE_ADDRESSABLE to the file-scope decl. */
1377 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1378 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1381 push_function_context ();
1382 output_inline_function (decl
);
1383 pop_function_context ();
1387 /* When not in function-at-a-time mode, expand_end_bindings will
1388 warn about unused variables. But, in function-at-a-time mode
1389 expand_end_bindings is not passed the list of variables in the
1390 current scope, and therefore no warning is emitted. So, we
1391 explicitly warn here. */
1392 if (!processing_template_decl
)
1393 warn_about_unused_variables (getdecls ());
1395 /* If there were any declarations or structure tags in that level,
1396 or if this level is a function body,
1397 create a BLOCK to record them for the life of this function. */
1399 block_previously_created
= (current_binding_level
->this_block
!= NULL_TREE
);
1400 if (block_previously_created
)
1401 block
= current_binding_level
->this_block
;
1402 else if (keep
== 1 || functionbody
)
1403 block
= make_node (BLOCK
);
1404 if (block
!= NULL_TREE
)
1406 if (block_previously_created
)
1408 if (decls
|| tags
|| subblocks
)
1410 if (BLOCK_VARS (block
))
1411 warning ("internal compiler error: debugging info corrupted");
1413 BLOCK_VARS (block
) = decls
;
1415 /* We can have previous subblocks and new subblocks when
1416 doing fixup_gotos with complex cleanups. We chain the new
1417 subblocks onto the end of any pre-existing subblocks. */
1418 BLOCK_SUBBLOCKS (block
) = chainon (BLOCK_SUBBLOCKS (block
),
1424 BLOCK_VARS (block
) = decls
;
1425 BLOCK_SUBBLOCKS (block
) = subblocks
;
1429 /* In each subblock, record that this is its superior. */
1431 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1432 BLOCK_SUPERCONTEXT (link
) = block
;
1434 /* We still support the old for-scope rules, whereby the variables
1435 in a for-init statement were in scope after the for-statement
1436 ended. We only use the new rules in flag_new_for_scope is
1439 = current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1;
1441 /* Remove declarations for all the DECLs in this level. */
1442 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1444 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
1445 && DECL_NAME (link
))
1448 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link
)));
1452 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
1454 ns_binding
= NULL_TREE
;
1457 && (BINDING_LEVEL (outer_binding
)
1458 == current_binding_level
->level_chain
))
1459 /* We have something like:
1464 and we are leaving the `for' scope. There's no reason to
1465 keep the binding of the inner `i' in this case. */
1466 pop_binding (DECL_NAME (link
), link
);
1467 else if ((outer_binding
1468 && (TREE_CODE (BINDING_VALUE (outer_binding
))
1471 && TREE_CODE (ns_binding
) == TYPE_DECL
))
1472 /* Here, we have something like:
1480 We must pop the for-scope binding so we know what's a
1481 type and what isn't. */
1482 pop_binding (DECL_NAME (link
), link
);
1485 /* Mark this VAR_DECL as dead so that we can tell we left it
1486 there only for backward compatibility. */
1487 DECL_DEAD_FOR_LOCAL (link
) = 1;
1489 /* Keep track of what should of have happenned when we
1490 popped the binding. */
1491 if (outer_binding
&& BINDING_VALUE (outer_binding
))
1492 DECL_SHADOWED_FOR_VAR (link
)
1493 = BINDING_VALUE (outer_binding
);
1495 /* Add it to the list of dead variables in the next
1496 outermost binding to that we can remove these when we
1497 leave that binding. */
1498 current_binding_level
->level_chain
->dead_vars_from_for
1499 = tree_cons (NULL_TREE
, link
,
1500 current_binding_level
->level_chain
->
1501 dead_vars_from_for
);
1503 /* Although we don't pop the CPLUS_BINDING, we do clear
1504 its BINDING_LEVEL since the level is going away now. */
1505 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link
)))
1511 /* Remove the binding. */
1513 if (TREE_CODE (decl
) == TREE_LIST
)
1514 decl
= TREE_VALUE (decl
);
1516 pop_binding (DECL_NAME (decl
), decl
);
1517 else if (TREE_CODE (decl
) == OVERLOAD
)
1518 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
1520 my_friendly_abort (0);
1524 /* Remove declarations for any `for' variables from inner scopes
1525 that we kept around. */
1526 for (link
= current_binding_level
->dead_vars_from_for
;
1527 link
; link
= TREE_CHAIN (link
))
1528 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
1530 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1531 for (link
= current_binding_level
->type_shadowed
;
1532 link
; link
= TREE_CHAIN (link
))
1533 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1535 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1536 for (link
= current_binding_level
->shadowed_labels
;
1538 link
= TREE_CHAIN (link
))
1539 pop_label (TREE_VALUE (link
), TREE_PURPOSE (link
));
1541 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1542 list if a `using' declaration put them there. The debugging
1543 back-ends won't understand OVERLOAD, so we remove them here.
1544 Because the BLOCK_VARS are (temporarily) shared with
1545 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1546 popped all the bindings. */
1551 for (d
= &BLOCK_VARS (block
); *d
; )
1553 if (TREE_CODE (*d
) == TREE_LIST
)
1554 *d
= TREE_CHAIN (*d
);
1556 d
= &TREE_CHAIN (*d
);
1560 /* If the level being exited is the top level of a function,
1561 check over all the labels. */
1564 /* Since this is the top level block of a function, the vars are
1565 the function's parameters. Don't leave them in the BLOCK
1566 because they are found in the FUNCTION_DECL instead. */
1567 BLOCK_VARS (block
) = 0;
1571 tmp
= current_binding_level
->keep
;
1573 pop_binding_level ();
1575 DECL_INITIAL (current_function_decl
) = block
;
1578 if (!block_previously_created
)
1579 current_binding_level
->blocks
1580 = chainon (current_binding_level
->blocks
, block
);
1582 /* If we did not make a block for the level just exited,
1583 any blocks made for inner levels
1584 (since they cannot be recorded as subblocks in that level)
1585 must be carried forward so they will later become subblocks
1586 of something else. */
1588 current_binding_level
->blocks
1589 = chainon (current_binding_level
->blocks
, subblocks
);
1591 /* Each and every BLOCK node created here in `poplevel' is important
1592 (e.g. for proper debugging information) so if we created one
1593 earlier, mark it as "used". */
1595 TREE_USED (block
) = 1;
1597 /* Take care of compiler's internal binding structures. */
1603 = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/1);
1606 SCOPE_STMT_BLOCK (TREE_PURPOSE (scope_stmts
)) = block
;
1607 SCOPE_STMT_BLOCK (TREE_VALUE (scope_stmts
)) = block
;
1610 block
= poplevel (keep
, reverse
, functionbody
);
1616 /* Delete the node BLOCK from the current binding level.
1617 This is used for the block inside a stmt expr ({...})
1618 so that the block can be reinserted where appropriate. */
1621 delete_block (block
)
1625 if (current_binding_level
->blocks
== block
)
1626 current_binding_level
->blocks
= TREE_CHAIN (block
);
1627 for (t
= current_binding_level
->blocks
; t
;)
1629 if (TREE_CHAIN (t
) == block
)
1630 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1634 TREE_CHAIN (block
) = NULL_TREE
;
1635 /* Clear TREE_USED which is always set by poplevel.
1636 The flag is set again if insert_block is called. */
1637 TREE_USED (block
) = 0;
1640 /* Insert BLOCK at the end of the list of subblocks of the
1641 current binding level. This is used when a BIND_EXPR is expanded,
1642 to handle the BLOCK node inside the BIND_EXPR. */
1645 insert_block (block
)
1648 TREE_USED (block
) = 1;
1649 current_binding_level
->blocks
1650 = chainon (current_binding_level
->blocks
, block
);
1653 /* Set the BLOCK node for the innermost scope
1654 (the one we are currently in). */
1658 register tree block
;
1660 current_binding_level
->this_block
= block
;
1663 /* Do a pushlevel for class declarations. */
1668 register struct binding_level
*newlevel
;
1670 /* Reuse or create a struct for this binding level. */
1671 #if defined(DEBUG_CP_BINDING_LEVELS)
1673 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1674 if (free_binding_level
)
1675 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1677 newlevel
= free_binding_level
;
1678 free_binding_level
= free_binding_level
->level_chain
;
1681 newlevel
= make_binding_level ();
1683 #if defined(DEBUG_CP_BINDING_LEVELS)
1685 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1687 push_binding_level (newlevel
, 0, 0);
1689 class_binding_level
= current_binding_level
;
1690 class_binding_level
->parm_flag
= 2;
1691 class_binding_level
->this_class
= current_class_type
;
1694 /* ...and a poplevel for class declarations. */
1699 register struct binding_level
*level
= class_binding_level
;
1702 my_friendly_assert (level
!= 0, 354);
1704 /* If we're leaving a toplevel class, don't bother to do the setting
1705 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1706 shouldn't even be used when current_class_type isn't set, and second,
1707 if we don't touch it here, we're able to use the cache effect if the
1708 next time we're entering a class scope, it is the same class. */
1709 if (current_class_depth
!= 1)
1711 struct binding_level
* b
;
1713 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1714 for (shadowed
= level
->class_shadowed
;
1716 shadowed
= TREE_CHAIN (shadowed
))
1717 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = NULL_TREE
;
1719 /* Find the next enclosing class, and recreate
1720 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1721 b
= level
->level_chain
;
1722 while (b
&& b
->parm_flag
!= 2)
1726 for (shadowed
= b
->class_shadowed
;
1728 shadowed
= TREE_CHAIN (shadowed
))
1732 t
= IDENTIFIER_BINDING (TREE_PURPOSE (shadowed
));
1733 while (t
&& BINDING_LEVEL (t
) != b
)
1737 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
))
1738 = BINDING_VALUE (t
);
1742 /* Remember to save what IDENTIFIER's were bound in this scope so we
1743 can recover from cache misses. */
1745 previous_class_type
= current_class_type
;
1746 previous_class_values
= class_binding_level
->class_shadowed
;
1748 for (shadowed
= level
->type_shadowed
;
1750 shadowed
= TREE_CHAIN (shadowed
))
1751 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1753 /* Remove the bindings for all of the class-level declarations. */
1754 for (shadowed
= level
->class_shadowed
;
1756 shadowed
= TREE_CHAIN (shadowed
))
1757 pop_binding (TREE_PURPOSE (shadowed
), TREE_TYPE (shadowed
));
1759 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1760 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1761 class_binding_level
->parm_flag
,
1762 class_binding_level
->keep
);
1764 /* Now, pop out of the binding level which we created up in the
1765 `pushlevel_class' routine. */
1766 #if defined(DEBUG_CP_BINDING_LEVELS)
1768 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1770 pop_binding_level ();
1773 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1774 for any names in enclosing classes. */
1777 clear_identifier_class_values ()
1781 if (!class_binding_level
)
1784 for (t
= class_binding_level
->class_shadowed
;
1787 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
1790 /* Returns non-zero if T is a virtual function table. */
1793 vtable_decl_p (t
, data
)
1795 void *data ATTRIBUTE_UNUSED
;
1797 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
1800 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1804 vtype_decl_p (t
, data
)
1806 void *data ATTRIBUTE_UNUSED
;
1808 return (TREE_CODE (t
) == TYPE_DECL
1809 && TREE_CODE (TREE_TYPE (t
)) == RECORD_TYPE
1810 && TYPE_POLYMORPHIC_P (TREE_TYPE (t
)));
1813 /* Return the declarations that are members of the namespace NS. */
1816 cp_namespace_decls (ns
)
1819 return NAMESPACE_LEVEL (ns
)->names
;
1822 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1823 itself, calling F for each. The DATA is passed to F as well. */
1826 walk_namespaces_r (namespace, f
, data
)
1828 walk_namespaces_fn f
;
1834 result
|= (*f
) (namespace, data
);
1836 for (current
= cp_namespace_decls (namespace);
1838 current
= TREE_CHAIN (current
))
1840 if (TREE_CODE (current
) != NAMESPACE_DECL
1841 || DECL_NAMESPACE_ALIAS (current
))
1843 if (!DECL_LANG_SPECIFIC (current
))
1846 my_friendly_assert (current
== std_node
, 393);
1850 /* We found a namespace. */
1851 result
|= walk_namespaces_r (current
, f
, data
);
1857 /* Walk all the namespaces, calling F for each. The DATA is passed to
1861 walk_namespaces (f
, data
)
1862 walk_namespaces_fn f
;
1865 return walk_namespaces_r (global_namespace
, f
, data
);
1868 struct walk_globals_data
{
1869 walk_globals_pred p
;
1874 /* Walk the global declarations in NAMESPACE. Whenever one is found
1875 for which P returns non-zero, call F with its address. If any call
1876 to F returns a non-zero value, return a non-zero value. */
1879 walk_globals_r (namespace, data
)
1883 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1884 walk_globals_pred p
= wgd
->p
;
1885 walk_globals_fn f
= wgd
->f
;
1886 void *d
= wgd
->data
;
1890 t
= &NAMESPACE_LEVEL (namespace)->names
;
1897 result
|= (*f
) (t
, d
);
1899 /* If F changed *T, then *T still points at the next item to
1902 t
= &TREE_CHAIN (*t
);
1908 /* Walk the global declarations. Whenever one is found for which P
1909 returns non-zero, call F with its address. If any call to F
1910 returns a non-zero value, return a non-zero value. */
1913 walk_globals (p
, f
, data
)
1914 walk_globals_pred p
;
1918 struct walk_globals_data wgd
;
1923 return walk_namespaces (walk_globals_r
, &wgd
);
1926 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1927 DATA is non-NULL, this is the last time we will call
1928 wrapup_global_declarations for this NAMESPACE. */
1931 wrapup_globals_for_namespace (namespace, data
)
1935 tree globals
= cp_namespace_decls (namespace);
1936 int len
= list_length (globals
);
1937 tree
*vec
= (tree
*) alloca (sizeof (tree
) * len
);
1941 int last_time
= (data
!= 0);
1943 if (last_time
&& namespace == global_namespace
)
1944 /* Let compile_file handle the global namespace. */
1947 /* Process the decls in reverse order--earliest first.
1948 Put them into VEC from back to front, then take out from front. */
1950 for (i
= 0, decl
= globals
; i
< len
; i
++, decl
= TREE_CHAIN (decl
))
1952 /* Pretend we've output an unused static variable. This ensures
1953 that the toplevel __FUNCTION__ etc won't be emitted, unless
1955 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_ARTIFICIAL (decl
)
1956 && !TREE_PUBLIC (decl
) && !TREE_USED (decl
))
1958 TREE_ASM_WRITTEN (decl
) = 1;
1959 DECL_IGNORED_P (decl
) = 1;
1961 vec
[len
- i
- 1] = decl
;
1966 check_global_declarations (vec
, len
);
1970 /* Temporarily mark vtables as external. That prevents
1971 wrapup_global_declarations from writing them out; we must process
1972 them ourselves in finish_vtable_vardecl. */
1973 for (i
= 0; i
< len
; ++i
)
1974 if (vtable_decl_p (vec
[i
], /*data=*/0) && !DECL_EXTERNAL (vec
[i
]))
1976 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 1;
1977 DECL_EXTERNAL (vec
[i
]) = 1;
1980 /* Write out any globals that need to be output. */
1981 result
= wrapup_global_declarations (vec
, len
);
1983 /* Undo the hack to DECL_EXTERNAL above. */
1984 for (i
= 0; i
< len
; ++i
)
1985 if (vtable_decl_p (vec
[i
], /*data=*/0)
1986 && DECL_NOT_REALLY_EXTERN (vec
[i
]))
1988 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 0;
1989 DECL_EXTERNAL (vec
[i
]) = 0;
1996 /* Mark ARG (which is really a struct binding_level **) for GC. */
1999 mark_binding_level (arg
)
2002 struct binding_level
*lvl
= *(struct binding_level
**)arg
;
2004 for (; lvl
; lvl
= lvl
->level_chain
)
2006 ggc_mark_tree (lvl
->names
);
2007 ggc_mark_tree (lvl
->tags
);
2008 ggc_mark_tree (lvl
->usings
);
2009 ggc_mark_tree (lvl
->using_directives
);
2010 ggc_mark_tree (lvl
->class_shadowed
);
2011 ggc_mark_tree (lvl
->type_shadowed
);
2012 ggc_mark_tree (lvl
->shadowed_labels
);
2013 ggc_mark_tree (lvl
->blocks
);
2014 ggc_mark_tree (lvl
->this_block
);
2015 ggc_mark_tree (lvl
->this_class
);
2016 ggc_mark_tree (lvl
->incomplete
);
2017 ggc_mark_tree (lvl
->dead_vars_from_for
);
2022 mark_named_label_lists (labs
, uses
)
2026 struct named_label_list
*l
= *(struct named_label_list
**)labs
;
2027 struct named_label_use_list
*u
= *(struct named_label_use_list
**)uses
;
2029 for (; l
; l
= l
->next
)
2032 mark_binding_level (l
->binding_level
);
2033 ggc_mark_tree (l
->old_value
);
2034 ggc_mark_tree (l
->label_decl
);
2035 ggc_mark_tree (l
->bad_decls
);
2038 for (; u
; u
= u
->next
)
2042 /* For debugging. */
2043 static int no_print_functions
= 0;
2044 static int no_print_builtins
= 0;
2047 print_binding_level (lvl
)
2048 struct binding_level
*lvl
;
2052 fprintf (stderr
, " blocks=");
2053 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
2054 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
2055 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
2056 if (lvl
->tag_transparent
)
2057 fprintf (stderr
, " tag-transparent");
2058 if (lvl
->more_cleanups_ok
)
2059 fprintf (stderr
, " more-cleanups-ok");
2060 if (lvl
->have_cleanups
)
2061 fprintf (stderr
, " have-cleanups");
2062 fprintf (stderr
, "\n");
2065 fprintf (stderr
, " names:\t");
2066 /* We can probably fit 3 names to a line? */
2067 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
2069 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
2071 if (no_print_builtins
2072 && (TREE_CODE (t
) == TYPE_DECL
)
2073 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
2076 /* Function decls tend to have longer names. */
2077 if (TREE_CODE (t
) == FUNCTION_DECL
)
2084 fprintf (stderr
, "\n\t");
2087 print_node_brief (stderr
, "", t
, 0);
2088 if (t
== error_mark_node
)
2092 fprintf (stderr
, "\n");
2096 fprintf (stderr
, " tags:\t");
2098 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
2100 if (TREE_PURPOSE (t
) == NULL_TREE
)
2102 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2109 fprintf (stderr
, "\n\t");
2112 if (TREE_PURPOSE (t
) == NULL_TREE
)
2114 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
2115 fprintf (stderr
, ">");
2117 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2118 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2121 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
2122 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2123 fprintf (stderr
, ">");
2127 fprintf (stderr
, "\n");
2129 if (lvl
->class_shadowed
)
2131 fprintf (stderr
, " class-shadowed:");
2132 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
2134 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2136 fprintf (stderr
, "\n");
2138 if (lvl
->type_shadowed
)
2140 fprintf (stderr
, " type-shadowed:");
2141 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2143 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2145 fprintf (stderr
, "\n");
2150 print_other_binding_stack (stack
)
2151 struct binding_level
*stack
;
2153 struct binding_level
*level
;
2154 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
2156 fprintf (stderr
, "binding level ");
2157 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
2158 fprintf (stderr
, "\n");
2159 print_binding_level (level
);
2164 print_binding_stack ()
2166 struct binding_level
*b
;
2167 fprintf (stderr
, "current_binding_level=");
2168 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
2169 fprintf (stderr
, "\nclass_binding_level=");
2170 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
2171 fprintf (stderr
, "\nglobal_binding_level=");
2172 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
2173 fprintf (stderr
, "\n");
2174 if (class_binding_level
)
2176 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
2177 if (b
== current_binding_level
)
2180 b
= class_binding_level
;
2182 b
= current_binding_level
;
2185 b
= current_binding_level
;
2186 print_other_binding_stack (b
);
2187 fprintf (stderr
, "global:\n");
2188 print_binding_level (global_binding_level
);
2191 /* Namespace binding access routines: The namespace_bindings field of
2192 the identifier is polymorphic, with three possible values:
2193 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2194 indicating the BINDING_VALUE of global_namespace. */
2196 /* Check whether the a binding for the name to scope is known.
2197 Assumes that the bindings of the name are already a list
2198 of bindings. Returns the binding found, or NULL_TREE. */
2201 find_binding (name
, scope
)
2205 tree iter
, prev
= NULL_TREE
;
2207 scope
= ORIGINAL_NAMESPACE (scope
);
2209 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
2210 iter
= TREE_CHAIN (iter
))
2212 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
2213 if (BINDING_SCOPE (iter
) == scope
)
2215 /* Move binding found to the front of the list, so
2216 subsequent lookups will find it faster. */
2219 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
2220 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
2221 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
2230 /* Always returns a binding for name in scope. If the
2231 namespace_bindings is not a list, convert it to one first.
2232 If no binding is found, make a new one. */
2235 binding_for_name (name
, scope
)
2239 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2242 scope
= ORIGINAL_NAMESPACE (scope
);
2244 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
2246 /* Get rid of optimization for global scope. */
2247 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
2248 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
2249 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2251 if (b
&& (result
= find_binding (name
, scope
)))
2253 /* Not found, make a new one. */
2254 result
= make_node (CPLUS_BINDING
);
2255 TREE_CHAIN (result
) = b
;
2256 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2257 BINDING_SCOPE (result
) = scope
;
2258 BINDING_TYPE (result
) = NULL_TREE
;
2259 BINDING_VALUE (result
) = NULL_TREE
;
2263 /* Return the binding value for name in scope, considering that
2264 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2267 namespace_binding (name
, scope
)
2271 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2274 if (scope
== NULL_TREE
)
2275 scope
= global_namespace
;
2276 if (TREE_CODE (b
) != CPLUS_BINDING
)
2277 return (scope
== global_namespace
) ? b
: NULL_TREE
;
2278 name
= find_binding (name
,scope
);
2279 if (name
== NULL_TREE
)
2281 return BINDING_VALUE (name
);
2284 /* Set the binding value for name in scope. If modifying the binding
2285 of global_namespace is attempted, try to optimize it. */
2288 set_namespace_binding (name
, scope
, val
)
2295 if (scope
== NULL_TREE
)
2296 scope
= global_namespace
;
2298 if (scope
== global_namespace
)
2300 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2301 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
2303 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
2307 b
= binding_for_name (name
, scope
);
2308 BINDING_VALUE (b
) = val
;
2311 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2312 select a name that is unique to this compilation unit. */
2315 push_namespace (name
)
2320 int implicit_use
= 0;
2322 if (!global_namespace
)
2324 /* This must be ::. */
2325 my_friendly_assert (name
== get_identifier ("::"), 377);
2330 /* The name of anonymous namespace is unique for the translation
2332 if (!anonymous_namespace_name
)
2333 anonymous_namespace_name
= get_file_function_name ('N');
2334 name
= anonymous_namespace_name
;
2335 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2337 /* Reopening anonymous namespace. */
2341 else if (current_namespace
== global_namespace
2342 && name
== DECL_NAME (std_node
))
2349 /* Check whether this is an extended namespace definition. */
2350 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2351 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
2354 if (DECL_NAMESPACE_ALIAS (d
))
2356 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2357 d
, DECL_NAMESPACE_ALIAS (d
));
2358 d
= DECL_NAMESPACE_ALIAS (d
);
2365 /* Make a new namespace, binding the name to it. */
2366 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
2367 /* The global namespace is not pushed, and the global binding
2368 level is set elsewhere. */
2371 DECL_CONTEXT (d
) = FROB_CONTEXT (current_namespace
);
2374 declare_namespace_level ();
2375 NAMESPACE_LEVEL (d
) = current_binding_level
;
2379 resume_binding_level (NAMESPACE_LEVEL (d
));
2382 do_using_directive (d
);
2383 /* Enter the name space. */
2384 current_namespace
= d
;
2387 /* Pop from the scope of the current namespace. */
2392 if (current_namespace
== global_namespace
)
2394 my_friendly_assert (in_std
>0, 980421);
2398 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
2399 /* The binding level is not popped, as it might be re-opened later. */
2400 suspend_binding_level ();
2403 /* Push into the scope of the namespace NS, even if it is deeply
2404 nested within another namespace. */
2407 push_nested_namespace (ns
)
2410 if (ns
== global_namespace
)
2411 push_to_top_level ();
2414 push_nested_namespace (CP_DECL_CONTEXT (ns
));
2415 push_namespace (DECL_NAME (ns
));
2419 /* Pop back from the scope of the namespace NS, which was previously
2420 entered with push_nested_namespace. */
2423 pop_nested_namespace (ns
)
2426 while (ns
!= global_namespace
)
2429 ns
= CP_DECL_CONTEXT (ns
);
2432 pop_from_top_level ();
2436 /* Subroutines for reverting temporarily to top-level for instantiation
2437 of templates and such. We actually need to clear out the class- and
2438 local-value slots of all identifiers, so that only the global values
2439 are at all visible. Simply setting current_binding_level to the global
2440 scope isn't enough, because more binding levels may be pushed. */
2441 struct saved_scope
*scope_chain
;
2443 /* Mark ST for GC. */
2447 struct stmt_tree
*st
;
2449 ggc_mark_tree (st
->x_last_stmt
);
2450 ggc_mark_tree (st
->x_last_expr_type
);
2453 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2456 mark_saved_scope (arg
)
2459 struct saved_scope
*t
= *(struct saved_scope
**)arg
;
2462 mark_binding_level (&t
->class_bindings
);
2463 ggc_mark_tree (t
->old_bindings
);
2464 ggc_mark_tree (t
->old_namespace
);
2465 ggc_mark_tree (t
->class_name
);
2466 ggc_mark_tree (t
->class_type
);
2467 ggc_mark_tree (t
->access_specifier
);
2468 ggc_mark_tree (t
->function_decl
);
2470 ggc_mark_tree_varray (t
->lang_base
);
2471 ggc_mark_tree (t
->lang_name
);
2472 ggc_mark_tree (t
->x_function_parms
);
2473 ggc_mark_tree (t
->template_parms
);
2474 ggc_mark_tree (t
->x_previous_class_type
);
2475 ggc_mark_tree (t
->x_previous_class_values
);
2476 ggc_mark_tree (t
->x_saved_tree
);
2477 ggc_mark_tree (t
->incomplete
);
2478 ggc_mark_tree (t
->lookups
);
2480 mark_stmt_tree (&t
->x_stmt_tree
);
2481 mark_binding_level (&t
->bindings
);
2487 store_bindings (names
, old_bindings
)
2488 tree names
, old_bindings
;
2491 for (t
= names
; t
; t
= TREE_CHAIN (t
))
2493 tree binding
, t1
, id
;
2495 if (TREE_CODE (t
) == TREE_LIST
)
2496 id
= TREE_PURPOSE (t
);
2501 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2502 we have no IDENTIFIER_BINDING if we have left the class
2503 scope, but cached the class-level declarations. */
2504 || !(IDENTIFIER_BINDING (id
) || IDENTIFIER_CLASS_VALUE (id
)))
2507 for (t1
= old_bindings
; t1
; t1
= TREE_CHAIN (t1
))
2508 if (TREE_VEC_ELT (t1
, 0) == id
)
2511 binding
= make_tree_vec (4);
2515 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
2516 TREE_VEC_ELT (binding
, 0) = id
;
2517 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
2518 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_BINDING (id
);
2519 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
2520 IDENTIFIER_BINDING (id
) = NULL_TREE
;
2521 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
2523 TREE_CHAIN (binding
) = old_bindings
;
2524 old_bindings
= binding
;
2528 return old_bindings
;
2532 maybe_push_to_top_level (pseudo
)
2535 struct saved_scope
*s
;
2536 struct binding_level
*b
;
2540 s
= (struct saved_scope
*) xcalloc (1, sizeof (struct saved_scope
));
2542 b
= scope_chain
? current_binding_level
: 0;
2544 /* If we're in the middle of some function, save our state. */
2548 push_function_context_to (NULL_TREE
);
2553 old_bindings
= NULL_TREE
;
2554 if (scope_chain
&& previous_class_type
)
2555 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
2557 /* Have to include global_binding_level, because class-level decls
2558 aren't listed anywhere useful. */
2559 for (; b
; b
= b
->level_chain
)
2563 /* Template IDs are inserted into the global level. If they were
2564 inserted into namespace level, finish_file wouldn't find them
2565 when doing pending instantiations. Therefore, don't stop at
2566 namespace level, but continue until :: . */
2567 if (b
== global_binding_level
|| (pseudo
&& b
->template_parms_p
))
2570 old_bindings
= store_bindings (b
->names
, old_bindings
);
2571 /* We also need to check class_shadowed to save class-level type
2572 bindings, since pushclass doesn't fill in b->names. */
2573 if (b
->parm_flag
== 2)
2574 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2576 /* Unwind type-value slots back to top level. */
2577 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2578 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2580 s
->prev
= scope_chain
;
2581 s
->old_bindings
= old_bindings
;
2583 s
->need_pop_function_context
= need_pop
;
2584 s
->function_decl
= current_function_decl
;
2587 current_function_decl
= NULL_TREE
;
2588 VARRAY_TREE_INIT (current_lang_base
, 10, "current_lang_base");
2589 current_lang_stack
= &VARRAY_TREE (current_lang_base
, 0);
2590 current_lang_name
= lang_name_cplusplus
;
2591 current_namespace
= global_namespace
;
2595 push_to_top_level ()
2597 maybe_push_to_top_level (0);
2601 pop_from_top_level ()
2603 struct saved_scope
*s
= scope_chain
;
2606 /* Clear out class-level bindings cache. */
2607 if (previous_class_type
)
2608 invalidate_class_lookup_cache ();
2610 VARRAY_FREE (current_lang_base
);
2612 scope_chain
= s
->prev
;
2613 for (t
= s
->old_bindings
; t
; t
= TREE_CHAIN (t
))
2615 tree id
= TREE_VEC_ELT (t
, 0);
2618 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2619 IDENTIFIER_BINDING (id
) = TREE_VEC_ELT (t
, 2);
2620 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2624 /* If we were in the middle of compiling a function, restore our
2626 if (s
->need_pop_function_context
)
2627 pop_function_context_from (NULL_TREE
);
2628 current_function_decl
= s
->function_decl
;
2633 /* Push a definition of struct, union or enum tag "name".
2634 into binding_level "b". "type" should be the type node,
2635 We assume that the tag "name" is not already defined.
2637 Note that the definition may really be just a forward reference.
2638 In that case, the TYPE_SIZE will be a NULL_TREE.
2640 C++ gratuitously puts all these tags in the name space. */
2642 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2643 record the shadowed value for this binding contour. TYPE is
2644 the type that ID maps to. */
2647 set_identifier_type_value_with_scope (id
, type
, b
)
2650 struct binding_level
*b
;
2652 if (!b
->namespace_p
)
2654 /* Shadow the marker, not the real thing, so that the marker
2655 gets restored later. */
2656 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2658 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2662 tree binding
= binding_for_name (id
, current_namespace
);
2663 BINDING_TYPE (binding
) = type
;
2664 /* Store marker instead of real type. */
2665 type
= global_type_node
;
2667 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2670 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2673 set_identifier_type_value (id
, type
)
2677 set_identifier_type_value_with_scope (id
, type
, current_binding_level
);
2680 /* Return the type associated with id. */
2683 identifier_type_value (id
)
2686 /* There is no type with that name, anywhere. */
2687 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2689 /* This is not the type marker, but the real thing. */
2690 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2691 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2692 /* Have to search for it. It must be on the global level, now.
2693 Ask lookup_name not to return non-types. */
2694 id
= lookup_name_real (id
, 2, 1, 0);
2696 return TREE_TYPE (id
);
2700 /* Pop off extraneous binding levels left over due to syntax errors.
2702 We don't pop past namespaces, as they might be valid. */
2707 #ifdef DEBUG_CP_BINDING_LEVELS
2708 fprintf (stderr
, "XXX entering pop_everything ()\n");
2710 while (!toplevel_bindings_p ())
2712 if (current_binding_level
->parm_flag
== 2)
2713 pop_nested_class ();
2717 #ifdef DEBUG_CP_BINDING_LEVELS
2718 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2722 /* The type TYPE is being declared. If it is a class template, or a
2723 specialization of a class template, do any processing required and
2724 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2725 being declared a friend. B is the binding level at which this TYPE
2728 Returns the TYPE_DECL for TYPE, which may have been altered by this
2732 maybe_process_template_type_declaration (type
, globalize
, b
)
2735 struct binding_level
* b
;
2737 tree decl
= TYPE_NAME (type
);
2739 if (processing_template_parmlist
)
2740 /* You can't declare a new template type in a template parameter
2741 list. But, you can declare a non-template type:
2743 template <class A*> struct S;
2745 is a forward-declaration of `A'. */
2749 maybe_check_template_type (type
);
2751 my_friendly_assert (IS_AGGR_TYPE (type
)
2752 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2755 if (processing_template_decl
)
2757 /* This may change after the call to
2758 push_template_decl_real, but we want the original value. */
2759 tree name
= DECL_NAME (decl
);
2761 decl
= push_template_decl_real (decl
, globalize
);
2762 /* If the current binding level is the binding level for the
2763 template parameters (see the comment in
2764 begin_template_parm_list) and the enclosing level is a class
2765 scope, and we're not looking at a friend, push the
2766 declaration of the member class into the class scope. In the
2767 friend case, push_template_decl will already have put the
2768 friend into global scope, if appropriate. */
2769 if (TREE_CODE (type
) != ENUMERAL_TYPE
2770 && !globalize
&& b
->template_parms_p
2771 && b
->level_chain
->parm_flag
== 2)
2773 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2774 /* Put this tag on the list of tags for the class, since
2775 that won't happen below because B is not the class
2776 binding level, but is instead the pseudo-global level. */
2777 b
->level_chain
->tags
=
2778 tree_cons (name
, type
, b
->level_chain
->tags
);
2779 if (!COMPLETE_TYPE_P (current_class_type
))
2780 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2788 /* In C++, you don't have to write `struct S' to refer to `S'; you
2789 can just use `S'. We accomplish this by creating a TYPE_DECL as
2790 if the user had written `typedef struct S S'. Create and return
2791 the TYPE_DECL for TYPE. */
2794 create_implicit_typedef (name
, type
)
2800 decl
= build_decl (TYPE_DECL
, name
, type
);
2801 DECL_ARTIFICIAL (decl
) = 1;
2802 /* There are other implicit type declarations, like the one *within*
2803 a class that allows you to write `S::S'. We must distinguish
2805 SET_DECL_IMPLICIT_TYPEDEF_P (decl
);
2806 TYPE_NAME (type
) = decl
;
2811 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2812 Normally put it into the inner-most non-tag-transparent scope,
2813 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2814 The latter is needed for implicit declarations. */
2817 pushtag (name
, type
, globalize
)
2821 register struct binding_level
*b
;
2823 b
= current_binding_level
;
2824 while (b
->tag_transparent
2825 || (globalize
&& b
->parm_flag
== 2))
2828 b
->tags
= tree_cons (name
, type
, b
->tags
);
2832 /* Do C++ gratuitous typedefing. */
2833 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2835 register tree d
= NULL_TREE
;
2837 tree context
= TYPE_CONTEXT (type
);
2841 tree cs
= current_scope ();
2845 else if (cs
!= NULL_TREE
&& TYPE_P (cs
))
2846 /* When declaring a friend class of a local class, we want
2847 to inject the newly named class into the scope
2848 containing the local class, not the namespace scope. */
2849 context
= decl_function_context (get_type_decl (cs
));
2852 context
= current_namespace
;
2854 if ((b
->template_parms_p
&& b
->level_chain
->parm_flag
== 2)
2855 || b
->parm_flag
== 2)
2858 if (current_lang_name
== lang_name_java
)
2859 TYPE_FOR_JAVA (type
) = 1;
2861 d
= create_implicit_typedef (name
, type
);
2862 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2864 set_identifier_type_value_with_scope (name
, type
, b
);
2866 d
= maybe_process_template_type_declaration (type
,
2869 if (b
->parm_flag
== 2)
2871 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2872 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2873 class. But if it's a member template class, we
2874 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2876 finish_member_declaration (d
);
2878 pushdecl_class_level (d
);
2881 d
= pushdecl_with_scope (d
, b
);
2883 if (ANON_AGGRNAME_P (name
))
2884 DECL_IGNORED_P (d
) = 1;
2886 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2887 DECL_ASSEMBLER_NAME (d
) = DECL_NAME (d
);
2889 /* If this is a local class, keep track of it. We need this
2890 information for name-mangling, and so that it is possible to find
2891 all function definitions in a translation unit in a convenient
2892 way. (It's otherwise tricky to find a member function definition
2893 it's only pointed to from within a local class.) */
2894 if (TYPE_CONTEXT (type
)
2895 && TREE_CODE (TYPE_CONTEXT (type
)) == FUNCTION_DECL
2896 && !processing_template_decl
)
2897 VARRAY_PUSH_TREE (local_classes
, type
);
2899 if (!uses_template_parms (type
))
2902 DECL_ASSEMBLER_NAME (d
) = mangle_type (type
);
2904 DECL_ASSEMBLER_NAME (d
)
2905 = get_identifier (build_overload_name (type
, 1, 1));
2908 if (b
->parm_flag
== 2)
2910 if (!COMPLETE_TYPE_P (current_class_type
))
2911 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2915 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2916 /* Use the canonical TYPE_DECL for this node. */
2917 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2920 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2921 will be the tagged type we just added to the current
2922 binding level. This fake NULL-named TYPE_DECL node helps
2923 dwarfout.c to know when it needs to output a
2924 representation of a tagged type, and it also gives us a
2925 convenient place to record the "scope start" address for
2928 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2929 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2933 /* Counter used to create anonymous type names. */
2935 static int anon_cnt
= 0;
2937 /* Return an IDENTIFIER which can be used as a name for
2938 anonymous structs and unions. */
2945 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2946 return get_identifier (buf
);
2949 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2950 This keeps dbxout from getting confused. */
2955 register struct binding_level
*b
;
2957 static int last_cnt
= 0;
2959 /* Fast out if no new anon names were declared. */
2960 if (last_cnt
== anon_cnt
)
2963 b
= current_binding_level
;
2964 while (b
->tag_transparent
)
2969 /* A NULL purpose means we have already processed all tags
2970 from here to the end of the list. */
2971 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2973 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2974 TREE_PURPOSE (tags
) = NULL_TREE
;
2975 tags
= TREE_CHAIN (tags
);
2977 last_cnt
= anon_cnt
;
2980 /* Subroutine of duplicate_decls: return truthvalue of whether
2981 or not types of these decls match.
2983 For C++, we must compare the parameter list so that `int' can match
2984 `int&' in a parameter position, but `int&' is not confused with
2988 decls_match (newdecl
, olddecl
)
2989 tree newdecl
, olddecl
;
2993 if (newdecl
== olddecl
)
2996 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
2997 /* If the two DECLs are not even the same kind of thing, we're not
2998 interested in their types. */
3001 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3003 tree f1
= TREE_TYPE (newdecl
);
3004 tree f2
= TREE_TYPE (olddecl
);
3005 tree p1
= TYPE_ARG_TYPES (f1
);
3006 tree p2
= TYPE_ARG_TYPES (f2
);
3008 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
)
3009 && ! (DECL_EXTERN_C_P (newdecl
)
3010 && DECL_EXTERN_C_P (olddecl
)))
3013 if (TREE_CODE (f1
) != TREE_CODE (f2
))
3016 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
3018 if (p2
== NULL_TREE
&& DECL_EXTERN_C_P (olddecl
)
3019 && (DECL_BUILT_IN (olddecl
)
3020 #ifndef NO_IMPLICIT_EXTERN_C
3021 || (DECL_IN_SYSTEM_HEADER (newdecl
) && !DECL_CLASS_SCOPE_P (newdecl
))
3022 || (DECL_IN_SYSTEM_HEADER (olddecl
) && !DECL_CLASS_SCOPE_P (olddecl
))
3026 types_match
= self_promoting_args_p (p1
);
3027 if (p1
== void_list_node
)
3028 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
3030 #ifndef NO_IMPLICIT_EXTERN_C
3031 else if (p1
== NULL_TREE
3032 && (DECL_EXTERN_C_P (olddecl
)
3033 && DECL_IN_SYSTEM_HEADER (olddecl
)
3034 && !DECL_CLASS_SCOPE_P (olddecl
))
3035 && (DECL_EXTERN_C_P (newdecl
)
3036 && DECL_IN_SYSTEM_HEADER (newdecl
)
3037 && !DECL_CLASS_SCOPE_P (newdecl
)))
3039 types_match
= self_promoting_args_p (p2
);
3040 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
3044 types_match
= compparms (p1
, p2
);
3049 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3051 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3052 DECL_TEMPLATE_PARMS (olddecl
)))
3055 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
))
3056 != TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)))
3059 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3062 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
3063 DECL_TEMPLATE_RESULT (newdecl
));
3067 if (TREE_TYPE (newdecl
) == error_mark_node
)
3068 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
3069 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
3070 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
3071 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
3074 types_match
= comptypes (TREE_TYPE (newdecl
),
3075 TREE_TYPE (olddecl
),
3076 COMPARE_REDECLARATION
);
3082 /* If NEWDECL is `static' and an `extern' was seen previously,
3083 warn about it. OLDDECL is the previous declaration.
3085 Note that this does not apply to the C++ case of declaring
3086 a variable `extern const' and then later `const'.
3088 Don't complain about built-in functions, since they are beyond
3089 the user's control. */
3092 warn_extern_redeclared_static (newdecl
, olddecl
)
3093 tree newdecl
, olddecl
;
3095 static const char *explicit_extern_static_warning
3096 = "`%D' was declared `extern' and later `static'";
3097 static const char *implicit_extern_static_warning
3098 = "`%D' was declared implicitly `extern' and later `static'";
3102 if (TREE_CODE (newdecl
) == TYPE_DECL
3103 || TREE_CODE (newdecl
) == TEMPLATE_DECL
3104 || TREE_CODE (newdecl
) == CONST_DECL
)
3107 /* Don't get confused by static member functions; that's a different
3109 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3110 && DECL_STATIC_FUNCTION_P (newdecl
))
3113 /* If the old declaration was `static', or the new one isn't, then
3114 then everything is OK. */
3115 if (DECL_THIS_STATIC (olddecl
) || !DECL_THIS_STATIC (newdecl
))
3118 /* It's OK to declare a builtin function as `static'. */
3119 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3120 && DECL_ARTIFICIAL (olddecl
))
3123 name
= DECL_ASSEMBLER_NAME (newdecl
);
3124 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
3125 ? implicit_extern_static_warning
3126 : explicit_extern_static_warning
, newdecl
);
3127 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
3130 /* Handle when a new declaration NEWDECL has the same name as an old
3131 one OLDDECL in the same binding contour. Prints an error message
3134 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
3135 Otherwise, return 0. */
3138 duplicate_decls (newdecl
, olddecl
)
3139 tree newdecl
, olddecl
;
3141 unsigned olddecl_uid
= DECL_UID (olddecl
);
3142 int olddecl_friend
= 0, types_match
= 0;
3143 int new_defines_function
= 0;
3145 if (newdecl
== olddecl
)
3148 types_match
= decls_match (newdecl
, olddecl
);
3150 /* If either the type of the new decl or the type of the old decl is an
3151 error_mark_node, then that implies that we have already issued an
3152 error (earlier) for some bogus type specification, and in that case,
3153 it is rather pointless to harass the user with yet more error message
3154 about the same declaration, so just pretend the types match here. */
3155 if (TREE_TYPE (newdecl
) == error_mark_node
3156 || TREE_TYPE (olddecl
) == error_mark_node
)
3159 /* Check for redeclaration and other discrepancies. */
3160 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3161 && DECL_ARTIFICIAL (olddecl
))
3163 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
3165 /* If you declare a built-in or predefined function name as static,
3166 the old definition is overridden, but optionally warn this was a
3167 bad choice of name. */
3168 if (! TREE_PUBLIC (newdecl
))
3171 cp_warning ("shadowing %s function `%#D'",
3172 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3174 /* Discard the old built-in function. */
3177 /* If the built-in is not ansi, then programs can override
3178 it even globally without an error. */
3179 else if (! DECL_BUILT_IN (olddecl
))
3180 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
3184 cp_error ("declaration of `%#D'", newdecl
);
3185 cp_error ("conflicts with built-in declaration `%#D'",
3190 else if (!types_match
)
3192 if ((DECL_EXTERN_C_P (newdecl
)
3193 && DECL_EXTERN_C_P (olddecl
))
3194 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3195 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3197 /* A near match; override the builtin. */
3199 if (TREE_PUBLIC (newdecl
))
3201 cp_warning ("new declaration `%#D'", newdecl
);
3202 cp_warning ("ambiguates built-in declaration `%#D'",
3205 else if (warn_shadow
)
3206 cp_warning ("shadowing %s function `%#D'",
3207 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3211 /* Discard the old built-in function. */
3215 if (DECL_THIS_STATIC (newdecl
) && !DECL_THIS_STATIC (olddecl
))
3217 /* If a builtin function is redeclared as `static', merge
3218 the declarations, but make the original one static. */
3219 DECL_THIS_STATIC (olddecl
) = 1;
3220 TREE_PUBLIC (olddecl
) = 0;
3222 /* Make the old declaration consistent with the new one so
3223 that all remnants of the builtin-ness of this function
3224 will be banished. */
3225 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3226 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3227 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3228 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (newdecl
),
3232 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3234 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3235 && TREE_CODE (newdecl
) != TYPE_DECL
3236 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3237 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3238 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3239 && TREE_CODE (olddecl
) != TYPE_DECL
3240 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3241 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3244 /* We do nothing special here, because C++ does such nasty
3245 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3246 get shadowed, and know that if we need to find a TYPE_DECL
3247 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3248 slot of the identifier. */
3252 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3253 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3254 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3255 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3258 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
3259 if (TREE_CODE (olddecl
) == TREE_LIST
)
3260 olddecl
= TREE_VALUE (olddecl
);
3261 cp_error_at ("previous declaration of `%#D'", olddecl
);
3263 /* New decl is completely inconsistent with the old one =>
3264 tell caller to replace the old one. */
3268 else if (!types_match
)
3270 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
))
3271 /* These are certainly not duplicate declarations; they're
3272 from different scopes. */
3275 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3277 /* The name of a class template may not be declared to refer to
3278 any other template, class, function, object, namespace, value,
3279 or type in the same scope. */
3280 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3281 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3283 cp_error ("declaration of template `%#D'", newdecl
);
3284 cp_error_at ("conflicts with previous declaration `%#D'",
3287 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3288 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3289 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3290 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3291 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3292 DECL_TEMPLATE_PARMS (olddecl
)))
3294 cp_error ("new declaration `%#D'", newdecl
);
3295 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3299 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3301 if (DECL_EXTERN_C_P (newdecl
) && DECL_EXTERN_C_P (olddecl
))
3303 cp_error ("declaration of C function `%#D' conflicts with",
3305 cp_error_at ("previous declaration `%#D' here", olddecl
);
3307 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3308 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3310 cp_error ("new declaration `%#D'", newdecl
);
3311 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3317 /* Already complained about this, so don't do so again. */
3318 else if (current_class_type
== NULL_TREE
3319 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3321 cp_error ("conflicting types for `%#D'", newdecl
);
3322 cp_error_at ("previous declaration as `%#D'", olddecl
);
3325 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3326 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3327 && (!DECL_TEMPLATE_INFO (newdecl
)
3328 || (DECL_TI_TEMPLATE (newdecl
)
3329 != DECL_TI_TEMPLATE (olddecl
))))
3330 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3331 && (!DECL_TEMPLATE_INFO (olddecl
)
3332 || (DECL_TI_TEMPLATE (olddecl
)
3333 != DECL_TI_TEMPLATE (newdecl
))))))
3334 /* It's OK to have a template specialization and a non-template
3335 with the same type, or to have specializations of two
3336 different templates with the same type. Note that if one is a
3337 specialization, and the other is an instantiation of the same
3338 template, that we do not exit at this point. That situation
3339 can occur if we instantiate a template class, and then
3340 specialize one of its methods. This situation is legal, but
3341 the declarations must be merged in the usual way. */
3343 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3344 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3345 && !DECL_USE_TEMPLATE (newdecl
))
3346 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3347 && !DECL_USE_TEMPLATE (olddecl
))))
3348 /* One of the declarations is a template instantiation, and the
3349 other is not a template at all. That's OK. */
3351 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3352 && DECL_NAMESPACE_ALIAS (newdecl
)
3353 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3354 /* Redeclaration of namespace alias, ignore it. */
3358 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3361 cp_error (errmsg
, newdecl
);
3362 if (DECL_NAME (olddecl
) != NULL_TREE
)
3363 cp_error_at ((DECL_INITIAL (olddecl
)
3364 && namespace_bindings_p ())
3365 ? "`%#D' previously defined here"
3366 : "`%#D' previously declared here", olddecl
);
3368 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3369 && DECL_INITIAL (olddecl
) != NULL_TREE
3370 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3371 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3373 /* Prototype decl follows defn w/o prototype. */
3374 cp_warning_at ("prototype for `%#D'", newdecl
);
3375 cp_warning_at ("follows non-prototype definition here", olddecl
);
3377 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3378 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3380 /* extern "C" int foo ();
3381 int foo () { bar (); }
3383 if (current_lang_stack
3384 == &VARRAY_TREE (current_lang_base
, 0))
3385 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3388 cp_error_at ("previous declaration of `%#D' with %L linkage",
3389 olddecl
, DECL_LANGUAGE (olddecl
));
3390 cp_error ("conflicts with new declaration with %L linkage",
3391 DECL_LANGUAGE (newdecl
));
3395 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3397 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3399 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3400 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3403 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3404 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3406 for (; t1
&& t1
!= void_list_node
;
3407 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3408 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3410 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3415 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3417 cp_pedwarn_at ("after previous specification in `%#D'",
3423 cp_error ("default argument given for parameter %d of `%#D'",
3425 cp_error_at ("after previous specification in `%#D'",
3430 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
3431 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3433 cp_warning ("`%#D' was used before it was declared inline",
3435 cp_warning_at ("previous non-inline declaration here",
3441 /* If new decl is `static' and an `extern' was seen previously,
3443 warn_extern_redeclared_static (newdecl
, olddecl
);
3445 /* We have committed to returning 1 at this point. */
3446 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3448 /* Now that functions must hold information normally held
3449 by field decls, there is extra work to do so that
3450 declaration information does not get destroyed during
3452 if (DECL_VINDEX (olddecl
))
3453 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3454 if (DECL_VIRTUAL_CONTEXT (olddecl
))
3455 DECL_VIRTUAL_CONTEXT (newdecl
) = DECL_VIRTUAL_CONTEXT (olddecl
);
3456 if (DECL_CONTEXT (olddecl
))
3457 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3458 if (DECL_PENDING_INLINE_INFO (newdecl
) == (struct pending_inline
*)0)
3459 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3460 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3461 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3462 DECL_PURE_VIRTUAL_P (newdecl
) |= DECL_PURE_VIRTUAL_P (olddecl
);
3463 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3464 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3465 DECL_THIS_STATIC (newdecl
) |= DECL_THIS_STATIC (olddecl
);
3466 DECL_LANG_SPECIFIC (newdecl
)->u2
= DECL_LANG_SPECIFIC (olddecl
)->u2
;
3467 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3469 /* Optionally warn about more than one declaration for the same
3470 name, but don't warn about a function declaration followed by a
3472 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3473 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3474 /* Don't warn about extern decl followed by definition. */
3475 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3476 /* Don't warn about friends, let add_friend take care of it. */
3477 && ! DECL_FRIEND_P (newdecl
))
3479 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3480 cp_warning_at ("previous declaration of `%D'", olddecl
);
3484 /* Deal with C++: must preserve virtual function table size. */
3485 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3487 register tree newtype
= TREE_TYPE (newdecl
);
3488 register tree oldtype
= TREE_TYPE (olddecl
);
3490 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3491 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3493 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3494 CLASSTYPE_FRIEND_CLASSES (newtype
)
3495 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3498 DECL_ORIGINAL_TYPE (newdecl
) = DECL_ORIGINAL_TYPE (olddecl
);
3501 /* Copy all the DECL_... slots specified in the new decl
3502 except for any that we copy here from the old type. */
3503 DECL_MACHINE_ATTRIBUTES (newdecl
)
3504 = merge_machine_decl_attributes (olddecl
, newdecl
);
3506 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3508 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3509 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3510 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3511 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3518 /* Automatically handles default parameters. */
3519 tree oldtype
= TREE_TYPE (olddecl
);
3522 /* Merge the data types specified in the two decls. */
3523 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3525 if (TREE_CODE (newdecl
) == VAR_DECL
)
3526 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3527 /* Do this after calling `common_type' so that default
3528 parameters don't confuse us. */
3529 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3530 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3531 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3533 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3534 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3535 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3536 TYPE_RAISES_EXCEPTIONS (oldtype
));
3538 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3539 && DECL_SOURCE_LINE (olddecl
) != 0
3541 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
3542 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
3544 cp_error ("declaration of `%F' throws different exceptions",
3546 cp_error_at ("than previous declaration `%F'", olddecl
);
3549 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3551 /* Lay the type out, unless already done. */
3552 if (! same_type_p (newtype
, oldtype
)
3553 && TREE_TYPE (newdecl
) != error_mark_node
3554 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3555 layout_type (TREE_TYPE (newdecl
));
3557 if ((TREE_CODE (newdecl
) == VAR_DECL
3558 || TREE_CODE (newdecl
) == PARM_DECL
3559 || TREE_CODE (newdecl
) == RESULT_DECL
3560 || TREE_CODE (newdecl
) == FIELD_DECL
3561 || TREE_CODE (newdecl
) == TYPE_DECL
)
3562 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3563 layout_decl (newdecl
, 0);
3565 /* Merge the type qualifiers. */
3566 if (TREE_READONLY (newdecl
))
3567 TREE_READONLY (olddecl
) = 1;
3568 if (TREE_THIS_VOLATILE (newdecl
))
3569 TREE_THIS_VOLATILE (olddecl
) = 1;
3571 /* Merge the initialization information. */
3572 if (DECL_INITIAL (newdecl
) == NULL_TREE
3573 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3575 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3576 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3577 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3578 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
3579 && DECL_LANG_SPECIFIC (newdecl
)
3580 && DECL_LANG_SPECIFIC (olddecl
))
3581 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3584 /* Merge the section attribute.
3585 We want to issue an error if the sections conflict but that must be
3586 done later in decl_attributes since we are called before attributes
3588 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3589 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3591 /* Keep the old rtl since we can safely use it. */
3592 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3594 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3596 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (newdecl
)
3597 |= DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (olddecl
);
3598 DECL_NO_CHECK_MEMORY_USAGE (newdecl
)
3599 |= DECL_NO_CHECK_MEMORY_USAGE (olddecl
);
3600 DECL_NO_LIMIT_STACK (newdecl
)
3601 |= DECL_NO_LIMIT_STACK (olddecl
);
3604 /* If cannot merge, then use the new type and qualifiers,
3605 and don't preserve the old rtl. */
3608 /* Clean out any memory we had of the old declaration. */
3609 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3611 TREE_VALUE (oldstatic
) = error_mark_node
;
3613 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3614 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3615 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3616 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3619 /* Merge the storage class information. */
3620 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3621 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3622 DECL_DEFER_OUTPUT (newdecl
) |= DECL_DEFER_OUTPUT (olddecl
);
3623 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3624 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3625 if (! DECL_EXTERNAL (olddecl
))
3626 DECL_EXTERNAL (newdecl
) = 0;
3628 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3630 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3631 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3632 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3633 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3634 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3635 /* Don't really know how much of the language-specific
3636 values we should copy from old to new. */
3637 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3638 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3639 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3640 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3641 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3643 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3644 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3645 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3646 DECL_BEFRIENDING_CLASSES (newdecl
)
3647 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3648 DECL_BEFRIENDING_CLASSES (olddecl
));
3651 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3653 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3654 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3656 /* If newdecl is not a specialization, then it is not a
3657 template-related function at all. And that means that we
3658 shoud have exited above, returning 0. */
3659 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3662 if (TREE_USED (olddecl
))
3663 /* From [temp.expl.spec]:
3665 If a template, a member template or the member of a class
3666 template is explicitly specialized then that
3667 specialization shall be declared before the first use of
3668 that specialization that would cause an implicit
3669 instantiation to take place, in every translation unit in
3670 which such a use occurs. */
3671 cp_error ("explicit specialization of %D after first use",
3674 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3676 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3678 /* If either decl says `inline', this fn is inline, unless its
3679 definition was passed already. */
3680 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3681 DECL_INLINE (olddecl
) = 1;
3682 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3686 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3687 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3688 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3690 if (! types_match
|| new_defines_function
)
3692 /* These need to be copied so that the names are available.
3693 Note that if the types do match, we'll preserve inline
3694 info and other bits, but if not, we won't. */
3695 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3696 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3698 if (new_defines_function
)
3699 /* If defining a function declared with other language
3700 linkage, use the previously declared language linkage. */
3701 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3702 else if (types_match
)
3704 /* If redeclaring a builtin function, and not a definition,
3705 it stays built in. */
3706 if (DECL_BUILT_IN (olddecl
))
3708 DECL_BUILT_IN_CLASS (newdecl
) = DECL_BUILT_IN_CLASS (olddecl
);
3709 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3710 /* If we're keeping the built-in definition, keep the rtl,
3711 regardless of declaration matches. */
3712 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3715 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3717 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3718 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3719 /* Previously saved insns go together with
3720 the function's previous definition. */
3721 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3722 /* Don't clear out the arguments if we're redefining a function. */
3723 if (DECL_ARGUMENTS (olddecl
))
3724 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3728 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3730 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3733 /* Now preserve various other info from the definition. */
3734 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3735 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3736 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3737 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3739 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3743 function_size
= sizeof (struct tree_decl
);
3745 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3746 (char *) olddecl
+ sizeof (struct tree_common
),
3747 function_size
- sizeof (struct tree_common
));
3749 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3751 /* If newdecl is a template instantiation, it is possible that
3752 the following sequence of events has occurred:
3754 o A friend function was declared in a class template. The
3755 class template was instantiated.
3757 o The instantiation of the friend declaration was
3758 recorded on the instantiation list, and is newdecl.
3760 o Later, however, instantiate_class_template called pushdecl
3761 on the newdecl to perform name injection. But, pushdecl in
3762 turn called duplicate_decls when it discovered that another
3763 declaration of a global function with the same name already
3766 o Here, in duplicate_decls, we decided to clobber newdecl.
3768 If we're going to do that, we'd better make sure that
3769 olddecl, and not newdecl, is on the list of
3770 instantiations so that if we try to do the instantiation
3771 again we won't get the clobbered declaration. */
3773 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3774 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3776 for (; decls
; decls
= TREE_CHAIN (decls
))
3777 if (TREE_VALUE (decls
) == newdecl
)
3778 TREE_VALUE (decls
) = olddecl
;
3783 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3784 (char *) olddecl
+ sizeof (struct tree_common
),
3785 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3786 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3789 DECL_UID (olddecl
) = olddecl_uid
;
3791 DECL_FRIEND_P (olddecl
) = 1;
3793 /* NEWDECL contains the merged attribute lists.
3794 Update OLDDECL to be the same. */
3795 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3800 /* Record a decl-node X as belonging to the current lexical scope.
3801 Check for errors (such as an incompatible declaration for the same
3802 name already seen in the same scope).
3804 Returns either X or an old decl for the same name.
3805 If an old decl is returned, it may have been smashed
3806 to agree with what X says. */
3814 int need_new_binding
;
3816 /* We shouldn't be calling pushdecl when we're generating RTL for a
3817 function that we already did semantic analysis on previously. */
3818 my_friendly_assert (!cfun
|| doing_semantic_analysis_p (),
3821 need_new_binding
= 1;
3823 if (DECL_TEMPLATE_PARM_P (x
))
3824 /* Template parameters have no context; they are not X::T even
3825 when declared within a class or namespace. */
3829 if (current_function_decl
&& x
!= current_function_decl
3830 /* A local declaration for a function doesn't constitute
3832 && !(TREE_CODE (x
) == FUNCTION_DECL
&& !DECL_INITIAL (x
))
3833 /* A local declaration for an `extern' variable is in the
3834 scoped of the current namespace, not the current
3836 && !(TREE_CODE (x
) == VAR_DECL
&& DECL_EXTERNAL (x
))
3837 && !DECL_CONTEXT (x
))
3838 DECL_CONTEXT (x
) = current_function_decl
;
3840 /* If this is the declaration for a namespace-scope function,
3841 but the declaration itself is in a local scope, mark the
3843 if (TREE_CODE (x
) == FUNCTION_DECL
3844 && DECL_NAMESPACE_SCOPE_P (x
)
3845 && current_function_decl
3846 && x
!= current_function_decl
)
3847 DECL_LOCAL_FUNCTION_P (x
) = 1;
3850 name
= DECL_NAME (x
);
3854 /* Not needed...see below. */
3858 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3859 name
= TREE_OPERAND (name
, 0);
3861 /* Namespace-scoped variables are not found in the current level. */
3862 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
))
3863 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3865 t
= lookup_name_current_level (name
);
3867 /* If we are declaring a function, and the result of name-lookup
3868 was an OVERLOAD, look for an overloaded instance that is
3869 actually the same as the function we are declaring. (If
3870 there is one, we have to merge our declaration with the
3871 previous declaration.) */
3872 if (t
&& TREE_CODE (t
) == OVERLOAD
)
3876 if (TREE_CODE (x
) == FUNCTION_DECL
)
3877 for (match
= t
; match
; match
= OVL_NEXT (match
))
3879 if (DECL_ASSEMBLER_NAME (OVL_CURRENT (t
))
3880 == DECL_ASSEMBLER_NAME (x
))
3884 /* Just choose one. */
3888 t
= OVL_CURRENT (match
);
3893 if (t
== error_mark_node
)
3895 /* error_mark_node is 0 for a while during initialization! */
3897 cp_error_at ("`%#D' used prior to declaration", x
);
3899 else if (t
!= NULL_TREE
)
3901 if (TREE_CODE (t
) == PARM_DECL
)
3903 if (DECL_CONTEXT (t
) == NULL_TREE
)
3904 fatal ("parse errors have confused me too much");
3906 /* Check for duplicate params. */
3907 if (duplicate_decls (x
, t
))
3910 else if ((DECL_EXTERN_C_FUNCTION_P (x
)
3911 || DECL_FUNCTION_TEMPLATE_P (x
))
3912 && is_overloaded_fn (t
))
3913 /* Don't do anything just yet. */;
3914 else if (t
== wchar_decl_node
)
3916 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3917 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3919 /* Throw away the redeclaration. */
3922 else if (TREE_CODE (t
) != TREE_CODE (x
))
3924 if (duplicate_decls (x
, t
))
3927 else if (duplicate_decls (x
, t
))
3929 if (TREE_CODE (t
) == TYPE_DECL
)
3930 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3931 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3932 check_default_args (t
);
3936 else if (DECL_MAIN_P (x
))
3938 /* A redeclaration of main, but not a duplicate of the
3943 This function shall not be overloaded. */
3944 cp_error_at ("invalid redeclaration of `%D'", t
);
3945 cp_error ("as `%D'", x
);
3946 /* We don't try to push this declaration since that
3952 check_template_shadow (x
);
3954 /* If this is a function conjured up by the backend, massage it
3955 so it looks friendly. */
3956 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_LANG_SPECIFIC (x
))
3958 retrofit_lang_decl (x
);
3959 DECL_LANGUAGE (x
) = lang_c
;
3962 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_FUNCTION_MEMBER_P (x
))
3964 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
3967 if (!namespace_bindings_p ())
3968 /* We do not need to create a binding for this name;
3969 push_overloaded_decl will have already done so if
3971 need_new_binding
= 0;
3973 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3975 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
3977 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
3981 /* If declaring a type as a typedef, copy the type (unless we're
3982 at line 0), and install this TYPE_DECL as the new type's typedef
3983 name. See the extensive comment in ../c-decl.c (pushdecl). */
3984 if (TREE_CODE (x
) == TYPE_DECL
)
3986 tree type
= TREE_TYPE (x
);
3987 if (DECL_SOURCE_LINE (x
) == 0)
3989 if (TYPE_NAME (type
) == 0)
3990 TYPE_NAME (type
) = x
;
3992 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
3993 /* We don't want to copy the type when all we're
3994 doing is making a TYPE_DECL for the purposes of
3996 && (!TYPE_NAME (type
)
3997 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
3999 DECL_ORIGINAL_TYPE (x
) = type
;
4000 type
= build_type_copy (type
);
4001 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
4002 TYPE_NAME (type
) = x
;
4003 TREE_TYPE (x
) = type
;
4006 if (type
!= error_mark_node
4008 && TYPE_IDENTIFIER (type
))
4009 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
4010 current_binding_level
);
4014 /* Multiple external decls of the same identifier ought to match.
4016 We get warnings about inline functions where they are defined.
4017 We get warnings about other functions from push_overloaded_decl.
4019 Avoid duplicate warnings where they are used. */
4020 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
4024 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
4025 if (decl
&& TREE_CODE (decl
) == OVERLOAD
)
4026 decl
= OVL_FUNCTION (decl
);
4028 if (decl
&& decl
!= error_mark_node
4029 && (DECL_EXTERNAL (decl
) || TREE_PUBLIC (decl
))
4030 /* If different sort of thing, we already gave an error. */
4031 && TREE_CODE (decl
) == TREE_CODE (x
)
4032 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
4034 cp_pedwarn ("type mismatch with previous external decl", x
);
4035 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
4039 /* This name is new in its binding level.
4040 Install the new declaration and return it. */
4041 if (namespace_bindings_p ())
4043 /* Install a global value. */
4045 /* If the first global decl has external linkage,
4046 warn if we later see static one. */
4047 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
4048 TREE_PUBLIC (name
) = 1;
4050 /* Bind the mangled name for the entity. In the future, we
4051 should not need to do this; mangled names are an
4052 implementation detail of which the front-end should not
4053 need to be aware. */
4054 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
4056 /* For an ordinary function, we create a binding from
4057 the mangled name (i.e., NAME) to the DECL. But, for
4058 an `extern "C"' function, the mangled name and the
4059 ordinary name are the same so we need not do this. */
4060 && !DECL_EXTERN_C_FUNCTION_P (x
))
4064 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
4065 || TREE_CODE (x
) == NAMESPACE_DECL
)
4066 mangled_name
= name
;
4068 mangled_name
= DECL_ASSEMBLER_NAME (x
);
4070 if (TREE_CODE (x
) == FUNCTION_DECL
)
4072 ((IDENTIFIER_GLOBAL_VALUE (mangled_name
) == NULL_TREE
)
4073 || (IDENTIFIER_GLOBAL_VALUE (mangled_name
) == x
), 378);
4074 SET_IDENTIFIER_NAMESPACE_VALUE (mangled_name
, x
);
4077 /* Don't forget if the function was used via an implicit decl. */
4078 if (IDENTIFIER_IMPLICIT_DECL (name
)
4079 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
4082 /* Don't forget if its address was taken in that way. */
4083 if (IDENTIFIER_IMPLICIT_DECL (name
)
4084 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
4085 TREE_ADDRESSABLE (x
) = 1;
4087 /* Warn about mismatches against previous implicit decl. */
4088 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
4089 /* If this real decl matches the implicit, don't complain. */
4090 && ! (TREE_CODE (x
) == FUNCTION_DECL
4091 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
4093 ("`%D' was previously implicitly declared to return `int'", x
);
4095 /* If new decl is `static' and an `extern' was seen previously,
4097 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
4098 warn_extern_redeclared_static (x
, t
);
4102 /* Here to install a non-global value. */
4103 tree oldlocal
= IDENTIFIER_VALUE (name
);
4104 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
4106 if (need_new_binding
)
4108 push_local_binding (name
, x
, 0);
4109 /* Because push_local_binding will hook X on to the
4110 current_binding_level's name list, we don't want to
4111 do that again below. */
4112 need_new_binding
= 0;
4115 /* If this is a TYPE_DECL, push it into the type value slot. */
4116 if (TREE_CODE (x
) == TYPE_DECL
)
4117 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
4118 current_binding_level
);
4120 /* Clear out any TYPE_DECL shadowed by a namespace so that
4121 we won't think this is a type. The C struct hack doesn't
4122 go through namespaces. */
4123 if (TREE_CODE (x
) == NAMESPACE_DECL
)
4124 set_identifier_type_value_with_scope (name
, NULL_TREE
,
4125 current_binding_level
);
4132 && TREE_CODE (oldlocal
) == VAR_DECL
4133 && DECL_DEAD_FOR_LOCAL (oldlocal
))
4134 oldlocal
= DECL_SHADOWED_FOR_VAR (oldlocal
);
4136 if (oldlocal
== NULL_TREE
)
4137 oldlocal
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (d
));
4140 /* If this is an extern function declaration, see if we
4141 have a global definition or declaration for the function. */
4142 if (oldlocal
== NULL_TREE
4143 && DECL_EXTERNAL (x
)
4144 && oldglobal
!= NULL_TREE
4145 && TREE_CODE (x
) == FUNCTION_DECL
4146 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
4148 /* We have one. Their types must agree. */
4149 if (decls_match (x
, oldglobal
))
4153 cp_warning ("extern declaration of `%#D' doesn't match", x
);
4154 cp_warning_at ("global declaration `%#D'", oldglobal
);
4157 /* If we have a local external declaration,
4158 and no file-scope declaration has yet been seen,
4159 then if we later have a file-scope decl it must not be static. */
4160 if (oldlocal
== NULL_TREE
4161 && oldglobal
== NULL_TREE
4162 && DECL_EXTERNAL (x
)
4164 TREE_PUBLIC (name
) = 1;
4166 /* Warn if shadowing an argument at the top level of the body. */
4167 if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
4168 /* Inline decls shadow nothing. */
4169 && !DECL_FROM_INLINE (x
)
4170 && TREE_CODE (oldlocal
) == PARM_DECL
4171 /* Don't complain if it's from an enclosing function. */
4172 && DECL_CONTEXT (oldlocal
) == current_function_decl
4173 && TREE_CODE (x
) != PARM_DECL
)
4175 /* Go to where the parms should be and see if we
4177 struct binding_level
*b
= current_binding_level
->level_chain
;
4183 if (b
->parm_flag
== 1)
4184 cp_error ("declaration of `%#D' shadows a parameter", name
);
4187 /* Maybe warn if shadowing something else. */
4188 if (warn_shadow
&& !DECL_EXTERNAL (x
)
4189 /* Inline decls shadow nothing. */
4190 && !DECL_FROM_INLINE (x
)
4191 /* No shadow warnings for internally generated vars. */
4192 && ! DECL_ARTIFICIAL (x
)
4193 /* No shadow warnings for vars made for inlining. */
4194 && ! DECL_FROM_INLINE (x
))
4196 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
4197 warning ("declaration of `%s' shadows a parameter",
4198 IDENTIFIER_POINTER (name
));
4199 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
4200 && current_class_ptr
4201 && !TREE_STATIC (name
))
4202 warning ("declaration of `%s' shadows a member of `this'",
4203 IDENTIFIER_POINTER (name
));
4204 else if (oldlocal
!= NULL_TREE
)
4205 warning ("declaration of `%s' shadows previous local",
4206 IDENTIFIER_POINTER (name
));
4207 else if (oldglobal
!= NULL_TREE
)
4208 /* XXX shadow warnings in outer-more namespaces */
4209 warning ("declaration of `%s' shadows global declaration",
4210 IDENTIFIER_POINTER (name
));
4214 if (TREE_CODE (x
) == FUNCTION_DECL
)
4215 check_default_args (x
);
4217 /* Keep count of variables in this level with incomplete type. */
4218 if (TREE_CODE (x
) == VAR_DECL
4219 && TREE_TYPE (x
) != error_mark_node
4220 && ((!COMPLETE_TYPE_P (TREE_TYPE (x
))
4221 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
4222 /* RTTI TD entries are created while defining the type_info. */
4223 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
4224 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
4226 if (namespace_bindings_p ())
4227 namespace_scope_incomplete
4228 = tree_cons (NULL_TREE
, x
, namespace_scope_incomplete
);
4230 current_binding_level
->incomplete
4231 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4235 if (need_new_binding
)
4236 add_decl_to_level (x
,
4237 DECL_NAMESPACE_SCOPE_P (x
)
4238 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x
))
4239 : current_binding_level
);
4244 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4245 caller to set DECL_CONTEXT properly. */
4248 pushdecl_with_scope (x
, level
)
4250 struct binding_level
*level
;
4252 register struct binding_level
*b
;
4253 tree function_decl
= current_function_decl
;
4255 current_function_decl
= NULL_TREE
;
4256 if (level
->parm_flag
== 2)
4258 b
= class_binding_level
;
4259 class_binding_level
= level
;
4260 pushdecl_class_level (x
);
4261 class_binding_level
= b
;
4265 b
= current_binding_level
;
4266 current_binding_level
= level
;
4268 current_binding_level
= b
;
4270 current_function_decl
= function_decl
;
4274 /* Like pushdecl, only it places X in the current namespace,
4278 pushdecl_namespace_level (x
)
4281 register struct binding_level
*b
= current_binding_level
;
4284 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4286 /* Now, the type_shadowed stack may screw us. Munge it so it does
4288 if (TREE_CODE (x
) == TYPE_DECL
)
4290 tree name
= DECL_NAME (x
);
4292 tree
*ptr
= (tree
*)0;
4293 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4295 tree shadowed
= b
->type_shadowed
;
4296 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4297 if (TREE_PURPOSE (shadowed
) == name
)
4299 ptr
= &TREE_VALUE (shadowed
);
4300 /* Can't break out of the loop here because sometimes
4301 a binding level will have duplicate bindings for
4302 PT names. It's gross, but I haven't time to fix it. */
4305 newval
= TREE_TYPE (x
);
4306 if (ptr
== (tree
*)0)
4308 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4309 up here if this is changed to an assertion. --KR */
4310 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4320 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4324 pushdecl_top_level (x
)
4327 push_to_top_level ();
4328 x
= pushdecl_namespace_level (x
);
4329 pop_from_top_level ();
4333 /* Make the declaration of X appear in CLASS scope. */
4336 pushdecl_class_level (x
)
4339 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4340 scope looks for the pre-mangled name. */
4343 if (TREE_CODE (x
) == OVERLOAD
)
4344 x
= OVL_CURRENT (x
);
4345 name
= DECL_NAME (x
);
4349 push_class_level_binding (name
, x
);
4350 if (TREE_CODE (x
) == TYPE_DECL
)
4351 set_identifier_type_value (name
, TREE_TYPE (x
));
4353 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4357 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4360 pushdecl_class_level (f
);
4364 /* Enter DECL into the symbol table, if that's appropriate. Returns
4365 DECL, or a modified version thereof. */
4368 maybe_push_decl (decl
)
4371 tree type
= TREE_TYPE (decl
);
4373 /* Add this decl to the current binding level, but not if it comes
4374 from another scope, e.g. a static member variable. TEM may equal
4375 DECL or it may be a previous decl of the same name. */
4376 if (decl
== error_mark_node
4377 || (TREE_CODE (decl
) != PARM_DECL
4378 && DECL_CONTEXT (decl
) != NULL_TREE
4379 /* Definitions of namespace members outside their namespace are
4381 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4382 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4383 || TREE_CODE (type
) == UNKNOWN_TYPE
4384 /* The declaration of a template specialization does not affect
4385 the functions available for overload resolution, so we do not
4387 || (TREE_CODE (decl
) == FUNCTION_DECL
4388 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4391 return pushdecl (decl
);
4394 /* Make the declaration(s) of X appear in CLASS scope
4395 under the name NAME. */
4398 push_class_level_binding (name
, x
)
4403 /* The class_binding_level will be NULL if x is a template
4404 parameter name in a member template. */
4405 if (!class_binding_level
)
4408 /* Make sure that this new member does not have the same name
4409 as a template parameter. */
4410 if (TYPE_BEING_DEFINED (current_class_type
))
4411 check_template_shadow (x
);
4413 /* If this declaration shadows a declaration from an enclosing
4414 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4415 we leave this class. Record the shadowed declaration here. */
4416 binding
= IDENTIFIER_BINDING (name
);
4418 && ((TREE_CODE (x
) == OVERLOAD
4419 && BINDING_VALUE (binding
)
4420 && is_overloaded_fn (BINDING_VALUE (binding
)))
4421 || INHERITED_VALUE_BINDING_P (binding
)))
4426 /* If the old binding was from a base class, and was for a tag
4427 name, slide it over to make room for the new binding. The
4428 old binding is still visible if explicitly qualified with a
4430 if (INHERITED_VALUE_BINDING_P (binding
)
4431 && BINDING_VALUE (binding
)
4432 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4433 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4434 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4436 old_decl
= BINDING_TYPE (binding
);
4437 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4438 BINDING_VALUE (binding
) = NULL_TREE
;
4439 INHERITED_VALUE_BINDING_P (binding
) = 0;
4442 old_decl
= BINDING_VALUE (binding
);
4444 /* There was already a binding for X containing fewer
4445 functions than are named in X. Find the previous
4446 declaration of X on the class-shadowed list, and update it. */
4447 for (shadow
= class_binding_level
->class_shadowed
;
4449 shadow
= TREE_CHAIN (shadow
))
4450 if (TREE_PURPOSE (shadow
) == name
4451 && TREE_TYPE (shadow
) == old_decl
)
4453 BINDING_VALUE (binding
) = x
;
4454 INHERITED_VALUE_BINDING_P (binding
) = 0;
4455 TREE_TYPE (shadow
) = x
;
4460 /* If we didn't replace an existing binding, put the binding on the
4461 stack of bindings for the identifier, and update
4462 IDENTIFIER_CLASS_VALUE. */
4463 if (push_class_binding (name
, x
))
4465 class_binding_level
->class_shadowed
4466 = tree_cons (name
, IDENTIFIER_CLASS_VALUE (name
),
4467 class_binding_level
->class_shadowed
);
4468 /* Record the value we are binding NAME to so that we can know
4469 what to pop later. */
4470 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4474 /* Insert another USING_DECL into the current binding level, returning
4475 this declaration. If this is a redeclaration, do nothing, and
4476 return NULL_TREE if this not in namespace scope (in namespace
4477 scope, a using decl might extend any previous bindings). */
4480 push_using_decl (scope
, name
)
4486 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4487 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4488 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4489 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4492 return namespace_bindings_p () ? decl
: NULL_TREE
;
4493 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4494 DECL_INITIAL (decl
) = scope
;
4495 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4496 current_binding_level
->usings
= decl
;
4500 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4501 changed (i.e. there was already a directive), or the fresh
4502 TREE_LIST otherwise. */
4505 push_using_directive (used
)
4508 tree ud
= current_binding_level
->using_directives
;
4509 tree iter
, ancestor
;
4511 /* Check if we already have this. */
4512 if (purpose_member (used
, ud
) != NULL_TREE
)
4515 /* Recursively add all namespaces used. */
4516 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4517 push_using_directive (TREE_PURPOSE (iter
));
4519 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4520 ud
= current_binding_level
->using_directives
;
4521 ud
= tree_cons (used
, ancestor
, ud
);
4522 current_binding_level
->using_directives
= ud
;
4526 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4527 other definitions already in place. We get around this by making
4528 the value of the identifier point to a list of all the things that
4529 want to be referenced by that name. It is then up to the users of
4530 that name to decide what to do with that list.
4532 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its
4533 DECL_TEMPLATE_RESULT. It is dealt with the same way.
4535 FLAGS is a bitwise-or of the following values:
4536 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4538 PUSH_USING: DECL is being pushed as the result of a using
4541 The value returned may be a previous declaration if we guessed wrong
4542 about what language DECL should belong to (C or C++). Otherwise,
4543 it's always DECL (and never something that's not a _DECL). */
4546 push_overloaded_decl (decl
, flags
)
4550 tree name
= DECL_NAME (decl
);
4553 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4556 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4558 old
= lookup_name_current_level (name
);
4562 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4564 tree t
= TREE_TYPE (old
);
4565 if (IS_AGGR_TYPE (t
) && warn_shadow
4566 && (! DECL_IN_SYSTEM_HEADER (decl
)
4567 || ! DECL_IN_SYSTEM_HEADER (old
)))
4568 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4571 else if (is_overloaded_fn (old
))
4575 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4577 tree fn
= OVL_CURRENT (tmp
);
4579 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4580 && !(flags
& PUSH_USING
)
4581 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4582 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4583 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4586 if (duplicate_decls (decl
, fn
))
4590 else if (old
== error_mark_node
)
4591 /* Ignore the undefined symbol marker. */
4595 cp_error_at ("previous non-function declaration `%#D'", old
);
4596 cp_error ("conflicts with function declaration `%#D'", decl
);
4601 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4603 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4604 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4606 new_binding
= ovl_cons (decl
, old
);
4607 if (flags
& PUSH_USING
)
4608 OVL_USED (new_binding
) = 1;
4611 /* NAME is not ambiguous. */
4615 set_namespace_binding (name
, current_namespace
, new_binding
);
4618 /* We only create an OVERLOAD if there was a previous binding at
4619 this level, or if decl is a template. In the former case, we
4620 need to remove the old binding and replace it with the new
4621 binding. We must also run through the NAMES on the binding
4622 level where the name was bound to update the chain. */
4624 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4628 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4630 d
= &TREE_CHAIN (*d
))
4632 || (TREE_CODE (*d
) == TREE_LIST
4633 && TREE_VALUE (*d
) == old
))
4635 if (TREE_CODE (*d
) == TREE_LIST
)
4636 /* Just replace the old binding with the new. */
4637 TREE_VALUE (*d
) = new_binding
;
4639 /* Build a TREE_LIST to wrap the OVERLOAD. */
4640 *d
= tree_cons (NULL_TREE
, new_binding
,
4643 /* And update the CPLUS_BINDING node. */
4644 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4649 /* We should always find a previous binding in this case. */
4650 my_friendly_abort (0);
4653 /* Install the new binding. */
4654 push_local_binding (name
, new_binding
, flags
);
4660 /* Generate an implicit declaration for identifier FUNCTIONID
4661 as a function of type int (). Print a warning if appropriate. */
4664 implicitly_declare (functionid
)
4669 /* We used to reuse an old implicit decl here,
4670 but this loses with inline functions because it can clobber
4671 the saved decl chains. */
4672 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4674 DECL_EXTERNAL (decl
) = 1;
4675 TREE_PUBLIC (decl
) = 1;
4677 /* ISO standard says implicit declarations are in the innermost block.
4678 So we record the decl in the standard fashion. */
4680 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4683 /* Only one warning per identifier. */
4684 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4686 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4689 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4694 /* Return zero if the declaration NEWDECL is valid
4695 when the declaration OLDDECL (assumed to be for the same name)
4696 has already been seen.
4697 Otherwise return an error message format string with a %s
4698 where the identifier should go. */
4701 redeclaration_error_message (newdecl
, olddecl
)
4702 tree newdecl
, olddecl
;
4704 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4706 /* Because C++ can put things into name space for free,
4707 constructs like "typedef struct foo { ... } foo"
4708 would look like an erroneous redeclaration. */
4709 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4712 return "redefinition of `%#D'";
4714 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4716 /* If this is a pure function, its olddecl will actually be
4717 the original initialization to `0' (which we force to call
4718 abort()). Don't complain about redefinition in this case. */
4719 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_PURE_VIRTUAL_P (olddecl
))
4722 /* If both functions come from different namespaces, this is not
4723 a redeclaration - this is a conflict with a used function. */
4724 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4725 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4726 return "`%D' conflicts with used function";
4728 /* We'll complain about linkage mismatches in
4729 warn_extern_redeclared_static. */
4731 /* Defining the same name twice is no good. */
4732 if (DECL_INITIAL (olddecl
) != NULL_TREE
4733 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4735 if (DECL_NAME (olddecl
) == NULL_TREE
)
4736 return "`%#D' not declared in class";
4738 return "redefinition of `%#D'";
4742 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4744 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4745 && (DECL_TEMPLATE_RESULT (newdecl
)
4746 != DECL_TEMPLATE_RESULT (olddecl
))
4747 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4748 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4749 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4750 && COMPLETE_TYPE_P (TREE_TYPE (newdecl
))
4751 && COMPLETE_TYPE_P (TREE_TYPE (olddecl
))))
4752 return "redefinition of `%#D'";
4755 else if (toplevel_bindings_p () || DECL_NAMESPACE_SCOPE_P (newdecl
))
4757 /* Objects declared at top level: */
4758 /* If at least one is a reference, it's ok. */
4759 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4761 /* Reject two definitions. */
4762 return "redefinition of `%#D'";
4766 /* Objects declared with block scope: */
4767 /* Reject two definitions, and reject a definition
4768 together with an external reference. */
4769 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4770 return "redeclaration of `%#D'";
4775 /* Create a new label, named ID. */
4778 make_label_decl (id
, local_p
)
4784 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4786 /* Make sure every label has an rtx. */
4789 DECL_CONTEXT (decl
) = current_function_decl
;
4790 DECL_MODE (decl
) = VOIDmode
;
4791 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
4793 /* Say where one reference is to the label, for the sake of the
4794 error if it is not defined. */
4795 DECL_SOURCE_LINE (decl
) = lineno
;
4796 DECL_SOURCE_FILE (decl
) = input_filename
;
4798 /* Record the fact that this identifier is bound to this label. */
4799 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4804 /* Record this label on the list of used labels so that we can check
4805 at the end of the function to see whether or not the label was
4806 actually defined, and so we can check when the label is defined whether
4807 this use is valid. */
4813 if (named_label_uses
== NULL
4814 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4815 || named_label_uses
->label_decl
!= decl
)
4817 struct named_label_use_list
*new_ent
;
4818 new_ent
= ((struct named_label_use_list
*)
4819 ggc_alloc (sizeof (struct named_label_use_list
)));
4820 new_ent
->label_decl
= decl
;
4821 new_ent
->names_in_scope
= current_binding_level
->names
;
4822 new_ent
->binding_level
= current_binding_level
;
4823 new_ent
->lineno_o_goto
= lineno
;
4824 new_ent
->filename_o_goto
= input_filename
;
4825 new_ent
->next
= named_label_uses
;
4826 named_label_uses
= new_ent
;
4830 /* Look for a label named ID in the current function. If one cannot
4831 be found, create one. (We keep track of used, but undefined,
4832 labels, and complain about them at the end of a function.) */
4839 struct named_label_list
*ent
;
4841 /* You can't use labels at global scope. */
4842 if (current_function_decl
== NULL_TREE
)
4844 error ("label `%s' referenced outside of any function",
4845 IDENTIFIER_POINTER (id
));
4849 /* See if we've already got this label. */
4850 decl
= IDENTIFIER_LABEL_VALUE (id
);
4851 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
4854 /* Record this label on the list of labels used in this function.
4855 We do this before calling make_label_decl so that we get the
4856 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4857 ent
= ((struct named_label_list
*)
4858 ggc_alloc_cleared (sizeof (struct named_label_list
)));
4859 ent
->old_value
= IDENTIFIER_LABEL_VALUE (id
);
4860 ent
->next
= named_labels
;
4863 /* We need a new label. */
4864 decl
= make_label_decl (id
, /*local_p=*/0);
4866 /* Now fill in the information we didn't have before. */
4867 ent
->label_decl
= decl
;
4872 /* Declare a local label named ID. */
4875 declare_local_label (id
)
4880 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4881 this scope we can restore the old value of
4882 IDENTIFIER_TYPE_VALUE. */
4883 current_binding_level
->shadowed_labels
4884 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4885 current_binding_level
->shadowed_labels
);
4886 /* Look for the label. */
4887 decl
= make_label_decl (id
, /*local_p=*/1);
4888 /* Now fill in the information we didn't have before. */
4889 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
4894 /* Returns nonzero if it is ill-formed to jump past the declaration of
4895 DECL. Returns 2 if it's also a real problem. */
4898 decl_jump_unsafe (decl
)
4901 if (TREE_CODE (decl
) != VAR_DECL
|| TREE_STATIC (decl
))
4904 if (DECL_INITIAL (decl
) == NULL_TREE
4905 && pod_type_p (TREE_TYPE (decl
)))
4908 /* This is really only important if we're crossing an initialization.
4909 The POD stuff is just pedantry; why should it matter if the class
4910 contains a field of pointer to member type? */
4911 if (DECL_INITIAL (decl
)
4912 || (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))))
4917 /* Check that a single previously seen jump to a newly defined label
4918 is OK. DECL is the LABEL_DECL or 0; LEVEL is the binding_level for
4919 the jump context; NAMES are the names in scope in LEVEL at the jump
4920 context; FILE and LINE are the source position of the jump or 0. */
4923 check_previous_goto_1 (decl
, level
, names
, file
, line
)
4925 struct binding_level
*level
;
4932 struct binding_level
*b
= current_binding_level
;
4933 for (; b
; b
= b
->level_chain
)
4935 tree new_decls
= b
->names
;
4936 tree old_decls
= (b
== level
? names
: NULL_TREE
);
4937 for (; new_decls
!= old_decls
;
4938 new_decls
= TREE_CHAIN (new_decls
))
4940 int problem
= decl_jump_unsafe (new_decls
);
4947 cp_pedwarn ("jump to label `%D'", decl
);
4949 pedwarn ("jump to case label");
4952 pedwarn_with_file_and_line (file
, line
, " from here");
4956 if (problem
> 1 && DECL_ARTIFICIAL (new_decls
))
4957 /* Can't skip init of __exception_info. */
4958 cp_error_at (" enters catch block", new_decls
);
4959 else if (problem
> 1)
4960 cp_error_at (" crosses initialization of `%#D'",
4963 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4969 if (b
->eh_region
&& ! saw_eh
)
4974 cp_pedwarn ("jump to label `%D'", decl
);
4976 pedwarn ("jump to case label");
4979 pedwarn_with_file_and_line (file
, line
, " from here");
4982 error (" enters try block");
4989 check_previous_goto (use
)
4990 struct named_label_use_list
*use
;
4992 check_previous_goto_1 (use
->label_decl
, use
->binding_level
,
4993 use
->names_in_scope
, use
->filename_o_goto
,
4994 use
->lineno_o_goto
);
4998 check_switch_goto (level
)
4999 struct binding_level
*level
;
5001 check_previous_goto_1 (NULL_TREE
, level
, level
->names
, NULL
, 0);
5004 /* Check that any previously seen jumps to a newly defined label DECL
5005 are OK. Called by define_label. */
5008 check_previous_gotos (decl
)
5011 struct named_label_use_list
**usep
;
5013 if (! TREE_USED (decl
))
5016 for (usep
= &named_label_uses
; *usep
; )
5018 struct named_label_use_list
*use
= *usep
;
5019 if (use
->label_decl
== decl
)
5021 check_previous_goto (use
);
5025 usep
= &(use
->next
);
5029 /* Check that a new jump to a label DECL is OK. Called by
5030 finish_goto_stmt. */
5038 struct named_label_list
*lab
;
5040 /* We can't know where a computed goto is jumping. So we assume
5042 if (! DECL_P (decl
))
5045 /* If the label hasn't been defined yet, defer checking. */
5046 if (! DECL_INITIAL (decl
))
5052 for (lab
= named_labels
; lab
; lab
= lab
->next
)
5053 if (decl
== lab
->label_decl
)
5056 /* If the label is not on named_labels it's a gcc local label, so
5057 it must be in an outer scope, so jumping to it is always OK. */
5061 if ((lab
->eh_region
|| lab
->bad_decls
) && !identified
)
5063 cp_pedwarn_at ("jump to label `%D'", decl
);
5064 pedwarn (" from here");
5068 for (bad
= lab
->bad_decls
; bad
; bad
= TREE_CHAIN (bad
))
5070 tree b
= TREE_VALUE (bad
);
5071 int u
= decl_jump_unsafe (b
);
5073 if (u
> 1 && DECL_ARTIFICIAL (b
))
5074 /* Can't skip init of __exception_info. */
5075 cp_error_at (" enters catch block", b
);
5077 cp_error_at (" skips initialization of `%#D'", b
);
5079 cp_pedwarn_at (" enters scope of non-POD `%#D'", b
);
5083 error (" enters try block");
5086 /* Define a label, specifying the location in the source file.
5087 Return the LABEL_DECL node for the label, if the definition is valid.
5088 Otherwise return 0. */
5091 define_label (filename
, line
, name
)
5092 const char *filename
;
5096 tree decl
= lookup_label (name
);
5097 struct named_label_list
*ent
;
5099 for (ent
= named_labels
; ent
; ent
= ent
->next
)
5100 if (ent
->label_decl
== decl
)
5103 /* After labels, make any new cleanups go into their
5104 own new (temporary) binding contour. */
5105 current_binding_level
->more_cleanups_ok
= 0;
5107 if (name
== get_identifier ("wchar_t"))
5108 cp_pedwarn ("label named wchar_t");
5110 if (DECL_INITIAL (decl
) != NULL_TREE
)
5112 cp_error ("duplicate label `%D'", decl
);
5117 /* Mark label as having been defined. */
5118 DECL_INITIAL (decl
) = error_mark_node
;
5119 /* Say where in the source. */
5120 DECL_SOURCE_FILE (decl
) = filename
;
5121 DECL_SOURCE_LINE (decl
) = line
;
5124 ent
->names_in_scope
= current_binding_level
->names
;
5125 ent
->binding_level
= current_binding_level
;
5127 check_previous_gotos (decl
);
5128 current_function_return_value
= NULL_TREE
;
5135 struct binding_level
*level
;
5136 struct cp_switch
*next
;
5139 static struct cp_switch
*switch_stack
;
5145 = (struct cp_switch
*) xmalloc (sizeof (struct cp_switch
));
5146 p
->level
= current_binding_level
;
5147 p
->next
= switch_stack
;
5154 struct cp_switch
*cs
;
5157 switch_stack
= switch_stack
->next
;
5161 /* Note that we've seen a definition of a case label, and complain if this
5162 is a bad place for one. */
5165 define_case_label ()
5167 tree cleanup
= last_cleanup_this_contour ();
5170 /* Don't crash; we'll complain in do_case. */
5175 static int explained
= 0;
5176 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup
));
5177 warning ("where case label appears here");
5180 warning ("(enclose actions of previous case statements requiring");
5181 warning ("destructors in their own binding contours.)");
5186 check_switch_goto (switch_stack
->level
);
5188 /* After labels, make any new cleanups go into their
5189 own new (temporary) binding contour. */
5191 current_binding_level
->more_cleanups_ok
= 0;
5192 current_function_return_value
= NULL_TREE
;
5195 /* Return the list of declarations of the current level.
5196 Note that this list is in reverse order unless/until
5197 you nreverse it; and when you do nreverse it, you must
5198 store the result back using `storedecls' or you will lose. */
5203 return current_binding_level
->names
;
5206 /* Return the list of type-tags (for structs, etc) of the current level. */
5211 return current_binding_level
->tags
;
5214 /* Store the list of declarations of the current level.
5215 This is done for the parameter declarations of a function being defined,
5216 after they are modified in the light of any missing parameters. */
5222 current_binding_level
->names
= decls
;
5225 /* Similarly, store the list of tags of the current level. */
5231 current_binding_level
->tags
= tags
;
5234 /* Given NAME, an IDENTIFIER_NODE,
5235 return the structure (or union or enum) definition for that name.
5236 Searches binding levels from BINDING_LEVEL up to the global level.
5237 If THISLEVEL_ONLY is nonzero, searches only the specified context
5238 (but skips any tag-transparent contexts to find one that is
5239 meaningful for tags).
5240 FORM says which kind of type the caller wants;
5241 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
5242 If the wrong kind of type is found, and it's not a template, an error is
5246 lookup_tag (form
, name
, binding_level
, thislevel_only
)
5247 enum tree_code form
;
5249 struct binding_level
*binding_level
;
5252 register struct binding_level
*level
;
5253 /* Non-zero if, we should look past a template parameter level, even
5254 if THISLEVEL_ONLY. */
5255 int allow_template_parms_p
= 1;
5257 for (level
= binding_level
; level
; level
= level
->level_chain
)
5260 if (ANON_AGGRNAME_P (name
))
5261 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5263 /* There's no need for error checking here, because
5264 anon names are unique throughout the compilation. */
5265 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
5266 return TREE_VALUE (tail
);
5268 else if (level
->namespace_p
)
5269 /* Do namespace lookup. */
5270 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
5272 tree old
= binding_for_name (name
, tail
);
5274 /* If we just skipped past a template parameter level,
5275 even though THISLEVEL_ONLY, and we find a template
5276 class declaration, then we use the _TYPE node for the
5277 template. See the example below. */
5278 if (thislevel_only
&& !allow_template_parms_p
5279 && old
&& BINDING_VALUE (old
)
5280 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
5281 old
= TREE_TYPE (BINDING_VALUE (old
));
5283 old
= BINDING_TYPE (old
);
5285 /* If it has an original type, it is a typedef, and we
5286 should not return it. */
5287 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
5289 if (old
&& TREE_CODE (old
) != form
5290 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
5292 cp_error ("`%#D' redeclared as %C", old
, form
);
5297 if (thislevel_only
|| tail
== global_namespace
)
5301 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5303 if (TREE_PURPOSE (tail
) == name
)
5305 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
5306 /* Should tighten this up; it'll probably permit
5307 UNION_TYPE and a struct template, for example. */
5309 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
5311 /* Definition isn't the kind we were looking for. */
5312 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
5316 return TREE_VALUE (tail
);
5319 if (thislevel_only
&& ! level
->tag_transparent
)
5321 if (level
->template_parms_p
&& allow_template_parms_p
)
5323 /* We must deal with cases like this:
5325 template <class T> struct S;
5326 template <class T> struct S {};
5328 When looking up `S', for the second declaration, we
5329 would like to find the first declaration. But, we
5330 are in the pseudo-global level created for the
5331 template parameters, rather than the (surrounding)
5332 namespace level. Thus, we keep going one more level,
5333 even though THISLEVEL_ONLY is non-zero. */
5334 allow_template_parms_p
= 0;
5346 set_current_level_tags_transparency (tags_transparent
)
5347 int tags_transparent
;
5349 current_binding_level
->tag_transparent
= tags_transparent
;
5353 /* Given a type, find the tag that was defined for it and return the tag name.
5354 Otherwise return 0. However, the value can never be 0
5355 in the cases in which this is used.
5357 C++: If NAME is non-zero, this is the new name to install. This is
5358 done when replacing anonymous tags with real tag names. */
5361 lookup_tag_reverse (type
, name
)
5365 register struct binding_level
*level
;
5367 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5370 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5372 if (TREE_VALUE (tail
) == type
)
5375 TREE_PURPOSE (tail
) = name
;
5376 return TREE_PURPOSE (tail
);
5383 /* Look up NAME in the NAMESPACE. */
5386 lookup_namespace_name (namespace, name
)
5387 tree
namespace, name
;
5390 tree template_id
= NULL_TREE
;
5392 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5394 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5395 /* This happens for A::B<int> when B is a namespace. */
5397 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5399 /* This happens for A::B where B is a template, and there are no
5400 template arguments. */
5401 cp_error ("invalid use of `%D'", name
);
5402 return error_mark_node
;
5405 namespace = ORIGINAL_NAMESPACE (namespace);
5407 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5410 name
= TREE_OPERAND (name
, 0);
5411 if (TREE_CODE (name
) == OVERLOAD
)
5412 name
= DECL_NAME (OVL_CURRENT (name
));
5413 else if (DECL_P (name
))
5414 name
= DECL_NAME (name
);
5417 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5419 val
= make_node (CPLUS_BINDING
);
5420 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5421 return error_mark_node
;
5423 if (BINDING_VALUE (val
))
5425 val
= BINDING_VALUE (val
);
5429 if (DECL_CLASS_TEMPLATE_P (val
))
5430 val
= lookup_template_class (val
,
5431 TREE_OPERAND (template_id
, 1),
5432 /*in_decl=*/NULL_TREE
,
5433 /*context=*/NULL_TREE
,
5434 /*entering_scope=*/0);
5435 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5436 || TREE_CODE (val
) == OVERLOAD
)
5437 val
= lookup_template_function (val
,
5438 TREE_OPERAND (template_id
, 1));
5441 cp_error ("`%D::%D' is not a template",
5443 return error_mark_node
;
5447 /* If we have a single function from a using decl, pull it out. */
5448 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5449 val
= OVL_FUNCTION (val
);
5453 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5454 return error_mark_node
;
5457 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5459 static unsigned long
5467 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5468 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5473 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5476 typename_compare (k1
, k2
)
5487 d1
= TYPE_NAME (t1
);
5488 d2
= TYPE_NAME (t2
);
5490 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5491 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5492 && ((TREE_TYPE (t1
) != NULL_TREE
)
5493 == (TREE_TYPE (t2
) != NULL_TREE
))
5494 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5495 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5498 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5499 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5500 is non-NULL, this type is being created by the implicit typename
5501 extension, and BASE_TYPE is a type named `t' in some base class of
5502 `T' which depends on template parameters.
5504 Returns the new TYPENAME_TYPE. */
5507 build_typename_type (context
, name
, fullname
, base_type
)
5515 struct hash_entry
* e
;
5517 static struct hash_table ht
;
5521 static struct hash_table
*h
= &ht
;
5522 if (!hash_table_init (&ht
, &hash_newfunc
, &typename_hash
,
5524 fatal ("virtual memory exhausted");
5525 ggc_add_tree_hash_table_root (&h
, 1);
5528 /* Build the TYPENAME_TYPE. */
5529 t
= make_aggr_type (TYPENAME_TYPE
);
5530 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5531 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5532 TREE_TYPE (t
) = base_type
;
5534 /* Build the corresponding TYPE_DECL. */
5535 d
= build_decl (TYPE_DECL
, name
, t
);
5536 TYPE_NAME (TREE_TYPE (d
)) = d
;
5537 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5538 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5539 DECL_ARTIFICIAL (d
) = 1;
5541 /* See if we already have this type. */
5542 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5546 /* Insert the type into the table. */
5547 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5552 /* Resolve `typename CONTEXT::NAME'. Returns an appropriate type,
5553 unless an error occurs, in which case error_mark_node is returned.
5554 If COMPLAIN zero, don't complain about any errors that occur. */
5557 make_typename_type (context
, name
, complain
)
5565 if (!(TYPE_LANG_SPECIFIC (name
)
5566 && (CLASSTYPE_IS_TEMPLATE (name
)
5567 || CLASSTYPE_USE_TEMPLATE (name
))))
5568 name
= TYPE_IDENTIFIER (name
);
5570 /* Create a TEMPLATE_ID_EXPR for the type. */
5571 name
= build_nt (TEMPLATE_ID_EXPR
,
5572 CLASSTYPE_TI_TEMPLATE (name
),
5573 CLASSTYPE_TI_ARGS (name
));
5575 else if (TREE_CODE (name
) == TYPE_DECL
)
5576 name
= DECL_NAME (name
);
5580 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5582 name
= TREE_OPERAND (name
, 0);
5583 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5584 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5586 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5587 my_friendly_abort (2000);
5589 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5591 /* We can get here from typename_sub0 in the explicit_template_type
5592 expansion. Just fail. */
5594 cp_error ("no class template named `%#T' in `%#T'",
5596 return error_mark_node
;
5599 if (! uses_template_parms (context
)
5600 || currently_open_class (context
))
5602 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5604 tree tmpl
= NULL_TREE
;
5605 if (IS_AGGR_TYPE (context
))
5606 tmpl
= lookup_field (context
, name
, 0, 0);
5607 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5610 cp_error ("no class template named `%#T' in `%#T'",
5612 return error_mark_node
;
5615 return lookup_template_class (tmpl
,
5616 TREE_OPERAND (fullname
, 1),
5618 /*entering_scope=*/0);
5624 if (!IS_AGGR_TYPE (context
))
5627 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5628 return error_mark_node
;
5631 t
= lookup_field (context
, name
, 0, 1);
5633 return TREE_TYPE (t
);
5637 /* If the CONTEXT is not a template type, then either the field is
5638 there now or its never going to be. */
5639 if (!uses_template_parms (context
))
5642 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5643 return error_mark_node
;
5647 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5650 /* Select the right _DECL from multiple choices. */
5653 select_decl (binding
, flags
)
5658 val
= BINDING_VALUE (binding
);
5659 if (LOOKUP_NAMESPACES_ONLY (flags
))
5661 /* We are not interested in types. */
5662 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5667 /* If we could have a type and
5668 we have nothing or we need a type and have none. */
5669 if (BINDING_TYPE (binding
)
5670 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5671 && TREE_CODE (val
) != TYPE_DECL
)))
5672 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5673 /* Don't return non-types if we really prefer types. */
5674 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5675 && (TREE_CODE (val
) != TEMPLATE_DECL
5676 || !DECL_CLASS_TEMPLATE_P (val
)))
5682 /* Unscoped lookup of a global: iterate over current namespaces,
5683 considering using-directives. If SPACESP is non-NULL, store a list
5684 of the namespaces we've considered in it. */
5687 unqualified_namespace_lookup (name
, flags
, spacesp
)
5692 tree b
= make_node (CPLUS_BINDING
);
5693 tree initial
= current_decl_namespace();
5694 tree scope
= initial
;
5696 struct binding_level
*level
;
5697 tree val
= NULL_TREE
;
5700 *spacesp
= NULL_TREE
;
5702 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5705 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5706 val
= binding_for_name (name
, scope
);
5708 /* Initialize binding for this context. */
5709 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5710 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5712 /* Add all _DECLs seen through local using-directives. */
5713 for (level
= current_binding_level
;
5714 !level
->namespace_p
;
5715 level
= level
->level_chain
)
5716 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5717 scope
, flags
, spacesp
))
5718 /* Give up because of error. */
5719 return error_mark_node
;
5721 /* Add all _DECLs seen through global using-directives. */
5722 /* XXX local and global using lists should work equally. */
5726 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5727 scope
, flags
, spacesp
))
5728 /* Give up because of error. */
5729 return error_mark_node
;
5730 if (siter
== scope
) break;
5731 siter
= CP_DECL_CONTEXT (siter
);
5734 val
= select_decl (b
, flags
);
5735 if (scope
== global_namespace
)
5741 /* Combine prefer_type and namespaces_only into flags. */
5744 lookup_flags (prefer_type
, namespaces_only
)
5745 int prefer_type
, namespaces_only
;
5747 if (namespaces_only
)
5748 return LOOKUP_PREFER_NAMESPACES
;
5749 if (prefer_type
> 1)
5750 return LOOKUP_PREFER_TYPES
;
5751 if (prefer_type
> 0)
5752 return LOOKUP_PREFER_BOTH
;
5756 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5757 ignore it or not. Subroutine of lookup_name_real. */
5760 qualify_lookup (val
, flags
)
5764 if (val
== NULL_TREE
)
5766 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5768 if ((flags
& LOOKUP_PREFER_TYPES
)
5769 && (TREE_CODE (val
) == TYPE_DECL
5770 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5771 && DECL_CLASS_TEMPLATE_P (val
))))
5773 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5778 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5782 warn_about_implicit_typename_lookup (typename
, binding
)
5786 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5787 tree name
= DECL_NAME (typename
);
5789 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5790 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5791 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5792 && ! (TREE_CODE (binding
) == TYPE_DECL
5793 && same_type_p (TREE_TYPE (binding
), subtype
)))
5795 cp_warning ("lookup of `%D' finds `%#D'",
5797 cp_warning (" instead of `%D' from dependent base class",
5799 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5800 constructor_name (current_class_type
), name
);
5804 /* Look up NAME in the current binding level and its superiors in the
5805 namespace of variables, functions and typedefs. Return a ..._DECL
5806 node of some kind representing its definition if there is only one
5807 such declaration, or return a TREE_LIST with all the overloaded
5808 definitions if there are many, or return 0 if it is undefined.
5810 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5811 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5812 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5813 Otherwise we prefer non-TYPE_DECLs.
5815 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5816 using IDENTIFIER_CLASS_VALUE. */
5819 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5821 int prefer_type
, nonclass
, namespaces_only
;
5824 tree val
= NULL_TREE
;
5826 tree from_obj
= NULL_TREE
;
5828 int val_is_implicit_typename
= 0;
5830 /* Hack: copy flag set by parser, if set. */
5831 if (only_namespace_names
)
5832 namespaces_only
= 1;
5834 if (prefer_type
== -2)
5836 extern int looking_for_typename
;
5837 tree type
= NULL_TREE
;
5840 prefer_type
= looking_for_typename
;
5842 flags
= lookup_flags (prefer_type
, namespaces_only
);
5843 /* If the next thing is '<', class templates are types. */
5844 if (looking_for_template
)
5845 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5847 /* std:: becomes :: for now. */
5848 if (got_scope
== std_node
)
5849 got_scope
= void_type_node
;
5853 else if (got_object
!= error_mark_node
)
5858 if (type
== error_mark_node
)
5859 return error_mark_node
;
5860 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5861 type
= TREE_TYPE (type
);
5864 type
= complete_type (type
);
5866 if (TREE_CODE (type
) == VOID_TYPE
)
5867 type
= global_namespace
;
5868 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5870 val
= make_node (CPLUS_BINDING
);
5871 flags
|= LOOKUP_COMPLAIN
;
5872 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5874 val
= select_decl (val
, flags
);
5876 else if (! IS_AGGR_TYPE (type
)
5877 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5878 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5879 || TREE_CODE (type
) == TYPENAME_TYPE
)
5880 /* Someone else will give an error about this if needed. */
5882 else if (type
== current_class_type
)
5883 val
= IDENTIFIER_CLASS_VALUE (name
);
5886 val
= lookup_member (type
, name
, 0, prefer_type
);
5887 type_access_control (type
, val
);
5895 else if (got_object
&& val
)
5900 flags
= lookup_flags (prefer_type
, namespaces_only
);
5901 /* If we're not parsing, we need to complain. */
5902 flags
|= LOOKUP_COMPLAIN
;
5905 /* First, look in non-namespace scopes. */
5907 if (current_class_type
== NULL_TREE
)
5910 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5914 if (!LOCAL_BINDING_P (t
) && nonclass
)
5915 /* We're not looking for class-scoped bindings, so keep going. */
5918 /* If this is the kind of thing we're looking for, we're done. */
5919 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5920 binding
= BINDING_VALUE (t
);
5921 else if ((flags
& LOOKUP_PREFER_TYPES
)
5922 && qualify_lookup (BINDING_TYPE (t
), flags
))
5923 binding
= BINDING_TYPE (t
);
5925 binding
= NULL_TREE
;
5927 /* Handle access control on types from enclosing or base classes. */
5928 if (binding
&& ! yylex
5929 && BINDING_LEVEL (t
) && BINDING_LEVEL (t
)->parm_flag
== 2)
5930 type_access_control (BINDING_LEVEL (t
)->this_class
, binding
);
5933 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5935 if (val_is_implicit_typename
&& !yylex
)
5936 warn_about_implicit_typename_lookup (val
, binding
);
5938 val_is_implicit_typename
5939 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5940 if (!val_is_implicit_typename
)
5945 /* Now lookup in namespace scopes. */
5946 if (!val
|| val_is_implicit_typename
)
5948 t
= unqualified_namespace_lookup (name
, flags
, 0);
5951 if (val_is_implicit_typename
&& !yylex
)
5952 warn_about_implicit_typename_lookup (val
, t
);
5960 /* This should only warn about types used in qualified-ids. */
5961 if (from_obj
&& from_obj
!= val
)
5963 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5964 && TREE_CODE (val
) == TYPE_DECL
5965 && TREE_TYPE (from_obj
) != TREE_TYPE (val
))
5967 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5968 name
, got_object
, TREE_TYPE (from_obj
));
5969 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
5973 /* We don't change val to from_obj if got_object depends on
5974 template parms because that breaks implicit typename for
5975 destructor calls. */
5976 if (! uses_template_parms (got_object
))
5980 /* If we have a single function from a using decl, pull it out. */
5981 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5982 val
= OVL_FUNCTION (val
);
5991 lookup_name_nonclass (name
)
5994 return lookup_name_real (name
, 0, 1, 0);
5998 lookup_function_nonclass (name
, args
)
6002 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
6006 lookup_name_namespace_only (name
)
6009 /* type-or-namespace, nonclass, namespace_only */
6010 return lookup_name_real (name
, 1, 1, 1);
6014 lookup_name (name
, prefer_type
)
6018 return lookup_name_real (name
, prefer_type
, 0, 0);
6021 /* Similar to `lookup_name' but look only in the innermost non-class
6025 lookup_name_current_level (name
)
6028 struct binding_level
*b
;
6031 b
= current_binding_level
;
6032 while (b
->parm_flag
== 2)
6037 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
6039 /* extern "C" function() */
6040 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
6043 else if (IDENTIFIER_BINDING (name
)
6044 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
6048 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
6049 return IDENTIFIER_VALUE (name
);
6061 /* Like lookup_name_current_level, but for types. */
6064 lookup_type_current_level (name
)
6067 register tree t
= NULL_TREE
;
6069 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
6071 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
6072 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
6074 struct binding_level
*b
= current_binding_level
;
6077 if (purpose_member (name
, b
->type_shadowed
))
6078 return REAL_IDENTIFIER_TYPE_VALUE (name
);
6090 begin_only_namespace_names ()
6092 only_namespace_names
= 1;
6096 end_only_namespace_names ()
6098 only_namespace_names
= 0;
6101 /* Push the declarations of builtin types into the namespace.
6102 RID_INDEX, if < CP_RID_MAX is the index of the builtin type
6103 in the array RID_POINTERS. NAME is the name used when looking
6104 up the builtin type. TYPE is the _TYPE node for the builtin type. */
6107 record_builtin_type (rid_index
, name
, type
)
6112 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
6113 tree tdecl
= NULL_TREE
;
6115 if ((int) rid_index
< (int) CP_RID_MAX
)
6116 rname
= ridpointers
[(int) rid_index
];
6118 tname
= get_identifier (name
);
6120 TYPE_BUILT_IN (type
) = 1;
6124 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
6125 set_identifier_type_value (tname
, NULL_TREE
);
6126 if ((int) rid_index
< (int) CP_RID_MAX
)
6127 /* Built-in types live in the global namespace. */
6128 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
6130 if (rname
!= NULL_TREE
)
6132 if (tname
!= NULL_TREE
)
6134 set_identifier_type_value (rname
, NULL_TREE
);
6135 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
6139 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
6140 set_identifier_type_value (rname
, NULL_TREE
);
6145 /* Record one of the standard Java types.
6146 * Declare it as having the given NAME.
6147 * If SIZE > 0, it is the size of one of the integral types;
6148 * otherwise it is the negative of the size of one of the other types. */
6151 record_builtin_java_type (name
, size
)
6157 type
= make_signed_type (size
);
6158 else if (size
> -32)
6159 { /* "__java_char" or ""__java_boolean". */
6160 type
= make_unsigned_type (-size
);
6161 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
6164 { /* "__java_float" or ""__java_double". */
6165 type
= make_node (REAL_TYPE
);
6166 TYPE_PRECISION (type
) = - size
;
6169 record_builtin_type (CP_RID_MAX
, name
, type
);
6170 decl
= TYPE_NAME (type
);
6172 /* Suppress generate debug symbol entries for these types,
6173 since for normal C++ they are just clutter.
6174 However, push_lang_context undoes this if extern "Java" is seen. */
6175 DECL_IGNORED_P (decl
) = 1;
6177 TYPE_FOR_JAVA (type
) = 1;
6181 /* Push a type into the namespace so that the back-ends ignore it. */
6184 record_unknown_type (type
, name
)
6188 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
6189 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
6190 DECL_IGNORED_P (decl
) = 1;
6191 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
6192 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
6193 TYPE_ALIGN (type
) = 1;
6194 TYPE_USER_ALIGN (type
) = 0;
6195 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
6198 /* An string for which we should create an IDENTIFIER_NODE at
6201 typedef struct predefined_identifier
6203 /* The name of the identifier. */
6205 /* The place where the IDENTIFIER_NODE should be stored. */
6207 /* Non-zero if this is the name of a constructor or destructor. */
6209 } predefined_identifier
;
6211 /* Create all the predefined identifiers. */
6214 initialize_predefined_identifiers ()
6216 struct predefined_identifier
*pid
;
6218 /* A table of identifiers to create at startup. */
6219 static predefined_identifier predefined_identifiers
[] = {
6220 { "C++", &lang_name_cplusplus
, 0 },
6221 { "C", &lang_name_c
, 0 },
6222 { "Java", &lang_name_java
, 0 },
6223 { CTOR_NAME
, &ctor_identifier
, 1 },
6224 { "__base_ctor", &base_ctor_identifier
, 1 },
6225 { "__comp_ctor", &complete_ctor_identifier
, 1 },
6226 { DTOR_NAME
, &dtor_identifier
, 1 },
6227 { "__comp_dtor", &complete_dtor_identifier
, 1 },
6228 { "__base_dtor", &base_dtor_identifier
, 1 },
6229 { "__deleting_dtor", &deleting_dtor_identifier
, 1 },
6230 { VTABLE_DELTA2_NAME
, &delta2_identifier
, 0 },
6231 { VTABLE_DELTA_NAME
, &delta_identifier
, 0 },
6232 { IN_CHARGE_NAME
, &in_charge_identifier
, 0 },
6233 { VTABLE_INDEX_NAME
, &index_identifier
, 0 },
6234 { "nelts", &nelts_identifier
, 0 },
6235 { THIS_NAME
, &this_identifier
, 0 },
6236 { VTABLE_PFN_NAME
, &pfn_identifier
, 0 },
6237 { "__pfn_or_delta2", &pfn_or_delta2_identifier
, 0 },
6238 { "_vptr", &vptr_identifier
, 0 },
6239 { "__cp_push_exception", &cp_push_exception_identifier
, 0 },
6240 { "__vtt_parm", &vtt_parm_identifier
, 0 },
6241 { "std", &std_identifier
, 0 },
6245 for (pid
= predefined_identifiers
; pid
->name
; ++pid
)
6247 *pid
->node
= get_identifier (pid
->name
);
6248 if (pid
->ctor_or_dtor_p
)
6249 IDENTIFIER_CTOR_OR_DTOR_P (*pid
->node
) = 1;
6253 /* Create the predefined scalar types of C,
6254 and some nodes representing standard constants (0, 1, (void *)0).
6255 Initialize the global binding level.
6256 Make definitions for built-in primitive functions. */
6259 init_decl_processing ()
6262 int wchar_type_size
;
6263 tree array_domain_type
;
6265 /* Check to see that the user did not specify an invalid combination
6266 of command-line options. */
6267 if (flag_new_abi
&& !flag_vtable_thunks
)
6268 fatal ("the new ABI requires vtable thunks");
6270 /* Create all the identifiers we need. */
6271 initialize_predefined_identifiers ();
6273 /* Let the back-end now how to save and restore language-specific
6274 per-function globals. */
6275 init_lang_status
= &push_cp_function_context
;
6276 free_lang_status
= &pop_cp_function_context
;
6277 mark_lang_status
= &mark_cp_function_context
;
6283 /* Create the global variables. */
6284 push_to_top_level ();
6286 /* Enter the global namespace. */
6287 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
6288 push_namespace (get_identifier ("::"));
6289 global_namespace
= current_namespace
;
6290 current_lang_name
= NULL_TREE
;
6292 /* Adjust various flags based on command-line settings. */
6293 if (! flag_permissive
&& ! pedantic
)
6294 flag_pedantic_errors
= 1;
6295 if (!flag_no_inline
)
6296 flag_inline_trees
= 1;
6299 current_lang_name
= lang_name_c
;
6301 current_function_decl
= NULL_TREE
;
6302 current_binding_level
= NULL_BINDING_LEVEL
;
6303 free_binding_level
= NULL_BINDING_LEVEL
;
6305 build_common_tree_nodes (flag_signed_char
);
6307 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6308 TREE_TYPE (error_mark_list
) = error_mark_node
;
6310 /* Make the binding_level structure for global names. */
6312 global_binding_level
= current_binding_level
;
6313 /* The global level is the namespace level of ::. */
6314 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6315 declare_namespace_level ();
6317 /* Define `int' and `char' first so that dbx will output them first. */
6318 record_builtin_type (RID_INT
, NULL_PTR
, integer_type_node
);
6319 record_builtin_type (RID_CHAR
, "char", char_type_node
);
6321 /* `signed' is the same as `int' */
6322 record_builtin_type (RID_SIGNED
, NULL_PTR
, integer_type_node
);
6323 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
6324 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
6325 record_builtin_type (CP_RID_MAX
, "long unsigned int",
6326 long_unsigned_type_node
);
6327 record_builtin_type (CP_RID_MAX
, "unsigned long", long_unsigned_type_node
);
6328 record_builtin_type (CP_RID_MAX
, "long long int",
6329 long_long_integer_type_node
);
6330 record_builtin_type (CP_RID_MAX
, "long long unsigned int",
6331 long_long_unsigned_type_node
);
6332 record_builtin_type (CP_RID_MAX
, "long long unsigned",
6333 long_long_unsigned_type_node
);
6334 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
6335 record_builtin_type (CP_RID_MAX
, "short unsigned int",
6336 short_unsigned_type_node
);
6337 record_builtin_type (CP_RID_MAX
, "unsigned short",
6338 short_unsigned_type_node
);
6341 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE
)));
6343 /* Define both `signed char' and `unsigned char'. */
6344 record_builtin_type (CP_RID_MAX
, "signed char", signed_char_type_node
);
6345 record_builtin_type (CP_RID_MAX
, "unsigned char", unsigned_char_type_node
);
6347 /* `unsigned long' is the standard type for sizeof.
6348 Note that stddef.h uses `unsigned long',
6349 and this must agree, even if long and int are the same size. */
6351 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE
))));
6353 /* Create the widest literal types. */
6354 widest_integer_literal_type_node
= make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
6355 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6356 widest_integer_literal_type_node
));
6358 widest_unsigned_literal_type_node
= make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
6359 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6360 widest_unsigned_literal_type_node
));
6362 /* These are types that type_for_size and type_for_mode use. */
6363 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intQI_type_node
));
6364 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intHI_type_node
));
6365 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intSI_type_node
));
6366 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intDI_type_node
));
6367 #if HOST_BITS_PER_WIDE_INT >= 64
6368 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__int128_t"), intTI_type_node
));
6370 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intQI_type_node
));
6371 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intHI_type_node
));
6372 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intSI_type_node
));
6373 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intDI_type_node
));
6374 #if HOST_BITS_PER_WIDE_INT >= 64
6375 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__uint128_t"), unsigned_intTI_type_node
));
6378 build_common_tree_nodes_2 (flag_short_double
);
6380 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6381 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6382 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6383 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6384 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6385 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6386 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6387 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6389 integer_two_node
= build_int_2 (2, 0);
6390 TREE_TYPE (integer_two_node
) = integer_type_node
;
6391 integer_three_node
= build_int_2 (3, 0);
6392 TREE_TYPE (integer_three_node
) = integer_type_node
;
6394 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6395 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6396 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6397 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6398 TYPE_PRECISION (boolean_type_node
) = 1;
6399 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6400 boolean_false_node
= build_int_2 (0, 0);
6401 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6402 boolean_true_node
= build_int_2 (1, 0);
6403 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6405 signed_size_zero_node
= build_int_2 (0, 0);
6406 record_builtin_type (RID_FLOAT
, NULL_PTR
, float_type_node
);
6407 record_builtin_type (RID_DOUBLE
, NULL_PTR
, double_type_node
);
6408 record_builtin_type (CP_RID_MAX
, "long double", long_double_type_node
);
6410 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex int"),
6411 complex_integer_type_node
));
6412 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex float"),
6413 complex_float_type_node
));
6414 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex double"),
6415 complex_double_type_node
));
6416 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
6417 complex_long_double_type_node
));
6419 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6421 record_builtin_type (RID_VOID
, NULL_PTR
, void_type_node
);
6422 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
6423 TREE_PARMLIST (void_list_node
) = 1;
6425 /* Used for expressions that do nothing, but are not errors. */
6426 void_zero_node
= build_int_2 (0, 0);
6427 TREE_TYPE (void_zero_node
) = void_type_node
;
6429 string_type_node
= build_pointer_type (char_type_node
);
6430 const_string_type_node
6431 = build_pointer_type (build_qualified_type (char_type_node
,
6433 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6435 record_builtin_type (CP_RID_MAX
, NULL_PTR
, string_type_node
);
6438 /* Make a type to be the domain of a few array types
6439 whose domains don't really matter.
6440 200 is small enough that it always fits in size_t. */
6441 array_domain_type
= build_index_type (build_int_2 (200, 0));
6443 /* Make a type for arrays of characters.
6444 With luck nothing will ever really depend on the length of this
6446 char_array_type_node
6447 = build_array_type (char_type_node
, array_domain_type
);
6449 /* Likewise for arrays of ints. */
6451 = build_array_type (integer_type_node
, array_domain_type
);
6454 delta_type_node
= ptrdiff_type_node
;
6455 else if (flag_huge_objects
)
6456 delta_type_node
= long_integer_type_node
;
6458 delta_type_node
= short_integer_type_node
;
6461 vtable_index_type
= ptrdiff_type_node
;
6463 vtable_index_type
= delta_type_node
;
6465 default_function_type
6466 = build_function_type (integer_type_node
, NULL_TREE
);
6468 ptr_type_node
= build_pointer_type (void_type_node
);
6470 = build_pointer_type (build_qualified_type (void_type_node
,
6472 vtt_parm_type
= build_pointer_type (const_ptr_type_node
);
6473 c_common_nodes_and_builtins (1, flag_no_builtin
, flag_no_nonansi_builtin
);
6474 lang_type_promotes_to
= convert_type_from_ellipsis
;
6477 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6479 /* C++ extensions */
6481 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6482 record_unknown_type (unknown_type_node
, "unknown type");
6484 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6485 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6487 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6489 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6491 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6492 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6494 /* This is special for C++ so functions can be overloaded. */
6495 wchar_type_node
= get_identifier (flag_short_wchar
6496 ? "short unsigned int"
6498 wchar_type_node
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (wchar_type_node
));
6499 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
6500 if (TREE_UNSIGNED (wchar_type_node
))
6501 wchar_type_node
= make_signed_type (wchar_type_size
);
6503 wchar_type_node
= make_unsigned_type (wchar_type_size
);
6504 record_builtin_type (RID_WCHAR
, "__wchar_t", wchar_type_node
);
6506 /* Artificial declaration of wchar_t -- can be bashed */
6507 wchar_decl_node
= build_decl (TYPE_DECL
, get_identifier ("wchar_t"),
6509 pushdecl (wchar_decl_node
);
6511 /* This is for wide string constants. */
6512 wchar_array_type_node
6513 = build_array_type (wchar_type_node
, array_domain_type
);
6515 if (flag_vtable_thunks
)
6517 /* Make sure we get a unique function type, so we can give
6518 its pointer type a name. (This wins for gdb.) */
6519 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6520 TREE_TYPE (vfunc_type
) = integer_type_node
;
6521 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6522 layout_type (vfunc_type
);
6524 vtable_entry_type
= build_pointer_type (vfunc_type
);
6528 vtable_entry_type
= make_aggr_type (RECORD_TYPE
);
6529 fields
[0] = build_decl (FIELD_DECL
, delta_identifier
,
6531 fields
[1] = build_decl (FIELD_DECL
, index_identifier
,
6533 fields
[2] = build_decl (FIELD_DECL
, pfn_identifier
,
6535 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6538 /* Make this part of an invisible union. */
6539 fields
[3] = copy_node (fields
[2]);
6540 TREE_TYPE (fields
[3]) = delta_type_node
;
6541 DECL_NAME (fields
[3]) = delta2_identifier
;
6542 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6543 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6544 DECL_SIZE_UNIT (fields
[3]) = TYPE_SIZE_UNIT (delta_type_node
);
6545 TREE_UNSIGNED (fields
[3]) = 0;
6546 TREE_CHAIN (fields
[2]) = fields
[3];
6547 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6550 record_builtin_type (CP_RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6553 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6554 layout_type (vtbl_type_node
);
6555 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6556 record_builtin_type (CP_RID_MAX
, NULL_PTR
, vtbl_type_node
);
6557 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6558 layout_type (vtbl_ptr_type_node
);
6559 record_builtin_type (CP_RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6561 std_node
= build_decl (NAMESPACE_DECL
,
6563 ? get_identifier ("fake std") : std_identifier
,
6565 pushdecl (std_node
);
6569 push_namespace (get_identifier ("__cxxabiv1"));
6570 abi_node
= current_namespace
;
6574 global_type_node
= make_node (LANG_TYPE
);
6575 record_unknown_type (global_type_node
, "global type");
6578 current_lang_name
= lang_name_cplusplus
;
6581 tree bad_alloc_type_node
, newtype
, deltype
;
6583 push_namespace (get_identifier ("std"));
6584 bad_alloc_type_node
= xref_tag
6585 (class_type_node
, get_identifier ("bad_alloc"), 1);
6588 newtype
= build_exception_variant
6589 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6590 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6591 push_cp_library_fn (NEW_EXPR
, newtype
);
6592 push_cp_library_fn (VEC_NEW_EXPR
, newtype
);
6593 global_delete_fndecl
= push_cp_library_fn (DELETE_EXPR
, deltype
);
6594 push_cp_library_fn (VEC_DELETE_EXPR
, deltype
);
6598 = build_library_fn_ptr ("__pure_virtual", void_ftype
);
6600 /* Perform other language dependent initializations. */
6601 init_class_processing ();
6602 init_init_processing ();
6603 init_search_processing ();
6604 init_rtti_processing ();
6606 if (flag_exceptions
)
6607 init_exception_processing ();
6610 flag_inline_functions
= 0;
6613 if (! supports_one_only ())
6616 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6617 make_fname_decl
= cp_make_fname_decl
;
6618 declare_function_name ();
6620 /* Prepare to check format strings against argument lists. */
6621 init_function_format_info ();
6623 /* Show we use EH for cleanups. */
6624 using_eh_for_cleanups ();
6626 print_error_function
= lang_print_error_function
;
6627 valid_lang_attribute
= cp_valid_lang_attribute
;
6629 /* Maintain consistency. Perhaps we should just complain if they
6630 say -fwritable-strings? */
6631 if (flag_writable_strings
)
6632 flag_const_strings
= 0;
6634 /* Add GC roots for all of our global variables. */
6635 ggc_add_tree_root (c_global_trees
, sizeof c_global_trees
/ sizeof(tree
));
6636 ggc_add_tree_root (cp_global_trees
, sizeof cp_global_trees
/ sizeof(tree
));
6637 ggc_add_tree_root (&integer_three_node
, 1);
6638 ggc_add_tree_root (&integer_two_node
, 1);
6639 ggc_add_tree_root (&signed_size_zero_node
, 1);
6640 ggc_add_tree_root (&size_one_node
, 1);
6641 ggc_add_tree_root (&size_zero_node
, 1);
6642 ggc_add_root (&global_binding_level
, 1, sizeof global_binding_level
,
6643 mark_binding_level
);
6644 ggc_add_root (&scope_chain
, 1, sizeof scope_chain
, &mark_saved_scope
);
6645 ggc_add_tree_root (&static_ctors
, 1);
6646 ggc_add_tree_root (&static_dtors
, 1);
6647 ggc_add_tree_root (&lastiddecl
, 1);
6649 ggc_add_tree_root (&last_function_parm_tags
, 1);
6650 ggc_add_tree_root (¤t_function_return_value
, 1);
6651 ggc_add_tree_root (¤t_function_parms
, 1);
6652 ggc_add_tree_root (¤t_function_parm_tags
, 1);
6653 ggc_add_tree_root (&last_function_parms
, 1);
6654 ggc_add_tree_root (&error_mark_list
, 1);
6656 ggc_add_tree_root (&global_namespace
, 1);
6657 ggc_add_tree_root (&global_type_node
, 1);
6658 ggc_add_tree_root (&anonymous_namespace_name
, 1);
6660 ggc_add_tree_root (&got_object
, 1);
6661 ggc_add_tree_root (&got_scope
, 1);
6663 ggc_add_tree_root (¤t_lang_name
, 1);
6664 ggc_add_tree_root (&static_aggregates
, 1);
6667 /* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the
6668 decl, NAME is the initialization string and TYPE_DEP indicates whether
6669 NAME depended on the type of the function. We make use of that to detect
6670 __PRETTY_FUNCTION__ inside a template fn. Because we build a tree for
6671 the function before emitting any of it, we don't need to treat the
6672 VAR_DECL specially. We can decide whether to emit it later, if it was
6676 cp_make_fname_decl (id
, name
, type_dep
)
6681 tree decl
, type
, init
;
6682 size_t length
= strlen (name
);
6683 tree domain
= NULL_TREE
;
6685 if (!processing_template_decl
)
6688 domain
= build_index_type (build_int_2 (length
, 0));
6690 type
= build_cplus_array_type
6691 (build_qualified_type (char_type_node
, TYPE_QUAL_CONST
),
6694 decl
= build_decl (VAR_DECL
, id
, type
);
6695 TREE_STATIC (decl
) = 1;
6696 TREE_READONLY (decl
) = 1;
6697 DECL_SOURCE_LINE (decl
) = 0;
6698 DECL_ARTIFICIAL (decl
) = 1;
6699 DECL_IN_SYSTEM_HEADER (decl
) = 1;
6701 if (processing_template_decl
)
6702 decl
= push_template_decl (decl
);
6705 init
= build (FUNCTION_NAME
, type
);
6706 DECL_PRETTY_FUNCTION_P (decl
) = 1;
6710 init
= build_string (length
+ 1, name
);
6711 TREE_TYPE (init
) = type
;
6713 DECL_INITIAL (decl
) = init
;
6714 cp_finish_decl (decl
, init
, NULL_TREE
, LOOKUP_ONLYCONVERTING
);
6716 /* We will have to make sure we only emit this, if it is actually used. */
6720 /* Function to print any language-specific context for an error message. */
6723 lang_print_error_function (file
)
6726 default_print_error_function (file
);
6727 maybe_print_template_context ();
6730 /* Entry point for the benefit of c_common_nodes_and_builtins.
6732 Make a definition for a builtin function named NAME and whose data type
6733 is TYPE. TYPE should be a function type with argument types.
6735 CLASS and CODE tell later passes how to compile calls to this function.
6736 See tree.h for possible values.
6738 If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6739 the name to be called if we can't opencode the function. */
6742 builtin_function (name
, type
, code
, class, libname
)
6746 enum built_in_class
class;
6747 const char *libname
;
6749 tree decl
= build_library_fn_1 (get_identifier (name
), ERROR_MARK
, type
);
6750 DECL_BUILT_IN_CLASS (decl
) = class;
6751 DECL_FUNCTION_CODE (decl
) = code
;
6753 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6755 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6756 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6757 function in the namespace. */
6760 DECL_ASSEMBLER_NAME (decl
) = get_identifier (libname
);
6761 make_function_rtl (decl
);
6763 /* Warn if a function in the namespace for users
6764 is used without an occasion to consider it declared. */
6765 if (name
[0] != '_' || name
[1] != '_')
6766 DECL_ANTICIPATED (decl
) = 1;
6771 /* Generate a FUNCTION_DECL with the typical flags for a runtime library
6772 function. Not called directly. */
6775 build_library_fn_1 (name
, operator_code
, type
)
6777 enum tree_code operator_code
;
6780 tree fn
= build_lang_decl (FUNCTION_DECL
, name
, type
);
6781 DECL_EXTERNAL (fn
) = 1;
6782 TREE_PUBLIC (fn
) = 1;
6783 DECL_ARTIFICIAL (fn
) = 1;
6784 TREE_NOTHROW (fn
) = 1;
6785 SET_OVERLOADED_OPERATOR_CODE (fn
, operator_code
);
6789 /* Returns the _DECL for a library function with C linkage.
6790 We assume that such functions never throw; if this is incorrect,
6791 callers should unset TREE_NOTHROW. */
6794 build_library_fn (name
, type
)
6798 tree fn
= build_library_fn_1 (name
, ERROR_MARK
, type
);
6799 make_function_rtl (fn
);
6803 /* Returns the _DECL for a library function with C++ linkage. */
6806 build_cp_library_fn (name
, operator_code
, type
)
6808 enum tree_code operator_code
;
6811 tree fn
= build_library_fn_1 (name
, operator_code
, type
);
6812 TREE_NOTHROW (fn
) = TYPE_NOTHROW_P (type
);
6813 DECL_CONTEXT (fn
) = FROB_CONTEXT (current_namespace
);
6814 set_mangled_name_for_decl (fn
);
6815 make_function_rtl (fn
);
6819 /* Like build_library_fn, but takes a C string instead of an
6823 build_library_fn_ptr (name
, type
)
6827 return build_library_fn (get_identifier (name
), type
);
6830 /* Like build_cp_library_fn, but takes a C string instead of an
6834 build_cp_library_fn_ptr (name
, type
)
6838 return build_cp_library_fn (get_identifier (name
), ERROR_MARK
, type
);
6841 /* Like build_library_fn, but also pushes the function so that we will
6842 be able to find it via IDENTIFIER_GLOBAL_VALUE. */
6845 push_library_fn (name
, type
)
6848 tree fn
= build_library_fn (name
, type
);
6849 pushdecl_top_level (fn
);
6853 /* Like build_cp_library_fn, but also pushes the function so that it
6854 will be found by normal lookup. */
6857 push_cp_library_fn (operator_code
, type
)
6858 enum tree_code operator_code
;
6861 tree fn
= build_cp_library_fn (ansi_opname (operator_code
),
6868 /* Like push_library_fn, but takes a TREE_LIST of parm types rather than
6872 push_void_library_fn (name
, parmtypes
)
6873 tree name
, parmtypes
;
6875 tree type
= build_function_type (void_type_node
, parmtypes
);
6876 return push_library_fn (name
, type
);
6879 /* Like push_library_fn, but also note that this function throws
6880 and does not return. Used for __throw_foo and the like. */
6883 push_throw_library_fn (name
, type
)
6886 tree fn
= push_library_fn (name
, type
);
6887 TREE_THIS_VOLATILE (fn
) = 1;
6888 TREE_NOTHROW (fn
) = 0;
6892 /* When we call finish_struct for an anonymous union, we create
6893 default copy constructors and such. But, an anonymous union
6894 shouldn't have such things; this function undoes the damage to the
6895 anonymous union type T.
6897 (The reason that we create the synthesized methods is that we don't
6898 distinguish `union { int i; }' from `typedef union { int i; } U'.
6899 The first is an anonymous union; the second is just an ordinary
6903 fixup_anonymous_aggr (t
)
6908 /* Wipe out memory of synthesized methods */
6909 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6910 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6911 TYPE_HAS_INIT_REF (t
) = 0;
6912 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6913 TYPE_HAS_ASSIGN_REF (t
) = 0;
6914 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6916 /* Splice the implicitly generated functions out of the TYPE_METHODS
6918 q
= &TYPE_METHODS (t
);
6921 if (DECL_ARTIFICIAL (*q
))
6922 *q
= TREE_CHAIN (*q
);
6924 q
= &TREE_CHAIN (*q
);
6927 /* ISO C++ 9.5.3. Anonymous unions may not have function members. */
6928 if (TYPE_METHODS (t
))
6929 error ("an anonymous union cannot have function members");
6932 /* Make sure that a declaration with no declarator is well-formed, i.e.
6933 just defines a tagged type or anonymous union.
6935 Returns the type defined, if any. */
6938 check_tag_decl (declspecs
)
6943 tree ob_modifier
= NULL_TREE
;
6945 register tree t
= NULL_TREE
;
6947 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6949 register tree value
= TREE_VALUE (link
);
6952 || (TREE_CODE (value
) == IDENTIFIER_NODE
6953 && IDENTIFIER_GLOBAL_VALUE (value
)
6954 && TYPE_P (IDENTIFIER_GLOBAL_VALUE (value
))))
6958 if (IS_AGGR_TYPE (value
) || TREE_CODE (value
) == ENUMERAL_TYPE
)
6960 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6964 else if (value
== ridpointers
[(int) RID_FRIEND
])
6966 if (current_class_type
== NULL_TREE
6967 || current_scope () != current_class_type
)
6968 ob_modifier
= value
;
6972 else if (value
== ridpointers
[(int) RID_STATIC
]
6973 || value
== ridpointers
[(int) RID_EXTERN
]
6974 || value
== ridpointers
[(int) RID_AUTO
]
6975 || value
== ridpointers
[(int) RID_REGISTER
]
6976 || value
== ridpointers
[(int) RID_INLINE
]
6977 || value
== ridpointers
[(int) RID_VIRTUAL
]
6978 || value
== ridpointers
[(int) RID_CONST
]
6979 || value
== ridpointers
[(int) RID_VOLATILE
]
6980 || value
== ridpointers
[(int) RID_EXPLICIT
])
6981 ob_modifier
= value
;
6985 error ("multiple types in one declaration");
6987 if (t
== NULL_TREE
&& ! saw_friend
)
6988 pedwarn ("declaration does not declare anything");
6990 /* Check for an anonymous union. We're careful
6991 accessing TYPE_IDENTIFIER because some built-in types, like
6992 pointer-to-member types, do not have TYPE_NAME. */
6993 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
6995 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
6997 /* Anonymous unions are objects, so they can have specifiers. */;
6998 SET_ANON_AGGR_TYPE_P (t
);
7000 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
7001 pedwarn ("ISO C++ prohibits anonymous structs");
7004 else if (ob_modifier
)
7006 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
7007 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
7008 cp_error ("`%D' can only be specified for functions", ob_modifier
);
7009 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
7010 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
7011 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
7012 cp_error ("`%D' can only be specified for constructors",
7015 cp_error ("`%D' can only be specified for objects and functions",
7022 /* Called when a declaration is seen that contains no names to declare.
7023 If its type is a reference to a structure, union or enum inherited
7024 from a containing scope, shadow that tag name for the current scope
7025 with a forward reference.
7026 If its type defines a new named structure or union
7027 or defines an enum, it is valid but we need not do anything here.
7028 Otherwise, it is an error.
7030 C++: may have to grok the declspecs to learn about static,
7031 complain for anonymous unions. */
7034 shadow_tag (declspecs
)
7037 tree t
= check_tag_decl (declspecs
);
7040 maybe_process_partial_specialization (t
);
7042 /* This is where the variables in an anonymous union are
7043 declared. An anonymous union declaration looks like:
7045 because there is no declarator after the union, the parser
7046 sends that declaration here. */
7047 if (t
&& ANON_AGGR_TYPE_P (t
))
7049 fixup_anonymous_aggr (t
);
7051 if (TYPE_FIELDS (t
))
7053 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
7055 finish_anon_union (decl
);
7060 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
7063 groktypename (typename
)
7066 if (TREE_CODE (typename
) != TREE_LIST
)
7068 return grokdeclarator (TREE_VALUE (typename
),
7069 TREE_PURPOSE (typename
),
7070 TYPENAME
, 0, NULL_TREE
);
7073 /* Decode a declarator in an ordinary declaration or data definition.
7074 This is called as soon as the type information and variable name
7075 have been parsed, before parsing the initializer if any.
7076 Here we create the ..._DECL node, fill in its type,
7077 and put it on the list of decls for the current context.
7078 The ..._DECL node is returned as the value.
7080 Exception: for arrays where the length is not specified,
7081 the type is left null, to be filled in by `cp_finish_decl'.
7083 Function definitions do not come here; they go to start_function
7084 instead. However, external and forward declarations of functions
7085 do go through here. Structure field declarations are done by
7086 grokfield and not through here. */
7089 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
7090 tree declarator
, declspecs
;
7092 tree attributes
, prefix_attributes
;
7095 register tree type
, tem
;
7097 extern int have_extern_spec
;
7098 extern int used_extern_spec
;
7102 /* See code below that used this. */
7103 int init_written
= initialized
;
7106 /* This should only be done once on the top most decl. */
7107 if (have_extern_spec
&& !used_extern_spec
)
7109 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"),
7111 used_extern_spec
= 1;
7114 if (attributes
|| prefix_attributes
)
7115 attrlist
= build_tree_list (attributes
, prefix_attributes
);
7117 attrlist
= NULL_TREE
;
7119 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
7122 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
7125 type
= TREE_TYPE (decl
);
7127 if (type
== error_mark_node
)
7130 context
= DECL_CONTEXT (decl
);
7132 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
7133 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
7135 /* When parsing the initializer, lookup should use the object's
7137 push_decl_namespace (context
);
7140 /* We are only interested in class contexts, later. */
7141 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
7142 context
= NULL_TREE
;
7145 /* Is it valid for this decl to have an initializer at all?
7146 If not, set INITIALIZED to zero, which will indirectly
7147 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7148 switch (TREE_CODE (decl
))
7151 /* typedef foo = bar means give foo the same type as bar.
7152 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
7153 Any other case of an initialization in a TYPE_DECL is an error. */
7154 if (pedantic
|| list_length (declspecs
) > 1)
7156 cp_error ("typedef `%D' is initialized", decl
);
7162 cp_error ("function `%#D' is initialized like a variable", decl
);
7172 if (! toplevel_bindings_p ()
7173 && DECL_EXTERNAL (decl
))
7174 cp_warning ("declaration of `%#D' has `extern' and is initialized",
7176 DECL_EXTERNAL (decl
) = 0;
7177 if (toplevel_bindings_p ())
7178 TREE_STATIC (decl
) = 1;
7180 /* Tell `pushdecl' this is an initialized decl
7181 even though we don't yet have the initializer expression.
7182 Also tell `cp_finish_decl' it may store the real initializer. */
7183 DECL_INITIAL (decl
) = error_mark_node
;
7186 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
7187 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
7190 /* Set attributes here so if duplicate decl, will have proper attributes. */
7191 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
7193 if (context
&& COMPLETE_TYPE_P (complete_type (context
)))
7195 push_nested_class (context
, 2);
7197 if (TREE_CODE (decl
) == VAR_DECL
)
7199 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
7200 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
7201 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
7204 if (DECL_CONTEXT (field
) != context
)
7206 cp_pedwarn ("ISO C++ does not permit `%T::%D' to be defined as `%T::%D'",
7207 DECL_CONTEXT (field
), DECL_NAME (decl
),
7208 context
, DECL_NAME (decl
));
7209 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
7211 /* Static data member are tricky; an in-class initialization
7212 still doesn't provide a definition, so the in-class
7213 declaration will have DECL_EXTERNAL set, but will have an
7214 initialization. Thus, duplicate_decls won't warn
7215 about this situation, and so we check here. */
7216 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
7217 cp_error ("duplicate initialization of %D", decl
);
7218 if (duplicate_decls (decl
, field
))
7224 tree field
= check_classfn (context
, decl
);
7225 if (field
&& duplicate_decls (decl
, field
))
7229 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
7230 DECL_IN_AGGR_P (decl
) = 0;
7231 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
7232 || CLASSTYPE_TEMPLATE_INSTANTIATION (context
))
7234 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
7235 /* [temp.expl.spec] An explicit specialization of a static data
7236 member of a template is a definition if the declaration
7237 includes an initializer; otherwise, it is a declaration.
7239 We check for processing_specialization so this only applies
7240 to the new specialization syntax. */
7241 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
7242 DECL_EXTERNAL (decl
) = 1;
7245 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
7246 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
7250 /* Enter this declaration into the symbol table. */
7251 tem
= maybe_push_decl (decl
);
7253 if (processing_template_decl
)
7254 tem
= push_template_decl (tem
);
7256 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7257 /* Tell the back-end to use or not use .common as appropriate. If we say
7258 -fconserve-space, we want this to save .data space, at the expense of
7259 wrong semantics. If we say -fno-conserve-space, we want this to
7260 produce errors about redefs; to do this we force variables into the
7262 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
7265 if (! processing_template_decl
)
7275 tree type
= TREE_TYPE (decl
);
7276 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
7278 if (type
== error_mark_node
)
7281 /* If this type of object needs a cleanup, but we're not allowed to
7282 add any more objects with cleanups to the current scope, create a
7283 new binding level. */
7284 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
7285 && current_binding_level
->more_cleanups_ok
== 0)
7287 keep_next_level (2);
7290 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/1);
7294 /* Is it valid for this decl to have an initializer at all?
7295 If not, set INITIALIZED to zero, which will indirectly
7296 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7298 /* Don't allow initializations for incomplete types except for
7299 arrays which might be completed by the initialization. */
7300 if (COMPLETE_TYPE_P (complete_type (type
)))
7301 ; /* A complete type is ok. */
7302 else if (TREE_CODE (type
) != ARRAY_TYPE
)
7304 cp_error ("variable `%#D' has initializer but incomplete type",
7307 type
= TREE_TYPE (decl
) = error_mark_node
;
7309 else if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (type
))))
7311 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
7312 cp_error ("elements of array `%#D' have incomplete type", decl
);
7313 /* else we already gave an error in start_decl. */
7319 && TREE_CODE (decl
) != TYPE_DECL
7320 && TREE_CODE (decl
) != TEMPLATE_DECL
7321 && type
!= error_mark_node
7322 && IS_AGGR_TYPE (type
)
7323 && ! DECL_EXTERNAL (decl
))
7325 if ((! processing_template_decl
|| ! uses_template_parms (type
))
7326 && !COMPLETE_TYPE_P (complete_type (type
)))
7328 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
7330 /* Change the type so that assemble_variable will give
7331 DECL an rtl we can live with: (mem (const_int 0)). */
7332 type
= TREE_TYPE (decl
) = error_mark_node
;
7336 /* If any base type in the hierarchy of TYPE needs a constructor,
7337 then we set initialized to 1. This way any nodes which are
7338 created for the purposes of initializing this aggregate
7339 will live as long as it does. This is necessary for global
7340 aggregates which do not have their initializers processed until
7341 the end of the file. */
7342 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
7347 DECL_INITIAL (decl
) = NULL_TREE
;
7350 /* Handle initialization of references.
7351 These three arguments are from `cp_finish_decl', and have the
7352 same meaning here that they do there.
7354 Quotes on semantics can be found in ARM 8.4.3. */
7357 grok_reference_init (decl
, type
, init
)
7358 tree decl
, type
, init
;
7362 if (init
== NULL_TREE
)
7364 if ((DECL_LANG_SPECIFIC (decl
) == 0
7365 || DECL_IN_AGGR_P (decl
) == 0)
7366 && ! DECL_THIS_EXTERN (decl
))
7367 cp_error ("`%D' declared as reference but not initialized", decl
);
7371 if (init
== error_mark_node
)
7374 if (TREE_CODE (init
) == CONSTRUCTOR
)
7376 cp_error ("ISO C++ forbids use of initializer list to initialize reference `%D'", decl
);
7380 if (TREE_CODE (init
) == TREE_LIST
)
7381 init
= build_compound_expr (init
);
7383 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
7384 init
= convert_from_reference (init
);
7386 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
7387 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
7389 /* Note: default conversion is only called in very special cases. */
7390 init
= default_conversion (init
);
7393 /* Convert INIT to the reference type TYPE. This may involve the
7394 creation of a temporary, whose lifetime must be the same as that
7395 of the reference. If so, a DECL_STMT for the temporary will be
7396 added just after the DECL_STMT for DECL. That's why we don't set
7397 DECL_INITIAL for local references (instead assigning to them
7398 explicitly); we need to allow the temporary to be initialized
7400 tmp
= convert_to_reference
7401 (type
, init
, CONV_IMPLICIT
,
7402 LOOKUP_ONLYCONVERTING
|LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
,
7405 if (tmp
== error_mark_node
)
7407 else if (tmp
!= NULL_TREE
)
7410 tmp
= save_expr (tmp
);
7411 if (building_stmt_tree ())
7413 /* Initialize the declaration. */
7414 tmp
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, tmp
);
7415 finish_expr_stmt (tmp
);
7418 DECL_INITIAL (decl
) = tmp
;
7422 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7426 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
7428 expand_static_init (decl
, DECL_INITIAL (decl
));
7429 DECL_INITIAL (decl
) = NULL_TREE
;
7434 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7435 mucking with forces it does not comprehend (i.e. initialization with a
7436 constructor). If we are at global scope and won't go into COMMON, fill
7437 it in with a dummy CONSTRUCTOR to force the variable into .data;
7438 otherwise we can use error_mark_node. */
7441 obscure_complex_init (decl
, init
)
7444 if (! flag_no_inline
&& TREE_STATIC (decl
))
7446 if (extract_init (decl
, init
))
7450 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7451 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7452 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7456 DECL_INITIAL (decl
) = error_mark_node
;
7461 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7462 array until we finish parsing the initializer. If that's the
7463 situation we're in, update DECL accordingly. */
7466 maybe_deduce_size_from_array_init (decl
, init
)
7470 tree type
= TREE_TYPE (decl
);
7472 if (TREE_CODE (type
) == ARRAY_TYPE
7473 && TYPE_DOMAIN (type
) == NULL_TREE
7474 && TREE_CODE (decl
) != TYPE_DECL
)
7477 = (TREE_STATIC (decl
)
7478 /* Even if pedantic, an external linkage array
7479 may have incomplete type at first. */
7480 ? pedantic
&& ! DECL_EXTERNAL (decl
)
7481 : !DECL_EXTERNAL (decl
));
7482 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7483 int failure
= complete_array_type (type
, initializer
, do_default
);
7486 cp_error ("initializer fails to determine size of `%D'", decl
);
7491 cp_error ("array size missing in `%D'", decl
);
7492 /* If a `static' var's size isn't known, make it extern as
7493 well as static, so it does not get allocated. If it's not
7494 `static', then don't mark it extern; finish_incomplete_decl
7495 will give it a default size and it will get allocated. */
7496 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7497 DECL_EXTERNAL (decl
) = 1;
7500 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7501 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7503 cp_error ("zero-size array `%D'", decl
);
7505 layout_decl (decl
, 0);
7509 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7510 any appropriate error messages regarding the layout. */
7513 layout_var_decl (decl
)
7516 tree type
= TREE_TYPE (decl
);
7518 tree ttype
= target_type (type
);
7521 /* If we haven't already layed out this declaration, do so now.
7522 Note that we must not call complete type for an external object
7523 because it's type might involve templates that we are not
7524 supposed to isntantiate yet. (And it's perfectly legal to say
7525 `extern X x' for some incomplete type `X'.) */
7526 if (!DECL_EXTERNAL (decl
))
7527 complete_type (type
);
7528 if (!DECL_SIZE (decl
) && COMPLETE_TYPE_P (type
))
7529 layout_decl (decl
, 0);
7531 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7533 /* An automatic variable with an incomplete type: that is an error.
7534 Don't talk about array types here, since we took care of that
7535 message in grokdeclarator. */
7536 cp_error ("storage size of `%D' isn't known", decl
);
7537 TREE_TYPE (decl
) = error_mark_node
;
7540 /* Keep this code around in case we later want to control debug info
7541 based on whether a type is "used". (jason 1999-11-11) */
7543 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7544 /* Let debugger know it should output info for this type. */
7545 note_debug_info_needed (ttype
);
7547 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7548 note_debug_info_needed (DECL_CONTEXT (decl
));
7551 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7552 && DECL_SIZE (decl
) != NULL_TREE
7553 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7555 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7556 constant_expression_warning (DECL_SIZE (decl
));
7558 cp_error ("storage size of `%D' isn't constant", decl
);
7562 /* If a local static variable is declared in an inline function, or if
7563 we have a weak definition, we must endeavor to create only one
7564 instance of the variable at link-time. */
7567 maybe_commonize_var (decl
)
7570 /* Static data in a function with comdat linkage also has comdat
7572 if (TREE_STATIC (decl
)
7573 /* Don't mess with __FUNCTION__. */
7574 && ! DECL_ARTIFICIAL (decl
)
7575 && current_function_decl
7576 && DECL_CONTEXT (decl
) == current_function_decl
7577 && (DECL_THIS_INLINE (current_function_decl
)
7578 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7579 && TREE_PUBLIC (current_function_decl
))
7581 /* Rather than try to get this right with inlining, we suppress
7582 inlining of such functions. */
7583 current_function_cannot_inline
7584 = "function with static variable cannot be inline";
7586 /* If flag_weak, we don't need to mess with this, as we can just
7587 make the function weak, and let it refer to its unique local
7588 copy. This works because we don't allow the function to be
7592 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7594 TREE_PUBLIC (decl
) = 1;
7595 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7597 else if (DECL_INITIAL (decl
) == NULL_TREE
7598 || DECL_INITIAL (decl
) == error_mark_node
)
7600 TREE_PUBLIC (decl
) = 1;
7601 DECL_COMMON (decl
) = 1;
7603 /* else we lose. We can only do this if we can use common,
7604 which we can't if it has been initialized. */
7606 if (TREE_PUBLIC (decl
))
7607 DECL_ASSEMBLER_NAME (decl
)
7608 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7611 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7612 cp_warning_at (" you can work around this by removing the initializer", decl
);
7616 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7617 /* Set it up again; we might have set DECL_INITIAL since the last
7619 comdat_linkage (decl
);
7622 /* Issue an error message if DECL is an uninitialized const variable. */
7625 check_for_uninitialized_const_var (decl
)
7628 tree type
= TREE_TYPE (decl
);
7630 /* ``Unless explicitly declared extern, a const object does not have
7631 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7633 if (TREE_CODE (decl
) == VAR_DECL
7634 && TREE_CODE (type
) != REFERENCE_TYPE
7635 && CP_TYPE_CONST_P (type
)
7636 && !TYPE_NEEDS_CONSTRUCTING (type
)
7637 && !DECL_INITIAL (decl
))
7638 cp_error ("uninitialized const `%D'", decl
);
7641 /* Verify INIT (the initializer for DECL), and record the
7642 initialization in DECL_INITIAL, if appropriate. Returns a new
7646 check_initializer (decl
, init
)
7652 if (TREE_CODE (decl
) == FIELD_DECL
)
7655 type
= TREE_TYPE (decl
);
7657 /* If `start_decl' didn't like having an initialization, ignore it now. */
7658 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7661 /* Check the initializer. */
7664 /* Things that are going to be initialized need to have complete
7666 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7668 if (type
== error_mark_node
)
7669 /* We will have already complained. */
7671 else if (COMPLETE_TYPE_P (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7673 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7676 else if (TREE_CODE (type
) == ARRAY_TYPE
7677 && !COMPLETE_TYPE_P (TREE_TYPE (type
)))
7679 cp_error ("elements of array `%#D' have incomplete type", decl
);
7682 else if (!COMPLETE_TYPE_P (type
))
7684 cp_error ("`%D' has incomplete type", decl
);
7685 TREE_TYPE (decl
) = error_mark_node
;
7690 if (TREE_CODE (decl
) == CONST_DECL
)
7692 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7694 DECL_INITIAL (decl
) = init
;
7696 /* This will keep us from needing to worry about our obstacks. */
7697 my_friendly_assert (init
!= NULL_TREE
, 149);
7700 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7702 if (TREE_STATIC (decl
))
7703 make_decl_rtl (decl
, NULL_PTR
, toplevel_bindings_p ());
7704 grok_reference_init (decl
, type
, init
);
7709 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7711 if (TREE_CODE (type
) == ARRAY_TYPE
)
7712 init
= digest_init (type
, init
, (tree
*) 0);
7713 else if (TREE_CODE (init
) == CONSTRUCTOR
7714 && TREE_HAS_CONSTRUCTOR (init
))
7716 if (TYPE_NON_AGGREGATE_CLASS (type
))
7718 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7720 init
= error_mark_node
;
7723 goto dont_use_constructor
;
7728 dont_use_constructor
:
7729 if (TREE_CODE (init
) != TREE_VEC
)
7730 init
= store_init_value (decl
, init
);
7734 /* We must hide the initializer so that expand_decl
7735 won't try to do something it does not understand. */
7736 init
= obscure_complex_init (decl
, init
);
7738 else if (DECL_EXTERNAL (decl
))
7740 else if (TYPE_P (type
)
7741 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7743 tree core_type
= strip_array_types (type
);
7745 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7747 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7748 cp_error ("structure `%D' with uninitialized const members", decl
);
7749 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7750 cp_error ("structure `%D' with uninitialized reference members",
7754 check_for_uninitialized_const_var (decl
);
7756 if (COMPLETE_TYPE_P (type
) && TYPE_NEEDS_CONSTRUCTING (type
))
7757 init
= obscure_complex_init (decl
, NULL_TREE
);
7761 check_for_uninitialized_const_var (decl
);
7766 /* If DECL is not a local variable, give it RTL. */
7769 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
7772 const char *asmspec
;
7774 int toplev
= toplevel_bindings_p ();
7777 /* Handle non-variables up front. */
7778 if (TREE_CODE (decl
) != VAR_DECL
)
7780 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7784 /* If we see a class member here, it should be a static data
7786 if (DECL_LANG_SPECIFIC (decl
) && DECL_IN_AGGR_P (decl
))
7788 my_friendly_assert (TREE_STATIC (decl
), 19990828);
7789 /* An in-class declaration of a static data member should be
7790 external; it is only a declaration, and not a definition. */
7791 if (init
== NULL_TREE
)
7792 my_friendly_assert (DECL_EXTERNAL (decl
), 20000723);
7795 /* Set the DECL_ASSEMBLER_NAME for the variable. */
7797 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7799 /* We don't create any RTL for local variables. */
7800 if (DECL_FUNCTION_SCOPE_P (decl
) && !TREE_STATIC (decl
))
7803 /* We defer emission of local statics until the corresponding
7804 DECL_STMT is expanded. */
7805 defer_p
= DECL_FUNCTION_SCOPE_P (decl
) || DECL_VIRTUAL_P (decl
);
7807 /* We try to defer namespace-scope static constants so that they are
7808 not emitted into the object file unncessarily. */
7809 if (!DECL_VIRTUAL_P (decl
)
7810 && TREE_READONLY (decl
)
7811 && DECL_INITIAL (decl
) != NULL_TREE
7812 && DECL_INITIAL (decl
) != error_mark_node
7813 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
))
7815 && !TREE_PUBLIC (decl
))
7817 /* Fool with the linkage according to #pragma interface. */
7818 if (!interface_unknown
)
7820 TREE_PUBLIC (decl
) = 1;
7821 DECL_EXTERNAL (decl
) = interface_only
;
7827 /* If we're deferring the variable, just make RTL. Do not actually
7828 emit the variable. */
7830 make_decl_rtl (decl
, asmspec
, toplev
);
7831 /* If we're not deferring, go ahead and assemble the variable. */
7833 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7836 /* The old ARM scoping rules injected variables declared in the
7837 initialization statement of a for-statement into the surrounding
7838 scope. We support this usage, in order to be backward-compatible.
7839 DECL is a just-declared VAR_DECL; if necessary inject its
7840 declaration into the surrounding scope. */
7843 maybe_inject_for_scope_var (decl
)
7846 if (!DECL_NAME (decl
))
7849 if (current_binding_level
->is_for_scope
)
7851 struct binding_level
*outer
7852 = current_binding_level
->level_chain
;
7854 /* Check to see if the same name is already bound at the outer
7855 level, either because it was directly declared, or because a
7856 dead for-decl got preserved. In either case, the code would
7857 not have been valid under the ARM scope rules, so clear
7858 is_for_scope for the current_binding_level.
7860 Otherwise, we need to preserve the temp slot for decl to last
7861 into the outer binding level. */
7864 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7866 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7867 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7869 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7871 BINDING_VALUE (outer_binding
)
7872 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7873 current_binding_level
->is_for_scope
= 0;
7875 else if (DECL_IN_MEMORY_P (decl
))
7876 preserve_temp_slots (DECL_RTL (decl
));
7880 /* Generate code to initialize DECL (a local variable). */
7883 initialize_local_var (decl
, init
, flags
)
7888 tree type
= TREE_TYPE (decl
);
7890 /* If the type is bogus, don't bother initializing the variable. */
7891 if (type
== error_mark_node
)
7894 if (DECL_SIZE (decl
) == NULL_TREE
&& !TREE_STATIC (decl
))
7896 /* If we used it already as memory, it must stay in memory. */
7897 DECL_INITIAL (decl
) = NULL_TREE
;
7898 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7901 /* Local statics are handled differently from ordinary automatic
7903 if (TREE_STATIC (decl
))
7905 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7906 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7907 expand_static_init (decl
, init
);
7911 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7915 /* Compute and store the initial value. */
7916 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7918 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7920 int saved_stmts_are_full_exprs_p
;
7922 emit_line_note (DECL_SOURCE_FILE (decl
),
7923 DECL_SOURCE_LINE (decl
));
7924 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p ();
7925 current_stmt_tree
->stmts_are_full_exprs_p
= 1;
7926 if (building_stmt_tree ())
7927 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7929 genrtl_expr_stmt (build_aggr_init (decl
, init
, flags
));
7930 current_stmt_tree
->stmts_are_full_exprs_p
= saved_stmts_are_full_exprs_p
;
7933 /* Set this to 0 so we can tell whether an aggregate which was
7934 initialized was ever used. Don't do this if it has a
7935 destructor, so we don't complain about the 'resource
7936 allocation is initialization' idiom. Now set
7937 attribute((unused)) on types so decls of that type will be
7938 marked used. (see TREE_USED, above.) */
7939 if (TYPE_NEEDS_CONSTRUCTING (type
)
7941 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type
)
7942 && DECL_NAME (decl
))
7943 TREE_USED (decl
) = 0;
7944 else if (already_used
)
7945 TREE_USED (decl
) = 1;
7949 /* Generate code to destroy DECL (a local variable). */
7952 destroy_local_var (decl
)
7955 tree type
= TREE_TYPE (decl
);
7958 /* Only variables get cleaned up. */
7959 if (TREE_CODE (decl
) != VAR_DECL
)
7962 /* And only things with destructors need cleaning up. */
7963 if (type
== error_mark_node
7964 || TYPE_HAS_TRIVIAL_DESTRUCTOR (type
))
7967 if (TREE_CODE (decl
) == VAR_DECL
&&
7968 (DECL_EXTERNAL (decl
) || TREE_STATIC (decl
)))
7969 /* We don't clean up things that aren't defined in this
7970 translation unit, or that need a static cleanup. The latter
7971 are handled by finish_file. */
7974 /* Compute the cleanup. */
7975 cleanup
= maybe_build_cleanup (decl
);
7977 /* Record the cleanup required for this declaration. */
7978 if (DECL_SIZE (decl
) && TREE_TYPE (decl
) != error_mark_node
7980 finish_decl_cleanup (decl
, cleanup
);
7983 /* Finish processing of a declaration;
7984 install its line number and initial value.
7985 If the length of an array type is not known before,
7986 it must be determined now, from the initial value, or it is an error.
7988 INIT holds the value of an initializer that should be allowed to escape
7991 FLAGS is LOOKUP_ONLYCONVERTING if the = init syntax was used, else 0
7992 if the (init) syntax was used. */
7995 cp_finish_decl (decl
, init
, asmspec_tree
, flags
)
8001 tree ttype
= NULL_TREE
;
8002 const char *asmspec
= NULL
;
8003 int was_readonly
= 0;
8008 error ("assignment (not initialization) in declaration");
8012 /* If a name was specified, get the string. */
8014 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
8016 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
8018 cp_error ("cannot initialize `%D' to namespace `%D'",
8023 if (current_class_type
8024 && CP_DECL_CONTEXT (decl
) == current_class_type
8025 && TYPE_BEING_DEFINED (current_class_type
)
8026 && (DECL_INITIAL (decl
) || init
))
8027 DECL_DEFINED_IN_CLASS_P (decl
) = 1;
8029 if (TREE_CODE (decl
) == VAR_DECL
8030 && DECL_CONTEXT (decl
)
8031 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
8032 && DECL_CONTEXT (decl
) != current_namespace
8035 /* Leave the namespace of the object. */
8036 pop_decl_namespace ();
8039 type
= TREE_TYPE (decl
);
8041 if (type
== error_mark_node
)
8044 /* Add this declaration to the statement-tree. */
8045 if (building_stmt_tree () && at_function_scope_p ())
8046 add_decl_stmt (decl
);
8048 if (TYPE_HAS_MUTABLE_P (type
))
8049 TREE_READONLY (decl
) = 0;
8051 if (processing_template_decl
)
8053 if (init
&& DECL_INITIAL (decl
))
8054 DECL_INITIAL (decl
) = init
;
8058 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
8059 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
8061 /* Take care of TYPE_DECLs up front. */
8062 if (TREE_CODE (decl
) == TYPE_DECL
)
8064 if (init
&& DECL_INITIAL (decl
))
8066 /* typedef foo = bar; store the type of bar as the type of foo. */
8067 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
8068 DECL_INITIAL (decl
) = init
= NULL_TREE
;
8070 if (type
!= error_mark_node
8071 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
8073 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
8074 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
8075 set_identifier_type_value (DECL_NAME (decl
), type
);
8076 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
8078 GNU_xref_decl (current_function_decl
, decl
);
8080 /* If we have installed this as the canonical typedef for this
8081 type, and that type has not been defined yet, delay emitting
8082 the debug information for it, as we will emit it later. */
8083 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
8084 && !COMPLETE_TYPE_P (TREE_TYPE (decl
)))
8085 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
8087 rest_of_decl_compilation (decl
, NULL_PTR
,
8088 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
8092 if (TREE_CODE (decl
) != FUNCTION_DECL
)
8093 ttype
= target_type (type
);
8095 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
8096 && TYPE_NEEDS_CONSTRUCTING (type
))
8098 /* Currently, GNU C++ puts constants in text space, making them
8099 impossible to initialize. In the future, one would hope for
8100 an operating system which understood the difference between
8101 initialization and the running of a program. */
8103 TREE_READONLY (decl
) = 0;
8106 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
8108 /* This must override the asm specifier which was placed by
8109 grokclassfn. Lay this out fresh. */
8110 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
8111 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
8112 make_decl_rtl (decl
, asmspec
, 0);
8115 /* Deduce size of array from initialization, if not already known. */
8116 maybe_deduce_size_from_array_init (decl
, init
);
8117 init
= check_initializer (decl
, init
);
8119 GNU_xref_decl (current_function_decl
, decl
);
8121 if (TREE_CODE (decl
) == VAR_DECL
)
8122 layout_var_decl (decl
);
8124 /* Output the assembler code and/or RTL code for variables and functions,
8125 unless the type is an undefined structure or union.
8126 If not, it will get done when the type is completed. */
8127 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
8128 || TREE_CODE (decl
) == RESULT_DECL
)
8130 if (TREE_CODE (decl
) == VAR_DECL
)
8131 maybe_commonize_var (decl
);
8133 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
8135 if (TREE_CODE (type
) == FUNCTION_TYPE
8136 || TREE_CODE (type
) == METHOD_TYPE
)
8137 abstract_virtuals_error (decl
,
8138 strip_array_types (TREE_TYPE (type
)));
8140 abstract_virtuals_error (decl
, strip_array_types (type
));
8142 if (TREE_CODE (decl
) == FUNCTION_DECL
)
8144 else if (DECL_EXTERNAL (decl
)
8145 && ! (DECL_LANG_SPECIFIC (decl
)
8146 && DECL_NOT_REALLY_EXTERN (decl
)))
8149 DECL_INITIAL (decl
) = init
;
8151 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
8153 /* This is a local declaration. */
8154 if (doing_semantic_analysis_p ())
8155 maybe_inject_for_scope_var (decl
);
8156 /* Initialize the local variable. But, if we're building a
8157 statement-tree, we'll do the initialization when we
8159 if (processing_template_decl
)
8161 if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
8162 DECL_INITIAL (decl
) = init
;
8166 /* If we're not building RTL, then we need to do so
8168 if (!building_stmt_tree ())
8169 emit_local_var (decl
);
8170 /* Initialize the variable. */
8171 initialize_local_var (decl
, init
, flags
);
8172 /* Clean up the variable. */
8173 destroy_local_var (decl
);
8176 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
8178 /* Cleanups for static variables are handled by `finish_file'. */
8179 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
8180 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
8181 expand_static_init (decl
, init
);
8185 /* Undo call to `pushclass' that was done in `start_decl'
8186 due to initialization of qualified member variable.
8187 I.e., Foo::x = 10; */
8189 tree context
= CP_DECL_CONTEXT (decl
);
8192 && (TREE_CODE (decl
) == VAR_DECL
8193 /* We also have a pushclass done that we need to undo here
8194 if we're at top level and declare a method. */
8195 || TREE_CODE (decl
) == FUNCTION_DECL
)
8196 /* If size hasn't been set, we're still defining it,
8197 and therefore inside the class body; don't pop
8198 the binding level.. */
8199 && COMPLETE_TYPE_P (context
)
8200 && context
== current_class_type
)
8201 pop_nested_class ();
8208 TREE_READONLY (decl
) = 1;
8211 /* This is here for a midend callback from c-common.c */
8214 finish_decl (decl
, init
, asmspec_tree
)
8218 cp_finish_decl (decl
, init
, asmspec_tree
, 0);
8221 /* Returns a declaration for a VAR_DECL as if:
8223 extern "C" TYPE NAME;
8225 had been seen. Used to create compiler-generated global
8229 declare_global_var (name
, type
)
8235 push_to_top_level ();
8236 decl
= build_decl (VAR_DECL
, name
, type
);
8237 TREE_PUBLIC (decl
) = 1;
8238 DECL_EXTERNAL (decl
) = 1;
8239 DECL_ARTIFICIAL (decl
) = 1;
8241 cp_finish_decl (decl
, NULL_TREE
, NULL_TREE
, 0);
8242 pop_from_top_level ();
8247 /* Returns a pointer to the `atexit' function. Note that if
8248 FLAG_USE_CXA_ATEXIT is non-zero, then this will actually be the new
8249 `__cxa_atexit' function specified in the IA64 C++ ABI. */
8263 if (flag_use_cxa_atexit
)
8265 /* The declaration for `__cxa_atexit' is:
8267 int __cxa_atexit (void (*)(void *), void *, void *)
8269 We build up the argument types and then then function type
8272 /* First, build the pointer-to-function type for the first
8274 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8275 fn_type
= build_function_type (void_type_node
, arg_types
);
8276 fn_ptr_type
= build_pointer_type (fn_type
);
8277 /* Then, build the rest of the argument types. */
8278 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8279 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, arg_types
);
8280 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, arg_types
);
8281 /* And the final __cxa_atexit type. */
8282 fn_type
= build_function_type (integer_type_node
, arg_types
);
8283 fn_ptr_type
= build_pointer_type (fn_type
);
8284 name
= "__cxa_atexit";
8288 /* The declaration for `atexit' is:
8290 int atexit (void (*)());
8292 We build up the argument types and then then function type
8294 fn_type
= build_function_type (void_type_node
, void_list_node
);
8295 fn_ptr_type
= build_pointer_type (fn_type
);
8296 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, void_list_node
);
8297 /* Build the final atexit type. */
8298 fn_type
= build_function_type (integer_type_node
, arg_types
);
8302 /* Now, build the function declaration. */
8303 push_lang_context (lang_name_c
);
8304 atexit_fndecl
= build_library_fn_ptr (name
, fn_type
);
8305 mark_used (atexit_fndecl
);
8306 pop_lang_context ();
8307 atexit_node
= default_conversion (atexit_fndecl
);
8312 /* Returns the __dso_handle VAR_DECL. */
8315 get_dso_handle_node ()
8317 if (dso_handle_node
)
8318 return dso_handle_node
;
8320 /* Declare the variable. */
8321 dso_handle_node
= declare_global_var (get_identifier ("__dso_handle"),
8324 return dso_handle_node
;
8327 /* Begin a new function with internal linkage whose job will be simply
8328 to destroy some particular variable. */
8333 static int counter
= 0;
8334 int old_interface_unknown
= interface_unknown
;
8340 push_to_top_level ();
8342 /* No need to mangle this. */
8343 push_lang_context (lang_name_c
);
8345 interface_unknown
= 1;
8347 /* Build the parameter-types. */
8348 parmtypes
= void_list_node
;
8349 /* Functions passed to __cxa_atexit take an additional parameter.
8350 We'll just ignore it. After we implement the new calling
8351 convention for destructors, we can eliminate the use of
8352 additional cleanup functions entirely in the -fnew-abi case. */
8353 if (flag_use_cxa_atexit
)
8354 parmtypes
= tree_cons (NULL_TREE
, ptr_type_node
, parmtypes
);
8355 /* Build the function type itself. */
8356 fntype
= build_function_type (void_type_node
, parmtypes
);
8357 /* Build the name of the function. */
8358 sprintf (name
, "__tcf_%d", counter
++);
8359 /* Build the function declaration. */
8360 fndecl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), fntype
);
8361 /* It's a function with internal linkage, generated by the
8363 TREE_PUBLIC (fndecl
) = 0;
8364 DECL_ARTIFICIAL (fndecl
) = 1;
8365 /* Build the parameter. */
8366 if (flag_use_cxa_atexit
)
8370 parmdecl
= build_decl (PARM_DECL
, NULL_TREE
, ptr_type_node
);
8371 DECL_CONTEXT (parmdecl
) = fndecl
;
8372 DECL_ARG_TYPE (parmdecl
) = ptr_type_node
;
8373 TREE_USED (parmdecl
) = 1;
8374 DECL_ARGUMENTS (fndecl
) = parmdecl
;
8378 start_function (/*specs=*/NULL_TREE
, fndecl
, NULL_TREE
, SF_PRE_PARSED
);
8381 interface_unknown
= old_interface_unknown
;
8383 pop_lang_context ();
8385 return current_function_decl
;
8388 /* Finish the cleanup function begun by start_cleanup_fn. */
8395 expand_body (finish_function (0));
8397 pop_from_top_level ();
8400 /* Generate code to handle the destruction of DECL, an object with
8401 static storage duration. */
8404 register_dtor_fn (decl
)
8412 int saved_flag_access_control
;
8414 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl
)))
8417 /* Call build_cleanup before we enter the anonymous function so that
8418 any access checks will be done relative to the current scope,
8419 rather than the scope of the anonymous function. */
8420 build_cleanup (decl
);
8422 /* Now start the function. */
8423 cleanup
= start_cleanup_fn ();
8425 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
8426 to the original function, rather than the anonymous one. That
8427 will make the back-end think that nested functions are in use,
8428 which causes confusion. */
8429 saved_flag_access_control
= flag_access_control
;
8430 flag_access_control
= 0;
8431 fcall
= build_cleanup (decl
);
8432 flag_access_control
= saved_flag_access_control
;
8434 /* Create the body of the anonymous function. */
8435 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
8436 finish_expr_stmt (fcall
);
8437 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
8440 /* Call atexit with the cleanup function. */
8441 mark_addressable (cleanup
);
8442 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
8443 if (flag_use_cxa_atexit
)
8445 args
= tree_cons (NULL_TREE
, get_dso_handle_node (), NULL_TREE
);
8446 args
= tree_cons (NULL_TREE
, null_pointer_node
, args
);
8447 args
= tree_cons (NULL_TREE
, cleanup
, args
);
8450 args
= tree_cons (NULL_TREE
, cleanup
, NULL_TREE
);
8451 finish_expr_stmt (build_function_call (get_atexit_node (), args
));
8455 expand_static_init (decl
, init
)
8459 tree oldstatic
= value_member (decl
, static_aggregates
);
8463 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
8464 cp_error ("multiple initializations given for `%D'", decl
);
8466 else if (! toplevel_bindings_p ())
8468 /* Emit code to perform this initialization but once. */
8475 /* Emit code to perform this initialization but once. This code
8478 static int guard = 0;
8480 // Do initialization.
8482 // Register variable for destruction at end of program.
8485 Note that the `temp' variable is only set to 1 *after* the
8486 initialization is complete. This ensures that an exception,
8487 thrown during the construction, will cause the variable to
8488 reinitialized when we pass through this code again, as per:
8492 If the initialization exits by throwing an exception, the
8493 initialization is not complete, so it will be tried again
8494 the next time control enters the declaration.
8496 In theory, this process should be thread-safe, too; multiple
8497 threads should not be able to initialize the variable more
8498 than once. We don't yet attempt to ensure thread-safety. */
8500 /* Create the guard variable. */
8501 guard
= get_guard (decl
);
8503 /* Begin the conditional initialization. */
8504 if_stmt
= begin_if_stmt ();
8505 finish_if_stmt_cond (get_guard_cond (guard
), if_stmt
);
8506 then_clause
= begin_compound_stmt (/*has_no_scope=*/0);
8508 /* Do the initialization itself. */
8509 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
8510 || (init
&& TREE_CODE (init
) == TREE_LIST
))
8511 assignment
= build_aggr_init (decl
, init
, 0);
8513 /* The initialization we're doing here is just a bitwise
8515 assignment
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
8517 assignment
= NULL_TREE
;
8519 /* Once the assignment is complete, set TEMP to 1. Since the
8520 construction of the static object is complete at this point,
8521 we want to make sure TEMP is set to 1 even if a temporary
8522 constructed during the initialization throws an exception
8523 when it is destroyed. So, we combine the initialization and
8524 the assignment to TEMP into a single expression, ensuring
8525 that when we call finish_expr_stmt the cleanups will not be
8526 run until after TEMP is set to 1. */
8527 guard_init
= set_guard (guard
);
8530 assignment
= tree_cons (NULL_TREE
, assignment
,
8531 build_tree_list (NULL_TREE
,
8533 assignment
= build_compound_expr (assignment
);
8536 assignment
= guard_init
;
8537 finish_expr_stmt (assignment
);
8539 /* Use atexit to register a function for destroying this static
8541 register_dtor_fn (decl
);
8543 finish_compound_stmt (/*has_no_scope=*/0, then_clause
);
8544 finish_then_clause (if_stmt
);
8548 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8551 /* Finish the declaration of a catch-parameter. */
8554 start_handler_parms (declspecs
, declarator
)
8561 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8563 if (decl
== NULL_TREE
)
8564 error ("invalid catch parameter");
8573 /* Make TYPE a complete type based on INITIAL_VALUE.
8574 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8575 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8578 complete_array_type (type
, initial_value
, do_default
)
8579 tree type
, initial_value
;
8582 register tree maxindex
= NULL_TREE
;
8587 /* An array of character type can be initialized from a
8588 brace-enclosed string constant. */
8589 if (char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (type
)))
8590 && TREE_CODE (initial_value
) == CONSTRUCTOR
8591 && CONSTRUCTOR_ELTS (initial_value
)
8592 && (TREE_CODE (TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
)))
8594 && TREE_CHAIN (CONSTRUCTOR_ELTS (initial_value
)) == NULL_TREE
)
8595 initial_value
= TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
));
8597 /* Note MAXINDEX is really the maximum index, one less than the
8599 if (TREE_CODE (initial_value
) == STRING_CST
)
8602 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8603 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8606 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8608 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8610 maxindex
= ssize_int (-1);
8611 for (; elts
; elts
= TREE_CHAIN (elts
))
8613 if (TREE_PURPOSE (elts
))
8614 maxindex
= TREE_PURPOSE (elts
);
8616 maxindex
= size_binop (PLUS_EXPR
, maxindex
, ssize_int (1));
8618 maxindex
= copy_node (maxindex
);
8622 /* Make an error message unless that happened already. */
8623 if (initial_value
!= error_mark_node
)
8626 initial_value
= NULL_TREE
;
8628 /* Prevent further error messages. */
8629 maxindex
= build_int_2 (0, 0);
8636 maxindex
= build_int_2 (0, 0);
8645 domain
= build_index_type (maxindex
);
8646 TYPE_DOMAIN (type
) = domain
;
8648 if (! TREE_TYPE (maxindex
))
8649 TREE_TYPE (maxindex
) = domain
;
8651 itype
= TREE_TYPE (initial_value
);
8654 if (itype
&& !TYPE_DOMAIN (itype
))
8655 TYPE_DOMAIN (itype
) = domain
;
8656 /* The type of the main variant should never be used for arrays
8657 of different sizes. It should only ever be completed with the
8658 size of the array. */
8659 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8660 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8663 /* Lay out the type now that we can get the real answer. */
8670 /* Return zero if something is declared to be a member of type
8671 CTYPE when in the context of CUR_TYPE. STRING is the error
8672 message to print in that case. Otherwise, quietly return 1. */
8675 member_function_or_else (ctype
, cur_type
, flags
)
8676 tree ctype
, cur_type
;
8677 enum overload_flags flags
;
8679 if (ctype
&& ctype
!= cur_type
)
8681 if (flags
== DTOR_FLAG
)
8682 error ("destructor for alien class `%s' cannot be a member",
8683 TYPE_NAME_STRING (ctype
));
8685 error ("constructor for alien class `%s' cannot be a member",
8686 TYPE_NAME_STRING (ctype
));
8692 /* Subroutine of `grokdeclarator'. */
8694 /* Generate errors possibly applicable for a given set of specifiers.
8695 This is for ARM $7.1.2. */
8698 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8701 int virtualp
, quals
, friendp
, raises
, inlinep
;
8704 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8706 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8708 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8711 cp_error_at ("`%D' declared as a friend", object
);
8713 cp_error_at ("`%D' declared with an exception specification", object
);
8716 /* CTYPE is class type, or null if non-class.
8717 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8719 DECLARATOR is the function's name.
8720 VIRTUALP is truthvalue of whether the function is virtual or not.
8721 FLAGS are to be passed through to `grokclassfn'.
8722 QUALS are qualifiers indicating whether the function is `const'
8724 RAISES is a list of exceptions that this function can raise.
8725 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8726 not look, and -1 if we should not call `grokclassfn' at all.
8728 Returns `NULL_TREE' if something goes wrong, after issuing
8729 applicable error messages. */
8732 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8733 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8734 template_count
, in_namespace
)
8737 tree orig_declarator
;
8739 enum overload_flags flags
;
8741 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8745 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8746 int has_default_arg
= 0;
8750 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8751 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8757 type
= build_exception_variant (type
, raises
);
8760 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8761 /* Propagate volatile out from type to decl. */
8762 if (TYPE_VOLATILE (type
))
8763 TREE_THIS_VOLATILE (decl
) = 1;
8765 /* If this decl has namespace scope, set that up. */
8767 set_decl_namespace (decl
, in_namespace
, friendp
);
8769 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8771 /* `main' and builtins have implicit 'C' linkage. */
8772 if ((MAIN_NAME_P (declarator
)
8773 || (IDENTIFIER_LENGTH (declarator
) > 10
8774 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8775 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8776 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8777 && current_lang_name
== lang_name_cplusplus
8778 && ctype
== NULL_TREE
8779 /* NULL_TREE means global namespace. */
8780 && DECL_CONTEXT (decl
) == NULL_TREE
)
8781 DECL_LANGUAGE (decl
) = lang_c
;
8783 /* Should probably propagate const out from type to decl I bet (mrs). */
8786 DECL_STATIC_FUNCTION_P (decl
) = 1;
8787 DECL_CONTEXT (decl
) = ctype
;
8791 DECL_CONTEXT (decl
) = ctype
;
8793 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8795 if (processing_template_decl
)
8796 error ("cannot declare `::main' to be a template");
8798 error ("cannot declare `::main' to be inline");
8800 error ("cannot declare `::main' to be static");
8805 /* Members of anonymous types and local classes have no linkage; make
8807 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8808 || decl_function_context (TYPE_MAIN_DECL (ctype
))))
8813 /* [basic.link]: A name with no linkage (notably, the name of a class
8814 or enumeration declared in a local scope) shall not be used to
8815 declare an entity with linkage.
8817 Only check this for public decls for now. */
8818 t
= no_linkage_check (TREE_TYPE (decl
));
8821 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8823 if (DECL_EXTERN_C_P (decl
))
8824 /* Allow this; it's pretty common in C. */;
8826 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8830 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8835 TREE_PUBLIC (decl
) = publicp
;
8838 DECL_INTERFACE_KNOWN (decl
) = 1;
8839 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8843 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8845 DECL_EXTERNAL (decl
) = 1;
8846 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8848 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8849 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8853 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8854 grok_op_properties (decl
, virtualp
, check
< 0);
8856 if (ctype
&& decl_function_context (decl
))
8857 DECL_NO_STATIC_CHAIN (decl
) = 1;
8859 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8860 if (TREE_PURPOSE (t
)
8861 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8863 has_default_arg
= 1;
8868 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8872 ("defining explicit specialization `%D' in friend declaration",
8876 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8878 /* Something like `template <class T> friend void f<T>()'. */
8879 cp_error ("invalid use of template-id `%D' in declaration of primary template",
8885 /* A friend declaration of the form friend void f<>(). Record
8886 the information in the TEMPLATE_ID_EXPR. */
8887 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8888 DECL_TEMPLATE_INFO (decl
)
8889 = tree_cons (TREE_OPERAND (orig_declarator
, 0),
8890 TREE_OPERAND (orig_declarator
, 1),
8893 if (has_default_arg
)
8895 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8902 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8909 if (has_default_arg
)
8910 add_defarg_fn (decl
);
8912 /* Plain overloading: will not be grok'd by grokclassfn. */
8913 if (! ctype
&& ! processing_template_decl
8914 && !DECL_EXTERN_C_P (decl
)
8915 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8916 set_mangled_name_for_decl (decl
);
8919 /* Make the init_value nonzero so pushdecl knows this is not
8920 tentative. error_mark_node is replaced later with the BLOCK. */
8921 DECL_INITIAL (decl
) = error_mark_node
;
8923 if (TYPE_NOTHROW_P (type
) || nothrow_libfn_p (decl
))
8924 TREE_NOTHROW (decl
) = 1;
8926 /* Caller will do the rest of this. */
8930 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8931 DECL_CONSTRUCTOR_P (decl
) = 1;
8933 /* Function gets the ugly name, field gets the nice one. This call
8934 may change the type of the function (because of default
8936 if (ctype
!= NULL_TREE
)
8937 grokclassfn (ctype
, decl
, flags
, quals
);
8939 decl
= check_explicit_specialization (orig_declarator
, decl
,
8941 2 * (funcdef_flag
!= 0) +
8942 4 * (friendp
!= 0));
8943 if (decl
== error_mark_node
)
8946 if (ctype
!= NULL_TREE
8947 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8952 old_decl
= check_classfn (ctype
, decl
);
8954 if (old_decl
&& TREE_CODE (old_decl
) == TEMPLATE_DECL
)
8955 /* Because grokfndecl is always supposed to return a
8956 FUNCTION_DECL, we pull out the DECL_TEMPLATE_RESULT
8957 here. We depend on our callers to figure out that its
8958 really a template that's being returned. */
8959 old_decl
= DECL_TEMPLATE_RESULT (old_decl
);
8961 if (old_decl
&& DECL_STATIC_FUNCTION_P (old_decl
)
8962 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8964 /* Remove the `this' parm added by grokclassfn.
8965 XXX Isn't this done in start_function, too? */
8966 revert_static_member_fn (decl
);
8967 last_function_parms
= TREE_CHAIN (last_function_parms
);
8969 if (old_decl
&& DECL_ARTIFICIAL (old_decl
))
8970 cp_error ("definition of implicitly-declared `%D'", old_decl
);
8974 /* Since we've smashed OLD_DECL to its
8975 DECL_TEMPLATE_RESULT, we must do the same to DECL. */
8976 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
8977 decl
= DECL_TEMPLATE_RESULT (decl
);
8979 /* Attempt to merge the declarations. This can fail, in
8980 the case of some illegal specialization declarations. */
8981 if (!duplicate_decls (decl
, old_decl
))
8982 cp_error ("no `%#D' member function declared in class `%T'",
8988 if (DECL_CONSTRUCTOR_P (decl
) && !grok_ctor_properties (ctype
, decl
))
8991 if (ctype
== NULL_TREE
|| check
)
8996 DECL_VIRTUAL_P (decl
) = 1;
8997 if (DECL_VINDEX (decl
) == NULL_TREE
)
8998 DECL_VINDEX (decl
) = error_mark_node
;
8999 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
9006 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
9009 RID_BIT_TYPE
*specbits_in
;
9015 RID_BIT_TYPE specbits
;
9017 specbits
= *specbits_in
;
9019 if (TREE_CODE (type
) == OFFSET_TYPE
)
9021 /* If you declare a static member so that it
9022 can be initialized, the code will reach here. */
9023 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
9024 type
= TREE_TYPE (type
);
9025 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
9026 DECL_CONTEXT (decl
) = basetype
;
9027 /* DECL_ASSEMBLER_NAME is needed only for full-instantiated
9029 if (!uses_template_parms (decl
))
9032 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
9034 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
,
9043 context
= in_namespace
;
9044 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
9045 context
= current_namespace
;
9047 context
= NULL_TREE
;
9049 if (processing_template_decl
&& context
)
9050 /* For global variables, declared in a template, we need the
9052 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
9054 decl
= build_decl (VAR_DECL
, declarator
, type
);
9057 set_decl_namespace (decl
, context
, 0);
9059 context
= DECL_CONTEXT (decl
);
9060 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
9063 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
9065 DECL_ASSEMBLER_NAME (decl
)
9066 = build_static_name (context
, declarator
);
9071 set_decl_namespace (decl
, in_namespace
, 0);
9073 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
9075 DECL_THIS_EXTERN (decl
) = 1;
9076 DECL_EXTERNAL (decl
) = !initialized
;
9079 /* In class context, static means one per class,
9080 public access, and static storage. */
9081 if (DECL_CLASS_SCOPE_P (decl
))
9083 TREE_PUBLIC (decl
) = 1;
9084 TREE_STATIC (decl
) = 1;
9085 DECL_EXTERNAL (decl
) = 0;
9087 /* At top level, either `static' or no s.c. makes a definition
9088 (perhaps tentative), and absence of `static' makes it public. */
9089 else if (toplevel_bindings_p ())
9091 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
9092 && (DECL_THIS_EXTERN (decl
) || ! constp
));
9093 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
9095 /* Not at top level, only `static' makes a static definition. */
9098 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
9099 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
9102 if (TREE_PUBLIC (decl
))
9104 /* [basic.link]: A name with no linkage (notably, the name of a class
9105 or enumeration declared in a local scope) shall not be used to
9106 declare an entity with linkage.
9108 Only check this for public decls for now. */
9109 tree t
= no_linkage_check (TREE_TYPE (decl
));
9112 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
9113 /* Ignore for now; `enum { foo } e' is pretty common. */;
9115 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
9123 /* Create and return a canonical pointer to member function type, for
9124 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
9127 build_ptrmemfunc_type (type
)
9133 tree unqualified_variant
= NULL_TREE
;
9135 /* If a canonical type already exists for this type, use it. We use
9136 this method instead of type_hash_canon, because it only does a
9137 simple equality check on the list of field members. */
9139 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
9142 /* Make sure that we always have the unqualified pointer-to-member
9144 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9146 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
9148 t
= make_aggr_type (RECORD_TYPE
);
9149 /* Let the front-end know this is a pointer to member function... */
9150 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
9151 /* ... and not really an aggregate. */
9152 SET_IS_AGGR_TYPE (t
, 0);
9156 u
= make_aggr_type (UNION_TYPE
);
9157 SET_IS_AGGR_TYPE (u
, 0);
9158 fields
[0] = build_decl (FIELD_DECL
, pfn_identifier
, type
);
9159 fields
[1] = build_decl (FIELD_DECL
, delta2_identifier
,
9161 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9162 TYPE_NAME (u
) = NULL_TREE
;
9164 fields
[0] = build_decl (FIELD_DECL
, delta_identifier
,
9166 fields
[1] = build_decl (FIELD_DECL
, index_identifier
,
9168 fields
[2] = build_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
9169 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
9173 fields
[0] = build_decl (FIELD_DECL
, pfn_identifier
, type
);
9174 fields
[1] = build_decl (FIELD_DECL
, delta_identifier
,
9176 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9179 /* Zap out the name so that the back-end will give us the debugging
9180 information for this anonymous RECORD_TYPE. */
9181 TYPE_NAME (t
) = NULL_TREE
;
9183 /* If this is not the unqualified form of this pointer-to-member
9184 type, set the TYPE_MAIN_VARIANT for this type to be the
9185 unqualified type. Since they are actually RECORD_TYPEs that are
9186 not variants of each other, we must do this manually. */
9187 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9189 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
9190 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
9191 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
9192 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
9195 /* Cache this pointer-to-member type so that we can find it again
9197 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
9199 /* Seems to be wanted. */
9200 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
9205 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
9206 Check to see that the definition is valid. Issue appropriate error
9207 messages. Return 1 if the definition is particularly bad, or 0
9211 check_static_variable_definition (decl
, type
)
9215 /* Motion 10 at San Diego: If a static const integral data member is
9216 initialized with an integral constant expression, the initializer
9217 may appear either in the declaration (within the class), or in
9218 the definition, but not both. If it appears in the class, the
9219 member is a member constant. The file-scope definition is always
9221 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
9223 cp_error ("invalid in-class initialization of static data member of non-integral type `%T'",
9225 /* If we just return the declaration, crashes will sometimes
9226 occur. We therefore return void_type_node, as if this was a
9227 friend declaration, to cause callers to completely ignore
9228 this declaration. */
9231 else if (!CP_TYPE_CONST_P (type
))
9232 cp_error ("ISO C++ forbids in-class initialization of non-const static member `%D'",
9234 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
9235 cp_pedwarn ("ISO C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
9240 /* Given the SIZE (i.e., number of elements) in an array, compute an
9241 appropriate index type for the array. If non-NULL, NAME is the
9242 name of the thing being declared. */
9245 compute_array_index_type (name
, size
)
9251 /* The size might be the result of a cast. */
9252 STRIP_TYPE_NOPS (size
);
9254 /* It might be a const variable or enumeration constant. */
9255 size
= decl_constant_value (size
);
9257 /* If this involves a template parameter, it will be a constant at
9258 instantiation time, but we don't know what the value is yet.
9259 Even if no template parameters are involved, we may an expression
9260 that is not a constant; we don't even simplify `1 + 2' when
9261 processing a template. */
9262 if (processing_template_decl
)
9264 /* Resolve a qualified reference to an enumerator or static
9265 const data member of ours. */
9266 if (TREE_CODE (size
) == SCOPE_REF
9267 && TREE_OPERAND (size
, 0) == current_class_type
)
9269 tree t
= lookup_field (current_class_type
,
9270 TREE_OPERAND (size
, 1), 0, 0);
9275 return build_index_type (build_min (MINUS_EXPR
, sizetype
,
9276 size
, integer_one_node
));
9279 /* The array bound must be an integer type. */
9280 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9281 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
9282 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
9285 cp_error ("size of array `%D' has non-integer type", name
);
9287 cp_error ("size of array has non-integer type");
9288 size
= integer_one_node
;
9291 /* Normally, the array-bound will be a constant. */
9292 if (TREE_CODE (size
) == INTEGER_CST
)
9294 /* Check to see if the array bound overflowed. Make that an
9295 error, no matter how generous we're being. */
9296 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9297 int old_pedantic
= pedantic
;
9298 pedantic
= flag_pedantic_errors
= 1;
9299 constant_expression_warning (size
);
9300 pedantic
= old_pedantic
;
9301 flag_pedantic_errors
= old_flag_pedantic_errors
;
9303 /* An array must have a positive number of elements. */
9304 if (INT_CST_LT (size
, integer_zero_node
))
9307 cp_error ("size of array `%D' is negative", name
);
9309 cp_error ("size of array is negative");
9310 size
= integer_one_node
;
9312 /* Except that an extension we allow zero-sized arrays. We
9313 always allow them in system headers because glibc uses
9315 else if (integer_zerop (size
) && pedantic
&& !in_system_header
)
9318 cp_pedwarn ("ISO C++ forbids zero-size array `%D'", name
);
9320 cp_pedwarn ("ISO C++ forbids zero-size array");
9323 else if (TREE_CONSTANT (size
))
9325 /* `(int) &fn' is not a valid array bound. */
9327 cp_error ("size of array `%D' is not an integral constant-expression",
9330 cp_error ("size of array is not an integral constant-expression");
9333 /* Compute the index of the largest element in the array. It is
9334 one less than the number of elements in the array. */
9336 = fold (cp_build_binary_op (MINUS_EXPR
,
9337 cp_convert (ssizetype
, size
),
9338 cp_convert (ssizetype
,
9339 integer_one_node
)));
9341 /* Check for variable-sized arrays. We allow such things as an
9342 extension, even though they are not allowed in ANSI/ISO C++. */
9343 if (!TREE_CONSTANT (itype
))
9348 cp_pedwarn ("ISO C++ forbids variable-size array `%D'",
9351 cp_pedwarn ("ISO C++ forbids variable-size array");
9354 /* Create a variable-sized array index type. */
9355 itype
= variable_size (itype
);
9357 /* Make sure that there was no overflow when creating to a signed
9358 index type. (For example, on a 32-bit machine, an array with
9359 size 2^32 - 1 is too big.) */
9360 else if (TREE_OVERFLOW (itype
))
9362 error ("overflow in array dimension");
9363 TREE_OVERFLOW (itype
) = 0;
9366 /* Create and return the appropriate index type. */
9367 return build_index_type (itype
);
9370 /* Returns an ARRAY_TYPE for an array with SIZE elements of the
9371 indicated TYPE. If non-NULL, NAME is the NAME of the declaration
9375 create_array_type_for_decl (name
, type
, size
)
9380 tree itype
= NULL_TREE
;
9381 const char* error_msg
;
9383 /* If things have already gone awry, bail now. */
9384 if (type
== error_mark_node
|| size
== error_mark_node
)
9385 return error_mark_node
;
9387 /* Assume that everything will go OK. */
9390 /* There are some types which cannot be array elements. */
9391 switch (TREE_CODE (type
))
9394 error_msg
= "array of void";
9398 error_msg
= "array of functions";
9401 case REFERENCE_TYPE
:
9402 error_msg
= "array of references";
9406 error_msg
= "array of data members";
9410 error_msg
= "array of function members";
9417 /* If something went wrong, issue an error-message and return. */
9421 cp_error ("declaration of `%D' as %s", name
, error_msg
);
9423 cp_error ("creating %s", error_msg
);
9425 return error_mark_node
;
9430 The constant expressions that specify the bounds of the arrays
9431 can be omitted only for the first member of the sequence. */
9432 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9434 cp_error ("declaration of `%D' as multidimensional array must have bounds for all dimensions except the first",
9437 return error_mark_node
;
9440 /* Figure out the index type for the array. */
9442 itype
= compute_array_index_type (name
, size
);
9444 return build_cplus_array_type (type
, itype
);
9447 /* Check that it's OK to declare a function with the indicated TYPE.
9448 SFK indicates the kind of special function (if any) that this
9449 function is. CTYPE is the class of which this function is a
9450 member. OPTYPE is the type given in a conversion operator
9451 declaration. Returns the actual return type of the function; that
9452 may be different than TYPE if an error occurs, or for certain
9453 special functions. */
9456 check_special_function_return_type (sfk
, type
, ctype
, optype
)
9457 special_function_kind sfk
;
9464 case sfk_constructor
:
9466 cp_error ("return type specification for constructor invalid");
9468 /* In the old ABI, we return `this'; in the new ABI we don't
9470 type
= flag_new_abi
? void_type_node
: build_pointer_type (ctype
);
9473 case sfk_destructor
:
9475 cp_error ("return type specification for destructor invalid");
9476 type
= void_type_node
;
9479 case sfk_conversion
:
9480 if (type
&& !same_type_p (type
, optype
))
9481 cp_error ("operator `%T' declared to return `%T'", optype
, type
);
9483 cp_pedwarn ("return type specified for `operator %T'", optype
);
9488 my_friendly_abort (20000408);
9495 /* Given declspecs and a declarator,
9496 determine the name and type of the object declared
9497 and construct a ..._DECL node for it.
9498 (In one case we can return a ..._TYPE node instead.
9499 For invalid input we sometimes return 0.)
9501 DECLSPECS is a chain of tree_list nodes whose value fields
9502 are the storage classes and type specifiers.
9504 DECL_CONTEXT says which syntactic context this declaration is in:
9505 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
9506 FUNCDEF for a function definition. Like NORMAL but a few different
9507 error messages in each case. Return value may be zero meaning
9508 this definition is too screwy to try to parse.
9509 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
9510 handle member functions (which have FIELD context).
9511 Return value may be zero meaning this definition is too screwy to
9513 PARM for a parameter declaration (either within a function prototype
9514 or before a function body). Make a PARM_DECL, or return void_type_node.
9515 CATCHPARM for a parameter declaration before a catch clause.
9516 TYPENAME if for a typename (in a cast or sizeof).
9517 Don't make a DECL node; just return the ..._TYPE node.
9518 FIELD for a struct or union field; make a FIELD_DECL.
9519 BITFIELD for a field with specified width.
9520 INITIALIZED is 1 if the decl has an initializer.
9522 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
9523 normal attributes in TREE_PURPOSE, or NULL_TREE.
9525 In the TYPENAME case, DECLARATOR is really an abstract declarator.
9526 It may also be so in the PARM case, for a prototype where the
9527 argument type is specified but not the name.
9529 This function is where the complicated C meanings of `static'
9530 and `extern' are interpreted.
9532 For C++, if there is any monkey business to do, the function which
9533 calls this one must do it, i.e., prepending instance variables,
9534 renaming overloaded function names, etc.
9536 Note that for this C++, it is an error to define a method within a class
9537 which does not belong to that class.
9539 Except in the case where SCOPE_REFs are implicitly known (such as
9540 methods within a class being redundantly qualified),
9541 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
9542 (class_name::decl_name). The caller must also deal with this.
9544 If a constructor or destructor is seen, and the context is FIELD,
9545 then the type gains the attribute TREE_HAS_x. If such a declaration
9546 is erroneous, NULL_TREE is returned.
9548 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
9549 function, these are the qualifiers to give to the `this' pointer. We
9550 apply TYPE_QUAL_RESTRICT to the this ptr, not the object.
9552 May return void_type_node if the declarator turned out to be a friend.
9553 See grokfield for details. */
9556 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
9559 enum decl_context decl_context
;
9563 RID_BIT_TYPE specbits
;
9566 tree type
= NULL_TREE
;
9572 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
9573 int explicit_int
= 0;
9574 int explicit_char
= 0;
9575 int defaulted_int
= 0;
9576 tree typedef_decl
= NULL_TREE
;
9578 tree typedef_type
= NULL_TREE
;
9579 int funcdef_flag
= 0;
9580 enum tree_code innermost_code
= ERROR_MARK
;
9583 /* See the code below that used this. */
9584 tree decl_machine_attr
= NULL_TREE
;
9586 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
9587 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
9588 tree init
= NULL_TREE
;
9590 /* Keep track of what sort of function is being processed
9591 so that we can warn about default return values, or explicit
9592 return values which do not match prescribed defaults. */
9593 special_function_kind sfk
= sfk_none
;
9595 tree dname
= NULL_TREE
;
9596 tree ctype
= current_class_type
;
9597 tree ctor_return_type
= NULL_TREE
;
9598 enum overload_flags flags
= NO_SPECIAL
;
9599 tree quals
= NULL_TREE
;
9600 tree raises
= NULL_TREE
;
9601 int template_count
= 0;
9602 tree in_namespace
= NULL_TREE
;
9606 RIDBIT_RESET_ALL (specbits
);
9607 if (decl_context
== FUNCDEF
)
9608 funcdef_flag
= 1, decl_context
= NORMAL
;
9609 else if (decl_context
== MEMFUNCDEF
)
9610 funcdef_flag
= -1, decl_context
= FIELD
;
9611 else if (decl_context
== BITFIELD
)
9612 bitfield
= 1, decl_context
= FIELD
;
9614 /* Look inside a declarator for the name being declared
9615 and get it as a string, for an error message. */
9617 tree
*next
= &declarator
;
9621 while (next
&& *next
)
9624 switch (TREE_CODE (decl
))
9627 /* For attributes. */
9628 next
= &TREE_VALUE (decl
);
9633 next
= &TREE_OPERAND (decl
, 0);
9636 case BIT_NOT_EXPR
: /* For C++ destructors! */
9638 tree name
= TREE_OPERAND (decl
, 0);
9639 tree rename
= NULL_TREE
;
9641 my_friendly_assert (flags
== NO_SPECIAL
, 152);
9643 sfk
= sfk_destructor
;
9644 if (TREE_CODE (name
) == TYPE_DECL
)
9645 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
9646 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
9647 if (ctype
== NULL_TREE
)
9649 if (current_class_type
== NULL_TREE
)
9651 error ("destructors must be member functions");
9656 tree t
= constructor_name (current_class_name
);
9663 tree t
= constructor_name (ctype
);
9670 cp_error ("destructor `%T' must match class name `%T'",
9672 TREE_OPERAND (decl
, 0) = rename
;
9678 case ADDR_EXPR
: /* C++ reference declaration */
9683 innermost_code
= TREE_CODE (decl
);
9684 next
= &TREE_OPERAND (decl
, 0);
9688 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
9690 /* This is actually a variable declaration using
9691 constructor syntax. We need to call start_decl and
9692 cp_finish_decl so we can get the variable
9695 tree attributes
, prefix_attributes
;
9697 *next
= TREE_OPERAND (decl
, 0);
9698 init
= CALL_DECLARATOR_PARMS (decl
);
9702 attributes
= TREE_PURPOSE (attrlist
);
9703 prefix_attributes
= TREE_VALUE (attrlist
);
9707 attributes
= NULL_TREE
;
9708 prefix_attributes
= NULL_TREE
;
9711 decl
= start_decl (declarator
, declspecs
, 1,
9712 attributes
, prefix_attributes
);
9713 decl_type_access_control (decl
);
9716 /* Look for __unused__ attribute */
9717 if (TREE_USED (TREE_TYPE (decl
)))
9718 TREE_USED (decl
) = 1;
9719 finish_decl (decl
, init
, NULL_TREE
);
9722 cp_error ("invalid declarator");
9725 innermost_code
= TREE_CODE (decl
);
9726 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
9727 ctype
= current_class_type
;
9729 && TREE_OPERAND (decl
, 0)
9730 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
9731 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
9732 == constructor_name_full (ctype
))
9733 || (DECL_NAME (TREE_OPERAND (decl
, 0))
9734 == constructor_name (ctype
)))))
9735 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9736 next
= &TREE_OPERAND (decl
, 0);
9738 if (ctype
!= NULL_TREE
9739 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
9740 && decl
== constructor_name (ctype
))
9742 sfk
= sfk_constructor
;
9743 ctor_return_type
= ctype
;
9748 case TEMPLATE_ID_EXPR
:
9750 tree fns
= TREE_OPERAND (decl
, 0);
9752 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9753 fns
= TREE_OPERAND (fns
, 0);
9756 if (TREE_CODE (dname
) == COMPONENT_REF
)
9757 dname
= TREE_OPERAND (dname
, 1);
9758 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9760 my_friendly_assert (is_overloaded_fn (dname
),
9762 dname
= DECL_NAME (get_first_fn (dname
));
9767 case IDENTIFIER_NODE
:
9768 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9775 cp_error ("declarator-id missing; using reserved word `%D'",
9777 name
= IDENTIFIER_POINTER (dname
);
9779 else if (!IDENTIFIER_TYPENAME_P (dname
))
9780 name
= IDENTIFIER_POINTER (dname
);
9783 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9784 flags
= TYPENAME_FLAG
;
9785 ctor_return_type
= TREE_TYPE (dname
);
9786 sfk
= sfk_conversion
;
9787 if (IDENTIFIER_GLOBAL_VALUE (dname
)
9788 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (dname
))
9790 name
= IDENTIFIER_POINTER (dname
);
9792 name
= "<invalid operator>";
9799 /* Perform error checking, and decide on a ctype. */
9800 tree cname
= TREE_OPERAND (decl
, 0);
9801 if (cname
== NULL_TREE
)
9803 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9806 in_namespace
= TREE_OPERAND (decl
, 0);
9807 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9809 else if (! is_aggr_type (cname
, 1))
9810 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9811 /* Must test TREE_OPERAND (decl, 1), in case user gives
9812 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9813 else if (TREE_OPERAND (decl
, 1)
9814 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9816 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9817 || TREE_CODE (cname
) == TEMPLATE_TEMPLATE_PARM
)
9819 cp_error ("`%T::%D' is not a valid declarator", cname
,
9820 TREE_OPERAND (decl
, 1));
9821 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9822 cname
, TREE_OPERAND (decl
, 1));
9823 return void_type_node
;
9825 else if (ctype
== NULL_TREE
)
9827 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9828 TREE_OPERAND (decl
, 0) = ctype
;
9831 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9833 cp_error ("type `%T' is not derived from type `%T'",
9835 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9841 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9842 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9843 == constructor_name_full (ctype
))
9844 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9845 == constructor_name (ctype
))))
9846 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9847 next
= &TREE_OPERAND (decl
, 1);
9851 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9852 && constructor_name (ctype
) == decl
)
9854 sfk
= sfk_constructor
;
9855 ctor_return_type
= ctype
;
9857 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9858 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9859 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9860 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9862 sfk
= sfk_destructor
;
9863 ctor_return_type
= ctype
;
9865 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9866 next
= &TREE_OPERAND (decl
, 0);
9877 /* Parse error puts this typespec where
9878 a declarator should go. */
9879 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9880 if (TREE_TYPE (decl
) == current_class_type
)
9881 cp_error (" perhaps you want `%T' for a constructor",
9882 current_class_name
);
9883 dname
= DECL_NAME (decl
);
9884 name
= IDENTIFIER_POINTER (dname
);
9886 /* Avoid giving two errors for this. */
9887 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9889 declspecs
= tree_cons (NULL_TREE
, integer_type_node
, declspecs
);
9895 cp_compiler_error ("`%D' as declarator", decl
);
9896 return 0; /* We used to do a 155 abort here. */
9901 /* A function definition's declarator must have the form of
9902 a function declarator. */
9904 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9907 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9908 && innermost_code
!= CALL_EXPR
9909 && ! (ctype
&& declspecs
== NULL_TREE
))
9911 cp_error ("declaration of `%D' as non-function", dname
);
9912 return void_type_node
;
9915 /* Anything declared one level down from the top level
9916 must be one of the parameters of a function
9917 (because the body is at least two levels down). */
9919 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9920 by not allowing C++ class definitions to specify their parameters
9921 with xdecls (must be spec.d in the parmlist).
9923 Since we now wait to push a class scope until we are sure that
9924 we are in a legitimate method context, we must set oldcname
9925 explicitly (since current_class_name is not yet alive).
9927 We also want to avoid calling this a PARM if it is in a namespace. */
9929 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
9931 struct binding_level
*b
= current_binding_level
;
9932 current_binding_level
= b
->level_chain
;
9933 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9934 decl_context
= PARM
;
9935 current_binding_level
= b
;
9939 name
= decl_context
== PARM
? "parameter" : "type name";
9941 /* Look through the decl specs and record which ones appear.
9942 Some typespecs are defined as built-in typenames.
9943 Others, the ones that are modifiers of other types,
9944 are represented by bits in SPECBITS: set the bits for
9945 the modifiers that appear. Storage class keywords are also in SPECBITS.
9947 If there is a typedef name or a type, store the type in TYPE.
9948 This includes builtin typedefs such as `int'.
9950 Set EXPLICIT_INT if the type is `int' or `char' and did not
9951 come from a user typedef.
9953 Set LONGLONG if `long' is mentioned twice.
9955 For C++, constructors and destructors have their own fast treatment. */
9957 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
9962 /* Certain parse errors slip through. For example,
9963 `int class;' is not caught by the parser. Try
9964 weakly to recover here. */
9965 if (TREE_CODE (spec
) != TREE_LIST
)
9968 id
= TREE_VALUE (spec
);
9970 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9972 if (id
== ridpointers
[(int) RID_INT
]
9973 || id
== ridpointers
[(int) RID_CHAR
]
9974 || id
== ridpointers
[(int) RID_BOOL
]
9975 || id
== ridpointers
[(int) RID_WCHAR
])
9979 if (id
== ridpointers
[(int) RID_BOOL
])
9980 error ("`bool' is now a keyword");
9982 cp_error ("extraneous `%T' ignored", id
);
9986 if (id
== ridpointers
[(int) RID_INT
])
9988 else if (id
== ridpointers
[(int) RID_CHAR
])
9990 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
9994 /* C++ aggregate types. */
9995 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
9998 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
10000 type
= IDENTIFIER_TYPE_VALUE (id
);
10004 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
10006 if (ridpointers
[i
] == id
)
10008 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
10010 if (pedantic
&& ! in_system_header
&& warn_long_long
)
10011 pedwarn ("ISO C++ does not support `long long'");
10013 error ("`long long long' is too long for GCC");
10017 else if (RIDBIT_SETP (i
, specbits
))
10018 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
10019 RIDBIT_SET (i
, specbits
);
10024 /* C++ aggregate types. */
10025 else if (TREE_CODE (id
) == TYPE_DECL
)
10028 cp_error ("multiple declarations `%T' and `%T'", type
,
10032 type
= TREE_TYPE (id
);
10033 TREE_VALUE (spec
) = type
;
10038 error ("two or more data types in declaration of `%s'", name
);
10039 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
10041 register tree t
= lookup_name (id
, 1);
10042 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
10043 error ("`%s' fails to be a typedef or built in type",
10044 IDENTIFIER_POINTER (id
));
10047 type
= TREE_TYPE (t
);
10049 /* See the code below that used this. */
10050 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
10055 else if (id
!= error_mark_node
)
10056 /* Can't change CLASS nodes into RECORD nodes here! */
10062 typedef_type
= type
;
10064 /* No type at all: default to `int', and set DEFAULTED_INT
10065 because it was not a user-defined typedef. */
10067 if (type
== NULL_TREE
10068 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
10069 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10070 || RIDBIT_SETP (RID_LONG
, specbits
)
10071 || RIDBIT_SETP (RID_SHORT
, specbits
)))
10073 /* These imply 'int'. */
10074 type
= integer_type_node
;
10078 if (sfk
!= sfk_none
)
10079 type
= check_special_function_return_type (sfk
, type
,
10082 else if (type
== NULL_TREE
)
10088 /* We handle `main' specially here, because 'main () { }' is so
10089 common. With no options, it is allowed. With -Wreturn-type,
10090 it is a warning. It is only an error with -pedantic-errors. */
10091 is_main
= (funcdef_flag
10092 && MAIN_NAME_P (dname
)
10093 && ctype
== NULL_TREE
10094 && in_namespace
== NULL_TREE
10095 && current_namespace
== global_namespace
);
10097 if (in_system_header
|| flag_ms_extensions
)
10098 /* Allow it, sigh. */;
10099 else if (pedantic
|| ! is_main
)
10100 cp_pedwarn ("ISO C++ forbids declaration of `%s' with no type",
10102 else if (warn_return_type
)
10103 cp_warning ("ISO C++ forbids declaration of `%s' with no type",
10106 type
= integer_type_node
;
10111 /* Now process the modifiers that were specified
10112 and check for invalid combinations. */
10114 /* Long double is a special combination. */
10116 if (RIDBIT_SETP (RID_LONG
, specbits
)
10117 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
10119 RIDBIT_RESET (RID_LONG
, specbits
);
10120 type
= build_qualified_type (long_double_type_node
,
10121 CP_TYPE_QUALS (type
));
10124 /* Check all other uses of type modifiers. */
10126 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10127 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10128 || RIDBIT_SETP (RID_LONG
, specbits
)
10129 || RIDBIT_SETP (RID_SHORT
, specbits
))
10133 if (TREE_CODE (type
) == REAL_TYPE
)
10134 error ("short, signed or unsigned invalid for `%s'", name
);
10135 else if (TREE_CODE (type
) != INTEGER_TYPE
)
10136 error ("long, short, signed or unsigned invalid for `%s'", name
);
10137 else if (RIDBIT_SETP (RID_LONG
, specbits
)
10138 && RIDBIT_SETP (RID_SHORT
, specbits
))
10139 error ("long and short specified together for `%s'", name
);
10140 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10141 || RIDBIT_SETP (RID_SHORT
, specbits
))
10143 error ("long or short specified with char for `%s'", name
);
10144 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10145 || RIDBIT_SETP (RID_SHORT
, specbits
))
10146 && TREE_CODE (type
) == REAL_TYPE
)
10147 error ("long or short specified with floating type for `%s'", name
);
10148 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10149 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
10150 error ("signed and unsigned given together for `%s'", name
);
10154 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
10156 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
10158 if (flag_pedantic_errors
)
10163 /* Discard the type modifiers if they are invalid. */
10166 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
10167 RIDBIT_RESET (RID_SIGNED
, specbits
);
10168 RIDBIT_RESET (RID_LONG
, specbits
);
10169 RIDBIT_RESET (RID_SHORT
, specbits
);
10174 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
10175 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
10177 error ("complex invalid for `%s'", name
);
10178 RIDBIT_RESET (RID_COMPLEX
, specbits
);
10181 /* Decide whether an integer type is signed or not.
10182 Optionally treat bitfields as signed by default. */
10183 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10186 It is implementation-defined whether a plain (neither
10187 explicitly signed or unsigned) char, short, int, or long
10188 bit-field is signed or unsigned.
10190 Naturally, we extend this to long long as well. Note that
10191 this does not include wchar_t. */
10192 || (bitfield
&& !flag_signed_bitfields
10193 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
10194 /* A typedef for plain `int' without `signed' can be
10195 controlled just like plain `int', but a typedef for
10196 `signed int' cannot be so controlled. */
10198 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
10199 && (TREE_CODE (type
) == INTEGER_TYPE
10200 || TREE_CODE (type
) == CHAR_TYPE
)
10201 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
10204 type
= long_long_unsigned_type_node
;
10205 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10206 type
= long_unsigned_type_node
;
10207 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10208 type
= short_unsigned_type_node
;
10209 else if (type
== char_type_node
)
10210 type
= unsigned_char_type_node
;
10211 else if (typedef_decl
)
10212 type
= unsigned_type (type
);
10214 type
= unsigned_type_node
;
10216 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10217 && type
== char_type_node
)
10218 type
= signed_char_type_node
;
10220 type
= long_long_integer_type_node
;
10221 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10222 type
= long_integer_type_node
;
10223 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10224 type
= short_integer_type_node
;
10226 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
10228 /* If we just have "complex", it is equivalent to
10229 "complex double", but if any modifiers at all are specified it is
10230 the complex form of TYPE. E.g, "complex short" is
10231 "complex short int". */
10233 if (defaulted_int
&& ! longlong
10234 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
10235 || RIDBIT_SETP (RID_SHORT
, specbits
)
10236 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10237 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
10238 type
= complex_double_type_node
;
10239 else if (type
== integer_type_node
)
10240 type
= complex_integer_type_node
;
10241 else if (type
== float_type_node
)
10242 type
= complex_float_type_node
;
10243 else if (type
== double_type_node
)
10244 type
= complex_double_type_node
;
10245 else if (type
== long_double_type_node
)
10246 type
= complex_long_double_type_node
;
10248 type
= build_complex_type (type
);
10251 if (sfk
== sfk_conversion
10252 && (RIDBIT_SETP (RID_CONST
, specbits
)
10253 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
10254 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
10255 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
10258 /* Set CONSTP if this declaration is `const', whether by
10259 explicit specification or via a typedef.
10260 Likewise for VOLATILEP. */
10262 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
10264 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
10266 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
10267 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10268 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10269 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10270 type
= cp_build_qualified_type (type
, type_quals
);
10272 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
10273 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
10274 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
10275 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
10276 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
10278 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10279 staticp
= 1 + (decl_context
== FIELD
);
10281 if (virtualp
&& staticp
== 2)
10283 cp_error ("member `%D' cannot be declared both virtual and static",
10287 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
10288 RIDBIT_RESET (RID_FRIEND
, specbits
);
10290 /* Warn if two storage classes are given. Default to `auto'. */
10292 if (RIDBIT_ANY_SET (specbits
))
10294 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
10295 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
10296 if (decl_context
== PARM
&& nclasses
> 0)
10297 error ("storage class specifiers invalid in parameter declarations");
10298 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10300 if (decl_context
== PARM
)
10301 error ("typedef declaration invalid in parameter declaration");
10304 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
10305 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
10308 /* Give error if `virtual' is used outside of class declaration. */
10310 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
10312 error ("virtual outside class declaration");
10316 /* Static anonymous unions are dealt with here. */
10317 if (staticp
&& decl_context
== TYPENAME
10318 && TREE_CODE (declspecs
) == TREE_LIST
10319 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
10320 decl_context
= FIELD
;
10322 /* Warn about storage classes that are invalid for certain
10323 kinds of declarations (parameters, typenames, etc.). */
10326 error ("multiple storage classes in declaration of `%s'", name
);
10327 else if (decl_context
!= NORMAL
&& nclasses
> 0)
10329 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
10330 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
10331 || RIDBIT_SETP (RID_AUTO
, specbits
)))
10333 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10335 else if (decl_context
== FIELD
10336 /* C++ allows static class elements */
10337 && RIDBIT_SETP (RID_STATIC
, specbits
))
10338 /* C++ also allows inlines and signed and unsigned elements,
10339 but in those cases we don't come in here. */
10343 if (decl_context
== FIELD
)
10345 tree tmp
= NULL_TREE
;
10346 register int op
= 0;
10350 /* Avoid trying to get an operand off an identifier node. */
10351 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10354 tmp
= TREE_OPERAND (declarator
, 0);
10355 op
= IDENTIFIER_OPNAME_P (tmp
);
10356 if (IDENTIFIER_TYPENAME_P (tmp
))
10358 if (IDENTIFIER_GLOBAL_VALUE (tmp
)
10359 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (tmp
))
10361 name
= IDENTIFIER_POINTER (tmp
);
10363 name
= "<invalid operator>";
10366 error ("storage class specified for %s `%s'",
10367 op
? "member operator" : "field",
10372 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10373 error ("storage class specified for parameter `%s'", name
);
10375 error ("storage class specified for typename");
10377 RIDBIT_RESET (RID_REGISTER
, specbits
);
10378 RIDBIT_RESET (RID_AUTO
, specbits
);
10379 RIDBIT_RESET (RID_EXTERN
, specbits
);
10382 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
10384 if (toplevel_bindings_p ())
10386 /* It's common practice (and completely valid) to have a const
10387 be initialized and declared extern. */
10388 if (!(type_quals
& TYPE_QUAL_CONST
))
10389 warning ("`%s' initialized and declared `extern'", name
);
10392 error ("`%s' has both `extern' and initializer", name
);
10394 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
10395 && ! toplevel_bindings_p ())
10396 error ("nested function `%s' declared `extern'", name
);
10397 else if (toplevel_bindings_p ())
10399 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10400 error ("top-level declaration of `%s' specifies `auto'", name
);
10403 if (nclasses
> 0 && friendp
)
10404 error ("storage class specifiers invalid in friend function declarations");
10406 /* Now figure out the structure of the declarator proper.
10407 Descend through it, creating more complex types, until we reach
10408 the declared identifier (or NULL_TREE, in an absolute declarator). */
10410 inner_attrs
= NULL_TREE
;
10413 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
10414 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
10416 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
10417 an INDIRECT_REF (for *...),
10418 a CALL_EXPR (for ...(...)),
10419 an identifier (for the name being declared)
10420 or a null pointer (for the place in an absolute declarator
10421 where the name was omitted).
10422 For the last two cases, we have just exited the loop.
10424 For C++ it could also be
10425 a SCOPE_REF (for class :: ...). In this case, we have converted
10426 sensible names to types, and those are the values we use to
10427 qualify the member name.
10428 an ADDR_EXPR (for &...),
10429 a BIT_NOT_EXPR (for destructors)
10431 At this point, TYPE is the type of elements of an array,
10432 or for a function to return, or for a pointer to point to.
10433 After this sequence of ifs, TYPE is the type of the
10434 array or function or pointer, and DECLARATOR has had its
10435 outermost layer removed. */
10437 if (type
== error_mark_node
)
10439 if (TREE_CODE (declarator
) == SCOPE_REF
)
10440 declarator
= TREE_OPERAND (declarator
, 1);
10442 declarator
= TREE_OPERAND (declarator
, 0);
10445 if (quals
!= NULL_TREE
10446 && (declarator
== NULL_TREE
10447 || TREE_CODE (declarator
) != SCOPE_REF
))
10449 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
10450 ctype
= TYPE_METHOD_BASETYPE (type
);
10451 if (ctype
!= NULL_TREE
)
10453 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
10454 grok_method_quals (ctype
, dummy
, quals
);
10455 type
= TREE_TYPE (dummy
);
10456 ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
)));
10461 /* See the comment for the TREE_LIST case, below. */
10464 else if (inner_attrs
)
10466 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10467 inner_attrs
= NULL_TREE
;
10470 switch (TREE_CODE (declarator
))
10474 /* We encode a declarator with embedded attributes using
10475 a TREE_LIST. The attributes apply to the declarator
10476 directly inside them, so we have to skip an iteration
10477 before applying them to the type. If the declarator just
10478 inside is the declarator-id, we apply the attrs to the
10480 inner_attrs
= TREE_PURPOSE (declarator
);
10482 declarator
= TREE_VALUE (declarator
);
10488 register tree size
;
10490 size
= TREE_OPERAND (declarator
, 1);
10492 /* VC++ spells a zero-sized array with []. */
10493 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
10494 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10495 size
= integer_zero_node
;
10497 declarator
= TREE_OPERAND (declarator
, 0);
10499 type
= create_array_type_for_decl (dname
, type
, size
);
10501 /* VLAs never work as fields. */
10502 if (decl_context
== FIELD
&& !processing_template_decl
10503 && TREE_CODE (type
) == ARRAY_TYPE
10504 && TYPE_DOMAIN (type
) != NULL_TREE
10505 && !TREE_CONSTANT (TYPE_MAX_VALUE (TYPE_DOMAIN (type
))))
10507 cp_error ("size of member `%D' is not constant", dname
);
10508 /* Proceed with arbitrary constant size, so that offset
10509 computations don't get confused. */
10510 type
= create_array_type_for_decl (dname
, TREE_TYPE (type
),
10522 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
10523 tree inner_decl
= TREE_OPERAND (declarator
, 0);
10525 /* Declaring a function type.
10526 Make sure we have a valid type for the function to return. */
10528 /* We now know that the TYPE_QUALS don't apply to the
10529 decl, but to its return type. */
10530 type_quals
= TYPE_UNQUALIFIED
;
10532 /* Warn about some types functions can't return. */
10534 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10536 error ("`%s' declared as function returning a function", name
);
10537 type
= integer_type_node
;
10539 if (TREE_CODE (type
) == ARRAY_TYPE
)
10541 error ("`%s' declared as function returning an array", name
);
10542 type
= integer_type_node
;
10545 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
10546 inner_decl
= TREE_OPERAND (inner_decl
, 1);
10548 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
10549 inner_decl
= dname
;
10551 /* Pick up type qualifiers which should be applied to `this'. */
10552 quals
= CALL_DECLARATOR_QUALS (declarator
);
10554 /* Pick up the exception specifications. */
10555 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
10557 /* Say it's a definition only for the CALL_EXPR
10558 closest to the identifier. */
10561 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
10562 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
10563 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
10565 if (ctype
== NULL_TREE
10566 && decl_context
== FIELD
10568 && (friendp
== 0 || dname
== current_class_name
))
10569 ctype
= current_class_type
;
10571 if (ctype
&& sfk
== sfk_conversion
)
10572 TYPE_HAS_CONVERSION (ctype
) = 1;
10573 if (ctype
&& constructor_name (ctype
) == dname
)
10575 /* We are within a class's scope. If our declarator name
10576 is the same as the class name, and we are defining
10577 a function, then it is a constructor/destructor, and
10578 therefore returns a void type. */
10580 if (flags
== DTOR_FLAG
)
10582 /* ISO C++ 12.4/2. A destructor may not be
10583 declared const or volatile. A destructor may
10586 error ("destructor cannot be static member function");
10589 cp_error ("destructors may not be `%s'",
10590 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10593 if (decl_context
== FIELD
)
10595 if (! member_function_or_else (ctype
,
10596 current_class_type
,
10598 return void_type_node
;
10601 else /* It's a constructor. */
10603 if (explicitp
== 1)
10605 /* ISO C++ 12.1. A constructor may not be
10606 declared const or volatile. A constructor may
10607 not be virtual. A constructor may not be
10610 error ("constructor cannot be static member function");
10613 pedwarn ("constructors cannot be declared virtual");
10618 cp_error ("constructors may not be `%s'",
10619 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10623 RID_BIT_TYPE tmp_bits
;
10624 bcopy ((void*)&specbits
, (void*)&tmp_bits
, sizeof (RID_BIT_TYPE
));
10625 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10626 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10627 if (RIDBIT_ANY_SET (tmp_bits
))
10628 error ("return value type specifier for constructor ignored");
10630 if (decl_context
== FIELD
)
10632 if (! member_function_or_else (ctype
,
10633 current_class_type
,
10635 return void_type_node
;
10636 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10637 if (sfk
!= sfk_constructor
)
10641 if (decl_context
== FIELD
)
10647 error ("can't initialize friend function `%s'", name
);
10650 /* Cannot be both friend and virtual. */
10651 error ("virtual functions cannot be friends");
10652 RIDBIT_RESET (RID_FRIEND
, specbits
);
10655 if (decl_context
== NORMAL
)
10656 error ("friend declaration not in class definition");
10657 if (current_function_decl
&& funcdef_flag
)
10658 cp_error ("can't define friend function `%s' in a local class definition",
10662 /* Construct the function type and go to the next
10663 inner layer of declarator. */
10665 declarator
= TREE_OPERAND (declarator
, 0);
10667 /* FIXME: This is where default args should be fully
10670 arg_types
= grokparms (inner_parms
, funcdecl_p
? funcdef_flag
: 0);
10672 if (declarator
&& flags
== DTOR_FLAG
)
10674 /* A destructor declared in the body of a class will
10675 be represented as a BIT_NOT_EXPR. But, we just
10676 want the underlying IDENTIFIER. */
10677 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10678 declarator
= TREE_OPERAND (declarator
, 0);
10680 if (arg_types
!= void_list_node
)
10682 cp_error ("destructors may not have parameters");
10683 arg_types
= void_list_node
;
10684 last_function_parms
= NULL_TREE
;
10688 /* ANSI says that `const int foo ();'
10689 does not make the function foo const. */
10690 type
= build_function_type (type
, arg_types
);
10694 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10695 if (TREE_PURPOSE (t
)
10696 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10698 add_defarg_fn (type
);
10707 /* Filter out pointers-to-references and references-to-references.
10708 We can get these if a TYPE_DECL is used. */
10710 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10712 error ("cannot declare %s to references",
10713 TREE_CODE (declarator
) == ADDR_EXPR
10714 ? "references" : "pointers");
10715 declarator
= TREE_OPERAND (declarator
, 0);
10719 if (TREE_CODE (type
) == OFFSET_TYPE
10720 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10721 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10723 cp_error ("cannot declare pointer to `%#T' member",
10725 type
= TREE_TYPE (type
);
10728 /* Merge any constancy or volatility into the target type
10729 for the pointer. */
10731 /* We now know that the TYPE_QUALS don't apply to the decl,
10732 but to the target of the pointer. */
10733 type_quals
= TYPE_UNQUALIFIED
;
10735 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10737 if (TREE_CODE (type
) == VOID_TYPE
)
10738 error ("invalid type: `void &'");
10740 type
= build_reference_type (type
);
10742 else if (TREE_CODE (type
) == METHOD_TYPE
)
10743 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10745 type
= build_pointer_type (type
);
10747 /* Process a list of type modifier keywords (such as
10748 const or volatile) that were given inside the `*' or `&'. */
10750 if (TREE_TYPE (declarator
))
10752 register tree typemodlist
;
10758 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10759 typemodlist
= TREE_CHAIN (typemodlist
))
10761 tree qualifier
= TREE_VALUE (typemodlist
);
10763 if (qualifier
== ridpointers
[(int) RID_CONST
])
10765 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10767 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10772 error ("invalid type modifier within pointer declarator");
10776 pedwarn ("duplicate `const'");
10778 pedwarn ("duplicate `volatile'");
10780 pedwarn ("duplicate `restrict'");
10782 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10783 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10784 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10785 if (TREE_CODE (declarator
) == ADDR_EXPR
10786 && (constp
|| volatilep
))
10789 pedwarn ("discarding `const' applied to a reference");
10791 pedwarn ("discarding `volatile' applied to a reference");
10792 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10794 type
= cp_build_qualified_type (type
, type_quals
);
10796 declarator
= TREE_OPERAND (declarator
, 0);
10802 /* We have converted type names to NULL_TREE if the
10803 name was bogus, or to a _TYPE node, if not.
10805 The variable CTYPE holds the type we will ultimately
10806 resolve to. The code here just needs to build
10807 up appropriate member types. */
10808 tree sname
= TREE_OPERAND (declarator
, 1);
10811 /* Destructors can have their visibilities changed as well. */
10812 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10813 sname
= TREE_OPERAND (sname
, 0);
10815 if (TREE_COMPLEXITY (declarator
) == 0)
10816 /* This needs to be here, in case we are called
10817 multiple times. */ ;
10818 else if (TREE_COMPLEXITY (declarator
) == -1)
10819 /* Namespace member. */
10820 pop_decl_namespace ();
10821 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10822 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10823 else if (! IS_AGGR_TYPE_CODE
10824 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10826 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10828 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10829 that refer to ctype. They couldn't be resolved earlier
10830 because we hadn't pushed into the class yet.
10831 Example: resolve 'B<T>::type' in
10832 'B<typename B<T>::type> B<T>::f () { }'. */
10833 if (current_template_parms
10834 && uses_template_parms (type
)
10835 && uses_template_parms (current_class_type
))
10837 tree args
= current_template_args ();
10838 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10841 /* This pop_nested_class corresponds to the
10842 push_nested_class used to push into class scope for
10843 parsing the argument list of a function decl, in
10845 pop_nested_class ();
10846 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10849 my_friendly_abort (16);
10851 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10853 /* We had a reference to a global decl, or
10854 perhaps we were given a non-aggregate typedef,
10855 in which case we cleared this out, and should just
10856 keep going as though it wasn't there. */
10857 declarator
= sname
;
10860 ctype
= TREE_OPERAND (declarator
, 0);
10863 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10865 /* You're supposed to have one `template <...>'
10866 for every template class, but you don't need one
10867 for a full specialization. For example:
10869 template <class T> struct S{};
10870 template <> struct S<int> { void f(); };
10871 void S<int>::f () {}
10873 is correct; there shouldn't be a `template <>' for
10874 the definition of `S<int>::f'. */
10875 if (CLASSTYPE_TEMPLATE_INFO (t
)
10876 && (CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
10877 || uses_template_parms (CLASSTYPE_TI_ARGS (t
))))
10878 template_count
+= 1;
10880 t
= TYPE_MAIN_DECL (t
);
10881 if (DECL_LANG_SPECIFIC (t
))
10882 t
= DECL_CONTEXT (t
);
10887 if (sname
== NULL_TREE
)
10890 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10892 /* This is the `standard' use of the scoping operator:
10893 basetype :: member . */
10895 if (ctype
== current_class_type
)
10901 Is this ill-formed? */
10904 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10907 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10909 if (current_class_type
== NULL_TREE
10911 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10912 TYPE_ARG_TYPES (type
));
10915 cp_error ("cannot declare member function `%T::%s' within `%T'",
10916 ctype
, name
, current_class_type
);
10917 return void_type_node
;
10920 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10921 || COMPLETE_TYPE_P (complete_type (ctype
)))
10923 /* Have to move this code elsewhere in this function.
10924 this code is used for i.e., typedef int A::M; M *pm;
10926 It is? How? jason 10/2/94 */
10928 if (current_class_type
)
10930 cp_error ("cannot declare member `%T::%s' within `%T'",
10931 ctype
, name
, current_class_type
);
10932 return void_type_node
;
10934 type
= build_offset_type (ctype
, type
);
10936 else if (uses_template_parms (ctype
))
10938 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10940 = build_cplus_method_type (ctype
, TREE_TYPE (type
),
10941 TYPE_ARG_TYPES (type
));
10945 cp_error ("structure `%T' not yet defined", ctype
);
10946 return error_mark_node
;
10949 declarator
= sname
;
10951 else if (TREE_CODE (sname
) == SCOPE_REF
)
10952 my_friendly_abort (17);
10956 declarator
= TREE_OPERAND (declarator
, 1);
10957 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10958 /* In this case, we will deal with it later. */
10962 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10963 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10964 TYPE_ARG_TYPES (type
));
10966 type
= build_offset_type (ctype
, type
);
10973 declarator
= TREE_OPERAND (declarator
, 0);
10978 case ENUMERAL_TYPE
:
10979 declarator
= NULL_TREE
;
10983 declarator
= NULL_TREE
;
10987 my_friendly_abort (158);
10991 /* See the comment for the TREE_LIST case, above. */
10994 if (! ignore_attrs
)
10995 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10997 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
10999 attrlist
= build_decl_list (NULL_TREE
, inner_attrs
);
11002 /* Now TYPE has the actual type. */
11004 if (explicitp
== 1 || (explicitp
&& friendp
))
11006 /* [dcl.fct.spec] The explicit specifier shall only be used in
11007 declarations of constructors within a class definition. */
11008 error ("only declarations of constructors can be `explicit'");
11012 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11014 if (current_class_name
== NULL_TREE
|| decl_context
== PARM
|| friendp
)
11016 error ("non-member `%s' cannot be declared `mutable'", name
);
11017 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11019 else if (decl_context
== TYPENAME
|| RIDBIT_SETP (RID_TYPEDEF
, specbits
))
11021 error ("non-object member `%s' cannot be declared `mutable'", name
);
11022 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11024 else if (TREE_CODE (type
) == FUNCTION_TYPE
11025 || TREE_CODE (type
) == METHOD_TYPE
)
11027 error ("function `%s' cannot be declared `mutable'", name
);
11028 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11032 error ("static `%s' cannot be declared `mutable'", name
);
11033 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11035 else if (type_quals
& TYPE_QUAL_CONST
)
11037 error ("const `%s' cannot be declared `mutable'", name
);
11038 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11042 if (declarator
== NULL_TREE
11043 || TREE_CODE (declarator
) == IDENTIFIER_NODE
11044 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
11045 && (TREE_CODE (type
) == FUNCTION_TYPE
11046 || TREE_CODE (type
) == METHOD_TYPE
)))
11048 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11050 cp_error ("template-id `%D' used as a declarator", declarator
);
11051 declarator
= dname
;
11054 /* Unexpected declarator format. */
11055 my_friendly_abort (990210);
11057 /* If this is declaring a typedef name, return a TYPE_DECL. */
11059 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
11063 /* Note that the grammar rejects storage classes
11064 in typenames, fields or parameters. */
11065 if (current_lang_name
== lang_name_java
)
11066 TYPE_FOR_JAVA (type
) = 1;
11068 if (decl_context
== FIELD
)
11070 if (declarator
== constructor_name (current_class_type
))
11071 cp_pedwarn ("ISO C++ forbids nested type `%D' with same name as enclosing class",
11073 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
11076 decl
= build_decl (TYPE_DECL
, declarator
, type
);
11078 /* If the user declares "typedef struct {...} foo" then the
11079 struct will have an anonymous name. Fill that name in now.
11080 Nothing can refer to it, so nothing needs know about the name
11082 if (type
!= error_mark_node
11084 && TYPE_NAME (type
)
11085 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
11086 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
11087 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
11089 tree oldname
= TYPE_NAME (type
);
11092 /* Replace the anonymous name with the real name everywhere. */
11093 lookup_tag_reverse (type
, declarator
);
11094 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
11095 if (TYPE_NAME (t
) == oldname
)
11096 TYPE_NAME (t
) = decl
;
11098 if (TYPE_LANG_SPECIFIC (type
))
11099 TYPE_WAS_ANONYMOUS (type
) = 1;
11101 /* If this is a typedef within a template class, the nested
11102 type is a (non-primary) template. The name for the
11103 template needs updating as well. */
11104 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
11105 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
11106 = TYPE_IDENTIFIER (type
);
11109 DECL_ASSEMBLER_NAME (decl
) = mangle_type (type
);
11112 /* XXX Temporarily set the scope.
11113 When returning, start_decl expects it as NULL_TREE,
11114 and will then then set it using pushdecl. */
11115 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
11116 if (current_class_type
)
11117 DECL_CONTEXT (decl
) = current_class_type
;
11119 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
11121 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
11122 DECL_ASSEMBLER_NAME (decl
)
11123 = get_identifier (build_overload_name (type
, 1, 1));
11124 DECL_CONTEXT (decl
) = NULL_TREE
;
11127 /* FIXME remangle member functions; member functions of a
11128 type with external linkage have external linkage. */
11131 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11133 cp_error_at ("typedef name may not be class-qualified", decl
);
11138 if (ctype
== NULL_TREE
)
11140 if (TREE_CODE (type
) != METHOD_TYPE
)
11141 cp_error_at ("invalid type qualifier for non-member function type", decl
);
11143 ctype
= TYPE_METHOD_BASETYPE (type
);
11145 if (ctype
!= NULL_TREE
)
11146 grok_method_quals (ctype
, decl
, quals
);
11149 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
11150 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
11151 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
11153 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
11154 inlinep
, friendp
, raises
!= NULL_TREE
);
11157 error ("typedef declaration includes an initializer");
11162 /* Detect the case of an array type of unspecified size
11163 which came, as such, direct from a typedef name.
11164 We must copy the type, so that each identifier gets
11165 a distinct type, so that each identifier's size can be
11166 controlled separately by its own initializer. */
11168 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
11169 && TYPE_DOMAIN (type
) == NULL_TREE
)
11171 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
11174 /* If this is a type name (such as, in a cast or sizeof),
11175 compute the type and return it now. */
11177 if (decl_context
== TYPENAME
)
11179 /* Note that the grammar rejects storage classes
11180 in typenames, fields or parameters. */
11181 if (type_quals
!= TYPE_UNQUALIFIED
)
11182 type_quals
= TYPE_UNQUALIFIED
;
11184 /* Special case: "friend class foo" looks like a TYPENAME context. */
11187 if (type_quals
!= TYPE_UNQUALIFIED
)
11189 cp_error ("type qualifiers specified for friend class declaration");
11190 type_quals
= TYPE_UNQUALIFIED
;
11194 cp_error ("`inline' specified for friend class declaration");
11198 /* Only try to do this stuff if we didn't already give up. */
11199 if (type
!= integer_type_node
)
11201 /* A friendly class? */
11202 if (current_class_type
)
11203 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
11205 error ("trying to make class `%s' a friend of global scope",
11206 TYPE_NAME_STRING (type
));
11207 type
= void_type_node
;
11212 if (ctype
== NULL_TREE
)
11214 if (TREE_CODE (type
) != METHOD_TYPE
)
11215 cp_error ("invalid qualifiers on non-member function type");
11217 ctype
= TYPE_METHOD_BASETYPE (type
);
11221 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
11222 grok_method_quals (ctype
, dummy
, quals
);
11223 type
= TREE_TYPE (dummy
);
11229 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
11230 && decl_context
!= CATCHPARM
11231 && TREE_CODE (type
) != UNION_TYPE
11234 cp_error ("abstract declarator `%T' used as declaration", type
);
11235 declarator
= make_anon_name ();
11238 /* `void' at top level (not within pointer)
11239 is allowed only in typedefs or type names.
11240 We don't complain about parms either, but that is because
11241 a better error message can be made later. */
11243 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
11246 error ("unnamed variable or field declared void");
11247 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
11249 if (IDENTIFIER_OPNAME_P (declarator
))
11250 my_friendly_abort (356);
11252 error ("variable or field `%s' declared void", name
);
11255 error ("variable or field declared void");
11256 type
= integer_type_node
;
11259 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
11260 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
11262 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
11264 if (ctype
|| in_namespace
)
11265 error ("cannot use `::' in parameter declaration");
11267 /* A parameter declared as an array of T is really a pointer to T.
11268 One declared as a function is really a pointer to a function.
11269 One declared as a member is really a pointer to member. */
11271 if (TREE_CODE (type
) == ARRAY_TYPE
)
11273 /* Transfer const-ness of array into that of type pointed to. */
11274 type
= build_pointer_type (TREE_TYPE (type
));
11275 type_quals
= TYPE_UNQUALIFIED
;
11277 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11278 type
= build_pointer_type (type
);
11279 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11280 type
= build_pointer_type (type
);
11281 else if (TREE_CODE (type
) == VOID_TYPE
&& declarator
)
11283 error ("declaration of `%s' as void", name
);
11289 register tree decl
;
11291 if (decl_context
== PARM
)
11293 decl
= build_decl (PARM_DECL
, declarator
, type
);
11295 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
11296 inlinep
, friendp
, raises
!= NULL_TREE
);
11298 /* Compute the type actually passed in the parmlist,
11299 for the case where there is no prototype.
11300 (For example, shorts and chars are passed as ints.)
11301 When there is a prototype, this is overridden later. */
11303 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
11305 else if (decl_context
== FIELD
)
11307 if (type
== error_mark_node
)
11309 /* Happens when declaring arrays of sizes which
11310 are error_mark_node, for example. */
11313 else if (in_namespace
&& !friendp
)
11315 /* Something like struct S { int N::j; }; */
11316 cp_error ("invalid use of `::'");
11319 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11322 tree function_context
;
11324 /* We catch the others as conflicts with the builtin
11326 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
11328 cp_error ("function `%D' cannot be declared friend",
11335 if (ctype
== NULL_TREE
)
11336 ctype
= current_class_type
;
11338 if (ctype
== NULL_TREE
)
11340 cp_error ("can't make `%D' into a method -- not in a class",
11342 return void_type_node
;
11345 /* ``A union may [ ... ] not [ have ] virtual functions.''
11347 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
11349 cp_error ("function `%D' declared virtual inside a union",
11351 return void_type_node
;
11354 if (declarator
== ansi_opname (NEW_EXPR
)
11355 || declarator
== ansi_opname (VEC_NEW_EXPR
)
11356 || declarator
== ansi_opname (DELETE_EXPR
)
11357 || declarator
== ansi_opname (VEC_DELETE_EXPR
))
11361 cp_error ("`%D' cannot be declared virtual, since it is always static",
11366 else if (staticp
< 2)
11367 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11368 TYPE_ARG_TYPES (type
));
11371 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
11372 function_context
= (ctype
!= NULL_TREE
) ?
11373 decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
11374 publicp
= (! friendp
|| ! staticp
)
11375 && function_context
== NULL_TREE
;
11376 decl
= grokfndecl (ctype
, type
,
11377 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
11378 ? declarator
: dname
,
11380 virtualp
, flags
, quals
, raises
,
11381 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
11382 funcdef_flag
, template_count
, in_namespace
);
11383 if (decl
== NULL_TREE
)
11386 /* This clobbers the attrs stored in `decl' from `attrlist'. */
11387 /* The decl and setting of decl_machine_attr is also turned off. */
11388 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
11391 /* [class.conv.ctor]
11393 A constructor declared without the function-specifier
11394 explicit that can be called with a single parameter
11395 specifies a conversion from the type of its first
11396 parameter to the type of its class. Such a constructor
11397 is called a converting constructor. */
11398 if (explicitp
== 2)
11399 DECL_NONCONVERTING_P (decl
) = 1;
11400 else if (DECL_CONSTRUCTOR_P (decl
))
11402 /* The constructor can be called with exactly one
11403 parameter if there is at least one parameter, and
11404 any subsequent parameters have default arguments.
11405 We don't look at the first parameter, which is
11406 really just the `this' parameter for the new
11409 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
11411 /* Skip the `in_chrg' argument too, if present. */
11412 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
11413 arg_types
= TREE_CHAIN (arg_types
);
11415 if (arg_types
== void_list_node
11417 && TREE_CHAIN (arg_types
)
11418 && TREE_CHAIN (arg_types
) != void_list_node
11419 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
11420 DECL_NONCONVERTING_P (decl
) = 1;
11423 else if (TREE_CODE (type
) == METHOD_TYPE
)
11425 /* We only get here for friend declarations of
11426 members of other classes. */
11427 /* All method decls are public, so tell grokfndecl to set
11428 TREE_PUBLIC, also. */
11429 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
11430 virtualp
, flags
, quals
, raises
,
11431 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
11432 template_count
, in_namespace
);
11433 if (decl
== NULL_TREE
)
11436 else if (!staticp
&& ! processing_template_decl
11437 && !COMPLETE_TYPE_P (complete_type (type
))
11438 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
11441 cp_error ("field `%D' has incomplete type", declarator
);
11443 cp_error ("name `%T' has incomplete type", type
);
11445 /* If we're instantiating a template, tell them which
11446 instantiation made the field's type be incomplete. */
11447 if (current_class_type
11448 && TYPE_NAME (current_class_type
)
11449 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
11450 && declspecs
&& TREE_VALUE (declspecs
)
11451 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
11452 cp_error (" in instantiation of template `%T'",
11453 current_class_type
);
11455 type
= error_mark_node
;
11462 error ("`%s' is neither function nor member function; cannot be declared friend",
11463 IDENTIFIER_POINTER (declarator
));
11471 /* Friends are treated specially. */
11472 if (ctype
== current_class_type
)
11473 warning ("member functions are implicitly friends of their class");
11476 tree t
= NULL_TREE
;
11477 if (decl
&& DECL_NAME (decl
))
11479 if (template_class_depth (current_class_type
) == 0)
11482 = check_explicit_specialization
11484 template_count
, 2 * (funcdef_flag
!= 0) + 4);
11485 if (decl
== error_mark_node
)
11486 return error_mark_node
;
11489 t
= do_friend (ctype
, declarator
, decl
,
11490 last_function_parms
, attrlist
, flags
, quals
,
11493 if (t
&& funcdef_flag
)
11496 return void_type_node
;
11500 /* Structure field. It may not be a function, except for C++ */
11502 if (decl
== NULL_TREE
)
11508 /* An attempt is being made to initialize a non-static
11509 member. But, from [class.mem]:
11511 4 A member-declarator can contain a
11512 constant-initializer only if it declares a static
11513 member (_class.static_) of integral or enumeration
11514 type, see _class.static.data_.
11516 This used to be relatively common practice, but
11517 the rest of the compiler does not correctly
11518 handle the initialization unless the member is
11519 static so we make it static below. */
11520 cp_pedwarn ("ISO C++ forbids initialization of member `%D'",
11522 cp_pedwarn ("making `%D' static", declarator
);
11526 if (uses_template_parms (type
))
11527 /* We'll check at instantiation time. */
11529 else if (check_static_variable_definition (declarator
,
11531 /* If we just return the declaration, crashes
11532 will sometimes occur. We therefore return
11533 void_type_node, as if this was a friend
11534 declaration, to cause callers to completely
11535 ignore this declaration. */
11536 return void_type_node
;
11539 /* 9.2p13 [class.mem] */
11540 if (declarator
== constructor_name (current_class_type
)
11541 /* The standard does not allow non-static data members
11542 here either, but we agreed at the 10/99 meeting
11543 to change that in TC 1 so that they are allowed in
11544 classes with no user-defined constructors. */
11546 cp_pedwarn ("ISO C++ forbids static data member `%D' with same name as enclosing class",
11551 /* C++ allows static class members. All other work
11552 for this is done by grokfield. */
11553 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
11554 TREE_STATIC (decl
) = 1;
11555 /* In class context, 'static' means public access. */
11556 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
11560 decl
= build_decl (FIELD_DECL
, declarator
, type
);
11561 DECL_NONADDRESSABLE_P (decl
) = bitfield
;
11562 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11564 DECL_MUTABLE_P (decl
) = 1;
11565 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11569 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
11570 inlinep
, friendp
, raises
!= NULL_TREE
);
11573 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11575 tree original_name
;
11581 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11582 original_name
= dname
;
11584 original_name
= declarator
;
11586 if (RIDBIT_SETP (RID_AUTO
, specbits
))
11587 error ("storage class `auto' invalid for function `%s'", name
);
11588 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11589 error ("storage class `register' invalid for function `%s'", name
);
11591 /* Function declaration not at top level.
11592 Storage classes other than `extern' are not allowed
11593 and `extern' makes no difference. */
11594 if (! toplevel_bindings_p ()
11595 && (RIDBIT_SETP (RID_STATIC
, specbits
)
11596 || RIDBIT_SETP (RID_INLINE
, specbits
))
11599 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11600 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
11602 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
11605 if (ctype
== NULL_TREE
)
11609 error ("virtual non-class function `%s'", name
);
11613 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
11614 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11615 TYPE_ARG_TYPES (type
));
11617 /* Record presence of `static'. */
11618 publicp
= (ctype
!= NULL_TREE
11619 || RIDBIT_SETP (RID_EXTERN
, specbits
)
11620 || !RIDBIT_SETP (RID_STATIC
, specbits
));
11622 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
11623 virtualp
, flags
, quals
, raises
,
11625 publicp
, inlinep
, funcdef_flag
,
11626 template_count
, in_namespace
);
11627 if (decl
== NULL_TREE
)
11632 int illegal_static
= 0;
11634 /* Don't allow a static member function in a class, and forbid
11635 declaring main to be static. */
11636 if (TREE_CODE (type
) == METHOD_TYPE
)
11638 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11639 illegal_static
= 1;
11641 else if (current_function_decl
)
11643 /* FIXME need arm citation */
11644 error ("cannot declare static function inside another function");
11645 illegal_static
= 1;
11648 if (illegal_static
)
11651 RIDBIT_RESET (RID_STATIC
, specbits
);
11657 /* It's a variable. */
11659 /* An uninitialized decl with `extern' is a reference. */
11660 decl
= grokvardecl (type
, declarator
, &specbits
,
11662 (type_quals
& TYPE_QUAL_CONST
) != 0,
11664 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11665 inlinep
, friendp
, raises
!= NULL_TREE
);
11669 DECL_CONTEXT (decl
) = ctype
;
11672 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11674 RIDBIT_RESET (RID_STATIC
, specbits
);
11676 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11678 cp_error ("static member `%D' declared `register'", decl
);
11679 RIDBIT_RESET (RID_REGISTER
, specbits
);
11681 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11683 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11685 RIDBIT_RESET (RID_EXTERN
, specbits
);
11690 my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE
, specbits
), 19990927);
11692 /* Record `register' declaration for warnings on &
11693 and in case doing stupid register allocation. */
11695 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11696 DECL_REGISTER (decl
) = 1;
11698 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11699 DECL_THIS_EXTERN (decl
) = 1;
11701 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11702 DECL_THIS_STATIC (decl
) = 1;
11704 /* Record constancy and volatility. There's no need to do this
11705 when processing a template; we'll do this for the instantiated
11706 declaration based on the type of DECL. */
11707 if (!processing_template_decl
)
11708 c_apply_type_quals_to_decl (type_quals
, decl
);
11714 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11715 An empty exprlist is a parmlist. An exprlist which
11716 contains only identifiers at the global level
11717 is a parmlist. Otherwise, it is an exprlist. */
11720 parmlist_is_exprlist (exprs
)
11723 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11726 if (toplevel_bindings_p ())
11728 /* At the global level, if these are all identifiers,
11729 then it is a parmlist. */
11732 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11734 exprs
= TREE_CHAIN (exprs
);
11741 /* Subroutine of start_function. Ensure that each of the parameter
11742 types (as listed in PARMS) is complete, as is required for a
11743 function definition. */
11746 require_complete_types_for_parms (parms
)
11749 for (; parms
; parms
= TREE_CHAIN (parms
))
11751 tree type
= TREE_TYPE (parms
);
11753 /* Try to complete the TYPE. */
11754 type
= complete_type (type
);
11756 if (type
== error_mark_node
)
11759 if (!COMPLETE_TYPE_P (type
))
11761 if (DECL_NAME (parms
))
11762 error ("parameter `%s' has incomplete type",
11763 IDENTIFIER_POINTER (DECL_NAME (parms
)));
11765 error ("parameter has incomplete type");
11766 TREE_TYPE (parms
) = error_mark_node
;
11769 layout_decl (parms
, 0);
11773 /* Returns non-zero if T is a local variable. */
11776 local_variable_p (t
)
11779 if ((TREE_CODE (t
) == VAR_DECL
11780 /* A VAR_DECL with a context that is a _TYPE is a static data
11782 && !TYPE_P (CP_DECL_CONTEXT (t
))
11783 /* Any other non-local variable must be at namespace scope. */
11784 && !DECL_NAMESPACE_SCOPE_P (t
))
11785 || (TREE_CODE (t
) == PARM_DECL
))
11791 /* Returns non-zero if T is an automatic local variable or a label.
11792 (These are the declarations that need to be remapped when the code
11793 containing them is duplicated.) */
11796 nonstatic_local_decl_p (t
)
11799 return ((local_variable_p (t
) && !TREE_STATIC (t
))
11800 || TREE_CODE (t
) == LABEL_DECL
11801 || TREE_CODE (t
) == RESULT_DECL
);
11804 /* Like local_variable_p, but suitable for use as a tree-walking
11808 local_variable_p_walkfn (tp
, walk_subtrees
, data
)
11810 int *walk_subtrees ATTRIBUTE_UNUSED
;
11811 void *data ATTRIBUTE_UNUSED
;
11813 return ((local_variable_p (*tp
) && !DECL_ARTIFICIAL (*tp
))
11814 ? *tp
: NULL_TREE
);
11817 /* Check that ARG, which is a default-argument expression for a
11818 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11819 something goes wrong. DECL may also be a _TYPE node, rather than a
11820 DECL, if there is no DECL available. */
11823 check_default_argument (decl
, arg
)
11830 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11831 /* We get a DEFAULT_ARG when looking at an in-class declaration
11832 with a default argument. Ignore the argument for now; we'll
11833 deal with it after the class is complete. */
11836 if (processing_template_decl
|| uses_template_parms (arg
))
11837 /* We don't do anything checking until instantiation-time. Note
11838 that there may be uninstantiated arguments even for an
11839 instantiated function, since default arguments are not
11840 instantiated until they are needed. */
11849 decl_type
= TREE_TYPE (decl
);
11851 if (arg
== error_mark_node
11852 || decl
== error_mark_node
11853 || TREE_TYPE (arg
) == error_mark_node
11854 || decl_type
== error_mark_node
)
11855 /* Something already went wrong. There's no need to check
11857 return error_mark_node
;
11859 /* [dcl.fct.default]
11861 A default argument expression is implicitly converted to the
11863 if (!TREE_TYPE (arg
)
11864 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11867 cp_error ("default argument for `%#D' has type `%T'",
11868 decl
, TREE_TYPE (arg
));
11870 cp_error ("default argument for parameter of type `%T' has type `%T'",
11871 decl_type
, TREE_TYPE (arg
));
11873 return error_mark_node
;
11876 /* [dcl.fct.default]
11878 Local variables shall not be used in default argument
11881 The keyword `this' shall not be used in a default argument of a
11882 member function. */
11883 var
= walk_tree (&arg
, local_variable_p_walkfn
, NULL
);
11886 cp_error ("default argument `%E' uses local variable `%D'",
11888 return error_mark_node
;
11895 /* Decode the list of parameter types for a function type.
11896 Given the list of things declared inside the parens,
11897 return a list of types.
11899 The list we receive can have three kinds of elements:
11900 an IDENTIFIER_NODE for names given without types,
11901 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11902 or void_type_node, to mark the end of an argument list
11903 when additional arguments are not permitted (... was not used).
11905 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11906 a mere declaration. A nonempty identifier-list gets an error message
11907 when FUNCDEF_FLAG is zero.
11908 If FUNCDEF_FLAG is 1, then parameter types must be complete.
11909 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11911 If all elements of the input list contain types,
11912 we return a list of the types.
11913 If all elements contain no type (except perhaps a void_type_node
11914 at the end), we return a null list.
11915 If some have types and some do not, it is an error, and we
11916 return a null list.
11918 Also set last_function_parms to either
11919 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11920 A list of names is converted to a chain of PARM_DECLs
11921 by store_parm_decls so that ultimately it is always a chain of decls.
11923 Note that in C++, parameters can take default values. These default
11924 values are in the TREE_PURPOSE field of the TREE_LIST. It is
11925 an error to specify default values which are followed by parameters
11926 that have no default values, or an ELLIPSES. For simplicities sake,
11927 only parameters which are specified with their types can take on
11931 grokparms (first_parm
, funcdef_flag
)
11935 tree result
= NULL_TREE
;
11936 tree decls
= NULL_TREE
;
11938 if (first_parm
!= NULL_TREE
11939 && TREE_CODE (TREE_VALUE (first_parm
)) == IDENTIFIER_NODE
)
11941 if (! funcdef_flag
)
11942 pedwarn ("parameter names (without types) in function declaration");
11943 last_function_parms
= first_parm
;
11946 else if (first_parm
!= NULL_TREE
11947 && TREE_CODE (TREE_VALUE (first_parm
)) != TREE_LIST
11948 && TREE_CODE (TREE_VALUE (first_parm
)) != VOID_TYPE
)
11949 my_friendly_abort (145);
11952 /* Types were specified. This is a list of declarators
11953 each represented as a TREE_LIST node. */
11954 register tree parm
, chain
;
11955 int any_init
= 0, any_error
= 0;
11957 if (first_parm
!= NULL_TREE
)
11959 tree last_result
= NULL_TREE
;
11960 tree last_decl
= NULL_TREE
;
11962 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11964 tree type
= NULL_TREE
, list_node
= parm
;
11965 register tree decl
= TREE_VALUE (parm
);
11966 tree init
= TREE_PURPOSE (parm
);
11968 chain
= TREE_CHAIN (parm
);
11969 /* @@ weak defense against parse errors. */
11970 if (TREE_CODE (decl
) != VOID_TYPE
11971 && TREE_CODE (decl
) != TREE_LIST
)
11973 /* Give various messages as the need arises. */
11974 if (TREE_CODE (decl
) == STRING_CST
)
11975 cp_error ("invalid string constant `%E'", decl
);
11976 else if (TREE_CODE (decl
) == INTEGER_CST
)
11977 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11981 if (TREE_CODE (decl
) != VOID_TYPE
)
11983 decl
= grokdeclarator (TREE_VALUE (decl
),
11984 TREE_PURPOSE (decl
),
11985 PARM
, init
!= NULL_TREE
,
11987 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
11990 /* Top-level qualifiers on the parameters are
11991 ignored for function types. */
11992 type
= TYPE_MAIN_VARIANT (TREE_TYPE (decl
));
11994 if (TREE_CODE (type
) == VOID_TYPE
)
11995 decl
= void_type_node
;
11996 else if (TREE_CODE (type
) == METHOD_TYPE
)
11998 if (DECL_NAME (decl
))
11999 /* Cannot use the decl here because
12000 we don't have DECL_CONTEXT set up yet. */
12001 cp_error ("parameter `%D' invalidly declared method type",
12004 error ("parameter invalidly declared method type");
12005 type
= build_pointer_type (type
);
12006 TREE_TYPE (decl
) = type
;
12008 else if (TREE_CODE (type
) == OFFSET_TYPE
)
12010 if (DECL_NAME (decl
))
12011 cp_error ("parameter `%D' invalidly declared offset type",
12014 error ("parameter invalidly declared offset type");
12015 type
= build_pointer_type (type
);
12016 TREE_TYPE (decl
) = type
;
12018 else if (abstract_virtuals_error (decl
, type
))
12019 any_error
= 1; /* Seems like a good idea. */
12020 else if (POINTER_TYPE_P (type
))
12023 while (POINTER_TYPE_P (t
)
12024 || (TREE_CODE (t
) == ARRAY_TYPE
12025 && TYPE_DOMAIN (t
) != NULL_TREE
))
12027 if (TREE_CODE (t
) == ARRAY_TYPE
)
12028 cp_error ("parameter type `%T' includes %s to array of unknown bound",
12030 TYPE_PTR_P (type
) ? "pointer" : "reference");
12034 if (TREE_CODE (decl
) == VOID_TYPE
)
12036 if (result
== NULL_TREE
)
12038 result
= void_list_node
;
12039 last_result
= result
;
12043 TREE_CHAIN (last_result
) = void_list_node
;
12044 last_result
= void_list_node
;
12047 && (chain
!= void_list_node
|| TREE_CHAIN (chain
)))
12048 error ("`void' in parameter list must be entire list");
12052 /* Since there is a prototype, args are passed in their own types. */
12053 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
12054 if (PROMOTE_PROTOTYPES
12055 && (TREE_CODE (type
) == INTEGER_TYPE
12056 || TREE_CODE (type
) == ENUMERAL_TYPE
)
12057 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
12058 DECL_ARG_TYPE (decl
) = integer_type_node
;
12059 if (!any_error
&& init
)
12062 init
= check_default_argument (decl
, init
);
12067 if (decls
== NULL_TREE
)
12074 TREE_CHAIN (last_decl
) = decl
;
12077 list_node
= tree_cons (init
, type
, NULL_TREE
);
12078 if (result
== NULL_TREE
)
12080 result
= list_node
;
12081 last_result
= result
;
12085 TREE_CHAIN (last_result
) = list_node
;
12086 last_result
= list_node
;
12090 TREE_CHAIN (last_result
) = NULL_TREE
;
12091 /* If there are no parameters, and the function does not end
12092 with `...', then last_decl will be NULL_TREE. */
12093 if (last_decl
!= NULL_TREE
)
12094 TREE_CHAIN (last_decl
) = NULL_TREE
;
12098 last_function_parms
= decls
;
12103 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
12104 FUNCTION_TYPE with the newly parsed version of its default argument, which
12105 was previously digested as text. See snarf_defarg et al in lex.c. */
12108 replace_defarg (arg
, init
)
12111 if (! processing_template_decl
12112 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
12113 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
12114 TREE_TYPE (init
), TREE_VALUE (arg
));
12115 TREE_PURPOSE (arg
) = init
;
12118 /* D is a constructor or overloaded `operator='. Returns non-zero if
12119 D's arguments allow it to be a copy constructor, or copy assignment
12128 if (!DECL_FUNCTION_MEMBER_P (d
))
12131 t
= FUNCTION_ARG_CHAIN (d
);
12132 if (DECL_CONSTRUCTOR_P (d
) && DECL_HAS_IN_CHARGE_PARM_P (d
))
12133 t
= TREE_CHAIN (t
);
12134 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
12135 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
12136 == DECL_CONTEXT (d
))
12137 && (TREE_CHAIN (t
) == NULL_TREE
12138 || TREE_CHAIN (t
) == void_list_node
12139 || TREE_PURPOSE (TREE_CHAIN (t
))))
12144 /* These memoizing functions keep track of special properties which
12145 a class may have. `grok_ctor_properties' notices whether a class
12146 has a constructor of the form X(X&), and also complains
12147 if the class has a constructor of the form X(X).
12148 `grok_op_properties' takes notice of the various forms of
12149 operator= which are defined, as well as what sorts of type conversion
12150 may apply. Both functions take a FUNCTION_DECL as an argument. */
12153 grok_ctor_properties (ctype
, decl
)
12156 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
12157 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
12159 /* When a type has virtual baseclasses, a magical first int argument is
12160 added to any ctor so we can tell if the class has been initialized
12161 yet. This could screw things up in this function, so we deliberately
12162 ignore the leading int if we're in that situation. */
12163 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
12165 my_friendly_assert (parmtypes
12166 && TREE_VALUE (parmtypes
) == integer_type_node
,
12168 parmtypes
= TREE_CHAIN (parmtypes
);
12169 parmtype
= TREE_VALUE (parmtypes
);
12174 A non-template constructor for class X is a copy constructor if
12175 its first parameter is of type X&, const X&, volatile X& or const
12176 volatile X&, and either there are no other parameters or else all
12177 other parameters have default arguments. */
12178 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
12179 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
12180 && (TREE_CHAIN (parmtypes
) == NULL_TREE
12181 || TREE_CHAIN (parmtypes
) == void_list_node
12182 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
12183 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12184 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12186 TYPE_HAS_INIT_REF (ctype
) = 1;
12187 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12188 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
12192 A declaration of a constructor for a class X is ill-formed if its
12193 first parameter is of type (optionally cv-qualified) X and either
12194 there are no other parameters or else all other parameters have
12197 We *don't* complain about member template instantiations that
12198 have this form, though; they can occur as we try to decide what
12199 constructor to use during overload resolution. Since overload
12200 resolution will never prefer such a constructor to the
12201 non-template copy constructor (which is either explicitly or
12202 implicitly defined), there's no need to worry about their
12203 existence. Theoretically, they should never even be
12204 instantiated, but that's hard to forestall. */
12205 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
12206 && (TREE_CHAIN (parmtypes
) == NULL_TREE
12207 || TREE_CHAIN (parmtypes
) == void_list_node
12208 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
12209 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12210 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12212 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
12214 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
12217 else if (TREE_CODE (parmtype
) == VOID_TYPE
12218 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
12219 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
12224 /* An operator with this code is unary, but can also be binary. */
12228 enum tree_code code
;
12230 return (code
== INDIRECT_REF
12231 || code
== ADDR_EXPR
12232 || code
== CONVERT_EXPR
12233 || code
== NEGATE_EXPR
12234 || code
== PREINCREMENT_EXPR
12235 || code
== PREDECREMENT_EXPR
);
12238 /* An operator with this name can only be unary. */
12242 enum tree_code code
;
12244 return (code
== TRUTH_NOT_EXPR
12245 || code
== BIT_NOT_EXPR
12246 || code
== COMPONENT_REF
12247 || code
== TYPE_EXPR
);
12250 /* Do a little sanity-checking on how they declared their operator. */
12253 grok_op_properties (decl
, virtualp
, friendp
)
12255 int virtualp
, friendp
;
12257 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
12259 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
12260 tree name
= DECL_NAME (decl
);
12261 enum tree_code operator_code
;
12264 /* Count the number of arguments. */
12265 for (argtype
= argtypes
, arity
= 0;
12266 argtype
&& argtype
!= void_list_node
;
12267 argtype
= TREE_CHAIN (argtype
))
12270 if (current_class_type
== NULL_TREE
)
12273 if (DECL_CONV_FN_P (decl
))
12274 operator_code
= TYPE_EXPR
;
12278 #define DEF_OPERATOR(NAME, CODE, NEW_MANGLING, OLD_MANGING, ARITY, ASSN_P) \
12279 if (ansi_opname (CODE) == name) \
12281 operator_code = CODE; \
12284 else if (ansi_assopname (CODE) == name) \
12286 operator_code = CODE; \
12287 DECL_ASSIGNMENT_OPERATOR_P (decl) = 1; \
12291 #include "operators.def"
12292 #undef DEF_OPERATOR
12294 my_friendly_abort (20000527);
12297 my_friendly_assert (operator_code
!= LAST_CPLUS_TREE_CODE
, 20000526);
12298 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12302 switch (operator_code
)
12305 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
12309 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
12312 case COMPONENT_REF
:
12314 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
12318 TYPE_HAS_NEW_OPERATOR (current_class_type
) = 1;
12322 TYPE_GETS_DELETE (current_class_type
) |= 1;
12326 TYPE_HAS_ARRAY_NEW_OPERATOR (current_class_type
) = 1;
12329 case VEC_DELETE_EXPR
:
12330 TYPE_GETS_DELETE (current_class_type
) |= 2;
12338 if (operator_code
== NEW_EXPR
|| operator_code
== VEC_NEW_EXPR
)
12340 /* When the compiler encounters the definition of A::operator new, it
12341 doesn't look at the class declaration to find out if it's static. */
12343 revert_static_member_fn (decl
);
12345 /* Take care of function decl if we had syntax errors. */
12346 if (argtypes
== NULL_TREE
)
12348 = build_function_type (ptr_type_node
,
12349 hash_tree_chain (integer_type_node
,
12352 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
12354 else if (operator_code
== DELETE_EXPR
|| operator_code
== VEC_DELETE_EXPR
)
12357 revert_static_member_fn (decl
);
12359 if (argtypes
== NULL_TREE
)
12361 = build_function_type (void_type_node
,
12362 hash_tree_chain (ptr_type_node
,
12365 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
12369 /* An operator function must either be a non-static member function
12370 or have at least one parameter of a class, a reference to a class,
12371 an enumeration, or a reference to an enumeration. 13.4.0.6 */
12372 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
12374 if (operator_code
== TYPE_EXPR
12375 || operator_code
== CALL_EXPR
12376 || operator_code
== COMPONENT_REF
12377 || operator_code
== ARRAY_REF
12378 || operator_code
== NOP_EXPR
)
12379 cp_error ("`%D' must be a nonstatic member function", decl
);
12384 if (DECL_STATIC_FUNCTION_P (decl
))
12385 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
12388 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
12390 tree arg
= TREE_VALUE (p
);
12391 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
12392 arg
= TREE_TYPE (arg
);
12394 /* This lets bad template code slip through. */
12395 if (IS_AGGR_TYPE (arg
)
12396 || TREE_CODE (arg
) == ENUMERAL_TYPE
12397 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
12398 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
12402 ("`%D' must have an argument of class or enumerated type",
12409 if (operator_code
== CALL_EXPR
)
12410 return; /* No restrictions on args. */
12412 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
12414 tree t
= TREE_TYPE (name
);
12417 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
12418 const char *what
= 0;
12421 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
12423 if (TREE_CODE (t
) == VOID_TYPE
)
12425 else if (t
== current_class_type
)
12426 what
= "the same type";
12427 /* Don't force t to be complete here. */
12428 else if (IS_AGGR_TYPE (t
)
12429 && COMPLETE_TYPE_P (t
)
12430 && DERIVED_FROM_P (t
, current_class_type
))
12431 what
= "a base class";
12434 warning ("conversion to %s%s will never use a type conversion operator",
12435 ref
? "a reference to " : "", what
);
12439 if (DECL_ASSIGNMENT_OPERATOR_P (decl
)
12440 && operator_code
== NOP_EXPR
)
12444 if (arity
!= 2 && methodp
)
12446 cp_error ("`%D' must take exactly one argument", decl
);
12449 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
12453 A user-declared copy assignment operator X::operator= is
12454 a non-static non-template member function of class X with
12455 exactly one parameter of type X, X&, const X&, volatile
12456 X& or const volatile X&. */
12457 if (copy_assignment_arg_p (parmtype
, virtualp
)
12458 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12459 && is_member_template (DECL_TI_TEMPLATE (decl
)))
12462 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
12463 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
12464 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12465 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
12468 else if (operator_code
== COND_EXPR
)
12471 cp_error ("ISO C++ prohibits overloading operator ?:");
12473 else if (ambi_op_p (operator_code
))
12476 /* We pick the one-argument operator codes by default, so
12477 we don't have to change anything. */
12479 else if (arity
== 2)
12481 /* If we thought this was a unary operator, we now know
12482 it to be a binary operator. */
12483 switch (operator_code
)
12486 operator_code
= MULT_EXPR
;
12490 operator_code
= BIT_AND_EXPR
;
12494 operator_code
= PLUS_EXPR
;
12498 operator_code
= MINUS_EXPR
;
12501 case PREINCREMENT_EXPR
:
12502 operator_code
= POSTINCREMENT_EXPR
;
12505 case PREDECREMENT_EXPR
:
12506 operator_code
= POSTDECREMENT_EXPR
;
12510 my_friendly_abort (20000527);
12513 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12515 if ((operator_code
== POSTINCREMENT_EXPR
12516 || operator_code
== POSTDECREMENT_EXPR
)
12517 && ! processing_template_decl
12518 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
12521 cp_error ("postfix `%D' must take `int' as its argument",
12525 ("postfix `%D' must take `int' as its second argument",
12532 cp_error ("`%D' must take either zero or one argument", decl
);
12534 cp_error ("`%D' must take either one or two arguments", decl
);
12537 /* More Effective C++ rule 6. */
12539 && (operator_code
== POSTINCREMENT_EXPR
12540 || operator_code
== POSTDECREMENT_EXPR
12541 || operator_code
== PREINCREMENT_EXPR
12542 || operator_code
== PREDECREMENT_EXPR
))
12544 tree arg
= TREE_VALUE (argtypes
);
12545 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
12546 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
12547 arg
= TREE_TYPE (arg
);
12548 arg
= TYPE_MAIN_VARIANT (arg
);
12549 if (operator_code
== PREINCREMENT_EXPR
12550 || operator_code
== PREDECREMENT_EXPR
)
12552 if (TREE_CODE (ret
) != REFERENCE_TYPE
12553 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
12555 cp_warning ("prefix `%D' should return `%T'", decl
,
12556 build_reference_type (arg
));
12560 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
12561 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
12565 else if (unary_op_p (operator_code
))
12570 cp_error ("`%D' must take `void'", decl
);
12572 cp_error ("`%D' must take exactly one argument", decl
);
12575 else /* if (binary_op_p (operator_code)) */
12580 cp_error ("`%D' must take exactly one argument", decl
);
12582 cp_error ("`%D' must take exactly two arguments", decl
);
12585 /* More Effective C++ rule 7. */
12587 && (operator_code
== TRUTH_ANDIF_EXPR
12588 || operator_code
== TRUTH_ORIF_EXPR
12589 || operator_code
== COMPOUND_EXPR
))
12590 cp_warning ("user-defined `%D' always evaluates both arguments",
12594 /* Effective C++ rule 23. */
12597 && (operator_code
== PLUS_EXPR
12598 || operator_code
== MINUS_EXPR
12599 || operator_code
== TRUNC_DIV_EXPR
12600 || operator_code
== MULT_EXPR
)
12601 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
12602 cp_warning ("`%D' should return by value", decl
);
12605 for (; argtypes
&& argtypes
!= void_list_node
;
12606 argtypes
= TREE_CHAIN (argtypes
))
12607 if (TREE_PURPOSE (argtypes
))
12609 TREE_PURPOSE (argtypes
) = NULL_TREE
;
12610 if (operator_code
== POSTINCREMENT_EXPR
12611 || operator_code
== POSTDECREMENT_EXPR
)
12614 cp_pedwarn ("`%D' cannot have default arguments", decl
);
12617 cp_error ("`%D' cannot have default arguments", decl
);
12623 static const char *
12625 enum tag_types code
;
12638 my_friendly_abort (981122);
12642 /* Get the struct, enum or union (CODE says which) with tag NAME.
12643 Define the tag as a forward-reference if it is not defined.
12645 C++: If a class derivation is given, process it here, and report
12646 an error if multiple derivation declarations are not identical.
12648 If this is a definition, come in through xref_tag and only look in
12649 the current frame for the name (since C++ allows new names in any
12653 xref_tag (code_type_node
, name
, globalize
)
12654 tree code_type_node
;
12658 enum tag_types tag_code
;
12659 enum tree_code code
;
12660 register tree ref
, t
;
12661 struct binding_level
*b
= current_binding_level
;
12663 tree attributes
= NULL_TREE
;
12664 tree context
= NULL_TREE
;
12666 /* If we are called from the parser, code_type_node will sometimes be a
12667 TREE_LIST. This indicates that the user wrote
12668 "class __attribute__ ((foo)) bar". Extract the attributes so we can
12670 if (TREE_CODE (code_type_node
) == TREE_LIST
)
12672 attributes
= TREE_PURPOSE (code_type_node
);
12673 code_type_node
= TREE_VALUE (code_type_node
);
12676 tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12681 code
= RECORD_TYPE
;
12687 code
= ENUMERAL_TYPE
;
12690 my_friendly_abort (18);
12693 /* If a cross reference is requested, look up the type
12694 already defined for this tag and return it. */
12698 name
= TYPE_IDENTIFIER (t
);
12702 t
= IDENTIFIER_TYPE_VALUE (name
);
12704 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
12705 && TREE_CODE (t
) != TEMPLATE_TEMPLATE_PARM
)
12710 /* If we know we are defining this tag, only look it up in
12711 this scope and don't try to find it as a type. */
12712 ref
= lookup_tag (code
, name
, b
, 1);
12718 /* [dcl.type.elab] If the identifier resolves to a
12719 typedef-name or a template type-parameter, the
12720 elaborated-type-specifier is ill-formed. */
12721 if (t
!= TYPE_MAIN_VARIANT (t
)
12722 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
12723 cp_pedwarn ("using typedef-name `%D' after `%s'",
12724 TYPE_NAME (t
), tag_name (tag_code
));
12725 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12726 cp_error ("using template type parameter `%T' after `%s'",
12727 t
, tag_name (tag_code
));
12732 ref
= lookup_tag (code
, name
, b
, 0);
12736 /* Try finding it as a type declaration. If that wins,
12738 ref
= lookup_name (name
, 1);
12740 if (ref
!= NULL_TREE
12741 && processing_template_decl
12742 && DECL_CLASS_TEMPLATE_P (ref
)
12743 && template_class_depth (current_class_type
) == 0)
12744 /* Since GLOBALIZE is true, we're declaring a global
12745 template, so we want this type. */
12746 ref
= DECL_TEMPLATE_RESULT (ref
);
12748 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12749 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12750 ref
= TREE_TYPE (ref
);
12755 if (ref
&& current_class_type
12756 && template_class_depth (current_class_type
)
12757 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12759 /* Since GLOBALIZE is non-zero, we are not looking at a
12760 definition of this tag. Since, in addition, we are currently
12761 processing a (member) template declaration of a template
12762 class, we must be very careful; consider:
12769 { template <class V>
12770 friend struct S1; };
12772 Here, the S2::S1 declaration should not be confused with the
12773 outer declaration. In particular, the inner version should
12774 have a template parameter of level 2, not level 1. This
12775 would be particularly important if the member declaration
12778 template <class V = U> friend struct S1;
12780 say, when we should tsubst into `U' when instantiating
12781 S2. On the other hand, when presented with:
12791 we must find the inner binding eventually. We
12792 accomplish this by making sure that the new type we
12793 create to represent this declaration has the right
12795 context
= TYPE_CONTEXT (ref
);
12802 /* If no such tag is yet defined, create a forward-reference node
12803 and record it as the "definition".
12804 When a real declaration of this type is found,
12805 the forward-reference will be altered into a real type. */
12806 if (code
== ENUMERAL_TYPE
)
12808 cp_error ("use of enum `%#D' without previous declaration", name
);
12810 ref
= make_node (ENUMERAL_TYPE
);
12812 /* Give the type a default layout like unsigned int
12813 to avoid crashing if it does not get defined. */
12814 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12815 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12816 TYPE_USER_ALIGN (ref
) = 0;
12817 TREE_UNSIGNED (ref
) = 1;
12818 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12819 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12820 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12822 /* Enable us to recognize when a type is created in class context.
12823 To do nested classes correctly, this should probably be cleared
12824 out when we leave this classes scope. Currently this in only
12825 done in `start_enum'. */
12827 pushtag (name
, ref
, globalize
);
12831 struct binding_level
*old_b
= class_binding_level
;
12833 ref
= make_aggr_type (code
);
12834 TYPE_CONTEXT (ref
) = context
;
12836 #ifdef NONNESTED_CLASSES
12837 /* Class types don't nest the way enums do. */
12838 class_binding_level
= (struct binding_level
*)0;
12840 pushtag (name
, ref
, globalize
);
12841 class_binding_level
= old_b
;
12846 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12847 redeclare_class_template (ref
, current_template_parms
);
12850 /* Until the type is defined, tentatively accept whatever
12851 structure tag the user hands us. */
12852 if (!COMPLETE_TYPE_P (ref
)
12853 && ref
!= current_class_type
12854 /* Have to check this, in case we have contradictory tag info. */
12855 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12857 if (tag_code
== class_type
)
12858 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12859 else if (tag_code
== record_type
)
12860 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12863 TREE_TYPE (ref
) = attributes
;
12869 xref_tag_from_type (old
, id
, globalize
)
12873 tree code_type_node
;
12875 if (TREE_CODE (old
) == RECORD_TYPE
)
12876 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12877 ? class_type_node
: record_type_node
);
12879 code_type_node
= union_type_node
;
12881 if (id
== NULL_TREE
)
12882 id
= TYPE_IDENTIFIER (old
);
12884 return xref_tag (code_type_node
, id
, globalize
);
12887 /* REF is a type (named NAME), for which we have just seen some
12888 baseclasses. BINFO is a list of those baseclasses; the
12889 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12890 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12891 struct, or union. */
12894 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12895 tree code_type_node
;
12899 /* In the declaration `A : X, Y, ... Z' we mark all the types
12900 (A, X, Y, ..., Z) so we can check for duplicates. */
12905 enum tag_types tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12907 if (tag_code
== union_type
)
12909 cp_error ("derived union `%T' invalid", ref
);
12913 len
= list_length (binfo
);
12915 /* First, make sure that any templates in base-classes are
12916 instantiated. This ensures that if we call ourselves recursively
12917 we do not get confused about which classes are marked and which
12919 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12920 complete_type (TREE_VALUE (base
));
12922 SET_CLASSTYPE_MARKED (ref
);
12923 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12925 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12927 /* The base of a derived struct is public by default. */
12929 = (TREE_PURPOSE (binfo
) == access_public_node
12930 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12931 || (tag_code
!= class_type
12932 && (TREE_PURPOSE (binfo
) == access_default_node
12933 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12935 = (TREE_PURPOSE (binfo
) == access_protected_node
12936 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12938 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12939 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12940 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12941 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12942 tree basetype
= TREE_VALUE (binfo
);
12945 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12946 basetype
= TREE_TYPE (basetype
);
12948 || (TREE_CODE (basetype
) != RECORD_TYPE
12949 && TREE_CODE (basetype
) != TYPENAME_TYPE
12950 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12951 && TREE_CODE (basetype
) != TEMPLATE_TEMPLATE_PARM
))
12953 cp_error ("base type `%T' fails to be a struct or class type",
12954 TREE_VALUE (binfo
));
12958 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12960 /* This code replaces similar code in layout_basetypes.
12961 We put the complete_type first for implicit `typename'. */
12962 if (!COMPLETE_TYPE_P (basetype
)
12963 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12965 cp_error ("base class `%T' has incomplete type", basetype
);
12970 if (CLASSTYPE_MARKED (basetype
))
12972 if (basetype
== ref
)
12973 cp_error ("recursive type `%T' undefined", basetype
);
12975 cp_error ("duplicate base type `%T' invalid", basetype
);
12979 if (TYPE_FOR_JAVA (basetype
)
12980 && (current_lang_stack
12981 == &VARRAY_TREE (current_lang_base
, 0)))
12982 TYPE_FOR_JAVA (ref
) = 1;
12984 /* Note that the BINFO records which describe individual
12985 inheritances are *not* shared in the lattice! They
12986 cannot be shared because a given baseclass may be
12987 inherited with different `accessibility' by different
12988 derived classes. (Each BINFO record describing an
12989 individual inheritance contains flags which say what
12990 the `accessibility' of that particular inheritance is.) */
12993 = make_binfo (size_zero_node
, basetype
,
12994 CLASS_TYPE_P (basetype
)
12995 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
12996 CLASS_TYPE_P (basetype
)
12997 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
12999 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
13000 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
13001 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
13002 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
13003 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
13005 /* We need to unshare the binfos now so that lookups during class
13006 definition work. */
13007 unshare_base_binfos (base_binfo
);
13009 SET_CLASSTYPE_MARKED (basetype
);
13011 /* We are free to modify these bits because they are meaningless
13012 at top level, and BASETYPE is a top-level type. */
13013 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
13015 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
13016 /* Converting to a virtual base class requires looking
13017 up the offset of the virtual base. */
13018 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
13021 if (CLASS_TYPE_P (basetype
))
13023 TYPE_HAS_NEW_OPERATOR (ref
)
13024 |= TYPE_HAS_NEW_OPERATOR (basetype
);
13025 TYPE_HAS_ARRAY_NEW_OPERATOR (ref
)
13026 |= TYPE_HAS_ARRAY_NEW_OPERATOR (basetype
);
13027 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
13028 /* If the base-class uses multiple inheritance, so do we. */
13029 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
13030 |= TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
13031 /* Likewise, if converting to a base of the base may require
13032 code, then we may need to generate code to convert to a
13034 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
)
13035 |= TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (basetype
);
13042 TREE_VEC_LENGTH (binfos
) = i
;
13044 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
13048 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
13049 /* If there is more than one non-empty they cannot be at the same
13051 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
13054 /* Unmark all the types. */
13056 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
13057 CLEAR_CLASSTYPE_MARKED (ref
);
13059 /* Now that we know all the base-classes, set up the list of virtual
13061 get_vbase_types (ref
);
13065 /* Begin compiling the definition of an enumeration type.
13066 NAME is its name (or null if anonymous).
13067 Returns the type object, as yet incomplete.
13068 Also records info about it so that build_enumerator
13069 may be used to declare the individual values as they are read. */
13075 register tree enumtype
= NULL_TREE
;
13076 struct binding_level
*b
= current_binding_level
;
13078 /* If this is the real definition for a previous forward reference,
13079 fill in the contents in the same object that used to be the
13080 forward reference. */
13082 if (name
!= NULL_TREE
)
13083 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
13085 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
13087 cp_error ("multiple definition of `%#T'", enumtype
);
13088 cp_error_at ("previous definition here", enumtype
);
13089 /* Clear out TYPE_VALUES, and start again. */
13090 TYPE_VALUES (enumtype
) = NULL_TREE
;
13094 enumtype
= make_node (ENUMERAL_TYPE
);
13095 pushtag (name
, enumtype
, 0);
13098 if (current_class_type
)
13099 TREE_ADDRESSABLE (b
->tags
) = 1;
13101 GNU_xref_decl (current_function_decl
, enumtype
);
13105 /* After processing and defining all the values of an enumeration type,
13106 install their decls in the enumeration type and finish it off.
13107 ENUMTYPE is the type object and VALUES a list of name-value pairs.
13108 Returns ENUMTYPE. */
13111 finish_enum (enumtype
)
13114 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
13115 /* Calculate the maximum value of any enumerator in this type. */
13117 tree values
= TYPE_VALUES (enumtype
);
13122 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
13127 /* The TREE_VALUE is a CONST_DECL for this enumeration
13129 decl
= TREE_VALUE (pair
);
13133 Following the closing brace of an enum-specifier, each
13134 enumerator has the type of its enumeration. Prior to the
13135 closing brace, the type of each enumerator is the type of
13136 its initializing value. */
13137 TREE_TYPE (decl
) = enumtype
;
13139 /* The DECL_INITIAL will be NULL if we are processing a
13140 template declaration and this enumeration constant had no
13141 explicit initializer. */
13142 value
= DECL_INITIAL (decl
);
13143 if (value
&& !processing_template_decl
)
13145 /* Set the TREE_TYPE for the VALUE as well. That's so
13146 that when we call decl_constant_value we get an
13147 entity of the right type (but with the constant
13148 value). Since we shouldn't ever call
13149 decl_constant_value on a template type, there's no
13150 reason to do that when processing_template_decl.
13151 And, if the expression is something like a
13152 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
13153 wreak havoc on the intended type of the expression.
13155 Of course, there's also no point in trying to compute
13156 minimum or maximum values if we're in a template. */
13157 TREE_TYPE (value
) = enumtype
;
13160 minnode
= maxnode
= value
;
13161 else if (tree_int_cst_lt (maxnode
, value
))
13163 else if (tree_int_cst_lt (value
, minnode
))
13167 if (processing_template_decl
)
13168 /* If this is just a template, leave the CONST_DECL
13169 alone. That way tsubst_copy will find CONST_DECLs for
13170 CONST_DECLs, and not INTEGER_CSTs. */
13173 /* In the list we're building up, we want the enumeration
13174 values, not the CONST_DECLs. */
13175 TREE_VALUE (pair
) = value
;
13179 maxnode
= minnode
= integer_zero_node
;
13181 TYPE_VALUES (enumtype
) = nreverse (values
);
13183 if (processing_template_decl
)
13185 tree scope
= current_scope ();
13186 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
13187 add_tree (build_min (TAG_DEFN
, enumtype
));
13191 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
13192 int lowprec
= min_precision (minnode
, unsignedp
);
13193 int highprec
= min_precision (maxnode
, unsignedp
);
13194 int precision
= MAX (lowprec
, highprec
);
13197 TYPE_SIZE (enumtype
) = NULL_TREE
;
13199 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
13201 TYPE_PRECISION (enumtype
) = precision
;
13203 fixup_unsigned_type (enumtype
);
13205 fixup_signed_type (enumtype
);
13207 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
13208 /* Use the width of the narrowest normal C type which is wide
13210 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
13213 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
13215 TYPE_SIZE (enumtype
) = 0;
13216 layout_type (enumtype
);
13218 /* Fix up all variant types of this enum type. */
13219 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
13220 tem
= TYPE_NEXT_VARIANT (tem
))
13222 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
13223 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
13224 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
13225 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
13226 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
13227 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
13228 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
13229 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
13230 TYPE_USER_ALIGN (tem
) = TYPE_USER_ALIGN (enumtype
);
13231 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
13234 /* Finish debugging output for this type. */
13235 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
13241 /* Build and install a CONST_DECL for an enumeration constant of the
13242 enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided.
13243 Assignment of sequential values by default is handled here. */
13246 build_enumerator (name
, value
, enumtype
)
13256 /* Remove no-op casts from the value. */
13258 STRIP_TYPE_NOPS (value
);
13260 if (! processing_template_decl
)
13262 /* Validate and default VALUE. */
13263 if (value
!= NULL_TREE
)
13265 value
= decl_constant_value (value
);
13267 if (TREE_CODE (value
) == INTEGER_CST
)
13269 value
= default_conversion (value
);
13270 constant_expression_warning (value
);
13274 cp_error ("enumerator value for `%D' not integer constant", name
);
13279 /* Default based on previous value. */
13280 if (value
== NULL_TREE
&& ! processing_template_decl
)
13284 if (TYPE_VALUES (enumtype
))
13286 /* The next value is the previous value ... */
13287 prev_value
= DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype
)));
13288 /* ... plus one. */
13289 value
= cp_build_binary_op (PLUS_EXPR
,
13293 if (tree_int_cst_lt (value
, prev_value
))
13294 cp_error ("overflow in enumeration values at `%D'", name
);
13297 value
= integer_zero_node
;
13300 /* Remove no-op casts from the value. */
13302 STRIP_TYPE_NOPS (value
);
13304 /* To fix MAX_VAL enum consts. (bkoz) */
13305 TREE_TYPE (value
) = integer_type_node
;
13309 /* We always have to copy here; not all INTEGER_CSTs are unshared.
13310 Even in other cases, we will later (in finish_enum) be setting
13311 the type of VALUE. But, we don't need to make a copy if this
13312 VALUE is one of the enumeration constants for this same
13313 enumeration type. */
13314 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
13315 if (TREE_VALUE (values
) == value
)
13317 /* If we didn't break out of the loop, then we do need a copy. */
13318 if (!values
&& value
)
13319 value
= copy_node (value
);
13321 /* C++ associates enums with global, function, or class declarations. */
13322 context
= current_scope ();
13324 /* Build the actual enumeration constant. Note that the enumeration
13325 constants have the type of their initializers until the
13326 enumeration is complete:
13330 Following the closing brace of an enum-specifier, each enumer-
13331 ator has the type of its enumeration. Prior to the closing
13332 brace, the type of each enumerator is the type of its
13333 initializing value.
13335 In finish_enum we will reset the type. Of course, if we're
13336 processing a template, there may be no value. */
13337 type
= value
? TREE_TYPE (value
) : NULL_TREE
;
13339 if (context
&& context
== current_class_type
)
13340 /* This enum declaration is local to the class. We need the full
13341 lang_decl so that we can record DECL_CLASS_CONTEXT, for example. */
13342 decl
= build_lang_decl (CONST_DECL
, name
, type
);
13344 /* It's a global enum, or it's local to a function. (Note local to
13345 a function could mean local to a class method. */
13346 decl
= build_decl (CONST_DECL
, name
, type
);
13348 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
13349 DECL_INITIAL (decl
) = value
;
13350 TREE_READONLY (decl
) = 1;
13352 if (context
&& context
== current_class_type
)
13353 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
13354 on the TYPE_FIELDS list for `S'. (That's so that you can say
13355 things like `S::i' later.) */
13356 finish_member_declaration (decl
);
13360 GNU_xref_decl (current_function_decl
, decl
);
13363 /* Add this enumeration constant to the list for this type. */
13364 TYPE_VALUES (enumtype
) = tree_cons (name
, decl
, TYPE_VALUES (enumtype
));
13368 static int function_depth
;
13370 /* We're defining DECL. Make sure that it's type is OK. */
13373 check_function_type (decl
)
13376 tree fntype
= TREE_TYPE (decl
);
13377 tree return_type
= complete_type (TREE_TYPE (fntype
));
13379 /* In a function definition, arg types must be complete. */
13380 require_complete_types_for_parms (current_function_parms
);
13382 if (!COMPLETE_OR_VOID_TYPE_P (return_type
))
13384 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
13386 /* Make it return void instead, but don't change the
13387 type of the DECL_RESULT, in case we have a named return value. */
13388 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13390 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
13392 = build_cplus_method_type (ctype
,
13394 FUNCTION_ARG_CHAIN (decl
));
13398 = build_function_type (void_type_node
,
13399 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
13401 = build_exception_variant (fntype
,
13402 TYPE_RAISES_EXCEPTIONS (fntype
));
13405 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
13408 /* Create the FUNCTION_DECL for a function definition.
13409 DECLSPECS and DECLARATOR are the parts of the declaration;
13410 they describe the function's name and the type it returns,
13411 but twisted together in a fashion that parallels the syntax of C.
13413 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
13414 DECLARATOR is really the DECL for the function we are about to
13415 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
13416 indicating that the function is an inline defined in-class, and
13417 SF_EXPAND indicating that we should generate RTL for this
13420 This function creates a binding context for the function body
13421 as well as setting up the FUNCTION_DECL in current_function_decl.
13423 Returns 1 on success. If the DECLARATOR is not suitable for a function
13424 (it defines a datum instead), we return 0, which tells
13425 yyparse to report a parse error.
13427 For C++, we must first check whether that datum makes any sense.
13428 For example, "class A local_a(1,2);" means that variable local_a
13429 is an aggregate of type A, which should have a constructor
13430 applied to it with the argument list [1, 2]. */
13433 start_function (declspecs
, declarator
, attrs
, flags
)
13434 tree declspecs
, declarator
, attrs
;
13438 tree ctype
= NULL_TREE
;
13441 extern int have_extern_spec
;
13442 extern int used_extern_spec
;
13443 int doing_friend
= 0;
13444 struct binding_level
*bl
;
13446 /* Sanity check. */
13447 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
13448 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
13450 /* This should only be done once on the top most decl. */
13451 if (have_extern_spec
&& !used_extern_spec
)
13453 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
13454 used_extern_spec
= 1;
13457 if (flags
& SF_PRE_PARSED
)
13459 decl1
= declarator
;
13461 fntype
= TREE_TYPE (decl1
);
13462 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13463 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13465 /* ISO C++ 11.4/5. A friend function defined in a class is in
13466 the (lexical) scope of the class in which it is defined. */
13467 if (!ctype
&& DECL_FRIEND_P (decl1
))
13469 ctype
= DECL_FRIEND_CONTEXT (decl1
);
13471 /* CTYPE could be null here if we're dealing with a template;
13472 for example, `inline friend float foo()' inside a template
13473 will have no CTYPE set. */
13474 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
13480 last_function_parms
= DECL_ARGUMENTS (decl1
);
13481 last_function_parm_tags
= NULL_TREE
;
13485 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
13486 /* If the declarator is not suitable for a function definition,
13487 cause a syntax error. */
13488 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
13490 fntype
= TREE_TYPE (decl1
);
13492 restype
= TREE_TYPE (fntype
);
13493 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
13495 cp_error ("semicolon missing after declaration of `%#T'", restype
);
13496 shadow_tag (build_tree_list (NULL_TREE
, restype
));
13497 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
13498 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
13499 fntype
= build_function_type (integer_type_node
,
13500 TYPE_ARG_TYPES (fntype
));
13502 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
13504 TYPE_ARG_TYPES (fntype
));
13505 TREE_TYPE (decl1
) = fntype
;
13508 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13509 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13510 else if (DECL_MAIN_P (decl1
))
13512 /* If this doesn't return integer_type, complain. */
13513 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
13515 if (pedantic
|| warn_return_type
)
13516 pedwarn ("return type for `main' changed to `int'");
13517 TREE_TYPE (decl1
) = fntype
= default_function_type
;
13522 /* Sometimes we don't notice that a function is a static member, and
13523 build a METHOD_TYPE for it. Fix that up now. */
13524 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
)
13525 && TREE_CODE (TREE_TYPE (decl1
)) == METHOD_TYPE
)
13527 revert_static_member_fn (decl1
);
13528 last_function_parms
= TREE_CHAIN (last_function_parms
);
13532 /* Warn if function was previously implicitly declared
13533 (but not if we warned then). */
13534 if (! warn_implicit
13535 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
13536 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
13538 /* Set up current_class_type, and enter the scope of the class, if
13541 push_nested_class (ctype
, 1);
13542 else if (DECL_STATIC_FUNCTION_P (decl1
))
13543 push_nested_class (DECL_CONTEXT (decl1
), 2);
13545 /* Now that we have entered the scope of the class, we must restore
13546 the bindings for any template parameters surrounding DECL1, if it
13547 is an inline member template. (Order is important; consider the
13548 case where a template parameter has the same name as a field of
13549 the class.) It is not until after this point that
13550 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
13551 if (flags
& SF_INCLASS_INLINE
)
13552 maybe_begin_member_template_processing (decl1
);
13554 /* Effective C++ rule 15. See also c_expand_return. */
13556 && DECL_OVERLOADED_OPERATOR_P (decl1
) == NOP_EXPR
13557 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
13558 cp_warning ("`operator=' should return a reference to `*this'");
13560 /* Make the init_value nonzero so pushdecl knows this is not tentative.
13561 error_mark_node is replaced below (in poplevel) with the BLOCK. */
13562 if (!DECL_INITIAL (decl1
))
13563 DECL_INITIAL (decl1
) = error_mark_node
;
13565 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
13566 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
13569 /* This function exists in static storage.
13570 (This does not mean `static' in the C sense!) */
13571 TREE_STATIC (decl1
) = 1;
13573 /* We must call push_template_decl after current_class_type is set
13574 up. (If we are processing inline definitions after exiting a
13575 class scope, current_class_type will be NULL_TREE until set above
13576 by push_nested_class.) */
13577 if (processing_template_decl
)
13578 decl1
= push_template_decl (decl1
);
13580 /* We are now in the scope of the function being defined. */
13581 current_function_decl
= decl1
;
13583 /* Save the parm names or decls from this function's declarator
13584 where store_parm_decls will find them. */
13585 current_function_parms
= last_function_parms
;
13586 current_function_parm_tags
= last_function_parm_tags
;
13588 /* Make sure the parameter and return types are reasonable. When
13589 you declare a function, these types can be incomplete, but they
13590 must be complete when you define the function. */
13591 if (! processing_template_decl
)
13592 check_function_type (decl1
);
13594 /* Build the return declaration for the function. */
13595 restype
= TREE_TYPE (fntype
);
13596 if (!processing_template_decl
)
13598 if (!DECL_RESULT (decl1
))
13600 DECL_RESULT (decl1
)
13601 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13602 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype
),
13603 DECL_RESULT (decl1
));
13607 /* Just use `void'. Nobody will ever look at this anyhow. */
13608 DECL_RESULT (decl1
) = build_decl (RESULT_DECL
, 0, void_type_node
);
13610 /* Initialize RTL machinery. We cannot do this until
13611 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
13612 even when processing a template; this is how we get
13613 CFUN set up, and our per-function variables initialized. */
13614 bl
= current_binding_level
;
13615 init_function_start (decl1
, input_filename
, lineno
);
13616 current_binding_level
= bl
;
13617 expanding_p
= (flags
& SF_EXPAND
) != 0;
13619 /* Even though we're inside a function body, we still don't want to
13620 call expand_expr to calculate the size of a variable-sized array.
13621 We haven't necessarily assigned RTL to all variables yet, so it's
13622 not safe to try to expand expressions involving them. */
13623 immediate_size_expand
= 0;
13624 cfun
->x_dont_save_pending_sizes_p
= 1;
13626 /* If we're building a statement-tree, start the tree now. */
13627 if (processing_template_decl
|| !expanding_p
)
13628 begin_stmt_tree (&DECL_SAVED_TREE (decl1
));
13630 /* Let the user know we're compiling this function. */
13631 announce_function (decl1
);
13633 /* Record the decl so that the function name is defined.
13634 If we already have a decl for this name, and it is a FUNCTION_DECL,
13635 use the old decl. */
13636 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
13638 /* A specialization is not used to guide overload resolution. */
13639 if (!DECL_TEMPLATE_SPECIALIZATION (decl1
)
13640 && ! DECL_FUNCTION_MEMBER_P (decl1
))
13641 decl1
= pushdecl (decl1
);
13644 /* We need to set the DECL_CONTEXT. */
13645 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
13646 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
13647 /* And make sure we have enough default args. */
13648 check_default_args (decl1
);
13650 fntype
= TREE_TYPE (decl1
);
13653 /* Reset these in case the call to pushdecl changed them. */
13654 current_function_decl
= decl1
;
13655 cfun
->decl
= decl1
;
13657 /* Initialize the per-function data. */
13658 if (!DECL_PENDING_INLINE_P (decl1
) && DECL_SAVED_FUNCTION_DATA (decl1
))
13660 /* If we already parsed this function, and we're just expanding it
13661 now, restore saved state. */
13662 struct binding_level
*bl
= current_binding_level
;
13663 *cp_function_chain
= *DECL_SAVED_FUNCTION_DATA (decl1
);
13664 current_binding_level
= bl
;
13666 /* This function is being processed in whole-function mode; we
13667 already did semantic analysis. */
13668 cfun
->x_whole_function_mode_p
= 1;
13670 /* If we decided that we didn't want to inline this function,
13671 make sure the back-end knows that. */
13672 if (!current_function_cannot_inline
)
13673 current_function_cannot_inline
= cp_function_chain
->cannot_inline
;
13675 /* We don't need the saved data anymore. */
13676 free (DECL_SAVED_FUNCTION_DATA (decl1
));
13677 DECL_SAVED_FUNCTION_DATA (decl1
) = NULL
;
13679 else if (ctype
&& !doing_friend
&& !DECL_STATIC_FUNCTION_P (decl1
))
13681 /* We know that this was set up by `grokclassfn'. We do not
13682 wait until `store_parm_decls', since evil parse errors may
13683 never get us to that point. Here we keep the consistency
13684 between `current_class_type' and `current_class_ptr'. */
13685 tree t
= DECL_ARGUMENTS (decl1
);
13687 my_friendly_assert (t
!= NULL_TREE
&& TREE_CODE (t
) == PARM_DECL
,
13689 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
13692 cp_function_chain
->x_current_class_ref
13693 = build_indirect_ref (t
, NULL_PTR
);
13694 cp_function_chain
->x_current_class_ptr
= t
;
13696 /* Constructors and destructors need to know whether they're "in
13697 charge" of initializing virtual base classes. */
13698 if (DECL_HAS_IN_CHARGE_PARM_P (decl1
))
13699 current_in_charge_parm
= TREE_CHAIN (t
);
13702 if (DECL_INTERFACE_KNOWN (decl1
))
13704 tree ctx
= decl_function_context (decl1
);
13706 if (DECL_NOT_REALLY_EXTERN (decl1
))
13707 DECL_EXTERNAL (decl1
) = 0;
13709 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
13710 && TREE_PUBLIC (ctx
))
13711 /* This is a function in a local class in an extern inline
13713 comdat_linkage (decl1
);
13715 /* If this function belongs to an interface, it is public.
13716 If it belongs to someone else's interface, it is also external.
13717 This only affects inlines and template instantiations. */
13718 else if (interface_unknown
== 0
13719 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13720 || flag_alt_external_templates
))
13722 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
13723 || processing_template_decl
)
13725 DECL_EXTERNAL (decl1
)
13727 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
13728 && !DECL_VINDEX (decl1
)));
13730 /* For WIN32 we also want to put these in linkonce sections. */
13731 maybe_make_one_only (decl1
);
13734 DECL_EXTERNAL (decl1
) = 0;
13735 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
13736 DECL_INTERFACE_KNOWN (decl1
) = 1;
13738 else if (interface_unknown
&& interface_only
13739 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13740 || flag_alt_external_templates
))
13742 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13743 interface, we will have interface_only set but not
13744 interface_known. In that case, we don't want to use the normal
13745 heuristics because someone will supply a #pragma implementation
13746 elsewhere, and deducing it here would produce a conflict. */
13747 comdat_linkage (decl1
);
13748 DECL_EXTERNAL (decl1
) = 0;
13749 DECL_INTERFACE_KNOWN (decl1
) = 1;
13750 DECL_DEFER_OUTPUT (decl1
) = 1;
13754 /* This is a definition, not a reference.
13755 So clear DECL_EXTERNAL. */
13756 DECL_EXTERNAL (decl1
) = 0;
13758 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
13759 && ! DECL_INTERFACE_KNOWN (decl1
)
13760 /* Don't try to defer nested functions for now. */
13761 && ! decl_function_context (decl1
))
13762 DECL_DEFER_OUTPUT (decl1
) = 1;
13764 DECL_INTERFACE_KNOWN (decl1
) = 1;
13767 if (doing_semantic_analysis_p ())
13770 current_binding_level
->parm_flag
= 1;
13774 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13776 if (!building_stmt_tree ())
13778 GNU_xref_function (decl1
, current_function_parms
);
13779 make_function_rtl (decl1
);
13782 /* Promote the value to int before returning it. */
13783 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13784 restype
= type_promotes_to (restype
);
13786 /* If this fcn was already referenced via a block-scope `extern' decl
13787 (or an implicit decl), propagate certain information about the usage. */
13788 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13789 TREE_ADDRESSABLE (decl1
) = 1;
13791 if (DECL_RESULT (decl1
) == NULL_TREE
)
13793 DECL_RESULT (decl1
)
13794 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13795 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13796 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13801 if (DECL_DESTRUCTOR_P (decl1
))
13803 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13804 DECL_CONTEXT (dtor_label
) = current_function_decl
;
13806 /* Under the old ABI we return `this' from constructors, so we make
13807 ordinary `return' statements in constructors jump to CTOR_LABEL;
13808 from there we return `this'. Under the new ABI, we don't bother
13809 with any of this. By not setting CTOR_LABEL the remainder of the
13810 machinery is automatically disabled. */
13811 else if (!flag_new_abi
&& DECL_CONSTRUCTOR_P (decl1
))
13813 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13814 DECL_CONTEXT (ctor_label
) = current_function_decl
;
13820 /* Called after store_parm_decls for a function-try-block. */
13823 expand_start_early_try_stmts ()
13825 expand_start_try_stmts ();
13828 /* Store the parameter declarations into the current function declaration.
13829 This is called after parsing the parameter declarations, before
13830 digesting the body of the function.
13832 Also install to binding contour return value identifier, if any. */
13835 store_parm_decls ()
13837 register tree fndecl
= current_function_decl
;
13838 register tree parm
;
13839 int parms_have_cleanups
= 0;
13840 tree cleanups
= NULL_TREE
;
13842 /* This is a list of types declared among parms in a prototype. */
13843 tree parmtags
= current_function_parm_tags
;
13845 /* This is a chain of any other decls that came in among the parm
13846 declarations. If a parm is declared with enum {foo, bar} x;
13847 then CONST_DECLs for foo and bar are put here. */
13848 tree nonparms
= NULL_TREE
;
13850 /* Create a binding level for the parms. */
13851 if (!building_stmt_tree ())
13852 expand_start_bindings (2);
13854 if (current_function_parms
)
13856 /* This case is when the function was defined with an ANSI prototype.
13857 The parms already have decls, so we need not do anything here
13858 except record them as in effect
13859 and complain if any redundant old-style parm decls were written. */
13861 tree specparms
= current_function_parms
;
13864 if (doing_semantic_analysis_p ())
13866 /* Must clear this because it might contain TYPE_DECLs declared
13868 storedecls (NULL_TREE
);
13870 /* If we're doing semantic analysis, then we'll call pushdecl
13871 for each of these. We must do them in reverse order so that
13872 they end in the correct forward order. */
13873 specparms
= nreverse (specparms
);
13876 for (parm
= specparms
; parm
; parm
= next
)
13878 next
= TREE_CHAIN (parm
);
13879 if (TREE_CODE (parm
) == PARM_DECL
)
13881 tree type
= TREE_TYPE (parm
);
13883 if (doing_semantic_analysis_p ())
13887 if (DECL_NAME (parm
) == NULL_TREE
13888 || TREE_CODE (parm
) != VOID_TYPE
)
13891 cp_error ("parameter `%D' declared void", parm
);
13893 cleanup
= (processing_template_decl
13895 : maybe_build_cleanup (parm
));
13898 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13900 else if (type
!= error_mark_node
13901 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
13902 parms_have_cleanups
= 1;
13906 /* If we find an enum constant or a type tag,
13907 put it aside for the moment. */
13908 TREE_CHAIN (parm
) = NULL_TREE
;
13909 nonparms
= chainon (nonparms
, parm
);
13913 if (doing_semantic_analysis_p ())
13915 /* Get the decls in their original chain order
13916 and record in the function. This is all and only the
13917 PARM_DECLs that were pushed into scope by the loop above. */
13918 DECL_ARGUMENTS (fndecl
) = getdecls ();
13919 storetags (chainon (parmtags
, gettags ()));
13923 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13925 /* Now store the final chain of decls for the arguments
13926 as the decl-chain of the current lexical scope.
13927 Put the enumerators in as well, at the front so that
13928 DECL_ARGUMENTS is not modified. */
13929 if (doing_semantic_analysis_p ())
13930 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13932 /* Initialize the RTL code for the function. */
13933 DECL_SAVED_INSNS (fndecl
) = 0;
13934 if (! building_stmt_tree ())
13935 expand_function_start (fndecl
, parms_have_cleanups
);
13937 current_function_parms_stored
= 1;
13939 /* If this function is `main', emit a call to `__main'
13940 to run global initializers, etc. */
13941 if (DECL_MAIN_P (fndecl
) && !building_stmt_tree ())
13942 expand_main_function ();
13944 /* Now that we have initialized the parms, we can start their
13945 cleanups. We cannot do this before, since expand_decl_cleanup
13946 should not be called before the parm can be used. */
13949 finish_decl_cleanup (TREE_PURPOSE (cleanups
),
13950 TREE_VALUE (cleanups
));
13951 cleanups
= TREE_CHAIN (cleanups
);
13954 /* Create a binding contour which can be used to catch
13955 cleanup-generated temporaries. Also, if the return value needs or
13956 has initialization, deal with that now. */
13957 if (parms_have_cleanups
)
13960 if (!building_stmt_tree ())
13961 expand_start_bindings (2);
13964 /* Do the starting of the exception specifications, if we have any. */
13965 if (flag_exceptions
&& !processing_template_decl
13966 && flag_enforce_eh_specs
13967 && building_stmt_tree ()
13968 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13969 current_eh_spec_try_block
= expand_start_eh_spec ();
13972 /* Bind a name and initialization to the return value of
13973 the current function. */
13976 store_return_init (decl
)
13979 /* If this named return value comes in a register, put it in a
13980 pseudo-register. */
13981 if (DECL_REGISTER (decl
))
13983 original_result_rtx
= DECL_RTL (decl
);
13984 /* Note that the mode of the old DECL_RTL may be wider than the
13985 mode of DECL_RESULT, depending on the calling conventions for
13986 the processor. For example, on the Alpha, a 32-bit integer
13987 is returned in a DImode register -- the DECL_RESULT has
13988 SImode but the DECL_RTL for the DECL_RESULT has DImode. So,
13989 here, we use the mode the back-end has already assigned for
13990 the return value. */
13991 DECL_RTL (decl
) = gen_reg_rtx (GET_MODE (original_result_rtx
));
13992 if (TREE_ADDRESSABLE (decl
))
13993 put_var_into_stack (decl
);
13998 /* We have finished doing semantic analysis on DECL, but have not yet
13999 generated RTL for its body. Save away our current state, so that
14000 when we want to generate RTL later we know what to do. */
14003 save_function_data (decl
)
14006 struct language_function
*f
;
14008 /* Save the language-specific per-function data so that we can
14009 get it back when we really expand this function. */
14010 my_friendly_assert (!DECL_PENDING_INLINE_P (decl
),
14014 f
= ((struct language_function
*)
14015 xmalloc (sizeof (struct language_function
)));
14016 bcopy ((char *) cp_function_chain
, (char *) f
,
14017 sizeof (struct language_function
));
14018 DECL_SAVED_FUNCTION_DATA (decl
) = f
;
14020 /* Clear out the bits we don't need. */
14021 f
->x_stmt_tree
.x_last_stmt
= NULL_TREE
;
14022 f
->x_stmt_tree
.x_last_expr_type
= NULL_TREE
;
14023 f
->x_result_rtx
= NULL_RTX
;
14024 f
->x_named_label_uses
= NULL
;
14025 f
->bindings
= NULL
;
14027 /* When we get back here again, we will be expanding. */
14028 f
->x_expanding_p
= 1;
14030 /* If we've already decided that we cannot inline this function, we
14031 must remember that fact when we actually go to expand the
14033 f
->cannot_inline
= current_function_cannot_inline
;
14036 /* At the end of every constructor we generate to code to return
14037 `this'. Do that now. */
14040 finish_constructor_body ()
14042 /* Any return from a constructor will end up here. */
14044 add_tree (build_stmt (LABEL_STMT
, ctor_label
));
14046 /* Clear CTOR_LABEL so that finish_return_stmt knows to really
14047 generate the return, rather than a goto to CTOR_LABEL. */
14048 ctor_label
= NULL_TREE
;
14049 /* In check_return_expr we translate an empty return from a
14050 constructor to a return of `this'. */
14051 finish_return_stmt (NULL_TREE
);
14052 /* Mark the end of the constructor. */
14053 add_tree (build_stmt (CTOR_STMT
));
14056 /* At the end of every destructor we generate code to restore virtual
14057 function tables to the values desired by base classes and to call
14058 to base class destructors. Do that now. */
14061 finish_destructor_body ()
14063 tree compound_stmt
;
14068 /* Create a block to contain all the extra code. */
14069 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
14071 /* Any return from a destructor will end up here. */
14072 add_tree (build_stmt (LABEL_STMT
, dtor_label
));
14074 /* Generate the code to call destructor on base class. If this
14075 destructor belongs to a class with virtual functions, then set
14076 the virtual function table pointer to represent the type of our
14079 /* This side-effect makes call to `build_delete' generate the code
14080 we have to have at the end of this destructor. `build_delete'
14081 will set the flag again. */
14082 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
14084 exprstmt
= build_delete (current_class_type
,
14086 sfk_base_destructor
,
14087 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
,
14090 if (exprstmt
!= error_mark_node
14091 && (TREE_CODE (exprstmt
) != NOP_EXPR
14092 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
14093 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
14095 if (exprstmt
!= void_zero_node
)
14096 /* Don't call `expand_expr_stmt' if we're not going to do
14097 anything, since -Wall will give a diagnostic. */
14098 finish_expr_stmt (exprstmt
);
14100 /* Run destructors for all virtual baseclasses. */
14101 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
14106 if_stmt
= begin_if_stmt ();
14107 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
14108 current_in_charge_parm
,
14112 vbases
= CLASSTYPE_VBASECLASSES (current_class_type
);
14113 /* The CLASSTYPE_VBASECLASSES list is in initialization
14114 order, so we have to march through it in reverse order. */
14115 for (vbases
= nreverse (copy_list (vbases
));
14117 vbases
= TREE_CHAIN (vbases
))
14119 tree vbase
= TREE_VALUE (vbases
);
14121 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (vbase
)))
14123 tree vb
= get_vbase
14124 (BINFO_TYPE (vbase
),
14125 TYPE_BINFO (current_class_type
));
14127 (build_scoped_method_call
14128 (current_class_ref
, vb
, base_dtor_identifier
,
14133 finish_then_clause (if_stmt
);
14138 virtual_size
= c_sizeof (current_class_type
);
14140 /* At the end, call delete if that's what's requested. */
14142 /* FDIS sez: At the point of definition of a virtual destructor
14143 (including an implicit definition), non-placement operator delete
14144 shall be looked up in the scope of the destructor's class and if
14145 found shall be accessible and unambiguous.
14147 This is somewhat unclear, but I take it to mean that if the class
14148 only defines placement deletes we don't do anything here. So we
14149 pass LOOKUP_SPECULATIVELY; delete_sanity will complain for us if
14150 they ever try to delete one of these. */
14151 exprstmt
= build_op_delete_call
14152 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
14153 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
14155 if_stmt
= begin_if_stmt ();
14156 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
14157 current_in_charge_parm
,
14160 finish_expr_stmt (exprstmt
);
14161 finish_then_clause (if_stmt
);
14164 /* Close the block we started above. */
14165 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
14168 /* Finish up a function declaration and compile that function
14169 all the way to assembler language output. The free the storage
14170 for the function definition.
14172 FLAGS is a bitwise or of the following values:
14174 An extra call to poplevel (and expand_end_bindings) must be
14175 made to take care of the binding contour for the base
14176 initializers. This is only relevant for constructors.
14178 We just finished processing the body of an in-class inline
14179 function definition. (This processing will have taken place
14180 after the class definition is complete.) */
14183 finish_function (flags
)
14186 register tree fndecl
= current_function_decl
;
14187 tree fntype
, ctype
= NULL_TREE
;
14188 /* Label to use if this function is supposed to return a value. */
14189 tree no_return_label
= NULL_TREE
;
14190 int call_poplevel
= (flags
& 1) != 0;
14191 int inclass_inline
= (flags
& 2) != 0;
14194 int current_line
= lineno
;
14196 /* When we get some parse errors, we can end up without a
14197 current_function_decl, so cope. */
14198 if (fndecl
== NULL_TREE
)
14199 return error_mark_node
;
14201 nested
= function_depth
> 1;
14202 fntype
= TREE_TYPE (fndecl
);
14204 /* TREE_READONLY (fndecl) = 1;
14205 This caused &foo to be of type ptr-to-const-function
14206 which then got a warning when stored in a ptr-to-function variable. */
14208 /* This happens on strange parse errors. */
14209 if (! current_function_parms_stored
)
14212 store_parm_decls ();
14215 /* For a cloned function, we've already got all the code we need;
14216 there's no need to add any extra bits. */
14217 if (building_stmt_tree () && DECL_CLONED_FUNCTION_P (fndecl
))
14219 else if (building_stmt_tree ())
14221 if (DECL_CONSTRUCTOR_P (fndecl
))
14223 finish_constructor_body ();
14227 else if (DECL_DESTRUCTOR_P (fndecl
) && !processing_template_decl
)
14228 finish_destructor_body ();
14229 else if (DECL_MAIN_P (fndecl
))
14231 /* Make it so that `main' always returns 0 by default. */
14233 finish_return_stmt (integer_one_node
);
14235 finish_return_stmt (integer_zero_node
);
14239 /* Finish dealing with exception specifiers. */
14240 if (flag_exceptions
&& !processing_template_decl
14241 && flag_enforce_eh_specs
14242 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
14243 expand_end_eh_spec (TYPE_RAISES_EXCEPTIONS
14244 (TREE_TYPE (current_function_decl
)),
14245 current_eh_spec_try_block
);
14250 if (write_symbols
!= NO_DEBUG
/*&& TREE_CODE (fntype) != METHOD_TYPE*/)
14252 /* Keep this code around in case we later want to control debug info
14253 based on whether a type is "used". (jason 1999-11-11) */
14255 tree ttype
= target_type (fntype
);
14258 if (IS_AGGR_TYPE (ttype
))
14259 /* Let debugger know it should output info for this type. */
14260 note_debug_info_needed (ttype
);
14262 for (parmdecl
= DECL_ARGUMENTS (fndecl
); parmdecl
; parmdecl
= TREE_CHAIN (parmdecl
))
14264 ttype
= target_type (TREE_TYPE (parmdecl
));
14265 if (IS_AGGR_TYPE (ttype
))
14266 /* Let debugger know it should output info for this type. */
14267 note_debug_info_needed (ttype
);
14272 /* Clean house because we will need to reorder insns here. */
14273 do_pending_stack_adjust ();
14277 else if (DECL_CONSTRUCTOR_P (fndecl
))
14282 else if (return_label
!= NULL_RTX
14283 && flag_this_is_variable
<= 0
14284 && current_function_return_value
== NULL_TREE
14285 && ! DECL_NAME (DECL_RESULT (current_function_decl
)))
14286 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
14288 if (flag_exceptions
)
14289 expand_exception_blocks ();
14291 /* If this function is supposed to return a value, ensure that
14292 we do not fall into the cleanups by mistake. The end of our
14293 function will look like this:
14295 user code (may have return stmt somewhere)
14296 goto no_return_label
14301 NOTE_INSN_FUNCTION_END
14305 If the user omits a return stmt in the USER CODE section, we
14306 will have a control path which reaches NOTE_INSN_FUNCTION_END.
14307 Otherwise, we won't. */
14308 if (no_return_label
)
14310 DECL_CONTEXT (no_return_label
) = fndecl
;
14311 DECL_INITIAL (no_return_label
) = error_mark_node
;
14312 DECL_SOURCE_FILE (no_return_label
) = input_filename
;
14313 DECL_SOURCE_LINE (no_return_label
) = current_line
;
14314 expand_goto (no_return_label
);
14319 /* Remove the binding contour which is used
14320 to catch cleanup-generated temporaries. */
14321 expand_end_bindings (0, 0, 0);
14322 poplevel (0, 0, 0);
14324 /* Emit label at beginning of cleanup code for parameters. */
14325 emit_label (cleanup_label
);
14328 /* Get return value into register if that's where it's supposed
14330 if (original_result_rtx
)
14331 fixup_result_decl (DECL_RESULT (fndecl
), original_result_rtx
);
14333 /* Finish building code that will trigger warnings if users forget
14334 to make their functions return values. */
14335 if (no_return_label
|| cleanup_label
)
14336 emit_jump (return_label
);
14337 if (no_return_label
)
14339 /* We don't need to call `expand_*_return' here because we
14340 don't need any cleanups here--this path of code is only
14341 for error checking purposes. */
14342 expand_label (no_return_label
);
14345 /* We hard-wired immediate_size_expand to zero in
14346 start_function. Expand_function_end will decrement this
14347 variable. So, we set the variable to one here, so that after
14348 the decrement it will remain zero. */
14349 immediate_size_expand
= 1;
14351 /* Generate rtl for function exit. */
14352 expand_function_end (input_filename
, current_line
, 1);
14355 /* We have to save this value here in case
14356 maybe_end_member_template_processing decides to pop all the
14357 template parameters. */
14358 expand_p
= !building_stmt_tree ();
14360 /* If we're saving up tree structure, tie off the function now. */
14362 finish_stmt_tree (&DECL_SAVED_TREE (fndecl
));
14364 /* This must come after expand_function_end because cleanups might
14365 have declarations (from inline functions) that need to go into
14366 this function's blocks. */
14367 if (doing_semantic_analysis_p ())
14369 if (current_binding_level
->parm_flag
!= 1)
14370 my_friendly_abort (122);
14371 poplevel (1, 0, 1);
14374 /* Remember that we were in class scope. */
14375 if (current_class_name
)
14376 ctype
= current_class_type
;
14378 /* Must mark the RESULT_DECL as being in this function. */
14379 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
14381 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
14382 to the FUNCTION_DECL node itself. */
14383 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
14385 /* Save away current state, if appropriate. */
14386 if (!expanding_p
&& !processing_template_decl
)
14387 save_function_data (fndecl
);
14389 /* If this function calls `setjmp' it cannot be inlined. When
14390 `longjmp' is called it is not guaranteed to restore the value of
14391 local variables that have been modified since the call to
14392 `setjmp'. So, if were to inline this function into some caller
14393 `c', then when we `longjmp', we might not restore all variables
14394 in `c'. (It might seem, at first blush, that there's no way for
14395 this function to modify local variables in `c', but their
14396 addresses may have been stored somewhere accessible to this
14398 if (!expanding_p
&& !processing_template_decl
&& calls_setjmp_p (fndecl
))
14399 DECL_UNINLINABLE (fndecl
) = 1;
14406 /* So we can tell if jump_optimize sets it to 1. */
14409 /* Before we call rest_of_compilation (which will pop the
14410 CURRENT_FUNCTION), we must save these values. */
14411 returns_null
= current_function_returns_null
;
14412 returns_value
= current_function_returns_value
;
14414 /* If this is a nested function (like a template instantiation
14415 that we're compiling in the midst of compiling something
14416 else), push a new GC context. That will keep local variables
14417 on the stack from being collected while we're doing the
14418 compilation of this function. */
14419 if (function_depth
> 1)
14420 ggc_push_context ();
14422 /* Run the optimizers and output the assembler code for this
14424 rest_of_compilation (fndecl
);
14426 /* Undo the call to ggc_push_context above. */
14427 if (function_depth
> 1)
14428 ggc_pop_context ();
14430 if (DECL_SAVED_INSNS (fndecl
) && ! TREE_ASM_WRITTEN (fndecl
))
14432 /* Set DECL_EXTERNAL so that assemble_external will be called as
14433 necessary. We'll clear it again in finish_file. */
14434 if (! DECL_EXTERNAL (fndecl
))
14435 DECL_NOT_REALLY_EXTERN (fndecl
) = 1;
14436 DECL_EXTERNAL (fndecl
) = 1;
14441 /* Keep this code around in case we later want to control debug info
14442 based on whether a type is "used". (jason 1999-11-11) */
14444 if (ctype
&& TREE_ASM_WRITTEN (fndecl
))
14445 note_debug_info_needed (ctype
);
14448 if (DECL_NAME (DECL_RESULT (fndecl
)))
14449 returns_value
|= can_reach_end
;
14451 returns_null
|= can_reach_end
;
14453 if (TREE_THIS_VOLATILE (fndecl
) && returns_null
)
14454 warning ("`noreturn' function does return");
14455 else if (returns_null
14456 && TREE_CODE (TREE_TYPE (fntype
)) != VOID_TYPE
)
14458 /* Always complain if there's just no return statement. */
14459 if (!returns_value
)
14460 warning ("no return statement in function returning non-void");
14461 else if (warn_return_type
|| pedantic
)
14462 /* If this function returns non-void and control can drop through,
14464 warning ("control reaches end of non-void function");
14469 /* Clear out memory we no longer need. */
14470 free_after_parsing (cfun
);
14471 /* Since we never call rest_of_compilation, we never clear
14472 CFUN. Do so explicitly. */
14473 free_after_compilation (cfun
);
14477 /* If this is a in-class inline definition, we may have to pop the
14478 bindings for the template parameters that we added in
14479 maybe_begin_member_template_processing when start_function was
14481 if (inclass_inline
)
14482 maybe_end_member_template_processing ();
14484 /* Leave the scope of the class. */
14486 pop_nested_class ();
14490 if (!DECL_SAVED_INSNS (fndecl
) && !DECL_SAVED_FUNCTION_DATA (fndecl
)
14491 && !(flag_inline_trees
&& DECL_INLINE (fndecl
)))
14495 /* Stop pointing to the local nodes about to be freed. */
14496 /* But DECL_INITIAL must remain nonzero so we know this
14497 was an actual function definition. */
14498 DECL_INITIAL (fndecl
) = error_mark_node
;
14499 for (t
= DECL_ARGUMENTS (fndecl
); t
; t
= TREE_CHAIN (t
))
14500 DECL_RTL (t
) = DECL_INCOMING_RTL (t
) = NULL_RTX
;
14503 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
14504 static_ctors
= tree_cons (NULL_TREE
, fndecl
, static_ctors
);
14505 if (DECL_STATIC_DESTRUCTOR (fndecl
))
14506 static_dtors
= tree_cons (NULL_TREE
, fndecl
, static_dtors
);
14511 /* Let the error reporting routines know that we're outside a
14512 function. For a nested function, this value is used in
14513 pop_cp_function_context and then reset via pop_function_context. */
14514 current_function_decl
= NULL_TREE
;
14515 /* We don't really care about obstacks, but the middle-end
14516 sometimes cares on what obstck things are located. */
14517 permanent_allocation (1);
14523 /* Create the FUNCTION_DECL for a function definition.
14524 DECLSPECS and DECLARATOR are the parts of the declaration;
14525 they describe the return type and the name of the function,
14526 but twisted together in a fashion that parallels the syntax of C.
14528 This function creates a binding context for the function body
14529 as well as setting up the FUNCTION_DECL in current_function_decl.
14531 Returns a FUNCTION_DECL on success.
14533 If the DECLARATOR is not suitable for a function (it defines a datum
14534 instead), we return 0, which tells yyparse to report a parse error.
14536 May return void_type_node indicating that this method is actually
14537 a friend. See grokfield for more details.
14539 Came here with a `.pushlevel' .
14541 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14542 CHANGES TO CODE IN `grokfield'. */
14545 start_method (declspecs
, declarator
, attrlist
)
14546 tree declarator
, declspecs
, attrlist
;
14548 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
14551 /* Something too ugly to handle. */
14552 if (fndecl
== NULL_TREE
)
14555 /* Pass friends other than inline friend functions back. */
14556 if (fndecl
== void_type_node
)
14559 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
14560 /* Not a function, tell parser to report parse error. */
14563 if (DECL_IN_AGGR_P (fndecl
))
14565 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
14567 if (DECL_CONTEXT (fndecl
)
14568 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
14569 cp_error ("`%D' is already defined in class %s", fndecl
,
14570 TYPE_NAME_STRING (DECL_CONTEXT (fndecl
)));
14572 return void_type_node
;
14575 check_template_shadow (fndecl
);
14577 DECL_THIS_INLINE (fndecl
) = 1;
14579 if (flag_default_inline
)
14580 DECL_INLINE (fndecl
) = 1;
14582 /* We process method specializations in finish_struct_1. */
14583 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
14584 fndecl
= push_template_decl (fndecl
);
14586 if (! DECL_FRIEND_P (fndecl
))
14588 if (TREE_CHAIN (fndecl
))
14590 fndecl
= copy_node (fndecl
);
14591 TREE_CHAIN (fndecl
) = NULL_TREE
;
14594 if (DECL_CONSTRUCTOR_P (fndecl
))
14596 if (! grok_ctor_properties (current_class_type
, fndecl
))
14597 return void_type_node
;
14599 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
14600 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
14603 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0);
14605 /* Make a place for the parms */
14607 current_binding_level
->parm_flag
= 1;
14609 DECL_IN_AGGR_P (fndecl
) = 1;
14613 /* Go through the motions of finishing a function definition.
14614 We don't compile this method until after the whole class has
14617 FINISH_METHOD must return something that looks as though it
14618 came from GROKFIELD (since we are defining a method, after all).
14620 This is called after parsing the body of the function definition.
14621 STMTS is the chain of statements that makes up the function body.
14623 DECL is the ..._DECL that `start_method' provided. */
14626 finish_method (decl
)
14629 register tree fndecl
= decl
;
14632 register tree link
;
14634 if (decl
== void_type_node
)
14637 old_initial
= DECL_INITIAL (fndecl
);
14639 /* Undo the level for the parms (from start_method).
14640 This is like poplevel, but it causes nothing to be
14641 saved. Saving information here confuses symbol-table
14642 output routines. Besides, this information will
14643 be correctly output when this method is actually
14646 /* Clear out the meanings of the local variables of this level;
14647 also record in each decl which block it belongs to. */
14649 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
14651 if (DECL_NAME (link
) != NULL_TREE
)
14652 pop_binding (DECL_NAME (link
), link
);
14653 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
14654 DECL_CONTEXT (link
) = NULL_TREE
;
14657 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
14658 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
14659 current_binding_level
->parm_flag
,
14660 current_binding_level
->keep
);
14662 poplevel (0, 0, 0);
14664 DECL_INITIAL (fndecl
) = old_initial
;
14666 /* We used to check if the context of FNDECL was different from
14667 current_class_type as another way to get inside here. This didn't work
14668 for String.cc in libg++. */
14669 if (DECL_FRIEND_P (fndecl
))
14671 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
14672 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
14673 decl
= void_type_node
;
14679 /* Called when a new struct TYPE is defined.
14680 If this structure or union completes the type of any previous
14681 variable declaration, lay it out and output its rtl. */
14684 hack_incomplete_structures (type
)
14688 struct binding_level
*level
;
14690 if (!type
) /* Don't do this for class templates. */
14693 if (namespace_bindings_p ())
14696 list
= &namespace_scope_incomplete
;
14700 level
= innermost_nonclass_level ();
14701 list
= &level
->incomplete
;
14708 tree decl
= TREE_VALUE (*list
);
14709 if ((decl
&& TREE_TYPE (decl
) == type
)
14710 || (TREE_TYPE (decl
)
14711 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14712 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
14714 int toplevel
= toplevel_bindings_p ();
14715 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14716 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
14717 layout_type (TREE_TYPE (decl
));
14718 layout_decl (decl
, 0);
14719 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
14723 expand_decl (decl
);
14724 cleanup
= maybe_build_cleanup (decl
);
14725 expand_decl_init (decl
);
14726 if (! expand_decl_cleanup (decl
, cleanup
))
14727 cp_error ("parser lost in parsing declaration of `%D'",
14730 *list
= TREE_CHAIN (*list
);
14733 list
= &TREE_CHAIN (*list
);
14736 /* Keep looking through artificial binding levels generated
14737 for local variables. */
14738 if (level
&& level
->keep
== 2)
14740 level
= level
->level_chain
;
14741 list
= &level
->incomplete
;
14748 /* If DECL is of a type which needs a cleanup, build that cleanup
14752 maybe_build_cleanup (decl
)
14755 tree type
= TREE_TYPE (decl
);
14757 if (type
!= error_mark_node
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
14759 int flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14762 if (TREE_CODE (type
) == ARRAY_TYPE
)
14766 mark_addressable (decl
);
14767 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14770 /* Optimize for space over speed here. */
14771 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14772 || flag_expensive_optimizations
)
14773 flags
|= LOOKUP_NONVIRTUAL
;
14775 rval
= build_delete (TREE_TYPE (rval
), rval
,
14776 sfk_complete_destructor
, flags
, 0);
14778 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14779 && ! TYPE_HAS_DESTRUCTOR (type
))
14780 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14781 build_tree_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14788 /* Expand a C++ expression at the statement level.
14789 This is needed to ferret out nodes which have UNKNOWN_TYPE.
14790 The C++ type checker should get all of these out when
14791 expressions are combined with other, type-providing, expressions,
14792 leaving only orphan expressions, such as:
14794 &class::bar; / / takes its address, but does nothing with it. */
14797 cplus_expand_expr_stmt (exp
)
14801 /* We should do this eventually, but right now this causes regex.o from
14802 libg++ to miscompile, and tString to core dump. */
14803 exp
= build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (exp
), exp
);
14806 /* If we don't do this, we end up down inside expand_expr
14807 trying to do TYPE_MODE on the ERROR_MARK, and really
14808 go outside the bounds of the type. */
14809 if (exp
!= error_mark_node
)
14810 expand_expr_stmt (exp
);
14813 /* When a stmt has been parsed, this function is called. */
14818 /* Always assume this statement was not an expression statement. If
14819 it actually was an expression statement, its our callers
14820 responsibility to fix this up. */
14821 last_expr_type
= NULL_TREE
;
14824 /* DECL was originally constructed as a non-static member function,
14825 but turned out to be static. Update it accordingly. */
14828 revert_static_member_fn (decl
)
14832 tree function
= TREE_TYPE (decl
);
14833 tree args
= TYPE_ARG_TYPES (function
);
14835 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14836 != TYPE_UNQUALIFIED
)
14837 cp_error ("static member function `%#D' declared with type qualifiers",
14840 args
= TREE_CHAIN (args
);
14841 tmp
= build_function_type (TREE_TYPE (function
), args
);
14842 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14843 tmp
= build_exception_variant (tmp
,
14844 TYPE_RAISES_EXCEPTIONS (function
));
14845 TREE_TYPE (decl
) = tmp
;
14846 if (DECL_ARGUMENTS (decl
))
14847 DECL_ARGUMENTS (decl
) = TREE_CHAIN (DECL_ARGUMENTS (decl
));
14848 DECL_STATIC_FUNCTION_P (decl
) = 1;
14851 /* Initialize the variables used during compilation of a C++
14855 push_cp_function_context (f
)
14856 struct function
*f
;
14858 struct language_function
*p
14859 = ((struct language_function
*)
14860 xcalloc (1, sizeof (struct language_function
)));
14863 /* It takes an explicit call to expand_body to generate RTL for a
14867 /* Whenever we start a new function, we destroy temporaries in the
14869 current_stmt_tree
->stmts_are_full_exprs_p
= 1;
14872 /* Free the language-specific parts of F, now that we've finished
14873 compiling the function. */
14876 pop_cp_function_context (f
)
14877 struct function
*f
;
14880 free (f
->language
);
14884 /* Mark P for GC. */
14887 mark_lang_function (p
)
14888 struct language_function
*p
;
14893 ggc_mark_tree (p
->x_ctor_label
);
14894 ggc_mark_tree (p
->x_dtor_label
);
14895 ggc_mark_tree (p
->x_current_class_ptr
);
14896 ggc_mark_tree (p
->x_current_class_ref
);
14897 ggc_mark_tree (p
->x_eh_spec_try_block
);
14898 ggc_mark_tree (p
->x_scope_stmt_stack
);
14900 ggc_mark_rtx (p
->x_result_rtx
);
14902 mark_named_label_lists (&p
->x_named_labels
, &p
->x_named_label_uses
);
14903 mark_stmt_tree (&p
->x_stmt_tree
);
14904 mark_binding_level (&p
->bindings
);
14907 /* Mark the language-specific data in F for GC. */
14910 mark_cp_function_context (f
)
14911 struct function
*f
;
14913 mark_lang_function (f
->language
);
14917 lang_mark_false_label_stack (l
)
14918 struct label_node
*l
;
14920 /* C++ doesn't use false_label_stack. It better be NULL. */
14921 my_friendly_assert (l
== NULL
, 19990904);
14928 enum tree_code code
= TREE_CODE (t
);
14929 if (code
== IDENTIFIER_NODE
)
14931 struct lang_identifier
*li
= (struct lang_identifier
*) t
;
14932 struct lang_id2
*li2
= li
->x
;
14933 ggc_mark_tree (li
->namespace_bindings
);
14934 ggc_mark_tree (li
->bindings
);
14935 ggc_mark_tree (li
->class_value
);
14936 ggc_mark_tree (li
->class_template_info
);
14940 ggc_mark_tree (li2
->label_value
);
14941 ggc_mark_tree (li2
->implicit_decl
);
14942 ggc_mark_tree (li2
->error_locus
);
14945 else if (code
== CPLUS_BINDING
)
14947 if (BINDING_HAS_LEVEL_P (t
))
14948 mark_binding_level (&BINDING_LEVEL (t
));
14950 ggc_mark_tree (BINDING_SCOPE (t
));
14951 ggc_mark_tree (BINDING_VALUE (t
));
14953 else if (code
== OVERLOAD
)
14954 ggc_mark_tree (OVL_FUNCTION (t
));
14955 else if (code
== TEMPLATE_PARM_INDEX
)
14956 ggc_mark_tree (TEMPLATE_PARM_DECL (t
));
14957 else if (TREE_CODE_CLASS (code
) == 'd')
14959 struct lang_decl
*ld
= DECL_LANG_SPECIFIC (t
);
14964 if (!DECL_GLOBAL_CTOR_P (t
)
14965 && !DECL_GLOBAL_DTOR_P (t
)
14966 && !DECL_THUNK_P (t
))
14967 ggc_mark_tree (ld
->decl_flags
.u2
.access
);
14968 else if (DECL_THUNK_P (t
))
14969 ggc_mark_tree (ld
->decl_flags
.u2
.vcall_offset
);
14970 ggc_mark_tree (ld
->decl_flags
.context
);
14971 if (TREE_CODE (t
) != NAMESPACE_DECL
)
14972 ggc_mark_tree (ld
->decl_flags
.u
.template_info
);
14974 mark_binding_level (&NAMESPACE_LEVEL (t
));
14975 if (CAN_HAVE_FULL_LANG_DECL_P (t
))
14977 ggc_mark_tree (ld
->befriending_classes
);
14978 ggc_mark_tree (ld
->saved_tree
);
14979 ggc_mark_tree (ld
->cloned_function
);
14980 if (!DECL_OVERLOADED_OPERATOR_P (t
))
14981 ggc_mark_tree (ld
->u2
.vtt_parm
);
14982 if (TREE_CODE (t
) == TYPE_DECL
)
14983 ggc_mark_tree (ld
->u
.sorted_fields
);
14984 else if (TREE_CODE (t
) == FUNCTION_DECL
14985 && !DECL_PENDING_INLINE_P (t
))
14986 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t
));
14990 else if (TREE_CODE_CLASS (code
) == 't')
14992 struct lang_type
*lt
= TYPE_LANG_SPECIFIC (t
);
14994 if (lt
&& !(TREE_CODE (t
) == POINTER_TYPE
14995 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
14998 ggc_mark_tree (lt
->vfields
);
14999 ggc_mark_tree (lt
->vbases
);
15000 ggc_mark_tree (lt
->tags
);
15001 ggc_mark_tree (lt
->size
);
15002 ggc_mark_tree (lt
->pure_virtuals
);
15003 ggc_mark_tree (lt
->friend_classes
);
15004 ggc_mark_tree (lt
->rtti
);
15005 ggc_mark_tree (lt
->methods
);
15006 ggc_mark_tree (lt
->template_info
);
15007 ggc_mark_tree (lt
->befriending_classes
);
15010 /* In the case of pointer-to-member function types, the
15011 TYPE_LANG_SPECIFIC is really just a tree. */
15012 ggc_mark_tree ((tree
) lt
);