1 /* Process declarations and variables for C compiler.
2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000
3 Free Software Foundation, Inc.
4 Contributed by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GNU CC.
8 GNU CC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GNU CC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GNU CC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
24 /* Process declarations and symbol lookup for C front end.
25 Also constructs types; the standard scalar types at initialization,
26 and structure, union, array and enum types when they are declared. */
28 /* ??? not all decl nodes are given the most useful possible
29 line numbers. For example, the CONST_DECLs for enum values. */
48 extern int current_class_depth
;
50 extern tree static_ctors
, static_dtors
;
52 extern tree global_namespace
;
54 extern int (*valid_lang_attribute
) PARAMS ((tree
, tree
, tree
, tree
));
56 /* Use garbage collection. */
60 #ifndef WCHAR_UNSIGNED
61 #define WCHAR_UNSIGNED 0
64 #ifndef CHAR_TYPE_SIZE
65 #define CHAR_TYPE_SIZE BITS_PER_UNIT
68 #ifndef BOOL_TYPE_SIZE
69 #ifdef SLOW_BYTE_ACCESS
70 /* In the new ABI, `bool' has size and alignment `1', on all
72 #define BOOL_TYPE_SIZE \
73 ((SLOW_BYTE_ACCESS && !flag_new_abi) ? (POINTER_SIZE) : (CHAR_TYPE_SIZE))
75 #define BOOL_TYPE_SIZE CHAR_TYPE_SIZE
79 /* We let tm.h override the types used here, to handle trivial differences
80 such as the choice of unsigned int or long unsigned int for size_t.
81 When machines start needing nontrivial differences in the size type,
82 it would be best to do something here to figure out automatically
83 from other information what type to use. */
86 #define SIZE_TYPE "long unsigned int"
90 #define PTRDIFF_TYPE "long int"
94 #define WCHAR_TYPE "int"
97 static tree grokparms
PARAMS ((tree
, int));
98 static const char *redeclaration_error_message
PARAMS ((tree
, tree
));
100 static void push_binding_level
PARAMS ((struct binding_level
*, int,
102 static void pop_binding_level
PARAMS ((void));
103 static void suspend_binding_level
PARAMS ((void));
104 static void resume_binding_level
PARAMS ((struct binding_level
*));
105 static struct binding_level
*make_binding_level
PARAMS ((void));
106 static void declare_namespace_level
PARAMS ((void));
107 static int decl_jump_unsafe
PARAMS ((tree
));
108 static void storedecls
PARAMS ((tree
));
109 static void require_complete_types_for_parms
PARAMS ((tree
));
110 static int ambi_op_p
PARAMS ((enum tree_code
));
111 static int unary_op_p
PARAMS ((enum tree_code
));
112 static tree store_bindings
PARAMS ((tree
, tree
));
113 static tree lookup_tag_reverse
PARAMS ((tree
, tree
));
114 static tree obscure_complex_init
PARAMS ((tree
, tree
));
115 static tree lookup_name_real
PARAMS ((tree
, int, int, int));
116 static void warn_extern_redeclared_static
PARAMS ((tree
, tree
));
117 static void grok_reference_init
PARAMS ((tree
, tree
, tree
));
118 static tree grokfndecl
PARAMS ((tree
, tree
, tree
, tree
, int,
119 enum overload_flags
, tree
,
120 tree
, int, int, int, int, int, int, tree
));
121 static tree grokvardecl
PARAMS ((tree
, tree
, RID_BIT_TYPE
*, int, int, tree
));
122 static tree lookup_tag
PARAMS ((enum tree_code
, tree
,
123 struct binding_level
*, int));
124 static void set_identifier_type_value_with_scope
125 PARAMS ((tree
, tree
, struct binding_level
*));
126 static void record_builtin_type
PARAMS ((enum rid
, const char *, tree
));
127 static void record_unknown_type
PARAMS ((tree
, const char *));
128 static tree build_library_fn_1
PARAMS ((tree
, enum tree_code
, tree
));
129 static int member_function_or_else
PARAMS ((tree
, tree
, enum overload_flags
));
130 static void bad_specifiers
PARAMS ((tree
, const char *, int, int, int, int,
132 static void lang_print_error_function
PARAMS ((const char *));
133 static tree maybe_process_template_type_declaration
PARAMS ((tree
, int, struct binding_level
*));
134 static void check_for_uninitialized_const_var
PARAMS ((tree
));
135 static unsigned long typename_hash
PARAMS ((hash_table_key
));
136 static boolean typename_compare
PARAMS ((hash_table_key
, hash_table_key
));
137 static void push_binding
PARAMS ((tree
, tree
, struct binding_level
*));
138 static int add_binding
PARAMS ((tree
, tree
));
139 static void pop_binding
PARAMS ((tree
, tree
));
140 static tree local_variable_p_walkfn
PARAMS ((tree
*, int *, void *));
141 static tree find_binding
PARAMS ((tree
, tree
));
142 static tree select_decl
PARAMS ((tree
, int));
143 static int lookup_flags
PARAMS ((int, int));
144 static tree qualify_lookup
PARAMS ((tree
, int));
145 static tree record_builtin_java_type
PARAMS ((const char *, int));
146 static const char *tag_name
PARAMS ((enum tag_types code
));
147 static void find_class_binding_level
PARAMS ((void));
148 static struct binding_level
*innermost_nonclass_level
PARAMS ((void));
149 static void warn_about_implicit_typename_lookup
PARAMS ((tree
, tree
));
150 static int walk_namespaces_r
PARAMS ((tree
, walk_namespaces_fn
, void *));
151 static int walk_globals_r
PARAMS ((tree
, void *));
152 static void add_decl_to_level
PARAMS ((tree
, struct binding_level
*));
153 static tree make_label_decl
PARAMS ((tree
, int));
154 static void use_label
PARAMS ((tree
));
155 static void check_previous_goto_1
PARAMS ((tree
, struct binding_level
*, tree
,
157 static void check_previous_goto
PARAMS ((struct named_label_use_list
*));
158 static void check_switch_goto
PARAMS ((struct binding_level
*));
159 static void check_previous_gotos
PARAMS ((tree
));
160 static void pop_label
PARAMS ((tree
, tree
));
161 static void pop_labels
PARAMS ((tree
));
162 static void maybe_deduce_size_from_array_init
PARAMS ((tree
, tree
));
163 static void layout_var_decl
PARAMS ((tree
));
164 static void maybe_commonize_var
PARAMS ((tree
));
165 static tree check_initializer
PARAMS ((tree
, tree
));
166 static void make_rtl_for_nonlocal_decl
PARAMS ((tree
, tree
, const char *));
167 static void push_cp_function_context
PARAMS ((struct function
*));
168 static void pop_cp_function_context
PARAMS ((struct function
*));
169 static void mark_binding_level
PARAMS ((void *));
170 static void mark_named_label_lists
PARAMS ((void *, void *));
171 static void mark_cp_function_context
PARAMS ((struct function
*));
172 static void mark_saved_scope
PARAMS ((void *));
173 static void mark_lang_function
PARAMS ((struct language_function
*));
174 static void mark_stmt_tree
PARAMS ((struct stmt_tree
*));
175 static void save_function_data
PARAMS ((tree
));
176 static void check_function_type
PARAMS ((tree
));
177 static void destroy_local_var
PARAMS ((tree
));
178 static void finish_constructor_body
PARAMS ((void));
179 static void finish_destructor_body
PARAMS ((void));
180 static tree create_array_type_for_decl
PARAMS ((tree
, tree
, tree
));
181 static tree get_atexit_node
PARAMS ((void));
182 static tree get_dso_handle_node
PARAMS ((void));
183 static tree start_cleanup_fn
PARAMS ((void));
184 static void end_cleanup_fn
PARAMS ((void));
185 static tree cp_make_fname_decl
PARAMS ((tree
, const char *, int));
186 static void initialize_predefined_identifiers
PARAMS ((void));
187 static tree check_special_function_return_type
188 PARAMS ((special_function_kind
, tree
, tree
, tree
));
189 static tree push_cp_library_fn
PARAMS ((enum tree_code
, tree
));
190 static tree build_cp_library_fn
PARAMS ((tree
, enum tree_code
, tree
));
192 #if defined (DEBUG_CP_BINDING_LEVELS)
193 static void indent
PARAMS ((void));
196 /* Erroneous argument lists can use this *IFF* they do not modify it. */
197 tree error_mark_list
;
199 /* The following symbols are subsumed in the cp_global_trees array, and
200 listed here individually for documentation purposes.
203 tree wchar_decl_node;
206 tree vtable_entry_type;
207 tree delta_type_node;
210 tree __baselist_desc_type_node;
211 tree __i_desc_type_node, __m_desc_type_node;
212 tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type;
214 tree __t_desc_type_node;
216 tree __tp_desc_type_node;
218 tree ti_desc_type_node;
219 tree bltn_desc_type_node, ptr_desc_type_node;
220 tree ary_desc_type_node, func_desc_type_node, enum_desc_type_node;
221 tree class_desc_type_node, si_class_desc_type_node, vmi_class_desc_type_node;
222 tree ptm_desc_type_node;
223 tree base_desc_type_node;
225 Not needed yet? May be needed one day?
226 tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type;
227 tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type;
228 tree __ptmf_desc_array_type, __ptmd_desc_array_type;
231 tree class_type_node, record_type_node, union_type_node, enum_type_node;
232 tree unknown_type_node;
234 Array type `vtable_entry_type[]'
237 tree vtbl_ptr_type_node;
244 A FUNCTION_DECL which can call `abort'. Not necessarily the
245 one that the user will declare, but sufficient to be called
246 by routines that want to abort the program.
250 The FUNCTION_DECL for the default `::operator delete'.
252 tree global_delete_fndecl;
255 tree type_info_type_node, tinfo_decl_id, tinfo_decl_type;
260 tree cp_global_trees
[CPTI_MAX
];
262 /* Indicates that there is a type value in some namespace, although
263 that is not necessarily in scope at the moment. */
265 static tree global_type_node
;
270 /* Expect only namespace names now. */
271 static int only_namespace_names
;
273 /* If original DECL_RESULT of current function was a register,
274 but due to being an addressable named return value, would up
275 on the stack, this variable holds the named return value's
276 original location. */
278 #define original_result_rtx cp_function_chain->x_result_rtx
280 /* Used only for jumps to as-yet undefined labels, since jumps to
281 defined labels can have their validity checked immediately. */
283 struct named_label_use_list
285 struct binding_level
*binding_level
;
288 const char *filename_o_goto
;
290 struct named_label_use_list
*next
;
293 #define named_label_uses cp_function_chain->x_named_label_uses
295 /* A list of objects which have constructors or destructors
296 which reside in the global scope. The decl is stored in
297 the TREE_VALUE slot and the initializer is stored
298 in the TREE_PURPOSE slot. */
299 tree static_aggregates
;
303 /* A node for the integer constants 2, and 3. */
305 tree integer_two_node
, integer_three_node
;
307 /* Parsing a function declarator leaves here a chain of structure
308 and enum types declared in the parmlist. */
310 static tree last_function_parm_tags
;
312 /* Similar, for last_function_parm_tags. */
313 tree last_function_parms
;
314 static tree current_function_parm_tags
;
316 /* A list of all LABEL_DECLs in the function that have names. Here so
317 we can clear out their names' definitions at the end of the
318 function, and so we can check the validity of jumps to these labels. */
320 struct named_label_list
322 struct binding_level
*binding_level
;
328 struct named_label_list
*next
;
331 #define named_labels cp_function_chain->x_named_labels
333 /* Set to 0 at beginning of a function definition, and whenever
334 a label (case or named) is defined. Set to value of expression
335 returned from function when that value can be transformed into
336 a named return value. */
338 tree current_function_return_value
;
340 /* Nonzero means use the ISO C94 dialect of C. */
344 /* Nonzero means use the ISO C99 dialect of C. */
348 /* Nonzero means we are a hosted implementation for code shared with C. */
352 /* Nonzero means add default format_arg attributes for functions not
355 int flag_noniso_default_format_attributes
= 1;
357 /* Nonzero means give `double' the same size as `float'. */
359 extern int flag_short_double
;
361 /* Nonzero means don't recognize any builtin functions. */
363 extern int flag_no_builtin
;
365 /* Nonzero means don't recognize the non-ANSI builtin functions.
368 extern int flag_no_nonansi_builtin
;
370 /* Nonzero if we want to conserve space in the .o files. We do this
371 by putting uninitialized data and runtime initialized data into
372 .common instead of .data at the expense of not flagging multiple
374 extern int flag_conserve_space
;
376 /* C and C++ flags are in decl2.c. */
378 /* Flag used when debugging spew.c */
380 extern int spew_debug
;
382 /* A expression of value 0 with the same precision as a sizetype
384 tree signed_size_zero_node
;
386 /* The name of the anonymous namespace, throughout this translation
388 tree anonymous_namespace_name
;
390 /* The number of function bodies which we are currently processing.
391 (Zero if we are at namespace scope, one inside the body of a
392 function, two inside the body of a function in a local class, etc.) */
395 /* For each binding contour we allocate a binding_level structure
396 which records the names defined in that contour.
399 1) one for each function definition,
400 where internal declarations of the parameters appear.
401 2) one for each compound statement,
402 to record its declarations.
404 The current meaning of a name can be found by searching the levels
405 from the current one out to the global one.
407 Off to the side, may be the class_binding_level. This exists only
408 to catch class-local declarations. It is otherwise nonexistent.
410 Also there may be binding levels that catch cleanups that must be
411 run when exceptions occur. Thus, to see whether a name is bound in
412 the current scope, it is not enough to look in the
413 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
416 /* Note that the information in the `names' component of the global contour
417 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
421 /* A chain of _DECL nodes for all variables, constants, functions,
422 and typedef types. These are in the reverse of the order
423 supplied. There may be OVERLOADs on this list, too, but they
424 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
427 /* A list of structure, union and enum definitions, for looking up
429 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
430 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
431 or ENUMERAL_TYPE node.
433 C++: the TREE_VALUE nodes can be simple types for
434 component_bindings. */
437 /* A list of USING_DECL nodes. */
440 /* A list of used namespaces. PURPOSE is the namespace,
441 VALUE the common ancestor with this binding_level's namespace. */
442 tree using_directives
;
444 /* If this binding level is the binding level for a class, then
445 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
446 is the name of an entity bound in the class; the TREE_VALUE is
447 the IDENTIFIER_CLASS_VALUE before we entered the class. Thus,
448 when leaving class scope, we can restore the
449 IDENTIFIER_CLASS_VALUE by walking this list. The TREE_TYPE is
450 the DECL bound by this name in the class. */
453 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
454 is used for all binding levels. */
457 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
458 label in this scope. The TREE_PURPOSE is the previous value of
459 the IDENTIFIER_LABEL VALUE. */
460 tree shadowed_labels
;
462 /* For each level (except not the global one),
463 a chain of BLOCK nodes for all the levels
464 that were entered and exited one level down. */
467 /* The BLOCK node for this level, if one has been preallocated.
468 If 0, the BLOCK is allocated (if needed) when the level is popped. */
471 /* The _TYPE node for this level, if parm_flag == 2. */
474 /* The binding level which this one is contained in (inherits from). */
475 struct binding_level
*level_chain
;
477 /* List of decls in `names' that have incomplete
478 structure or union types. */
481 /* List of VAR_DECLS saved from a previous for statement.
482 These would be dead in ISO-conforming code, but might
483 be referenced in ARM-era code. These are stored in a
484 TREE_LIST; the TREE_VALUE is the actual declaration. */
485 tree dead_vars_from_for
;
487 /* 1 for the level that holds the parameters of a function.
488 2 for the level that holds a class declaration. */
489 unsigned parm_flag
: 2;
491 /* 1 means make a BLOCK for this level regardless of all else.
492 2 for temporary binding contours created by the compiler. */
495 /* Nonzero if this level "doesn't exist" for tags. */
496 unsigned tag_transparent
: 1;
498 /* Nonzero if this level can safely have additional
499 cleanup-needing variables added to it. */
500 unsigned more_cleanups_ok
: 1;
501 unsigned have_cleanups
: 1;
503 /* Nonzero if this scope is for storing the decls for template
504 parameters and generic decls; these decls will be discarded and
505 replaced with a TEMPLATE_DECL. */
506 unsigned template_parms_p
: 1;
508 /* Nonzero if this scope corresponds to the `<>' in a
509 `template <>' clause. Whenever this flag is set,
510 TEMPLATE_PARMS_P will be set as well. */
511 unsigned template_spec_p
: 1;
513 /* This is set for a namespace binding level. */
514 unsigned namespace_p
: 1;
516 /* True if this level is that of a for-statement where we need to
517 worry about ambiguous (ARM or ISO) scope rules. */
518 unsigned is_for_scope
: 1;
520 /* True if this level corresponds to an EH region, as for a try block.
521 Currently this information is only available while building the
523 unsigned eh_region
: 1;
525 /* Four bits left for this word. */
527 #if defined(DEBUG_CP_BINDING_LEVELS)
528 /* Binding depth at which this level began. */
529 unsigned binding_depth
;
530 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
533 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
535 /* The binding level currently in effect. */
537 #define current_binding_level \
539 ? cp_function_chain->bindings \
540 : scope_chain->bindings)
542 /* The binding level of the current class, if any. */
544 #define class_binding_level scope_chain->class_bindings
546 /* A chain of binding_level structures awaiting reuse. */
548 static struct binding_level
*free_binding_level
;
550 /* The outermost binding level, for names of file scope.
551 This is created when the compiler is started and exists
552 through the entire run. */
554 static struct binding_level
*global_binding_level
;
556 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
558 static int keep_next_level_flag
;
560 #if defined(DEBUG_CP_BINDING_LEVELS)
561 static int binding_depth
= 0;
562 static int is_class_level
= 0;
569 for (i
= 0; i
< binding_depth
*2; i
++)
572 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
574 static tree pushdecl_with_scope
PARAMS ((tree
, struct binding_level
*));
577 push_binding_level (newlevel
, tag_transparent
, keep
)
578 struct binding_level
*newlevel
;
579 int tag_transparent
, keep
;
581 /* Add this level to the front of the chain (stack) of levels that
583 bzero ((char*) newlevel
, sizeof (struct binding_level
));
584 newlevel
->level_chain
= current_binding_level
;
585 current_binding_level
= newlevel
;
586 newlevel
->tag_transparent
= tag_transparent
;
587 newlevel
->more_cleanups_ok
= 1;
589 newlevel
->keep
= keep
;
590 #if defined(DEBUG_CP_BINDING_LEVELS)
591 newlevel
->binding_depth
= binding_depth
;
593 fprintf (stderr
, "push %s level 0x%08x line %d\n",
594 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
597 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
600 /* Find the innermost enclosing class scope, and reset
601 CLASS_BINDING_LEVEL appropriately. */
604 find_class_binding_level ()
606 struct binding_level
*level
= current_binding_level
;
608 while (level
&& level
->parm_flag
!= 2)
609 level
= level
->level_chain
;
610 if (level
&& level
->parm_flag
== 2)
611 class_binding_level
= level
;
613 class_binding_level
= 0;
619 if (global_binding_level
)
621 /* Cannot pop a level, if there are none left to pop. */
622 if (current_binding_level
== global_binding_level
)
623 my_friendly_abort (123);
625 /* Pop the current level, and free the structure for reuse. */
626 #if defined(DEBUG_CP_BINDING_LEVELS)
629 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
630 (is_class_level
) ? "class" : "block",
631 current_binding_level
, lineno
);
632 if (is_class_level
!= (current_binding_level
== class_binding_level
))
635 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
638 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
640 register struct binding_level
*level
= current_binding_level
;
641 current_binding_level
= current_binding_level
->level_chain
;
642 level
->level_chain
= free_binding_level
;
643 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
644 if (level
->binding_depth
!= binding_depth
)
646 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
647 free_binding_level
= level
;
648 find_class_binding_level ();
653 suspend_binding_level ()
655 if (class_binding_level
)
656 current_binding_level
= class_binding_level
;
658 if (global_binding_level
)
660 /* Cannot suspend a level, if there are none left to suspend. */
661 if (current_binding_level
== global_binding_level
)
662 my_friendly_abort (123);
664 /* Suspend the current level. */
665 #if defined(DEBUG_CP_BINDING_LEVELS)
668 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
669 (is_class_level
) ? "class" : "block",
670 current_binding_level
, lineno
);
671 if (is_class_level
!= (current_binding_level
== class_binding_level
))
674 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
677 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
678 current_binding_level
= current_binding_level
->level_chain
;
679 find_class_binding_level ();
683 resume_binding_level (b
)
684 struct binding_level
*b
;
686 /* Resuming binding levels is meant only for namespaces,
687 and those cannot nest into classes. */
688 my_friendly_assert(!class_binding_level
, 386);
689 /* Also, resuming a non-directly nested namespace is a no-no. */
690 my_friendly_assert(b
->level_chain
== current_binding_level
, 386);
691 current_binding_level
= b
;
692 #if defined(DEBUG_CP_BINDING_LEVELS)
693 b
->binding_depth
= binding_depth
;
695 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
696 (is_class_level
) ? "class" : "block", b
, lineno
);
699 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
702 /* Create a new `struct binding_level'. */
705 struct binding_level
*
706 make_binding_level ()
709 return (struct binding_level
*) xmalloc (sizeof (struct binding_level
));
712 /* Nonzero if we are currently in the global binding level. */
717 return current_binding_level
== global_binding_level
;
720 /* Return the innermost binding level that is not for a class scope. */
722 static struct binding_level
*
723 innermost_nonclass_level ()
725 struct binding_level
*b
;
727 b
= current_binding_level
;
728 while (b
->parm_flag
== 2)
734 /* Nonzero if we are currently in a toplevel binding level. This
735 means either the global binding level or a namespace in a toplevel
736 binding level. Since there are no non-toplevel namespace levels,
737 this really means any namespace or template parameter level. We
738 also include a class whose context is toplevel. */
741 toplevel_bindings_p ()
743 struct binding_level
*b
= innermost_nonclass_level ();
745 return b
->namespace_p
|| b
->template_parms_p
;
748 /* Nonzero if this is a namespace scope, or if we are defining a class
749 which is itself at namespace scope, or whose enclosing class is
750 such a class, etc. */
753 namespace_bindings_p ()
755 struct binding_level
*b
= innermost_nonclass_level ();
757 return b
->namespace_p
;
760 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
761 unconditionally. Otherwise, use the normal logic to decide whether
762 or not to create a BLOCK. */
765 keep_next_level (keep
)
768 keep_next_level_flag
= keep
;
771 /* Nonzero if the current level needs to have a BLOCK made. */
776 return (current_binding_level
->blocks
!= NULL_TREE
777 || current_binding_level
->keep
778 || current_binding_level
->names
!= NULL_TREE
779 || (current_binding_level
->tags
!= NULL_TREE
780 && !current_binding_level
->tag_transparent
));
784 declare_namespace_level ()
786 current_binding_level
->namespace_p
= 1;
789 /* Returns non-zero if this scope was created to store template
793 template_parm_scope_p ()
795 return current_binding_level
->template_parms_p
;
798 /* Returns the kind of template specialization we are currently
799 processing, given that it's declaration contained N_CLASS_SCOPES
800 explicit scope qualifications. */
803 current_tmpl_spec_kind (n_class_scopes
)
806 int n_template_parm_scopes
= 0;
807 int seen_specialization_p
= 0;
808 int innermost_specialization_p
= 0;
809 struct binding_level
*b
;
811 /* Scan through the template parameter scopes. */
812 for (b
= current_binding_level
; b
->template_parms_p
; b
= b
->level_chain
)
814 /* If we see a specialization scope inside a parameter scope,
815 then something is wrong. That corresponds to a declaration
818 template <class T> template <> ...
820 which is always illegal since [temp.expl.spec] forbids the
821 specialization of a class member template if the enclosing
822 class templates are not explicitly specialized as well. */
823 if (b
->template_spec_p
)
825 if (n_template_parm_scopes
== 0)
826 innermost_specialization_p
= 1;
828 seen_specialization_p
= 1;
830 else if (seen_specialization_p
== 1)
831 return tsk_invalid_member_spec
;
833 ++n_template_parm_scopes
;
836 /* Handle explicit instantiations. */
837 if (processing_explicit_instantiation
)
839 if (n_template_parm_scopes
!= 0)
840 /* We've seen a template parameter list during an explicit
841 instantiation. For example:
843 template <class T> template void f(int);
845 This is erroneous. */
846 return tsk_invalid_expl_inst
;
848 return tsk_expl_inst
;
851 if (n_template_parm_scopes
< n_class_scopes
)
852 /* We've not seen enough template headers to match all the
853 specialized classes present. For example:
855 template <class T> void R<T>::S<T>::f(int);
857 This is illegal; there needs to be one set of template
858 parameters for each class. */
859 return tsk_insufficient_parms
;
860 else if (n_template_parm_scopes
== n_class_scopes
)
861 /* We're processing a non-template declaration (even though it may
862 be a member of a template class.) For example:
864 template <class T> void S<T>::f(int);
866 The `class T' maches the `S<T>', leaving no template headers
867 corresponding to the `f'. */
869 else if (n_template_parm_scopes
> n_class_scopes
+ 1)
870 /* We've got too many template headers. For example:
872 template <> template <class T> void f (T);
874 There need to be more enclosing classes. */
875 return tsk_excessive_parms
;
877 /* This must be a template. It's of the form:
879 template <class T> template <class U> void S<T>::f(U);
881 This is a specialization if the innermost level was a
882 specialization; otherwise it's just a definition of the
884 return innermost_specialization_p
? tsk_expl_spec
: tsk_template
;
888 set_class_shadows (shadows
)
891 class_binding_level
->class_shadowed
= shadows
;
894 /* Enter a new binding level.
895 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
896 not for that of tags. */
899 pushlevel (tag_transparent
)
902 struct binding_level
*newlevel
;
904 if (cfun
&& !doing_semantic_analysis_p ())
907 /* Reuse or create a struct for this binding level. */
908 #if defined(DEBUG_CP_BINDING_LEVELS)
910 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
911 if (free_binding_level
)
912 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
914 newlevel
= free_binding_level
;
915 free_binding_level
= free_binding_level
->level_chain
;
918 newlevel
= make_binding_level ();
920 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
921 GNU_xref_start_scope ((HOST_WIDE_INT
) newlevel
);
922 keep_next_level_flag
= 0;
925 /* Enter a new scope. The KIND indicates what kind of scope is being
936 case sk_template_spec
:
937 current_binding_level
->template_spec_p
= 1;
940 case sk_template_parms
:
941 current_binding_level
->template_parms_p
= 1;
945 my_friendly_abort (20000309);
949 /* Exit the current scope. */
958 note_level_for_for ()
960 current_binding_level
->is_for_scope
= 1;
963 /* Record that the current binding level represents a try block. */
968 current_binding_level
->eh_region
= 1;
971 /* For a binding between a name and an entity at a block scope,
972 this is the `struct binding_level' for the block. */
973 #define BINDING_LEVEL(NODE) \
974 (((struct tree_binding*)NODE)->scope.level)
976 /* Make DECL the innermost binding for ID. The LEVEL is the binding
977 level at which this declaration is being bound. */
980 push_binding (id
, decl
, level
)
983 struct binding_level
* level
;
987 binding
= make_node (CPLUS_BINDING
);
989 /* Now, fill in the binding information. */
990 BINDING_VALUE (binding
) = decl
;
991 BINDING_TYPE (binding
) = NULL_TREE
;
992 BINDING_LEVEL (binding
) = level
;
993 INHERITED_VALUE_BINDING_P (binding
) = 0;
994 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
995 BINDING_HAS_LEVEL_P (binding
) = 1;
997 /* And put it on the front of the list of bindings for ID. */
998 TREE_CHAIN (binding
) = IDENTIFIER_BINDING (id
);
999 IDENTIFIER_BINDING (id
) = binding
;
1002 /* ID is already bound in the current scope. But, DECL is an
1003 additional binding for ID in the same scope. This is the `struct
1004 stat' hack whereby a non-typedef class-name or enum-name can be
1005 bound at the same level as some other kind of entity. It's the
1006 responsibility of the caller to check that inserting this name is
1007 legal here. Returns nonzero if the new binding was successful. */
1009 add_binding (id
, decl
)
1013 tree binding
= IDENTIFIER_BINDING (id
);
1016 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
1017 /* The new name is the type name. */
1018 BINDING_TYPE (binding
) = decl
;
1019 else if (!BINDING_VALUE (binding
))
1020 /* This situation arises when push_class_level_binding moves an
1021 inherited type-binding out of the way to make room for a new
1023 BINDING_VALUE (binding
) = decl
;
1024 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
1025 && DECL_ARTIFICIAL (BINDING_VALUE (binding
)))
1027 /* The old binding was a type name. It was placed in
1028 BINDING_VALUE because it was thought, at the point it was
1029 declared, to be the only entity with such a name. Move the
1030 type name into the type slot; it is now hidden by the new
1032 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
1033 BINDING_VALUE (binding
) = decl
;
1034 INHERITED_VALUE_BINDING_P (binding
) = 0;
1036 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
1037 && TREE_CODE (decl
) == TYPE_DECL
1038 && DECL_NAME (decl
) == DECL_NAME (BINDING_VALUE (binding
))
1039 && same_type_p (TREE_TYPE (decl
),
1040 TREE_TYPE (BINDING_VALUE (binding
))))
1041 /* We have two typedef-names, both naming the same type to have
1042 the same name. This is OK because of:
1046 In a given scope, a typedef specifier can be used to redefine
1047 the name of any type declared in that scope to refer to the
1048 type to which it already refers. */
1050 /* There can be two block-scope declarations of the same variable,
1051 so long as they are `extern' declarations. */
1052 else if (TREE_CODE (decl
) == VAR_DECL
1053 && TREE_CODE (BINDING_VALUE (binding
)) == VAR_DECL
1054 && DECL_EXTERNAL (decl
)
1055 && DECL_EXTERNAL (BINDING_VALUE (binding
)))
1057 duplicate_decls (decl
, BINDING_VALUE (binding
));
1062 cp_error ("declaration of `%#D'", decl
);
1063 cp_error_at ("conflicts with previous declaration `%#D'",
1064 BINDING_VALUE (binding
));
1071 /* Add DECL to the list of things declared in B. */
1074 add_decl_to_level (decl
, b
)
1076 struct binding_level
*b
;
1078 /* We build up the list in reverse order, and reverse it later if
1080 TREE_CHAIN (decl
) = b
->names
;
1084 /* Bind DECL to ID in the current_binding_level, assumed to be a local
1085 binding level. If PUSH_USING is set in FLAGS, we know that DECL
1086 doesn't really belong to this binding level, that it got here
1087 through a using-declaration. */
1090 push_local_binding (id
, decl
, flags
)
1095 struct binding_level
*b
;
1097 /* Skip over any local classes. This makes sense if we call
1098 push_local_binding with a friend decl of a local class. */
1099 b
= current_binding_level
;
1100 while (b
->parm_flag
== 2)
1103 if (lookup_name_current_level (id
))
1105 /* Supplement the existing binding. */
1106 if (!add_binding (id
, decl
))
1107 /* It didn't work. Something else must be bound at this
1108 level. Do not add DECL to the list of things to pop
1113 /* Create a new binding. */
1114 push_binding (id
, decl
, b
);
1116 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
1117 /* We must put the OVERLOAD into a TREE_LIST since the
1118 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1119 decls that got here through a using-declaration. */
1120 decl
= build_tree_list (NULL_TREE
, decl
);
1122 /* And put DECL on the list of things declared by the current
1124 add_decl_to_level (decl
, b
);
1127 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
1128 binding was successful. */
1131 push_class_binding (id
, decl
)
1136 tree binding
= IDENTIFIER_BINDING (id
);
1139 /* Note that we declared this value so that we can issue an error if
1140 this an illegal redeclaration of a name already used for some
1142 note_name_declared_in_class (id
, decl
);
1144 if (binding
&& BINDING_LEVEL (binding
) == class_binding_level
)
1145 /* Supplement the existing binding. */
1146 result
= add_binding (id
, decl
);
1148 /* Create a new binding. */
1149 push_binding (id
, decl
, class_binding_level
);
1151 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1152 class-level declaration. Note that we do not use DECL here
1153 because of the possibility of the `struct stat' hack; if DECL is
1154 a class-name or enum-name we might prefer a field-name, or some
1156 IDENTIFIER_CLASS_VALUE (id
) = BINDING_VALUE (IDENTIFIER_BINDING (id
));
1158 /* If this is a binding from a base class, mark it as such. */
1159 binding
= IDENTIFIER_BINDING (id
);
1160 if (BINDING_VALUE (binding
) == decl
&& TREE_CODE (decl
) != TREE_LIST
)
1162 /* Any implicit typename must be from a base-class. The
1163 context for an implicit typename declaration is always
1164 the derived class in which the lookup was done, so the checks
1165 based on the context of DECL below will not trigger. */
1166 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl
))
1167 INHERITED_VALUE_BINDING_P (binding
) = 1;
1170 if (TREE_CODE (decl
) == OVERLOAD
)
1171 context
= CP_DECL_CONTEXT (OVL_CURRENT (decl
));
1174 my_friendly_assert (DECL_P (decl
), 0);
1175 context
= CP_DECL_CONTEXT (decl
);
1178 if (is_properly_derived_from (current_class_type
, context
))
1179 INHERITED_VALUE_BINDING_P (binding
) = 1;
1181 INHERITED_VALUE_BINDING_P (binding
) = 0;
1184 else if (BINDING_VALUE (binding
) == decl
)
1185 /* We only encounter a TREE_LIST when push_class_decls detects an
1186 ambiguity. Such an ambiguity can be overridden by a definition
1188 INHERITED_VALUE_BINDING_P (binding
) = 1;
1193 /* Remove the binding for DECL which should be the innermost binding
1197 pop_binding (id
, decl
)
1203 if (id
== NULL_TREE
)
1204 /* It's easiest to write the loops that call this function without
1205 checking whether or not the entities involved have names. We
1206 get here for such an entity. */
1209 /* Get the innermost binding for ID. */
1210 binding
= IDENTIFIER_BINDING (id
);
1212 /* The name should be bound. */
1213 my_friendly_assert (binding
!= NULL_TREE
, 0);
1215 /* The DECL will be either the ordinary binding or the type
1216 binding for this identifier. Remove that binding. */
1217 if (BINDING_VALUE (binding
) == decl
)
1218 BINDING_VALUE (binding
) = NULL_TREE
;
1219 else if (BINDING_TYPE (binding
) == decl
)
1220 BINDING_TYPE (binding
) = NULL_TREE
;
1222 my_friendly_abort (0);
1224 if (!BINDING_VALUE (binding
) && !BINDING_TYPE (binding
))
1225 /* We're completely done with the innermost binding for this
1226 identifier. Unhook it from the list of bindings. */
1227 IDENTIFIER_BINDING (id
) = TREE_CHAIN (binding
);
1230 /* When a label goes out of scope, check to see if that label was used
1231 in a valid manner, and issue any appropriate warnings or errors. */
1234 pop_label (label
, old_value
)
1238 if (!processing_template_decl
&& doing_semantic_analysis_p ())
1240 if (DECL_INITIAL (label
) == NULL_TREE
)
1242 cp_error_at ("label `%D' used but not defined", label
);
1243 /* Avoid crashing later. */
1244 define_label (input_filename
, 1, DECL_NAME (label
));
1246 else if (warn_unused_label
&& !TREE_USED (label
))
1247 cp_warning_at ("label `%D' defined but not used", label
);
1250 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), old_value
);
1253 /* At the end of a function, all labels declared within the function
1254 go out of scope. BLOCK is the top-level block for the
1261 struct named_label_list
*link
;
1263 /* Clear out the definitions of all label names, since their scopes
1265 for (link
= named_labels
; link
; link
= link
->next
)
1267 pop_label (link
->label_decl
, link
->old_value
);
1268 /* Put the labels into the "variables" of the top-level block,
1269 so debugger can see them. */
1270 TREE_CHAIN (link
->label_decl
) = BLOCK_VARS (block
);
1271 BLOCK_VARS (block
) = link
->label_decl
;
1274 named_labels
= NULL
;
1277 /* Exit a binding level.
1278 Pop the level off, and restore the state of the identifier-decl mappings
1279 that were in effect when this level was entered.
1281 If KEEP == 1, this level had explicit declarations, so
1282 and create a "block" (a BLOCK node) for the level
1283 to record its declarations and subblocks for symbol table output.
1285 If FUNCTIONBODY is nonzero, this level is the body of a function,
1286 so create a block as if KEEP were set and also clear out all
1289 If REVERSE is nonzero, reverse the order of decls before putting
1290 them into the BLOCK. */
1293 poplevel (keep
, reverse
, functionbody
)
1299 /* The chain of decls was accumulated in reverse order.
1300 Put it into forward order, just for cleanliness. */
1302 int tmp
= functionbody
;
1303 int real_functionbody
;
1306 tree block
= NULL_TREE
;
1308 int block_previously_created
;
1309 int leaving_for_scope
;
1311 if (cfun
&& !doing_semantic_analysis_p ())
1314 my_friendly_assert (current_binding_level
->parm_flag
!= 2,
1317 real_functionbody
= (current_binding_level
->keep
== 2
1318 ? ((functionbody
= 0), tmp
) : functionbody
);
1319 tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1320 subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1322 my_friendly_assert (!current_binding_level
->class_shadowed
,
1325 /* We used to use KEEP == 2 to indicate that the new block should go
1326 at the beginning of the list of blocks at this binding level,
1327 rather than the end. This hack is no longer used. */
1328 my_friendly_assert (keep
== 0 || keep
== 1, 0);
1330 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1331 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1332 current_binding_level
->parm_flag
,
1333 current_binding_level
->keep
);
1335 if (current_binding_level
->keep
== 1)
1338 /* Any uses of undefined labels, and any defined labels, now operate
1339 under constraints of next binding contour. */
1340 if (cfun
&& !functionbody
)
1342 struct binding_level
*level_chain
;
1343 level_chain
= current_binding_level
->level_chain
;
1346 struct named_label_use_list
*uses
;
1347 struct named_label_list
*labels
;
1348 for (labels
= named_labels
; labels
; labels
= labels
->next
)
1349 if (labels
->binding_level
== current_binding_level
)
1352 if (current_binding_level
->eh_region
)
1353 labels
->eh_region
= 1;
1354 for (decl
= labels
->names_in_scope
; decl
;
1355 decl
= TREE_CHAIN (decl
))
1356 if (decl_jump_unsafe (decl
))
1357 labels
->bad_decls
= tree_cons (NULL_TREE
, decl
,
1359 labels
->binding_level
= level_chain
;
1360 labels
->names_in_scope
= level_chain
->names
;
1363 for (uses
= named_label_uses
; uses
; uses
= uses
->next
)
1364 if (uses
->binding_level
== current_binding_level
)
1366 uses
->binding_level
= level_chain
;
1367 uses
->names_in_scope
= level_chain
->names
;
1372 /* Get the decls in the order they were written.
1373 Usually current_binding_level->names is in reverse order.
1374 But parameter decls were previously put in forward order. */
1377 current_binding_level
->names
1378 = decls
= nreverse (current_binding_level
->names
);
1380 decls
= current_binding_level
->names
;
1382 /* Output any nested inline functions within this block
1383 if they weren't already output. */
1384 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1385 if (TREE_CODE (decl
) == FUNCTION_DECL
1386 && ! TREE_ASM_WRITTEN (decl
)
1387 && DECL_INITIAL (decl
) != NULL_TREE
1388 && TREE_ADDRESSABLE (decl
)
1389 && decl_function_context (decl
) == current_function_decl
)
1391 /* If this decl was copied from a file-scope decl
1392 on account of a block-scope extern decl,
1393 propagate TREE_ADDRESSABLE to the file-scope decl. */
1394 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1395 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1398 push_function_context ();
1399 output_inline_function (decl
);
1400 pop_function_context ();
1404 /* When not in function-at-a-time mode, expand_end_bindings will
1405 warn about unused variables. But, in function-at-a-time mode
1406 expand_end_bindings is not passed the list of variables in the
1407 current scope, and therefore no warning is emitted. So, we
1408 explicitly warn here. */
1409 if (!processing_template_decl
)
1410 warn_about_unused_variables (getdecls ());
1412 /* If there were any declarations or structure tags in that level,
1413 or if this level is a function body,
1414 create a BLOCK to record them for the life of this function. */
1416 block_previously_created
= (current_binding_level
->this_block
!= NULL_TREE
);
1417 if (block_previously_created
)
1418 block
= current_binding_level
->this_block
;
1419 else if (keep
== 1 || functionbody
)
1420 block
= make_node (BLOCK
);
1421 if (block
!= NULL_TREE
)
1423 if (block_previously_created
)
1425 if (decls
|| tags
|| subblocks
)
1427 if (BLOCK_VARS (block
))
1428 warning ("internal compiler error: debugging info corrupted");
1430 BLOCK_VARS (block
) = decls
;
1432 /* We can have previous subblocks and new subblocks when
1433 doing fixup_gotos with complex cleanups. We chain the new
1434 subblocks onto the end of any pre-existing subblocks. */
1435 BLOCK_SUBBLOCKS (block
) = chainon (BLOCK_SUBBLOCKS (block
),
1441 BLOCK_VARS (block
) = decls
;
1442 BLOCK_SUBBLOCKS (block
) = subblocks
;
1446 /* In each subblock, record that this is its superior. */
1448 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1449 BLOCK_SUPERCONTEXT (link
) = block
;
1451 /* We still support the old for-scope rules, whereby the variables
1452 in a for-init statement were in scope after the for-statement
1453 ended. We only use the new rules in flag_new_for_scope is
1456 = current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1;
1458 /* Remove declarations for all the DECLs in this level. */
1459 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1461 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
1462 && DECL_NAME (link
))
1465 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link
)));
1469 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
1471 ns_binding
= NULL_TREE
;
1474 && (BINDING_LEVEL (outer_binding
)
1475 == current_binding_level
->level_chain
))
1476 /* We have something like:
1481 and we are leaving the `for' scope. There's no reason to
1482 keep the binding of the inner `i' in this case. */
1483 pop_binding (DECL_NAME (link
), link
);
1484 else if ((outer_binding
1485 && (TREE_CODE (BINDING_VALUE (outer_binding
))
1488 && TREE_CODE (ns_binding
) == TYPE_DECL
))
1489 /* Here, we have something like:
1497 We must pop the for-scope binding so we know what's a
1498 type and what isn't. */
1499 pop_binding (DECL_NAME (link
), link
);
1502 /* Mark this VAR_DECL as dead so that we can tell we left it
1503 there only for backward compatibility. */
1504 DECL_DEAD_FOR_LOCAL (link
) = 1;
1506 /* Keep track of what should of have happenned when we
1507 popped the binding. */
1508 if (outer_binding
&& BINDING_VALUE (outer_binding
))
1509 DECL_SHADOWED_FOR_VAR (link
)
1510 = BINDING_VALUE (outer_binding
);
1512 /* Add it to the list of dead variables in the next
1513 outermost binding to that we can remove these when we
1514 leave that binding. */
1515 current_binding_level
->level_chain
->dead_vars_from_for
1516 = tree_cons (NULL_TREE
, link
,
1517 current_binding_level
->level_chain
->
1518 dead_vars_from_for
);
1520 /* Although we don't pop the CPLUS_BINDING, we do clear
1521 its BINDING_LEVEL since the level is going away now. */
1522 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link
)))
1528 /* Remove the binding. */
1530 if (TREE_CODE (decl
) == TREE_LIST
)
1531 decl
= TREE_VALUE (decl
);
1533 pop_binding (DECL_NAME (decl
), decl
);
1534 else if (TREE_CODE (decl
) == OVERLOAD
)
1535 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
1537 my_friendly_abort (0);
1541 /* Remove declarations for any `for' variables from inner scopes
1542 that we kept around. */
1543 for (link
= current_binding_level
->dead_vars_from_for
;
1544 link
; link
= TREE_CHAIN (link
))
1545 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
1547 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1548 for (link
= current_binding_level
->type_shadowed
;
1549 link
; link
= TREE_CHAIN (link
))
1550 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1552 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1553 for (link
= current_binding_level
->shadowed_labels
;
1555 link
= TREE_CHAIN (link
))
1556 pop_label (TREE_VALUE (link
), TREE_PURPOSE (link
));
1558 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1559 list if a `using' declaration put them there. The debugging
1560 back-ends won't understand OVERLOAD, so we remove them here.
1561 Because the BLOCK_VARS are (temporarily) shared with
1562 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1563 popped all the bindings. */
1568 for (d
= &BLOCK_VARS (block
); *d
; )
1570 if (TREE_CODE (*d
) == TREE_LIST
)
1571 *d
= TREE_CHAIN (*d
);
1573 d
= &TREE_CHAIN (*d
);
1577 /* If the level being exited is the top level of a function,
1578 check over all the labels. */
1581 /* Since this is the top level block of a function, the vars are
1582 the function's parameters. Don't leave them in the BLOCK
1583 because they are found in the FUNCTION_DECL instead. */
1584 BLOCK_VARS (block
) = 0;
1588 tmp
= current_binding_level
->keep
;
1590 pop_binding_level ();
1592 DECL_INITIAL (current_function_decl
) = block
;
1595 if (!block_previously_created
)
1596 current_binding_level
->blocks
1597 = chainon (current_binding_level
->blocks
, block
);
1599 /* If we did not make a block for the level just exited,
1600 any blocks made for inner levels
1601 (since they cannot be recorded as subblocks in that level)
1602 must be carried forward so they will later become subblocks
1603 of something else. */
1605 current_binding_level
->blocks
1606 = chainon (current_binding_level
->blocks
, subblocks
);
1608 /* Each and every BLOCK node created here in `poplevel' is important
1609 (e.g. for proper debugging information) so if we created one
1610 earlier, mark it as "used". */
1612 TREE_USED (block
) = 1;
1614 /* Take care of compiler's internal binding structures. */
1620 = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/1);
1623 SCOPE_STMT_BLOCK (TREE_PURPOSE (scope_stmts
)) = block
;
1624 SCOPE_STMT_BLOCK (TREE_VALUE (scope_stmts
)) = block
;
1627 block
= poplevel (keep
, reverse
, functionbody
);
1633 /* Delete the node BLOCK from the current binding level.
1634 This is used for the block inside a stmt expr ({...})
1635 so that the block can be reinserted where appropriate. */
1638 delete_block (block
)
1642 if (current_binding_level
->blocks
== block
)
1643 current_binding_level
->blocks
= TREE_CHAIN (block
);
1644 for (t
= current_binding_level
->blocks
; t
;)
1646 if (TREE_CHAIN (t
) == block
)
1647 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1651 TREE_CHAIN (block
) = NULL_TREE
;
1652 /* Clear TREE_USED which is always set by poplevel.
1653 The flag is set again if insert_block is called. */
1654 TREE_USED (block
) = 0;
1657 /* Insert BLOCK at the end of the list of subblocks of the
1658 current binding level. This is used when a BIND_EXPR is expanded,
1659 to handle the BLOCK node inside the BIND_EXPR. */
1662 insert_block (block
)
1665 TREE_USED (block
) = 1;
1666 current_binding_level
->blocks
1667 = chainon (current_binding_level
->blocks
, block
);
1670 /* Set the BLOCK node for the innermost scope
1671 (the one we are currently in). */
1675 register tree block
;
1677 current_binding_level
->this_block
= block
;
1680 /* Do a pushlevel for class declarations. */
1685 register struct binding_level
*newlevel
;
1687 /* Reuse or create a struct for this binding level. */
1688 #if defined(DEBUG_CP_BINDING_LEVELS)
1690 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1691 if (free_binding_level
)
1692 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1694 newlevel
= free_binding_level
;
1695 free_binding_level
= free_binding_level
->level_chain
;
1698 newlevel
= make_binding_level ();
1700 #if defined(DEBUG_CP_BINDING_LEVELS)
1702 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1704 push_binding_level (newlevel
, 0, 0);
1706 class_binding_level
= current_binding_level
;
1707 class_binding_level
->parm_flag
= 2;
1708 class_binding_level
->this_class
= current_class_type
;
1711 /* ...and a poplevel for class declarations. */
1716 register struct binding_level
*level
= class_binding_level
;
1719 my_friendly_assert (level
!= 0, 354);
1721 /* If we're leaving a toplevel class, don't bother to do the setting
1722 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1723 shouldn't even be used when current_class_type isn't set, and second,
1724 if we don't touch it here, we're able to use the cache effect if the
1725 next time we're entering a class scope, it is the same class. */
1726 if (current_class_depth
!= 1)
1728 struct binding_level
* b
;
1730 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1731 for (shadowed
= level
->class_shadowed
;
1733 shadowed
= TREE_CHAIN (shadowed
))
1734 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = NULL_TREE
;
1736 /* Find the next enclosing class, and recreate
1737 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1738 b
= level
->level_chain
;
1739 while (b
&& b
->parm_flag
!= 2)
1743 for (shadowed
= b
->class_shadowed
;
1745 shadowed
= TREE_CHAIN (shadowed
))
1749 t
= IDENTIFIER_BINDING (TREE_PURPOSE (shadowed
));
1750 while (t
&& BINDING_LEVEL (t
) != b
)
1754 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
))
1755 = BINDING_VALUE (t
);
1759 /* Remember to save what IDENTIFIER's were bound in this scope so we
1760 can recover from cache misses. */
1762 previous_class_type
= current_class_type
;
1763 previous_class_values
= class_binding_level
->class_shadowed
;
1765 for (shadowed
= level
->type_shadowed
;
1767 shadowed
= TREE_CHAIN (shadowed
))
1768 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1770 /* Remove the bindings for all of the class-level declarations. */
1771 for (shadowed
= level
->class_shadowed
;
1773 shadowed
= TREE_CHAIN (shadowed
))
1774 pop_binding (TREE_PURPOSE (shadowed
), TREE_TYPE (shadowed
));
1776 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1777 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1778 class_binding_level
->parm_flag
,
1779 class_binding_level
->keep
);
1781 /* Now, pop out of the binding level which we created up in the
1782 `pushlevel_class' routine. */
1783 #if defined(DEBUG_CP_BINDING_LEVELS)
1785 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1787 pop_binding_level ();
1790 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1791 for any names in enclosing classes. */
1794 clear_identifier_class_values ()
1798 if (!class_binding_level
)
1801 for (t
= class_binding_level
->class_shadowed
;
1804 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
1807 /* Returns non-zero if T is a virtual function table. */
1810 vtable_decl_p (t
, data
)
1812 void *data ATTRIBUTE_UNUSED
;
1814 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
1817 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1821 vtype_decl_p (t
, data
)
1823 void *data ATTRIBUTE_UNUSED
;
1825 return (TREE_CODE (t
) == TYPE_DECL
1826 && TREE_CODE (TREE_TYPE (t
)) == RECORD_TYPE
1827 && TYPE_POLYMORPHIC_P (TREE_TYPE (t
)));
1830 /* Return the declarations that are members of the namespace NS. */
1833 cp_namespace_decls (ns
)
1836 return NAMESPACE_LEVEL (ns
)->names
;
1839 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1840 itself, calling F for each. The DATA is passed to F as well. */
1843 walk_namespaces_r (namespace, f
, data
)
1845 walk_namespaces_fn f
;
1851 result
|= (*f
) (namespace, data
);
1853 for (current
= cp_namespace_decls (namespace);
1855 current
= TREE_CHAIN (current
))
1857 if (TREE_CODE (current
) != NAMESPACE_DECL
1858 || DECL_NAMESPACE_ALIAS (current
))
1860 if (!DECL_LANG_SPECIFIC (current
))
1863 my_friendly_assert (current
== std_node
, 393);
1867 /* We found a namespace. */
1868 result
|= walk_namespaces_r (current
, f
, data
);
1874 /* Walk all the namespaces, calling F for each. The DATA is passed to
1878 walk_namespaces (f
, data
)
1879 walk_namespaces_fn f
;
1882 return walk_namespaces_r (global_namespace
, f
, data
);
1885 struct walk_globals_data
{
1886 walk_globals_pred p
;
1891 /* Walk the global declarations in NAMESPACE. Whenever one is found
1892 for which P returns non-zero, call F with its address. If any call
1893 to F returns a non-zero value, return a non-zero value. */
1896 walk_globals_r (namespace, data
)
1900 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1901 walk_globals_pred p
= wgd
->p
;
1902 walk_globals_fn f
= wgd
->f
;
1903 void *d
= wgd
->data
;
1907 t
= &NAMESPACE_LEVEL (namespace)->names
;
1914 result
|= (*f
) (t
, d
);
1916 /* If F changed *T, then *T still points at the next item to
1919 t
= &TREE_CHAIN (*t
);
1925 /* Walk the global declarations. Whenever one is found for which P
1926 returns non-zero, call F with its address. If any call to F
1927 returns a non-zero value, return a non-zero value. */
1930 walk_globals (p
, f
, data
)
1931 walk_globals_pred p
;
1935 struct walk_globals_data wgd
;
1940 return walk_namespaces (walk_globals_r
, &wgd
);
1943 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1944 DATA is non-NULL, this is the last time we will call
1945 wrapup_global_declarations for this NAMESPACE. */
1948 wrapup_globals_for_namespace (namespace, data
)
1952 tree globals
= cp_namespace_decls (namespace);
1953 int len
= list_length (globals
);
1954 tree
*vec
= (tree
*) alloca (sizeof (tree
) * len
);
1958 int last_time
= (data
!= 0);
1960 if (last_time
&& namespace == global_namespace
)
1961 /* Let compile_file handle the global namespace. */
1964 /* Process the decls in reverse order--earliest first.
1965 Put them into VEC from back to front, then take out from front. */
1967 for (i
= 0, decl
= globals
; i
< len
; i
++, decl
= TREE_CHAIN (decl
))
1969 /* Pretend we've output an unused static variable. This ensures
1970 that the toplevel __FUNCTION__ etc won't be emitted, unless
1972 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_ARTIFICIAL (decl
)
1973 && !TREE_PUBLIC (decl
) && !TREE_USED (decl
))
1975 TREE_ASM_WRITTEN (decl
) = 1;
1976 DECL_IGNORED_P (decl
) = 1;
1978 vec
[len
- i
- 1] = decl
;
1983 check_global_declarations (vec
, len
);
1987 /* Temporarily mark vtables as external. That prevents
1988 wrapup_global_declarations from writing them out; we must process
1989 them ourselves in finish_vtable_vardecl. */
1990 for (i
= 0; i
< len
; ++i
)
1991 if (vtable_decl_p (vec
[i
], /*data=*/0) && !DECL_EXTERNAL (vec
[i
]))
1993 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 1;
1994 DECL_EXTERNAL (vec
[i
]) = 1;
1997 /* Write out any globals that need to be output. */
1998 result
= wrapup_global_declarations (vec
, len
);
2000 /* Undo the hack to DECL_EXTERNAL above. */
2001 for (i
= 0; i
< len
; ++i
)
2002 if (vtable_decl_p (vec
[i
], /*data=*/0)
2003 && DECL_NOT_REALLY_EXTERN (vec
[i
]))
2005 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 0;
2006 DECL_EXTERNAL (vec
[i
]) = 0;
2013 /* Mark ARG (which is really a struct binding_level **) for GC. */
2016 mark_binding_level (arg
)
2019 struct binding_level
*lvl
= *(struct binding_level
**)arg
;
2021 for (; lvl
; lvl
= lvl
->level_chain
)
2023 ggc_mark_tree (lvl
->names
);
2024 ggc_mark_tree (lvl
->tags
);
2025 ggc_mark_tree (lvl
->usings
);
2026 ggc_mark_tree (lvl
->using_directives
);
2027 ggc_mark_tree (lvl
->class_shadowed
);
2028 ggc_mark_tree (lvl
->type_shadowed
);
2029 ggc_mark_tree (lvl
->shadowed_labels
);
2030 ggc_mark_tree (lvl
->blocks
);
2031 ggc_mark_tree (lvl
->this_block
);
2032 ggc_mark_tree (lvl
->this_class
);
2033 ggc_mark_tree (lvl
->incomplete
);
2034 ggc_mark_tree (lvl
->dead_vars_from_for
);
2039 mark_named_label_lists (labs
, uses
)
2043 struct named_label_list
*l
= *(struct named_label_list
**)labs
;
2044 struct named_label_use_list
*u
= *(struct named_label_use_list
**)uses
;
2046 for (; l
; l
= l
->next
)
2049 mark_binding_level (l
->binding_level
);
2050 ggc_mark_tree (l
->old_value
);
2051 ggc_mark_tree (l
->label_decl
);
2052 ggc_mark_tree (l
->bad_decls
);
2055 for (; u
; u
= u
->next
)
2059 /* For debugging. */
2060 static int no_print_functions
= 0;
2061 static int no_print_builtins
= 0;
2064 print_binding_level (lvl
)
2065 struct binding_level
*lvl
;
2069 fprintf (stderr
, " blocks=");
2070 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
2071 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
2072 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
2073 if (lvl
->tag_transparent
)
2074 fprintf (stderr
, " tag-transparent");
2075 if (lvl
->more_cleanups_ok
)
2076 fprintf (stderr
, " more-cleanups-ok");
2077 if (lvl
->have_cleanups
)
2078 fprintf (stderr
, " have-cleanups");
2079 fprintf (stderr
, "\n");
2082 fprintf (stderr
, " names:\t");
2083 /* We can probably fit 3 names to a line? */
2084 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
2086 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
2088 if (no_print_builtins
2089 && (TREE_CODE (t
) == TYPE_DECL
)
2090 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
2093 /* Function decls tend to have longer names. */
2094 if (TREE_CODE (t
) == FUNCTION_DECL
)
2101 fprintf (stderr
, "\n\t");
2104 print_node_brief (stderr
, "", t
, 0);
2105 if (t
== error_mark_node
)
2109 fprintf (stderr
, "\n");
2113 fprintf (stderr
, " tags:\t");
2115 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
2117 if (TREE_PURPOSE (t
) == NULL_TREE
)
2119 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2126 fprintf (stderr
, "\n\t");
2129 if (TREE_PURPOSE (t
) == NULL_TREE
)
2131 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
2132 fprintf (stderr
, ">");
2134 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2135 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2138 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
2139 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2140 fprintf (stderr
, ">");
2144 fprintf (stderr
, "\n");
2146 if (lvl
->class_shadowed
)
2148 fprintf (stderr
, " class-shadowed:");
2149 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
2151 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2153 fprintf (stderr
, "\n");
2155 if (lvl
->type_shadowed
)
2157 fprintf (stderr
, " type-shadowed:");
2158 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2160 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2162 fprintf (stderr
, "\n");
2167 print_other_binding_stack (stack
)
2168 struct binding_level
*stack
;
2170 struct binding_level
*level
;
2171 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
2173 fprintf (stderr
, "binding level ");
2174 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
2175 fprintf (stderr
, "\n");
2176 print_binding_level (level
);
2181 print_binding_stack ()
2183 struct binding_level
*b
;
2184 fprintf (stderr
, "current_binding_level=");
2185 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
2186 fprintf (stderr
, "\nclass_binding_level=");
2187 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
2188 fprintf (stderr
, "\nglobal_binding_level=");
2189 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
2190 fprintf (stderr
, "\n");
2191 if (class_binding_level
)
2193 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
2194 if (b
== current_binding_level
)
2197 b
= class_binding_level
;
2199 b
= current_binding_level
;
2202 b
= current_binding_level
;
2203 print_other_binding_stack (b
);
2204 fprintf (stderr
, "global:\n");
2205 print_binding_level (global_binding_level
);
2208 /* Namespace binding access routines: The namespace_bindings field of
2209 the identifier is polymorphic, with three possible values:
2210 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2211 indicating the BINDING_VALUE of global_namespace. */
2213 /* Check whether the a binding for the name to scope is known.
2214 Assumes that the bindings of the name are already a list
2215 of bindings. Returns the binding found, or NULL_TREE. */
2218 find_binding (name
, scope
)
2222 tree iter
, prev
= NULL_TREE
;
2224 scope
= ORIGINAL_NAMESPACE (scope
);
2226 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
2227 iter
= TREE_CHAIN (iter
))
2229 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
2230 if (BINDING_SCOPE (iter
) == scope
)
2232 /* Move binding found to the front of the list, so
2233 subsequent lookups will find it faster. */
2236 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
2237 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
2238 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
2247 /* Always returns a binding for name in scope. If the
2248 namespace_bindings is not a list, convert it to one first.
2249 If no binding is found, make a new one. */
2252 binding_for_name (name
, scope
)
2256 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2259 scope
= ORIGINAL_NAMESPACE (scope
);
2261 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
2263 /* Get rid of optimization for global scope. */
2264 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
2265 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
2266 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2268 if (b
&& (result
= find_binding (name
, scope
)))
2270 /* Not found, make a new one. */
2271 result
= make_node (CPLUS_BINDING
);
2272 TREE_CHAIN (result
) = b
;
2273 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2274 BINDING_SCOPE (result
) = scope
;
2275 BINDING_TYPE (result
) = NULL_TREE
;
2276 BINDING_VALUE (result
) = NULL_TREE
;
2280 /* Return the binding value for name in scope, considering that
2281 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2284 namespace_binding (name
, scope
)
2288 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2291 if (scope
== NULL_TREE
)
2292 scope
= global_namespace
;
2293 if (TREE_CODE (b
) != CPLUS_BINDING
)
2294 return (scope
== global_namespace
) ? b
: NULL_TREE
;
2295 name
= find_binding (name
,scope
);
2296 if (name
== NULL_TREE
)
2298 return BINDING_VALUE (name
);
2301 /* Set the binding value for name in scope. If modifying the binding
2302 of global_namespace is attempted, try to optimize it. */
2305 set_namespace_binding (name
, scope
, val
)
2312 if (scope
== NULL_TREE
)
2313 scope
= global_namespace
;
2315 if (scope
== global_namespace
)
2317 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2318 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
2320 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
2324 b
= binding_for_name (name
, scope
);
2325 BINDING_VALUE (b
) = val
;
2328 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2329 select a name that is unique to this compilation unit. */
2332 push_namespace (name
)
2337 int implicit_use
= 0;
2339 if (!global_namespace
)
2341 /* This must be ::. */
2342 my_friendly_assert (name
== get_identifier ("::"), 377);
2347 /* The name of anonymous namespace is unique for the translation
2349 if (!anonymous_namespace_name
)
2350 anonymous_namespace_name
= get_file_function_name ('N');
2351 name
= anonymous_namespace_name
;
2352 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2354 /* Reopening anonymous namespace. */
2358 else if (current_namespace
== global_namespace
2359 && name
== DECL_NAME (std_node
))
2366 /* Check whether this is an extended namespace definition. */
2367 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2368 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
2371 if (DECL_NAMESPACE_ALIAS (d
))
2373 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2374 d
, DECL_NAMESPACE_ALIAS (d
));
2375 d
= DECL_NAMESPACE_ALIAS (d
);
2382 /* Make a new namespace, binding the name to it. */
2383 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
2384 /* The global namespace is not pushed, and the global binding
2385 level is set elsewhere. */
2388 DECL_CONTEXT (d
) = FROB_CONTEXT (current_namespace
);
2391 declare_namespace_level ();
2392 NAMESPACE_LEVEL (d
) = current_binding_level
;
2396 resume_binding_level (NAMESPACE_LEVEL (d
));
2399 do_using_directive (d
);
2400 /* Enter the name space. */
2401 current_namespace
= d
;
2404 /* Pop from the scope of the current namespace. */
2409 if (current_namespace
== global_namespace
)
2411 my_friendly_assert (in_std
>0, 980421);
2415 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
2416 /* The binding level is not popped, as it might be re-opened later. */
2417 suspend_binding_level ();
2420 /* Push into the scope of the namespace NS, even if it is deeply
2421 nested within another namespace. */
2424 push_nested_namespace (ns
)
2427 if (ns
== global_namespace
)
2428 push_to_top_level ();
2431 push_nested_namespace (CP_DECL_CONTEXT (ns
));
2432 push_namespace (DECL_NAME (ns
));
2436 /* Pop back from the scope of the namespace NS, which was previously
2437 entered with push_nested_namespace. */
2440 pop_nested_namespace (ns
)
2443 while (ns
!= global_namespace
)
2446 ns
= CP_DECL_CONTEXT (ns
);
2449 pop_from_top_level ();
2453 /* Subroutines for reverting temporarily to top-level for instantiation
2454 of templates and such. We actually need to clear out the class- and
2455 local-value slots of all identifiers, so that only the global values
2456 are at all visible. Simply setting current_binding_level to the global
2457 scope isn't enough, because more binding levels may be pushed. */
2458 struct saved_scope
*scope_chain
;
2460 /* Mark ST for GC. */
2464 struct stmt_tree
*st
;
2466 ggc_mark_tree (st
->x_last_stmt
);
2467 ggc_mark_tree (st
->x_last_expr_type
);
2470 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2473 mark_saved_scope (arg
)
2476 struct saved_scope
*t
= *(struct saved_scope
**)arg
;
2479 mark_binding_level (&t
->class_bindings
);
2480 ggc_mark_tree (t
->old_bindings
);
2481 ggc_mark_tree (t
->old_namespace
);
2482 ggc_mark_tree (t
->class_name
);
2483 ggc_mark_tree (t
->class_type
);
2484 ggc_mark_tree (t
->access_specifier
);
2485 ggc_mark_tree (t
->function_decl
);
2487 ggc_mark_tree_varray (t
->lang_base
);
2488 ggc_mark_tree (t
->lang_name
);
2489 ggc_mark_tree (t
->x_function_parms
);
2490 ggc_mark_tree (t
->template_parms
);
2491 ggc_mark_tree (t
->x_previous_class_type
);
2492 ggc_mark_tree (t
->x_previous_class_values
);
2493 ggc_mark_tree (t
->x_saved_tree
);
2494 ggc_mark_tree (t
->incomplete
);
2495 ggc_mark_tree (t
->lookups
);
2497 mark_stmt_tree (&t
->x_stmt_tree
);
2498 mark_binding_level (&t
->bindings
);
2504 store_bindings (names
, old_bindings
)
2505 tree names
, old_bindings
;
2508 for (t
= names
; t
; t
= TREE_CHAIN (t
))
2510 tree binding
, t1
, id
;
2512 if (TREE_CODE (t
) == TREE_LIST
)
2513 id
= TREE_PURPOSE (t
);
2518 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2519 we have no IDENTIFIER_BINDING if we have left the class
2520 scope, but cached the class-level declarations. */
2521 || !(IDENTIFIER_BINDING (id
) || IDENTIFIER_CLASS_VALUE (id
)))
2524 for (t1
= old_bindings
; t1
; t1
= TREE_CHAIN (t1
))
2525 if (TREE_VEC_ELT (t1
, 0) == id
)
2528 binding
= make_tree_vec (4);
2532 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
2533 TREE_VEC_ELT (binding
, 0) = id
;
2534 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
2535 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_BINDING (id
);
2536 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
2537 IDENTIFIER_BINDING (id
) = NULL_TREE
;
2538 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
2540 TREE_CHAIN (binding
) = old_bindings
;
2541 old_bindings
= binding
;
2545 return old_bindings
;
2549 maybe_push_to_top_level (pseudo
)
2552 struct saved_scope
*s
;
2553 struct binding_level
*b
;
2557 s
= (struct saved_scope
*) xcalloc (1, sizeof (struct saved_scope
));
2559 b
= scope_chain
? current_binding_level
: 0;
2561 /* If we're in the middle of some function, save our state. */
2565 push_function_context_to (NULL_TREE
);
2570 old_bindings
= NULL_TREE
;
2571 if (scope_chain
&& previous_class_type
)
2572 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
2574 /* Have to include global_binding_level, because class-level decls
2575 aren't listed anywhere useful. */
2576 for (; b
; b
= b
->level_chain
)
2580 /* Template IDs are inserted into the global level. If they were
2581 inserted into namespace level, finish_file wouldn't find them
2582 when doing pending instantiations. Therefore, don't stop at
2583 namespace level, but continue until :: . */
2584 if (b
== global_binding_level
|| (pseudo
&& b
->template_parms_p
))
2587 old_bindings
= store_bindings (b
->names
, old_bindings
);
2588 /* We also need to check class_shadowed to save class-level type
2589 bindings, since pushclass doesn't fill in b->names. */
2590 if (b
->parm_flag
== 2)
2591 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2593 /* Unwind type-value slots back to top level. */
2594 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2595 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2597 s
->prev
= scope_chain
;
2598 s
->old_bindings
= old_bindings
;
2600 s
->need_pop_function_context
= need_pop
;
2601 s
->function_decl
= current_function_decl
;
2604 current_function_decl
= NULL_TREE
;
2605 VARRAY_TREE_INIT (current_lang_base
, 10, "current_lang_base");
2606 current_lang_stack
= &VARRAY_TREE (current_lang_base
, 0);
2607 current_lang_name
= lang_name_cplusplus
;
2608 current_namespace
= global_namespace
;
2612 push_to_top_level ()
2614 maybe_push_to_top_level (0);
2618 pop_from_top_level ()
2620 struct saved_scope
*s
= scope_chain
;
2623 /* Clear out class-level bindings cache. */
2624 if (previous_class_type
)
2625 invalidate_class_lookup_cache ();
2627 VARRAY_FREE (current_lang_base
);
2629 scope_chain
= s
->prev
;
2630 for (t
= s
->old_bindings
; t
; t
= TREE_CHAIN (t
))
2632 tree id
= TREE_VEC_ELT (t
, 0);
2635 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2636 IDENTIFIER_BINDING (id
) = TREE_VEC_ELT (t
, 2);
2637 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2641 /* If we were in the middle of compiling a function, restore our
2643 if (s
->need_pop_function_context
)
2644 pop_function_context_from (NULL_TREE
);
2645 current_function_decl
= s
->function_decl
;
2650 /* Push a definition of struct, union or enum tag "name".
2651 into binding_level "b". "type" should be the type node,
2652 We assume that the tag "name" is not already defined.
2654 Note that the definition may really be just a forward reference.
2655 In that case, the TYPE_SIZE will be a NULL_TREE.
2657 C++ gratuitously puts all these tags in the name space. */
2659 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2660 record the shadowed value for this binding contour. TYPE is
2661 the type that ID maps to. */
2664 set_identifier_type_value_with_scope (id
, type
, b
)
2667 struct binding_level
*b
;
2669 if (!b
->namespace_p
)
2671 /* Shadow the marker, not the real thing, so that the marker
2672 gets restored later. */
2673 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2675 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2679 tree binding
= binding_for_name (id
, current_namespace
);
2680 BINDING_TYPE (binding
) = type
;
2681 /* Store marker instead of real type. */
2682 type
= global_type_node
;
2684 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2687 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2690 set_identifier_type_value (id
, type
)
2694 set_identifier_type_value_with_scope (id
, type
, current_binding_level
);
2697 /* Return the type associated with id. */
2700 identifier_type_value (id
)
2703 /* There is no type with that name, anywhere. */
2704 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2706 /* This is not the type marker, but the real thing. */
2707 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2708 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2709 /* Have to search for it. It must be on the global level, now.
2710 Ask lookup_name not to return non-types. */
2711 id
= lookup_name_real (id
, 2, 1, 0);
2713 return TREE_TYPE (id
);
2717 /* Pop off extraneous binding levels left over due to syntax errors.
2719 We don't pop past namespaces, as they might be valid. */
2724 #ifdef DEBUG_CP_BINDING_LEVELS
2725 fprintf (stderr
, "XXX entering pop_everything ()\n");
2727 while (!toplevel_bindings_p ())
2729 if (current_binding_level
->parm_flag
== 2)
2730 pop_nested_class ();
2734 #ifdef DEBUG_CP_BINDING_LEVELS
2735 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2739 /* The type TYPE is being declared. If it is a class template, or a
2740 specialization of a class template, do any processing required and
2741 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2742 being declared a friend. B is the binding level at which this TYPE
2745 Returns the TYPE_DECL for TYPE, which may have been altered by this
2749 maybe_process_template_type_declaration (type
, globalize
, b
)
2752 struct binding_level
* b
;
2754 tree decl
= TYPE_NAME (type
);
2756 if (processing_template_parmlist
)
2757 /* You can't declare a new template type in a template parameter
2758 list. But, you can declare a non-template type:
2760 template <class A*> struct S;
2762 is a forward-declaration of `A'. */
2766 maybe_check_template_type (type
);
2768 my_friendly_assert (IS_AGGR_TYPE (type
)
2769 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2772 if (processing_template_decl
)
2774 /* This may change after the call to
2775 push_template_decl_real, but we want the original value. */
2776 tree name
= DECL_NAME (decl
);
2778 decl
= push_template_decl_real (decl
, globalize
);
2779 /* If the current binding level is the binding level for the
2780 template parameters (see the comment in
2781 begin_template_parm_list) and the enclosing level is a class
2782 scope, and we're not looking at a friend, push the
2783 declaration of the member class into the class scope. In the
2784 friend case, push_template_decl will already have put the
2785 friend into global scope, if appropriate. */
2786 if (TREE_CODE (type
) != ENUMERAL_TYPE
2787 && !globalize
&& b
->template_parms_p
2788 && b
->level_chain
->parm_flag
== 2)
2790 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2791 /* Put this tag on the list of tags for the class, since
2792 that won't happen below because B is not the class
2793 binding level, but is instead the pseudo-global level. */
2794 b
->level_chain
->tags
=
2795 tree_cons (name
, type
, b
->level_chain
->tags
);
2796 if (!COMPLETE_TYPE_P (current_class_type
))
2797 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2805 /* In C++, you don't have to write `struct S' to refer to `S'; you
2806 can just use `S'. We accomplish this by creating a TYPE_DECL as
2807 if the user had written `typedef struct S S'. Create and return
2808 the TYPE_DECL for TYPE. */
2811 create_implicit_typedef (name
, type
)
2817 decl
= build_decl (TYPE_DECL
, name
, type
);
2818 DECL_ARTIFICIAL (decl
) = 1;
2819 /* There are other implicit type declarations, like the one *within*
2820 a class that allows you to write `S::S'. We must distinguish
2822 SET_DECL_IMPLICIT_TYPEDEF_P (decl
);
2823 TYPE_NAME (type
) = decl
;
2828 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2829 Normally put it into the inner-most non-tag-transparent scope,
2830 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2831 The latter is needed for implicit declarations. */
2834 pushtag (name
, type
, globalize
)
2838 register struct binding_level
*b
;
2840 b
= current_binding_level
;
2841 while (b
->tag_transparent
2842 || (globalize
&& b
->parm_flag
== 2))
2845 b
->tags
= tree_cons (name
, type
, b
->tags
);
2849 /* Do C++ gratuitous typedefing. */
2850 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2852 register tree d
= NULL_TREE
;
2854 tree context
= TYPE_CONTEXT (type
);
2858 tree cs
= current_scope ();
2862 else if (cs
!= NULL_TREE
&& TYPE_P (cs
))
2863 /* When declaring a friend class of a local class, we want
2864 to inject the newly named class into the scope
2865 containing the local class, not the namespace scope. */
2866 context
= decl_function_context (get_type_decl (cs
));
2869 context
= current_namespace
;
2871 if ((b
->template_parms_p
&& b
->level_chain
->parm_flag
== 2)
2872 || b
->parm_flag
== 2)
2875 if (current_lang_name
== lang_name_java
)
2876 TYPE_FOR_JAVA (type
) = 1;
2878 d
= create_implicit_typedef (name
, type
);
2879 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2881 set_identifier_type_value_with_scope (name
, type
, b
);
2883 d
= maybe_process_template_type_declaration (type
,
2886 if (b
->parm_flag
== 2)
2888 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2889 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2890 class. But if it's a member template class, we
2891 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2893 finish_member_declaration (d
);
2895 pushdecl_class_level (d
);
2898 d
= pushdecl_with_scope (d
, b
);
2900 if (ANON_AGGRNAME_P (name
))
2901 DECL_IGNORED_P (d
) = 1;
2903 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2904 DECL_ASSEMBLER_NAME (d
) = DECL_NAME (d
);
2906 /* If this is a local class, keep track of it. We need this
2907 information for name-mangling, and so that it is possible to find
2908 all function definitions in a translation unit in a convenient
2909 way. (It's otherwise tricky to find a member function definition
2910 it's only pointed to from within a local class.) */
2911 if (TYPE_CONTEXT (type
)
2912 && TREE_CODE (TYPE_CONTEXT (type
)) == FUNCTION_DECL
2913 && !processing_template_decl
)
2914 VARRAY_PUSH_TREE (local_classes
, type
);
2916 if (!uses_template_parms (type
))
2919 DECL_ASSEMBLER_NAME (d
) = mangle_type (type
);
2921 DECL_ASSEMBLER_NAME (d
)
2922 = get_identifier (build_overload_name (type
, 1, 1));
2925 if (b
->parm_flag
== 2)
2927 if (!COMPLETE_TYPE_P (current_class_type
))
2928 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2932 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2933 /* Use the canonical TYPE_DECL for this node. */
2934 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2937 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2938 will be the tagged type we just added to the current
2939 binding level. This fake NULL-named TYPE_DECL node helps
2940 dwarfout.c to know when it needs to output a
2941 representation of a tagged type, and it also gives us a
2942 convenient place to record the "scope start" address for
2945 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2946 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2950 /* Counter used to create anonymous type names. */
2952 static int anon_cnt
= 0;
2954 /* Return an IDENTIFIER which can be used as a name for
2955 anonymous structs and unions. */
2962 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2963 return get_identifier (buf
);
2966 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2967 This keeps dbxout from getting confused. */
2972 register struct binding_level
*b
;
2974 static int last_cnt
= 0;
2976 /* Fast out if no new anon names were declared. */
2977 if (last_cnt
== anon_cnt
)
2980 b
= current_binding_level
;
2981 while (b
->tag_transparent
)
2986 /* A NULL purpose means we have already processed all tags
2987 from here to the end of the list. */
2988 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2990 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2991 TREE_PURPOSE (tags
) = NULL_TREE
;
2992 tags
= TREE_CHAIN (tags
);
2994 last_cnt
= anon_cnt
;
2997 /* Subroutine of duplicate_decls: return truthvalue of whether
2998 or not types of these decls match.
3000 For C++, we must compare the parameter list so that `int' can match
3001 `int&' in a parameter position, but `int&' is not confused with
3005 decls_match (newdecl
, olddecl
)
3006 tree newdecl
, olddecl
;
3010 if (newdecl
== olddecl
)
3013 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
3014 /* If the two DECLs are not even the same kind of thing, we're not
3015 interested in their types. */
3018 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3020 tree f1
= TREE_TYPE (newdecl
);
3021 tree f2
= TREE_TYPE (olddecl
);
3022 tree p1
= TYPE_ARG_TYPES (f1
);
3023 tree p2
= TYPE_ARG_TYPES (f2
);
3025 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
)
3026 && ! (DECL_EXTERN_C_P (newdecl
)
3027 && DECL_EXTERN_C_P (olddecl
)))
3030 if (TREE_CODE (f1
) != TREE_CODE (f2
))
3033 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
3035 if (p2
== NULL_TREE
&& DECL_EXTERN_C_P (olddecl
)
3036 && (DECL_BUILT_IN (olddecl
)
3037 #ifndef NO_IMPLICIT_EXTERN_C
3038 || (DECL_IN_SYSTEM_HEADER (newdecl
) && !DECL_CLASS_SCOPE_P (newdecl
))
3039 || (DECL_IN_SYSTEM_HEADER (olddecl
) && !DECL_CLASS_SCOPE_P (olddecl
))
3043 types_match
= self_promoting_args_p (p1
);
3044 if (p1
== void_list_node
)
3045 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
3047 #ifndef NO_IMPLICIT_EXTERN_C
3048 else if (p1
== NULL_TREE
3049 && (DECL_EXTERN_C_P (olddecl
)
3050 && DECL_IN_SYSTEM_HEADER (olddecl
)
3051 && !DECL_CLASS_SCOPE_P (olddecl
))
3052 && (DECL_EXTERN_C_P (newdecl
)
3053 && DECL_IN_SYSTEM_HEADER (newdecl
)
3054 && !DECL_CLASS_SCOPE_P (newdecl
)))
3056 types_match
= self_promoting_args_p (p2
);
3057 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
3061 types_match
= compparms (p1
, p2
);
3066 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3068 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3069 DECL_TEMPLATE_PARMS (olddecl
)))
3072 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
))
3073 != TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)))
3076 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3079 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
3080 DECL_TEMPLATE_RESULT (newdecl
));
3084 if (TREE_TYPE (newdecl
) == error_mark_node
)
3085 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
3086 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
3087 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
3088 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
3091 types_match
= comptypes (TREE_TYPE (newdecl
),
3092 TREE_TYPE (olddecl
),
3093 COMPARE_REDECLARATION
);
3099 /* If NEWDECL is `static' and an `extern' was seen previously,
3100 warn about it. OLDDECL is the previous declaration.
3102 Note that this does not apply to the C++ case of declaring
3103 a variable `extern const' and then later `const'.
3105 Don't complain about built-in functions, since they are beyond
3106 the user's control. */
3109 warn_extern_redeclared_static (newdecl
, olddecl
)
3110 tree newdecl
, olddecl
;
3112 static const char *explicit_extern_static_warning
3113 = "`%D' was declared `extern' and later `static'";
3114 static const char *implicit_extern_static_warning
3115 = "`%D' was declared implicitly `extern' and later `static'";
3119 if (TREE_CODE (newdecl
) == TYPE_DECL
3120 || TREE_CODE (newdecl
) == TEMPLATE_DECL
3121 || TREE_CODE (newdecl
) == CONST_DECL
)
3124 /* Don't get confused by static member functions; that's a different
3126 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3127 && DECL_STATIC_FUNCTION_P (newdecl
))
3130 /* If the old declaration was `static', or the new one isn't, then
3131 then everything is OK. */
3132 if (DECL_THIS_STATIC (olddecl
) || !DECL_THIS_STATIC (newdecl
))
3135 /* It's OK to declare a builtin function as `static'. */
3136 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3137 && DECL_ARTIFICIAL (olddecl
))
3140 name
= DECL_ASSEMBLER_NAME (newdecl
);
3141 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
3142 ? implicit_extern_static_warning
3143 : explicit_extern_static_warning
, newdecl
);
3144 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
3147 /* Handle when a new declaration NEWDECL has the same name as an old
3148 one OLDDECL in the same binding contour. Prints an error message
3151 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
3152 Otherwise, return 0. */
3155 duplicate_decls (newdecl
, olddecl
)
3156 tree newdecl
, olddecl
;
3158 unsigned olddecl_uid
= DECL_UID (olddecl
);
3159 int olddecl_friend
= 0, types_match
= 0;
3160 int new_defines_function
= 0;
3162 if (newdecl
== olddecl
)
3165 types_match
= decls_match (newdecl
, olddecl
);
3167 /* If either the type of the new decl or the type of the old decl is an
3168 error_mark_node, then that implies that we have already issued an
3169 error (earlier) for some bogus type specification, and in that case,
3170 it is rather pointless to harass the user with yet more error message
3171 about the same declaration, so just pretend the types match here. */
3172 if (TREE_TYPE (newdecl
) == error_mark_node
3173 || TREE_TYPE (olddecl
) == error_mark_node
)
3176 /* Check for redeclaration and other discrepancies. */
3177 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3178 && DECL_ARTIFICIAL (olddecl
))
3180 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
3182 /* If you declare a built-in or predefined function name as static,
3183 the old definition is overridden, but optionally warn this was a
3184 bad choice of name. */
3185 if (! TREE_PUBLIC (newdecl
))
3188 cp_warning ("shadowing %s function `%#D'",
3189 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3191 /* Discard the old built-in function. */
3194 /* If the built-in is not ansi, then programs can override
3195 it even globally without an error. */
3196 else if (! DECL_BUILT_IN (olddecl
))
3197 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
3201 cp_error ("declaration of `%#D'", newdecl
);
3202 cp_error ("conflicts with built-in declaration `%#D'",
3207 else if (!types_match
)
3209 if ((DECL_EXTERN_C_P (newdecl
)
3210 && DECL_EXTERN_C_P (olddecl
))
3211 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3212 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3214 /* A near match; override the builtin. */
3216 if (TREE_PUBLIC (newdecl
))
3218 cp_warning ("new declaration `%#D'", newdecl
);
3219 cp_warning ("ambiguates built-in declaration `%#D'",
3222 else if (warn_shadow
)
3223 cp_warning ("shadowing %s function `%#D'",
3224 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3228 /* Discard the old built-in function. */
3232 if (DECL_THIS_STATIC (newdecl
) && !DECL_THIS_STATIC (olddecl
))
3234 /* If a builtin function is redeclared as `static', merge
3235 the declarations, but make the original one static. */
3236 DECL_THIS_STATIC (olddecl
) = 1;
3237 TREE_PUBLIC (olddecl
) = 0;
3239 /* Make the old declaration consistent with the new one so
3240 that all remnants of the builtin-ness of this function
3241 will be banished. */
3242 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3243 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3244 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3245 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (newdecl
),
3249 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3251 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3252 && TREE_CODE (newdecl
) != TYPE_DECL
3253 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3254 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3255 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3256 && TREE_CODE (olddecl
) != TYPE_DECL
3257 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3258 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3261 /* We do nothing special here, because C++ does such nasty
3262 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3263 get shadowed, and know that if we need to find a TYPE_DECL
3264 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3265 slot of the identifier. */
3269 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3270 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3271 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3272 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3275 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
3276 if (TREE_CODE (olddecl
) == TREE_LIST
)
3277 olddecl
= TREE_VALUE (olddecl
);
3278 cp_error_at ("previous declaration of `%#D'", olddecl
);
3280 /* New decl is completely inconsistent with the old one =>
3281 tell caller to replace the old one. */
3285 else if (!types_match
)
3287 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
))
3288 /* These are certainly not duplicate declarations; they're
3289 from different scopes. */
3292 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3294 /* The name of a class template may not be declared to refer to
3295 any other template, class, function, object, namespace, value,
3296 or type in the same scope. */
3297 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3298 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3300 cp_error ("declaration of template `%#D'", newdecl
);
3301 cp_error_at ("conflicts with previous declaration `%#D'",
3304 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3305 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3306 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3307 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3308 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3309 DECL_TEMPLATE_PARMS (olddecl
)))
3311 cp_error ("new declaration `%#D'", newdecl
);
3312 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3316 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3318 if (DECL_EXTERN_C_P (newdecl
) && DECL_EXTERN_C_P (olddecl
))
3320 cp_error ("declaration of C function `%#D' conflicts with",
3322 cp_error_at ("previous declaration `%#D' here", olddecl
);
3324 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3325 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3327 cp_error ("new declaration `%#D'", newdecl
);
3328 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3334 /* Already complained about this, so don't do so again. */
3335 else if (current_class_type
== NULL_TREE
3336 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3338 cp_error ("conflicting types for `%#D'", newdecl
);
3339 cp_error_at ("previous declaration as `%#D'", olddecl
);
3342 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3343 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3344 && (!DECL_TEMPLATE_INFO (newdecl
)
3345 || (DECL_TI_TEMPLATE (newdecl
)
3346 != DECL_TI_TEMPLATE (olddecl
))))
3347 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3348 && (!DECL_TEMPLATE_INFO (olddecl
)
3349 || (DECL_TI_TEMPLATE (olddecl
)
3350 != DECL_TI_TEMPLATE (newdecl
))))))
3351 /* It's OK to have a template specialization and a non-template
3352 with the same type, or to have specializations of two
3353 different templates with the same type. Note that if one is a
3354 specialization, and the other is an instantiation of the same
3355 template, that we do not exit at this point. That situation
3356 can occur if we instantiate a template class, and then
3357 specialize one of its methods. This situation is legal, but
3358 the declarations must be merged in the usual way. */
3360 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3361 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3362 && !DECL_USE_TEMPLATE (newdecl
))
3363 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3364 && !DECL_USE_TEMPLATE (olddecl
))))
3365 /* One of the declarations is a template instantiation, and the
3366 other is not a template at all. That's OK. */
3368 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3369 && DECL_NAMESPACE_ALIAS (newdecl
)
3370 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3371 /* Redeclaration of namespace alias, ignore it. */
3375 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3378 cp_error (errmsg
, newdecl
);
3379 if (DECL_NAME (olddecl
) != NULL_TREE
)
3380 cp_error_at ((DECL_INITIAL (olddecl
)
3381 && namespace_bindings_p ())
3382 ? "`%#D' previously defined here"
3383 : "`%#D' previously declared here", olddecl
);
3385 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3386 && DECL_INITIAL (olddecl
) != NULL_TREE
3387 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3388 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3390 /* Prototype decl follows defn w/o prototype. */
3391 cp_warning_at ("prototype for `%#D'", newdecl
);
3392 cp_warning_at ("follows non-prototype definition here", olddecl
);
3394 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3395 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3397 /* extern "C" int foo ();
3398 int foo () { bar (); }
3400 if (current_lang_stack
3401 == &VARRAY_TREE (current_lang_base
, 0))
3402 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3405 cp_error_at ("previous declaration of `%#D' with %L linkage",
3406 olddecl
, DECL_LANGUAGE (olddecl
));
3407 cp_error ("conflicts with new declaration with %L linkage",
3408 DECL_LANGUAGE (newdecl
));
3412 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3414 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3416 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3417 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3420 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3421 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3423 for (; t1
&& t1
!= void_list_node
;
3424 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3425 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3427 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3432 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3434 cp_pedwarn_at ("after previous specification in `%#D'",
3440 cp_error ("default argument given for parameter %d of `%#D'",
3442 cp_error_at ("after previous specification in `%#D'",
3447 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
3448 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3450 cp_warning ("`%#D' was used before it was declared inline",
3452 cp_warning_at ("previous non-inline declaration here",
3458 /* If new decl is `static' and an `extern' was seen previously,
3460 warn_extern_redeclared_static (newdecl
, olddecl
);
3462 /* We have committed to returning 1 at this point. */
3463 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3465 /* Now that functions must hold information normally held
3466 by field decls, there is extra work to do so that
3467 declaration information does not get destroyed during
3469 if (DECL_VINDEX (olddecl
))
3470 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3471 if (DECL_VIRTUAL_CONTEXT (olddecl
))
3472 DECL_VIRTUAL_CONTEXT (newdecl
) = DECL_VIRTUAL_CONTEXT (olddecl
);
3473 if (DECL_CONTEXT (olddecl
))
3474 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3475 if (DECL_PENDING_INLINE_INFO (newdecl
) == (struct pending_inline
*)0)
3476 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3477 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3478 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3479 DECL_PURE_VIRTUAL_P (newdecl
) |= DECL_PURE_VIRTUAL_P (olddecl
);
3480 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3481 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3482 DECL_THIS_STATIC (newdecl
) |= DECL_THIS_STATIC (olddecl
);
3483 DECL_LANG_SPECIFIC (newdecl
)->u2
= DECL_LANG_SPECIFIC (olddecl
)->u2
;
3484 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3486 /* Optionally warn about more than one declaration for the same
3487 name, but don't warn about a function declaration followed by a
3489 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3490 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3491 /* Don't warn about extern decl followed by definition. */
3492 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3493 /* Don't warn about friends, let add_friend take care of it. */
3494 && ! DECL_FRIEND_P (newdecl
))
3496 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3497 cp_warning_at ("previous declaration of `%D'", olddecl
);
3501 /* Deal with C++: must preserve virtual function table size. */
3502 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3504 register tree newtype
= TREE_TYPE (newdecl
);
3505 register tree oldtype
= TREE_TYPE (olddecl
);
3507 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3508 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3510 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3511 CLASSTYPE_FRIEND_CLASSES (newtype
)
3512 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3515 DECL_ORIGINAL_TYPE (newdecl
) = DECL_ORIGINAL_TYPE (olddecl
);
3518 /* Copy all the DECL_... slots specified in the new decl
3519 except for any that we copy here from the old type. */
3520 DECL_MACHINE_ATTRIBUTES (newdecl
)
3521 = merge_machine_decl_attributes (olddecl
, newdecl
);
3523 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3525 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3526 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3527 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3528 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3535 /* Automatically handles default parameters. */
3536 tree oldtype
= TREE_TYPE (olddecl
);
3539 /* Merge the data types specified in the two decls. */
3540 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3542 /* If common_type produces a non-typedef type, just use the old type. */
3543 if (TREE_CODE (newdecl
) == TYPE_DECL
3544 && newtype
== DECL_ORIGINAL_TYPE (newdecl
))
3547 if (TREE_CODE (newdecl
) == VAR_DECL
)
3548 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3549 /* Do this after calling `common_type' so that default
3550 parameters don't confuse us. */
3551 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3552 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3553 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3555 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3556 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3557 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3558 TYPE_RAISES_EXCEPTIONS (oldtype
));
3560 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3561 && DECL_SOURCE_LINE (olddecl
) != 0
3563 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
3564 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
3566 cp_error ("declaration of `%F' throws different exceptions",
3568 cp_error_at ("than previous declaration `%F'", olddecl
);
3571 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3573 /* Lay the type out, unless already done. */
3574 if (! same_type_p (newtype
, oldtype
)
3575 && TREE_TYPE (newdecl
) != error_mark_node
3576 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3577 layout_type (TREE_TYPE (newdecl
));
3579 if ((TREE_CODE (newdecl
) == VAR_DECL
3580 || TREE_CODE (newdecl
) == PARM_DECL
3581 || TREE_CODE (newdecl
) == RESULT_DECL
3582 || TREE_CODE (newdecl
) == FIELD_DECL
3583 || TREE_CODE (newdecl
) == TYPE_DECL
)
3584 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3585 layout_decl (newdecl
, 0);
3587 /* Merge the type qualifiers. */
3588 if (TREE_READONLY (newdecl
))
3589 TREE_READONLY (olddecl
) = 1;
3590 if (TREE_THIS_VOLATILE (newdecl
))
3591 TREE_THIS_VOLATILE (olddecl
) = 1;
3593 /* Merge the initialization information. */
3594 if (DECL_INITIAL (newdecl
) == NULL_TREE
3595 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3597 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3598 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3599 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3600 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
3601 && DECL_LANG_SPECIFIC (newdecl
)
3602 && DECL_LANG_SPECIFIC (olddecl
))
3603 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3606 /* Merge the section attribute.
3607 We want to issue an error if the sections conflict but that must be
3608 done later in decl_attributes since we are called before attributes
3610 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3611 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3613 /* Keep the old rtl since we can safely use it. */
3614 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3616 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3618 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (newdecl
)
3619 |= DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (olddecl
);
3620 DECL_NO_CHECK_MEMORY_USAGE (newdecl
)
3621 |= DECL_NO_CHECK_MEMORY_USAGE (olddecl
);
3622 DECL_NO_LIMIT_STACK (newdecl
)
3623 |= DECL_NO_LIMIT_STACK (olddecl
);
3626 /* If cannot merge, then use the new type and qualifiers,
3627 and don't preserve the old rtl. */
3630 /* Clean out any memory we had of the old declaration. */
3631 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3633 TREE_VALUE (oldstatic
) = error_mark_node
;
3635 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3636 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3637 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3638 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3641 /* Merge the storage class information. */
3642 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3643 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3644 DECL_DEFER_OUTPUT (newdecl
) |= DECL_DEFER_OUTPUT (olddecl
);
3645 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3646 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3647 if (! DECL_EXTERNAL (olddecl
))
3648 DECL_EXTERNAL (newdecl
) = 0;
3650 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3652 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3653 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3654 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3655 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3656 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3657 /* Don't really know how much of the language-specific
3658 values we should copy from old to new. */
3659 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3660 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3661 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3662 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3663 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3665 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3666 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3667 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3668 DECL_BEFRIENDING_CLASSES (newdecl
)
3669 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3670 DECL_BEFRIENDING_CLASSES (olddecl
));
3673 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3675 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3676 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3678 /* If newdecl is not a specialization, then it is not a
3679 template-related function at all. And that means that we
3680 shoud have exited above, returning 0. */
3681 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3684 if (TREE_USED (olddecl
))
3685 /* From [temp.expl.spec]:
3687 If a template, a member template or the member of a class
3688 template is explicitly specialized then that
3689 specialization shall be declared before the first use of
3690 that specialization that would cause an implicit
3691 instantiation to take place, in every translation unit in
3692 which such a use occurs. */
3693 cp_error ("explicit specialization of %D after first use",
3696 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3698 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3700 /* If either decl says `inline', this fn is inline, unless its
3701 definition was passed already. */
3702 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3703 DECL_INLINE (olddecl
) = 1;
3704 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3708 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3709 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3710 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3712 if (! types_match
|| new_defines_function
)
3714 /* These need to be copied so that the names are available.
3715 Note that if the types do match, we'll preserve inline
3716 info and other bits, but if not, we won't. */
3717 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3718 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3720 if (new_defines_function
)
3721 /* If defining a function declared with other language
3722 linkage, use the previously declared language linkage. */
3723 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3724 else if (types_match
)
3726 /* If redeclaring a builtin function, and not a definition,
3727 it stays built in. */
3728 if (DECL_BUILT_IN (olddecl
))
3730 DECL_BUILT_IN_CLASS (newdecl
) = DECL_BUILT_IN_CLASS (olddecl
);
3731 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3732 /* If we're keeping the built-in definition, keep the rtl,
3733 regardless of declaration matches. */
3734 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3737 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3739 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3740 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3741 /* Previously saved insns go together with
3742 the function's previous definition. */
3743 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3744 /* Don't clear out the arguments if we're redefining a function. */
3745 if (DECL_ARGUMENTS (olddecl
))
3746 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3750 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3752 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3755 /* Now preserve various other info from the definition. */
3756 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3757 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3758 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3759 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3761 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3765 function_size
= sizeof (struct tree_decl
);
3767 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3768 (char *) olddecl
+ sizeof (struct tree_common
),
3769 function_size
- sizeof (struct tree_common
));
3771 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3773 /* If newdecl is a template instantiation, it is possible that
3774 the following sequence of events has occurred:
3776 o A friend function was declared in a class template. The
3777 class template was instantiated.
3779 o The instantiation of the friend declaration was
3780 recorded on the instantiation list, and is newdecl.
3782 o Later, however, instantiate_class_template called pushdecl
3783 on the newdecl to perform name injection. But, pushdecl in
3784 turn called duplicate_decls when it discovered that another
3785 declaration of a global function with the same name already
3788 o Here, in duplicate_decls, we decided to clobber newdecl.
3790 If we're going to do that, we'd better make sure that
3791 olddecl, and not newdecl, is on the list of
3792 instantiations so that if we try to do the instantiation
3793 again we won't get the clobbered declaration. */
3795 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3796 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3798 for (; decls
; decls
= TREE_CHAIN (decls
))
3799 if (TREE_VALUE (decls
) == newdecl
)
3800 TREE_VALUE (decls
) = olddecl
;
3805 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3806 (char *) olddecl
+ sizeof (struct tree_common
),
3807 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3808 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3811 DECL_UID (olddecl
) = olddecl_uid
;
3813 DECL_FRIEND_P (olddecl
) = 1;
3815 /* NEWDECL contains the merged attribute lists.
3816 Update OLDDECL to be the same. */
3817 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3822 /* Record a decl-node X as belonging to the current lexical scope.
3823 Check for errors (such as an incompatible declaration for the same
3824 name already seen in the same scope).
3826 Returns either X or an old decl for the same name.
3827 If an old decl is returned, it may have been smashed
3828 to agree with what X says. */
3836 int need_new_binding
;
3838 /* We shouldn't be calling pushdecl when we're generating RTL for a
3839 function that we already did semantic analysis on previously. */
3840 my_friendly_assert (!cfun
|| doing_semantic_analysis_p (),
3843 need_new_binding
= 1;
3845 if (DECL_TEMPLATE_PARM_P (x
))
3846 /* Template parameters have no context; they are not X::T even
3847 when declared within a class or namespace. */
3851 if (current_function_decl
&& x
!= current_function_decl
3852 /* A local declaration for a function doesn't constitute
3854 && !(TREE_CODE (x
) == FUNCTION_DECL
&& !DECL_INITIAL (x
))
3855 /* A local declaration for an `extern' variable is in the
3856 scoped of the current namespace, not the current
3858 && !(TREE_CODE (x
) == VAR_DECL
&& DECL_EXTERNAL (x
))
3859 && !DECL_CONTEXT (x
))
3860 DECL_CONTEXT (x
) = current_function_decl
;
3862 /* If this is the declaration for a namespace-scope function,
3863 but the declaration itself is in a local scope, mark the
3865 if (TREE_CODE (x
) == FUNCTION_DECL
3866 && DECL_NAMESPACE_SCOPE_P (x
)
3867 && current_function_decl
3868 && x
!= current_function_decl
)
3869 DECL_LOCAL_FUNCTION_P (x
) = 1;
3872 name
= DECL_NAME (x
);
3876 /* Not needed...see below. */
3880 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3881 name
= TREE_OPERAND (name
, 0);
3883 /* Namespace-scoped variables are not found in the current level. */
3884 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
))
3885 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3887 t
= lookup_name_current_level (name
);
3889 /* If we are declaring a function, and the result of name-lookup
3890 was an OVERLOAD, look for an overloaded instance that is
3891 actually the same as the function we are declaring. (If
3892 there is one, we have to merge our declaration with the
3893 previous declaration.) */
3894 if (t
&& TREE_CODE (t
) == OVERLOAD
)
3898 if (TREE_CODE (x
) == FUNCTION_DECL
)
3899 for (match
= t
; match
; match
= OVL_NEXT (match
))
3901 if (DECL_ASSEMBLER_NAME (OVL_CURRENT (t
))
3902 == DECL_ASSEMBLER_NAME (x
))
3906 /* Just choose one. */
3910 t
= OVL_CURRENT (match
);
3915 if (t
== error_mark_node
)
3917 /* error_mark_node is 0 for a while during initialization! */
3919 cp_error_at ("`%#D' used prior to declaration", x
);
3921 else if (t
!= NULL_TREE
)
3923 if (TREE_CODE (t
) == PARM_DECL
)
3925 if (DECL_CONTEXT (t
) == NULL_TREE
)
3926 fatal ("parse errors have confused me too much");
3928 /* Check for duplicate params. */
3929 if (duplicate_decls (x
, t
))
3932 else if ((DECL_EXTERN_C_FUNCTION_P (x
)
3933 || DECL_FUNCTION_TEMPLATE_P (x
))
3934 && is_overloaded_fn (t
))
3935 /* Don't do anything just yet. */;
3936 else if (t
== wchar_decl_node
)
3938 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3939 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3941 /* Throw away the redeclaration. */
3944 else if (TREE_CODE (t
) != TREE_CODE (x
))
3946 if (duplicate_decls (x
, t
))
3949 else if (duplicate_decls (x
, t
))
3951 if (TREE_CODE (t
) == TYPE_DECL
)
3952 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3953 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3954 check_default_args (t
);
3958 else if (DECL_MAIN_P (x
))
3960 /* A redeclaration of main, but not a duplicate of the
3965 This function shall not be overloaded. */
3966 cp_error_at ("invalid redeclaration of `%D'", t
);
3967 cp_error ("as `%D'", x
);
3968 /* We don't try to push this declaration since that
3974 check_template_shadow (x
);
3976 /* If this is a function conjured up by the backend, massage it
3977 so it looks friendly. */
3978 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_LANG_SPECIFIC (x
))
3980 retrofit_lang_decl (x
);
3981 DECL_LANGUAGE (x
) = lang_c
;
3984 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_FUNCTION_MEMBER_P (x
))
3986 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
3989 if (!namespace_bindings_p ())
3990 /* We do not need to create a binding for this name;
3991 push_overloaded_decl will have already done so if
3993 need_new_binding
= 0;
3995 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3997 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
3999 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
4003 /* If declaring a type as a typedef, copy the type (unless we're
4004 at line 0), and install this TYPE_DECL as the new type's typedef
4005 name. See the extensive comment in ../c-decl.c (pushdecl). */
4006 if (TREE_CODE (x
) == TYPE_DECL
)
4008 tree type
= TREE_TYPE (x
);
4009 if (DECL_SOURCE_LINE (x
) == 0)
4011 if (TYPE_NAME (type
) == 0)
4012 TYPE_NAME (type
) = x
;
4014 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
4015 /* We don't want to copy the type when all we're
4016 doing is making a TYPE_DECL for the purposes of
4018 && (!TYPE_NAME (type
)
4019 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
4021 DECL_ORIGINAL_TYPE (x
) = type
;
4022 type
= build_type_copy (type
);
4023 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
4024 TYPE_NAME (type
) = x
;
4025 TREE_TYPE (x
) = type
;
4028 if (type
!= error_mark_node
4030 && TYPE_IDENTIFIER (type
))
4031 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
4032 current_binding_level
);
4036 /* Multiple external decls of the same identifier ought to match.
4038 We get warnings about inline functions where they are defined.
4039 We get warnings about other functions from push_overloaded_decl.
4041 Avoid duplicate warnings where they are used. */
4042 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
4046 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
4047 if (decl
&& TREE_CODE (decl
) == OVERLOAD
)
4048 decl
= OVL_FUNCTION (decl
);
4050 if (decl
&& decl
!= error_mark_node
4051 && (DECL_EXTERNAL (decl
) || TREE_PUBLIC (decl
))
4052 /* If different sort of thing, we already gave an error. */
4053 && TREE_CODE (decl
) == TREE_CODE (x
)
4054 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
4056 cp_pedwarn ("type mismatch with previous external decl", x
);
4057 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
4061 /* This name is new in its binding level.
4062 Install the new declaration and return it. */
4063 if (namespace_bindings_p ())
4065 /* Install a global value. */
4067 /* If the first global decl has external linkage,
4068 warn if we later see static one. */
4069 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
4070 TREE_PUBLIC (name
) = 1;
4072 /* Bind the mangled name for the entity. In the future, we
4073 should not need to do this; mangled names are an
4074 implementation detail of which the front-end should not
4075 need to be aware. */
4076 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
4078 /* For an ordinary function, we create a binding from
4079 the mangled name (i.e., NAME) to the DECL. But, for
4080 an `extern "C"' function, the mangled name and the
4081 ordinary name are the same so we need not do this. */
4082 && !DECL_EXTERN_C_FUNCTION_P (x
))
4086 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
4087 || TREE_CODE (x
) == NAMESPACE_DECL
)
4088 mangled_name
= name
;
4090 mangled_name
= DECL_ASSEMBLER_NAME (x
);
4092 if (TREE_CODE (x
) == FUNCTION_DECL
)
4094 ((IDENTIFIER_GLOBAL_VALUE (mangled_name
) == NULL_TREE
)
4095 || (IDENTIFIER_GLOBAL_VALUE (mangled_name
) == x
), 378);
4096 SET_IDENTIFIER_NAMESPACE_VALUE (mangled_name
, x
);
4099 /* Don't forget if the function was used via an implicit decl. */
4100 if (IDENTIFIER_IMPLICIT_DECL (name
)
4101 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
4104 /* Don't forget if its address was taken in that way. */
4105 if (IDENTIFIER_IMPLICIT_DECL (name
)
4106 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
4107 TREE_ADDRESSABLE (x
) = 1;
4109 /* Warn about mismatches against previous implicit decl. */
4110 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
4111 /* If this real decl matches the implicit, don't complain. */
4112 && ! (TREE_CODE (x
) == FUNCTION_DECL
4113 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
4115 ("`%D' was previously implicitly declared to return `int'", x
);
4117 /* If new decl is `static' and an `extern' was seen previously,
4119 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
4120 warn_extern_redeclared_static (x
, t
);
4124 /* Here to install a non-global value. */
4125 tree oldlocal
= IDENTIFIER_VALUE (name
);
4126 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
4128 if (need_new_binding
)
4130 push_local_binding (name
, x
, 0);
4131 /* Because push_local_binding will hook X on to the
4132 current_binding_level's name list, we don't want to
4133 do that again below. */
4134 need_new_binding
= 0;
4137 /* If this is a TYPE_DECL, push it into the type value slot. */
4138 if (TREE_CODE (x
) == TYPE_DECL
)
4139 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
4140 current_binding_level
);
4142 /* Clear out any TYPE_DECL shadowed by a namespace so that
4143 we won't think this is a type. The C struct hack doesn't
4144 go through namespaces. */
4145 if (TREE_CODE (x
) == NAMESPACE_DECL
)
4146 set_identifier_type_value_with_scope (name
, NULL_TREE
,
4147 current_binding_level
);
4154 && TREE_CODE (oldlocal
) == VAR_DECL
4155 && DECL_DEAD_FOR_LOCAL (oldlocal
))
4156 oldlocal
= DECL_SHADOWED_FOR_VAR (oldlocal
);
4158 if (oldlocal
== NULL_TREE
)
4159 oldlocal
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (d
));
4162 /* If this is an extern function declaration, see if we
4163 have a global definition or declaration for the function. */
4164 if (oldlocal
== NULL_TREE
4165 && DECL_EXTERNAL (x
)
4166 && oldglobal
!= NULL_TREE
4167 && TREE_CODE (x
) == FUNCTION_DECL
4168 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
4170 /* We have one. Their types must agree. */
4171 if (decls_match (x
, oldglobal
))
4175 cp_warning ("extern declaration of `%#D' doesn't match", x
);
4176 cp_warning_at ("global declaration `%#D'", oldglobal
);
4179 /* If we have a local external declaration,
4180 and no file-scope declaration has yet been seen,
4181 then if we later have a file-scope decl it must not be static. */
4182 if (oldlocal
== NULL_TREE
4183 && oldglobal
== NULL_TREE
4184 && DECL_EXTERNAL (x
)
4186 TREE_PUBLIC (name
) = 1;
4188 /* Warn if shadowing an argument at the top level of the body. */
4189 if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
4190 /* Inline decls shadow nothing. */
4191 && !DECL_FROM_INLINE (x
)
4192 && TREE_CODE (oldlocal
) == PARM_DECL
4193 /* Don't complain if it's from an enclosing function. */
4194 && DECL_CONTEXT (oldlocal
) == current_function_decl
4195 && TREE_CODE (x
) != PARM_DECL
)
4197 /* Go to where the parms should be and see if we
4199 struct binding_level
*b
= current_binding_level
->level_chain
;
4205 if (b
->parm_flag
== 1)
4206 cp_error ("declaration of `%#D' shadows a parameter", name
);
4209 /* Maybe warn if shadowing something else. */
4210 if (warn_shadow
&& !DECL_EXTERNAL (x
)
4211 /* Inline decls shadow nothing. */
4212 && !DECL_FROM_INLINE (x
)
4213 /* No shadow warnings for internally generated vars. */
4214 && ! DECL_ARTIFICIAL (x
)
4215 /* No shadow warnings for vars made for inlining. */
4216 && ! DECL_FROM_INLINE (x
))
4218 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
4219 warning ("declaration of `%s' shadows a parameter",
4220 IDENTIFIER_POINTER (name
));
4221 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
4222 && current_class_ptr
4223 && !TREE_STATIC (name
))
4224 warning ("declaration of `%s' shadows a member of `this'",
4225 IDENTIFIER_POINTER (name
));
4226 else if (oldlocal
!= NULL_TREE
)
4227 warning ("declaration of `%s' shadows previous local",
4228 IDENTIFIER_POINTER (name
));
4229 else if (oldglobal
!= NULL_TREE
)
4230 /* XXX shadow warnings in outer-more namespaces */
4231 warning ("declaration of `%s' shadows global declaration",
4232 IDENTIFIER_POINTER (name
));
4236 if (TREE_CODE (x
) == FUNCTION_DECL
)
4237 check_default_args (x
);
4239 /* Keep count of variables in this level with incomplete type. */
4240 if (TREE_CODE (x
) == VAR_DECL
4241 && TREE_TYPE (x
) != error_mark_node
4242 && ((!COMPLETE_TYPE_P (TREE_TYPE (x
))
4243 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
4244 /* RTTI TD entries are created while defining the type_info. */
4245 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
4246 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
4248 if (namespace_bindings_p ())
4249 namespace_scope_incomplete
4250 = tree_cons (NULL_TREE
, x
, namespace_scope_incomplete
);
4252 current_binding_level
->incomplete
4253 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4257 if (need_new_binding
)
4258 add_decl_to_level (x
,
4259 DECL_NAMESPACE_SCOPE_P (x
)
4260 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x
))
4261 : current_binding_level
);
4266 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4267 caller to set DECL_CONTEXT properly. */
4270 pushdecl_with_scope (x
, level
)
4272 struct binding_level
*level
;
4274 register struct binding_level
*b
;
4275 tree function_decl
= current_function_decl
;
4277 current_function_decl
= NULL_TREE
;
4278 if (level
->parm_flag
== 2)
4280 b
= class_binding_level
;
4281 class_binding_level
= level
;
4282 pushdecl_class_level (x
);
4283 class_binding_level
= b
;
4287 b
= current_binding_level
;
4288 current_binding_level
= level
;
4290 current_binding_level
= b
;
4292 current_function_decl
= function_decl
;
4296 /* Like pushdecl, only it places X in the current namespace,
4300 pushdecl_namespace_level (x
)
4303 register struct binding_level
*b
= current_binding_level
;
4306 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4308 /* Now, the type_shadowed stack may screw us. Munge it so it does
4310 if (TREE_CODE (x
) == TYPE_DECL
)
4312 tree name
= DECL_NAME (x
);
4314 tree
*ptr
= (tree
*)0;
4315 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4317 tree shadowed
= b
->type_shadowed
;
4318 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4319 if (TREE_PURPOSE (shadowed
) == name
)
4321 ptr
= &TREE_VALUE (shadowed
);
4322 /* Can't break out of the loop here because sometimes
4323 a binding level will have duplicate bindings for
4324 PT names. It's gross, but I haven't time to fix it. */
4327 newval
= TREE_TYPE (x
);
4328 if (ptr
== (tree
*)0)
4330 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4331 up here if this is changed to an assertion. --KR */
4332 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4342 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4346 pushdecl_top_level (x
)
4349 push_to_top_level ();
4350 x
= pushdecl_namespace_level (x
);
4351 pop_from_top_level ();
4355 /* Make the declaration of X appear in CLASS scope. */
4358 pushdecl_class_level (x
)
4361 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4362 scope looks for the pre-mangled name. */
4365 if (TREE_CODE (x
) == OVERLOAD
)
4366 x
= OVL_CURRENT (x
);
4367 name
= DECL_NAME (x
);
4371 push_class_level_binding (name
, x
);
4372 if (TREE_CODE (x
) == TYPE_DECL
)
4373 set_identifier_type_value (name
, TREE_TYPE (x
));
4375 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4379 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4382 pushdecl_class_level (f
);
4386 /* Enter DECL into the symbol table, if that's appropriate. Returns
4387 DECL, or a modified version thereof. */
4390 maybe_push_decl (decl
)
4393 tree type
= TREE_TYPE (decl
);
4395 /* Add this decl to the current binding level, but not if it comes
4396 from another scope, e.g. a static member variable. TEM may equal
4397 DECL or it may be a previous decl of the same name. */
4398 if (decl
== error_mark_node
4399 || (TREE_CODE (decl
) != PARM_DECL
4400 && DECL_CONTEXT (decl
) != NULL_TREE
4401 /* Definitions of namespace members outside their namespace are
4403 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4404 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4405 || TREE_CODE (type
) == UNKNOWN_TYPE
4406 /* The declaration of a template specialization does not affect
4407 the functions available for overload resolution, so we do not
4409 || (TREE_CODE (decl
) == FUNCTION_DECL
4410 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4413 return pushdecl (decl
);
4416 /* Make the declaration(s) of X appear in CLASS scope
4417 under the name NAME. */
4420 push_class_level_binding (name
, x
)
4425 /* The class_binding_level will be NULL if x is a template
4426 parameter name in a member template. */
4427 if (!class_binding_level
)
4430 /* Make sure that this new member does not have the same name
4431 as a template parameter. */
4432 if (TYPE_BEING_DEFINED (current_class_type
))
4433 check_template_shadow (x
);
4435 /* If this declaration shadows a declaration from an enclosing
4436 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4437 we leave this class. Record the shadowed declaration here. */
4438 binding
= IDENTIFIER_BINDING (name
);
4440 && ((TREE_CODE (x
) == OVERLOAD
4441 && BINDING_VALUE (binding
)
4442 && is_overloaded_fn (BINDING_VALUE (binding
)))
4443 || INHERITED_VALUE_BINDING_P (binding
)))
4448 /* If the old binding was from a base class, and was for a tag
4449 name, slide it over to make room for the new binding. The
4450 old binding is still visible if explicitly qualified with a
4452 if (INHERITED_VALUE_BINDING_P (binding
)
4453 && BINDING_VALUE (binding
)
4454 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4455 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4456 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4458 old_decl
= BINDING_TYPE (binding
);
4459 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4460 BINDING_VALUE (binding
) = NULL_TREE
;
4461 INHERITED_VALUE_BINDING_P (binding
) = 0;
4464 old_decl
= BINDING_VALUE (binding
);
4466 /* There was already a binding for X containing fewer
4467 functions than are named in X. Find the previous
4468 declaration of X on the class-shadowed list, and update it. */
4469 for (shadow
= class_binding_level
->class_shadowed
;
4471 shadow
= TREE_CHAIN (shadow
))
4472 if (TREE_PURPOSE (shadow
) == name
4473 && TREE_TYPE (shadow
) == old_decl
)
4475 BINDING_VALUE (binding
) = x
;
4476 INHERITED_VALUE_BINDING_P (binding
) = 0;
4477 TREE_TYPE (shadow
) = x
;
4482 /* If we didn't replace an existing binding, put the binding on the
4483 stack of bindings for the identifier, and update
4484 IDENTIFIER_CLASS_VALUE. */
4485 if (push_class_binding (name
, x
))
4487 class_binding_level
->class_shadowed
4488 = tree_cons (name
, IDENTIFIER_CLASS_VALUE (name
),
4489 class_binding_level
->class_shadowed
);
4490 /* Record the value we are binding NAME to so that we can know
4491 what to pop later. */
4492 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4496 /* Insert another USING_DECL into the current binding level, returning
4497 this declaration. If this is a redeclaration, do nothing, and
4498 return NULL_TREE if this not in namespace scope (in namespace
4499 scope, a using decl might extend any previous bindings). */
4502 push_using_decl (scope
, name
)
4508 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4509 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4510 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4511 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4514 return namespace_bindings_p () ? decl
: NULL_TREE
;
4515 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4516 DECL_INITIAL (decl
) = scope
;
4517 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4518 current_binding_level
->usings
= decl
;
4522 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4523 changed (i.e. there was already a directive), or the fresh
4524 TREE_LIST otherwise. */
4527 push_using_directive (used
)
4530 tree ud
= current_binding_level
->using_directives
;
4531 tree iter
, ancestor
;
4533 /* Check if we already have this. */
4534 if (purpose_member (used
, ud
) != NULL_TREE
)
4537 /* Recursively add all namespaces used. */
4538 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4539 push_using_directive (TREE_PURPOSE (iter
));
4541 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4542 ud
= current_binding_level
->using_directives
;
4543 ud
= tree_cons (used
, ancestor
, ud
);
4544 current_binding_level
->using_directives
= ud
;
4548 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4549 other definitions already in place. We get around this by making
4550 the value of the identifier point to a list of all the things that
4551 want to be referenced by that name. It is then up to the users of
4552 that name to decide what to do with that list.
4554 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its
4555 DECL_TEMPLATE_RESULT. It is dealt with the same way.
4557 FLAGS is a bitwise-or of the following values:
4558 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4560 PUSH_USING: DECL is being pushed as the result of a using
4563 The value returned may be a previous declaration if we guessed wrong
4564 about what language DECL should belong to (C or C++). Otherwise,
4565 it's always DECL (and never something that's not a _DECL). */
4568 push_overloaded_decl (decl
, flags
)
4572 tree name
= DECL_NAME (decl
);
4575 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4578 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4580 old
= lookup_name_current_level (name
);
4584 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4586 tree t
= TREE_TYPE (old
);
4587 if (IS_AGGR_TYPE (t
) && warn_shadow
4588 && (! DECL_IN_SYSTEM_HEADER (decl
)
4589 || ! DECL_IN_SYSTEM_HEADER (old
)))
4590 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4593 else if (is_overloaded_fn (old
))
4597 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4599 tree fn
= OVL_CURRENT (tmp
);
4601 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4602 && !(flags
& PUSH_USING
)
4603 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4604 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4605 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4608 if (duplicate_decls (decl
, fn
))
4612 else if (old
== error_mark_node
)
4613 /* Ignore the undefined symbol marker. */
4617 cp_error_at ("previous non-function declaration `%#D'", old
);
4618 cp_error ("conflicts with function declaration `%#D'", decl
);
4623 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4625 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4626 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4628 new_binding
= ovl_cons (decl
, old
);
4629 if (flags
& PUSH_USING
)
4630 OVL_USED (new_binding
) = 1;
4633 /* NAME is not ambiguous. */
4637 set_namespace_binding (name
, current_namespace
, new_binding
);
4640 /* We only create an OVERLOAD if there was a previous binding at
4641 this level, or if decl is a template. In the former case, we
4642 need to remove the old binding and replace it with the new
4643 binding. We must also run through the NAMES on the binding
4644 level where the name was bound to update the chain. */
4646 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4650 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4652 d
= &TREE_CHAIN (*d
))
4654 || (TREE_CODE (*d
) == TREE_LIST
4655 && TREE_VALUE (*d
) == old
))
4657 if (TREE_CODE (*d
) == TREE_LIST
)
4658 /* Just replace the old binding with the new. */
4659 TREE_VALUE (*d
) = new_binding
;
4661 /* Build a TREE_LIST to wrap the OVERLOAD. */
4662 *d
= tree_cons (NULL_TREE
, new_binding
,
4665 /* And update the CPLUS_BINDING node. */
4666 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4671 /* We should always find a previous binding in this case. */
4672 my_friendly_abort (0);
4675 /* Install the new binding. */
4676 push_local_binding (name
, new_binding
, flags
);
4682 /* Generate an implicit declaration for identifier FUNCTIONID
4683 as a function of type int (). Print a warning if appropriate. */
4686 implicitly_declare (functionid
)
4691 /* We used to reuse an old implicit decl here,
4692 but this loses with inline functions because it can clobber
4693 the saved decl chains. */
4694 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4696 DECL_EXTERNAL (decl
) = 1;
4697 TREE_PUBLIC (decl
) = 1;
4699 /* ISO standard says implicit declarations are in the innermost block.
4700 So we record the decl in the standard fashion. */
4702 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4705 /* Only one warning per identifier. */
4706 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4708 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4711 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4716 /* Return zero if the declaration NEWDECL is valid
4717 when the declaration OLDDECL (assumed to be for the same name)
4718 has already been seen.
4719 Otherwise return an error message format string with a %s
4720 where the identifier should go. */
4723 redeclaration_error_message (newdecl
, olddecl
)
4724 tree newdecl
, olddecl
;
4726 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4728 /* Because C++ can put things into name space for free,
4729 constructs like "typedef struct foo { ... } foo"
4730 would look like an erroneous redeclaration. */
4731 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4734 return "redefinition of `%#D'";
4736 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4738 /* If this is a pure function, its olddecl will actually be
4739 the original initialization to `0' (which we force to call
4740 abort()). Don't complain about redefinition in this case. */
4741 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_PURE_VIRTUAL_P (olddecl
))
4744 /* If both functions come from different namespaces, this is not
4745 a redeclaration - this is a conflict with a used function. */
4746 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4747 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4748 return "`%D' conflicts with used function";
4750 /* We'll complain about linkage mismatches in
4751 warn_extern_redeclared_static. */
4753 /* Defining the same name twice is no good. */
4754 if (DECL_INITIAL (olddecl
) != NULL_TREE
4755 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4757 if (DECL_NAME (olddecl
) == NULL_TREE
)
4758 return "`%#D' not declared in class";
4760 return "redefinition of `%#D'";
4764 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4766 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4767 && (DECL_TEMPLATE_RESULT (newdecl
)
4768 != DECL_TEMPLATE_RESULT (olddecl
))
4769 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4770 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4771 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4772 && COMPLETE_TYPE_P (TREE_TYPE (newdecl
))
4773 && COMPLETE_TYPE_P (TREE_TYPE (olddecl
))))
4774 return "redefinition of `%#D'";
4777 else if (toplevel_bindings_p () || DECL_NAMESPACE_SCOPE_P (newdecl
))
4779 /* Objects declared at top level: */
4780 /* If at least one is a reference, it's ok. */
4781 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4783 /* Reject two definitions. */
4784 return "redefinition of `%#D'";
4788 /* Objects declared with block scope: */
4789 /* Reject two definitions, and reject a definition
4790 together with an external reference. */
4791 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4792 return "redeclaration of `%#D'";
4797 /* Create a new label, named ID. */
4800 make_label_decl (id
, local_p
)
4806 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4808 /* Make sure every label has an rtx. */
4811 DECL_CONTEXT (decl
) = current_function_decl
;
4812 DECL_MODE (decl
) = VOIDmode
;
4813 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
4815 /* Say where one reference is to the label, for the sake of the
4816 error if it is not defined. */
4817 DECL_SOURCE_LINE (decl
) = lineno
;
4818 DECL_SOURCE_FILE (decl
) = input_filename
;
4820 /* Record the fact that this identifier is bound to this label. */
4821 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4826 /* Record this label on the list of used labels so that we can check
4827 at the end of the function to see whether or not the label was
4828 actually defined, and so we can check when the label is defined whether
4829 this use is valid. */
4835 if (named_label_uses
== NULL
4836 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4837 || named_label_uses
->label_decl
!= decl
)
4839 struct named_label_use_list
*new_ent
;
4840 new_ent
= ((struct named_label_use_list
*)
4841 ggc_alloc (sizeof (struct named_label_use_list
)));
4842 new_ent
->label_decl
= decl
;
4843 new_ent
->names_in_scope
= current_binding_level
->names
;
4844 new_ent
->binding_level
= current_binding_level
;
4845 new_ent
->lineno_o_goto
= lineno
;
4846 new_ent
->filename_o_goto
= input_filename
;
4847 new_ent
->next
= named_label_uses
;
4848 named_label_uses
= new_ent
;
4852 /* Look for a label named ID in the current function. If one cannot
4853 be found, create one. (We keep track of used, but undefined,
4854 labels, and complain about them at the end of a function.) */
4861 struct named_label_list
*ent
;
4863 /* You can't use labels at global scope. */
4864 if (current_function_decl
== NULL_TREE
)
4866 error ("label `%s' referenced outside of any function",
4867 IDENTIFIER_POINTER (id
));
4871 /* See if we've already got this label. */
4872 decl
= IDENTIFIER_LABEL_VALUE (id
);
4873 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
4876 /* Record this label on the list of labels used in this function.
4877 We do this before calling make_label_decl so that we get the
4878 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4879 ent
= ((struct named_label_list
*)
4880 ggc_alloc_cleared (sizeof (struct named_label_list
)));
4881 ent
->old_value
= IDENTIFIER_LABEL_VALUE (id
);
4882 ent
->next
= named_labels
;
4885 /* We need a new label. */
4886 decl
= make_label_decl (id
, /*local_p=*/0);
4888 /* Now fill in the information we didn't have before. */
4889 ent
->label_decl
= decl
;
4894 /* Declare a local label named ID. */
4897 declare_local_label (id
)
4902 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4903 this scope we can restore the old value of
4904 IDENTIFIER_TYPE_VALUE. */
4905 current_binding_level
->shadowed_labels
4906 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4907 current_binding_level
->shadowed_labels
);
4908 /* Look for the label. */
4909 decl
= make_label_decl (id
, /*local_p=*/1);
4910 /* Now fill in the information we didn't have before. */
4911 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
4916 /* Returns nonzero if it is ill-formed to jump past the declaration of
4917 DECL. Returns 2 if it's also a real problem. */
4920 decl_jump_unsafe (decl
)
4923 if (TREE_CODE (decl
) != VAR_DECL
|| TREE_STATIC (decl
))
4926 if (DECL_INITIAL (decl
) == NULL_TREE
4927 && pod_type_p (TREE_TYPE (decl
)))
4930 /* This is really only important if we're crossing an initialization.
4931 The POD stuff is just pedantry; why should it matter if the class
4932 contains a field of pointer to member type? */
4933 if (DECL_INITIAL (decl
)
4934 || (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))))
4939 /* Check that a single previously seen jump to a newly defined label
4940 is OK. DECL is the LABEL_DECL or 0; LEVEL is the binding_level for
4941 the jump context; NAMES are the names in scope in LEVEL at the jump
4942 context; FILE and LINE are the source position of the jump or 0. */
4945 check_previous_goto_1 (decl
, level
, names
, file
, line
)
4947 struct binding_level
*level
;
4954 struct binding_level
*b
= current_binding_level
;
4955 for (; b
; b
= b
->level_chain
)
4957 tree new_decls
= b
->names
;
4958 tree old_decls
= (b
== level
? names
: NULL_TREE
);
4959 for (; new_decls
!= old_decls
;
4960 new_decls
= TREE_CHAIN (new_decls
))
4962 int problem
= decl_jump_unsafe (new_decls
);
4969 cp_pedwarn ("jump to label `%D'", decl
);
4971 pedwarn ("jump to case label");
4974 pedwarn_with_file_and_line (file
, line
, " from here");
4978 if (problem
> 1 && DECL_ARTIFICIAL (new_decls
))
4979 /* Can't skip init of __exception_info. */
4980 cp_error_at (" enters catch block", new_decls
);
4981 else if (problem
> 1)
4982 cp_error_at (" crosses initialization of `%#D'",
4985 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4991 if (b
->eh_region
&& ! saw_eh
)
4996 cp_pedwarn ("jump to label `%D'", decl
);
4998 pedwarn ("jump to case label");
5001 pedwarn_with_file_and_line (file
, line
, " from here");
5004 error (" enters try block");
5011 check_previous_goto (use
)
5012 struct named_label_use_list
*use
;
5014 check_previous_goto_1 (use
->label_decl
, use
->binding_level
,
5015 use
->names_in_scope
, use
->filename_o_goto
,
5016 use
->lineno_o_goto
);
5020 check_switch_goto (level
)
5021 struct binding_level
*level
;
5023 check_previous_goto_1 (NULL_TREE
, level
, level
->names
, NULL
, 0);
5026 /* Check that any previously seen jumps to a newly defined label DECL
5027 are OK. Called by define_label. */
5030 check_previous_gotos (decl
)
5033 struct named_label_use_list
**usep
;
5035 if (! TREE_USED (decl
))
5038 for (usep
= &named_label_uses
; *usep
; )
5040 struct named_label_use_list
*use
= *usep
;
5041 if (use
->label_decl
== decl
)
5043 check_previous_goto (use
);
5047 usep
= &(use
->next
);
5051 /* Check that a new jump to a label DECL is OK. Called by
5052 finish_goto_stmt. */
5060 struct named_label_list
*lab
;
5062 /* We can't know where a computed goto is jumping. So we assume
5064 if (! DECL_P (decl
))
5067 /* If the label hasn't been defined yet, defer checking. */
5068 if (! DECL_INITIAL (decl
))
5074 for (lab
= named_labels
; lab
; lab
= lab
->next
)
5075 if (decl
== lab
->label_decl
)
5078 /* If the label is not on named_labels it's a gcc local label, so
5079 it must be in an outer scope, so jumping to it is always OK. */
5083 if ((lab
->eh_region
|| lab
->bad_decls
) && !identified
)
5085 cp_pedwarn_at ("jump to label `%D'", decl
);
5086 pedwarn (" from here");
5090 for (bad
= lab
->bad_decls
; bad
; bad
= TREE_CHAIN (bad
))
5092 tree b
= TREE_VALUE (bad
);
5093 int u
= decl_jump_unsafe (b
);
5095 if (u
> 1 && DECL_ARTIFICIAL (b
))
5096 /* Can't skip init of __exception_info. */
5097 cp_error_at (" enters catch block", b
);
5099 cp_error_at (" skips initialization of `%#D'", b
);
5101 cp_pedwarn_at (" enters scope of non-POD `%#D'", b
);
5105 error (" enters try block");
5108 /* Define a label, specifying the location in the source file.
5109 Return the LABEL_DECL node for the label, if the definition is valid.
5110 Otherwise return 0. */
5113 define_label (filename
, line
, name
)
5114 const char *filename
;
5118 tree decl
= lookup_label (name
);
5119 struct named_label_list
*ent
;
5121 for (ent
= named_labels
; ent
; ent
= ent
->next
)
5122 if (ent
->label_decl
== decl
)
5125 /* After labels, make any new cleanups go into their
5126 own new (temporary) binding contour. */
5127 current_binding_level
->more_cleanups_ok
= 0;
5129 if (name
== get_identifier ("wchar_t"))
5130 cp_pedwarn ("label named wchar_t");
5132 if (DECL_INITIAL (decl
) != NULL_TREE
)
5134 cp_error ("duplicate label `%D'", decl
);
5139 /* Mark label as having been defined. */
5140 DECL_INITIAL (decl
) = error_mark_node
;
5141 /* Say where in the source. */
5142 DECL_SOURCE_FILE (decl
) = filename
;
5143 DECL_SOURCE_LINE (decl
) = line
;
5146 ent
->names_in_scope
= current_binding_level
->names
;
5147 ent
->binding_level
= current_binding_level
;
5149 check_previous_gotos (decl
);
5150 current_function_return_value
= NULL_TREE
;
5157 struct binding_level
*level
;
5158 struct cp_switch
*next
;
5161 static struct cp_switch
*switch_stack
;
5167 = (struct cp_switch
*) xmalloc (sizeof (struct cp_switch
));
5168 p
->level
= current_binding_level
;
5169 p
->next
= switch_stack
;
5176 struct cp_switch
*cs
;
5179 switch_stack
= switch_stack
->next
;
5183 /* Note that we've seen a definition of a case label, and complain if this
5184 is a bad place for one. */
5187 define_case_label ()
5189 tree cleanup
= last_cleanup_this_contour ();
5192 /* Don't crash; we'll complain in do_case. */
5197 static int explained
= 0;
5198 cp_warning_at ("destructor needed for `%#D'", TREE_PURPOSE (cleanup
));
5199 warning ("where case label appears here");
5202 warning ("(enclose actions of previous case statements requiring");
5203 warning ("destructors in their own binding contours.)");
5208 check_switch_goto (switch_stack
->level
);
5210 /* After labels, make any new cleanups go into their
5211 own new (temporary) binding contour. */
5213 current_binding_level
->more_cleanups_ok
= 0;
5214 current_function_return_value
= NULL_TREE
;
5217 /* Return the list of declarations of the current level.
5218 Note that this list is in reverse order unless/until
5219 you nreverse it; and when you do nreverse it, you must
5220 store the result back using `storedecls' or you will lose. */
5225 return current_binding_level
->names
;
5228 /* Return the list of type-tags (for structs, etc) of the current level. */
5233 return current_binding_level
->tags
;
5236 /* Store the list of declarations of the current level.
5237 This is done for the parameter declarations of a function being defined,
5238 after they are modified in the light of any missing parameters. */
5244 current_binding_level
->names
= decls
;
5247 /* Similarly, store the list of tags of the current level. */
5253 current_binding_level
->tags
= tags
;
5256 /* Given NAME, an IDENTIFIER_NODE,
5257 return the structure (or union or enum) definition for that name.
5258 Searches binding levels from BINDING_LEVEL up to the global level.
5259 If THISLEVEL_ONLY is nonzero, searches only the specified context
5260 (but skips any tag-transparent contexts to find one that is
5261 meaningful for tags).
5262 FORM says which kind of type the caller wants;
5263 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
5264 If the wrong kind of type is found, and it's not a template, an error is
5268 lookup_tag (form
, name
, binding_level
, thislevel_only
)
5269 enum tree_code form
;
5271 struct binding_level
*binding_level
;
5274 register struct binding_level
*level
;
5275 /* Non-zero if, we should look past a template parameter level, even
5276 if THISLEVEL_ONLY. */
5277 int allow_template_parms_p
= 1;
5279 for (level
= binding_level
; level
; level
= level
->level_chain
)
5282 if (ANON_AGGRNAME_P (name
))
5283 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5285 /* There's no need for error checking here, because
5286 anon names are unique throughout the compilation. */
5287 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
5288 return TREE_VALUE (tail
);
5290 else if (level
->namespace_p
)
5291 /* Do namespace lookup. */
5292 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
5294 tree old
= binding_for_name (name
, tail
);
5296 /* If we just skipped past a template parameter level,
5297 even though THISLEVEL_ONLY, and we find a template
5298 class declaration, then we use the _TYPE node for the
5299 template. See the example below. */
5300 if (thislevel_only
&& !allow_template_parms_p
5301 && old
&& BINDING_VALUE (old
)
5302 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
5303 old
= TREE_TYPE (BINDING_VALUE (old
));
5305 old
= BINDING_TYPE (old
);
5307 /* If it has an original type, it is a typedef, and we
5308 should not return it. */
5309 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
5311 if (old
&& TREE_CODE (old
) != form
5312 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
5314 cp_error ("`%#D' redeclared as %C", old
, form
);
5319 if (thislevel_only
|| tail
== global_namespace
)
5323 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5325 if (TREE_PURPOSE (tail
) == name
)
5327 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
5328 /* Should tighten this up; it'll probably permit
5329 UNION_TYPE and a struct template, for example. */
5331 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
5333 /* Definition isn't the kind we were looking for. */
5334 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
5338 return TREE_VALUE (tail
);
5341 if (thislevel_only
&& ! level
->tag_transparent
)
5343 if (level
->template_parms_p
&& allow_template_parms_p
)
5345 /* We must deal with cases like this:
5347 template <class T> struct S;
5348 template <class T> struct S {};
5350 When looking up `S', for the second declaration, we
5351 would like to find the first declaration. But, we
5352 are in the pseudo-global level created for the
5353 template parameters, rather than the (surrounding)
5354 namespace level. Thus, we keep going one more level,
5355 even though THISLEVEL_ONLY is non-zero. */
5356 allow_template_parms_p
= 0;
5368 set_current_level_tags_transparency (tags_transparent
)
5369 int tags_transparent
;
5371 current_binding_level
->tag_transparent
= tags_transparent
;
5375 /* Given a type, find the tag that was defined for it and return the tag name.
5376 Otherwise return 0. However, the value can never be 0
5377 in the cases in which this is used.
5379 C++: If NAME is non-zero, this is the new name to install. This is
5380 done when replacing anonymous tags with real tag names. */
5383 lookup_tag_reverse (type
, name
)
5387 register struct binding_level
*level
;
5389 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5392 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5394 if (TREE_VALUE (tail
) == type
)
5397 TREE_PURPOSE (tail
) = name
;
5398 return TREE_PURPOSE (tail
);
5405 /* Look up NAME in the NAMESPACE. */
5408 lookup_namespace_name (namespace, name
)
5409 tree
namespace, name
;
5412 tree template_id
= NULL_TREE
;
5414 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5416 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5417 /* This happens for A::B<int> when B is a namespace. */
5419 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5421 /* This happens for A::B where B is a template, and there are no
5422 template arguments. */
5423 cp_error ("invalid use of `%D'", name
);
5424 return error_mark_node
;
5427 namespace = ORIGINAL_NAMESPACE (namespace);
5429 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5432 name
= TREE_OPERAND (name
, 0);
5433 if (TREE_CODE (name
) == OVERLOAD
)
5434 name
= DECL_NAME (OVL_CURRENT (name
));
5435 else if (DECL_P (name
))
5436 name
= DECL_NAME (name
);
5439 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5441 val
= make_node (CPLUS_BINDING
);
5442 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5443 return error_mark_node
;
5445 if (BINDING_VALUE (val
))
5447 val
= BINDING_VALUE (val
);
5451 if (DECL_CLASS_TEMPLATE_P (val
))
5452 val
= lookup_template_class (val
,
5453 TREE_OPERAND (template_id
, 1),
5454 /*in_decl=*/NULL_TREE
,
5455 /*context=*/NULL_TREE
,
5456 /*entering_scope=*/0);
5457 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5458 || TREE_CODE (val
) == OVERLOAD
)
5459 val
= lookup_template_function (val
,
5460 TREE_OPERAND (template_id
, 1));
5463 cp_error ("`%D::%D' is not a template",
5465 return error_mark_node
;
5469 /* If we have a single function from a using decl, pull it out. */
5470 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5471 val
= OVL_FUNCTION (val
);
5475 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5476 return error_mark_node
;
5479 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5481 static unsigned long
5489 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5490 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5495 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5498 typename_compare (k1
, k2
)
5509 d1
= TYPE_NAME (t1
);
5510 d2
= TYPE_NAME (t2
);
5512 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5513 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5514 && ((TREE_TYPE (t1
) != NULL_TREE
)
5515 == (TREE_TYPE (t2
) != NULL_TREE
))
5516 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5517 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5520 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5521 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5522 is non-NULL, this type is being created by the implicit typename
5523 extension, and BASE_TYPE is a type named `t' in some base class of
5524 `T' which depends on template parameters.
5526 Returns the new TYPENAME_TYPE. */
5529 build_typename_type (context
, name
, fullname
, base_type
)
5537 struct hash_entry
* e
;
5539 static struct hash_table ht
;
5543 static struct hash_table
*h
= &ht
;
5544 if (!hash_table_init (&ht
, &hash_newfunc
, &typename_hash
,
5546 fatal ("virtual memory exhausted");
5547 ggc_add_tree_hash_table_root (&h
, 1);
5550 /* Build the TYPENAME_TYPE. */
5551 t
= make_aggr_type (TYPENAME_TYPE
);
5552 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5553 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5554 TREE_TYPE (t
) = base_type
;
5556 /* Build the corresponding TYPE_DECL. */
5557 d
= build_decl (TYPE_DECL
, name
, t
);
5558 TYPE_NAME (TREE_TYPE (d
)) = d
;
5559 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5560 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5561 DECL_ARTIFICIAL (d
) = 1;
5563 /* See if we already have this type. */
5564 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5568 /* Insert the type into the table. */
5569 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5574 /* Resolve `typename CONTEXT::NAME'. Returns an appropriate type,
5575 unless an error occurs, in which case error_mark_node is returned.
5576 If COMPLAIN zero, don't complain about any errors that occur. */
5579 make_typename_type (context
, name
, complain
)
5587 if (!(TYPE_LANG_SPECIFIC (name
)
5588 && (CLASSTYPE_IS_TEMPLATE (name
)
5589 || CLASSTYPE_USE_TEMPLATE (name
))))
5590 name
= TYPE_IDENTIFIER (name
);
5592 /* Create a TEMPLATE_ID_EXPR for the type. */
5593 name
= build_nt (TEMPLATE_ID_EXPR
,
5594 CLASSTYPE_TI_TEMPLATE (name
),
5595 CLASSTYPE_TI_ARGS (name
));
5597 else if (TREE_CODE (name
) == TYPE_DECL
)
5598 name
= DECL_NAME (name
);
5602 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5604 name
= TREE_OPERAND (name
, 0);
5605 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5606 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5608 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5609 my_friendly_abort (2000);
5611 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5613 /* We can get here from typename_sub0 in the explicit_template_type
5614 expansion. Just fail. */
5616 cp_error ("no class template named `%#T' in `%#T'",
5618 return error_mark_node
;
5621 if (! uses_template_parms (context
)
5622 || currently_open_class (context
))
5624 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5626 tree tmpl
= NULL_TREE
;
5627 if (IS_AGGR_TYPE (context
))
5628 tmpl
= lookup_field (context
, name
, 0, 0);
5629 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5632 cp_error ("no class template named `%#T' in `%#T'",
5634 return error_mark_node
;
5637 return lookup_template_class (tmpl
,
5638 TREE_OPERAND (fullname
, 1),
5640 /*entering_scope=*/0);
5646 if (!IS_AGGR_TYPE (context
))
5649 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5650 return error_mark_node
;
5653 t
= lookup_field (context
, name
, 0, 1);
5655 return TREE_TYPE (t
);
5659 /* If the CONTEXT is not a template type, then either the field is
5660 there now or its never going to be. */
5661 if (!uses_template_parms (context
))
5664 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5665 return error_mark_node
;
5669 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5672 /* Select the right _DECL from multiple choices. */
5675 select_decl (binding
, flags
)
5680 val
= BINDING_VALUE (binding
);
5681 if (LOOKUP_NAMESPACES_ONLY (flags
))
5683 /* We are not interested in types. */
5684 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5689 /* If we could have a type and
5690 we have nothing or we need a type and have none. */
5691 if (BINDING_TYPE (binding
)
5692 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5693 && TREE_CODE (val
) != TYPE_DECL
)))
5694 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5695 /* Don't return non-types if we really prefer types. */
5696 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5697 && (TREE_CODE (val
) != TEMPLATE_DECL
5698 || !DECL_CLASS_TEMPLATE_P (val
)))
5704 /* Unscoped lookup of a global: iterate over current namespaces,
5705 considering using-directives. If SPACESP is non-NULL, store a list
5706 of the namespaces we've considered in it. */
5709 unqualified_namespace_lookup (name
, flags
, spacesp
)
5714 tree b
= make_node (CPLUS_BINDING
);
5715 tree initial
= current_decl_namespace();
5716 tree scope
= initial
;
5718 struct binding_level
*level
;
5719 tree val
= NULL_TREE
;
5722 *spacesp
= NULL_TREE
;
5724 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5727 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5728 val
= binding_for_name (name
, scope
);
5730 /* Initialize binding for this context. */
5731 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5732 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5734 /* Add all _DECLs seen through local using-directives. */
5735 for (level
= current_binding_level
;
5736 !level
->namespace_p
;
5737 level
= level
->level_chain
)
5738 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5739 scope
, flags
, spacesp
))
5740 /* Give up because of error. */
5741 return error_mark_node
;
5743 /* Add all _DECLs seen through global using-directives. */
5744 /* XXX local and global using lists should work equally. */
5748 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5749 scope
, flags
, spacesp
))
5750 /* Give up because of error. */
5751 return error_mark_node
;
5752 if (siter
== scope
) break;
5753 siter
= CP_DECL_CONTEXT (siter
);
5756 val
= select_decl (b
, flags
);
5757 if (scope
== global_namespace
)
5763 /* Combine prefer_type and namespaces_only into flags. */
5766 lookup_flags (prefer_type
, namespaces_only
)
5767 int prefer_type
, namespaces_only
;
5769 if (namespaces_only
)
5770 return LOOKUP_PREFER_NAMESPACES
;
5771 if (prefer_type
> 1)
5772 return LOOKUP_PREFER_TYPES
;
5773 if (prefer_type
> 0)
5774 return LOOKUP_PREFER_BOTH
;
5778 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5779 ignore it or not. Subroutine of lookup_name_real. */
5782 qualify_lookup (val
, flags
)
5786 if (val
== NULL_TREE
)
5788 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5790 if ((flags
& LOOKUP_PREFER_TYPES
)
5791 && (TREE_CODE (val
) == TYPE_DECL
5792 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5793 && DECL_CLASS_TEMPLATE_P (val
))))
5795 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5800 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5804 warn_about_implicit_typename_lookup (typename
, binding
)
5808 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5809 tree name
= DECL_NAME (typename
);
5811 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5812 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5813 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5814 && ! (TREE_CODE (binding
) == TYPE_DECL
5815 && same_type_p (TREE_TYPE (binding
), subtype
)))
5817 cp_warning ("lookup of `%D' finds `%#D'",
5819 cp_warning (" instead of `%D' from dependent base class",
5821 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5822 constructor_name (current_class_type
), name
);
5826 /* Look up NAME in the current binding level and its superiors in the
5827 namespace of variables, functions and typedefs. Return a ..._DECL
5828 node of some kind representing its definition if there is only one
5829 such declaration, or return a TREE_LIST with all the overloaded
5830 definitions if there are many, or return 0 if it is undefined.
5832 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5833 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5834 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5835 Otherwise we prefer non-TYPE_DECLs.
5837 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5838 using IDENTIFIER_CLASS_VALUE. */
5841 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5843 int prefer_type
, nonclass
, namespaces_only
;
5846 tree val
= NULL_TREE
;
5848 tree from_obj
= NULL_TREE
;
5850 int val_is_implicit_typename
= 0;
5852 /* Hack: copy flag set by parser, if set. */
5853 if (only_namespace_names
)
5854 namespaces_only
= 1;
5856 if (prefer_type
== -2)
5858 extern int looking_for_typename
;
5859 tree type
= NULL_TREE
;
5862 prefer_type
= looking_for_typename
;
5864 flags
= lookup_flags (prefer_type
, namespaces_only
);
5865 /* If the next thing is '<', class templates are types. */
5866 if (looking_for_template
)
5867 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5869 /* std:: becomes :: for now. */
5870 if (got_scope
== std_node
)
5871 got_scope
= void_type_node
;
5875 else if (got_object
!= error_mark_node
)
5880 if (type
== error_mark_node
)
5881 return error_mark_node
;
5882 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5883 type
= TREE_TYPE (type
);
5886 type
= complete_type (type
);
5888 if (TREE_CODE (type
) == VOID_TYPE
)
5889 type
= global_namespace
;
5890 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5892 val
= make_node (CPLUS_BINDING
);
5893 flags
|= LOOKUP_COMPLAIN
;
5894 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5896 val
= select_decl (val
, flags
);
5898 else if (! IS_AGGR_TYPE (type
)
5899 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5900 || TREE_CODE (type
) == TEMPLATE_TEMPLATE_PARM
5901 || TREE_CODE (type
) == TYPENAME_TYPE
)
5902 /* Someone else will give an error about this if needed. */
5904 else if (type
== current_class_type
)
5905 val
= IDENTIFIER_CLASS_VALUE (name
);
5908 val
= lookup_member (type
, name
, 0, prefer_type
);
5909 type_access_control (type
, val
);
5911 /* Restore the containing TYPENAME_TYPE if we looked
5912 through it before. */
5913 if (got_scope
&& got_scope
!= type
5914 && val
&& TREE_CODE (val
) == TYPE_DECL
5915 && TREE_CODE (TREE_TYPE (val
)) == TYPENAME_TYPE
)
5916 TYPE_CONTEXT (TREE_TYPE (val
)) = got_scope
;
5924 else if (got_object
&& val
)
5929 flags
= lookup_flags (prefer_type
, namespaces_only
);
5930 /* If we're not parsing, we need to complain. */
5931 flags
|= LOOKUP_COMPLAIN
;
5934 /* First, look in non-namespace scopes. */
5936 if (current_class_type
== NULL_TREE
)
5939 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5943 if (!LOCAL_BINDING_P (t
) && nonclass
)
5944 /* We're not looking for class-scoped bindings, so keep going. */
5947 /* If this is the kind of thing we're looking for, we're done. */
5948 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5949 binding
= BINDING_VALUE (t
);
5950 else if ((flags
& LOOKUP_PREFER_TYPES
)
5951 && qualify_lookup (BINDING_TYPE (t
), flags
))
5952 binding
= BINDING_TYPE (t
);
5954 binding
= NULL_TREE
;
5956 /* Handle access control on types from enclosing or base classes. */
5957 if (binding
&& ! yylex
5958 && BINDING_LEVEL (t
) && BINDING_LEVEL (t
)->parm_flag
== 2)
5959 type_access_control (BINDING_LEVEL (t
)->this_class
, binding
);
5962 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5964 if (val_is_implicit_typename
&& !yylex
)
5965 warn_about_implicit_typename_lookup (val
, binding
);
5967 val_is_implicit_typename
5968 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5969 if (!val_is_implicit_typename
)
5974 /* Now lookup in namespace scopes. */
5975 if (!val
|| val_is_implicit_typename
)
5977 t
= unqualified_namespace_lookup (name
, flags
, 0);
5980 if (val_is_implicit_typename
&& !yylex
)
5981 warn_about_implicit_typename_lookup (val
, t
);
5989 /* This should only warn about types used in qualified-ids. */
5990 if (from_obj
&& from_obj
!= val
)
5992 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5993 && TREE_CODE (val
) == TYPE_DECL
5994 && TREE_TYPE (from_obj
) != TREE_TYPE (val
))
5996 cp_pedwarn ("lookup of `%D' in the scope of `%#T' (`%#T')",
5997 name
, got_object
, TREE_TYPE (from_obj
));
5998 cp_pedwarn (" does not match lookup in the current scope (`%#T')",
6002 /* We don't change val to from_obj if got_object depends on
6003 template parms because that breaks implicit typename for
6004 destructor calls. */
6005 if (! uses_template_parms (got_object
))
6009 /* If we have a single function from a using decl, pull it out. */
6010 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
6011 val
= OVL_FUNCTION (val
);
6020 lookup_name_nonclass (name
)
6023 return lookup_name_real (name
, 0, 1, 0);
6027 lookup_function_nonclass (name
, args
)
6031 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
6035 lookup_name_namespace_only (name
)
6038 /* type-or-namespace, nonclass, namespace_only */
6039 return lookup_name_real (name
, 1, 1, 1);
6043 lookup_name (name
, prefer_type
)
6047 return lookup_name_real (name
, prefer_type
, 0, 0);
6050 /* Similar to `lookup_name' but look only in the innermost non-class
6054 lookup_name_current_level (name
)
6057 struct binding_level
*b
;
6060 b
= current_binding_level
;
6061 while (b
->parm_flag
== 2)
6066 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
6068 /* extern "C" function() */
6069 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
6072 else if (IDENTIFIER_BINDING (name
)
6073 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
6077 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
6078 return IDENTIFIER_VALUE (name
);
6090 /* Like lookup_name_current_level, but for types. */
6093 lookup_type_current_level (name
)
6096 register tree t
= NULL_TREE
;
6098 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
6100 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
6101 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
6103 struct binding_level
*b
= current_binding_level
;
6106 if (purpose_member (name
, b
->type_shadowed
))
6107 return REAL_IDENTIFIER_TYPE_VALUE (name
);
6119 begin_only_namespace_names ()
6121 only_namespace_names
= 1;
6125 end_only_namespace_names ()
6127 only_namespace_names
= 0;
6130 /* Push the declarations of builtin types into the namespace.
6131 RID_INDEX, if < CP_RID_MAX is the index of the builtin type
6132 in the array RID_POINTERS. NAME is the name used when looking
6133 up the builtin type. TYPE is the _TYPE node for the builtin type. */
6136 record_builtin_type (rid_index
, name
, type
)
6141 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
6142 tree tdecl
= NULL_TREE
;
6144 if ((int) rid_index
< (int) CP_RID_MAX
)
6145 rname
= ridpointers
[(int) rid_index
];
6147 tname
= get_identifier (name
);
6149 TYPE_BUILT_IN (type
) = 1;
6153 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
6154 set_identifier_type_value (tname
, NULL_TREE
);
6155 if ((int) rid_index
< (int) CP_RID_MAX
)
6156 /* Built-in types live in the global namespace. */
6157 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
6159 if (rname
!= NULL_TREE
)
6161 if (tname
!= NULL_TREE
)
6163 set_identifier_type_value (rname
, NULL_TREE
);
6164 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
6168 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
6169 set_identifier_type_value (rname
, NULL_TREE
);
6174 /* Record one of the standard Java types.
6175 * Declare it as having the given NAME.
6176 * If SIZE > 0, it is the size of one of the integral types;
6177 * otherwise it is the negative of the size of one of the other types. */
6180 record_builtin_java_type (name
, size
)
6186 type
= make_signed_type (size
);
6187 else if (size
> -32)
6188 { /* "__java_char" or ""__java_boolean". */
6189 type
= make_unsigned_type (-size
);
6190 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
6193 { /* "__java_float" or ""__java_double". */
6194 type
= make_node (REAL_TYPE
);
6195 TYPE_PRECISION (type
) = - size
;
6198 record_builtin_type (CP_RID_MAX
, name
, type
);
6199 decl
= TYPE_NAME (type
);
6201 /* Suppress generate debug symbol entries for these types,
6202 since for normal C++ they are just clutter.
6203 However, push_lang_context undoes this if extern "Java" is seen. */
6204 DECL_IGNORED_P (decl
) = 1;
6206 TYPE_FOR_JAVA (type
) = 1;
6210 /* Push a type into the namespace so that the back-ends ignore it. */
6213 record_unknown_type (type
, name
)
6217 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
6218 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
6219 DECL_IGNORED_P (decl
) = 1;
6220 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
6221 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
6222 TYPE_ALIGN (type
) = 1;
6223 TYPE_USER_ALIGN (type
) = 0;
6224 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
6227 /* An string for which we should create an IDENTIFIER_NODE at
6230 typedef struct predefined_identifier
6232 /* The name of the identifier. */
6234 /* The place where the IDENTIFIER_NODE should be stored. */
6236 /* Non-zero if this is the name of a constructor or destructor. */
6238 } predefined_identifier
;
6240 /* Create all the predefined identifiers. */
6243 initialize_predefined_identifiers ()
6245 struct predefined_identifier
*pid
;
6247 /* A table of identifiers to create at startup. */
6248 static predefined_identifier predefined_identifiers
[] = {
6249 { "C++", &lang_name_cplusplus
, 0 },
6250 { "C", &lang_name_c
, 0 },
6251 { "Java", &lang_name_java
, 0 },
6252 { CTOR_NAME
, &ctor_identifier
, 1 },
6253 { "__base_ctor", &base_ctor_identifier
, 1 },
6254 { "__comp_ctor", &complete_ctor_identifier
, 1 },
6255 { DTOR_NAME
, &dtor_identifier
, 1 },
6256 { "__comp_dtor", &complete_dtor_identifier
, 1 },
6257 { "__base_dtor", &base_dtor_identifier
, 1 },
6258 { "__deleting_dtor", &deleting_dtor_identifier
, 1 },
6259 { VTABLE_DELTA2_NAME
, &delta2_identifier
, 0 },
6260 { VTABLE_DELTA_NAME
, &delta_identifier
, 0 },
6261 { IN_CHARGE_NAME
, &in_charge_identifier
, 0 },
6262 { VTABLE_INDEX_NAME
, &index_identifier
, 0 },
6263 { "nelts", &nelts_identifier
, 0 },
6264 { THIS_NAME
, &this_identifier
, 0 },
6265 { VTABLE_PFN_NAME
, &pfn_identifier
, 0 },
6266 { "__pfn_or_delta2", &pfn_or_delta2_identifier
, 0 },
6267 { "_vptr", &vptr_identifier
, 0 },
6268 { "__cp_push_exception", &cp_push_exception_identifier
, 0 },
6269 { "__vtt_parm", &vtt_parm_identifier
, 0 },
6270 { "std", &std_identifier
, 0 },
6274 for (pid
= predefined_identifiers
; pid
->name
; ++pid
)
6276 *pid
->node
= get_identifier (pid
->name
);
6277 if (pid
->ctor_or_dtor_p
)
6278 IDENTIFIER_CTOR_OR_DTOR_P (*pid
->node
) = 1;
6282 /* Create the predefined scalar types of C,
6283 and some nodes representing standard constants (0, 1, (void *)0).
6284 Initialize the global binding level.
6285 Make definitions for built-in primitive functions. */
6288 init_decl_processing ()
6291 int wchar_type_size
;
6292 tree array_domain_type
;
6294 /* Check to see that the user did not specify an invalid combination
6295 of command-line options. */
6296 if (flag_new_abi
&& !flag_vtable_thunks
)
6297 fatal ("the new ABI requires vtable thunks");
6299 /* Create all the identifiers we need. */
6300 initialize_predefined_identifiers ();
6302 /* Let the back-end now how to save and restore language-specific
6303 per-function globals. */
6304 init_lang_status
= &push_cp_function_context
;
6305 free_lang_status
= &pop_cp_function_context
;
6306 mark_lang_status
= &mark_cp_function_context
;
6312 /* Create the global variables. */
6313 push_to_top_level ();
6315 /* Enter the global namespace. */
6316 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
6317 push_namespace (get_identifier ("::"));
6318 global_namespace
= current_namespace
;
6319 current_lang_name
= NULL_TREE
;
6321 /* Adjust various flags based on command-line settings. */
6322 if (! flag_permissive
&& ! pedantic
)
6323 flag_pedantic_errors
= 1;
6324 if (!flag_no_inline
)
6325 flag_inline_trees
= 1;
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 build_common_tree_nodes (flag_signed_char
);
6336 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6337 TREE_TYPE (error_mark_list
) = error_mark_node
;
6339 /* Make the binding_level structure for global names. */
6341 global_binding_level
= current_binding_level
;
6342 /* The global level is the namespace level of ::. */
6343 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6344 declare_namespace_level ();
6346 /* Define `int' and `char' first so that dbx will output them first. */
6347 record_builtin_type (RID_INT
, NULL_PTR
, integer_type_node
);
6348 record_builtin_type (RID_CHAR
, "char", char_type_node
);
6350 /* `signed' is the same as `int' */
6351 record_builtin_type (RID_SIGNED
, NULL_PTR
, integer_type_node
);
6352 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
6353 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
6354 record_builtin_type (CP_RID_MAX
, "long unsigned int",
6355 long_unsigned_type_node
);
6356 record_builtin_type (CP_RID_MAX
, "unsigned long", long_unsigned_type_node
);
6357 record_builtin_type (CP_RID_MAX
, "long long int",
6358 long_long_integer_type_node
);
6359 record_builtin_type (CP_RID_MAX
, "long long unsigned int",
6360 long_long_unsigned_type_node
);
6361 record_builtin_type (CP_RID_MAX
, "long long unsigned",
6362 long_long_unsigned_type_node
);
6363 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
6364 record_builtin_type (CP_RID_MAX
, "short unsigned int",
6365 short_unsigned_type_node
);
6366 record_builtin_type (CP_RID_MAX
, "unsigned short",
6367 short_unsigned_type_node
);
6370 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE
)));
6372 /* Define both `signed char' and `unsigned char'. */
6373 record_builtin_type (CP_RID_MAX
, "signed char", signed_char_type_node
);
6374 record_builtin_type (CP_RID_MAX
, "unsigned char", unsigned_char_type_node
);
6376 /* `unsigned long' is the standard type for sizeof.
6377 Note that stddef.h uses `unsigned long',
6378 and this must agree, even if long and int are the same size. */
6380 (TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE
))));
6382 /* Create the widest literal types. */
6383 widest_integer_literal_type_node
= make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
6384 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6385 widest_integer_literal_type_node
));
6387 widest_unsigned_literal_type_node
= make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
6388 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6389 widest_unsigned_literal_type_node
));
6391 /* These are types that type_for_size and type_for_mode use. */
6392 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intQI_type_node
));
6393 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intHI_type_node
));
6394 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intSI_type_node
));
6395 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intDI_type_node
));
6396 #if HOST_BITS_PER_WIDE_INT >= 64
6397 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__int128_t"), intTI_type_node
));
6399 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intQI_type_node
));
6400 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intHI_type_node
));
6401 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intSI_type_node
));
6402 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intDI_type_node
));
6403 #if HOST_BITS_PER_WIDE_INT >= 64
6404 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__uint128_t"), unsigned_intTI_type_node
));
6407 build_common_tree_nodes_2 (flag_short_double
);
6409 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6410 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6411 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6412 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6413 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6414 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6415 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6416 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6418 integer_two_node
= build_int_2 (2, 0);
6419 TREE_TYPE (integer_two_node
) = integer_type_node
;
6420 integer_three_node
= build_int_2 (3, 0);
6421 TREE_TYPE (integer_three_node
) = integer_type_node
;
6423 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6424 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6425 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6426 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6427 TYPE_PRECISION (boolean_type_node
) = 1;
6428 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6429 boolean_false_node
= build_int_2 (0, 0);
6430 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6431 boolean_true_node
= build_int_2 (1, 0);
6432 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6434 signed_size_zero_node
= build_int_2 (0, 0);
6435 record_builtin_type (RID_FLOAT
, NULL_PTR
, float_type_node
);
6436 record_builtin_type (RID_DOUBLE
, NULL_PTR
, double_type_node
);
6437 record_builtin_type (CP_RID_MAX
, "long double", long_double_type_node
);
6439 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex int"),
6440 complex_integer_type_node
));
6441 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex float"),
6442 complex_float_type_node
));
6443 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex double"),
6444 complex_double_type_node
));
6445 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
6446 complex_long_double_type_node
));
6448 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6450 record_builtin_type (RID_VOID
, NULL_PTR
, void_type_node
);
6451 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
6452 TREE_PARMLIST (void_list_node
) = 1;
6454 /* Used for expressions that do nothing, but are not errors. */
6455 void_zero_node
= build_int_2 (0, 0);
6456 TREE_TYPE (void_zero_node
) = void_type_node
;
6458 string_type_node
= build_pointer_type (char_type_node
);
6459 const_string_type_node
6460 = build_pointer_type (build_qualified_type (char_type_node
,
6462 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6464 record_builtin_type (CP_RID_MAX
, NULL_PTR
, string_type_node
);
6467 /* Make a type to be the domain of a few array types
6468 whose domains don't really matter.
6469 200 is small enough that it always fits in size_t. */
6470 array_domain_type
= build_index_type (build_int_2 (200, 0));
6472 /* Make a type for arrays of characters.
6473 With luck nothing will ever really depend on the length of this
6475 char_array_type_node
6476 = build_array_type (char_type_node
, array_domain_type
);
6478 /* Likewise for arrays of ints. */
6480 = build_array_type (integer_type_node
, array_domain_type
);
6483 delta_type_node
= ptrdiff_type_node
;
6484 else if (flag_huge_objects
)
6485 delta_type_node
= long_integer_type_node
;
6487 delta_type_node
= short_integer_type_node
;
6490 vtable_index_type
= ptrdiff_type_node
;
6492 vtable_index_type
= delta_type_node
;
6494 default_function_type
6495 = build_function_type (integer_type_node
, NULL_TREE
);
6497 ptr_type_node
= build_pointer_type (void_type_node
);
6499 = build_pointer_type (build_qualified_type (void_type_node
,
6501 vtt_parm_type
= build_pointer_type (const_ptr_type_node
);
6502 c_common_nodes_and_builtins (1, flag_no_builtin
, flag_no_nonansi_builtin
);
6503 lang_type_promotes_to
= convert_type_from_ellipsis
;
6506 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6508 /* C++ extensions */
6510 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6511 record_unknown_type (unknown_type_node
, "unknown type");
6513 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6514 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6516 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6518 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6520 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6521 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6523 /* This is special for C++ so functions can be overloaded. */
6524 wchar_type_node
= get_identifier (flag_short_wchar
6525 ? "short unsigned int"
6527 wchar_type_node
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (wchar_type_node
));
6528 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
6529 if (TREE_UNSIGNED (wchar_type_node
))
6530 wchar_type_node
= make_signed_type (wchar_type_size
);
6532 wchar_type_node
= make_unsigned_type (wchar_type_size
);
6533 record_builtin_type (RID_WCHAR
, "__wchar_t", wchar_type_node
);
6535 /* Artificial declaration of wchar_t -- can be bashed */
6536 wchar_decl_node
= build_decl (TYPE_DECL
, get_identifier ("wchar_t"),
6538 pushdecl (wchar_decl_node
);
6540 /* This is for wide string constants. */
6541 wchar_array_type_node
6542 = build_array_type (wchar_type_node
, array_domain_type
);
6544 if (flag_vtable_thunks
)
6546 /* Make sure we get a unique function type, so we can give
6547 its pointer type a name. (This wins for gdb.) */
6548 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6549 TREE_TYPE (vfunc_type
) = integer_type_node
;
6550 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6551 layout_type (vfunc_type
);
6553 vtable_entry_type
= build_pointer_type (vfunc_type
);
6557 vtable_entry_type
= make_aggr_type (RECORD_TYPE
);
6558 fields
[0] = build_decl (FIELD_DECL
, delta_identifier
,
6560 fields
[1] = build_decl (FIELD_DECL
, index_identifier
,
6562 fields
[2] = build_decl (FIELD_DECL
, pfn_identifier
,
6564 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6567 /* Make this part of an invisible union. */
6568 fields
[3] = copy_node (fields
[2]);
6569 TREE_TYPE (fields
[3]) = delta_type_node
;
6570 DECL_NAME (fields
[3]) = delta2_identifier
;
6571 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6572 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6573 DECL_SIZE_UNIT (fields
[3]) = TYPE_SIZE_UNIT (delta_type_node
);
6574 TREE_UNSIGNED (fields
[3]) = 0;
6575 TREE_CHAIN (fields
[2]) = fields
[3];
6576 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6579 record_builtin_type (CP_RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6582 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6583 layout_type (vtbl_type_node
);
6584 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6585 record_builtin_type (CP_RID_MAX
, NULL_PTR
, vtbl_type_node
);
6586 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6587 layout_type (vtbl_ptr_type_node
);
6588 record_builtin_type (CP_RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6590 std_node
= build_decl (NAMESPACE_DECL
,
6592 ? get_identifier ("fake std") : std_identifier
,
6594 pushdecl (std_node
);
6598 push_namespace (get_identifier ("__cxxabiv1"));
6599 abi_node
= current_namespace
;
6603 global_type_node
= make_node (LANG_TYPE
);
6604 record_unknown_type (global_type_node
, "global type");
6607 current_lang_name
= lang_name_cplusplus
;
6610 tree bad_alloc_type_node
, newtype
, deltype
;
6612 push_namespace (get_identifier ("std"));
6613 bad_alloc_type_node
= xref_tag
6614 (class_type_node
, get_identifier ("bad_alloc"), 1);
6617 newtype
= build_exception_variant
6618 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6619 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6620 push_cp_library_fn (NEW_EXPR
, newtype
);
6621 push_cp_library_fn (VEC_NEW_EXPR
, newtype
);
6622 global_delete_fndecl
= push_cp_library_fn (DELETE_EXPR
, deltype
);
6623 push_cp_library_fn (VEC_DELETE_EXPR
, deltype
);
6627 = build_library_fn_ptr ("__pure_virtual", void_ftype
);
6629 /* Perform other language dependent initializations. */
6630 init_class_processing ();
6631 init_init_processing ();
6632 init_search_processing ();
6633 init_rtti_processing ();
6635 if (flag_exceptions
)
6636 init_exception_processing ();
6639 flag_inline_functions
= 0;
6642 if (! supports_one_only ())
6645 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6646 make_fname_decl
= cp_make_fname_decl
;
6647 declare_function_name ();
6649 /* Prepare to check format strings against argument lists. */
6650 init_function_format_info ();
6652 /* Show we use EH for cleanups. */
6653 using_eh_for_cleanups ();
6655 print_error_function
= lang_print_error_function
;
6656 valid_lang_attribute
= cp_valid_lang_attribute
;
6658 /* Maintain consistency. Perhaps we should just complain if they
6659 say -fwritable-strings? */
6660 if (flag_writable_strings
)
6661 flag_const_strings
= 0;
6663 /* Add GC roots for all of our global variables. */
6664 ggc_add_tree_root (c_global_trees
, sizeof c_global_trees
/ sizeof(tree
));
6665 ggc_add_tree_root (cp_global_trees
, sizeof cp_global_trees
/ sizeof(tree
));
6666 ggc_add_tree_root (&integer_three_node
, 1);
6667 ggc_add_tree_root (&integer_two_node
, 1);
6668 ggc_add_tree_root (&signed_size_zero_node
, 1);
6669 ggc_add_tree_root (&size_one_node
, 1);
6670 ggc_add_tree_root (&size_zero_node
, 1);
6671 ggc_add_root (&global_binding_level
, 1, sizeof global_binding_level
,
6672 mark_binding_level
);
6673 ggc_add_root (&scope_chain
, 1, sizeof scope_chain
, &mark_saved_scope
);
6674 ggc_add_tree_root (&static_ctors
, 1);
6675 ggc_add_tree_root (&static_dtors
, 1);
6676 ggc_add_tree_root (&lastiddecl
, 1);
6678 ggc_add_tree_root (&last_function_parm_tags
, 1);
6679 ggc_add_tree_root (¤t_function_return_value
, 1);
6680 ggc_add_tree_root (¤t_function_parms
, 1);
6681 ggc_add_tree_root (¤t_function_parm_tags
, 1);
6682 ggc_add_tree_root (&last_function_parms
, 1);
6683 ggc_add_tree_root (&error_mark_list
, 1);
6685 ggc_add_tree_root (&global_namespace
, 1);
6686 ggc_add_tree_root (&global_type_node
, 1);
6687 ggc_add_tree_root (&anonymous_namespace_name
, 1);
6689 ggc_add_tree_root (&got_object
, 1);
6690 ggc_add_tree_root (&got_scope
, 1);
6692 ggc_add_tree_root (¤t_lang_name
, 1);
6693 ggc_add_tree_root (&static_aggregates
, 1);
6696 /* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the
6697 decl, NAME is the initialization string and TYPE_DEP indicates whether
6698 NAME depended on the type of the function. We make use of that to detect
6699 __PRETTY_FUNCTION__ inside a template fn. Because we build a tree for
6700 the function before emitting any of it, we don't need to treat the
6701 VAR_DECL specially. We can decide whether to emit it later, if it was
6705 cp_make_fname_decl (id
, name
, type_dep
)
6710 tree decl
, type
, init
;
6711 size_t length
= strlen (name
);
6712 tree domain
= NULL_TREE
;
6714 if (!processing_template_decl
)
6717 domain
= build_index_type (build_int_2 (length
, 0));
6719 type
= build_cplus_array_type
6720 (build_qualified_type (char_type_node
, TYPE_QUAL_CONST
),
6723 decl
= build_decl (VAR_DECL
, id
, type
);
6724 TREE_STATIC (decl
) = 1;
6725 TREE_READONLY (decl
) = 1;
6726 DECL_SOURCE_LINE (decl
) = 0;
6727 DECL_ARTIFICIAL (decl
) = 1;
6728 DECL_IN_SYSTEM_HEADER (decl
) = 1;
6730 if (processing_template_decl
)
6731 decl
= push_template_decl (decl
);
6734 init
= build (FUNCTION_NAME
, type
);
6735 DECL_PRETTY_FUNCTION_P (decl
) = 1;
6739 init
= build_string (length
+ 1, name
);
6740 TREE_TYPE (init
) = type
;
6742 DECL_INITIAL (decl
) = init
;
6743 cp_finish_decl (decl
, init
, NULL_TREE
, LOOKUP_ONLYCONVERTING
);
6745 /* We will have to make sure we only emit this, if it is actually used. */
6749 /* Function to print any language-specific context for an error message. */
6752 lang_print_error_function (file
)
6755 default_print_error_function (file
);
6756 maybe_print_template_context ();
6759 /* Entry point for the benefit of c_common_nodes_and_builtins.
6761 Make a definition for a builtin function named NAME and whose data type
6762 is TYPE. TYPE should be a function type with argument types.
6764 CLASS and CODE tell later passes how to compile calls to this function.
6765 See tree.h for possible values.
6767 If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6768 the name to be called if we can't opencode the function. */
6771 builtin_function (name
, type
, code
, class, libname
)
6775 enum built_in_class
class;
6776 const char *libname
;
6778 tree decl
= build_library_fn_1 (get_identifier (name
), ERROR_MARK
, type
);
6779 DECL_BUILT_IN_CLASS (decl
) = class;
6780 DECL_FUNCTION_CODE (decl
) = code
;
6782 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6784 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6785 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6786 function in the namespace. */
6789 DECL_ASSEMBLER_NAME (decl
) = get_identifier (libname
);
6790 make_function_rtl (decl
);
6792 /* Warn if a function in the namespace for users
6793 is used without an occasion to consider it declared. */
6794 if (name
[0] != '_' || name
[1] != '_')
6795 DECL_ANTICIPATED (decl
) = 1;
6800 /* Generate a FUNCTION_DECL with the typical flags for a runtime library
6801 function. Not called directly. */
6804 build_library_fn_1 (name
, operator_code
, type
)
6806 enum tree_code operator_code
;
6809 tree fn
= build_lang_decl (FUNCTION_DECL
, name
, type
);
6810 DECL_EXTERNAL (fn
) = 1;
6811 TREE_PUBLIC (fn
) = 1;
6812 DECL_ARTIFICIAL (fn
) = 1;
6813 TREE_NOTHROW (fn
) = 1;
6814 SET_OVERLOADED_OPERATOR_CODE (fn
, operator_code
);
6818 /* Returns the _DECL for a library function with C linkage.
6819 We assume that such functions never throw; if this is incorrect,
6820 callers should unset TREE_NOTHROW. */
6823 build_library_fn (name
, type
)
6827 tree fn
= build_library_fn_1 (name
, ERROR_MARK
, type
);
6828 make_function_rtl (fn
);
6832 /* Returns the _DECL for a library function with C++ linkage. */
6835 build_cp_library_fn (name
, operator_code
, type
)
6837 enum tree_code operator_code
;
6840 tree fn
= build_library_fn_1 (name
, operator_code
, type
);
6841 TREE_NOTHROW (fn
) = TYPE_NOTHROW_P (type
);
6842 DECL_CONTEXT (fn
) = FROB_CONTEXT (current_namespace
);
6843 set_mangled_name_for_decl (fn
);
6844 make_function_rtl (fn
);
6848 /* Like build_library_fn, but takes a C string instead of an
6852 build_library_fn_ptr (name
, type
)
6856 return build_library_fn (get_identifier (name
), type
);
6859 /* Like build_cp_library_fn, but takes a C string instead of an
6863 build_cp_library_fn_ptr (name
, type
)
6867 return build_cp_library_fn (get_identifier (name
), ERROR_MARK
, type
);
6870 /* Like build_library_fn, but also pushes the function so that we will
6871 be able to find it via IDENTIFIER_GLOBAL_VALUE. */
6874 push_library_fn (name
, type
)
6877 tree fn
= build_library_fn (name
, type
);
6878 pushdecl_top_level (fn
);
6882 /* Like build_cp_library_fn, but also pushes the function so that it
6883 will be found by normal lookup. */
6886 push_cp_library_fn (operator_code
, type
)
6887 enum tree_code operator_code
;
6890 tree fn
= build_cp_library_fn (ansi_opname (operator_code
),
6897 /* Like push_library_fn, but takes a TREE_LIST of parm types rather than
6901 push_void_library_fn (name
, parmtypes
)
6902 tree name
, parmtypes
;
6904 tree type
= build_function_type (void_type_node
, parmtypes
);
6905 return push_library_fn (name
, type
);
6908 /* Like push_library_fn, but also note that this function throws
6909 and does not return. Used for __throw_foo and the like. */
6912 push_throw_library_fn (name
, type
)
6915 tree fn
= push_library_fn (name
, type
);
6916 TREE_THIS_VOLATILE (fn
) = 1;
6917 TREE_NOTHROW (fn
) = 0;
6921 /* When we call finish_struct for an anonymous union, we create
6922 default copy constructors and such. But, an anonymous union
6923 shouldn't have such things; this function undoes the damage to the
6924 anonymous union type T.
6926 (The reason that we create the synthesized methods is that we don't
6927 distinguish `union { int i; }' from `typedef union { int i; } U'.
6928 The first is an anonymous union; the second is just an ordinary
6932 fixup_anonymous_aggr (t
)
6937 /* Wipe out memory of synthesized methods */
6938 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6939 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6940 TYPE_HAS_INIT_REF (t
) = 0;
6941 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6942 TYPE_HAS_ASSIGN_REF (t
) = 0;
6943 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6945 /* Splice the implicitly generated functions out of the TYPE_METHODS
6947 q
= &TYPE_METHODS (t
);
6950 if (DECL_ARTIFICIAL (*q
))
6951 *q
= TREE_CHAIN (*q
);
6953 q
= &TREE_CHAIN (*q
);
6956 /* ISO C++ 9.5.3. Anonymous unions may not have function members. */
6957 if (TYPE_METHODS (t
))
6958 error ("an anonymous union cannot have function members");
6961 /* Make sure that a declaration with no declarator is well-formed, i.e.
6962 just defines a tagged type or anonymous union.
6964 Returns the type defined, if any. */
6967 check_tag_decl (declspecs
)
6972 tree ob_modifier
= NULL_TREE
;
6974 register tree t
= NULL_TREE
;
6976 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6978 register tree value
= TREE_VALUE (link
);
6981 || (TREE_CODE (value
) == IDENTIFIER_NODE
6982 && IDENTIFIER_GLOBAL_VALUE (value
)
6983 && TYPE_P (IDENTIFIER_GLOBAL_VALUE (value
))))
6987 if ((TREE_CODE (value
) != TYPENAME_TYPE
&& IS_AGGR_TYPE (value
))
6988 || TREE_CODE (value
) == ENUMERAL_TYPE
)
6990 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6994 else if (value
== ridpointers
[(int) RID_FRIEND
])
6996 if (current_class_type
== NULL_TREE
6997 || current_scope () != current_class_type
)
6998 ob_modifier
= value
;
7002 else if (value
== ridpointers
[(int) RID_STATIC
]
7003 || value
== ridpointers
[(int) RID_EXTERN
]
7004 || value
== ridpointers
[(int) RID_AUTO
]
7005 || value
== ridpointers
[(int) RID_REGISTER
]
7006 || value
== ridpointers
[(int) RID_INLINE
]
7007 || value
== ridpointers
[(int) RID_VIRTUAL
]
7008 || value
== ridpointers
[(int) RID_CONST
]
7009 || value
== ridpointers
[(int) RID_VOLATILE
]
7010 || value
== ridpointers
[(int) RID_EXPLICIT
])
7011 ob_modifier
= value
;
7015 error ("multiple types in one declaration");
7017 if (t
== NULL_TREE
&& ! saw_friend
)
7018 pedwarn ("declaration does not declare anything");
7020 /* Check for an anonymous union. We're careful
7021 accessing TYPE_IDENTIFIER because some built-in types, like
7022 pointer-to-member types, do not have TYPE_NAME. */
7023 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
7025 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
7027 /* Anonymous unions are objects, so they can have specifiers. */;
7028 SET_ANON_AGGR_TYPE_P (t
);
7030 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
7031 pedwarn ("ISO C++ prohibits anonymous structs");
7034 else if (ob_modifier
)
7036 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
7037 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
7038 cp_error ("`%D' can only be specified for functions", ob_modifier
);
7039 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
7040 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
7041 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
7042 cp_error ("`%D' can only be specified for constructors",
7045 cp_error ("`%D' can only be specified for objects and functions",
7052 /* Called when a declaration is seen that contains no names to declare.
7053 If its type is a reference to a structure, union or enum inherited
7054 from a containing scope, shadow that tag name for the current scope
7055 with a forward reference.
7056 If its type defines a new named structure or union
7057 or defines an enum, it is valid but we need not do anything here.
7058 Otherwise, it is an error.
7060 C++: may have to grok the declspecs to learn about static,
7061 complain for anonymous unions. */
7064 shadow_tag (declspecs
)
7067 tree t
= check_tag_decl (declspecs
);
7070 maybe_process_partial_specialization (t
);
7072 /* This is where the variables in an anonymous union are
7073 declared. An anonymous union declaration looks like:
7075 because there is no declarator after the union, the parser
7076 sends that declaration here. */
7077 if (t
&& ANON_AGGR_TYPE_P (t
))
7079 fixup_anonymous_aggr (t
);
7081 if (TYPE_FIELDS (t
))
7083 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
7085 finish_anon_union (decl
);
7090 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
7093 groktypename (typename
)
7096 if (TREE_CODE (typename
) != TREE_LIST
)
7098 return grokdeclarator (TREE_VALUE (typename
),
7099 TREE_PURPOSE (typename
),
7100 TYPENAME
, 0, NULL_TREE
);
7103 /* Decode a declarator in an ordinary declaration or data definition.
7104 This is called as soon as the type information and variable name
7105 have been parsed, before parsing the initializer if any.
7106 Here we create the ..._DECL node, fill in its type,
7107 and put it on the list of decls for the current context.
7108 The ..._DECL node is returned as the value.
7110 Exception: for arrays where the length is not specified,
7111 the type is left null, to be filled in by `cp_finish_decl'.
7113 Function definitions do not come here; they go to start_function
7114 instead. However, external and forward declarations of functions
7115 do go through here. Structure field declarations are done by
7116 grokfield and not through here. */
7119 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
7120 tree declarator
, declspecs
;
7122 tree attributes
, prefix_attributes
;
7125 register tree type
, tem
;
7127 extern int have_extern_spec
;
7128 extern int used_extern_spec
;
7132 /* See code below that used this. */
7133 int init_written
= initialized
;
7136 /* This should only be done once on the top most decl. */
7137 if (have_extern_spec
&& !used_extern_spec
)
7139 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"),
7141 used_extern_spec
= 1;
7144 if (attributes
|| prefix_attributes
)
7145 attrlist
= build_tree_list (attributes
, prefix_attributes
);
7147 attrlist
= NULL_TREE
;
7149 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
7152 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
7155 type
= TREE_TYPE (decl
);
7157 if (type
== error_mark_node
)
7160 context
= DECL_CONTEXT (decl
);
7162 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
7163 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
7165 /* When parsing the initializer, lookup should use the object's
7167 push_decl_namespace (context
);
7170 /* We are only interested in class contexts, later. */
7171 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
7172 context
= NULL_TREE
;
7175 /* Is it valid for this decl to have an initializer at all?
7176 If not, set INITIALIZED to zero, which will indirectly
7177 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7178 switch (TREE_CODE (decl
))
7181 /* typedef foo = bar means give foo the same type as bar.
7182 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
7183 Any other case of an initialization in a TYPE_DECL is an error. */
7184 if (pedantic
|| list_length (declspecs
) > 1)
7186 cp_error ("typedef `%D' is initialized", decl
);
7192 cp_error ("function `%#D' is initialized like a variable", decl
);
7202 if (! toplevel_bindings_p ()
7203 && DECL_EXTERNAL (decl
))
7204 cp_warning ("declaration of `%#D' has `extern' and is initialized",
7206 DECL_EXTERNAL (decl
) = 0;
7207 if (toplevel_bindings_p ())
7208 TREE_STATIC (decl
) = 1;
7210 /* Tell `pushdecl' this is an initialized decl
7211 even though we don't yet have the initializer expression.
7212 Also tell `cp_finish_decl' it may store the real initializer. */
7213 DECL_INITIAL (decl
) = error_mark_node
;
7216 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
7217 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
7220 /* Set attributes here so if duplicate decl, will have proper attributes. */
7221 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
7223 if (context
&& COMPLETE_TYPE_P (complete_type (context
)))
7225 push_nested_class (context
, 2);
7227 if (TREE_CODE (decl
) == VAR_DECL
)
7229 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
7230 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
7231 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
7234 if (DECL_CONTEXT (field
) != context
)
7236 cp_pedwarn ("ISO C++ does not permit `%T::%D' to be defined as `%T::%D'",
7237 DECL_CONTEXT (field
), DECL_NAME (decl
),
7238 context
, DECL_NAME (decl
));
7239 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
7241 /* Static data member are tricky; an in-class initialization
7242 still doesn't provide a definition, so the in-class
7243 declaration will have DECL_EXTERNAL set, but will have an
7244 initialization. Thus, duplicate_decls won't warn
7245 about this situation, and so we check here. */
7246 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
7247 cp_error ("duplicate initialization of %D", decl
);
7248 if (duplicate_decls (decl
, field
))
7254 tree field
= check_classfn (context
, decl
);
7255 if (field
&& duplicate_decls (decl
, field
))
7259 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
7260 DECL_IN_AGGR_P (decl
) = 0;
7261 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
7262 || CLASSTYPE_TEMPLATE_INSTANTIATION (context
))
7264 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
7265 /* [temp.expl.spec] An explicit specialization of a static data
7266 member of a template is a definition if the declaration
7267 includes an initializer; otherwise, it is a declaration.
7269 We check for processing_specialization so this only applies
7270 to the new specialization syntax. */
7271 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
7272 DECL_EXTERNAL (decl
) = 1;
7275 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
7276 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
7280 /* Enter this declaration into the symbol table. */
7281 tem
= maybe_push_decl (decl
);
7283 if (processing_template_decl
)
7284 tem
= push_template_decl (tem
);
7286 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7287 /* Tell the back-end to use or not use .common as appropriate. If we say
7288 -fconserve-space, we want this to save .data space, at the expense of
7289 wrong semantics. If we say -fno-conserve-space, we want this to
7290 produce errors about redefs; to do this we force variables into the
7292 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
7295 if (! processing_template_decl
)
7305 tree type
= TREE_TYPE (decl
);
7306 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
7308 if (type
== error_mark_node
)
7311 /* If this type of object needs a cleanup, but we're not allowed to
7312 add any more objects with cleanups to the current scope, create a
7313 new binding level. */
7314 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
7315 && current_binding_level
->more_cleanups_ok
== 0)
7317 keep_next_level (2);
7320 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/1);
7324 /* Is it valid for this decl to have an initializer at all?
7325 If not, set INITIALIZED to zero, which will indirectly
7326 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7328 /* Don't allow initializations for incomplete types except for
7329 arrays which might be completed by the initialization. */
7330 if (COMPLETE_TYPE_P (complete_type (type
)))
7331 ; /* A complete type is ok. */
7332 else if (TREE_CODE (type
) != ARRAY_TYPE
)
7334 cp_error ("variable `%#D' has initializer but incomplete type",
7337 type
= TREE_TYPE (decl
) = error_mark_node
;
7339 else if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (type
))))
7341 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
7342 cp_error ("elements of array `%#D' have incomplete type", decl
);
7343 /* else we already gave an error in start_decl. */
7349 && TREE_CODE (decl
) != TYPE_DECL
7350 && TREE_CODE (decl
) != TEMPLATE_DECL
7351 && type
!= error_mark_node
7352 && IS_AGGR_TYPE (type
)
7353 && ! DECL_EXTERNAL (decl
))
7355 if ((! processing_template_decl
|| ! uses_template_parms (type
))
7356 && !COMPLETE_TYPE_P (complete_type (type
)))
7358 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
7360 /* Change the type so that assemble_variable will give
7361 DECL an rtl we can live with: (mem (const_int 0)). */
7362 type
= TREE_TYPE (decl
) = error_mark_node
;
7366 /* If any base type in the hierarchy of TYPE needs a constructor,
7367 then we set initialized to 1. This way any nodes which are
7368 created for the purposes of initializing this aggregate
7369 will live as long as it does. This is necessary for global
7370 aggregates which do not have their initializers processed until
7371 the end of the file. */
7372 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
7377 DECL_INITIAL (decl
) = NULL_TREE
;
7380 /* Handle initialization of references.
7381 These three arguments are from `cp_finish_decl', and have the
7382 same meaning here that they do there.
7384 Quotes on semantics can be found in ARM 8.4.3. */
7387 grok_reference_init (decl
, type
, init
)
7388 tree decl
, type
, init
;
7392 if (init
== NULL_TREE
)
7394 if ((DECL_LANG_SPECIFIC (decl
) == 0
7395 || DECL_IN_AGGR_P (decl
) == 0)
7396 && ! DECL_THIS_EXTERN (decl
))
7397 cp_error ("`%D' declared as reference but not initialized", decl
);
7401 if (init
== error_mark_node
)
7404 if (TREE_CODE (init
) == CONSTRUCTOR
)
7406 cp_error ("ISO C++ forbids use of initializer list to initialize reference `%D'", decl
);
7410 if (TREE_CODE (init
) == TREE_LIST
)
7411 init
= build_compound_expr (init
);
7413 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
7414 init
= convert_from_reference (init
);
7416 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
7417 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
7419 /* Note: default conversion is only called in very special cases. */
7420 init
= default_conversion (init
);
7423 /* Convert INIT to the reference type TYPE. This may involve the
7424 creation of a temporary, whose lifetime must be the same as that
7425 of the reference. If so, a DECL_STMT for the temporary will be
7426 added just after the DECL_STMT for DECL. That's why we don't set
7427 DECL_INITIAL for local references (instead assigning to them
7428 explicitly); we need to allow the temporary to be initialized
7430 tmp
= convert_to_reference
7431 (type
, init
, CONV_IMPLICIT
,
7432 LOOKUP_ONLYCONVERTING
|LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
,
7435 if (tmp
== error_mark_node
)
7437 else if (tmp
!= NULL_TREE
)
7440 tmp
= save_expr (tmp
);
7441 if (building_stmt_tree ())
7443 /* Initialize the declaration. */
7444 tmp
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, tmp
);
7445 finish_expr_stmt (tmp
);
7448 DECL_INITIAL (decl
) = tmp
;
7452 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7456 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
7458 expand_static_init (decl
, DECL_INITIAL (decl
));
7459 DECL_INITIAL (decl
) = NULL_TREE
;
7464 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7465 mucking with forces it does not comprehend (i.e. initialization with a
7466 constructor). If we are at global scope and won't go into COMMON, fill
7467 it in with a dummy CONSTRUCTOR to force the variable into .data;
7468 otherwise we can use error_mark_node. */
7471 obscure_complex_init (decl
, init
)
7474 if (! flag_no_inline
&& TREE_STATIC (decl
))
7476 if (extract_init (decl
, init
))
7480 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7481 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7482 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7486 DECL_INITIAL (decl
) = error_mark_node
;
7491 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7492 array until we finish parsing the initializer. If that's the
7493 situation we're in, update DECL accordingly. */
7496 maybe_deduce_size_from_array_init (decl
, init
)
7500 tree type
= TREE_TYPE (decl
);
7502 if (TREE_CODE (type
) == ARRAY_TYPE
7503 && TYPE_DOMAIN (type
) == NULL_TREE
7504 && TREE_CODE (decl
) != TYPE_DECL
)
7507 = (TREE_STATIC (decl
)
7508 /* Even if pedantic, an external linkage array
7509 may have incomplete type at first. */
7510 ? pedantic
&& ! DECL_EXTERNAL (decl
)
7511 : !DECL_EXTERNAL (decl
));
7512 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7513 int failure
= complete_array_type (type
, initializer
, do_default
);
7516 cp_error ("initializer fails to determine size of `%D'", decl
);
7521 cp_error ("array size missing in `%D'", decl
);
7522 /* If a `static' var's size isn't known, make it extern as
7523 well as static, so it does not get allocated. If it's not
7524 `static', then don't mark it extern; finish_incomplete_decl
7525 will give it a default size and it will get allocated. */
7526 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7527 DECL_EXTERNAL (decl
) = 1;
7530 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7531 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7533 cp_error ("zero-size array `%D'", decl
);
7535 layout_decl (decl
, 0);
7539 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7540 any appropriate error messages regarding the layout. */
7543 layout_var_decl (decl
)
7546 tree type
= TREE_TYPE (decl
);
7548 tree ttype
= target_type (type
);
7551 /* If we haven't already layed out this declaration, do so now.
7552 Note that we must not call complete type for an external object
7553 because it's type might involve templates that we are not
7554 supposed to isntantiate yet. (And it's perfectly legal to say
7555 `extern X x' for some incomplete type `X'.) */
7556 if (!DECL_EXTERNAL (decl
))
7557 complete_type (type
);
7558 if (!DECL_SIZE (decl
) && COMPLETE_TYPE_P (type
))
7559 layout_decl (decl
, 0);
7561 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7563 /* An automatic variable with an incomplete type: that is an error.
7564 Don't talk about array types here, since we took care of that
7565 message in grokdeclarator. */
7566 cp_error ("storage size of `%D' isn't known", decl
);
7567 TREE_TYPE (decl
) = error_mark_node
;
7570 /* Keep this code around in case we later want to control debug info
7571 based on whether a type is "used". (jason 1999-11-11) */
7573 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7574 /* Let debugger know it should output info for this type. */
7575 note_debug_info_needed (ttype
);
7577 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7578 note_debug_info_needed (DECL_CONTEXT (decl
));
7581 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7582 && DECL_SIZE (decl
) != NULL_TREE
7583 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7585 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7586 constant_expression_warning (DECL_SIZE (decl
));
7588 cp_error ("storage size of `%D' isn't constant", decl
);
7592 /* If a local static variable is declared in an inline function, or if
7593 we have a weak definition, we must endeavor to create only one
7594 instance of the variable at link-time. */
7597 maybe_commonize_var (decl
)
7600 /* Static data in a function with comdat linkage also has comdat
7602 if (TREE_STATIC (decl
)
7603 /* Don't mess with __FUNCTION__. */
7604 && ! DECL_ARTIFICIAL (decl
)
7605 && current_function_decl
7606 && DECL_CONTEXT (decl
) == current_function_decl
7607 && (DECL_THIS_INLINE (current_function_decl
)
7608 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7609 && TREE_PUBLIC (current_function_decl
))
7611 /* Rather than try to get this right with inlining, we suppress
7612 inlining of such functions. */
7613 current_function_cannot_inline
7614 = "function with static variable cannot be inline";
7616 /* If flag_weak, we don't need to mess with this, as we can just
7617 make the function weak, and let it refer to its unique local
7618 copy. This works because we don't allow the function to be
7622 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7624 TREE_PUBLIC (decl
) = 1;
7625 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7627 else if (DECL_INITIAL (decl
) == NULL_TREE
7628 || DECL_INITIAL (decl
) == error_mark_node
)
7630 TREE_PUBLIC (decl
) = 1;
7631 DECL_COMMON (decl
) = 1;
7633 /* else we lose. We can only do this if we can use common,
7634 which we can't if it has been initialized. */
7636 if (TREE_PUBLIC (decl
))
7637 DECL_ASSEMBLER_NAME (decl
)
7638 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7641 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7642 cp_warning_at (" you can work around this by removing the initializer", decl
);
7646 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7647 /* Set it up again; we might have set DECL_INITIAL since the last
7649 comdat_linkage (decl
);
7652 /* Issue an error message if DECL is an uninitialized const variable. */
7655 check_for_uninitialized_const_var (decl
)
7658 tree type
= TREE_TYPE (decl
);
7660 /* ``Unless explicitly declared extern, a const object does not have
7661 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7663 if (TREE_CODE (decl
) == VAR_DECL
7664 && TREE_CODE (type
) != REFERENCE_TYPE
7665 && CP_TYPE_CONST_P (type
)
7666 && !TYPE_NEEDS_CONSTRUCTING (type
)
7667 && !DECL_INITIAL (decl
))
7668 cp_error ("uninitialized const `%D'", decl
);
7671 /* Verify INIT (the initializer for DECL), and record the
7672 initialization in DECL_INITIAL, if appropriate. Returns a new
7676 check_initializer (decl
, init
)
7682 if (TREE_CODE (decl
) == FIELD_DECL
)
7685 type
= TREE_TYPE (decl
);
7687 /* If `start_decl' didn't like having an initialization, ignore it now. */
7688 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7691 /* Check the initializer. */
7694 /* Things that are going to be initialized need to have complete
7696 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7698 if (type
== error_mark_node
)
7699 /* We will have already complained. */
7701 else if (COMPLETE_TYPE_P (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7703 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7706 else if (TREE_CODE (type
) == ARRAY_TYPE
7707 && !COMPLETE_TYPE_P (TREE_TYPE (type
)))
7709 cp_error ("elements of array `%#D' have incomplete type", decl
);
7712 else if (!COMPLETE_TYPE_P (type
))
7714 cp_error ("`%D' has incomplete type", decl
);
7715 TREE_TYPE (decl
) = error_mark_node
;
7720 if (TREE_CODE (decl
) == CONST_DECL
)
7722 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7724 DECL_INITIAL (decl
) = init
;
7726 /* This will keep us from needing to worry about our obstacks. */
7727 my_friendly_assert (init
!= NULL_TREE
, 149);
7730 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7732 if (TREE_STATIC (decl
))
7733 make_decl_rtl (decl
, NULL_PTR
, toplevel_bindings_p ());
7734 grok_reference_init (decl
, type
, init
);
7739 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7741 if (TREE_CODE (type
) == ARRAY_TYPE
)
7742 init
= digest_init (type
, init
, (tree
*) 0);
7743 else if (TREE_CODE (init
) == CONSTRUCTOR
7744 && TREE_HAS_CONSTRUCTOR (init
))
7746 if (TYPE_NON_AGGREGATE_CLASS (type
))
7748 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7750 init
= error_mark_node
;
7753 goto dont_use_constructor
;
7758 dont_use_constructor
:
7759 if (TREE_CODE (init
) != TREE_VEC
)
7760 init
= store_init_value (decl
, init
);
7764 /* We must hide the initializer so that expand_decl
7765 won't try to do something it does not understand. */
7766 init
= obscure_complex_init (decl
, init
);
7768 else if (DECL_EXTERNAL (decl
))
7770 else if (TYPE_P (type
)
7771 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7773 tree core_type
= strip_array_types (type
);
7775 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7777 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7778 cp_error ("structure `%D' with uninitialized const members", decl
);
7779 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7780 cp_error ("structure `%D' with uninitialized reference members",
7784 check_for_uninitialized_const_var (decl
);
7786 if (COMPLETE_TYPE_P (type
) && TYPE_NEEDS_CONSTRUCTING (type
))
7787 init
= obscure_complex_init (decl
, NULL_TREE
);
7791 check_for_uninitialized_const_var (decl
);
7796 /* If DECL is not a local variable, give it RTL. */
7799 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
7802 const char *asmspec
;
7804 int toplev
= toplevel_bindings_p ();
7807 /* Handle non-variables up front. */
7808 if (TREE_CODE (decl
) != VAR_DECL
)
7810 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7814 /* If we see a class member here, it should be a static data
7816 if (DECL_LANG_SPECIFIC (decl
) && DECL_IN_AGGR_P (decl
))
7818 my_friendly_assert (TREE_STATIC (decl
), 19990828);
7819 /* An in-class declaration of a static data member should be
7820 external; it is only a declaration, and not a definition. */
7821 if (init
== NULL_TREE
)
7822 my_friendly_assert (DECL_EXTERNAL (decl
), 20000723);
7825 /* Set the DECL_ASSEMBLER_NAME for the variable. */
7827 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7829 /* We don't create any RTL for local variables. */
7830 if (DECL_FUNCTION_SCOPE_P (decl
) && !TREE_STATIC (decl
))
7833 /* We defer emission of local statics until the corresponding
7834 DECL_STMT is expanded. */
7835 defer_p
= DECL_FUNCTION_SCOPE_P (decl
) || DECL_VIRTUAL_P (decl
);
7837 /* We try to defer namespace-scope static constants so that they are
7838 not emitted into the object file unncessarily. */
7839 if (!DECL_VIRTUAL_P (decl
)
7840 && TREE_READONLY (decl
)
7841 && DECL_INITIAL (decl
) != NULL_TREE
7842 && DECL_INITIAL (decl
) != error_mark_node
7843 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
))
7845 && !TREE_PUBLIC (decl
))
7847 /* Fool with the linkage according to #pragma interface. */
7848 if (!interface_unknown
)
7850 TREE_PUBLIC (decl
) = 1;
7851 DECL_EXTERNAL (decl
) = interface_only
;
7857 /* If we're deferring the variable, just make RTL. Do not actually
7858 emit the variable. */
7860 make_decl_rtl (decl
, asmspec
, toplev
);
7861 /* If we're not deferring, go ahead and assemble the variable. */
7863 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7866 /* The old ARM scoping rules injected variables declared in the
7867 initialization statement of a for-statement into the surrounding
7868 scope. We support this usage, in order to be backward-compatible.
7869 DECL is a just-declared VAR_DECL; if necessary inject its
7870 declaration into the surrounding scope. */
7873 maybe_inject_for_scope_var (decl
)
7876 if (!DECL_NAME (decl
))
7879 if (current_binding_level
->is_for_scope
)
7881 struct binding_level
*outer
7882 = current_binding_level
->level_chain
;
7884 /* Check to see if the same name is already bound at the outer
7885 level, either because it was directly declared, or because a
7886 dead for-decl got preserved. In either case, the code would
7887 not have been valid under the ARM scope rules, so clear
7888 is_for_scope for the current_binding_level.
7890 Otherwise, we need to preserve the temp slot for decl to last
7891 into the outer binding level. */
7894 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7896 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7897 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7899 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7901 BINDING_VALUE (outer_binding
)
7902 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7903 current_binding_level
->is_for_scope
= 0;
7905 else if (DECL_IN_MEMORY_P (decl
))
7906 preserve_temp_slots (DECL_RTL (decl
));
7910 /* Generate code to initialize DECL (a local variable). */
7913 initialize_local_var (decl
, init
, flags
)
7918 tree type
= TREE_TYPE (decl
);
7920 /* If the type is bogus, don't bother initializing the variable. */
7921 if (type
== error_mark_node
)
7924 if (DECL_SIZE (decl
) == NULL_TREE
&& !TREE_STATIC (decl
))
7926 /* If we used it already as memory, it must stay in memory. */
7927 DECL_INITIAL (decl
) = NULL_TREE
;
7928 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7931 /* Local statics are handled differently from ordinary automatic
7933 if (TREE_STATIC (decl
))
7935 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7936 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7937 expand_static_init (decl
, init
);
7941 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7945 /* Compute and store the initial value. */
7946 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7948 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7950 int saved_stmts_are_full_exprs_p
;
7952 emit_line_note (DECL_SOURCE_FILE (decl
),
7953 DECL_SOURCE_LINE (decl
));
7954 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p ();
7955 current_stmt_tree
->stmts_are_full_exprs_p
= 1;
7956 if (building_stmt_tree ())
7957 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7959 genrtl_expr_stmt (build_aggr_init (decl
, init
, flags
));
7960 current_stmt_tree
->stmts_are_full_exprs_p
= saved_stmts_are_full_exprs_p
;
7963 /* Set this to 0 so we can tell whether an aggregate which was
7964 initialized was ever used. Don't do this if it has a
7965 destructor, so we don't complain about the 'resource
7966 allocation is initialization' idiom. Now set
7967 attribute((unused)) on types so decls of that type will be
7968 marked used. (see TREE_USED, above.) */
7969 if (TYPE_NEEDS_CONSTRUCTING (type
)
7971 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type
)
7972 && DECL_NAME (decl
))
7973 TREE_USED (decl
) = 0;
7974 else if (already_used
)
7975 TREE_USED (decl
) = 1;
7979 /* Generate code to destroy DECL (a local variable). */
7982 destroy_local_var (decl
)
7985 tree type
= TREE_TYPE (decl
);
7988 /* Only variables get cleaned up. */
7989 if (TREE_CODE (decl
) != VAR_DECL
)
7992 /* And only things with destructors need cleaning up. */
7993 if (type
== error_mark_node
7994 || TYPE_HAS_TRIVIAL_DESTRUCTOR (type
))
7997 if (TREE_CODE (decl
) == VAR_DECL
&&
7998 (DECL_EXTERNAL (decl
) || TREE_STATIC (decl
)))
7999 /* We don't clean up things that aren't defined in this
8000 translation unit, or that need a static cleanup. The latter
8001 are handled by finish_file. */
8004 /* Compute the cleanup. */
8005 cleanup
= maybe_build_cleanup (decl
);
8007 /* Record the cleanup required for this declaration. */
8008 if (DECL_SIZE (decl
) && TREE_TYPE (decl
) != error_mark_node
8010 finish_decl_cleanup (decl
, cleanup
);
8013 /* Finish processing of a declaration;
8014 install its line number and initial value.
8015 If the length of an array type is not known before,
8016 it must be determined now, from the initial value, or it is an error.
8018 INIT holds the value of an initializer that should be allowed to escape
8021 FLAGS is LOOKUP_ONLYCONVERTING if the = init syntax was used, else 0
8022 if the (init) syntax was used. */
8025 cp_finish_decl (decl
, init
, asmspec_tree
, flags
)
8031 tree ttype
= NULL_TREE
;
8032 const char *asmspec
= NULL
;
8033 int was_readonly
= 0;
8038 error ("assignment (not initialization) in declaration");
8042 /* If a name was specified, get the string. */
8044 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
8046 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
8048 cp_error ("cannot initialize `%D' to namespace `%D'",
8053 if (current_class_type
8054 && CP_DECL_CONTEXT (decl
) == current_class_type
8055 && TYPE_BEING_DEFINED (current_class_type
)
8056 && (DECL_INITIAL (decl
) || init
))
8057 DECL_DEFINED_IN_CLASS_P (decl
) = 1;
8059 if (TREE_CODE (decl
) == VAR_DECL
8060 && DECL_CONTEXT (decl
)
8061 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
8062 && DECL_CONTEXT (decl
) != current_namespace
8065 /* Leave the namespace of the object. */
8066 pop_decl_namespace ();
8069 type
= TREE_TYPE (decl
);
8071 if (type
== error_mark_node
)
8074 /* Add this declaration to the statement-tree. */
8075 if (building_stmt_tree () && at_function_scope_p ())
8076 add_decl_stmt (decl
);
8078 if (TYPE_HAS_MUTABLE_P (type
))
8079 TREE_READONLY (decl
) = 0;
8081 if (processing_template_decl
)
8083 if (init
&& DECL_INITIAL (decl
))
8084 DECL_INITIAL (decl
) = init
;
8088 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
8089 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
8091 /* Take care of TYPE_DECLs up front. */
8092 if (TREE_CODE (decl
) == TYPE_DECL
)
8094 if (init
&& DECL_INITIAL (decl
))
8096 /* typedef foo = bar; store the type of bar as the type of foo. */
8097 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
8098 DECL_INITIAL (decl
) = init
= NULL_TREE
;
8100 if (type
!= error_mark_node
8101 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
8103 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
8104 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
8105 set_identifier_type_value (DECL_NAME (decl
), type
);
8106 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
8108 GNU_xref_decl (current_function_decl
, decl
);
8110 /* If we have installed this as the canonical typedef for this
8111 type, and that type has not been defined yet, delay emitting
8112 the debug information for it, as we will emit it later. */
8113 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
8114 && !COMPLETE_TYPE_P (TREE_TYPE (decl
)))
8115 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
8117 rest_of_decl_compilation (decl
, NULL_PTR
,
8118 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
8122 if (TREE_CODE (decl
) != FUNCTION_DECL
)
8123 ttype
= target_type (type
);
8125 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
8126 && TYPE_NEEDS_CONSTRUCTING (type
))
8128 /* Currently, GNU C++ puts constants in text space, making them
8129 impossible to initialize. In the future, one would hope for
8130 an operating system which understood the difference between
8131 initialization and the running of a program. */
8133 TREE_READONLY (decl
) = 0;
8136 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
8138 /* This must override the asm specifier which was placed by
8139 grokclassfn. Lay this out fresh. */
8140 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
8141 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
8142 make_decl_rtl (decl
, asmspec
, 0);
8145 /* Deduce size of array from initialization, if not already known. */
8146 maybe_deduce_size_from_array_init (decl
, init
);
8147 init
= check_initializer (decl
, init
);
8149 GNU_xref_decl (current_function_decl
, decl
);
8151 if (TREE_CODE (decl
) == VAR_DECL
)
8152 layout_var_decl (decl
);
8154 /* Output the assembler code and/or RTL code for variables and functions,
8155 unless the type is an undefined structure or union.
8156 If not, it will get done when the type is completed. */
8157 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
8158 || TREE_CODE (decl
) == RESULT_DECL
)
8160 if (TREE_CODE (decl
) == VAR_DECL
)
8161 maybe_commonize_var (decl
);
8163 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
8165 if (TREE_CODE (type
) == FUNCTION_TYPE
8166 || TREE_CODE (type
) == METHOD_TYPE
)
8167 abstract_virtuals_error (decl
,
8168 strip_array_types (TREE_TYPE (type
)));
8170 abstract_virtuals_error (decl
, strip_array_types (type
));
8172 if (TREE_CODE (decl
) == FUNCTION_DECL
)
8174 else if (DECL_EXTERNAL (decl
)
8175 && ! (DECL_LANG_SPECIFIC (decl
)
8176 && DECL_NOT_REALLY_EXTERN (decl
)))
8179 DECL_INITIAL (decl
) = init
;
8181 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
8183 /* This is a local declaration. */
8184 if (doing_semantic_analysis_p ())
8185 maybe_inject_for_scope_var (decl
);
8186 /* Initialize the local variable. But, if we're building a
8187 statement-tree, we'll do the initialization when we
8189 if (processing_template_decl
)
8191 if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
8192 DECL_INITIAL (decl
) = init
;
8196 /* If we're not building RTL, then we need to do so
8198 if (!building_stmt_tree ())
8199 emit_local_var (decl
);
8200 /* Initialize the variable. */
8201 initialize_local_var (decl
, init
, flags
);
8202 /* Clean up the variable. */
8203 destroy_local_var (decl
);
8206 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
8208 /* Cleanups for static variables are handled by `finish_file'. */
8209 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
8210 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
8211 expand_static_init (decl
, init
);
8215 /* Undo call to `pushclass' that was done in `start_decl'
8216 due to initialization of qualified member variable.
8217 I.e., Foo::x = 10; */
8219 tree context
= CP_DECL_CONTEXT (decl
);
8222 && (TREE_CODE (decl
) == VAR_DECL
8223 /* We also have a pushclass done that we need to undo here
8224 if we're at top level and declare a method. */
8225 || TREE_CODE (decl
) == FUNCTION_DECL
)
8226 /* If size hasn't been set, we're still defining it,
8227 and therefore inside the class body; don't pop
8228 the binding level.. */
8229 && COMPLETE_TYPE_P (context
)
8230 && context
== current_class_type
)
8231 pop_nested_class ();
8238 TREE_READONLY (decl
) = 1;
8241 /* This is here for a midend callback from c-common.c */
8244 finish_decl (decl
, init
, asmspec_tree
)
8248 cp_finish_decl (decl
, init
, asmspec_tree
, 0);
8251 /* Returns a declaration for a VAR_DECL as if:
8253 extern "C" TYPE NAME;
8255 had been seen. Used to create compiler-generated global
8259 declare_global_var (name
, type
)
8265 push_to_top_level ();
8266 decl
= build_decl (VAR_DECL
, name
, type
);
8267 TREE_PUBLIC (decl
) = 1;
8268 DECL_EXTERNAL (decl
) = 1;
8269 DECL_ARTIFICIAL (decl
) = 1;
8271 cp_finish_decl (decl
, NULL_TREE
, NULL_TREE
, 0);
8272 pop_from_top_level ();
8277 /* Returns a pointer to the `atexit' function. Note that if
8278 FLAG_USE_CXA_ATEXIT is non-zero, then this will actually be the new
8279 `__cxa_atexit' function specified in the IA64 C++ ABI. */
8293 if (flag_use_cxa_atexit
)
8295 /* The declaration for `__cxa_atexit' is:
8297 int __cxa_atexit (void (*)(void *), void *, void *)
8299 We build up the argument types and then then function type
8302 /* First, build the pointer-to-function type for the first
8304 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8305 fn_type
= build_function_type (void_type_node
, arg_types
);
8306 fn_ptr_type
= build_pointer_type (fn_type
);
8307 /* Then, build the rest of the argument types. */
8308 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8309 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, arg_types
);
8310 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, arg_types
);
8311 /* And the final __cxa_atexit type. */
8312 fn_type
= build_function_type (integer_type_node
, arg_types
);
8313 fn_ptr_type
= build_pointer_type (fn_type
);
8314 name
= "__cxa_atexit";
8318 /* The declaration for `atexit' is:
8320 int atexit (void (*)());
8322 We build up the argument types and then then function type
8324 fn_type
= build_function_type (void_type_node
, void_list_node
);
8325 fn_ptr_type
= build_pointer_type (fn_type
);
8326 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, void_list_node
);
8327 /* Build the final atexit type. */
8328 fn_type
= build_function_type (integer_type_node
, arg_types
);
8332 /* Now, build the function declaration. */
8333 push_lang_context (lang_name_c
);
8334 atexit_fndecl
= build_library_fn_ptr (name
, fn_type
);
8335 mark_used (atexit_fndecl
);
8336 pop_lang_context ();
8337 atexit_node
= default_conversion (atexit_fndecl
);
8342 /* Returns the __dso_handle VAR_DECL. */
8345 get_dso_handle_node ()
8347 if (dso_handle_node
)
8348 return dso_handle_node
;
8350 /* Declare the variable. */
8351 dso_handle_node
= declare_global_var (get_identifier ("__dso_handle"),
8354 return dso_handle_node
;
8357 /* Begin a new function with internal linkage whose job will be simply
8358 to destroy some particular variable. */
8363 static int counter
= 0;
8364 int old_interface_unknown
= interface_unknown
;
8370 push_to_top_level ();
8372 /* No need to mangle this. */
8373 push_lang_context (lang_name_c
);
8375 interface_unknown
= 1;
8377 /* Build the parameter-types. */
8378 parmtypes
= void_list_node
;
8379 /* Functions passed to __cxa_atexit take an additional parameter.
8380 We'll just ignore it. After we implement the new calling
8381 convention for destructors, we can eliminate the use of
8382 additional cleanup functions entirely in the -fnew-abi case. */
8383 if (flag_use_cxa_atexit
)
8384 parmtypes
= tree_cons (NULL_TREE
, ptr_type_node
, parmtypes
);
8385 /* Build the function type itself. */
8386 fntype
= build_function_type (void_type_node
, parmtypes
);
8387 /* Build the name of the function. */
8388 sprintf (name
, "__tcf_%d", counter
++);
8389 /* Build the function declaration. */
8390 fndecl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), fntype
);
8391 /* It's a function with internal linkage, generated by the
8393 TREE_PUBLIC (fndecl
) = 0;
8394 DECL_ARTIFICIAL (fndecl
) = 1;
8395 /* Make the function `inline' so that it is only emitted if it is
8396 actually needed. It is unlikely that it will be inlined, since
8397 it is only called via a function pointer, but we avoid unncessary
8398 emissions this way. */
8399 DECL_INLINE (fndecl
) = 1;
8400 /* Build the parameter. */
8401 if (flag_use_cxa_atexit
)
8405 parmdecl
= build_decl (PARM_DECL
, NULL_TREE
, ptr_type_node
);
8406 DECL_CONTEXT (parmdecl
) = fndecl
;
8407 DECL_ARG_TYPE (parmdecl
) = ptr_type_node
;
8408 TREE_USED (parmdecl
) = 1;
8409 DECL_ARGUMENTS (fndecl
) = parmdecl
;
8413 start_function (/*specs=*/NULL_TREE
, fndecl
, NULL_TREE
, SF_PRE_PARSED
);
8416 interface_unknown
= old_interface_unknown
;
8418 pop_lang_context ();
8420 return current_function_decl
;
8423 /* Finish the cleanup function begun by start_cleanup_fn. */
8430 expand_body (finish_function (0));
8432 pop_from_top_level ();
8435 /* Generate code to handle the destruction of DECL, an object with
8436 static storage duration. */
8439 register_dtor_fn (decl
)
8447 int saved_flag_access_control
;
8449 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl
)))
8452 /* Call build_cleanup before we enter the anonymous function so that
8453 any access checks will be done relative to the current scope,
8454 rather than the scope of the anonymous function. */
8455 build_cleanup (decl
);
8457 /* Now start the function. */
8458 cleanup
= start_cleanup_fn ();
8460 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
8461 to the original function, rather than the anonymous one. That
8462 will make the back-end think that nested functions are in use,
8463 which causes confusion. */
8464 saved_flag_access_control
= flag_access_control
;
8465 flag_access_control
= 0;
8466 fcall
= build_cleanup (decl
);
8467 flag_access_control
= saved_flag_access_control
;
8469 /* Create the body of the anonymous function. */
8470 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
8471 finish_expr_stmt (fcall
);
8472 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
8475 /* Call atexit with the cleanup function. */
8476 mark_addressable (cleanup
);
8477 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
8478 if (flag_use_cxa_atexit
)
8480 args
= tree_cons (NULL_TREE
, get_dso_handle_node (), NULL_TREE
);
8481 args
= tree_cons (NULL_TREE
, null_pointer_node
, args
);
8482 args
= tree_cons (NULL_TREE
, cleanup
, args
);
8485 args
= tree_cons (NULL_TREE
, cleanup
, NULL_TREE
);
8486 finish_expr_stmt (build_function_call (get_atexit_node (), args
));
8490 expand_static_init (decl
, init
)
8494 tree oldstatic
= value_member (decl
, static_aggregates
);
8498 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
8499 cp_error ("multiple initializations given for `%D'", decl
);
8501 else if (! toplevel_bindings_p ())
8503 /* Emit code to perform this initialization but once. */
8510 /* Emit code to perform this initialization but once. This code
8513 static int guard = 0;
8515 // Do initialization.
8517 // Register variable for destruction at end of program.
8520 Note that the `temp' variable is only set to 1 *after* the
8521 initialization is complete. This ensures that an exception,
8522 thrown during the construction, will cause the variable to
8523 reinitialized when we pass through this code again, as per:
8527 If the initialization exits by throwing an exception, the
8528 initialization is not complete, so it will be tried again
8529 the next time control enters the declaration.
8531 In theory, this process should be thread-safe, too; multiple
8532 threads should not be able to initialize the variable more
8533 than once. We don't yet attempt to ensure thread-safety. */
8535 /* Create the guard variable. */
8536 guard
= get_guard (decl
);
8538 /* Begin the conditional initialization. */
8539 if_stmt
= begin_if_stmt ();
8540 finish_if_stmt_cond (get_guard_cond (guard
), if_stmt
);
8541 then_clause
= begin_compound_stmt (/*has_no_scope=*/0);
8543 /* Do the initialization itself. */
8544 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
8545 || (init
&& TREE_CODE (init
) == TREE_LIST
))
8546 assignment
= build_aggr_init (decl
, init
, 0);
8548 /* The initialization we're doing here is just a bitwise
8550 assignment
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
8552 assignment
= NULL_TREE
;
8554 /* Once the assignment is complete, set TEMP to 1. Since the
8555 construction of the static object is complete at this point,
8556 we want to make sure TEMP is set to 1 even if a temporary
8557 constructed during the initialization throws an exception
8558 when it is destroyed. So, we combine the initialization and
8559 the assignment to TEMP into a single expression, ensuring
8560 that when we call finish_expr_stmt the cleanups will not be
8561 run until after TEMP is set to 1. */
8562 guard_init
= set_guard (guard
);
8565 assignment
= tree_cons (NULL_TREE
, assignment
,
8566 build_tree_list (NULL_TREE
,
8568 assignment
= build_compound_expr (assignment
);
8571 assignment
= guard_init
;
8572 finish_expr_stmt (assignment
);
8574 /* Use atexit to register a function for destroying this static
8576 register_dtor_fn (decl
);
8578 finish_compound_stmt (/*has_no_scope=*/0, then_clause
);
8579 finish_then_clause (if_stmt
);
8583 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8586 /* Finish the declaration of a catch-parameter. */
8589 start_handler_parms (declspecs
, declarator
)
8596 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8598 if (decl
== NULL_TREE
)
8599 error ("invalid catch parameter");
8608 /* Make TYPE a complete type based on INITIAL_VALUE.
8609 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8610 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8613 complete_array_type (type
, initial_value
, do_default
)
8614 tree type
, initial_value
;
8617 register tree maxindex
= NULL_TREE
;
8622 /* An array of character type can be initialized from a
8623 brace-enclosed string constant. */
8624 if (char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (type
)))
8625 && TREE_CODE (initial_value
) == CONSTRUCTOR
8626 && CONSTRUCTOR_ELTS (initial_value
)
8627 && (TREE_CODE (TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
)))
8629 && TREE_CHAIN (CONSTRUCTOR_ELTS (initial_value
)) == NULL_TREE
)
8630 initial_value
= TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
));
8632 /* Note MAXINDEX is really the maximum index, one less than the
8634 if (TREE_CODE (initial_value
) == STRING_CST
)
8637 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8638 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8641 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8643 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8645 maxindex
= ssize_int (-1);
8646 for (; elts
; elts
= TREE_CHAIN (elts
))
8648 if (TREE_PURPOSE (elts
))
8649 maxindex
= TREE_PURPOSE (elts
);
8651 maxindex
= size_binop (PLUS_EXPR
, maxindex
, ssize_int (1));
8653 maxindex
= copy_node (maxindex
);
8657 /* Make an error message unless that happened already. */
8658 if (initial_value
!= error_mark_node
)
8661 initial_value
= NULL_TREE
;
8663 /* Prevent further error messages. */
8664 maxindex
= build_int_2 (0, 0);
8671 maxindex
= build_int_2 (0, 0);
8680 domain
= build_index_type (maxindex
);
8681 TYPE_DOMAIN (type
) = domain
;
8683 if (! TREE_TYPE (maxindex
))
8684 TREE_TYPE (maxindex
) = domain
;
8686 itype
= TREE_TYPE (initial_value
);
8689 if (itype
&& !TYPE_DOMAIN (itype
))
8690 TYPE_DOMAIN (itype
) = domain
;
8691 /* The type of the main variant should never be used for arrays
8692 of different sizes. It should only ever be completed with the
8693 size of the array. */
8694 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8695 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8698 /* Lay out the type now that we can get the real answer. */
8705 /* Return zero if something is declared to be a member of type
8706 CTYPE when in the context of CUR_TYPE. STRING is the error
8707 message to print in that case. Otherwise, quietly return 1. */
8710 member_function_or_else (ctype
, cur_type
, flags
)
8711 tree ctype
, cur_type
;
8712 enum overload_flags flags
;
8714 if (ctype
&& ctype
!= cur_type
)
8716 if (flags
== DTOR_FLAG
)
8717 cp_error ("destructor for alien class `%T' cannot be a member",
8720 cp_error ("constructor for alien class `%T' cannot be a member",
8727 /* Subroutine of `grokdeclarator'. */
8729 /* Generate errors possibly applicable for a given set of specifiers.
8730 This is for ARM $7.1.2. */
8733 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8736 int virtualp
, quals
, friendp
, raises
, inlinep
;
8739 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8741 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8743 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8746 cp_error_at ("`%D' declared as a friend", object
);
8748 cp_error_at ("`%D' declared with an exception specification", object
);
8751 /* CTYPE is class type, or null if non-class.
8752 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8754 DECLARATOR is the function's name.
8755 VIRTUALP is truthvalue of whether the function is virtual or not.
8756 FLAGS are to be passed through to `grokclassfn'.
8757 QUALS are qualifiers indicating whether the function is `const'
8759 RAISES is a list of exceptions that this function can raise.
8760 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8761 not look, and -1 if we should not call `grokclassfn' at all.
8763 Returns `NULL_TREE' if something goes wrong, after issuing
8764 applicable error messages. */
8767 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8768 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8769 template_count
, in_namespace
)
8772 tree orig_declarator
;
8774 enum overload_flags flags
;
8776 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8780 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8781 int has_default_arg
= 0;
8785 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8786 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8792 type
= build_exception_variant (type
, raises
);
8795 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8796 /* Propagate volatile out from type to decl. */
8797 if (TYPE_VOLATILE (type
))
8798 TREE_THIS_VOLATILE (decl
) = 1;
8800 /* If this decl has namespace scope, set that up. */
8802 set_decl_namespace (decl
, in_namespace
, friendp
);
8804 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8806 /* `main' and builtins have implicit 'C' linkage. */
8807 if ((MAIN_NAME_P (declarator
)
8808 || (IDENTIFIER_LENGTH (declarator
) > 10
8809 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8810 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8811 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8812 && current_lang_name
== lang_name_cplusplus
8813 && ctype
== NULL_TREE
8814 /* NULL_TREE means global namespace. */
8815 && DECL_CONTEXT (decl
) == NULL_TREE
)
8816 DECL_LANGUAGE (decl
) = lang_c
;
8818 /* Should probably propagate const out from type to decl I bet (mrs). */
8821 DECL_STATIC_FUNCTION_P (decl
) = 1;
8822 DECL_CONTEXT (decl
) = ctype
;
8826 DECL_CONTEXT (decl
) = ctype
;
8828 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8830 if (processing_template_decl
)
8831 error ("cannot declare `::main' to be a template");
8833 error ("cannot declare `::main' to be inline");
8835 error ("cannot declare `::main' to be static");
8840 /* Members of anonymous types and local classes have no linkage; make
8842 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8843 || decl_function_context (TYPE_MAIN_DECL (ctype
))))
8848 /* [basic.link]: A name with no linkage (notably, the name of a class
8849 or enumeration declared in a local scope) shall not be used to
8850 declare an entity with linkage.
8852 Only check this for public decls for now. */
8853 t
= no_linkage_check (TREE_TYPE (decl
));
8856 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8858 if (DECL_EXTERN_C_P (decl
))
8859 /* Allow this; it's pretty common in C. */;
8861 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8865 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8870 TREE_PUBLIC (decl
) = publicp
;
8873 DECL_INTERFACE_KNOWN (decl
) = 1;
8874 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8878 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8880 DECL_EXTERNAL (decl
) = 1;
8881 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8883 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8884 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8888 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8889 grok_op_properties (decl
, virtualp
, check
< 0);
8891 if (ctype
&& decl_function_context (decl
))
8892 DECL_NO_STATIC_CHAIN (decl
) = 1;
8894 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8895 if (TREE_PURPOSE (t
)
8896 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8898 has_default_arg
= 1;
8903 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8907 ("defining explicit specialization `%D' in friend declaration",
8911 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8913 /* Something like `template <class T> friend void f<T>()'. */
8914 cp_error ("invalid use of template-id `%D' in declaration of primary template",
8920 /* A friend declaration of the form friend void f<>(). Record
8921 the information in the TEMPLATE_ID_EXPR. */
8922 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8923 DECL_TEMPLATE_INFO (decl
)
8924 = tree_cons (TREE_OPERAND (orig_declarator
, 0),
8925 TREE_OPERAND (orig_declarator
, 1),
8928 if (has_default_arg
)
8930 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8937 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8944 if (has_default_arg
)
8945 add_defarg_fn (decl
);
8947 /* Plain overloading: will not be grok'd by grokclassfn. */
8948 if (! ctype
&& ! processing_template_decl
8949 && !DECL_EXTERN_C_P (decl
)
8950 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8951 set_mangled_name_for_decl (decl
);
8954 /* Make the init_value nonzero so pushdecl knows this is not
8955 tentative. error_mark_node is replaced later with the BLOCK. */
8956 DECL_INITIAL (decl
) = error_mark_node
;
8958 if (TYPE_NOTHROW_P (type
) || nothrow_libfn_p (decl
))
8959 TREE_NOTHROW (decl
) = 1;
8961 /* Caller will do the rest of this. */
8965 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8966 DECL_CONSTRUCTOR_P (decl
) = 1;
8968 /* Function gets the ugly name, field gets the nice one. This call
8969 may change the type of the function (because of default
8971 if (ctype
!= NULL_TREE
)
8972 grokclassfn (ctype
, decl
, flags
, quals
);
8974 decl
= check_explicit_specialization (orig_declarator
, decl
,
8976 2 * (funcdef_flag
!= 0) +
8977 4 * (friendp
!= 0));
8978 if (decl
== error_mark_node
)
8981 if (ctype
!= NULL_TREE
8982 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8987 old_decl
= check_classfn (ctype
, decl
);
8989 if (old_decl
&& TREE_CODE (old_decl
) == TEMPLATE_DECL
)
8990 /* Because grokfndecl is always supposed to return a
8991 FUNCTION_DECL, we pull out the DECL_TEMPLATE_RESULT
8992 here. We depend on our callers to figure out that its
8993 really a template that's being returned. */
8994 old_decl
= DECL_TEMPLATE_RESULT (old_decl
);
8996 if (old_decl
&& DECL_STATIC_FUNCTION_P (old_decl
)
8997 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8999 /* Remove the `this' parm added by grokclassfn.
9000 XXX Isn't this done in start_function, too? */
9001 revert_static_member_fn (decl
);
9002 last_function_parms
= TREE_CHAIN (last_function_parms
);
9004 if (old_decl
&& DECL_ARTIFICIAL (old_decl
))
9005 cp_error ("definition of implicitly-declared `%D'", old_decl
);
9009 /* Since we've smashed OLD_DECL to its
9010 DECL_TEMPLATE_RESULT, we must do the same to DECL. */
9011 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
9012 decl
= DECL_TEMPLATE_RESULT (decl
);
9014 /* Attempt to merge the declarations. This can fail, in
9015 the case of some illegal specialization declarations. */
9016 if (!duplicate_decls (decl
, old_decl
))
9017 cp_error ("no `%#D' member function declared in class `%T'",
9023 if (DECL_CONSTRUCTOR_P (decl
) && !grok_ctor_properties (ctype
, decl
))
9026 if (ctype
== NULL_TREE
|| check
)
9031 DECL_VIRTUAL_P (decl
) = 1;
9032 if (DECL_VINDEX (decl
) == NULL_TREE
)
9033 DECL_VINDEX (decl
) = error_mark_node
;
9034 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
9041 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
9044 RID_BIT_TYPE
*specbits_in
;
9050 RID_BIT_TYPE specbits
;
9052 specbits
= *specbits_in
;
9054 if (TREE_CODE (type
) == OFFSET_TYPE
)
9056 /* If you declare a static member so that it
9057 can be initialized, the code will reach here. */
9058 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
9059 type
= TREE_TYPE (type
);
9060 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
9061 DECL_CONTEXT (decl
) = basetype
;
9062 /* DECL_ASSEMBLER_NAME is needed only for full-instantiated
9064 if (!uses_template_parms (decl
))
9067 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
9069 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
,
9078 context
= in_namespace
;
9079 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
9080 context
= current_namespace
;
9082 context
= NULL_TREE
;
9084 if (processing_template_decl
&& context
)
9085 /* For global variables, declared in a template, we need the
9087 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
9089 decl
= build_decl (VAR_DECL
, declarator
, type
);
9092 set_decl_namespace (decl
, context
, 0);
9094 context
= DECL_CONTEXT (decl
);
9095 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
9098 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
9100 DECL_ASSEMBLER_NAME (decl
)
9101 = build_static_name (context
, declarator
);
9106 set_decl_namespace (decl
, in_namespace
, 0);
9108 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
9110 DECL_THIS_EXTERN (decl
) = 1;
9111 DECL_EXTERNAL (decl
) = !initialized
;
9114 /* In class context, static means one per class,
9115 public access, and static storage. */
9116 if (DECL_CLASS_SCOPE_P (decl
))
9118 TREE_PUBLIC (decl
) = 1;
9119 TREE_STATIC (decl
) = 1;
9120 DECL_EXTERNAL (decl
) = 0;
9122 /* At top level, either `static' or no s.c. makes a definition
9123 (perhaps tentative), and absence of `static' makes it public. */
9124 else if (toplevel_bindings_p ())
9126 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
9127 && (DECL_THIS_EXTERN (decl
) || ! constp
));
9128 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
9130 /* Not at top level, only `static' makes a static definition. */
9133 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
9134 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
9137 if (TREE_PUBLIC (decl
))
9139 /* [basic.link]: A name with no linkage (notably, the name of a class
9140 or enumeration declared in a local scope) shall not be used to
9141 declare an entity with linkage.
9143 Only check this for public decls for now. */
9144 tree t
= no_linkage_check (TREE_TYPE (decl
));
9147 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
9148 /* Ignore for now; `enum { foo } e' is pretty common. */;
9150 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
9158 /* Create and return a canonical pointer to member function type, for
9159 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
9162 build_ptrmemfunc_type (type
)
9168 tree unqualified_variant
= NULL_TREE
;
9170 /* If a canonical type already exists for this type, use it. We use
9171 this method instead of type_hash_canon, because it only does a
9172 simple equality check on the list of field members. */
9174 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
9177 /* Make sure that we always have the unqualified pointer-to-member
9179 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9181 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
9183 t
= make_aggr_type (RECORD_TYPE
);
9184 /* Let the front-end know this is a pointer to member function... */
9185 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
9186 /* ... and not really an aggregate. */
9187 SET_IS_AGGR_TYPE (t
, 0);
9191 u
= make_aggr_type (UNION_TYPE
);
9192 SET_IS_AGGR_TYPE (u
, 0);
9193 fields
[0] = build_decl (FIELD_DECL
, pfn_identifier
, type
);
9194 fields
[1] = build_decl (FIELD_DECL
, delta2_identifier
,
9196 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9197 TYPE_NAME (u
) = NULL_TREE
;
9199 fields
[0] = build_decl (FIELD_DECL
, delta_identifier
,
9201 fields
[1] = build_decl (FIELD_DECL
, index_identifier
,
9203 fields
[2] = build_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
9204 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
9208 fields
[0] = build_decl (FIELD_DECL
, pfn_identifier
, type
);
9209 fields
[1] = build_decl (FIELD_DECL
, delta_identifier
,
9211 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9214 /* Zap out the name so that the back-end will give us the debugging
9215 information for this anonymous RECORD_TYPE. */
9216 TYPE_NAME (t
) = NULL_TREE
;
9218 /* If this is not the unqualified form of this pointer-to-member
9219 type, set the TYPE_MAIN_VARIANT for this type to be the
9220 unqualified type. Since they are actually RECORD_TYPEs that are
9221 not variants of each other, we must do this manually. */
9222 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9224 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
9225 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
9226 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
9227 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
9230 /* Cache this pointer-to-member type so that we can find it again
9232 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
9234 /* Seems to be wanted. */
9235 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
9240 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
9241 Check to see that the definition is valid. Issue appropriate error
9242 messages. Return 1 if the definition is particularly bad, or 0
9246 check_static_variable_definition (decl
, type
)
9250 /* Motion 10 at San Diego: If a static const integral data member is
9251 initialized with an integral constant expression, the initializer
9252 may appear either in the declaration (within the class), or in
9253 the definition, but not both. If it appears in the class, the
9254 member is a member constant. The file-scope definition is always
9256 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
9258 cp_error ("invalid in-class initialization of static data member of non-integral type `%T'",
9260 /* If we just return the declaration, crashes will sometimes
9261 occur. We therefore return void_type_node, as if this was a
9262 friend declaration, to cause callers to completely ignore
9263 this declaration. */
9266 else if (!CP_TYPE_CONST_P (type
))
9267 cp_error ("ISO C++ forbids in-class initialization of non-const static member `%D'",
9269 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
9270 cp_pedwarn ("ISO C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
9275 /* Given the SIZE (i.e., number of elements) in an array, compute an
9276 appropriate index type for the array. If non-NULL, NAME is the
9277 name of the thing being declared. */
9280 compute_array_index_type (name
, size
)
9286 /* The size might be the result of a cast. */
9287 STRIP_TYPE_NOPS (size
);
9289 /* It might be a const variable or enumeration constant. */
9290 size
= decl_constant_value (size
);
9292 /* If this involves a template parameter, it will be a constant at
9293 instantiation time, but we don't know what the value is yet.
9294 Even if no template parameters are involved, we may an expression
9295 that is not a constant; we don't even simplify `1 + 2' when
9296 processing a template. */
9297 if (processing_template_decl
)
9299 /* Resolve a qualified reference to an enumerator or static
9300 const data member of ours. */
9301 if (TREE_CODE (size
) == SCOPE_REF
9302 && TREE_OPERAND (size
, 0) == current_class_type
)
9304 tree t
= lookup_field (current_class_type
,
9305 TREE_OPERAND (size
, 1), 0, 0);
9310 return build_index_type (build_min (MINUS_EXPR
, sizetype
,
9311 size
, integer_one_node
));
9314 /* The array bound must be an integer type. */
9315 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9316 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
9317 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
9320 cp_error ("size of array `%D' has non-integer type", name
);
9322 cp_error ("size of array has non-integer type");
9323 size
= integer_one_node
;
9326 /* Normally, the array-bound will be a constant. */
9327 if (TREE_CODE (size
) == INTEGER_CST
)
9329 /* Check to see if the array bound overflowed. Make that an
9330 error, no matter how generous we're being. */
9331 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9332 int old_pedantic
= pedantic
;
9333 pedantic
= flag_pedantic_errors
= 1;
9334 constant_expression_warning (size
);
9335 pedantic
= old_pedantic
;
9336 flag_pedantic_errors
= old_flag_pedantic_errors
;
9338 /* An array must have a positive number of elements. */
9339 if (INT_CST_LT (size
, integer_zero_node
))
9342 cp_error ("size of array `%D' is negative", name
);
9344 cp_error ("size of array is negative");
9345 size
= integer_one_node
;
9347 /* Except that an extension we allow zero-sized arrays. We
9348 always allow them in system headers because glibc uses
9350 else if (integer_zerop (size
) && pedantic
&& !in_system_header
)
9353 cp_pedwarn ("ISO C++ forbids zero-size array `%D'", name
);
9355 cp_pedwarn ("ISO C++ forbids zero-size array");
9358 else if (TREE_CONSTANT (size
))
9360 /* `(int) &fn' is not a valid array bound. */
9362 cp_error ("size of array `%D' is not an integral constant-expression",
9365 cp_error ("size of array is not an integral constant-expression");
9368 /* Compute the index of the largest element in the array. It is
9369 one less than the number of elements in the array. */
9371 = fold (cp_build_binary_op (MINUS_EXPR
,
9372 cp_convert (ssizetype
, size
),
9373 cp_convert (ssizetype
,
9374 integer_one_node
)));
9376 /* Check for variable-sized arrays. We allow such things as an
9377 extension, even though they are not allowed in ANSI/ISO C++. */
9378 if (!TREE_CONSTANT (itype
))
9383 cp_pedwarn ("ISO C++ forbids variable-size array `%D'",
9386 cp_pedwarn ("ISO C++ forbids variable-size array");
9389 /* Create a variable-sized array index type. */
9390 itype
= variable_size (itype
);
9392 /* Make sure that there was no overflow when creating to a signed
9393 index type. (For example, on a 32-bit machine, an array with
9394 size 2^32 - 1 is too big.) */
9395 else if (TREE_OVERFLOW (itype
))
9397 error ("overflow in array dimension");
9398 TREE_OVERFLOW (itype
) = 0;
9401 /* Create and return the appropriate index type. */
9402 return build_index_type (itype
);
9405 /* Returns an ARRAY_TYPE for an array with SIZE elements of the
9406 indicated TYPE. If non-NULL, NAME is the NAME of the declaration
9410 create_array_type_for_decl (name
, type
, size
)
9415 tree itype
= NULL_TREE
;
9416 const char* error_msg
;
9418 /* If things have already gone awry, bail now. */
9419 if (type
== error_mark_node
|| size
== error_mark_node
)
9420 return error_mark_node
;
9422 /* Assume that everything will go OK. */
9425 /* There are some types which cannot be array elements. */
9426 switch (TREE_CODE (type
))
9429 error_msg
= "array of void";
9433 error_msg
= "array of functions";
9436 case REFERENCE_TYPE
:
9437 error_msg
= "array of references";
9441 error_msg
= "array of data members";
9445 error_msg
= "array of function members";
9452 /* If something went wrong, issue an error-message and return. */
9456 cp_error ("declaration of `%D' as %s", name
, error_msg
);
9458 cp_error ("creating %s", error_msg
);
9460 return error_mark_node
;
9465 The constant expressions that specify the bounds of the arrays
9466 can be omitted only for the first member of the sequence. */
9467 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9469 cp_error ("declaration of `%D' as multidimensional array must have bounds for all dimensions except the first",
9472 return error_mark_node
;
9475 /* Figure out the index type for the array. */
9477 itype
= compute_array_index_type (name
, size
);
9479 return build_cplus_array_type (type
, itype
);
9482 /* Check that it's OK to declare a function with the indicated TYPE.
9483 SFK indicates the kind of special function (if any) that this
9484 function is. CTYPE is the class of which this function is a
9485 member. OPTYPE is the type given in a conversion operator
9486 declaration. Returns the actual return type of the function; that
9487 may be different than TYPE if an error occurs, or for certain
9488 special functions. */
9491 check_special_function_return_type (sfk
, type
, ctype
, optype
)
9492 special_function_kind sfk
;
9499 case sfk_constructor
:
9501 cp_error ("return type specification for constructor invalid");
9503 /* In the old ABI, we return `this'; in the new ABI we don't
9505 type
= flag_new_abi
? void_type_node
: build_pointer_type (ctype
);
9508 case sfk_destructor
:
9510 cp_error ("return type specification for destructor invalid");
9511 type
= void_type_node
;
9514 case sfk_conversion
:
9515 if (type
&& !same_type_p (type
, optype
))
9516 cp_error ("operator `%T' declared to return `%T'", optype
, type
);
9518 cp_pedwarn ("return type specified for `operator %T'", optype
);
9523 my_friendly_abort (20000408);
9530 /* Given declspecs and a declarator,
9531 determine the name and type of the object declared
9532 and construct a ..._DECL node for it.
9533 (In one case we can return a ..._TYPE node instead.
9534 For invalid input we sometimes return 0.)
9536 DECLSPECS is a chain of tree_list nodes whose value fields
9537 are the storage classes and type specifiers.
9539 DECL_CONTEXT says which syntactic context this declaration is in:
9540 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
9541 FUNCDEF for a function definition. Like NORMAL but a few different
9542 error messages in each case. Return value may be zero meaning
9543 this definition is too screwy to try to parse.
9544 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
9545 handle member functions (which have FIELD context).
9546 Return value may be zero meaning this definition is too screwy to
9548 PARM for a parameter declaration (either within a function prototype
9549 or before a function body). Make a PARM_DECL, or return void_type_node.
9550 CATCHPARM for a parameter declaration before a catch clause.
9551 TYPENAME if for a typename (in a cast or sizeof).
9552 Don't make a DECL node; just return the ..._TYPE node.
9553 FIELD for a struct or union field; make a FIELD_DECL.
9554 BITFIELD for a field with specified width.
9555 INITIALIZED is 1 if the decl has an initializer.
9557 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
9558 normal attributes in TREE_PURPOSE, or NULL_TREE.
9560 In the TYPENAME case, DECLARATOR is really an abstract declarator.
9561 It may also be so in the PARM case, for a prototype where the
9562 argument type is specified but not the name.
9564 This function is where the complicated C meanings of `static'
9565 and `extern' are interpreted.
9567 For C++, if there is any monkey business to do, the function which
9568 calls this one must do it, i.e., prepending instance variables,
9569 renaming overloaded function names, etc.
9571 Note that for this C++, it is an error to define a method within a class
9572 which does not belong to that class.
9574 Except in the case where SCOPE_REFs are implicitly known (such as
9575 methods within a class being redundantly qualified),
9576 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
9577 (class_name::decl_name). The caller must also deal with this.
9579 If a constructor or destructor is seen, and the context is FIELD,
9580 then the type gains the attribute TREE_HAS_x. If such a declaration
9581 is erroneous, NULL_TREE is returned.
9583 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
9584 function, these are the qualifiers to give to the `this' pointer. We
9585 apply TYPE_QUAL_RESTRICT to the this ptr, not the object.
9587 May return void_type_node if the declarator turned out to be a friend.
9588 See grokfield for details. */
9591 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
9594 enum decl_context decl_context
;
9598 RID_BIT_TYPE specbits
;
9601 tree type
= NULL_TREE
;
9607 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
9608 int explicit_int
= 0;
9609 int explicit_char
= 0;
9610 int defaulted_int
= 0;
9611 tree typedef_decl
= NULL_TREE
;
9613 tree typedef_type
= NULL_TREE
;
9614 int funcdef_flag
= 0;
9615 enum tree_code innermost_code
= ERROR_MARK
;
9618 /* See the code below that used this. */
9619 tree decl_machine_attr
= NULL_TREE
;
9621 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
9622 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
9623 tree init
= NULL_TREE
;
9625 /* Keep track of what sort of function is being processed
9626 so that we can warn about default return values, or explicit
9627 return values which do not match prescribed defaults. */
9628 special_function_kind sfk
= sfk_none
;
9630 tree dname
= NULL_TREE
;
9631 tree ctype
= current_class_type
;
9632 tree ctor_return_type
= NULL_TREE
;
9633 enum overload_flags flags
= NO_SPECIAL
;
9634 tree quals
= NULL_TREE
;
9635 tree raises
= NULL_TREE
;
9636 int template_count
= 0;
9637 tree in_namespace
= NULL_TREE
;
9641 RIDBIT_RESET_ALL (specbits
);
9642 if (decl_context
== FUNCDEF
)
9643 funcdef_flag
= 1, decl_context
= NORMAL
;
9644 else if (decl_context
== MEMFUNCDEF
)
9645 funcdef_flag
= -1, decl_context
= FIELD
;
9646 else if (decl_context
== BITFIELD
)
9647 bitfield
= 1, decl_context
= FIELD
;
9649 /* Look inside a declarator for the name being declared
9650 and get it as a string, for an error message. */
9652 tree
*next
= &declarator
;
9656 while (next
&& *next
)
9659 switch (TREE_CODE (decl
))
9662 /* For attributes. */
9663 next
= &TREE_VALUE (decl
);
9668 next
= &TREE_OPERAND (decl
, 0);
9671 case BIT_NOT_EXPR
: /* For C++ destructors! */
9673 tree name
= TREE_OPERAND (decl
, 0);
9674 tree rename
= NULL_TREE
;
9676 my_friendly_assert (flags
== NO_SPECIAL
, 152);
9678 sfk
= sfk_destructor
;
9679 if (TREE_CODE (name
) == TYPE_DECL
)
9680 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
9681 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
9682 if (ctype
== NULL_TREE
)
9684 if (current_class_type
== NULL_TREE
)
9686 error ("destructors must be member functions");
9691 tree t
= constructor_name (current_class_name
);
9698 tree t
= constructor_name (ctype
);
9705 cp_error ("destructor `%T' must match class name `%T'",
9707 TREE_OPERAND (decl
, 0) = rename
;
9713 case ADDR_EXPR
: /* C++ reference declaration */
9718 innermost_code
= TREE_CODE (decl
);
9719 next
= &TREE_OPERAND (decl
, 0);
9723 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
9725 /* This is actually a variable declaration using
9726 constructor syntax. We need to call start_decl and
9727 cp_finish_decl so we can get the variable
9730 tree attributes
, prefix_attributes
;
9732 *next
= TREE_OPERAND (decl
, 0);
9733 init
= CALL_DECLARATOR_PARMS (decl
);
9737 attributes
= TREE_PURPOSE (attrlist
);
9738 prefix_attributes
= TREE_VALUE (attrlist
);
9742 attributes
= NULL_TREE
;
9743 prefix_attributes
= NULL_TREE
;
9746 decl
= start_decl (declarator
, declspecs
, 1,
9747 attributes
, prefix_attributes
);
9748 decl_type_access_control (decl
);
9751 /* Look for __unused__ attribute */
9752 if (TREE_USED (TREE_TYPE (decl
)))
9753 TREE_USED (decl
) = 1;
9754 finish_decl (decl
, init
, NULL_TREE
);
9757 cp_error ("invalid declarator");
9760 innermost_code
= TREE_CODE (decl
);
9761 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
9762 ctype
= current_class_type
;
9764 && TREE_OPERAND (decl
, 0)
9765 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
9766 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
9767 == constructor_name_full (ctype
))
9768 || (DECL_NAME (TREE_OPERAND (decl
, 0))
9769 == constructor_name (ctype
)))))
9770 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9771 next
= &TREE_OPERAND (decl
, 0);
9773 if (ctype
!= NULL_TREE
9774 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
9775 && decl
== constructor_name (ctype
))
9777 sfk
= sfk_constructor
;
9778 ctor_return_type
= ctype
;
9783 case TEMPLATE_ID_EXPR
:
9785 tree fns
= TREE_OPERAND (decl
, 0);
9787 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9788 fns
= TREE_OPERAND (fns
, 0);
9791 if (TREE_CODE (dname
) == COMPONENT_REF
)
9792 dname
= TREE_OPERAND (dname
, 1);
9793 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9795 my_friendly_assert (is_overloaded_fn (dname
),
9797 dname
= DECL_NAME (get_first_fn (dname
));
9802 case IDENTIFIER_NODE
:
9803 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9810 cp_error ("declarator-id missing; using reserved word `%D'",
9812 name
= IDENTIFIER_POINTER (dname
);
9814 else if (!IDENTIFIER_TYPENAME_P (dname
))
9815 name
= IDENTIFIER_POINTER (dname
);
9818 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9819 flags
= TYPENAME_FLAG
;
9820 ctor_return_type
= TREE_TYPE (dname
);
9821 sfk
= sfk_conversion
;
9822 if (IDENTIFIER_GLOBAL_VALUE (dname
)
9823 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (dname
))
9825 name
= IDENTIFIER_POINTER (dname
);
9827 name
= "<invalid operator>";
9834 /* Perform error checking, and decide on a ctype. */
9835 tree cname
= TREE_OPERAND (decl
, 0);
9836 if (cname
== NULL_TREE
)
9838 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9841 in_namespace
= TREE_OPERAND (decl
, 0);
9842 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9844 else if (! is_aggr_type (cname
, 1))
9845 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9846 /* Must test TREE_OPERAND (decl, 1), in case user gives
9847 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9848 else if (TREE_OPERAND (decl
, 1)
9849 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9851 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9852 || TREE_CODE (cname
) == TEMPLATE_TEMPLATE_PARM
)
9854 cp_error ("`%T::%D' is not a valid declarator", cname
,
9855 TREE_OPERAND (decl
, 1));
9856 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9857 cname
, TREE_OPERAND (decl
, 1));
9858 return void_type_node
;
9860 else if (ctype
== NULL_TREE
)
9862 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9863 TREE_OPERAND (decl
, 0) = ctype
;
9866 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9868 cp_error ("type `%T' is not derived from type `%T'",
9870 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9876 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9877 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9878 == constructor_name_full (ctype
))
9879 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9880 == constructor_name (ctype
))))
9881 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9882 next
= &TREE_OPERAND (decl
, 1);
9886 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9887 && constructor_name (ctype
) == decl
)
9889 sfk
= sfk_constructor
;
9890 ctor_return_type
= ctype
;
9892 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9893 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9894 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9895 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9897 sfk
= sfk_destructor
;
9898 ctor_return_type
= ctype
;
9900 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9901 next
= &TREE_OPERAND (decl
, 0);
9912 /* Parse error puts this typespec where
9913 a declarator should go. */
9914 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9915 if (TREE_TYPE (decl
) == current_class_type
)
9916 cp_error (" perhaps you want `%T' for a constructor",
9917 current_class_name
);
9918 dname
= DECL_NAME (decl
);
9919 name
= IDENTIFIER_POINTER (dname
);
9921 /* Avoid giving two errors for this. */
9922 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9924 declspecs
= tree_cons (NULL_TREE
, integer_type_node
, declspecs
);
9930 cp_compiler_error ("`%D' as declarator", decl
);
9931 return 0; /* We used to do a 155 abort here. */
9936 /* A function definition's declarator must have the form of
9937 a function declarator. */
9939 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9942 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9943 && innermost_code
!= CALL_EXPR
9944 && ! (ctype
&& declspecs
== NULL_TREE
))
9946 cp_error ("declaration of `%D' as non-function", dname
);
9947 return void_type_node
;
9950 /* Anything declared one level down from the top level
9951 must be one of the parameters of a function
9952 (because the body is at least two levels down). */
9954 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9955 by not allowing C++ class definitions to specify their parameters
9956 with xdecls (must be spec.d in the parmlist).
9958 Since we now wait to push a class scope until we are sure that
9959 we are in a legitimate method context, we must set oldcname
9960 explicitly (since current_class_name is not yet alive).
9962 We also want to avoid calling this a PARM if it is in a namespace. */
9964 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
9966 struct binding_level
*b
= current_binding_level
;
9967 current_binding_level
= b
->level_chain
;
9968 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9969 decl_context
= PARM
;
9970 current_binding_level
= b
;
9974 name
= decl_context
== PARM
? "parameter" : "type name";
9976 /* Look through the decl specs and record which ones appear.
9977 Some typespecs are defined as built-in typenames.
9978 Others, the ones that are modifiers of other types,
9979 are represented by bits in SPECBITS: set the bits for
9980 the modifiers that appear. Storage class keywords are also in SPECBITS.
9982 If there is a typedef name or a type, store the type in TYPE.
9983 This includes builtin typedefs such as `int'.
9985 Set EXPLICIT_INT if the type is `int' or `char' and did not
9986 come from a user typedef.
9988 Set LONGLONG if `long' is mentioned twice.
9990 For C++, constructors and destructors have their own fast treatment. */
9992 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
9997 /* Certain parse errors slip through. For example,
9998 `int class;' is not caught by the parser. Try
9999 weakly to recover here. */
10000 if (TREE_CODE (spec
) != TREE_LIST
)
10003 id
= TREE_VALUE (spec
);
10005 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
10007 if (id
== ridpointers
[(int) RID_INT
]
10008 || id
== ridpointers
[(int) RID_CHAR
]
10009 || id
== ridpointers
[(int) RID_BOOL
]
10010 || id
== ridpointers
[(int) RID_WCHAR
])
10014 if (id
== ridpointers
[(int) RID_BOOL
])
10015 error ("`bool' is now a keyword");
10017 cp_error ("extraneous `%T' ignored", id
);
10021 if (id
== ridpointers
[(int) RID_INT
])
10023 else if (id
== ridpointers
[(int) RID_CHAR
])
10025 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
10029 /* C++ aggregate types. */
10030 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
10033 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
10035 type
= IDENTIFIER_TYPE_VALUE (id
);
10039 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
10041 if (ridpointers
[i
] == id
)
10043 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
10045 if (pedantic
&& ! in_system_header
&& warn_long_long
)
10046 pedwarn ("ISO C++ does not support `long long'");
10048 error ("`long long long' is too long for GCC");
10052 else if (RIDBIT_SETP (i
, specbits
))
10053 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
10054 RIDBIT_SET (i
, specbits
);
10059 /* C++ aggregate types. */
10060 else if (TREE_CODE (id
) == TYPE_DECL
)
10063 cp_error ("multiple declarations `%T' and `%T'", type
,
10067 type
= TREE_TYPE (id
);
10068 TREE_VALUE (spec
) = type
;
10073 error ("two or more data types in declaration of `%s'", name
);
10074 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
10076 register tree t
= lookup_name (id
, 1);
10077 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
10078 error ("`%s' fails to be a typedef or built in type",
10079 IDENTIFIER_POINTER (id
));
10082 type
= TREE_TYPE (t
);
10084 /* See the code below that used this. */
10085 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
10090 else if (id
!= error_mark_node
)
10091 /* Can't change CLASS nodes into RECORD nodes here! */
10097 typedef_type
= type
;
10099 /* No type at all: default to `int', and set DEFAULTED_INT
10100 because it was not a user-defined typedef. */
10102 if (type
== NULL_TREE
10103 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
10104 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10105 || RIDBIT_SETP (RID_LONG
, specbits
)
10106 || RIDBIT_SETP (RID_SHORT
, specbits
)))
10108 /* These imply 'int'. */
10109 type
= integer_type_node
;
10113 if (sfk
!= sfk_none
)
10114 type
= check_special_function_return_type (sfk
, type
,
10117 else if (type
== NULL_TREE
)
10123 /* We handle `main' specially here, because 'main () { }' is so
10124 common. With no options, it is allowed. With -Wreturn-type,
10125 it is a warning. It is only an error with -pedantic-errors. */
10126 is_main
= (funcdef_flag
10127 && MAIN_NAME_P (dname
)
10128 && ctype
== NULL_TREE
10129 && in_namespace
== NULL_TREE
10130 && current_namespace
== global_namespace
);
10132 if (in_system_header
|| flag_ms_extensions
)
10133 /* Allow it, sigh. */;
10134 else if (pedantic
|| ! is_main
)
10135 cp_pedwarn ("ISO C++ forbids declaration of `%s' with no type",
10137 else if (warn_return_type
)
10138 cp_warning ("ISO C++ forbids declaration of `%s' with no type",
10141 type
= integer_type_node
;
10146 /* Now process the modifiers that were specified
10147 and check for invalid combinations. */
10149 /* Long double is a special combination. */
10151 if (RIDBIT_SETP (RID_LONG
, specbits
)
10152 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
10154 RIDBIT_RESET (RID_LONG
, specbits
);
10155 type
= build_qualified_type (long_double_type_node
,
10156 CP_TYPE_QUALS (type
));
10159 /* Check all other uses of type modifiers. */
10161 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10162 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10163 || RIDBIT_SETP (RID_LONG
, specbits
)
10164 || RIDBIT_SETP (RID_SHORT
, specbits
))
10168 if (TREE_CODE (type
) == REAL_TYPE
)
10169 error ("short, signed or unsigned invalid for `%s'", name
);
10170 else if (TREE_CODE (type
) != INTEGER_TYPE
)
10171 error ("long, short, signed or unsigned invalid for `%s'", name
);
10172 else if (RIDBIT_SETP (RID_LONG
, specbits
)
10173 && RIDBIT_SETP (RID_SHORT
, specbits
))
10174 error ("long and short specified together for `%s'", name
);
10175 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10176 || RIDBIT_SETP (RID_SHORT
, specbits
))
10178 error ("long or short specified with char for `%s'", name
);
10179 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10180 || RIDBIT_SETP (RID_SHORT
, specbits
))
10181 && TREE_CODE (type
) == REAL_TYPE
)
10182 error ("long or short specified with floating type for `%s'", name
);
10183 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10184 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
10185 error ("signed and unsigned given together for `%s'", name
);
10189 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
10191 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
10193 if (flag_pedantic_errors
)
10198 /* Discard the type modifiers if they are invalid. */
10201 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
10202 RIDBIT_RESET (RID_SIGNED
, specbits
);
10203 RIDBIT_RESET (RID_LONG
, specbits
);
10204 RIDBIT_RESET (RID_SHORT
, specbits
);
10209 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
10210 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
10212 error ("complex invalid for `%s'", name
);
10213 RIDBIT_RESET (RID_COMPLEX
, specbits
);
10216 /* Decide whether an integer type is signed or not.
10217 Optionally treat bitfields as signed by default. */
10218 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10221 It is implementation-defined whether a plain (neither
10222 explicitly signed or unsigned) char, short, int, or long
10223 bit-field is signed or unsigned.
10225 Naturally, we extend this to long long as well. Note that
10226 this does not include wchar_t. */
10227 || (bitfield
&& !flag_signed_bitfields
10228 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
10229 /* A typedef for plain `int' without `signed' can be
10230 controlled just like plain `int', but a typedef for
10231 `signed int' cannot be so controlled. */
10233 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
10234 && (TREE_CODE (type
) == INTEGER_TYPE
10235 || TREE_CODE (type
) == CHAR_TYPE
)
10236 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
10239 type
= long_long_unsigned_type_node
;
10240 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10241 type
= long_unsigned_type_node
;
10242 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10243 type
= short_unsigned_type_node
;
10244 else if (type
== char_type_node
)
10245 type
= unsigned_char_type_node
;
10246 else if (typedef_decl
)
10247 type
= unsigned_type (type
);
10249 type
= unsigned_type_node
;
10251 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10252 && type
== char_type_node
)
10253 type
= signed_char_type_node
;
10255 type
= long_long_integer_type_node
;
10256 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10257 type
= long_integer_type_node
;
10258 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10259 type
= short_integer_type_node
;
10261 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
10263 /* If we just have "complex", it is equivalent to
10264 "complex double", but if any modifiers at all are specified it is
10265 the complex form of TYPE. E.g, "complex short" is
10266 "complex short int". */
10268 if (defaulted_int
&& ! longlong
10269 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
10270 || RIDBIT_SETP (RID_SHORT
, specbits
)
10271 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10272 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
10273 type
= complex_double_type_node
;
10274 else if (type
== integer_type_node
)
10275 type
= complex_integer_type_node
;
10276 else if (type
== float_type_node
)
10277 type
= complex_float_type_node
;
10278 else if (type
== double_type_node
)
10279 type
= complex_double_type_node
;
10280 else if (type
== long_double_type_node
)
10281 type
= complex_long_double_type_node
;
10283 type
= build_complex_type (type
);
10286 if (sfk
== sfk_conversion
10287 && (RIDBIT_SETP (RID_CONST
, specbits
)
10288 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
10289 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
10290 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
10293 /* Set CONSTP if this declaration is `const', whether by
10294 explicit specification or via a typedef.
10295 Likewise for VOLATILEP. */
10297 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
10299 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
10301 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
10302 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10303 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10304 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10305 type
= cp_build_qualified_type (type
, type_quals
);
10307 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
10308 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
10309 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
10310 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
10311 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
10313 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10314 staticp
= 1 + (decl_context
== FIELD
);
10316 if (virtualp
&& staticp
== 2)
10318 cp_error ("member `%D' cannot be declared both virtual and static",
10322 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
10323 RIDBIT_RESET (RID_FRIEND
, specbits
);
10325 /* Warn if two storage classes are given. Default to `auto'. */
10327 if (RIDBIT_ANY_SET (specbits
))
10329 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
10330 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
10331 if (decl_context
== PARM
&& nclasses
> 0)
10332 error ("storage class specifiers invalid in parameter declarations");
10333 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10335 if (decl_context
== PARM
)
10336 error ("typedef declaration invalid in parameter declaration");
10339 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
10340 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
10343 /* Give error if `virtual' is used outside of class declaration. */
10345 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
10347 error ("virtual outside class declaration");
10351 /* Static anonymous unions are dealt with here. */
10352 if (staticp
&& decl_context
== TYPENAME
10353 && TREE_CODE (declspecs
) == TREE_LIST
10354 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
10355 decl_context
= FIELD
;
10357 /* Warn about storage classes that are invalid for certain
10358 kinds of declarations (parameters, typenames, etc.). */
10361 error ("multiple storage classes in declaration of `%s'", name
);
10362 else if (decl_context
!= NORMAL
&& nclasses
> 0)
10364 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
10365 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
10366 || RIDBIT_SETP (RID_AUTO
, specbits
)))
10368 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10370 else if (decl_context
== FIELD
10371 /* C++ allows static class elements */
10372 && RIDBIT_SETP (RID_STATIC
, specbits
))
10373 /* C++ also allows inlines and signed and unsigned elements,
10374 but in those cases we don't come in here. */
10378 if (decl_context
== FIELD
)
10380 tree tmp
= NULL_TREE
;
10381 register int op
= 0;
10385 /* Avoid trying to get an operand off an identifier node. */
10386 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10389 tmp
= TREE_OPERAND (declarator
, 0);
10390 op
= IDENTIFIER_OPNAME_P (tmp
);
10391 if (IDENTIFIER_TYPENAME_P (tmp
))
10393 if (IDENTIFIER_GLOBAL_VALUE (tmp
)
10394 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (tmp
))
10396 name
= IDENTIFIER_POINTER (tmp
);
10398 name
= "<invalid operator>";
10401 error ("storage class specified for %s `%s'",
10402 op
? "member operator" : "field",
10407 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10408 error ("storage class specified for parameter `%s'", name
);
10410 error ("storage class specified for typename");
10412 RIDBIT_RESET (RID_REGISTER
, specbits
);
10413 RIDBIT_RESET (RID_AUTO
, specbits
);
10414 RIDBIT_RESET (RID_EXTERN
, specbits
);
10417 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
10419 if (toplevel_bindings_p ())
10421 /* It's common practice (and completely valid) to have a const
10422 be initialized and declared extern. */
10423 if (!(type_quals
& TYPE_QUAL_CONST
))
10424 warning ("`%s' initialized and declared `extern'", name
);
10427 error ("`%s' has both `extern' and initializer", name
);
10429 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
10430 && ! toplevel_bindings_p ())
10431 error ("nested function `%s' declared `extern'", name
);
10432 else if (toplevel_bindings_p ())
10434 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10435 error ("top-level declaration of `%s' specifies `auto'", name
);
10438 if (nclasses
> 0 && friendp
)
10439 error ("storage class specifiers invalid in friend function declarations");
10441 /* Now figure out the structure of the declarator proper.
10442 Descend through it, creating more complex types, until we reach
10443 the declared identifier (or NULL_TREE, in an absolute declarator). */
10445 inner_attrs
= NULL_TREE
;
10448 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
10449 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
10451 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
10452 an INDIRECT_REF (for *...),
10453 a CALL_EXPR (for ...(...)),
10454 an identifier (for the name being declared)
10455 or a null pointer (for the place in an absolute declarator
10456 where the name was omitted).
10457 For the last two cases, we have just exited the loop.
10459 For C++ it could also be
10460 a SCOPE_REF (for class :: ...). In this case, we have converted
10461 sensible names to types, and those are the values we use to
10462 qualify the member name.
10463 an ADDR_EXPR (for &...),
10464 a BIT_NOT_EXPR (for destructors)
10466 At this point, TYPE is the type of elements of an array,
10467 or for a function to return, or for a pointer to point to.
10468 After this sequence of ifs, TYPE is the type of the
10469 array or function or pointer, and DECLARATOR has had its
10470 outermost layer removed. */
10472 if (type
== error_mark_node
)
10474 if (TREE_CODE (declarator
) == SCOPE_REF
)
10475 declarator
= TREE_OPERAND (declarator
, 1);
10477 declarator
= TREE_OPERAND (declarator
, 0);
10480 if (quals
!= NULL_TREE
10481 && (declarator
== NULL_TREE
10482 || TREE_CODE (declarator
) != SCOPE_REF
))
10484 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
10485 ctype
= TYPE_METHOD_BASETYPE (type
);
10486 if (ctype
!= NULL_TREE
)
10488 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
10489 grok_method_quals (ctype
, dummy
, quals
);
10490 type
= TREE_TYPE (dummy
);
10491 ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
)));
10496 /* See the comment for the TREE_LIST case, below. */
10499 else if (inner_attrs
)
10501 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10502 inner_attrs
= NULL_TREE
;
10505 switch (TREE_CODE (declarator
))
10509 /* We encode a declarator with embedded attributes using
10510 a TREE_LIST. The attributes apply to the declarator
10511 directly inside them, so we have to skip an iteration
10512 before applying them to the type. If the declarator just
10513 inside is the declarator-id, we apply the attrs to the
10515 inner_attrs
= TREE_PURPOSE (declarator
);
10517 declarator
= TREE_VALUE (declarator
);
10523 register tree size
;
10525 size
= TREE_OPERAND (declarator
, 1);
10527 /* VC++ spells a zero-sized array with []. */
10528 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
10529 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10530 size
= integer_zero_node
;
10532 declarator
= TREE_OPERAND (declarator
, 0);
10534 type
= create_array_type_for_decl (dname
, type
, size
);
10536 /* VLAs never work as fields. */
10537 if (decl_context
== FIELD
&& !processing_template_decl
10538 && TREE_CODE (type
) == ARRAY_TYPE
10539 && TYPE_DOMAIN (type
) != NULL_TREE
10540 && !TREE_CONSTANT (TYPE_MAX_VALUE (TYPE_DOMAIN (type
))))
10542 cp_error ("size of member `%D' is not constant", dname
);
10543 /* Proceed with arbitrary constant size, so that offset
10544 computations don't get confused. */
10545 type
= create_array_type_for_decl (dname
, TREE_TYPE (type
),
10557 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
10558 tree inner_decl
= TREE_OPERAND (declarator
, 0);
10560 /* Declaring a function type.
10561 Make sure we have a valid type for the function to return. */
10563 /* We now know that the TYPE_QUALS don't apply to the
10564 decl, but to its return type. */
10565 type_quals
= TYPE_UNQUALIFIED
;
10567 /* Warn about some types functions can't return. */
10569 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10571 error ("`%s' declared as function returning a function", name
);
10572 type
= integer_type_node
;
10574 if (TREE_CODE (type
) == ARRAY_TYPE
)
10576 error ("`%s' declared as function returning an array", name
);
10577 type
= integer_type_node
;
10580 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
10581 inner_decl
= TREE_OPERAND (inner_decl
, 1);
10583 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
10584 inner_decl
= dname
;
10586 /* Pick up type qualifiers which should be applied to `this'. */
10587 quals
= CALL_DECLARATOR_QUALS (declarator
);
10589 /* Pick up the exception specifications. */
10590 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
10592 /* Say it's a definition only for the CALL_EXPR
10593 closest to the identifier. */
10596 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
10597 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
10598 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
10600 if (ctype
== NULL_TREE
10601 && decl_context
== FIELD
10603 && (friendp
== 0 || dname
== current_class_name
))
10604 ctype
= current_class_type
;
10606 if (ctype
&& sfk
== sfk_conversion
)
10607 TYPE_HAS_CONVERSION (ctype
) = 1;
10608 if (ctype
&& constructor_name (ctype
) == dname
)
10610 /* We are within a class's scope. If our declarator name
10611 is the same as the class name, and we are defining
10612 a function, then it is a constructor/destructor, and
10613 therefore returns a void type. */
10615 if (flags
== DTOR_FLAG
)
10617 /* ISO C++ 12.4/2. A destructor may not be
10618 declared const or volatile. A destructor may
10621 error ("destructor cannot be static member function");
10624 cp_error ("destructors may not be `%s'",
10625 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10628 if (decl_context
== FIELD
)
10630 if (! member_function_or_else (ctype
,
10631 current_class_type
,
10633 return void_type_node
;
10636 else /* It's a constructor. */
10638 if (explicitp
== 1)
10640 /* ISO C++ 12.1. A constructor may not be
10641 declared const or volatile. A constructor may
10642 not be virtual. A constructor may not be
10645 error ("constructor cannot be static member function");
10648 pedwarn ("constructors cannot be declared virtual");
10653 cp_error ("constructors may not be `%s'",
10654 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10658 RID_BIT_TYPE tmp_bits
;
10659 bcopy ((void*)&specbits
, (void*)&tmp_bits
, sizeof (RID_BIT_TYPE
));
10660 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10661 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10662 if (RIDBIT_ANY_SET (tmp_bits
))
10663 error ("return value type specifier for constructor ignored");
10665 if (decl_context
== FIELD
)
10667 if (! member_function_or_else (ctype
,
10668 current_class_type
,
10670 return void_type_node
;
10671 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10672 if (sfk
!= sfk_constructor
)
10676 if (decl_context
== FIELD
)
10682 error ("can't initialize friend function `%s'", name
);
10685 /* Cannot be both friend and virtual. */
10686 error ("virtual functions cannot be friends");
10687 RIDBIT_RESET (RID_FRIEND
, specbits
);
10690 if (decl_context
== NORMAL
)
10691 error ("friend declaration not in class definition");
10692 if (current_function_decl
&& funcdef_flag
)
10693 cp_error ("can't define friend function `%s' in a local class definition",
10697 /* Construct the function type and go to the next
10698 inner layer of declarator. */
10700 declarator
= TREE_OPERAND (declarator
, 0);
10702 /* FIXME: This is where default args should be fully
10705 arg_types
= grokparms (inner_parms
, funcdecl_p
? funcdef_flag
: 0);
10707 if (declarator
&& flags
== DTOR_FLAG
)
10709 /* A destructor declared in the body of a class will
10710 be represented as a BIT_NOT_EXPR. But, we just
10711 want the underlying IDENTIFIER. */
10712 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10713 declarator
= TREE_OPERAND (declarator
, 0);
10715 if (arg_types
!= void_list_node
)
10717 cp_error ("destructors may not have parameters");
10718 arg_types
= void_list_node
;
10719 last_function_parms
= NULL_TREE
;
10723 /* ANSI says that `const int foo ();'
10724 does not make the function foo const. */
10725 type
= build_function_type (type
, arg_types
);
10729 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10730 if (TREE_PURPOSE (t
)
10731 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10733 add_defarg_fn (type
);
10742 /* Filter out pointers-to-references and references-to-references.
10743 We can get these if a TYPE_DECL is used. */
10745 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10747 error ("cannot declare %s to references",
10748 TREE_CODE (declarator
) == ADDR_EXPR
10749 ? "references" : "pointers");
10750 declarator
= TREE_OPERAND (declarator
, 0);
10754 if (TREE_CODE (type
) == OFFSET_TYPE
10755 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10756 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10758 cp_error ("cannot declare pointer to `%#T' member",
10760 type
= TREE_TYPE (type
);
10763 /* Merge any constancy or volatility into the target type
10764 for the pointer. */
10766 /* We now know that the TYPE_QUALS don't apply to the decl,
10767 but to the target of the pointer. */
10768 type_quals
= TYPE_UNQUALIFIED
;
10770 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10772 if (TREE_CODE (type
) == VOID_TYPE
)
10773 error ("invalid type: `void &'");
10775 type
= build_reference_type (type
);
10777 else if (TREE_CODE (type
) == METHOD_TYPE
)
10778 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10780 type
= build_pointer_type (type
);
10782 /* Process a list of type modifier keywords (such as
10783 const or volatile) that were given inside the `*' or `&'. */
10785 if (TREE_TYPE (declarator
))
10787 register tree typemodlist
;
10793 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10794 typemodlist
= TREE_CHAIN (typemodlist
))
10796 tree qualifier
= TREE_VALUE (typemodlist
);
10798 if (qualifier
== ridpointers
[(int) RID_CONST
])
10800 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10802 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10807 error ("invalid type modifier within pointer declarator");
10811 pedwarn ("duplicate `const'");
10813 pedwarn ("duplicate `volatile'");
10815 pedwarn ("duplicate `restrict'");
10817 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10818 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10819 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10820 if (TREE_CODE (declarator
) == ADDR_EXPR
10821 && (constp
|| volatilep
))
10824 pedwarn ("discarding `const' applied to a reference");
10826 pedwarn ("discarding `volatile' applied to a reference");
10827 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10829 type
= cp_build_qualified_type (type
, type_quals
);
10831 declarator
= TREE_OPERAND (declarator
, 0);
10837 /* We have converted type names to NULL_TREE if the
10838 name was bogus, or to a _TYPE node, if not.
10840 The variable CTYPE holds the type we will ultimately
10841 resolve to. The code here just needs to build
10842 up appropriate member types. */
10843 tree sname
= TREE_OPERAND (declarator
, 1);
10846 /* Destructors can have their visibilities changed as well. */
10847 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10848 sname
= TREE_OPERAND (sname
, 0);
10850 if (TREE_COMPLEXITY (declarator
) == 0)
10851 /* This needs to be here, in case we are called
10852 multiple times. */ ;
10853 else if (TREE_COMPLEXITY (declarator
) == -1)
10854 /* Namespace member. */
10855 pop_decl_namespace ();
10856 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10857 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10858 else if (! IS_AGGR_TYPE_CODE
10859 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10861 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10863 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10864 that refer to ctype. They couldn't be resolved earlier
10865 because we hadn't pushed into the class yet.
10866 Example: resolve 'B<T>::type' in
10867 'B<typename B<T>::type> B<T>::f () { }'. */
10868 if (current_template_parms
10869 && uses_template_parms (type
)
10870 && uses_template_parms (current_class_type
))
10872 tree args
= current_template_args ();
10873 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10876 /* This pop_nested_class corresponds to the
10877 push_nested_class used to push into class scope for
10878 parsing the argument list of a function decl, in
10880 pop_nested_class ();
10881 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10884 my_friendly_abort (16);
10886 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10888 /* We had a reference to a global decl, or
10889 perhaps we were given a non-aggregate typedef,
10890 in which case we cleared this out, and should just
10891 keep going as though it wasn't there. */
10892 declarator
= sname
;
10895 ctype
= TREE_OPERAND (declarator
, 0);
10898 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10900 /* You're supposed to have one `template <...>'
10901 for every template class, but you don't need one
10902 for a full specialization. For example:
10904 template <class T> struct S{};
10905 template <> struct S<int> { void f(); };
10906 void S<int>::f () {}
10908 is correct; there shouldn't be a `template <>' for
10909 the definition of `S<int>::f'. */
10910 if (CLASSTYPE_TEMPLATE_INFO (t
)
10911 && (CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
10912 || uses_template_parms (CLASSTYPE_TI_ARGS (t
))))
10913 template_count
+= 1;
10915 t
= TYPE_MAIN_DECL (t
);
10916 if (DECL_LANG_SPECIFIC (t
))
10917 t
= DECL_CONTEXT (t
);
10922 if (sname
== NULL_TREE
)
10925 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10927 /* This is the `standard' use of the scoping operator:
10928 basetype :: member . */
10930 if (ctype
== current_class_type
)
10936 Is this ill-formed? */
10939 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10942 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10944 if (current_class_type
== NULL_TREE
10946 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10947 TYPE_ARG_TYPES (type
));
10950 cp_error ("cannot declare member function `%T::%s' within `%T'",
10951 ctype
, name
, current_class_type
);
10952 return void_type_node
;
10955 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10956 || COMPLETE_TYPE_P (complete_type (ctype
)))
10958 /* Have to move this code elsewhere in this function.
10959 this code is used for i.e., typedef int A::M; M *pm;
10961 It is? How? jason 10/2/94 */
10963 if (current_class_type
)
10965 cp_error ("cannot declare member `%T::%s' within `%T'",
10966 ctype
, name
, current_class_type
);
10967 return void_type_node
;
10969 type
= build_offset_type (ctype
, type
);
10971 else if (uses_template_parms (ctype
))
10973 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10975 = build_cplus_method_type (ctype
, TREE_TYPE (type
),
10976 TYPE_ARG_TYPES (type
));
10980 cp_error ("structure `%T' not yet defined", ctype
);
10981 return error_mark_node
;
10984 declarator
= sname
;
10986 else if (TREE_CODE (sname
) == SCOPE_REF
)
10987 my_friendly_abort (17);
10991 declarator
= TREE_OPERAND (declarator
, 1);
10992 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10993 /* In this case, we will deal with it later. */
10997 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10998 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10999 TYPE_ARG_TYPES (type
));
11001 type
= build_offset_type (ctype
, type
);
11008 declarator
= TREE_OPERAND (declarator
, 0);
11013 case ENUMERAL_TYPE
:
11014 declarator
= NULL_TREE
;
11018 declarator
= NULL_TREE
;
11022 my_friendly_abort (158);
11026 /* See the comment for the TREE_LIST case, above. */
11029 if (! ignore_attrs
)
11030 decl_attributes (type
, inner_attrs
, NULL_TREE
);
11032 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
11034 attrlist
= build_decl_list (NULL_TREE
, inner_attrs
);
11037 /* Now TYPE has the actual type. */
11039 if (explicitp
== 1 || (explicitp
&& friendp
))
11041 /* [dcl.fct.spec] The explicit specifier shall only be used in
11042 declarations of constructors within a class definition. */
11043 error ("only declarations of constructors can be `explicit'");
11047 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11049 if (current_class_name
== NULL_TREE
|| decl_context
== PARM
|| friendp
)
11051 error ("non-member `%s' cannot be declared `mutable'", name
);
11052 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11054 else if (decl_context
== TYPENAME
|| RIDBIT_SETP (RID_TYPEDEF
, specbits
))
11056 error ("non-object member `%s' cannot be declared `mutable'", name
);
11057 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11059 else if (TREE_CODE (type
) == FUNCTION_TYPE
11060 || TREE_CODE (type
) == METHOD_TYPE
)
11062 error ("function `%s' cannot be declared `mutable'", name
);
11063 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11067 error ("static `%s' cannot be declared `mutable'", name
);
11068 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11070 else if (type_quals
& TYPE_QUAL_CONST
)
11072 error ("const `%s' cannot be declared `mutable'", name
);
11073 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11077 if (declarator
== NULL_TREE
11078 || TREE_CODE (declarator
) == IDENTIFIER_NODE
11079 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
11080 && (TREE_CODE (type
) == FUNCTION_TYPE
11081 || TREE_CODE (type
) == METHOD_TYPE
)))
11083 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11085 cp_error ("template-id `%D' used as a declarator", declarator
);
11086 declarator
= dname
;
11089 /* Unexpected declarator format. */
11090 my_friendly_abort (990210);
11092 /* If this is declaring a typedef name, return a TYPE_DECL. */
11094 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
11098 /* Note that the grammar rejects storage classes
11099 in typenames, fields or parameters. */
11100 if (current_lang_name
== lang_name_java
)
11101 TYPE_FOR_JAVA (type
) = 1;
11103 if (decl_context
== FIELD
)
11105 if (declarator
== constructor_name (current_class_type
))
11106 cp_pedwarn ("ISO C++ forbids nested type `%D' with same name as enclosing class",
11108 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
11111 decl
= build_decl (TYPE_DECL
, declarator
, type
);
11113 /* If the user declares "typedef struct {...} foo" then the
11114 struct will have an anonymous name. Fill that name in now.
11115 Nothing can refer to it, so nothing needs know about the name
11117 if (type
!= error_mark_node
11119 && TYPE_NAME (type
)
11120 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
11121 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
11122 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
11124 tree oldname
= TYPE_NAME (type
);
11127 /* Replace the anonymous name with the real name everywhere. */
11128 lookup_tag_reverse (type
, declarator
);
11129 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
11130 if (TYPE_NAME (t
) == oldname
)
11131 TYPE_NAME (t
) = decl
;
11133 if (TYPE_LANG_SPECIFIC (type
))
11134 TYPE_WAS_ANONYMOUS (type
) = 1;
11136 /* If this is a typedef within a template class, the nested
11137 type is a (non-primary) template. The name for the
11138 template needs updating as well. */
11139 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
11140 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
11141 = TYPE_IDENTIFIER (type
);
11144 DECL_ASSEMBLER_NAME (decl
) = mangle_type (type
);
11147 /* XXX Temporarily set the scope.
11148 When returning, start_decl expects it as NULL_TREE,
11149 and will then then set it using pushdecl. */
11150 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
11151 if (current_class_type
)
11152 DECL_CONTEXT (decl
) = current_class_type
;
11154 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
11156 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
11157 DECL_ASSEMBLER_NAME (decl
)
11158 = get_identifier (build_overload_name (type
, 1, 1));
11159 DECL_CONTEXT (decl
) = NULL_TREE
;
11162 /* FIXME remangle member functions; member functions of a
11163 type with external linkage have external linkage. */
11166 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11168 cp_error_at ("typedef name may not be class-qualified", decl
);
11173 if (ctype
== NULL_TREE
)
11175 if (TREE_CODE (type
) != METHOD_TYPE
)
11176 cp_error_at ("invalid type qualifier for non-member function type", decl
);
11178 ctype
= TYPE_METHOD_BASETYPE (type
);
11180 if (ctype
!= NULL_TREE
)
11181 grok_method_quals (ctype
, decl
, quals
);
11184 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
11185 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
11186 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
11188 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
11189 inlinep
, friendp
, raises
!= NULL_TREE
);
11192 error ("typedef declaration includes an initializer");
11197 /* Detect the case of an array type of unspecified size
11198 which came, as such, direct from a typedef name.
11199 We must copy the type, so that each identifier gets
11200 a distinct type, so that each identifier's size can be
11201 controlled separately by its own initializer. */
11203 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
11204 && TYPE_DOMAIN (type
) == NULL_TREE
)
11206 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
11209 /* If this is a type name (such as, in a cast or sizeof),
11210 compute the type and return it now. */
11212 if (decl_context
== TYPENAME
)
11214 /* Note that the grammar rejects storage classes
11215 in typenames, fields or parameters. */
11216 if (type_quals
!= TYPE_UNQUALIFIED
)
11217 type_quals
= TYPE_UNQUALIFIED
;
11219 /* Special case: "friend class foo" looks like a TYPENAME context. */
11222 if (type_quals
!= TYPE_UNQUALIFIED
)
11224 cp_error ("type qualifiers specified for friend class declaration");
11225 type_quals
= TYPE_UNQUALIFIED
;
11229 cp_error ("`inline' specified for friend class declaration");
11232 if (!current_aggr
&& TREE_CODE (type
) != TYPENAME_TYPE
)
11234 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
11235 cp_error ("template parameters cannot be friends");
11237 cp_error ("friend declaration requires `%#T'", type
);
11240 /* Only try to do this stuff if we didn't already give up. */
11241 if (type
!= integer_type_node
)
11243 /* A friendly class? */
11244 if (current_class_type
)
11245 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
11247 cp_error ("trying to make class `%T' a friend of global scope",
11249 type
= void_type_node
;
11254 if (ctype
== NULL_TREE
)
11256 if (TREE_CODE (type
) != METHOD_TYPE
)
11257 cp_error ("invalid qualifiers on non-member function type");
11259 ctype
= TYPE_METHOD_BASETYPE (type
);
11263 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
11264 grok_method_quals (ctype
, dummy
, quals
);
11265 type
= TREE_TYPE (dummy
);
11271 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
11272 && decl_context
!= CATCHPARM
11273 && TREE_CODE (type
) != UNION_TYPE
11276 cp_error ("abstract declarator `%T' used as declaration", type
);
11277 declarator
= make_anon_name ();
11280 /* `void' at top level (not within pointer)
11281 is allowed only in typedefs or type names.
11282 We don't complain about parms either, but that is because
11283 a better error message can be made later. */
11285 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
11288 error ("unnamed variable or field declared void");
11289 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
11291 if (IDENTIFIER_OPNAME_P (declarator
))
11292 my_friendly_abort (356);
11294 error ("variable or field `%s' declared void", name
);
11297 error ("variable or field declared void");
11298 type
= integer_type_node
;
11301 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
11302 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
11304 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
11306 if (ctype
|| in_namespace
)
11307 error ("cannot use `::' in parameter declaration");
11309 /* A parameter declared as an array of T is really a pointer to T.
11310 One declared as a function is really a pointer to a function.
11311 One declared as a member is really a pointer to member. */
11313 if (TREE_CODE (type
) == ARRAY_TYPE
)
11315 /* Transfer const-ness of array into that of type pointed to. */
11316 type
= build_pointer_type (TREE_TYPE (type
));
11317 type_quals
= TYPE_UNQUALIFIED
;
11319 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11320 type
= build_pointer_type (type
);
11321 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11322 type
= build_pointer_type (type
);
11323 else if (TREE_CODE (type
) == VOID_TYPE
&& declarator
)
11325 error ("declaration of `%s' as void", name
);
11331 register tree decl
;
11333 if (decl_context
== PARM
)
11335 decl
= build_decl (PARM_DECL
, declarator
, type
);
11337 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
11338 inlinep
, friendp
, raises
!= NULL_TREE
);
11340 /* Compute the type actually passed in the parmlist,
11341 for the case where there is no prototype.
11342 (For example, shorts and chars are passed as ints.)
11343 When there is a prototype, this is overridden later. */
11345 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
11347 else if (decl_context
== FIELD
)
11349 if (type
== error_mark_node
)
11351 /* Happens when declaring arrays of sizes which
11352 are error_mark_node, for example. */
11355 else if (in_namespace
&& !friendp
)
11357 /* Something like struct S { int N::j; }; */
11358 cp_error ("invalid use of `::'");
11361 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11364 tree function_context
;
11366 /* We catch the others as conflicts with the builtin
11368 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
11370 cp_error ("function `%D' cannot be declared friend",
11377 if (ctype
== NULL_TREE
)
11378 ctype
= current_class_type
;
11380 if (ctype
== NULL_TREE
)
11382 cp_error ("can't make `%D' into a method -- not in a class",
11384 return void_type_node
;
11387 /* ``A union may [ ... ] not [ have ] virtual functions.''
11389 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
11391 cp_error ("function `%D' declared virtual inside a union",
11393 return void_type_node
;
11396 if (declarator
== ansi_opname (NEW_EXPR
)
11397 || declarator
== ansi_opname (VEC_NEW_EXPR
)
11398 || declarator
== ansi_opname (DELETE_EXPR
)
11399 || declarator
== ansi_opname (VEC_DELETE_EXPR
))
11403 cp_error ("`%D' cannot be declared virtual, since it is always static",
11408 else if (staticp
< 2)
11409 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11410 TYPE_ARG_TYPES (type
));
11413 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
11414 function_context
= (ctype
!= NULL_TREE
) ?
11415 decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
11416 publicp
= (! friendp
|| ! staticp
)
11417 && function_context
== NULL_TREE
;
11418 decl
= grokfndecl (ctype
, type
,
11419 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
11420 ? declarator
: dname
,
11422 virtualp
, flags
, quals
, raises
,
11423 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
11424 funcdef_flag
, template_count
, in_namespace
);
11425 if (decl
== NULL_TREE
)
11428 /* This clobbers the attrs stored in `decl' from `attrlist'. */
11429 /* The decl and setting of decl_machine_attr is also turned off. */
11430 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
11433 /* [class.conv.ctor]
11435 A constructor declared without the function-specifier
11436 explicit that can be called with a single parameter
11437 specifies a conversion from the type of its first
11438 parameter to the type of its class. Such a constructor
11439 is called a converting constructor. */
11440 if (explicitp
== 2)
11441 DECL_NONCONVERTING_P (decl
) = 1;
11442 else if (DECL_CONSTRUCTOR_P (decl
))
11444 /* The constructor can be called with exactly one
11445 parameter if there is at least one parameter, and
11446 any subsequent parameters have default arguments.
11447 We don't look at the first parameter, which is
11448 really just the `this' parameter for the new
11451 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
11453 /* Skip the `in_chrg' argument too, if present. */
11454 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
11455 arg_types
= TREE_CHAIN (arg_types
);
11457 if (arg_types
== void_list_node
11459 && TREE_CHAIN (arg_types
)
11460 && TREE_CHAIN (arg_types
) != void_list_node
11461 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
11462 DECL_NONCONVERTING_P (decl
) = 1;
11465 else if (TREE_CODE (type
) == METHOD_TYPE
)
11467 /* We only get here for friend declarations of
11468 members of other classes. */
11469 /* All method decls are public, so tell grokfndecl to set
11470 TREE_PUBLIC, also. */
11471 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
11472 virtualp
, flags
, quals
, raises
,
11473 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
11474 template_count
, in_namespace
);
11475 if (decl
== NULL_TREE
)
11478 else if (!staticp
&& ! processing_template_decl
11479 && !COMPLETE_TYPE_P (complete_type (type
))
11480 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
11483 cp_error ("field `%D' has incomplete type", declarator
);
11485 cp_error ("name `%T' has incomplete type", type
);
11487 /* If we're instantiating a template, tell them which
11488 instantiation made the field's type be incomplete. */
11489 if (current_class_type
11490 && TYPE_NAME (current_class_type
)
11491 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
11492 && declspecs
&& TREE_VALUE (declspecs
)
11493 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
11494 cp_error (" in instantiation of template `%T'",
11495 current_class_type
);
11497 type
= error_mark_node
;
11504 error ("`%s' is neither function nor member function; cannot be declared friend",
11505 IDENTIFIER_POINTER (declarator
));
11513 /* Friends are treated specially. */
11514 if (ctype
== current_class_type
)
11515 warning ("member functions are implicitly friends of their class");
11518 tree t
= NULL_TREE
;
11519 if (decl
&& DECL_NAME (decl
))
11521 if (template_class_depth (current_class_type
) == 0)
11524 = check_explicit_specialization
11526 template_count
, 2 * (funcdef_flag
!= 0) + 4);
11527 if (decl
== error_mark_node
)
11528 return error_mark_node
;
11531 t
= do_friend (ctype
, declarator
, decl
,
11532 last_function_parms
, attrlist
, flags
, quals
,
11535 if (t
&& funcdef_flag
)
11538 return void_type_node
;
11542 /* Structure field. It may not be a function, except for C++ */
11544 if (decl
== NULL_TREE
)
11550 /* An attempt is being made to initialize a non-static
11551 member. But, from [class.mem]:
11553 4 A member-declarator can contain a
11554 constant-initializer only if it declares a static
11555 member (_class.static_) of integral or enumeration
11556 type, see _class.static.data_.
11558 This used to be relatively common practice, but
11559 the rest of the compiler does not correctly
11560 handle the initialization unless the member is
11561 static so we make it static below. */
11562 cp_pedwarn ("ISO C++ forbids initialization of member `%D'",
11564 cp_pedwarn ("making `%D' static", declarator
);
11568 if (uses_template_parms (type
))
11569 /* We'll check at instantiation time. */
11571 else if (check_static_variable_definition (declarator
,
11573 /* If we just return the declaration, crashes
11574 will sometimes occur. We therefore return
11575 void_type_node, as if this was a friend
11576 declaration, to cause callers to completely
11577 ignore this declaration. */
11578 return void_type_node
;
11581 /* 9.2p13 [class.mem] */
11582 if (declarator
== constructor_name (current_class_type
)
11583 /* The standard does not allow non-static data members
11584 here either, but we agreed at the 10/99 meeting
11585 to change that in TC 1 so that they are allowed in
11586 classes with no user-defined constructors. */
11588 cp_pedwarn ("ISO C++ forbids static data member `%D' with same name as enclosing class",
11593 /* C++ allows static class members. All other work
11594 for this is done by grokfield. */
11595 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
11596 TREE_STATIC (decl
) = 1;
11597 /* In class context, 'static' means public access. */
11598 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
11602 decl
= build_decl (FIELD_DECL
, declarator
, type
);
11603 DECL_NONADDRESSABLE_P (decl
) = bitfield
;
11604 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11606 DECL_MUTABLE_P (decl
) = 1;
11607 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11611 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
11612 inlinep
, friendp
, raises
!= NULL_TREE
);
11615 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11617 tree original_name
;
11623 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11624 original_name
= dname
;
11626 original_name
= declarator
;
11628 if (RIDBIT_SETP (RID_AUTO
, specbits
))
11629 error ("storage class `auto' invalid for function `%s'", name
);
11630 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11631 error ("storage class `register' invalid for function `%s'", name
);
11633 /* Function declaration not at top level.
11634 Storage classes other than `extern' are not allowed
11635 and `extern' makes no difference. */
11636 if (! toplevel_bindings_p ()
11637 && (RIDBIT_SETP (RID_STATIC
, specbits
)
11638 || RIDBIT_SETP (RID_INLINE
, specbits
))
11641 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11642 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
11644 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
11647 if (ctype
== NULL_TREE
)
11651 error ("virtual non-class function `%s'", name
);
11655 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
11656 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11657 TYPE_ARG_TYPES (type
));
11659 /* Record presence of `static'. */
11660 publicp
= (ctype
!= NULL_TREE
11661 || RIDBIT_SETP (RID_EXTERN
, specbits
)
11662 || !RIDBIT_SETP (RID_STATIC
, specbits
));
11664 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
11665 virtualp
, flags
, quals
, raises
,
11667 publicp
, inlinep
, funcdef_flag
,
11668 template_count
, in_namespace
);
11669 if (decl
== NULL_TREE
)
11674 int illegal_static
= 0;
11676 /* Don't allow a static member function in a class, and forbid
11677 declaring main to be static. */
11678 if (TREE_CODE (type
) == METHOD_TYPE
)
11680 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11681 illegal_static
= 1;
11683 else if (current_function_decl
)
11685 /* FIXME need arm citation */
11686 error ("cannot declare static function inside another function");
11687 illegal_static
= 1;
11690 if (illegal_static
)
11693 RIDBIT_RESET (RID_STATIC
, specbits
);
11699 /* It's a variable. */
11701 /* An uninitialized decl with `extern' is a reference. */
11702 decl
= grokvardecl (type
, declarator
, &specbits
,
11704 (type_quals
& TYPE_QUAL_CONST
) != 0,
11706 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11707 inlinep
, friendp
, raises
!= NULL_TREE
);
11711 DECL_CONTEXT (decl
) = ctype
;
11714 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11716 RIDBIT_RESET (RID_STATIC
, specbits
);
11718 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11720 cp_error ("static member `%D' declared `register'", decl
);
11721 RIDBIT_RESET (RID_REGISTER
, specbits
);
11723 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11725 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11727 RIDBIT_RESET (RID_EXTERN
, specbits
);
11732 my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE
, specbits
), 19990927);
11734 /* Record `register' declaration for warnings on &
11735 and in case doing stupid register allocation. */
11737 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11738 DECL_REGISTER (decl
) = 1;
11740 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11741 DECL_THIS_EXTERN (decl
) = 1;
11743 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11744 DECL_THIS_STATIC (decl
) = 1;
11746 /* Record constancy and volatility. There's no need to do this
11747 when processing a template; we'll do this for the instantiated
11748 declaration based on the type of DECL. */
11749 if (!processing_template_decl
)
11750 c_apply_type_quals_to_decl (type_quals
, decl
);
11756 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11757 An empty exprlist is a parmlist. An exprlist which
11758 contains only identifiers at the global level
11759 is a parmlist. Otherwise, it is an exprlist. */
11762 parmlist_is_exprlist (exprs
)
11765 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11768 if (toplevel_bindings_p ())
11770 /* At the global level, if these are all identifiers,
11771 then it is a parmlist. */
11774 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11776 exprs
= TREE_CHAIN (exprs
);
11783 /* Subroutine of start_function. Ensure that each of the parameter
11784 types (as listed in PARMS) is complete, as is required for a
11785 function definition. */
11788 require_complete_types_for_parms (parms
)
11791 for (; parms
; parms
= TREE_CHAIN (parms
))
11793 tree type
= TREE_TYPE (parms
);
11795 /* Try to complete the TYPE. */
11796 type
= complete_type (type
);
11798 if (type
== error_mark_node
)
11801 if (!COMPLETE_TYPE_P (type
))
11803 if (DECL_NAME (parms
))
11804 error ("parameter `%s' has incomplete type",
11805 IDENTIFIER_POINTER (DECL_NAME (parms
)));
11807 error ("parameter has incomplete type");
11808 TREE_TYPE (parms
) = error_mark_node
;
11811 layout_decl (parms
, 0);
11815 /* Returns non-zero if T is a local variable. */
11818 local_variable_p (t
)
11821 if ((TREE_CODE (t
) == VAR_DECL
11822 /* A VAR_DECL with a context that is a _TYPE is a static data
11824 && !TYPE_P (CP_DECL_CONTEXT (t
))
11825 /* Any other non-local variable must be at namespace scope. */
11826 && !DECL_NAMESPACE_SCOPE_P (t
))
11827 || (TREE_CODE (t
) == PARM_DECL
))
11833 /* Returns non-zero if T is an automatic local variable or a label.
11834 (These are the declarations that need to be remapped when the code
11835 containing them is duplicated.) */
11838 nonstatic_local_decl_p (t
)
11841 return ((local_variable_p (t
) && !TREE_STATIC (t
))
11842 || TREE_CODE (t
) == LABEL_DECL
11843 || TREE_CODE (t
) == RESULT_DECL
);
11846 /* Like local_variable_p, but suitable for use as a tree-walking
11850 local_variable_p_walkfn (tp
, walk_subtrees
, data
)
11852 int *walk_subtrees ATTRIBUTE_UNUSED
;
11853 void *data ATTRIBUTE_UNUSED
;
11855 return ((local_variable_p (*tp
) && !DECL_ARTIFICIAL (*tp
))
11856 ? *tp
: NULL_TREE
);
11859 /* Check that ARG, which is a default-argument expression for a
11860 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11861 something goes wrong. DECL may also be a _TYPE node, rather than a
11862 DECL, if there is no DECL available. */
11865 check_default_argument (decl
, arg
)
11872 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11873 /* We get a DEFAULT_ARG when looking at an in-class declaration
11874 with a default argument. Ignore the argument for now; we'll
11875 deal with it after the class is complete. */
11878 if (processing_template_decl
|| uses_template_parms (arg
))
11879 /* We don't do anything checking until instantiation-time. Note
11880 that there may be uninstantiated arguments even for an
11881 instantiated function, since default arguments are not
11882 instantiated until they are needed. */
11891 decl_type
= TREE_TYPE (decl
);
11893 if (arg
== error_mark_node
11894 || decl
== error_mark_node
11895 || TREE_TYPE (arg
) == error_mark_node
11896 || decl_type
== error_mark_node
)
11897 /* Something already went wrong. There's no need to check
11899 return error_mark_node
;
11901 /* [dcl.fct.default]
11903 A default argument expression is implicitly converted to the
11905 if (!TREE_TYPE (arg
)
11906 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11909 cp_error ("default argument for `%#D' has type `%T'",
11910 decl
, TREE_TYPE (arg
));
11912 cp_error ("default argument for parameter of type `%T' has type `%T'",
11913 decl_type
, TREE_TYPE (arg
));
11915 return error_mark_node
;
11918 /* [dcl.fct.default]
11920 Local variables shall not be used in default argument
11923 The keyword `this' shall not be used in a default argument of a
11924 member function. */
11925 var
= walk_tree (&arg
, local_variable_p_walkfn
, NULL
);
11928 cp_error ("default argument `%E' uses local variable `%D'",
11930 return error_mark_node
;
11937 /* Decode the list of parameter types for a function type.
11938 Given the list of things declared inside the parens,
11939 return a list of types.
11941 The list we receive can have three kinds of elements:
11942 an IDENTIFIER_NODE for names given without types,
11943 a TREE_LIST node for arguments given as typespecs or names with typespecs,
11944 or void_type_node, to mark the end of an argument list
11945 when additional arguments are not permitted (... was not used).
11947 FUNCDEF_FLAG is nonzero for a function definition, 0 for
11948 a mere declaration. A nonempty identifier-list gets an error message
11949 when FUNCDEF_FLAG is zero.
11950 If FUNCDEF_FLAG is 1, then parameter types must be complete.
11951 If FUNCDEF_FLAG is -1, then parameter types may be incomplete.
11953 If all elements of the input list contain types,
11954 we return a list of the types.
11955 If all elements contain no type (except perhaps a void_type_node
11956 at the end), we return a null list.
11957 If some have types and some do not, it is an error, and we
11958 return a null list.
11960 Also set last_function_parms to either
11961 a list of names (IDENTIFIER_NODEs) or a chain of PARM_DECLs.
11962 A list of names is converted to a chain of PARM_DECLs
11963 by store_parm_decls so that ultimately it is always a chain of decls.
11965 Note that in C++, parameters can take default values. These default
11966 values are in the TREE_PURPOSE field of the TREE_LIST. It is
11967 an error to specify default values which are followed by parameters
11968 that have no default values, or an ELLIPSES. For simplicities sake,
11969 only parameters which are specified with their types can take on
11973 grokparms (first_parm
, funcdef_flag
)
11977 tree result
= NULL_TREE
;
11978 tree decls
= NULL_TREE
;
11980 if (first_parm
!= NULL_TREE
11981 && TREE_CODE (TREE_VALUE (first_parm
)) == IDENTIFIER_NODE
)
11983 if (! funcdef_flag
)
11984 pedwarn ("parameter names (without types) in function declaration");
11985 last_function_parms
= first_parm
;
11988 else if (first_parm
!= NULL_TREE
11989 && TREE_CODE (TREE_VALUE (first_parm
)) != TREE_LIST
11990 && TREE_CODE (TREE_VALUE (first_parm
)) != VOID_TYPE
)
11991 my_friendly_abort (145);
11994 /* Types were specified. This is a list of declarators
11995 each represented as a TREE_LIST node. */
11996 register tree parm
, chain
;
11997 int any_init
= 0, any_error
= 0;
11999 if (first_parm
!= NULL_TREE
)
12001 tree last_result
= NULL_TREE
;
12002 tree last_decl
= NULL_TREE
;
12004 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
12006 tree type
= NULL_TREE
, list_node
= parm
;
12007 register tree decl
= TREE_VALUE (parm
);
12008 tree init
= TREE_PURPOSE (parm
);
12010 chain
= TREE_CHAIN (parm
);
12011 /* @@ weak defense against parse errors. */
12012 if (TREE_CODE (decl
) != VOID_TYPE
12013 && TREE_CODE (decl
) != TREE_LIST
)
12015 /* Give various messages as the need arises. */
12016 if (TREE_CODE (decl
) == STRING_CST
)
12017 cp_error ("invalid string constant `%E'", decl
);
12018 else if (TREE_CODE (decl
) == INTEGER_CST
)
12019 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
12023 if (TREE_CODE (decl
) != VOID_TYPE
)
12025 decl
= grokdeclarator (TREE_VALUE (decl
),
12026 TREE_PURPOSE (decl
),
12027 PARM
, init
!= NULL_TREE
,
12029 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
12032 /* Top-level qualifiers on the parameters are
12033 ignored for function types. */
12034 type
= TYPE_MAIN_VARIANT (TREE_TYPE (decl
));
12036 if (TREE_CODE (type
) == VOID_TYPE
)
12037 decl
= void_type_node
;
12038 else if (TREE_CODE (type
) == METHOD_TYPE
)
12040 if (DECL_NAME (decl
))
12041 /* Cannot use the decl here because
12042 we don't have DECL_CONTEXT set up yet. */
12043 cp_error ("parameter `%D' invalidly declared method type",
12046 error ("parameter invalidly declared method type");
12047 type
= build_pointer_type (type
);
12048 TREE_TYPE (decl
) = type
;
12050 else if (TREE_CODE (type
) == OFFSET_TYPE
)
12052 if (DECL_NAME (decl
))
12053 cp_error ("parameter `%D' invalidly declared offset type",
12056 error ("parameter invalidly declared offset type");
12057 type
= build_pointer_type (type
);
12058 TREE_TYPE (decl
) = type
;
12060 else if (abstract_virtuals_error (decl
, type
))
12061 any_error
= 1; /* Seems like a good idea. */
12062 else if (POINTER_TYPE_P (type
))
12065 while (POINTER_TYPE_P (t
)
12066 || (TREE_CODE (t
) == ARRAY_TYPE
12067 && TYPE_DOMAIN (t
) != NULL_TREE
))
12069 if (TREE_CODE (t
) == ARRAY_TYPE
)
12070 cp_error ("parameter type `%T' includes %s to array of unknown bound",
12072 TYPE_PTR_P (type
) ? "pointer" : "reference");
12076 if (TREE_CODE (decl
) == VOID_TYPE
)
12078 if (result
== NULL_TREE
)
12080 result
= void_list_node
;
12081 last_result
= result
;
12085 TREE_CHAIN (last_result
) = void_list_node
;
12086 last_result
= void_list_node
;
12089 && (chain
!= void_list_node
|| TREE_CHAIN (chain
)))
12090 error ("`void' in parameter list must be entire list");
12094 /* Since there is a prototype, args are passed in their own types. */
12095 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
12096 if (PROMOTE_PROTOTYPES
12097 && (TREE_CODE (type
) == INTEGER_TYPE
12098 || TREE_CODE (type
) == ENUMERAL_TYPE
)
12099 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
12100 DECL_ARG_TYPE (decl
) = integer_type_node
;
12101 if (!any_error
&& init
)
12104 init
= check_default_argument (decl
, init
);
12109 if (decls
== NULL_TREE
)
12116 TREE_CHAIN (last_decl
) = decl
;
12119 list_node
= tree_cons (init
, type
, NULL_TREE
);
12120 if (result
== NULL_TREE
)
12122 result
= list_node
;
12123 last_result
= result
;
12127 TREE_CHAIN (last_result
) = list_node
;
12128 last_result
= list_node
;
12132 TREE_CHAIN (last_result
) = NULL_TREE
;
12133 /* If there are no parameters, and the function does not end
12134 with `...', then last_decl will be NULL_TREE. */
12135 if (last_decl
!= NULL_TREE
)
12136 TREE_CHAIN (last_decl
) = NULL_TREE
;
12140 last_function_parms
= decls
;
12145 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
12146 FUNCTION_TYPE with the newly parsed version of its default argument, which
12147 was previously digested as text. See snarf_defarg et al in lex.c. */
12150 replace_defarg (arg
, init
)
12153 if (! processing_template_decl
12154 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
12155 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
12156 TREE_TYPE (init
), TREE_VALUE (arg
));
12157 TREE_PURPOSE (arg
) = init
;
12160 /* D is a constructor or overloaded `operator='. Returns non-zero if
12161 D's arguments allow it to be a copy constructor, or copy assignment
12170 if (!DECL_FUNCTION_MEMBER_P (d
))
12173 t
= FUNCTION_ARG_CHAIN (d
);
12174 if (DECL_CONSTRUCTOR_P (d
) && DECL_HAS_IN_CHARGE_PARM_P (d
))
12175 t
= TREE_CHAIN (t
);
12176 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
12177 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
12178 == DECL_CONTEXT (d
))
12179 && (TREE_CHAIN (t
) == NULL_TREE
12180 || TREE_CHAIN (t
) == void_list_node
12181 || TREE_PURPOSE (TREE_CHAIN (t
))))
12186 /* These memoizing functions keep track of special properties which
12187 a class may have. `grok_ctor_properties' notices whether a class
12188 has a constructor of the form X(X&), and also complains
12189 if the class has a constructor of the form X(X).
12190 `grok_op_properties' takes notice of the various forms of
12191 operator= which are defined, as well as what sorts of type conversion
12192 may apply. Both functions take a FUNCTION_DECL as an argument. */
12195 grok_ctor_properties (ctype
, decl
)
12198 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
12199 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
12201 /* When a type has virtual baseclasses, a magical first int argument is
12202 added to any ctor so we can tell if the class has been initialized
12203 yet. This could screw things up in this function, so we deliberately
12204 ignore the leading int if we're in that situation. */
12205 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
12207 my_friendly_assert (parmtypes
12208 && TREE_VALUE (parmtypes
) == integer_type_node
,
12210 parmtypes
= TREE_CHAIN (parmtypes
);
12211 parmtype
= TREE_VALUE (parmtypes
);
12216 A non-template constructor for class X is a copy constructor if
12217 its first parameter is of type X&, const X&, volatile X& or const
12218 volatile X&, and either there are no other parameters or else all
12219 other parameters have default arguments. */
12220 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
12221 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
12222 && (TREE_CHAIN (parmtypes
) == NULL_TREE
12223 || TREE_CHAIN (parmtypes
) == void_list_node
12224 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
12225 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12226 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12228 TYPE_HAS_INIT_REF (ctype
) = 1;
12229 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12230 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
12234 A declaration of a constructor for a class X is ill-formed if its
12235 first parameter is of type (optionally cv-qualified) X and either
12236 there are no other parameters or else all other parameters have
12239 We *don't* complain about member template instantiations that
12240 have this form, though; they can occur as we try to decide what
12241 constructor to use during overload resolution. Since overload
12242 resolution will never prefer such a constructor to the
12243 non-template copy constructor (which is either explicitly or
12244 implicitly defined), there's no need to worry about their
12245 existence. Theoretically, they should never even be
12246 instantiated, but that's hard to forestall. */
12247 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
12248 && (TREE_CHAIN (parmtypes
) == NULL_TREE
12249 || TREE_CHAIN (parmtypes
) == void_list_node
12250 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
12251 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12252 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12254 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
12256 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
12259 else if (TREE_CODE (parmtype
) == VOID_TYPE
12260 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
12261 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
12266 /* An operator with this code is unary, but can also be binary. */
12270 enum tree_code code
;
12272 return (code
== INDIRECT_REF
12273 || code
== ADDR_EXPR
12274 || code
== CONVERT_EXPR
12275 || code
== NEGATE_EXPR
12276 || code
== PREINCREMENT_EXPR
12277 || code
== PREDECREMENT_EXPR
);
12280 /* An operator with this name can only be unary. */
12284 enum tree_code code
;
12286 return (code
== TRUTH_NOT_EXPR
12287 || code
== BIT_NOT_EXPR
12288 || code
== COMPONENT_REF
12289 || code
== TYPE_EXPR
);
12292 /* Do a little sanity-checking on how they declared their operator. */
12295 grok_op_properties (decl
, virtualp
, friendp
)
12297 int virtualp
, friendp
;
12299 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
12301 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
12302 tree name
= DECL_NAME (decl
);
12303 enum tree_code operator_code
;
12306 /* Count the number of arguments. */
12307 for (argtype
= argtypes
, arity
= 0;
12308 argtype
&& argtype
!= void_list_node
;
12309 argtype
= TREE_CHAIN (argtype
))
12312 if (current_class_type
== NULL_TREE
)
12315 if (DECL_CONV_FN_P (decl
))
12316 operator_code
= TYPE_EXPR
;
12320 #define DEF_OPERATOR(NAME, CODE, NEW_MANGLING, OLD_MANGING, ARITY, ASSN_P) \
12321 if (ansi_opname (CODE) == name) \
12323 operator_code = CODE; \
12326 else if (ansi_assopname (CODE) == name) \
12328 operator_code = CODE; \
12329 DECL_ASSIGNMENT_OPERATOR_P (decl) = 1; \
12333 #include "operators.def"
12334 #undef DEF_OPERATOR
12336 my_friendly_abort (20000527);
12339 my_friendly_assert (operator_code
!= LAST_CPLUS_TREE_CODE
, 20000526);
12340 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12344 switch (operator_code
)
12347 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
12351 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
12354 case COMPONENT_REF
:
12356 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
12360 TYPE_HAS_NEW_OPERATOR (current_class_type
) = 1;
12364 TYPE_GETS_DELETE (current_class_type
) |= 1;
12368 TYPE_HAS_ARRAY_NEW_OPERATOR (current_class_type
) = 1;
12371 case VEC_DELETE_EXPR
:
12372 TYPE_GETS_DELETE (current_class_type
) |= 2;
12380 if (operator_code
== NEW_EXPR
|| operator_code
== VEC_NEW_EXPR
)
12382 /* When the compiler encounters the definition of A::operator new, it
12383 doesn't look at the class declaration to find out if it's static. */
12385 revert_static_member_fn (decl
);
12387 /* Take care of function decl if we had syntax errors. */
12388 if (argtypes
== NULL_TREE
)
12390 = build_function_type (ptr_type_node
,
12391 hash_tree_chain (integer_type_node
,
12394 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
12396 else if (operator_code
== DELETE_EXPR
|| operator_code
== VEC_DELETE_EXPR
)
12399 revert_static_member_fn (decl
);
12401 if (argtypes
== NULL_TREE
)
12403 = build_function_type (void_type_node
,
12404 hash_tree_chain (ptr_type_node
,
12407 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
12411 /* An operator function must either be a non-static member function
12412 or have at least one parameter of a class, a reference to a class,
12413 an enumeration, or a reference to an enumeration. 13.4.0.6 */
12414 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
12416 if (operator_code
== TYPE_EXPR
12417 || operator_code
== CALL_EXPR
12418 || operator_code
== COMPONENT_REF
12419 || operator_code
== ARRAY_REF
12420 || operator_code
== NOP_EXPR
)
12421 cp_error ("`%D' must be a nonstatic member function", decl
);
12426 if (DECL_STATIC_FUNCTION_P (decl
))
12427 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
12430 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
12432 tree arg
= TREE_VALUE (p
);
12433 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
12434 arg
= TREE_TYPE (arg
);
12436 /* This lets bad template code slip through. */
12437 if (IS_AGGR_TYPE (arg
)
12438 || TREE_CODE (arg
) == ENUMERAL_TYPE
12439 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
12440 || TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
)
12444 ("`%D' must have an argument of class or enumerated type",
12451 if (operator_code
== CALL_EXPR
)
12452 return; /* No restrictions on args. */
12454 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
12456 tree t
= TREE_TYPE (name
);
12459 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
12460 const char *what
= 0;
12463 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
12465 if (TREE_CODE (t
) == VOID_TYPE
)
12467 else if (t
== current_class_type
)
12468 what
= "the same type";
12469 /* Don't force t to be complete here. */
12470 else if (IS_AGGR_TYPE (t
)
12471 && COMPLETE_TYPE_P (t
)
12472 && DERIVED_FROM_P (t
, current_class_type
))
12473 what
= "a base class";
12476 warning ("conversion to %s%s will never use a type conversion operator",
12477 ref
? "a reference to " : "", what
);
12481 if (DECL_ASSIGNMENT_OPERATOR_P (decl
)
12482 && operator_code
== NOP_EXPR
)
12486 if (arity
!= 2 && methodp
)
12488 cp_error ("`%D' must take exactly one argument", decl
);
12491 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
12495 A user-declared copy assignment operator X::operator= is
12496 a non-static non-template member function of class X with
12497 exactly one parameter of type X, X&, const X&, volatile
12498 X& or const volatile X&. */
12499 if (copy_assignment_arg_p (parmtype
, virtualp
)
12500 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12501 && is_member_template (DECL_TI_TEMPLATE (decl
)))
12504 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
12505 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
12506 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12507 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
12510 else if (operator_code
== COND_EXPR
)
12513 cp_error ("ISO C++ prohibits overloading operator ?:");
12515 else if (ambi_op_p (operator_code
))
12518 /* We pick the one-argument operator codes by default, so
12519 we don't have to change anything. */
12521 else if (arity
== 2)
12523 /* If we thought this was a unary operator, we now know
12524 it to be a binary operator. */
12525 switch (operator_code
)
12528 operator_code
= MULT_EXPR
;
12532 operator_code
= BIT_AND_EXPR
;
12536 operator_code
= PLUS_EXPR
;
12540 operator_code
= MINUS_EXPR
;
12543 case PREINCREMENT_EXPR
:
12544 operator_code
= POSTINCREMENT_EXPR
;
12547 case PREDECREMENT_EXPR
:
12548 operator_code
= POSTDECREMENT_EXPR
;
12552 my_friendly_abort (20000527);
12555 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12557 if ((operator_code
== POSTINCREMENT_EXPR
12558 || operator_code
== POSTDECREMENT_EXPR
)
12559 && ! processing_template_decl
12560 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
12563 cp_error ("postfix `%D' must take `int' as its argument",
12567 ("postfix `%D' must take `int' as its second argument",
12574 cp_error ("`%D' must take either zero or one argument", decl
);
12576 cp_error ("`%D' must take either one or two arguments", decl
);
12579 /* More Effective C++ rule 6. */
12581 && (operator_code
== POSTINCREMENT_EXPR
12582 || operator_code
== POSTDECREMENT_EXPR
12583 || operator_code
== PREINCREMENT_EXPR
12584 || operator_code
== PREDECREMENT_EXPR
))
12586 tree arg
= TREE_VALUE (argtypes
);
12587 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
12588 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
12589 arg
= TREE_TYPE (arg
);
12590 arg
= TYPE_MAIN_VARIANT (arg
);
12591 if (operator_code
== PREINCREMENT_EXPR
12592 || operator_code
== PREDECREMENT_EXPR
)
12594 if (TREE_CODE (ret
) != REFERENCE_TYPE
12595 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
12597 cp_warning ("prefix `%D' should return `%T'", decl
,
12598 build_reference_type (arg
));
12602 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
12603 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
12607 else if (unary_op_p (operator_code
))
12612 cp_error ("`%D' must take `void'", decl
);
12614 cp_error ("`%D' must take exactly one argument", decl
);
12617 else /* if (binary_op_p (operator_code)) */
12622 cp_error ("`%D' must take exactly one argument", decl
);
12624 cp_error ("`%D' must take exactly two arguments", decl
);
12627 /* More Effective C++ rule 7. */
12629 && (operator_code
== TRUTH_ANDIF_EXPR
12630 || operator_code
== TRUTH_ORIF_EXPR
12631 || operator_code
== COMPOUND_EXPR
))
12632 cp_warning ("user-defined `%D' always evaluates both arguments",
12636 /* Effective C++ rule 23. */
12639 && (operator_code
== PLUS_EXPR
12640 || operator_code
== MINUS_EXPR
12641 || operator_code
== TRUNC_DIV_EXPR
12642 || operator_code
== MULT_EXPR
)
12643 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
12644 cp_warning ("`%D' should return by value", decl
);
12647 for (; argtypes
&& argtypes
!= void_list_node
;
12648 argtypes
= TREE_CHAIN (argtypes
))
12649 if (TREE_PURPOSE (argtypes
))
12651 TREE_PURPOSE (argtypes
) = NULL_TREE
;
12652 if (operator_code
== POSTINCREMENT_EXPR
12653 || operator_code
== POSTDECREMENT_EXPR
)
12656 cp_pedwarn ("`%D' cannot have default arguments", decl
);
12659 cp_error ("`%D' cannot have default arguments", decl
);
12665 static const char *
12667 enum tag_types code
;
12680 my_friendly_abort (981122);
12684 /* Get the struct, enum or union (CODE says which) with tag NAME.
12685 Define the tag as a forward-reference if it is not defined.
12687 C++: If a class derivation is given, process it here, and report
12688 an error if multiple derivation declarations are not identical.
12690 If this is a definition, come in through xref_tag and only look in
12691 the current frame for the name (since C++ allows new names in any
12695 xref_tag (code_type_node
, name
, globalize
)
12696 tree code_type_node
;
12700 enum tag_types tag_code
;
12701 enum tree_code code
;
12702 register tree ref
, t
;
12703 struct binding_level
*b
= current_binding_level
;
12705 tree attributes
= NULL_TREE
;
12706 tree context
= NULL_TREE
;
12708 /* If we are called from the parser, code_type_node will sometimes be a
12709 TREE_LIST. This indicates that the user wrote
12710 "class __attribute__ ((foo)) bar". Extract the attributes so we can
12712 if (TREE_CODE (code_type_node
) == TREE_LIST
)
12714 attributes
= TREE_PURPOSE (code_type_node
);
12715 code_type_node
= TREE_VALUE (code_type_node
);
12718 tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12723 code
= RECORD_TYPE
;
12729 code
= ENUMERAL_TYPE
;
12732 my_friendly_abort (18);
12735 /* If a cross reference is requested, look up the type
12736 already defined for this tag and return it. */
12740 name
= TYPE_IDENTIFIER (t
);
12744 t
= IDENTIFIER_TYPE_VALUE (name
);
12746 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
12747 && TREE_CODE (t
) != TEMPLATE_TEMPLATE_PARM
)
12752 /* If we know we are defining this tag, only look it up in
12753 this scope and don't try to find it as a type. */
12754 ref
= lookup_tag (code
, name
, b
, 1);
12760 /* [dcl.type.elab] If the identifier resolves to a
12761 typedef-name or a template type-parameter, the
12762 elaborated-type-specifier is ill-formed. */
12763 if (t
!= TYPE_MAIN_VARIANT (t
)
12764 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
12765 cp_pedwarn ("using typedef-name `%D' after `%s'",
12766 TYPE_NAME (t
), tag_name (tag_code
));
12767 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12768 cp_error ("using template type parameter `%T' after `%s'",
12769 t
, tag_name (tag_code
));
12774 ref
= lookup_tag (code
, name
, b
, 0);
12778 /* Try finding it as a type declaration. If that wins,
12780 ref
= lookup_name (name
, 1);
12782 if (ref
!= NULL_TREE
12783 && processing_template_decl
12784 && DECL_CLASS_TEMPLATE_P (ref
)
12785 && template_class_depth (current_class_type
) == 0)
12786 /* Since GLOBALIZE is true, we're declaring a global
12787 template, so we want this type. */
12788 ref
= DECL_TEMPLATE_RESULT (ref
);
12790 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12791 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12792 ref
= TREE_TYPE (ref
);
12797 if (ref
&& current_class_type
12798 && template_class_depth (current_class_type
)
12799 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12801 /* Since GLOBALIZE is non-zero, we are not looking at a
12802 definition of this tag. Since, in addition, we are currently
12803 processing a (member) template declaration of a template
12804 class, we must be very careful; consider:
12811 { template <class V>
12812 friend struct S1; };
12814 Here, the S2::S1 declaration should not be confused with the
12815 outer declaration. In particular, the inner version should
12816 have a template parameter of level 2, not level 1. This
12817 would be particularly important if the member declaration
12820 template <class V = U> friend struct S1;
12822 say, when we should tsubst into `U' when instantiating
12823 S2. On the other hand, when presented with:
12833 we must find the inner binding eventually. We
12834 accomplish this by making sure that the new type we
12835 create to represent this declaration has the right
12837 context
= TYPE_CONTEXT (ref
);
12844 /* If no such tag is yet defined, create a forward-reference node
12845 and record it as the "definition".
12846 When a real declaration of this type is found,
12847 the forward-reference will be altered into a real type. */
12848 if (code
== ENUMERAL_TYPE
)
12850 cp_error ("use of enum `%#D' without previous declaration", name
);
12852 ref
= make_node (ENUMERAL_TYPE
);
12854 /* Give the type a default layout like unsigned int
12855 to avoid crashing if it does not get defined. */
12856 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12857 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12858 TYPE_USER_ALIGN (ref
) = 0;
12859 TREE_UNSIGNED (ref
) = 1;
12860 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12861 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12862 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12864 /* Enable us to recognize when a type is created in class context.
12865 To do nested classes correctly, this should probably be cleared
12866 out when we leave this classes scope. Currently this in only
12867 done in `start_enum'. */
12869 pushtag (name
, ref
, globalize
);
12873 struct binding_level
*old_b
= class_binding_level
;
12875 ref
= make_aggr_type (code
);
12876 TYPE_CONTEXT (ref
) = context
;
12878 #ifdef NONNESTED_CLASSES
12879 /* Class types don't nest the way enums do. */
12880 class_binding_level
= (struct binding_level
*)0;
12882 pushtag (name
, ref
, globalize
);
12883 class_binding_level
= old_b
;
12888 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12889 redeclare_class_template (ref
, current_template_parms
);
12892 /* Until the type is defined, tentatively accept whatever
12893 structure tag the user hands us. */
12894 if (!COMPLETE_TYPE_P (ref
)
12895 && ref
!= current_class_type
12896 /* Have to check this, in case we have contradictory tag info. */
12897 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12899 if (tag_code
== class_type
)
12900 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12901 else if (tag_code
== record_type
)
12902 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12905 TREE_TYPE (ref
) = attributes
;
12911 xref_tag_from_type (old
, id
, globalize
)
12915 tree code_type_node
;
12917 if (TREE_CODE (old
) == RECORD_TYPE
)
12918 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12919 ? class_type_node
: record_type_node
);
12921 code_type_node
= union_type_node
;
12923 if (id
== NULL_TREE
)
12924 id
= TYPE_IDENTIFIER (old
);
12926 return xref_tag (code_type_node
, id
, globalize
);
12929 /* REF is a type (named NAME), for which we have just seen some
12930 baseclasses. BINFO is a list of those baseclasses; the
12931 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12932 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12933 struct, or union. */
12936 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12937 tree code_type_node
;
12941 /* In the declaration `A : X, Y, ... Z' we mark all the types
12942 (A, X, Y, ..., Z) so we can check for duplicates. */
12947 enum tag_types tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12949 if (tag_code
== union_type
)
12951 cp_error ("derived union `%T' invalid", ref
);
12955 len
= list_length (binfo
);
12957 /* First, make sure that any templates in base-classes are
12958 instantiated. This ensures that if we call ourselves recursively
12959 we do not get confused about which classes are marked and which
12961 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12962 complete_type (TREE_VALUE (base
));
12964 SET_CLASSTYPE_MARKED (ref
);
12965 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12967 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12969 /* The base of a derived struct is public by default. */
12971 = (TREE_PURPOSE (binfo
) == access_public_node
12972 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12973 || (tag_code
!= class_type
12974 && (TREE_PURPOSE (binfo
) == access_default_node
12975 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12977 = (TREE_PURPOSE (binfo
) == access_protected_node
12978 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12980 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12981 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12982 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12983 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12984 tree basetype
= TREE_VALUE (binfo
);
12987 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12988 basetype
= TREE_TYPE (basetype
);
12990 || (TREE_CODE (basetype
) != RECORD_TYPE
12991 && TREE_CODE (basetype
) != TYPENAME_TYPE
12992 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12993 && TREE_CODE (basetype
) != TEMPLATE_TEMPLATE_PARM
))
12995 cp_error ("base type `%T' fails to be a struct or class type",
12996 TREE_VALUE (binfo
));
13000 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
13002 /* This code replaces similar code in layout_basetypes.
13003 We put the complete_type first for implicit `typename'. */
13004 if (!COMPLETE_TYPE_P (basetype
)
13005 && ! (current_template_parms
&& uses_template_parms (basetype
)))
13007 cp_error ("base class `%T' has incomplete type", basetype
);
13012 if (CLASSTYPE_MARKED (basetype
))
13014 if (basetype
== ref
)
13015 cp_error ("recursive type `%T' undefined", basetype
);
13017 cp_error ("duplicate base type `%T' invalid", basetype
);
13021 if (TYPE_FOR_JAVA (basetype
)
13022 && (current_lang_stack
13023 == &VARRAY_TREE (current_lang_base
, 0)))
13024 TYPE_FOR_JAVA (ref
) = 1;
13026 /* Note that the BINFO records which describe individual
13027 inheritances are *not* shared in the lattice! They
13028 cannot be shared because a given baseclass may be
13029 inherited with different `accessibility' by different
13030 derived classes. (Each BINFO record describing an
13031 individual inheritance contains flags which say what
13032 the `accessibility' of that particular inheritance is.) */
13035 = make_binfo (size_zero_node
, basetype
,
13036 CLASS_TYPE_P (basetype
)
13037 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
13038 CLASS_TYPE_P (basetype
)
13039 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
13041 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
13042 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
13043 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
13044 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
13045 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
13047 /* We need to unshare the binfos now so that lookups during class
13048 definition work. */
13049 unshare_base_binfos (base_binfo
);
13051 SET_CLASSTYPE_MARKED (basetype
);
13053 /* We are free to modify these bits because they are meaningless
13054 at top level, and BASETYPE is a top-level type. */
13055 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
13057 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
13058 /* Converting to a virtual base class requires looking
13059 up the offset of the virtual base. */
13060 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
13063 if (CLASS_TYPE_P (basetype
))
13065 TYPE_HAS_NEW_OPERATOR (ref
)
13066 |= TYPE_HAS_NEW_OPERATOR (basetype
);
13067 TYPE_HAS_ARRAY_NEW_OPERATOR (ref
)
13068 |= TYPE_HAS_ARRAY_NEW_OPERATOR (basetype
);
13069 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
13070 /* If the base-class uses multiple inheritance, so do we. */
13071 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
13072 |= TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
13073 /* Likewise, if converting to a base of the base may require
13074 code, then we may need to generate code to convert to a
13076 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
)
13077 |= TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (basetype
);
13084 TREE_VEC_LENGTH (binfos
) = i
;
13086 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
13090 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
13091 /* If there is more than one non-empty they cannot be at the same
13093 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
13096 /* Unmark all the types. */
13098 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
13099 CLEAR_CLASSTYPE_MARKED (ref
);
13101 /* Now that we know all the base-classes, set up the list of virtual
13103 get_vbase_types (ref
);
13107 /* Begin compiling the definition of an enumeration type.
13108 NAME is its name (or null if anonymous).
13109 Returns the type object, as yet incomplete.
13110 Also records info about it so that build_enumerator
13111 may be used to declare the individual values as they are read. */
13117 register tree enumtype
= NULL_TREE
;
13118 struct binding_level
*b
= current_binding_level
;
13120 /* If this is the real definition for a previous forward reference,
13121 fill in the contents in the same object that used to be the
13122 forward reference. */
13124 if (name
!= NULL_TREE
)
13125 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
13127 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
13129 cp_error ("multiple definition of `%#T'", enumtype
);
13130 cp_error_at ("previous definition here", enumtype
);
13131 /* Clear out TYPE_VALUES, and start again. */
13132 TYPE_VALUES (enumtype
) = NULL_TREE
;
13136 enumtype
= make_node (ENUMERAL_TYPE
);
13137 pushtag (name
, enumtype
, 0);
13140 if (current_class_type
)
13141 TREE_ADDRESSABLE (b
->tags
) = 1;
13143 GNU_xref_decl (current_function_decl
, enumtype
);
13147 /* After processing and defining all the values of an enumeration type,
13148 install their decls in the enumeration type and finish it off.
13149 ENUMTYPE is the type object and VALUES a list of name-value pairs.
13150 Returns ENUMTYPE. */
13153 finish_enum (enumtype
)
13156 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
13157 /* Calculate the maximum value of any enumerator in this type. */
13159 tree values
= TYPE_VALUES (enumtype
);
13164 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
13169 /* The TREE_VALUE is a CONST_DECL for this enumeration
13171 decl
= TREE_VALUE (pair
);
13175 Following the closing brace of an enum-specifier, each
13176 enumerator has the type of its enumeration. Prior to the
13177 closing brace, the type of each enumerator is the type of
13178 its initializing value. */
13179 TREE_TYPE (decl
) = enumtype
;
13181 /* The DECL_INITIAL will be NULL if we are processing a
13182 template declaration and this enumeration constant had no
13183 explicit initializer. */
13184 value
= DECL_INITIAL (decl
);
13185 if (value
&& !processing_template_decl
)
13187 /* Set the TREE_TYPE for the VALUE as well. That's so
13188 that when we call decl_constant_value we get an
13189 entity of the right type (but with the constant
13190 value). Since we shouldn't ever call
13191 decl_constant_value on a template type, there's no
13192 reason to do that when processing_template_decl.
13193 And, if the expression is something like a
13194 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
13195 wreak havoc on the intended type of the expression.
13197 Of course, there's also no point in trying to compute
13198 minimum or maximum values if we're in a template. */
13199 TREE_TYPE (value
) = enumtype
;
13202 minnode
= maxnode
= value
;
13203 else if (tree_int_cst_lt (maxnode
, value
))
13205 else if (tree_int_cst_lt (value
, minnode
))
13209 if (processing_template_decl
)
13210 /* If this is just a template, leave the CONST_DECL
13211 alone. That way tsubst_copy will find CONST_DECLs for
13212 CONST_DECLs, and not INTEGER_CSTs. */
13215 /* In the list we're building up, we want the enumeration
13216 values, not the CONST_DECLs. */
13217 TREE_VALUE (pair
) = value
;
13221 maxnode
= minnode
= integer_zero_node
;
13223 TYPE_VALUES (enumtype
) = nreverse (values
);
13225 if (processing_template_decl
)
13227 tree scope
= current_scope ();
13228 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
13229 add_tree (build_min (TAG_DEFN
, enumtype
));
13233 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
13234 int lowprec
= min_precision (minnode
, unsignedp
);
13235 int highprec
= min_precision (maxnode
, unsignedp
);
13236 int precision
= MAX (lowprec
, highprec
);
13239 TYPE_SIZE (enumtype
) = NULL_TREE
;
13241 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
13243 TYPE_PRECISION (enumtype
) = precision
;
13245 fixup_unsigned_type (enumtype
);
13247 fixup_signed_type (enumtype
);
13249 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
13250 /* Use the width of the narrowest normal C type which is wide
13252 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
13255 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
13257 TYPE_SIZE (enumtype
) = 0;
13258 layout_type (enumtype
);
13260 /* Fix up all variant types of this enum type. */
13261 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
13262 tem
= TYPE_NEXT_VARIANT (tem
))
13264 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
13265 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
13266 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
13267 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
13268 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
13269 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
13270 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
13271 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
13272 TYPE_USER_ALIGN (tem
) = TYPE_USER_ALIGN (enumtype
);
13273 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
13276 /* Finish debugging output for this type. */
13277 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
13283 /* Build and install a CONST_DECL for an enumeration constant of the
13284 enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided.
13285 Assignment of sequential values by default is handled here. */
13288 build_enumerator (name
, value
, enumtype
)
13298 /* Remove no-op casts from the value. */
13300 STRIP_TYPE_NOPS (value
);
13302 if (! processing_template_decl
)
13304 /* Validate and default VALUE. */
13305 if (value
!= NULL_TREE
)
13307 value
= decl_constant_value (value
);
13309 if (TREE_CODE (value
) == INTEGER_CST
)
13311 value
= default_conversion (value
);
13312 constant_expression_warning (value
);
13316 cp_error ("enumerator value for `%D' not integer constant", name
);
13321 /* Default based on previous value. */
13322 if (value
== NULL_TREE
&& ! processing_template_decl
)
13326 if (TYPE_VALUES (enumtype
))
13328 /* The next value is the previous value ... */
13329 prev_value
= DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype
)));
13330 /* ... plus one. */
13331 value
= cp_build_binary_op (PLUS_EXPR
,
13335 if (tree_int_cst_lt (value
, prev_value
))
13336 cp_error ("overflow in enumeration values at `%D'", name
);
13339 value
= integer_zero_node
;
13342 /* Remove no-op casts from the value. */
13344 STRIP_TYPE_NOPS (value
);
13346 /* To fix MAX_VAL enum consts. (bkoz) */
13347 TREE_TYPE (value
) = integer_type_node
;
13351 /* We always have to copy here; not all INTEGER_CSTs are unshared.
13352 Even in other cases, we will later (in finish_enum) be setting
13353 the type of VALUE. But, we don't need to make a copy if this
13354 VALUE is one of the enumeration constants for this same
13355 enumeration type. */
13356 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
13357 if (TREE_VALUE (values
) == value
)
13359 /* If we didn't break out of the loop, then we do need a copy. */
13360 if (!values
&& value
)
13361 value
= copy_node (value
);
13363 /* C++ associates enums with global, function, or class declarations. */
13364 context
= current_scope ();
13366 /* Build the actual enumeration constant. Note that the enumeration
13367 constants have the type of their initializers until the
13368 enumeration is complete:
13372 Following the closing brace of an enum-specifier, each enumer-
13373 ator has the type of its enumeration. Prior to the closing
13374 brace, the type of each enumerator is the type of its
13375 initializing value.
13377 In finish_enum we will reset the type. Of course, if we're
13378 processing a template, there may be no value. */
13379 type
= value
? TREE_TYPE (value
) : NULL_TREE
;
13381 if (context
&& context
== current_class_type
)
13382 /* This enum declaration is local to the class. We need the full
13383 lang_decl so that we can record DECL_CLASS_CONTEXT, for example. */
13384 decl
= build_lang_decl (CONST_DECL
, name
, type
);
13386 /* It's a global enum, or it's local to a function. (Note local to
13387 a function could mean local to a class method. */
13388 decl
= build_decl (CONST_DECL
, name
, type
);
13390 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
13391 DECL_INITIAL (decl
) = value
;
13392 TREE_READONLY (decl
) = 1;
13394 if (context
&& context
== current_class_type
)
13395 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
13396 on the TYPE_FIELDS list for `S'. (That's so that you can say
13397 things like `S::i' later.) */
13398 finish_member_declaration (decl
);
13402 GNU_xref_decl (current_function_decl
, decl
);
13405 /* Add this enumeration constant to the list for this type. */
13406 TYPE_VALUES (enumtype
) = tree_cons (name
, decl
, TYPE_VALUES (enumtype
));
13410 /* We're defining DECL. Make sure that it's type is OK. */
13413 check_function_type (decl
)
13416 tree fntype
= TREE_TYPE (decl
);
13417 tree return_type
= complete_type (TREE_TYPE (fntype
));
13419 /* In a function definition, arg types must be complete. */
13420 require_complete_types_for_parms (current_function_parms
);
13422 if (!COMPLETE_OR_VOID_TYPE_P (return_type
))
13424 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
13426 /* Make it return void instead, but don't change the
13427 type of the DECL_RESULT, in case we have a named return value. */
13428 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13430 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
13432 = build_cplus_method_type (ctype
,
13434 FUNCTION_ARG_CHAIN (decl
));
13438 = build_function_type (void_type_node
,
13439 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
13441 = build_exception_variant (fntype
,
13442 TYPE_RAISES_EXCEPTIONS (fntype
));
13445 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
13448 /* Create the FUNCTION_DECL for a function definition.
13449 DECLSPECS and DECLARATOR are the parts of the declaration;
13450 they describe the function's name and the type it returns,
13451 but twisted together in a fashion that parallels the syntax of C.
13453 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
13454 DECLARATOR is really the DECL for the function we are about to
13455 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
13456 indicating that the function is an inline defined in-class, and
13457 SF_EXPAND indicating that we should generate RTL for this
13460 This function creates a binding context for the function body
13461 as well as setting up the FUNCTION_DECL in current_function_decl.
13463 Returns 1 on success. If the DECLARATOR is not suitable for a function
13464 (it defines a datum instead), we return 0, which tells
13465 yyparse to report a parse error.
13467 For C++, we must first check whether that datum makes any sense.
13468 For example, "class A local_a(1,2);" means that variable local_a
13469 is an aggregate of type A, which should have a constructor
13470 applied to it with the argument list [1, 2]. */
13473 start_function (declspecs
, declarator
, attrs
, flags
)
13474 tree declspecs
, declarator
, attrs
;
13478 tree ctype
= NULL_TREE
;
13481 extern int have_extern_spec
;
13482 extern int used_extern_spec
;
13483 int doing_friend
= 0;
13484 struct binding_level
*bl
;
13486 /* Sanity check. */
13487 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
13488 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
13490 /* This should only be done once on the top most decl. */
13491 if (have_extern_spec
&& !used_extern_spec
)
13493 declspecs
= decl_tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
13494 used_extern_spec
= 1;
13497 if (flags
& SF_PRE_PARSED
)
13499 decl1
= declarator
;
13501 fntype
= TREE_TYPE (decl1
);
13502 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13503 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13505 /* ISO C++ 11.4/5. A friend function defined in a class is in
13506 the (lexical) scope of the class in which it is defined. */
13507 if (!ctype
&& DECL_FRIEND_P (decl1
))
13509 ctype
= DECL_FRIEND_CONTEXT (decl1
);
13511 /* CTYPE could be null here if we're dealing with a template;
13512 for example, `inline friend float foo()' inside a template
13513 will have no CTYPE set. */
13514 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
13520 last_function_parms
= DECL_ARGUMENTS (decl1
);
13521 last_function_parm_tags
= NULL_TREE
;
13525 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
13526 /* If the declarator is not suitable for a function definition,
13527 cause a syntax error. */
13528 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
13530 fntype
= TREE_TYPE (decl1
);
13532 restype
= TREE_TYPE (fntype
);
13533 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
13535 cp_error ("semicolon missing after declaration of `%#T'", restype
);
13536 shadow_tag (build_tree_list (NULL_TREE
, restype
));
13537 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
13538 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
13539 fntype
= build_function_type (integer_type_node
,
13540 TYPE_ARG_TYPES (fntype
));
13542 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
13544 TYPE_ARG_TYPES (fntype
));
13545 TREE_TYPE (decl1
) = fntype
;
13548 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13549 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13550 else if (DECL_MAIN_P (decl1
))
13552 /* If this doesn't return integer_type, complain. */
13553 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
13555 if (pedantic
|| warn_return_type
)
13556 pedwarn ("return type for `main' changed to `int'");
13557 TREE_TYPE (decl1
) = fntype
= default_function_type
;
13562 /* Sometimes we don't notice that a function is a static member, and
13563 build a METHOD_TYPE for it. Fix that up now. */
13564 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
)
13565 && TREE_CODE (TREE_TYPE (decl1
)) == METHOD_TYPE
)
13567 revert_static_member_fn (decl1
);
13568 last_function_parms
= TREE_CHAIN (last_function_parms
);
13572 /* Warn if function was previously implicitly declared
13573 (but not if we warned then). */
13574 if (! warn_implicit
13575 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
13576 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
13578 /* Set up current_class_type, and enter the scope of the class, if
13581 push_nested_class (ctype
, 1);
13582 else if (DECL_STATIC_FUNCTION_P (decl1
))
13583 push_nested_class (DECL_CONTEXT (decl1
), 2);
13585 /* Now that we have entered the scope of the class, we must restore
13586 the bindings for any template parameters surrounding DECL1, if it
13587 is an inline member template. (Order is important; consider the
13588 case where a template parameter has the same name as a field of
13589 the class.) It is not until after this point that
13590 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
13591 if (flags
& SF_INCLASS_INLINE
)
13592 maybe_begin_member_template_processing (decl1
);
13594 /* Effective C++ rule 15. See also c_expand_return. */
13596 && DECL_OVERLOADED_OPERATOR_P (decl1
) == NOP_EXPR
13597 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
13598 cp_warning ("`operator=' should return a reference to `*this'");
13600 /* Make the init_value nonzero so pushdecl knows this is not tentative.
13601 error_mark_node is replaced below (in poplevel) with the BLOCK. */
13602 if (!DECL_INITIAL (decl1
))
13603 DECL_INITIAL (decl1
) = error_mark_node
;
13605 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
13606 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
13609 /* This function exists in static storage.
13610 (This does not mean `static' in the C sense!) */
13611 TREE_STATIC (decl1
) = 1;
13613 /* We must call push_template_decl after current_class_type is set
13614 up. (If we are processing inline definitions after exiting a
13615 class scope, current_class_type will be NULL_TREE until set above
13616 by push_nested_class.) */
13617 if (processing_template_decl
)
13618 decl1
= push_template_decl (decl1
);
13620 /* We are now in the scope of the function being defined. */
13621 current_function_decl
= decl1
;
13623 /* Save the parm names or decls from this function's declarator
13624 where store_parm_decls will find them. */
13625 current_function_parms
= last_function_parms
;
13626 current_function_parm_tags
= last_function_parm_tags
;
13628 /* Make sure the parameter and return types are reasonable. When
13629 you declare a function, these types can be incomplete, but they
13630 must be complete when you define the function. */
13631 if (! processing_template_decl
)
13632 check_function_type (decl1
);
13634 /* Build the return declaration for the function. */
13635 restype
= TREE_TYPE (fntype
);
13636 if (!processing_template_decl
)
13638 if (!DECL_RESULT (decl1
))
13640 DECL_RESULT (decl1
)
13641 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13642 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype
),
13643 DECL_RESULT (decl1
));
13647 /* Just use `void'. Nobody will ever look at this anyhow. */
13648 DECL_RESULT (decl1
) = build_decl (RESULT_DECL
, 0, void_type_node
);
13650 /* Initialize RTL machinery. We cannot do this until
13651 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
13652 even when processing a template; this is how we get
13653 CFUN set up, and our per-function variables initialized. */
13654 bl
= current_binding_level
;
13655 init_function_start (decl1
, input_filename
, lineno
);
13656 current_binding_level
= bl
;
13657 expanding_p
= (flags
& SF_EXPAND
) != 0;
13659 /* Even though we're inside a function body, we still don't want to
13660 call expand_expr to calculate the size of a variable-sized array.
13661 We haven't necessarily assigned RTL to all variables yet, so it's
13662 not safe to try to expand expressions involving them. */
13663 immediate_size_expand
= 0;
13664 cfun
->x_dont_save_pending_sizes_p
= 1;
13666 /* If we're building a statement-tree, start the tree now. */
13667 if (processing_template_decl
|| !expanding_p
)
13668 begin_stmt_tree (&DECL_SAVED_TREE (decl1
));
13670 /* Let the user know we're compiling this function. */
13671 announce_function (decl1
);
13673 /* Record the decl so that the function name is defined.
13674 If we already have a decl for this name, and it is a FUNCTION_DECL,
13675 use the old decl. */
13676 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
13678 /* A specialization is not used to guide overload resolution. */
13679 if (!DECL_TEMPLATE_SPECIALIZATION (decl1
)
13680 && ! DECL_FUNCTION_MEMBER_P (decl1
))
13681 decl1
= pushdecl (decl1
);
13684 /* We need to set the DECL_CONTEXT. */
13685 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
13686 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
13687 /* And make sure we have enough default args. */
13688 check_default_args (decl1
);
13690 fntype
= TREE_TYPE (decl1
);
13693 /* Reset these in case the call to pushdecl changed them. */
13694 current_function_decl
= decl1
;
13695 cfun
->decl
= decl1
;
13697 /* Initialize the per-function data. */
13698 if (!DECL_PENDING_INLINE_P (decl1
) && DECL_SAVED_FUNCTION_DATA (decl1
))
13700 /* If we already parsed this function, and we're just expanding it
13701 now, restore saved state. */
13702 struct binding_level
*bl
= current_binding_level
;
13703 *cp_function_chain
= *DECL_SAVED_FUNCTION_DATA (decl1
);
13704 current_binding_level
= bl
;
13706 /* This function is being processed in whole-function mode; we
13707 already did semantic analysis. */
13708 cfun
->x_whole_function_mode_p
= 1;
13710 /* If we decided that we didn't want to inline this function,
13711 make sure the back-end knows that. */
13712 if (!current_function_cannot_inline
)
13713 current_function_cannot_inline
= cp_function_chain
->cannot_inline
;
13715 /* We don't need the saved data anymore. */
13716 free (DECL_SAVED_FUNCTION_DATA (decl1
));
13717 DECL_SAVED_FUNCTION_DATA (decl1
) = NULL
;
13719 else if (ctype
&& !doing_friend
&& !DECL_STATIC_FUNCTION_P (decl1
))
13721 /* We know that this was set up by `grokclassfn'. We do not
13722 wait until `store_parm_decls', since evil parse errors may
13723 never get us to that point. Here we keep the consistency
13724 between `current_class_type' and `current_class_ptr'. */
13725 tree t
= DECL_ARGUMENTS (decl1
);
13727 my_friendly_assert (t
!= NULL_TREE
&& TREE_CODE (t
) == PARM_DECL
,
13729 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
13732 cp_function_chain
->x_current_class_ref
13733 = build_indirect_ref (t
, NULL_PTR
);
13734 cp_function_chain
->x_current_class_ptr
= t
;
13736 /* Constructors and destructors need to know whether they're "in
13737 charge" of initializing virtual base classes. */
13738 if (DECL_HAS_IN_CHARGE_PARM_P (decl1
))
13739 current_in_charge_parm
= TREE_CHAIN (t
);
13742 if (DECL_INTERFACE_KNOWN (decl1
))
13744 tree ctx
= decl_function_context (decl1
);
13746 if (DECL_NOT_REALLY_EXTERN (decl1
))
13747 DECL_EXTERNAL (decl1
) = 0;
13749 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
13750 && TREE_PUBLIC (ctx
))
13751 /* This is a function in a local class in an extern inline
13753 comdat_linkage (decl1
);
13755 /* If this function belongs to an interface, it is public.
13756 If it belongs to someone else's interface, it is also external.
13757 This only affects inlines and template instantiations. */
13758 else if (interface_unknown
== 0
13759 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13760 || flag_alt_external_templates
))
13762 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
13763 || processing_template_decl
)
13765 DECL_EXTERNAL (decl1
)
13767 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
13768 && !DECL_VINDEX (decl1
)));
13770 /* For WIN32 we also want to put these in linkonce sections. */
13771 maybe_make_one_only (decl1
);
13774 DECL_EXTERNAL (decl1
) = 0;
13775 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
13776 DECL_INTERFACE_KNOWN (decl1
) = 1;
13778 else if (interface_unknown
&& interface_only
13779 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13780 || flag_alt_external_templates
))
13782 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13783 interface, we will have interface_only set but not
13784 interface_known. In that case, we don't want to use the normal
13785 heuristics because someone will supply a #pragma implementation
13786 elsewhere, and deducing it here would produce a conflict. */
13787 comdat_linkage (decl1
);
13788 DECL_EXTERNAL (decl1
) = 0;
13789 DECL_INTERFACE_KNOWN (decl1
) = 1;
13790 DECL_DEFER_OUTPUT (decl1
) = 1;
13794 /* This is a definition, not a reference.
13795 So clear DECL_EXTERNAL. */
13796 DECL_EXTERNAL (decl1
) = 0;
13798 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
13799 && ! DECL_INTERFACE_KNOWN (decl1
)
13800 /* Don't try to defer nested functions for now. */
13801 && ! decl_function_context (decl1
))
13802 DECL_DEFER_OUTPUT (decl1
) = 1;
13804 DECL_INTERFACE_KNOWN (decl1
) = 1;
13807 if (doing_semantic_analysis_p ())
13810 current_binding_level
->parm_flag
= 1;
13814 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13816 if (!building_stmt_tree ())
13818 GNU_xref_function (decl1
, current_function_parms
);
13819 make_function_rtl (decl1
);
13822 /* Promote the value to int before returning it. */
13823 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13824 restype
= type_promotes_to (restype
);
13826 /* If this fcn was already referenced via a block-scope `extern' decl
13827 (or an implicit decl), propagate certain information about the usage. */
13828 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13829 TREE_ADDRESSABLE (decl1
) = 1;
13831 if (DECL_RESULT (decl1
) == NULL_TREE
)
13833 DECL_RESULT (decl1
)
13834 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13835 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13836 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13841 if (DECL_DESTRUCTOR_P (decl1
))
13843 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13844 DECL_CONTEXT (dtor_label
) = current_function_decl
;
13846 /* Under the old ABI we return `this' from constructors, so we make
13847 ordinary `return' statements in constructors jump to CTOR_LABEL;
13848 from there we return `this'. Under the new ABI, we don't bother
13849 with any of this. By not setting CTOR_LABEL the remainder of the
13850 machinery is automatically disabled. */
13851 else if (!flag_new_abi
&& DECL_CONSTRUCTOR_P (decl1
))
13853 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13854 DECL_CONTEXT (ctor_label
) = current_function_decl
;
13860 /* Called after store_parm_decls for a function-try-block. */
13863 expand_start_early_try_stmts ()
13865 expand_start_try_stmts ();
13868 /* Store the parameter declarations into the current function declaration.
13869 This is called after parsing the parameter declarations, before
13870 digesting the body of the function.
13872 Also install to binding contour return value identifier, if any. */
13875 store_parm_decls ()
13877 register tree fndecl
= current_function_decl
;
13878 register tree parm
;
13879 int parms_have_cleanups
= 0;
13880 tree cleanups
= NULL_TREE
;
13882 /* This is a list of types declared among parms in a prototype. */
13883 tree parmtags
= current_function_parm_tags
;
13885 /* This is a chain of any other decls that came in among the parm
13886 declarations. If a parm is declared with enum {foo, bar} x;
13887 then CONST_DECLs for foo and bar are put here. */
13888 tree nonparms
= NULL_TREE
;
13890 /* Create a binding level for the parms. */
13891 if (!building_stmt_tree ())
13892 expand_start_bindings (2);
13894 if (current_function_parms
)
13896 /* This case is when the function was defined with an ANSI prototype.
13897 The parms already have decls, so we need not do anything here
13898 except record them as in effect
13899 and complain if any redundant old-style parm decls were written. */
13901 tree specparms
= current_function_parms
;
13904 if (doing_semantic_analysis_p ())
13906 /* Must clear this because it might contain TYPE_DECLs declared
13908 storedecls (NULL_TREE
);
13910 /* If we're doing semantic analysis, then we'll call pushdecl
13911 for each of these. We must do them in reverse order so that
13912 they end in the correct forward order. */
13913 specparms
= nreverse (specparms
);
13916 for (parm
= specparms
; parm
; parm
= next
)
13918 next
= TREE_CHAIN (parm
);
13919 if (TREE_CODE (parm
) == PARM_DECL
)
13921 tree type
= TREE_TYPE (parm
);
13923 if (doing_semantic_analysis_p ())
13927 if (DECL_NAME (parm
) == NULL_TREE
13928 || TREE_CODE (parm
) != VOID_TYPE
)
13931 cp_error ("parameter `%D' declared void", parm
);
13933 cleanup
= (processing_template_decl
13935 : maybe_build_cleanup (parm
));
13938 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13940 else if (type
!= error_mark_node
13941 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
13942 parms_have_cleanups
= 1;
13946 /* If we find an enum constant or a type tag,
13947 put it aside for the moment. */
13948 TREE_CHAIN (parm
) = NULL_TREE
;
13949 nonparms
= chainon (nonparms
, parm
);
13953 if (doing_semantic_analysis_p ())
13955 /* Get the decls in their original chain order
13956 and record in the function. This is all and only the
13957 PARM_DECLs that were pushed into scope by the loop above. */
13958 DECL_ARGUMENTS (fndecl
) = getdecls ();
13959 storetags (chainon (parmtags
, gettags ()));
13963 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13965 /* Now store the final chain of decls for the arguments
13966 as the decl-chain of the current lexical scope.
13967 Put the enumerators in as well, at the front so that
13968 DECL_ARGUMENTS is not modified. */
13969 if (doing_semantic_analysis_p ())
13970 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13972 /* Initialize the RTL code for the function. */
13973 DECL_SAVED_INSNS (fndecl
) = 0;
13974 if (! building_stmt_tree ())
13975 expand_function_start (fndecl
, parms_have_cleanups
);
13977 current_function_parms_stored
= 1;
13979 /* If this function is `main', emit a call to `__main'
13980 to run global initializers, etc. */
13981 if (DECL_MAIN_P (fndecl
) && !building_stmt_tree ())
13982 expand_main_function ();
13984 /* Now that we have initialized the parms, we can start their
13985 cleanups. We cannot do this before, since expand_decl_cleanup
13986 should not be called before the parm can be used. */
13989 finish_decl_cleanup (TREE_PURPOSE (cleanups
),
13990 TREE_VALUE (cleanups
));
13991 cleanups
= TREE_CHAIN (cleanups
);
13994 /* Create a binding contour which can be used to catch
13995 cleanup-generated temporaries. Also, if the return value needs or
13996 has initialization, deal with that now. */
13997 if (parms_have_cleanups
)
14000 if (!building_stmt_tree ())
14001 expand_start_bindings (2);
14004 /* Do the starting of the exception specifications, if we have any. */
14005 if (flag_exceptions
&& !processing_template_decl
14006 && flag_enforce_eh_specs
14007 && building_stmt_tree ()
14008 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
14009 current_eh_spec_try_block
= expand_start_eh_spec ();
14012 /* Bind a name and initialization to the return value of
14013 the current function. */
14016 store_return_init (decl
)
14019 /* If this named return value comes in a register, put it in a
14020 pseudo-register. */
14021 if (DECL_REGISTER (decl
))
14023 original_result_rtx
= DECL_RTL (decl
);
14024 /* Note that the mode of the old DECL_RTL may be wider than the
14025 mode of DECL_RESULT, depending on the calling conventions for
14026 the processor. For example, on the Alpha, a 32-bit integer
14027 is returned in a DImode register -- the DECL_RESULT has
14028 SImode but the DECL_RTL for the DECL_RESULT has DImode. So,
14029 here, we use the mode the back-end has already assigned for
14030 the return value. */
14031 DECL_RTL (decl
) = gen_reg_rtx (GET_MODE (original_result_rtx
));
14032 if (TREE_ADDRESSABLE (decl
))
14033 put_var_into_stack (decl
);
14038 /* We have finished doing semantic analysis on DECL, but have not yet
14039 generated RTL for its body. Save away our current state, so that
14040 when we want to generate RTL later we know what to do. */
14043 save_function_data (decl
)
14046 struct language_function
*f
;
14048 /* Save the language-specific per-function data so that we can
14049 get it back when we really expand this function. */
14050 my_friendly_assert (!DECL_PENDING_INLINE_P (decl
),
14054 f
= ((struct language_function
*)
14055 xmalloc (sizeof (struct language_function
)));
14056 bcopy ((char *) cp_function_chain
, (char *) f
,
14057 sizeof (struct language_function
));
14058 DECL_SAVED_FUNCTION_DATA (decl
) = f
;
14060 /* Clear out the bits we don't need. */
14061 f
->x_stmt_tree
.x_last_stmt
= NULL_TREE
;
14062 f
->x_stmt_tree
.x_last_expr_type
= NULL_TREE
;
14063 f
->x_result_rtx
= NULL_RTX
;
14064 f
->x_named_label_uses
= NULL
;
14065 f
->bindings
= NULL
;
14067 /* When we get back here again, we will be expanding. */
14068 f
->x_expanding_p
= 1;
14070 /* If we've already decided that we cannot inline this function, we
14071 must remember that fact when we actually go to expand the
14073 f
->cannot_inline
= current_function_cannot_inline
;
14076 /* At the end of every constructor we generate to code to return
14077 `this'. Do that now. */
14080 finish_constructor_body ()
14082 /* Any return from a constructor will end up here. */
14084 add_tree (build_stmt (LABEL_STMT
, ctor_label
));
14086 /* Clear CTOR_LABEL so that finish_return_stmt knows to really
14087 generate the return, rather than a goto to CTOR_LABEL. */
14088 ctor_label
= NULL_TREE
;
14089 /* In check_return_expr we translate an empty return from a
14090 constructor to a return of `this'. */
14091 finish_return_stmt (NULL_TREE
);
14092 /* Mark the end of the constructor. */
14093 add_tree (build_stmt (CTOR_STMT
));
14096 /* At the end of every destructor we generate code to restore virtual
14097 function tables to the values desired by base classes and to call
14098 to base class destructors. Do that now. */
14101 finish_destructor_body ()
14103 tree compound_stmt
;
14108 /* Create a block to contain all the extra code. */
14109 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
14111 /* Any return from a destructor will end up here. */
14112 add_tree (build_stmt (LABEL_STMT
, dtor_label
));
14114 /* Generate the code to call destructor on base class. If this
14115 destructor belongs to a class with virtual functions, then set
14116 the virtual function table pointer to represent the type of our
14119 /* This side-effect makes call to `build_delete' generate the code
14120 we have to have at the end of this destructor. `build_delete'
14121 will set the flag again. */
14122 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
14124 exprstmt
= build_delete (current_class_type
,
14126 sfk_base_destructor
,
14127 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
,
14130 if (exprstmt
!= error_mark_node
14131 && (TREE_CODE (exprstmt
) != NOP_EXPR
14132 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
14133 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
14135 if (exprstmt
!= void_zero_node
)
14136 /* Don't call `expand_expr_stmt' if we're not going to do
14137 anything, since -Wall will give a diagnostic. */
14138 finish_expr_stmt (exprstmt
);
14140 /* Run destructors for all virtual baseclasses. */
14141 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
14146 if_stmt
= begin_if_stmt ();
14147 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
14148 current_in_charge_parm
,
14152 vbases
= CLASSTYPE_VBASECLASSES (current_class_type
);
14153 /* The CLASSTYPE_VBASECLASSES list is in initialization
14154 order, so we have to march through it in reverse order. */
14155 for (vbases
= nreverse (copy_list (vbases
));
14157 vbases
= TREE_CHAIN (vbases
))
14159 tree vbase
= TREE_VALUE (vbases
);
14161 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (vbase
)))
14163 tree vb
= get_vbase
14164 (BINFO_TYPE (vbase
),
14165 TYPE_BINFO (current_class_type
));
14167 (build_scoped_method_call
14168 (current_class_ref
, vb
, base_dtor_identifier
,
14173 finish_then_clause (if_stmt
);
14178 virtual_size
= c_sizeof (current_class_type
);
14180 /* At the end, call delete if that's what's requested. */
14182 /* FDIS sez: At the point of definition of a virtual destructor
14183 (including an implicit definition), non-placement operator delete
14184 shall be looked up in the scope of the destructor's class and if
14185 found shall be accessible and unambiguous.
14187 This is somewhat unclear, but I take it to mean that if the class
14188 only defines placement deletes we don't do anything here. So we
14189 pass LOOKUP_SPECULATIVELY; delete_sanity will complain for us if
14190 they ever try to delete one of these. */
14191 exprstmt
= build_op_delete_call
14192 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
14193 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
14195 if_stmt
= begin_if_stmt ();
14196 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
14197 current_in_charge_parm
,
14200 finish_expr_stmt (exprstmt
);
14201 finish_then_clause (if_stmt
);
14204 /* Close the block we started above. */
14205 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
14208 /* Finish up a function declaration and compile that function
14209 all the way to assembler language output. The free the storage
14210 for the function definition.
14212 FLAGS is a bitwise or of the following values:
14214 An extra call to poplevel (and expand_end_bindings) must be
14215 made to take care of the binding contour for the base
14216 initializers. This is only relevant for constructors.
14218 We just finished processing the body of an in-class inline
14219 function definition. (This processing will have taken place
14220 after the class definition is complete.) */
14223 finish_function (flags
)
14226 register tree fndecl
= current_function_decl
;
14227 tree fntype
, ctype
= NULL_TREE
;
14228 /* Label to use if this function is supposed to return a value. */
14229 tree no_return_label
= NULL_TREE
;
14230 int call_poplevel
= (flags
& 1) != 0;
14231 int inclass_inline
= (flags
& 2) != 0;
14234 int current_line
= lineno
;
14236 /* When we get some parse errors, we can end up without a
14237 current_function_decl, so cope. */
14238 if (fndecl
== NULL_TREE
)
14239 return error_mark_node
;
14241 nested
= function_depth
> 1;
14242 fntype
= TREE_TYPE (fndecl
);
14244 /* TREE_READONLY (fndecl) = 1;
14245 This caused &foo to be of type ptr-to-const-function
14246 which then got a warning when stored in a ptr-to-function variable. */
14248 /* This happens on strange parse errors. */
14249 if (! current_function_parms_stored
)
14252 store_parm_decls ();
14255 /* For a cloned function, we've already got all the code we need;
14256 there's no need to add any extra bits. */
14257 if (building_stmt_tree () && DECL_CLONED_FUNCTION_P (fndecl
))
14259 else if (building_stmt_tree ())
14261 if (DECL_CONSTRUCTOR_P (fndecl
))
14263 finish_constructor_body ();
14267 else if (DECL_DESTRUCTOR_P (fndecl
) && !processing_template_decl
)
14268 finish_destructor_body ();
14269 else if (DECL_MAIN_P (fndecl
))
14271 /* Make it so that `main' always returns 0 by default. */
14273 finish_return_stmt (integer_one_node
);
14275 finish_return_stmt (integer_zero_node
);
14279 /* Finish dealing with exception specifiers. */
14280 if (flag_exceptions
&& !processing_template_decl
14281 && flag_enforce_eh_specs
14282 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
14283 expand_end_eh_spec (TYPE_RAISES_EXCEPTIONS
14284 (TREE_TYPE (current_function_decl
)),
14285 current_eh_spec_try_block
);
14290 if (write_symbols
!= NO_DEBUG
/*&& TREE_CODE (fntype) != METHOD_TYPE*/)
14292 /* Keep this code around in case we later want to control debug info
14293 based on whether a type is "used". (jason 1999-11-11) */
14295 tree ttype
= target_type (fntype
);
14298 if (IS_AGGR_TYPE (ttype
))
14299 /* Let debugger know it should output info for this type. */
14300 note_debug_info_needed (ttype
);
14302 for (parmdecl
= DECL_ARGUMENTS (fndecl
); parmdecl
; parmdecl
= TREE_CHAIN (parmdecl
))
14304 ttype
= target_type (TREE_TYPE (parmdecl
));
14305 if (IS_AGGR_TYPE (ttype
))
14306 /* Let debugger know it should output info for this type. */
14307 note_debug_info_needed (ttype
);
14312 /* Clean house because we will need to reorder insns here. */
14313 do_pending_stack_adjust ();
14317 else if (DECL_CONSTRUCTOR_P (fndecl
))
14322 else if (return_label
!= NULL_RTX
14323 && flag_this_is_variable
<= 0
14324 && current_function_return_value
== NULL_TREE
14325 && ! DECL_NAME (DECL_RESULT (current_function_decl
)))
14326 no_return_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
14328 if (flag_exceptions
)
14329 expand_exception_blocks ();
14331 /* If this function is supposed to return a value, ensure that
14332 we do not fall into the cleanups by mistake. The end of our
14333 function will look like this:
14335 user code (may have return stmt somewhere)
14336 goto no_return_label
14341 NOTE_INSN_FUNCTION_END
14345 If the user omits a return stmt in the USER CODE section, we
14346 will have a control path which reaches NOTE_INSN_FUNCTION_END.
14347 Otherwise, we won't. */
14348 if (no_return_label
)
14350 DECL_CONTEXT (no_return_label
) = fndecl
;
14351 DECL_INITIAL (no_return_label
) = error_mark_node
;
14352 DECL_SOURCE_FILE (no_return_label
) = input_filename
;
14353 DECL_SOURCE_LINE (no_return_label
) = current_line
;
14354 expand_goto (no_return_label
);
14359 /* Remove the binding contour which is used
14360 to catch cleanup-generated temporaries. */
14361 expand_end_bindings (0, 0, 0);
14362 poplevel (0, 0, 0);
14364 /* Emit label at beginning of cleanup code for parameters. */
14365 emit_label (cleanup_label
);
14368 /* Get return value into register if that's where it's supposed
14370 if (original_result_rtx
)
14371 fixup_result_decl (DECL_RESULT (fndecl
), original_result_rtx
);
14373 /* Finish building code that will trigger warnings if users forget
14374 to make their functions return values. */
14375 if (no_return_label
|| cleanup_label
)
14376 emit_jump (return_label
);
14377 if (no_return_label
)
14379 /* We don't need to call `expand_*_return' here because we
14380 don't need any cleanups here--this path of code is only
14381 for error checking purposes. */
14382 expand_label (no_return_label
);
14385 /* We hard-wired immediate_size_expand to zero in
14386 start_function. Expand_function_end will decrement this
14387 variable. So, we set the variable to one here, so that after
14388 the decrement it will remain zero. */
14389 immediate_size_expand
= 1;
14391 /* Generate rtl for function exit. */
14392 expand_function_end (input_filename
, current_line
, 1);
14395 /* We have to save this value here in case
14396 maybe_end_member_template_processing decides to pop all the
14397 template parameters. */
14398 expand_p
= !building_stmt_tree ();
14400 /* If we're saving up tree structure, tie off the function now. */
14402 finish_stmt_tree (&DECL_SAVED_TREE (fndecl
));
14404 /* This must come after expand_function_end because cleanups might
14405 have declarations (from inline functions) that need to go into
14406 this function's blocks. */
14407 if (doing_semantic_analysis_p ())
14409 if (current_binding_level
->parm_flag
!= 1)
14410 my_friendly_abort (122);
14411 poplevel (1, 0, 1);
14414 /* Remember that we were in class scope. */
14415 if (current_class_name
)
14416 ctype
= current_class_type
;
14418 /* Must mark the RESULT_DECL as being in this function. */
14419 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
14421 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
14422 to the FUNCTION_DECL node itself. */
14423 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
14425 /* Save away current state, if appropriate. */
14426 if (!expanding_p
&& !processing_template_decl
)
14427 save_function_data (fndecl
);
14429 /* If this function calls `setjmp' it cannot be inlined. When
14430 `longjmp' is called it is not guaranteed to restore the value of
14431 local variables that have been modified since the call to
14432 `setjmp'. So, if were to inline this function into some caller
14433 `c', then when we `longjmp', we might not restore all variables
14434 in `c'. (It might seem, at first blush, that there's no way for
14435 this function to modify local variables in `c', but their
14436 addresses may have been stored somewhere accessible to this
14438 if (!expanding_p
&& !processing_template_decl
&& calls_setjmp_p (fndecl
))
14439 DECL_UNINLINABLE (fndecl
) = 1;
14446 /* So we can tell if jump_optimize sets it to 1. */
14449 /* Before we call rest_of_compilation (which will pop the
14450 CURRENT_FUNCTION), we must save these values. */
14451 returns_null
= current_function_returns_null
;
14452 returns_value
= current_function_returns_value
;
14454 /* If this is a nested function (like a template instantiation
14455 that we're compiling in the midst of compiling something
14456 else), push a new GC context. That will keep local variables
14457 on the stack from being collected while we're doing the
14458 compilation of this function. */
14459 if (function_depth
> 1)
14460 ggc_push_context ();
14462 /* Run the optimizers and output the assembler code for this
14464 rest_of_compilation (fndecl
);
14466 /* Undo the call to ggc_push_context above. */
14467 if (function_depth
> 1)
14468 ggc_pop_context ();
14470 if (DECL_SAVED_INSNS (fndecl
) && ! TREE_ASM_WRITTEN (fndecl
))
14472 /* Set DECL_EXTERNAL so that assemble_external will be called as
14473 necessary. We'll clear it again in finish_file. */
14474 if (! DECL_EXTERNAL (fndecl
))
14475 DECL_NOT_REALLY_EXTERN (fndecl
) = 1;
14476 DECL_EXTERNAL (fndecl
) = 1;
14481 /* Keep this code around in case we later want to control debug info
14482 based on whether a type is "used". (jason 1999-11-11) */
14484 if (ctype
&& TREE_ASM_WRITTEN (fndecl
))
14485 note_debug_info_needed (ctype
);
14488 if (DECL_NAME (DECL_RESULT (fndecl
)))
14489 returns_value
|= can_reach_end
;
14491 returns_null
|= can_reach_end
;
14493 if (TREE_THIS_VOLATILE (fndecl
) && returns_null
)
14494 warning ("`noreturn' function does return");
14495 else if (returns_null
14496 && TREE_CODE (TREE_TYPE (fntype
)) != VOID_TYPE
)
14498 /* Always complain if there's just no return statement. */
14499 if (!returns_value
)
14500 warning ("no return statement in function returning non-void");
14501 else if (warn_return_type
|| pedantic
)
14502 /* If this function returns non-void and control can drop through,
14504 warning ("control reaches end of non-void function");
14509 /* Clear out memory we no longer need. */
14510 free_after_parsing (cfun
);
14511 /* Since we never call rest_of_compilation, we never clear
14512 CFUN. Do so explicitly. */
14513 free_after_compilation (cfun
);
14517 /* If this is a in-class inline definition, we may have to pop the
14518 bindings for the template parameters that we added in
14519 maybe_begin_member_template_processing when start_function was
14521 if (inclass_inline
)
14522 maybe_end_member_template_processing ();
14524 /* Leave the scope of the class. */
14526 pop_nested_class ();
14530 if (!DECL_SAVED_INSNS (fndecl
) && !DECL_SAVED_FUNCTION_DATA (fndecl
)
14531 && !(flag_inline_trees
&& DECL_INLINE (fndecl
)))
14535 /* Stop pointing to the local nodes about to be freed. */
14536 /* But DECL_INITIAL must remain nonzero so we know this
14537 was an actual function definition. */
14538 DECL_INITIAL (fndecl
) = error_mark_node
;
14539 for (t
= DECL_ARGUMENTS (fndecl
); t
; t
= TREE_CHAIN (t
))
14540 DECL_RTL (t
) = DECL_INCOMING_RTL (t
) = NULL_RTX
;
14543 if (DECL_STATIC_CONSTRUCTOR (fndecl
))
14544 static_ctors
= tree_cons (NULL_TREE
, fndecl
, static_ctors
);
14545 if (DECL_STATIC_DESTRUCTOR (fndecl
))
14546 static_dtors
= tree_cons (NULL_TREE
, fndecl
, static_dtors
);
14551 /* Let the error reporting routines know that we're outside a
14552 function. For a nested function, this value is used in
14553 pop_cp_function_context and then reset via pop_function_context. */
14554 current_function_decl
= NULL_TREE
;
14555 /* We don't really care about obstacks, but the middle-end
14556 sometimes cares on what obstck things are located. */
14557 permanent_allocation (1);
14563 /* Create the FUNCTION_DECL for a function definition.
14564 DECLSPECS and DECLARATOR are the parts of the declaration;
14565 they describe the return type and the name of the function,
14566 but twisted together in a fashion that parallels the syntax of C.
14568 This function creates a binding context for the function body
14569 as well as setting up the FUNCTION_DECL in current_function_decl.
14571 Returns a FUNCTION_DECL on success.
14573 If the DECLARATOR is not suitable for a function (it defines a datum
14574 instead), we return 0, which tells yyparse to report a parse error.
14576 May return void_type_node indicating that this method is actually
14577 a friend. See grokfield for more details.
14579 Came here with a `.pushlevel' .
14581 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14582 CHANGES TO CODE IN `grokfield'. */
14585 start_method (declspecs
, declarator
, attrlist
)
14586 tree declarator
, declspecs
, attrlist
;
14588 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
14591 /* Something too ugly to handle. */
14592 if (fndecl
== NULL_TREE
)
14595 /* Pass friends other than inline friend functions back. */
14596 if (fndecl
== void_type_node
)
14599 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
14600 /* Not a function, tell parser to report parse error. */
14603 if (DECL_IN_AGGR_P (fndecl
))
14605 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
14607 if (DECL_CONTEXT (fndecl
)
14608 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
14609 cp_error ("`%D' is already defined in class `%T'", fndecl
,
14610 DECL_CONTEXT (fndecl
));
14612 return void_type_node
;
14615 check_template_shadow (fndecl
);
14617 DECL_THIS_INLINE (fndecl
) = 1;
14619 if (flag_default_inline
)
14620 DECL_INLINE (fndecl
) = 1;
14622 /* We process method specializations in finish_struct_1. */
14623 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
14624 fndecl
= push_template_decl (fndecl
);
14626 if (! DECL_FRIEND_P (fndecl
))
14628 if (TREE_CHAIN (fndecl
))
14630 fndecl
= copy_node (fndecl
);
14631 TREE_CHAIN (fndecl
) = NULL_TREE
;
14634 if (DECL_CONSTRUCTOR_P (fndecl
))
14636 if (! grok_ctor_properties (current_class_type
, fndecl
))
14637 return void_type_node
;
14639 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
14640 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
14643 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0);
14645 /* Make a place for the parms */
14647 current_binding_level
->parm_flag
= 1;
14649 DECL_IN_AGGR_P (fndecl
) = 1;
14653 /* Go through the motions of finishing a function definition.
14654 We don't compile this method until after the whole class has
14657 FINISH_METHOD must return something that looks as though it
14658 came from GROKFIELD (since we are defining a method, after all).
14660 This is called after parsing the body of the function definition.
14661 STMTS is the chain of statements that makes up the function body.
14663 DECL is the ..._DECL that `start_method' provided. */
14666 finish_method (decl
)
14669 register tree fndecl
= decl
;
14672 register tree link
;
14674 if (decl
== void_type_node
)
14677 old_initial
= DECL_INITIAL (fndecl
);
14679 /* Undo the level for the parms (from start_method).
14680 This is like poplevel, but it causes nothing to be
14681 saved. Saving information here confuses symbol-table
14682 output routines. Besides, this information will
14683 be correctly output when this method is actually
14686 /* Clear out the meanings of the local variables of this level;
14687 also record in each decl which block it belongs to. */
14689 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
14691 if (DECL_NAME (link
) != NULL_TREE
)
14692 pop_binding (DECL_NAME (link
), link
);
14693 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
14694 DECL_CONTEXT (link
) = NULL_TREE
;
14697 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
14698 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
14699 current_binding_level
->parm_flag
,
14700 current_binding_level
->keep
);
14702 poplevel (0, 0, 0);
14704 DECL_INITIAL (fndecl
) = old_initial
;
14706 /* We used to check if the context of FNDECL was different from
14707 current_class_type as another way to get inside here. This didn't work
14708 for String.cc in libg++. */
14709 if (DECL_FRIEND_P (fndecl
))
14711 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
14712 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
14713 decl
= void_type_node
;
14719 /* Called when a new struct TYPE is defined.
14720 If this structure or union completes the type of any previous
14721 variable declaration, lay it out and output its rtl. */
14724 hack_incomplete_structures (type
)
14728 struct binding_level
*level
;
14730 if (!type
) /* Don't do this for class templates. */
14733 if (namespace_bindings_p ())
14736 list
= &namespace_scope_incomplete
;
14740 level
= innermost_nonclass_level ();
14741 list
= &level
->incomplete
;
14748 tree decl
= TREE_VALUE (*list
);
14749 if ((decl
&& TREE_TYPE (decl
) == type
)
14750 || (TREE_TYPE (decl
)
14751 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14752 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
14754 int toplevel
= toplevel_bindings_p ();
14755 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14756 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
14757 layout_type (TREE_TYPE (decl
));
14758 layout_decl (decl
, 0);
14759 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
14763 expand_decl (decl
);
14764 cleanup
= maybe_build_cleanup (decl
);
14765 expand_decl_init (decl
);
14766 if (! expand_decl_cleanup (decl
, cleanup
))
14767 cp_error ("parser lost in parsing declaration of `%D'",
14770 *list
= TREE_CHAIN (*list
);
14773 list
= &TREE_CHAIN (*list
);
14776 /* Keep looking through artificial binding levels generated
14777 for local variables. */
14778 if (level
&& level
->keep
== 2)
14780 level
= level
->level_chain
;
14781 list
= &level
->incomplete
;
14788 /* If DECL is of a type which needs a cleanup, build that cleanup
14792 maybe_build_cleanup (decl
)
14795 tree type
= TREE_TYPE (decl
);
14797 if (type
!= error_mark_node
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
14799 int flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14802 if (TREE_CODE (type
) == ARRAY_TYPE
)
14806 mark_addressable (decl
);
14807 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14810 /* Optimize for space over speed here. */
14811 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14812 || flag_expensive_optimizations
)
14813 flags
|= LOOKUP_NONVIRTUAL
;
14815 rval
= build_delete (TREE_TYPE (rval
), rval
,
14816 sfk_complete_destructor
, flags
, 0);
14818 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14819 && ! TYPE_HAS_DESTRUCTOR (type
))
14820 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14821 build_tree_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14828 /* Expand a C++ expression at the statement level.
14829 This is needed to ferret out nodes which have UNKNOWN_TYPE.
14830 The C++ type checker should get all of these out when
14831 expressions are combined with other, type-providing, expressions,
14832 leaving only orphan expressions, such as:
14834 &class::bar; / / takes its address, but does nothing with it. */
14837 cplus_expand_expr_stmt (exp
)
14841 /* We should do this eventually, but right now this causes regex.o from
14842 libg++ to miscompile, and tString to core dump. */
14843 exp
= build1 (CLEANUP_POINT_EXPR
, TREE_TYPE (exp
), exp
);
14846 /* If we don't do this, we end up down inside expand_expr
14847 trying to do TYPE_MODE on the ERROR_MARK, and really
14848 go outside the bounds of the type. */
14849 if (exp
!= error_mark_node
)
14850 expand_expr_stmt (exp
);
14853 /* When a stmt has been parsed, this function is called. */
14858 /* Always assume this statement was not an expression statement. If
14859 it actually was an expression statement, its our callers
14860 responsibility to fix this up. */
14861 last_expr_type
= NULL_TREE
;
14864 /* DECL was originally constructed as a non-static member function,
14865 but turned out to be static. Update it accordingly. */
14868 revert_static_member_fn (decl
)
14872 tree function
= TREE_TYPE (decl
);
14873 tree args
= TYPE_ARG_TYPES (function
);
14875 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14876 != TYPE_UNQUALIFIED
)
14877 cp_error ("static member function `%#D' declared with type qualifiers",
14880 args
= TREE_CHAIN (args
);
14881 tmp
= build_function_type (TREE_TYPE (function
), args
);
14882 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14883 tmp
= build_exception_variant (tmp
,
14884 TYPE_RAISES_EXCEPTIONS (function
));
14885 TREE_TYPE (decl
) = tmp
;
14886 if (DECL_ARGUMENTS (decl
))
14887 DECL_ARGUMENTS (decl
) = TREE_CHAIN (DECL_ARGUMENTS (decl
));
14888 DECL_STATIC_FUNCTION_P (decl
) = 1;
14891 /* Initialize the variables used during compilation of a C++
14895 push_cp_function_context (f
)
14896 struct function
*f
;
14898 struct language_function
*p
14899 = ((struct language_function
*)
14900 xcalloc (1, sizeof (struct language_function
)));
14903 /* It takes an explicit call to expand_body to generate RTL for a
14907 /* Whenever we start a new function, we destroy temporaries in the
14909 current_stmt_tree
->stmts_are_full_exprs_p
= 1;
14912 /* Free the language-specific parts of F, now that we've finished
14913 compiling the function. */
14916 pop_cp_function_context (f
)
14917 struct function
*f
;
14920 free (f
->language
);
14924 /* Mark P for GC. */
14927 mark_lang_function (p
)
14928 struct language_function
*p
;
14933 ggc_mark_tree (p
->x_ctor_label
);
14934 ggc_mark_tree (p
->x_dtor_label
);
14935 ggc_mark_tree (p
->x_current_class_ptr
);
14936 ggc_mark_tree (p
->x_current_class_ref
);
14937 ggc_mark_tree (p
->x_eh_spec_try_block
);
14938 ggc_mark_tree (p
->x_scope_stmt_stack
);
14940 ggc_mark_rtx (p
->x_result_rtx
);
14942 mark_named_label_lists (&p
->x_named_labels
, &p
->x_named_label_uses
);
14943 mark_stmt_tree (&p
->x_stmt_tree
);
14944 mark_binding_level (&p
->bindings
);
14947 /* Mark the language-specific data in F for GC. */
14950 mark_cp_function_context (f
)
14951 struct function
*f
;
14953 mark_lang_function (f
->language
);
14957 lang_mark_false_label_stack (l
)
14958 struct label_node
*l
;
14960 /* C++ doesn't use false_label_stack. It better be NULL. */
14961 my_friendly_assert (l
== NULL
, 19990904);
14968 enum tree_code code
= TREE_CODE (t
);
14969 if (code
== IDENTIFIER_NODE
)
14971 struct lang_identifier
*li
= (struct lang_identifier
*) t
;
14972 struct lang_id2
*li2
= li
->x
;
14973 ggc_mark_tree (li
->namespace_bindings
);
14974 ggc_mark_tree (li
->bindings
);
14975 ggc_mark_tree (li
->class_value
);
14976 ggc_mark_tree (li
->class_template_info
);
14980 ggc_mark_tree (li2
->label_value
);
14981 ggc_mark_tree (li2
->implicit_decl
);
14982 ggc_mark_tree (li2
->error_locus
);
14985 else if (code
== CPLUS_BINDING
)
14987 if (BINDING_HAS_LEVEL_P (t
))
14988 mark_binding_level (&BINDING_LEVEL (t
));
14990 ggc_mark_tree (BINDING_SCOPE (t
));
14991 ggc_mark_tree (BINDING_VALUE (t
));
14993 else if (code
== OVERLOAD
)
14994 ggc_mark_tree (OVL_FUNCTION (t
));
14995 else if (code
== TEMPLATE_PARM_INDEX
)
14996 ggc_mark_tree (TEMPLATE_PARM_DECL (t
));
14997 else if (TREE_CODE_CLASS (code
) == 'd')
14999 struct lang_decl
*ld
= DECL_LANG_SPECIFIC (t
);
15004 if (!DECL_GLOBAL_CTOR_P (t
)
15005 && !DECL_GLOBAL_DTOR_P (t
)
15006 && !DECL_THUNK_P (t
))
15007 ggc_mark_tree (ld
->decl_flags
.u2
.access
);
15008 else if (DECL_THUNK_P (t
))
15009 ggc_mark_tree (ld
->decl_flags
.u2
.vcall_offset
);
15010 ggc_mark_tree (ld
->decl_flags
.context
);
15011 if (TREE_CODE (t
) != NAMESPACE_DECL
)
15012 ggc_mark_tree (ld
->decl_flags
.u
.template_info
);
15014 mark_binding_level (&NAMESPACE_LEVEL (t
));
15015 if (CAN_HAVE_FULL_LANG_DECL_P (t
))
15017 ggc_mark_tree (ld
->befriending_classes
);
15018 ggc_mark_tree (ld
->saved_tree
);
15019 ggc_mark_tree (ld
->cloned_function
);
15020 if (!DECL_OVERLOADED_OPERATOR_P (t
))
15021 ggc_mark_tree (ld
->u2
.vtt_parm
);
15022 if (TREE_CODE (t
) == TYPE_DECL
)
15023 ggc_mark_tree (ld
->u
.sorted_fields
);
15024 else if (TREE_CODE (t
) == FUNCTION_DECL
15025 && !DECL_PENDING_INLINE_P (t
))
15026 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t
));
15030 else if (TREE_CODE_CLASS (code
) == 't')
15032 struct lang_type
*lt
= TYPE_LANG_SPECIFIC (t
);
15034 if (lt
&& !(TREE_CODE (t
) == POINTER_TYPE
15035 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
15038 ggc_mark_tree (lt
->primary_base
);
15039 ggc_mark_tree (lt
->vfields
);
15040 ggc_mark_tree (lt
->vbases
);
15041 ggc_mark_tree (lt
->tags
);
15042 ggc_mark_tree (lt
->size
);
15043 ggc_mark_tree (lt
->pure_virtuals
);
15044 ggc_mark_tree (lt
->friend_classes
);
15045 ggc_mark_tree (lt
->rtti
);
15046 ggc_mark_tree (lt
->methods
);
15047 ggc_mark_tree (lt
->template_info
);
15048 ggc_mark_tree (lt
->befriending_classes
);
15051 /* In the case of pointer-to-member function types, the
15052 TYPE_LANG_SPECIFIC is really just a tree. */
15053 ggc_mark_tree ((tree
) lt
);