1 /* Process declarations and variables for C compiler.
2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000
3 Free Software Foundation, Inc.
4 Contributed by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GNU CC.
8 GNU CC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GNU CC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GNU CC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
24 /* Process declarations and symbol lookup for C front end.
25 Also constructs types; the standard scalar types at initialization,
26 and structure, union, array and enum types when they are declared. */
28 /* ??? not all decl nodes are given the most useful possible
29 line numbers. For example, the CONST_DECLs for enum values. */
49 extern int current_class_depth
;
51 extern tree static_ctors
, static_dtors
;
53 extern tree global_namespace
;
55 extern int (*valid_lang_attribute
) PARAMS ((tree
, tree
, tree
, tree
));
57 /* Use garbage collection. */
61 #ifndef WCHAR_UNSIGNED
62 #define WCHAR_UNSIGNED 0
65 #ifndef CHAR_TYPE_SIZE
66 #define CHAR_TYPE_SIZE BITS_PER_UNIT
69 #ifndef BOOL_TYPE_SIZE
70 #ifdef SLOW_BYTE_ACCESS
71 /* In the new ABI, `bool' has size and alignment `1', on all
73 #define BOOL_TYPE_SIZE \
74 ((SLOW_BYTE_ACCESS && !flag_new_abi) ? (POINTER_SIZE) : (CHAR_TYPE_SIZE))
76 #define BOOL_TYPE_SIZE CHAR_TYPE_SIZE
80 /* We let tm.h override the types used here, to handle trivial differences
81 such as the choice of unsigned int or long unsigned int for size_t.
82 When machines start needing nontrivial differences in the size type,
83 it would be best to do something here to figure out automatically
84 from other information what type to use. */
87 #define SIZE_TYPE "long unsigned int"
91 #define PTRDIFF_TYPE "long int"
95 #define WCHAR_TYPE "int"
98 static tree grokparms
PARAMS ((tree
, int));
99 static const char *redeclaration_error_message
PARAMS ((tree
, tree
));
101 static void push_binding_level
PARAMS ((struct binding_level
*, int,
103 static void pop_binding_level
PARAMS ((void));
104 static void suspend_binding_level
PARAMS ((void));
105 static void resume_binding_level
PARAMS ((struct binding_level
*));
106 static struct binding_level
*make_binding_level
PARAMS ((void));
107 static void declare_namespace_level
PARAMS ((void));
108 static void signal_catch
PARAMS ((int)) ATTRIBUTE_NORETURN
;
109 static int decl_jump_unsafe
PARAMS ((tree
));
110 static void storedecls
PARAMS ((tree
));
111 static void require_complete_types_for_parms
PARAMS ((tree
));
112 static int ambi_op_p
PARAMS ((enum tree_code
));
113 static int unary_op_p
PARAMS ((enum tree_code
));
114 static tree store_bindings
PARAMS ((tree
, tree
));
115 static tree lookup_tag_reverse
PARAMS ((tree
, tree
));
116 static tree obscure_complex_init
PARAMS ((tree
, tree
));
117 static tree lookup_name_real
PARAMS ((tree
, int, int, int));
118 static void warn_extern_redeclared_static
PARAMS ((tree
, tree
));
119 static void grok_reference_init
PARAMS ((tree
, tree
, tree
));
120 static tree grokfndecl
PARAMS ((tree
, tree
, tree
, tree
, int,
121 enum overload_flags
, tree
,
122 tree
, int, int, int, int, int, int, tree
));
123 static tree grokvardecl
PARAMS ((tree
, tree
, RID_BIT_TYPE
*, int, int, tree
));
124 static tree lookup_tag
PARAMS ((enum tree_code
, tree
,
125 struct binding_level
*, int));
126 static void set_identifier_type_value_with_scope
127 PARAMS ((tree
, tree
, struct binding_level
*));
128 static void record_builtin_type
PARAMS ((enum rid
, const char *, tree
));
129 static void record_unknown_type
PARAMS ((tree
, const char *));
130 static tree build_library_fn_1
PARAMS ((tree
, enum tree_code
, tree
));
131 static int member_function_or_else
PARAMS ((tree
, tree
, enum overload_flags
));
132 static void bad_specifiers
PARAMS ((tree
, const char *, int, int, int, int,
134 static void lang_print_error_function
PARAMS ((const char *));
135 static tree maybe_process_template_type_declaration
PARAMS ((tree
, int, struct binding_level
*));
136 static void check_for_uninitialized_const_var
PARAMS ((tree
));
137 static unsigned long typename_hash
PARAMS ((hash_table_key
));
138 static boolean typename_compare
PARAMS ((hash_table_key
, hash_table_key
));
139 static void push_binding
PARAMS ((tree
, tree
, struct binding_level
*));
140 static int add_binding
PARAMS ((tree
, tree
));
141 static void pop_binding
PARAMS ((tree
, tree
));
142 static tree local_variable_p_walkfn
PARAMS ((tree
*, int *, void *));
143 static tree find_binding
PARAMS ((tree
, tree
));
144 static tree select_decl
PARAMS ((tree
, int));
145 static int lookup_flags
PARAMS ((int, int));
146 static tree qualify_lookup
PARAMS ((tree
, int));
147 static tree record_builtin_java_type
PARAMS ((const char *, int));
148 static const char *tag_name
PARAMS ((enum tag_types code
));
149 static void find_class_binding_level
PARAMS ((void));
150 static struct binding_level
*innermost_nonclass_level
PARAMS ((void));
151 static void warn_about_implicit_typename_lookup
PARAMS ((tree
, tree
));
152 static int walk_namespaces_r
PARAMS ((tree
, walk_namespaces_fn
, void *));
153 static int walk_globals_r
PARAMS ((tree
, void *));
154 static void add_decl_to_level
PARAMS ((tree
, struct binding_level
*));
155 static tree make_label_decl
PARAMS ((tree
, int));
156 static void use_label
PARAMS ((tree
));
157 static void check_previous_goto_1
PARAMS ((tree
, struct binding_level
*, tree
,
159 static void check_previous_goto
PARAMS ((struct named_label_use_list
*));
160 static void check_switch_goto
PARAMS ((struct binding_level
*));
161 static void check_previous_gotos
PARAMS ((tree
));
162 static void pop_label
PARAMS ((tree
, tree
));
163 static void pop_labels
PARAMS ((tree
));
164 static void maybe_deduce_size_from_array_init
PARAMS ((tree
, tree
));
165 static void layout_var_decl
PARAMS ((tree
));
166 static void maybe_commonize_var
PARAMS ((tree
));
167 static tree check_initializer
PARAMS ((tree
, tree
));
168 static void make_rtl_for_nonlocal_decl
PARAMS ((tree
, tree
, const char *));
169 static void push_cp_function_context
PARAMS ((struct function
*));
170 static void pop_cp_function_context
PARAMS ((struct function
*));
171 static void mark_binding_level
PARAMS ((void *));
172 static void mark_named_label_lists
PARAMS ((void *, void *));
173 static void mark_cp_function_context
PARAMS ((struct function
*));
174 static void mark_saved_scope
PARAMS ((void *));
175 static void mark_lang_function
PARAMS ((struct language_function
*));
176 static void mark_stmt_tree
PARAMS ((struct stmt_tree
*));
177 static void save_function_data
PARAMS ((tree
));
178 static void check_function_type
PARAMS ((tree
));
179 static void destroy_local_var
PARAMS ((tree
));
180 static void finish_constructor_body
PARAMS ((void));
181 static void finish_destructor_body
PARAMS ((void));
182 static tree create_array_type_for_decl
PARAMS ((tree
, tree
, tree
));
183 static tree get_atexit_node
PARAMS ((void));
184 static tree get_dso_handle_node
PARAMS ((void));
185 static tree start_cleanup_fn
PARAMS ((void));
186 static void end_cleanup_fn
PARAMS ((void));
187 static tree cp_make_fname_decl
PARAMS ((tree
, const char *, int));
188 static void initialize_predefined_identifiers
PARAMS ((void));
189 static tree check_special_function_return_type
190 PARAMS ((special_function_kind
, tree
, tree
, tree
));
191 static tree push_cp_library_fn
PARAMS ((enum tree_code
, tree
));
192 static tree build_cp_library_fn
PARAMS ((tree
, enum tree_code
, tree
));
194 #if defined (DEBUG_CP_BINDING_LEVELS)
195 static void indent
PARAMS ((void));
198 /* Erroneous argument lists can use this *IFF* they do not modify it. */
199 tree error_mark_list
;
201 /* The following symbols are subsumed in the cp_global_trees array, and
202 listed here individually for documentation purposes.
205 tree wchar_decl_node;
208 tree vtable_entry_type;
209 tree delta_type_node;
212 tree __baselist_desc_type_node;
213 tree __i_desc_type_node, __m_desc_type_node;
214 tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type;
216 tree __t_desc_type_node;
218 tree __tp_desc_type_node;
220 tree ti_desc_type_node;
221 tree bltn_desc_type_node, ptr_desc_type_node;
222 tree ary_desc_type_node, func_desc_type_node, enum_desc_type_node;
223 tree class_desc_type_node, si_class_desc_type_node, vmi_class_desc_type_node;
224 tree ptm_desc_type_node;
225 tree base_desc_type_node;
227 Not needed yet? May be needed one day?
228 tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type;
229 tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type;
230 tree __ptmf_desc_array_type, __ptmd_desc_array_type;
233 tree class_type_node, record_type_node, union_type_node, enum_type_node;
234 tree unknown_type_node;
236 Array type `vtable_entry_type[]'
239 tree vtbl_ptr_type_node;
246 A FUNCTION_DECL which can call `abort'. Not necessarily the
247 one that the user will declare, but sufficient to be called
248 by routines that want to abort the program.
252 The FUNCTION_DECL for the default `::operator delete'.
254 tree global_delete_fndecl;
257 tree type_info_type_node, tinfo_decl_id, tinfo_decl_type;
262 tree cp_global_trees
[CPTI_MAX
];
264 /* Indicates that there is a type value in some namespace, although
265 that is not necessarily in scope at the moment. */
267 static tree global_type_node
;
272 /* Expect only namespace names now. */
273 static int only_namespace_names
;
275 /* If original DECL_RESULT of current function was a register,
276 but due to being an addressable named return value, would up
277 on the stack, this variable holds the named return value's
278 original location. */
280 #define original_result_rtx cp_function_chain->x_result_rtx
282 /* Used only for jumps to as-yet undefined labels, since jumps to
283 defined labels can have their validity checked immediately. */
285 struct named_label_use_list
287 struct binding_level
*binding_level
;
290 const char *filename_o_goto
;
292 struct named_label_use_list
*next
;
295 #define named_label_uses cp_function_chain->x_named_label_uses
297 /* A list of objects which have constructors or destructors
298 which reside in the global scope. The decl is stored in
299 the TREE_VALUE slot and the initializer is stored
300 in the TREE_PURPOSE slot. */
301 tree static_aggregates
;
305 /* A node for the integer constants 2, and 3. */
307 tree integer_two_node
, integer_three_node
;
309 /* Parsing a function declarator leaves here a chain of structure
310 and enum types declared in the parmlist. */
312 static tree last_function_parm_tags
;
314 /* Similar, for last_function_parm_tags. */
315 tree last_function_parms
;
316 static tree current_function_parm_tags
;
318 /* A list of all LABEL_DECLs in the function that have names. Here so
319 we can clear out their names' definitions at the end of the
320 function, and so we can check the validity of jumps to these labels. */
322 struct named_label_list
324 struct binding_level
*binding_level
;
330 struct named_label_list
*next
;
333 #define named_labels cp_function_chain->x_named_labels
335 /* Set to 0 at beginning of a function definition, and whenever
336 a label (case or named) is defined. Set to value of expression
337 returned from function when that value can be transformed into
338 a named return value. */
340 tree current_function_return_value
;
342 /* Nonzero means use the ISO C99 dialect of C. */
346 /* Nonzero means give `double' the same size as `float'. */
348 extern int flag_short_double
;
350 /* Nonzero means don't recognize any builtin functions. */
352 extern int flag_no_builtin
;
354 /* Nonzero means don't recognize the non-ANSI builtin functions.
357 extern int flag_no_nonansi_builtin
;
359 /* Nonzero if we want to conserve space in the .o files. We do this
360 by putting uninitialized data and runtime initialized data into
361 .common instead of .data at the expense of not flagging multiple
363 extern int flag_conserve_space
;
365 /* C and C++ flags are in decl2.c. */
367 /* Flag used when debugging spew.c */
369 extern int spew_debug
;
371 /* A expression of value 0 with the same precision as a sizetype
373 tree signed_size_zero_node
;
375 /* The name of the anonymous namespace, throughout this translation
377 tree anonymous_namespace_name
;
380 /* For each binding contour we allocate a binding_level structure
381 which records the names defined in that contour.
384 1) one for each function definition,
385 where internal declarations of the parameters appear.
386 2) one for each compound statement,
387 to record its declarations.
389 The current meaning of a name can be found by searching the levels
390 from the current one out to the global one.
392 Off to the side, may be the class_binding_level. This exists only
393 to catch class-local declarations. It is otherwise nonexistent.
395 Also there may be binding levels that catch cleanups that must be
396 run when exceptions occur. Thus, to see whether a name is bound in
397 the current scope, it is not enough to look in the
398 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
401 /* Note that the information in the `names' component of the global contour
402 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
406 /* A chain of _DECL nodes for all variables, constants, functions,
407 and typedef types. These are in the reverse of the order
408 supplied. There may be OVERLOADs on this list, too, but they
409 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
412 /* A list of structure, union and enum definitions, for looking up
414 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
415 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
416 or ENUMERAL_TYPE node.
418 C++: the TREE_VALUE nodes can be simple types for
419 component_bindings. */
422 /* A list of USING_DECL nodes. */
425 /* A list of used namespaces. PURPOSE is the namespace,
426 VALUE the common ancestor with this binding_level's namespace. */
427 tree using_directives
;
429 /* If this binding level is the binding level for a class, then
430 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
431 is the name of an entity bound in the class; the TREE_VALUE is
432 the IDENTIFIER_CLASS_VALUE before we entered the class. Thus,
433 when leaving class scope, we can restore the
434 IDENTIFIER_CLASS_VALUE by walking this list. The TREE_TYPE is
435 the DECL bound by this name in the class. */
438 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
439 is used for all binding levels. */
442 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
443 label in this scope. The TREE_PURPOSE is the previous value of
444 the IDENTIFIER_LABEL VALUE. */
445 tree shadowed_labels
;
447 /* For each level (except not the global one),
448 a chain of BLOCK nodes for all the levels
449 that were entered and exited one level down. */
452 /* The BLOCK node for this level, if one has been preallocated.
453 If 0, the BLOCK is allocated (if needed) when the level is popped. */
456 /* The _TYPE node for this level, if parm_flag == 2. */
459 /* The binding level which this one is contained in (inherits from). */
460 struct binding_level
*level_chain
;
462 /* List of decls in `names' that have incomplete
463 structure or union types. */
466 /* List of VAR_DECLS saved from a previous for statement.
467 These would be dead in ISO-conforming code, but might
468 be referenced in ARM-era code. These are stored in a
469 TREE_LIST; the TREE_VALUE is the actual declaration. */
470 tree dead_vars_from_for
;
472 /* 1 for the level that holds the parameters of a function.
473 2 for the level that holds a class declaration. */
474 unsigned parm_flag
: 2;
476 /* 1 means make a BLOCK for this level regardless of all else.
477 2 for temporary binding contours created by the compiler. */
480 /* Nonzero if this level "doesn't exist" for tags. */
481 unsigned tag_transparent
: 1;
483 /* Nonzero if this level can safely have additional
484 cleanup-needing variables added to it. */
485 unsigned more_cleanups_ok
: 1;
486 unsigned have_cleanups
: 1;
488 /* Nonzero if this scope is for storing the decls for template
489 parameters and generic decls; these decls will be discarded and
490 replaced with a TEMPLATE_DECL. */
491 unsigned template_parms_p
: 1;
493 /* Nonzero if this scope corresponds to the `<>' in a
494 `template <>' clause. Whenever this flag is set,
495 TEMPLATE_PARMS_P will be set as well. */
496 unsigned template_spec_p
: 1;
498 /* This is set for a namespace binding level. */
499 unsigned namespace_p
: 1;
501 /* True if this level is that of a for-statement where we need to
502 worry about ambiguous (ARM or ISO) scope rules. */
503 unsigned is_for_scope
: 1;
505 /* True if this level corresponds to an EH region, as for a try block.
506 Currently this information is only available while building the
508 unsigned eh_region
: 1;
510 /* Four bits left for this word. */
512 #if defined(DEBUG_CP_BINDING_LEVELS)
513 /* Binding depth at which this level began. */
514 unsigned binding_depth
;
515 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
518 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
520 /* The binding level currently in effect. */
522 #define current_binding_level \
524 ? cp_function_chain->bindings \
525 : scope_chain->bindings)
527 /* The binding level of the current class, if any. */
529 #define class_binding_level scope_chain->class_bindings
531 /* A chain of binding_level structures awaiting reuse. */
533 static struct binding_level
*free_binding_level
;
535 /* The outermost binding level, for names of file scope.
536 This is created when the compiler is started and exists
537 through the entire run. */
539 static struct binding_level
*global_binding_level
;
541 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
543 static int keep_next_level_flag
;
545 #if defined(DEBUG_CP_BINDING_LEVELS)
546 static int binding_depth
= 0;
547 static int is_class_level
= 0;
554 for (i
= 0; i
< binding_depth
*2; i
++)
557 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
559 static tree pushdecl_with_scope
PARAMS ((tree
, struct binding_level
*));
562 push_binding_level (newlevel
, tag_transparent
, keep
)
563 struct binding_level
*newlevel
;
564 int tag_transparent
, keep
;
566 /* Add this level to the front of the chain (stack) of levels that
568 bzero ((char*) newlevel
, sizeof (struct binding_level
));
569 newlevel
->level_chain
= current_binding_level
;
570 current_binding_level
= newlevel
;
571 newlevel
->tag_transparent
= tag_transparent
;
572 newlevel
->more_cleanups_ok
= 1;
574 newlevel
->keep
= keep
;
575 #if defined(DEBUG_CP_BINDING_LEVELS)
576 newlevel
->binding_depth
= binding_depth
;
578 fprintf (stderr
, "push %s level 0x%08x line %d\n",
579 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
582 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
585 /* Find the innermost enclosing class scope, and reset
586 CLASS_BINDING_LEVEL appropriately. */
589 find_class_binding_level ()
591 struct binding_level
*level
= current_binding_level
;
593 while (level
&& level
->parm_flag
!= 2)
594 level
= level
->level_chain
;
595 if (level
&& level
->parm_flag
== 2)
596 class_binding_level
= level
;
598 class_binding_level
= 0;
604 if (global_binding_level
)
606 /* Cannot pop a level, if there are none left to pop. */
607 if (current_binding_level
== global_binding_level
)
608 my_friendly_abort (123);
610 /* Pop the current level, and free the structure for reuse. */
611 #if defined(DEBUG_CP_BINDING_LEVELS)
614 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
615 (is_class_level
) ? "class" : "block",
616 current_binding_level
, lineno
);
617 if (is_class_level
!= (current_binding_level
== class_binding_level
))
620 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
623 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
625 register struct binding_level
*level
= current_binding_level
;
626 current_binding_level
= current_binding_level
->level_chain
;
627 level
->level_chain
= free_binding_level
;
628 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
629 if (level
->binding_depth
!= binding_depth
)
631 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
632 free_binding_level
= level
;
633 find_class_binding_level ();
638 suspend_binding_level ()
640 if (class_binding_level
)
641 current_binding_level
= class_binding_level
;
643 if (global_binding_level
)
645 /* Cannot suspend a level, if there are none left to suspend. */
646 if (current_binding_level
== global_binding_level
)
647 my_friendly_abort (123);
649 /* Suspend the current level. */
650 #if defined(DEBUG_CP_BINDING_LEVELS)
653 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
654 (is_class_level
) ? "class" : "block",
655 current_binding_level
, lineno
);
656 if (is_class_level
!= (current_binding_level
== class_binding_level
))
659 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
662 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
663 current_binding_level
= current_binding_level
->level_chain
;
664 find_class_binding_level ();
668 resume_binding_level (b
)
669 struct binding_level
*b
;
671 /* Resuming binding levels is meant only for namespaces,
672 and those cannot nest into classes. */
673 my_friendly_assert(!class_binding_level
, 386);
674 /* Also, resuming a non-directly nested namespace is a no-no. */
675 my_friendly_assert(b
->level_chain
== current_binding_level
, 386);
676 current_binding_level
= b
;
677 #if defined(DEBUG_CP_BINDING_LEVELS)
678 b
->binding_depth
= binding_depth
;
680 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
681 (is_class_level
) ? "class" : "block", b
, lineno
);
684 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
687 /* Create a new `struct binding_level'. */
690 struct binding_level
*
691 make_binding_level ()
694 return (struct binding_level
*) xmalloc (sizeof (struct binding_level
));
697 /* Nonzero if we are currently in the global binding level. */
702 return current_binding_level
== global_binding_level
;
705 /* Return the innermost binding level that is not for a class scope. */
707 static struct binding_level
*
708 innermost_nonclass_level ()
710 struct binding_level
*b
;
712 b
= current_binding_level
;
713 while (b
->parm_flag
== 2)
719 /* Nonzero if we are currently in a toplevel binding level. This
720 means either the global binding level or a namespace in a toplevel
721 binding level. Since there are no non-toplevel namespace levels,
722 this really means any namespace or template parameter level. We
723 also include a class whose context is toplevel. */
726 toplevel_bindings_p ()
728 struct binding_level
*b
= innermost_nonclass_level ();
730 return b
->namespace_p
|| b
->template_parms_p
;
733 /* Nonzero if this is a namespace scope, or if we are defining a class
734 which is itself at namespace scope, or whose enclosing class is
735 such a class, etc. */
738 namespace_bindings_p ()
740 struct binding_level
*b
= innermost_nonclass_level ();
742 return b
->namespace_p
;
745 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
746 unconditionally. Otherwise, use the normal logic to decide whether
747 or not to create a BLOCK. */
750 keep_next_level (keep
)
753 keep_next_level_flag
= keep
;
756 /* Nonzero if the current level needs to have a BLOCK made. */
761 return (current_binding_level
->blocks
!= NULL_TREE
762 || current_binding_level
->keep
763 || current_binding_level
->names
!= NULL_TREE
764 || (current_binding_level
->tags
!= NULL_TREE
765 && !current_binding_level
->tag_transparent
));
769 declare_namespace_level ()
771 current_binding_level
->namespace_p
= 1;
774 /* Returns non-zero if this scope was created to store template
778 template_parm_scope_p ()
780 return current_binding_level
->template_parms_p
;
783 /* Returns the kind of template specialization we are currently
784 processing, given that it's declaration contained N_CLASS_SCOPES
785 explicit scope qualifications. */
788 current_tmpl_spec_kind (n_class_scopes
)
791 int n_template_parm_scopes
= 0;
792 int seen_specialization_p
= 0;
793 int innermost_specialization_p
= 0;
794 struct binding_level
*b
;
796 /* Scan through the template parameter scopes. */
797 for (b
= current_binding_level
; b
->template_parms_p
; b
= b
->level_chain
)
799 /* If we see a specialization scope inside a parameter scope,
800 then something is wrong. That corresponds to a declaration
803 template <class T> template <> ...
805 which is always illegal since [temp.expl.spec] forbids the
806 specialization of a class member template if the enclosing
807 class templates are not explicitly specialized as well. */
808 if (b
->template_spec_p
)
810 if (n_template_parm_scopes
== 0)
811 innermost_specialization_p
= 1;
813 seen_specialization_p
= 1;
815 else if (seen_specialization_p
== 1)
816 return tsk_invalid_member_spec
;
818 ++n_template_parm_scopes
;
821 /* Handle explicit instantiations. */
822 if (processing_explicit_instantiation
)
824 if (n_template_parm_scopes
!= 0)
825 /* We've seen a template parameter list during an explicit
826 instantiation. For example:
828 template <class T> template void f(int);
830 This is erroneous. */
831 return tsk_invalid_expl_inst
;
833 return tsk_expl_inst
;
836 if (n_template_parm_scopes
< n_class_scopes
)
837 /* We've not seen enough template headers to match all the
838 specialized classes present. For example:
840 template <class T> void R<T>::S<T>::f(int);
842 This is illegal; there needs to be one set of template
843 parameters for each class. */
844 return tsk_insufficient_parms
;
845 else if (n_template_parm_scopes
== n_class_scopes
)
846 /* We're processing a non-template declaration (even though it may
847 be a member of a template class.) For example:
849 template <class T> void S<T>::f(int);
851 The `class T' maches the `S<T>', leaving no template headers
852 corresponding to the `f'. */
854 else if (n_template_parm_scopes
> n_class_scopes
+ 1)
855 /* We've got too many template headers. For example:
857 template <> template <class T> void f (T);
859 There need to be more enclosing classes. */
860 return tsk_excessive_parms
;
862 /* This must be a template. It's of the form:
864 template <class T> template <class U> void S<T>::f(U);
866 This is a specialization if the innermost level was a
867 specialization; otherwise it's just a definition of the
869 return innermost_specialization_p
? tsk_expl_spec
: tsk_template
;
873 set_class_shadows (shadows
)
876 class_binding_level
->class_shadowed
= shadows
;
879 /* Enter a new binding level.
880 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
881 not for that of tags. */
884 pushlevel (tag_transparent
)
887 struct binding_level
*newlevel
;
889 if (cfun
&& !doing_semantic_analysis_p ())
892 /* Reuse or create a struct for this binding level. */
893 #if defined(DEBUG_CP_BINDING_LEVELS)
895 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
896 if (free_binding_level
)
897 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
899 newlevel
= free_binding_level
;
900 free_binding_level
= free_binding_level
->level_chain
;
903 newlevel
= make_binding_level ();
905 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
906 GNU_xref_start_scope ((HOST_WIDE_INT
) newlevel
);
907 keep_next_level_flag
= 0;
910 /* Enter a new scope. The KIND indicates what kind of scope is being
921 case sk_template_spec
:
922 current_binding_level
->template_spec_p
= 1;
925 case sk_template_parms
:
926 current_binding_level
->template_parms_p
= 1;
930 my_friendly_abort (20000309);
934 /* Exit the current scope. */
943 note_level_for_for ()
945 current_binding_level
->is_for_scope
= 1;
948 /* Record that the current binding level represents a try block. */
953 current_binding_level
->eh_region
= 1;
956 /* For a binding between a name and an entity at a block scope,
957 this is the `struct binding_level' for the block. */
958 #define BINDING_LEVEL(NODE) \
959 (((struct tree_binding*)NODE)->scope.level)
961 /* Make DECL the innermost binding for ID. The LEVEL is the binding
962 level at which this declaration is being bound. */
965 push_binding (id
, decl
, level
)
968 struct binding_level
* level
;
972 binding
= make_node (CPLUS_BINDING
);
974 /* Now, fill in the binding information. */
975 BINDING_VALUE (binding
) = decl
;
976 BINDING_TYPE (binding
) = NULL_TREE
;
977 BINDING_LEVEL (binding
) = level
;
978 INHERITED_VALUE_BINDING_P (binding
) = 0;
979 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
980 BINDING_HAS_LEVEL_P (binding
) = 1;
982 /* And put it on the front of the list of bindings for ID. */
983 TREE_CHAIN (binding
) = IDENTIFIER_BINDING (id
);
984 IDENTIFIER_BINDING (id
) = binding
;
987 /* ID is already bound in the current scope. But, DECL is an
988 additional binding for ID in the same scope. This is the `struct
989 stat' hack whereby a non-typedef class-name or enum-name can be
990 bound at the same level as some other kind of entity. It's the
991 responsibility of the caller to check that inserting this name is
992 legal here. Returns nonzero if the new binding was successful. */
994 add_binding (id
, decl
)
998 tree binding
= IDENTIFIER_BINDING (id
);
1001 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
1002 /* The new name is the type name. */
1003 BINDING_TYPE (binding
) = decl
;
1004 else if (!BINDING_VALUE (binding
))
1005 /* This situation arises when push_class_level_binding moves an
1006 inherited type-binding out of the way to make room for a new
1008 BINDING_VALUE (binding
) = decl
;
1009 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
1010 && DECL_ARTIFICIAL (BINDING_VALUE (binding
)))
1012 /* The old binding was a type name. It was placed in
1013 BINDING_VALUE because it was thought, at the point it was
1014 declared, to be the only entity with such a name. Move the
1015 type name into the type slot; it is now hidden by the new
1017 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
1018 BINDING_VALUE (binding
) = decl
;
1019 INHERITED_VALUE_BINDING_P (binding
) = 0;
1021 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
1022 && TREE_CODE (decl
) == TYPE_DECL
1023 && DECL_NAME (decl
) == DECL_NAME (BINDING_VALUE (binding
))
1024 && same_type_p (TREE_TYPE (decl
),
1025 TREE_TYPE (BINDING_VALUE (binding
))))
1026 /* We have two typedef-names, both naming the same type to have
1027 the same name. This is OK because of:
1031 In a given scope, a typedef specifier can be used to redefine
1032 the name of any type declared in that scope to refer to the
1033 type to which it already refers. */
1035 /* There can be two block-scope declarations of the same variable,
1036 so long as they are `extern' declarations. */
1037 else if (TREE_CODE (decl
) == VAR_DECL
1038 && TREE_CODE (BINDING_VALUE (binding
)) == VAR_DECL
1039 && DECL_EXTERNAL (decl
)
1040 && DECL_EXTERNAL (BINDING_VALUE (binding
)))
1042 duplicate_decls (decl
, BINDING_VALUE (binding
));
1047 cp_error ("declaration of `%#D'", decl
);
1048 cp_error_at ("conflicts with previous declaration `%#D'",
1049 BINDING_VALUE (binding
));
1056 /* Add DECL to the list of things declared in B. */
1059 add_decl_to_level (decl
, b
)
1061 struct binding_level
*b
;
1063 /* We build up the list in reverse order, and reverse it later if
1065 TREE_CHAIN (decl
) = b
->names
;
1069 /* Bind DECL to ID in the current_binding_level, assumed to be a local
1070 binding level. If PUSH_USING is set in FLAGS, we know that DECL
1071 doesn't really belong to this binding level, that it got here
1072 through a using-declaration. */
1075 push_local_binding (id
, decl
, flags
)
1080 struct binding_level
*b
;
1082 /* Skip over any local classes. This makes sense if we call
1083 push_local_binding with a friend decl of a local class. */
1084 b
= current_binding_level
;
1085 while (b
->parm_flag
== 2)
1088 if (lookup_name_current_level (id
))
1090 /* Supplement the existing binding. */
1091 if (!add_binding (id
, decl
))
1092 /* It didn't work. Something else must be bound at this
1093 level. Do not add DECL to the list of things to pop
1098 /* Create a new binding. */
1099 push_binding (id
, decl
, b
);
1101 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
1102 /* We must put the OVERLOAD into a TREE_LIST since the
1103 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1104 decls that got here through a using-declaration. */
1105 decl
= build_tree_list (NULL_TREE
, decl
);
1107 /* And put DECL on the list of things declared by the current
1109 add_decl_to_level (decl
, b
);
1112 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
1113 binding was successful. */
1116 push_class_binding (id
, decl
)
1121 tree binding
= IDENTIFIER_BINDING (id
);
1124 /* Note that we declared this value so that we can issue an error if
1125 this an illegal redeclaration of a name already used for some
1127 note_name_declared_in_class (id
, decl
);
1129 if (binding
&& BINDING_LEVEL (binding
) == class_binding_level
)
1130 /* Supplement the existing binding. */
1131 result
= add_binding (id
, decl
);
1133 /* Create a new binding. */
1134 push_binding (id
, decl
, class_binding_level
);
1136 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1137 class-level declaration. Note that we do not use DECL here
1138 because of the possibility of the `struct stat' hack; if DECL is
1139 a class-name or enum-name we might prefer a field-name, or some
1141 IDENTIFIER_CLASS_VALUE (id
) = BINDING_VALUE (IDENTIFIER_BINDING (id
));
1143 /* If this is a binding from a base class, mark it as such. */
1144 binding
= IDENTIFIER_BINDING (id
);
1145 if (BINDING_VALUE (binding
) == decl
&& TREE_CODE (decl
) != TREE_LIST
)
1147 /* Any implicit typename must be from a base-class. The
1148 context for an implicit typename declaration is always
1149 the derived class in which the lookup was done, so the checks
1150 based on the context of DECL below will not trigger. */
1151 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl
))
1152 INHERITED_VALUE_BINDING_P (binding
) = 1;
1155 if (TREE_CODE (decl
) == OVERLOAD
)
1156 context
= CP_DECL_CONTEXT (OVL_CURRENT (decl
));
1159 my_friendly_assert (DECL_P (decl
), 0);
1160 context
= CP_DECL_CONTEXT (decl
);
1163 if (is_properly_derived_from (current_class_type
, context
))
1164 INHERITED_VALUE_BINDING_P (binding
) = 1;
1166 INHERITED_VALUE_BINDING_P (binding
) = 0;
1169 else if (BINDING_VALUE (binding
) == decl
)
1170 /* We only encounter a TREE_LIST when push_class_decls detects an
1171 ambiguity. Such an ambiguity can be overridden by a definition
1173 INHERITED_VALUE_BINDING_P (binding
) = 1;
1178 /* Remove the binding for DECL which should be the innermost binding
1182 pop_binding (id
, decl
)
1188 if (id
== NULL_TREE
)
1189 /* It's easiest to write the loops that call this function without
1190 checking whether or not the entities involved have names. We
1191 get here for such an entity. */
1194 /* Get the innermost binding for ID. */
1195 binding
= IDENTIFIER_BINDING (id
);
1197 /* The name should be bound. */
1198 my_friendly_assert (binding
!= NULL_TREE
, 0);
1200 /* The DECL will be either the ordinary binding or the type
1201 binding for this identifier. Remove that binding. */
1202 if (BINDING_VALUE (binding
) == decl
)
1203 BINDING_VALUE (binding
) = NULL_TREE
;
1204 else if (BINDING_TYPE (binding
) == decl
)
1205 BINDING_TYPE (binding
) = NULL_TREE
;
1207 my_friendly_abort (0);
1209 if (!BINDING_VALUE (binding
) && !BINDING_TYPE (binding
))
1210 /* We're completely done with the innermost binding for this
1211 identifier. Unhook it from the list of bindings. */
1212 IDENTIFIER_BINDING (id
) = TREE_CHAIN (binding
);
1215 /* When a label goes out of scope, check to see if that label was used
1216 in a valid manner, and issue any appropriate warnings or errors. */
1219 pop_label (label
, old_value
)
1223 if (!processing_template_decl
&& doing_semantic_analysis_p ())
1225 if (DECL_INITIAL (label
) == NULL_TREE
)
1227 cp_error_at ("label `%D' used but not defined", label
);
1228 /* Avoid crashing later. */
1229 define_label (input_filename
, 1, DECL_NAME (label
));
1231 else if (warn_unused_label
&& !TREE_USED (label
))
1232 cp_warning_at ("label `%D' defined but not used", label
);
1235 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), old_value
);
1238 /* At the end of a function, all labels declared within the fucntion
1239 go out of scope. BLOCK is the top-level block for the
1246 struct named_label_list
*link
;
1248 /* Clear out the definitions of all label names, since their scopes
1250 for (link
= named_labels
; link
; link
= link
->next
)
1252 pop_label (link
->label_decl
, link
->old_value
);
1253 /* Put the labels into the "variables" of the top-level block,
1254 so debugger can see them. */
1255 TREE_CHAIN (link
->label_decl
) = BLOCK_VARS (block
);
1256 BLOCK_VARS (block
) = link
->label_decl
;
1259 named_labels
= NULL
;
1262 /* Exit a binding level.
1263 Pop the level off, and restore the state of the identifier-decl mappings
1264 that were in effect when this level was entered.
1266 If KEEP == 1, this level had explicit declarations, so
1267 and create a "block" (a BLOCK node) for the level
1268 to record its declarations and subblocks for symbol table output.
1270 If FUNCTIONBODY is nonzero, this level is the body of a function,
1271 so create a block as if KEEP were set and also clear out all
1274 If REVERSE is nonzero, reverse the order of decls before putting
1275 them into the BLOCK. */
1278 poplevel (keep
, reverse
, functionbody
)
1284 /* The chain of decls was accumulated in reverse order.
1285 Put it into forward order, just for cleanliness. */
1287 int tmp
= functionbody
;
1288 int real_functionbody
;
1291 tree block
= NULL_TREE
;
1293 int block_previously_created
;
1294 int leaving_for_scope
;
1296 if (cfun
&& !doing_semantic_analysis_p ())
1299 my_friendly_assert (current_binding_level
->parm_flag
!= 2,
1302 real_functionbody
= (current_binding_level
->keep
== 2
1303 ? ((functionbody
= 0), tmp
) : functionbody
);
1304 tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1305 subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1307 my_friendly_assert (!current_binding_level
->class_shadowed
,
1310 /* We used to use KEEP == 2 to indicate that the new block should go
1311 at the beginning of the list of blocks at this binding level,
1312 rather than the end. This hack is no longer used. */
1313 my_friendly_assert (keep
== 0 || keep
== 1, 0);
1315 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1316 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1317 current_binding_level
->parm_flag
,
1318 current_binding_level
->keep
);
1320 if (current_binding_level
->keep
== 1)
1323 /* Any uses of undefined labels, and any defined labels, now operate
1324 under constraints of next binding contour. */
1325 if (cfun
&& !functionbody
)
1327 struct binding_level
*level_chain
;
1328 level_chain
= current_binding_level
->level_chain
;
1331 struct named_label_use_list
*uses
;
1332 struct named_label_list
*labels
;
1333 for (labels
= named_labels
; labels
; labels
= labels
->next
)
1334 if (labels
->binding_level
== current_binding_level
)
1337 if (current_binding_level
->eh_region
)
1338 labels
->eh_region
= 1;
1339 for (decl
= labels
->names_in_scope
; decl
;
1340 decl
= TREE_CHAIN (decl
))
1341 if (decl_jump_unsafe (decl
))
1342 labels
->bad_decls
= tree_cons (NULL_TREE
, decl
,
1344 labels
->binding_level
= level_chain
;
1345 labels
->names_in_scope
= level_chain
->names
;
1348 for (uses
= named_label_uses
; uses
; uses
= uses
->next
)
1349 if (uses
->binding_level
== current_binding_level
)
1351 uses
->binding_level
= level_chain
;
1352 uses
->names_in_scope
= level_chain
->names
;
1357 /* Get the decls in the order they were written.
1358 Usually current_binding_level->names is in reverse order.
1359 But parameter decls were previously put in forward order. */
1362 current_binding_level
->names
1363 = decls
= nreverse (current_binding_level
->names
);
1365 decls
= current_binding_level
->names
;
1367 /* Output any nested inline functions within this block
1368 if they weren't already output. */
1369 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1370 if (TREE_CODE (decl
) == FUNCTION_DECL
1371 && ! TREE_ASM_WRITTEN (decl
)
1372 && DECL_INITIAL (decl
) != NULL_TREE
1373 && TREE_ADDRESSABLE (decl
)
1374 && decl_function_context (decl
) == current_function_decl
)
1376 /* If this decl was copied from a file-scope decl
1377 on account of a block-scope extern decl,
1378 propagate TREE_ADDRESSABLE to the file-scope decl. */
1379 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1380 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1383 push_function_context ();
1384 output_inline_function (decl
);
1385 pop_function_context ();
1389 /* When not in function-at-a-time mode, expand_end_bindings will
1390 warn about unused variables. But, in function-at-a-time mode
1391 expand_end_bindings is not passed the list of variables in the
1392 current scope, and therefore no warning is emitted. So, we
1393 explicitly warn here. */
1394 if (!processing_template_decl
)
1395 warn_about_unused_variables (getdecls ());
1397 /* If there were any declarations or structure tags in that level,
1398 or if this level is a function body,
1399 create a BLOCK to record them for the life of this function. */
1401 block_previously_created
= (current_binding_level
->this_block
!= NULL_TREE
);
1402 if (block_previously_created
)
1403 block
= current_binding_level
->this_block
;
1404 else if (keep
== 1 || functionbody
)
1405 block
= make_node (BLOCK
);
1406 if (block
!= NULL_TREE
)
1408 if (block_previously_created
)
1410 if (decls
|| tags
|| subblocks
)
1412 if (BLOCK_VARS (block
))
1413 warning ("internal compiler error: debugging info corrupted");
1415 BLOCK_VARS (block
) = decls
;
1417 /* We can have previous subblocks and new subblocks when
1418 doing fixup_gotos with complex cleanups. We chain the new
1419 subblocks onto the end of any pre-existing subblocks. */
1420 BLOCK_SUBBLOCKS (block
) = chainon (BLOCK_SUBBLOCKS (block
),
1426 BLOCK_VARS (block
) = decls
;
1427 BLOCK_SUBBLOCKS (block
) = subblocks
;
1431 /* In each subblock, record that this is its superior. */
1433 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1434 BLOCK_SUPERCONTEXT (link
) = block
;
1436 /* We still support the old for-scope rules, whereby the variables
1437 in a for-init statement were in scope after the for-statement
1438 ended. We only use the new rules in flag_new_for_scope is
1441 = current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1;
1443 /* Remove declarations for all the DECLs in this level. */
1444 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1446 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
)
1449 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link
)));
1453 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
1455 ns_binding
= NULL_TREE
;
1458 && (BINDING_LEVEL (outer_binding
)
1459 == current_binding_level
->level_chain
))
1460 /* We have something like:
1465 and we are leaving the `for' scope. There's no reason to
1466 keep the binding of the inner `i' in this case. */
1467 pop_binding (DECL_NAME (link
), link
);
1468 else if ((outer_binding
1469 && (TREE_CODE (BINDING_VALUE (outer_binding
))
1472 && TREE_CODE (ns_binding
) == TYPE_DECL
))
1473 /* Here, we have something like:
1481 We must pop the for-scope binding so we know what's a
1482 type and what isn't. */
1483 pop_binding (DECL_NAME (link
), link
);
1486 /* Mark this VAR_DECL as dead so that we can tell we left it
1487 there only for backward compatibility. */
1488 DECL_DEAD_FOR_LOCAL (link
) = 1;
1490 /* Keep track of what should of have happenned when we
1491 popped the binding. */
1492 if (outer_binding
&& BINDING_VALUE (outer_binding
))
1493 DECL_SHADOWED_FOR_VAR (link
)
1494 = BINDING_VALUE (outer_binding
);
1496 /* Add it to the list of dead variables in the next
1497 outermost binding to that we can remove these when we
1498 leave that binding. */
1499 current_binding_level
->level_chain
->dead_vars_from_for
1500 = tree_cons (NULL_TREE
, link
,
1501 current_binding_level
->level_chain
->
1502 dead_vars_from_for
);
1504 /* Although we don't pop the CPLUS_BINDING, we do clear
1505 its BINDING_LEVEL since the level is going away now. */
1506 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link
)))
1512 /* Remove the binding. */
1514 if (TREE_CODE (decl
) == TREE_LIST
)
1515 decl
= TREE_VALUE (decl
);
1517 pop_binding (DECL_NAME (decl
), decl
);
1518 else if (TREE_CODE (decl
) == OVERLOAD
)
1519 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
1521 my_friendly_abort (0);
1525 /* Remove declarations for any `for' variables from inner scopes
1526 that we kept around. */
1527 for (link
= current_binding_level
->dead_vars_from_for
;
1528 link
; link
= TREE_CHAIN (link
))
1529 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
1531 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1532 for (link
= current_binding_level
->type_shadowed
;
1533 link
; link
= TREE_CHAIN (link
))
1534 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1536 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1537 for (link
= current_binding_level
->shadowed_labels
;
1539 link
= TREE_CHAIN (link
))
1540 pop_label (TREE_VALUE (link
), TREE_PURPOSE (link
));
1542 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1543 list if a `using' declaration put them there. The debugging
1544 back-ends won't understand OVERLOAD, so we remove them here.
1545 Because the BLOCK_VARS are (temporarily) shared with
1546 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1547 popped all the bindings. */
1552 for (d
= &BLOCK_VARS (block
); *d
; )
1554 if (TREE_CODE (*d
) == TREE_LIST
)
1555 *d
= TREE_CHAIN (*d
);
1557 d
= &TREE_CHAIN (*d
);
1561 /* If the level being exited is the top level of a function,
1562 check over all the labels. */
1565 /* Since this is the top level block of a function, the vars are
1566 the function's parameters. Don't leave them in the BLOCK
1567 because they are found in the FUNCTION_DECL instead. */
1568 BLOCK_VARS (block
) = 0;
1572 tmp
= current_binding_level
->keep
;
1574 pop_binding_level ();
1576 DECL_INITIAL (current_function_decl
) = block
;
1579 if (!block_previously_created
)
1580 current_binding_level
->blocks
1581 = chainon (current_binding_level
->blocks
, block
);
1583 /* If we did not make a block for the level just exited,
1584 any blocks made for inner levels
1585 (since they cannot be recorded as subblocks in that level)
1586 must be carried forward so they will later become subblocks
1587 of something else. */
1589 current_binding_level
->blocks
1590 = chainon (current_binding_level
->blocks
, subblocks
);
1592 /* Each and every BLOCK node created here in `poplevel' is important
1593 (e.g. for proper debugging information) so if we created one
1594 earlier, mark it as "used". */
1596 TREE_USED (block
) = 1;
1598 /* Take care of compiler's internal binding structures. */
1604 = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/1);
1607 SCOPE_STMT_BLOCK (TREE_PURPOSE (scope_stmts
)) = block
;
1608 SCOPE_STMT_BLOCK (TREE_VALUE (scope_stmts
)) = block
;
1611 block
= poplevel (keep
, reverse
, functionbody
);
1617 /* Delete the node BLOCK from the current binding level.
1618 This is used for the block inside a stmt expr ({...})
1619 so that the block can be reinserted where appropriate. */
1622 delete_block (block
)
1626 if (current_binding_level
->blocks
== block
)
1627 current_binding_level
->blocks
= TREE_CHAIN (block
);
1628 for (t
= current_binding_level
->blocks
; t
;)
1630 if (TREE_CHAIN (t
) == block
)
1631 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1635 TREE_CHAIN (block
) = NULL_TREE
;
1636 /* Clear TREE_USED which is always set by poplevel.
1637 The flag is set again if insert_block is called. */
1638 TREE_USED (block
) = 0;
1641 /* Insert BLOCK at the end of the list of subblocks of the
1642 current binding level. This is used when a BIND_EXPR is expanded,
1643 to handle the BLOCK node inside the BIND_EXPR. */
1646 insert_block (block
)
1649 TREE_USED (block
) = 1;
1650 current_binding_level
->blocks
1651 = chainon (current_binding_level
->blocks
, block
);
1654 /* Set the BLOCK node for the innermost scope
1655 (the one we are currently in). */
1659 register tree block
;
1661 current_binding_level
->this_block
= block
;
1664 /* Do a pushlevel for class declarations. */
1669 register struct binding_level
*newlevel
;
1671 /* Reuse or create a struct for this binding level. */
1672 #if defined(DEBUG_CP_BINDING_LEVELS)
1674 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1675 if (free_binding_level
)
1676 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1678 newlevel
= free_binding_level
;
1679 free_binding_level
= free_binding_level
->level_chain
;
1682 newlevel
= make_binding_level ();
1684 #if defined(DEBUG_CP_BINDING_LEVELS)
1686 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1688 push_binding_level (newlevel
, 0, 0);
1690 class_binding_level
= current_binding_level
;
1691 class_binding_level
->parm_flag
= 2;
1692 class_binding_level
->this_class
= current_class_type
;
1695 /* ...and a poplevel for class declarations. */
1700 register struct binding_level
*level
= class_binding_level
;
1703 my_friendly_assert (level
!= 0, 354);
1705 /* If we're leaving a toplevel class, don't bother to do the setting
1706 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1707 shouldn't even be used when current_class_type isn't set, and second,
1708 if we don't touch it here, we're able to use the cache effect if the
1709 next time we're entering a class scope, it is the same class. */
1710 if (current_class_depth
!= 1)
1712 struct binding_level
* b
;
1714 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1715 for (shadowed
= level
->class_shadowed
;
1717 shadowed
= TREE_CHAIN (shadowed
))
1718 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = NULL_TREE
;
1720 /* Find the next enclosing class, and recreate
1721 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1722 b
= level
->level_chain
;
1723 while (b
&& b
->parm_flag
!= 2)
1727 for (shadowed
= b
->class_shadowed
;
1729 shadowed
= TREE_CHAIN (shadowed
))
1733 t
= IDENTIFIER_BINDING (TREE_PURPOSE (shadowed
));
1734 while (t
&& BINDING_LEVEL (t
) != b
)
1738 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
))
1739 = BINDING_VALUE (t
);
1743 /* Remember to save what IDENTIFIER's were bound in this scope so we
1744 can recover from cache misses. */
1746 previous_class_type
= current_class_type
;
1747 previous_class_values
= class_binding_level
->class_shadowed
;
1749 for (shadowed
= level
->type_shadowed
;
1751 shadowed
= TREE_CHAIN (shadowed
))
1752 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1754 /* Remove the bindings for all of the class-level declarations. */
1755 for (shadowed
= level
->class_shadowed
;
1757 shadowed
= TREE_CHAIN (shadowed
))
1758 pop_binding (TREE_PURPOSE (shadowed
), TREE_TYPE (shadowed
));
1760 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1761 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1762 class_binding_level
->parm_flag
,
1763 class_binding_level
->keep
);
1765 /* Now, pop out of the binding level which we created up in the
1766 `pushlevel_class' routine. */
1767 #if defined(DEBUG_CP_BINDING_LEVELS)
1769 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1771 pop_binding_level ();
1774 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1775 for any names in enclosing classes. */
1778 clear_identifier_class_values ()
1782 if (!class_binding_level
)
1785 for (t
= class_binding_level
->class_shadowed
;
1788 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
1791 /* Returns non-zero if T is a virtual function table. */
1794 vtable_decl_p (t
, data
)
1796 void *data ATTRIBUTE_UNUSED
;
1798 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
1801 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1805 vtype_decl_p (t
, data
)
1807 void *data ATTRIBUTE_UNUSED
;
1809 return (TREE_CODE (t
) == TYPE_DECL
1810 && TREE_CODE (TREE_TYPE (t
)) == RECORD_TYPE
1811 && TYPE_POLYMORPHIC_P (TREE_TYPE (t
)));
1814 /* Return the declarations that are members of the namespace NS. */
1817 cp_namespace_decls (ns
)
1820 return NAMESPACE_LEVEL (ns
)->names
;
1823 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1824 itself, calling F for each. The DATA is passed to F as well. */
1827 walk_namespaces_r (namespace, f
, data
)
1829 walk_namespaces_fn f
;
1835 result
|= (*f
) (namespace, data
);
1837 for (current
= cp_namespace_decls (namespace);
1839 current
= TREE_CHAIN (current
))
1841 if (TREE_CODE (current
) != NAMESPACE_DECL
1842 || DECL_NAMESPACE_ALIAS (current
))
1844 if (!DECL_LANG_SPECIFIC (current
))
1847 my_friendly_assert (current
== std_node
, 393);
1851 /* We found a namespace. */
1852 result
|= walk_namespaces_r (current
, f
, data
);
1858 /* Walk all the namespaces, calling F for each. The DATA is passed to
1862 walk_namespaces (f
, data
)
1863 walk_namespaces_fn f
;
1866 return walk_namespaces_r (global_namespace
, f
, data
);
1869 struct walk_globals_data
{
1870 walk_globals_pred p
;
1875 /* Walk the global declarations in NAMESPACE. Whenever one is found
1876 for which P returns non-zero, call F with its address. If any call
1877 to F returns a non-zero value, return a non-zero value. */
1880 walk_globals_r (namespace, data
)
1884 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1885 walk_globals_pred p
= wgd
->p
;
1886 walk_globals_fn f
= wgd
->f
;
1887 void *d
= wgd
->data
;
1891 t
= &NAMESPACE_LEVEL (namespace)->names
;
1898 result
|= (*f
) (t
, d
);
1900 /* If F changed *T, then *T still points at the next item to
1903 t
= &TREE_CHAIN (*t
);
1909 /* Walk the global declarations. Whenever one is found for which P
1910 returns non-zero, call F with its address. If any call to F
1911 returns a non-zero value, return a non-zero value. */
1914 walk_globals (p
, f
, data
)
1915 walk_globals_pred p
;
1919 struct walk_globals_data wgd
;
1924 return walk_namespaces (walk_globals_r
, &wgd
);
1927 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1928 DATA is non-NULL, this is the last time we will call
1929 wrapup_global_declarations for this NAMESPACE. */
1932 wrapup_globals_for_namespace (namespace, data
)
1936 tree globals
= cp_namespace_decls (namespace);
1937 int len
= list_length (globals
);
1938 tree
*vec
= (tree
*) alloca (sizeof (tree
) * len
);
1942 int last_time
= (data
!= 0);
1944 if (last_time
&& namespace == global_namespace
)
1945 /* Let compile_file handle the global namespace. */
1948 /* Process the decls in reverse order--earliest first.
1949 Put them into VEC from back to front, then take out from front. */
1951 for (i
= 0, decl
= globals
; i
< len
; i
++, decl
= TREE_CHAIN (decl
))
1953 /* Pretend we've output an unused static variable. This ensures
1954 that the toplevel __FUNCTION__ etc won't be emitted, unless
1956 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_ARTIFICIAL (decl
)
1957 && !TREE_PUBLIC (decl
) && !TREE_USED (decl
))
1959 TREE_ASM_WRITTEN (decl
) = 1;
1960 DECL_IGNORED_P (decl
) = 1;
1962 vec
[len
- i
- 1] = decl
;
1967 check_global_declarations (vec
, len
);
1971 /* Temporarily mark vtables as external. That prevents
1972 wrapup_global_declarations from writing them out; we must process
1973 them ourselves in finish_vtable_vardecl. */
1974 for (i
= 0; i
< len
; ++i
)
1975 if (vtable_decl_p (vec
[i
], /*data=*/0) && !DECL_EXTERNAL (vec
[i
]))
1977 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 1;
1978 DECL_EXTERNAL (vec
[i
]) = 1;
1981 /* Write out any globals that need to be output. */
1982 result
= wrapup_global_declarations (vec
, len
);
1984 /* Undo the hack to DECL_EXTERNAL above. */
1985 for (i
= 0; i
< len
; ++i
)
1986 if (vtable_decl_p (vec
[i
], /*data=*/0)
1987 && DECL_NOT_REALLY_EXTERN (vec
[i
]))
1989 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 0;
1990 DECL_EXTERNAL (vec
[i
]) = 0;
1997 /* Mark ARG (which is really a struct binding_level **) for GC. */
2000 mark_binding_level (arg
)
2003 struct binding_level
*lvl
= *(struct binding_level
**)arg
;
2005 for (; lvl
; lvl
= lvl
->level_chain
)
2007 ggc_mark_tree (lvl
->names
);
2008 ggc_mark_tree (lvl
->tags
);
2009 ggc_mark_tree (lvl
->usings
);
2010 ggc_mark_tree (lvl
->using_directives
);
2011 ggc_mark_tree (lvl
->class_shadowed
);
2012 ggc_mark_tree (lvl
->type_shadowed
);
2013 ggc_mark_tree (lvl
->shadowed_labels
);
2014 ggc_mark_tree (lvl
->blocks
);
2015 ggc_mark_tree (lvl
->this_block
);
2016 ggc_mark_tree (lvl
->this_class
);
2017 ggc_mark_tree (lvl
->incomplete
);
2018 ggc_mark_tree (lvl
->dead_vars_from_for
);
2023 mark_named_label_lists (labs
, uses
)
2027 struct named_label_list
*l
= *(struct named_label_list
**)labs
;
2028 struct named_label_use_list
*u
= *(struct named_label_use_list
**)uses
;
2030 for (; l
; l
= l
->next
)
2033 mark_binding_level (l
->binding_level
);
2034 ggc_mark_tree (l
->old_value
);
2035 ggc_mark_tree (l
->label_decl
);
2036 ggc_mark_tree (l
->bad_decls
);
2039 for (; u
; u
= u
->next
)
2043 /* For debugging. */
2044 static int no_print_functions
= 0;
2045 static int no_print_builtins
= 0;
2048 print_binding_level (lvl
)
2049 struct binding_level
*lvl
;
2053 fprintf (stderr
, " blocks=");
2054 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
2055 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
2056 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
2057 if (lvl
->tag_transparent
)
2058 fprintf (stderr
, " tag-transparent");
2059 if (lvl
->more_cleanups_ok
)
2060 fprintf (stderr
, " more-cleanups-ok");
2061 if (lvl
->have_cleanups
)
2062 fprintf (stderr
, " have-cleanups");
2063 fprintf (stderr
, "\n");
2066 fprintf (stderr
, " names:\t");
2067 /* We can probably fit 3 names to a line? */
2068 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
2070 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
2072 if (no_print_builtins
2073 && (TREE_CODE (t
) == TYPE_DECL
)
2074 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
2077 /* Function decls tend to have longer names. */
2078 if (TREE_CODE (t
) == FUNCTION_DECL
)
2085 fprintf (stderr
, "\n\t");
2088 print_node_brief (stderr
, "", t
, 0);
2089 if (t
== error_mark_node
)
2093 fprintf (stderr
, "\n");
2097 fprintf (stderr
, " tags:\t");
2099 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
2101 if (TREE_PURPOSE (t
) == NULL_TREE
)
2103 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2110 fprintf (stderr
, "\n\t");
2113 if (TREE_PURPOSE (t
) == NULL_TREE
)
2115 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
2116 fprintf (stderr
, ">");
2118 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2119 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2122 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
2123 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2124 fprintf (stderr
, ">");
2128 fprintf (stderr
, "\n");
2130 if (lvl
->class_shadowed
)
2132 fprintf (stderr
, " class-shadowed:");
2133 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
2135 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2137 fprintf (stderr
, "\n");
2139 if (lvl
->type_shadowed
)
2141 fprintf (stderr
, " type-shadowed:");
2142 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2144 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2146 fprintf (stderr
, "\n");
2151 print_other_binding_stack (stack
)
2152 struct binding_level
*stack
;
2154 struct binding_level
*level
;
2155 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
2157 fprintf (stderr
, "binding level ");
2158 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
2159 fprintf (stderr
, "\n");
2160 print_binding_level (level
);
2165 print_binding_stack ()
2167 struct binding_level
*b
;
2168 fprintf (stderr
, "current_binding_level=");
2169 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
2170 fprintf (stderr
, "\nclass_binding_level=");
2171 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
2172 fprintf (stderr
, "\nglobal_binding_level=");
2173 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
2174 fprintf (stderr
, "\n");
2175 if (class_binding_level
)
2177 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
2178 if (b
== current_binding_level
)
2181 b
= class_binding_level
;
2183 b
= current_binding_level
;
2186 b
= current_binding_level
;
2187 print_other_binding_stack (b
);
2188 fprintf (stderr
, "global:\n");
2189 print_binding_level (global_binding_level
);
2192 /* Namespace binding access routines: The namespace_bindings field of
2193 the identifier is polymorphic, with three possible values:
2194 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2195 indicating the BINDING_VALUE of global_namespace. */
2197 /* Check whether the a binding for the name to scope is known.
2198 Assumes that the bindings of the name are already a list
2199 of bindings. Returns the binding found, or NULL_TREE. */
2202 find_binding (name
, scope
)
2206 tree iter
, prev
= NULL_TREE
;
2208 scope
= ORIGINAL_NAMESPACE (scope
);
2210 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
2211 iter
= TREE_CHAIN (iter
))
2213 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
2214 if (BINDING_SCOPE (iter
) == scope
)
2216 /* Move binding found to the front of the list, so
2217 subsequent lookups will find it faster. */
2220 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
2221 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
2222 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
2231 /* Always returns a binding for name in scope. If the
2232 namespace_bindings is not a list, convert it to one first.
2233 If no binding is found, make a new one. */
2236 binding_for_name (name
, scope
)
2240 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2243 scope
= ORIGINAL_NAMESPACE (scope
);
2245 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
2247 /* Get rid of optimization for global scope. */
2248 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
2249 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
2250 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2252 if (b
&& (result
= find_binding (name
, scope
)))
2254 /* Not found, make a new one. */
2255 result
= make_node (CPLUS_BINDING
);
2256 TREE_CHAIN (result
) = b
;
2257 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2258 BINDING_SCOPE (result
) = scope
;
2259 BINDING_TYPE (result
) = NULL_TREE
;
2260 BINDING_VALUE (result
) = NULL_TREE
;
2264 /* Return the binding value for name in scope, considering that
2265 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2268 namespace_binding (name
, scope
)
2272 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2275 if (scope
== NULL_TREE
)
2276 scope
= global_namespace
;
2277 if (TREE_CODE (b
) != CPLUS_BINDING
)
2278 return (scope
== global_namespace
) ? b
: NULL_TREE
;
2279 name
= find_binding (name
,scope
);
2280 if (name
== NULL_TREE
)
2282 return BINDING_VALUE (name
);
2285 /* Set the binding value for name in scope. If modifying the binding
2286 of global_namespace is attempted, try to optimize it. */
2289 set_namespace_binding (name
, scope
, val
)
2296 if (scope
== NULL_TREE
)
2297 scope
= global_namespace
;
2299 if (scope
== global_namespace
)
2301 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2302 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
2304 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
2308 b
= binding_for_name (name
, scope
);
2309 BINDING_VALUE (b
) = val
;
2312 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2313 select a name that is unique to this compilation unit. */
2316 push_namespace (name
)
2321 int implicit_use
= 0;
2323 if (!global_namespace
)
2325 /* This must be ::. */
2326 my_friendly_assert (name
== get_identifier ("::"), 377);
2331 /* The name of anonymous namespace is unique for the translation
2333 if (!anonymous_namespace_name
)
2334 anonymous_namespace_name
= get_file_function_name ('N');
2335 name
= anonymous_namespace_name
;
2336 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2338 /* Reopening anonymous namespace. */
2342 else if (current_namespace
== global_namespace
2343 && name
== DECL_NAME (std_node
))
2350 /* Check whether this is an extended namespace definition. */
2351 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2352 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
2355 if (DECL_NAMESPACE_ALIAS (d
))
2357 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2358 d
, DECL_NAMESPACE_ALIAS (d
));
2359 d
= DECL_NAMESPACE_ALIAS (d
);
2366 /* Make a new namespace, binding the name to it. */
2367 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
2368 /* The global namespace is not pushed, and the global binding
2369 level is set elsewhere. */
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 strict_prototype
= strict_prototypes_lang_cplusplus
;
2592 current_namespace
= global_namespace
;
2596 push_to_top_level ()
2598 maybe_push_to_top_level (0);
2602 pop_from_top_level ()
2604 struct saved_scope
*s
= scope_chain
;
2607 /* Clear out class-level bindings cache. */
2608 if (previous_class_type
)
2609 invalidate_class_lookup_cache ();
2611 VARRAY_FREE (current_lang_base
);
2613 scope_chain
= s
->prev
;
2614 for (t
= s
->old_bindings
; t
; t
= TREE_CHAIN (t
))
2616 tree id
= TREE_VEC_ELT (t
, 0);
2619 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2620 IDENTIFIER_BINDING (id
) = TREE_VEC_ELT (t
, 2);
2621 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2625 if (current_lang_name
== lang_name_cplusplus
)
2626 strict_prototype
= strict_prototypes_lang_cplusplus
;
2627 else if (current_lang_name
== lang_name_c
)
2628 strict_prototype
= strict_prototypes_lang_c
;
2630 /* If we were in the middle of compiling a function, restore our
2632 if (s
->need_pop_function_context
)
2633 pop_function_context_from (NULL_TREE
);
2634 current_function_decl
= s
->function_decl
;
2639 /* Push a definition of struct, union or enum tag "name".
2640 into binding_level "b". "type" should be the type node,
2641 We assume that the tag "name" is not already defined.
2643 Note that the definition may really be just a forward reference.
2644 In that case, the TYPE_SIZE will be a NULL_TREE.
2646 C++ gratuitously puts all these tags in the name space. */
2648 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2649 record the shadowed value for this binding contour. TYPE is
2650 the type that ID maps to. */
2653 set_identifier_type_value_with_scope (id
, type
, b
)
2656 struct binding_level
*b
;
2658 if (!b
->namespace_p
)
2660 /* Shadow the marker, not the real thing, so that the marker
2661 gets restored later. */
2662 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2664 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2668 tree binding
= binding_for_name (id
, current_namespace
);
2669 BINDING_TYPE (binding
) = type
;
2670 /* Store marker instead of real type. */
2671 type
= global_type_node
;
2673 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2676 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2679 set_identifier_type_value (id
, type
)
2683 set_identifier_type_value_with_scope (id
, type
, current_binding_level
);
2686 /* Return the type associated with id. */
2689 identifier_type_value (id
)
2692 /* There is no type with that name, anywhere. */
2693 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2695 /* This is not the type marker, but the real thing. */
2696 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2697 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2698 /* Have to search for it. It must be on the global level, now.
2699 Ask lookup_name not to return non-types. */
2700 id
= lookup_name_real (id
, 2, 1, 0);
2702 return TREE_TYPE (id
);
2706 /* Pop off extraneous binding levels left over due to syntax errors.
2708 We don't pop past namespaces, as they might be valid. */
2713 #ifdef DEBUG_CP_BINDING_LEVELS
2714 fprintf (stderr
, "XXX entering pop_everything ()\n");
2716 while (!toplevel_bindings_p ())
2718 if (current_binding_level
->parm_flag
== 2)
2719 pop_nested_class ();
2723 #ifdef DEBUG_CP_BINDING_LEVELS
2724 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2728 /* The type TYPE is being declared. If it is a class template, or a
2729 specialization of a class template, do any processing required and
2730 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2731 being declared a friend. B is the binding level at which this TYPE
2734 Returns the TYPE_DECL for TYPE, which may have been altered by this
2738 maybe_process_template_type_declaration (type
, globalize
, b
)
2741 struct binding_level
* b
;
2743 tree decl
= TYPE_NAME (type
);
2745 if (processing_template_parmlist
)
2746 /* You can't declare a new template type in a template parameter
2747 list. But, you can declare a non-template type:
2749 template <class A*> struct S;
2751 is a forward-declaration of `A'. */
2755 maybe_check_template_type (type
);
2757 my_friendly_assert (IS_AGGR_TYPE (type
)
2758 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2761 if (processing_template_decl
)
2763 /* This may change after the call to
2764 push_template_decl_real, but we want the original value. */
2765 tree name
= DECL_NAME (decl
);
2767 decl
= push_template_decl_real (decl
, globalize
);
2768 /* If the current binding level is the binding level for the
2769 template parameters (see the comment in
2770 begin_template_parm_list) and the enclosing level is a class
2771 scope, and we're not looking at a friend, push the
2772 declaration of the member class into the class scope. In the
2773 friend case, push_template_decl will already have put the
2774 friend into global scope, if appropriate. */
2775 if (TREE_CODE (type
) != ENUMERAL_TYPE
2776 && !globalize
&& b
->template_parms_p
2777 && b
->level_chain
->parm_flag
== 2)
2779 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2780 /* Put this tag on the list of tags for the class, since
2781 that won't happen below because B is not the class
2782 binding level, but is instead the pseudo-global level. */
2783 b
->level_chain
->tags
=
2784 tree_cons (name
, type
, b
->level_chain
->tags
);
2785 if (!COMPLETE_TYPE_P (current_class_type
))
2786 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2794 /* In C++, you don't have to write `struct S' to refer to `S'; you
2795 can just use `S'. We accomplish this by creating a TYPE_DECL as
2796 if the user had written `typedef struct S S'. Create and return
2797 the TYPE_DECL for TYPE. */
2800 create_implicit_typedef (name
, type
)
2806 decl
= build_decl (TYPE_DECL
, name
, type
);
2807 SET_DECL_ARTIFICIAL (decl
);
2808 /* There are other implicit type declarations, like the one *within*
2809 a class that allows you to write `S::S'. We must distinguish
2811 SET_DECL_IMPLICIT_TYPEDEF_P (decl
);
2812 TYPE_NAME (type
) = decl
;
2817 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2818 Normally put it into the inner-most non-tag-transparent scope,
2819 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2820 The latter is needed for implicit declarations. */
2823 pushtag (name
, type
, globalize
)
2827 register struct binding_level
*b
;
2829 b
= current_binding_level
;
2830 while (b
->tag_transparent
2831 || (globalize
&& b
->parm_flag
== 2))
2834 b
->tags
= tree_cons (name
, type
, b
->tags
);
2838 /* Do C++ gratuitous typedefing. */
2839 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2841 register tree d
= NULL_TREE
;
2843 tree context
= TYPE_CONTEXT (type
);
2847 tree cs
= current_scope ();
2851 else if (cs
!= NULL_TREE
&& TYPE_P (cs
))
2852 /* When declaring a friend class of a local class, we want
2853 to inject the newly named class into the scope
2854 containing the local class, not the namespace scope. */
2855 context
= decl_function_context (get_type_decl (cs
));
2858 context
= current_namespace
;
2860 if ((b
->template_parms_p
&& b
->level_chain
->parm_flag
== 2)
2861 || b
->parm_flag
== 2)
2864 if (current_lang_name
== lang_name_java
)
2865 TYPE_FOR_JAVA (type
) = 1;
2867 d
= create_implicit_typedef (name
, type
);
2868 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2870 set_identifier_type_value_with_scope (name
, type
, b
);
2872 d
= maybe_process_template_type_declaration (type
,
2875 if (b
->parm_flag
== 2)
2877 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2878 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2879 class. But if it's a member template class, we
2880 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2882 finish_member_declaration (d
);
2884 pushdecl_class_level (d
);
2887 d
= pushdecl_with_scope (d
, b
);
2889 if (ANON_AGGRNAME_P (name
))
2890 DECL_IGNORED_P (d
) = 1;
2892 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2893 DECL_ASSEMBLER_NAME (d
) = DECL_NAME (d
);
2895 /* If this is a local class, keep track of it. We need this
2896 information for name-mangling, and so that it is possible to find
2897 all function definitions in a translation unit in a convenient
2898 way. (It's otherwise tricky to find a member function definition
2899 it's only pointed to from within a local class.) */
2900 if (TYPE_CONTEXT (type
)
2901 && TREE_CODE (TYPE_CONTEXT (type
)) == FUNCTION_DECL
)
2902 VARRAY_PUSH_TREE (local_classes
, type
);
2904 if (!uses_template_parms (type
))
2907 DECL_ASSEMBLER_NAME (d
) = mangle_type (type
);
2909 DECL_ASSEMBLER_NAME (d
)
2910 = get_identifier (build_overload_name (type
, 1, 1));
2913 if (b
->parm_flag
== 2)
2915 if (!COMPLETE_TYPE_P (current_class_type
))
2916 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2920 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2921 /* Use the canonical TYPE_DECL for this node. */
2922 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2925 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2926 will be the tagged type we just added to the current
2927 binding level. This fake NULL-named TYPE_DECL node helps
2928 dwarfout.c to know when it needs to output a
2929 representation of a tagged type, and it also gives us a
2930 convenient place to record the "scope start" address for
2933 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2934 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2938 /* Counter used to create anonymous type names. */
2940 static int anon_cnt
= 0;
2942 /* Return an IDENTIFIER which can be used as a name for
2943 anonymous structs and unions. */
2950 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2951 return get_identifier (buf
);
2954 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2955 This keeps dbxout from getting confused. */
2960 register struct binding_level
*b
;
2962 static int last_cnt
= 0;
2964 /* Fast out if no new anon names were declared. */
2965 if (last_cnt
== anon_cnt
)
2968 b
= current_binding_level
;
2969 while (b
->tag_transparent
)
2974 /* A NULL purpose means we have already processed all tags
2975 from here to the end of the list. */
2976 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2978 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2979 TREE_PURPOSE (tags
) = NULL_TREE
;
2980 tags
= TREE_CHAIN (tags
);
2982 last_cnt
= anon_cnt
;
2985 /* Subroutine of duplicate_decls: return truthvalue of whether
2986 or not types of these decls match.
2988 For C++, we must compare the parameter list so that `int' can match
2989 `int&' in a parameter position, but `int&' is not confused with
2993 decls_match (newdecl
, olddecl
)
2994 tree newdecl
, olddecl
;
2998 if (newdecl
== olddecl
)
3001 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
3002 /* If the two DECLs are not even the same kind of thing, we're not
3003 interested in their types. */
3006 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3008 tree f1
= TREE_TYPE (newdecl
);
3009 tree f2
= TREE_TYPE (olddecl
);
3010 tree p1
= TYPE_ARG_TYPES (f1
);
3011 tree p2
= TYPE_ARG_TYPES (f2
);
3013 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
)
3014 && ! (DECL_EXTERN_C_P (newdecl
)
3015 && DECL_EXTERN_C_P (olddecl
)))
3018 if (TREE_CODE (f1
) != TREE_CODE (f2
))
3021 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
3023 if ((! strict_prototypes_lang_c
|| DECL_BUILT_IN (olddecl
))
3024 && DECL_EXTERN_C_P (olddecl
)
3027 types_match
= self_promoting_args_p (p1
);
3028 if (p1
== void_list_node
)
3029 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
3031 else if (!strict_prototypes_lang_c
3032 && DECL_EXTERN_C_P (olddecl
)
3033 && DECL_EXTERN_C_P (newdecl
)
3036 types_match
= self_promoting_args_p (p2
);
3037 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
3040 types_match
= compparms (p1
, p2
);
3045 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3047 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3048 DECL_TEMPLATE_PARMS (olddecl
)))
3051 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3054 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
3055 DECL_TEMPLATE_RESULT (newdecl
));
3059 if (TREE_TYPE (newdecl
) == error_mark_node
)
3060 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
3061 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
3062 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
3063 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
3066 types_match
= comptypes (TREE_TYPE (newdecl
),
3067 TREE_TYPE (olddecl
),
3068 COMPARE_REDECLARATION
);
3074 /* If NEWDECL is `static' and an `extern' was seen previously,
3075 warn about it. OLDDECL is the previous declaration.
3077 Note that this does not apply to the C++ case of declaring
3078 a variable `extern const' and then later `const'.
3080 Don't complain about built-in functions, since they are beyond
3081 the user's control. */
3084 warn_extern_redeclared_static (newdecl
, olddecl
)
3085 tree newdecl
, olddecl
;
3087 static const char *explicit_extern_static_warning
3088 = "`%D' was declared `extern' and later `static'";
3089 static const char *implicit_extern_static_warning
3090 = "`%D' was declared implicitly `extern' and later `static'";
3094 if (TREE_CODE (newdecl
) == TYPE_DECL
3095 || TREE_CODE (newdecl
) == TEMPLATE_DECL
3096 || TREE_CODE (newdecl
) == CONST_DECL
)
3099 /* Don't get confused by static member functions; that's a different
3101 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3102 && DECL_STATIC_FUNCTION_P (newdecl
))
3105 /* If the old declaration was `static', or the new one isn't, then
3106 then everything is OK. */
3107 if (DECL_THIS_STATIC (olddecl
) || !DECL_THIS_STATIC (newdecl
))
3110 /* It's OK to declare a builtin function as `static'. */
3111 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3112 && DECL_ARTIFICIAL (olddecl
))
3115 name
= DECL_ASSEMBLER_NAME (newdecl
);
3116 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
3117 ? implicit_extern_static_warning
3118 : explicit_extern_static_warning
, newdecl
);
3119 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
3122 /* Handle when a new declaration NEWDECL has the same name as an old
3123 one OLDDECL in the same binding contour. Prints an error message
3126 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
3127 Otherwise, return 0. */
3130 duplicate_decls (newdecl
, olddecl
)
3131 tree newdecl
, olddecl
;
3133 unsigned olddecl_uid
= DECL_UID (olddecl
);
3134 int olddecl_friend
= 0, types_match
= 0;
3135 int new_defines_function
= 0;
3137 if (newdecl
== olddecl
)
3140 types_match
= decls_match (newdecl
, olddecl
);
3142 /* If either the type of the new decl or the type of the old decl is an
3143 error_mark_node, then that implies that we have already issued an
3144 error (earlier) for some bogus type specification, and in that case,
3145 it is rather pointless to harass the user with yet more error message
3146 about the same declaration, so just pretend the types match here. */
3147 if (TREE_TYPE (newdecl
) == error_mark_node
3148 || TREE_TYPE (olddecl
) == error_mark_node
)
3151 /* Check for redeclaration and other discrepancies. */
3152 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3153 && DECL_ARTIFICIAL (olddecl
))
3155 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
3157 /* If you declare a built-in or predefined function name as static,
3158 the old definition is overridden, but optionally warn this was a
3159 bad choice of name. */
3160 if (! TREE_PUBLIC (newdecl
))
3163 cp_warning ("shadowing %s function `%#D'",
3164 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3166 /* Discard the old built-in function. */
3169 /* If the built-in is not ansi, then programs can override
3170 it even globally without an error. */
3171 else if (! DECL_BUILT_IN (olddecl
))
3172 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
3176 cp_error ("declaration of `%#D'", newdecl
);
3177 cp_error ("conflicts with built-in declaration `%#D'",
3182 else if (!types_match
)
3184 if ((DECL_EXTERN_C_P (newdecl
)
3185 && DECL_EXTERN_C_P (olddecl
))
3186 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3187 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3189 /* A near match; override the builtin. */
3191 if (TREE_PUBLIC (newdecl
))
3193 cp_warning ("new declaration `%#D'", newdecl
);
3194 cp_warning ("ambiguates built-in declaration `%#D'",
3197 else if (warn_shadow
)
3198 cp_warning ("shadowing %s function `%#D'",
3199 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3203 /* Discard the old built-in function. */
3207 if (DECL_THIS_STATIC (newdecl
) && !DECL_THIS_STATIC (olddecl
))
3209 /* If a builtin function is redeclared as `static', merge
3210 the declarations, but make the original one static. */
3211 DECL_THIS_STATIC (olddecl
) = 1;
3212 TREE_PUBLIC (olddecl
) = 0;
3214 /* Make the old declaration consistent with the new one so
3215 that all remnants of the builtin-ness of this function
3216 will be banished. */
3217 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3218 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3219 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3220 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (newdecl
),
3224 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3226 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3227 && TREE_CODE (newdecl
) != TYPE_DECL
3228 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3229 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3230 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3231 && TREE_CODE (olddecl
) != TYPE_DECL
3232 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3233 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3236 /* We do nothing special here, because C++ does such nasty
3237 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3238 get shadowed, and know that if we need to find a TYPE_DECL
3239 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3240 slot of the identifier. */
3244 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3245 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3246 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3247 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3250 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
3251 if (TREE_CODE (olddecl
) == TREE_LIST
)
3252 olddecl
= TREE_VALUE (olddecl
);
3253 cp_error_at ("previous declaration of `%#D'", olddecl
);
3255 /* New decl is completely inconsistent with the old one =>
3256 tell caller to replace the old one. */
3260 else if (!types_match
)
3262 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
))
3263 /* These are certainly not duplicate declarations; they're
3264 from different scopes. */
3267 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3269 /* The name of a class template may not be declared to refer to
3270 any other template, class, function, object, namespace, value,
3271 or type in the same scope. */
3272 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3273 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3275 cp_error ("declaration of template `%#D'", newdecl
);
3276 cp_error_at ("conflicts with previous declaration `%#D'",
3279 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3280 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3281 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3282 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3283 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3284 DECL_TEMPLATE_PARMS (olddecl
)))
3286 cp_error ("new declaration `%#D'", newdecl
);
3287 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3291 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3293 if (DECL_EXTERN_C_P (newdecl
) && DECL_EXTERN_C_P (olddecl
))
3295 cp_error ("declaration of C function `%#D' conflicts with",
3297 cp_error_at ("previous declaration `%#D' here", olddecl
);
3299 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3300 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3302 cp_error ("new declaration `%#D'", newdecl
);
3303 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3309 /* Already complained about this, so don't do so again. */
3310 else if (current_class_type
== NULL_TREE
3311 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3313 cp_error ("conflicting types for `%#D'", newdecl
);
3314 cp_error_at ("previous declaration as `%#D'", olddecl
);
3317 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3318 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3319 && (!DECL_TEMPLATE_INFO (newdecl
)
3320 || (DECL_TI_TEMPLATE (newdecl
)
3321 != DECL_TI_TEMPLATE (olddecl
))))
3322 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3323 && (!DECL_TEMPLATE_INFO (olddecl
)
3324 || (DECL_TI_TEMPLATE (olddecl
)
3325 != DECL_TI_TEMPLATE (newdecl
))))))
3326 /* It's OK to have a template specialization and a non-template
3327 with the same type, or to have specializations of two
3328 different templates with the same type. Note that if one is a
3329 specialization, and the other is an instantiation of the same
3330 template, that we do not exit at this point. That situation
3331 can occur if we instantiate a template class, and then
3332 specialize one of its methods. This situation is legal, but
3333 the declarations must be merged in the usual way. */
3335 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3336 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3337 && !DECL_USE_TEMPLATE (newdecl
))
3338 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3339 && !DECL_USE_TEMPLATE (olddecl
))))
3340 /* One of the declarations is a template instantiation, and the
3341 other is not a template at all. That's OK. */
3343 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3344 && DECL_NAMESPACE_ALIAS (newdecl
)
3345 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3346 /* Redeclaration of namespace alias, ignore it. */
3350 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3353 cp_error (errmsg
, newdecl
);
3354 if (DECL_NAME (olddecl
) != NULL_TREE
)
3355 cp_error_at ((DECL_INITIAL (olddecl
)
3356 && namespace_bindings_p ())
3357 ? "`%#D' previously defined here"
3358 : "`%#D' previously declared here", olddecl
);
3360 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3361 && DECL_INITIAL (olddecl
) != NULL_TREE
3362 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3363 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3365 /* Prototype decl follows defn w/o prototype. */
3366 cp_warning_at ("prototype for `%#D'", newdecl
);
3367 cp_warning_at ("follows non-prototype definition here", olddecl
);
3369 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3370 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3372 /* extern "C" int foo ();
3373 int foo () { bar (); }
3375 if (current_lang_stack
3376 == &VARRAY_TREE (current_lang_base
, 0))
3377 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3380 cp_error_at ("previous declaration of `%#D' with %L linkage",
3381 olddecl
, DECL_LANGUAGE (olddecl
));
3382 cp_error ("conflicts with new declaration with %L linkage",
3383 DECL_LANGUAGE (newdecl
));
3387 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3389 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3391 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3392 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3395 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3396 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3398 for (; t1
&& t1
!= void_list_node
;
3399 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3400 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3402 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3407 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3409 cp_pedwarn_at ("after previous specification in `%#D'",
3415 cp_error ("default argument given for parameter %d of `%#D'",
3417 cp_error_at ("after previous specification in `%#D'",
3422 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
3423 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3425 cp_warning ("`%#D' was used before it was declared inline",
3427 cp_warning_at ("previous non-inline declaration here",
3433 /* If new decl is `static' and an `extern' was seen previously,
3435 warn_extern_redeclared_static (newdecl
, olddecl
);
3437 /* We have committed to returning 1 at this point. */
3438 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3440 /* Now that functions must hold information normally held
3441 by field decls, there is extra work to do so that
3442 declaration information does not get destroyed during
3444 if (DECL_VINDEX (olddecl
))
3445 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3446 if (DECL_VIRTUAL_CONTEXT (olddecl
))
3447 DECL_VIRTUAL_CONTEXT (newdecl
) = DECL_VIRTUAL_CONTEXT (olddecl
);
3448 if (DECL_CONTEXT (olddecl
))
3449 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3450 if (DECL_PENDING_INLINE_INFO (newdecl
) == (struct pending_inline
*)0)
3451 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3452 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3453 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3454 DECL_PURE_VIRTUAL_P (newdecl
) |= DECL_PURE_VIRTUAL_P (olddecl
);
3455 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3456 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3457 DECL_THIS_STATIC (newdecl
) |= DECL_THIS_STATIC (olddecl
);
3458 DECL_LANG_SPECIFIC (newdecl
)->u2
= DECL_LANG_SPECIFIC (olddecl
)->u2
;
3459 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3461 /* Optionally warn about more than one declaration for the same
3462 name, but don't warn about a function declaration followed by a
3464 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3465 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3466 /* Don't warn about extern decl followed by definition. */
3467 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3468 /* Don't warn about friends, let add_friend take care of it. */
3469 && ! DECL_FRIEND_P (newdecl
))
3471 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3472 cp_warning_at ("previous declaration of `%D'", olddecl
);
3476 /* Deal with C++: must preserve virtual function table size. */
3477 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3479 register tree newtype
= TREE_TYPE (newdecl
);
3480 register tree oldtype
= TREE_TYPE (olddecl
);
3482 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3483 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3485 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3486 CLASSTYPE_FRIEND_CLASSES (newtype
)
3487 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3491 /* Copy all the DECL_... slots specified in the new decl
3492 except for any that we copy here from the old type. */
3493 DECL_MACHINE_ATTRIBUTES (newdecl
)
3494 = merge_machine_decl_attributes (olddecl
, newdecl
);
3496 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3498 if (! duplicate_decls (DECL_TEMPLATE_RESULT (newdecl
),
3499 DECL_TEMPLATE_RESULT (olddecl
)))
3500 cp_error ("invalid redeclaration of %D", newdecl
);
3501 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3502 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3503 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3504 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3511 /* Automatically handles default parameters. */
3512 tree oldtype
= TREE_TYPE (olddecl
);
3515 /* Merge the data types specified in the two decls. */
3516 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3518 if (TREE_CODE (newdecl
) == VAR_DECL
)
3519 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3520 /* Do this after calling `common_type' so that default
3521 parameters don't confuse us. */
3522 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3523 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3524 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3526 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3527 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3528 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3529 TYPE_RAISES_EXCEPTIONS (oldtype
));
3531 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3532 && DECL_SOURCE_LINE (olddecl
) != 0
3534 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
3535 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
3537 cp_error ("declaration of `%F' throws different exceptions",
3539 cp_error_at ("than previous declaration `%F'", olddecl
);
3542 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3544 /* Lay the type out, unless already done. */
3545 if (! same_type_p (newtype
, oldtype
)
3546 && TREE_TYPE (newdecl
) != error_mark_node
3547 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3548 layout_type (TREE_TYPE (newdecl
));
3550 if ((TREE_CODE (newdecl
) == VAR_DECL
3551 || TREE_CODE (newdecl
) == PARM_DECL
3552 || TREE_CODE (newdecl
) == RESULT_DECL
3553 || TREE_CODE (newdecl
) == FIELD_DECL
3554 || TREE_CODE (newdecl
) == TYPE_DECL
)
3555 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3556 layout_decl (newdecl
, 0);
3558 /* Merge the type qualifiers. */
3559 if (TREE_READONLY (newdecl
))
3560 TREE_READONLY (olddecl
) = 1;
3561 if (TREE_THIS_VOLATILE (newdecl
))
3562 TREE_THIS_VOLATILE (olddecl
) = 1;
3564 /* Merge the initialization information. */
3565 if (DECL_INITIAL (newdecl
) == NULL_TREE
3566 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3568 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3569 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3570 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3571 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
3572 && DECL_LANG_SPECIFIC (newdecl
)
3573 && DECL_LANG_SPECIFIC (olddecl
))
3574 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3577 /* Merge the section attribute.
3578 We want to issue an error if the sections conflict but that must be
3579 done later in decl_attributes since we are called before attributes
3581 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3582 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3584 /* Keep the old rtl since we can safely use it. */
3585 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3587 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3589 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (newdecl
)
3590 |= DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (olddecl
);
3591 DECL_NO_CHECK_MEMORY_USAGE (newdecl
)
3592 |= DECL_NO_CHECK_MEMORY_USAGE (olddecl
);
3593 DECL_NO_LIMIT_STACK (newdecl
)
3594 |= DECL_NO_LIMIT_STACK (olddecl
);
3597 /* If cannot merge, then use the new type and qualifiers,
3598 and don't preserve the old rtl. */
3601 /* Clean out any memory we had of the old declaration. */
3602 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3604 TREE_VALUE (oldstatic
) = error_mark_node
;
3606 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3607 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3608 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3609 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3612 /* Merge the storage class information. */
3613 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3614 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3615 DECL_DEFER_OUTPUT (newdecl
) |= DECL_DEFER_OUTPUT (olddecl
);
3616 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3617 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3618 if (! DECL_EXTERNAL (olddecl
))
3619 DECL_EXTERNAL (newdecl
) = 0;
3621 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3623 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3624 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3625 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3626 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3627 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3628 /* Don't really know how much of the language-specific
3629 values we should copy from old to new. */
3630 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3631 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3632 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3633 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3634 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3636 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3637 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3638 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3639 DECL_BEFRIENDING_CLASSES (newdecl
)
3640 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3641 DECL_BEFRIENDING_CLASSES (olddecl
));
3644 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3646 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3647 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3649 /* If newdecl is not a specialization, then it is not a
3650 template-related function at all. And that means that we
3651 shoud have exited above, returning 0. */
3652 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3655 if (TREE_USED (olddecl
))
3656 /* From [temp.expl.spec]:
3658 If a template, a member template or the member of a class
3659 template is explicitly specialized then that
3660 specialization shall be declared before the first use of
3661 that specialization that would cause an implicit
3662 instantiation to take place, in every translation unit in
3663 which such a use occurs. */
3664 cp_error ("explicit specialization of %D after first use",
3667 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3669 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3671 /* If either decl says `inline', this fn is inline, unless its
3672 definition was passed already. */
3673 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3674 DECL_INLINE (olddecl
) = 1;
3675 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3679 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3680 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3681 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3683 if (! types_match
|| new_defines_function
)
3685 /* These need to be copied so that the names are available.
3686 Note that if the types do match, we'll preserve inline
3687 info and other bits, but if not, we won't. */
3688 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3689 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3691 if (new_defines_function
)
3692 /* If defining a function declared with other language
3693 linkage, use the previously declared language linkage. */
3694 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3695 else if (types_match
)
3697 /* If redeclaring a builtin function, and not a definition,
3698 it stays built in. */
3699 if (DECL_BUILT_IN (olddecl
))
3701 DECL_BUILT_IN_CLASS (newdecl
) = DECL_BUILT_IN_CLASS (olddecl
);
3702 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3703 /* If we're keeping the built-in definition, keep the rtl,
3704 regardless of declaration matches. */
3705 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3708 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3710 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3711 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3712 /* Previously saved insns go together with
3713 the function's previous definition. */
3714 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3715 /* Don't clear out the arguments if we're redefining a function. */
3716 if (DECL_ARGUMENTS (olddecl
))
3717 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3721 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3723 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3726 /* Now preserve various other info from the definition. */
3727 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3728 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3729 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3730 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3732 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3736 function_size
= sizeof (struct tree_decl
);
3738 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3739 (char *) olddecl
+ sizeof (struct tree_common
),
3740 function_size
- sizeof (struct tree_common
));
3742 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3744 /* If newdecl is a template instantiation, it is possible that
3745 the following sequence of events has occurred:
3747 o A friend function was declared in a class template. The
3748 class template was instantiated.
3750 o The instantiation of the friend declaration was
3751 recorded on the instantiation list, and is newdecl.
3753 o Later, however, instantiate_class_template called pushdecl
3754 on the newdecl to perform name injection. But, pushdecl in
3755 turn called duplicate_decls when it discovered that another
3756 declaration of a global function with the same name already
3759 o Here, in duplicate_decls, we decided to clobber newdecl.
3761 If we're going to do that, we'd better make sure that
3762 olddecl, and not newdecl, is on the list of
3763 instantiations so that if we try to do the instantiation
3764 again we won't get the clobbered declaration. */
3766 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3767 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3769 for (; decls
; decls
= TREE_CHAIN (decls
))
3770 if (TREE_VALUE (decls
) == newdecl
)
3771 TREE_VALUE (decls
) = olddecl
;
3776 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3777 (char *) olddecl
+ sizeof (struct tree_common
),
3778 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3779 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3782 DECL_UID (olddecl
) = olddecl_uid
;
3784 DECL_FRIEND_P (olddecl
) = 1;
3786 /* NEWDECL contains the merged attribute lists.
3787 Update OLDDECL to be the same. */
3788 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3793 /* Record a decl-node X as belonging to the current lexical scope.
3794 Check for errors (such as an incompatible declaration for the same
3795 name already seen in the same scope).
3797 Returns either X or an old decl for the same name.
3798 If an old decl is returned, it may have been smashed
3799 to agree with what X says. */
3807 int need_new_binding
;
3809 /* We shouldn't be calling pushdecl when we're generating RTL for a
3810 function that we already did semantic analysis on previously. */
3811 my_friendly_assert (!cfun
|| doing_semantic_analysis_p (),
3814 need_new_binding
= 1;
3816 if (DECL_TEMPLATE_PARM_P (x
))
3817 /* Template parameters have no context; they are not X::T even
3818 when declared within a class or namespace. */
3822 if (current_function_decl
&& x
!= current_function_decl
3823 /* A local declaration for a function doesn't constitute
3825 && !(TREE_CODE (x
) == FUNCTION_DECL
&& !DECL_INITIAL (x
))
3826 /* A local declaration for an `extern' variable is in the
3827 scoped of the current namespace, not the current
3829 && !(TREE_CODE (x
) == VAR_DECL
&& DECL_EXTERNAL (x
))
3830 && !DECL_CONTEXT (x
))
3831 DECL_CONTEXT (x
) = current_function_decl
;
3832 if (!DECL_CONTEXT (x
))
3833 DECL_CONTEXT (x
) = FROB_CONTEXT (current_namespace
);
3835 /* If this is the declaration for a namespace-scope function,
3836 but the declaration itself is in a local scope, mark the
3838 if (TREE_CODE (x
) == FUNCTION_DECL
3839 && DECL_NAMESPACE_SCOPE_P (x
)
3840 && current_function_decl
3841 && x
!= current_function_decl
)
3842 DECL_LOCAL_FUNCTION_P (x
) = 1;
3845 name
= DECL_NAME (x
);
3849 /* Not needed...see below. */
3853 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3854 name
= TREE_OPERAND (name
, 0);
3856 /* Namespace-scoped variables are not found in the current level. */
3857 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
))
3858 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3860 t
= lookup_name_current_level (name
);
3862 /* If we are declaring a function, and the result of name-lookup
3863 was an OVERLOAD, look for an overloaded instance that is
3864 actually the same as the function we are declaring. (If
3865 there is one, we have to merge our declaration with the
3866 previous declaration.) */
3867 if (t
&& TREE_CODE (t
) == OVERLOAD
)
3871 if (TREE_CODE (x
) == FUNCTION_DECL
)
3872 for (match
= t
; match
; match
= OVL_NEXT (match
))
3874 if (DECL_ASSEMBLER_NAME (OVL_CURRENT (t
))
3875 == DECL_ASSEMBLER_NAME (x
))
3879 /* Just choose one. */
3883 t
= OVL_CURRENT (match
);
3888 if (t
== error_mark_node
)
3890 /* error_mark_node is 0 for a while during initialization! */
3892 cp_error_at ("`%#D' used prior to declaration", x
);
3894 else if (t
!= NULL_TREE
)
3896 if (TREE_CODE (t
) == PARM_DECL
)
3898 if (DECL_CONTEXT (t
) == NULL_TREE
)
3899 fatal ("parse errors have confused me too much");
3901 /* Check for duplicate params. */
3902 if (duplicate_decls (x
, t
))
3905 else if ((DECL_EXTERN_C_FUNCTION_P (x
)
3906 || DECL_FUNCTION_TEMPLATE_P (x
))
3907 && is_overloaded_fn (t
))
3908 /* Don't do anything just yet. */;
3909 else if (t
== wchar_decl_node
)
3911 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3912 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3914 /* Throw away the redeclaration. */
3917 else if (TREE_CODE (t
) != TREE_CODE (x
))
3919 if (duplicate_decls (x
, t
))
3922 else if (duplicate_decls (x
, t
))
3924 if (TREE_CODE (t
) == TYPE_DECL
)
3925 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3926 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3927 check_default_args (t
);
3931 else if (DECL_MAIN_P (x
))
3933 /* A redeclaration of main, but not a duplicate of the
3938 This function shall not be overloaded. */
3939 cp_error_at ("invalid redeclaration of `%D'", t
);
3940 cp_error ("as `%D'", x
);
3941 /* We don't try to push this declaration since that
3947 check_template_shadow (x
);
3949 /* If this is a function conjured up by the backend, massage it
3950 so it looks friendly. */
3951 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_LANG_SPECIFIC (x
))
3953 retrofit_lang_decl (x
);
3954 DECL_LANGUAGE (x
) = lang_c
;
3957 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_FUNCTION_MEMBER_P (x
))
3959 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
3962 if (!namespace_bindings_p ())
3963 /* We do not need to create a binding for this name;
3964 push_overloaded_decl will have already done so if
3966 need_new_binding
= 0;
3968 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3970 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
3972 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
3976 /* If declaring a type as a typedef, copy the type (unless we're
3977 at line 0), and install this TYPE_DECL as the new type's typedef
3978 name. See the extensive comment in ../c-decl.c (pushdecl). */
3979 if (TREE_CODE (x
) == TYPE_DECL
)
3981 tree type
= TREE_TYPE (x
);
3982 if (DECL_SOURCE_LINE (x
) == 0)
3984 if (TYPE_NAME (type
) == 0)
3985 TYPE_NAME (type
) = x
;
3987 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
3988 /* We don't want to copy the type when all we're
3989 doing is making a TYPE_DECL for the purposes of
3991 && (!TYPE_NAME (type
)
3992 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
3994 DECL_ORIGINAL_TYPE (x
) = type
;
3995 type
= build_type_copy (type
);
3996 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
3997 TYPE_NAME (type
) = x
;
3998 TREE_TYPE (x
) = type
;
4001 if (type
!= error_mark_node
4003 && TYPE_IDENTIFIER (type
))
4004 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
4005 current_binding_level
);
4009 /* Multiple external decls of the same identifier ought to match.
4011 We get warnings about inline functions where they are defined.
4012 We get warnings about other functions from push_overloaded_decl.
4014 Avoid duplicate warnings where they are used. */
4015 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
4019 if (IDENTIFIER_NAMESPACE_VALUE (name
) != NULL_TREE
4020 && IDENTIFIER_NAMESPACE_VALUE (name
) != error_mark_node
4021 && (DECL_EXTERNAL (IDENTIFIER_NAMESPACE_VALUE (name
))
4022 || TREE_PUBLIC (IDENTIFIER_NAMESPACE_VALUE (name
))))
4023 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
4028 /* If different sort of thing, we already gave an error. */
4029 && TREE_CODE (decl
) == TREE_CODE (x
)
4030 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
4032 cp_pedwarn ("type mismatch with previous external decl", x
);
4033 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
4037 /* This name is new in its binding level.
4038 Install the new declaration and return it. */
4039 if (namespace_bindings_p ())
4041 /* Install a global value. */
4043 /* If the first global decl has external linkage,
4044 warn if we later see static one. */
4045 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
4046 TREE_PUBLIC (name
) = 1;
4048 /* Bind the mangled name for the entity. In the future, we
4049 should not need to do this; mangled names are an
4050 implementation detail of which the front-end should not
4051 need to be aware. */
4052 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
4054 /* For an ordinary function, we create a binding from
4055 the mangled name (i.e., NAME) to the DECL. But, for
4056 an `extern "C"' function, the mangled name and the
4057 ordinary name are the same so we need not do this. */
4058 && !DECL_EXTERN_C_FUNCTION_P (x
))
4062 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
4063 || TREE_CODE (x
) == NAMESPACE_DECL
)
4064 mangled_name
= name
;
4066 mangled_name
= DECL_ASSEMBLER_NAME (x
);
4068 if (TREE_CODE (x
) == FUNCTION_DECL
)
4070 ((IDENTIFIER_GLOBAL_VALUE (mangled_name
) == NULL_TREE
)
4071 || (IDENTIFIER_GLOBAL_VALUE (mangled_name
) == x
), 378);
4072 SET_IDENTIFIER_NAMESPACE_VALUE (mangled_name
, x
);
4075 /* Don't forget if the function was used via an implicit decl. */
4076 if (IDENTIFIER_IMPLICIT_DECL (name
)
4077 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
4080 /* Don't forget if its address was taken in that way. */
4081 if (IDENTIFIER_IMPLICIT_DECL (name
)
4082 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
4083 TREE_ADDRESSABLE (x
) = 1;
4085 /* Warn about mismatches against previous implicit decl. */
4086 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
4087 /* If this real decl matches the implicit, don't complain. */
4088 && ! (TREE_CODE (x
) == FUNCTION_DECL
4089 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
4091 ("`%D' was previously implicitly declared to return `int'", x
);
4093 /* If new decl is `static' and an `extern' was seen previously,
4095 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
4096 warn_extern_redeclared_static (x
, t
);
4100 /* Here to install a non-global value. */
4101 tree oldlocal
= IDENTIFIER_VALUE (name
);
4102 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
4104 if (need_new_binding
)
4106 push_local_binding (name
, x
, 0);
4107 /* Because push_local_binding will hook X on to the
4108 current_binding_level's name list, we don't want to
4109 do that again below. */
4110 need_new_binding
= 0;
4113 /* If this is a TYPE_DECL, push it into the type value slot. */
4114 if (TREE_CODE (x
) == TYPE_DECL
)
4115 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
4116 current_binding_level
);
4118 /* Clear out any TYPE_DECL shadowed by a namespace so that
4119 we won't think this is a type. The C struct hack doesn't
4120 go through namespaces. */
4121 if (TREE_CODE (x
) == NAMESPACE_DECL
)
4122 set_identifier_type_value_with_scope (name
, NULL_TREE
,
4123 current_binding_level
);
4130 && TREE_CODE (oldlocal
) == VAR_DECL
4131 && DECL_DEAD_FOR_LOCAL (oldlocal
))
4132 oldlocal
= DECL_SHADOWED_FOR_VAR (oldlocal
);
4134 if (oldlocal
== NULL_TREE
)
4135 oldlocal
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (d
));
4138 /* If this is an extern function declaration, see if we
4139 have a global definition or declaration for the function. */
4140 if (oldlocal
== NULL_TREE
4141 && DECL_EXTERNAL (x
)
4142 && oldglobal
!= NULL_TREE
4143 && TREE_CODE (x
) == FUNCTION_DECL
4144 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
4146 /* We have one. Their types must agree. */
4147 if (decls_match (x
, oldglobal
))
4151 cp_warning ("extern declaration of `%#D' doesn't match", x
);
4152 cp_warning_at ("global declaration `%#D'", oldglobal
);
4155 /* If we have a local external declaration,
4156 and no file-scope declaration has yet been seen,
4157 then if we later have a file-scope decl it must not be static. */
4158 if (oldlocal
== NULL_TREE
4159 && oldglobal
== NULL_TREE
4160 && DECL_EXTERNAL (x
)
4162 TREE_PUBLIC (name
) = 1;
4164 /* Warn if shadowing an argument at the top level of the body. */
4165 if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
4166 /* Inline decls shadow nothing. */
4167 && !DECL_FROM_INLINE (x
)
4168 && TREE_CODE (oldlocal
) == PARM_DECL
4169 /* Don't complain if it's from an enclosing function. */
4170 && DECL_CONTEXT (oldlocal
) == current_function_decl
4171 && TREE_CODE (x
) != PARM_DECL
)
4173 /* Go to where the parms should be and see if we
4175 struct binding_level
*b
= current_binding_level
->level_chain
;
4181 if (b
->parm_flag
== 1)
4182 cp_error ("declaration of `%#D' shadows a parameter", name
);
4185 /* Maybe warn if shadowing something else. */
4186 if (warn_shadow
&& !DECL_EXTERNAL (x
)
4187 /* Inline decls shadow nothing. */
4188 && !DECL_FROM_INLINE (x
)
4189 /* No shadow warnings for internally generated vars. */
4190 && ! DECL_ARTIFICIAL (x
)
4191 /* No shadow warnings for vars made for inlining. */
4192 && ! DECL_FROM_INLINE (x
))
4194 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
4195 warning ("declaration of `%s' shadows a parameter",
4196 IDENTIFIER_POINTER (name
));
4197 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
4198 && current_class_ptr
4199 && !TREE_STATIC (name
))
4200 warning ("declaration of `%s' shadows a member of `this'",
4201 IDENTIFIER_POINTER (name
));
4202 else if (oldlocal
!= NULL_TREE
)
4203 warning ("declaration of `%s' shadows previous local",
4204 IDENTIFIER_POINTER (name
));
4205 else if (oldglobal
!= NULL_TREE
)
4206 /* XXX shadow warnings in outer-more namespaces */
4207 warning ("declaration of `%s' shadows global declaration",
4208 IDENTIFIER_POINTER (name
));
4212 if (TREE_CODE (x
) == FUNCTION_DECL
)
4213 check_default_args (x
);
4215 /* Keep count of variables in this level with incomplete type. */
4216 if (TREE_CODE (x
) == VAR_DECL
4217 && TREE_TYPE (x
) != error_mark_node
4218 && ((!COMPLETE_TYPE_P (TREE_TYPE (x
))
4219 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
4220 /* RTTI TD entries are created while defining the type_info. */
4221 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
4222 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
4224 if (namespace_bindings_p ())
4225 namespace_scope_incomplete
4226 = tree_cons (NULL_TREE
, x
, namespace_scope_incomplete
);
4228 current_binding_level
->incomplete
4229 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4233 if (need_new_binding
)
4234 add_decl_to_level (x
,
4235 DECL_NAMESPACE_SCOPE_P (x
)
4236 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x
))
4237 : current_binding_level
);
4242 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4243 caller to set DECL_CONTEXT properly. */
4246 pushdecl_with_scope (x
, level
)
4248 struct binding_level
*level
;
4250 register struct binding_level
*b
;
4251 tree function_decl
= current_function_decl
;
4253 current_function_decl
= NULL_TREE
;
4254 if (level
->parm_flag
== 2)
4256 b
= class_binding_level
;
4257 class_binding_level
= level
;
4258 pushdecl_class_level (x
);
4259 class_binding_level
= b
;
4263 b
= current_binding_level
;
4264 current_binding_level
= level
;
4266 current_binding_level
= b
;
4268 current_function_decl
= function_decl
;
4272 /* Like pushdecl, only it places X in the current namespace,
4276 pushdecl_namespace_level (x
)
4279 register struct binding_level
*b
= current_binding_level
;
4282 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4284 /* Now, the type_shadowed stack may screw us. Munge it so it does
4286 if (TREE_CODE (x
) == TYPE_DECL
)
4288 tree name
= DECL_NAME (x
);
4290 tree
*ptr
= (tree
*)0;
4291 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4293 tree shadowed
= b
->type_shadowed
;
4294 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4295 if (TREE_PURPOSE (shadowed
) == name
)
4297 ptr
= &TREE_VALUE (shadowed
);
4298 /* Can't break out of the loop here because sometimes
4299 a binding level will have duplicate bindings for
4300 PT names. It's gross, but I haven't time to fix it. */
4303 newval
= TREE_TYPE (x
);
4304 if (ptr
== (tree
*)0)
4306 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4307 up here if this is changed to an assertion. --KR */
4308 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4318 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4322 pushdecl_top_level (x
)
4325 push_to_top_level ();
4326 x
= pushdecl_namespace_level (x
);
4327 pop_from_top_level ();
4331 /* Make the declaration of X appear in CLASS scope. */
4334 pushdecl_class_level (x
)
4337 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4338 scope looks for the pre-mangled name. */
4341 if (TREE_CODE (x
) == OVERLOAD
)
4342 x
= OVL_CURRENT (x
);
4343 name
= DECL_NAME (x
);
4347 push_class_level_binding (name
, x
);
4348 if (TREE_CODE (x
) == TYPE_DECL
)
4349 set_identifier_type_value (name
, TREE_TYPE (x
));
4351 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4355 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4358 pushdecl_class_level (f
);
4362 /* Enter DECL into the symbol table, if that's appropriate. Returns
4363 DECL, or a modified version thereof. */
4366 maybe_push_decl (decl
)
4369 tree type
= TREE_TYPE (decl
);
4371 /* Add this decl to the current binding level, but not if it comes
4372 from another scope, e.g. a static member variable. TEM may equal
4373 DECL or it may be a previous decl of the same name. */
4374 if (decl
== error_mark_node
4375 || (TREE_CODE (decl
) != PARM_DECL
4376 && DECL_CONTEXT (decl
) != NULL_TREE
4377 /* Definitions of namespace members outside their namespace are
4379 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4380 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4381 || TREE_CODE (type
) == UNKNOWN_TYPE
4382 /* The declaration of a template specialization does not affect
4383 the functions available for overload resolution, so we do not
4385 || (TREE_CODE (decl
) == FUNCTION_DECL
4386 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4389 return pushdecl (decl
);
4392 /* Make the declaration(s) of X appear in CLASS scope
4393 under the name NAME. */
4396 push_class_level_binding (name
, x
)
4401 /* The class_binding_level will be NULL if x is a template
4402 parameter name in a member template. */
4403 if (!class_binding_level
)
4406 /* Make sure that this new member does not have the same name
4407 as a template parameter. */
4408 if (TYPE_BEING_DEFINED (current_class_type
))
4409 check_template_shadow (x
);
4411 /* If this declaration shadows a declaration from an enclosing
4412 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4413 we leave this class. Record the shadowed declaration here. */
4414 binding
= IDENTIFIER_BINDING (name
);
4416 && ((TREE_CODE (x
) == OVERLOAD
4417 && BINDING_VALUE (binding
)
4418 && is_overloaded_fn (BINDING_VALUE (binding
)))
4419 || INHERITED_VALUE_BINDING_P (binding
)))
4424 /* If the old binding was from a base class, and was for a tag
4425 name, slide it over to make room for the new binding. The
4426 old binding is still visible if explicitly qualified with a
4428 if (INHERITED_VALUE_BINDING_P (binding
)
4429 && BINDING_VALUE (binding
)
4430 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4431 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4432 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4434 old_decl
= BINDING_TYPE (binding
);
4435 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4436 BINDING_VALUE (binding
) = NULL_TREE
;
4437 INHERITED_VALUE_BINDING_P (binding
) = 0;
4440 old_decl
= BINDING_VALUE (binding
);
4442 /* There was already a binding for X containing fewer
4443 functions than are named in X. Find the previous
4444 declaration of X on the class-shadowed list, and update it. */
4445 for (shadow
= class_binding_level
->class_shadowed
;
4447 shadow
= TREE_CHAIN (shadow
))
4448 if (TREE_PURPOSE (shadow
) == name
4449 && TREE_TYPE (shadow
) == old_decl
)
4451 BINDING_VALUE (binding
) = x
;
4452 INHERITED_VALUE_BINDING_P (binding
) = 0;
4453 TREE_TYPE (shadow
) = x
;
4458 /* If we didn't replace an existing binding, put the binding on the
4459 stack of bindings for the identifier, and update
4460 IDENTIFIER_CLASS_VALUE. */
4461 if (push_class_binding (name
, x
))
4463 class_binding_level
->class_shadowed
4464 = tree_cons (name
, IDENTIFIER_CLASS_VALUE (name
),
4465 class_binding_level
->class_shadowed
);
4466 /* Record the value we are binding NAME to so that we can know
4467 what to pop later. */
4468 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4472 /* Insert another USING_DECL into the current binding level, returning
4473 this declaration. If this is a redeclaration, do nothing, and
4474 return NULL_TREE if this not in namespace scope (in namespace
4475 scope, a using decl might extend any previous bindings). */
4478 push_using_decl (scope
, name
)
4484 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4485 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4486 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4487 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4490 return namespace_bindings_p () ? decl
: NULL_TREE
;
4491 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4492 DECL_INITIAL (decl
) = scope
;
4493 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4494 current_binding_level
->usings
= decl
;
4498 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4499 changed (i.e. there was already a directive), or the fresh
4500 TREE_LIST otherwise. */
4503 push_using_directive (used
)
4506 tree ud
= current_binding_level
->using_directives
;
4507 tree iter
, ancestor
;
4509 /* Check if we already have this. */
4510 if (purpose_member (used
, ud
) != NULL_TREE
)
4513 /* Recursively add all namespaces used. */
4514 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4515 push_using_directive (TREE_PURPOSE (iter
));
4517 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4518 ud
= current_binding_level
->using_directives
;
4519 ud
= tree_cons (used
, ancestor
, ud
);
4520 current_binding_level
->using_directives
= ud
;
4524 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4525 other definitions already in place. We get around this by making
4526 the value of the identifier point to a list of all the things that
4527 want to be referenced by that name. It is then up to the users of
4528 that name to decide what to do with that list.
4530 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its
4531 DECL_TEMPLATE_RESULT. It is dealt with the same way.
4533 FLAGS is a bitwise-or of the following values:
4534 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4536 PUSH_USING: DECL is being pushed as the result of a using
4539 The value returned may be a previous declaration if we guessed wrong
4540 about what language DECL should belong to (C or C++). Otherwise,
4541 it's always DECL (and never something that's not a _DECL). */
4544 push_overloaded_decl (decl
, flags
)
4548 tree name
= DECL_NAME (decl
);
4551 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4554 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4556 old
= lookup_name_current_level (name
);
4560 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4562 tree t
= TREE_TYPE (old
);
4563 if (IS_AGGR_TYPE (t
) && warn_shadow
4564 && (! DECL_IN_SYSTEM_HEADER (decl
)
4565 || ! DECL_IN_SYSTEM_HEADER (old
)))
4566 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4569 else if (is_overloaded_fn (old
))
4573 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4575 tree fn
= OVL_CURRENT (tmp
);
4577 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4578 && !(flags
& PUSH_USING
)
4579 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4580 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4581 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4584 if (duplicate_decls (decl
, fn
))
4588 else if (old
== error_mark_node
)
4589 /* Ignore the undefined symbol marker. */
4593 cp_error_at ("previous non-function declaration `%#D'", old
);
4594 cp_error ("conflicts with function declaration `%#D'", decl
);
4599 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4601 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4602 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4604 new_binding
= ovl_cons (decl
, old
);
4605 if (flags
& PUSH_USING
)
4606 OVL_USED (new_binding
) = 1;
4609 /* NAME is not ambiguous. */
4613 set_namespace_binding (name
, current_namespace
, new_binding
);
4616 /* We only create an OVERLOAD if there was a previous binding at
4617 this level, or if decl is a template. In the former case, we
4618 need to remove the old binding and replace it with the new
4619 binding. We must also run through the NAMES on the binding
4620 level where the name was bound to update the chain. */
4622 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4626 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4628 d
= &TREE_CHAIN (*d
))
4630 || (TREE_CODE (*d
) == TREE_LIST
4631 && TREE_VALUE (*d
) == old
))
4633 if (TREE_CODE (*d
) == TREE_LIST
)
4634 /* Just replace the old binding with the new. */
4635 TREE_VALUE (*d
) = new_binding
;
4637 /* Build a TREE_LIST to wrap the OVERLOAD. */
4638 *d
= tree_cons (NULL_TREE
, new_binding
,
4641 /* And update the CPLUS_BINDING node. */
4642 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4647 /* We should always find a previous binding in this case. */
4648 my_friendly_abort (0);
4651 /* Install the new binding. */
4652 push_local_binding (name
, new_binding
, flags
);
4658 /* Generate an implicit declaration for identifier FUNCTIONID
4659 as a function of type int (). Print a warning if appropriate. */
4662 implicitly_declare (functionid
)
4667 /* We used to reuse an old implicit decl here,
4668 but this loses with inline functions because it can clobber
4669 the saved decl chains. */
4670 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4672 DECL_EXTERNAL (decl
) = 1;
4673 TREE_PUBLIC (decl
) = 1;
4675 /* ISO standard says implicit declarations are in the innermost block.
4676 So we record the decl in the standard fashion. */
4678 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4681 /* Only one warning per identifier. */
4682 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4684 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4687 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4692 /* Return zero if the declaration NEWDECL is valid
4693 when the declaration OLDDECL (assumed to be for the same name)
4694 has already been seen.
4695 Otherwise return an error message format string with a %s
4696 where the identifier should go. */
4699 redeclaration_error_message (newdecl
, olddecl
)
4700 tree newdecl
, olddecl
;
4702 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4704 /* Because C++ can put things into name space for free,
4705 constructs like "typedef struct foo { ... } foo"
4706 would look like an erroneous redeclaration. */
4707 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4710 return "redefinition of `%#D'";
4712 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4714 /* If this is a pure function, its olddecl will actually be
4715 the original initialization to `0' (which we force to call
4716 abort()). Don't complain about redefinition in this case. */
4717 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_PURE_VIRTUAL_P (olddecl
))
4720 /* If both functions come from different namespaces, this is not
4721 a redeclaration - this is a conflict with a used function. */
4722 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4723 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4724 return "`%D' conflicts with used function";
4726 /* We'll complain about linkage mismatches in
4727 warn_extern_redeclared_static. */
4729 /* Defining the same name twice is no good. */
4730 if (DECL_INITIAL (olddecl
) != NULL_TREE
4731 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4733 if (DECL_NAME (olddecl
) == NULL_TREE
)
4734 return "`%#D' not declared in class";
4736 return "redefinition of `%#D'";
4740 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4742 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4743 && (DECL_TEMPLATE_RESULT (newdecl
)
4744 != DECL_TEMPLATE_RESULT (olddecl
))
4745 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4746 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4747 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4748 && COMPLETE_TYPE_P (TREE_TYPE (newdecl
))
4749 && COMPLETE_TYPE_P (TREE_TYPE (olddecl
))))
4750 return "redefinition of `%#D'";
4753 else if (toplevel_bindings_p () || DECL_NAMESPACE_SCOPE_P (newdecl
))
4755 /* Objects declared at top level: */
4756 /* If at least one is a reference, it's ok. */
4757 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4759 /* Reject two definitions. */
4760 return "redefinition of `%#D'";
4764 /* Objects declared with block scope: */
4765 /* Reject two definitions, and reject a definition
4766 together with an external reference. */
4767 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4768 return "redeclaration of `%#D'";
4773 /* Create a new label, named ID. */
4776 make_label_decl (id
, local_p
)
4782 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4784 /* Make sure every label has an rtx. */
4787 DECL_CONTEXT (decl
) = current_function_decl
;
4788 DECL_MODE (decl
) = VOIDmode
;
4789 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
4791 /* Say where one reference is to the label, for the sake of the
4792 error if it is not defined. */
4793 DECL_SOURCE_LINE (decl
) = lineno
;
4794 DECL_SOURCE_FILE (decl
) = input_filename
;
4796 /* Record the fact that this identifier is bound to this label. */
4797 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4802 /* Record this label on the list of used labels so that we can check
4803 at the end of the function to see whether or not the label was
4804 actually defined, and so we can check when the label is defined whether
4805 this use is valid. */
4811 if (named_label_uses
== NULL
4812 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4813 || named_label_uses
->label_decl
!= decl
)
4815 struct named_label_use_list
*new_ent
;
4816 new_ent
= ((struct named_label_use_list
*)
4817 ggc_alloc (sizeof (struct named_label_use_list
)));
4818 new_ent
->label_decl
= decl
;
4819 new_ent
->names_in_scope
= current_binding_level
->names
;
4820 new_ent
->binding_level
= current_binding_level
;
4821 new_ent
->lineno_o_goto
= lineno
;
4822 new_ent
->filename_o_goto
= input_filename
;
4823 new_ent
->next
= named_label_uses
;
4824 named_label_uses
= new_ent
;
4828 /* Look for a label named ID in the current function. If one cannot
4829 be found, create one. (We keep track of used, but undefined,
4830 labels, and complain about them at the end of a function.) */
4837 struct named_label_list
*ent
;
4839 /* You can't use labels at global scope. */
4840 if (current_function_decl
== NULL_TREE
)
4842 error ("label `%s' referenced outside of any function",
4843 IDENTIFIER_POINTER (id
));
4847 /* See if we've already got this label. */
4848 decl
= IDENTIFIER_LABEL_VALUE (id
);
4849 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
4852 /* Record this label on the list of labels used in this function.
4853 We do this before calling make_label_decl so that we get the
4854 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4855 ent
= ((struct named_label_list
*)
4856 ggc_alloc_cleared (sizeof (struct named_label_list
)));
4857 ent
->old_value
= IDENTIFIER_LABEL_VALUE (id
);
4858 ent
->next
= named_labels
;
4861 /* We need a new label. */
4862 decl
= make_label_decl (id
, /*local_p=*/0);
4864 /* Now fill in the information we didn't have before. */
4865 ent
->label_decl
= decl
;
4870 /* Declare a local label named ID. */
4873 declare_local_label (id
)
4878 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4879 this scope we can restore the old value of
4880 IDENTIFIER_TYPE_VALUE. */
4881 current_binding_level
->shadowed_labels
4882 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4883 current_binding_level
->shadowed_labels
);
4884 /* Look for the label. */
4885 decl
= make_label_decl (id
, /*local_p=*/1);
4886 /* Now fill in the information we didn't have before. */
4887 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
4892 /* Returns nonzero if it is ill-formed to jump past the declaration of
4893 DECL. Returns 2 if it's also a real problem. */
4896 decl_jump_unsafe (decl
)
4899 if (TREE_CODE (decl
) != VAR_DECL
|| TREE_STATIC (decl
))
4902 if (DECL_INITIAL (decl
) == NULL_TREE
4903 && pod_type_p (TREE_TYPE (decl
)))
4906 /* This is really only important if we're crossing an initialization.
4907 The POD stuff is just pedantry; why should it matter if the class
4908 contains a field of pointer to member type? */
4909 if (DECL_INITIAL (decl
)
4910 || (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))))
4915 /* Check that a single previously seen jump to a newly defined label
4916 is OK. DECL is the LABEL_DECL or 0; LEVEL is the binding_level for
4917 the jump context; NAMES are the names in scope in LEVEL at the jump
4918 context; FILE and LINE are the source position of the jump or 0. */
4921 check_previous_goto_1 (decl
, level
, names
, file
, line
)
4923 struct binding_level
*level
;
4930 struct binding_level
*b
= current_binding_level
;
4931 for (; b
; b
= b
->level_chain
)
4933 tree new_decls
= b
->names
;
4934 tree old_decls
= (b
== level
? names
: NULL_TREE
);
4935 for (; new_decls
!= old_decls
;
4936 new_decls
= TREE_CHAIN (new_decls
))
4938 int problem
= decl_jump_unsafe (new_decls
);
4945 cp_pedwarn ("jump to label `%D'", decl
);
4947 pedwarn ("jump to case label");
4950 pedwarn_with_file_and_line (file
, line
, " from here");
4954 if (problem
> 1 && DECL_ARTIFICIAL (new_decls
))
4955 /* Can't skip init of __exception_info. */
4956 cp_error_at (" enters catch block", new_decls
);
4957 else if (problem
> 1)
4958 cp_error_at (" crosses initialization of `%#D'",
4961 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4967 if (b
->eh_region
&& ! saw_eh
)
4972 cp_pedwarn ("jump to label `%D'", decl
);
4974 pedwarn ("jump to case label");
4977 pedwarn_with_file_and_line (file
, line
, " from here");
4980 error (" enters try block");
4987 check_previous_goto (use
)
4988 struct named_label_use_list
*use
;
4990 check_previous_goto_1 (use
->label_decl
, use
->binding_level
,
4991 use
->names_in_scope
, use
->filename_o_goto
,
4992 use
->lineno_o_goto
);
4996 check_switch_goto (level
)
4997 struct binding_level
*level
;
4999 check_previous_goto_1 (NULL_TREE
, level
, level
->names
, NULL
, 0);
5002 /* Check that any previously seen jumps to a newly defined label DECL
5003 are OK. Called by define_label. */
5006 check_previous_gotos (decl
)
5009 struct named_label_use_list
**usep
;
5011 if (! TREE_USED (decl
))
5014 for (usep
= &named_label_uses
; *usep
; )
5016 struct named_label_use_list
*use
= *usep
;
5017 if (use
->label_decl
== decl
)
5019 check_previous_goto (use
);
5023 usep
= &(use
->next
);
5027 /* Check that a new jump to a label DECL is OK. Called by
5028 finish_goto_stmt. */
5036 struct named_label_list
*lab
;
5038 /* We can't know where a computed goto is jumping. So we assume
5040 if (! DECL_P (decl
))
5043 /* If the label hasn't been defined yet, defer checking. */
5044 if (! DECL_INITIAL (decl
))
5050 for (lab
= named_labels
; lab
; lab
= lab
->next
)
5051 if (decl
== lab
->label_decl
)
5054 /* If the label is not on named_labels it's a gcc local label, so
5055 it must be in an outer scope, so jumping to it is always OK. */
5059 if ((lab
->eh_region
|| lab
->bad_decls
) && !identified
)
5061 cp_pedwarn_at ("jump to label `%D'", decl
);
5062 pedwarn (" from here");
5066 for (bad
= lab
->bad_decls
; bad
; bad
= TREE_CHAIN (bad
))
5068 tree b
= TREE_VALUE (bad
);
5069 int u
= decl_jump_unsafe (b
);
5071 if (u
> 1 && DECL_ARTIFICIAL (b
))
5072 /* Can't skip init of __exception_info. */
5073 cp_error_at (" enters catch block", b
);
5075 cp_error_at (" skips initialization of `%#D'", b
);
5077 cp_pedwarn_at (" enters scope of non-POD `%#D'", b
);
5081 error (" enters try block");
5084 /* Define a label, specifying the location in the source file.
5085 Return the LABEL_DECL node for the label, if the definition is valid.
5086 Otherwise return 0. */
5089 define_label (filename
, line
, name
)
5090 const char *filename
;
5094 tree decl
= lookup_label (name
);
5095 struct named_label_list
*ent
;
5097 for (ent
= named_labels
; ent
; ent
= ent
->next
)
5098 if (ent
->label_decl
== decl
)
5101 /* After labels, make any new cleanups go into their
5102 own new (temporary) binding contour. */
5103 current_binding_level
->more_cleanups_ok
= 0;
5105 if (name
== get_identifier ("wchar_t"))
5106 cp_pedwarn ("label named wchar_t");
5108 if (DECL_INITIAL (decl
) != NULL_TREE
)
5110 cp_error ("duplicate label `%D'", decl
);
5115 /* Mark label as having been defined. */
5116 DECL_INITIAL (decl
) = error_mark_node
;
5117 /* Say where in the source. */
5118 DECL_SOURCE_FILE (decl
) = filename
;
5119 DECL_SOURCE_LINE (decl
) = line
;
5122 ent
->names_in_scope
= current_binding_level
->names
;
5123 ent
->binding_level
= current_binding_level
;
5125 check_previous_gotos (decl
);
5126 current_function_return_value
= NULL_TREE
;
5133 struct binding_level
*level
;
5134 struct cp_switch
*next
;
5137 static struct cp_switch
*switch_stack
;
5143 = (struct cp_switch
*) xmalloc (sizeof (struct cp_switch
));
5144 p
->level
= current_binding_level
;
5145 p
->next
= switch_stack
;
5152 struct cp_switch
*cs
;
5155 switch_stack
= switch_stack
->next
;
5159 /* Note that we've seen a definition of a case label, and complain if this
5160 is a bad place for one. */
5163 define_case_label ()
5165 tree cleanup
= last_cleanup_this_contour ();
5168 /* Don't crash; we'll complain in do_case. */
5173 static int explained
= 0;
5174 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup
));
5175 warning ("where case label appears here");
5178 warning ("(enclose actions of previous case statements requiring");
5179 warning ("destructors in their own binding contours.)");
5184 check_switch_goto (switch_stack
->level
);
5186 /* After labels, make any new cleanups go into their
5187 own new (temporary) binding contour. */
5189 current_binding_level
->more_cleanups_ok
= 0;
5190 current_function_return_value
= NULL_TREE
;
5193 /* Return the list of declarations of the current level.
5194 Note that this list is in reverse order unless/until
5195 you nreverse it; and when you do nreverse it, you must
5196 store the result back using `storedecls' or you will lose. */
5201 return current_binding_level
->names
;
5204 /* Return the list of type-tags (for structs, etc) of the current level. */
5209 return current_binding_level
->tags
;
5212 /* Store the list of declarations of the current level.
5213 This is done for the parameter declarations of a function being defined,
5214 after they are modified in the light of any missing parameters. */
5220 current_binding_level
->names
= decls
;
5223 /* Similarly, store the list of tags of the current level. */
5229 current_binding_level
->tags
= tags
;
5232 /* Given NAME, an IDENTIFIER_NODE,
5233 return the structure (or union or enum) definition for that name.
5234 Searches binding levels from BINDING_LEVEL up to the global level.
5235 If THISLEVEL_ONLY is nonzero, searches only the specified context
5236 (but skips any tag-transparent contexts to find one that is
5237 meaningful for tags).
5238 FORM says which kind of type the caller wants;
5239 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
5240 If the wrong kind of type is found, and it's not a template, an error is
5244 lookup_tag (form
, name
, binding_level
, thislevel_only
)
5245 enum tree_code form
;
5247 struct binding_level
*binding_level
;
5250 register struct binding_level
*level
;
5251 /* Non-zero if, we should look past a template parameter level, even
5252 if THISLEVEL_ONLY. */
5253 int allow_template_parms_p
= 1;
5255 for (level
= binding_level
; level
; level
= level
->level_chain
)
5258 if (ANON_AGGRNAME_P (name
))
5259 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5261 /* There's no need for error checking here, because
5262 anon names are unique throughout the compilation. */
5263 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
5264 return TREE_VALUE (tail
);
5266 else if (level
->namespace_p
)
5267 /* Do namespace lookup. */
5268 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
5270 tree old
= binding_for_name (name
, tail
);
5272 /* If we just skipped past a template parameter level,
5273 even though THISLEVEL_ONLY, and we find a template
5274 class declaration, then we use the _TYPE node for the
5275 template. See the example below. */
5276 if (thislevel_only
&& !allow_template_parms_p
5277 && old
&& BINDING_VALUE (old
)
5278 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
5279 old
= TREE_TYPE (BINDING_VALUE (old
));
5281 old
= BINDING_TYPE (old
);
5283 /* If it has an original type, it is a typedef, and we
5284 should not return it. */
5285 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
5287 if (old
&& TREE_CODE (old
) != form
5288 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
5290 cp_error ("`%#D' redeclared as %C", old
, form
);
5295 if (thislevel_only
|| tail
== global_namespace
)
5299 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5301 if (TREE_PURPOSE (tail
) == name
)
5303 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
5304 /* Should tighten this up; it'll probably permit
5305 UNION_TYPE and a struct template, for example. */
5307 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
5309 /* Definition isn't the kind we were looking for. */
5310 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
5314 return TREE_VALUE (tail
);
5317 if (thislevel_only
&& ! level
->tag_transparent
)
5319 if (level
->template_parms_p
&& allow_template_parms_p
)
5321 /* We must deal with cases like this:
5323 template <class T> struct S;
5324 template <class T> struct S {};
5326 When looking up `S', for the second declaration, we
5327 would like to find the first declaration. But, we
5328 are in the pseudo-global level created for the
5329 template parameters, rather than the (surrounding)
5330 namespace level. Thus, we keep going one more level,
5331 even though THISLEVEL_ONLY is non-zero. */
5332 allow_template_parms_p
= 0;
5344 set_current_level_tags_transparency (tags_transparent
)
5345 int tags_transparent
;
5347 current_binding_level
->tag_transparent
= tags_transparent
;
5351 /* Given a type, find the tag that was defined for it and return the tag name.
5352 Otherwise return 0. However, the value can never be 0
5353 in the cases in which this is used.
5355 C++: If NAME is non-zero, this is the new name to install. This is
5356 done when replacing anonymous tags with real tag names. */
5359 lookup_tag_reverse (type
, name
)
5363 register struct binding_level
*level
;
5365 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5368 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5370 if (TREE_VALUE (tail
) == type
)
5373 TREE_PURPOSE (tail
) = name
;
5374 return TREE_PURPOSE (tail
);
5381 /* Look up NAME in the NAMESPACE. */
5384 lookup_namespace_name (namespace, name
)
5385 tree
namespace, name
;
5388 tree template_id
= NULL_TREE
;
5390 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5392 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5393 /* This happens for A::B<int> when B is a namespace. */
5395 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5397 /* This happens for A::B where B is a template, and there are no
5398 template arguments. */
5399 cp_error ("invalid use of `%D'", name
);
5400 return error_mark_node
;
5403 namespace = ORIGINAL_NAMESPACE (namespace);
5405 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5408 name
= TREE_OPERAND (name
, 0);
5409 if (TREE_CODE (name
) == OVERLOAD
)
5410 name
= DECL_NAME (OVL_CURRENT (name
));
5411 else if (DECL_P (name
))
5412 name
= DECL_NAME (name
);
5415 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5417 val
= make_node (CPLUS_BINDING
);
5418 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5419 return error_mark_node
;
5421 if (BINDING_VALUE (val
))
5423 val
= BINDING_VALUE (val
);
5427 if (DECL_CLASS_TEMPLATE_P (val
))
5428 val
= lookup_template_class (val
,
5429 TREE_OPERAND (template_id
, 1),
5430 /*in_decl=*/NULL_TREE
,
5431 /*context=*/NULL_TREE
,
5432 /*entering_scope=*/0);
5433 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5434 || TREE_CODE (val
) == OVERLOAD
)
5435 val
= lookup_template_function (val
,
5436 TREE_OPERAND (template_id
, 1));
5439 cp_error ("`%D::%D' is not a template",
5441 return error_mark_node
;
5445 /* If we have a single function from a using decl, pull it out. */
5446 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5447 val
= OVL_FUNCTION (val
);
5451 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5452 return error_mark_node
;
5455 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5457 static unsigned long
5465 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5466 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5471 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5474 typename_compare (k1
, k2
)
5485 d1
= TYPE_NAME (t1
);
5486 d2
= TYPE_NAME (t2
);
5488 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5489 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5490 && ((TREE_TYPE (t1
) != NULL_TREE
)
5491 == (TREE_TYPE (t2
) != NULL_TREE
))
5492 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5493 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5496 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5497 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5498 is non-NULL, this type is being created by the implicit typename
5499 extension, and BASE_TYPE is a type named `t' in some base class of
5500 `T' which depends on template parameters.
5502 Returns the new TYPENAME_TYPE. */
5505 build_typename_type (context
, name
, fullname
, base_type
)
5513 struct hash_entry
* e
;
5515 static struct hash_table ht
;
5519 static struct hash_table
*h
= &ht
;
5520 if (!hash_table_init (&ht
, &hash_newfunc
, &typename_hash
,
5522 fatal ("virtual memory exhausted");
5523 ggc_add_tree_hash_table_root (&h
, 1);
5526 /* Build the TYPENAME_TYPE. */
5527 t
= make_aggr_type (TYPENAME_TYPE
);
5528 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5529 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5530 TREE_TYPE (t
) = base_type
;
5532 /* Build the corresponding TYPE_DECL. */
5533 d
= build_decl (TYPE_DECL
, name
, t
);
5534 TYPE_NAME (TREE_TYPE (d
)) = d
;
5535 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5536 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5537 DECL_ARTIFICIAL (d
) = 1;
5539 /* See if we already have this type. */
5540 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5544 /* Insert the type into the table. */
5545 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5550 /* Resolve `typename CONTEXT::NAME'. Returns an appropriate type,
5551 unless an error occurs, in which case error_mark_node is returned.
5552 If COMPLAIN zero, don't complain about any errors that occur. */
5555 make_typename_type (context
, name
, complain
)
5563 if (!(TYPE_LANG_SPECIFIC (name
)
5564 && (CLASSTYPE_IS_TEMPLATE (name
)
5565 || CLASSTYPE_USE_TEMPLATE (name
))))
5566 name
= TYPE_IDENTIFIER (name
);
5568 /* Create a TEMPLATE_ID_EXPR for the type. */
5569 name
= build_nt (TEMPLATE_ID_EXPR
,
5570 CLASSTYPE_TI_TEMPLATE (name
),
5571 CLASSTYPE_TI_ARGS (name
));
5573 else if (TREE_CODE (name
) == TYPE_DECL
)
5574 name
= DECL_NAME (name
);
5578 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5580 name
= TREE_OPERAND (name
, 0);
5581 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5582 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5584 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5585 my_friendly_abort (2000);
5587 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5589 /* We can get here from typename_sub0 in the explicit_template_type
5590 expansion. Just fail. */
5592 cp_error ("no class template named `%#T' in `%#T'",
5594 return error_mark_node
;
5597 if (! uses_template_parms (context
)
5598 || currently_open_class (context
))
5600 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5602 tree tmpl
= NULL_TREE
;
5603 if (IS_AGGR_TYPE (context
))
5604 tmpl
= lookup_field (context
, name
, 0, 0);
5605 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5608 cp_error ("no class template named `%#T' in `%#T'",
5610 return error_mark_node
;
5613 return lookup_template_class (tmpl
,
5614 TREE_OPERAND (fullname
, 1),
5616 /*entering_scope=*/0);
5622 if (!IS_AGGR_TYPE (context
))
5625 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5626 return error_mark_node
;
5629 t
= lookup_field (context
, name
, 0, 1);
5631 return TREE_TYPE (t
);
5635 /* If the CONTEXT is not a template type, then either the field is
5636 there now or its never going to be. */
5637 if (!uses_template_parms (context
))
5640 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5641 return error_mark_node
;
5645 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5648 /* Select the right _DECL from multiple choices. */
5651 select_decl (binding
, flags
)
5656 val
= BINDING_VALUE (binding
);
5657 if (LOOKUP_NAMESPACES_ONLY (flags
))
5659 /* We are not interested in types. */
5660 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5665 /* If we could have a type and
5666 we have nothing or we need a type and have none. */
5667 if (BINDING_TYPE (binding
)
5668 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5669 && TREE_CODE (val
) != TYPE_DECL
)))
5670 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5671 /* Don't return non-types if we really prefer types. */
5672 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5673 && (TREE_CODE (val
) != TEMPLATE_DECL
5674 || !DECL_CLASS_TEMPLATE_P (val
)))
5680 /* Unscoped lookup of a global: iterate over current namespaces,
5681 considering using-directives. If SPACESP is non-NULL, store a list
5682 of the namespaces we've considered in it. */
5685 unqualified_namespace_lookup (name
, flags
, spacesp
)
5690 tree b
= make_node (CPLUS_BINDING
);
5691 tree initial
= current_decl_namespace();
5692 tree scope
= initial
;
5694 struct binding_level
*level
;
5695 tree val
= NULL_TREE
;
5698 *spacesp
= NULL_TREE
;
5700 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5703 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5704 val
= binding_for_name (name
, scope
);
5706 /* Initialize binding for this context. */
5707 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5708 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5710 /* Add all _DECLs seen through local using-directives. */
5711 for (level
= current_binding_level
;
5712 !level
->namespace_p
;
5713 level
= level
->level_chain
)
5714 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5715 scope
, flags
, spacesp
))
5716 /* Give up because of error. */
5717 return error_mark_node
;
5719 /* Add all _DECLs seen through global using-directives. */
5720 /* XXX local and global using lists should work equally. */
5724 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5725 scope
, flags
, spacesp
))
5726 /* Give up because of error. */
5727 return error_mark_node
;
5728 if (siter
== scope
) break;
5729 siter
= CP_DECL_CONTEXT (siter
);
5732 val
= select_decl (b
, flags
);
5733 if (scope
== global_namespace
)
5739 /* Combine prefer_type and namespaces_only into flags. */
5742 lookup_flags (prefer_type
, namespaces_only
)
5743 int prefer_type
, namespaces_only
;
5745 if (namespaces_only
)
5746 return LOOKUP_PREFER_NAMESPACES
;
5747 if (prefer_type
> 1)
5748 return LOOKUP_PREFER_TYPES
;
5749 if (prefer_type
> 0)
5750 return LOOKUP_PREFER_BOTH
;
5754 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5755 ignore it or not. Subroutine of lookup_name_real. */
5758 qualify_lookup (val
, flags
)
5762 if (val
== NULL_TREE
)
5764 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5766 if ((flags
& LOOKUP_PREFER_TYPES
)
5767 && (TREE_CODE (val
) == TYPE_DECL
5768 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5769 && DECL_CLASS_TEMPLATE_P (val
))))
5771 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5776 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5780 warn_about_implicit_typename_lookup (typename
, binding
)
5784 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5785 tree name
= DECL_NAME (typename
);
5787 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5788 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5789 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5790 && ! (TREE_CODE (binding
) == TYPE_DECL
5791 && same_type_p (TREE_TYPE (binding
), subtype
)))
5793 cp_warning ("lookup of `%D' finds `%#D'",
5795 cp_warning (" instead of `%D' from dependent base class",
5797 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5798 constructor_name (current_class_type
), name
);
5802 /* Look up NAME in the current binding level and its superiors in the
5803 namespace of variables, functions and typedefs. Return a ..._DECL
5804 node of some kind representing its definition if there is only one
5805 such declaration, or return a TREE_LIST with all the overloaded
5806 definitions if there are many, or return 0 if it is undefined.
5808 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5809 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5810 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5811 Otherwise we prefer non-TYPE_DECLs.
5813 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5814 using IDENTIFIER_CLASS_VALUE. */
5817 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5819 int prefer_type
, nonclass
, namespaces_only
;
5822 tree val
= NULL_TREE
;
5824 tree from_obj
= NULL_TREE
;
5826 int val_is_implicit_typename
= 0;
5828 /* Hack: copy flag set by parser, if set. */
5829 if (only_namespace_names
)
5830 namespaces_only
= 1;
5832 if (prefer_type
== -2)
5834 extern int looking_for_typename
;
5835 tree type
= NULL_TREE
;
5838 prefer_type
= looking_for_typename
;
5840 flags
= lookup_flags (prefer_type
, namespaces_only
);
5841 /* If the next thing is '<', class templates are types. */
5842 if (looking_for_template
)
5843 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5845 /* std:: becomes :: for now. */
5846 if (got_scope
== std_node
)
5847 got_scope
= void_type_node
;
5851 else if (got_object
!= error_mark_node
)
5856 if (type
== error_mark_node
)
5857 return error_mark_node
;
5858 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5859 type
= TREE_TYPE (type
);
5862 type
= complete_type (type
);
5864 if (TREE_CODE (type
) == VOID_TYPE
)
5865 type
= global_namespace
;
5866 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5868 val
= make_node (CPLUS_BINDING
);
5869 flags
|= LOOKUP_COMPLAIN
;
5870 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5872 val
= select_decl (val
, flags
);
5874 else if (! IS_AGGR_TYPE (type
)
5875 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5876 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5877 || TREE_CODE (type
) == TYPENAME_TYPE
)
5878 /* Someone else will give an error about this if needed. */
5880 else if (type
== current_class_type
)
5881 val
= IDENTIFIER_CLASS_VALUE (name
);
5884 val
= lookup_member (type
, name
, 0, prefer_type
);
5885 type_access_control (type
, val
);
5893 else if (got_object
&& val
)
5898 flags
= lookup_flags (prefer_type
, namespaces_only
);
5899 /* If we're not parsing, we need to complain. */
5900 flags
|= LOOKUP_COMPLAIN
;
5903 /* First, look in non-namespace scopes. */
5905 if (current_class_type
== NULL_TREE
)
5908 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5912 if (!LOCAL_BINDING_P (t
) && nonclass
)
5913 /* We're not looking for class-scoped bindings, so keep going. */
5916 /* If this is the kind of thing we're looking for, we're done. */
5917 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5918 binding
= BINDING_VALUE (t
);
5919 else if ((flags
& LOOKUP_PREFER_TYPES
)
5920 && qualify_lookup (BINDING_TYPE (t
), flags
))
5921 binding
= BINDING_TYPE (t
);
5923 binding
= NULL_TREE
;
5925 /* Handle access control on types from enclosing or base classes. */
5926 if (binding
&& ! yylex
5927 && BINDING_LEVEL (t
) && BINDING_LEVEL (t
)->parm_flag
== 2)
5928 type_access_control (BINDING_LEVEL (t
)->this_class
, binding
);
5931 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5933 if (val_is_implicit_typename
&& !yylex
)
5934 warn_about_implicit_typename_lookup (val
, binding
);
5936 val_is_implicit_typename
5937 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5938 if (!val_is_implicit_typename
)
5943 /* Now lookup in namespace scopes. */
5944 if (!val
|| val_is_implicit_typename
)
5946 t
= unqualified_namespace_lookup (name
, flags
, 0);
5949 if (val_is_implicit_typename
&& !yylex
)
5950 warn_about_implicit_typename_lookup (val
, t
);
5958 /* This should only warn about types used in qualified-ids. */
5959 if (from_obj
&& from_obj
!= val
)
5961 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5962 && TREE_CODE (val
) == TYPE_DECL
5963 && TREE_TYPE (from_obj
) != TREE_TYPE (val
))
5965 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5966 name
, got_object
, TREE_TYPE (from_obj
));
5967 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
5971 /* We don't change val to from_obj if got_object depends on
5972 template parms because that breaks implicit typename for
5973 destructor calls. */
5974 if (! uses_template_parms (got_object
))
5978 /* If we have a single function from a using decl, pull it out. */
5979 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5980 val
= OVL_FUNCTION (val
);
5989 lookup_name_nonclass (name
)
5992 return lookup_name_real (name
, 0, 1, 0);
5996 lookup_function_nonclass (name
, args
)
6000 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
6004 lookup_name_namespace_only (name
)
6007 /* type-or-namespace, nonclass, namespace_only */
6008 return lookup_name_real (name
, 1, 1, 1);
6012 lookup_name (name
, prefer_type
)
6016 return lookup_name_real (name
, prefer_type
, 0, 0);
6019 /* Similar to `lookup_name' but look only in the innermost non-class
6023 lookup_name_current_level (name
)
6026 struct binding_level
*b
;
6029 b
= current_binding_level
;
6030 while (b
->parm_flag
== 2)
6035 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
6037 /* extern "C" function() */
6038 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
6041 else if (IDENTIFIER_BINDING (name
)
6042 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
6046 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
6047 return IDENTIFIER_VALUE (name
);
6059 /* Like lookup_name_current_level, but for types. */
6062 lookup_type_current_level (name
)
6065 register tree t
= NULL_TREE
;
6067 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
6069 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
6070 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
6072 struct binding_level
*b
= current_binding_level
;
6075 if (purpose_member (name
, b
->type_shadowed
))
6076 return REAL_IDENTIFIER_TYPE_VALUE (name
);
6088 begin_only_namespace_names ()
6090 only_namespace_names
= 1;
6094 end_only_namespace_names ()
6096 only_namespace_names
= 0;
6099 /* Arrange for the user to get a source line number, even when the
6100 compiler is going down in flames, so that she at least has a
6101 chance of working around problems in the compiler. We used to
6102 call error(), but that let the segmentation fault continue
6103 through; now, it's much more passive by asking them to send the
6104 maintainers mail about the problem. */
6108 int sig ATTRIBUTE_UNUSED
;
6110 signal (SIGSEGV
, SIG_DFL
);
6112 signal (SIGIOT
, SIG_DFL
);
6115 signal (SIGILL
, SIG_DFL
);
6118 signal (SIGABRT
, SIG_DFL
);
6121 signal (SIGBUS
, SIG_DFL
);
6123 my_friendly_abort (0);
6126 /* Push the declarations of builtin types into the namespace.
6127 RID_INDEX, if < RID_MAX is the index of the builtin type
6128 in the array RID_POINTERS. NAME is the name used when looking
6129 up the builtin type. TYPE is the _TYPE node for the builtin type. */
6132 record_builtin_type (rid_index
, name
, type
)
6137 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
6138 tree tdecl
= NULL_TREE
;
6140 if ((int) rid_index
< (int) RID_MAX
)
6141 rname
= ridpointers
[(int) rid_index
];
6143 tname
= get_identifier (name
);
6145 TYPE_BUILT_IN (type
) = 1;
6149 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
6150 set_identifier_type_value (tname
, NULL_TREE
);
6151 if ((int) rid_index
< (int) RID_MAX
)
6152 /* Built-in types live in the global namespace. */
6153 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
6155 if (rname
!= NULL_TREE
)
6157 if (tname
!= NULL_TREE
)
6159 set_identifier_type_value (rname
, NULL_TREE
);
6160 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
6164 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
6165 set_identifier_type_value (rname
, NULL_TREE
);
6170 /* Record one of the standard Java types.
6171 * Declare it as having the given NAME.
6172 * If SIZE > 0, it is the size of one of the integral types;
6173 * otherwise it is the negative of the size of one of the other types. */
6176 record_builtin_java_type (name
, size
)
6182 type
= make_signed_type (size
);
6183 else if (size
> -32)
6184 { /* "__java_char" or ""__java_boolean". */
6185 type
= make_unsigned_type (-size
);
6186 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
6189 { /* "__java_float" or ""__java_double". */
6190 type
= make_node (REAL_TYPE
);
6191 TYPE_PRECISION (type
) = - size
;
6194 record_builtin_type (RID_MAX
, name
, type
);
6195 decl
= TYPE_NAME (type
);
6197 /* Suppress generate debug symbol entries for these types,
6198 since for normal C++ they are just clutter.
6199 However, push_lang_context undoes this if extern "Java" is seen. */
6200 DECL_IGNORED_P (decl
) = 1;
6202 TYPE_FOR_JAVA (type
) = 1;
6206 /* Push a type into the namespace so that the back-ends ignore it. */
6209 record_unknown_type (type
, name
)
6213 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
6214 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
6215 DECL_IGNORED_P (decl
) = 1;
6216 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
6217 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
6218 TYPE_ALIGN (type
) = 1;
6219 TYPE_USER_ALIGN (type
) = 0;
6220 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
6223 /* An string for which we should create an IDENTIFIER_NODE at
6226 typedef struct predefined_identifier
6228 /* The name of the identifier. */
6230 /* The place where the IDENTIFIER_NODE should be stored. */
6232 /* Non-zero if this is the name of a constructor or destructor. */
6234 } predefined_identifier
;
6236 /* Create all the predefined identifiers. */
6239 initialize_predefined_identifiers ()
6241 struct predefined_identifier
*pid
;
6243 /* A table of identifiers to create at startup. */
6244 static predefined_identifier predefined_identifiers
[] = {
6245 { "C++", &lang_name_cplusplus
, 0 },
6246 { "C", &lang_name_c
, 0 },
6247 { "Java", &lang_name_java
, 0 },
6248 { CTOR_NAME
, &ctor_identifier
, 1 },
6249 { "__base_ctor", &base_ctor_identifier
, 1 },
6250 { "__comp_ctor", &complete_ctor_identifier
, 1 },
6251 { DTOR_NAME
, &dtor_identifier
, 1 },
6252 { "__comp_dtor", &complete_dtor_identifier
, 1 },
6253 { "__base_dtor", &base_dtor_identifier
, 1 },
6254 { "__deleting_dtor", &deleting_dtor_identifier
, 1 },
6255 { VTABLE_DELTA2_NAME
, &delta2_identifier
, 0 },
6256 { VTABLE_DELTA_NAME
, &delta_identifier
, 0 },
6257 { IN_CHARGE_NAME
, &in_charge_identifier
, 0 },
6258 { VTABLE_INDEX_NAME
, &index_identifier
, 0 },
6259 { "nelts", &nelts_identifier
, 0 },
6260 { THIS_NAME
, &this_identifier
, 0 },
6261 { VTABLE_PFN_NAME
, &pfn_identifier
, 0 },
6262 { "__pfn_or_delta2", &pfn_or_delta2_identifier
, 0 },
6263 { "_vptr", &vptr_identifier
, 0 },
6264 { "__cp_push_exception", &cp_push_exception_identifier
, 0 },
6265 { "__vtt_parm", &vtt_parm_identifier
, 0 },
6266 { "std", &std_identifier
, 0 },
6270 for (pid
= predefined_identifiers
; pid
->name
; ++pid
)
6272 *pid
->node
= get_identifier (pid
->name
);
6273 if (pid
->ctor_or_dtor_p
)
6274 IDENTIFIER_CTOR_OR_DTOR_P (*pid
->node
) = 1;
6278 /* Create the predefined scalar types of C,
6279 and some nodes representing standard constants (0, 1, (void *)0).
6280 Initialize the global binding level.
6281 Make definitions for built-in primitive functions. */
6284 init_decl_processing ()
6287 int wchar_type_size
;
6288 tree array_domain_type
;
6290 /* Check to see that the user did not specify an invalid combination
6291 of command-line options. */
6292 if (flag_new_abi
&& !flag_vtable_thunks
)
6293 fatal ("the new ABI requires vtable thunks");
6295 /* Create all the identifiers we need. */
6296 initialize_predefined_identifiers ();
6298 /* Let the back-end now how to save and restore language-specific
6299 per-function globals. */
6300 init_lang_status
= &push_cp_function_context
;
6301 free_lang_status
= &pop_cp_function_context
;
6302 mark_lang_status
= &mark_cp_function_context
;
6308 /* Create the global variables. */
6309 push_to_top_level ();
6311 /* Enter the global namespace. */
6312 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
6313 push_namespace (get_identifier ("::"));
6314 global_namespace
= current_namespace
;
6315 current_lang_name
= NULL_TREE
;
6317 /* Adjust various flags based on command-line settings. */
6318 if (flag_strict_prototype
== 2)
6319 flag_strict_prototype
= pedantic
;
6320 if (! flag_permissive
&& ! pedantic
)
6321 flag_pedantic_errors
= 1;
6322 if (!flag_no_inline
)
6323 flag_inline_trees
= 1;
6325 strict_prototypes_lang_c
= flag_strict_prototype
;
6328 current_lang_name
= lang_name_c
;
6330 current_function_decl
= NULL_TREE
;
6331 current_binding_level
= NULL_BINDING_LEVEL
;
6332 free_binding_level
= NULL_BINDING_LEVEL
;
6334 /* Because most segmentation signals can be traced back into user
6335 code, catch them and at least give the user a chance of working
6336 around compiler bugs. */
6337 signal (SIGSEGV
, signal_catch
);
6339 /* We will also catch aborts in the back-end through signal_catch and
6340 give the user a chance to see where the error might be, and to defeat
6341 aborts in the back-end when there have been errors previously in their
6344 signal (SIGIOT
, signal_catch
);
6347 signal (SIGILL
, signal_catch
);
6350 signal (SIGABRT
, signal_catch
);
6353 signal (SIGBUS
, signal_catch
);
6356 build_common_tree_nodes (flag_signed_char
);
6358 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6359 TREE_TYPE (error_mark_list
) = error_mark_node
;
6361 /* Make the binding_level structure for global names. */
6363 global_binding_level
= current_binding_level
;
6364 /* The global level is the namespace level of ::. */
6365 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6366 declare_namespace_level ();
6368 /* Define `int' and `char' first so that dbx will output them first. */
6369 record_builtin_type (RID_INT
, NULL_PTR
, integer_type_node
);
6370 record_builtin_type (RID_CHAR
, "char", char_type_node
);
6372 /* `signed' is the same as `int' */
6373 record_builtin_type (RID_SIGNED
, NULL_PTR
, integer_type_node
);
6374 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
6375 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
6376 record_builtin_type (RID_MAX
, "long unsigned int", long_unsigned_type_node
);
6377 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
6378 record_builtin_type (RID_MAX
, "long long int", long_long_integer_type_node
);
6379 record_builtin_type (RID_MAX
, "long long unsigned int",
6380 long_long_unsigned_type_node
);
6381 record_builtin_type (RID_MAX
, "long long unsigned",
6382 long_long_unsigned_type_node
);
6383 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
6384 record_builtin_type (RID_MAX
, "short unsigned int", short_unsigned_type_node
);
6385 record_builtin_type (RID_MAX
, "unsigned short", short_unsigned_type_node
);
6388 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE
)));
6390 /* Define both `signed char' and `unsigned char'. */
6391 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
6392 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
6394 /* `unsigned long' is the standard type for sizeof.
6395 Note that stddef.h uses `unsigned long',
6396 and this must agree, even if long and int are the same size. */
6398 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE
))));
6400 /* Create the widest literal types. */
6401 widest_integer_literal_type_node
= make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
6402 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6403 widest_integer_literal_type_node
));
6405 widest_unsigned_literal_type_node
= make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
6406 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6407 widest_unsigned_literal_type_node
));
6409 /* These are types that type_for_size and type_for_mode use. */
6410 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intQI_type_node
));
6411 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intHI_type_node
));
6412 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intSI_type_node
));
6413 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intDI_type_node
));
6414 #if HOST_BITS_PER_WIDE_INT >= 64
6415 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__int128_t"), intTI_type_node
));
6417 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intQI_type_node
));
6418 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intHI_type_node
));
6419 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intSI_type_node
));
6420 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intDI_type_node
));
6421 #if HOST_BITS_PER_WIDE_INT >= 64
6422 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__uint128_t"), unsigned_intTI_type_node
));
6425 build_common_tree_nodes_2 (flag_short_double
);
6427 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6428 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6429 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6430 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6431 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6432 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6433 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6434 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6436 integer_two_node
= build_int_2 (2, 0);
6437 TREE_TYPE (integer_two_node
) = integer_type_node
;
6438 integer_three_node
= build_int_2 (3, 0);
6439 TREE_TYPE (integer_three_node
) = integer_type_node
;
6441 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6442 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6443 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6444 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6445 TYPE_PRECISION (boolean_type_node
) = 1;
6446 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6447 boolean_false_node
= build_int_2 (0, 0);
6448 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6449 boolean_true_node
= build_int_2 (1, 0);
6450 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6452 signed_size_zero_node
= build_int_2 (0, 0);
6453 record_builtin_type (RID_FLOAT
, NULL_PTR
, float_type_node
);
6454 record_builtin_type (RID_DOUBLE
, NULL_PTR
, double_type_node
);
6455 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
6457 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex int"),
6458 complex_integer_type_node
));
6459 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex float"),
6460 complex_float_type_node
));
6461 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex double"),
6462 complex_double_type_node
));
6463 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
6464 complex_long_double_type_node
));
6466 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6468 record_builtin_type (RID_VOID
, NULL_PTR
, void_type_node
);
6469 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
6470 TREE_PARMLIST (void_list_node
) = 1;
6472 /* Used for expressions that do nothing, but are not errors. */
6473 void_zero_node
= build_int_2 (0, 0);
6474 TREE_TYPE (void_zero_node
) = void_type_node
;
6476 string_type_node
= build_pointer_type (char_type_node
);
6477 const_string_type_node
6478 = build_pointer_type (build_qualified_type (char_type_node
,
6480 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6482 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
6485 /* Make a type to be the domain of a few array types
6486 whose domains don't really matter.
6487 200 is small enough that it always fits in size_t. */
6488 array_domain_type
= build_index_type (build_int_2 (200, 0));
6490 /* Make a type for arrays of characters.
6491 With luck nothing will ever really depend on the length of this
6493 char_array_type_node
6494 = build_array_type (char_type_node
, array_domain_type
);
6496 /* Likewise for arrays of ints. */
6498 = build_array_type (integer_type_node
, array_domain_type
);
6501 delta_type_node
= ptrdiff_type_node
;
6502 else if (flag_huge_objects
)
6503 delta_type_node
= long_integer_type_node
;
6505 delta_type_node
= short_integer_type_node
;
6508 vtable_index_type
= ptrdiff_type_node
;
6510 vtable_index_type
= delta_type_node
;
6512 default_function_type
6513 = build_function_type (integer_type_node
, NULL_TREE
);
6515 ptr_type_node
= build_pointer_type (void_type_node
);
6517 = build_pointer_type (build_qualified_type (void_type_node
,
6519 vtt_parm_type
= build_pointer_type (const_ptr_type_node
);
6520 c_common_nodes_and_builtins (1, flag_no_builtin
, flag_no_nonansi_builtin
);
6521 lang_type_promotes_to
= convert_type_from_ellipsis
;
6524 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6526 /* C++ extensions */
6528 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6529 record_unknown_type (unknown_type_node
, "unknown type");
6531 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6532 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6534 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6536 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6538 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6539 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6541 /* This is special for C++ so functions can be overloaded. */
6542 wchar_type_node
= get_identifier (flag_short_wchar
6543 ? "short unsigned int"
6545 wchar_type_node
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (wchar_type_node
));
6546 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
6547 signed_wchar_type_node
= make_signed_type (wchar_type_size
);
6548 unsigned_wchar_type_node
= make_unsigned_type (wchar_type_size
);
6550 = TREE_UNSIGNED (wchar_type_node
)
6551 ? unsigned_wchar_type_node
6552 : signed_wchar_type_node
;
6553 record_builtin_type (RID_WCHAR
, "__wchar_t", wchar_type_node
);
6555 /* Artificial declaration of wchar_t -- can be bashed */
6556 wchar_decl_node
= build_decl (TYPE_DECL
, get_identifier ("wchar_t"),
6558 pushdecl (wchar_decl_node
);
6560 /* This is for wide string constants. */
6561 wchar_array_type_node
6562 = build_array_type (wchar_type_node
, array_domain_type
);
6564 if (flag_vtable_thunks
)
6566 /* Make sure we get a unique function type, so we can give
6567 its pointer type a name. (This wins for gdb.) */
6568 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6569 TREE_TYPE (vfunc_type
) = integer_type_node
;
6570 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6571 layout_type (vfunc_type
);
6573 vtable_entry_type
= build_pointer_type (vfunc_type
);
6577 vtable_entry_type
= make_aggr_type (RECORD_TYPE
);
6578 fields
[0] = build_decl (FIELD_DECL
, delta_identifier
,
6580 fields
[1] = build_decl (FIELD_DECL
, index_identifier
,
6582 fields
[2] = build_decl (FIELD_DECL
, pfn_identifier
,
6584 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6587 /* Make this part of an invisible union. */
6588 fields
[3] = copy_node (fields
[2]);
6589 TREE_TYPE (fields
[3]) = delta_type_node
;
6590 DECL_NAME (fields
[3]) = delta2_identifier
;
6591 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6592 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6593 DECL_SIZE_UNIT (fields
[3]) = TYPE_SIZE_UNIT (delta_type_node
);
6594 TREE_UNSIGNED (fields
[3]) = 0;
6595 TREE_CHAIN (fields
[2]) = fields
[3];
6596 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6599 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6602 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6603 layout_type (vtbl_type_node
);
6604 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6605 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6606 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6607 layout_type (vtbl_ptr_type_node
);
6608 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6610 std_node
= build_decl (NAMESPACE_DECL
,
6612 ? get_identifier ("fake std") : std_identifier
,
6614 pushdecl (std_node
);
6618 push_namespace (get_identifier ("__cxxabiv1"));
6619 abi_node
= current_namespace
;
6623 global_type_node
= make_node (LANG_TYPE
);
6624 record_unknown_type (global_type_node
, "global type");
6627 current_lang_name
= lang_name_cplusplus
;
6630 tree bad_alloc_type_node
, newtype
, deltype
;
6632 push_namespace (get_identifier ("std"));
6633 bad_alloc_type_node
= xref_tag
6634 (class_type_node
, get_identifier ("bad_alloc"), 1);
6637 newtype
= build_exception_variant
6638 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6639 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6640 push_cp_library_fn (NEW_EXPR
, newtype
);
6641 push_cp_library_fn (VEC_NEW_EXPR
, newtype
);
6642 global_delete_fndecl
= push_cp_library_fn (DELETE_EXPR
, deltype
);
6643 push_cp_library_fn (VEC_DELETE_EXPR
, deltype
);
6647 = build_library_fn_ptr ("__pure_virtual", void_ftype
);
6649 /* Perform other language dependent initializations. */
6650 init_class_processing ();
6651 init_init_processing ();
6652 init_search_processing ();
6653 init_rtti_processing ();
6655 if (flag_exceptions
)
6656 init_exception_processing ();
6659 flag_inline_functions
= 0;
6662 if (! supports_one_only ())
6665 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6666 make_fname_decl
= cp_make_fname_decl
;
6667 declare_function_name ();
6669 /* Prepare to check format strings against argument lists. */
6670 init_function_format_info ();
6672 /* Show we use EH for cleanups. */
6673 using_eh_for_cleanups ();
6675 print_error_function
= lang_print_error_function
;
6676 valid_lang_attribute
= cp_valid_lang_attribute
;
6678 /* Maintain consistency. Perhaps we should just complain if they
6679 say -fwritable-strings? */
6680 if (flag_writable_strings
)
6681 flag_const_strings
= 0;
6683 /* Add GC roots for all of our global variables. */
6684 ggc_add_tree_root (c_global_trees
, sizeof c_global_trees
/ sizeof(tree
));
6685 ggc_add_tree_root (cp_global_trees
, sizeof cp_global_trees
/ sizeof(tree
));
6686 ggc_add_tree_root (&integer_three_node
, 1);
6687 ggc_add_tree_root (&integer_two_node
, 1);
6688 ggc_add_tree_root (&signed_size_zero_node
, 1);
6689 ggc_add_tree_root (&size_one_node
, 1);
6690 ggc_add_tree_root (&size_zero_node
, 1);
6691 ggc_add_root (&global_binding_level
, 1, sizeof global_binding_level
,
6692 mark_binding_level
);
6693 ggc_add_root (&scope_chain
, 1, sizeof scope_chain
, &mark_saved_scope
);
6694 ggc_add_tree_root (&static_ctors
, 1);
6695 ggc_add_tree_root (&static_dtors
, 1);
6696 ggc_add_tree_root (&lastiddecl
, 1);
6698 ggc_add_tree_root (&last_function_parm_tags
, 1);
6699 ggc_add_tree_root (¤t_function_return_value
, 1);
6700 ggc_add_tree_root (¤t_function_parms
, 1);
6701 ggc_add_tree_root (¤t_function_parm_tags
, 1);
6702 ggc_add_tree_root (&last_function_parms
, 1);
6703 ggc_add_tree_root (&error_mark_list
, 1);
6705 ggc_add_tree_root (&global_namespace
, 1);
6706 ggc_add_tree_root (&global_type_node
, 1);
6707 ggc_add_tree_root (&anonymous_namespace_name
, 1);
6709 ggc_add_tree_root (&got_object
, 1);
6710 ggc_add_tree_root (&got_scope
, 1);
6712 ggc_add_tree_root (¤t_lang_name
, 1);
6713 ggc_add_tree_root (&static_aggregates
, 1);
6716 /* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the
6717 decl, NAME is the initialization string and TYPE_DEP indicates whether
6718 NAME depended on the type of the function. We make use of that to detect
6719 __PRETTY_FUNCTION__ inside a template fn. Because we build a tree for
6720 the function before emitting any of it, we don't need to treat the
6721 VAR_DECL specially. We can decide whether to emit it later, if it was
6725 cp_make_fname_decl (id
, name
, type_dep
)
6730 tree decl
, type
, init
;
6731 size_t length
= strlen (name
);
6732 tree domain
= NULL_TREE
;
6734 if (!processing_template_decl
)
6737 domain
= build_index_type (build_int_2 (length
, 0));
6739 type
= build_cplus_array_type
6740 (build_qualified_type (char_type_node
, TYPE_QUAL_CONST
),
6743 decl
= build_decl (VAR_DECL
, id
, type
);
6744 TREE_STATIC (decl
) = 1;
6745 TREE_READONLY (decl
) = 1;
6746 DECL_SOURCE_LINE (decl
) = 0;
6747 DECL_ARTIFICIAL (decl
) = 1;
6748 DECL_IN_SYSTEM_HEADER (decl
) = 1;
6750 if (processing_template_decl
)
6751 decl
= push_template_decl (decl
);
6754 init
= build (FUNCTION_NAME
, type
);
6755 DECL_PRETTY_FUNCTION_P (decl
) = 1;
6759 init
= build_string (length
+ 1, name
);
6760 TREE_TYPE (init
) = type
;
6762 DECL_INITIAL (decl
) = init
;
6763 cp_finish_decl (decl
, init
, NULL_TREE
, LOOKUP_ONLYCONVERTING
);
6765 /* We will have to make sure we only emit this, if it is actually used. */
6769 /* Function to print any language-specific context for an error message. */
6772 lang_print_error_function (file
)
6775 default_print_error_function (file
);
6776 maybe_print_template_context ();
6779 /* Entry point for the benefit of c_common_nodes_and_builtins.
6781 Make a definition for a builtin function named NAME and whose data type
6782 is TYPE. TYPE should be a function type with argument types.
6784 CLASS and CODE tell later passes how to compile calls to this function.
6785 See tree.h for possible values.
6787 If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6788 the name to be called if we can't opencode the function. */
6791 builtin_function (name
, type
, code
, class, libname
)
6795 enum built_in_class
class;
6796 const char *libname
;
6798 tree decl
= build_library_fn_1 (get_identifier (name
), ERROR_MARK
, type
);
6799 DECL_BUILT_IN_CLASS (decl
) = class;
6800 DECL_FUNCTION_CODE (decl
) = code
;
6802 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6804 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6805 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6806 function in the namespace. */
6809 DECL_ASSEMBLER_NAME (decl
) = get_identifier (libname
);
6810 make_function_rtl (decl
);
6812 /* Warn if a function in the namespace for users
6813 is used without an occasion to consider it declared. */
6814 if (name
[0] != '_' || name
[1] != '_')
6815 DECL_ANTICIPATED (decl
) = 1;
6820 /* Generate a FUNCTION_DECL with the typical flags for a runtime library
6821 function. Not called directly. */
6824 build_library_fn_1 (name
, operator_code
, type
)
6826 enum tree_code operator_code
;
6829 tree fn
= build_lang_decl (FUNCTION_DECL
, name
, type
);
6830 DECL_EXTERNAL (fn
) = 1;
6831 TREE_PUBLIC (fn
) = 1;
6832 DECL_ARTIFICIAL (fn
) = 1;
6833 TREE_NOTHROW (fn
) = 1;
6834 SET_OVERLOADED_OPERATOR_CODE (fn
, operator_code
);
6838 /* Returns the _DECL for a library function with C linkage.
6839 We assume that such functions never throw; if this is incorrect,
6840 callers should unset TREE_NOTHROW. */
6843 build_library_fn (name
, type
)
6847 tree fn
= build_library_fn_1 (name
, ERROR_MARK
, type
);
6848 make_function_rtl (fn
);
6852 /* Returns the _DECL for a library function with C++ linkage. */
6855 build_cp_library_fn (name
, operator_code
, type
)
6857 enum tree_code operator_code
;
6860 tree fn
= build_library_fn_1 (name
, operator_code
, type
);
6861 TREE_NOTHROW (fn
) = TYPE_NOTHROW_P (type
);
6862 DECL_CONTEXT (fn
) = FROB_CONTEXT (current_namespace
);
6863 set_mangled_name_for_decl (fn
);
6864 make_function_rtl (fn
);
6868 /* Like build_library_fn, but takes a C string instead of an
6872 build_library_fn_ptr (name
, type
)
6876 return build_library_fn (get_identifier (name
), type
);
6879 /* Like build_cp_library_fn, but takes a C string instead of an
6883 build_cp_library_fn_ptr (name
, type
)
6887 return build_cp_library_fn (get_identifier (name
), ERROR_MARK
, type
);
6890 /* Like build_library_fn, but also pushes the function so that we will
6891 be able to find it via IDENTIFIER_GLOBAL_VALUE. */
6894 push_library_fn (name
, type
)
6897 tree fn
= build_library_fn (name
, type
);
6898 pushdecl_top_level (fn
);
6902 /* Like build_cp_library_fn, but also pushes the function so that it
6903 will be found by normal lookup. */
6906 push_cp_library_fn (operator_code
, type
)
6907 enum tree_code operator_code
;
6910 tree fn
= build_cp_library_fn (ansi_opname (operator_code
),
6917 /* Like push_library_fn, but takes a TREE_LIST of parm types rather than
6921 push_void_library_fn (name
, parmtypes
)
6922 tree name
, parmtypes
;
6924 tree type
= build_function_type (void_type_node
, parmtypes
);
6925 return push_library_fn (name
, type
);
6928 /* Like push_library_fn, but also note that this function throws
6929 and does not return. Used for __throw_foo and the like. */
6932 push_throw_library_fn (name
, type
)
6935 tree fn
= push_library_fn (name
, type
);
6936 TREE_THIS_VOLATILE (fn
) = 1;
6937 TREE_NOTHROW (fn
) = 0;
6941 /* When we call finish_struct for an anonymous union, we create
6942 default copy constructors and such. But, an anonymous union
6943 shouldn't have such things; this function undoes the damage to the
6944 anonymous union type T.
6946 (The reason that we create the synthesized methods is that we don't
6947 distinguish `union { int i; }' from `typedef union { int i; } U'.
6948 The first is an anonymous union; the second is just an ordinary
6952 fixup_anonymous_aggr (t
)
6957 /* Wipe out memory of synthesized methods */
6958 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6959 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6960 TYPE_HAS_INIT_REF (t
) = 0;
6961 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6962 TYPE_HAS_ASSIGN_REF (t
) = 0;
6963 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6965 /* Splice the implicitly generated functions out of the TYPE_METHODS
6967 q
= &TYPE_METHODS (t
);
6970 if (DECL_ARTIFICIAL (*q
))
6971 *q
= TREE_CHAIN (*q
);
6973 q
= &TREE_CHAIN (*q
);
6976 /* ISO C++ 9.5.3. Anonymous unions may not have function members. */
6977 if (TYPE_METHODS (t
))
6978 error ("an anonymous union cannot have function members");
6981 /* Make sure that a declaration with no declarator is well-formed, i.e.
6982 just defines a tagged type or anonymous union.
6984 Returns the type defined, if any. */
6987 check_tag_decl (declspecs
)
6992 tree ob_modifier
= NULL_TREE
;
6994 register tree t
= NULL_TREE
;
6996 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6998 register tree value
= TREE_VALUE (link
);
7001 || (TREE_CODE (value
) == IDENTIFIER_NODE
7002 && IDENTIFIER_GLOBAL_VALUE (value
)
7003 && TYPE_P (IDENTIFIER_GLOBAL_VALUE (value
))))
7007 if (IS_AGGR_TYPE (value
) || TREE_CODE (value
) == ENUMERAL_TYPE
)
7009 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
7013 else if (value
== ridpointers
[(int) RID_FRIEND
])
7015 if (current_class_type
== NULL_TREE
7016 || current_scope () != current_class_type
)
7017 ob_modifier
= value
;
7021 else if (value
== ridpointers
[(int) RID_STATIC
]
7022 || value
== ridpointers
[(int) RID_EXTERN
]
7023 || value
== ridpointers
[(int) RID_AUTO
]
7024 || value
== ridpointers
[(int) RID_REGISTER
]
7025 || value
== ridpointers
[(int) RID_INLINE
]
7026 || value
== ridpointers
[(int) RID_VIRTUAL
]
7027 || value
== ridpointers
[(int) RID_CONST
]
7028 || value
== ridpointers
[(int) RID_VOLATILE
]
7029 || value
== ridpointers
[(int) RID_EXPLICIT
])
7030 ob_modifier
= value
;
7034 error ("multiple types in one declaration");
7036 if (t
== NULL_TREE
&& ! saw_friend
)
7037 pedwarn ("declaration does not declare anything");
7039 /* Check for an anonymous union. We're careful
7040 accessing TYPE_IDENTIFIER because some built-in types, like
7041 pointer-to-member types, do not have TYPE_NAME. */
7042 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
7044 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
7046 /* Anonymous unions are objects, so they can have specifiers. */;
7047 SET_ANON_AGGR_TYPE_P (t
);
7049 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
7050 pedwarn ("ISO C++ prohibits anonymous structs");
7053 else if (ob_modifier
)
7055 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
7056 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
7057 cp_error ("`%D' can only be specified for functions", ob_modifier
);
7058 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
7059 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
7060 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
7061 cp_error ("`%D' can only be specified for constructors",
7064 cp_error ("`%D' can only be specified for objects and functions",
7071 /* Called when a declaration is seen that contains no names to declare.
7072 If its type is a reference to a structure, union or enum inherited
7073 from a containing scope, shadow that tag name for the current scope
7074 with a forward reference.
7075 If its type defines a new named structure or union
7076 or defines an enum, it is valid but we need not do anything here.
7077 Otherwise, it is an error.
7079 C++: may have to grok the declspecs to learn about static,
7080 complain for anonymous unions. */
7083 shadow_tag (declspecs
)
7086 tree t
= check_tag_decl (declspecs
);
7089 maybe_process_partial_specialization (t
);
7091 /* This is where the variables in an anonymous union are
7092 declared. An anonymous union declaration looks like:
7094 because there is no declarator after the union, the parser
7095 sends that declaration here. */
7096 if (t
&& ANON_AGGR_TYPE_P (t
))
7098 fixup_anonymous_aggr (t
);
7100 if (TYPE_FIELDS (t
))
7102 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
7104 finish_anon_union (decl
);
7109 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
7112 groktypename (typename
)
7115 if (TREE_CODE (typename
) != TREE_LIST
)
7117 return grokdeclarator (TREE_VALUE (typename
),
7118 TREE_PURPOSE (typename
),
7119 TYPENAME
, 0, NULL_TREE
);
7122 /* Decode a declarator in an ordinary declaration or data definition.
7123 This is called as soon as the type information and variable name
7124 have been parsed, before parsing the initializer if any.
7125 Here we create the ..._DECL node, fill in its type,
7126 and put it on the list of decls for the current context.
7127 The ..._DECL node is returned as the value.
7129 Exception: for arrays where the length is not specified,
7130 the type is left null, to be filled in by `cp_finish_decl'.
7132 Function definitions do not come here; they go to start_function
7133 instead. However, external and forward declarations of functions
7134 do go through here. Structure field declarations are done by
7135 grokfield and not through here. */
7138 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
7139 tree declarator
, declspecs
;
7141 tree attributes
, prefix_attributes
;
7144 register tree type
, tem
;
7146 extern int have_extern_spec
;
7147 extern int used_extern_spec
;
7151 /* See code below that used this. */
7152 int init_written
= initialized
;
7155 /* This should only be done once on the top most decl. */
7156 if (have_extern_spec
&& !used_extern_spec
)
7158 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"),
7160 used_extern_spec
= 1;
7163 if (attributes
|| prefix_attributes
)
7164 attrlist
= build_tree_list (attributes
, prefix_attributes
);
7166 attrlist
= NULL_TREE
;
7168 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
7171 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
7174 type
= TREE_TYPE (decl
);
7176 if (type
== error_mark_node
)
7179 context
= DECL_CONTEXT (decl
);
7181 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
7182 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
7184 /* When parsing the initializer, lookup should use the object's
7186 push_decl_namespace (context
);
7189 /* We are only interested in class contexts, later. */
7190 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
7191 context
= NULL_TREE
;
7194 /* Is it valid for this decl to have an initializer at all?
7195 If not, set INITIALIZED to zero, which will indirectly
7196 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7197 switch (TREE_CODE (decl
))
7200 /* typedef foo = bar means give foo the same type as bar.
7201 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
7202 Any other case of an initialization in a TYPE_DECL is an error. */
7203 if (pedantic
|| list_length (declspecs
) > 1)
7205 cp_error ("typedef `%D' is initialized", decl
);
7211 cp_error ("function `%#D' is initialized like a variable", decl
);
7221 if (! toplevel_bindings_p ()
7222 && DECL_EXTERNAL (decl
))
7223 cp_warning ("declaration of `%#D' has `extern' and is initialized",
7225 DECL_EXTERNAL (decl
) = 0;
7226 if (toplevel_bindings_p ())
7227 TREE_STATIC (decl
) = 1;
7229 /* Tell `pushdecl' this is an initialized decl
7230 even though we don't yet have the initializer expression.
7231 Also tell `cp_finish_decl' it may store the real initializer. */
7232 DECL_INITIAL (decl
) = error_mark_node
;
7235 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
7236 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
7239 /* Set attributes here so if duplicate decl, will have proper attributes. */
7240 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
7242 if (context
&& COMPLETE_TYPE_P (complete_type (context
)))
7244 push_nested_class (context
, 2);
7246 if (TREE_CODE (decl
) == VAR_DECL
)
7248 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
7249 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
7250 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
7253 if (DECL_CONTEXT (field
) != context
)
7255 cp_pedwarn ("ISO C++ does not permit `%T::%D' to be defined as `%T::%D'",
7256 DECL_CONTEXT (field
), DECL_NAME (decl
),
7257 context
, DECL_NAME (decl
));
7258 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
7260 /* Static data member are tricky; an in-class initialization
7261 still doesn't provide a definition, so the in-class
7262 declaration will have DECL_EXTERNAL set, but will have an
7263 initialization. Thus, duplicate_decls won't warn
7264 about this situation, and so we check here. */
7265 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
7266 cp_error ("duplicate initialization of %D", decl
);
7267 if (duplicate_decls (decl
, field
))
7273 tree field
= check_classfn (context
, decl
);
7274 if (field
&& duplicate_decls (decl
, field
))
7278 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
7279 DECL_IN_AGGR_P (decl
) = 0;
7280 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
7281 || CLASSTYPE_TEMPLATE_INSTANTIATION (context
))
7283 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
7284 /* [temp.expl.spec] An explicit specialization of a static data
7285 member of a template is a definition if the declaration
7286 includes an initializer; otherwise, it is a declaration.
7288 We check for processing_specialization so this only applies
7289 to the new specialization syntax. */
7290 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
7291 DECL_EXTERNAL (decl
) = 1;
7294 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
7295 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
7299 /* Enter this declaration into the symbol table. */
7300 tem
= maybe_push_decl (decl
);
7302 if (processing_template_decl
)
7303 tem
= push_template_decl (tem
);
7305 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7306 /* Tell the back-end to use or not use .common as appropriate. If we say
7307 -fconserve-space, we want this to save .data space, at the expense of
7308 wrong semantics. If we say -fno-conserve-space, we want this to
7309 produce errors about redefs; to do this we force variables into the
7311 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
7314 if (! processing_template_decl
)
7324 tree type
= TREE_TYPE (decl
);
7325 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
7327 if (type
== error_mark_node
)
7330 /* If this type of object needs a cleanup, but we're not allowed to
7331 add any more objects with cleanups to the current scope, create a
7332 new binding level. */
7333 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
7334 && current_binding_level
->more_cleanups_ok
== 0)
7336 keep_next_level (2);
7339 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/1);
7343 /* Is it valid for this decl to have an initializer at all?
7344 If not, set INITIALIZED to zero, which will indirectly
7345 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7347 /* Don't allow initializations for incomplete types except for
7348 arrays which might be completed by the initialization. */
7349 if (COMPLETE_TYPE_P (complete_type (type
)))
7350 ; /* A complete type is ok. */
7351 else if (TREE_CODE (type
) != ARRAY_TYPE
)
7353 cp_error ("variable `%#D' has initializer but incomplete type",
7356 type
= TREE_TYPE (decl
) = error_mark_node
;
7358 else if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (type
))))
7360 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
7361 cp_error ("elements of array `%#D' have incomplete type", decl
);
7362 /* else we already gave an error in start_decl. */
7368 && TREE_CODE (decl
) != TYPE_DECL
7369 && TREE_CODE (decl
) != TEMPLATE_DECL
7370 && type
!= error_mark_node
7371 && IS_AGGR_TYPE (type
)
7372 && ! DECL_EXTERNAL (decl
))
7374 if ((! processing_template_decl
|| ! uses_template_parms (type
))
7375 && !COMPLETE_TYPE_P (complete_type (type
)))
7377 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
7379 /* Change the type so that assemble_variable will give
7380 DECL an rtl we can live with: (mem (const_int 0)). */
7381 type
= TREE_TYPE (decl
) = error_mark_node
;
7385 /* If any base type in the hierarchy of TYPE needs a constructor,
7386 then we set initialized to 1. This way any nodes which are
7387 created for the purposes of initializing this aggregate
7388 will live as long as it does. This is necessary for global
7389 aggregates which do not have their initializers processed until
7390 the end of the file. */
7391 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
7396 DECL_INITIAL (decl
) = NULL_TREE
;
7399 /* Handle initialization of references.
7400 These three arguments are from `cp_finish_decl', and have the
7401 same meaning here that they do there.
7403 Quotes on semantics can be found in ARM 8.4.3. */
7406 grok_reference_init (decl
, type
, init
)
7407 tree decl
, type
, init
;
7411 if (init
== NULL_TREE
)
7413 if ((DECL_LANG_SPECIFIC (decl
) == 0
7414 || DECL_IN_AGGR_P (decl
) == 0)
7415 && ! DECL_THIS_EXTERN (decl
))
7416 cp_error ("`%D' declared as reference but not initialized", decl
);
7420 if (init
== error_mark_node
)
7423 if (TREE_CODE (init
) == CONSTRUCTOR
)
7425 cp_error ("ISO C++ forbids use of initializer list to initialize reference `%D'", decl
);
7429 if (TREE_CODE (init
) == TREE_LIST
)
7430 init
= build_compound_expr (init
);
7432 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
7433 init
= convert_from_reference (init
);
7435 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
7436 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
7438 /* Note: default conversion is only called in very special cases. */
7439 init
= default_conversion (init
);
7442 /* Convert INIT to the reference type TYPE. This may involve the
7443 creation of a temporary, whose lifetime must be the same as that
7444 of the reference. If so, a DECL_STMT for the temporary will be
7445 added just after the DECL_STMT for DECL. That's why we don't set
7446 DECL_INITIAL for local references (instead assigning to them
7447 explicitly); we need to allow the temporary to be initialized
7449 tmp
= convert_to_reference
7450 (type
, init
, CONV_IMPLICIT
,
7451 LOOKUP_ONLYCONVERTING
|LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
,
7454 if (tmp
== error_mark_node
)
7456 else if (tmp
!= NULL_TREE
)
7459 tmp
= save_expr (tmp
);
7460 if (building_stmt_tree ())
7462 /* Initialize the declaration. */
7463 tmp
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, tmp
);
7464 finish_expr_stmt (tmp
);
7467 DECL_INITIAL (decl
) = tmp
;
7471 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7475 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
7477 expand_static_init (decl
, DECL_INITIAL (decl
));
7478 DECL_INITIAL (decl
) = NULL_TREE
;
7483 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7484 mucking with forces it does not comprehend (i.e. initialization with a
7485 constructor). If we are at global scope and won't go into COMMON, fill
7486 it in with a dummy CONSTRUCTOR to force the variable into .data;
7487 otherwise we can use error_mark_node. */
7490 obscure_complex_init (decl
, init
)
7493 if (! flag_no_inline
&& TREE_STATIC (decl
))
7495 if (extract_init (decl
, init
))
7499 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7500 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7501 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7505 DECL_INITIAL (decl
) = error_mark_node
;
7510 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7511 array until we finish parsing the initializer. If that's the
7512 situation we're in, update DECL accordingly. */
7515 maybe_deduce_size_from_array_init (decl
, init
)
7519 tree type
= TREE_TYPE (decl
);
7521 if (TREE_CODE (type
) == ARRAY_TYPE
7522 && TYPE_DOMAIN (type
) == NULL_TREE
7523 && TREE_CODE (decl
) != TYPE_DECL
)
7526 = (TREE_STATIC (decl
)
7527 /* Even if pedantic, an external linkage array
7528 may have incomplete type at first. */
7529 ? pedantic
&& ! DECL_EXTERNAL (decl
)
7530 : !DECL_EXTERNAL (decl
));
7531 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7532 int failure
= complete_array_type (type
, initializer
, do_default
);
7535 cp_error ("initializer fails to determine size of `%D'", decl
);
7540 cp_error ("array size missing in `%D'", decl
);
7541 /* If a `static' var's size isn't known, make it extern as
7542 well as static, so it does not get allocated. If it's not
7543 `static', then don't mark it extern; finish_incomplete_decl
7544 will give it a default size and it will get allocated. */
7545 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7546 DECL_EXTERNAL (decl
) = 1;
7549 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7550 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7552 cp_error ("zero-size array `%D'", decl
);
7554 layout_decl (decl
, 0);
7558 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7559 any appropriate error messages regarding the layout. */
7562 layout_var_decl (decl
)
7565 tree type
= TREE_TYPE (decl
);
7567 tree ttype
= target_type (type
);
7570 /* If we haven't already layed out this declaration, do so now.
7571 Note that we must not call complete type for an external object
7572 because it's type might involve templates that we are not
7573 supposed to isntantiate yet. (And it's perfectly legal to say
7574 `extern X x' for some incomplete type `X'.) */
7575 if (!DECL_EXTERNAL (decl
))
7576 complete_type (type
);
7577 if (!DECL_SIZE (decl
) && COMPLETE_TYPE_P (type
))
7578 layout_decl (decl
, 0);
7580 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7582 /* An automatic variable with an incomplete type: that is an error.
7583 Don't talk about array types here, since we took care of that
7584 message in grokdeclarator. */
7585 cp_error ("storage size of `%D' isn't known", decl
);
7586 TREE_TYPE (decl
) = error_mark_node
;
7589 /* Keep this code around in case we later want to control debug info
7590 based on whether a type is "used". (jason 1999-11-11) */
7592 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7593 /* Let debugger know it should output info for this type. */
7594 note_debug_info_needed (ttype
);
7596 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7597 note_debug_info_needed (DECL_CONTEXT (decl
));
7600 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7601 && DECL_SIZE (decl
) != NULL_TREE
7602 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7604 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7605 constant_expression_warning (DECL_SIZE (decl
));
7607 cp_error ("storage size of `%D' isn't constant", decl
);
7611 /* If a local static variable is declared in an inline function, or if
7612 we have a weak definition, we must endeavor to create only one
7613 instance of the variable at link-time. */
7616 maybe_commonize_var (decl
)
7619 /* Static data in a function with comdat linkage also has comdat
7621 if (TREE_STATIC (decl
)
7622 /* Don't mess with __FUNCTION__. */
7623 && ! DECL_ARTIFICIAL (decl
)
7624 && current_function_decl
7625 && DECL_CONTEXT (decl
) == current_function_decl
7626 && (DECL_THIS_INLINE (current_function_decl
)
7627 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7628 && TREE_PUBLIC (current_function_decl
))
7630 /* Rather than try to get this right with inlining, we suppress
7631 inlining of such functions. */
7632 current_function_cannot_inline
7633 = "function with static variable cannot be inline";
7635 /* If flag_weak, we don't need to mess with this, as we can just
7636 make the function weak, and let it refer to its unique local
7637 copy. This works because we don't allow the function to be
7641 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7643 TREE_PUBLIC (decl
) = 1;
7644 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7646 else if (DECL_INITIAL (decl
) == NULL_TREE
7647 || DECL_INITIAL (decl
) == error_mark_node
)
7649 TREE_PUBLIC (decl
) = 1;
7650 DECL_COMMON (decl
) = 1;
7652 /* else we lose. We can only do this if we can use common,
7653 which we can't if it has been initialized. */
7655 if (TREE_PUBLIC (decl
))
7656 DECL_ASSEMBLER_NAME (decl
)
7657 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7660 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7661 cp_warning_at (" you can work around this by removing the initializer", decl
);
7665 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7666 /* Set it up again; we might have set DECL_INITIAL since the last
7668 comdat_linkage (decl
);
7671 /* Issue an error message if DECL is an uninitialized const variable. */
7674 check_for_uninitialized_const_var (decl
)
7677 tree type
= TREE_TYPE (decl
);
7679 /* ``Unless explicitly declared extern, a const object does not have
7680 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7682 if (TREE_CODE (decl
) == VAR_DECL
7683 && TREE_CODE (type
) != REFERENCE_TYPE
7684 && CP_TYPE_CONST_P (type
)
7685 && !TYPE_NEEDS_CONSTRUCTING (type
)
7686 && !DECL_INITIAL (decl
))
7687 cp_error ("uninitialized const `%D'", decl
);
7690 /* Verify INIT (the initializer for DECL), and record the
7691 initialization in DECL_INITIAL, if appropriate. Returns a new
7695 check_initializer (decl
, init
)
7701 if (TREE_CODE (decl
) == FIELD_DECL
)
7704 type
= TREE_TYPE (decl
);
7706 /* If `start_decl' didn't like having an initialization, ignore it now. */
7707 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7710 /* Check the initializer. */
7713 /* Things that are going to be initialized need to have complete
7715 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7717 if (type
== error_mark_node
)
7718 /* We will have already complained. */
7720 else if (COMPLETE_TYPE_P (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7722 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7725 else if (TREE_CODE (type
) == ARRAY_TYPE
7726 && !COMPLETE_TYPE_P (TREE_TYPE (type
)))
7728 cp_error ("elements of array `%#D' have incomplete type", decl
);
7731 else if (!COMPLETE_TYPE_P (type
))
7733 cp_error ("`%D' has incomplete type", decl
);
7734 TREE_TYPE (decl
) = error_mark_node
;
7739 if (TREE_CODE (decl
) == CONST_DECL
)
7741 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7743 DECL_INITIAL (decl
) = init
;
7745 /* This will keep us from needing to worry about our obstacks. */
7746 my_friendly_assert (init
!= NULL_TREE
, 149);
7749 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7751 if (TREE_STATIC (decl
))
7752 make_decl_rtl (decl
, NULL_PTR
, toplevel_bindings_p ());
7753 grok_reference_init (decl
, type
, init
);
7758 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7760 if (TREE_CODE (type
) == ARRAY_TYPE
)
7761 init
= digest_init (type
, init
, (tree
*) 0);
7762 else if (TREE_CODE (init
) == CONSTRUCTOR
7763 && TREE_HAS_CONSTRUCTOR (init
))
7765 if (TYPE_NON_AGGREGATE_CLASS (type
))
7767 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7769 init
= error_mark_node
;
7772 goto dont_use_constructor
;
7777 dont_use_constructor
:
7778 if (TREE_CODE (init
) != TREE_VEC
)
7779 init
= store_init_value (decl
, init
);
7783 /* We must hide the initializer so that expand_decl
7784 won't try to do something it does not understand. */
7785 init
= obscure_complex_init (decl
, init
);
7787 else if (DECL_EXTERNAL (decl
))
7789 else if (TYPE_P (type
)
7790 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7792 tree core_type
= strip_array_types (type
);
7794 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7796 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7797 cp_error ("structure `%D' with uninitialized const members", decl
);
7798 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7799 cp_error ("structure `%D' with uninitialized reference members",
7803 check_for_uninitialized_const_var (decl
);
7805 if (COMPLETE_TYPE_P (type
) && TYPE_NEEDS_CONSTRUCTING (type
))
7806 init
= obscure_complex_init (decl
, NULL_TREE
);
7810 check_for_uninitialized_const_var (decl
);
7815 /* If DECL is not a local variable, give it RTL. */
7818 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
7821 const char *asmspec
;
7826 type
= TREE_TYPE (decl
);
7827 toplev
= toplevel_bindings_p ();
7829 /* Handle non-variables up front. */
7830 if (TREE_CODE (decl
) != VAR_DECL
)
7832 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7836 /* Set the DECL_ASSEMBLER_NAME for the variable. */
7838 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7840 if (DECL_VIRTUAL_P (decl
))
7841 make_decl_rtl (decl
, NULL_PTR
, toplev
);
7842 else if (TREE_READONLY (decl
)
7843 && DECL_INITIAL (decl
) != NULL_TREE
7844 && DECL_INITIAL (decl
) != error_mark_node
7845 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
7847 DECL_INITIAL (decl
) = save_expr (DECL_INITIAL (decl
));
7849 if (toplev
&& ! TREE_PUBLIC (decl
))
7851 /* If this is a static const, change its apparent linkage
7852 if it belongs to a #pragma interface. */
7853 if (!interface_unknown
)
7855 TREE_PUBLIC (decl
) = 1;
7856 DECL_EXTERNAL (decl
) = interface_only
;
7858 make_decl_rtl (decl
, asmspec
, toplev
);
7861 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7863 else if (DECL_LANG_SPECIFIC (decl
) && DECL_IN_AGGR_P (decl
))
7865 my_friendly_assert (TREE_STATIC (decl
), 19990828);
7867 if (init
== NULL_TREE
7868 #ifdef DEFAULT_STATIC_DEFS
7869 /* If this code is dead, then users must
7870 explicitly declare static member variables
7871 outside the class def'n as well. */
7872 && TYPE_NEEDS_CONSTRUCTING (type
)
7876 DECL_EXTERNAL (decl
) = 1;
7877 make_decl_rtl (decl
, asmspec
, 1);
7880 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7882 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7883 || (TREE_CODE (decl
) == VAR_DECL
&& TREE_STATIC (decl
)))
7884 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7887 /* Create RTL for the local static variable DECL. */
7890 make_rtl_for_local_static (decl
)
7893 const char *asmspec
= NULL
;
7895 /* If we inlined this variable, we could see it's declaration
7897 if (DECL_RTL (decl
))
7900 if (DECL_ASSEMBLER_NAME (decl
) != DECL_NAME (decl
))
7902 /* The only way this situaton can occur is if the
7903 user specified a name for this DECL using the
7904 `attribute' syntax. */
7905 asmspec
= IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
));
7906 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
7909 rest_of_decl_compilation (decl
, asmspec
, /*top_level=*/0, /*at_end=*/0);
7912 /* The old ARM scoping rules injected variables declared in the
7913 initialization statement of a for-statement into the surrounding
7914 scope. We support this usage, in order to be backward-compatible.
7915 DECL is a just-declared VAR_DECL; if necessary inject its
7916 declaration into the surrounding scope. */
7919 maybe_inject_for_scope_var (decl
)
7922 if (current_binding_level
->is_for_scope
)
7924 struct binding_level
*outer
7925 = current_binding_level
->level_chain
;
7927 /* Check to see if the same name is already bound at the outer
7928 level, either because it was directly declared, or because a
7929 dead for-decl got preserved. In either case, the code would
7930 not have been valid under the ARM scope rules, so clear
7931 is_for_scope for the current_binding_level.
7933 Otherwise, we need to preserve the temp slot for decl to last
7934 into the outer binding level. */
7937 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7939 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7940 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7942 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7944 BINDING_VALUE (outer_binding
)
7945 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7946 current_binding_level
->is_for_scope
= 0;
7948 else if (DECL_IN_MEMORY_P (decl
))
7949 preserve_temp_slots (DECL_RTL (decl
));
7953 /* Generate code to initialize DECL (a local variable). */
7956 initialize_local_var (decl
, init
, flags
)
7961 tree type
= TREE_TYPE (decl
);
7963 /* If the type is bogus, don't bother initializing the variable. */
7964 if (type
== error_mark_node
)
7967 if (DECL_SIZE (decl
) == NULL_TREE
&& !TREE_STATIC (decl
))
7969 /* If we used it already as memory, it must stay in memory. */
7970 DECL_INITIAL (decl
) = NULL_TREE
;
7971 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7974 /* Local statics are handled differently from ordinary automatic
7976 if (TREE_STATIC (decl
))
7978 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7979 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7980 expand_static_init (decl
, init
);
7984 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7988 /* Compute and store the initial value. */
7989 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7991 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7993 int saved_stmts_are_full_exprs_p
;
7995 emit_line_note (DECL_SOURCE_FILE (decl
),
7996 DECL_SOURCE_LINE (decl
));
7997 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p
;
7998 stmts_are_full_exprs_p
= 1;
7999 if (building_stmt_tree ())
8000 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
8002 genrtl_expr_stmt (build_aggr_init (decl
, init
, flags
));
8003 stmts_are_full_exprs_p
= saved_stmts_are_full_exprs_p
;
8006 /* Set this to 0 so we can tell whether an aggregate which was
8007 initialized was ever used. Don't do this if it has a
8008 destructor, so we don't complain about the 'resource
8009 allocation is initialization' idiom. Now set
8010 attribute((unused)) on types so decls of that type will be
8011 marked used. (see TREE_USED, above.) */
8012 if (TYPE_NEEDS_CONSTRUCTING (type
)
8014 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type
)
8015 && DECL_NAME (decl
))
8016 TREE_USED (decl
) = 0;
8017 else if (already_used
)
8018 TREE_USED (decl
) = 1;
8022 /* Generate code to destroy DECL (a local variable). */
8025 destroy_local_var (decl
)
8028 tree type
= TREE_TYPE (decl
);
8031 /* Only variables get cleaned up. */
8032 if (TREE_CODE (decl
) != VAR_DECL
)
8035 /* And only things with destructors need cleaning up. */
8036 if (type
== error_mark_node
8037 || TYPE_HAS_TRIVIAL_DESTRUCTOR (type
))
8040 if (TREE_CODE (decl
) == VAR_DECL
&&
8041 (DECL_EXTERNAL (decl
) || TREE_STATIC (decl
)))
8042 /* We don't clean up things that aren't defined in this
8043 translation unit, or that need a static cleanup. The latter
8044 are handled by finish_file. */
8047 /* Compute the cleanup. */
8048 cleanup
= maybe_build_cleanup (decl
);
8050 /* Record the cleanup required for this declaration. */
8051 if (DECL_SIZE (decl
) && TREE_TYPE (decl
) != error_mark_node
8053 finish_decl_cleanup (decl
, cleanup
);
8056 /* Let the back-end know about DECL. */
8059 emit_local_var (decl
)
8062 /* Create RTL for this variable. */
8063 if (DECL_RTL (decl
))
8064 /* Only a RESULT_DECL should have non-NULL RTL when arriving here.
8065 All other local variables are assigned RTL in this function. */
8066 my_friendly_assert (TREE_CODE (decl
) == RESULT_DECL
,
8070 if (DECL_ASSEMBLER_NAME (decl
) != DECL_NAME (decl
))
8071 /* The user must have specified an assembler name for this
8072 variable. Set that up now. */
8073 rest_of_decl_compilation
8074 (decl
, IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)),
8075 /*top_level=*/0, /*at_end=*/0);
8080 /* Actually do the initialization. */
8081 if (stmts_are_full_exprs_p
)
8082 expand_start_target_temps ();
8084 expand_decl_init (decl
);
8086 if (stmts_are_full_exprs_p
)
8087 expand_end_target_temps ();
8090 /* Finish processing of a declaration;
8091 install its line number and initial value.
8092 If the length of an array type is not known before,
8093 it must be determined now, from the initial value, or it is an error.
8095 INIT0 holds the value of an initializer that should be allowed to escape
8098 FLAGS is LOOKUP_ONLYCONVERTING if the = init syntax was used, else 0
8099 if the (init) syntax was used. */
8102 cp_finish_decl (decl
, init
, asmspec_tree
, flags
)
8108 tree ttype
= NULL_TREE
;
8109 const char *asmspec
= NULL
;
8110 int was_readonly
= 0;
8115 error ("assignment (not initialization) in declaration");
8119 /* If a name was specified, get the string. */
8121 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
8123 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
8125 cp_error ("cannot initialize `%D' to namespace `%D'",
8130 if (current_class_type
8131 && CP_DECL_CONTEXT (decl
) == current_class_type
8132 && TYPE_BEING_DEFINED (current_class_type
)
8133 && (DECL_INITIAL (decl
) || init
))
8134 DECL_DEFINED_IN_CLASS_P (decl
) = 1;
8136 if (TREE_CODE (decl
) == VAR_DECL
8137 && DECL_CONTEXT (decl
)
8138 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
8139 && DECL_CONTEXT (decl
) != current_namespace
8142 /* Leave the namespace of the object. */
8143 pop_decl_namespace ();
8146 type
= TREE_TYPE (decl
);
8148 if (type
== error_mark_node
)
8151 /* Add this declaration to the statement-tree. */
8152 if (building_stmt_tree () && at_function_scope_p ())
8153 add_decl_stmt (decl
);
8155 if (TYPE_HAS_MUTABLE_P (type
))
8156 TREE_READONLY (decl
) = 0;
8158 if (processing_template_decl
)
8160 if (init
&& DECL_INITIAL (decl
))
8161 DECL_INITIAL (decl
) = init
;
8165 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
8166 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
8168 /* Take care of TYPE_DECLs up front. */
8169 if (TREE_CODE (decl
) == TYPE_DECL
)
8171 if (init
&& DECL_INITIAL (decl
))
8173 /* typedef foo = bar; store the type of bar as the type of foo. */
8174 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
8175 DECL_INITIAL (decl
) = init
= NULL_TREE
;
8177 if (type
!= error_mark_node
8178 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
8180 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
8181 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
8182 set_identifier_type_value (DECL_NAME (decl
), type
);
8183 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
8185 GNU_xref_decl (current_function_decl
, decl
);
8187 /* If we have installed this as the canonical typedef for this
8188 type, and that type has not been defined yet, delay emitting
8189 the debug information for it, as we will emit it later. */
8190 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
8191 && !COMPLETE_TYPE_P (TREE_TYPE (decl
)))
8192 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
8194 rest_of_decl_compilation (decl
, NULL_PTR
,
8195 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
8199 if (TREE_CODE (decl
) != FUNCTION_DECL
)
8200 ttype
= target_type (type
);
8202 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
8203 && TYPE_NEEDS_CONSTRUCTING (type
))
8205 /* Currently, GNU C++ puts constants in text space, making them
8206 impossible to initialize. In the future, one would hope for
8207 an operating system which understood the difference between
8208 initialization and the running of a program. */
8210 TREE_READONLY (decl
) = 0;
8213 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
8215 /* This must override the asm specifier which was placed by
8216 grokclassfn. Lay this out fresh. */
8217 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
8218 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
8219 make_decl_rtl (decl
, asmspec
, 0);
8222 /* Deduce size of array from initialization, if not already known. */
8223 maybe_deduce_size_from_array_init (decl
, init
);
8224 init
= check_initializer (decl
, init
);
8226 GNU_xref_decl (current_function_decl
, decl
);
8228 if (TREE_CODE (decl
) == VAR_DECL
)
8229 layout_var_decl (decl
);
8231 /* Output the assembler code and/or RTL code for variables and functions,
8232 unless the type is an undefined structure or union.
8233 If not, it will get done when the type is completed. */
8234 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
8235 || TREE_CODE (decl
) == RESULT_DECL
)
8237 if (TREE_CODE (decl
) == VAR_DECL
)
8238 maybe_commonize_var (decl
);
8240 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
8242 if (TREE_CODE (type
) == FUNCTION_TYPE
8243 || TREE_CODE (type
) == METHOD_TYPE
)
8244 abstract_virtuals_error (decl
,
8245 strip_array_types (TREE_TYPE (type
)));
8247 abstract_virtuals_error (decl
, strip_array_types (type
));
8249 if (TREE_CODE (decl
) == FUNCTION_DECL
)
8251 else if (DECL_EXTERNAL (decl
)
8252 && ! (DECL_LANG_SPECIFIC (decl
)
8253 && DECL_NOT_REALLY_EXTERN (decl
)))
8256 DECL_INITIAL (decl
) = init
;
8258 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
8260 /* This is a local declaration. */
8261 if (doing_semantic_analysis_p ())
8262 maybe_inject_for_scope_var (decl
);
8263 /* Initialize the local variable. But, if we're building a
8264 statement-tree, we'll do the initialization when we
8266 if (processing_template_decl
)
8268 if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
8269 DECL_INITIAL (decl
) = init
;
8273 /* If we're not building RTL, then we need to do so
8275 if (!building_stmt_tree ())
8276 emit_local_var (decl
);
8277 /* Initialize the variable. */
8278 initialize_local_var (decl
, init
, flags
);
8279 /* Clean up the variable. */
8280 destroy_local_var (decl
);
8283 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
8285 /* Cleanups for static variables are handled by `finish_file'. */
8286 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
8287 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
8288 expand_static_init (decl
, init
);
8292 /* Undo call to `pushclass' that was done in `start_decl'
8293 due to initialization of qualified member variable.
8294 I.e., Foo::x = 10; */
8296 tree context
= CP_DECL_CONTEXT (decl
);
8299 && (TREE_CODE (decl
) == VAR_DECL
8300 /* We also have a pushclass done that we need to undo here
8301 if we're at top level and declare a method. */
8302 || TREE_CODE (decl
) == FUNCTION_DECL
)
8303 /* If size hasn't been set, we're still defining it,
8304 and therefore inside the class body; don't pop
8305 the binding level.. */
8306 && COMPLETE_TYPE_P (context
)
8307 && context
== current_class_type
)
8308 pop_nested_class ();
8315 TREE_READONLY (decl
) = 1;
8318 /* This is here for a midend callback from c-common.c */
8321 finish_decl (decl
, init
, asmspec_tree
)
8325 cp_finish_decl (decl
, init
, asmspec_tree
, 0);
8328 /* Returns a declaration for a VAR_DECL as if:
8330 extern "C" TYPE NAME;
8332 had been seen. Used to create compiler-generated global
8336 declare_global_var (name
, type
)
8342 push_to_top_level ();
8343 decl
= build_decl (VAR_DECL
, name
, type
);
8344 TREE_PUBLIC (decl
) = 1;
8345 DECL_EXTERNAL (decl
) = 1;
8346 DECL_ARTIFICIAL (decl
) = 1;
8348 cp_finish_decl (decl
, NULL_TREE
, NULL_TREE
, 0);
8349 pop_from_top_level ();
8354 /* Returns a pointer to the `atexit' function. Note that if
8355 FLAG_USE_CXA_ATEXIT is non-zero, then this will actually be the new
8356 `__cxa_atexit' function specified in the IA64 C++ ABI. */
8370 if (flag_use_cxa_atexit
)
8372 /* The declaration for `__cxa_atexit' is:
8374 int __cxa_atexit (void (*)(void *), void *, void *)
8376 We build up the argument types and then then function type
8379 /* First, build the pointer-to-function type for the first
8381 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8382 fn_type
= build_function_type (void_type_node
, arg_types
);
8383 fn_ptr_type
= build_pointer_type (fn_type
);
8384 /* Then, build the rest of the argument types. */
8385 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8386 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, arg_types
);
8387 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, arg_types
);
8388 /* And the final __cxa_atexit type. */
8389 fn_type
= build_function_type (integer_type_node
, arg_types
);
8390 fn_ptr_type
= build_pointer_type (fn_type
);
8391 name
= "__cxa_atexit";
8395 /* The declaration for `atexit' is:
8397 int atexit (void (*)());
8399 We build up the argument types and then then function type
8401 fn_type
= build_function_type (void_type_node
, void_list_node
);
8402 fn_ptr_type
= build_pointer_type (fn_type
);
8403 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, void_list_node
);
8404 /* Build the final atexit type. */
8405 fn_type
= build_function_type (integer_type_node
, arg_types
);
8409 /* Now, build the function declaration. */
8410 push_lang_context (lang_name_c
);
8411 atexit_fndecl
= build_library_fn_ptr (name
, fn_type
);
8412 mark_used (atexit_fndecl
);
8413 pop_lang_context ();
8414 atexit_node
= default_conversion (atexit_fndecl
);
8419 /* Returns the __dso_handle VAR_DECL. */
8422 get_dso_handle_node ()
8424 if (dso_handle_node
)
8425 return dso_handle_node
;
8427 /* Declare the variable. */
8428 dso_handle_node
= declare_global_var (get_identifier ("__dso_handle"),
8431 return dso_handle_node
;
8434 /* Begin a new function with internal linkage whose job will be simply
8435 to destroy some particular variable. */
8440 static int counter
= 0;
8441 int old_interface_unknown
= interface_unknown
;
8447 push_to_top_level ();
8449 /* No need to mangle this. */
8450 push_lang_context (lang_name_c
);
8452 interface_unknown
= 1;
8454 /* Build the parameter-types. */
8455 parmtypes
= void_list_node
;
8456 /* Functions passed to __cxa_atexit take an additional parameter.
8457 We'll just ignore it. After we implement the new calling
8458 convention for destructors, we can eliminate the use of
8459 additional cleanup functions entirely in the -fnew-abi case. */
8460 if (flag_use_cxa_atexit
)
8461 parmtypes
= tree_cons (NULL_TREE
, ptr_type_node
, parmtypes
);
8462 /* Build the function type itself. */
8463 fntype
= build_function_type (void_type_node
, parmtypes
);
8464 /* Build the name of the function. */
8465 sprintf (name
, "__tcf_%d", counter
++);
8466 /* Build the function declaration. */
8467 fndecl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), fntype
);
8468 /* It's a function with internal linkage, generated by the
8470 TREE_PUBLIC (fndecl
) = 0;
8471 DECL_ARTIFICIAL (fndecl
) = 1;
8472 /* Build the parameter. */
8473 if (flag_use_cxa_atexit
)
8477 parmdecl
= build_decl (PARM_DECL
, NULL_TREE
, ptr_type_node
);
8478 DECL_CONTEXT (parmdecl
) = fndecl
;
8479 DECL_ARG_TYPE (parmdecl
) = ptr_type_node
;
8480 TREE_USED (parmdecl
) = 1;
8481 DECL_ARGUMENTS (fndecl
) = parmdecl
;
8485 start_function (/*specs=*/NULL_TREE
, fndecl
, NULL_TREE
, SF_PRE_PARSED
);
8488 interface_unknown
= old_interface_unknown
;
8490 pop_lang_context ();
8492 return current_function_decl
;
8495 /* Finish the cleanup function begun by start_cleanup_fn. */
8502 expand_body (finish_function (0));
8504 pop_from_top_level ();
8507 /* Generate code to handle the destruction of DECL, an object with
8508 static storage duration. */
8511 register_dtor_fn (decl
)
8519 int saved_flag_access_control
;
8521 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl
)))
8524 /* Call build_cleanup before we enter the anonymous function so that
8525 any access checks will be done relative to the current scope,
8526 rather than the scope of the anonymous function. */
8527 build_cleanup (decl
);
8529 /* Now start the function. */
8530 cleanup
= start_cleanup_fn ();
8532 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
8533 to the original function, rather than the anonymous one. That
8534 will make the back-end think that nested functions are in use,
8535 which causes confusion. */
8536 saved_flag_access_control
= flag_access_control
;
8537 flag_access_control
= 0;
8538 fcall
= build_cleanup (decl
);
8539 flag_access_control
= saved_flag_access_control
;
8541 /* Create the body of the anonymous function. */
8542 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
8543 finish_expr_stmt (fcall
);
8544 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
8547 /* Call atexit with the cleanup function. */
8548 mark_addressable (cleanup
);
8549 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
8550 if (flag_use_cxa_atexit
)
8552 args
= tree_cons (NULL_TREE
, get_dso_handle_node (), NULL_TREE
);
8553 args
= tree_cons (NULL_TREE
, null_pointer_node
, args
);
8554 args
= tree_cons (NULL_TREE
, cleanup
, args
);
8557 args
= tree_cons (NULL_TREE
, cleanup
, NULL_TREE
);
8558 finish_expr_stmt (build_function_call (get_atexit_node (), args
));
8562 expand_static_init (decl
, init
)
8566 tree oldstatic
= value_member (decl
, static_aggregates
);
8570 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
8571 cp_error ("multiple initializations given for `%D'", decl
);
8573 else if (! toplevel_bindings_p ())
8575 /* Emit code to perform this initialization but once. */
8582 /* Emit code to perform this initialization but once. This code
8585 static int temp = 0;
8587 // Do initialization.
8589 // Register variable for destruction at end of program.
8592 Note that the `temp' variable is only set to 1 *after* the
8593 initialization is complete. This ensures that an exception,
8594 thrown during the construction, will cause the variable to
8595 reinitialized when we pass through this code again, as per:
8599 If the initialization exits by throwing an exception, the
8600 initialization is not complete, so it will be tried again
8601 the next time control enters the declaration.
8603 In theory, this process should be thread-safe, too; multiple
8604 threads should not be able to initialize the variable more
8605 than once. We don't yet attempt to ensure thread-safety. */
8606 temp
= get_temp_name (integer_type_node
, 1);
8607 rest_of_decl_compilation (temp
, NULL_PTR
, 0, 0);
8609 /* Begin the conditional initialization. */
8610 if_stmt
= begin_if_stmt ();
8611 finish_if_stmt_cond (build_binary_op (EQ_EXPR
, temp
,
8614 then_clause
= begin_compound_stmt (/*has_no_scope=*/0);
8616 /* Do the initialization itself. */
8617 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
8618 || (init
&& TREE_CODE (init
) == TREE_LIST
))
8619 assignment
= build_aggr_init (decl
, init
, 0);
8621 /* The initialization we're doing here is just a bitwise
8623 assignment
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
8625 assignment
= NULL_TREE
;
8627 /* Once the assignment is complete, set TEMP to 1. Since the
8628 construction of the static object is complete at this point,
8629 we want to make sure TEMP is set to 1 even if a temporary
8630 constructed during the initialization throws an exception
8631 when it is destroyed. So, we combine the initialization and
8632 the assignment to TEMP into a single expression, ensuring
8633 that when we call finish_expr_stmt the cleanups will not be
8634 run until after TEMP is set to 1. */
8635 temp_init
= build_modify_expr (temp
, NOP_EXPR
, integer_one_node
);
8638 assignment
= tree_cons (NULL_TREE
, assignment
,
8639 build_tree_list (NULL_TREE
,
8641 assignment
= build_compound_expr (assignment
);
8644 assignment
= temp_init
;
8645 finish_expr_stmt (assignment
);
8647 /* Use atexit to register a function for destroying this static
8649 register_dtor_fn (decl
);
8651 finish_compound_stmt (/*has_no_scope=*/0, then_clause
);
8652 finish_then_clause (if_stmt
);
8656 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8659 /* Finish the declaration of a catch-parameter. */
8662 start_handler_parms (declspecs
, declarator
)
8669 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8671 if (decl
== NULL_TREE
)
8672 error ("invalid catch parameter");
8681 /* Make TYPE a complete type based on INITIAL_VALUE.
8682 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8683 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8686 complete_array_type (type
, initial_value
, do_default
)
8687 tree type
, initial_value
;
8690 register tree maxindex
= NULL_TREE
;
8695 /* Note MAXINDEX is really the maximum index,
8696 one less than the size. */
8697 if (TREE_CODE (initial_value
) == STRING_CST
)
8700 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8701 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8704 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8706 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8708 maxindex
= ssize_int (-1);
8709 for (; elts
; elts
= TREE_CHAIN (elts
))
8711 if (TREE_PURPOSE (elts
))
8712 maxindex
= TREE_PURPOSE (elts
);
8714 maxindex
= size_binop (PLUS_EXPR
, maxindex
, ssize_int (1));
8716 maxindex
= copy_node (maxindex
);
8720 /* Make an error message unless that happened already. */
8721 if (initial_value
!= error_mark_node
)
8724 initial_value
= NULL_TREE
;
8726 /* Prevent further error messages. */
8727 maxindex
= build_int_2 (0, 0);
8734 maxindex
= build_int_2 (0, 0);
8743 domain
= build_index_type (maxindex
);
8744 TYPE_DOMAIN (type
) = domain
;
8746 if (! TREE_TYPE (maxindex
))
8747 TREE_TYPE (maxindex
) = domain
;
8749 itype
= TREE_TYPE (initial_value
);
8752 if (itype
&& !TYPE_DOMAIN (itype
))
8753 TYPE_DOMAIN (itype
) = domain
;
8754 /* The type of the main variant should never be used for arrays
8755 of different sizes. It should only ever be completed with the
8756 size of the array. */
8757 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8758 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8761 /* Lay out the type now that we can get the real answer. */
8768 /* Return zero if something is declared to be a member of type
8769 CTYPE when in the context of CUR_TYPE. STRING is the error
8770 message to print in that case. Otherwise, quietly return 1. */
8773 member_function_or_else (ctype
, cur_type
, flags
)
8774 tree ctype
, cur_type
;
8775 enum overload_flags flags
;
8777 if (ctype
&& ctype
!= cur_type
)
8779 if (flags
== DTOR_FLAG
)
8780 error ("destructor for alien class `%s' cannot be a member",
8781 TYPE_NAME_STRING (ctype
));
8783 error ("constructor for alien class `%s' cannot be a member",
8784 TYPE_NAME_STRING (ctype
));
8790 /* Subroutine of `grokdeclarator'. */
8792 /* Generate errors possibly applicable for a given set of specifiers.
8793 This is for ARM $7.1.2. */
8796 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8799 int virtualp
, quals
, friendp
, raises
, inlinep
;
8802 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8804 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8806 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8809 cp_error_at ("`%D' declared as a friend", object
);
8811 cp_error_at ("`%D' declared with an exception specification", object
);
8814 /* CTYPE is class type, or null if non-class.
8815 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8817 DECLARATOR is the function's name.
8818 VIRTUALP is truthvalue of whether the function is virtual or not.
8819 FLAGS are to be passed through to `grokclassfn'.
8820 QUALS are qualifiers indicating whether the function is `const'
8822 RAISES is a list of exceptions that this function can raise.
8823 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8824 not look, and -1 if we should not call `grokclassfn' at all.
8826 Returns `NULL_TREE' if something goes wrong, after issuing
8827 applicable error messages. */
8830 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8831 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8832 template_count
, in_namespace
)
8835 tree orig_declarator
;
8837 enum overload_flags flags
;
8839 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8843 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8844 int has_default_arg
= 0;
8848 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8849 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8855 type
= build_exception_variant (type
, raises
);
8858 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8859 /* Propagate volatile out from type to decl. */
8860 if (TYPE_VOLATILE (type
))
8861 TREE_THIS_VOLATILE (decl
) = 1;
8863 /* If this decl has namespace scope, set that up. */
8865 set_decl_namespace (decl
, in_namespace
, friendp
);
8866 else if (publicp
&& ! ctype
)
8867 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8869 /* `main' and builtins have implicit 'C' linkage. */
8870 if ((MAIN_NAME_P (declarator
)
8871 || (IDENTIFIER_LENGTH (declarator
) > 10
8872 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8873 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8874 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8875 && current_lang_name
== lang_name_cplusplus
8876 && ctype
== NULL_TREE
8877 /* NULL_TREE means global namespace. */
8878 && DECL_CONTEXT (decl
) == NULL_TREE
)
8879 DECL_LANGUAGE (decl
) = lang_c
;
8881 /* Should probably propagate const out from type to decl I bet (mrs). */
8884 DECL_STATIC_FUNCTION_P (decl
) = 1;
8885 DECL_CONTEXT (decl
) = ctype
;
8889 DECL_CONTEXT (decl
) = ctype
;
8891 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8893 if (processing_template_decl
)
8894 error ("cannot declare `::main' to be a template");
8896 error ("cannot declare `::main' to be inline");
8898 error ("cannot declare `::main' to be static");
8903 /* Members of anonymous types and local classes have no linkage; make
8905 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8906 || decl_function_context (TYPE_MAIN_DECL (ctype
))))
8911 /* [basic.link]: A name with no linkage (notably, the name of a class
8912 or enumeration declared in a local scope) shall not be used to
8913 declare an entity with linkage.
8915 Only check this for public decls for now. */
8916 t
= no_linkage_check (TREE_TYPE (decl
));
8919 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8921 if (DECL_EXTERN_C_P (decl
))
8922 /* Allow this; it's pretty common in C. */;
8924 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8928 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8933 TREE_PUBLIC (decl
) = publicp
;
8936 DECL_INTERFACE_KNOWN (decl
) = 1;
8937 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8941 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8943 DECL_EXTERNAL (decl
) = 1;
8944 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8946 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8947 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8951 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8952 grok_op_properties (decl
, virtualp
, check
< 0);
8954 if (ctype
&& decl_function_context (decl
))
8955 DECL_NO_STATIC_CHAIN (decl
) = 1;
8957 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8958 if (TREE_PURPOSE (t
)
8959 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8961 has_default_arg
= 1;
8966 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8970 ("defining explicit specialization `%D' in friend declaration",
8974 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8976 /* Something like `template <class T> friend void f<T>()'. */
8977 cp_error ("invalid use of template-id `%D' in declaration of primary template",
8983 /* A friend declaration of the form friend void f<>(). Record
8984 the information in the TEMPLATE_ID_EXPR. */
8985 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8986 DECL_TEMPLATE_INFO (decl
)
8987 = tree_cons (TREE_OPERAND (orig_declarator
, 0),
8988 TREE_OPERAND (orig_declarator
, 1),
8991 if (has_default_arg
)
8993 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
9000 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
9007 if (has_default_arg
)
9008 add_defarg_fn (decl
);
9010 /* Plain overloading: will not be grok'd by grokclassfn. */
9011 if (! ctype
&& ! processing_template_decl
9012 && !DECL_EXTERN_C_P (decl
)
9013 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
9014 set_mangled_name_for_decl (decl
);
9017 /* Make the init_value nonzero so pushdecl knows this is not
9018 tentative. error_mark_node is replaced later with the BLOCK. */
9019 DECL_INITIAL (decl
) = error_mark_node
;
9021 if (TYPE_NOTHROW_P (type
) || nothrow_libfn_p (decl
))
9022 TREE_NOTHROW (decl
) = 1;
9024 /* Caller will do the rest of this. */
9028 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
9029 DECL_CONSTRUCTOR_P (decl
) = 1;
9031 /* Function gets the ugly name, field gets the nice one. This call
9032 may change the type of the function (because of default
9034 if (ctype
!= NULL_TREE
)
9035 grokclassfn (ctype
, decl
, flags
, quals
);
9037 decl
= check_explicit_specialization (orig_declarator
, decl
,
9039 2 * (funcdef_flag
!= 0) +
9040 4 * (friendp
!= 0));
9041 if (decl
== error_mark_node
)
9044 if (ctype
!= NULL_TREE
9045 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
9050 old_decl
= check_classfn (ctype
, decl
);
9052 if (old_decl
&& TREE_CODE (old_decl
) == TEMPLATE_DECL
)
9053 /* Because grokfndecl is always supposed to return a
9054 FUNCTION_DECL, we pull out the DECL_TEMPLATE_RESULT
9055 here. We depend on our callers to figure out that its
9056 really a template that's being returned. */
9057 old_decl
= DECL_TEMPLATE_RESULT (old_decl
);
9059 if (old_decl
&& DECL_STATIC_FUNCTION_P (old_decl
)
9060 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
9062 /* Remove the `this' parm added by grokclassfn.
9063 XXX Isn't this done in start_function, too? */
9064 revert_static_member_fn (decl
);
9065 last_function_parms
= TREE_CHAIN (last_function_parms
);
9067 if (old_decl
&& DECL_ARTIFICIAL (old_decl
))
9068 cp_error ("definition of implicitly-declared `%D'", old_decl
);
9072 /* Since we've smashed OLD_DECL to its
9073 DECL_TEMPLATE_RESULT, we must do the same to DECL. */
9074 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
9075 decl
= DECL_TEMPLATE_RESULT (decl
);
9077 /* Attempt to merge the declarations. This can fail, in
9078 the case of some illegal specialization declarations. */
9079 if (!duplicate_decls (decl
, old_decl
))
9080 cp_error ("no `%#D' member function declared in class `%T'",
9086 if (DECL_CONSTRUCTOR_P (decl
) && !grok_ctor_properties (ctype
, decl
))
9089 if (ctype
== NULL_TREE
|| check
)
9094 DECL_VIRTUAL_P (decl
) = 1;
9095 if (DECL_VINDEX (decl
) == NULL_TREE
)
9096 DECL_VINDEX (decl
) = error_mark_node
;
9097 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
9104 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
9107 RID_BIT_TYPE
*specbits_in
;
9113 RID_BIT_TYPE specbits
;
9115 specbits
= *specbits_in
;
9117 if (TREE_CODE (type
) == OFFSET_TYPE
)
9119 /* If you declare a static member so that it
9120 can be initialized, the code will reach here. */
9121 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
9122 type
= TREE_TYPE (type
);
9123 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
9124 DECL_CONTEXT (decl
) = basetype
;
9125 /* DECL_ASSEMBLER_NAME is needed only for full-instantiated
9127 if (!uses_template_parms (decl
))
9130 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
9132 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
,
9141 context
= in_namespace
;
9142 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
9143 context
= current_namespace
;
9145 context
= NULL_TREE
;
9147 if (processing_template_decl
&& context
)
9148 /* For global variables, declared in a template, we need the
9150 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
9152 decl
= build_decl (VAR_DECL
, declarator
, type
);
9155 set_decl_namespace (decl
, context
, 0);
9157 context
= DECL_CONTEXT (decl
);
9158 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
9161 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
9163 DECL_ASSEMBLER_NAME (decl
)
9164 = build_static_name (context
, declarator
);
9169 set_decl_namespace (decl
, in_namespace
, 0);
9171 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
9173 DECL_THIS_EXTERN (decl
) = 1;
9174 DECL_EXTERNAL (decl
) = !initialized
;
9177 /* In class context, static means one per class,
9178 public access, and static storage. */
9179 if (DECL_CLASS_SCOPE_P (decl
))
9181 TREE_PUBLIC (decl
) = 1;
9182 TREE_STATIC (decl
) = 1;
9183 DECL_EXTERNAL (decl
) = 0;
9185 /* At top level, either `static' or no s.c. makes a definition
9186 (perhaps tentative), and absence of `static' makes it public. */
9187 else if (toplevel_bindings_p ())
9189 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
9190 && (DECL_THIS_EXTERN (decl
) || ! constp
));
9191 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
9193 /* Not at top level, only `static' makes a static definition. */
9196 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
9197 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
9200 if (TREE_PUBLIC (decl
))
9202 /* [basic.link]: A name with no linkage (notably, the name of a class
9203 or enumeration declared in a local scope) shall not be used to
9204 declare an entity with linkage.
9206 Only check this for public decls for now. */
9207 tree t
= no_linkage_check (TREE_TYPE (decl
));
9210 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
9211 /* Ignore for now; `enum { foo } e' is pretty common. */;
9213 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
9221 /* Create and return a canonical pointer to member function type, for
9222 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
9225 build_ptrmemfunc_type (type
)
9231 tree unqualified_variant
= NULL_TREE
;
9233 /* If a canonical type already exists for this type, use it. We use
9234 this method instead of type_hash_canon, because it only does a
9235 simple equality check on the list of field members. */
9237 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
9240 /* Make sure that we always have the unqualified pointer-to-member
9242 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9244 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
9246 t
= make_aggr_type (RECORD_TYPE
);
9247 /* Let the front-end know this is a pointer to member function... */
9248 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
9249 /* ... and not really an aggregate. */
9250 SET_IS_AGGR_TYPE (t
, 0);
9254 u
= make_aggr_type (UNION_TYPE
);
9255 SET_IS_AGGR_TYPE (u
, 0);
9256 fields
[0] = build_decl (FIELD_DECL
, pfn_identifier
, type
);
9257 fields
[1] = build_decl (FIELD_DECL
, delta2_identifier
,
9259 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9260 TYPE_NAME (u
) = NULL_TREE
;
9262 fields
[0] = build_decl (FIELD_DECL
, delta_identifier
,
9264 fields
[1] = build_decl (FIELD_DECL
, index_identifier
,
9266 fields
[2] = build_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
9267 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
9271 fields
[0] = build_decl (FIELD_DECL
, pfn_identifier
, type
);
9272 fields
[1] = build_decl (FIELD_DECL
, delta_identifier
,
9274 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9277 /* Zap out the name so that the back-end will give us the debugging
9278 information for this anonymous RECORD_TYPE. */
9279 TYPE_NAME (t
) = NULL_TREE
;
9281 /* If this is not the unqualified form of this pointer-to-member
9282 type, set the TYPE_MAIN_VARIANT for this type to be the
9283 unqualified type. Since they are actually RECORD_TYPEs that are
9284 not variants of each other, we must do this manually. */
9285 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9287 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
9288 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
9289 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
9290 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
9293 /* Cache this pointer-to-member type so that we can find it again
9295 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
9297 /* Seems to be wanted. */
9298 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
9303 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
9304 Check to see that the definition is valid. Issue appropriate error
9305 messages. Return 1 if the definition is particularly bad, or 0
9309 check_static_variable_definition (decl
, type
)
9313 /* Motion 10 at San Diego: If a static const integral data member is
9314 initialized with an integral constant expression, the initializer
9315 may appear either in the declaration (within the class), or in
9316 the definition, but not both. If it appears in the class, the
9317 member is a member constant. The file-scope definition is always
9319 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
9321 cp_error ("invalid in-class initialization of static data member of non-integral type `%T'",
9323 /* If we just return the declaration, crashes will sometimes
9324 occur. We therefore return void_type_node, as if this was a
9325 friend declaration, to cause callers to completely ignore
9326 this declaration. */
9329 else if (!CP_TYPE_CONST_P (type
))
9330 cp_error ("ISO C++ forbids in-class initialization of non-const static member `%D'",
9332 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
9333 cp_pedwarn ("ISO C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
9338 /* Given the SIZE (i.e., number of elements) in an array, compute an
9339 appropriate index type for the array. If non-NULL, NAME is the
9340 name of the thing being declared. */
9343 compute_array_index_type (name
, size
)
9349 /* The size might be the result of a cast. */
9350 STRIP_TYPE_NOPS (size
);
9352 /* It might be a const variable or enumeration constant. */
9353 size
= decl_constant_value (size
);
9355 /* If this involves a template parameter, it will be a constant at
9356 instantiation time, but we don't know what the value is yet.
9357 Even if no template parameters are involved, we may an expression
9358 that is not a constant; we don't even simplify `1 + 2' when
9359 processing a template. */
9360 if (processing_template_decl
)
9362 /* Resolve a qualified reference to an enumerator or static
9363 const data member of ours. */
9364 if (TREE_CODE (size
) == SCOPE_REF
9365 && TREE_OPERAND (size
, 0) == current_class_type
)
9367 tree t
= lookup_field (current_class_type
,
9368 TREE_OPERAND (size
, 1), 0, 0);
9373 return build_index_type (build_min (MINUS_EXPR
, sizetype
,
9374 size
, integer_one_node
));
9377 /* The array bound must be an integer type. */
9378 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9379 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
9380 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
9383 cp_error ("size of array `%D' has non-integer type", name
);
9385 cp_error ("size of array has non-integer type");
9386 size
= integer_one_node
;
9389 /* Normally, the array-bound will be a constant. */
9390 if (TREE_CONSTANT (size
))
9392 /* Check to see if the array bound overflowed. Make that an
9393 error, no matter how generous we're being. */
9394 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9395 int old_pedantic
= pedantic
;
9396 pedantic
= flag_pedantic_errors
= 1;
9397 constant_expression_warning (size
);
9398 pedantic
= old_pedantic
;
9399 flag_pedantic_errors
= old_flag_pedantic_errors
;
9401 /* An array must have a positive number of elements. */
9402 if (INT_CST_LT (size
, integer_zero_node
))
9405 cp_error ("size of array `%D' is negative", name
);
9407 cp_error ("size of array is negative");
9408 size
= integer_one_node
;
9410 /* Except that an extension we allow zero-sized arrays. We
9411 always allow them in system headers because glibc uses
9413 else if (integer_zerop (size
) && pedantic
&& !in_system_header
)
9416 cp_pedwarn ("ISO C++ forbids zero-size array `%D'", name
);
9418 cp_pedwarn ("ISO C++ forbids zero-size array");
9422 /* Compute the index of the largest element in the array. It is
9423 one less than the number of elements in the array. */
9425 = fold (build_binary_op (MINUS_EXPR
,
9426 cp_convert (ssizetype
, size
),
9427 cp_convert (ssizetype
,
9428 integer_one_node
)));
9430 /* Check for variable-sized arrays. We allow such things as an
9431 extension, even though they are not allowed in ANSI/ISO C++. */
9432 if (!TREE_CONSTANT (itype
))
9437 cp_pedwarn ("ISO C++ forbids variable-size array `%D'",
9440 cp_pedwarn ("ISO C++ forbids variable-size array");
9443 /* Create a variable-sized array index type. */
9444 itype
= variable_size (itype
);
9446 /* Make sure that there was no overflow when creating to a signed
9447 index type. (For example, on a 32-bit machine, an array with
9448 size 2^32 - 1 is too big.) */
9449 else if (TREE_OVERFLOW (itype
))
9451 error ("overflow in array dimension");
9452 TREE_OVERFLOW (itype
) = 0;
9455 /* Create and return the appropriate index type. */
9456 return build_index_type (itype
);
9459 /* Returns an ARRAY_TYPE for an array with SIZE elements of the
9460 indicated TYPE. If non-NULL, NAME is the NAME of the declaration
9464 create_array_type_for_decl (name
, type
, size
)
9469 tree itype
= NULL_TREE
;
9470 const char* error_msg
;
9472 /* If things have already gone awry, bail now. */
9473 if (type
== error_mark_node
|| size
== error_mark_node
)
9474 return error_mark_node
;
9476 /* Assume that everything will go OK. */
9479 /* There are some types which cannot be array elements. */
9480 switch (TREE_CODE (type
))
9483 error_msg
= "array of void";
9487 error_msg
= "array of functions";
9490 case REFERENCE_TYPE
:
9491 error_msg
= "array of references";
9495 error_msg
= "array of data members";
9499 error_msg
= "array of function members";
9506 /* If something went wrong, issue an error-message and return. */
9510 cp_error ("declaration of `%D' as %s", name
, error_msg
);
9512 cp_error ("creating %s", error_msg
);
9514 return error_mark_node
;
9519 The constant expressions that specify the bounds of the arrays
9520 can be omitted only for the first member of the sequence. */
9521 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9523 cp_error ("declaration of `%D' as multidimensional array must have bounds for all dimensions except the first",
9526 return error_mark_node
;
9529 /* Figure out the index type for the array. */
9531 itype
= compute_array_index_type (name
, size
);
9533 return build_cplus_array_type (type
, itype
);
9536 /* Check that it's OK to declare a function with the indicated TYPE.
9537 SFK indicates the kind of special function (if any) that this
9538 function is. CTYPE is the class of which this function is a
9539 member. OPTYPE is the type given in a conversion operator
9540 declaration. Returns the actual return type of the function; that
9541 may be different than TYPE if an error occurs, or for certain
9542 special functions. */
9545 check_special_function_return_type (sfk
, type
, ctype
, optype
)
9546 special_function_kind sfk
;
9553 case sfk_constructor
:
9555 cp_error ("return type specification for constructor invalid");
9557 /* In the old ABI, we return `this'; in the new ABI we don't
9559 type
= flag_new_abi
? void_type_node
: build_pointer_type (ctype
);
9562 case sfk_destructor
:
9564 cp_error ("return type specification for destructor invalid");
9565 type
= void_type_node
;
9568 case sfk_conversion
:
9569 if (type
&& !same_type_p (type
, optype
))
9570 cp_error ("operator `%T' declared to return `%T'", optype
, type
);
9572 cp_pedwarn ("return type specified for `operator %T'", optype
);
9577 my_friendly_abort (20000408);
9584 /* Given declspecs and a declarator,
9585 determine the name and type of the object declared
9586 and construct a ..._DECL node for it.
9587 (In one case we can return a ..._TYPE node instead.
9588 For invalid input we sometimes return 0.)
9590 DECLSPECS is a chain of tree_list nodes whose value fields
9591 are the storage classes and type specifiers.
9593 DECL_CONTEXT says which syntactic context this declaration is in:
9594 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
9595 FUNCDEF for a function definition. Like NORMAL but a few different
9596 error messages in each case. Return value may be zero meaning
9597 this definition is too screwy to try to parse.
9598 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
9599 handle member functions (which have FIELD context).
9600 Return value may be zero meaning this definition is too screwy to
9602 PARM for a parameter declaration (either within a function prototype
9603 or before a function body). Make a PARM_DECL, or return void_type_node.
9604 CATCHPARM for a parameter declaration before a catch clause.
9605 TYPENAME if for a typename (in a cast or sizeof).
9606 Don't make a DECL node; just return the ..._TYPE node.
9607 FIELD for a struct or union field; make a FIELD_DECL.
9608 BITFIELD for a field with specified width.
9609 INITIALIZED is 1 if the decl has an initializer.
9611 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
9612 normal attributes in TREE_PURPOSE, or NULL_TREE.
9614 In the TYPENAME case, DECLARATOR is really an abstract declarator.
9615 It may also be so in the PARM case, for a prototype where the
9616 argument type is specified but not the name.
9618 This function is where the complicated C meanings of `static'
9619 and `extern' are interpreted.
9621 For C++, if there is any monkey business to do, the function which
9622 calls this one must do it, i.e., prepending instance variables,
9623 renaming overloaded function names, etc.
9625 Note that for this C++, it is an error to define a method within a class
9626 which does not belong to that class.
9628 Except in the case where SCOPE_REFs are implicitly known (such as
9629 methods within a class being redundantly qualified),
9630 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
9631 (class_name::decl_name). The caller must also deal with this.
9633 If a constructor or destructor is seen, and the context is FIELD,
9634 then the type gains the attribute TREE_HAS_x. If such a declaration
9635 is erroneous, NULL_TREE is returned.
9637 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
9638 function, these are the qualifiers to give to the `this' pointer. We
9639 apply TYPE_QUAL_RESTRICT to the this ptr, not the object.
9641 May return void_type_node if the declarator turned out to be a friend.
9642 See grokfield for details. */
9645 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
9648 enum decl_context decl_context
;
9652 RID_BIT_TYPE specbits
;
9655 tree type
= NULL_TREE
;
9661 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
9662 int explicit_int
= 0;
9663 int explicit_char
= 0;
9664 int defaulted_int
= 0;
9665 tree typedef_decl
= NULL_TREE
;
9667 tree typedef_type
= NULL_TREE
;
9668 int funcdef_flag
= 0;
9669 enum tree_code innermost_code
= ERROR_MARK
;
9672 /* See the code below that used this. */
9673 tree decl_machine_attr
= NULL_TREE
;
9675 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
9676 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
9677 tree init
= NULL_TREE
;
9679 /* Keep track of what sort of function is being processed
9680 so that we can warn about default return values, or explicit
9681 return values which do not match prescribed defaults. */
9682 special_function_kind sfk
= sfk_none
;
9684 tree dname
= NULL_TREE
;
9685 tree ctype
= current_class_type
;
9686 tree ctor_return_type
= NULL_TREE
;
9687 enum overload_flags flags
= NO_SPECIAL
;
9688 tree quals
= NULL_TREE
;
9689 tree raises
= NULL_TREE
;
9690 int template_count
= 0;
9691 tree in_namespace
= NULL_TREE
;
9695 RIDBIT_RESET_ALL (specbits
);
9696 if (decl_context
== FUNCDEF
)
9697 funcdef_flag
= 1, decl_context
= NORMAL
;
9698 else if (decl_context
== MEMFUNCDEF
)
9699 funcdef_flag
= -1, decl_context
= FIELD
;
9700 else if (decl_context
== BITFIELD
)
9701 bitfield
= 1, decl_context
= FIELD
;
9703 /* Look inside a declarator for the name being declared
9704 and get it as a string, for an error message. */
9706 tree
*next
= &declarator
;
9710 while (next
&& *next
)
9713 switch (TREE_CODE (decl
))
9716 /* For attributes. */
9717 next
= &TREE_VALUE (decl
);
9722 next
= &TREE_OPERAND (decl
, 0);
9725 case BIT_NOT_EXPR
: /* For C++ destructors! */
9727 tree name
= TREE_OPERAND (decl
, 0);
9728 tree rename
= NULL_TREE
;
9730 my_friendly_assert (flags
== NO_SPECIAL
, 152);
9732 sfk
= sfk_destructor
;
9733 if (TREE_CODE (name
) == TYPE_DECL
)
9734 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
9735 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
9736 if (ctype
== NULL_TREE
)
9738 if (current_class_type
== NULL_TREE
)
9740 error ("destructors must be member functions");
9745 tree t
= constructor_name (current_class_name
);
9752 tree t
= constructor_name (ctype
);
9759 cp_error ("destructor `%T' must match class name `%T'",
9761 TREE_OPERAND (decl
, 0) = rename
;
9767 case ADDR_EXPR
: /* C++ reference declaration */
9772 innermost_code
= TREE_CODE (decl
);
9773 next
= &TREE_OPERAND (decl
, 0);
9777 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
9779 /* This is actually a variable declaration using
9780 constructor syntax. We need to call start_decl and
9781 cp_finish_decl so we can get the variable
9784 tree attributes
, prefix_attributes
;
9786 *next
= TREE_OPERAND (decl
, 0);
9787 init
= CALL_DECLARATOR_PARMS (decl
);
9791 attributes
= TREE_PURPOSE (attrlist
);
9792 prefix_attributes
= TREE_VALUE (attrlist
);
9796 attributes
= NULL_TREE
;
9797 prefix_attributes
= NULL_TREE
;
9800 decl
= start_decl (declarator
, declspecs
, 1,
9801 attributes
, prefix_attributes
);
9802 decl_type_access_control (decl
);
9805 /* Look for __unused__ attribute */
9806 if (TREE_USED (TREE_TYPE (decl
)))
9807 TREE_USED (decl
) = 1;
9808 finish_decl (decl
, init
, NULL_TREE
);
9811 cp_error ("invalid declarator");
9814 innermost_code
= TREE_CODE (decl
);
9815 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
9816 ctype
= current_class_type
;
9818 && TREE_OPERAND (decl
, 0)
9819 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
9820 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
9821 == constructor_name_full (ctype
))
9822 || (DECL_NAME (TREE_OPERAND (decl
, 0))
9823 == constructor_name (ctype
)))))
9824 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9825 next
= &TREE_OPERAND (decl
, 0);
9827 if (ctype
!= NULL_TREE
9828 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
9829 && decl
== constructor_name (ctype
))
9831 sfk
= sfk_constructor
;
9832 ctor_return_type
= ctype
;
9837 case TEMPLATE_ID_EXPR
:
9839 tree fns
= TREE_OPERAND (decl
, 0);
9841 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9842 fns
= TREE_OPERAND (fns
, 0);
9845 if (TREE_CODE (dname
) == COMPONENT_REF
)
9846 dname
= TREE_OPERAND (dname
, 1);
9847 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9849 my_friendly_assert (is_overloaded_fn (dname
),
9851 dname
= DECL_NAME (get_first_fn (dname
));
9856 case IDENTIFIER_NODE
:
9857 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9864 cp_error ("declarator-id missing; using reserved word `%D'",
9866 name
= IDENTIFIER_POINTER (dname
);
9868 else if (!IDENTIFIER_TYPENAME_P (dname
))
9869 name
= IDENTIFIER_POINTER (dname
);
9872 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9873 flags
= TYPENAME_FLAG
;
9874 ctor_return_type
= TREE_TYPE (dname
);
9875 sfk
= sfk_conversion
;
9876 if (IDENTIFIER_GLOBAL_VALUE (dname
)
9877 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (dname
))
9879 name
= IDENTIFIER_POINTER (dname
);
9881 name
= "<invalid operator>";
9888 /* Perform error checking, and decide on a ctype. */
9889 tree cname
= TREE_OPERAND (decl
, 0);
9890 if (cname
== NULL_TREE
)
9892 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9895 in_namespace
= TREE_OPERAND (decl
, 0);
9896 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9898 else if (! is_aggr_type (cname
, 1))
9899 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9900 /* Must test TREE_OPERAND (decl, 1), in case user gives
9901 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9902 else if (TREE_OPERAND (decl
, 1)
9903 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9905 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9906 || TREE_CODE (cname
) == TEMPLATE_TEMPLATE_PARM
)
9908 cp_error ("`%T::%D' is not a valid declarator", cname
,
9909 TREE_OPERAND (decl
, 1));
9910 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9911 cname
, TREE_OPERAND (decl
, 1));
9912 return void_type_node
;
9914 else if (ctype
== NULL_TREE
)
9916 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9917 TREE_OPERAND (decl
, 0) = ctype
;
9920 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9922 cp_error ("type `%T' is not derived from type `%T'",
9924 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9930 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9931 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9932 == constructor_name_full (ctype
))
9933 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9934 == constructor_name (ctype
))))
9935 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9936 next
= &TREE_OPERAND (decl
, 1);
9940 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9941 && constructor_name (ctype
) == decl
)
9943 sfk
= sfk_constructor
;
9944 ctor_return_type
= ctype
;
9946 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9947 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9948 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9949 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9951 sfk
= sfk_destructor
;
9952 ctor_return_type
= ctype
;
9954 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9955 next
= &TREE_OPERAND (decl
, 0);
9966 /* Parse error puts this typespec where
9967 a declarator should go. */
9968 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9969 if (TREE_TYPE (decl
) == current_class_type
)
9970 cp_error (" perhaps you want `%T' for a constructor",
9971 current_class_name
);
9972 dname
= DECL_NAME (decl
);
9973 name
= IDENTIFIER_POINTER (dname
);
9975 /* Avoid giving two errors for this. */
9976 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9978 declspecs
= tree_cons (NULL_TREE
, integer_type_node
, declspecs
);
9984 cp_compiler_error ("`%D' as declarator", decl
);
9985 return 0; /* We used to do a 155 abort here. */
9990 /* A function definition's declarator must have the form of
9991 a function declarator. */
9993 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9996 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9997 && innermost_code
!= CALL_EXPR
9998 && ! (ctype
&& declspecs
== NULL_TREE
))
10000 cp_error ("declaration of `%D' as non-function", dname
);
10001 return void_type_node
;
10004 /* Anything declared one level down from the top level
10005 must be one of the parameters of a function
10006 (because the body is at least two levels down). */
10008 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
10009 by not allowing C++ class definitions to specify their parameters
10010 with xdecls (must be spec.d in the parmlist).
10012 Since we now wait to push a class scope until we are sure that
10013 we are in a legitimate method context, we must set oldcname
10014 explicitly (since current_class_name is not yet alive).
10016 We also want to avoid calling this a PARM if it is in a namespace. */
10018 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
10020 struct binding_level
*b
= current_binding_level
;
10021 current_binding_level
= b
->level_chain
;
10022 if (current_binding_level
!= 0 && toplevel_bindings_p ())
10023 decl_context
= PARM
;
10024 current_binding_level
= b
;
10028 name
= decl_context
== PARM
? "parameter" : "type name";
10030 /* Look through the decl specs and record which ones appear.
10031 Some typespecs are defined as built-in typenames.
10032 Others, the ones that are modifiers of other types,
10033 are represented by bits in SPECBITS: set the bits for
10034 the modifiers that appear. Storage class keywords are also in SPECBITS.
10036 If there is a typedef name or a type, store the type in TYPE.
10037 This includes builtin typedefs such as `int'.
10039 Set EXPLICIT_INT if the type is `int' or `char' and did not
10040 come from a user typedef.
10042 Set LONGLONG if `long' is mentioned twice.
10044 For C++, constructors and destructors have their own fast treatment. */
10046 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
10051 /* Certain parse errors slip through. For example,
10052 `int class;' is not caught by the parser. Try
10053 weakly to recover here. */
10054 if (TREE_CODE (spec
) != TREE_LIST
)
10057 id
= TREE_VALUE (spec
);
10059 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
10061 if (id
== ridpointers
[(int) RID_INT
]
10062 || id
== ridpointers
[(int) RID_CHAR
]
10063 || id
== ridpointers
[(int) RID_BOOL
]
10064 || id
== ridpointers
[(int) RID_WCHAR
])
10068 if (id
== ridpointers
[(int) RID_BOOL
])
10069 error ("`bool' is now a keyword");
10071 cp_error ("extraneous `%T' ignored", id
);
10075 if (id
== ridpointers
[(int) RID_INT
])
10077 else if (id
== ridpointers
[(int) RID_CHAR
])
10079 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
10083 /* C++ aggregate types. */
10084 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
10087 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
10089 type
= IDENTIFIER_TYPE_VALUE (id
);
10093 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
10095 if (ridpointers
[i
] == id
)
10097 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
10099 if (pedantic
&& ! in_system_header
&& warn_long_long
)
10100 pedwarn ("ISO C++ does not support `long long'");
10102 error ("`long long long' is too long for GCC");
10106 else if (RIDBIT_SETP (i
, specbits
))
10107 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
10108 RIDBIT_SET (i
, specbits
);
10113 /* C++ aggregate types. */
10114 else if (TREE_CODE (id
) == TYPE_DECL
|| TREE_CODE (id
) == TEMPLATE_DECL
)
10117 cp_error ("multiple declarations `%T' and `%T'", type
,
10121 type
= TREE_TYPE (id
);
10122 TREE_VALUE (spec
) = type
;
10127 error ("two or more data types in declaration of `%s'", name
);
10128 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
10130 register tree t
= lookup_name (id
, 1);
10131 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
10132 error ("`%s' fails to be a typedef or built in type",
10133 IDENTIFIER_POINTER (id
));
10136 type
= TREE_TYPE (t
);
10138 /* See the code below that used this. */
10139 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
10144 else if (id
!= error_mark_node
)
10145 /* Can't change CLASS nodes into RECORD nodes here! */
10151 typedef_type
= type
;
10153 /* No type at all: default to `int', and set DEFAULTED_INT
10154 because it was not a user-defined typedef. */
10156 if (type
== NULL_TREE
10157 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
10158 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10159 || RIDBIT_SETP (RID_LONG
, specbits
)
10160 || RIDBIT_SETP (RID_SHORT
, specbits
)))
10162 /* These imply 'int'. */
10163 type
= integer_type_node
;
10167 if (sfk
!= sfk_none
)
10168 type
= check_special_function_return_type (sfk
, type
,
10171 else if (type
== NULL_TREE
)
10177 /* We handle `main' specially here, because 'main () { }' is so
10178 common. With no options, it is allowed. With -Wreturn-type,
10179 it is a warning. It is only an error with -pedantic-errors. */
10180 is_main
= (funcdef_flag
10181 && MAIN_NAME_P (dname
)
10182 && ctype
== NULL_TREE
10183 && in_namespace
== NULL_TREE
10184 && current_namespace
== global_namespace
);
10186 if (in_system_header
|| flag_ms_extensions
)
10187 /* Allow it, sigh. */;
10188 else if (pedantic
|| ! is_main
)
10189 cp_pedwarn ("ISO C++ forbids declaration of `%s' with no type",
10191 else if (warn_return_type
)
10192 cp_warning ("ISO C++ forbids declaration of `%s' with no type",
10195 type
= integer_type_node
;
10200 /* Now process the modifiers that were specified
10201 and check for invalid combinations. */
10203 /* Long double is a special combination. */
10205 if (RIDBIT_SETP (RID_LONG
, specbits
)
10206 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
10208 RIDBIT_RESET (RID_LONG
, specbits
);
10209 type
= build_qualified_type (long_double_type_node
,
10210 CP_TYPE_QUALS (type
));
10213 /* Check all other uses of type modifiers. */
10215 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10216 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10217 || RIDBIT_SETP (RID_LONG
, specbits
)
10218 || RIDBIT_SETP (RID_SHORT
, specbits
))
10222 if (TREE_CODE (type
) == REAL_TYPE
)
10223 error ("short, signed or unsigned invalid for `%s'", name
);
10224 else if (TREE_CODE (type
) != INTEGER_TYPE
)
10225 error ("long, short, signed or unsigned invalid for `%s'", name
);
10226 else if (RIDBIT_SETP (RID_LONG
, specbits
)
10227 && RIDBIT_SETP (RID_SHORT
, specbits
))
10228 error ("long and short specified together for `%s'", name
);
10229 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10230 || RIDBIT_SETP (RID_SHORT
, specbits
))
10232 error ("long or short specified with char for `%s'", name
);
10233 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10234 || RIDBIT_SETP (RID_SHORT
, specbits
))
10235 && TREE_CODE (type
) == REAL_TYPE
)
10236 error ("long or short specified with floating type for `%s'", name
);
10237 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10238 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
10239 error ("signed and unsigned given together for `%s'", name
);
10243 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
10245 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
10247 if (flag_pedantic_errors
)
10252 /* Discard the type modifiers if they are invalid. */
10255 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
10256 RIDBIT_RESET (RID_SIGNED
, specbits
);
10257 RIDBIT_RESET (RID_LONG
, specbits
);
10258 RIDBIT_RESET (RID_SHORT
, specbits
);
10263 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
10264 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
10266 error ("complex invalid for `%s'", name
);
10267 RIDBIT_RESET (RID_COMPLEX
, specbits
);
10270 /* Decide whether an integer type is signed or not.
10271 Optionally treat bitfields as signed by default. */
10272 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10275 It is implementation-defined whether a plain (neither
10276 explicitly signed or unsigned) char, short, int, or long
10277 bit-field is signed or unsigned.
10279 Naturally, we extend this to long long as well. Note that
10280 this does not include wchar_t. */
10281 || (bitfield
&& !flag_signed_bitfields
10282 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
10283 /* A typedef for plain `int' without `signed' can be
10284 controlled just like plain `int', but a typedef for
10285 `signed int' cannot be so controlled. */
10287 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
10288 && (TREE_CODE (type
) == INTEGER_TYPE
10289 || TREE_CODE (type
) == CHAR_TYPE
)
10290 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
10293 type
= long_long_unsigned_type_node
;
10294 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10295 type
= long_unsigned_type_node
;
10296 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10297 type
= short_unsigned_type_node
;
10298 else if (type
== char_type_node
)
10299 type
= unsigned_char_type_node
;
10300 else if (typedef_decl
)
10301 type
= unsigned_type (type
);
10303 type
= unsigned_type_node
;
10305 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10306 && type
== char_type_node
)
10307 type
= signed_char_type_node
;
10309 type
= long_long_integer_type_node
;
10310 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10311 type
= long_integer_type_node
;
10312 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10313 type
= short_integer_type_node
;
10315 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
10317 /* If we just have "complex", it is equivalent to
10318 "complex double", but if any modifiers at all are specified it is
10319 the complex form of TYPE. E.g, "complex short" is
10320 "complex short int". */
10322 if (defaulted_int
&& ! longlong
10323 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
10324 || RIDBIT_SETP (RID_SHORT
, specbits
)
10325 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10326 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
10327 type
= complex_double_type_node
;
10328 else if (type
== integer_type_node
)
10329 type
= complex_integer_type_node
;
10330 else if (type
== float_type_node
)
10331 type
= complex_float_type_node
;
10332 else if (type
== double_type_node
)
10333 type
= complex_double_type_node
;
10334 else if (type
== long_double_type_node
)
10335 type
= complex_long_double_type_node
;
10337 type
= build_complex_type (type
);
10340 if (sfk
== sfk_conversion
10341 && (RIDBIT_SETP (RID_CONST
, specbits
)
10342 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
10343 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
10344 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
10347 /* Set CONSTP if this declaration is `const', whether by
10348 explicit specification or via a typedef.
10349 Likewise for VOLATILEP. */
10351 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
10353 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
10355 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
10356 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10357 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10358 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10359 type
= cp_build_qualified_type (type
, type_quals
);
10361 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
10362 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
10363 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
10364 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
10365 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
10367 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10368 staticp
= 1 + (decl_context
== FIELD
);
10370 if (virtualp
&& staticp
== 2)
10372 cp_error ("member `%D' cannot be declared both virtual and static",
10376 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
10377 RIDBIT_RESET (RID_FRIEND
, specbits
);
10379 /* Warn if two storage classes are given. Default to `auto'. */
10381 if (RIDBIT_ANY_SET (specbits
))
10383 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
10384 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
10385 if (decl_context
== PARM
&& nclasses
> 0)
10386 error ("storage class specifiers invalid in parameter declarations");
10387 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10389 if (decl_context
== PARM
)
10390 error ("typedef declaration invalid in parameter declaration");
10393 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
10394 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
10397 /* Give error if `virtual' is used outside of class declaration. */
10399 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
10401 error ("virtual outside class declaration");
10405 /* Static anonymous unions are dealt with here. */
10406 if (staticp
&& decl_context
== TYPENAME
10407 && TREE_CODE (declspecs
) == TREE_LIST
10408 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
10409 decl_context
= FIELD
;
10411 /* Warn about storage classes that are invalid for certain
10412 kinds of declarations (parameters, typenames, etc.). */
10415 error ("multiple storage classes in declaration of `%s'", name
);
10416 else if (decl_context
!= NORMAL
&& nclasses
> 0)
10418 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
10419 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
10420 || RIDBIT_SETP (RID_AUTO
, specbits
)))
10422 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10424 else if (decl_context
== FIELD
10425 /* C++ allows static class elements */
10426 && RIDBIT_SETP (RID_STATIC
, specbits
))
10427 /* C++ also allows inlines and signed and unsigned elements,
10428 but in those cases we don't come in here. */
10432 if (decl_context
== FIELD
)
10434 tree tmp
= NULL_TREE
;
10435 register int op
= 0;
10439 /* Avoid trying to get an operand off an identifier node. */
10440 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10443 tmp
= TREE_OPERAND (declarator
, 0);
10444 op
= IDENTIFIER_OPNAME_P (tmp
);
10445 if (IDENTIFIER_TYPENAME_P (tmp
))
10447 if (IDENTIFIER_GLOBAL_VALUE (tmp
)
10448 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (tmp
))
10450 name
= IDENTIFIER_POINTER (tmp
);
10452 name
= "<invalid operator>";
10455 error ("storage class specified for %s `%s'",
10456 op
? "member operator" : "field",
10461 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10462 error ("storage class specified for parameter `%s'", name
);
10464 error ("storage class specified for typename");
10466 RIDBIT_RESET (RID_REGISTER
, specbits
);
10467 RIDBIT_RESET (RID_AUTO
, specbits
);
10468 RIDBIT_RESET (RID_EXTERN
, specbits
);
10471 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
10473 if (toplevel_bindings_p ())
10475 /* It's common practice (and completely valid) to have a const
10476 be initialized and declared extern. */
10477 if (!(type_quals
& TYPE_QUAL_CONST
))
10478 warning ("`%s' initialized and declared `extern'", name
);
10481 error ("`%s' has both `extern' and initializer", name
);
10483 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
10484 && ! toplevel_bindings_p ())
10485 error ("nested function `%s' declared `extern'", name
);
10486 else if (toplevel_bindings_p ())
10488 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10489 error ("top-level declaration of `%s' specifies `auto'", name
);
10492 if (nclasses
> 0 && friendp
)
10493 error ("storage class specifiers invalid in friend function declarations");
10495 /* Now figure out the structure of the declarator proper.
10496 Descend through it, creating more complex types, until we reach
10497 the declared identifier (or NULL_TREE, in an absolute declarator). */
10499 inner_attrs
= NULL_TREE
;
10502 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
10503 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
10505 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
10506 an INDIRECT_REF (for *...),
10507 a CALL_EXPR (for ...(...)),
10508 an identifier (for the name being declared)
10509 or a null pointer (for the place in an absolute declarator
10510 where the name was omitted).
10511 For the last two cases, we have just exited the loop.
10513 For C++ it could also be
10514 a SCOPE_REF (for class :: ...). In this case, we have converted
10515 sensible names to types, and those are the values we use to
10516 qualify the member name.
10517 an ADDR_EXPR (for &...),
10518 a BIT_NOT_EXPR (for destructors)
10520 At this point, TYPE is the type of elements of an array,
10521 or for a function to return, or for a pointer to point to.
10522 After this sequence of ifs, TYPE is the type of the
10523 array or function or pointer, and DECLARATOR has had its
10524 outermost layer removed. */
10526 if (type
== error_mark_node
)
10528 if (TREE_CODE (declarator
) == SCOPE_REF
)
10529 declarator
= TREE_OPERAND (declarator
, 1);
10531 declarator
= TREE_OPERAND (declarator
, 0);
10534 if (quals
!= NULL_TREE
10535 && (declarator
== NULL_TREE
10536 || TREE_CODE (declarator
) != SCOPE_REF
))
10538 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
10539 ctype
= TYPE_METHOD_BASETYPE (type
);
10540 if (ctype
!= NULL_TREE
)
10542 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
10543 grok_method_quals (ctype
, dummy
, quals
);
10544 type
= TREE_TYPE (dummy
);
10545 ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
)));
10550 /* See the comment for the TREE_LIST case, below. */
10553 else if (inner_attrs
)
10555 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10556 inner_attrs
= NULL_TREE
;
10559 switch (TREE_CODE (declarator
))
10563 /* We encode a declarator with embedded attributes using
10564 a TREE_LIST. The attributes apply to the declarator
10565 directly inside them, so we have to skip an iteration
10566 before applying them to the type. If the declarator just
10567 inside is the declarator-id, we apply the attrs to the
10569 inner_attrs
= TREE_PURPOSE (declarator
);
10571 declarator
= TREE_VALUE (declarator
);
10577 register tree size
;
10579 size
= TREE_OPERAND (declarator
, 1);
10581 /* VC++ spells a zero-sized array with []. */
10582 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
10583 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10584 size
= integer_zero_node
;
10586 declarator
= TREE_OPERAND (declarator
, 0);
10588 type
= create_array_type_for_decl (dname
, type
, size
);
10590 /* VLAs never work as fields. */
10591 if (decl_context
== FIELD
&& !processing_template_decl
10592 && TREE_CODE (type
) == ARRAY_TYPE
10593 && TYPE_DOMAIN (type
) != NULL_TREE
10594 && !TREE_CONSTANT (TYPE_MAX_VALUE (TYPE_DOMAIN (type
))))
10596 cp_error ("size of member `%D' is not constant", dname
);
10597 /* Proceed with arbitrary constant size, so that offset
10598 computations don't get confused. */
10599 type
= create_array_type_for_decl (dname
, TREE_TYPE (type
),
10611 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
10612 tree inner_decl
= TREE_OPERAND (declarator
, 0);
10614 /* Declaring a function type.
10615 Make sure we have a valid type for the function to return. */
10617 /* We now know that the TYPE_QUALS don't apply to the
10618 decl, but to its return type. */
10619 type_quals
= TYPE_UNQUALIFIED
;
10621 /* Warn about some types functions can't return. */
10623 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10625 error ("`%s' declared as function returning a function", name
);
10626 type
= integer_type_node
;
10628 if (TREE_CODE (type
) == ARRAY_TYPE
)
10630 error ("`%s' declared as function returning an array", name
);
10631 type
= integer_type_node
;
10634 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
10635 inner_decl
= TREE_OPERAND (inner_decl
, 1);
10637 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
10638 inner_decl
= dname
;
10640 /* Pick up type qualifiers which should be applied to `this'. */
10641 quals
= CALL_DECLARATOR_QUALS (declarator
);
10643 /* Pick up the exception specifications. */
10644 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
10646 /* Say it's a definition only for the CALL_EXPR
10647 closest to the identifier. */
10650 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
10651 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
10652 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
10654 if (ctype
== NULL_TREE
10655 && decl_context
== FIELD
10657 && (friendp
== 0 || dname
== current_class_name
))
10658 ctype
= current_class_type
;
10660 if (ctype
&& sfk
== sfk_conversion
)
10661 TYPE_HAS_CONVERSION (ctype
) = 1;
10662 if (ctype
&& constructor_name (ctype
) == dname
)
10664 /* We are within a class's scope. If our declarator name
10665 is the same as the class name, and we are defining
10666 a function, then it is a constructor/destructor, and
10667 therefore returns a void type. */
10669 if (flags
== DTOR_FLAG
)
10671 /* ISO C++ 12.4/2. A destructor may not be
10672 declared const or volatile. A destructor may
10675 error ("destructor cannot be static member function");
10678 cp_error ("destructors may not be `%s'",
10679 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10682 if (decl_context
== FIELD
)
10684 if (! member_function_or_else (ctype
,
10685 current_class_type
,
10687 return void_type_node
;
10690 else /* It's a constructor. */
10692 if (explicitp
== 1)
10694 /* ISO C++ 12.1. A constructor may not be
10695 declared const or volatile. A constructor may
10696 not be virtual. A constructor may not be
10699 error ("constructor cannot be static member function");
10702 pedwarn ("constructors cannot be declared virtual");
10707 cp_error ("constructors may not be `%s'",
10708 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10712 RID_BIT_TYPE tmp_bits
;
10713 bcopy ((void*)&specbits
, (void*)&tmp_bits
, sizeof (RID_BIT_TYPE
));
10714 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10715 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10716 if (RIDBIT_ANY_SET (tmp_bits
))
10717 error ("return value type specifier for constructor ignored");
10719 if (decl_context
== FIELD
)
10721 if (! member_function_or_else (ctype
,
10722 current_class_type
,
10724 return void_type_node
;
10725 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10726 if (sfk
!= sfk_constructor
)
10730 if (decl_context
== FIELD
)
10736 error ("can't initialize friend function `%s'", name
);
10739 /* Cannot be both friend and virtual. */
10740 error ("virtual functions cannot be friends");
10741 RIDBIT_RESET (RID_FRIEND
, specbits
);
10744 if (decl_context
== NORMAL
)
10745 error ("friend declaration not in class definition");
10746 if (current_function_decl
&& funcdef_flag
)
10747 cp_error ("can't define friend function `%s' in a local class definition",
10751 /* Construct the function type and go to the next
10752 inner layer of declarator. */
10754 declarator
= TREE_OPERAND (declarator
, 0);
10756 /* FIXME: This is where default args should be fully
10759 arg_types
= grokparms (inner_parms
, funcdecl_p
? funcdef_flag
: 0);
10761 if (declarator
&& flags
== DTOR_FLAG
)
10763 /* A destructor declared in the body of a class will
10764 be represented as a BIT_NOT_EXPR. But, we just
10765 want the underlying IDENTIFIER. */
10766 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10767 declarator
= TREE_OPERAND (declarator
, 0);
10769 if (strict_prototype
== 0 && arg_types
== NULL_TREE
)
10770 arg_types
= void_list_node
;
10771 else if (arg_types
== NULL_TREE
10772 || arg_types
!= void_list_node
)
10774 cp_error ("destructors may not have parameters");
10775 arg_types
= void_list_node
;
10776 last_function_parms
= NULL_TREE
;
10780 /* ANSI says that `const int foo ();'
10781 does not make the function foo const. */
10782 type
= build_function_type (type
, arg_types
);
10786 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10787 if (TREE_PURPOSE (t
)
10788 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10790 add_defarg_fn (type
);
10799 /* Filter out pointers-to-references and references-to-references.
10800 We can get these if a TYPE_DECL is used. */
10802 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10804 error ("cannot declare %s to references",
10805 TREE_CODE (declarator
) == ADDR_EXPR
10806 ? "references" : "pointers");
10807 declarator
= TREE_OPERAND (declarator
, 0);
10811 if (TREE_CODE (type
) == OFFSET_TYPE
10812 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10813 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10815 cp_error ("cannot declare pointer to `%#T' member",
10817 type
= TREE_TYPE (type
);
10820 /* Merge any constancy or volatility into the target type
10821 for the pointer. */
10823 /* We now know that the TYPE_QUALS don't apply to the decl,
10824 but to the target of the pointer. */
10825 type_quals
= TYPE_UNQUALIFIED
;
10827 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10829 if (TREE_CODE (type
) == VOID_TYPE
)
10830 error ("invalid type: `void &'");
10832 type
= build_reference_type (type
);
10834 else if (TREE_CODE (type
) == METHOD_TYPE
)
10835 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10837 type
= build_pointer_type (type
);
10839 /* Process a list of type modifier keywords (such as
10840 const or volatile) that were given inside the `*' or `&'. */
10842 if (TREE_TYPE (declarator
))
10844 register tree typemodlist
;
10850 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10851 typemodlist
= TREE_CHAIN (typemodlist
))
10853 tree qualifier
= TREE_VALUE (typemodlist
);
10855 if (qualifier
== ridpointers
[(int) RID_CONST
])
10857 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10859 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10864 error ("invalid type modifier within pointer declarator");
10868 pedwarn ("duplicate `const'");
10870 pedwarn ("duplicate `volatile'");
10872 pedwarn ("duplicate `restrict'");
10874 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10875 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10876 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10877 if (TREE_CODE (declarator
) == ADDR_EXPR
10878 && (constp
|| volatilep
))
10881 pedwarn ("discarding `const' applied to a reference");
10883 pedwarn ("discarding `volatile' applied to a reference");
10884 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10886 type
= cp_build_qualified_type (type
, type_quals
);
10888 declarator
= TREE_OPERAND (declarator
, 0);
10894 /* We have converted type names to NULL_TREE if the
10895 name was bogus, or to a _TYPE node, if not.
10897 The variable CTYPE holds the type we will ultimately
10898 resolve to. The code here just needs to build
10899 up appropriate member types. */
10900 tree sname
= TREE_OPERAND (declarator
, 1);
10903 /* Destructors can have their visibilities changed as well. */
10904 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10905 sname
= TREE_OPERAND (sname
, 0);
10907 if (TREE_COMPLEXITY (declarator
) == 0)
10908 /* This needs to be here, in case we are called
10909 multiple times. */ ;
10910 else if (TREE_COMPLEXITY (declarator
) == -1)
10911 /* Namespace member. */
10912 pop_decl_namespace ();
10913 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10914 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10915 else if (! IS_AGGR_TYPE_CODE
10916 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10918 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10920 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10921 that refer to ctype. They couldn't be resolved earlier
10922 because we hadn't pushed into the class yet.
10923 Example: resolve 'B<T>::type' in
10924 'B<typename B<T>::type> B<T>::f () { }'. */
10925 if (current_template_parms
10926 && uses_template_parms (type
)
10927 && uses_template_parms (current_class_type
))
10929 tree args
= current_template_args ();
10930 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10933 /* This pop_nested_class corresponds to the
10934 push_nested_class used to push into class scope for
10935 parsing the argument list of a function decl, in
10937 pop_nested_class ();
10938 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10941 my_friendly_abort (16);
10943 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10945 /* We had a reference to a global decl, or
10946 perhaps we were given a non-aggregate typedef,
10947 in which case we cleared this out, and should just
10948 keep going as though it wasn't there. */
10949 declarator
= sname
;
10952 ctype
= TREE_OPERAND (declarator
, 0);
10955 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10957 /* You're supposed to have one `template <...>'
10958 for every template class, but you don't need one
10959 for a full specialization. For example:
10961 template <class T> struct S{};
10962 template <> struct S<int> { void f(); };
10963 void S<int>::f () {}
10965 is correct; there shouldn't be a `template <>' for
10966 the definition of `S<int>::f'. */
10967 if (CLASSTYPE_TEMPLATE_INFO (t
)
10968 && (CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
10969 || uses_template_parms (CLASSTYPE_TI_ARGS (t
))))
10970 template_count
+= 1;
10972 t
= TYPE_MAIN_DECL (t
);
10973 if (DECL_LANG_SPECIFIC (t
))
10974 t
= DECL_CONTEXT (t
);
10979 if (sname
== NULL_TREE
)
10982 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10984 /* This is the `standard' use of the scoping operator:
10985 basetype :: member . */
10987 if (ctype
== current_class_type
)
10993 Is this ill-formed? */
10996 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10999 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11001 if (current_class_type
== NULL_TREE
11003 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11004 TYPE_ARG_TYPES (type
));
11007 cp_error ("cannot declare member function `%T::%s' within `%T'",
11008 ctype
, name
, current_class_type
);
11009 return void_type_node
;
11012 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
11013 || COMPLETE_TYPE_P (complete_type (ctype
)))
11015 /* Have to move this code elsewhere in this function.
11016 this code is used for i.e., typedef int A::M; M *pm;
11018 It is? How? jason 10/2/94 */
11020 if (current_class_type
)
11022 cp_error ("cannot declare member `%T::%s' within `%T'",
11023 ctype
, name
, current_class_type
);
11024 return void_type_node
;
11026 type
= build_offset_type (ctype
, type
);
11028 else if (uses_template_parms (ctype
))
11030 if (TREE_CODE (type
) == FUNCTION_TYPE
)
11032 = build_cplus_method_type (ctype
, TREE_TYPE (type
),
11033 TYPE_ARG_TYPES (type
));
11037 cp_error ("structure `%T' not yet defined", ctype
);
11038 return error_mark_node
;
11041 declarator
= sname
;
11043 else if (TREE_CODE (sname
) == SCOPE_REF
)
11044 my_friendly_abort (17);
11048 declarator
= TREE_OPERAND (declarator
, 1);
11049 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
11050 /* In this case, we will deal with it later. */
11054 if (TREE_CODE (type
) == FUNCTION_TYPE
)
11055 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11056 TYPE_ARG_TYPES (type
));
11058 type
= build_offset_type (ctype
, type
);
11065 declarator
= TREE_OPERAND (declarator
, 0);
11070 case ENUMERAL_TYPE
:
11071 declarator
= NULL_TREE
;
11075 declarator
= NULL_TREE
;
11079 my_friendly_abort (158);
11083 /* See the comment for the TREE_LIST case, above. */
11086 if (! ignore_attrs
)
11087 decl_attributes (type
, inner_attrs
, NULL_TREE
);
11089 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
11091 attrlist
= build_decl_list (NULL_TREE
, inner_attrs
);
11094 /* Now TYPE has the actual type. */
11096 if (explicitp
== 1 || (explicitp
&& friendp
))
11098 /* [dcl.fct.spec] The explicit specifier shall only be used in
11099 declarations of constructors within a class definition. */
11100 error ("only declarations of constructors can be `explicit'");
11104 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11106 if (current_class_name
== NULL_TREE
|| decl_context
== PARM
|| friendp
)
11108 error ("non-member `%s' cannot be declared `mutable'", name
);
11109 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11111 else if (decl_context
== TYPENAME
|| RIDBIT_SETP (RID_TYPEDEF
, specbits
))
11113 error ("non-object member `%s' cannot be declared `mutable'", name
);
11114 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11116 else if (TREE_CODE (type
) == FUNCTION_TYPE
11117 || TREE_CODE (type
) == METHOD_TYPE
)
11119 error ("function `%s' cannot be declared `mutable'", name
);
11120 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11124 error ("static `%s' cannot be declared `mutable'", name
);
11125 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11127 else if (type_quals
& TYPE_QUAL_CONST
)
11129 error ("const `%s' cannot be declared `mutable'", name
);
11130 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11134 if (declarator
== NULL_TREE
11135 || TREE_CODE (declarator
) == IDENTIFIER_NODE
11136 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
11137 && (TREE_CODE (type
) == FUNCTION_TYPE
11138 || TREE_CODE (type
) == METHOD_TYPE
)))
11140 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11142 cp_error ("template-id `%D' used as a declarator", declarator
);
11143 declarator
= dname
;
11146 /* Unexpected declarator format. */
11147 my_friendly_abort (990210);
11149 /* If this is declaring a typedef name, return a TYPE_DECL. */
11151 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
11155 /* Note that the grammar rejects storage classes
11156 in typenames, fields or parameters. */
11157 if (current_lang_name
== lang_name_java
)
11158 TYPE_FOR_JAVA (type
) = 1;
11160 if (decl_context
== FIELD
)
11162 if (declarator
== constructor_name (current_class_type
))
11163 cp_pedwarn ("ISO C++ forbids nested type `%D' with same name as enclosing class",
11165 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
11168 decl
= build_decl (TYPE_DECL
, declarator
, type
);
11170 /* If the user declares "typedef struct {...} foo" then the
11171 struct will have an anonymous name. Fill that name in now.
11172 Nothing can refer to it, so nothing needs know about the name
11174 if (type
!= error_mark_node
11176 && TYPE_NAME (type
)
11177 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
11178 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
11179 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
11181 tree oldname
= TYPE_NAME (type
);
11184 /* Replace the anonymous name with the real name everywhere. */
11185 lookup_tag_reverse (type
, declarator
);
11186 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
11187 if (TYPE_NAME (t
) == oldname
)
11188 TYPE_NAME (t
) = decl
;
11190 if (TYPE_LANG_SPECIFIC (type
))
11191 TYPE_WAS_ANONYMOUS (type
) = 1;
11193 /* If this is a typedef within a template class, the nested
11194 type is a (non-primary) template. The name for the
11195 template needs updating as well. */
11196 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
11197 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
11198 = TYPE_IDENTIFIER (type
);
11201 DECL_ASSEMBLER_NAME (decl
) = mangle_type (type
);
11204 /* XXX Temporarily set the scope.
11205 When returning, start_decl expects it as NULL_TREE,
11206 and will then then set it using pushdecl. */
11207 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
11208 if (current_class_type
)
11209 DECL_CONTEXT (decl
) = current_class_type
;
11211 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
11213 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
11214 DECL_ASSEMBLER_NAME (decl
)
11215 = get_identifier (build_overload_name (type
, 1, 1));
11216 DECL_CONTEXT (decl
) = NULL_TREE
;
11219 /* FIXME remangle member functions; member functions of a
11220 type with external linkage have external linkage. */
11223 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11225 cp_error_at ("typedef name may not be class-qualified", decl
);
11230 if (ctype
== NULL_TREE
)
11232 if (TREE_CODE (type
) != METHOD_TYPE
)
11233 cp_error_at ("invalid type qualifier for non-member function type", decl
);
11235 ctype
= TYPE_METHOD_BASETYPE (type
);
11237 if (ctype
!= NULL_TREE
)
11238 grok_method_quals (ctype
, decl
, quals
);
11241 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
11242 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
11243 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
11245 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
11246 inlinep
, friendp
, raises
!= NULL_TREE
);
11249 error ("typedef declaration includes an initializer");
11254 /* Detect the case of an array type of unspecified size
11255 which came, as such, direct from a typedef name.
11256 We must copy the type, so that each identifier gets
11257 a distinct type, so that each identifier's size can be
11258 controlled separately by its own initializer. */
11260 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
11261 && TYPE_DOMAIN (type
) == NULL_TREE
)
11263 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
11266 /* If this is a type name (such as, in a cast or sizeof),
11267 compute the type and return it now. */
11269 if (decl_context
== TYPENAME
)
11271 /* Note that the grammar rejects storage classes
11272 in typenames, fields or parameters. */
11273 if (type_quals
!= TYPE_UNQUALIFIED
)
11274 type_quals
= TYPE_UNQUALIFIED
;
11276 /* Special case: "friend class foo" looks like a TYPENAME context. */
11279 if (type_quals
!= TYPE_UNQUALIFIED
)
11281 cp_error ("type qualifiers specified for friend class declaration");
11282 type_quals
= TYPE_UNQUALIFIED
;
11286 cp_error ("`inline' specified for friend class declaration");
11290 /* Only try to do this stuff if we didn't already give up. */
11291 if (type
!= integer_type_node
)
11293 /* A friendly class? */
11294 if (current_class_type
)
11295 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
11297 error ("trying to make class `%s' a friend of global scope",
11298 TYPE_NAME_STRING (type
));
11299 type
= void_type_node
;
11304 if (ctype
== NULL_TREE
)
11306 if (TREE_CODE (type
) != METHOD_TYPE
)
11307 cp_error ("invalid qualifiers on non-member function type");
11309 ctype
= TYPE_METHOD_BASETYPE (type
);
11313 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
11314 grok_method_quals (ctype
, dummy
, quals
);
11315 type
= TREE_TYPE (dummy
);
11321 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
11322 && decl_context
!= CATCHPARM
11323 && TREE_CODE (type
) != UNION_TYPE
11326 cp_error ("abstract declarator `%T' used as declaration", type
);
11327 declarator
= make_anon_name ();
11330 /* `void' at top level (not within pointer)
11331 is allowed only in typedefs or type names.
11332 We don't complain about parms either, but that is because
11333 a better error message can be made later. */
11335 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
11338 error ("unnamed variable or field declared void");
11339 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
11341 if (IDENTIFIER_OPNAME_P (declarator
))
11342 my_friendly_abort (356);
11344 error ("variable or field `%s' declared void", name
);
11347 error ("variable or field declared void");
11348 type
= integer_type_node
;
11351 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
11352 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
11354 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
11356 if (ctype
|| in_namespace
)
11357 error ("cannot use `::' in parameter declaration");
11359 /* A parameter declared as an array of T is really a pointer to T.
11360 One declared as a function is really a pointer to a function.
11361 One declared as a member is really a pointer to member. */
11363 if (TREE_CODE (type
) == ARRAY_TYPE
)
11365 /* Transfer const-ness of array into that of type pointed to. */
11366 type
= build_pointer_type (TREE_TYPE (type
));
11367 type_quals
= TYPE_UNQUALIFIED
;
11369 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11370 type
= build_pointer_type (type
);
11371 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11372 type
= build_pointer_type (type
);
11373 else if (TREE_CODE (type
) == VOID_TYPE
&& declarator
)
11375 error ("declaration of `%s' as void", name
);
11381 register tree decl
;
11383 if (decl_context
== PARM
)
11385 decl
= build_decl (PARM_DECL
, declarator
, type
);
11387 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
11388 inlinep
, friendp
, raises
!= NULL_TREE
);
11390 /* Compute the type actually passed in the parmlist,
11391 for the case where there is no prototype.
11392 (For example, shorts and chars are passed as ints.)
11393 When there is a prototype, this is overridden later. */
11395 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
11397 else if (decl_context
== FIELD
)
11399 if (type
== error_mark_node
)
11401 /* Happens when declaring arrays of sizes which
11402 are error_mark_node, for example. */
11405 else if (in_namespace
&& !friendp
)
11407 /* Something like struct S { int N::j; }; */
11408 cp_error ("invalid use of `::'");
11411 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11414 tree function_context
;
11416 /* We catch the others as conflicts with the builtin
11418 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
11420 cp_error ("function `%D' cannot be declared friend",
11427 if (ctype
== NULL_TREE
)
11428 ctype
= current_class_type
;
11430 if (ctype
== NULL_TREE
)
11432 cp_error ("can't make `%D' into a method -- not in a class",
11434 return void_type_node
;
11437 /* ``A union may [ ... ] not [ have ] virtual functions.''
11439 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
11441 cp_error ("function `%D' declared virtual inside a union",
11443 return void_type_node
;
11446 if (declarator
== ansi_opname (NEW_EXPR
)
11447 || declarator
== ansi_opname (VEC_NEW_EXPR
)
11448 || declarator
== ansi_opname (DELETE_EXPR
)
11449 || declarator
== ansi_opname (VEC_DELETE_EXPR
))
11453 cp_error ("`%D' cannot be declared virtual, since it is always static",
11458 else if (staticp
< 2)
11459 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11460 TYPE_ARG_TYPES (type
));
11463 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
11464 function_context
= (ctype
!= NULL_TREE
) ?
11465 decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
11466 publicp
= (! friendp
|| ! staticp
)
11467 && function_context
== NULL_TREE
;
11468 decl
= grokfndecl (ctype
, type
,
11469 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
11470 ? declarator
: dname
,
11472 virtualp
, flags
, quals
, raises
,
11473 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
11474 funcdef_flag
, template_count
, in_namespace
);
11475 if (decl
== NULL_TREE
)
11478 /* This clobbers the attrs stored in `decl' from `attrlist'. */
11479 /* The decl and setting of decl_machine_attr is also turned off. */
11480 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
11483 /* [class.conv.ctor]
11485 A constructor declared without the function-specifier
11486 explicit that can be called with a single parameter
11487 specifies a conversion from the type of its first
11488 parameter to the type of its class. Such a constructor
11489 is called a converting constructor. */
11490 if (explicitp
== 2)
11491 DECL_NONCONVERTING_P (decl
) = 1;
11492 else if (DECL_CONSTRUCTOR_P (decl
))
11494 /* The constructor can be called with exactly one
11495 parameter if there is at least one parameter, and
11496 any subsequent parameters have default arguments.
11497 We don't look at the first parameter, which is
11498 really just the `this' parameter for the new
11501 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
11503 /* Skip the `in_chrg' argument too, if present. */
11504 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
11505 arg_types
= TREE_CHAIN (arg_types
);
11507 if (arg_types
== void_list_node
11509 && TREE_CHAIN (arg_types
)
11510 && TREE_CHAIN (arg_types
) != void_list_node
11511 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
11512 DECL_NONCONVERTING_P (decl
) = 1;
11515 else if (TREE_CODE (type
) == METHOD_TYPE
)
11517 /* We only get here for friend declarations of
11518 members of other classes. */
11519 /* All method decls are public, so tell grokfndecl to set
11520 TREE_PUBLIC, also. */
11521 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
11522 virtualp
, flags
, quals
, raises
,
11523 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
11524 template_count
, in_namespace
);
11525 if (decl
== NULL_TREE
)
11528 else if (!staticp
&& ! processing_template_decl
11529 && !COMPLETE_TYPE_P (complete_type (type
))
11530 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
11533 cp_error ("field `%D' has incomplete type", declarator
);
11535 cp_error ("name `%T' has incomplete type", type
);
11537 /* If we're instantiating a template, tell them which
11538 instantiation made the field's type be incomplete. */
11539 if (current_class_type
11540 && TYPE_NAME (current_class_type
)
11541 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
11542 && declspecs
&& TREE_VALUE (declspecs
)
11543 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
11544 cp_error (" in instantiation of template `%T'",
11545 current_class_type
);
11547 type
= error_mark_node
;
11554 error ("`%s' is neither function nor member function; cannot be declared friend",
11555 IDENTIFIER_POINTER (declarator
));
11563 /* Friends are treated specially. */
11564 if (ctype
== current_class_type
)
11565 warning ("member functions are implicitly friends of their class");
11568 tree t
= NULL_TREE
;
11569 if (decl
&& DECL_NAME (decl
))
11571 if (template_class_depth (current_class_type
) == 0)
11574 = check_explicit_specialization
11576 template_count
, 2 * (funcdef_flag
!= 0) + 4);
11577 if (decl
== error_mark_node
)
11578 return error_mark_node
;
11581 t
= do_friend (ctype
, declarator
, decl
,
11582 last_function_parms
, attrlist
, flags
, quals
,
11585 if (t
&& funcdef_flag
)
11588 return void_type_node
;
11592 /* Structure field. It may not be a function, except for C++ */
11594 if (decl
== NULL_TREE
)
11600 /* An attempt is being made to initialize a non-static
11601 member. But, from [class.mem]:
11603 4 A member-declarator can contain a
11604 constant-initializer only if it declares a static
11605 member (_class.static_) of integral or enumeration
11606 type, see _class.static.data_.
11608 This used to be relatively common practice, but
11609 the rest of the compiler does not correctly
11610 handle the initialization unless the member is
11611 static so we make it static below. */
11612 cp_pedwarn ("ISO C++ forbids initialization of member `%D'",
11614 cp_pedwarn ("making `%D' static", declarator
);
11618 if (uses_template_parms (type
))
11619 /* We'll check at instantiation time. */
11621 else if (check_static_variable_definition (declarator
,
11623 /* If we just return the declaration, crashes
11624 will sometimes occur. We therefore return
11625 void_type_node, as if this was a friend
11626 declaration, to cause callers to completely
11627 ignore this declaration. */
11628 return void_type_node
;
11631 /* 9.2p13 [class.mem] */
11632 if (declarator
== constructor_name (current_class_type
)
11633 /* The standard does not allow non-static data members
11634 here either, but we agreed at the 10/99 meeting
11635 to change that in TC 1 so that they are allowed in
11636 classes with no user-defined constructors. */
11638 cp_pedwarn ("ISO C++ forbids static data member `%D' with same name as enclosing class",
11643 /* C++ allows static class members. All other work
11644 for this is done by grokfield. */
11645 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
11646 TREE_STATIC (decl
) = 1;
11647 /* In class context, 'static' means public access. */
11648 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
11652 decl
= build_decl (FIELD_DECL
, declarator
, type
);
11653 DECL_NONADDRESSABLE_P (decl
) = bitfield
;
11654 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11656 DECL_MUTABLE_P (decl
) = 1;
11657 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11661 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
11662 inlinep
, friendp
, raises
!= NULL_TREE
);
11665 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11667 tree original_name
;
11673 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11674 original_name
= dname
;
11676 original_name
= declarator
;
11678 if (RIDBIT_SETP (RID_AUTO
, specbits
))
11679 error ("storage class `auto' invalid for function `%s'", name
);
11680 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11681 error ("storage class `register' invalid for function `%s'", name
);
11683 /* Function declaration not at top level.
11684 Storage classes other than `extern' are not allowed
11685 and `extern' makes no difference. */
11686 if (! toplevel_bindings_p ()
11687 && (RIDBIT_SETP (RID_STATIC
, specbits
)
11688 || RIDBIT_SETP (RID_INLINE
, specbits
))
11691 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11692 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
11694 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
11697 if (ctype
== NULL_TREE
)
11701 error ("virtual non-class function `%s'", name
);
11705 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
11706 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11707 TYPE_ARG_TYPES (type
));
11709 /* Record presence of `static'. */
11710 publicp
= (ctype
!= NULL_TREE
11711 || RIDBIT_SETP (RID_EXTERN
, specbits
)
11712 || !RIDBIT_SETP (RID_STATIC
, specbits
));
11714 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
11715 virtualp
, flags
, quals
, raises
,
11717 publicp
, inlinep
, funcdef_flag
,
11718 template_count
, in_namespace
);
11719 if (decl
== NULL_TREE
)
11724 int illegal_static
= 0;
11726 /* Don't allow a static member function in a class, and forbid
11727 declaring main to be static. */
11728 if (TREE_CODE (type
) == METHOD_TYPE
)
11730 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11731 illegal_static
= 1;
11733 else if (current_function_decl
)
11735 /* FIXME need arm citation */
11736 error ("cannot declare static function inside another function");
11737 illegal_static
= 1;
11740 if (illegal_static
)
11743 RIDBIT_RESET (RID_STATIC
, specbits
);
11749 /* It's a variable. */
11751 /* An uninitialized decl with `extern' is a reference. */
11752 decl
= grokvardecl (type
, declarator
, &specbits
,
11754 (type_quals
& TYPE_QUAL_CONST
) != 0,
11756 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11757 inlinep
, friendp
, raises
!= NULL_TREE
);
11761 DECL_CONTEXT (decl
) = ctype
;
11764 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11766 RIDBIT_RESET (RID_STATIC
, specbits
);
11768 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11770 cp_error ("static member `%D' declared `register'", decl
);
11771 RIDBIT_RESET (RID_REGISTER
, specbits
);
11773 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11775 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11777 RIDBIT_RESET (RID_EXTERN
, specbits
);
11782 my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE
, specbits
), 19990927);
11784 /* Record `register' declaration for warnings on &
11785 and in case doing stupid register allocation. */
11787 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11788 DECL_REGISTER (decl
) = 1;
11790 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11791 DECL_THIS_EXTERN (decl
) = 1;
11793 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11794 DECL_THIS_STATIC (decl
) = 1;
11796 /* Record constancy and volatility. There's no need to do this
11797 when processing a template; we'll do this for the instantiated
11798 declaration based on the type of DECL. */
11799 if (!processing_template_decl
)
11800 c_apply_type_quals_to_decl (type_quals
, decl
);
11806 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11807 An empty exprlist is a parmlist. An exprlist which
11808 contains only identifiers at the global level
11809 is a parmlist. Otherwise, it is an exprlist. */
11812 parmlist_is_exprlist (exprs
)
11815 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11818 if (toplevel_bindings_p ())
11820 /* At the global level, if these are all identifiers,
11821 then it is a parmlist. */
11824 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11826 exprs
= TREE_CHAIN (exprs
);
11833 /* Subroutine of start_function. Ensure that each of the parameter
11834 types (as listed in PARMS) is complete, as is required for a
11835 function definition. */
11838 require_complete_types_for_parms (parms
)
11841 for (; parms
; parms
= TREE_CHAIN (parms
))
11843 tree type
= TREE_TYPE (parms
);
11845 /* Try to complete the TYPE. */
11846 type
= complete_type (type
);
11848 if (type
== error_mark_node
)
11851 if (!COMPLETE_TYPE_P (type
))
11853 if (DECL_NAME (parms
))
11854 error ("parameter `%s' has incomplete type",
11855 IDENTIFIER_POINTER (DECL_NAME (parms
)));
11857 error ("parameter has incomplete type");
11858 TREE_TYPE (parms
) = error_mark_node
;
11861 layout_decl (parms
, 0);
11865 /* Returns non-zero if T is a local variable. */
11868 local_variable_p (t
)
11871 if ((TREE_CODE (t
) == VAR_DECL
11872 /* A VAR_DECL with a context that is a _TYPE is a static data
11874 && !TYPE_P (CP_DECL_CONTEXT (t
))
11875 /* Any other non-local variable must be at namespace scope. */
11876 && !DECL_NAMESPACE_SCOPE_P (t
))
11877 || (TREE_CODE (t
) == PARM_DECL
))
11883 /* Returns non-zero if T is an automatic local variable or a label.
11884 (These are the declarations that need to be remapped when the code
11885 containing them is duplicated.) */
11888 nonstatic_local_decl_p (t
)
11891 return ((local_variable_p (t
) && !TREE_STATIC (t
))
11892 || TREE_CODE (t
) == LABEL_DECL
11893 || TREE_CODE (t
) == RESULT_DECL
);
11896 /* Like local_variable_p, but suitable for use as a tree-walking
11900 local_variable_p_walkfn (tp
, walk_subtrees
, data
)
11902 int *walk_subtrees ATTRIBUTE_UNUSED
;
11903 void *data ATTRIBUTE_UNUSED
;
11905 return ((local_variable_p (*tp
) && !DECL_ARTIFICIAL (*tp
))
11906 ? *tp
: NULL_TREE
);
11909 /* Check that ARG, which is a default-argument expression for a
11910 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11911 something goes wrong. DECL may also be a _TYPE node, rather than a
11912 DECL, if there is no DECL available. */
11915 check_default_argument (decl
, arg
)
11922 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11923 /* We get a DEFAULT_ARG when looking at an in-class declaration
11924 with a default argument. Ignore the argument for now; we'll
11925 deal with it after the class is complete. */
11928 if (processing_template_decl
|| uses_template_parms (arg
))
11929 /* We don't do anything checking until instantiation-time. Note
11930 that there may be uninstantiated arguments even for an
11931 instantiated function, since default arguments are not
11932 instantiated until they are needed. */
11941 decl_type
= TREE_TYPE (decl
);
11943 if (arg
== error_mark_node
11944 || decl
== error_mark_node
11945 || TREE_TYPE (arg
) == error_mark_node
11946 || decl_type
== error_mark_node
)
11947 /* Something already went wrong. There's no need to check
11949 return error_mark_node
;
11951 /* [dcl.fct.default]
11953 A default argument expression is implicitly converted to the
11955 if (!TREE_TYPE (arg
)
11956 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11959 cp_error ("default argument for `%#D' has type `%T'",
11960 decl
, TREE_TYPE (arg
));
11962 cp_error ("default argument for parameter of type `%T' has type `%T'",
11963 decl_type
, TREE_TYPE (arg
));
11965 return error_mark_node
;
11968 /* [dcl.fct.default]
11970 Local variables shall not be used in default argument
11973 The keyword `this' shall not be used in a default argument of a
11974 member function. */
11975 var
= walk_tree (&arg
, local_variable_p_walkfn
, NULL
);
11978 cp_error ("default argument `%E' uses local variable `%D'",
11980 return error_mark_node
;
11987 /* Decode the list of parameter types for a function type.
11988 Given the list of things declared inside the parens,
11989 return a list of types.
11991 The list we receive can have three kinds of elements:
11992 an IDENTIFIER_NODE for names given without types,
11993 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11994 or void_type_node, to mark the end of an argument list
11995 when additional arguments are not permitted (... was not used).
11997 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11998 a mere declaration. A nonempty identifier-list gets an error message
11999 when FUNCDEF_FLAG is zero.
12000 If FUNCDEF_FLAG is 1, then parameter types must be complete.
12001 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
12003 If all elements of the input list contain types,
12004 we return a list of the types.
12005 If all elements contain no type (except perhaps a void_type_node
12006 at the end), we return a null list.
12007 If some have types and some do not, it is an error, and we
12008 return a null list.
12010 Also set last_function_parms to either
12011 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
12012 A list of names is converted to a chain of PARM_DECLs
12013 by store_parm_decls so that ultimately it is always a chain of decls.
12015 Note that in C++, parameters can take default values. These default
12016 values are in the TREE_PURPOSE field of the TREE_LIST. It is
12017 an error to specify default values which are followed by parameters
12018 that have no default values, or an ELLIPSES. For simplicities sake,
12019 only parameters which are specified with their types can take on
12023 grokparms (first_parm
, funcdef_flag
)
12027 tree result
= NULL_TREE
;
12028 tree decls
= NULL_TREE
;
12030 if (first_parm
!= NULL_TREE
12031 && TREE_CODE (TREE_VALUE (first_parm
)) == IDENTIFIER_NODE
)
12033 if (! funcdef_flag
)
12034 pedwarn ("parameter names (without types) in function declaration");
12035 last_function_parms
= first_parm
;
12038 else if (first_parm
!= NULL_TREE
12039 && TREE_CODE (TREE_VALUE (first_parm
)) != TREE_LIST
12040 && TREE_CODE (TREE_VALUE (first_parm
)) != VOID_TYPE
)
12041 my_friendly_abort (145);
12044 /* Types were specified. This is a list of declarators
12045 each represented as a TREE_LIST node. */
12046 register tree parm
, chain
;
12047 int any_init
= 0, any_error
= 0;
12049 if (first_parm
!= NULL_TREE
)
12051 tree last_result
= NULL_TREE
;
12052 tree last_decl
= NULL_TREE
;
12054 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
12056 tree type
= NULL_TREE
, list_node
= parm
;
12057 register tree decl
= TREE_VALUE (parm
);
12058 tree init
= TREE_PURPOSE (parm
);
12060 chain
= TREE_CHAIN (parm
);
12061 /* @@ weak defense against parse errors. */
12062 if (TREE_CODE (decl
) != VOID_TYPE
12063 && TREE_CODE (decl
) != TREE_LIST
)
12065 /* Give various messages as the need arises. */
12066 if (TREE_CODE (decl
) == STRING_CST
)
12067 cp_error ("invalid string constant `%E'", decl
);
12068 else if (TREE_CODE (decl
) == INTEGER_CST
)
12069 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
12073 if (TREE_CODE (decl
) != VOID_TYPE
)
12075 decl
= grokdeclarator (TREE_VALUE (decl
),
12076 TREE_PURPOSE (decl
),
12077 PARM
, init
!= NULL_TREE
,
12079 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
12082 /* Top-level qualifiers on the parameters are
12083 ignored for function types. */
12084 type
= TYPE_MAIN_VARIANT (TREE_TYPE (decl
));
12086 if (TREE_CODE (type
) == VOID_TYPE
)
12087 decl
= void_type_node
;
12088 else if (TREE_CODE (type
) == METHOD_TYPE
)
12090 if (DECL_NAME (decl
))
12091 /* Cannot use the decl here because
12092 we don't have DECL_CONTEXT set up yet. */
12093 cp_error ("parameter `%D' invalidly declared method type",
12096 error ("parameter invalidly declared method type");
12097 type
= build_pointer_type (type
);
12098 TREE_TYPE (decl
) = type
;
12100 else if (TREE_CODE (type
) == OFFSET_TYPE
)
12102 if (DECL_NAME (decl
))
12103 cp_error ("parameter `%D' invalidly declared offset type",
12106 error ("parameter invalidly declared offset type");
12107 type
= build_pointer_type (type
);
12108 TREE_TYPE (decl
) = type
;
12110 else if (abstract_virtuals_error (decl
, type
))
12111 any_error
= 1; /* Seems like a good idea. */
12112 else if (POINTER_TYPE_P (type
))
12115 while (POINTER_TYPE_P (t
)
12116 || (TREE_CODE (t
) == ARRAY_TYPE
12117 && TYPE_DOMAIN (t
) != NULL_TREE
))
12119 if (TREE_CODE (t
) == ARRAY_TYPE
)
12120 cp_error ("parameter type `%T' includes %s to array of unknown bound",
12122 TYPE_PTR_P (type
) ? "pointer" : "reference");
12126 if (TREE_CODE (decl
) == VOID_TYPE
)
12128 if (result
== NULL_TREE
)
12130 result
= void_list_node
;
12131 last_result
= result
;
12135 TREE_CHAIN (last_result
) = void_list_node
;
12136 last_result
= void_list_node
;
12139 && (chain
!= void_list_node
|| TREE_CHAIN (chain
)))
12140 error ("`void' in parameter list must be entire list");
12144 /* Since there is a prototype, args are passed in their own types. */
12145 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
12146 if (PROMOTE_PROTOTYPES
12147 && (TREE_CODE (type
) == INTEGER_TYPE
12148 || TREE_CODE (type
) == ENUMERAL_TYPE
)
12149 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
12150 DECL_ARG_TYPE (decl
) = integer_type_node
;
12151 if (!any_error
&& init
)
12154 init
= check_default_argument (decl
, init
);
12159 if (decls
== NULL_TREE
)
12166 TREE_CHAIN (last_decl
) = decl
;
12169 list_node
= tree_cons (init
, type
, NULL_TREE
);
12170 if (result
== NULL_TREE
)
12172 result
= list_node
;
12173 last_result
= result
;
12177 TREE_CHAIN (last_result
) = list_node
;
12178 last_result
= list_node
;
12182 TREE_CHAIN (last_result
) = NULL_TREE
;
12183 /* If there are no parameters, and the function does not end
12184 with `...', then last_decl will be NULL_TREE. */
12185 if (last_decl
!= NULL_TREE
)
12186 TREE_CHAIN (last_decl
) = NULL_TREE
;
12190 last_function_parms
= decls
;
12195 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
12196 FUNCTION_TYPE with the newly parsed version of its default argument, which
12197 was previously digested as text. See snarf_defarg et al in lex.c. */
12200 replace_defarg (arg
, init
)
12203 if (! processing_template_decl
12204 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
12205 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
12206 TREE_TYPE (init
), TREE_VALUE (arg
));
12207 TREE_PURPOSE (arg
) = init
;
12210 /* D is a constructor or overloaded `operator='. Returns non-zero if
12211 D's arguments allow it to be a copy constructor, or copy assignment
12220 if (!DECL_FUNCTION_MEMBER_P (d
))
12223 t
= FUNCTION_ARG_CHAIN (d
);
12224 if (DECL_CONSTRUCTOR_P (d
) && DECL_HAS_IN_CHARGE_PARM_P (d
))
12225 t
= TREE_CHAIN (t
);
12226 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
12227 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
12228 == DECL_CONTEXT (d
))
12229 && (TREE_CHAIN (t
) == NULL_TREE
12230 || TREE_CHAIN (t
) == void_list_node
12231 || TREE_PURPOSE (TREE_CHAIN (t
))))
12236 /* These memoizing functions keep track of special properties which
12237 a class may have. `grok_ctor_properties' notices whether a class
12238 has a constructor of the form X(X&), and also complains
12239 if the class has a constructor of the form X(X).
12240 `grok_op_properties' takes notice of the various forms of
12241 operator= which are defined, as well as what sorts of type conversion
12242 may apply. Both functions take a FUNCTION_DECL as an argument. */
12245 grok_ctor_properties (ctype
, decl
)
12248 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
12249 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
12251 /* When a type has virtual baseclasses, a magical first int argument is
12252 added to any ctor so we can tell if the class has been initialized
12253 yet. This could screw things up in this function, so we deliberately
12254 ignore the leading int if we're in that situation. */
12255 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
12257 my_friendly_assert (parmtypes
12258 && TREE_VALUE (parmtypes
) == integer_type_node
,
12260 parmtypes
= TREE_CHAIN (parmtypes
);
12261 parmtype
= TREE_VALUE (parmtypes
);
12266 A non-template constructor for class X is a copy constructor if
12267 its first parameter is of type X&, const X&, volatile X& or const
12268 volatile X&, and either there are no other parameters or else all
12269 other parameters have default arguments. */
12270 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
12271 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
12272 && (TREE_CHAIN (parmtypes
) == NULL_TREE
12273 || TREE_CHAIN (parmtypes
) == void_list_node
12274 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
12275 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12276 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12278 TYPE_HAS_INIT_REF (ctype
) = 1;
12279 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12280 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
12284 A declaration of a constructor for a class X is ill-formed if its
12285 first parameter is of type (optionally cv-qualified) X and either
12286 there are no other parameters or else all other parameters have
12289 We *don't* complain about member template instantiations that
12290 have this form, though; they can occur as we try to decide what
12291 constructor to use during overload resolution. Since overload
12292 resolution will never prefer such a constructor to the
12293 non-template copy constructor (which is either explicitly or
12294 implicitly defined), there's no need to worry about their
12295 existence. Theoretically, they should never even be
12296 instantiated, but that's hard to forestall. */
12297 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
12298 && (TREE_CHAIN (parmtypes
) == NULL_TREE
12299 || TREE_CHAIN (parmtypes
) == void_list_node
12300 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
12301 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12302 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12304 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
12306 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
12309 else if (TREE_CODE (parmtype
) == VOID_TYPE
12310 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
12311 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
12316 /* An operator with this code is unary, but can also be binary. */
12320 enum tree_code code
;
12322 return (code
== INDIRECT_REF
12323 || code
== ADDR_EXPR
12324 || code
== CONVERT_EXPR
12325 || code
== NEGATE_EXPR
12326 || code
== PREINCREMENT_EXPR
12327 || code
== PREDECREMENT_EXPR
);
12330 /* An operator with this name can only be unary. */
12334 enum tree_code code
;
12336 return (code
== TRUTH_NOT_EXPR
12337 || code
== BIT_NOT_EXPR
12338 || code
== COMPONENT_REF
12339 || code
== TYPE_EXPR
);
12342 /* Do a little sanity-checking on how they declared their operator. */
12345 grok_op_properties (decl
, virtualp
, friendp
)
12347 int virtualp
, friendp
;
12349 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
12351 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
12352 tree name
= DECL_NAME (decl
);
12353 enum tree_code operator_code
;
12356 /* Count the number of arguments. */
12357 for (argtype
= argtypes
, arity
= 0;
12358 argtype
&& argtype
!= void_list_node
;
12359 argtype
= TREE_CHAIN (argtype
))
12362 if (current_class_type
== NULL_TREE
)
12365 if (DECL_CONV_FN_P (decl
))
12366 operator_code
= TYPE_EXPR
;
12370 #define DEF_OPERATOR(NAME, CODE, NEW_MANGLING, OLD_MANGING, ARITY, ASSN_P) \
12371 if (ansi_opname (CODE) == name) \
12373 operator_code = CODE; \
12376 else if (ansi_assopname (CODE) == name) \
12378 operator_code = CODE; \
12379 DECL_ASSIGNMENT_OPERATOR_P (decl) = 1; \
12383 #include "operators.def"
12384 #undef DEF_OPERATOR
12386 my_friendly_abort (20000527);
12389 my_friendly_assert (operator_code
!= LAST_CPLUS_TREE_CODE
, 20000526);
12390 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12394 switch (operator_code
)
12397 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
12401 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
12404 case COMPONENT_REF
:
12406 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
12410 TYPE_HAS_NEW_OPERATOR (current_class_type
) = 1;
12414 TYPE_GETS_DELETE (current_class_type
) |= 1;
12418 TYPE_HAS_ARRAY_NEW_OPERATOR (current_class_type
) = 1;
12421 case VEC_DELETE_EXPR
:
12422 TYPE_GETS_DELETE (current_class_type
) |= 2;
12430 if (operator_code
== NEW_EXPR
|| operator_code
== VEC_NEW_EXPR
)
12432 /* When the compiler encounters the definition of A::operator new, it
12433 doesn't look at the class declaration to find out if it's static. */
12435 revert_static_member_fn (decl
);
12437 /* Take care of function decl if we had syntax errors. */
12438 if (argtypes
== NULL_TREE
)
12440 = build_function_type (ptr_type_node
,
12441 hash_tree_chain (integer_type_node
,
12444 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
12446 else if (operator_code
== DELETE_EXPR
|| operator_code
== VEC_DELETE_EXPR
)
12449 revert_static_member_fn (decl
);
12451 if (argtypes
== NULL_TREE
)
12453 = build_function_type (void_type_node
,
12454 hash_tree_chain (ptr_type_node
,
12457 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
12461 /* An operator function must either be a non-static member function
12462 or have at least one parameter of a class, a reference to a class,
12463 an enumeration, or a reference to an enumeration. 13.4.0.6 */
12464 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
12466 if (operator_code
== TYPE_EXPR
12467 || operator_code
== CALL_EXPR
12468 || operator_code
== COMPONENT_REF
12469 || operator_code
== ARRAY_REF
12470 || operator_code
== NOP_EXPR
)
12471 cp_error ("`%D' must be a nonstatic member function", decl
);
12476 if (DECL_STATIC_FUNCTION_P (decl
))
12477 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
12480 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
12482 tree arg
= TREE_VALUE (p
);
12483 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
12484 arg
= TREE_TYPE (arg
);
12486 /* This lets bad template code slip through. */
12487 if (IS_AGGR_TYPE (arg
)
12488 || TREE_CODE (arg
) == ENUMERAL_TYPE
12489 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
12490 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
12494 ("`%D' must have an argument of class or enumerated type",
12501 if (operator_code
== CALL_EXPR
)
12502 return; /* No restrictions on args. */
12504 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
12506 tree t
= TREE_TYPE (name
);
12509 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
12510 const char *what
= 0;
12513 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
12515 if (TREE_CODE (t
) == VOID_TYPE
)
12517 else if (t
== current_class_type
)
12518 what
= "the same type";
12519 /* Don't force t to be complete here. */
12520 else if (IS_AGGR_TYPE (t
)
12521 && COMPLETE_TYPE_P (t
)
12522 && DERIVED_FROM_P (t
, current_class_type
))
12523 what
= "a base class";
12526 warning ("conversion to %s%s will never use a type conversion operator",
12527 ref
? "a reference to " : "", what
);
12531 if (DECL_ASSIGNMENT_OPERATOR_P (decl
)
12532 && operator_code
== NOP_EXPR
)
12536 if (arity
!= 2 && methodp
)
12538 cp_error ("`%D' must take exactly one argument", decl
);
12541 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
12545 A user-declared copy assignment operator X::operator= is
12546 a non-static non-template member function of class X with
12547 exactly one parameter of type X, X&, const X&, volatile
12548 X& or const volatile X&. */
12549 if (copy_assignment_arg_p (parmtype
, virtualp
)
12550 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12551 && is_member_template (DECL_TI_TEMPLATE (decl
)))
12554 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
12555 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
12556 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12557 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
12560 else if (operator_code
== COND_EXPR
)
12563 cp_error ("ISO C++ prohibits overloading operator ?:");
12565 else if (ambi_op_p (operator_code
))
12568 /* We pick the one-argument operator codes by default, so
12569 we don't have to change anything. */
12571 else if (arity
== 2)
12573 /* If we thought this was a unary operator, we now know
12574 it to be a binary operator. */
12575 switch (operator_code
)
12578 operator_code
= MULT_EXPR
;
12582 operator_code
= BIT_AND_EXPR
;
12586 operator_code
= PLUS_EXPR
;
12590 operator_code
= MINUS_EXPR
;
12593 case PREINCREMENT_EXPR
:
12594 operator_code
= POSTINCREMENT_EXPR
;
12597 case PREDECREMENT_EXPR
:
12598 operator_code
= POSTDECREMENT_EXPR
;
12602 my_friendly_abort (20000527);
12605 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12607 if ((operator_code
== POSTINCREMENT_EXPR
12608 || operator_code
== POSTDECREMENT_EXPR
)
12609 && ! processing_template_decl
12610 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
12613 cp_error ("postfix `%D' must take `int' as its argument",
12617 ("postfix `%D' must take `int' as its second argument",
12624 cp_error ("`%D' must take either zero or one argument", decl
);
12626 cp_error ("`%D' must take either one or two arguments", decl
);
12629 /* More Effective C++ rule 6. */
12631 && (operator_code
== POSTINCREMENT_EXPR
12632 || operator_code
== POSTDECREMENT_EXPR
12633 || operator_code
== PREINCREMENT_EXPR
12634 || operator_code
== PREDECREMENT_EXPR
))
12636 tree arg
= TREE_VALUE (argtypes
);
12637 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
12638 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
12639 arg
= TREE_TYPE (arg
);
12640 arg
= TYPE_MAIN_VARIANT (arg
);
12641 if (operator_code
== PREINCREMENT_EXPR
12642 || operator_code
== PREDECREMENT_EXPR
)
12644 if (TREE_CODE (ret
) != REFERENCE_TYPE
12645 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
12647 cp_warning ("prefix `%D' should return `%T'", decl
,
12648 build_reference_type (arg
));
12652 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
12653 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
12657 else if (unary_op_p (operator_code
))
12662 cp_error ("`%D' must take `void'", decl
);
12664 cp_error ("`%D' must take exactly one argument", decl
);
12667 else /* if (binary_op_p (operator_code)) */
12672 cp_error ("`%D' must take exactly one argument", decl
);
12674 cp_error ("`%D' must take exactly two arguments", decl
);
12677 /* More Effective C++ rule 7. */
12679 && (operator_code
== TRUTH_ANDIF_EXPR
12680 || operator_code
== TRUTH_ORIF_EXPR
12681 || operator_code
== COMPOUND_EXPR
))
12682 cp_warning ("user-defined `%D' always evaluates both arguments",
12686 /* Effective C++ rule 23. */
12689 && (operator_code
== PLUS_EXPR
12690 || operator_code
== MINUS_EXPR
12691 || operator_code
== TRUNC_DIV_EXPR
12692 || operator_code
== MULT_EXPR
)
12693 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
12694 cp_warning ("`%D' should return by value", decl
);
12697 for (; argtypes
&& argtypes
!= void_list_node
;
12698 argtypes
= TREE_CHAIN (argtypes
))
12699 if (TREE_PURPOSE (argtypes
))
12701 TREE_PURPOSE (argtypes
) = NULL_TREE
;
12702 if (operator_code
== POSTINCREMENT_EXPR
12703 || operator_code
== POSTDECREMENT_EXPR
)
12706 cp_pedwarn ("`%D' cannot have default arguments", decl
);
12709 cp_error ("`%D' cannot have default arguments", decl
);
12715 static const char *
12717 enum tag_types code
;
12730 my_friendly_abort (981122);
12734 /* Get the struct, enum or union (CODE says which) with tag NAME.
12735 Define the tag as a forward-reference if it is not defined.
12737 C++: If a class derivation is given, process it here, and report
12738 an error if multiple derivation declarations are not identical.
12740 If this is a definition, come in through xref_tag and only look in
12741 the current frame for the name (since C++ allows new names in any
12745 xref_tag (code_type_node
, name
, globalize
)
12746 tree code_type_node
;
12750 enum tag_types tag_code
;
12751 enum tree_code code
;
12752 register tree ref
, t
;
12753 struct binding_level
*b
= current_binding_level
;
12755 tree attributes
= NULL_TREE
;
12756 tree context
= NULL_TREE
;
12758 /* If we are called from the parser, code_type_node will sometimes be a
12759 TREE_LIST. This indicates that the user wrote
12760 "class __attribute__ ((foo)) bar". Extract the attributes so we can
12762 if (TREE_CODE (code_type_node
) == TREE_LIST
)
12764 attributes
= TREE_PURPOSE (code_type_node
);
12765 code_type_node
= TREE_VALUE (code_type_node
);
12768 tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12773 code
= RECORD_TYPE
;
12779 code
= ENUMERAL_TYPE
;
12782 my_friendly_abort (18);
12785 /* If a cross reference is requested, look up the type
12786 already defined for this tag and return it. */
12790 name
= TYPE_IDENTIFIER (t
);
12794 t
= IDENTIFIER_TYPE_VALUE (name
);
12796 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
12797 && TREE_CODE (t
) != TEMPLATE_TEMPLATE_PARM
)
12802 /* If we know we are defining this tag, only look it up in
12803 this scope and don't try to find it as a type. */
12804 ref
= lookup_tag (code
, name
, b
, 1);
12810 /* [dcl.type.elab] If the identifier resolves to a
12811 typedef-name or a template type-parameter, the
12812 elaborated-type-specifier is ill-formed. */
12813 if (t
!= TYPE_MAIN_VARIANT (t
)
12814 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
12815 cp_pedwarn ("using typedef-name `%D' after `%s'",
12816 TYPE_NAME (t
), tag_name (tag_code
));
12817 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12818 cp_error ("using template type parameter `%T' after `%s'",
12819 t
, tag_name (tag_code
));
12824 ref
= lookup_tag (code
, name
, b
, 0);
12828 /* Try finding it as a type declaration. If that wins,
12830 ref
= lookup_name (name
, 1);
12832 if (ref
!= NULL_TREE
12833 && processing_template_decl
12834 && DECL_CLASS_TEMPLATE_P (ref
)
12835 && template_class_depth (current_class_type
) == 0)
12836 /* Since GLOBALIZE is true, we're declaring a global
12837 template, so we want this type. */
12838 ref
= DECL_TEMPLATE_RESULT (ref
);
12840 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12841 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12842 ref
= TREE_TYPE (ref
);
12847 if (ref
&& current_class_type
12848 && template_class_depth (current_class_type
)
12849 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12851 /* Since GLOBALIZE is non-zero, we are not looking at a
12852 definition of this tag. Since, in addition, we are currently
12853 processing a (member) template declaration of a template
12854 class, we must be very careful; consider:
12861 { template <class V>
12862 friend struct S1; };
12864 Here, the S2::S1 declaration should not be confused with the
12865 outer declaration. In particular, the inner version should
12866 have a template parameter of level 2, not level 1. This
12867 would be particularly important if the member declaration
12870 template <class V = U> friend struct S1;
12872 say, when we should tsubst into `U' when instantiating
12873 S2. On the other hand, when presented with:
12883 we must find the inner binding eventually. We
12884 accomplish this by making sure that the new type we
12885 create to represent this declaration has the right
12887 context
= TYPE_CONTEXT (ref
);
12894 /* If no such tag is yet defined, create a forward-reference node
12895 and record it as the "definition".
12896 When a real declaration of this type is found,
12897 the forward-reference will be altered into a real type. */
12898 if (code
== ENUMERAL_TYPE
)
12900 cp_error ("use of enum `%#D' without previous declaration", name
);
12902 ref
= make_node (ENUMERAL_TYPE
);
12904 /* Give the type a default layout like unsigned int
12905 to avoid crashing if it does not get defined. */
12906 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12907 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12908 TYPE_USER_ALIGN (ref
) = 0;
12909 TREE_UNSIGNED (ref
) = 1;
12910 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12911 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12912 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12914 /* Enable us to recognize when a type is created in class context.
12915 To do nested classes correctly, this should probably be cleared
12916 out when we leave this classes scope. Currently this in only
12917 done in `start_enum'. */
12919 pushtag (name
, ref
, globalize
);
12923 struct binding_level
*old_b
= class_binding_level
;
12925 ref
= make_aggr_type (code
);
12926 TYPE_CONTEXT (ref
) = context
;
12928 #ifdef NONNESTED_CLASSES
12929 /* Class types don't nest the way enums do. */
12930 class_binding_level
= (struct binding_level
*)0;
12932 pushtag (name
, ref
, globalize
);
12933 class_binding_level
= old_b
;
12938 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12939 redeclare_class_template (ref
, current_template_parms
);
12942 /* Until the type is defined, tentatively accept whatever
12943 structure tag the user hands us. */
12944 if (!COMPLETE_TYPE_P (ref
)
12945 && ref
!= current_class_type
12946 /* Have to check this, in case we have contradictory tag info. */
12947 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12949 if (tag_code
== class_type
)
12950 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12951 else if (tag_code
== record_type
)
12952 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12955 TREE_TYPE (ref
) = attributes
;
12961 xref_tag_from_type (old
, id
, globalize
)
12965 tree code_type_node
;
12967 if (TREE_CODE (old
) == RECORD_TYPE
)
12968 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12969 ? class_type_node
: record_type_node
);
12971 code_type_node
= union_type_node
;
12973 if (id
== NULL_TREE
)
12974 id
= TYPE_IDENTIFIER (old
);
12976 return xref_tag (code_type_node
, id
, globalize
);
12979 /* REF is a type (named NAME), for which we have just seen some
12980 baseclasses. BINFO is a list of those baseclasses; the
12981 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12982 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12983 struct, or union. */
12986 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12987 tree code_type_node
;
12991 /* In the declaration `A : X, Y, ... Z' we mark all the types
12992 (A, X, Y, ..., Z) so we can check for duplicates. */
12997 enum tag_types tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12999 if (tag_code
== union_type
)
13001 cp_error ("derived union `%T' invalid", ref
);
13005 len
= list_length (binfo
);
13007 /* First, make sure that any templates in base-classes are
13008 instantiated. This ensures that if we call ourselves recursively
13009 we do not get confused about which classes are marked and which
13011 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
13012 complete_type (TREE_VALUE (base
));
13014 SET_CLASSTYPE_MARKED (ref
);
13015 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
13017 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
13019 /* The base of a derived struct is public by default. */
13021 = (TREE_PURPOSE (binfo
) == access_public_node
13022 || TREE_PURPOSE (binfo
) == access_public_virtual_node
13023 || (tag_code
!= class_type
13024 && (TREE_PURPOSE (binfo
) == access_default_node
13025 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
13027 = (TREE_PURPOSE (binfo
) == access_protected_node
13028 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
13030 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
13031 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
13032 || TREE_PURPOSE (binfo
) == access_public_virtual_node
13033 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
13034 tree basetype
= TREE_VALUE (binfo
);
13037 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
13038 basetype
= TREE_TYPE (basetype
);
13040 || (TREE_CODE (basetype
) != RECORD_TYPE
13041 && TREE_CODE (basetype
) != TYPENAME_TYPE
13042 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
13043 && TREE_CODE (basetype
) != TEMPLATE_TEMPLATE_PARM
))
13045 cp_error ("base type `%T' fails to be a struct or class type",
13046 TREE_VALUE (binfo
));
13050 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
13052 /* This code replaces similar code in layout_basetypes.
13053 We put the complete_type first for implicit `typename'. */
13054 if (!COMPLETE_TYPE_P (basetype
)
13055 && ! (current_template_parms
&& uses_template_parms (basetype
)))
13057 cp_error ("base class `%T' has incomplete type", basetype
);
13062 if (CLASSTYPE_MARKED (basetype
))
13064 if (basetype
== ref
)
13065 cp_error ("recursive type `%T' undefined", basetype
);
13067 cp_error ("duplicate base type `%T' invalid", basetype
);
13071 if (TYPE_FOR_JAVA (basetype
)
13072 && (current_lang_stack
13073 == &VARRAY_TREE (current_lang_base
, 0)))
13074 TYPE_FOR_JAVA (ref
) = 1;
13076 /* Note that the BINFO records which describe individual
13077 inheritances are *not* shared in the lattice! They
13078 cannot be shared because a given baseclass may be
13079 inherited with different `accessibility' by different
13080 derived classes. (Each BINFO record describing an
13081 individual inheritance contains flags which say what
13082 the `accessibility' of that particular inheritance is.) */
13085 = make_binfo (size_zero_node
, basetype
,
13086 CLASS_TYPE_P (basetype
)
13087 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
13088 CLASS_TYPE_P (basetype
)
13089 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
13091 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
13092 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
13093 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
13094 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
13095 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
13097 /* We need to unshare the binfos now so that lookups during class
13098 definition work. */
13099 unshare_base_binfos (base_binfo
);
13101 SET_CLASSTYPE_MARKED (basetype
);
13103 /* We are free to modify these bits because they are meaningless
13104 at top level, and BASETYPE is a top-level type. */
13105 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
13107 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
13108 /* Converting to a virtual base class requires looking
13109 up the offset of the virtual base. */
13110 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
13113 if (CLASS_TYPE_P (basetype
))
13115 TYPE_HAS_NEW_OPERATOR (ref
)
13116 |= TYPE_HAS_NEW_OPERATOR (basetype
);
13117 TYPE_HAS_ARRAY_NEW_OPERATOR (ref
)
13118 |= TYPE_HAS_ARRAY_NEW_OPERATOR (basetype
);
13119 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
13120 /* If the base-class uses multiple inheritance, so do we. */
13121 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
13122 |= TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
13123 /* Likewise, if converting to a base of the base may require
13124 code, then we may need to generate code to convert to a
13126 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
)
13127 |= TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (basetype
);
13134 TREE_VEC_LENGTH (binfos
) = i
;
13136 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
13140 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
13141 /* If there is more than one non-empty they cannot be at the same
13143 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
13146 /* Unmark all the types. */
13148 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
13149 CLEAR_CLASSTYPE_MARKED (ref
);
13151 /* Now that we know all the base-classes, set up the list of virtual
13153 get_vbase_types (ref
);
13157 /* Begin compiling the definition of an enumeration type.
13158 NAME is its name (or null if anonymous).
13159 Returns the type object, as yet incomplete.
13160 Also records info about it so that build_enumerator
13161 may be used to declare the individual values as they are read. */
13167 register tree enumtype
= NULL_TREE
;
13168 struct binding_level
*b
= current_binding_level
;
13170 /* If this is the real definition for a previous forward reference,
13171 fill in the contents in the same object that used to be the
13172 forward reference. */
13174 if (name
!= NULL_TREE
)
13175 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
13177 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
13179 cp_error ("multiple definition of `%#T'", enumtype
);
13180 cp_error_at ("previous definition here", enumtype
);
13181 /* Clear out TYPE_VALUES, and start again. */
13182 TYPE_VALUES (enumtype
) = NULL_TREE
;
13186 enumtype
= make_node (ENUMERAL_TYPE
);
13187 pushtag (name
, enumtype
, 0);
13190 if (current_class_type
)
13191 TREE_ADDRESSABLE (b
->tags
) = 1;
13193 GNU_xref_decl (current_function_decl
, enumtype
);
13197 /* After processing and defining all the values of an enumeration type,
13198 install their decls in the enumeration type and finish it off.
13199 ENUMTYPE is the type object and VALUES a list of name-value pairs.
13200 Returns ENUMTYPE. */
13203 finish_enum (enumtype
)
13206 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
13207 /* Calculate the maximum value of any enumerator in this type. */
13209 tree values
= TYPE_VALUES (enumtype
);
13214 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
13219 /* The TREE_VALUE is a CONST_DECL for this enumeration
13221 decl
= TREE_VALUE (pair
);
13225 Following the closing brace of an enum-specifier, each
13226 enumerator has the type of its enumeration. Prior to the
13227 closing brace, the type of each enumerator is the type of
13228 its initializing value. */
13229 TREE_TYPE (decl
) = enumtype
;
13231 /* The DECL_INITIAL will be NULL if we are processing a
13232 template declaration and this enumeration constant had no
13233 explicit initializer. */
13234 value
= DECL_INITIAL (decl
);
13235 if (value
&& !processing_template_decl
)
13237 /* Set the TREE_TYPE for the VALUE as well. That's so
13238 that when we call decl_constant_value we get an
13239 entity of the right type (but with the constant
13240 value). Since we shouldn't ever call
13241 decl_constant_value on a template type, there's no
13242 reason to do that when processing_template_decl.
13243 And, if the expression is something like a
13244 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
13245 wreak havoc on the intended type of the expression.
13247 Of course, there's also no point in trying to compute
13248 minimum or maximum values if we're in a template. */
13249 TREE_TYPE (value
) = enumtype
;
13252 minnode
= maxnode
= value
;
13253 else if (tree_int_cst_lt (maxnode
, value
))
13255 else if (tree_int_cst_lt (value
, minnode
))
13259 if (processing_template_decl
)
13260 /* If this is just a template, leave the CONST_DECL
13261 alone. That way tsubst_copy will find CONST_DECLs for
13262 CONST_DECLs, and not INTEGER_CSTs. */
13265 /* In the list we're building up, we want the enumeration
13266 values, not the CONST_DECLs. */
13267 TREE_VALUE (pair
) = value
;
13271 maxnode
= minnode
= integer_zero_node
;
13273 TYPE_VALUES (enumtype
) = nreverse (values
);
13275 if (processing_template_decl
)
13277 tree scope
= current_scope ();
13278 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
13279 add_tree (build_min (TAG_DEFN
, enumtype
));
13283 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
13284 int lowprec
= min_precision (minnode
, unsignedp
);
13285 int highprec
= min_precision (maxnode
, unsignedp
);
13286 int precision
= MAX (lowprec
, highprec
);
13289 TYPE_SIZE (enumtype
) = NULL_TREE
;
13291 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
13293 TYPE_PRECISION (enumtype
) = precision
;
13295 fixup_unsigned_type (enumtype
);
13297 fixup_signed_type (enumtype
);
13299 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
13300 /* Use the width of the narrowest normal C type which is wide
13302 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
13305 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
13307 TYPE_SIZE (enumtype
) = 0;
13308 layout_type (enumtype
);
13310 /* Fix up all variant types of this enum type. */
13311 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
13312 tem
= TYPE_NEXT_VARIANT (tem
))
13314 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
13315 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
13316 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
13317 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
13318 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
13319 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
13320 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
13321 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
13322 TYPE_USER_ALIGN (tem
) = TYPE_USER_ALIGN (enumtype
);
13323 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
13326 /* Finish debugging output for this type. */
13327 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
13333 /* Build and install a CONST_DECL for an enumeration constant of the
13334 enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided.
13335 Assignment of sequential values by default is handled here. */
13338 build_enumerator (name
, value
, enumtype
)
13348 /* Remove no-op casts from the value. */
13350 STRIP_TYPE_NOPS (value
);
13352 if (! processing_template_decl
)
13354 /* Validate and default VALUE. */
13355 if (value
!= NULL_TREE
)
13357 value
= decl_constant_value (value
);
13359 if (TREE_CODE (value
) == INTEGER_CST
)
13361 value
= default_conversion (value
);
13362 constant_expression_warning (value
);
13366 cp_error ("enumerator value for `%D' not integer constant", name
);
13371 /* Default based on previous value. */
13372 if (value
== NULL_TREE
&& ! processing_template_decl
)
13376 if (TYPE_VALUES (enumtype
))
13378 /* The next value is the previous value ... */
13379 prev_value
= DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype
)));
13380 /* ... plus one. */
13381 value
= build_binary_op (PLUS_EXPR
,
13385 if (tree_int_cst_lt (value
, prev_value
))
13386 cp_error ("overflow in enumeration values at `%D'", name
);
13389 value
= integer_zero_node
;
13392 /* Remove no-op casts from the value. */
13394 STRIP_TYPE_NOPS (value
);
13396 /* To fix MAX_VAL enum consts. (bkoz) */
13397 TREE_TYPE (value
) = integer_type_node
;
13401 /* We always have to copy here; not all INTEGER_CSTs are unshared.
13402 Even in other cases, we will later (in finish_enum) be setting
13403 the type of VALUE. But, we don't need to make a copy if this
13404 VALUE is one of the enumeration constants for this same
13405 enumeration type. */
13406 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
13407 if (TREE_VALUE (values
) == value
)
13409 /* If we didn't break out of the loop, then we do need a copy. */
13410 if (!values
&& value
)
13411 value
= copy_node (value
);
13413 /* C++ associates enums with global, function, or class declarations. */
13414 context
= current_scope ();
13416 /* Build the actual enumeration constant. Note that the enumeration
13417 constants have the type of their initializers until the
13418 enumeration is complete:
13422 Following the closing brace of an enum-specifier, each enumer-
13423 ator has the type of its enumeration. Prior to the closing
13424 brace, the type of each enumerator is the type of its
13425 initializing value.
13427 In finish_enum we will reset the type. Of course, if we're
13428 processing a template, there may be no value. */
13429 type
= value
? TREE_TYPE (value
) : NULL_TREE
;
13431 if (context
&& context
== current_class_type
)
13432 /* This enum declaration is local to the class. We need the full
13433 lang_decl so that we can record DECL_CLASS_CONTEXT, for example. */
13434 decl
= build_lang_decl (CONST_DECL
, name
, type
);
13436 /* It's a global enum, or it's local to a function. (Note local to
13437 a function could mean local to a class method. */
13438 decl
= build_decl (CONST_DECL
, name
, type
);
13440 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
13441 DECL_INITIAL (decl
) = value
;
13442 TREE_READONLY (decl
) = 1;
13444 if (context
&& context
== current_class_type
)
13445 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
13446 on the TYPE_FIELDS list for `S'. (That's so that you can say
13447 things like `S::i' later.) */
13448 finish_member_declaration (decl
);
13452 GNU_xref_decl (current_function_decl
, decl
);
13455 /* Add this enumeration constant to the list for this type. */
13456 TYPE_VALUES (enumtype
) = tree_cons (name
, decl
, TYPE_VALUES (enumtype
));
13460 static int function_depth
;
13462 /* We're defining DECL. Make sure that it's type is OK. */
13465 check_function_type (decl
)
13468 tree fntype
= TREE_TYPE (decl
);
13469 tree return_type
= complete_type (TREE_TYPE (fntype
));
13471 /* In a function definition, arg types must be complete. */
13472 require_complete_types_for_parms (current_function_parms
);
13474 if (!COMPLETE_OR_VOID_TYPE_P (return_type
))
13476 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
13478 /* Make it return void instead, but don't change the
13479 type of the DECL_RESULT, in case we have a named return value. */
13480 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13482 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
13484 = build_cplus_method_type (ctype
,
13486 FUNCTION_ARG_CHAIN (decl
));
13490 = build_function_type (void_type_node
,
13491 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
13493 = build_exception_variant (fntype
,
13494 TYPE_RAISES_EXCEPTIONS (fntype
));
13497 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
13500 /* Create the FUNCTION_DECL for a function definition.
13501 DECLSPECS and DECLARATOR are the parts of the declaration;
13502 they describe the function's name and the type it returns,
13503 but twisted together in a fashion that parallels the syntax of C.
13505 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
13506 DECLARATOR is really the DECL for the function we are about to
13507 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
13508 indicating that the function is an inline defined in-class, and
13509 SF_EXPAND indicating that we should generate RTL for this
13512 This function creates a binding context for the function body
13513 as well as setting up the FUNCTION_DECL in current_function_decl.
13515 Returns 1 on success. If the DECLARATOR is not suitable for a function
13516 (it defines a datum instead), we return 0, which tells
13517 yyparse to report a parse error.
13519 For C++, we must first check whether that datum makes any sense.
13520 For example, "class A local_a(1,2);" means that variable local_a
13521 is an aggregate of type A, which should have a constructor
13522 applied to it with the argument list [1, 2]. */
13525 start_function (declspecs
, declarator
, attrs
, flags
)
13526 tree declspecs
, declarator
, attrs
;
13530 tree ctype
= NULL_TREE
;
13533 extern int have_extern_spec
;
13534 extern int used_extern_spec
;
13535 int doing_friend
= 0;
13536 struct binding_level
*bl
;
13538 /* Sanity check. */
13539 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
13540 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
13542 /* This should only be done once on the top most decl. */
13543 if (have_extern_spec
&& !used_extern_spec
)
13545 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
13546 used_extern_spec
= 1;
13549 if (flags
& SF_PRE_PARSED
)
13551 decl1
= declarator
;
13553 fntype
= TREE_TYPE (decl1
);
13554 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13555 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13557 /* ISO C++ 11.4/5. A friend function defined in a class is in
13558 the (lexical) scope of the class in which it is defined. */
13559 if (!ctype
&& DECL_FRIEND_P (decl1
))
13561 ctype
= DECL_FRIEND_CONTEXT (decl1
);
13563 /* CTYPE could be null here if we're dealing with a template;
13564 for example, `inline friend float foo()' inside a template
13565 will have no CTYPE set. */
13566 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
13572 last_function_parms
= DECL_ARGUMENTS (decl1
);
13573 last_function_parm_tags
= NULL_TREE
;
13577 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
13578 /* If the declarator is not suitable for a function definition,
13579 cause a syntax error. */
13580 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
13582 fntype
= TREE_TYPE (decl1
);
13584 restype
= TREE_TYPE (fntype
);
13585 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
13587 cp_error ("semicolon missing after declaration of `%#T'", restype
);
13588 shadow_tag (build_tree_list (NULL_TREE
, restype
));
13589 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
13590 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
13591 fntype
= build_function_type (integer_type_node
,
13592 TYPE_ARG_TYPES (fntype
));
13594 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
13596 TYPE_ARG_TYPES (fntype
));
13597 TREE_TYPE (decl1
) = fntype
;
13600 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13601 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13602 else if (DECL_MAIN_P (decl1
))
13604 /* If this doesn't return integer_type, complain. */
13605 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
13607 if (pedantic
|| warn_return_type
)
13608 pedwarn ("return type for `main' changed to `int'");
13609 TREE_TYPE (decl1
) = fntype
= default_function_type
;
13614 /* Sometimes we don't notice that a function is a static member, and
13615 build a METHOD_TYPE for it. Fix that up now. */
13616 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
)
13617 && TREE_CODE (TREE_TYPE (decl1
)) == METHOD_TYPE
)
13619 revert_static_member_fn (decl1
);
13620 last_function_parms
= TREE_CHAIN (last_function_parms
);
13624 /* Warn if function was previously implicitly declared
13625 (but not if we warned then). */
13626 if (! warn_implicit
13627 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
13628 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
13630 /* Set up current_class_type, and enter the scope of the class, if
13633 push_nested_class (ctype
, 1);
13634 else if (DECL_STATIC_FUNCTION_P (decl1
))
13635 push_nested_class (DECL_CONTEXT (decl1
), 2);
13637 /* Now that we have entered the scope of the class, we must restore
13638 the bindings for any template parameters surrounding DECL1, if it
13639 is an inline member template. (Order is important; consider the
13640 case where a template parameter has the same name as a field of
13641 the class.) It is not until after this point that
13642 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
13643 if (flags
& SF_INCLASS_INLINE
)
13644 maybe_begin_member_template_processing (decl1
);
13646 /* Effective C++ rule 15. See also c_expand_return. */
13648 && DECL_OVERLOADED_OPERATOR_P (decl1
) == NOP_EXPR
13649 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
13650 cp_warning ("`operator=' should return a reference to `*this'");
13652 /* Make the init_value nonzero so pushdecl knows this is not tentative.
13653 error_mark_node is replaced below (in poplevel) with the BLOCK. */
13654 if (!DECL_INITIAL (decl1
))
13655 DECL_INITIAL (decl1
) = error_mark_node
;
13657 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
13658 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
13661 /* This function exists in static storage.
13662 (This does not mean `static' in the C sense!) */
13663 TREE_STATIC (decl1
) = 1;
13665 /* We must call push_template_decl after current_class_type is set
13666 up. (If we are processing inline definitions after exiting a
13667 class scope, current_class_type will be NULL_TREE until set above
13668 by push_nested_class.) */
13669 if (processing_template_decl
)
13670 decl1
= push_template_decl (decl1
);
13672 /* We are now in the scope of the function being defined. */
13673 current_function_decl
= decl1
;
13675 /* Save the parm names or decls from this function's declarator
13676 where store_parm_decls will find them. */
13677 current_function_parms
= last_function_parms
;
13678 current_function_parm_tags
= last_function_parm_tags
;
13680 /* Make sure the parameter and return types are reasonable. When
13681 you declare a function, these types can be incomplete, but they
13682 must be complete when you define the function. */
13683 if (! processing_template_decl
)
13684 check_function_type (decl1
);
13686 /* Build the return declaration for the function. */
13687 restype
= TREE_TYPE (fntype
);
13688 if (!processing_template_decl
)
13690 if (!DECL_RESULT (decl1
))
13692 DECL_RESULT (decl1
)
13693 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13694 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype
),
13695 DECL_RESULT (decl1
));
13699 /* Just use `void'. Nobody will ever look at this anyhow. */
13700 DECL_RESULT (decl1
) = build_decl (RESULT_DECL
, 0, void_type_node
);
13702 /* Initialize RTL machinery. We cannot do this until
13703 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
13704 even when processing a template; this is how we get
13705 CFUN set up, and our per-function variables initialized. */
13706 bl
= current_binding_level
;
13707 init_function_start (decl1
, input_filename
, lineno
);
13708 current_binding_level
= bl
;
13709 expanding_p
= (flags
& SF_EXPAND
) != 0;
13711 /* Even though we're inside a function body, we still don't want to
13712 call expand_expr to calculate the size of a variable-sized array.
13713 We haven't necessarily assigned RTL to all variables yet, so it's
13714 not safe to try to expand expressions involving them. */
13715 immediate_size_expand
= 0;
13716 cfun
->x_dont_save_pending_sizes_p
= 1;
13718 /* If we're building a statement-tree, start the tree now. */
13719 if (processing_template_decl
|| !expanding_p
)
13720 begin_stmt_tree (&DECL_SAVED_TREE (decl1
));
13722 /* Let the user know we're compiling this function. */
13723 announce_function (decl1
);
13725 /* Record the decl so that the function name is defined.
13726 If we already have a decl for this name, and it is a FUNCTION_DECL,
13727 use the old decl. */
13728 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
13730 /* A specialization is not used to guide overload resolution. */
13731 if (!DECL_TEMPLATE_SPECIALIZATION (decl1
)
13732 && ! DECL_FUNCTION_MEMBER_P (decl1
))
13733 decl1
= pushdecl (decl1
);
13736 /* We need to set the DECL_CONTEXT. */
13737 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
13738 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
13739 /* And make sure we have enough default args. */
13740 check_default_args (decl1
);
13742 fntype
= TREE_TYPE (decl1
);
13745 /* Reset these in case the call to pushdecl changed them. */
13746 current_function_decl
= decl1
;
13747 cfun
->decl
= decl1
;
13749 /* Initialize the per-function data. */
13750 if (!DECL_PENDING_INLINE_P (decl1
) && DECL_SAVED_FUNCTION_DATA (decl1
))
13752 /* If we already parsed this function, and we're just expanding it
13753 now, restore saved state. */
13754 struct binding_level
*bl
= current_binding_level
;
13755 *cp_function_chain
= *DECL_SAVED_FUNCTION_DATA (decl1
);
13756 current_binding_level
= bl
;
13758 /* This function is being processed in whole-function mode; we
13759 already did semantic analysis. */
13760 cfun
->x_whole_function_mode_p
= 1;
13762 /* If we decided that we didn't want to inline this function,
13763 make sure the back-end knows that. */
13764 if (!current_function_cannot_inline
)
13765 current_function_cannot_inline
= cp_function_chain
->cannot_inline
;
13767 /* We don't need the saved data anymore. */
13768 free (DECL_SAVED_FUNCTION_DATA (decl1
));
13769 DECL_SAVED_FUNCTION_DATA (decl1
) = NULL
;
13771 else if (ctype
&& !doing_friend
&& !DECL_STATIC_FUNCTION_P (decl1
))
13773 /* We know that this was set up by `grokclassfn'. We do not
13774 wait until `store_parm_decls', since evil parse errors may
13775 never get us to that point. Here we keep the consistency
13776 between `current_class_type' and `current_class_ptr'. */
13777 tree t
= DECL_ARGUMENTS (decl1
);
13779 my_friendly_assert (t
!= NULL_TREE
&& TREE_CODE (t
) == PARM_DECL
,
13781 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
13784 cp_function_chain
->x_current_class_ref
13785 = build_indirect_ref (t
, NULL_PTR
);
13786 cp_function_chain
->x_current_class_ptr
= t
;
13788 /* Constructors and destructors need to know whether they're "in
13789 charge" of initializing virtual base classes. */
13790 if (DECL_HAS_IN_CHARGE_PARM_P (decl1
))
13791 current_in_charge_parm
= TREE_CHAIN (t
);
13794 if (DECL_INTERFACE_KNOWN (decl1
))
13796 tree ctx
= decl_function_context (decl1
);
13798 if (DECL_NOT_REALLY_EXTERN (decl1
))
13799 DECL_EXTERNAL (decl1
) = 0;
13801 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
13802 && TREE_PUBLIC (ctx
))
13803 /* This is a function in a local class in an extern inline
13805 comdat_linkage (decl1
);
13807 /* If this function belongs to an interface, it is public.
13808 If it belongs to someone else's interface, it is also external.
13809 This only affects inlines and template instantiations. */
13810 else if (interface_unknown
== 0
13811 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13812 || flag_alt_external_templates
))
13814 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
13815 || processing_template_decl
)
13817 DECL_EXTERNAL (decl1
)
13819 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
13820 && !DECL_VINDEX (decl1
)));
13822 /* For WIN32 we also want to put these in linkonce sections. */
13823 maybe_make_one_only (decl1
);
13826 DECL_EXTERNAL (decl1
) = 0;
13827 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
13828 DECL_INTERFACE_KNOWN (decl1
) = 1;
13830 else if (interface_unknown
&& interface_only
13831 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13832 || flag_alt_external_templates
))
13834 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13835 interface, we will have interface_only set but not
13836 interface_known. In that case, we don't want to use the normal
13837 heuristics because someone will supply a #pragma implementation
13838 elsewhere, and deducing it here would produce a conflict. */
13839 comdat_linkage (decl1
);
13840 DECL_EXTERNAL (decl1
) = 0;
13841 DECL_INTERFACE_KNOWN (decl1
) = 1;
13842 DECL_DEFER_OUTPUT (decl1
) = 1;
13846 /* This is a definition, not a reference.
13847 So clear DECL_EXTERNAL. */
13848 DECL_EXTERNAL (decl1
) = 0;
13850 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
13851 && ! DECL_INTERFACE_KNOWN (decl1
)
13852 /* Don't try to defer nested functions for now. */
13853 && ! decl_function_context (decl1
))
13854 DECL_DEFER_OUTPUT (decl1
) = 1;
13856 DECL_INTERFACE_KNOWN (decl1
) = 1;
13859 if (doing_semantic_analysis_p ())
13862 current_binding_level
->parm_flag
= 1;
13866 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13868 if (!building_stmt_tree ())
13870 GNU_xref_function (decl1
, current_function_parms
);
13871 make_function_rtl (decl1
);
13874 /* Promote the value to int before returning it. */
13875 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13876 restype
= type_promotes_to (restype
);
13878 /* If this fcn was already referenced via a block-scope `extern' decl
13879 (or an implicit decl), propagate certain information about the usage. */
13880 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13881 TREE_ADDRESSABLE (decl1
) = 1;
13883 if (DECL_RESULT (decl1
) == NULL_TREE
)
13885 DECL_RESULT (decl1
)
13886 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13887 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13888 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13893 if (DECL_DESTRUCTOR_P (decl1
))
13895 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13896 DECL_CONTEXT (dtor_label
) = current_function_decl
;
13898 /* Under the old ABI we return `this' from constructors, so we make
13899 ordinary `return' statements in constructors jump to CTOR_LABEL;
13900 from there we return `this'. Under the new ABI, we don't bother
13901 with any of this. By not setting CTOR_LABEL the remainder of the
13902 machinery is automatically disabled. */
13903 else if (!flag_new_abi
&& DECL_CONSTRUCTOR_P (decl1
))
13905 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13906 DECL_CONTEXT (ctor_label
) = current_function_decl
;
13912 /* Called after store_parm_decls for a function-try-block. */
13915 expand_start_early_try_stmts ()
13917 expand_start_try_stmts ();
13920 /* Store the parameter declarations into the current function declaration.
13921 This is called after parsing the parameter declarations, before
13922 digesting the body of the function.
13924 Also install to binding contour return value identifier, if any. */
13927 store_parm_decls ()
13929 register tree fndecl
= current_function_decl
;
13930 register tree parm
;
13931 int parms_have_cleanups
= 0;
13932 tree cleanups
= NULL_TREE
;
13934 /* This is a list of types declared among parms in a prototype. */
13935 tree parmtags
= current_function_parm_tags
;
13937 /* This is a chain of any other decls that came in among the parm
13938 declarations. If a parm is declared with enum {foo, bar} x;
13939 then CONST_DECLs for foo and bar are put here. */
13940 tree nonparms
= NULL_TREE
;
13942 /* Create a binding level for the parms. */
13943 if (!building_stmt_tree ())
13944 expand_start_bindings (2);
13946 if (current_function_parms
)
13948 /* This case is when the function was defined with an ANSI prototype.
13949 The parms already have decls, so we need not do anything here
13950 except record them as in effect
13951 and complain if any redundant old-style parm decls were written. */
13953 tree specparms
= current_function_parms
;
13956 if (doing_semantic_analysis_p ())
13958 /* Must clear this because it might contain TYPE_DECLs declared
13960 storedecls (NULL_TREE
);
13962 /* If we're doing semantic analysis, then we'll call pushdecl
13963 for each of these. We must do them in reverse order so that
13964 they end in the correct forward order. */
13965 specparms
= nreverse (specparms
);
13968 for (parm
= specparms
; parm
; parm
= next
)
13970 next
= TREE_CHAIN (parm
);
13971 if (TREE_CODE (parm
) == PARM_DECL
)
13973 tree type
= TREE_TYPE (parm
);
13975 if (doing_semantic_analysis_p ())
13979 if (DECL_NAME (parm
) == NULL_TREE
13980 || TREE_CODE (parm
) != VOID_TYPE
)
13983 cp_error ("parameter `%D' declared void", parm
);
13985 cleanup
= (processing_template_decl
13987 : maybe_build_cleanup (parm
));
13990 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13992 else if (type
!= error_mark_node
13993 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
13994 parms_have_cleanups
= 1;
13998 /* If we find an enum constant or a type tag,
13999 put it aside for the moment. */
14000 TREE_CHAIN (parm
) = NULL_TREE
;
14001 nonparms
= chainon (nonparms
, parm
);
14005 if (doing_semantic_analysis_p ())
14007 /* Get the decls in their original chain order
14008 and record in the function. This is all and only the
14009 PARM_DECLs that were pushed into scope by the loop above. */
14010 DECL_ARGUMENTS (fndecl
) = getdecls ();
14011 storetags (chainon (parmtags
, gettags ()));
14015 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
14017 /* Now store the final chain of decls for the arguments
14018 as the decl-chain of the current lexical scope.
14019 Put the enumerators in as well, at the front so that
14020 DECL_ARGUMENTS is not modified. */
14021 if (doing_semantic_analysis_p ())
14022 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
14024 /* Initialize the RTL code for the function. */
14025 DECL_SAVED_INSNS (fndecl
) = 0;
14026 if (! building_stmt_tree ())
14027 expand_function_start (fndecl
, parms_have_cleanups
);
14029 current_function_parms_stored
= 1;
14031 /* If this function is `main', emit a call to `__main'
14032 to run global initializers, etc. */
14033 if (DECL_MAIN_P (fndecl
) && !building_stmt_tree ())
14034 expand_main_function ();
14036 /* Now that we have initialized the parms, we can start their
14037 cleanups. We cannot do this before, since expand_decl_cleanup
14038 should not be called before the parm can be used. */
14041 finish_decl_cleanup (TREE_PURPOSE (cleanups
),
14042 TREE_VALUE (cleanups
));
14043 cleanups
= TREE_CHAIN (cleanups
);
14046 /* Create a binding contour which can be used to catch
14047 cleanup-generated temporaries. Also, if the return value needs or
14048 has initialization, deal with that now. */
14049 if (parms_have_cleanups
)
14052 if (!building_stmt_tree ())
14053 expand_start_bindings (2);
14056 /* Do the starting of the exception specifications, if we have any. */
14057 if (flag_exceptions
&& !processing_template_decl
14058 && flag_enforce_eh_specs
14059 && building_stmt_tree ()
14060 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
14061 current_eh_spec_try_block
= expand_start_eh_spec ();
14064 /* Bind a name and initialization to the return value of
14065 the current function. */
14068 store_return_init (decl
)
14071 /* If this named return value comes in a register, put it in a
14072 pseudo-register. */
14073 if (DECL_REGISTER (decl
))
14075 original_result_rtx
= DECL_RTL (decl
);
14076 /* Note that the mode of the old DECL_RTL may be wider than the
14077 mode of DECL_RESULT, depending on the calling conventions for
14078 the processor. For example, on the Alpha, a 32-bit integer
14079 is returned in a DImode register -- the DECL_RESULT has
14080 SImode but the DECL_RTL for the DECL_RESULT has DImode. So,
14081 here, we use the mode the back-end has already assigned for
14082 the return value. */
14083 DECL_RTL (decl
) = gen_reg_rtx (GET_MODE (original_result_rtx
));
14084 if (TREE_ADDRESSABLE (decl
))
14085 put_var_into_stack (decl
);
14090 /* We have finished doing semantic analysis on DECL, but have not yet
14091 generated RTL for its body. Save away our current state, so that
14092 when we want to generate RTL later we know what to do. */
14095 save_function_data (decl
)
14098 struct language_function
*f
;
14100 /* Save the language-specific per-function data so that we can
14101 get it back when we really expand this function. */
14102 my_friendly_assert (!DECL_PENDING_INLINE_P (decl
),
14106 f
= ((struct language_function
*)
14107 xmalloc (sizeof (struct language_function
)));
14108 bcopy ((char *) cp_function_chain
, (char *) f
,
14109 sizeof (struct language_function
));
14110 DECL_SAVED_FUNCTION_DATA (decl
) = f
;
14112 /* Clear out the bits we don't need. */
14113 f
->x_stmt_tree
.x_last_stmt
= NULL_TREE
;
14114 f
->x_stmt_tree
.x_last_expr_type
= NULL_TREE
;
14115 f
->x_result_rtx
= NULL_RTX
;
14116 f
->x_named_label_uses
= NULL
;
14117 f
->bindings
= NULL
;
14119 /* When we get back here again, we will be expanding. */
14120 f
->x_expanding_p
= 1;
14122 /* If we've already decided that we cannot inline this function, we
14123 must remember that fact when we actually go to expand the
14125 f
->cannot_inline
= current_function_cannot_inline
;
14128 /* At the end of every constructor we generate to code to return
14129 `this'. Do that now. */
14132 finish_constructor_body ()
14134 /* Any return from a constructor will end up here. */
14136 add_tree (build_min_nt (LABEL_STMT
, ctor_label
));
14138 /* Clear CTOR_LABEL so that finish_return_stmt knows to really
14139 generate the return, rather than a goto to CTOR_LABEL. */
14140 ctor_label
= NULL_TREE
;
14141 /* In check_return_expr we translate an empty return from a
14142 constructor to a return of `this'. */
14143 finish_return_stmt (NULL_TREE
);
14144 /* Mark the end of the constructor. */
14145 add_tree (build_min_nt (CTOR_STMT
));
14148 /* At the end of every destructor we generate code to restore virtual
14149 function tables to the values desired by base classes and to call
14150 to base class destructors. Do that now. */
14153 finish_destructor_body ()
14155 tree compound_stmt
;
14160 /* Create a block to contain all the extra code. */
14161 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
14163 /* Any return from a destructor will end up here. */
14164 add_tree (build_min_nt (LABEL_STMT
, dtor_label
));
14166 /* Generate the code to call destructor on base class. If this
14167 destructor belongs to a class with virtual functions, then set
14168 the virtual function table pointer to represent the type of our
14171 /* This side-effect makes call to `build_delete' generate the code
14172 we have to have at the end of this destructor. `build_delete'
14173 will set the flag again. */
14174 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
14176 exprstmt
= build_delete (current_class_type
,
14178 sfk_base_destructor
,
14179 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
,
14182 if (exprstmt
!= error_mark_node
14183 && (TREE_CODE (exprstmt
) != NOP_EXPR
14184 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
14185 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
14187 if (exprstmt
!= void_zero_node
)
14188 /* Don't call `expand_expr_stmt' if we're not going to do
14189 anything, since -Wall will give a diagnostic. */
14190 finish_expr_stmt (exprstmt
);
14192 /* Run destructors for all virtual baseclasses. */
14193 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
14198 if_stmt
= begin_if_stmt ();
14199 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
14200 current_in_charge_parm
,
14204 vbases
= CLASSTYPE_VBASECLASSES (current_class_type
);
14205 /* The CLASSTYPE_VBASECLASSES list is in initialization
14206 order, so we have to march through it in reverse order. */
14207 for (vbases
= nreverse (copy_list (vbases
));
14209 vbases
= TREE_CHAIN (vbases
))
14211 tree vbase
= TREE_VALUE (vbases
);
14213 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (vbase
)))
14215 tree vb
= get_vbase
14216 (BINFO_TYPE (vbase
),
14217 TYPE_BINFO (current_class_type
));
14219 (build_scoped_method_call
14220 (current_class_ref
, vb
, base_dtor_identifier
,
14225 finish_then_clause (if_stmt
);
14230 virtual_size
= c_sizeof (current_class_type
);
14232 /* At the end, call delete if that's what's requested. */
14234 /* FDIS sez: At the point of definition of a virtual destructor
14235 (including an implicit definition), non-placement operator delete
14236 shall be looked up in the scope of the destructor's class and if
14237 found shall be accessible and unambiguous.
14239 This is somewhat unclear, but I take it to mean that if the class
14240 only defines placement deletes we don't do anything here. So we
14241 pass LOOKUP_SPECULATIVELY; delete_sanity will complain for us if
14242 they ever try to delete one of these. */
14243 exprstmt
= build_op_delete_call
14244 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
14245 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
14247 if_stmt
= begin_if_stmt ();
14248 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
14249 current_in_charge_parm
,
14252 finish_expr_stmt (exprstmt
);
14253 finish_then_clause (if_stmt
);
14256 /* Close the block we started above. */
14257 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
14260 /* Finish up a function declaration and compile that function
14261 all the way to assembler language output. The free the storage
14262 for the function definition.
14264 FLAGS is a bitwise or of the following values:
14266 An extra call to poplevel (and expand_end_bindings) must be
14267 made to take care of the binding contour for the base
14268 initializers. This is only relevant for constructors.
14270 We just finished processing the body of an in-class inline
14271 function definition. (This processing will have taken place
14272 after the class definition is complete.) */
14275 finish_function (flags
)
14278 register tree fndecl
= current_function_decl
;
14279 tree fntype
, ctype
= NULL_TREE
;
14280 /* Label to use if this function is supposed to return a value. */
14281 tree no_return_label
= NULL_TREE
;
14282 int call_poplevel
= (flags
& 1) != 0;
14283 int inclass_inline
= (flags
& 2) != 0;
14286 int current_line
= lineno
;
14288 /* When we get some parse errors, we can end up without a
14289 current_function_decl, so cope. */
14290 if (fndecl
== NULL_TREE
)
14291 return error_mark_node
;
14293 nested
= function_depth
> 1;
14294 fntype
= TREE_TYPE (fndecl
);
14296 /* TREE_READONLY (fndecl) = 1;
14297 This caused &foo to be of type ptr-to-const-function
14298 which then got a warning when stored in a ptr-to-function variable. */
14300 /* This happens on strange parse errors. */
14301 if (! current_function_parms_stored
)
14304 store_parm_decls ();
14307 /* For a cloned function, we've already got all the code we need;
14308 there's no need to add any extra bits. */
14309 if (building_stmt_tree () && DECL_CLONED_FUNCTION_P (fndecl
))
14311 else if (building_stmt_tree ())
14313 if (DECL_CONSTRUCTOR_P (fndecl
))
14315 finish_constructor_body ();
14319 else if (DECL_DESTRUCTOR_P (fndecl
) && !processing_template_decl
)
14320 finish_destructor_body ();
14321 else if (DECL_MAIN_P (fndecl
))
14323 /* Make it so that `main' always returns 0 by default. */
14325 finish_return_stmt (integer_one_node
);
14327 finish_return_stmt (integer_zero_node
);
14331 /* Finish dealing with exception specifiers. */
14332 if (flag_exceptions
&& !processing_template_decl
14333 && flag_enforce_eh_specs
14334 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
14335 expand_end_eh_spec (TYPE_RAISES_EXCEPTIONS
14336 (TREE_TYPE (current_function_decl
)),
14337 current_eh_spec_try_block
);
14342 if (write_symbols
!= NO_DEBUG
/*&& TREE_CODE (fntype) != METHOD_TYPE*/)
14344 /* Keep this code around in case we later want to control debug info
14345 based on whether a type is "used". (jason 1999-11-11) */
14347 tree ttype
= target_type (fntype
);
14350 if (IS_AGGR_TYPE (ttype
))
14351 /* Let debugger know it should output info for this type. */
14352 note_debug_info_needed (ttype
);
14354 for (parmdecl
= DECL_ARGUMENTS (fndecl
); parmdecl
; parmdecl
= TREE_CHAIN (parmdecl
))
14356 ttype
= target_type (TREE_TYPE (parmdecl
));
14357 if (IS_AGGR_TYPE (ttype
))
14358 /* Let debugger know it should output info for this type. */
14359 note_debug_info_needed (ttype
);
14364 /* Clean house because we will need to reorder insns here. */
14365 do_pending_stack_adjust ();
14369 else if (DECL_CONSTRUCTOR_P (fndecl
))
14374 else if (return_label
!= NULL_RTX
14375 && flag_this_is_variable
<= 0
14376 && current_function_return_value
== NULL_TREE
14377 && ! DECL_NAME (DECL_RESULT (current_function_decl
)))
14378 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
14380 if (flag_exceptions
)
14381 expand_exception_blocks ();
14383 /* If this function is supposed to return a value, ensure that
14384 we do not fall into the cleanups by mistake. The end of our
14385 function will look like this:
14387 user code (may have return stmt somewhere)
14388 goto no_return_label
14393 NOTE_INSN_FUNCTION_END
14397 If the user omits a return stmt in the USER CODE section, we
14398 will have a control path which reaches NOTE_INSN_FUNCTION_END.
14399 Otherwise, we won't. */
14400 if (no_return_label
)
14402 DECL_CONTEXT (no_return_label
) = fndecl
;
14403 DECL_INITIAL (no_return_label
) = error_mark_node
;
14404 DECL_SOURCE_FILE (no_return_label
) = input_filename
;
14405 DECL_SOURCE_LINE (no_return_label
) = current_line
;
14406 expand_goto (no_return_label
);
14411 /* Remove the binding contour which is used
14412 to catch cleanup-generated temporaries. */
14413 expand_end_bindings (0, 0, 0);
14414 poplevel (0, 0, 0);
14416 /* Emit label at beginning of cleanup code for parameters. */
14417 emit_label (cleanup_label
);
14420 /* Get return value into register if that's where it's supposed
14422 if (original_result_rtx
)
14423 fixup_result_decl (DECL_RESULT (fndecl
), original_result_rtx
);
14425 /* Finish building code that will trigger warnings if users forget
14426 to make their functions return values. */
14427 if (no_return_label
|| cleanup_label
)
14428 emit_jump (return_label
);
14429 if (no_return_label
)
14431 /* We don't need to call `expand_*_return' here because we
14432 don't need any cleanups here--this path of code is only
14433 for error checking purposes. */
14434 expand_label (no_return_label
);
14437 /* We hard-wired immediate_size_expand to zero in
14438 start_function. Expand_function_end will decrement this
14439 variable. So, we set the variable to one here, so that after
14440 the decrement it will remain zero. */
14441 immediate_size_expand
= 1;
14443 /* Generate rtl for function exit. */
14444 expand_function_end (input_filename
, current_line
, 1);
14447 /* We have to save this value here in case
14448 maybe_end_member_template_processing decides to pop all the
14449 template parameters. */
14450 expand_p
= !building_stmt_tree ();
14452 /* If we're saving up tree structure, tie off the function now. */
14454 finish_stmt_tree (&DECL_SAVED_TREE (fndecl
));
14456 /* This must come after expand_function_end because cleanups might
14457 have declarations (from inline functions) that need to go into
14458 this function's blocks. */
14459 if (doing_semantic_analysis_p ())
14461 if (current_binding_level
->parm_flag
!= 1)
14462 my_friendly_abort (122);
14463 poplevel (1, 0, 1);
14466 /* Remember that we were in class scope. */
14467 if (current_class_name
)
14468 ctype
= current_class_type
;
14470 /* Must mark the RESULT_DECL as being in this function. */
14471 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
14473 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
14474 to the FUNCTION_DECL node itself. */
14475 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
14477 /* Save away current state, if appropriate. */
14478 if (!expanding_p
&& !processing_template_decl
)
14479 save_function_data (fndecl
);
14481 /* If this function calls `setjmp' it cannot be inlined. When
14482 `longjmp' is called it is not guaranteed to restore the value of
14483 local variables that have been modified since the call to
14484 `setjmp'. So, if were to inline this function into some caller
14485 `c', then when we `longjmp', we might not restore all variables
14486 in `c'. (It might seem, at first blush, that there's no way for
14487 this function to modify local variables in `c', but their
14488 addresses may have been stored somewhere accessible to this
14490 if (!expanding_p
&& !processing_template_decl
&& calls_setjmp_p (fndecl
))
14491 DECL_UNINLINABLE (fndecl
) = 1;
14498 /* So we can tell if jump_optimize sets it to 1. */
14501 /* Before we call rest_of_compilation (which will pop the
14502 CURRENT_FUNCTION), we must save these values. */
14503 returns_null
= current_function_returns_null
;
14504 returns_value
= current_function_returns_value
;
14506 /* If this is a nested function (like a template instantiation
14507 that we're compiling in the midst of compiling something
14508 else), push a new GC context. That will keep local variables
14509 on the stack from being collected while we're doing the
14510 compilation of this function. */
14511 if (function_depth
> 1)
14512 ggc_push_context ();
14514 /* Run the optimizers and output the assembler code for this
14516 rest_of_compilation (fndecl
);
14518 /* Undo the call to ggc_push_context above. */
14519 if (function_depth
> 1)
14520 ggc_pop_context ();
14522 if (DECL_SAVED_INSNS (fndecl
) && ! TREE_ASM_WRITTEN (fndecl
))
14524 /* Set DECL_EXTERNAL so that assemble_external will be called as
14525 necessary. We'll clear it again in finish_file. */
14526 if (! DECL_EXTERNAL (fndecl
))
14527 DECL_NOT_REALLY_EXTERN (fndecl
) = 1;
14528 DECL_EXTERNAL (fndecl
) = 1;
14533 /* Keep this code around in case we later want to control debug info
14534 based on whether a type is "used". (jason 1999-11-11) */
14536 if (ctype
&& TREE_ASM_WRITTEN (fndecl
))
14537 note_debug_info_needed (ctype
);
14540 returns_null
|= can_reach_end
;
14542 /* Since we don't normally go through c_expand_return for constructors,
14543 this normally gets the wrong value.
14544 Also, named return values have their return codes emitted after
14545 NOTE_INSN_FUNCTION_END, confusing jump.c. */
14546 if (DECL_CONSTRUCTOR_P (fndecl
)
14547 || DECL_NAME (DECL_RESULT (fndecl
)) != NULL_TREE
)
14550 if (TREE_THIS_VOLATILE (fndecl
) && returns_null
)
14551 cp_warning ("`noreturn' function `%D' does return", fndecl
);
14552 else if ((warn_return_type
|| pedantic
)
14554 && TREE_CODE (TREE_TYPE (fntype
)) != VOID_TYPE
)
14556 /* If this function returns non-void and control can drop through,
14558 cp_warning ("control reaches end of non-void function `%D'", fndecl
);
14560 /* With just -W, complain only if function returns both with
14561 and without a value. */
14562 else if (extra_warnings
&& returns_value
&& returns_null
)
14563 warning ("this function may return with or without a value");
14567 /* Clear out memory we no longer need. */
14568 free_after_parsing (cfun
);
14569 /* Since we never call rest_of_compilation, we never clear
14570 CFUN. Do so explicitly. */
14571 free_after_compilation (cfun
);
14575 /* If this is a in-class inline definition, we may have to pop the
14576 bindings for the template parameters that we added in
14577 maybe_begin_member_template_processing when start_function was
14579 if (inclass_inline
)
14580 maybe_end_member_template_processing ();
14582 /* Leave the scope of the class. */
14584 pop_nested_class ();
14588 if (!DECL_SAVED_INSNS (fndecl
) && !DECL_SAVED_FUNCTION_DATA (fndecl
)
14589 && !(flag_inline_trees
&& DECL_INLINE (fndecl
)))
14593 /* Stop pointing to the local nodes about to be freed. */
14594 /* But DECL_INITIAL must remain nonzero so we know this
14595 was an actual function definition. */
14596 DECL_INITIAL (fndecl
) = error_mark_node
;
14597 for (t
= DECL_ARGUMENTS (fndecl
); t
; t
= TREE_CHAIN (t
))
14598 DECL_RTL (t
) = DECL_INCOMING_RTL (t
) = NULL_RTX
;
14601 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
14602 static_ctors
= tree_cons (NULL_TREE
, fndecl
, static_ctors
);
14603 if (DECL_STATIC_DESTRUCTOR (fndecl
))
14604 static_dtors
= tree_cons (NULL_TREE
, fndecl
, static_dtors
);
14609 /* Let the error reporting routines know that we're outside a
14610 function. For a nested function, this value is used in
14611 pop_cp_function_context and then reset via pop_function_context. */
14612 current_function_decl
= NULL_TREE
;
14613 /* We don't really care about obstacks, but the middle-end
14614 sometimes cares on what obstck things are located. */
14615 permanent_allocation (1);
14621 /* Create the FUNCTION_DECL for a function definition.
14622 DECLSPECS and DECLARATOR are the parts of the declaration;
14623 they describe the return type and the name of the function,
14624 but twisted together in a fashion that parallels the syntax of C.
14626 This function creates a binding context for the function body
14627 as well as setting up the FUNCTION_DECL in current_function_decl.
14629 Returns a FUNCTION_DECL on success.
14631 If the DECLARATOR is not suitable for a function (it defines a datum
14632 instead), we return 0, which tells yyparse to report a parse error.
14634 May return void_type_node indicating that this method is actually
14635 a friend. See grokfield for more details.
14637 Came here with a `.pushlevel' .
14639 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14640 CHANGES TO CODE IN `grokfield'. */
14643 start_method (declspecs
, declarator
, attrlist
)
14644 tree declarator
, declspecs
, attrlist
;
14646 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
14649 /* Something too ugly to handle. */
14650 if (fndecl
== NULL_TREE
)
14653 /* Pass friends other than inline friend functions back. */
14654 if (fndecl
== void_type_node
)
14657 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
14658 /* Not a function, tell parser to report parse error. */
14661 if (DECL_IN_AGGR_P (fndecl
))
14663 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
14665 if (DECL_CONTEXT (fndecl
)
14666 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
14667 cp_error ("`%D' is already defined in class %s", fndecl
,
14668 TYPE_NAME_STRING (DECL_CONTEXT (fndecl
)));
14670 return void_type_node
;
14673 check_template_shadow (fndecl
);
14675 DECL_THIS_INLINE (fndecl
) = 1;
14677 if (flag_default_inline
)
14678 DECL_INLINE (fndecl
) = 1;
14680 /* We process method specializations in finish_struct_1. */
14681 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
14682 fndecl
= push_template_decl (fndecl
);
14684 if (! DECL_FRIEND_P (fndecl
))
14686 if (TREE_CHAIN (fndecl
))
14688 fndecl
= copy_node (fndecl
);
14689 TREE_CHAIN (fndecl
) = NULL_TREE
;
14692 if (DECL_CONSTRUCTOR_P (fndecl
))
14694 if (! grok_ctor_properties (current_class_type
, fndecl
))
14695 return void_type_node
;
14697 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
14698 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
14701 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0);
14703 /* Make a place for the parms */
14705 current_binding_level
->parm_flag
= 1;
14707 DECL_IN_AGGR_P (fndecl
) = 1;
14711 /* Go through the motions of finishing a function definition.
14712 We don't compile this method until after the whole class has
14715 FINISH_METHOD must return something that looks as though it
14716 came from GROKFIELD (since we are defining a method, after all).
14718 This is called after parsing the body of the function definition.
14719 STMTS is the chain of statements that makes up the function body.
14721 DECL is the ..._DECL that `start_method' provided. */
14724 finish_method (decl
)
14727 register tree fndecl
= decl
;
14730 register tree link
;
14732 if (decl
== void_type_node
)
14735 old_initial
= DECL_INITIAL (fndecl
);
14737 /* Undo the level for the parms (from start_method).
14738 This is like poplevel, but it causes nothing to be
14739 saved. Saving information here confuses symbol-table
14740 output routines. Besides, this information will
14741 be correctly output when this method is actually
14744 /* Clear out the meanings of the local variables of this level;
14745 also record in each decl which block it belongs to. */
14747 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
14749 if (DECL_NAME (link
) != NULL_TREE
)
14750 pop_binding (DECL_NAME (link
), link
);
14751 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
14752 DECL_CONTEXT (link
) = NULL_TREE
;
14755 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
14756 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
14757 current_binding_level
->parm_flag
,
14758 current_binding_level
->keep
);
14760 poplevel (0, 0, 0);
14762 DECL_INITIAL (fndecl
) = old_initial
;
14764 /* We used to check if the context of FNDECL was different from
14765 current_class_type as another way to get inside here. This didn't work
14766 for String.cc in libg++. */
14767 if (DECL_FRIEND_P (fndecl
))
14769 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
14770 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
14771 decl
= void_type_node
;
14777 /* Called when a new struct TYPE is defined.
14778 If this structure or union completes the type of any previous
14779 variable declaration, lay it out and output its rtl. */
14782 hack_incomplete_structures (type
)
14786 struct binding_level
*level
;
14788 if (!type
) /* Don't do this for class templates. */
14791 if (namespace_bindings_p ())
14794 list
= &namespace_scope_incomplete
;
14798 level
= innermost_nonclass_level ();
14799 list
= &level
->incomplete
;
14806 tree decl
= TREE_VALUE (*list
);
14807 if ((decl
&& TREE_TYPE (decl
) == type
)
14808 || (TREE_TYPE (decl
)
14809 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14810 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
14812 int toplevel
= toplevel_bindings_p ();
14813 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14814 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
14815 layout_type (TREE_TYPE (decl
));
14816 layout_decl (decl
, 0);
14817 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
14821 expand_decl (decl
);
14822 cleanup
= maybe_build_cleanup (decl
);
14823 expand_decl_init (decl
);
14824 if (! expand_decl_cleanup (decl
, cleanup
))
14825 cp_error ("parser lost in parsing declaration of `%D'",
14828 *list
= TREE_CHAIN (*list
);
14831 list
= &TREE_CHAIN (*list
);
14834 /* Keep looking through artificial binding levels generated
14835 for local variables. */
14836 if (level
&& level
->keep
== 2)
14838 level
= level
->level_chain
;
14839 list
= &level
->incomplete
;
14846 /* If DECL is of a type which needs a cleanup, build that cleanup
14850 maybe_build_cleanup (decl
)
14853 tree type
= TREE_TYPE (decl
);
14855 if (type
!= error_mark_node
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
14857 int flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14860 if (TREE_CODE (type
) == ARRAY_TYPE
)
14864 mark_addressable (decl
);
14865 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14868 /* Optimize for space over speed here. */
14869 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14870 || flag_expensive_optimizations
)
14871 flags
|= LOOKUP_NONVIRTUAL
;
14873 rval
= build_delete (TREE_TYPE (rval
), rval
,
14874 sfk_complete_destructor
, flags
, 0);
14876 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14877 && ! TYPE_HAS_DESTRUCTOR (type
))
14878 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14879 build_tree_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14886 /* Expand a C++ expression at the statement level.
14887 This is needed to ferret out nodes which have UNKNOWN_TYPE.
14888 The C++ type checker should get all of these out when
14889 expressions are combined with other, type-providing, expressions,
14890 leaving only orphan expressions, such as:
14892 &class::bar; / / takes its address, but does nothing with it. */
14895 cplus_expand_expr_stmt (exp
)
14899 /* We should do this eventually, but right now this causes regex.o from
14900 libg++ to miscompile, and tString to core dump. */
14901 exp
= build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (exp
), exp
);
14904 /* If we don't do this, we end up down inside expand_expr
14905 trying to do TYPE_MODE on the ERROR_MARK, and really
14906 go outside the bounds of the type. */
14907 if (exp
!= error_mark_node
)
14908 expand_expr_stmt (exp
);
14911 /* When a stmt has been parsed, this function is called. */
14916 /* Always assume this statement was not an expression statement. If
14917 it actually was an expression statement, its our callers
14918 responsibility to fix this up. */
14919 last_expr_type
= NULL_TREE
;
14922 /* DECL was originally constructed as a non-static member function,
14923 but turned out to be static. Update it accordingly. */
14926 revert_static_member_fn (decl
)
14930 tree function
= TREE_TYPE (decl
);
14931 tree args
= TYPE_ARG_TYPES (function
);
14933 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14934 != TYPE_UNQUALIFIED
)
14935 cp_error ("static member function `%#D' declared with type qualifiers",
14938 args
= TREE_CHAIN (args
);
14939 tmp
= build_function_type (TREE_TYPE (function
), args
);
14940 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14941 tmp
= build_exception_variant (tmp
,
14942 TYPE_RAISES_EXCEPTIONS (function
));
14943 TREE_TYPE (decl
) = tmp
;
14944 if (DECL_ARGUMENTS (decl
))
14945 DECL_ARGUMENTS (decl
) = TREE_CHAIN (DECL_ARGUMENTS (decl
));
14946 DECL_STATIC_FUNCTION_P (decl
) = 1;
14949 /* Initialize the variables used during compilation of a C++
14953 push_cp_function_context (f
)
14954 struct function
*f
;
14956 struct language_function
*p
14957 = ((struct language_function
*)
14958 xcalloc (1, sizeof (struct language_function
)));
14961 /* It takes an explicit call to expand_body to generate RTL for a
14965 /* Whenever we start a new function, we destroy temporaries in the
14967 stmts_are_full_exprs_p
= 1;
14970 /* Free the language-specific parts of F, now that we've finished
14971 compiling the function. */
14974 pop_cp_function_context (f
)
14975 struct function
*f
;
14978 free (f
->language
);
14982 /* Mark P for GC. */
14985 mark_lang_function (p
)
14986 struct language_function
*p
;
14991 ggc_mark_tree (p
->x_ctor_label
);
14992 ggc_mark_tree (p
->x_dtor_label
);
14993 ggc_mark_tree (p
->x_current_class_ptr
);
14994 ggc_mark_tree (p
->x_current_class_ref
);
14995 ggc_mark_tree (p
->x_eh_spec_try_block
);
14996 ggc_mark_tree (p
->x_scope_stmt_stack
);
14998 ggc_mark_rtx (p
->x_result_rtx
);
15000 mark_named_label_lists (&p
->x_named_labels
, &p
->x_named_label_uses
);
15001 mark_stmt_tree (&p
->x_stmt_tree
);
15002 mark_binding_level (&p
->bindings
);
15005 /* Mark the language-specific data in F for GC. */
15008 mark_cp_function_context (f
)
15009 struct function
*f
;
15011 mark_lang_function (f
->language
);
15015 lang_mark_false_label_stack (l
)
15016 struct label_node
*l
;
15018 /* C++ doesn't use false_label_stack. It better be NULL. */
15019 my_friendly_assert (l
== NULL
, 19990904);
15026 enum tree_code code
= TREE_CODE (t
);
15027 if (code
== IDENTIFIER_NODE
)
15029 struct lang_identifier
*li
= (struct lang_identifier
*) t
;
15030 struct lang_id2
*li2
= li
->x
;
15031 ggc_mark_tree (li
->namespace_bindings
);
15032 ggc_mark_tree (li
->bindings
);
15033 ggc_mark_tree (li
->class_value
);
15034 ggc_mark_tree (li
->class_template_info
);
15038 ggc_mark_tree (li2
->label_value
);
15039 ggc_mark_tree (li2
->implicit_decl
);
15040 ggc_mark_tree (li2
->error_locus
);
15043 else if (code
== CPLUS_BINDING
)
15045 if (BINDING_HAS_LEVEL_P (t
))
15046 mark_binding_level (&BINDING_LEVEL (t
));
15048 ggc_mark_tree (BINDING_SCOPE (t
));
15049 ggc_mark_tree (BINDING_VALUE (t
));
15051 else if (code
== OVERLOAD
)
15052 ggc_mark_tree (OVL_FUNCTION (t
));
15053 else if (code
== TEMPLATE_PARM_INDEX
)
15054 ggc_mark_tree (TEMPLATE_PARM_DECL (t
));
15055 else if (TREE_CODE_CLASS (code
) == 'd')
15057 struct lang_decl
*ld
= DECL_LANG_SPECIFIC (t
);
15062 if (!DECL_GLOBAL_CTOR_P (t
)
15063 && !DECL_GLOBAL_DTOR_P (t
)
15064 && !DECL_THUNK_P (t
))
15065 ggc_mark_tree (ld
->decl_flags
.u2
.access
);
15066 else if (DECL_THUNK_P (t
))
15067 ggc_mark_tree (ld
->decl_flags
.u2
.vcall_offset
);
15068 ggc_mark_tree (ld
->decl_flags
.context
);
15069 if (TREE_CODE (t
) != NAMESPACE_DECL
)
15070 ggc_mark_tree (ld
->decl_flags
.u
.template_info
);
15072 mark_binding_level (&NAMESPACE_LEVEL (t
));
15073 if (CAN_HAVE_FULL_LANG_DECL_P (t
))
15075 ggc_mark_tree (ld
->befriending_classes
);
15076 ggc_mark_tree (ld
->saved_tree
);
15077 ggc_mark_tree (ld
->cloned_function
);
15078 if (!DECL_OVERLOADED_OPERATOR_P (t
))
15079 ggc_mark_tree (ld
->u2
.vtt_parm
);
15080 if (TREE_CODE (t
) == TYPE_DECL
)
15081 ggc_mark_tree (ld
->u
.sorted_fields
);
15082 else if (TREE_CODE (t
) == FUNCTION_DECL
15083 && !DECL_PENDING_INLINE_P (t
))
15084 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t
));
15088 else if (TREE_CODE_CLASS (code
) == 't')
15090 struct lang_type
*lt
= TYPE_LANG_SPECIFIC (t
);
15092 if (lt
&& !(TREE_CODE (t
) == POINTER_TYPE
15093 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
15096 ggc_mark_tree (lt
->vfields
);
15097 ggc_mark_tree (lt
->vbases
);
15098 ggc_mark_tree (lt
->tags
);
15099 ggc_mark_tree (lt
->size
);
15100 ggc_mark_tree (lt
->pure_virtuals
);
15101 ggc_mark_tree (lt
->friend_classes
);
15102 ggc_mark_tree (lt
->rtti
);
15103 ggc_mark_tree (lt
->methods
);
15104 ggc_mark_tree (lt
->template_info
);
15105 ggc_mark_tree (lt
->befriending_classes
);
15108 /* In the case of pointer-to-member function types, the
15109 TYPE_LANG_SPECIFIC is really just a tree. */
15110 ggc_mark_tree ((tree
) lt
);