1 /* Process declarations and variables for C compiler.
2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001 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. */
47 extern int current_class_depth
;
49 extern tree global_namespace
;
51 extern int (*valid_lang_attribute
) PARAMS ((tree
, tree
, tree
, tree
));
53 #ifndef BOOL_TYPE_SIZE
54 /* In the new ABI, `bool' has size and alignment `1', on all
56 #define BOOL_TYPE_SIZE CHAR_TYPE_SIZE
59 static tree grokparms
PARAMS ((tree
));
60 static const char *redeclaration_error_message
PARAMS ((tree
, tree
));
62 static void push_binding_level
PARAMS ((struct binding_level
*, int,
64 static void pop_binding_level
PARAMS ((void));
65 static void suspend_binding_level
PARAMS ((void));
66 static void resume_binding_level
PARAMS ((struct binding_level
*));
67 static struct binding_level
*make_binding_level
PARAMS ((void));
68 static void declare_namespace_level
PARAMS ((void));
69 static int decl_jump_unsafe
PARAMS ((tree
));
70 static void storedecls
PARAMS ((tree
));
71 static void require_complete_types_for_parms
PARAMS ((tree
));
72 static int ambi_op_p
PARAMS ((enum tree_code
));
73 static int unary_op_p
PARAMS ((enum tree_code
));
74 static tree store_bindings
PARAMS ((tree
, tree
));
75 static tree lookup_tag_reverse
PARAMS ((tree
, tree
));
76 static tree obscure_complex_init
PARAMS ((tree
, tree
));
77 static tree lookup_name_real
PARAMS ((tree
, int, int, int));
78 static void warn_extern_redeclared_static
PARAMS ((tree
, tree
));
79 static void grok_reference_init
PARAMS ((tree
, tree
, tree
));
80 static tree grokfndecl
PARAMS ((tree
, tree
, tree
, tree
, int,
81 enum overload_flags
, tree
,
82 tree
, int, int, int, int, int, int, tree
));
83 static tree grokvardecl
PARAMS ((tree
, tree
, RID_BIT_TYPE
*, int, int, tree
));
84 static tree lookup_tag
PARAMS ((enum tree_code
, tree
,
85 struct binding_level
*, int));
86 static void set_identifier_type_value_with_scope
87 PARAMS ((tree
, tree
, struct binding_level
*));
88 static void record_unknown_type
PARAMS ((tree
, const char *));
89 static tree build_library_fn_1
PARAMS ((tree
, enum tree_code
, tree
));
90 static int member_function_or_else
PARAMS ((tree
, tree
, enum overload_flags
));
91 static void bad_specifiers
PARAMS ((tree
, const char *, int, int, int, int,
93 static tree maybe_process_template_type_declaration
PARAMS ((tree
, int, struct binding_level
*));
94 static void check_for_uninitialized_const_var
PARAMS ((tree
));
95 static unsigned long typename_hash
PARAMS ((hash_table_key
));
96 static boolean typename_compare
PARAMS ((hash_table_key
, hash_table_key
));
97 static void push_binding
PARAMS ((tree
, tree
, struct binding_level
*));
98 static int add_binding
PARAMS ((tree
, tree
));
99 static void pop_binding
PARAMS ((tree
, tree
));
100 static tree local_variable_p_walkfn
PARAMS ((tree
*, int *, void *));
101 static tree find_binding
PARAMS ((tree
, tree
));
102 static tree select_decl
PARAMS ((tree
, int));
103 static int lookup_flags
PARAMS ((int, int));
104 static tree qualify_lookup
PARAMS ((tree
, int));
105 static tree record_builtin_java_type
PARAMS ((const char *, int));
106 static const char *tag_name
PARAMS ((enum tag_types code
));
107 static void find_class_binding_level
PARAMS ((void));
108 static struct binding_level
*innermost_nonclass_level
PARAMS ((void));
109 static void warn_about_implicit_typename_lookup
PARAMS ((tree
, tree
));
110 static int walk_namespaces_r
PARAMS ((tree
, walk_namespaces_fn
, void *));
111 static int walk_globals_r
PARAMS ((tree
, void *));
112 static void add_decl_to_level
PARAMS ((tree
, struct binding_level
*));
113 static tree make_label_decl
PARAMS ((tree
, int));
114 static void use_label
PARAMS ((tree
));
115 static void check_previous_goto_1
PARAMS ((tree
, struct binding_level
*, tree
,
117 static void check_previous_goto
PARAMS ((struct named_label_use_list
*));
118 static void check_switch_goto
PARAMS ((struct binding_level
*));
119 static void check_previous_gotos
PARAMS ((tree
));
120 static void pop_label
PARAMS ((tree
, tree
));
121 static void pop_labels
PARAMS ((tree
));
122 static void maybe_deduce_size_from_array_init
PARAMS ((tree
, tree
));
123 static void layout_var_decl
PARAMS ((tree
));
124 static void maybe_commonize_var
PARAMS ((tree
));
125 static tree check_initializer
PARAMS ((tree
, tree
));
126 static void make_rtl_for_nonlocal_decl
PARAMS ((tree
, tree
, const char *));
127 static void push_cp_function_context
PARAMS ((struct function
*));
128 static void pop_cp_function_context
PARAMS ((struct function
*));
129 static void mark_binding_level
PARAMS ((void *));
130 static void mark_named_label_lists
PARAMS ((void *, void *));
131 static void mark_cp_function_context
PARAMS ((struct function
*));
132 static void mark_saved_scope
PARAMS ((void *));
133 static void mark_lang_function
PARAMS ((struct cp_language_function
*));
134 static void save_function_data
PARAMS ((tree
));
135 static void check_function_type
PARAMS ((tree
, tree
));
136 static void destroy_local_var
PARAMS ((tree
));
137 static void finish_constructor_body
PARAMS ((void));
138 static void finish_destructor_body
PARAMS ((void));
139 static tree create_array_type_for_decl
PARAMS ((tree
, tree
, tree
));
140 static tree get_atexit_node
PARAMS ((void));
141 static tree get_dso_handle_node
PARAMS ((void));
142 static tree start_cleanup_fn
PARAMS ((void));
143 static void end_cleanup_fn
PARAMS ((void));
144 static tree cp_make_fname_decl
PARAMS ((tree
, const char *, int));
145 static void initialize_predefined_identifiers
PARAMS ((void));
146 static tree check_special_function_return_type
147 PARAMS ((special_function_kind
, tree
, tree
));
148 static tree push_cp_library_fn
PARAMS ((enum tree_code
, tree
));
149 static tree build_cp_library_fn
PARAMS ((tree
, enum tree_code
, tree
));
150 static void store_parm_decls
PARAMS ((tree
));
151 static int cp_missing_noreturn_ok_p
PARAMS ((tree
));
153 #if defined (DEBUG_CP_BINDING_LEVELS)
154 static void indent
PARAMS ((void));
157 /* Erroneous argument lists can use this *IFF* they do not modify it. */
158 tree error_mark_list
;
160 /* The following symbols are subsumed in the cp_global_trees array, and
161 listed here individually for documentation purposes.
164 tree wchar_decl_node;
166 tree vtable_entry_type;
167 tree delta_type_node;
170 tree __baselist_desc_type_node;
171 tree __i_desc_type_node, __m_desc_type_node;
172 tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type;
174 tree __t_desc_type_node;
176 tree __tp_desc_type_node;
178 tree ti_desc_type_node;
179 tree bltn_desc_type_node, ptr_desc_type_node;
180 tree ary_desc_type_node, func_desc_type_node, enum_desc_type_node;
181 tree class_desc_type_node, si_class_desc_type_node, vmi_class_desc_type_node;
182 tree ptm_desc_type_node;
183 tree base_desc_type_node;
185 Not needed yet? May be needed one day?
186 tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type;
187 tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type;
188 tree __ptmf_desc_array_type, __ptmd_desc_array_type;
191 tree class_type_node, record_type_node, union_type_node, enum_type_node;
192 tree unknown_type_node;
194 Array type `vtable_entry_type[]'
197 tree vtbl_ptr_type_node;
204 A FUNCTION_DECL which can call `abort'. Not necessarily the
205 one that the user will declare, but sufficient to be called
206 by routines that want to abort the program.
210 The FUNCTION_DECL for the default `::operator delete'.
212 tree global_delete_fndecl;
215 tree type_info_type_node, tinfo_decl_id, tinfo_decl_type;
220 tree cp_global_trees
[CPTI_MAX
];
222 /* Indicates that there is a type value in some namespace, although
223 that is not necessarily in scope at the moment. */
225 static tree global_type_node
;
227 /* If non-zero, this is the number of times we have entered the `std'
228 namespace when we are treating that namespace as an alias for the
230 static int in_fake_std
;
232 /* Expect only namespace names now. */
233 static int only_namespace_names
;
235 /* Used only for jumps to as-yet undefined labels, since jumps to
236 defined labels can have their validity checked immediately. */
238 struct named_label_use_list
240 struct binding_level
*binding_level
;
243 const char *filename_o_goto
;
245 struct named_label_use_list
*next
;
248 #define named_label_uses cp_function_chain->x_named_label_uses
250 /* A list of objects which have constructors or destructors
251 which reside in the global scope. The decl is stored in
252 the TREE_VALUE slot and the initializer is stored
253 in the TREE_PURPOSE slot. */
254 tree static_aggregates
;
258 /* A node for the integer constants 2, and 3. */
260 tree integer_two_node
, integer_three_node
;
262 /* Parsing a function declarator leaves here a chain of structure
263 and enum types declared in the parmlist. */
265 static tree last_function_parm_tags
;
267 /* Similar, for last_function_parm_tags. */
268 tree last_function_parms
;
269 static tree current_function_parm_tags
;
271 /* A list of all LABEL_DECLs in the function that have names. Here so
272 we can clear out their names' definitions at the end of the
273 function, and so we can check the validity of jumps to these labels. */
275 struct named_label_list
277 struct binding_level
*binding_level
;
283 struct named_label_list
*next
;
286 #define named_labels cp_function_chain->x_named_labels
288 /* Set to 0 at beginning of a function definition, and whenever
289 a label (case or named) is defined. Set to value of expression
290 returned from function when that value can be transformed into
291 a named return value. */
293 tree current_function_return_value
;
295 /* Nonzero means use the ISO C94 dialect of C. */
299 /* Nonzero means use the ISO C99 dialect of C. */
303 /* Nonzero means we are a hosted implementation for code shared with C. */
307 /* Nonzero means add default format_arg attributes for functions not
310 int flag_noniso_default_format_attributes
= 1;
312 /* Nonzero if we want to conserve space in the .o files. We do this
313 by putting uninitialized data and runtime initialized data into
314 .common instead of .data at the expense of not flagging multiple
316 extern int flag_conserve_space
;
318 /* C and C++ flags are in decl2.c. */
320 /* Flag used when debugging spew.c */
322 extern int spew_debug
;
324 /* A expression of value 0 with the same precision as a sizetype
326 tree signed_size_zero_node
;
328 /* The name of the anonymous namespace, throughout this translation
330 tree anonymous_namespace_name
;
332 /* The number of function bodies which we are currently processing.
333 (Zero if we are at namespace scope, one inside the body of a
334 function, two inside the body of a function in a local class, etc.) */
337 /* For each binding contour we allocate a binding_level structure
338 which records the names defined in that contour.
341 1) one for each function definition,
342 where internal declarations of the parameters appear.
343 2) one for each compound statement,
344 to record its declarations.
346 The current meaning of a name can be found by searching the levels
347 from the current one out to the global one.
349 Off to the side, may be the class_binding_level. This exists only
350 to catch class-local declarations. It is otherwise nonexistent.
352 Also there may be binding levels that catch cleanups that must be
353 run when exceptions occur. Thus, to see whether a name is bound in
354 the current scope, it is not enough to look in the
355 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
358 /* Note that the information in the `names' component of the global contour
359 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
363 /* A chain of _DECL nodes for all variables, constants, functions,
364 and typedef types. These are in the reverse of the order
365 supplied. There may be OVERLOADs on this list, too, but they
366 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
369 /* A list of structure, union and enum definitions, for looking up
371 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
372 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
373 or ENUMERAL_TYPE node.
375 C++: the TREE_VALUE nodes can be simple types for
376 component_bindings. */
379 /* A list of USING_DECL nodes. */
382 /* A list of used namespaces. PURPOSE is the namespace,
383 VALUE the common ancestor with this binding_level's namespace. */
384 tree using_directives
;
386 /* If this binding level is the binding level for a class, then
387 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
388 is the name of an entity bound in the class. The TREE_TYPE is
389 the DECL bound by this name in the class. */
392 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
393 is used for all binding levels. In addition the TREE_VALUE is the
394 IDENTIFIER_TYPE_VALUE before we entered the class. */
397 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
398 label in this scope. The TREE_PURPOSE is the previous value of
399 the IDENTIFIER_LABEL VALUE. */
400 tree shadowed_labels
;
402 /* For each level (except not the global one),
403 a chain of BLOCK nodes for all the levels
404 that were entered and exited one level down. */
407 /* The _TYPE node for this level, if parm_flag == 2. */
410 /* The binding level which this one is contained in (inherits from). */
411 struct binding_level
*level_chain
;
413 /* List of decls in `names' that have incomplete
414 structure or union types. */
417 /* List of VAR_DECLS saved from a previous for statement.
418 These would be dead in ISO-conforming code, but might
419 be referenced in ARM-era code. These are stored in a
420 TREE_LIST; the TREE_VALUE is the actual declaration. */
421 tree dead_vars_from_for
;
423 /* 1 for the level that holds the parameters of a function.
424 2 for the level that holds a class declaration. */
425 unsigned parm_flag
: 2;
427 /* 1 means make a BLOCK for this level regardless of all else.
428 2 for temporary binding contours created by the compiler. */
431 /* Nonzero if this level "doesn't exist" for tags. */
432 unsigned tag_transparent
: 1;
434 /* Nonzero if this level can safely have additional
435 cleanup-needing variables added to it. */
436 unsigned more_cleanups_ok
: 1;
437 unsigned have_cleanups
: 1;
439 /* Nonzero if this scope is for storing the decls for template
440 parameters and generic decls; these decls will be discarded and
441 replaced with a TEMPLATE_DECL. */
442 unsigned template_parms_p
: 1;
444 /* Nonzero if this scope corresponds to the `<>' in a
445 `template <>' clause. Whenever this flag is set,
446 TEMPLATE_PARMS_P will be set as well. */
447 unsigned template_spec_p
: 1;
449 /* This is set for a namespace binding level. */
450 unsigned namespace_p
: 1;
452 /* True if this level is that of a for-statement where we need to
453 worry about ambiguous (ARM or ISO) scope rules. */
454 unsigned is_for_scope
: 1;
456 /* True if this level corresponds to an EH region, as for a try block.
457 Currently this information is only available while building the
459 unsigned eh_region
: 1;
461 /* Four bits left for this word. */
463 #if defined(DEBUG_CP_BINDING_LEVELS)
464 /* Binding depth at which this level began. */
465 unsigned binding_depth
;
466 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
469 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
471 /* The binding level currently in effect. */
473 #define current_binding_level \
475 ? cp_function_chain->bindings \
476 : scope_chain->bindings)
478 /* The binding level of the current class, if any. */
480 #define class_binding_level scope_chain->class_bindings
482 /* A chain of binding_level structures awaiting reuse. */
484 static struct binding_level
*free_binding_level
;
486 /* The outermost binding level, for names of file scope.
487 This is created when the compiler is started and exists
488 through the entire run. */
490 static struct binding_level
*global_binding_level
;
492 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
494 static int keep_next_level_flag
;
496 #if defined(DEBUG_CP_BINDING_LEVELS)
497 static int binding_depth
= 0;
498 static int is_class_level
= 0;
505 for (i
= 0; i
< binding_depth
*2; i
++)
508 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
510 static tree pushdecl_with_scope
PARAMS ((tree
, struct binding_level
*));
513 push_binding_level (newlevel
, tag_transparent
, keep
)
514 struct binding_level
*newlevel
;
515 int tag_transparent
, keep
;
517 /* Add this level to the front of the chain (stack) of levels that
519 memset ((char*) newlevel
, 0, sizeof (struct binding_level
));
520 newlevel
->level_chain
= current_binding_level
;
521 current_binding_level
= newlevel
;
522 newlevel
->tag_transparent
= tag_transparent
;
523 newlevel
->more_cleanups_ok
= 1;
525 newlevel
->keep
= keep
;
526 #if defined(DEBUG_CP_BINDING_LEVELS)
527 newlevel
->binding_depth
= binding_depth
;
529 fprintf (stderr
, "push %s level 0x%08x line %d\n",
530 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
533 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
536 /* Find the innermost enclosing class scope, and reset
537 CLASS_BINDING_LEVEL appropriately. */
540 find_class_binding_level ()
542 struct binding_level
*level
= current_binding_level
;
544 while (level
&& level
->parm_flag
!= 2)
545 level
= level
->level_chain
;
546 if (level
&& level
->parm_flag
== 2)
547 class_binding_level
= level
;
549 class_binding_level
= 0;
555 if (global_binding_level
)
557 /* Cannot pop a level, if there are none left to pop. */
558 if (current_binding_level
== global_binding_level
)
559 my_friendly_abort (123);
561 /* Pop the current level, and free the structure for reuse. */
562 #if defined(DEBUG_CP_BINDING_LEVELS)
565 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
566 (is_class_level
) ? "class" : "block",
567 current_binding_level
, lineno
);
568 if (is_class_level
!= (current_binding_level
== class_binding_level
))
571 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
574 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
576 register struct binding_level
*level
= current_binding_level
;
577 current_binding_level
= current_binding_level
->level_chain
;
578 level
->level_chain
= free_binding_level
;
579 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
580 if (level
->binding_depth
!= binding_depth
)
582 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
583 free_binding_level
= level
;
584 find_class_binding_level ();
589 suspend_binding_level ()
591 if (class_binding_level
)
592 current_binding_level
= class_binding_level
;
594 if (global_binding_level
)
596 /* Cannot suspend a level, if there are none left to suspend. */
597 if (current_binding_level
== global_binding_level
)
598 my_friendly_abort (123);
600 /* Suspend the current level. */
601 #if defined(DEBUG_CP_BINDING_LEVELS)
604 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
605 (is_class_level
) ? "class" : "block",
606 current_binding_level
, lineno
);
607 if (is_class_level
!= (current_binding_level
== class_binding_level
))
610 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
613 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
614 current_binding_level
= current_binding_level
->level_chain
;
615 find_class_binding_level ();
619 resume_binding_level (b
)
620 struct binding_level
*b
;
622 /* Resuming binding levels is meant only for namespaces,
623 and those cannot nest into classes. */
624 my_friendly_assert(!class_binding_level
, 386);
625 /* Also, resuming a non-directly nested namespace is a no-no. */
626 my_friendly_assert(b
->level_chain
== current_binding_level
, 386);
627 current_binding_level
= b
;
628 #if defined(DEBUG_CP_BINDING_LEVELS)
629 b
->binding_depth
= binding_depth
;
631 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
632 (is_class_level
) ? "class" : "block", b
, lineno
);
635 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
638 /* Create a new `struct binding_level'. */
641 struct binding_level
*
642 make_binding_level ()
645 return (struct binding_level
*) xmalloc (sizeof (struct binding_level
));
648 /* Nonzero if we are currently in the global binding level. */
653 return current_binding_level
== global_binding_level
;
656 /* Return the innermost binding level that is not for a class scope. */
658 static struct binding_level
*
659 innermost_nonclass_level ()
661 struct binding_level
*b
;
663 b
= current_binding_level
;
664 while (b
->parm_flag
== 2)
670 /* Nonzero if we are currently in a toplevel binding level. This
671 means either the global binding level or a namespace in a toplevel
672 binding level. Since there are no non-toplevel namespace levels,
673 this really means any namespace or template parameter level. We
674 also include a class whose context is toplevel. */
677 toplevel_bindings_p ()
679 struct binding_level
*b
= innermost_nonclass_level ();
681 return b
->namespace_p
|| b
->template_parms_p
;
684 /* Nonzero if this is a namespace scope, or if we are defining a class
685 which is itself at namespace scope, or whose enclosing class is
686 such a class, etc. */
689 namespace_bindings_p ()
691 struct binding_level
*b
= innermost_nonclass_level ();
693 return b
->namespace_p
;
696 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
697 unconditionally. Otherwise, use the normal logic to decide whether
698 or not to create a BLOCK. */
701 keep_next_level (keep
)
704 keep_next_level_flag
= keep
;
707 /* Nonzero if the current level needs to have a BLOCK made. */
712 return (current_binding_level
->blocks
!= NULL_TREE
713 || current_binding_level
->keep
714 || current_binding_level
->names
!= NULL_TREE
715 || (current_binding_level
->tags
!= NULL_TREE
716 && !current_binding_level
->tag_transparent
));
720 declare_namespace_level ()
722 current_binding_level
->namespace_p
= 1;
725 /* Returns non-zero if this scope was created to store template
729 template_parm_scope_p ()
731 return current_binding_level
->template_parms_p
;
734 /* Returns the kind of template specialization we are currently
735 processing, given that it's declaration contained N_CLASS_SCOPES
736 explicit scope qualifications. */
739 current_tmpl_spec_kind (n_class_scopes
)
742 int n_template_parm_scopes
= 0;
743 int seen_specialization_p
= 0;
744 int innermost_specialization_p
= 0;
745 struct binding_level
*b
;
747 /* Scan through the template parameter scopes. */
748 for (b
= current_binding_level
; b
->template_parms_p
; b
= b
->level_chain
)
750 /* If we see a specialization scope inside a parameter scope,
751 then something is wrong. That corresponds to a declaration
754 template <class T> template <> ...
756 which is always illegal since [temp.expl.spec] forbids the
757 specialization of a class member template if the enclosing
758 class templates are not explicitly specialized as well. */
759 if (b
->template_spec_p
)
761 if (n_template_parm_scopes
== 0)
762 innermost_specialization_p
= 1;
764 seen_specialization_p
= 1;
766 else if (seen_specialization_p
== 1)
767 return tsk_invalid_member_spec
;
769 ++n_template_parm_scopes
;
772 /* Handle explicit instantiations. */
773 if (processing_explicit_instantiation
)
775 if (n_template_parm_scopes
!= 0)
776 /* We've seen a template parameter list during an explicit
777 instantiation. For example:
779 template <class T> template void f(int);
781 This is erroneous. */
782 return tsk_invalid_expl_inst
;
784 return tsk_expl_inst
;
787 if (n_template_parm_scopes
< n_class_scopes
)
788 /* We've not seen enough template headers to match all the
789 specialized classes present. For example:
791 template <class T> void R<T>::S<T>::f(int);
793 This is illegal; there needs to be one set of template
794 parameters for each class. */
795 return tsk_insufficient_parms
;
796 else if (n_template_parm_scopes
== n_class_scopes
)
797 /* We're processing a non-template declaration (even though it may
798 be a member of a template class.) For example:
800 template <class T> void S<T>::f(int);
802 The `class T' maches the `S<T>', leaving no template headers
803 corresponding to the `f'. */
805 else if (n_template_parm_scopes
> n_class_scopes
+ 1)
806 /* We've got too many template headers. For example:
808 template <> template <class T> void f (T);
810 There need to be more enclosing classes. */
811 return tsk_excessive_parms
;
813 /* This must be a template. It's of the form:
815 template <class T> template <class U> void S<T>::f(U);
817 This is a specialization if the innermost level was a
818 specialization; otherwise it's just a definition of the
820 return innermost_specialization_p
? tsk_expl_spec
: tsk_template
;
824 set_class_shadows (shadows
)
827 class_binding_level
->class_shadowed
= shadows
;
830 /* Enter a new binding level.
831 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
832 not for that of tags. */
835 pushlevel (tag_transparent
)
838 struct binding_level
*newlevel
;
840 if (cfun
&& !doing_semantic_analysis_p ())
843 /* Reuse or create a struct for this binding level. */
844 #if defined(DEBUG_CP_BINDING_LEVELS)
846 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
847 if (free_binding_level
)
848 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
850 newlevel
= free_binding_level
;
851 free_binding_level
= free_binding_level
->level_chain
;
854 newlevel
= make_binding_level ();
856 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
857 GNU_xref_start_scope ((HOST_WIDE_INT
) newlevel
);
858 keep_next_level_flag
= 0;
861 /* We're defining an object of type TYPE. If it needs a cleanup, but
862 we're not allowed to add any more objects with cleanups to the current
863 scope, create a new binding level. */
866 maybe_push_cleanup_level (type
)
869 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
870 && current_binding_level
->more_cleanups_ok
== 0)
875 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/1);
879 /* Enter a new scope. The KIND indicates what kind of scope is being
890 case sk_template_spec
:
891 current_binding_level
->template_spec_p
= 1;
894 case sk_template_parms
:
895 current_binding_level
->template_parms_p
= 1;
899 my_friendly_abort (20000309);
903 /* Exit the current scope. */
912 note_level_for_for ()
914 current_binding_level
->is_for_scope
= 1;
917 /* Record that the current binding level represents a try block. */
922 current_binding_level
->eh_region
= 1;
925 /* For a binding between a name and an entity at a block scope,
926 this is the `struct binding_level' for the block. */
927 #define BINDING_LEVEL(NODE) \
928 (((struct tree_binding*)NODE)->scope.level)
930 /* A free list of CPLUS_BINDING nodes, connected by their
933 static tree free_bindings
;
935 /* Make DECL the innermost binding for ID. The LEVEL is the binding
936 level at which this declaration is being bound. */
939 push_binding (id
, decl
, level
)
942 struct binding_level
* level
;
948 binding
= free_bindings
;
949 free_bindings
= TREE_CHAIN (binding
);
952 binding
= make_node (CPLUS_BINDING
);
954 /* Now, fill in the binding information. */
955 BINDING_VALUE (binding
) = decl
;
956 BINDING_TYPE (binding
) = NULL_TREE
;
957 BINDING_LEVEL (binding
) = level
;
958 INHERITED_VALUE_BINDING_P (binding
) = 0;
959 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
960 BINDING_HAS_LEVEL_P (binding
) = 1;
962 /* And put it on the front of the list of bindings for ID. */
963 TREE_CHAIN (binding
) = IDENTIFIER_BINDING (id
);
964 IDENTIFIER_BINDING (id
) = binding
;
967 /* ID is already bound in the current scope. But, DECL is an
968 additional binding for ID in the same scope. This is the `struct
969 stat' hack whereby a non-typedef class-name or enum-name can be
970 bound at the same level as some other kind of entity. It's the
971 responsibility of the caller to check that inserting this name is
972 legal here. Returns nonzero if the new binding was successful. */
974 add_binding (id
, decl
)
978 tree binding
= IDENTIFIER_BINDING (id
);
981 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
982 /* The new name is the type name. */
983 BINDING_TYPE (binding
) = decl
;
984 else if (!BINDING_VALUE (binding
))
985 /* This situation arises when push_class_level_binding moves an
986 inherited type-binding out of the way to make room for a new
988 BINDING_VALUE (binding
) = decl
;
989 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
990 && DECL_ARTIFICIAL (BINDING_VALUE (binding
)))
992 /* The old binding was a type name. It was placed in
993 BINDING_VALUE because it was thought, at the point it was
994 declared, to be the only entity with such a name. Move the
995 type name into the type slot; it is now hidden by the new
997 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
998 BINDING_VALUE (binding
) = decl
;
999 INHERITED_VALUE_BINDING_P (binding
) = 0;
1001 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
1002 && TREE_CODE (decl
) == TYPE_DECL
1003 && DECL_NAME (decl
) == DECL_NAME (BINDING_VALUE (binding
))
1004 && same_type_p (TREE_TYPE (decl
),
1005 TREE_TYPE (BINDING_VALUE (binding
))))
1006 /* We have two typedef-names, both naming the same type to have
1007 the same name. This is OK because of:
1011 In a given scope, a typedef specifier can be used to redefine
1012 the name of any type declared in that scope to refer to the
1013 type to which it already refers. */
1015 /* There can be two block-scope declarations of the same variable,
1016 so long as they are `extern' declarations. */
1017 else if (TREE_CODE (decl
) == VAR_DECL
1018 && TREE_CODE (BINDING_VALUE (binding
)) == VAR_DECL
1019 && DECL_EXTERNAL (decl
)
1020 && DECL_EXTERNAL (BINDING_VALUE (binding
)))
1022 duplicate_decls (decl
, BINDING_VALUE (binding
));
1027 cp_error ("declaration of `%#D'", decl
);
1028 cp_error_at ("conflicts with previous declaration `%#D'",
1029 BINDING_VALUE (binding
));
1036 /* Add DECL to the list of things declared in B. */
1039 add_decl_to_level (decl
, b
)
1041 struct binding_level
*b
;
1043 /* We build up the list in reverse order, and reverse it later if
1045 TREE_CHAIN (decl
) = b
->names
;
1049 /* Bind DECL to ID in the current_binding_level, assumed to be a local
1050 binding level. If PUSH_USING is set in FLAGS, we know that DECL
1051 doesn't really belong to this binding level, that it got here
1052 through a using-declaration. */
1055 push_local_binding (id
, decl
, flags
)
1060 struct binding_level
*b
;
1062 /* Skip over any local classes. This makes sense if we call
1063 push_local_binding with a friend decl of a local class. */
1064 b
= current_binding_level
;
1065 while (b
->parm_flag
== 2)
1068 if (lookup_name_current_level (id
))
1070 /* Supplement the existing binding. */
1071 if (!add_binding (id
, decl
))
1072 /* It didn't work. Something else must be bound at this
1073 level. Do not add DECL to the list of things to pop
1078 /* Create a new binding. */
1079 push_binding (id
, decl
, b
);
1081 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
1082 /* We must put the OVERLOAD into a TREE_LIST since the
1083 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1084 decls that got here through a using-declaration. */
1085 decl
= build_tree_list (NULL_TREE
, decl
);
1087 /* And put DECL on the list of things declared by the current
1089 add_decl_to_level (decl
, b
);
1092 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
1093 binding was successful. */
1096 push_class_binding (id
, decl
)
1101 tree binding
= IDENTIFIER_BINDING (id
);
1104 /* Note that we declared this value so that we can issue an error if
1105 this an illegal redeclaration of a name already used for some
1107 note_name_declared_in_class (id
, decl
);
1109 if (binding
&& BINDING_LEVEL (binding
) == class_binding_level
)
1110 /* Supplement the existing binding. */
1111 result
= add_binding (id
, decl
);
1113 /* Create a new binding. */
1114 push_binding (id
, decl
, class_binding_level
);
1116 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1117 class-level declaration. Note that we do not use DECL here
1118 because of the possibility of the `struct stat' hack; if DECL is
1119 a class-name or enum-name we might prefer a field-name, or some
1121 IDENTIFIER_CLASS_VALUE (id
) = BINDING_VALUE (IDENTIFIER_BINDING (id
));
1123 /* If this is a binding from a base class, mark it as such. */
1124 binding
= IDENTIFIER_BINDING (id
);
1125 if (BINDING_VALUE (binding
) == decl
&& TREE_CODE (decl
) != TREE_LIST
)
1127 /* Any implicit typename must be from a base-class. The
1128 context for an implicit typename declaration is always
1129 the derived class in which the lookup was done, so the checks
1130 based on the context of DECL below will not trigger. */
1131 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl
))
1132 INHERITED_VALUE_BINDING_P (binding
) = 1;
1135 if (TREE_CODE (decl
) == OVERLOAD
)
1136 context
= CP_DECL_CONTEXT (OVL_CURRENT (decl
));
1139 my_friendly_assert (DECL_P (decl
), 0);
1140 context
= context_for_name_lookup (decl
);
1143 if (is_properly_derived_from (current_class_type
, context
))
1144 INHERITED_VALUE_BINDING_P (binding
) = 1;
1146 INHERITED_VALUE_BINDING_P (binding
) = 0;
1149 else if (BINDING_VALUE (binding
) == decl
)
1150 /* We only encounter a TREE_LIST when push_class_decls detects an
1151 ambiguity. Such an ambiguity can be overridden by a definition
1153 INHERITED_VALUE_BINDING_P (binding
) = 1;
1158 /* Remove the binding for DECL which should be the innermost binding
1162 pop_binding (id
, decl
)
1168 if (id
== NULL_TREE
)
1169 /* It's easiest to write the loops that call this function without
1170 checking whether or not the entities involved have names. We
1171 get here for such an entity. */
1174 /* Get the innermost binding for ID. */
1175 binding
= IDENTIFIER_BINDING (id
);
1177 /* The name should be bound. */
1178 my_friendly_assert (binding
!= NULL_TREE
, 0);
1180 /* The DECL will be either the ordinary binding or the type
1181 binding for this identifier. Remove that binding. */
1182 if (BINDING_VALUE (binding
) == decl
)
1183 BINDING_VALUE (binding
) = NULL_TREE
;
1184 else if (BINDING_TYPE (binding
) == decl
)
1185 BINDING_TYPE (binding
) = NULL_TREE
;
1187 my_friendly_abort (0);
1189 if (!BINDING_VALUE (binding
) && !BINDING_TYPE (binding
))
1191 /* We're completely done with the innermost binding for this
1192 identifier. Unhook it from the list of bindings. */
1193 IDENTIFIER_BINDING (id
) = TREE_CHAIN (binding
);
1195 /* Add it to the free list. */
1196 TREE_CHAIN (binding
) = free_bindings
;
1197 free_bindings
= binding
;
1199 /* Clear the BINDING_LEVEL so the garbage collector doesn't walk
1201 BINDING_LEVEL (binding
) = NULL
;
1205 /* When a label goes out of scope, check to see if that label was used
1206 in a valid manner, and issue any appropriate warnings or errors. */
1209 pop_label (label
, old_value
)
1213 if (!processing_template_decl
&& doing_semantic_analysis_p ())
1215 if (DECL_INITIAL (label
) == NULL_TREE
)
1217 cp_error_at ("label `%D' used but not defined", label
);
1218 /* Avoid crashing later. */
1219 define_label (input_filename
, 1, DECL_NAME (label
));
1221 else if (warn_unused_label
&& !TREE_USED (label
))
1222 cp_warning_at ("label `%D' defined but not used", label
);
1225 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), old_value
);
1228 /* At the end of a function, all labels declared within the function
1229 go out of scope. BLOCK is the top-level block for the
1236 struct named_label_list
*link
;
1238 /* Clear out the definitions of all label names, since their scopes
1240 for (link
= named_labels
; link
; link
= link
->next
)
1242 pop_label (link
->label_decl
, link
->old_value
);
1243 /* Put the labels into the "variables" of the top-level block,
1244 so debugger can see them. */
1245 TREE_CHAIN (link
->label_decl
) = BLOCK_VARS (block
);
1246 BLOCK_VARS (block
) = link
->label_decl
;
1249 named_labels
= NULL
;
1252 /* Exit a binding level.
1253 Pop the level off, and restore the state of the identifier-decl mappings
1254 that were in effect when this level was entered.
1256 If KEEP == 1, this level had explicit declarations, so
1257 and create a "block" (a BLOCK node) for the level
1258 to record its declarations and subblocks for symbol table output.
1260 If FUNCTIONBODY is nonzero, this level is the body of a function,
1261 so create a block as if KEEP were set and also clear out all
1264 If REVERSE is nonzero, reverse the order of decls before putting
1265 them into the BLOCK. */
1268 poplevel (keep
, reverse
, functionbody
)
1274 /* The chain of decls was accumulated in reverse order.
1275 Put it into forward order, just for cleanliness. */
1277 int tmp
= functionbody
;
1278 int real_functionbody
;
1281 tree block
= NULL_TREE
;
1283 int leaving_for_scope
;
1285 if (cfun
&& !doing_semantic_analysis_p ())
1288 my_friendly_assert (current_binding_level
->parm_flag
!= 2,
1291 real_functionbody
= (current_binding_level
->keep
== 2
1292 ? ((functionbody
= 0), tmp
) : functionbody
);
1293 tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1294 subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1296 my_friendly_assert (!current_binding_level
->class_shadowed
,
1299 /* We used to use KEEP == 2 to indicate that the new block should go
1300 at the beginning of the list of blocks at this binding level,
1301 rather than the end. This hack is no longer used. */
1302 my_friendly_assert (keep
== 0 || keep
== 1, 0);
1304 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1305 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1306 current_binding_level
->parm_flag
,
1307 current_binding_level
->keep
);
1309 if (current_binding_level
->keep
== 1)
1312 /* Any uses of undefined labels, and any defined labels, now operate
1313 under constraints of next binding contour. */
1314 if (cfun
&& !functionbody
)
1316 struct binding_level
*level_chain
;
1317 level_chain
= current_binding_level
->level_chain
;
1320 struct named_label_use_list
*uses
;
1321 struct named_label_list
*labels
;
1322 for (labels
= named_labels
; labels
; labels
= labels
->next
)
1323 if (labels
->binding_level
== current_binding_level
)
1326 if (current_binding_level
->eh_region
)
1327 labels
->eh_region
= 1;
1328 for (decl
= labels
->names_in_scope
; decl
;
1329 decl
= TREE_CHAIN (decl
))
1330 if (decl_jump_unsafe (decl
))
1331 labels
->bad_decls
= tree_cons (NULL_TREE
, decl
,
1333 labels
->binding_level
= level_chain
;
1334 labels
->names_in_scope
= level_chain
->names
;
1337 for (uses
= named_label_uses
; uses
; uses
= uses
->next
)
1338 if (uses
->binding_level
== current_binding_level
)
1340 uses
->binding_level
= level_chain
;
1341 uses
->names_in_scope
= level_chain
->names
;
1346 /* Get the decls in the order they were written.
1347 Usually current_binding_level->names is in reverse order.
1348 But parameter decls were previously put in forward order. */
1351 current_binding_level
->names
1352 = decls
= nreverse (current_binding_level
->names
);
1354 decls
= current_binding_level
->names
;
1356 /* Output any nested inline functions within this block
1357 if they weren't already output. */
1358 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1359 if (TREE_CODE (decl
) == FUNCTION_DECL
1360 && ! TREE_ASM_WRITTEN (decl
)
1361 && DECL_INITIAL (decl
) != NULL_TREE
1362 && TREE_ADDRESSABLE (decl
)
1363 && decl_function_context (decl
) == current_function_decl
)
1365 /* If this decl was copied from a file-scope decl
1366 on account of a block-scope extern decl,
1367 propagate TREE_ADDRESSABLE to the file-scope decl. */
1368 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1369 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1372 push_function_context ();
1373 output_inline_function (decl
);
1374 pop_function_context ();
1378 /* When not in function-at-a-time mode, expand_end_bindings will
1379 warn about unused variables. But, in function-at-a-time mode
1380 expand_end_bindings is not passed the list of variables in the
1381 current scope, and therefore no warning is emitted. So, we
1382 explicitly warn here. */
1383 if (!processing_template_decl
)
1384 warn_about_unused_variables (getdecls ());
1386 /* If there were any declarations or structure tags in that level,
1387 or if this level is a function body,
1388 create a BLOCK to record them for the life of this function. */
1390 if (keep
== 1 || functionbody
)
1391 block
= make_node (BLOCK
);
1392 if (block
!= NULL_TREE
)
1394 BLOCK_VARS (block
) = decls
;
1395 BLOCK_SUBBLOCKS (block
) = subblocks
;
1398 /* In each subblock, record that this is its superior. */
1400 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1401 BLOCK_SUPERCONTEXT (link
) = block
;
1403 /* We still support the old for-scope rules, whereby the variables
1404 in a for-init statement were in scope after the for-statement
1405 ended. We only use the new rules in flag_new_for_scope is
1408 = current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1;
1410 /* Remove declarations for all the DECLs in this level. */
1411 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1413 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
1414 && DECL_NAME (link
))
1417 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link
)));
1421 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
1423 ns_binding
= NULL_TREE
;
1426 && (BINDING_LEVEL (outer_binding
)
1427 == current_binding_level
->level_chain
))
1428 /* We have something like:
1433 and we are leaving the `for' scope. There's no reason to
1434 keep the binding of the inner `i' in this case. */
1435 pop_binding (DECL_NAME (link
), link
);
1436 else if ((outer_binding
1437 && (TREE_CODE (BINDING_VALUE (outer_binding
))
1440 && TREE_CODE (ns_binding
) == TYPE_DECL
))
1441 /* Here, we have something like:
1449 We must pop the for-scope binding so we know what's a
1450 type and what isn't. */
1451 pop_binding (DECL_NAME (link
), link
);
1454 /* Mark this VAR_DECL as dead so that we can tell we left it
1455 there only for backward compatibility. */
1456 DECL_DEAD_FOR_LOCAL (link
) = 1;
1458 /* Keep track of what should of have happenned when we
1459 popped the binding. */
1460 if (outer_binding
&& BINDING_VALUE (outer_binding
))
1461 DECL_SHADOWED_FOR_VAR (link
)
1462 = BINDING_VALUE (outer_binding
);
1464 /* Add it to the list of dead variables in the next
1465 outermost binding to that we can remove these when we
1466 leave that binding. */
1467 current_binding_level
->level_chain
->dead_vars_from_for
1468 = tree_cons (NULL_TREE
, link
,
1469 current_binding_level
->level_chain
->
1470 dead_vars_from_for
);
1472 /* Although we don't pop the CPLUS_BINDING, we do clear
1473 its BINDING_LEVEL since the level is going away now. */
1474 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link
)))
1480 /* Remove the binding. */
1482 if (TREE_CODE (decl
) == TREE_LIST
)
1483 decl
= TREE_VALUE (decl
);
1485 pop_binding (DECL_NAME (decl
), decl
);
1486 else if (TREE_CODE (decl
) == OVERLOAD
)
1487 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
1489 my_friendly_abort (0);
1493 /* Remove declarations for any `for' variables from inner scopes
1494 that we kept around. */
1495 for (link
= current_binding_level
->dead_vars_from_for
;
1496 link
; link
= TREE_CHAIN (link
))
1497 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
1499 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1500 for (link
= current_binding_level
->type_shadowed
;
1501 link
; link
= TREE_CHAIN (link
))
1502 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1504 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1505 for (link
= current_binding_level
->shadowed_labels
;
1507 link
= TREE_CHAIN (link
))
1508 pop_label (TREE_VALUE (link
), TREE_PURPOSE (link
));
1510 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1511 list if a `using' declaration put them there. The debugging
1512 back-ends won't understand OVERLOAD, so we remove them here.
1513 Because the BLOCK_VARS are (temporarily) shared with
1514 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1515 popped all the bindings. */
1520 for (d
= &BLOCK_VARS (block
); *d
; )
1522 if (TREE_CODE (*d
) == TREE_LIST
)
1523 *d
= TREE_CHAIN (*d
);
1525 d
= &TREE_CHAIN (*d
);
1529 /* If the level being exited is the top level of a function,
1530 check over all the labels. */
1533 /* Since this is the top level block of a function, the vars are
1534 the function's parameters. Don't leave them in the BLOCK
1535 because they are found in the FUNCTION_DECL instead. */
1536 BLOCK_VARS (block
) = 0;
1540 tmp
= current_binding_level
->keep
;
1542 pop_binding_level ();
1544 DECL_INITIAL (current_function_decl
) = block
;
1546 current_binding_level
->blocks
1547 = chainon (current_binding_level
->blocks
, block
);
1549 /* If we did not make a block for the level just exited,
1550 any blocks made for inner levels
1551 (since they cannot be recorded as subblocks in that level)
1552 must be carried forward so they will later become subblocks
1553 of something else. */
1555 current_binding_level
->blocks
1556 = chainon (current_binding_level
->blocks
, subblocks
);
1558 /* Each and every BLOCK node created here in `poplevel' is important
1559 (e.g. for proper debugging information) so if we created one
1560 earlier, mark it as "used". */
1562 TREE_USED (block
) = 1;
1564 /* Take care of compiler's internal binding structures. */
1570 = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/1);
1573 SCOPE_STMT_BLOCK (TREE_PURPOSE (scope_stmts
)) = block
;
1574 SCOPE_STMT_BLOCK (TREE_VALUE (scope_stmts
)) = block
;
1577 block
= poplevel (keep
, reverse
, functionbody
);
1583 /* Delete the node BLOCK from the current binding level.
1584 This is used for the block inside a stmt expr ({...})
1585 so that the block can be reinserted where appropriate. */
1588 delete_block (block
)
1592 if (current_binding_level
->blocks
== block
)
1593 current_binding_level
->blocks
= TREE_CHAIN (block
);
1594 for (t
= current_binding_level
->blocks
; t
;)
1596 if (TREE_CHAIN (t
) == block
)
1597 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1601 TREE_CHAIN (block
) = NULL_TREE
;
1602 /* Clear TREE_USED which is always set by poplevel.
1603 The flag is set again if insert_block is called. */
1604 TREE_USED (block
) = 0;
1607 /* Insert BLOCK at the end of the list of subblocks of the
1608 current binding level. This is used when a BIND_EXPR is expanded,
1609 to handle the BLOCK node inside the BIND_EXPR. */
1612 insert_block (block
)
1615 TREE_USED (block
) = 1;
1616 current_binding_level
->blocks
1617 = chainon (current_binding_level
->blocks
, block
);
1620 /* Set the BLOCK node for the innermost scope
1621 (the one we are currently in). */
1625 tree block ATTRIBUTE_UNUSED
;
1627 /* The RTL expansion machinery requires us to provide this callback,
1628 but it is not applicable in function-at-a-time mode. */
1629 my_friendly_assert (cfun
&& !doing_semantic_analysis_p (), 20000911);
1632 /* Do a pushlevel for class declarations. */
1637 register struct binding_level
*newlevel
;
1639 /* Reuse or create a struct for this binding level. */
1640 #if defined(DEBUG_CP_BINDING_LEVELS)
1642 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1643 if (free_binding_level
)
1644 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1646 newlevel
= free_binding_level
;
1647 free_binding_level
= free_binding_level
->level_chain
;
1650 newlevel
= make_binding_level ();
1652 #if defined(DEBUG_CP_BINDING_LEVELS)
1654 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1656 push_binding_level (newlevel
, 0, 0);
1658 class_binding_level
= current_binding_level
;
1659 class_binding_level
->parm_flag
= 2;
1660 class_binding_level
->this_class
= current_class_type
;
1663 /* ...and a poplevel for class declarations. */
1668 register struct binding_level
*level
= class_binding_level
;
1671 my_friendly_assert (level
!= 0, 354);
1673 /* If we're leaving a toplevel class, don't bother to do the setting
1674 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1675 shouldn't even be used when current_class_type isn't set, and second,
1676 if we don't touch it here, we're able to use the cache effect if the
1677 next time we're entering a class scope, it is the same class. */
1678 if (current_class_depth
!= 1)
1680 struct binding_level
* b
;
1682 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1683 for (shadowed
= level
->class_shadowed
;
1685 shadowed
= TREE_CHAIN (shadowed
))
1686 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = NULL_TREE
;
1688 /* Find the next enclosing class, and recreate
1689 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1690 b
= level
->level_chain
;
1691 while (b
&& b
->parm_flag
!= 2)
1695 for (shadowed
= b
->class_shadowed
;
1697 shadowed
= TREE_CHAIN (shadowed
))
1701 t
= IDENTIFIER_BINDING (TREE_PURPOSE (shadowed
));
1702 while (t
&& BINDING_LEVEL (t
) != b
)
1706 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
))
1707 = BINDING_VALUE (t
);
1711 /* Remember to save what IDENTIFIER's were bound in this scope so we
1712 can recover from cache misses. */
1714 previous_class_type
= current_class_type
;
1715 previous_class_values
= class_binding_level
->class_shadowed
;
1717 for (shadowed
= level
->type_shadowed
;
1719 shadowed
= TREE_CHAIN (shadowed
))
1720 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1722 /* Remove the bindings for all of the class-level declarations. */
1723 for (shadowed
= level
->class_shadowed
;
1725 shadowed
= TREE_CHAIN (shadowed
))
1726 pop_binding (TREE_PURPOSE (shadowed
), TREE_TYPE (shadowed
));
1728 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1729 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1730 class_binding_level
->parm_flag
,
1731 class_binding_level
->keep
);
1733 /* Now, pop out of the binding level which we created up in the
1734 `pushlevel_class' routine. */
1735 #if defined(DEBUG_CP_BINDING_LEVELS)
1737 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1739 pop_binding_level ();
1742 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1743 for any names in enclosing classes. */
1746 clear_identifier_class_values ()
1750 if (!class_binding_level
)
1753 for (t
= class_binding_level
->class_shadowed
;
1756 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
1759 /* Returns non-zero if T is a virtual function table. */
1762 vtable_decl_p (t
, data
)
1764 void *data ATTRIBUTE_UNUSED
;
1766 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
1769 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1773 vtype_decl_p (t
, data
)
1775 void *data ATTRIBUTE_UNUSED
;
1777 return (TREE_CODE (t
) == TYPE_DECL
1778 && TREE_CODE (TREE_TYPE (t
)) == RECORD_TYPE
1779 && TYPE_POLYMORPHIC_P (TREE_TYPE (t
)));
1782 /* Return the declarations that are members of the namespace NS. */
1785 cp_namespace_decls (ns
)
1788 return NAMESPACE_LEVEL (ns
)->names
;
1791 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1792 itself, calling F for each. The DATA is passed to F as well. */
1795 walk_namespaces_r (namespace, f
, data
)
1797 walk_namespaces_fn f
;
1803 result
|= (*f
) (namespace, data
);
1805 for (current
= cp_namespace_decls (namespace);
1807 current
= TREE_CHAIN (current
))
1809 if (TREE_CODE (current
) != NAMESPACE_DECL
1810 || DECL_NAMESPACE_ALIAS (current
))
1812 if (!DECL_LANG_SPECIFIC (current
))
1815 my_friendly_assert (current
== fake_std_node
, 393);
1819 /* We found a namespace. */
1820 result
|= walk_namespaces_r (current
, f
, data
);
1826 /* Walk all the namespaces, calling F for each. The DATA is passed to
1830 walk_namespaces (f
, data
)
1831 walk_namespaces_fn f
;
1834 return walk_namespaces_r (global_namespace
, f
, data
);
1837 struct walk_globals_data
{
1838 walk_globals_pred p
;
1843 /* Walk the global declarations in NAMESPACE. Whenever one is found
1844 for which P returns non-zero, call F with its address. If any call
1845 to F returns a non-zero value, return a non-zero value. */
1848 walk_globals_r (namespace, data
)
1852 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1853 walk_globals_pred p
= wgd
->p
;
1854 walk_globals_fn f
= wgd
->f
;
1855 void *d
= wgd
->data
;
1859 t
= &NAMESPACE_LEVEL (namespace)->names
;
1866 result
|= (*f
) (t
, d
);
1868 /* If F changed *T, then *T still points at the next item to
1871 t
= &TREE_CHAIN (*t
);
1877 /* Walk the global declarations. Whenever one is found for which P
1878 returns non-zero, call F with its address. If any call to F
1879 returns a non-zero value, return a non-zero value. */
1882 walk_globals (p
, f
, data
)
1883 walk_globals_pred p
;
1887 struct walk_globals_data wgd
;
1892 return walk_namespaces (walk_globals_r
, &wgd
);
1895 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1896 DATA is non-NULL, this is the last time we will call
1897 wrapup_global_declarations for this NAMESPACE. */
1900 wrapup_globals_for_namespace (namespace, data
)
1904 tree globals
= cp_namespace_decls (namespace);
1905 int len
= list_length (globals
);
1906 tree
*vec
= (tree
*) alloca (sizeof (tree
) * len
);
1910 int last_time
= (data
!= 0);
1912 if (last_time
&& namespace == global_namespace
)
1913 /* Let compile_file handle the global namespace. */
1916 /* Process the decls in reverse order--earliest first.
1917 Put them into VEC from back to front, then take out from front. */
1918 for (i
= 0, decl
= globals
; i
< len
; i
++, decl
= TREE_CHAIN (decl
))
1919 vec
[len
- i
- 1] = decl
;
1923 check_global_declarations (vec
, len
);
1927 /* Temporarily mark vtables as external. That prevents
1928 wrapup_global_declarations from writing them out; we must process
1929 them ourselves in finish_vtable_vardecl. */
1930 for (i
= 0; i
< len
; ++i
)
1931 if (vtable_decl_p (vec
[i
], /*data=*/0) && !DECL_EXTERNAL (vec
[i
]))
1933 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 1;
1934 DECL_EXTERNAL (vec
[i
]) = 1;
1937 /* Write out any globals that need to be output. */
1938 result
= wrapup_global_declarations (vec
, len
);
1940 /* Undo the hack to DECL_EXTERNAL above. */
1941 for (i
= 0; i
< len
; ++i
)
1942 if (vtable_decl_p (vec
[i
], /*data=*/0)
1943 && DECL_NOT_REALLY_EXTERN (vec
[i
]))
1945 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 0;
1946 DECL_EXTERNAL (vec
[i
]) = 0;
1953 /* Mark ARG (which is really a struct binding_level **) for GC. */
1956 mark_binding_level (arg
)
1959 struct binding_level
*lvl
= *(struct binding_level
**)arg
;
1961 for (; lvl
; lvl
= lvl
->level_chain
)
1963 ggc_mark_tree (lvl
->names
);
1964 ggc_mark_tree (lvl
->tags
);
1965 ggc_mark_tree (lvl
->usings
);
1966 ggc_mark_tree (lvl
->using_directives
);
1967 ggc_mark_tree (lvl
->class_shadowed
);
1968 ggc_mark_tree (lvl
->type_shadowed
);
1969 ggc_mark_tree (lvl
->shadowed_labels
);
1970 ggc_mark_tree (lvl
->blocks
);
1971 ggc_mark_tree (lvl
->this_class
);
1972 ggc_mark_tree (lvl
->incomplete
);
1973 ggc_mark_tree (lvl
->dead_vars_from_for
);
1978 mark_named_label_lists (labs
, uses
)
1982 struct named_label_list
*l
= *(struct named_label_list
**)labs
;
1983 struct named_label_use_list
*u
= *(struct named_label_use_list
**)uses
;
1985 for (; l
; l
= l
->next
)
1988 mark_binding_level (l
->binding_level
);
1989 ggc_mark_tree (l
->old_value
);
1990 ggc_mark_tree (l
->label_decl
);
1991 ggc_mark_tree (l
->bad_decls
);
1994 for (; u
; u
= u
->next
)
1998 /* For debugging. */
1999 static int no_print_functions
= 0;
2000 static int no_print_builtins
= 0;
2003 print_binding_level (lvl
)
2004 struct binding_level
*lvl
;
2008 fprintf (stderr
, " blocks=");
2009 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
2010 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
2011 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
2012 if (lvl
->tag_transparent
)
2013 fprintf (stderr
, " tag-transparent");
2014 if (lvl
->more_cleanups_ok
)
2015 fprintf (stderr
, " more-cleanups-ok");
2016 if (lvl
->have_cleanups
)
2017 fprintf (stderr
, " have-cleanups");
2018 fprintf (stderr
, "\n");
2021 fprintf (stderr
, " names:\t");
2022 /* We can probably fit 3 names to a line? */
2023 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
2025 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
2027 if (no_print_builtins
2028 && (TREE_CODE (t
) == TYPE_DECL
)
2029 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
2032 /* Function decls tend to have longer names. */
2033 if (TREE_CODE (t
) == FUNCTION_DECL
)
2040 fprintf (stderr
, "\n\t");
2043 print_node_brief (stderr
, "", t
, 0);
2044 if (t
== error_mark_node
)
2048 fprintf (stderr
, "\n");
2052 fprintf (stderr
, " tags:\t");
2054 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
2056 if (TREE_PURPOSE (t
) == NULL_TREE
)
2058 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2065 fprintf (stderr
, "\n\t");
2068 if (TREE_PURPOSE (t
) == NULL_TREE
)
2070 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
2071 fprintf (stderr
, ">");
2073 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2074 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2077 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
2078 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2079 fprintf (stderr
, ">");
2083 fprintf (stderr
, "\n");
2085 if (lvl
->class_shadowed
)
2087 fprintf (stderr
, " class-shadowed:");
2088 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
2090 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2092 fprintf (stderr
, "\n");
2094 if (lvl
->type_shadowed
)
2096 fprintf (stderr
, " type-shadowed:");
2097 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2099 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2101 fprintf (stderr
, "\n");
2106 print_other_binding_stack (stack
)
2107 struct binding_level
*stack
;
2109 struct binding_level
*level
;
2110 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
2112 fprintf (stderr
, "binding level ");
2113 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
2114 fprintf (stderr
, "\n");
2115 print_binding_level (level
);
2120 print_binding_stack ()
2122 struct binding_level
*b
;
2123 fprintf (stderr
, "current_binding_level=");
2124 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
2125 fprintf (stderr
, "\nclass_binding_level=");
2126 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
2127 fprintf (stderr
, "\nglobal_binding_level=");
2128 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
2129 fprintf (stderr
, "\n");
2130 if (class_binding_level
)
2132 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
2133 if (b
== current_binding_level
)
2136 b
= class_binding_level
;
2138 b
= current_binding_level
;
2141 b
= current_binding_level
;
2142 print_other_binding_stack (b
);
2143 fprintf (stderr
, "global:\n");
2144 print_binding_level (global_binding_level
);
2147 /* Namespace binding access routines: The namespace_bindings field of
2148 the identifier is polymorphic, with three possible values:
2149 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2150 indicating the BINDING_VALUE of global_namespace. */
2152 /* Check whether the a binding for the name to scope is known.
2153 Assumes that the bindings of the name are already a list
2154 of bindings. Returns the binding found, or NULL_TREE. */
2157 find_binding (name
, scope
)
2161 tree iter
, prev
= NULL_TREE
;
2163 scope
= ORIGINAL_NAMESPACE (scope
);
2165 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
2166 iter
= TREE_CHAIN (iter
))
2168 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
2169 if (BINDING_SCOPE (iter
) == scope
)
2171 /* Move binding found to the front of the list, so
2172 subsequent lookups will find it faster. */
2175 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
2176 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
2177 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
2186 /* Always returns a binding for name in scope. If the
2187 namespace_bindings is not a list, convert it to one first.
2188 If no binding is found, make a new one. */
2191 binding_for_name (name
, scope
)
2195 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2198 scope
= ORIGINAL_NAMESPACE (scope
);
2200 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
2202 /* Get rid of optimization for global scope. */
2203 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
2204 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
2205 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2207 if (b
&& (result
= find_binding (name
, scope
)))
2209 /* Not found, make a new one. */
2210 result
= make_node (CPLUS_BINDING
);
2211 TREE_CHAIN (result
) = b
;
2212 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2213 BINDING_SCOPE (result
) = scope
;
2214 BINDING_TYPE (result
) = NULL_TREE
;
2215 BINDING_VALUE (result
) = NULL_TREE
;
2219 /* Return the binding value for name in scope, considering that
2220 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2223 namespace_binding (name
, scope
)
2227 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2230 if (scope
== NULL_TREE
)
2231 scope
= global_namespace
;
2232 if (TREE_CODE (b
) != CPLUS_BINDING
)
2233 return (scope
== global_namespace
) ? b
: NULL_TREE
;
2234 name
= find_binding (name
,scope
);
2235 if (name
== NULL_TREE
)
2237 return BINDING_VALUE (name
);
2240 /* Set the binding value for name in scope. If modifying the binding
2241 of global_namespace is attempted, try to optimize it. */
2244 set_namespace_binding (name
, scope
, val
)
2251 if (scope
== NULL_TREE
)
2252 scope
= global_namespace
;
2254 if (scope
== global_namespace
)
2256 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2257 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
2259 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
2263 b
= binding_for_name (name
, scope
);
2264 BINDING_VALUE (b
) = val
;
2267 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2268 select a name that is unique to this compilation unit. */
2271 push_namespace (name
)
2276 int implicit_use
= 0;
2278 if (!global_namespace
)
2280 /* This must be ::. */
2281 my_friendly_assert (name
== get_identifier ("::"), 377);
2286 /* The name of anonymous namespace is unique for the translation
2288 if (!anonymous_namespace_name
)
2289 anonymous_namespace_name
= get_file_function_name ('N');
2290 name
= anonymous_namespace_name
;
2291 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2293 /* Reopening anonymous namespace. */
2297 else if (current_namespace
== global_namespace
2299 && name
== std_identifier
)
2306 /* Check whether this is an extended namespace definition. */
2307 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2308 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
2311 if (DECL_NAMESPACE_ALIAS (d
))
2313 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2314 d
, DECL_NAMESPACE_ALIAS (d
));
2315 d
= DECL_NAMESPACE_ALIAS (d
);
2322 /* Make a new namespace, binding the name to it. */
2323 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
2324 /* The global namespace is not pushed, and the global binding
2325 level is set elsewhere. */
2328 DECL_CONTEXT (d
) = FROB_CONTEXT (current_namespace
);
2331 declare_namespace_level ();
2332 NAMESPACE_LEVEL (d
) = current_binding_level
;
2336 resume_binding_level (NAMESPACE_LEVEL (d
));
2339 do_using_directive (d
);
2340 /* Enter the name space. */
2341 current_namespace
= d
;
2344 /* Pop from the scope of the current namespace. */
2349 if (current_namespace
== global_namespace
)
2351 my_friendly_assert (in_fake_std
> 0, 980421);
2355 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
2356 /* The binding level is not popped, as it might be re-opened later. */
2357 suspend_binding_level ();
2360 /* Push into the scope of the namespace NS, even if it is deeply
2361 nested within another namespace. */
2364 push_nested_namespace (ns
)
2367 if (ns
== global_namespace
)
2368 push_to_top_level ();
2371 push_nested_namespace (CP_DECL_CONTEXT (ns
));
2372 push_namespace (DECL_NAME (ns
));
2376 /* Pop back from the scope of the namespace NS, which was previously
2377 entered with push_nested_namespace. */
2380 pop_nested_namespace (ns
)
2383 while (ns
!= global_namespace
)
2386 ns
= CP_DECL_CONTEXT (ns
);
2389 pop_from_top_level ();
2393 /* Subroutines for reverting temporarily to top-level for instantiation
2394 of templates and such. We actually need to clear out the class- and
2395 local-value slots of all identifiers, so that only the global values
2396 are at all visible. Simply setting current_binding_level to the global
2397 scope isn't enough, because more binding levels may be pushed. */
2398 struct saved_scope
*scope_chain
;
2400 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2403 mark_saved_scope (arg
)
2406 struct saved_scope
*t
= *(struct saved_scope
**)arg
;
2409 mark_binding_level (&t
->class_bindings
);
2410 ggc_mark_tree (t
->old_bindings
);
2411 ggc_mark_tree (t
->old_namespace
);
2412 ggc_mark_tree (t
->class_name
);
2413 ggc_mark_tree (t
->class_type
);
2414 ggc_mark_tree (t
->access_specifier
);
2415 ggc_mark_tree (t
->function_decl
);
2417 ggc_mark_tree_varray (t
->lang_base
);
2418 ggc_mark_tree (t
->lang_name
);
2419 ggc_mark_tree (t
->template_parms
);
2420 ggc_mark_tree (t
->x_previous_class_type
);
2421 ggc_mark_tree (t
->x_previous_class_values
);
2422 ggc_mark_tree (t
->x_saved_tree
);
2423 ggc_mark_tree (t
->incomplete
);
2424 ggc_mark_tree (t
->lookups
);
2426 mark_stmt_tree (&t
->x_stmt_tree
);
2427 mark_binding_level (&t
->bindings
);
2433 store_bindings (names
, old_bindings
)
2434 tree names
, old_bindings
;
2437 tree search_bindings
= old_bindings
;
2439 for (t
= names
; t
; t
= TREE_CHAIN (t
))
2441 tree binding
, t1
, id
;
2443 if (TREE_CODE (t
) == TREE_LIST
)
2444 id
= TREE_PURPOSE (t
);
2449 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2450 we have no IDENTIFIER_BINDING if we have left the class
2451 scope, but cached the class-level declarations. */
2452 || !(IDENTIFIER_BINDING (id
) || IDENTIFIER_CLASS_VALUE (id
)))
2455 for (t1
= search_bindings
; t1
; t1
= TREE_CHAIN (t1
))
2456 if (TREE_VEC_ELT (t1
, 0) == id
)
2459 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
2460 binding
= make_tree_vec (4);
2461 TREE_VEC_ELT (binding
, 0) = id
;
2462 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
2463 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_BINDING (id
);
2464 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
2465 IDENTIFIER_BINDING (id
) = NULL_TREE
;
2466 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
2467 TREE_CHAIN (binding
) = old_bindings
;
2468 old_bindings
= binding
;
2472 return old_bindings
;
2476 maybe_push_to_top_level (pseudo
)
2479 struct saved_scope
*s
;
2480 struct binding_level
*b
;
2484 s
= (struct saved_scope
*) xcalloc (1, sizeof (struct saved_scope
));
2486 b
= scope_chain
? current_binding_level
: 0;
2488 /* If we're in the middle of some function, save our state. */
2492 push_function_context_to (NULL_TREE
);
2497 old_bindings
= NULL_TREE
;
2498 if (scope_chain
&& previous_class_type
)
2499 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
2501 /* Have to include global_binding_level, because class-level decls
2502 aren't listed anywhere useful. */
2503 for (; b
; b
= b
->level_chain
)
2507 /* Template IDs are inserted into the global level. If they were
2508 inserted into namespace level, finish_file wouldn't find them
2509 when doing pending instantiations. Therefore, don't stop at
2510 namespace level, but continue until :: . */
2511 if (b
== global_binding_level
|| (pseudo
&& b
->template_parms_p
))
2514 old_bindings
= store_bindings (b
->names
, old_bindings
);
2515 /* We also need to check class_shadowed to save class-level type
2516 bindings, since pushclass doesn't fill in b->names. */
2517 if (b
->parm_flag
== 2)
2518 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2520 /* Unwind type-value slots back to top level. */
2521 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2522 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2524 s
->prev
= scope_chain
;
2525 s
->old_bindings
= old_bindings
;
2527 s
->need_pop_function_context
= need_pop
;
2528 s
->function_decl
= current_function_decl
;
2531 current_function_decl
= NULL_TREE
;
2532 VARRAY_TREE_INIT (current_lang_base
, 10, "current_lang_base");
2533 current_lang_stack
= &VARRAY_TREE (current_lang_base
, 0);
2534 current_lang_name
= lang_name_cplusplus
;
2535 current_namespace
= global_namespace
;
2539 push_to_top_level ()
2541 maybe_push_to_top_level (0);
2545 pop_from_top_level ()
2547 struct saved_scope
*s
= scope_chain
;
2550 /* Clear out class-level bindings cache. */
2551 if (previous_class_type
)
2552 invalidate_class_lookup_cache ();
2554 VARRAY_FREE (current_lang_base
);
2556 scope_chain
= s
->prev
;
2557 for (t
= s
->old_bindings
; t
; t
= TREE_CHAIN (t
))
2559 tree id
= TREE_VEC_ELT (t
, 0);
2561 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2562 IDENTIFIER_BINDING (id
) = TREE_VEC_ELT (t
, 2);
2563 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2566 /* If we were in the middle of compiling a function, restore our
2568 if (s
->need_pop_function_context
)
2569 pop_function_context_from (NULL_TREE
);
2570 current_function_decl
= s
->function_decl
;
2575 /* Push a definition of struct, union or enum tag "name".
2576 into binding_level "b". "type" should be the type node,
2577 We assume that the tag "name" is not already defined.
2579 Note that the definition may really be just a forward reference.
2580 In that case, the TYPE_SIZE will be a NULL_TREE.
2582 C++ gratuitously puts all these tags in the name space. */
2584 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2585 record the shadowed value for this binding contour. TYPE is
2586 the type that ID maps to. */
2589 set_identifier_type_value_with_scope (id
, type
, b
)
2592 struct binding_level
*b
;
2594 if (!b
->namespace_p
)
2596 /* Shadow the marker, not the real thing, so that the marker
2597 gets restored later. */
2598 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2600 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2604 tree binding
= binding_for_name (id
, current_namespace
);
2605 BINDING_TYPE (binding
) = type
;
2606 /* Store marker instead of real type. */
2607 type
= global_type_node
;
2609 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2612 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2615 set_identifier_type_value (id
, type
)
2619 set_identifier_type_value_with_scope (id
, type
, current_binding_level
);
2622 /* Return the type associated with id. */
2625 identifier_type_value (id
)
2628 /* There is no type with that name, anywhere. */
2629 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2631 /* This is not the type marker, but the real thing. */
2632 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2633 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2634 /* Have to search for it. It must be on the global level, now.
2635 Ask lookup_name not to return non-types. */
2636 id
= lookup_name_real (id
, 2, 1, 0);
2638 return TREE_TYPE (id
);
2642 /* Pop off extraneous binding levels left over due to syntax errors.
2644 We don't pop past namespaces, as they might be valid. */
2649 #ifdef DEBUG_CP_BINDING_LEVELS
2650 fprintf (stderr
, "XXX entering pop_everything ()\n");
2652 while (!toplevel_bindings_p ())
2654 if (current_binding_level
->parm_flag
== 2)
2655 pop_nested_class ();
2659 #ifdef DEBUG_CP_BINDING_LEVELS
2660 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2664 /* The type TYPE is being declared. If it is a class template, or a
2665 specialization of a class template, do any processing required and
2666 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2667 being declared a friend. B is the binding level at which this TYPE
2670 Returns the TYPE_DECL for TYPE, which may have been altered by this
2674 maybe_process_template_type_declaration (type
, globalize
, b
)
2677 struct binding_level
* b
;
2679 tree decl
= TYPE_NAME (type
);
2681 if (processing_template_parmlist
)
2682 /* You can't declare a new template type in a template parameter
2683 list. But, you can declare a non-template type:
2685 template <class A*> struct S;
2687 is a forward-declaration of `A'. */
2691 maybe_check_template_type (type
);
2693 my_friendly_assert (IS_AGGR_TYPE (type
)
2694 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2697 if (processing_template_decl
)
2699 /* This may change after the call to
2700 push_template_decl_real, but we want the original value. */
2701 tree name
= DECL_NAME (decl
);
2703 decl
= push_template_decl_real (decl
, globalize
);
2704 /* If the current binding level is the binding level for the
2705 template parameters (see the comment in
2706 begin_template_parm_list) and the enclosing level is a class
2707 scope, and we're not looking at a friend, push the
2708 declaration of the member class into the class scope. In the
2709 friend case, push_template_decl will already have put the
2710 friend into global scope, if appropriate. */
2711 if (TREE_CODE (type
) != ENUMERAL_TYPE
2712 && !globalize
&& b
->template_parms_p
2713 && b
->level_chain
->parm_flag
== 2)
2715 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2716 /* Put this tag on the list of tags for the class, since
2717 that won't happen below because B is not the class
2718 binding level, but is instead the pseudo-global level. */
2719 b
->level_chain
->tags
=
2720 tree_cons (name
, type
, b
->level_chain
->tags
);
2721 if (!COMPLETE_TYPE_P (current_class_type
))
2722 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2730 /* In C++, you don't have to write `struct S' to refer to `S'; you
2731 can just use `S'. We accomplish this by creating a TYPE_DECL as
2732 if the user had written `typedef struct S S'. Create and return
2733 the TYPE_DECL for TYPE. */
2736 create_implicit_typedef (name
, type
)
2742 decl
= build_decl (TYPE_DECL
, name
, type
);
2743 DECL_ARTIFICIAL (decl
) = 1;
2744 /* There are other implicit type declarations, like the one *within*
2745 a class that allows you to write `S::S'. We must distinguish
2747 SET_DECL_IMPLICIT_TYPEDEF_P (decl
);
2748 TYPE_NAME (type
) = decl
;
2753 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2754 Normally put it into the inner-most non-tag-transparent scope,
2755 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2756 The latter is needed for implicit declarations. */
2759 pushtag (name
, type
, globalize
)
2763 register struct binding_level
*b
;
2765 b
= current_binding_level
;
2766 while (b
->tag_transparent
2767 || (globalize
&& b
->parm_flag
== 2))
2770 b
->tags
= tree_cons (name
, type
, b
->tags
);
2774 /* Do C++ gratuitous typedefing. */
2775 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2777 register tree d
= NULL_TREE
;
2779 tree context
= TYPE_CONTEXT (type
);
2783 tree cs
= current_scope ();
2787 else if (cs
!= NULL_TREE
&& TYPE_P (cs
))
2788 /* When declaring a friend class of a local class, we want
2789 to inject the newly named class into the scope
2790 containing the local class, not the namespace scope. */
2791 context
= decl_function_context (get_type_decl (cs
));
2794 context
= current_namespace
;
2796 if ((b
->template_parms_p
&& b
->level_chain
->parm_flag
== 2)
2797 || b
->parm_flag
== 2)
2800 if (current_lang_name
== lang_name_java
)
2801 TYPE_FOR_JAVA (type
) = 1;
2803 d
= create_implicit_typedef (name
, type
);
2804 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2806 set_identifier_type_value_with_scope (name
, type
, b
);
2808 d
= maybe_process_template_type_declaration (type
,
2811 if (b
->parm_flag
== 2)
2813 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2814 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2815 class. But if it's a member template class, we
2816 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2818 finish_member_declaration (d
);
2820 pushdecl_class_level (d
);
2823 d
= pushdecl_with_scope (d
, b
);
2825 if (ANON_AGGRNAME_P (name
))
2826 DECL_IGNORED_P (d
) = 1;
2828 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2829 DECL_ASSEMBLER_NAME (d
) = DECL_NAME (d
);
2831 /* If this is a local class, keep track of it. We need this
2832 information for name-mangling, and so that it is possible to find
2833 all function definitions in a translation unit in a convenient
2834 way. (It's otherwise tricky to find a member function definition
2835 it's only pointed to from within a local class.) */
2836 if (TYPE_CONTEXT (type
)
2837 && TREE_CODE (TYPE_CONTEXT (type
)) == FUNCTION_DECL
2838 && !processing_template_decl
)
2839 VARRAY_PUSH_TREE (local_classes
, type
);
2841 if (!uses_template_parms (type
))
2842 DECL_ASSEMBLER_NAME (d
) = mangle_type (type
);
2844 if (b
->parm_flag
== 2)
2846 if (!COMPLETE_TYPE_P (current_class_type
))
2847 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2851 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2852 /* Use the canonical TYPE_DECL for this node. */
2853 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2856 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2857 will be the tagged type we just added to the current
2858 binding level. This fake NULL-named TYPE_DECL node helps
2859 dwarfout.c to know when it needs to output a
2860 representation of a tagged type, and it also gives us a
2861 convenient place to record the "scope start" address for
2864 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2865 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2869 /* Counter used to create anonymous type names. */
2871 static int anon_cnt
= 0;
2873 /* Return an IDENTIFIER which can be used as a name for
2874 anonymous structs and unions. */
2881 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2882 return get_identifier (buf
);
2885 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2886 This keeps dbxout from getting confused. */
2891 register struct binding_level
*b
;
2893 static int last_cnt
= 0;
2895 /* Fast out if no new anon names were declared. */
2896 if (last_cnt
== anon_cnt
)
2899 b
= current_binding_level
;
2900 while (b
->tag_transparent
)
2905 /* A NULL purpose means we have already processed all tags
2906 from here to the end of the list. */
2907 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2909 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2910 TREE_PURPOSE (tags
) = NULL_TREE
;
2911 tags
= TREE_CHAIN (tags
);
2913 last_cnt
= anon_cnt
;
2916 /* Subroutine of duplicate_decls: return truthvalue of whether
2917 or not types of these decls match.
2919 For C++, we must compare the parameter list so that `int' can match
2920 `int&' in a parameter position, but `int&' is not confused with
2924 decls_match (newdecl
, olddecl
)
2925 tree newdecl
, olddecl
;
2929 if (newdecl
== olddecl
)
2932 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
2933 /* If the two DECLs are not even the same kind of thing, we're not
2934 interested in their types. */
2937 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2939 tree f1
= TREE_TYPE (newdecl
);
2940 tree f2
= TREE_TYPE (olddecl
);
2941 tree p1
= TYPE_ARG_TYPES (f1
);
2942 tree p2
= TYPE_ARG_TYPES (f2
);
2944 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
)
2945 && ! (DECL_EXTERN_C_P (newdecl
)
2946 && DECL_EXTERN_C_P (olddecl
)))
2949 if (TREE_CODE (f1
) != TREE_CODE (f2
))
2952 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
2954 if (p2
== NULL_TREE
&& DECL_EXTERN_C_P (olddecl
)
2955 && (DECL_BUILT_IN (olddecl
)
2956 #ifndef NO_IMPLICIT_EXTERN_C
2957 || (DECL_IN_SYSTEM_HEADER (newdecl
) && !DECL_CLASS_SCOPE_P (newdecl
))
2958 || (DECL_IN_SYSTEM_HEADER (olddecl
) && !DECL_CLASS_SCOPE_P (olddecl
))
2962 types_match
= self_promoting_args_p (p1
);
2963 if (p1
== void_list_node
)
2964 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2966 #ifndef NO_IMPLICIT_EXTERN_C
2967 else if (p1
== NULL_TREE
2968 && (DECL_EXTERN_C_P (olddecl
)
2969 && DECL_IN_SYSTEM_HEADER (olddecl
)
2970 && !DECL_CLASS_SCOPE_P (olddecl
))
2971 && (DECL_EXTERN_C_P (newdecl
)
2972 && DECL_IN_SYSTEM_HEADER (newdecl
)
2973 && !DECL_CLASS_SCOPE_P (newdecl
)))
2975 types_match
= self_promoting_args_p (p2
);
2976 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2980 types_match
= compparms (p1
, p2
);
2985 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2987 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
2988 DECL_TEMPLATE_PARMS (olddecl
)))
2991 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
))
2992 != TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)))
2995 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
2998 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
2999 DECL_TEMPLATE_RESULT (newdecl
));
3003 if (TREE_TYPE (newdecl
) == error_mark_node
)
3004 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
3005 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
3006 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
3007 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
3010 types_match
= comptypes (TREE_TYPE (newdecl
),
3011 TREE_TYPE (olddecl
),
3012 COMPARE_REDECLARATION
);
3018 /* If NEWDECL is `static' and an `extern' was seen previously,
3019 warn about it. OLDDECL is the previous declaration.
3021 Note that this does not apply to the C++ case of declaring
3022 a variable `extern const' and then later `const'.
3024 Don't complain about built-in functions, since they are beyond
3025 the user's control. */
3028 warn_extern_redeclared_static (newdecl
, olddecl
)
3029 tree newdecl
, olddecl
;
3031 static const char *explicit_extern_static_warning
3032 = "`%D' was declared `extern' and later `static'";
3033 static const char *implicit_extern_static_warning
3034 = "`%D' was declared implicitly `extern' and later `static'";
3038 if (TREE_CODE (newdecl
) == TYPE_DECL
3039 || TREE_CODE (newdecl
) == TEMPLATE_DECL
3040 || TREE_CODE (newdecl
) == CONST_DECL
)
3043 /* Don't get confused by static member functions; that's a different
3045 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3046 && DECL_STATIC_FUNCTION_P (newdecl
))
3049 /* If the old declaration was `static', or the new one isn't, then
3050 then everything is OK. */
3051 if (DECL_THIS_STATIC (olddecl
) || !DECL_THIS_STATIC (newdecl
))
3054 /* It's OK to declare a builtin function as `static'. */
3055 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3056 && DECL_ARTIFICIAL (olddecl
))
3059 name
= DECL_ASSEMBLER_NAME (newdecl
);
3060 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
3061 ? implicit_extern_static_warning
3062 : explicit_extern_static_warning
, newdecl
);
3063 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
3066 /* Handle when a new declaration NEWDECL has the same name as an old
3067 one OLDDECL in the same binding contour. Prints an error message
3070 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
3071 Otherwise, return 0. */
3074 duplicate_decls (newdecl
, olddecl
)
3075 tree newdecl
, olddecl
;
3077 unsigned olddecl_uid
= DECL_UID (olddecl
);
3078 int olddecl_friend
= 0, types_match
= 0;
3079 int new_defines_function
= 0;
3081 if (newdecl
== olddecl
)
3084 types_match
= decls_match (newdecl
, olddecl
);
3086 /* If either the type of the new decl or the type of the old decl is an
3087 error_mark_node, then that implies that we have already issued an
3088 error (earlier) for some bogus type specification, and in that case,
3089 it is rather pointless to harass the user with yet more error message
3090 about the same declaration, so just pretend the types match here. */
3091 if (TREE_TYPE (newdecl
) == error_mark_node
3092 || TREE_TYPE (olddecl
) == error_mark_node
)
3095 /* Check for redeclaration and other discrepancies. */
3096 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3097 && DECL_ARTIFICIAL (olddecl
))
3099 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
3101 /* If you declare a built-in or predefined function name as static,
3102 the old definition is overridden, but optionally warn this was a
3103 bad choice of name. */
3104 if (! TREE_PUBLIC (newdecl
))
3107 cp_warning ("shadowing %s function `%#D'",
3108 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3110 /* Discard the old built-in function. */
3113 /* If the built-in is not ansi, then programs can override
3114 it even globally without an error. */
3115 else if (! DECL_BUILT_IN (olddecl
))
3116 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
3120 cp_error ("declaration of `%#D'", newdecl
);
3121 cp_error ("conflicts with built-in declaration `%#D'",
3126 else if (!types_match
)
3128 if ((DECL_EXTERN_C_P (newdecl
)
3129 && DECL_EXTERN_C_P (olddecl
))
3130 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3131 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3133 /* A near match; override the builtin. */
3135 if (TREE_PUBLIC (newdecl
))
3137 cp_warning ("new declaration `%#D'", newdecl
);
3138 cp_warning ("ambiguates built-in declaration `%#D'",
3141 else if (warn_shadow
)
3142 cp_warning ("shadowing %s function `%#D'",
3143 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3147 /* Discard the old built-in function. */
3151 if (DECL_THIS_STATIC (newdecl
) && !DECL_THIS_STATIC (olddecl
))
3153 /* If a builtin function is redeclared as `static', merge
3154 the declarations, but make the original one static. */
3155 DECL_THIS_STATIC (olddecl
) = 1;
3156 TREE_PUBLIC (olddecl
) = 0;
3158 /* Make the old declaration consistent with the new one so
3159 that all remnants of the builtin-ness of this function
3160 will be banished. */
3161 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3162 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3163 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3164 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (newdecl
),
3168 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3170 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3171 && TREE_CODE (newdecl
) != TYPE_DECL
3172 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3173 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3174 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3175 && TREE_CODE (olddecl
) != TYPE_DECL
3176 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3177 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3180 /* We do nothing special here, because C++ does such nasty
3181 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3182 get shadowed, and know that if we need to find a TYPE_DECL
3183 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3184 slot of the identifier. */
3188 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3189 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3190 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3191 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3194 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
3195 if (TREE_CODE (olddecl
) == TREE_LIST
)
3196 olddecl
= TREE_VALUE (olddecl
);
3197 cp_error_at ("previous declaration of `%#D'", olddecl
);
3199 /* New decl is completely inconsistent with the old one =>
3200 tell caller to replace the old one. */
3204 else if (!types_match
)
3206 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
))
3207 /* These are certainly not duplicate declarations; they're
3208 from different scopes. */
3211 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3213 /* The name of a class template may not be declared to refer to
3214 any other template, class, function, object, namespace, value,
3215 or type in the same scope. */
3216 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3217 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3219 cp_error ("declaration of template `%#D'", newdecl
);
3220 cp_error_at ("conflicts with previous declaration `%#D'",
3223 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3224 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3225 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3226 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3227 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3228 DECL_TEMPLATE_PARMS (olddecl
)))
3230 cp_error ("new declaration `%#D'", newdecl
);
3231 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3235 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3237 if (DECL_EXTERN_C_P (newdecl
) && DECL_EXTERN_C_P (olddecl
))
3239 cp_error ("declaration of C function `%#D' conflicts with",
3241 cp_error_at ("previous declaration `%#D' here", olddecl
);
3243 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3244 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3246 cp_error ("new declaration `%#D'", newdecl
);
3247 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3253 /* Already complained about this, so don't do so again. */
3254 else if (current_class_type
== NULL_TREE
3255 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3257 cp_error ("conflicting types for `%#D'", newdecl
);
3258 cp_error_at ("previous declaration as `%#D'", olddecl
);
3261 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3262 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3263 && (!DECL_TEMPLATE_INFO (newdecl
)
3264 || (DECL_TI_TEMPLATE (newdecl
)
3265 != DECL_TI_TEMPLATE (olddecl
))))
3266 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3267 && (!DECL_TEMPLATE_INFO (olddecl
)
3268 || (DECL_TI_TEMPLATE (olddecl
)
3269 != DECL_TI_TEMPLATE (newdecl
))))))
3270 /* It's OK to have a template specialization and a non-template
3271 with the same type, or to have specializations of two
3272 different templates with the same type. Note that if one is a
3273 specialization, and the other is an instantiation of the same
3274 template, that we do not exit at this point. That situation
3275 can occur if we instantiate a template class, and then
3276 specialize one of its methods. This situation is legal, but
3277 the declarations must be merged in the usual way. */
3279 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3280 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3281 && !DECL_USE_TEMPLATE (newdecl
))
3282 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3283 && !DECL_USE_TEMPLATE (olddecl
))))
3284 /* One of the declarations is a template instantiation, and the
3285 other is not a template at all. That's OK. */
3287 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3288 && DECL_NAMESPACE_ALIAS (newdecl
)
3289 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3290 /* Redeclaration of namespace alias, ignore it. */
3294 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3297 cp_error (errmsg
, newdecl
);
3298 if (DECL_NAME (olddecl
) != NULL_TREE
)
3299 cp_error_at ((DECL_INITIAL (olddecl
)
3300 && namespace_bindings_p ())
3301 ? "`%#D' previously defined here"
3302 : "`%#D' previously declared here", olddecl
);
3304 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3305 && DECL_INITIAL (olddecl
) != NULL_TREE
3306 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3307 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3309 /* Prototype decl follows defn w/o prototype. */
3310 cp_warning_at ("prototype for `%#D'", newdecl
);
3311 cp_warning_at ("follows non-prototype definition here", olddecl
);
3313 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3314 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3316 /* extern "C" int foo ();
3317 int foo () { bar (); }
3319 if (current_lang_stack
3320 == &VARRAY_TREE (current_lang_base
, 0))
3321 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3324 cp_error_at ("previous declaration of `%#D' with %L linkage",
3325 olddecl
, DECL_LANGUAGE (olddecl
));
3326 cp_error ("conflicts with new declaration with %L linkage",
3327 DECL_LANGUAGE (newdecl
));
3331 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3333 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3335 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3336 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3339 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3340 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3342 for (; t1
&& t1
!= void_list_node
;
3343 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3344 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3346 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3351 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3353 cp_pedwarn_at ("after previous specification in `%#D'",
3359 cp_error ("default argument given for parameter %d of `%#D'",
3361 cp_error_at ("after previous specification in `%#D'",
3366 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
3367 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3369 cp_warning ("`%#D' was used before it was declared inline",
3371 cp_warning_at ("previous non-inline declaration here",
3377 /* If new decl is `static' and an `extern' was seen previously,
3379 warn_extern_redeclared_static (newdecl
, olddecl
);
3381 /* We have committed to returning 1 at this point. */
3382 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3384 /* Now that functions must hold information normally held
3385 by field decls, there is extra work to do so that
3386 declaration information does not get destroyed during
3388 if (DECL_VINDEX (olddecl
))
3389 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3390 if (DECL_VIRTUAL_CONTEXT (olddecl
))
3391 DECL_VIRTUAL_CONTEXT (newdecl
) = DECL_VIRTUAL_CONTEXT (olddecl
);
3392 if (DECL_CONTEXT (olddecl
))
3393 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3394 if (DECL_PENDING_INLINE_INFO (newdecl
) == 0)
3395 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3396 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3397 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3398 DECL_PURE_VIRTUAL_P (newdecl
) |= DECL_PURE_VIRTUAL_P (olddecl
);
3399 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3400 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3401 DECL_THIS_STATIC (newdecl
) |= DECL_THIS_STATIC (olddecl
);
3402 if (DECL_OVERLOADED_OPERATOR_P (olddecl
) != ERROR_MARK
)
3403 SET_OVERLOADED_OPERATOR_CODE
3404 (newdecl
, DECL_OVERLOADED_OPERATOR_P (olddecl
));
3405 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3407 /* Optionally warn about more than one declaration for the same
3408 name, but don't warn about a function declaration followed by a
3410 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3411 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3412 /* Don't warn about extern decl followed by definition. */
3413 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3414 /* Don't warn about friends, let add_friend take care of it. */
3415 && ! DECL_FRIEND_P (newdecl
))
3417 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3418 cp_warning_at ("previous declaration of `%D'", olddecl
);
3422 /* Deal with C++: must preserve virtual function table size. */
3423 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3425 register tree newtype
= TREE_TYPE (newdecl
);
3426 register tree oldtype
= TREE_TYPE (olddecl
);
3428 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3429 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3431 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3432 CLASSTYPE_FRIEND_CLASSES (newtype
)
3433 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3436 DECL_ORIGINAL_TYPE (newdecl
) = DECL_ORIGINAL_TYPE (olddecl
);
3439 /* Copy all the DECL_... slots specified in the new decl
3440 except for any that we copy here from the old type. */
3441 DECL_MACHINE_ATTRIBUTES (newdecl
)
3442 = merge_machine_decl_attributes (olddecl
, newdecl
);
3444 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3446 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3447 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3448 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3449 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3456 /* Automatically handles default parameters. */
3457 tree oldtype
= TREE_TYPE (olddecl
);
3460 /* Merge the data types specified in the two decls. */
3461 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3463 /* If common_type produces a non-typedef type, just use the old type. */
3464 if (TREE_CODE (newdecl
) == TYPE_DECL
3465 && newtype
== DECL_ORIGINAL_TYPE (newdecl
))
3468 if (TREE_CODE (newdecl
) == VAR_DECL
)
3469 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3470 /* Do this after calling `common_type' so that default
3471 parameters don't confuse us. */
3472 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3473 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3474 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3476 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3477 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3478 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3479 TYPE_RAISES_EXCEPTIONS (oldtype
));
3481 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3482 && DECL_SOURCE_LINE (olddecl
) != 0
3484 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
3485 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
3487 cp_error ("declaration of `%F' throws different exceptions",
3489 cp_error_at ("than previous declaration `%F'", olddecl
);
3492 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3494 /* Lay the type out, unless already done. */
3495 if (! same_type_p (newtype
, oldtype
)
3496 && TREE_TYPE (newdecl
) != error_mark_node
3497 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3498 layout_type (TREE_TYPE (newdecl
));
3500 if ((TREE_CODE (newdecl
) == VAR_DECL
3501 || TREE_CODE (newdecl
) == PARM_DECL
3502 || TREE_CODE (newdecl
) == RESULT_DECL
3503 || TREE_CODE (newdecl
) == FIELD_DECL
3504 || TREE_CODE (newdecl
) == TYPE_DECL
)
3505 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3506 layout_decl (newdecl
, 0);
3508 /* Merge the type qualifiers. */
3509 if (TREE_READONLY (newdecl
))
3510 TREE_READONLY (olddecl
) = 1;
3511 if (TREE_THIS_VOLATILE (newdecl
))
3512 TREE_THIS_VOLATILE (olddecl
) = 1;
3514 /* Merge the initialization information. */
3515 if (DECL_INITIAL (newdecl
) == NULL_TREE
3516 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3518 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3519 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3520 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3521 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
3522 && DECL_LANG_SPECIFIC (newdecl
)
3523 && DECL_LANG_SPECIFIC (olddecl
))
3524 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3527 /* Merge the section attribute.
3528 We want to issue an error if the sections conflict but that must be
3529 done later in decl_attributes since we are called before attributes
3531 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3532 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3534 /* Keep the old rtl since we can safely use it. */
3535 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3537 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3539 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (newdecl
)
3540 |= DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (olddecl
);
3541 DECL_NO_CHECK_MEMORY_USAGE (newdecl
)
3542 |= DECL_NO_CHECK_MEMORY_USAGE (olddecl
);
3543 DECL_NO_LIMIT_STACK (newdecl
)
3544 |= DECL_NO_LIMIT_STACK (olddecl
);
3547 /* If cannot merge, then use the new type and qualifiers,
3548 and don't preserve the old rtl. */
3551 /* Clean out any memory we had of the old declaration. */
3552 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3554 TREE_VALUE (oldstatic
) = error_mark_node
;
3556 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3557 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3558 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3559 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3562 /* Merge the storage class information. */
3563 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3564 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3565 DECL_DEFER_OUTPUT (newdecl
) |= DECL_DEFER_OUTPUT (olddecl
);
3566 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3567 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3568 if (! DECL_EXTERNAL (olddecl
))
3569 DECL_EXTERNAL (newdecl
) = 0;
3571 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3573 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3574 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3575 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3576 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3577 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3578 /* Don't really know how much of the language-specific
3579 values we should copy from old to new. */
3580 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3581 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3582 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3583 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3584 DECL_INITIALIZED_IN_CLASS_P (newdecl
)
3585 |= DECL_INITIALIZED_IN_CLASS_P (olddecl
);
3586 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3588 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3589 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3590 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3591 DECL_BEFRIENDING_CLASSES (newdecl
)
3592 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3593 DECL_BEFRIENDING_CLASSES (olddecl
));
3596 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3598 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3599 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3601 /* If newdecl is not a specialization, then it is not a
3602 template-related function at all. And that means that we
3603 shoud have exited above, returning 0. */
3604 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3607 if (TREE_USED (olddecl
))
3608 /* From [temp.expl.spec]:
3610 If a template, a member template or the member of a class
3611 template is explicitly specialized then that
3612 specialization shall be declared before the first use of
3613 that specialization that would cause an implicit
3614 instantiation to take place, in every translation unit in
3615 which such a use occurs. */
3616 cp_error ("explicit specialization of %D after first use",
3619 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3621 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3623 /* If either decl says `inline', this fn is inline, unless its
3624 definition was passed already. */
3625 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3626 DECL_INLINE (olddecl
) = 1;
3627 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3631 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3632 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3633 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3635 if (! types_match
|| new_defines_function
)
3637 /* These need to be copied so that the names are available.
3638 Note that if the types do match, we'll preserve inline
3639 info and other bits, but if not, we won't. */
3640 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3641 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3643 if (new_defines_function
)
3644 /* If defining a function declared with other language
3645 linkage, use the previously declared language linkage. */
3646 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3647 else if (types_match
)
3649 /* If redeclaring a builtin function, and not a definition,
3650 it stays built in. */
3651 if (DECL_BUILT_IN (olddecl
))
3653 DECL_BUILT_IN_CLASS (newdecl
) = DECL_BUILT_IN_CLASS (olddecl
);
3654 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3655 /* If we're keeping the built-in definition, keep the rtl,
3656 regardless of declaration matches. */
3657 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3660 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3662 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3663 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3664 /* Previously saved insns go together with
3665 the function's previous definition. */
3666 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3667 /* Don't clear out the arguments if we're redefining a function. */
3668 if (DECL_ARGUMENTS (olddecl
))
3669 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3673 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3675 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3678 /* Now preserve various other info from the definition. */
3679 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3680 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3681 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3682 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3684 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3688 function_size
= sizeof (struct tree_decl
);
3690 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3691 (char *) olddecl
+ sizeof (struct tree_common
),
3692 function_size
- sizeof (struct tree_common
));
3694 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3696 /* If newdecl is a template instantiation, it is possible that
3697 the following sequence of events has occurred:
3699 o A friend function was declared in a class template. The
3700 class template was instantiated.
3702 o The instantiation of the friend declaration was
3703 recorded on the instantiation list, and is newdecl.
3705 o Later, however, instantiate_class_template called pushdecl
3706 on the newdecl to perform name injection. But, pushdecl in
3707 turn called duplicate_decls when it discovered that another
3708 declaration of a global function with the same name already
3711 o Here, in duplicate_decls, we decided to clobber newdecl.
3713 If we're going to do that, we'd better make sure that
3714 olddecl, and not newdecl, is on the list of
3715 instantiations so that if we try to do the instantiation
3716 again we won't get the clobbered declaration. */
3718 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3719 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3721 for (; decls
; decls
= TREE_CHAIN (decls
))
3722 if (TREE_VALUE (decls
) == newdecl
)
3723 TREE_VALUE (decls
) = olddecl
;
3728 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3729 (char *) olddecl
+ sizeof (struct tree_common
),
3730 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3731 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3734 DECL_UID (olddecl
) = olddecl_uid
;
3736 DECL_FRIEND_P (olddecl
) = 1;
3738 /* NEWDECL contains the merged attribute lists.
3739 Update OLDDECL to be the same. */
3740 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3745 /* Record a decl-node X as belonging to the current lexical scope.
3746 Check for errors (such as an incompatible declaration for the same
3747 name already seen in the same scope).
3749 Returns either X or an old decl for the same name.
3750 If an old decl is returned, it may have been smashed
3751 to agree with what X says. */
3759 int need_new_binding
;
3761 /* We shouldn't be calling pushdecl when we're generating RTL for a
3762 function that we already did semantic analysis on previously. */
3763 my_friendly_assert (!cfun
|| doing_semantic_analysis_p (),
3766 need_new_binding
= 1;
3768 if (DECL_TEMPLATE_PARM_P (x
))
3769 /* Template parameters have no context; they are not X::T even
3770 when declared within a class or namespace. */
3774 if (current_function_decl
&& x
!= current_function_decl
3775 /* A local declaration for a function doesn't constitute
3777 && !(TREE_CODE (x
) == FUNCTION_DECL
&& !DECL_INITIAL (x
))
3778 /* A local declaration for an `extern' variable is in the
3779 scope of the current namespace, not the current
3781 && !(TREE_CODE (x
) == VAR_DECL
&& DECL_EXTERNAL (x
))
3782 && !DECL_CONTEXT (x
))
3783 DECL_CONTEXT (x
) = current_function_decl
;
3785 /* If this is the declaration for a namespace-scope function,
3786 but the declaration itself is in a local scope, mark the
3788 if (TREE_CODE (x
) == FUNCTION_DECL
3789 && DECL_NAMESPACE_SCOPE_P (x
)
3790 && current_function_decl
3791 && x
!= current_function_decl
)
3792 DECL_LOCAL_FUNCTION_P (x
) = 1;
3795 name
= DECL_NAME (x
);
3798 int different_binding_level
= 0;
3800 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3801 name
= TREE_OPERAND (name
, 0);
3803 /* In case this decl was explicitly namespace-qualified, look it
3804 up in its namespace context. */
3805 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
)
3806 && namespace_bindings_p ())
3807 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3809 t
= lookup_name_current_level (name
);
3811 /* [basic.link] If there is a visible declaration of an entity
3812 with linkage having the same name and type, ignoring entities
3813 declared outside the innermost enclosing namespace scope, the
3814 block scope declaration declares that same entity and
3815 receives the linkage of the previous declaration. */
3816 if (! t
&& current_function_decl
&& x
!= current_function_decl
3817 && (TREE_CODE (x
) == FUNCTION_DECL
|| TREE_CODE (x
) == VAR_DECL
)
3818 && DECL_EXTERNAL (x
))
3820 /* Look in block scope. */
3821 t
= IDENTIFIER_VALUE (name
);
3822 /* Or in the innermost namespace. */
3824 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3825 /* Does it have linkage? Note that if this isn't a DECL, it's an
3826 OVERLOAD, which is OK. */
3827 if (t
&& DECL_P (t
) && ! (TREE_STATIC (t
) || DECL_EXTERNAL (t
)))
3830 different_binding_level
= 1;
3833 /* If we are declaring a function, and the result of name-lookup
3834 was an OVERLOAD, look for an overloaded instance that is
3835 actually the same as the function we are declaring. (If
3836 there is one, we have to merge our declaration with the
3837 previous declaration.) */
3838 if (t
&& TREE_CODE (t
) == OVERLOAD
)
3842 if (TREE_CODE (x
) == FUNCTION_DECL
)
3843 for (match
= t
; match
; match
= OVL_NEXT (match
))
3845 if (DECL_ASSEMBLER_NAME (OVL_CURRENT (t
))
3846 == DECL_ASSEMBLER_NAME (x
))
3850 /* Just choose one. */
3854 t
= OVL_CURRENT (match
);
3859 if (t
== error_mark_node
)
3861 /* error_mark_node is 0 for a while during initialization! */
3863 cp_error_at ("`%#D' used prior to declaration", x
);
3865 else if (t
!= NULL_TREE
)
3867 if (different_binding_level
)
3869 if (decls_match (x
, t
))
3870 /* The standard only says that the local extern
3871 inherits linkage from the previous decl; in
3872 particular, default args are not shared. It would
3873 be nice to propagate inlining info, though. FIXME. */
3874 TREE_PUBLIC (x
) = TREE_PUBLIC (t
);
3876 else if (TREE_CODE (t
) == PARM_DECL
)
3878 if (DECL_CONTEXT (t
) == NULL_TREE
)
3879 /* This is probaby caused by too many errors, but calling
3880 abort will say that if errors have occurred. */
3883 /* Check for duplicate params. */
3884 if (duplicate_decls (x
, t
))
3887 else if ((DECL_EXTERN_C_FUNCTION_P (x
)
3888 || DECL_FUNCTION_TEMPLATE_P (x
))
3889 && is_overloaded_fn (t
))
3890 /* Don't do anything just yet. */;
3891 else if (t
== wchar_decl_node
)
3893 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3894 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3896 /* Throw away the redeclaration. */
3899 else if (TREE_CODE (t
) != TREE_CODE (x
))
3901 if (duplicate_decls (x
, t
))
3904 else if (duplicate_decls (x
, t
))
3906 if (TREE_CODE (t
) == TYPE_DECL
)
3907 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3908 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3909 check_default_args (t
);
3913 else if (DECL_MAIN_P (x
))
3915 /* A redeclaration of main, but not a duplicate of the
3920 This function shall not be overloaded. */
3921 cp_error_at ("invalid redeclaration of `%D'", t
);
3922 cp_error ("as `%D'", x
);
3923 /* We don't try to push this declaration since that
3929 check_template_shadow (x
);
3931 /* If this is a function conjured up by the backend, massage it
3932 so it looks friendly. */
3933 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_LANG_SPECIFIC (x
))
3935 retrofit_lang_decl (x
);
3936 DECL_LANGUAGE (x
) = lang_c
;
3939 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_FUNCTION_MEMBER_P (x
))
3941 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
3944 if (!namespace_bindings_p ())
3945 /* We do not need to create a binding for this name;
3946 push_overloaded_decl will have already done so if
3948 need_new_binding
= 0;
3950 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3952 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
3954 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
3958 /* If declaring a type as a typedef, copy the type (unless we're
3959 at line 0), and install this TYPE_DECL as the new type's typedef
3960 name. See the extensive comment in ../c-decl.c (pushdecl). */
3961 if (TREE_CODE (x
) == TYPE_DECL
)
3963 tree type
= TREE_TYPE (x
);
3964 if (DECL_SOURCE_LINE (x
) == 0)
3966 if (TYPE_NAME (type
) == 0)
3967 TYPE_NAME (type
) = x
;
3969 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
3970 /* We don't want to copy the type when all we're
3971 doing is making a TYPE_DECL for the purposes of
3973 && (!TYPE_NAME (type
)
3974 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
3976 DECL_ORIGINAL_TYPE (x
) = type
;
3977 type
= build_type_copy (type
);
3978 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
3979 TYPE_NAME (type
) = x
;
3980 TREE_TYPE (x
) = type
;
3983 if (type
!= error_mark_node
3985 && TYPE_IDENTIFIER (type
))
3986 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
3987 current_binding_level
);
3991 /* Multiple external decls of the same identifier ought to match.
3993 We get warnings about inline functions where they are defined.
3994 We get warnings about other functions from push_overloaded_decl.
3996 Avoid duplicate warnings where they are used. */
3997 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
4001 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
4002 if (decl
&& TREE_CODE (decl
) == OVERLOAD
)
4003 decl
= OVL_FUNCTION (decl
);
4005 if (decl
&& decl
!= error_mark_node
4006 && (DECL_EXTERNAL (decl
) || TREE_PUBLIC (decl
))
4007 /* If different sort of thing, we already gave an error. */
4008 && TREE_CODE (decl
) == TREE_CODE (x
)
4009 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
4011 cp_pedwarn ("type mismatch with previous external decl", x
);
4012 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
4016 /* This name is new in its binding level.
4017 Install the new declaration and return it. */
4018 if (namespace_bindings_p ())
4020 /* Install a global value. */
4022 /* If the first global decl has external linkage,
4023 warn if we later see static one. */
4024 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
4025 TREE_PUBLIC (name
) = 1;
4027 /* Bind the mangled name for the entity. In the future, we
4028 should not need to do this; mangled names are an
4029 implementation detail of which the front-end should not
4030 need to be aware. */
4031 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
4033 /* For an ordinary function, we create a binding from
4034 the mangled name (i.e., NAME) to the DECL. But, for
4035 an `extern "C"' function, the mangled name and the
4036 ordinary name are the same so we need not do this. */
4037 && !DECL_EXTERN_C_FUNCTION_P (x
))
4041 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
4042 || TREE_CODE (x
) == NAMESPACE_DECL
)
4043 mangled_name
= name
;
4045 mangled_name
= DECL_ASSEMBLER_NAME (x
);
4047 if (TREE_CODE (x
) == FUNCTION_DECL
)
4049 ((IDENTIFIER_GLOBAL_VALUE (mangled_name
) == NULL_TREE
)
4050 || (IDENTIFIER_GLOBAL_VALUE (mangled_name
) == x
), 378);
4051 SET_IDENTIFIER_NAMESPACE_VALUE (mangled_name
, x
);
4054 /* Don't forget if the function was used via an implicit decl. */
4055 if (IDENTIFIER_IMPLICIT_DECL (name
)
4056 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
4059 /* Don't forget if its address was taken in that way. */
4060 if (IDENTIFIER_IMPLICIT_DECL (name
)
4061 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
4062 TREE_ADDRESSABLE (x
) = 1;
4064 /* Warn about mismatches against previous implicit decl. */
4065 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
4066 /* If this real decl matches the implicit, don't complain. */
4067 && ! (TREE_CODE (x
) == FUNCTION_DECL
4068 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
4070 ("`%D' was previously implicitly declared to return `int'", x
);
4072 /* If new decl is `static' and an `extern' was seen previously,
4074 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
4075 warn_extern_redeclared_static (x
, t
);
4079 /* Here to install a non-global value. */
4080 tree oldlocal
= IDENTIFIER_VALUE (name
);
4081 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
4083 if (need_new_binding
)
4085 push_local_binding (name
, x
, 0);
4086 /* Because push_local_binding will hook X on to the
4087 current_binding_level's name list, we don't want to
4088 do that again below. */
4089 need_new_binding
= 0;
4092 /* If this is a TYPE_DECL, push it into the type value slot. */
4093 if (TREE_CODE (x
) == TYPE_DECL
)
4094 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
4095 current_binding_level
);
4097 /* Clear out any TYPE_DECL shadowed by a namespace so that
4098 we won't think this is a type. The C struct hack doesn't
4099 go through namespaces. */
4100 if (TREE_CODE (x
) == NAMESPACE_DECL
)
4101 set_identifier_type_value_with_scope (name
, NULL_TREE
,
4102 current_binding_level
);
4109 && TREE_CODE (oldlocal
) == VAR_DECL
4110 && DECL_DEAD_FOR_LOCAL (oldlocal
))
4111 oldlocal
= DECL_SHADOWED_FOR_VAR (oldlocal
);
4113 if (oldlocal
== NULL_TREE
)
4114 oldlocal
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (d
));
4117 /* If this is an extern function declaration, see if we
4118 have a global definition or declaration for the function. */
4119 if (oldlocal
== NULL_TREE
4120 && DECL_EXTERNAL (x
)
4121 && oldglobal
!= NULL_TREE
4122 && TREE_CODE (x
) == FUNCTION_DECL
4123 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
4125 /* We have one. Their types must agree. */
4126 if (decls_match (x
, oldglobal
))
4130 cp_warning ("extern declaration of `%#D' doesn't match", x
);
4131 cp_warning_at ("global declaration `%#D'", oldglobal
);
4134 /* If we have a local external declaration,
4135 and no file-scope declaration has yet been seen,
4136 then if we later have a file-scope decl it must not be static. */
4137 if (oldlocal
== NULL_TREE
4138 && oldglobal
== NULL_TREE
4139 && DECL_EXTERNAL (x
)
4141 TREE_PUBLIC (name
) = 1;
4143 /* Warn if shadowing an argument at the top level of the body. */
4144 if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
4145 /* Inline decls shadow nothing. */
4146 && !DECL_FROM_INLINE (x
)
4147 && TREE_CODE (oldlocal
) == PARM_DECL
4148 /* Don't complain if it's from an enclosing function. */
4149 && DECL_CONTEXT (oldlocal
) == current_function_decl
4150 && TREE_CODE (x
) != PARM_DECL
)
4152 /* Go to where the parms should be and see if we
4154 struct binding_level
*b
= current_binding_level
->level_chain
;
4160 if (b
->parm_flag
== 1)
4161 cp_error ("declaration of `%#D' shadows a parameter", name
);
4164 /* Maybe warn if shadowing something else. */
4165 if (warn_shadow
&& !DECL_EXTERNAL (x
)
4166 /* Inline decls shadow nothing. */
4167 && !DECL_FROM_INLINE (x
)
4168 /* No shadow warnings for internally generated vars. */
4169 && ! DECL_ARTIFICIAL (x
)
4170 /* No shadow warnings for vars made for inlining. */
4171 && ! DECL_FROM_INLINE (x
))
4173 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
4174 warning ("declaration of `%s' shadows a parameter",
4175 IDENTIFIER_POINTER (name
));
4176 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
4177 && current_class_ptr
4178 && !TREE_STATIC (name
))
4179 warning ("declaration of `%s' shadows a member of `this'",
4180 IDENTIFIER_POINTER (name
));
4181 else if (oldlocal
!= NULL_TREE
)
4182 warning ("declaration of `%s' shadows previous local",
4183 IDENTIFIER_POINTER (name
));
4184 else if (oldglobal
!= NULL_TREE
)
4185 /* XXX shadow warnings in outer-more namespaces */
4186 warning ("declaration of `%s' shadows global declaration",
4187 IDENTIFIER_POINTER (name
));
4191 if (TREE_CODE (x
) == FUNCTION_DECL
)
4192 check_default_args (x
);
4194 /* Keep count of variables in this level with incomplete type. */
4195 if (TREE_CODE (x
) == VAR_DECL
4196 && TREE_TYPE (x
) != error_mark_node
4197 && ((!COMPLETE_TYPE_P (TREE_TYPE (x
))
4198 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
4199 /* RTTI TD entries are created while defining the type_info. */
4200 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
4201 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
4203 if (namespace_bindings_p ())
4204 namespace_scope_incomplete
4205 = tree_cons (NULL_TREE
, x
, namespace_scope_incomplete
);
4207 current_binding_level
->incomplete
4208 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4212 if (need_new_binding
)
4213 add_decl_to_level (x
,
4214 DECL_NAMESPACE_SCOPE_P (x
)
4215 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x
))
4216 : current_binding_level
);
4221 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4222 caller to set DECL_CONTEXT properly. */
4225 pushdecl_with_scope (x
, level
)
4227 struct binding_level
*level
;
4229 register struct binding_level
*b
;
4230 tree function_decl
= current_function_decl
;
4232 current_function_decl
= NULL_TREE
;
4233 if (level
->parm_flag
== 2)
4235 b
= class_binding_level
;
4236 class_binding_level
= level
;
4237 pushdecl_class_level (x
);
4238 class_binding_level
= b
;
4242 b
= current_binding_level
;
4243 current_binding_level
= level
;
4245 current_binding_level
= b
;
4247 current_function_decl
= function_decl
;
4251 /* Like pushdecl, only it places X in the current namespace,
4255 pushdecl_namespace_level (x
)
4258 register struct binding_level
*b
= current_binding_level
;
4261 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4263 /* Now, the type_shadowed stack may screw us. Munge it so it does
4265 if (TREE_CODE (x
) == TYPE_DECL
)
4267 tree name
= DECL_NAME (x
);
4269 tree
*ptr
= (tree
*)0;
4270 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4272 tree shadowed
= b
->type_shadowed
;
4273 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4274 if (TREE_PURPOSE (shadowed
) == name
)
4276 ptr
= &TREE_VALUE (shadowed
);
4277 /* Can't break out of the loop here because sometimes
4278 a binding level will have duplicate bindings for
4279 PT names. It's gross, but I haven't time to fix it. */
4282 newval
= TREE_TYPE (x
);
4283 if (ptr
== (tree
*)0)
4285 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4286 up here if this is changed to an assertion. --KR */
4287 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4297 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4301 pushdecl_top_level (x
)
4304 push_to_top_level ();
4305 x
= pushdecl_namespace_level (x
);
4306 pop_from_top_level ();
4310 /* Make the declaration of X appear in CLASS scope. */
4313 pushdecl_class_level (x
)
4316 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4317 scope looks for the pre-mangled name. */
4320 if (TREE_CODE (x
) == OVERLOAD
)
4321 x
= OVL_CURRENT (x
);
4322 name
= DECL_NAME (x
);
4326 push_class_level_binding (name
, x
);
4327 if (TREE_CODE (x
) == TYPE_DECL
)
4328 set_identifier_type_value (name
, TREE_TYPE (x
));
4330 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4334 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4337 pushdecl_class_level (f
);
4341 /* Enter DECL into the symbol table, if that's appropriate. Returns
4342 DECL, or a modified version thereof. */
4345 maybe_push_decl (decl
)
4348 tree type
= TREE_TYPE (decl
);
4350 /* Add this decl to the current binding level, but not if it comes
4351 from another scope, e.g. a static member variable. TEM may equal
4352 DECL or it may be a previous decl of the same name. */
4353 if (decl
== error_mark_node
4354 || (TREE_CODE (decl
) != PARM_DECL
4355 && DECL_CONTEXT (decl
) != NULL_TREE
4356 /* Definitions of namespace members outside their namespace are
4358 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4359 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4360 || TREE_CODE (type
) == UNKNOWN_TYPE
4361 /* The declaration of a template specialization does not affect
4362 the functions available for overload resolution, so we do not
4364 || (TREE_CODE (decl
) == FUNCTION_DECL
4365 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4368 return pushdecl (decl
);
4371 /* Make the declaration(s) of X appear in CLASS scope
4372 under the name NAME. */
4375 push_class_level_binding (name
, x
)
4380 /* The class_binding_level will be NULL if x is a template
4381 parameter name in a member template. */
4382 if (!class_binding_level
)
4385 /* Make sure that this new member does not have the same name
4386 as a template parameter. */
4387 if (TYPE_BEING_DEFINED (current_class_type
))
4388 check_template_shadow (x
);
4390 /* If this declaration shadows a declaration from an enclosing
4391 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4392 we leave this class. Record the shadowed declaration here. */
4393 binding
= IDENTIFIER_BINDING (name
);
4395 && ((TREE_CODE (x
) == OVERLOAD
4396 && BINDING_VALUE (binding
)
4397 && is_overloaded_fn (BINDING_VALUE (binding
)))
4398 || INHERITED_VALUE_BINDING_P (binding
)))
4403 /* If the old binding was from a base class, and was for a tag
4404 name, slide it over to make room for the new binding. The
4405 old binding is still visible if explicitly qualified with a
4407 if (INHERITED_VALUE_BINDING_P (binding
)
4408 && BINDING_VALUE (binding
)
4409 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4410 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4411 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4413 old_decl
= BINDING_TYPE (binding
);
4414 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4415 BINDING_VALUE (binding
) = NULL_TREE
;
4416 INHERITED_VALUE_BINDING_P (binding
) = 0;
4419 old_decl
= BINDING_VALUE (binding
);
4421 /* Find the previous binding of name on the class-shadowed
4422 list, and update it. */
4423 for (shadow
= class_binding_level
->class_shadowed
;
4425 shadow
= TREE_CHAIN (shadow
))
4426 if (TREE_PURPOSE (shadow
) == name
4427 && TREE_TYPE (shadow
) == old_decl
)
4429 BINDING_VALUE (binding
) = x
;
4430 INHERITED_VALUE_BINDING_P (binding
) = 0;
4431 TREE_TYPE (shadow
) = x
;
4432 IDENTIFIER_CLASS_VALUE (name
) = x
;
4437 /* If we didn't replace an existing binding, put the binding on the
4438 stack of bindings for the identifier, and update the shadowed list. */
4439 if (push_class_binding (name
, x
))
4441 class_binding_level
->class_shadowed
4442 = tree_cons (name
, NULL
,
4443 class_binding_level
->class_shadowed
);
4444 /* Record the value we are binding NAME to so that we can know
4445 what to pop later. */
4446 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4450 /* Insert another USING_DECL into the current binding level, returning
4451 this declaration. If this is a redeclaration, do nothing, and
4452 return NULL_TREE if this not in namespace scope (in namespace
4453 scope, a using decl might extend any previous bindings). */
4456 push_using_decl (scope
, name
)
4462 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4463 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4464 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4465 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4468 return namespace_bindings_p () ? decl
: NULL_TREE
;
4469 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4470 DECL_INITIAL (decl
) = scope
;
4471 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4472 current_binding_level
->usings
= decl
;
4476 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4477 changed (i.e. there was already a directive), or the fresh
4478 TREE_LIST otherwise. */
4481 push_using_directive (used
)
4484 tree ud
= current_binding_level
->using_directives
;
4485 tree iter
, ancestor
;
4487 /* Check if we already have this. */
4488 if (purpose_member (used
, ud
) != NULL_TREE
)
4491 /* Recursively add all namespaces used. */
4492 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4493 push_using_directive (TREE_PURPOSE (iter
));
4495 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4496 ud
= current_binding_level
->using_directives
;
4497 ud
= tree_cons (used
, ancestor
, ud
);
4498 current_binding_level
->using_directives
= ud
;
4502 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4503 other definitions already in place. We get around this by making
4504 the value of the identifier point to a list of all the things that
4505 want to be referenced by that name. It is then up to the users of
4506 that name to decide what to do with that list.
4508 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its
4509 DECL_TEMPLATE_RESULT. It is dealt with the same way.
4511 FLAGS is a bitwise-or of the following values:
4512 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4514 PUSH_USING: DECL is being pushed as the result of a using
4517 The value returned may be a previous declaration if we guessed wrong
4518 about what language DECL should belong to (C or C++). Otherwise,
4519 it's always DECL (and never something that's not a _DECL). */
4522 push_overloaded_decl (decl
, flags
)
4526 tree name
= DECL_NAME (decl
);
4529 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4532 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4534 old
= lookup_name_current_level (name
);
4538 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4540 tree t
= TREE_TYPE (old
);
4541 if (IS_AGGR_TYPE (t
) && warn_shadow
4542 && (! DECL_IN_SYSTEM_HEADER (decl
)
4543 || ! DECL_IN_SYSTEM_HEADER (old
)))
4544 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4547 else if (is_overloaded_fn (old
))
4551 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4553 tree fn
= OVL_CURRENT (tmp
);
4555 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4556 && !(flags
& PUSH_USING
)
4557 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4558 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4559 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4562 if (duplicate_decls (decl
, fn
))
4566 else if (old
== error_mark_node
)
4567 /* Ignore the undefined symbol marker. */
4571 cp_error_at ("previous non-function declaration `%#D'", old
);
4572 cp_error ("conflicts with function declaration `%#D'", decl
);
4577 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4579 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4580 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4582 new_binding
= ovl_cons (decl
, old
);
4583 if (flags
& PUSH_USING
)
4584 OVL_USED (new_binding
) = 1;
4587 /* NAME is not ambiguous. */
4591 set_namespace_binding (name
, current_namespace
, new_binding
);
4594 /* We only create an OVERLOAD if there was a previous binding at
4595 this level, or if decl is a template. In the former case, we
4596 need to remove the old binding and replace it with the new
4597 binding. We must also run through the NAMES on the binding
4598 level where the name was bound to update the chain. */
4600 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4604 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4606 d
= &TREE_CHAIN (*d
))
4608 || (TREE_CODE (*d
) == TREE_LIST
4609 && TREE_VALUE (*d
) == old
))
4611 if (TREE_CODE (*d
) == TREE_LIST
)
4612 /* Just replace the old binding with the new. */
4613 TREE_VALUE (*d
) = new_binding
;
4615 /* Build a TREE_LIST to wrap the OVERLOAD. */
4616 *d
= tree_cons (NULL_TREE
, new_binding
,
4619 /* And update the CPLUS_BINDING node. */
4620 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4625 /* We should always find a previous binding in this case. */
4626 my_friendly_abort (0);
4629 /* Install the new binding. */
4630 push_local_binding (name
, new_binding
, flags
);
4636 /* Generate an implicit declaration for identifier FUNCTIONID
4637 as a function of type int (). Print a warning if appropriate. */
4640 implicitly_declare (functionid
)
4645 /* We used to reuse an old implicit decl here,
4646 but this loses with inline functions because it can clobber
4647 the saved decl chains. */
4648 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4650 DECL_EXTERNAL (decl
) = 1;
4651 TREE_PUBLIC (decl
) = 1;
4653 /* ISO standard says implicit declarations are in the innermost block.
4654 So we record the decl in the standard fashion. */
4656 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4659 /* Only one warning per identifier. */
4660 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4662 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4665 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4670 /* Return zero if the declaration NEWDECL is valid
4671 when the declaration OLDDECL (assumed to be for the same name)
4672 has already been seen.
4673 Otherwise return an error message format string with a %s
4674 where the identifier should go. */
4677 redeclaration_error_message (newdecl
, olddecl
)
4678 tree newdecl
, olddecl
;
4680 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4682 /* Because C++ can put things into name space for free,
4683 constructs like "typedef struct foo { ... } foo"
4684 would look like an erroneous redeclaration. */
4685 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4688 return "redefinition of `%#D'";
4690 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4692 /* If this is a pure function, its olddecl will actually be
4693 the original initialization to `0' (which we force to call
4694 abort()). Don't complain about redefinition in this case. */
4695 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_PURE_VIRTUAL_P (olddecl
))
4698 /* If both functions come from different namespaces, this is not
4699 a redeclaration - this is a conflict with a used function. */
4700 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4701 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4702 return "`%D' conflicts with used function";
4704 /* We'll complain about linkage mismatches in
4705 warn_extern_redeclared_static. */
4707 /* Defining the same name twice is no good. */
4708 if (DECL_INITIAL (olddecl
) != NULL_TREE
4709 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4711 if (DECL_NAME (olddecl
) == NULL_TREE
)
4712 return "`%#D' not declared in class";
4714 return "redefinition of `%#D'";
4718 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4720 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4721 && (DECL_TEMPLATE_RESULT (newdecl
)
4722 != DECL_TEMPLATE_RESULT (olddecl
))
4723 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4724 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4725 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4726 && COMPLETE_TYPE_P (TREE_TYPE (newdecl
))
4727 && COMPLETE_TYPE_P (TREE_TYPE (olddecl
))))
4728 return "redefinition of `%#D'";
4731 else if (toplevel_bindings_p () || DECL_NAMESPACE_SCOPE_P (newdecl
))
4733 /* Objects declared at top level: */
4734 /* If at least one is a reference, it's ok. */
4735 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4737 /* Reject two definitions. */
4738 return "redefinition of `%#D'";
4742 /* Objects declared with block scope: */
4743 /* Reject two definitions, and reject a definition
4744 together with an external reference. */
4745 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4746 return "redeclaration of `%#D'";
4751 /* Create a new label, named ID. */
4754 make_label_decl (id
, local_p
)
4760 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4762 /* Make sure every label has an rtx. */
4765 DECL_CONTEXT (decl
) = current_function_decl
;
4766 DECL_MODE (decl
) = VOIDmode
;
4767 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
4769 /* Say where one reference is to the label, for the sake of the
4770 error if it is not defined. */
4771 DECL_SOURCE_LINE (decl
) = lineno
;
4772 DECL_SOURCE_FILE (decl
) = input_filename
;
4774 /* Record the fact that this identifier is bound to this label. */
4775 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4780 /* Record this label on the list of used labels so that we can check
4781 at the end of the function to see whether or not the label was
4782 actually defined, and so we can check when the label is defined whether
4783 this use is valid. */
4789 if (named_label_uses
== NULL
4790 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4791 || named_label_uses
->label_decl
!= decl
)
4793 struct named_label_use_list
*new_ent
;
4794 new_ent
= ((struct named_label_use_list
*)
4795 ggc_alloc (sizeof (struct named_label_use_list
)));
4796 new_ent
->label_decl
= decl
;
4797 new_ent
->names_in_scope
= current_binding_level
->names
;
4798 new_ent
->binding_level
= current_binding_level
;
4799 new_ent
->lineno_o_goto
= lineno
;
4800 new_ent
->filename_o_goto
= input_filename
;
4801 new_ent
->next
= named_label_uses
;
4802 named_label_uses
= new_ent
;
4806 /* Look for a label named ID in the current function. If one cannot
4807 be found, create one. (We keep track of used, but undefined,
4808 labels, and complain about them at the end of a function.) */
4815 struct named_label_list
*ent
;
4817 /* You can't use labels at global scope. */
4818 if (current_function_decl
== NULL_TREE
)
4820 error ("label `%s' referenced outside of any function",
4821 IDENTIFIER_POINTER (id
));
4825 /* See if we've already got this label. */
4826 decl
= IDENTIFIER_LABEL_VALUE (id
);
4827 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
4830 /* Record this label on the list of labels used in this function.
4831 We do this before calling make_label_decl so that we get the
4832 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4833 ent
= ((struct named_label_list
*)
4834 ggc_alloc_cleared (sizeof (struct named_label_list
)));
4835 ent
->old_value
= IDENTIFIER_LABEL_VALUE (id
);
4836 ent
->next
= named_labels
;
4839 /* We need a new label. */
4840 decl
= make_label_decl (id
, /*local_p=*/0);
4842 /* Now fill in the information we didn't have before. */
4843 ent
->label_decl
= decl
;
4848 /* Declare a local label named ID. */
4851 declare_local_label (id
)
4856 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4857 this scope we can restore the old value of
4858 IDENTIFIER_TYPE_VALUE. */
4859 current_binding_level
->shadowed_labels
4860 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4861 current_binding_level
->shadowed_labels
);
4862 /* Look for the label. */
4863 decl
= make_label_decl (id
, /*local_p=*/1);
4864 /* Now fill in the information we didn't have before. */
4865 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
4870 /* Returns nonzero if it is ill-formed to jump past the declaration of
4871 DECL. Returns 2 if it's also a real problem. */
4874 decl_jump_unsafe (decl
)
4877 if (TREE_CODE (decl
) != VAR_DECL
|| TREE_STATIC (decl
))
4880 if (DECL_INITIAL (decl
) == NULL_TREE
4881 && pod_type_p (TREE_TYPE (decl
)))
4884 /* This is really only important if we're crossing an initialization.
4885 The POD stuff is just pedantry; why should it matter if the class
4886 contains a field of pointer to member type? */
4887 if (DECL_INITIAL (decl
)
4888 || (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))))
4893 /* Check that a single previously seen jump to a newly defined label
4894 is OK. DECL is the LABEL_DECL or 0; LEVEL is the binding_level for
4895 the jump context; NAMES are the names in scope in LEVEL at the jump
4896 context; FILE and LINE are the source position of the jump or 0. */
4899 check_previous_goto_1 (decl
, level
, names
, file
, line
)
4901 struct binding_level
*level
;
4908 struct binding_level
*b
= current_binding_level
;
4909 for (; b
; b
= b
->level_chain
)
4911 tree new_decls
= b
->names
;
4912 tree old_decls
= (b
== level
? names
: NULL_TREE
);
4913 for (; new_decls
!= old_decls
;
4914 new_decls
= TREE_CHAIN (new_decls
))
4916 int problem
= decl_jump_unsafe (new_decls
);
4923 cp_pedwarn ("jump to label `%D'", decl
);
4925 pedwarn ("jump to case label");
4928 pedwarn_with_file_and_line (file
, line
, " from here");
4932 if (problem
> 1 && DECL_ARTIFICIAL (new_decls
))
4933 /* Can't skip init of __exception_info. */
4934 cp_error_at (" enters catch block", new_decls
);
4935 else if (problem
> 1)
4936 cp_error_at (" crosses initialization of `%#D'",
4939 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4945 if (b
->eh_region
&& ! saw_eh
)
4950 cp_pedwarn ("jump to label `%D'", decl
);
4952 pedwarn ("jump to case label");
4955 pedwarn_with_file_and_line (file
, line
, " from here");
4958 error (" enters try block");
4965 check_previous_goto (use
)
4966 struct named_label_use_list
*use
;
4968 check_previous_goto_1 (use
->label_decl
, use
->binding_level
,
4969 use
->names_in_scope
, use
->filename_o_goto
,
4970 use
->lineno_o_goto
);
4974 check_switch_goto (level
)
4975 struct binding_level
*level
;
4977 check_previous_goto_1 (NULL_TREE
, level
, level
->names
, NULL
, 0);
4980 /* Check that any previously seen jumps to a newly defined label DECL
4981 are OK. Called by define_label. */
4984 check_previous_gotos (decl
)
4987 struct named_label_use_list
**usep
;
4989 if (! TREE_USED (decl
))
4992 for (usep
= &named_label_uses
; *usep
; )
4994 struct named_label_use_list
*use
= *usep
;
4995 if (use
->label_decl
== decl
)
4997 check_previous_goto (use
);
5001 usep
= &(use
->next
);
5005 /* Check that a new jump to a label DECL is OK. Called by
5006 finish_goto_stmt. */
5014 struct named_label_list
*lab
;
5016 /* We can't know where a computed goto is jumping. So we assume
5018 if (! DECL_P (decl
))
5021 /* If the label hasn't been defined yet, defer checking. */
5022 if (! DECL_INITIAL (decl
))
5028 for (lab
= named_labels
; lab
; lab
= lab
->next
)
5029 if (decl
== lab
->label_decl
)
5032 /* If the label is not on named_labels it's a gcc local label, so
5033 it must be in an outer scope, so jumping to it is always OK. */
5037 if ((lab
->eh_region
|| lab
->bad_decls
) && !identified
)
5039 cp_pedwarn_at ("jump to label `%D'", decl
);
5040 pedwarn (" from here");
5044 for (bad
= lab
->bad_decls
; bad
; bad
= TREE_CHAIN (bad
))
5046 tree b
= TREE_VALUE (bad
);
5047 int u
= decl_jump_unsafe (b
);
5049 if (u
> 1 && DECL_ARTIFICIAL (b
))
5050 /* Can't skip init of __exception_info. */
5051 cp_error_at (" enters catch block", b
);
5053 cp_error_at (" skips initialization of `%#D'", b
);
5055 cp_pedwarn_at (" enters scope of non-POD `%#D'", b
);
5059 error (" enters try block");
5062 /* Define a label, specifying the location in the source file.
5063 Return the LABEL_DECL node for the label, if the definition is valid.
5064 Otherwise return 0. */
5067 define_label (filename
, line
, name
)
5068 const char *filename
;
5072 tree decl
= lookup_label (name
);
5073 struct named_label_list
*ent
;
5074 register struct binding_level
*p
;
5076 for (ent
= named_labels
; ent
; ent
= ent
->next
)
5077 if (ent
->label_decl
== decl
)
5080 /* After labels, make any new cleanups in the function go into their
5081 own new (temporary) binding contour. */
5082 for (p
= current_binding_level
; !(p
->parm_flag
); p
= p
->level_chain
)
5083 p
->more_cleanups_ok
= 0;
5085 if (name
== get_identifier ("wchar_t"))
5086 cp_pedwarn ("label named wchar_t");
5088 if (DECL_INITIAL (decl
) != NULL_TREE
)
5090 cp_error ("duplicate label `%D'", decl
);
5095 /* Mark label as having been defined. */
5096 DECL_INITIAL (decl
) = error_mark_node
;
5097 /* Say where in the source. */
5098 DECL_SOURCE_FILE (decl
) = filename
;
5099 DECL_SOURCE_LINE (decl
) = line
;
5102 ent
->names_in_scope
= current_binding_level
->names
;
5103 ent
->binding_level
= current_binding_level
;
5105 check_previous_gotos (decl
);
5106 current_function_return_value
= NULL_TREE
;
5113 struct binding_level
*level
;
5114 struct cp_switch
*next
;
5115 /* The SWITCH_STMT being built. */
5117 /* A splay-tree mapping the low element of a case range to the high
5118 element, or NULL_TREE if there is no high element. Used to
5119 determine whether or not a new case label duplicates an old case
5120 label. We need a tree, rather than simply a hash table, because
5121 of the GNU case range extension. */
5125 /* A stack of the currently active switch statements. The innermost
5126 switch statement is on the top of the stack. There is no need to
5127 mark the stack for garbage collection because it is only active
5128 during the processing of the body of a function, and we never
5129 collect at that point. */
5131 static struct cp_switch
*switch_stack
;
5133 /* Called right after a switch-statement condition is parsed.
5134 SWITCH_STMT is the switch statement being parsed. */
5137 push_switch (switch_stmt
)
5141 = (struct cp_switch
*) xmalloc (sizeof (struct cp_switch
));
5142 p
->level
= current_binding_level
;
5143 p
->next
= switch_stack
;
5144 p
->switch_stmt
= switch_stmt
;
5145 p
->cases
= splay_tree_new (case_compare
, NULL
, NULL
);
5152 struct cp_switch
*cs
;
5155 splay_tree_delete (cs
->cases
);
5156 switch_stack
= switch_stack
->next
;
5160 /* Note that we've seen a definition of a case label, and complain if this
5161 is a bad place for one. */
5164 finish_case_label (low_value
, high_value
)
5169 register struct binding_level
*p
;
5174 error ("case label not within a switch statement");
5176 cp_error ("case label `%E' not within a switch statement",
5179 error ("`default' label not within a switch statement");
5183 if (processing_template_decl
)
5187 /* For templates, just add the case label; we'll do semantic
5188 analysis at instantiation-time. */
5189 label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
5190 return add_stmt (build_case_label (low_value
, high_value
, label
));
5193 /* Find the condition on which this switch statement depends. */
5194 cond
= SWITCH_COND (switch_stack
->switch_stmt
);
5195 if (cond
&& TREE_CODE (cond
) == TREE_LIST
)
5196 cond
= TREE_VALUE (cond
);
5198 r
= c_add_case_label (switch_stack
->cases
, cond
, low_value
, high_value
);
5199 if (r
== error_mark_node
)
5202 check_switch_goto (switch_stack
->level
);
5204 /* After labels, make any new cleanups in the function go into their
5205 own new (temporary) binding contour. */
5206 for (p
= current_binding_level
; !(p
->parm_flag
); p
= p
->level_chain
)
5207 p
->more_cleanups_ok
= 0;
5208 current_function_return_value
= NULL_TREE
;
5213 /* Return the list of declarations of the current level.
5214 Note that this list is in reverse order unless/until
5215 you nreverse it; and when you do nreverse it, you must
5216 store the result back using `storedecls' or you will lose. */
5221 return current_binding_level
->names
;
5224 /* Return the list of type-tags (for structs, etc) of the current level. */
5229 return current_binding_level
->tags
;
5232 /* Store the list of declarations of the current level.
5233 This is done for the parameter declarations of a function being defined,
5234 after they are modified in the light of any missing parameters. */
5240 current_binding_level
->names
= decls
;
5243 /* Similarly, store the list of tags of the current level. */
5249 current_binding_level
->tags
= tags
;
5252 /* Given NAME, an IDENTIFIER_NODE,
5253 return the structure (or union or enum) definition for that name.
5254 Searches binding levels from BINDING_LEVEL up to the global level.
5255 If THISLEVEL_ONLY is nonzero, searches only the specified context
5256 (but skips any tag-transparent contexts to find one that is
5257 meaningful for tags).
5258 FORM says which kind of type the caller wants;
5259 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
5260 If the wrong kind of type is found, and it's not a template, an error is
5264 lookup_tag (form
, name
, binding_level
, thislevel_only
)
5265 enum tree_code form
;
5267 struct binding_level
*binding_level
;
5270 register struct binding_level
*level
;
5271 /* Non-zero if, we should look past a template parameter level, even
5272 if THISLEVEL_ONLY. */
5273 int allow_template_parms_p
= 1;
5275 for (level
= binding_level
; level
; level
= level
->level_chain
)
5278 if (ANON_AGGRNAME_P (name
))
5279 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5281 /* There's no need for error checking here, because
5282 anon names are unique throughout the compilation. */
5283 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
5284 return TREE_VALUE (tail
);
5286 else if (level
->namespace_p
)
5287 /* Do namespace lookup. */
5288 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
5290 tree old
= binding_for_name (name
, tail
);
5292 /* If we just skipped past a template parameter level,
5293 even though THISLEVEL_ONLY, and we find a template
5294 class declaration, then we use the _TYPE node for the
5295 template. See the example below. */
5296 if (thislevel_only
&& !allow_template_parms_p
5297 && old
&& BINDING_VALUE (old
)
5298 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
5299 old
= TREE_TYPE (BINDING_VALUE (old
));
5301 old
= BINDING_TYPE (old
);
5303 /* If it has an original type, it is a typedef, and we
5304 should not return it. */
5305 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
5307 if (old
&& TREE_CODE (old
) != form
5308 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
5310 cp_error ("`%#D' redeclared as %C", old
, form
);
5315 if (thislevel_only
|| tail
== global_namespace
)
5319 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5321 if (TREE_PURPOSE (tail
) == name
)
5323 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
5324 /* Should tighten this up; it'll probably permit
5325 UNION_TYPE and a struct template, for example. */
5327 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
5329 /* Definition isn't the kind we were looking for. */
5330 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
5334 return TREE_VALUE (tail
);
5337 if (thislevel_only
&& ! level
->tag_transparent
)
5339 if (level
->template_parms_p
&& allow_template_parms_p
)
5341 /* We must deal with cases like this:
5343 template <class T> struct S;
5344 template <class T> struct S {};
5346 When looking up `S', for the second declaration, we
5347 would like to find the first declaration. But, we
5348 are in the pseudo-global level created for the
5349 template parameters, rather than the (surrounding)
5350 namespace level. Thus, we keep going one more level,
5351 even though THISLEVEL_ONLY is non-zero. */
5352 allow_template_parms_p
= 0;
5364 set_current_level_tags_transparency (tags_transparent
)
5365 int tags_transparent
;
5367 current_binding_level
->tag_transparent
= tags_transparent
;
5371 /* Given a type, find the tag that was defined for it and return the tag name.
5372 Otherwise return 0. However, the value can never be 0
5373 in the cases in which this is used.
5375 C++: If NAME is non-zero, this is the new name to install. This is
5376 done when replacing anonymous tags with real tag names. */
5379 lookup_tag_reverse (type
, name
)
5383 register struct binding_level
*level
;
5385 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5388 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5390 if (TREE_VALUE (tail
) == type
)
5393 TREE_PURPOSE (tail
) = name
;
5394 return TREE_PURPOSE (tail
);
5401 /* Look up NAME in the NAMESPACE. */
5404 lookup_namespace_name (namespace, name
)
5405 tree
namespace, name
;
5408 tree template_id
= NULL_TREE
;
5410 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5412 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5413 /* This happens for A::B<int> when B is a namespace. */
5415 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5417 /* This happens for A::B where B is a template, and there are no
5418 template arguments. */
5419 cp_error ("invalid use of `%D'", name
);
5420 return error_mark_node
;
5423 namespace = ORIGINAL_NAMESPACE (namespace);
5425 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5428 name
= TREE_OPERAND (name
, 0);
5429 if (TREE_CODE (name
) == OVERLOAD
)
5430 name
= DECL_NAME (OVL_CURRENT (name
));
5431 else if (DECL_P (name
))
5432 name
= DECL_NAME (name
);
5435 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5437 val
= make_node (CPLUS_BINDING
);
5438 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5439 return error_mark_node
;
5441 if (BINDING_VALUE (val
))
5443 val
= BINDING_VALUE (val
);
5447 if (DECL_CLASS_TEMPLATE_P (val
))
5448 val
= lookup_template_class (val
,
5449 TREE_OPERAND (template_id
, 1),
5450 /*in_decl=*/NULL_TREE
,
5451 /*context=*/NULL_TREE
,
5452 /*entering_scope=*/0,
5454 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5455 || TREE_CODE (val
) == OVERLOAD
)
5456 val
= lookup_template_function (val
,
5457 TREE_OPERAND (template_id
, 1));
5460 cp_error ("`%D::%D' is not a template",
5462 return error_mark_node
;
5466 /* If we have a single function from a using decl, pull it out. */
5467 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5468 val
= OVL_FUNCTION (val
);
5472 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5473 return error_mark_node
;
5476 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5478 static unsigned long
5486 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5487 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5492 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5495 typename_compare (k1
, k2
)
5506 d1
= TYPE_NAME (t1
);
5507 d2
= TYPE_NAME (t2
);
5509 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5510 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5511 && ((TREE_TYPE (t1
) != NULL_TREE
)
5512 == (TREE_TYPE (t2
) != NULL_TREE
))
5513 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5514 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5517 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5518 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5519 is non-NULL, this type is being created by the implicit typename
5520 extension, and BASE_TYPE is a type named `t' in some base class of
5521 `T' which depends on template parameters.
5523 Returns the new TYPENAME_TYPE. */
5526 build_typename_type (context
, name
, fullname
, base_type
)
5534 struct hash_entry
*e
;
5536 static struct hash_table ht
;
5540 static struct hash_table
*h
= &ht
;
5542 hash_table_init (&ht
, &hash_newfunc
, &typename_hash
, &typename_compare
);
5543 ggc_add_tree_hash_table_root (&h
, 1);
5546 /* Build the TYPENAME_TYPE. */
5547 t
= make_aggr_type (TYPENAME_TYPE
);
5548 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5549 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5550 TREE_TYPE (t
) = base_type
;
5552 /* Build the corresponding TYPE_DECL. */
5553 d
= build_decl (TYPE_DECL
, name
, t
);
5554 TYPE_NAME (TREE_TYPE (d
)) = d
;
5555 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5556 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5557 DECL_ARTIFICIAL (d
) = 1;
5559 /* See if we already have this type. */
5560 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5564 /* Insert the type into the table. */
5565 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5570 /* Resolve `typename CONTEXT::NAME'. Returns an appropriate type,
5571 unless an error occurs, in which case error_mark_node is returned.
5572 If COMPLAIN zero, don't complain about any errors that occur. */
5575 make_typename_type (context
, name
, complain
)
5583 if (!(TYPE_LANG_SPECIFIC (name
)
5584 && (CLASSTYPE_IS_TEMPLATE (name
)
5585 || CLASSTYPE_USE_TEMPLATE (name
))))
5586 name
= TYPE_IDENTIFIER (name
);
5588 /* Create a TEMPLATE_ID_EXPR for the type. */
5589 name
= build_nt (TEMPLATE_ID_EXPR
,
5590 CLASSTYPE_TI_TEMPLATE (name
),
5591 CLASSTYPE_TI_ARGS (name
));
5593 else if (TREE_CODE (name
) == TYPE_DECL
)
5594 name
= DECL_NAME (name
);
5598 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5600 name
= TREE_OPERAND (name
, 0);
5601 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5602 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5604 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5605 my_friendly_abort (2000);
5607 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5609 /* We can get here from typename_sub0 in the explicit_template_type
5610 expansion. Just fail. */
5612 cp_error ("no class template named `%#T' in `%#T'",
5614 return error_mark_node
;
5617 if (! uses_template_parms (context
)
5618 || currently_open_class (context
))
5620 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5622 tree tmpl
= NULL_TREE
;
5623 if (IS_AGGR_TYPE (context
))
5624 tmpl
= lookup_field (context
, name
, 0, 0);
5625 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5628 cp_error ("no class template named `%#T' in `%#T'",
5630 return error_mark_node
;
5633 return lookup_template_class (tmpl
,
5634 TREE_OPERAND (fullname
, 1),
5636 /*entering_scope=*/0,
5643 if (!IS_AGGR_TYPE (context
))
5646 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5647 return error_mark_node
;
5650 t
= lookup_field (context
, name
, 0, 1);
5652 return TREE_TYPE (t
);
5656 /* If the CONTEXT is not a template type, then either the field is
5657 there now or its never going to be. */
5658 if (!uses_template_parms (context
))
5661 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5662 return error_mark_node
;
5666 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5669 /* Select the right _DECL from multiple choices. */
5672 select_decl (binding
, flags
)
5677 val
= BINDING_VALUE (binding
);
5679 /* When we implicitly declare some builtin entity, we mark it
5680 DECL_ANTICIPATED, so that we know to ignore it until it is
5682 if (val
&& DECL_P (val
)
5683 && DECL_LANG_SPECIFIC (val
)
5684 && DECL_ANTICIPATED (val
))
5687 if (LOOKUP_NAMESPACES_ONLY (flags
))
5689 /* We are not interested in types. */
5690 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5695 /* If we could have a type and
5696 we have nothing or we need a type and have none. */
5697 if (BINDING_TYPE (binding
)
5698 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5699 && TREE_CODE (val
) != TYPE_DECL
)))
5700 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5701 /* Don't return non-types if we really prefer types. */
5702 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5703 && (TREE_CODE (val
) != TEMPLATE_DECL
5704 || !DECL_CLASS_TEMPLATE_P (val
)))
5710 /* Unscoped lookup of a global: iterate over current namespaces,
5711 considering using-directives. If SPACESP is non-NULL, store a list
5712 of the namespaces we've considered in it. */
5715 unqualified_namespace_lookup (name
, flags
, spacesp
)
5720 tree b
= make_node (CPLUS_BINDING
);
5721 tree initial
= current_decl_namespace();
5722 tree scope
= initial
;
5724 struct binding_level
*level
;
5725 tree val
= NULL_TREE
;
5728 *spacesp
= NULL_TREE
;
5730 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5733 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5734 val
= binding_for_name (name
, scope
);
5736 /* Initialize binding for this context. */
5737 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5738 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5740 /* Add all _DECLs seen through local using-directives. */
5741 for (level
= current_binding_level
;
5742 !level
->namespace_p
;
5743 level
= level
->level_chain
)
5744 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5745 scope
, flags
, spacesp
))
5746 /* Give up because of error. */
5747 return error_mark_node
;
5749 /* Add all _DECLs seen through global using-directives. */
5750 /* XXX local and global using lists should work equally. */
5754 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5755 scope
, flags
, spacesp
))
5756 /* Give up because of error. */
5757 return error_mark_node
;
5758 if (siter
== scope
) break;
5759 siter
= CP_DECL_CONTEXT (siter
);
5762 val
= select_decl (b
, flags
);
5763 if (scope
== global_namespace
)
5769 /* Combine prefer_type and namespaces_only into flags. */
5772 lookup_flags (prefer_type
, namespaces_only
)
5773 int prefer_type
, namespaces_only
;
5775 if (namespaces_only
)
5776 return LOOKUP_PREFER_NAMESPACES
;
5777 if (prefer_type
> 1)
5778 return LOOKUP_PREFER_TYPES
;
5779 if (prefer_type
> 0)
5780 return LOOKUP_PREFER_BOTH
;
5784 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5785 ignore it or not. Subroutine of lookup_name_real. */
5788 qualify_lookup (val
, flags
)
5792 if (val
== NULL_TREE
)
5794 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5796 if ((flags
& LOOKUP_PREFER_TYPES
)
5797 && (TREE_CODE (val
) == TYPE_DECL
5798 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5799 && DECL_CLASS_TEMPLATE_P (val
))))
5801 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5806 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5810 warn_about_implicit_typename_lookup (typename
, binding
)
5814 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5815 tree name
= DECL_NAME (typename
);
5817 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5818 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5819 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5820 && ! (TREE_CODE (binding
) == TYPE_DECL
5821 && same_type_p (TREE_TYPE (binding
), subtype
)))
5823 cp_warning ("lookup of `%D' finds `%#D'",
5825 cp_warning (" instead of `%D' from dependent base class",
5827 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5828 constructor_name (current_class_type
), name
);
5832 /* Look up NAME in the current binding level and its superiors in the
5833 namespace of variables, functions and typedefs. Return a ..._DECL
5834 node of some kind representing its definition if there is only one
5835 such declaration, or return a TREE_LIST with all the overloaded
5836 definitions if there are many, or return 0 if it is undefined.
5838 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5839 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5840 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5841 Otherwise we prefer non-TYPE_DECLs.
5843 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5844 using IDENTIFIER_CLASS_VALUE. */
5847 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5849 int prefer_type
, nonclass
, namespaces_only
;
5852 tree val
= NULL_TREE
;
5854 tree from_obj
= NULL_TREE
;
5856 int val_is_implicit_typename
= 0;
5858 /* Hack: copy flag set by parser, if set. */
5859 if (only_namespace_names
)
5860 namespaces_only
= 1;
5862 if (prefer_type
== -2)
5864 extern int looking_for_typename
;
5865 tree type
= NULL_TREE
;
5868 prefer_type
= looking_for_typename
;
5870 flags
= lookup_flags (prefer_type
, namespaces_only
);
5871 /* If the next thing is '<', class templates are types. */
5872 if (looking_for_template
)
5873 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5875 /* std:: becomes :: for now. */
5876 if (got_scope
&& got_scope
== fake_std_node
)
5877 got_scope
= void_type_node
;
5881 else if (got_object
!= error_mark_node
)
5886 if (type
== error_mark_node
)
5887 return error_mark_node
;
5888 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5889 type
= TREE_TYPE (type
);
5892 type
= complete_type (type
);
5894 if (TREE_CODE (type
) == VOID_TYPE
)
5895 type
= global_namespace
;
5896 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5898 val
= make_node (CPLUS_BINDING
);
5899 flags
|= LOOKUP_COMPLAIN
;
5900 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5902 val
= select_decl (val
, flags
);
5904 else if (! IS_AGGR_TYPE (type
)
5905 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5906 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
5907 || TREE_CODE (type
) == TYPENAME_TYPE
)
5908 /* Someone else will give an error about this if needed. */
5910 else if (type
== current_class_type
)
5911 val
= IDENTIFIER_CLASS_VALUE (name
);
5914 val
= lookup_member (type
, name
, 0, prefer_type
);
5915 type_access_control (type
, val
);
5917 /* Restore the containing TYPENAME_TYPE if we looked
5918 through it before. */
5919 if (got_scope
&& got_scope
!= type
5920 && val
&& TREE_CODE (val
) == TYPE_DECL
5921 && TREE_CODE (TREE_TYPE (val
)) == TYPENAME_TYPE
)
5922 TYPE_CONTEXT (TREE_TYPE (val
)) = got_scope
;
5930 else if (got_object
&& val
)
5938 flags
= lookup_flags (prefer_type
, namespaces_only
);
5939 /* If we're not parsing, we need to complain. */
5940 flags
|= LOOKUP_COMPLAIN
;
5943 /* First, look in non-namespace scopes. */
5945 if (current_class_type
== NULL_TREE
)
5948 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5952 if (!LOCAL_BINDING_P (t
) && nonclass
)
5953 /* We're not looking for class-scoped bindings, so keep going. */
5956 /* If this is the kind of thing we're looking for, we're done. */
5957 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5958 binding
= BINDING_VALUE (t
);
5959 else if ((flags
& LOOKUP_PREFER_TYPES
)
5960 && qualify_lookup (BINDING_TYPE (t
), flags
))
5961 binding
= BINDING_TYPE (t
);
5963 binding
= NULL_TREE
;
5965 /* Handle access control on types from enclosing or base classes. */
5966 if (binding
&& ! yylex
5967 && BINDING_LEVEL (t
) && BINDING_LEVEL (t
)->parm_flag
== 2)
5968 type_access_control (BINDING_LEVEL (t
)->this_class
, binding
);
5971 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5973 if (val_is_implicit_typename
&& !yylex
)
5974 warn_about_implicit_typename_lookup (val
, binding
);
5976 val_is_implicit_typename
5977 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5978 if (!val_is_implicit_typename
)
5983 /* Now lookup in namespace scopes. */
5984 if (!val
|| val_is_implicit_typename
)
5986 t
= unqualified_namespace_lookup (name
, flags
, 0);
5989 if (val_is_implicit_typename
&& !yylex
)
5990 warn_about_implicit_typename_lookup (val
, t
);
5998 /* This should only warn about types used in qualified-ids. */
5999 if (from_obj
&& from_obj
!= val
)
6001 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
6002 && TREE_CODE (val
) == TYPE_DECL
6003 && ! same_type_p (TREE_TYPE (from_obj
), TREE_TYPE (val
)))
6005 lookup of `%D' in the scope of `%#T' (`%#D') \
6006 does not match lookup in the current scope (`%#D')",
6007 name
, got_object
, from_obj
, val
);
6009 /* We don't change val to from_obj if got_object depends on
6010 template parms because that breaks implicit typename for
6011 destructor calls. */
6012 if (! uses_template_parms (got_object
))
6016 /* If we have a single function from a using decl, pull it out. */
6017 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
6018 val
= OVL_FUNCTION (val
);
6027 lookup_name_nonclass (name
)
6030 return lookup_name_real (name
, 0, 1, 0);
6034 lookup_function_nonclass (name
, args
)
6038 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
6042 lookup_name_namespace_only (name
)
6045 /* type-or-namespace, nonclass, namespace_only */
6046 return lookup_name_real (name
, 1, 1, 1);
6050 lookup_name (name
, prefer_type
)
6054 return lookup_name_real (name
, prefer_type
, 0, 0);
6057 /* Similar to `lookup_name' but look only in the innermost non-class
6061 lookup_name_current_level (name
)
6064 struct binding_level
*b
;
6067 b
= current_binding_level
;
6068 while (b
->parm_flag
== 2)
6073 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
6075 /* extern "C" function() */
6076 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
6079 else if (IDENTIFIER_BINDING (name
)
6080 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
6084 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
6085 return IDENTIFIER_VALUE (name
);
6097 /* Like lookup_name_current_level, but for types. */
6100 lookup_type_current_level (name
)
6103 register tree t
= NULL_TREE
;
6105 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
6107 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
6108 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
6110 struct binding_level
*b
= current_binding_level
;
6113 if (purpose_member (name
, b
->type_shadowed
))
6114 return REAL_IDENTIFIER_TYPE_VALUE (name
);
6126 begin_only_namespace_names ()
6128 only_namespace_names
= 1;
6132 end_only_namespace_names ()
6134 only_namespace_names
= 0;
6137 /* Push the declarations of builtin types into the namespace.
6138 RID_INDEX is the index of the builtin type
6139 in the array RID_POINTERS. NAME is the name used when looking
6140 up the builtin type. TYPE is the _TYPE node for the builtin type. */
6143 record_builtin_type (rid_index
, name
, type
)
6148 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
6149 tree tdecl
= NULL_TREE
;
6151 if ((int) rid_index
< (int) RID_MAX
)
6152 rname
= ridpointers
[(int) rid_index
];
6154 tname
= get_identifier (name
);
6156 TYPE_BUILT_IN (type
) = 1;
6160 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
6161 set_identifier_type_value (tname
, NULL_TREE
);
6162 if ((int) rid_index
< (int) RID_MAX
)
6163 /* Built-in types live in the global namespace. */
6164 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
6166 if (rname
!= NULL_TREE
)
6168 if (tname
!= NULL_TREE
)
6170 set_identifier_type_value (rname
, NULL_TREE
);
6171 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
6175 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
6176 set_identifier_type_value (rname
, NULL_TREE
);
6181 /* Record one of the standard Java types.
6182 * Declare it as having the given NAME.
6183 * If SIZE > 0, it is the size of one of the integral types;
6184 * otherwise it is the negative of the size of one of the other types. */
6187 record_builtin_java_type (name
, size
)
6193 type
= make_signed_type (size
);
6194 else if (size
> -32)
6195 { /* "__java_char" or ""__java_boolean". */
6196 type
= make_unsigned_type (-size
);
6197 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
6200 { /* "__java_float" or ""__java_double". */
6201 type
= make_node (REAL_TYPE
);
6202 TYPE_PRECISION (type
) = - size
;
6205 record_builtin_type (RID_MAX
, name
, type
);
6206 decl
= TYPE_NAME (type
);
6208 /* Suppress generate debug symbol entries for these types,
6209 since for normal C++ they are just clutter.
6210 However, push_lang_context undoes this if extern "Java" is seen. */
6211 DECL_IGNORED_P (decl
) = 1;
6213 TYPE_FOR_JAVA (type
) = 1;
6217 /* Push a type into the namespace so that the back-ends ignore it. */
6220 record_unknown_type (type
, name
)
6224 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
6225 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
6226 DECL_IGNORED_P (decl
) = 1;
6227 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
6228 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
6229 TYPE_ALIGN (type
) = 1;
6230 TYPE_USER_ALIGN (type
) = 0;
6231 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
6234 /* An string for which we should create an IDENTIFIER_NODE at
6237 typedef struct predefined_identifier
6239 /* The name of the identifier. */
6241 /* The place where the IDENTIFIER_NODE should be stored. */
6243 /* Non-zero if this is the name of a constructor or destructor. */
6245 } predefined_identifier
;
6247 /* Create all the predefined identifiers. */
6250 initialize_predefined_identifiers ()
6252 struct predefined_identifier
*pid
;
6254 /* A table of identifiers to create at startup. */
6255 static predefined_identifier predefined_identifiers
[] = {
6256 { "C++", &lang_name_cplusplus
, 0 },
6257 { "C", &lang_name_c
, 0 },
6258 { "Java", &lang_name_java
, 0 },
6259 { CTOR_NAME
, &ctor_identifier
, 1 },
6260 { "__base_ctor", &base_ctor_identifier
, 1 },
6261 { "__comp_ctor", &complete_ctor_identifier
, 1 },
6262 { DTOR_NAME
, &dtor_identifier
, 1 },
6263 { "__comp_dtor", &complete_dtor_identifier
, 1 },
6264 { "__base_dtor", &base_dtor_identifier
, 1 },
6265 { "__deleting_dtor", &deleting_dtor_identifier
, 1 },
6266 { VTABLE_DELTA2_NAME
, &delta2_identifier
, 0 },
6267 { VTABLE_DELTA_NAME
, &delta_identifier
, 0 },
6268 { IN_CHARGE_NAME
, &in_charge_identifier
, 0 },
6269 { VTABLE_INDEX_NAME
, &index_identifier
, 0 },
6270 { "nelts", &nelts_identifier
, 0 },
6271 { THIS_NAME
, &this_identifier
, 0 },
6272 { VTABLE_PFN_NAME
, &pfn_identifier
, 0 },
6273 { "__pfn_or_delta2", &pfn_or_delta2_identifier
, 0 },
6274 { "_vptr", &vptr_identifier
, 0 },
6275 { "__cp_push_exception", &cp_push_exception_identifier
, 0 },
6276 { "__vtt_parm", &vtt_parm_identifier
, 0 },
6277 { "std", &std_identifier
, 0 },
6281 for (pid
= predefined_identifiers
; pid
->name
; ++pid
)
6283 *pid
->node
= get_identifier (pid
->name
);
6284 if (pid
->ctor_or_dtor_p
)
6285 IDENTIFIER_CTOR_OR_DTOR_P (*pid
->node
) = 1;
6289 /* Create the predefined scalar types of C,
6290 and some nodes representing standard constants (0, 1, (void *)0).
6291 Initialize the global binding level.
6292 Make definitions for built-in primitive functions. */
6295 init_decl_processing ()
6299 /* Check to see that the user did not specify an invalid combination
6300 of command-line options. */
6301 if (!flag_vtable_thunks
)
6302 error ("the ABI requires vtable thunks");
6304 /* Create all the identifiers we need. */
6305 initialize_predefined_identifiers ();
6307 /* Fill in back-end hooks. */
6308 init_lang_status
= &push_cp_function_context
;
6309 free_lang_status
= &pop_cp_function_context
;
6310 mark_lang_status
= &mark_cp_function_context
;
6311 lang_safe_from_p
= &c_safe_from_p
;
6312 lang_dump_tree
= &cp_dump_tree
;
6313 lang_missing_noreturn_ok_p
= &cp_missing_noreturn_ok_p
;
6319 /* Create the global variables. */
6320 push_to_top_level ();
6322 /* Enter the global namespace. */
6323 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
6324 push_namespace (get_identifier ("::"));
6325 global_namespace
= current_namespace
;
6326 current_lang_name
= NULL_TREE
;
6328 /* Adjust various flags based on command-line settings. */
6329 if (! flag_permissive
&& ! pedantic
)
6330 flag_pedantic_errors
= 1;
6331 if (!flag_no_inline
)
6332 flag_inline_trees
= 1;
6335 current_lang_name
= lang_name_c
;
6337 current_function_decl
= NULL_TREE
;
6338 current_binding_level
= NULL_BINDING_LEVEL
;
6339 free_binding_level
= NULL_BINDING_LEVEL
;
6341 build_common_tree_nodes (flag_signed_char
);
6343 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6344 TREE_TYPE (error_mark_list
) = error_mark_node
;
6346 /* Make the binding_level structure for global names. */
6348 global_binding_level
= current_binding_level
;
6349 /* The global level is the namespace level of ::. */
6350 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6351 declare_namespace_level ();
6353 /* Create the `std' namespace. */
6356 push_namespace (std_identifier
);
6357 std_node
= current_namespace
;
6359 fake_std_node
= error_mark_node
;
6363 fake_std_node
= build_decl (NAMESPACE_DECL
,
6366 pushdecl (fake_std_node
);
6369 c_common_nodes_and_builtins ();
6371 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6372 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6373 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6374 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6375 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6376 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6377 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6378 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6380 integer_two_node
= build_int_2 (2, 0);
6381 TREE_TYPE (integer_two_node
) = integer_type_node
;
6382 integer_three_node
= build_int_2 (3, 0);
6383 TREE_TYPE (integer_three_node
) = integer_type_node
;
6385 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6386 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6387 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6388 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6389 TYPE_PRECISION (boolean_type_node
) = 1;
6390 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6391 boolean_false_node
= build_int_2 (0, 0);
6392 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6393 boolean_true_node
= build_int_2 (1, 0);
6394 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6396 signed_size_zero_node
= build_int_2 (0, 0);
6397 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6399 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6402 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
6405 delta_type_node
= ptrdiff_type_node
;
6406 vtable_index_type
= ptrdiff_type_node
;
6408 vtt_parm_type
= build_pointer_type (const_ptr_type_node
);
6409 lang_type_promotes_to
= convert_type_from_ellipsis
;
6412 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6414 /* C++ extensions */
6416 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6417 record_unknown_type (unknown_type_node
, "unknown type");
6419 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6420 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6422 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6424 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6426 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6427 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6429 if (flag_vtable_thunks
)
6431 /* Make sure we get a unique function type, so we can give
6432 its pointer type a name. (This wins for gdb.) */
6433 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6434 TREE_TYPE (vfunc_type
) = integer_type_node
;
6435 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6436 layout_type (vfunc_type
);
6438 vtable_entry_type
= build_pointer_type (vfunc_type
);
6442 vtable_entry_type
= make_aggr_type (RECORD_TYPE
);
6443 fields
[0] = build_decl (FIELD_DECL
, delta_identifier
,
6445 fields
[1] = build_decl (FIELD_DECL
, index_identifier
,
6447 fields
[2] = build_decl (FIELD_DECL
, pfn_identifier
,
6449 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6452 /* Make this part of an invisible union. */
6453 fields
[3] = copy_node (fields
[2]);
6454 TREE_TYPE (fields
[3]) = delta_type_node
;
6455 DECL_NAME (fields
[3]) = delta2_identifier
;
6456 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6457 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6458 DECL_SIZE_UNIT (fields
[3]) = TYPE_SIZE_UNIT (delta_type_node
);
6459 TREE_UNSIGNED (fields
[3]) = 0;
6460 TREE_CHAIN (fields
[2]) = fields
[3];
6461 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6464 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6467 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6468 layout_type (vtbl_type_node
);
6469 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6470 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6471 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6472 layout_type (vtbl_ptr_type_node
);
6473 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6475 push_namespace (get_identifier ("__cxxabiv1"));
6476 abi_node
= current_namespace
;
6479 global_type_node
= make_node (LANG_TYPE
);
6480 record_unknown_type (global_type_node
, "global type");
6483 current_lang_name
= lang_name_cplusplus
;
6486 tree bad_alloc_type_node
, newtype
, deltype
;
6488 push_namespace (std_identifier
);
6489 bad_alloc_type_node
= xref_tag
6490 (class_type_node
, get_identifier ("bad_alloc"), 1);
6493 newtype
= build_exception_variant
6494 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6495 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6496 push_cp_library_fn (NEW_EXPR
, newtype
);
6497 push_cp_library_fn (VEC_NEW_EXPR
, newtype
);
6498 global_delete_fndecl
= push_cp_library_fn (DELETE_EXPR
, deltype
);
6499 push_cp_library_fn (VEC_DELETE_EXPR
, deltype
);
6503 = build_library_fn_ptr ("__cxa_pure_virtual", void_ftype
);
6505 /* Perform other language dependent initializations. */
6506 init_class_processing ();
6507 init_init_processing ();
6508 init_search_processing ();
6509 init_rtti_processing ();
6511 if (flag_exceptions
)
6512 init_exception_processing ();
6515 flag_inline_functions
= 0;
6518 if (! supports_one_only ())
6521 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6522 function_id_node
= get_identifier ("__FUNCTION__");
6523 pretty_function_id_node
= get_identifier ("__PRETTY_FUNCTION__");
6524 func_id_node
= get_identifier ("__func__");
6526 make_fname_decl
= cp_make_fname_decl
;
6527 declare_function_name ();
6529 /* Prepare to check format strings against argument lists. */
6530 init_function_format_info ();
6532 /* Show we use EH for cleanups. */
6533 using_eh_for_cleanups ();
6535 valid_lang_attribute
= cp_valid_lang_attribute
;
6537 /* Maintain consistency. Perhaps we should just complain if they
6538 say -fwritable-strings? */
6539 if (flag_writable_strings
)
6540 flag_const_strings
= 0;
6542 /* Add GC roots for all of our global variables. */
6543 ggc_add_tree_root (c_global_trees
, sizeof c_global_trees
/ sizeof(tree
));
6544 ggc_add_tree_root (cp_global_trees
, sizeof cp_global_trees
/ sizeof(tree
));
6545 ggc_add_tree_root (&integer_three_node
, 1);
6546 ggc_add_tree_root (&integer_two_node
, 1);
6547 ggc_add_tree_root (&signed_size_zero_node
, 1);
6548 ggc_add_tree_root (&size_one_node
, 1);
6549 ggc_add_tree_root (&size_zero_node
, 1);
6550 ggc_add_root (&global_binding_level
, 1, sizeof global_binding_level
,
6551 mark_binding_level
);
6552 ggc_add_root (&scope_chain
, 1, sizeof scope_chain
, &mark_saved_scope
);
6553 ggc_add_tree_root (&static_ctors
, 1);
6554 ggc_add_tree_root (&static_dtors
, 1);
6555 ggc_add_tree_root (&lastiddecl
, 1);
6557 ggc_add_tree_root (&last_function_parm_tags
, 1);
6558 ggc_add_tree_root (¤t_function_return_value
, 1);
6559 ggc_add_tree_root (¤t_function_parm_tags
, 1);
6560 ggc_add_tree_root (&last_function_parms
, 1);
6561 ggc_add_tree_root (&error_mark_list
, 1);
6563 ggc_add_tree_root (&global_namespace
, 1);
6564 ggc_add_tree_root (&global_type_node
, 1);
6565 ggc_add_tree_root (&anonymous_namespace_name
, 1);
6567 ggc_add_tree_root (&got_object
, 1);
6568 ggc_add_tree_root (&got_scope
, 1);
6570 ggc_add_tree_root (¤t_lang_name
, 1);
6571 ggc_add_tree_root (&static_aggregates
, 1);
6572 ggc_add_tree_root (&free_bindings
, 1);
6575 /* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the
6576 decl, NAME is the initialization string and TYPE_DEP indicates whether
6577 NAME depended on the type of the function. We make use of that to detect
6578 __PRETTY_FUNCTION__ inside a template fn. Because we build a tree for
6579 the function before emitting any of it, we don't need to treat the
6580 VAR_DECL specially. We can decide whether to emit it later, if it was
6584 cp_make_fname_decl (id
, name
, type_dep
)
6589 tree decl
, type
, init
;
6590 size_t length
= strlen (name
);
6591 tree domain
= NULL_TREE
;
6593 if (!processing_template_decl
)
6596 domain
= build_index_type (size_int (length
));
6598 type
= build_cplus_array_type
6599 (build_qualified_type (char_type_node
, TYPE_QUAL_CONST
),
6602 decl
= build_decl (VAR_DECL
, id
, type
);
6603 TREE_STATIC (decl
) = 1;
6604 TREE_READONLY (decl
) = 1;
6605 DECL_SOURCE_LINE (decl
) = 0;
6606 DECL_ARTIFICIAL (decl
) = 1;
6607 DECL_IN_SYSTEM_HEADER (decl
) = 1;
6609 if (processing_template_decl
)
6610 decl
= push_template_decl (decl
);
6613 init
= build (FUNCTION_NAME
, type
);
6614 DECL_PRETTY_FUNCTION_P (decl
) = 1;
6618 init
= build_string (length
+ 1, name
);
6619 TREE_TYPE (init
) = type
;
6621 DECL_INITIAL (decl
) = init
;
6622 cp_finish_decl (decl
, init
, NULL_TREE
, LOOKUP_ONLYCONVERTING
);
6624 /* We will have to make sure we only emit this, if it is actually used. */
6628 /* Entry point for the benefit of c_common_nodes_and_builtins.
6630 Make a definition for a builtin function named NAME and whose data type
6631 is TYPE. TYPE should be a function type with argument types.
6633 CLASS and CODE tell later passes how to compile calls to this function.
6634 See tree.h for possible values.
6636 If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6637 the name to be called if we can't opencode the function. */
6640 builtin_function (name
, type
, code
, class, libname
)
6644 enum built_in_class
class;
6645 const char *libname
;
6647 tree decl
= build_library_fn_1 (get_identifier (name
), ERROR_MARK
, type
);
6648 DECL_BUILT_IN_CLASS (decl
) = class;
6649 DECL_FUNCTION_CODE (decl
) = code
;
6651 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6653 /* All builtins that don't begin with an `_' should go in the `std'
6655 if (flag_honor_std
&& name
[0] != '_')
6657 push_namespace (std_identifier
);
6658 DECL_CONTEXT (decl
) = std_node
;
6661 if (flag_honor_std
&& name
[0] != '_')
6664 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6665 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6666 function in the namespace. */
6668 DECL_ASSEMBLER_NAME (decl
) = get_identifier (libname
);
6669 make_decl_rtl (decl
, NULL
);
6671 /* Warn if a function in the namespace for users
6672 is used without an occasion to consider it declared. */
6673 if (name
[0] != '_' || name
[1] != '_')
6674 DECL_ANTICIPATED (decl
) = 1;
6679 /* Generate a FUNCTION_DECL with the typical flags for a runtime library
6680 function. Not called directly. */
6683 build_library_fn_1 (name
, operator_code
, type
)
6685 enum tree_code operator_code
;
6688 tree fn
= build_lang_decl (FUNCTION_DECL
, name
, type
);
6689 DECL_EXTERNAL (fn
) = 1;
6690 TREE_PUBLIC (fn
) = 1;
6691 DECL_ARTIFICIAL (fn
) = 1;
6692 TREE_NOTHROW (fn
) = 1;
6693 SET_OVERLOADED_OPERATOR_CODE (fn
, operator_code
);
6697 /* Returns the _DECL for a library function with C linkage.
6698 We assume that such functions never throw; if this is incorrect,
6699 callers should unset TREE_NOTHROW. */
6702 build_library_fn (name
, type
)
6706 tree fn
= build_library_fn_1 (name
, ERROR_MARK
, type
);
6707 make_decl_rtl (fn
, NULL
);
6711 /* Returns the _DECL for a library function with C++ linkage. */
6714 build_cp_library_fn (name
, operator_code
, type
)
6716 enum tree_code operator_code
;
6719 tree fn
= build_library_fn_1 (name
, operator_code
, type
);
6720 TREE_NOTHROW (fn
) = TYPE_NOTHROW_P (type
);
6721 DECL_CONTEXT (fn
) = FROB_CONTEXT (current_namespace
);
6722 set_mangled_name_for_decl (fn
);
6723 make_decl_rtl (fn
, NULL
);
6727 /* Like build_library_fn, but takes a C string instead of an
6731 build_library_fn_ptr (name
, type
)
6735 return build_library_fn (get_identifier (name
), type
);
6738 /* Like build_cp_library_fn, but takes a C string instead of an
6742 build_cp_library_fn_ptr (name
, type
)
6746 return build_cp_library_fn (get_identifier (name
), ERROR_MARK
, type
);
6749 /* Like build_library_fn, but also pushes the function so that we will
6750 be able to find it via IDENTIFIER_GLOBAL_VALUE. */
6753 push_library_fn (name
, type
)
6756 tree fn
= build_library_fn (name
, type
);
6757 pushdecl_top_level (fn
);
6761 /* Like build_cp_library_fn, but also pushes the function so that it
6762 will be found by normal lookup. */
6765 push_cp_library_fn (operator_code
, type
)
6766 enum tree_code operator_code
;
6769 tree fn
= build_cp_library_fn (ansi_opname (operator_code
),
6776 /* Like push_library_fn, but takes a TREE_LIST of parm types rather than
6780 push_void_library_fn (name
, parmtypes
)
6781 tree name
, parmtypes
;
6783 tree type
= build_function_type (void_type_node
, parmtypes
);
6784 return push_library_fn (name
, type
);
6787 /* Like push_library_fn, but also note that this function throws
6788 and does not return. Used for __throw_foo and the like. */
6791 push_throw_library_fn (name
, type
)
6794 tree fn
= push_library_fn (name
, type
);
6795 TREE_THIS_VOLATILE (fn
) = 1;
6796 TREE_NOTHROW (fn
) = 0;
6800 /* When we call finish_struct for an anonymous union, we create
6801 default copy constructors and such. But, an anonymous union
6802 shouldn't have such things; this function undoes the damage to the
6803 anonymous union type T.
6805 (The reason that we create the synthesized methods is that we don't
6806 distinguish `union { int i; }' from `typedef union { int i; } U'.
6807 The first is an anonymous union; the second is just an ordinary
6811 fixup_anonymous_aggr (t
)
6816 /* Wipe out memory of synthesized methods */
6817 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6818 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6819 TYPE_HAS_INIT_REF (t
) = 0;
6820 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6821 TYPE_HAS_ASSIGN_REF (t
) = 0;
6822 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6824 /* Splice the implicitly generated functions out of the TYPE_METHODS
6826 q
= &TYPE_METHODS (t
);
6829 if (DECL_ARTIFICIAL (*q
))
6830 *q
= TREE_CHAIN (*q
);
6832 q
= &TREE_CHAIN (*q
);
6835 /* ISO C++ 9.5.3. Anonymous unions may not have function members. */
6836 if (TYPE_METHODS (t
))
6837 cp_error_at ("an anonymous union cannot have function members", t
);
6840 /* Make sure that a declaration with no declarator is well-formed, i.e.
6841 just defines a tagged type or anonymous union.
6843 Returns the type defined, if any. */
6846 check_tag_decl (declspecs
)
6851 int saw_typedef
= 0;
6852 tree ob_modifier
= NULL_TREE
;
6854 register tree t
= NULL_TREE
;
6856 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6858 register tree value
= TREE_VALUE (link
);
6861 || TREE_CODE (value
) == TYPE_DECL
6862 || (TREE_CODE (value
) == IDENTIFIER_NODE
6863 && IDENTIFIER_GLOBAL_VALUE (value
)
6864 && TREE_CODE (IDENTIFIER_GLOBAL_VALUE (value
)) == TYPE_DECL
))
6868 if (found_type
== 2 && TREE_CODE (value
) == IDENTIFIER_NODE
)
6870 if (! in_system_header
)
6871 cp_pedwarn ("redeclaration of C++ built-in type `%T'", value
);
6876 && ((TREE_CODE (value
) != TYPENAME_TYPE
&& IS_AGGR_TYPE (value
))
6877 || TREE_CODE (value
) == ENUMERAL_TYPE
))
6879 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6883 else if (value
== ridpointers
[(int) RID_TYPEDEF
])
6885 else if (value
== ridpointers
[(int) RID_FRIEND
])
6887 if (current_class_type
== NULL_TREE
6888 || current_scope () != current_class_type
)
6889 ob_modifier
= value
;
6893 else if (value
== ridpointers
[(int) RID_STATIC
]
6894 || value
== ridpointers
[(int) RID_EXTERN
]
6895 || value
== ridpointers
[(int) RID_AUTO
]
6896 || value
== ridpointers
[(int) RID_REGISTER
]
6897 || value
== ridpointers
[(int) RID_INLINE
]
6898 || value
== ridpointers
[(int) RID_VIRTUAL
]
6899 || value
== ridpointers
[(int) RID_CONST
]
6900 || value
== ridpointers
[(int) RID_VOLATILE
]
6901 || value
== ridpointers
[(int) RID_EXPLICIT
])
6902 ob_modifier
= value
;
6906 error ("multiple types in one declaration");
6908 if (t
== NULL_TREE
&& ! saw_friend
)
6909 pedwarn ("declaration does not declare anything");
6911 /* Check for an anonymous union. We're careful
6912 accessing TYPE_IDENTIFIER because some built-in types, like
6913 pointer-to-member types, do not have TYPE_NAME. */
6914 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
6916 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
6918 /* 7/3 In a simple-declaration, the optional init-declarator-list
6919 can be omitted only when declaring a class (clause 9) or
6920 enumeration (7.2), that is, when the decl-specifier-seq contains
6921 either a class-specifier, an elaborated-type-specifier with
6922 a class-key (9.1), or an enum-specifier. In these cases and
6923 whenever a class-specifier or enum-specifier is present in the
6924 decl-specifier-seq, the identifiers in these specifiers are among
6925 the names being declared by the declaration (as class-name,
6926 enum-names, or enumerators, depending on the syntax). In such
6927 cases, and except for the declaration of an unnamed bit-field (9.6),
6928 the decl-specifier-seq shall introduce one or more names into the
6929 program, or shall redeclare a name introduced by a previous
6930 declaration. [Example:
6931 enum { }; // ill-formed
6932 typedef class { }; // ill-formed
6936 error ("Missing type-name in typedef-declaration.");
6939 /* Anonymous unions are objects, so they can have specifiers. */;
6940 SET_ANON_AGGR_TYPE_P (t
);
6942 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
6943 pedwarn ("ISO C++ prohibits anonymous structs");
6946 else if (ob_modifier
)
6948 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
6949 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
6950 cp_error ("`%D' can only be specified for functions", ob_modifier
);
6951 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
6952 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
6953 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
6954 cp_error ("`%D' can only be specified for constructors",
6957 cp_error ("`%D' can only be specified for objects and functions",
6964 /* Called when a declaration is seen that contains no names to declare.
6965 If its type is a reference to a structure, union or enum inherited
6966 from a containing scope, shadow that tag name for the current scope
6967 with a forward reference.
6968 If its type defines a new named structure or union
6969 or defines an enum, it is valid but we need not do anything here.
6970 Otherwise, it is an error.
6972 C++: may have to grok the declspecs to learn about static,
6973 complain for anonymous unions. */
6976 shadow_tag (declspecs
)
6979 tree t
= check_tag_decl (declspecs
);
6982 maybe_process_partial_specialization (t
);
6984 /* This is where the variables in an anonymous union are
6985 declared. An anonymous union declaration looks like:
6987 because there is no declarator after the union, the parser
6988 sends that declaration here. */
6989 if (t
&& ANON_AGGR_TYPE_P (t
))
6991 fixup_anonymous_aggr (t
);
6993 if (TYPE_FIELDS (t
))
6995 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
6997 finish_anon_union (decl
);
7002 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
7005 groktypename (typename
)
7008 if (TREE_CODE (typename
) != TREE_LIST
)
7010 return grokdeclarator (TREE_VALUE (typename
),
7011 TREE_PURPOSE (typename
),
7012 TYPENAME
, 0, NULL_TREE
);
7015 /* Decode a declarator in an ordinary declaration or data definition.
7016 This is called as soon as the type information and variable name
7017 have been parsed, before parsing the initializer if any.
7018 Here we create the ..._DECL node, fill in its type,
7019 and put it on the list of decls for the current context.
7020 The ..._DECL node is returned as the value.
7022 Exception: for arrays where the length is not specified,
7023 the type is left null, to be filled in by `cp_finish_decl'.
7025 Function definitions do not come here; they go to start_function
7026 instead. However, external and forward declarations of functions
7027 do go through here. Structure field declarations are done by
7028 grokfield and not through here. */
7031 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
7032 tree declarator
, declspecs
;
7034 tree attributes
, prefix_attributes
;
7037 register tree type
, tem
;
7039 extern int have_extern_spec
;
7040 extern int used_extern_spec
;
7044 /* See code below that used this. */
7045 int init_written
= initialized
;
7048 /* This should only be done once on the top most decl. */
7049 if (have_extern_spec
&& !used_extern_spec
)
7051 declspecs
= tree_cons (NULL_TREE
, get_identifier ("extern"),
7053 used_extern_spec
= 1;
7056 if (attributes
|| prefix_attributes
)
7057 attrlist
= build_tree_list (attributes
, prefix_attributes
);
7059 attrlist
= NULL_TREE
;
7061 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
7064 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
7067 type
= TREE_TYPE (decl
);
7069 if (type
== error_mark_node
)
7072 context
= DECL_CONTEXT (decl
);
7074 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
7075 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
7077 /* When parsing the initializer, lookup should use the object's
7079 push_decl_namespace (context
);
7082 /* We are only interested in class contexts, later. */
7083 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
7084 context
= NULL_TREE
;
7087 /* Is it valid for this decl to have an initializer at all?
7088 If not, set INITIALIZED to zero, which will indirectly
7089 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7090 switch (TREE_CODE (decl
))
7093 /* typedef foo = bar means give foo the same type as bar.
7094 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
7095 Any other case of an initialization in a TYPE_DECL is an error. */
7096 if (pedantic
|| list_length (declspecs
) > 1)
7098 cp_error ("typedef `%D' is initialized", decl
);
7104 cp_error ("function `%#D' is initialized like a variable", decl
);
7114 if (! toplevel_bindings_p ()
7115 && DECL_EXTERNAL (decl
))
7116 cp_warning ("declaration of `%#D' has `extern' and is initialized",
7118 DECL_EXTERNAL (decl
) = 0;
7119 if (toplevel_bindings_p ())
7120 TREE_STATIC (decl
) = 1;
7122 /* Tell `pushdecl' this is an initialized decl
7123 even though we don't yet have the initializer expression.
7124 Also tell `cp_finish_decl' it may store the real initializer. */
7125 DECL_INITIAL (decl
) = error_mark_node
;
7128 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
7129 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
7132 /* Set attributes here so if duplicate decl, will have proper attributes. */
7133 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
7135 if (context
&& COMPLETE_TYPE_P (complete_type (context
)))
7137 push_nested_class (context
, 2);
7139 if (TREE_CODE (decl
) == VAR_DECL
)
7141 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
7142 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
7143 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
7146 if (DECL_CONTEXT (field
) != context
)
7148 cp_pedwarn ("ISO C++ does not permit `%T::%D' to be defined as `%T::%D'",
7149 DECL_CONTEXT (field
), DECL_NAME (decl
),
7150 context
, DECL_NAME (decl
));
7151 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
7153 /* Static data member are tricky; an in-class initialization
7154 still doesn't provide a definition, so the in-class
7155 declaration will have DECL_EXTERNAL set, but will have an
7156 initialization. Thus, duplicate_decls won't warn
7157 about this situation, and so we check here. */
7158 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
7159 cp_error ("duplicate initialization of %D", decl
);
7160 if (duplicate_decls (decl
, field
))
7166 tree field
= check_classfn (context
, decl
);
7167 if (field
&& duplicate_decls (decl
, field
))
7171 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
7172 DECL_IN_AGGR_P (decl
) = 0;
7173 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
7174 || CLASSTYPE_TEMPLATE_INSTANTIATION (context
))
7176 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
7177 /* [temp.expl.spec] An explicit specialization of a static data
7178 member of a template is a definition if the declaration
7179 includes an initializer; otherwise, it is a declaration.
7181 We check for processing_specialization so this only applies
7182 to the new specialization syntax. */
7183 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
7184 DECL_EXTERNAL (decl
) = 1;
7187 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
7188 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
7192 /* Enter this declaration into the symbol table. */
7193 tem
= maybe_push_decl (decl
);
7195 if (processing_template_decl
)
7196 tem
= push_template_decl (tem
);
7198 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7199 /* Tell the back-end to use or not use .common as appropriate. If we say
7200 -fconserve-space, we want this to save .data space, at the expense of
7201 wrong semantics. If we say -fno-conserve-space, we want this to
7202 produce errors about redefs; to do this we force variables into the
7204 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
7207 if (! processing_template_decl
)
7217 tree type
= TREE_TYPE (decl
);
7218 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
7220 if (type
== error_mark_node
)
7223 maybe_push_cleanup_level (type
);
7226 /* Is it valid for this decl to have an initializer at all?
7227 If not, set INITIALIZED to zero, which will indirectly
7228 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7230 /* Don't allow initializations for incomplete types except for
7231 arrays which might be completed by the initialization. */
7232 if (COMPLETE_TYPE_P (complete_type (type
)))
7233 ; /* A complete type is ok. */
7234 else if (TREE_CODE (type
) != ARRAY_TYPE
)
7236 cp_error ("variable `%#D' has initializer but incomplete type",
7239 type
= TREE_TYPE (decl
) = error_mark_node
;
7241 else if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (type
))))
7243 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
7244 cp_error ("elements of array `%#D' have incomplete type", decl
);
7245 /* else we already gave an error in start_decl. */
7251 && TREE_CODE (decl
) != TYPE_DECL
7252 && TREE_CODE (decl
) != TEMPLATE_DECL
7253 && type
!= error_mark_node
7254 && IS_AGGR_TYPE (type
)
7255 && ! DECL_EXTERNAL (decl
))
7257 if ((! processing_template_decl
|| ! uses_template_parms (type
))
7258 && !COMPLETE_TYPE_P (complete_type (type
)))
7260 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
7262 /* Change the type so that assemble_variable will give
7263 DECL an rtl we can live with: (mem (const_int 0)). */
7264 type
= TREE_TYPE (decl
) = error_mark_node
;
7268 /* If any base type in the hierarchy of TYPE needs a constructor,
7269 then we set initialized to 1. This way any nodes which are
7270 created for the purposes of initializing this aggregate
7271 will live as long as it does. This is necessary for global
7272 aggregates which do not have their initializers processed until
7273 the end of the file. */
7274 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
7279 DECL_INITIAL (decl
) = NULL_TREE
;
7282 /* Handle initialization of references.
7283 These three arguments are from `cp_finish_decl', and have the
7284 same meaning here that they do there.
7286 Quotes on semantics can be found in ARM 8.4.3. */
7289 grok_reference_init (decl
, type
, init
)
7290 tree decl
, type
, init
;
7294 if (init
== NULL_TREE
)
7296 if ((DECL_LANG_SPECIFIC (decl
) == 0
7297 || DECL_IN_AGGR_P (decl
) == 0)
7298 && ! DECL_THIS_EXTERN (decl
))
7299 cp_error ("`%D' declared as reference but not initialized", decl
);
7303 if (init
== error_mark_node
)
7306 if (TREE_CODE (init
) == CONSTRUCTOR
)
7308 cp_error ("ISO C++ forbids use of initializer list to initialize reference `%D'", decl
);
7312 if (TREE_CODE (init
) == TREE_LIST
)
7313 init
= build_compound_expr (init
);
7315 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
7316 init
= convert_from_reference (init
);
7318 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
7319 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
7321 /* Note: default conversion is only called in very special cases. */
7322 init
= default_conversion (init
);
7325 /* Convert INIT to the reference type TYPE. This may involve the
7326 creation of a temporary, whose lifetime must be the same as that
7327 of the reference. If so, a DECL_STMT for the temporary will be
7328 added just after the DECL_STMT for DECL. That's why we don't set
7329 DECL_INITIAL for local references (instead assigning to them
7330 explicitly); we need to allow the temporary to be initialized
7332 tmp
= convert_to_reference
7333 (type
, init
, CONV_IMPLICIT
,
7334 LOOKUP_ONLYCONVERTING
|LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
,
7337 if (tmp
== error_mark_node
)
7339 else if (tmp
!= NULL_TREE
)
7342 tmp
= save_expr (tmp
);
7343 if (building_stmt_tree ())
7345 /* Initialize the declaration. */
7346 tmp
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, tmp
);
7347 finish_expr_stmt (tmp
);
7350 DECL_INITIAL (decl
) = tmp
;
7354 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7358 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
7360 expand_static_init (decl
, DECL_INITIAL (decl
));
7361 DECL_INITIAL (decl
) = NULL_TREE
;
7366 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7367 mucking with forces it does not comprehend (i.e. initialization with a
7368 constructor). If we are at global scope and won't go into COMMON, fill
7369 it in with a dummy CONSTRUCTOR to force the variable into .data;
7370 otherwise we can use error_mark_node. */
7373 obscure_complex_init (decl
, init
)
7376 if (! flag_no_inline
&& TREE_STATIC (decl
))
7378 if (extract_init (decl
, init
))
7382 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7383 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7384 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7388 DECL_INITIAL (decl
) = error_mark_node
;
7393 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7394 array until we finish parsing the initializer. If that's the
7395 situation we're in, update DECL accordingly. */
7398 maybe_deduce_size_from_array_init (decl
, init
)
7402 tree type
= TREE_TYPE (decl
);
7404 if (TREE_CODE (type
) == ARRAY_TYPE
7405 && TYPE_DOMAIN (type
) == NULL_TREE
7406 && TREE_CODE (decl
) != TYPE_DECL
)
7408 /* do_default is really a C-ism to deal with tentative definitions.
7409 But let's leave it here to ease the eventual merge. */
7410 int do_default
= !DECL_EXTERNAL (decl
);
7411 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7412 int failure
= complete_array_type (type
, initializer
, do_default
);
7415 cp_error ("initializer fails to determine size of `%D'", decl
);
7420 cp_error ("array size missing in `%D'", decl
);
7421 /* If a `static' var's size isn't known, make it extern as
7422 well as static, so it does not get allocated. If it's not
7423 `static', then don't mark it extern; finish_incomplete_decl
7424 will give it a default size and it will get allocated. */
7425 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7426 DECL_EXTERNAL (decl
) = 1;
7429 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7430 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7432 cp_error ("zero-size array `%D'", decl
);
7434 layout_decl (decl
, 0);
7438 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7439 any appropriate error messages regarding the layout. */
7442 layout_var_decl (decl
)
7445 tree type
= TREE_TYPE (decl
);
7447 tree ttype
= target_type (type
);
7450 /* If we haven't already layed out this declaration, do so now.
7451 Note that we must not call complete type for an external object
7452 because it's type might involve templates that we are not
7453 supposed to isntantiate yet. (And it's perfectly legal to say
7454 `extern X x' for some incomplete type `X'.) */
7455 if (!DECL_EXTERNAL (decl
))
7456 complete_type (type
);
7457 if (!DECL_SIZE (decl
) && COMPLETE_TYPE_P (type
))
7458 layout_decl (decl
, 0);
7460 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7462 /* An automatic variable with an incomplete type: that is an error.
7463 Don't talk about array types here, since we took care of that
7464 message in grokdeclarator. */
7465 cp_error ("storage size of `%D' isn't known", decl
);
7466 TREE_TYPE (decl
) = error_mark_node
;
7469 /* Keep this code around in case we later want to control debug info
7470 based on whether a type is "used". (jason 1999-11-11) */
7472 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7473 /* Let debugger know it should output info for this type. */
7474 note_debug_info_needed (ttype
);
7476 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7477 note_debug_info_needed (DECL_CONTEXT (decl
));
7480 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7481 && DECL_SIZE (decl
) != NULL_TREE
7482 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7484 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7485 constant_expression_warning (DECL_SIZE (decl
));
7487 cp_error ("storage size of `%D' isn't constant", decl
);
7491 /* If a local static variable is declared in an inline function, or if
7492 we have a weak definition, we must endeavor to create only one
7493 instance of the variable at link-time. */
7496 maybe_commonize_var (decl
)
7499 /* Static data in a function with comdat linkage also has comdat
7501 if (TREE_STATIC (decl
)
7502 /* Don't mess with __FUNCTION__. */
7503 && ! DECL_ARTIFICIAL (decl
)
7504 && current_function_decl
7505 && DECL_CONTEXT (decl
) == current_function_decl
7506 && (DECL_THIS_INLINE (current_function_decl
)
7507 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7508 && TREE_PUBLIC (current_function_decl
))
7510 /* Rather than try to get this right with inlining, we suppress
7511 inlining of such functions. */
7512 current_function_cannot_inline
7513 = "function with static variable cannot be inline";
7514 DECL_UNINLINABLE (current_function_decl
) = 1;
7516 /* If flag_weak, we don't need to mess with this, as we can just
7517 make the function weak, and let it refer to its unique local
7518 copy. This works because we don't allow the function to be
7522 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7524 TREE_PUBLIC (decl
) = 1;
7525 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7527 else if (DECL_INITIAL (decl
) == NULL_TREE
7528 || DECL_INITIAL (decl
) == error_mark_node
)
7530 TREE_PUBLIC (decl
) = 1;
7531 DECL_COMMON (decl
) = 1;
7533 /* else we lose. We can only do this if we can use common,
7534 which we can't if it has been initialized. */
7536 if (TREE_PUBLIC (decl
))
7537 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
7540 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7541 cp_warning_at (" you can work around this by removing the initializer", decl
);
7545 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7546 /* Set it up again; we might have set DECL_INITIAL since the last
7548 comdat_linkage (decl
);
7551 /* Issue an error message if DECL is an uninitialized const variable. */
7554 check_for_uninitialized_const_var (decl
)
7557 tree type
= TREE_TYPE (decl
);
7559 /* ``Unless explicitly declared extern, a const object does not have
7560 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7562 if (TREE_CODE (decl
) == VAR_DECL
7563 && TREE_CODE (type
) != REFERENCE_TYPE
7564 && CP_TYPE_CONST_P (type
)
7565 && !TYPE_NEEDS_CONSTRUCTING (type
)
7566 && !DECL_INITIAL (decl
))
7567 cp_error ("uninitialized const `%D'", decl
);
7570 /* Verify INIT (the initializer for DECL), and record the
7571 initialization in DECL_INITIAL, if appropriate. Returns a new
7575 check_initializer (decl
, init
)
7581 if (TREE_CODE (decl
) == FIELD_DECL
)
7584 type
= TREE_TYPE (decl
);
7586 /* If `start_decl' didn't like having an initialization, ignore it now. */
7587 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7590 /* Check the initializer. */
7593 /* Things that are going to be initialized need to have complete
7595 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7597 if (type
== error_mark_node
)
7598 /* We will have already complained. */
7600 else if (COMPLETE_TYPE_P (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7602 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7605 else if (TREE_CODE (type
) == ARRAY_TYPE
7606 && !COMPLETE_TYPE_P (TREE_TYPE (type
)))
7608 cp_error ("elements of array `%#D' have incomplete type", decl
);
7611 else if (!COMPLETE_TYPE_P (type
))
7613 cp_error ("`%D' has incomplete type", decl
);
7614 TREE_TYPE (decl
) = error_mark_node
;
7619 if (TREE_CODE (decl
) == CONST_DECL
)
7621 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7623 DECL_INITIAL (decl
) = init
;
7625 my_friendly_assert (init
!= NULL_TREE
, 149);
7628 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7630 if (TREE_STATIC (decl
))
7631 make_decl_rtl (decl
, NULL_PTR
);
7632 grok_reference_init (decl
, type
, init
);
7637 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7639 if (TREE_CODE (type
) == ARRAY_TYPE
)
7640 init
= digest_init (type
, init
, (tree
*) 0);
7641 else if (TREE_CODE (init
) == CONSTRUCTOR
7642 && TREE_HAS_CONSTRUCTOR (init
))
7644 if (TYPE_NON_AGGREGATE_CLASS (type
))
7646 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7648 init
= error_mark_node
;
7651 goto dont_use_constructor
;
7656 dont_use_constructor
:
7657 if (TREE_CODE (init
) != TREE_VEC
)
7658 init
= store_init_value (decl
, init
);
7662 /* We must hide the initializer so that expand_decl
7663 won't try to do something it does not understand. */
7664 init
= obscure_complex_init (decl
, init
);
7666 else if (DECL_EXTERNAL (decl
))
7668 else if (TYPE_P (type
)
7669 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7671 tree core_type
= strip_array_types (type
);
7673 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7675 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7676 cp_error ("structure `%D' with uninitialized const members", decl
);
7677 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7678 cp_error ("structure `%D' with uninitialized reference members",
7682 check_for_uninitialized_const_var (decl
);
7684 if (COMPLETE_TYPE_P (type
) && TYPE_NEEDS_CONSTRUCTING (type
))
7685 init
= obscure_complex_init (decl
, NULL_TREE
);
7689 check_for_uninitialized_const_var (decl
);
7694 /* If DECL is not a local variable, give it RTL. */
7697 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
7700 const char *asmspec
;
7702 int toplev
= toplevel_bindings_p ();
7705 /* Handle non-variables up front. */
7706 if (TREE_CODE (decl
) != VAR_DECL
)
7708 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7712 /* If we see a class member here, it should be a static data
7714 if (DECL_LANG_SPECIFIC (decl
) && DECL_IN_AGGR_P (decl
))
7716 my_friendly_assert (TREE_STATIC (decl
), 19990828);
7717 /* An in-class declaration of a static data member should be
7718 external; it is only a declaration, and not a definition. */
7719 if (init
== NULL_TREE
)
7720 my_friendly_assert (DECL_EXTERNAL (decl
), 20000723);
7723 /* Set the DECL_ASSEMBLER_NAME for the variable. */
7725 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7727 /* We don't create any RTL for local variables. */
7728 if (DECL_FUNCTION_SCOPE_P (decl
) && !TREE_STATIC (decl
))
7731 /* We defer emission of local statics until the corresponding
7732 DECL_STMT is expanded. */
7733 defer_p
= DECL_FUNCTION_SCOPE_P (decl
) || DECL_VIRTUAL_P (decl
);
7735 /* We try to defer namespace-scope static constants so that they are
7736 not emitted into the object file unncessarily. */
7737 if (!DECL_VIRTUAL_P (decl
)
7738 && TREE_READONLY (decl
)
7739 && DECL_INITIAL (decl
) != NULL_TREE
7740 && DECL_INITIAL (decl
) != error_mark_node
7741 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
))
7743 && !TREE_PUBLIC (decl
))
7745 /* Fool with the linkage according to #pragma interface. */
7746 if (!interface_unknown
)
7748 TREE_PUBLIC (decl
) = 1;
7749 DECL_EXTERNAL (decl
) = interface_only
;
7755 /* If we're deferring the variable, just make RTL. Do not actually
7756 emit the variable. */
7758 make_decl_rtl (decl
, asmspec
);
7759 /* If we're not deferring, go ahead and assemble the variable. */
7761 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7764 /* The old ARM scoping rules injected variables declared in the
7765 initialization statement of a for-statement into the surrounding
7766 scope. We support this usage, in order to be backward-compatible.
7767 DECL is a just-declared VAR_DECL; if necessary inject its
7768 declaration into the surrounding scope. */
7771 maybe_inject_for_scope_var (decl
)
7774 if (!DECL_NAME (decl
))
7777 if (current_binding_level
->is_for_scope
)
7779 struct binding_level
*outer
7780 = current_binding_level
->level_chain
;
7782 /* Check to see if the same name is already bound at the outer
7783 level, either because it was directly declared, or because a
7784 dead for-decl got preserved. In either case, the code would
7785 not have been valid under the ARM scope rules, so clear
7786 is_for_scope for the current_binding_level.
7788 Otherwise, we need to preserve the temp slot for decl to last
7789 into the outer binding level. */
7792 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7794 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7795 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7797 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7799 BINDING_VALUE (outer_binding
)
7800 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7801 current_binding_level
->is_for_scope
= 0;
7803 else if (DECL_IN_MEMORY_P (decl
))
7804 preserve_temp_slots (DECL_RTL (decl
));
7808 /* Generate code to initialize DECL (a local variable). */
7811 initialize_local_var (decl
, init
, flags
)
7816 tree type
= TREE_TYPE (decl
);
7818 /* If the type is bogus, don't bother initializing the variable. */
7819 if (type
== error_mark_node
)
7822 if (DECL_SIZE (decl
) == NULL_TREE
&& !TREE_STATIC (decl
))
7824 /* If we used it already as memory, it must stay in memory. */
7825 DECL_INITIAL (decl
) = NULL_TREE
;
7826 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7829 /* Local statics are handled differently from ordinary automatic
7831 if (TREE_STATIC (decl
))
7833 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7834 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7835 expand_static_init (decl
, init
);
7839 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7843 /* Compute and store the initial value. */
7844 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7846 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7848 int saved_stmts_are_full_exprs_p
;
7850 my_friendly_assert (building_stmt_tree (), 20000906);
7851 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p ();
7852 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
7853 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7854 current_stmt_tree ()->stmts_are_full_exprs_p
=
7855 saved_stmts_are_full_exprs_p
;
7858 /* Set this to 0 so we can tell whether an aggregate which was
7859 initialized was ever used. Don't do this if it has a
7860 destructor, so we don't complain about the 'resource
7861 allocation is initialization' idiom. Now set
7862 attribute((unused)) on types so decls of that type will be
7863 marked used. (see TREE_USED, above.) */
7864 if (TYPE_NEEDS_CONSTRUCTING (type
)
7866 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type
)
7867 && DECL_NAME (decl
))
7868 TREE_USED (decl
) = 0;
7869 else if (already_used
)
7870 TREE_USED (decl
) = 1;
7874 /* Generate code to destroy DECL (a local variable). */
7877 destroy_local_var (decl
)
7880 tree type
= TREE_TYPE (decl
);
7883 /* Only variables get cleaned up. */
7884 if (TREE_CODE (decl
) != VAR_DECL
)
7887 /* And only things with destructors need cleaning up. */
7888 if (type
== error_mark_node
7889 || TYPE_HAS_TRIVIAL_DESTRUCTOR (type
))
7892 if (TREE_CODE (decl
) == VAR_DECL
&&
7893 (DECL_EXTERNAL (decl
) || TREE_STATIC (decl
)))
7894 /* We don't clean up things that aren't defined in this
7895 translation unit, or that need a static cleanup. The latter
7896 are handled by finish_file. */
7899 /* Compute the cleanup. */
7900 cleanup
= maybe_build_cleanup (decl
);
7902 /* Record the cleanup required for this declaration. */
7903 if (DECL_SIZE (decl
) && TREE_TYPE (decl
) != error_mark_node
7905 finish_decl_cleanup (decl
, cleanup
);
7908 /* Finish processing of a declaration;
7909 install its line number and initial value.
7910 If the length of an array type is not known before,
7911 it must be determined now, from the initial value, or it is an error.
7913 INIT holds the value of an initializer that should be allowed to escape
7916 FLAGS is LOOKUP_ONLYCONVERTING if the = init syntax was used, else 0
7917 if the (init) syntax was used. */
7920 cp_finish_decl (decl
, init
, asmspec_tree
, flags
)
7926 tree ttype
= NULL_TREE
;
7927 const char *asmspec
= NULL
;
7928 int was_readonly
= 0;
7933 error ("assignment (not initialization) in declaration");
7937 /* If a name was specified, get the string. */
7939 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
7941 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
7943 cp_error ("cannot initialize `%D' to namespace `%D'",
7948 if (current_class_type
7949 && CP_DECL_CONTEXT (decl
) == current_class_type
7950 && TYPE_BEING_DEFINED (current_class_type
)
7951 && (DECL_INITIAL (decl
) || init
))
7952 DECL_INITIALIZED_IN_CLASS_P (decl
) = 1;
7954 if (TREE_CODE (decl
) == VAR_DECL
7955 && DECL_CONTEXT (decl
)
7956 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7957 && DECL_CONTEXT (decl
) != current_namespace
7960 /* Leave the namespace of the object. */
7961 pop_decl_namespace ();
7964 type
= TREE_TYPE (decl
);
7966 if (type
== error_mark_node
)
7969 /* Add this declaration to the statement-tree. */
7970 if (building_stmt_tree ()
7971 && at_function_scope_p ()
7972 && TREE_CODE (decl
) != RESULT_DECL
)
7973 add_decl_stmt (decl
);
7975 if (TYPE_HAS_MUTABLE_P (type
))
7976 TREE_READONLY (decl
) = 0;
7978 if (processing_template_decl
)
7980 if (init
&& DECL_INITIAL (decl
))
7981 DECL_INITIAL (decl
) = init
;
7985 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
7986 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
7988 /* Take care of TYPE_DECLs up front. */
7989 if (TREE_CODE (decl
) == TYPE_DECL
)
7991 if (init
&& DECL_INITIAL (decl
))
7993 /* typedef foo = bar; store the type of bar as the type of foo. */
7994 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
7995 DECL_INITIAL (decl
) = init
= NULL_TREE
;
7997 if (type
!= error_mark_node
7998 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
8000 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
8001 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
8002 set_identifier_type_value (DECL_NAME (decl
), type
);
8003 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
8005 GNU_xref_decl (current_function_decl
, decl
);
8007 /* If we have installed this as the canonical typedef for this
8008 type, and that type has not been defined yet, delay emitting
8009 the debug information for it, as we will emit it later. */
8010 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
8011 && !COMPLETE_TYPE_P (TREE_TYPE (decl
)))
8012 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
8014 rest_of_decl_compilation (decl
, NULL_PTR
,
8015 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
8019 if (TREE_CODE (decl
) != FUNCTION_DECL
)
8020 ttype
= target_type (type
);
8022 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
8023 && TYPE_NEEDS_CONSTRUCTING (type
))
8025 /* Currently, GNU C++ puts constants in text space, making them
8026 impossible to initialize. In the future, one would hope for
8027 an operating system which understood the difference between
8028 initialization and the running of a program. */
8030 TREE_READONLY (decl
) = 0;
8033 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
8035 /* This must override the asm specifier which was placed by
8036 grokclassfn. Lay this out fresh. */
8037 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
8038 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
8039 make_decl_rtl (decl
, asmspec
);
8042 /* Deduce size of array from initialization, if not already known. */
8043 maybe_deduce_size_from_array_init (decl
, init
);
8044 init
= check_initializer (decl
, init
);
8046 GNU_xref_decl (current_function_decl
, decl
);
8048 if (TREE_CODE (decl
) == VAR_DECL
)
8049 layout_var_decl (decl
);
8051 /* Output the assembler code and/or RTL code for variables and functions,
8052 unless the type is an undefined structure or union.
8053 If not, it will get done when the type is completed. */
8054 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
8055 || TREE_CODE (decl
) == RESULT_DECL
)
8057 if (TREE_CODE (decl
) == VAR_DECL
)
8058 maybe_commonize_var (decl
);
8060 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
8062 if (TREE_CODE (type
) == FUNCTION_TYPE
8063 || TREE_CODE (type
) == METHOD_TYPE
)
8064 abstract_virtuals_error (decl
,
8065 strip_array_types (TREE_TYPE (type
)));
8067 abstract_virtuals_error (decl
, strip_array_types (type
));
8069 if (TREE_CODE (decl
) == FUNCTION_DECL
)
8071 else if (DECL_EXTERNAL (decl
)
8072 && ! (DECL_LANG_SPECIFIC (decl
)
8073 && DECL_NOT_REALLY_EXTERN (decl
)))
8076 DECL_INITIAL (decl
) = init
;
8078 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
8080 /* This is a local declaration. */
8081 if (doing_semantic_analysis_p ())
8082 maybe_inject_for_scope_var (decl
);
8083 /* Initialize the local variable. But, if we're building a
8084 statement-tree, we'll do the initialization when we
8086 if (processing_template_decl
)
8088 if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
8089 DECL_INITIAL (decl
) = init
;
8093 /* If we're not building RTL, then we need to do so
8095 my_friendly_assert (building_stmt_tree (), 20000906);
8096 /* Initialize the variable. */
8097 initialize_local_var (decl
, init
, flags
);
8098 /* Clean up the variable. */
8099 destroy_local_var (decl
);
8102 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
8104 /* Cleanups for static variables are handled by `finish_file'. */
8105 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
8106 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
8107 expand_static_init (decl
, init
);
8111 /* Undo call to `pushclass' that was done in `start_decl'
8112 due to initialization of qualified member variable.
8113 I.e., Foo::x = 10; */
8115 tree context
= CP_DECL_CONTEXT (decl
);
8118 && (TREE_CODE (decl
) == VAR_DECL
8119 /* We also have a pushclass done that we need to undo here
8120 if we're at top level and declare a method. */
8121 || TREE_CODE (decl
) == FUNCTION_DECL
)
8122 /* If size hasn't been set, we're still defining it,
8123 and therefore inside the class body; don't pop
8124 the binding level.. */
8125 && COMPLETE_TYPE_P (context
)
8126 && context
== current_class_type
)
8127 pop_nested_class ();
8134 TREE_READONLY (decl
) = 1;
8137 /* This is here for a midend callback from c-common.c */
8140 finish_decl (decl
, init
, asmspec_tree
)
8144 cp_finish_decl (decl
, init
, asmspec_tree
, 0);
8147 /* Returns a declaration for a VAR_DECL as if:
8149 extern "C" TYPE NAME;
8151 had been seen. Used to create compiler-generated global
8155 declare_global_var (name
, type
)
8161 push_to_top_level ();
8162 decl
= build_decl (VAR_DECL
, name
, type
);
8163 TREE_PUBLIC (decl
) = 1;
8164 DECL_EXTERNAL (decl
) = 1;
8165 DECL_ARTIFICIAL (decl
) = 1;
8167 cp_finish_decl (decl
, NULL_TREE
, NULL_TREE
, 0);
8168 pop_from_top_level ();
8173 /* Returns a pointer to the `atexit' function. Note that if
8174 FLAG_USE_CXA_ATEXIT is non-zero, then this will actually be the new
8175 `__cxa_atexit' function specified in the IA64 C++ ABI. */
8189 if (flag_use_cxa_atexit
)
8191 /* The declaration for `__cxa_atexit' is:
8193 int __cxa_atexit (void (*)(void *), void *, void *)
8195 We build up the argument types and then then function type
8198 /* First, build the pointer-to-function type for the first
8200 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8201 fn_type
= build_function_type (void_type_node
, arg_types
);
8202 fn_ptr_type
= build_pointer_type (fn_type
);
8203 /* Then, build the rest of the argument types. */
8204 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8205 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, arg_types
);
8206 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, arg_types
);
8207 /* And the final __cxa_atexit type. */
8208 fn_type
= build_function_type (integer_type_node
, arg_types
);
8209 fn_ptr_type
= build_pointer_type (fn_type
);
8210 name
= "__cxa_atexit";
8214 /* The declaration for `atexit' is:
8216 int atexit (void (*)());
8218 We build up the argument types and then then function type
8220 fn_type
= build_function_type (void_type_node
, void_list_node
);
8221 fn_ptr_type
= build_pointer_type (fn_type
);
8222 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, void_list_node
);
8223 /* Build the final atexit type. */
8224 fn_type
= build_function_type (integer_type_node
, arg_types
);
8228 /* Now, build the function declaration. */
8229 push_lang_context (lang_name_c
);
8230 atexit_fndecl
= build_library_fn_ptr (name
, fn_type
);
8231 mark_used (atexit_fndecl
);
8232 pop_lang_context ();
8233 atexit_node
= default_conversion (atexit_fndecl
);
8238 /* Returns the __dso_handle VAR_DECL. */
8241 get_dso_handle_node ()
8243 if (dso_handle_node
)
8244 return dso_handle_node
;
8246 /* Declare the variable. */
8247 dso_handle_node
= declare_global_var (get_identifier ("__dso_handle"),
8250 return dso_handle_node
;
8253 /* Begin a new function with internal linkage whose job will be simply
8254 to destroy some particular variable. */
8259 static int counter
= 0;
8260 int old_interface_unknown
= interface_unknown
;
8266 push_to_top_level ();
8268 /* No need to mangle this. */
8269 push_lang_context (lang_name_c
);
8271 interface_unknown
= 1;
8273 /* Build the parameter-types. */
8274 parmtypes
= void_list_node
;
8275 /* Functions passed to __cxa_atexit take an additional parameter.
8276 We'll just ignore it. After we implement the new calling
8277 convention for destructors, we can eliminate the use of
8278 additional cleanup functions entirely in the -fnew-abi case. */
8279 if (flag_use_cxa_atexit
)
8280 parmtypes
= tree_cons (NULL_TREE
, ptr_type_node
, parmtypes
);
8281 /* Build the function type itself. */
8282 fntype
= build_function_type (void_type_node
, parmtypes
);
8283 /* Build the name of the function. */
8284 sprintf (name
, "__tcf_%d", counter
++);
8285 /* Build the function declaration. */
8286 fndecl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), fntype
);
8287 /* It's a function with internal linkage, generated by the
8289 TREE_PUBLIC (fndecl
) = 0;
8290 DECL_ARTIFICIAL (fndecl
) = 1;
8291 /* Make the function `inline' so that it is only emitted if it is
8292 actually needed. It is unlikely that it will be inlined, since
8293 it is only called via a function pointer, but we avoid unncessary
8294 emissions this way. */
8295 DECL_INLINE (fndecl
) = 1;
8296 /* Build the parameter. */
8297 if (flag_use_cxa_atexit
)
8301 parmdecl
= build_decl (PARM_DECL
, NULL_TREE
, ptr_type_node
);
8302 DECL_CONTEXT (parmdecl
) = fndecl
;
8303 DECL_ARG_TYPE (parmdecl
) = ptr_type_node
;
8304 TREE_USED (parmdecl
) = 1;
8305 DECL_ARGUMENTS (fndecl
) = parmdecl
;
8309 start_function (/*specs=*/NULL_TREE
, fndecl
, NULL_TREE
, SF_PRE_PARSED
);
8312 interface_unknown
= old_interface_unknown
;
8314 pop_lang_context ();
8316 return current_function_decl
;
8319 /* Finish the cleanup function begun by start_cleanup_fn. */
8326 expand_body (finish_function (0));
8328 pop_from_top_level ();
8331 /* Generate code to handle the destruction of DECL, an object with
8332 static storage duration. */
8335 register_dtor_fn (decl
)
8343 int saved_flag_access_control
;
8345 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl
)))
8348 /* Call build_cleanup before we enter the anonymous function so that
8349 any access checks will be done relative to the current scope,
8350 rather than the scope of the anonymous function. */
8351 build_cleanup (decl
);
8353 /* Now start the function. */
8354 cleanup
= start_cleanup_fn ();
8356 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
8357 to the original function, rather than the anonymous one. That
8358 will make the back-end think that nested functions are in use,
8359 which causes confusion. */
8360 saved_flag_access_control
= flag_access_control
;
8361 flag_access_control
= 0;
8362 fcall
= build_cleanup (decl
);
8363 flag_access_control
= saved_flag_access_control
;
8365 /* Create the body of the anonymous function. */
8366 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
8367 finish_expr_stmt (fcall
);
8368 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
8371 /* Call atexit with the cleanup function. */
8372 mark_addressable (cleanup
);
8373 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
8374 if (flag_use_cxa_atexit
)
8376 args
= tree_cons (NULL_TREE
, get_dso_handle_node (), NULL_TREE
);
8377 args
= tree_cons (NULL_TREE
, null_pointer_node
, args
);
8378 args
= tree_cons (NULL_TREE
, cleanup
, args
);
8381 args
= tree_cons (NULL_TREE
, cleanup
, NULL_TREE
);
8382 finish_expr_stmt (build_function_call (get_atexit_node (), args
));
8386 expand_static_init (decl
, init
)
8390 tree oldstatic
= value_member (decl
, static_aggregates
);
8394 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
8395 cp_error ("multiple initializations given for `%D'", decl
);
8397 else if (! toplevel_bindings_p ())
8399 /* Emit code to perform this initialization but once. */
8406 /* Emit code to perform this initialization but once. This code
8409 static int guard = 0;
8411 // Do initialization.
8413 // Register variable for destruction at end of program.
8416 Note that the `temp' variable is only set to 1 *after* the
8417 initialization is complete. This ensures that an exception,
8418 thrown during the construction, will cause the variable to
8419 reinitialized when we pass through this code again, as per:
8423 If the initialization exits by throwing an exception, the
8424 initialization is not complete, so it will be tried again
8425 the next time control enters the declaration.
8427 In theory, this process should be thread-safe, too; multiple
8428 threads should not be able to initialize the variable more
8429 than once. We don't yet attempt to ensure thread-safety. */
8431 /* Create the guard variable. */
8432 guard
= get_guard (decl
);
8434 /* Begin the conditional initialization. */
8435 if_stmt
= begin_if_stmt ();
8436 finish_if_stmt_cond (get_guard_cond (guard
), if_stmt
);
8437 then_clause
= begin_compound_stmt (/*has_no_scope=*/0);
8439 /* Do the initialization itself. */
8440 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
8441 || (init
&& TREE_CODE (init
) == TREE_LIST
))
8442 assignment
= build_aggr_init (decl
, init
, 0);
8444 /* The initialization we're doing here is just a bitwise
8446 assignment
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
8448 assignment
= NULL_TREE
;
8450 /* Once the assignment is complete, set TEMP to 1. Since the
8451 construction of the static object is complete at this point,
8452 we want to make sure TEMP is set to 1 even if a temporary
8453 constructed during the initialization throws an exception
8454 when it is destroyed. So, we combine the initialization and
8455 the assignment to TEMP into a single expression, ensuring
8456 that when we call finish_expr_stmt the cleanups will not be
8457 run until after TEMP is set to 1. */
8458 guard_init
= set_guard (guard
);
8461 assignment
= tree_cons (NULL_TREE
, assignment
,
8462 build_tree_list (NULL_TREE
,
8464 assignment
= build_compound_expr (assignment
);
8467 assignment
= guard_init
;
8468 finish_expr_stmt (assignment
);
8470 /* Use atexit to register a function for destroying this static
8472 register_dtor_fn (decl
);
8474 finish_compound_stmt (/*has_no_scope=*/0, then_clause
);
8475 finish_then_clause (if_stmt
);
8479 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8482 /* Finish the declaration of a catch-parameter. */
8485 start_handler_parms (declspecs
, declarator
)
8492 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8494 if (decl
== NULL_TREE
)
8495 error ("invalid catch parameter");
8504 /* Make TYPE a complete type based on INITIAL_VALUE.
8505 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8506 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8509 complete_array_type (type
, initial_value
, do_default
)
8510 tree type
, initial_value
;
8513 register tree maxindex
= NULL_TREE
;
8518 /* An array of character type can be initialized from a
8519 brace-enclosed string constant. */
8520 if (char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (type
)))
8521 && TREE_CODE (initial_value
) == CONSTRUCTOR
8522 && CONSTRUCTOR_ELTS (initial_value
)
8523 && (TREE_CODE (TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
)))
8525 && TREE_CHAIN (CONSTRUCTOR_ELTS (initial_value
)) == NULL_TREE
)
8526 initial_value
= TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
));
8528 /* Note MAXINDEX is really the maximum index, one less than the
8530 if (TREE_CODE (initial_value
) == STRING_CST
)
8533 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8534 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8537 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8539 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8541 maxindex
= ssize_int (-1);
8542 for (; elts
; elts
= TREE_CHAIN (elts
))
8544 if (TREE_PURPOSE (elts
))
8545 maxindex
= TREE_PURPOSE (elts
);
8547 maxindex
= size_binop (PLUS_EXPR
, maxindex
, ssize_int (1));
8549 maxindex
= copy_node (maxindex
);
8553 /* Make an error message unless that happened already. */
8554 if (initial_value
!= error_mark_node
)
8557 initial_value
= NULL_TREE
;
8559 /* Prevent further error messages. */
8560 maxindex
= build_int_2 (0, 0);
8567 maxindex
= build_int_2 (0, 0);
8576 domain
= build_index_type (maxindex
);
8577 TYPE_DOMAIN (type
) = domain
;
8579 if (! TREE_TYPE (maxindex
))
8580 TREE_TYPE (maxindex
) = domain
;
8582 itype
= TREE_TYPE (initial_value
);
8585 if (itype
&& !TYPE_DOMAIN (itype
))
8586 TYPE_DOMAIN (itype
) = domain
;
8587 /* The type of the main variant should never be used for arrays
8588 of different sizes. It should only ever be completed with the
8589 size of the array. */
8590 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8591 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8594 /* Lay out the type now that we can get the real answer. */
8601 /* Return zero if something is declared to be a member of type
8602 CTYPE when in the context of CUR_TYPE. STRING is the error
8603 message to print in that case. Otherwise, quietly return 1. */
8606 member_function_or_else (ctype
, cur_type
, flags
)
8607 tree ctype
, cur_type
;
8608 enum overload_flags flags
;
8610 if (ctype
&& ctype
!= cur_type
)
8612 if (flags
== DTOR_FLAG
)
8613 cp_error ("destructor for alien class `%T' cannot be a member",
8616 cp_error ("constructor for alien class `%T' cannot be a member",
8623 /* Subroutine of `grokdeclarator'. */
8625 /* Generate errors possibly applicable for a given set of specifiers.
8626 This is for ARM $7.1.2. */
8629 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8632 int virtualp
, quals
, friendp
, raises
, inlinep
;
8635 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8637 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8639 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8642 cp_error_at ("`%D' declared as a friend", object
);
8643 if (raises
&& !TYPE_PTRFN_P (TREE_TYPE (object
))
8644 && !TYPE_PTRMEMFUNC_P (TREE_TYPE (object
)))
8645 cp_error_at ("`%D' declared with an exception specification", object
);
8648 /* CTYPE is class type, or null if non-class.
8649 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8651 DECLARATOR is the function's name.
8652 VIRTUALP is truthvalue of whether the function is virtual or not.
8653 FLAGS are to be passed through to `grokclassfn'.
8654 QUALS are qualifiers indicating whether the function is `const'
8656 RAISES is a list of exceptions that this function can raise.
8657 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8658 not look, and -1 if we should not call `grokclassfn' at all.
8660 Returns `NULL_TREE' if something goes wrong, after issuing
8661 applicable error messages. */
8664 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8665 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8666 template_count
, in_namespace
)
8669 tree orig_declarator
;
8671 enum overload_flags flags
;
8673 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8677 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8678 int has_default_arg
= 0;
8682 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8683 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8689 type
= build_exception_variant (type
, raises
);
8692 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8693 /* Propagate volatile out from type to decl. */
8694 if (TYPE_VOLATILE (type
))
8695 TREE_THIS_VOLATILE (decl
) = 1;
8697 /* If this decl has namespace scope, set that up. */
8699 set_decl_namespace (decl
, in_namespace
, friendp
);
8701 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8703 /* `main' and builtins have implicit 'C' linkage. */
8704 if ((MAIN_NAME_P (declarator
)
8705 || (IDENTIFIER_LENGTH (declarator
) > 10
8706 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8707 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8708 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8709 && current_lang_name
== lang_name_cplusplus
8710 && ctype
== NULL_TREE
8711 /* NULL_TREE means global namespace. */
8712 && DECL_CONTEXT (decl
) == NULL_TREE
)
8713 DECL_LANGUAGE (decl
) = lang_c
;
8715 /* Should probably propagate const out from type to decl I bet (mrs). */
8718 DECL_STATIC_FUNCTION_P (decl
) = 1;
8719 DECL_CONTEXT (decl
) = ctype
;
8723 DECL_CONTEXT (decl
) = ctype
;
8725 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8727 if (processing_template_decl
)
8728 error ("cannot declare `::main' to be a template");
8730 error ("cannot declare `::main' to be inline");
8732 error ("cannot declare `::main' to be static");
8733 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
8735 error ("`main' must return `int'");
8740 /* Members of anonymous types and local classes have no linkage; make
8742 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8743 || decl_function_context (TYPE_MAIN_DECL (ctype
))))
8748 /* [basic.link]: A name with no linkage (notably, the name of a class
8749 or enumeration declared in a local scope) shall not be used to
8750 declare an entity with linkage.
8752 Only check this for public decls for now. */
8753 t
= no_linkage_check (TREE_TYPE (decl
));
8756 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8758 if (DECL_EXTERN_C_P (decl
))
8759 /* Allow this; it's pretty common in C. */;
8761 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8765 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8770 TREE_PUBLIC (decl
) = publicp
;
8773 DECL_INTERFACE_KNOWN (decl
) = 1;
8774 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8778 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8780 DECL_EXTERNAL (decl
) = 1;
8781 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8783 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8784 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8788 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8789 grok_op_properties (decl
, virtualp
, check
< 0);
8791 if (ctype
&& decl_function_context (decl
))
8792 DECL_NO_STATIC_CHAIN (decl
) = 1;
8794 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8795 if (TREE_PURPOSE (t
)
8796 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8798 has_default_arg
= 1;
8803 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8807 ("defining explicit specialization `%D' in friend declaration",
8811 tree fns
= TREE_OPERAND (orig_declarator
, 0);
8812 tree args
= TREE_OPERAND (orig_declarator
, 1);
8814 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8816 /* Something like `template <class T> friend void f<T>()'. */
8817 cp_error ("invalid use of template-id `%D' in declaration of primary template",
8823 /* A friend declaration of the form friend void f<>(). Record
8824 the information in the TEMPLATE_ID_EXPR. */
8825 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8827 if (TREE_CODE (fns
) == COMPONENT_REF
)
8829 /* Due to bison parser ickiness, we will have already looked
8830 up an operator_name or PFUNCNAME within the current class
8831 (see template_id in parse.y). If the current class contains
8832 such a name, we'll get a COMPONENT_REF here. Undo that. */
8834 my_friendly_assert (TREE_TYPE (TREE_OPERAND (fns
, 0))
8835 == current_class_type
, 20001120);
8836 fns
= TREE_OPERAND (fns
, 1);
8838 my_friendly_assert (TREE_CODE (fns
) == IDENTIFIER_NODE
8839 || TREE_CODE (fns
) == LOOKUP_EXPR
8840 || TREE_CODE (fns
) == OVERLOAD
, 20001120);
8841 DECL_TEMPLATE_INFO (decl
) = tree_cons (fns
, args
, NULL_TREE
);
8843 if (has_default_arg
)
8845 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8852 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8859 if (has_default_arg
)
8860 add_defarg_fn (decl
);
8862 /* Plain overloading: will not be grok'd by grokclassfn. */
8863 if (! ctype
&& ! processing_template_decl
8864 && (! DECL_EXTERN_C_P (decl
) || DECL_OVERLOADED_OPERATOR_P (decl
))
8865 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8866 set_mangled_name_for_decl (decl
);
8869 /* Make the init_value nonzero so pushdecl knows this is not
8870 tentative. error_mark_node is replaced later with the BLOCK. */
8871 DECL_INITIAL (decl
) = error_mark_node
;
8873 if (TYPE_NOTHROW_P (type
) || nothrow_libfn_p (decl
))
8874 TREE_NOTHROW (decl
) = 1;
8876 /* Caller will do the rest of this. */
8880 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8881 DECL_CONSTRUCTOR_P (decl
) = 1;
8883 /* Function gets the ugly name, field gets the nice one. This call
8884 may change the type of the function (because of default
8886 if (ctype
!= NULL_TREE
)
8887 grokclassfn (ctype
, decl
, flags
, quals
);
8889 decl
= check_explicit_specialization (orig_declarator
, decl
,
8891 2 * (funcdef_flag
!= 0) +
8892 4 * (friendp
!= 0));
8893 if (decl
== error_mark_node
)
8896 if (ctype
!= NULL_TREE
8897 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8902 old_decl
= check_classfn (ctype
, decl
);
8904 if (old_decl
&& TREE_CODE (old_decl
) == TEMPLATE_DECL
)
8905 /* Because grokfndecl is always supposed to return a
8906 FUNCTION_DECL, we pull out the DECL_TEMPLATE_RESULT
8907 here. We depend on our callers to figure out that its
8908 really a template that's being returned. */
8909 old_decl
= DECL_TEMPLATE_RESULT (old_decl
);
8911 if (old_decl
&& DECL_STATIC_FUNCTION_P (old_decl
)
8912 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8914 /* Remove the `this' parm added by grokclassfn.
8915 XXX Isn't this done in start_function, too? */
8916 revert_static_member_fn (decl
);
8917 last_function_parms
= TREE_CHAIN (last_function_parms
);
8919 if (old_decl
&& DECL_ARTIFICIAL (old_decl
))
8920 cp_error ("definition of implicitly-declared `%D'", old_decl
);
8924 /* Since we've smashed OLD_DECL to its
8925 DECL_TEMPLATE_RESULT, we must do the same to DECL. */
8926 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
8927 decl
= DECL_TEMPLATE_RESULT (decl
);
8929 /* Attempt to merge the declarations. This can fail, in
8930 the case of some illegal specialization declarations. */
8931 if (!duplicate_decls (decl
, old_decl
))
8932 cp_error ("no `%#D' member function declared in class `%T'",
8938 if (DECL_CONSTRUCTOR_P (decl
) && !grok_ctor_properties (ctype
, decl
))
8941 if (ctype
== NULL_TREE
|| check
)
8945 DECL_VIRTUAL_P (decl
) = 1;
8951 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
8954 RID_BIT_TYPE
*specbits_in
;
8960 RID_BIT_TYPE specbits
;
8962 specbits
= *specbits_in
;
8964 if (TREE_CODE (type
) == OFFSET_TYPE
)
8966 /* If you declare a static member so that it
8967 can be initialized, the code will reach here. */
8968 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
8969 type
= TREE_TYPE (type
);
8970 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8971 DECL_CONTEXT (decl
) = basetype
;
8972 /* DECL_ASSEMBLER_NAME is needed only for full-instantiated
8974 if (!uses_template_parms (decl
))
8975 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
8982 context
= in_namespace
;
8983 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
8984 context
= current_namespace
;
8986 context
= NULL_TREE
;
8988 if (processing_template_decl
&& context
)
8989 /* For global variables, declared in a template, we need the
8991 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8993 decl
= build_decl (VAR_DECL
, declarator
, type
);
8996 set_decl_namespace (decl
, context
, 0);
8998 context
= DECL_CONTEXT (decl
);
8999 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
9000 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
9004 set_decl_namespace (decl
, in_namespace
, 0);
9006 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
9008 DECL_THIS_EXTERN (decl
) = 1;
9009 DECL_EXTERNAL (decl
) = !initialized
;
9012 /* In class context, static means one per class,
9013 public access, and static storage. */
9014 if (DECL_CLASS_SCOPE_P (decl
))
9016 TREE_PUBLIC (decl
) = 1;
9017 TREE_STATIC (decl
) = 1;
9018 DECL_EXTERNAL (decl
) = 0;
9020 /* At top level, either `static' or no s.c. makes a definition
9021 (perhaps tentative), and absence of `static' makes it public. */
9022 else if (toplevel_bindings_p ())
9024 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
9025 && (DECL_THIS_EXTERN (decl
) || ! constp
));
9026 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
9028 /* Not at top level, only `static' makes a static definition. */
9031 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
9032 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
9035 if (TREE_PUBLIC (decl
))
9037 /* [basic.link]: A name with no linkage (notably, the name of a class
9038 or enumeration declared in a local scope) shall not be used to
9039 declare an entity with linkage.
9041 Only check this for public decls for now. */
9042 tree t
= no_linkage_check (TREE_TYPE (decl
));
9045 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
9046 /* Ignore for now; `enum { foo } e' is pretty common. */;
9048 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
9056 /* Create and return a canonical pointer to member function type, for
9057 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
9060 build_ptrmemfunc_type (type
)
9065 tree unqualified_variant
= NULL_TREE
;
9067 if (type
== error_mark_node
)
9070 /* If a canonical type already exists for this type, use it. We use
9071 this method instead of type_hash_canon, because it only does a
9072 simple equality check on the list of field members. */
9074 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
9077 /* Make sure that we always have the unqualified pointer-to-member
9079 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9081 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
9083 t
= make_aggr_type (RECORD_TYPE
);
9084 /* Let the front-end know this is a pointer to member function... */
9085 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
9086 /* ... and not really an aggregate. */
9087 SET_IS_AGGR_TYPE (t
, 0);
9089 fields
[0] = build_decl (FIELD_DECL
, pfn_identifier
, type
);
9090 fields
[1] = build_decl (FIELD_DECL
, delta_identifier
,
9092 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9094 /* Zap out the name so that the back-end will give us the debugging
9095 information for this anonymous RECORD_TYPE. */
9096 TYPE_NAME (t
) = NULL_TREE
;
9098 /* If this is not the unqualified form of this pointer-to-member
9099 type, set the TYPE_MAIN_VARIANT for this type to be the
9100 unqualified type. Since they are actually RECORD_TYPEs that are
9101 not variants of each other, we must do this manually. */
9102 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9104 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
9105 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
9106 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
9107 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
9110 /* Cache this pointer-to-member type so that we can find it again
9112 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
9114 /* Seems to be wanted. */
9115 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
9120 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
9121 Check to see that the definition is valid. Issue appropriate error
9122 messages. Return 1 if the definition is particularly bad, or 0
9126 check_static_variable_definition (decl
, type
)
9130 /* Motion 10 at San Diego: If a static const integral data member is
9131 initialized with an integral constant expression, the initializer
9132 may appear either in the declaration (within the class), or in
9133 the definition, but not both. If it appears in the class, the
9134 member is a member constant. The file-scope definition is always
9136 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
9138 cp_error ("invalid in-class initialization of static data member of non-integral type `%T'",
9140 /* If we just return the declaration, crashes will sometimes
9141 occur. We therefore return void_type_node, as if this was a
9142 friend declaration, to cause callers to completely ignore
9143 this declaration. */
9146 else if (!CP_TYPE_CONST_P (type
))
9147 cp_error ("ISO C++ forbids in-class initialization of non-const static member `%D'",
9149 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
9150 cp_pedwarn ("ISO C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
9155 /* Given the SIZE (i.e., number of elements) in an array, compute an
9156 appropriate index type for the array. If non-NULL, NAME is the
9157 name of the thing being declared. */
9160 compute_array_index_type (name
, size
)
9166 /* The size might be the result of a cast. */
9167 STRIP_TYPE_NOPS (size
);
9169 /* It might be a const variable or enumeration constant. */
9170 size
= decl_constant_value (size
);
9172 /* If this involves a template parameter, it will be a constant at
9173 instantiation time, but we don't know what the value is yet.
9174 Even if no template parameters are involved, we may an expression
9175 that is not a constant; we don't even simplify `1 + 2' when
9176 processing a template. */
9177 if (processing_template_decl
)
9179 /* Resolve a qualified reference to an enumerator or static
9180 const data member of ours. */
9181 if (TREE_CODE (size
) == SCOPE_REF
9182 && TREE_OPERAND (size
, 0) == current_class_type
)
9184 tree t
= lookup_field (current_class_type
,
9185 TREE_OPERAND (size
, 1), 0, 0);
9190 return build_index_type (build_min (MINUS_EXPR
, sizetype
,
9191 size
, integer_one_node
));
9194 /* The array bound must be an integer type. */
9195 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9196 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
9197 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
9200 cp_error ("size of array `%D' has non-integer type", name
);
9202 cp_error ("size of array has non-integer type");
9203 size
= integer_one_node
;
9206 /* Normally, the array-bound will be a constant. */
9207 if (TREE_CODE (size
) == INTEGER_CST
)
9209 /* Check to see if the array bound overflowed. Make that an
9210 error, no matter how generous we're being. */
9211 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9212 int old_pedantic
= pedantic
;
9213 pedantic
= flag_pedantic_errors
= 1;
9214 constant_expression_warning (size
);
9215 pedantic
= old_pedantic
;
9216 flag_pedantic_errors
= old_flag_pedantic_errors
;
9218 /* An array must have a positive number of elements. */
9219 if (INT_CST_LT (size
, integer_zero_node
))
9222 cp_error ("size of array `%D' is negative", name
);
9224 cp_error ("size of array is negative");
9225 size
= integer_one_node
;
9227 /* Except that an extension we allow zero-sized arrays. We
9228 always allow them in system headers because glibc uses
9230 else if (integer_zerop (size
) && pedantic
&& !in_system_header
)
9233 cp_pedwarn ("ISO C++ forbids zero-size array `%D'", name
);
9235 cp_pedwarn ("ISO C++ forbids zero-size array");
9238 else if (TREE_CONSTANT (size
))
9240 /* `(int) &fn' is not a valid array bound. */
9242 cp_error ("size of array `%D' is not an integral constant-expression",
9245 cp_error ("size of array is not an integral constant-expression");
9248 /* Compute the index of the largest element in the array. It is
9249 one less than the number of elements in the array. */
9251 = fold (cp_build_binary_op (MINUS_EXPR
,
9252 cp_convert (ssizetype
, size
),
9253 cp_convert (ssizetype
,
9254 integer_one_node
)));
9256 /* Check for variable-sized arrays. We allow such things as an
9257 extension, even though they are not allowed in ANSI/ISO C++. */
9258 if (!TREE_CONSTANT (itype
))
9263 cp_pedwarn ("ISO C++ forbids variable-size array `%D'",
9266 cp_pedwarn ("ISO C++ forbids variable-size array");
9269 /* Create a variable-sized array index type. */
9270 itype
= variable_size (itype
);
9272 /* Make sure that there was no overflow when creating to a signed
9273 index type. (For example, on a 32-bit machine, an array with
9274 size 2^32 - 1 is too big.) */
9275 else if (TREE_OVERFLOW (itype
))
9277 error ("overflow in array dimension");
9278 TREE_OVERFLOW (itype
) = 0;
9281 /* Create and return the appropriate index type. */
9282 return build_index_type (itype
);
9285 /* Returns an ARRAY_TYPE for an array with SIZE elements of the
9286 indicated TYPE. If non-NULL, NAME is the NAME of the declaration
9290 create_array_type_for_decl (name
, type
, size
)
9295 tree itype
= NULL_TREE
;
9296 const char* error_msg
;
9298 /* If things have already gone awry, bail now. */
9299 if (type
== error_mark_node
|| size
== error_mark_node
)
9300 return error_mark_node
;
9302 /* Assume that everything will go OK. */
9305 /* There are some types which cannot be array elements. */
9306 switch (TREE_CODE (type
))
9309 error_msg
= "array of void";
9313 error_msg
= "array of functions";
9316 case REFERENCE_TYPE
:
9317 error_msg
= "array of references";
9321 error_msg
= "array of data members";
9325 error_msg
= "array of function members";
9332 /* If something went wrong, issue an error-message and return. */
9336 cp_error ("declaration of `%D' as %s", name
, error_msg
);
9338 cp_error ("creating %s", error_msg
);
9340 return error_mark_node
;
9345 The constant expressions that specify the bounds of the arrays
9346 can be omitted only for the first member of the sequence. */
9347 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9349 cp_error ("declaration of `%D' as multidimensional array must have bounds for all dimensions except the first",
9352 return error_mark_node
;
9355 /* Figure out the index type for the array. */
9357 itype
= compute_array_index_type (name
, size
);
9359 return build_cplus_array_type (type
, itype
);
9362 /* Check that it's OK to declare a function with the indicated TYPE.
9363 SFK indicates the kind of special function (if any) that this
9364 function is. OPTYPE is the type given in a conversion operator
9365 declaration. Returns the actual return type of the function; that
9366 may be different than TYPE if an error occurs, or for certain
9367 special functions. */
9370 check_special_function_return_type (sfk
, type
, optype
)
9371 special_function_kind sfk
;
9377 case sfk_constructor
:
9379 cp_error ("return type specification for constructor invalid");
9381 /* In the new ABI constructors do not return a value. */
9382 type
= void_type_node
;
9385 case sfk_destructor
:
9387 cp_error ("return type specification for destructor invalid");
9388 type
= void_type_node
;
9391 case sfk_conversion
:
9392 if (type
&& !same_type_p (type
, optype
))
9393 cp_error ("operator `%T' declared to return `%T'", optype
, type
);
9395 cp_pedwarn ("return type specified for `operator %T'", optype
);
9400 my_friendly_abort (20000408);
9407 /* Given declspecs and a declarator,
9408 determine the name and type of the object declared
9409 and construct a ..._DECL node for it.
9410 (In one case we can return a ..._TYPE node instead.
9411 For invalid input we sometimes return 0.)
9413 DECLSPECS is a chain of tree_list nodes whose value fields
9414 are the storage classes and type specifiers.
9416 DECL_CONTEXT says which syntactic context this declaration is in:
9417 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
9418 FUNCDEF for a function definition. Like NORMAL but a few different
9419 error messages in each case. Return value may be zero meaning
9420 this definition is too screwy to try to parse.
9421 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
9422 handle member functions (which have FIELD context).
9423 Return value may be zero meaning this definition is too screwy to
9425 PARM for a parameter declaration (either within a function prototype
9426 or before a function body). Make a PARM_DECL, or return void_type_node.
9427 CATCHPARM for a parameter declaration before a catch clause.
9428 TYPENAME if for a typename (in a cast or sizeof).
9429 Don't make a DECL node; just return the ..._TYPE node.
9430 FIELD for a struct or union field; make a FIELD_DECL.
9431 BITFIELD for a field with specified width.
9432 INITIALIZED is 1 if the decl has an initializer.
9434 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
9435 normal attributes in TREE_PURPOSE, or NULL_TREE.
9437 In the TYPENAME case, DECLARATOR is really an abstract declarator.
9438 It may also be so in the PARM case, for a prototype where the
9439 argument type is specified but not the name.
9441 This function is where the complicated C meanings of `static'
9442 and `extern' are interpreted.
9444 For C++, if there is any monkey business to do, the function which
9445 calls this one must do it, i.e., prepending instance variables,
9446 renaming overloaded function names, etc.
9448 Note that for this C++, it is an error to define a method within a class
9449 which does not belong to that class.
9451 Except in the case where SCOPE_REFs are implicitly known (such as
9452 methods within a class being redundantly qualified),
9453 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
9454 (class_name::decl_name). The caller must also deal with this.
9456 If a constructor or destructor is seen, and the context is FIELD,
9457 then the type gains the attribute TREE_HAS_x. If such a declaration
9458 is erroneous, NULL_TREE is returned.
9460 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
9461 function, these are the qualifiers to give to the `this' pointer. We
9462 apply TYPE_QUAL_RESTRICT to the this ptr, not the object.
9464 May return void_type_node if the declarator turned out to be a friend.
9465 See grokfield for details. */
9468 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
9471 enum decl_context decl_context
;
9475 RID_BIT_TYPE specbits
;
9478 tree type
= NULL_TREE
;
9484 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
9485 int explicit_int
= 0;
9486 int explicit_char
= 0;
9487 int defaulted_int
= 0;
9488 tree typedef_decl
= NULL_TREE
;
9490 tree typedef_type
= NULL_TREE
;
9491 int funcdef_flag
= 0;
9492 enum tree_code innermost_code
= ERROR_MARK
;
9495 /* See the code below that used this. */
9496 tree decl_machine_attr
= NULL_TREE
;
9498 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
9499 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
9500 tree init
= NULL_TREE
;
9502 /* Keep track of what sort of function is being processed
9503 so that we can warn about default return values, or explicit
9504 return values which do not match prescribed defaults. */
9505 special_function_kind sfk
= sfk_none
;
9507 tree dname
= NULL_TREE
;
9508 tree ctype
= current_class_type
;
9509 tree ctor_return_type
= NULL_TREE
;
9510 enum overload_flags flags
= NO_SPECIAL
;
9511 tree quals
= NULL_TREE
;
9512 tree raises
= NULL_TREE
;
9513 int template_count
= 0;
9514 tree in_namespace
= NULL_TREE
;
9518 RIDBIT_RESET_ALL (specbits
);
9519 if (decl_context
== FUNCDEF
)
9520 funcdef_flag
= 1, decl_context
= NORMAL
;
9521 else if (decl_context
== MEMFUNCDEF
)
9522 funcdef_flag
= -1, decl_context
= FIELD
;
9523 else if (decl_context
== BITFIELD
)
9524 bitfield
= 1, decl_context
= FIELD
;
9526 /* Look inside a declarator for the name being declared
9527 and get it as a string, for an error message. */
9529 tree
*next
= &declarator
;
9533 while (next
&& *next
)
9536 switch (TREE_CODE (decl
))
9539 /* For attributes. */
9540 next
= &TREE_VALUE (decl
);
9545 next
= &TREE_OPERAND (decl
, 0);
9548 case BIT_NOT_EXPR
: /* For C++ destructors! */
9550 tree name
= TREE_OPERAND (decl
, 0);
9551 tree rename
= NULL_TREE
;
9553 my_friendly_assert (flags
== NO_SPECIAL
, 152);
9555 sfk
= sfk_destructor
;
9556 if (TREE_CODE (name
) == TYPE_DECL
)
9557 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
9558 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
9559 if (ctype
== NULL_TREE
)
9561 if (current_class_type
== NULL_TREE
)
9563 error ("destructors must be member functions");
9568 tree t
= constructor_name (current_class_name
);
9575 tree t
= constructor_name (ctype
);
9582 cp_error ("destructor `%T' must match class name `%T'",
9584 TREE_OPERAND (decl
, 0) = rename
;
9590 case ADDR_EXPR
: /* C++ reference declaration */
9595 innermost_code
= TREE_CODE (decl
);
9596 next
= &TREE_OPERAND (decl
, 0);
9600 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
9602 /* This is actually a variable declaration using
9603 constructor syntax. We need to call start_decl and
9604 cp_finish_decl so we can get the variable
9607 tree attributes
, prefix_attributes
;
9609 *next
= TREE_OPERAND (decl
, 0);
9610 init
= CALL_DECLARATOR_PARMS (decl
);
9614 attributes
= TREE_PURPOSE (attrlist
);
9615 prefix_attributes
= TREE_VALUE (attrlist
);
9619 attributes
= NULL_TREE
;
9620 prefix_attributes
= NULL_TREE
;
9623 decl
= start_decl (declarator
, declspecs
, 1,
9624 attributes
, prefix_attributes
);
9625 decl_type_access_control (decl
);
9628 /* Look for __unused__ attribute */
9629 if (TREE_USED (TREE_TYPE (decl
)))
9630 TREE_USED (decl
) = 1;
9631 finish_decl (decl
, init
, NULL_TREE
);
9634 cp_error ("invalid declarator");
9637 innermost_code
= TREE_CODE (decl
);
9638 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
9639 ctype
= current_class_type
;
9641 && TREE_OPERAND (decl
, 0)
9642 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
9643 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
9644 == constructor_name_full (ctype
))
9645 || (DECL_NAME (TREE_OPERAND (decl
, 0))
9646 == constructor_name (ctype
)))))
9647 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9648 next
= &TREE_OPERAND (decl
, 0);
9650 if (ctype
!= NULL_TREE
9651 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
9652 && decl
== constructor_name (ctype
))
9654 sfk
= sfk_constructor
;
9655 ctor_return_type
= ctype
;
9660 case TEMPLATE_ID_EXPR
:
9662 tree fns
= TREE_OPERAND (decl
, 0);
9664 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9665 fns
= TREE_OPERAND (fns
, 0);
9668 if (TREE_CODE (dname
) == COMPONENT_REF
)
9669 dname
= TREE_OPERAND (dname
, 1);
9670 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9672 my_friendly_assert (is_overloaded_fn (dname
),
9674 dname
= DECL_NAME (get_first_fn (dname
));
9679 case IDENTIFIER_NODE
:
9680 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9685 if (C_IS_RESERVED_WORD (dname
))
9687 cp_error ("declarator-id missing; using reserved word `%D'",
9689 name
= IDENTIFIER_POINTER (dname
);
9691 else if (!IDENTIFIER_TYPENAME_P (dname
))
9692 name
= IDENTIFIER_POINTER (dname
);
9695 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9696 flags
= TYPENAME_FLAG
;
9697 ctor_return_type
= TREE_TYPE (dname
);
9698 sfk
= sfk_conversion
;
9699 if (IDENTIFIER_GLOBAL_VALUE (dname
)
9700 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (dname
))
9702 name
= IDENTIFIER_POINTER (dname
);
9704 name
= "<invalid operator>";
9711 /* Perform error checking, and decide on a ctype. */
9712 tree cname
= TREE_OPERAND (decl
, 0);
9713 if (cname
== NULL_TREE
)
9715 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9718 in_namespace
= TREE_OPERAND (decl
, 0);
9719 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9721 else if (! is_aggr_type (cname
, 1))
9722 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9723 /* Must test TREE_OPERAND (decl, 1), in case user gives
9724 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9725 else if (TREE_OPERAND (decl
, 1)
9726 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9728 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9729 || TREE_CODE (cname
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
9731 cp_error ("`%T::%D' is not a valid declarator", cname
,
9732 TREE_OPERAND (decl
, 1));
9733 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9734 cname
, TREE_OPERAND (decl
, 1));
9735 return void_type_node
;
9737 else if (ctype
== NULL_TREE
)
9739 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9740 TREE_OPERAND (decl
, 0) = ctype
;
9743 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9745 cp_error ("type `%T' is not derived from type `%T'",
9747 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9753 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9754 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9755 == constructor_name_full (ctype
))
9756 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9757 == constructor_name (ctype
))))
9758 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9759 next
= &TREE_OPERAND (decl
, 1);
9763 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9764 && constructor_name (ctype
) == decl
)
9766 sfk
= sfk_constructor
;
9767 ctor_return_type
= ctype
;
9769 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9770 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9771 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9772 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9774 sfk
= sfk_destructor
;
9775 ctor_return_type
= ctype
;
9777 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9778 next
= &TREE_OPERAND (decl
, 0);
9789 /* Parse error puts this typespec where
9790 a declarator should go. */
9791 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9792 if (TREE_TYPE (decl
) == current_class_type
)
9793 cp_error (" perhaps you want `%T' for a constructor",
9794 current_class_name
);
9795 dname
= DECL_NAME (decl
);
9796 name
= IDENTIFIER_POINTER (dname
);
9798 /* Avoid giving two errors for this. */
9799 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9801 declspecs
= tree_cons (NULL_TREE
, integer_type_node
, declspecs
);
9807 cp_compiler_error ("`%D' as declarator", decl
);
9808 return 0; /* We used to do a 155 abort here. */
9813 /* A function definition's declarator must have the form of
9814 a function declarator. */
9816 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9819 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9820 && innermost_code
!= CALL_EXPR
9821 && ! (ctype
&& declspecs
== NULL_TREE
))
9823 cp_error ("declaration of `%D' as non-function", dname
);
9824 return void_type_node
;
9827 /* Anything declared one level down from the top level
9828 must be one of the parameters of a function
9829 (because the body is at least two levels down). */
9831 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9832 by not allowing C++ class definitions to specify their parameters
9833 with xdecls (must be spec.d in the parmlist).
9835 Since we now wait to push a class scope until we are sure that
9836 we are in a legitimate method context, we must set oldcname
9837 explicitly (since current_class_name is not yet alive).
9839 We also want to avoid calling this a PARM if it is in a namespace. */
9841 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
9843 struct binding_level
*b
= current_binding_level
;
9844 current_binding_level
= b
->level_chain
;
9845 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9846 decl_context
= PARM
;
9847 current_binding_level
= b
;
9851 name
= decl_context
== PARM
? "parameter" : "type name";
9853 /* Look through the decl specs and record which ones appear.
9854 Some typespecs are defined as built-in typenames.
9855 Others, the ones that are modifiers of other types,
9856 are represented by bits in SPECBITS: set the bits for
9857 the modifiers that appear. Storage class keywords are also in SPECBITS.
9859 If there is a typedef name or a type, store the type in TYPE.
9860 This includes builtin typedefs such as `int'.
9862 Set EXPLICIT_INT if the type is `int' or `char' and did not
9863 come from a user typedef.
9865 Set LONGLONG if `long' is mentioned twice.
9867 For C++, constructors and destructors have their own fast treatment. */
9869 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
9874 /* Certain parse errors slip through. For example,
9875 `int class;' is not caught by the parser. Try
9876 weakly to recover here. */
9877 if (TREE_CODE (spec
) != TREE_LIST
)
9880 id
= TREE_VALUE (spec
);
9882 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9884 if (id
== ridpointers
[(int) RID_INT
]
9885 || id
== ridpointers
[(int) RID_CHAR
]
9886 || id
== ridpointers
[(int) RID_BOOL
]
9887 || id
== ridpointers
[(int) RID_WCHAR
])
9891 if (id
== ridpointers
[(int) RID_BOOL
])
9892 error ("`bool' is now a keyword");
9894 cp_error ("extraneous `%T' ignored", id
);
9898 if (id
== ridpointers
[(int) RID_INT
])
9900 else if (id
== ridpointers
[(int) RID_CHAR
])
9902 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
9906 /* C++ aggregate types. */
9907 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
9910 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
9912 type
= IDENTIFIER_TYPE_VALUE (id
);
9916 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
9918 if (ridpointers
[i
] == id
)
9920 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
9922 if (pedantic
&& ! in_system_header
&& warn_long_long
)
9923 pedwarn ("ISO C++ does not support `long long'");
9925 error ("`long long long' is too long for GCC");
9929 else if (RIDBIT_SETP (i
, specbits
))
9930 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
9931 RIDBIT_SET (i
, specbits
);
9936 /* C++ aggregate types. */
9937 else if (TREE_CODE (id
) == TYPE_DECL
)
9940 cp_error ("multiple declarations `%T' and `%T'", type
,
9944 type
= TREE_TYPE (id
);
9945 TREE_VALUE (spec
) = type
;
9950 error ("two or more data types in declaration of `%s'", name
);
9951 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9953 register tree t
= lookup_name (id
, 1);
9954 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
9955 error ("`%s' fails to be a typedef or built in type",
9956 IDENTIFIER_POINTER (id
));
9959 type
= TREE_TYPE (t
);
9961 /* See the code below that used this. */
9962 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
9967 else if (id
!= error_mark_node
)
9968 /* Can't change CLASS nodes into RECORD nodes here! */
9974 typedef_type
= type
;
9976 /* No type at all: default to `int', and set DEFAULTED_INT
9977 because it was not a user-defined typedef. */
9979 if (type
== NULL_TREE
9980 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
9981 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9982 || RIDBIT_SETP (RID_LONG
, specbits
)
9983 || RIDBIT_SETP (RID_SHORT
, specbits
)))
9985 /* These imply 'int'. */
9986 type
= integer_type_node
;
9990 if (sfk
!= sfk_none
)
9991 type
= check_special_function_return_type (sfk
, type
,
9993 else if (type
== NULL_TREE
)
9999 /* We handle `main' specially here, because 'main () { }' is so
10000 common. With no options, it is allowed. With -Wreturn-type,
10001 it is a warning. It is only an error with -pedantic-errors. */
10002 is_main
= (funcdef_flag
10003 && MAIN_NAME_P (dname
)
10004 && ctype
== NULL_TREE
10005 && in_namespace
== NULL_TREE
10006 && current_namespace
== global_namespace
);
10008 if (in_system_header
|| flag_ms_extensions
)
10009 /* Allow it, sigh. */;
10010 else if (pedantic
|| ! is_main
)
10011 cp_pedwarn ("ISO C++ forbids declaration of `%s' with no type",
10013 else if (warn_return_type
)
10014 cp_warning ("ISO C++ forbids declaration of `%s' with no type",
10017 type
= integer_type_node
;
10022 /* Now process the modifiers that were specified
10023 and check for invalid combinations. */
10025 /* Long double is a special combination. */
10027 if (RIDBIT_SETP (RID_LONG
, specbits
)
10028 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
10030 RIDBIT_RESET (RID_LONG
, specbits
);
10031 type
= build_qualified_type (long_double_type_node
,
10032 CP_TYPE_QUALS (type
));
10035 /* Check all other uses of type modifiers. */
10037 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10038 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10039 || RIDBIT_SETP (RID_LONG
, specbits
)
10040 || RIDBIT_SETP (RID_SHORT
, specbits
))
10044 if (TREE_CODE (type
) == REAL_TYPE
)
10045 error ("short, signed or unsigned invalid for `%s'", name
);
10046 else if (TREE_CODE (type
) != INTEGER_TYPE
)
10047 error ("long, short, signed or unsigned invalid for `%s'", name
);
10048 else if (RIDBIT_SETP (RID_LONG
, specbits
)
10049 && RIDBIT_SETP (RID_SHORT
, specbits
))
10050 error ("long and short specified together for `%s'", name
);
10051 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10052 || RIDBIT_SETP (RID_SHORT
, specbits
))
10054 error ("long or short specified with char for `%s'", name
);
10055 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10056 || RIDBIT_SETP (RID_SHORT
, specbits
))
10057 && TREE_CODE (type
) == REAL_TYPE
)
10058 error ("long or short specified with floating type for `%s'", name
);
10059 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10060 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
10061 error ("signed and unsigned given together for `%s'", name
);
10065 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
10067 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
10069 if (flag_pedantic_errors
)
10074 /* Discard the type modifiers if they are invalid. */
10077 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
10078 RIDBIT_RESET (RID_SIGNED
, specbits
);
10079 RIDBIT_RESET (RID_LONG
, specbits
);
10080 RIDBIT_RESET (RID_SHORT
, specbits
);
10085 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
10086 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
10088 error ("complex invalid for `%s'", name
);
10089 RIDBIT_RESET (RID_COMPLEX
, specbits
);
10092 /* Decide whether an integer type is signed or not.
10093 Optionally treat bitfields as signed by default. */
10094 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10097 It is implementation-defined whether a plain (neither
10098 explicitly signed or unsigned) char, short, int, or long
10099 bit-field is signed or unsigned.
10101 Naturally, we extend this to long long as well. Note that
10102 this does not include wchar_t. */
10103 || (bitfield
&& !flag_signed_bitfields
10104 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
10105 /* A typedef for plain `int' without `signed' can be
10106 controlled just like plain `int', but a typedef for
10107 `signed int' cannot be so controlled. */
10109 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
10110 && (TREE_CODE (type
) == INTEGER_TYPE
10111 || TREE_CODE (type
) == CHAR_TYPE
)
10112 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
10115 type
= long_long_unsigned_type_node
;
10116 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10117 type
= long_unsigned_type_node
;
10118 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10119 type
= short_unsigned_type_node
;
10120 else if (type
== char_type_node
)
10121 type
= unsigned_char_type_node
;
10122 else if (typedef_decl
)
10123 type
= unsigned_type (type
);
10125 type
= unsigned_type_node
;
10127 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10128 && type
== char_type_node
)
10129 type
= signed_char_type_node
;
10131 type
= long_long_integer_type_node
;
10132 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10133 type
= long_integer_type_node
;
10134 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10135 type
= short_integer_type_node
;
10137 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
10139 /* If we just have "complex", it is equivalent to
10140 "complex double", but if any modifiers at all are specified it is
10141 the complex form of TYPE. E.g, "complex short" is
10142 "complex short int". */
10144 if (defaulted_int
&& ! longlong
10145 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
10146 || RIDBIT_SETP (RID_SHORT
, specbits
)
10147 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10148 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
10149 type
= complex_double_type_node
;
10150 else if (type
== integer_type_node
)
10151 type
= complex_integer_type_node
;
10152 else if (type
== float_type_node
)
10153 type
= complex_float_type_node
;
10154 else if (type
== double_type_node
)
10155 type
= complex_double_type_node
;
10156 else if (type
== long_double_type_node
)
10157 type
= complex_long_double_type_node
;
10159 type
= build_complex_type (type
);
10162 if (sfk
== sfk_conversion
10163 && (RIDBIT_SETP (RID_CONST
, specbits
)
10164 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
10165 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
10166 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
10169 /* Set CONSTP if this declaration is `const', whether by
10170 explicit specification or via a typedef.
10171 Likewise for VOLATILEP. */
10173 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
10175 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
10177 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
10178 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10179 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10180 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10181 type
= cp_build_qualified_type (type
, type_quals
);
10183 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
10184 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
10185 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
10186 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
10187 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
10189 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10190 staticp
= 1 + (decl_context
== FIELD
);
10192 if (virtualp
&& staticp
== 2)
10194 cp_error ("member `%D' cannot be declared both virtual and static",
10198 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
10199 RIDBIT_RESET (RID_FRIEND
, specbits
);
10201 /* Warn if two storage classes are given. Default to `auto'. */
10203 if (RIDBIT_ANY_SET (specbits
))
10205 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
10206 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
10207 if (decl_context
== PARM
&& nclasses
> 0)
10208 error ("storage class specifiers invalid in parameter declarations");
10209 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10211 if (decl_context
== PARM
)
10212 error ("typedef declaration invalid in parameter declaration");
10215 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
10216 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
10219 /* Give error if `virtual' is used outside of class declaration. */
10221 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
10223 error ("virtual outside class declaration");
10227 /* Static anonymous unions are dealt with here. */
10228 if (staticp
&& decl_context
== TYPENAME
10229 && TREE_CODE (declspecs
) == TREE_LIST
10230 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
10231 decl_context
= FIELD
;
10233 /* Warn about storage classes that are invalid for certain
10234 kinds of declarations (parameters, typenames, etc.). */
10237 error ("multiple storage classes in declaration of `%s'", name
);
10238 else if (decl_context
!= NORMAL
&& nclasses
> 0)
10240 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
10241 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
10242 || RIDBIT_SETP (RID_AUTO
, specbits
)))
10244 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10246 else if (decl_context
== FIELD
10247 /* C++ allows static class elements */
10248 && RIDBIT_SETP (RID_STATIC
, specbits
))
10249 /* C++ also allows inlines and signed and unsigned elements,
10250 but in those cases we don't come in here. */
10254 if (decl_context
== FIELD
)
10256 tree tmp
= NULL_TREE
;
10257 register int op
= 0;
10261 /* Avoid trying to get an operand off an identifier node. */
10262 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10265 tmp
= TREE_OPERAND (declarator
, 0);
10266 op
= IDENTIFIER_OPNAME_P (tmp
);
10267 if (IDENTIFIER_TYPENAME_P (tmp
))
10269 if (IDENTIFIER_GLOBAL_VALUE (tmp
)
10270 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (tmp
))
10272 name
= IDENTIFIER_POINTER (tmp
);
10274 name
= "<invalid operator>";
10277 error ("storage class specified for %s `%s'",
10278 op
? "member operator" : "field",
10283 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10284 error ("storage class specified for parameter `%s'", name
);
10286 error ("storage class specified for typename");
10288 RIDBIT_RESET (RID_REGISTER
, specbits
);
10289 RIDBIT_RESET (RID_AUTO
, specbits
);
10290 RIDBIT_RESET (RID_EXTERN
, specbits
);
10293 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
10295 if (toplevel_bindings_p ())
10297 /* It's common practice (and completely valid) to have a const
10298 be initialized and declared extern. */
10299 if (!(type_quals
& TYPE_QUAL_CONST
))
10300 warning ("`%s' initialized and declared `extern'", name
);
10303 error ("`%s' has both `extern' and initializer", name
);
10305 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
10306 && ! toplevel_bindings_p ())
10307 error ("nested function `%s' declared `extern'", name
);
10308 else if (toplevel_bindings_p ())
10310 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10311 error ("top-level declaration of `%s' specifies `auto'", name
);
10314 if (nclasses
> 0 && friendp
)
10315 error ("storage class specifiers invalid in friend function declarations");
10317 /* Now figure out the structure of the declarator proper.
10318 Descend through it, creating more complex types, until we reach
10319 the declared identifier (or NULL_TREE, in an absolute declarator). */
10321 inner_attrs
= NULL_TREE
;
10324 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
10325 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
10327 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
10328 an INDIRECT_REF (for *...),
10329 a CALL_EXPR (for ...(...)),
10330 an identifier (for the name being declared)
10331 or a null pointer (for the place in an absolute declarator
10332 where the name was omitted).
10333 For the last two cases, we have just exited the loop.
10335 For C++ it could also be
10336 a SCOPE_REF (for class :: ...). In this case, we have converted
10337 sensible names to types, and those are the values we use to
10338 qualify the member name.
10339 an ADDR_EXPR (for &...),
10340 a BIT_NOT_EXPR (for destructors)
10342 At this point, TYPE is the type of elements of an array,
10343 or for a function to return, or for a pointer to point to.
10344 After this sequence of ifs, TYPE is the type of the
10345 array or function or pointer, and DECLARATOR has had its
10346 outermost layer removed. */
10348 if (type
== error_mark_node
)
10350 if (TREE_CODE (declarator
) == SCOPE_REF
)
10351 declarator
= TREE_OPERAND (declarator
, 1);
10353 declarator
= TREE_OPERAND (declarator
, 0);
10356 if (quals
!= NULL_TREE
10357 && (declarator
== NULL_TREE
10358 || TREE_CODE (declarator
) != SCOPE_REF
))
10360 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
10361 ctype
= TYPE_METHOD_BASETYPE (type
);
10362 if (ctype
!= NULL_TREE
)
10364 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
10365 grok_method_quals (ctype
, dummy
, quals
);
10366 type
= TREE_TYPE (dummy
);
10367 ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
)));
10372 /* See the comment for the TREE_LIST case, below. */
10375 else if (inner_attrs
)
10377 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10378 inner_attrs
= NULL_TREE
;
10381 switch (TREE_CODE (declarator
))
10385 /* We encode a declarator with embedded attributes using
10386 a TREE_LIST. The attributes apply to the declarator
10387 directly inside them, so we have to skip an iteration
10388 before applying them to the type. If the declarator just
10389 inside is the declarator-id, we apply the attrs to the
10391 inner_attrs
= TREE_PURPOSE (declarator
);
10393 declarator
= TREE_VALUE (declarator
);
10399 register tree size
;
10401 size
= TREE_OPERAND (declarator
, 1);
10403 /* VC++ spells a zero-sized array with []. */
10404 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
10405 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10406 size
= integer_zero_node
;
10408 declarator
= TREE_OPERAND (declarator
, 0);
10410 type
= create_array_type_for_decl (dname
, type
, size
);
10412 /* VLAs never work as fields. */
10413 if (decl_context
== FIELD
&& !processing_template_decl
10414 && TREE_CODE (type
) == ARRAY_TYPE
10415 && TYPE_DOMAIN (type
) != NULL_TREE
10416 && !TREE_CONSTANT (TYPE_MAX_VALUE (TYPE_DOMAIN (type
))))
10418 cp_error ("size of member `%D' is not constant", dname
);
10419 /* Proceed with arbitrary constant size, so that offset
10420 computations don't get confused. */
10421 type
= create_array_type_for_decl (dname
, TREE_TYPE (type
),
10433 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
10434 tree inner_decl
= TREE_OPERAND (declarator
, 0);
10436 /* Declaring a function type.
10437 Make sure we have a valid type for the function to return. */
10439 /* We now know that the TYPE_QUALS don't apply to the
10440 decl, but to its return type. */
10441 type_quals
= TYPE_UNQUALIFIED
;
10443 /* Warn about some types functions can't return. */
10445 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10447 error ("`%s' declared as function returning a function", name
);
10448 type
= integer_type_node
;
10450 if (TREE_CODE (type
) == ARRAY_TYPE
)
10452 error ("`%s' declared as function returning an array", name
);
10453 type
= integer_type_node
;
10456 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
10457 inner_decl
= TREE_OPERAND (inner_decl
, 1);
10459 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
10460 inner_decl
= dname
;
10462 /* Pick up type qualifiers which should be applied to `this'. */
10463 quals
= CALL_DECLARATOR_QUALS (declarator
);
10465 /* Pick up the exception specifications. */
10466 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
10468 /* Say it's a definition only for the CALL_EXPR
10469 closest to the identifier. */
10472 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
10473 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
10474 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
10476 if (ctype
== NULL_TREE
10477 && decl_context
== FIELD
10479 && (friendp
== 0 || dname
== current_class_name
))
10480 ctype
= current_class_type
;
10482 if (ctype
&& sfk
== sfk_conversion
)
10483 TYPE_HAS_CONVERSION (ctype
) = 1;
10484 if (ctype
&& constructor_name (ctype
) == dname
)
10486 /* We are within a class's scope. If our declarator name
10487 is the same as the class name, and we are defining
10488 a function, then it is a constructor/destructor, and
10489 therefore returns a void type. */
10491 if (flags
== DTOR_FLAG
)
10493 /* ISO C++ 12.4/2. A destructor may not be
10494 declared const or volatile. A destructor may
10497 error ("destructor cannot be static member function");
10500 cp_error ("destructors may not be `%s'",
10501 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10504 if (decl_context
== FIELD
)
10506 if (! member_function_or_else (ctype
,
10507 current_class_type
,
10509 return void_type_node
;
10512 else /* It's a constructor. */
10514 if (explicitp
== 1)
10516 /* ISO C++ 12.1. A constructor may not be
10517 declared const or volatile. A constructor may
10518 not be virtual. A constructor may not be
10521 error ("constructor cannot be static member function");
10524 pedwarn ("constructors cannot be declared virtual");
10529 cp_error ("constructors may not be `%s'",
10530 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10534 RID_BIT_TYPE tmp_bits
;
10535 memcpy (&tmp_bits
, &specbits
, sizeof (RID_BIT_TYPE
));
10536 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10537 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10538 if (RIDBIT_ANY_SET (tmp_bits
))
10539 error ("return value type specifier for constructor ignored");
10541 if (decl_context
== FIELD
)
10543 if (! member_function_or_else (ctype
,
10544 current_class_type
,
10546 return void_type_node
;
10547 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10548 if (sfk
!= sfk_constructor
)
10552 if (decl_context
== FIELD
)
10558 error ("can't initialize friend function `%s'", name
);
10561 /* Cannot be both friend and virtual. */
10562 error ("virtual functions cannot be friends");
10563 RIDBIT_RESET (RID_FRIEND
, specbits
);
10566 if (decl_context
== NORMAL
)
10567 error ("friend declaration not in class definition");
10568 if (current_function_decl
&& funcdef_flag
)
10569 cp_error ("can't define friend function `%s' in a local class definition",
10573 /* Construct the function type and go to the next
10574 inner layer of declarator. */
10576 declarator
= TREE_OPERAND (declarator
, 0);
10578 /* FIXME: This is where default args should be fully
10581 arg_types
= grokparms (inner_parms
);
10583 if (declarator
&& flags
== DTOR_FLAG
)
10585 /* A destructor declared in the body of a class will
10586 be represented as a BIT_NOT_EXPR. But, we just
10587 want the underlying IDENTIFIER. */
10588 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10589 declarator
= TREE_OPERAND (declarator
, 0);
10591 if (arg_types
!= void_list_node
)
10593 cp_error ("destructors may not have parameters");
10594 arg_types
= void_list_node
;
10595 last_function_parms
= NULL_TREE
;
10599 /* ANSI says that `const int foo ();'
10600 does not make the function foo const. */
10601 type
= build_function_type (type
, arg_types
);
10605 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10606 if (TREE_PURPOSE (t
)
10607 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10609 add_defarg_fn (type
);
10618 /* Filter out pointers-to-references and references-to-references.
10619 We can get these if a TYPE_DECL is used. */
10621 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10623 error ("cannot declare %s to references",
10624 TREE_CODE (declarator
) == ADDR_EXPR
10625 ? "references" : "pointers");
10626 declarator
= TREE_OPERAND (declarator
, 0);
10630 if (TREE_CODE (type
) == OFFSET_TYPE
10631 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10632 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10634 cp_error ("cannot declare pointer to `%#T' member",
10636 type
= TREE_TYPE (type
);
10639 /* Merge any constancy or volatility into the target type
10640 for the pointer. */
10642 /* We now know that the TYPE_QUALS don't apply to the decl,
10643 but to the target of the pointer. */
10644 type_quals
= TYPE_UNQUALIFIED
;
10646 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10648 if (TREE_CODE (type
) == VOID_TYPE
)
10649 error ("invalid type: `void &'");
10651 type
= build_reference_type (type
);
10653 else if (TREE_CODE (type
) == METHOD_TYPE
)
10654 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10656 type
= build_pointer_type (type
);
10658 /* Process a list of type modifier keywords (such as
10659 const or volatile) that were given inside the `*' or `&'. */
10661 if (TREE_TYPE (declarator
))
10663 register tree typemodlist
;
10669 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10670 typemodlist
= TREE_CHAIN (typemodlist
))
10672 tree qualifier
= TREE_VALUE (typemodlist
);
10674 if (qualifier
== ridpointers
[(int) RID_CONST
])
10676 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10678 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10683 error ("invalid type modifier within pointer declarator");
10687 pedwarn ("duplicate `const'");
10689 pedwarn ("duplicate `volatile'");
10691 pedwarn ("duplicate `restrict'");
10693 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10694 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10695 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10696 if (TREE_CODE (declarator
) == ADDR_EXPR
10697 && (constp
|| volatilep
))
10700 pedwarn ("discarding `const' applied to a reference");
10702 pedwarn ("discarding `volatile' applied to a reference");
10703 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10705 type
= cp_build_qualified_type (type
, type_quals
);
10707 declarator
= TREE_OPERAND (declarator
, 0);
10713 /* We have converted type names to NULL_TREE if the
10714 name was bogus, or to a _TYPE node, if not.
10716 The variable CTYPE holds the type we will ultimately
10717 resolve to. The code here just needs to build
10718 up appropriate member types. */
10719 tree sname
= TREE_OPERAND (declarator
, 1);
10722 /* Destructors can have their visibilities changed as well. */
10723 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10724 sname
= TREE_OPERAND (sname
, 0);
10726 if (TREE_COMPLEXITY (declarator
) == 0)
10727 /* This needs to be here, in case we are called
10728 multiple times. */ ;
10729 else if (TREE_COMPLEXITY (declarator
) == -1)
10730 /* Namespace member. */
10731 pop_decl_namespace ();
10732 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10733 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10734 else if (! IS_AGGR_TYPE_CODE
10735 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10737 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10739 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10740 that refer to ctype. They couldn't be resolved earlier
10741 because we hadn't pushed into the class yet.
10742 Example: resolve 'B<T>::type' in
10743 'B<typename B<T>::type> B<T>::f () { }'. */
10744 if (current_template_parms
10745 && uses_template_parms (type
)
10746 && uses_template_parms (current_class_type
))
10748 tree args
= current_template_args ();
10749 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10752 /* This pop_nested_class corresponds to the
10753 push_nested_class used to push into class scope for
10754 parsing the argument list of a function decl, in
10756 pop_nested_class ();
10757 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10760 my_friendly_abort (16);
10762 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10764 /* We had a reference to a global decl, or
10765 perhaps we were given a non-aggregate typedef,
10766 in which case we cleared this out, and should just
10767 keep going as though it wasn't there. */
10768 declarator
= sname
;
10771 ctype
= TREE_OPERAND (declarator
, 0);
10774 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10776 /* You're supposed to have one `template <...>'
10777 for every template class, but you don't need one
10778 for a full specialization. For example:
10780 template <class T> struct S{};
10781 template <> struct S<int> { void f(); };
10782 void S<int>::f () {}
10784 is correct; there shouldn't be a `template <>' for
10785 the definition of `S<int>::f'. */
10786 if (CLASSTYPE_TEMPLATE_INFO (t
)
10787 && (CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
10788 || uses_template_parms (CLASSTYPE_TI_ARGS (t
)))
10789 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
)))
10790 template_count
+= 1;
10792 t
= TYPE_MAIN_DECL (t
);
10793 t
= DECL_CONTEXT (t
);
10796 if (sname
== NULL_TREE
)
10799 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10801 /* This is the `standard' use of the scoping operator:
10802 basetype :: member . */
10804 if (ctype
== current_class_type
)
10810 Is this ill-formed? */
10813 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10816 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10818 if (current_class_type
== NULL_TREE
|| friendp
)
10819 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10820 TYPE_ARG_TYPES (type
));
10823 cp_error ("cannot declare member function `%T::%s' within `%T'",
10824 ctype
, name
, current_class_type
);
10825 return void_type_node
;
10828 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10829 || COMPLETE_TYPE_P (complete_type (ctype
)))
10831 /* Have to move this code elsewhere in this function.
10832 this code is used for i.e., typedef int A::M; M *pm;
10834 It is? How? jason 10/2/94 */
10836 if (current_class_type
)
10838 cp_error ("cannot declare member `%T::%s' within `%T'",
10839 ctype
, name
, current_class_type
);
10840 return void_type_node
;
10842 type
= build_offset_type (ctype
, type
);
10846 incomplete_type_error (NULL_TREE
, ctype
);
10847 return error_mark_node
;
10850 declarator
= sname
;
10852 else if (TREE_CODE (sname
) == SCOPE_REF
)
10853 my_friendly_abort (17);
10857 declarator
= TREE_OPERAND (declarator
, 1);
10858 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10859 /* In this case, we will deal with it later. */
10863 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10864 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10865 TYPE_ARG_TYPES (type
));
10867 type
= build_offset_type (ctype
, type
);
10874 declarator
= TREE_OPERAND (declarator
, 0);
10879 case ENUMERAL_TYPE
:
10880 declarator
= NULL_TREE
;
10884 declarator
= NULL_TREE
;
10888 my_friendly_abort (158);
10892 /* See the comment for the TREE_LIST case, above. */
10895 if (! ignore_attrs
)
10896 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10898 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
10900 attrlist
= build_tree_list (NULL_TREE
, inner_attrs
);
10903 /* Now TYPE has the actual type. */
10905 if (explicitp
== 1 || (explicitp
&& friendp
))
10907 /* [dcl.fct.spec] The explicit specifier shall only be used in
10908 declarations of constructors within a class definition. */
10909 error ("only declarations of constructors can be `explicit'");
10913 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10915 if (current_class_name
== NULL_TREE
|| decl_context
== PARM
|| friendp
)
10917 error ("non-member `%s' cannot be declared `mutable'", name
);
10918 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10920 else if (decl_context
== TYPENAME
|| RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10922 error ("non-object member `%s' cannot be declared `mutable'", name
);
10923 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10925 else if (TREE_CODE (type
) == FUNCTION_TYPE
10926 || TREE_CODE (type
) == METHOD_TYPE
)
10928 error ("function `%s' cannot be declared `mutable'", name
);
10929 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10933 error ("static `%s' cannot be declared `mutable'", name
);
10934 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10936 else if (type_quals
& TYPE_QUAL_CONST
)
10938 error ("const `%s' cannot be declared `mutable'", name
);
10939 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10943 if (declarator
== NULL_TREE
10944 || TREE_CODE (declarator
) == IDENTIFIER_NODE
10945 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
10946 && (TREE_CODE (type
) == FUNCTION_TYPE
10947 || TREE_CODE (type
) == METHOD_TYPE
)))
10949 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10951 cp_error ("template-id `%D' used as a declarator", declarator
);
10952 declarator
= dname
;
10955 /* Unexpected declarator format. */
10956 my_friendly_abort (990210);
10958 /* If this is declaring a typedef name, return a TYPE_DECL. */
10960 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
10964 /* Note that the grammar rejects storage classes
10965 in typenames, fields or parameters. */
10966 if (current_lang_name
== lang_name_java
)
10967 TYPE_FOR_JAVA (type
) = 1;
10969 if (decl_context
== FIELD
)
10971 if (declarator
== constructor_name (current_class_type
))
10972 cp_pedwarn ("ISO C++ forbids nested type `%D' with same name as enclosing class",
10974 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10977 decl
= build_decl (TYPE_DECL
, declarator
, type
);
10979 /* If the user declares "typedef struct {...} foo" then the
10980 struct will have an anonymous name. Fill that name in now.
10981 Nothing can refer to it, so nothing needs know about the name
10983 if (type
!= error_mark_node
10985 && TYPE_NAME (type
)
10986 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
10987 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
10988 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
10990 tree oldname
= TYPE_NAME (type
);
10993 /* Replace the anonymous name with the real name everywhere. */
10994 lookup_tag_reverse (type
, declarator
);
10995 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
10996 if (TYPE_NAME (t
) == oldname
)
10997 TYPE_NAME (t
) = decl
;
10999 if (TYPE_LANG_SPECIFIC (type
))
11000 TYPE_WAS_ANONYMOUS (type
) = 1;
11002 /* If this is a typedef within a template class, the nested
11003 type is a (non-primary) template. The name for the
11004 template needs updating as well. */
11005 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
11006 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
11007 = TYPE_IDENTIFIER (type
);
11009 DECL_ASSEMBLER_NAME (decl
) = mangle_type (type
);
11011 /* FIXME remangle member functions; member functions of a
11012 type with external linkage have external linkage. */
11015 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11017 cp_error_at ("typedef name may not be class-qualified", decl
);
11022 if (ctype
== NULL_TREE
)
11024 if (TREE_CODE (type
) != METHOD_TYPE
)
11025 cp_error_at ("invalid type qualifier for non-member function type", decl
);
11027 ctype
= TYPE_METHOD_BASETYPE (type
);
11029 if (ctype
!= NULL_TREE
)
11030 grok_method_quals (ctype
, decl
, quals
);
11033 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
11034 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
11035 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
11037 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
11038 inlinep
, friendp
, raises
!= NULL_TREE
);
11041 error ("typedef declaration includes an initializer");
11046 /* Detect the case of an array type of unspecified size
11047 which came, as such, direct from a typedef name.
11048 We must copy the type, so that each identifier gets
11049 a distinct type, so that each identifier's size can be
11050 controlled separately by its own initializer. */
11052 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
11053 && TYPE_DOMAIN (type
) == NULL_TREE
)
11055 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
11058 /* If this is a type name (such as, in a cast or sizeof),
11059 compute the type and return it now. */
11061 if (decl_context
== TYPENAME
)
11063 /* Note that the grammar rejects storage classes
11064 in typenames, fields or parameters. */
11065 if (type_quals
!= TYPE_UNQUALIFIED
)
11066 type_quals
= TYPE_UNQUALIFIED
;
11068 /* Special case: "friend class foo" looks like a TYPENAME context. */
11071 if (type_quals
!= TYPE_UNQUALIFIED
)
11073 cp_error ("type qualifiers specified for friend class declaration");
11074 type_quals
= TYPE_UNQUALIFIED
;
11078 cp_error ("`inline' specified for friend class declaration");
11082 /* Until core issue 180 is resolved, allow 'friend typename A::B'.
11083 But don't allow implicit typenames except with a class-key. */
11084 if (!current_aggr
&& (TREE_CODE (type
) != TYPENAME_TYPE
11085 || IMPLICIT_TYPENAME_P (type
)))
11087 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
11088 cp_pedwarn ("template parameters cannot be friends");
11089 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
11091 friend declaration requires class-key, i.e. `friend class %T::%T'",
11092 constructor_name (current_class_type
),
11093 TYPE_IDENTIFIER (type
));
11096 friend declaration requires class-key, i.e. `friend %#T'",
11100 /* Only try to do this stuff if we didn't already give up. */
11101 if (type
!= integer_type_node
)
11103 decl_type_access_control (TYPE_NAME (type
));
11105 /* A friendly class? */
11106 if (current_class_type
)
11107 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
11109 cp_error ("trying to make class `%T' a friend of global scope",
11112 type
= void_type_node
;
11117 if (ctype
== NULL_TREE
)
11119 if (TREE_CODE (type
) != METHOD_TYPE
)
11120 cp_error ("invalid qualifiers on non-member function type");
11122 ctype
= TYPE_METHOD_BASETYPE (type
);
11126 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
11127 grok_method_quals (ctype
, dummy
, quals
);
11128 type
= TREE_TYPE (dummy
);
11134 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
11135 && decl_context
!= CATCHPARM
11136 && TREE_CODE (type
) != UNION_TYPE
11139 cp_error ("abstract declarator `%T' used as declaration", type
);
11140 declarator
= make_anon_name ();
11143 /* `void' at top level (not within pointer)
11144 is allowed only in typedefs or type names.
11145 We don't complain about parms either, but that is because
11146 a better error message can be made later. */
11148 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
11151 error ("unnamed variable or field declared void");
11152 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
11154 if (IDENTIFIER_OPNAME_P (declarator
))
11155 my_friendly_abort (356);
11157 error ("variable or field `%s' declared void", name
);
11160 error ("variable or field declared void");
11161 type
= integer_type_node
;
11164 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
11165 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
11167 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
11169 if (ctype
|| in_namespace
)
11170 error ("cannot use `::' in parameter declaration");
11172 /* A parameter declared as an array of T is really a pointer to T.
11173 One declared as a function is really a pointer to a function.
11174 One declared as a member is really a pointer to member. */
11176 if (TREE_CODE (type
) == ARRAY_TYPE
)
11178 /* Transfer const-ness of array into that of type pointed to. */
11179 type
= build_pointer_type (TREE_TYPE (type
));
11180 type_quals
= TYPE_UNQUALIFIED
;
11182 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11183 type
= build_pointer_type (type
);
11184 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11185 type
= build_pointer_type (type
);
11189 register tree decl
;
11191 if (decl_context
== PARM
)
11193 decl
= build_decl (PARM_DECL
, declarator
, type
);
11195 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
11196 inlinep
, friendp
, raises
!= NULL_TREE
);
11198 /* Compute the type actually passed in the parmlist,
11199 for the case where there is no prototype.
11200 (For example, shorts and chars are passed as ints.)
11201 When there is a prototype, this is overridden later. */
11203 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
11205 else if (decl_context
== FIELD
)
11207 if (type
== error_mark_node
)
11209 /* Happens when declaring arrays of sizes which
11210 are error_mark_node, for example. */
11213 else if (in_namespace
&& !friendp
)
11215 /* Something like struct S { int N::j; }; */
11216 cp_error ("invalid use of `::'");
11219 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11222 tree function_context
;
11224 /* We catch the others as conflicts with the builtin
11226 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
11228 cp_error ("function `%D' cannot be declared friend",
11235 if (ctype
== NULL_TREE
)
11236 ctype
= current_class_type
;
11238 if (ctype
== NULL_TREE
)
11240 cp_error ("can't make `%D' into a method -- not in a class",
11242 return void_type_node
;
11245 /* ``A union may [ ... ] not [ have ] virtual functions.''
11247 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
11249 cp_error ("function `%D' declared virtual inside a union",
11251 return void_type_node
;
11254 if (declarator
== ansi_opname (NEW_EXPR
)
11255 || declarator
== ansi_opname (VEC_NEW_EXPR
)
11256 || declarator
== ansi_opname (DELETE_EXPR
)
11257 || declarator
== ansi_opname (VEC_DELETE_EXPR
))
11261 cp_error ("`%D' cannot be declared virtual, since it is always static",
11266 else if (staticp
< 2)
11267 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11268 TYPE_ARG_TYPES (type
));
11271 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
11272 function_context
= (ctype
!= NULL_TREE
) ?
11273 decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
11274 publicp
= (! friendp
|| ! staticp
)
11275 && function_context
== NULL_TREE
;
11276 decl
= grokfndecl (ctype
, type
,
11277 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
11278 ? declarator
: dname
,
11280 virtualp
, flags
, quals
, raises
,
11281 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
11282 funcdef_flag
, template_count
, in_namespace
);
11283 if (decl
== NULL_TREE
)
11286 /* This clobbers the attrs stored in `decl' from `attrlist'. */
11287 /* The decl and setting of decl_machine_attr is also turned off. */
11288 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
11291 /* [class.conv.ctor]
11293 A constructor declared without the function-specifier
11294 explicit that can be called with a single parameter
11295 specifies a conversion from the type of its first
11296 parameter to the type of its class. Such a constructor
11297 is called a converting constructor. */
11298 if (explicitp
== 2)
11299 DECL_NONCONVERTING_P (decl
) = 1;
11300 else if (DECL_CONSTRUCTOR_P (decl
))
11302 /* The constructor can be called with exactly one
11303 parameter if there is at least one parameter, and
11304 any subsequent parameters have default arguments.
11305 Ignore any compiler-added parms. */
11306 tree arg_types
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
11308 if (arg_types
== void_list_node
11310 && TREE_CHAIN (arg_types
)
11311 && TREE_CHAIN (arg_types
) != void_list_node
11312 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
11313 DECL_NONCONVERTING_P (decl
) = 1;
11316 else if (TREE_CODE (type
) == METHOD_TYPE
)
11318 /* We only get here for friend declarations of
11319 members of other classes. */
11320 /* All method decls are public, so tell grokfndecl to set
11321 TREE_PUBLIC, also. */
11322 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
11323 virtualp
, flags
, quals
, raises
,
11324 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
11325 template_count
, in_namespace
);
11326 if (decl
== NULL_TREE
)
11329 else if (!staticp
&& ! processing_template_decl
11330 && !COMPLETE_TYPE_P (complete_type (type
))
11331 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
11334 cp_error ("field `%D' has incomplete type", declarator
);
11336 cp_error ("name `%T' has incomplete type", type
);
11338 /* If we're instantiating a template, tell them which
11339 instantiation made the field's type be incomplete. */
11340 if (current_class_type
11341 && TYPE_NAME (current_class_type
)
11342 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
11343 && declspecs
&& TREE_VALUE (declspecs
)
11344 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
11345 cp_error (" in instantiation of template `%T'",
11346 current_class_type
);
11348 type
= error_mark_node
;
11355 error ("`%s' is neither function nor member function; cannot be declared friend",
11356 IDENTIFIER_POINTER (declarator
));
11364 /* Friends are treated specially. */
11365 if (ctype
== current_class_type
)
11366 warning ("member functions are implicitly friends of their class");
11369 tree t
= NULL_TREE
;
11370 if (decl
&& DECL_NAME (decl
))
11372 if (template_class_depth (current_class_type
) == 0)
11375 = check_explicit_specialization
11377 template_count
, 2 * (funcdef_flag
!= 0) + 4);
11378 if (decl
== error_mark_node
)
11379 return error_mark_node
;
11382 t
= do_friend (ctype
, declarator
, decl
,
11383 last_function_parms
, attrlist
, flags
, quals
,
11386 if (t
&& funcdef_flag
)
11389 return void_type_node
;
11393 /* Structure field. It may not be a function, except for C++ */
11395 if (decl
== NULL_TREE
)
11401 /* An attempt is being made to initialize a non-static
11402 member. But, from [class.mem]:
11404 4 A member-declarator can contain a
11405 constant-initializer only if it declares a static
11406 member (_class.static_) of integral or enumeration
11407 type, see _class.static.data_.
11409 This used to be relatively common practice, but
11410 the rest of the compiler does not correctly
11411 handle the initialization unless the member is
11412 static so we make it static below. */
11413 cp_pedwarn ("ISO C++ forbids initialization of member `%D'",
11415 cp_pedwarn ("making `%D' static", declarator
);
11419 if (uses_template_parms (type
))
11420 /* We'll check at instantiation time. */
11422 else if (check_static_variable_definition (declarator
,
11424 /* If we just return the declaration, crashes
11425 will sometimes occur. We therefore return
11426 void_type_node, as if this was a friend
11427 declaration, to cause callers to completely
11428 ignore this declaration. */
11429 return void_type_node
;
11432 /* 9.2p13 [class.mem] */
11433 if (declarator
== constructor_name (current_class_type
)
11434 /* The standard does not allow non-static data members
11435 here either, but we agreed at the 10/99 meeting
11436 to change that in TC 1 so that they are allowed in
11437 classes with no user-defined constructors. */
11439 cp_pedwarn ("ISO C++ forbids static data member `%D' with same name as enclosing class",
11444 /* C++ allows static class members. All other work
11445 for this is done by grokfield. */
11446 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
11447 TREE_STATIC (decl
) = 1;
11448 /* In class context, 'static' means public access. */
11449 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
11453 decl
= build_decl (FIELD_DECL
, declarator
, type
);
11454 DECL_NONADDRESSABLE_P (decl
) = bitfield
;
11455 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11457 DECL_MUTABLE_P (decl
) = 1;
11458 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11462 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
11463 inlinep
, friendp
, raises
!= NULL_TREE
);
11466 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11468 tree original_name
;
11474 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11475 original_name
= dname
;
11477 original_name
= declarator
;
11479 if (RIDBIT_SETP (RID_AUTO
, specbits
))
11480 error ("storage class `auto' invalid for function `%s'", name
);
11481 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11482 error ("storage class `register' invalid for function `%s'", name
);
11484 /* Function declaration not at top level.
11485 Storage classes other than `extern' are not allowed
11486 and `extern' makes no difference. */
11487 if (! toplevel_bindings_p ()
11488 && (RIDBIT_SETP (RID_STATIC
, specbits
)
11489 || RIDBIT_SETP (RID_INLINE
, specbits
))
11492 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11493 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
11495 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
11498 if (ctype
== NULL_TREE
)
11502 error ("virtual non-class function `%s'", name
);
11506 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
11507 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11508 TYPE_ARG_TYPES (type
));
11510 /* Record presence of `static'. */
11511 publicp
= (ctype
!= NULL_TREE
11512 || RIDBIT_SETP (RID_EXTERN
, specbits
)
11513 || !RIDBIT_SETP (RID_STATIC
, specbits
));
11515 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
11516 virtualp
, flags
, quals
, raises
,
11518 publicp
, inlinep
, funcdef_flag
,
11519 template_count
, in_namespace
);
11520 if (decl
== NULL_TREE
)
11525 int illegal_static
= 0;
11527 /* Don't allow a static member function in a class, and forbid
11528 declaring main to be static. */
11529 if (TREE_CODE (type
) == METHOD_TYPE
)
11531 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11532 illegal_static
= 1;
11534 else if (current_function_decl
)
11536 /* FIXME need arm citation */
11537 error ("cannot declare static function inside another function");
11538 illegal_static
= 1;
11541 if (illegal_static
)
11544 RIDBIT_RESET (RID_STATIC
, specbits
);
11550 /* It's a variable. */
11552 /* An uninitialized decl with `extern' is a reference. */
11553 decl
= grokvardecl (type
, declarator
, &specbits
,
11555 (type_quals
& TYPE_QUAL_CONST
) != 0,
11557 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11558 inlinep
, friendp
, raises
!= NULL_TREE
);
11562 DECL_CONTEXT (decl
) = ctype
;
11565 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11567 RIDBIT_RESET (RID_STATIC
, specbits
);
11569 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11571 cp_error ("static member `%D' declared `register'", decl
);
11572 RIDBIT_RESET (RID_REGISTER
, specbits
);
11574 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11576 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11578 RIDBIT_RESET (RID_EXTERN
, specbits
);
11583 my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE
, specbits
), 19990927);
11585 /* Record `register' declaration for warnings on &
11586 and in case doing stupid register allocation. */
11588 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11589 DECL_REGISTER (decl
) = 1;
11591 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11592 DECL_THIS_EXTERN (decl
) = 1;
11594 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11595 DECL_THIS_STATIC (decl
) = 1;
11597 /* Record constancy and volatility. There's no need to do this
11598 when processing a template; we'll do this for the instantiated
11599 declaration based on the type of DECL. */
11600 if (!processing_template_decl
)
11601 c_apply_type_quals_to_decl (type_quals
, decl
);
11607 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11608 An empty exprlist is a parmlist. An exprlist which
11609 contains only identifiers at the global level
11610 is a parmlist. Otherwise, it is an exprlist. */
11613 parmlist_is_exprlist (exprs
)
11616 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11619 if (toplevel_bindings_p ())
11621 /* At the global level, if these are all identifiers,
11622 then it is a parmlist. */
11625 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11627 exprs
= TREE_CHAIN (exprs
);
11634 /* Subroutine of start_function. Ensure that each of the parameter
11635 types (as listed in PARMS) is complete, as is required for a
11636 function definition. */
11639 require_complete_types_for_parms (parms
)
11642 for (; parms
; parms
= TREE_CHAIN (parms
))
11644 if (VOID_TYPE_P (TREE_TYPE (parms
)))
11645 /* grokparms will have already issued an error */
11646 TREE_TYPE (parms
) = error_mark_node
;
11647 else if (complete_type_or_else (TREE_TYPE (parms
), parms
))
11648 layout_decl (parms
, 0);
11650 TREE_TYPE (parms
) = error_mark_node
;
11654 /* Returns non-zero if T is a local variable. */
11657 local_variable_p (t
)
11660 if ((TREE_CODE (t
) == VAR_DECL
11661 /* A VAR_DECL with a context that is a _TYPE is a static data
11663 && !TYPE_P (CP_DECL_CONTEXT (t
))
11664 /* Any other non-local variable must be at namespace scope. */
11665 && !DECL_NAMESPACE_SCOPE_P (t
))
11666 || (TREE_CODE (t
) == PARM_DECL
))
11672 /* Returns non-zero if T is an automatic local variable or a label.
11673 (These are the declarations that need to be remapped when the code
11674 containing them is duplicated.) */
11677 nonstatic_local_decl_p (t
)
11680 return ((local_variable_p (t
) && !TREE_STATIC (t
))
11681 || TREE_CODE (t
) == LABEL_DECL
11682 || TREE_CODE (t
) == RESULT_DECL
);
11685 /* Like local_variable_p, but suitable for use as a tree-walking
11689 local_variable_p_walkfn (tp
, walk_subtrees
, data
)
11691 int *walk_subtrees ATTRIBUTE_UNUSED
;
11692 void *data ATTRIBUTE_UNUSED
;
11694 return ((local_variable_p (*tp
) && !DECL_ARTIFICIAL (*tp
))
11695 ? *tp
: NULL_TREE
);
11698 /* Check that ARG, which is a default-argument expression for a
11699 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11700 something goes wrong. DECL may also be a _TYPE node, rather than a
11701 DECL, if there is no DECL available. */
11704 check_default_argument (decl
, arg
)
11711 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11712 /* We get a DEFAULT_ARG when looking at an in-class declaration
11713 with a default argument. Ignore the argument for now; we'll
11714 deal with it after the class is complete. */
11717 if (processing_template_decl
|| uses_template_parms (arg
))
11718 /* We don't do anything checking until instantiation-time. Note
11719 that there may be uninstantiated arguments even for an
11720 instantiated function, since default arguments are not
11721 instantiated until they are needed. */
11730 decl_type
= TREE_TYPE (decl
);
11732 if (arg
== error_mark_node
11733 || decl
== error_mark_node
11734 || TREE_TYPE (arg
) == error_mark_node
11735 || decl_type
== error_mark_node
)
11736 /* Something already went wrong. There's no need to check
11738 return error_mark_node
;
11740 /* [dcl.fct.default]
11742 A default argument expression is implicitly converted to the
11744 if (!TREE_TYPE (arg
)
11745 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11748 cp_error ("default argument for `%#D' has type `%T'",
11749 decl
, TREE_TYPE (arg
));
11751 cp_error ("default argument for parameter of type `%T' has type `%T'",
11752 decl_type
, TREE_TYPE (arg
));
11754 return error_mark_node
;
11757 /* [dcl.fct.default]
11759 Local variables shall not be used in default argument
11762 The keyword `this' shall not be used in a default argument of a
11763 member function. */
11764 var
= walk_tree_without_duplicates (&arg
, local_variable_p_walkfn
,
11768 cp_error ("default argument `%E' uses local variable `%D'",
11770 return error_mark_node
;
11777 /* Decode the list of parameter types for a function type.
11778 Given the list of things declared inside the parens,
11779 return a list of types.
11781 We determine whether ellipsis parms are used by PARMLIST_ELLIPSIS_P
11782 flag. If unset, we append void_list_node. A parmlist declared
11783 as `(void)' is accepted as the empty parmlist.
11785 Also set last_function_parms to the chain of PARM_DECLs. */
11788 grokparms (first_parm
)
11791 tree result
= NULL_TREE
;
11792 tree decls
= NULL_TREE
;
11793 int ellipsis
= !first_parm
|| PARMLIST_ELLIPSIS_P (first_parm
);
11797 my_friendly_assert (!first_parm
|| TREE_PARMLIST (first_parm
), 20001115);
11799 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11801 tree type
= NULL_TREE
;
11802 register tree decl
= TREE_VALUE (parm
);
11803 tree init
= TREE_PURPOSE (parm
);
11805 chain
= TREE_CHAIN (parm
);
11806 /* @@ weak defense against parse errors. */
11807 if (TREE_CODE (decl
) != VOID_TYPE
11808 && TREE_CODE (decl
) != TREE_LIST
)
11810 /* Give various messages as the need arises. */
11811 if (TREE_CODE (decl
) == STRING_CST
)
11812 cp_error ("invalid string constant `%E'", decl
);
11813 else if (TREE_CODE (decl
) == INTEGER_CST
)
11814 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11818 if (parm
== void_list_node
)
11821 decl
= grokdeclarator (TREE_VALUE (decl
), TREE_PURPOSE (decl
),
11822 PARM
, init
!= NULL_TREE
, NULL_TREE
);
11823 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
11826 type
= TREE_TYPE (decl
);
11827 if (VOID_TYPE_P (type
))
11829 if (same_type_p (type
, void_type_node
)
11830 && !DECL_NAME (decl
) && !result
&& !chain
&& !ellipsis
)
11831 /* this is a parmlist of `(void)', which is ok. */
11833 incomplete_type_error (decl
, type
);
11834 /* It's not a good idea to actually create parameters of
11835 type `void'; other parts of the compiler assume that a
11836 void type terminates the parameter list. */
11837 type
= error_mark_node
;
11838 TREE_TYPE (decl
) = error_mark_node
;
11841 if (type
!= error_mark_node
)
11843 /* Top-level qualifiers on the parameters are
11844 ignored for function types. */
11845 type
= TYPE_MAIN_VARIANT (type
);
11846 if (TREE_CODE (type
) == METHOD_TYPE
)
11848 cp_error ("parameter `%D' invalidly declared method type", decl
);
11849 type
= build_pointer_type (type
);
11850 TREE_TYPE (decl
) = type
;
11852 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11854 cp_error ("parameter `%D' invalidly declared offset type", decl
);
11855 type
= build_pointer_type (type
);
11856 TREE_TYPE (decl
) = type
;
11858 else if (abstract_virtuals_error (decl
, type
))
11859 any_error
= 1; /* Seems like a good idea. */
11860 else if (POINTER_TYPE_P (type
))
11862 /* [dcl.fct]/6, parameter types cannot contain pointers
11863 (references) to arrays of unknown bound. */
11864 tree t
= TREE_TYPE (type
);
11865 int ptr
= TYPE_PTR_P (type
);
11869 if (TYPE_PTR_P (t
))
11871 else if (TREE_CODE (t
) != ARRAY_TYPE
)
11873 else if (!TYPE_DOMAIN (t
))
11877 if (TREE_CODE (t
) == ARRAY_TYPE
)
11878 cp_error ("parameter `%D' includes %s to array of unknown bound `%T'",
11879 decl
, ptr
? "pointer" : "reference", t
);
11882 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
11883 if (PROMOTE_PROTOTYPES
11884 && (TREE_CODE (type
) == INTEGER_TYPE
11885 || TREE_CODE (type
) == ENUMERAL_TYPE
)
11886 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
11887 DECL_ARG_TYPE (decl
) = integer_type_node
;
11888 if (!any_error
&& init
)
11889 init
= check_default_argument (decl
, init
);
11894 TREE_CHAIN (decl
) = decls
;
11896 result
= tree_cons (init
, type
, result
);
11898 decls
= nreverse (decls
);
11899 result
= nreverse (result
);
11901 result
= chainon (result
, void_list_node
);
11902 last_function_parms
= decls
;
11908 /* D is a constructor or overloaded `operator='. Returns non-zero if
11909 D's arguments allow it to be a copy constructor, or copy assignment
11918 if (!DECL_FUNCTION_MEMBER_P (d
))
11921 t
= FUNCTION_FIRST_USER_PARMTYPE (d
);
11922 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
11923 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
11924 == DECL_CONTEXT (d
))
11925 && (TREE_CHAIN (t
) == NULL_TREE
11926 || TREE_CHAIN (t
) == void_list_node
11927 || TREE_PURPOSE (TREE_CHAIN (t
))))
11932 /* These memoizing functions keep track of special properties which
11933 a class may have. `grok_ctor_properties' notices whether a class
11934 has a constructor of the form X(X&), and also complains
11935 if the class has a constructor of the form X(X).
11936 `grok_op_properties' takes notice of the various forms of
11937 operator= which are defined, as well as what sorts of type conversion
11938 may apply. Both functions take a FUNCTION_DECL as an argument. */
11941 grok_ctor_properties (ctype
, decl
)
11944 tree parmtypes
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
11945 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
11949 A non-template constructor for class X is a copy constructor if
11950 its first parameter is of type X&, const X&, volatile X& or const
11951 volatile X&, and either there are no other parameters or else all
11952 other parameters have default arguments. */
11953 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
11954 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
11955 && sufficient_parms_p (TREE_CHAIN (parmtypes
))
11956 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11957 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11959 TYPE_HAS_INIT_REF (ctype
) = 1;
11960 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11961 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
11965 A declaration of a constructor for a class X is ill-formed if its
11966 first parameter is of type (optionally cv-qualified) X and either
11967 there are no other parameters or else all other parameters have
11970 We *don't* complain about member template instantiations that
11971 have this form, though; they can occur as we try to decide what
11972 constructor to use during overload resolution. Since overload
11973 resolution will never prefer such a constructor to the
11974 non-template copy constructor (which is either explicitly or
11975 implicitly defined), there's no need to worry about their
11976 existence. Theoretically, they should never even be
11977 instantiated, but that's hard to forestall. */
11978 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
11979 && sufficient_parms_p (TREE_CHAIN (parmtypes
))
11980 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11981 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11983 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
11985 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
11988 else if (TREE_CODE (parmtype
) == VOID_TYPE
11989 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
11990 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
11995 /* An operator with this code is unary, but can also be binary. */
11999 enum tree_code code
;
12001 return (code
== INDIRECT_REF
12002 || code
== ADDR_EXPR
12003 || code
== CONVERT_EXPR
12004 || code
== NEGATE_EXPR
12005 || code
== PREINCREMENT_EXPR
12006 || code
== PREDECREMENT_EXPR
);
12009 /* An operator with this name can only be unary. */
12013 enum tree_code code
;
12015 return (code
== TRUTH_NOT_EXPR
12016 || code
== BIT_NOT_EXPR
12017 || code
== COMPONENT_REF
12018 || code
== TYPE_EXPR
);
12021 /* Do a little sanity-checking on how they declared their operator. */
12024 grok_op_properties (decl
, virtualp
, friendp
)
12026 int virtualp
, friendp
;
12028 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
12030 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
12031 tree name
= DECL_NAME (decl
);
12032 enum tree_code operator_code
;
12035 /* Count the number of arguments. */
12036 for (argtype
= argtypes
, arity
= 0;
12037 argtype
&& argtype
!= void_list_node
;
12038 argtype
= TREE_CHAIN (argtype
))
12041 if (current_class_type
== NULL_TREE
)
12044 if (DECL_CONV_FN_P (decl
))
12045 operator_code
= TYPE_EXPR
;
12049 #define DEF_OPERATOR(NAME, CODE, NEW_MANGLING, OLD_MANGING, ARITY, ASSN_P) \
12050 if (ansi_opname (CODE) == name) \
12052 operator_code = CODE; \
12055 else if (ansi_assopname (CODE) == name) \
12057 operator_code = CODE; \
12058 DECL_ASSIGNMENT_OPERATOR_P (decl) = 1; \
12062 #include "operators.def"
12063 #undef DEF_OPERATOR
12065 my_friendly_abort (20000527);
12068 my_friendly_assert (operator_code
!= LAST_CPLUS_TREE_CODE
, 20000526);
12069 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12073 switch (operator_code
)
12076 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
12080 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
12083 case COMPONENT_REF
:
12085 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
12089 TYPE_HAS_NEW_OPERATOR (current_class_type
) = 1;
12093 TYPE_GETS_DELETE (current_class_type
) |= 1;
12097 TYPE_HAS_ARRAY_NEW_OPERATOR (current_class_type
) = 1;
12100 case VEC_DELETE_EXPR
:
12101 TYPE_GETS_DELETE (current_class_type
) |= 2;
12109 if (operator_code
== NEW_EXPR
|| operator_code
== VEC_NEW_EXPR
)
12111 /* When the compiler encounters the definition of A::operator new, it
12112 doesn't look at the class declaration to find out if it's static. */
12114 revert_static_member_fn (decl
);
12116 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
12118 else if (operator_code
== DELETE_EXPR
|| operator_code
== VEC_DELETE_EXPR
)
12121 revert_static_member_fn (decl
);
12123 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
12127 /* An operator function must either be a non-static member function
12128 or have at least one parameter of a class, a reference to a class,
12129 an enumeration, or a reference to an enumeration. 13.4.0.6 */
12130 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
12132 if (operator_code
== TYPE_EXPR
12133 || operator_code
== CALL_EXPR
12134 || operator_code
== COMPONENT_REF
12135 || operator_code
== ARRAY_REF
12136 || operator_code
== NOP_EXPR
)
12137 cp_error ("`%D' must be a nonstatic member function", decl
);
12142 if (DECL_STATIC_FUNCTION_P (decl
))
12143 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
12146 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
12148 tree arg
= TREE_VALUE (p
);
12149 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
12150 arg
= TREE_TYPE (arg
);
12152 /* This lets bad template code slip through. */
12153 if (IS_AGGR_TYPE (arg
)
12154 || TREE_CODE (arg
) == ENUMERAL_TYPE
12155 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
12156 || TREE_CODE (arg
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
12160 ("`%D' must have an argument of class or enumerated type",
12167 if (operator_code
== CALL_EXPR
)
12168 return; /* No restrictions on args. */
12170 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
12172 tree t
= TREE_TYPE (name
);
12175 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
12176 const char *what
= 0;
12179 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
12181 if (TREE_CODE (t
) == VOID_TYPE
)
12183 else if (t
== current_class_type
)
12184 what
= "the same type";
12185 /* Don't force t to be complete here. */
12186 else if (IS_AGGR_TYPE (t
)
12187 && COMPLETE_TYPE_P (t
)
12188 && DERIVED_FROM_P (t
, current_class_type
))
12189 what
= "a base class";
12192 warning ("conversion to %s%s will never use a type conversion operator",
12193 ref
? "a reference to " : "", what
);
12197 if (DECL_ASSIGNMENT_OPERATOR_P (decl
)
12198 && operator_code
== NOP_EXPR
)
12202 if (arity
!= 2 && methodp
)
12204 cp_error ("`%D' must take exactly one argument", decl
);
12207 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
12211 A user-declared copy assignment operator X::operator= is
12212 a non-static non-template member function of class X with
12213 exactly one parameter of type X, X&, const X&, volatile
12214 X& or const volatile X&. */
12215 if (copy_assignment_arg_p (parmtype
, virtualp
)
12216 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12217 && is_member_template (DECL_TI_TEMPLATE (decl
)))
12220 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
12221 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
12222 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12223 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
12226 else if (operator_code
== COND_EXPR
)
12229 cp_error ("ISO C++ prohibits overloading operator ?:");
12231 else if (ambi_op_p (operator_code
))
12234 /* We pick the one-argument operator codes by default, so
12235 we don't have to change anything. */
12237 else if (arity
== 2)
12239 /* If we thought this was a unary operator, we now know
12240 it to be a binary operator. */
12241 switch (operator_code
)
12244 operator_code
= MULT_EXPR
;
12248 operator_code
= BIT_AND_EXPR
;
12252 operator_code
= PLUS_EXPR
;
12256 operator_code
= MINUS_EXPR
;
12259 case PREINCREMENT_EXPR
:
12260 operator_code
= POSTINCREMENT_EXPR
;
12263 case PREDECREMENT_EXPR
:
12264 operator_code
= POSTDECREMENT_EXPR
;
12268 my_friendly_abort (20000527);
12271 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12273 if ((operator_code
== POSTINCREMENT_EXPR
12274 || operator_code
== POSTDECREMENT_EXPR
)
12275 && ! processing_template_decl
12276 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
12279 cp_error ("postfix `%D' must take `int' as its argument",
12283 ("postfix `%D' must take `int' as its second argument",
12290 cp_error ("`%D' must take either zero or one argument", decl
);
12292 cp_error ("`%D' must take either one or two arguments", decl
);
12295 /* More Effective C++ rule 6. */
12297 && (operator_code
== POSTINCREMENT_EXPR
12298 || operator_code
== POSTDECREMENT_EXPR
12299 || operator_code
== PREINCREMENT_EXPR
12300 || operator_code
== PREDECREMENT_EXPR
))
12302 tree arg
= TREE_VALUE (argtypes
);
12303 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
12304 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
12305 arg
= TREE_TYPE (arg
);
12306 arg
= TYPE_MAIN_VARIANT (arg
);
12307 if (operator_code
== PREINCREMENT_EXPR
12308 || operator_code
== PREDECREMENT_EXPR
)
12310 if (TREE_CODE (ret
) != REFERENCE_TYPE
12311 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
12313 cp_warning ("prefix `%D' should return `%T'", decl
,
12314 build_reference_type (arg
));
12318 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
12319 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
12323 else if (unary_op_p (operator_code
))
12328 cp_error ("`%D' must take `void'", decl
);
12330 cp_error ("`%D' must take exactly one argument", decl
);
12333 else /* if (binary_op_p (operator_code)) */
12338 cp_error ("`%D' must take exactly one argument", decl
);
12340 cp_error ("`%D' must take exactly two arguments", decl
);
12343 /* More Effective C++ rule 7. */
12345 && (operator_code
== TRUTH_ANDIF_EXPR
12346 || operator_code
== TRUTH_ORIF_EXPR
12347 || operator_code
== COMPOUND_EXPR
))
12348 cp_warning ("user-defined `%D' always evaluates both arguments",
12352 /* Effective C++ rule 23. */
12355 && (operator_code
== PLUS_EXPR
12356 || operator_code
== MINUS_EXPR
12357 || operator_code
== TRUNC_DIV_EXPR
12358 || operator_code
== MULT_EXPR
)
12359 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
12360 cp_warning ("`%D' should return by value", decl
);
12363 for (; argtypes
&& argtypes
!= void_list_node
;
12364 argtypes
= TREE_CHAIN (argtypes
))
12365 if (TREE_PURPOSE (argtypes
))
12367 TREE_PURPOSE (argtypes
) = NULL_TREE
;
12368 if (operator_code
== POSTINCREMENT_EXPR
12369 || operator_code
== POSTDECREMENT_EXPR
)
12372 cp_pedwarn ("`%D' cannot have default arguments", decl
);
12375 cp_error ("`%D' cannot have default arguments", decl
);
12381 static const char *
12383 enum tag_types code
;
12396 my_friendly_abort (981122);
12400 /* Get the struct, enum or union (CODE says which) with tag NAME.
12401 Define the tag as a forward-reference if it is not defined.
12403 C++: If a class derivation is given, process it here, and report
12404 an error if multiple derivation declarations are not identical.
12406 If this is a definition, come in through xref_tag and only look in
12407 the current frame for the name (since C++ allows new names in any
12411 xref_tag (code_type_node
, name
, globalize
)
12412 tree code_type_node
;
12416 enum tag_types tag_code
;
12417 enum tree_code code
;
12418 register tree ref
, t
;
12419 struct binding_level
*b
= current_binding_level
;
12421 tree attributes
= NULL_TREE
;
12422 tree context
= NULL_TREE
;
12424 /* If we are called from the parser, code_type_node will sometimes be a
12425 TREE_LIST. This indicates that the user wrote
12426 "class __attribute__ ((foo)) bar". Extract the attributes so we can
12428 if (TREE_CODE (code_type_node
) == TREE_LIST
)
12430 attributes
= TREE_PURPOSE (code_type_node
);
12431 code_type_node
= TREE_VALUE (code_type_node
);
12434 tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12439 code
= RECORD_TYPE
;
12445 code
= ENUMERAL_TYPE
;
12448 my_friendly_abort (18);
12451 /* If a cross reference is requested, look up the type
12452 already defined for this tag and return it. */
12456 name
= TYPE_IDENTIFIER (t
);
12460 t
= IDENTIFIER_TYPE_VALUE (name
);
12462 /* Warn about 'friend struct Inherited;' doing the wrong thing. */
12463 if (t
&& globalize
&& TREE_CODE (t
) == TYPENAME_TYPE
)
12465 static int explained
;
12467 cp_warning ("`%s %T' declares a new type at namespace scope;\n\
12468 to refer to the inherited type, say `%s %T::%T'%s",
12469 tag_name (tag_code
), name
, tag_name (tag_code
),
12470 constructor_name (current_class_type
), TYPE_IDENTIFIER (t
),
12472 (names from dependent base classes are not visible to unqualified name lookup)"
12478 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
12479 && TREE_CODE (t
) != BOUND_TEMPLATE_TEMPLATE_PARM
)
12484 /* If we know we are defining this tag, only look it up in
12485 this scope and don't try to find it as a type. */
12486 ref
= lookup_tag (code
, name
, b
, 1);
12492 /* [dcl.type.elab] If the identifier resolves to a
12493 typedef-name or a template type-parameter, the
12494 elaborated-type-specifier is ill-formed. */
12495 if (t
!= TYPE_MAIN_VARIANT (t
)
12496 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
12497 cp_pedwarn ("using typedef-name `%D' after `%s'",
12498 TYPE_NAME (t
), tag_name (tag_code
));
12499 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12500 cp_error ("using template type parameter `%T' after `%s'",
12501 t
, tag_name (tag_code
));
12506 ref
= lookup_tag (code
, name
, b
, 0);
12510 /* Try finding it as a type declaration. If that wins,
12512 ref
= lookup_name (name
, 1);
12514 if (ref
!= NULL_TREE
12515 && processing_template_decl
12516 && DECL_CLASS_TEMPLATE_P (ref
)
12517 && template_class_depth (current_class_type
) == 0)
12518 /* Since GLOBALIZE is true, we're declaring a global
12519 template, so we want this type. */
12520 ref
= DECL_TEMPLATE_RESULT (ref
);
12522 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12523 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12524 ref
= TREE_TYPE (ref
);
12529 if (ref
&& current_class_type
12530 && template_class_depth (current_class_type
)
12531 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12533 /* Since GLOBALIZE is non-zero, we are not looking at a
12534 definition of this tag. Since, in addition, we are currently
12535 processing a (member) template declaration of a template
12536 class, we must be very careful; consider:
12543 { template <class V>
12544 friend struct S1; };
12546 Here, the S2::S1 declaration should not be confused with the
12547 outer declaration. In particular, the inner version should
12548 have a template parameter of level 2, not level 1. This
12549 would be particularly important if the member declaration
12552 template <class V = U> friend struct S1;
12554 say, when we should tsubst into `U' when instantiating
12555 S2. On the other hand, when presented with:
12565 we must find the inner binding eventually. We
12566 accomplish this by making sure that the new type we
12567 create to represent this declaration has the right
12569 context
= TYPE_CONTEXT (ref
);
12576 /* If no such tag is yet defined, create a forward-reference node
12577 and record it as the "definition".
12578 When a real declaration of this type is found,
12579 the forward-reference will be altered into a real type. */
12580 if (code
== ENUMERAL_TYPE
)
12582 cp_error ("use of enum `%#D' without previous declaration", name
);
12584 ref
= make_node (ENUMERAL_TYPE
);
12586 /* Give the type a default layout like unsigned int
12587 to avoid crashing if it does not get defined. */
12588 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12589 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12590 TYPE_USER_ALIGN (ref
) = 0;
12591 TREE_UNSIGNED (ref
) = 1;
12592 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12593 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12594 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12596 /* Enable us to recognize when a type is created in class context.
12597 To do nested classes correctly, this should probably be cleared
12598 out when we leave this classes scope. Currently this in only
12599 done in `start_enum'. */
12601 pushtag (name
, ref
, globalize
);
12605 struct binding_level
*old_b
= class_binding_level
;
12607 ref
= make_aggr_type (code
);
12608 TYPE_CONTEXT (ref
) = context
;
12610 #ifdef NONNESTED_CLASSES
12611 /* Class types don't nest the way enums do. */
12612 class_binding_level
= (struct binding_level
*)0;
12614 pushtag (name
, ref
, globalize
);
12615 class_binding_level
= old_b
;
12620 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12621 redeclare_class_template (ref
, current_template_parms
);
12624 /* Until the type is defined, tentatively accept whatever
12625 structure tag the user hands us. */
12626 if (!COMPLETE_TYPE_P (ref
)
12627 && ref
!= current_class_type
12628 /* Have to check this, in case we have contradictory tag info. */
12629 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12631 if (tag_code
== class_type
)
12632 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12633 else if (tag_code
== record_type
)
12634 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12637 TREE_TYPE (ref
) = attributes
;
12643 xref_tag_from_type (old
, id
, globalize
)
12647 tree code_type_node
;
12649 if (TREE_CODE (old
) == RECORD_TYPE
)
12650 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12651 ? class_type_node
: record_type_node
);
12653 code_type_node
= union_type_node
;
12655 if (id
== NULL_TREE
)
12656 id
= TYPE_IDENTIFIER (old
);
12658 return xref_tag (code_type_node
, id
, globalize
);
12661 /* REF is a type (named NAME), for which we have just seen some
12662 baseclasses. BINFO is a list of those baseclasses; the
12663 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12664 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12665 struct, or union. */
12668 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12669 tree code_type_node
;
12673 /* In the declaration `A : X, Y, ... Z' we mark all the types
12674 (A, X, Y, ..., Z) so we can check for duplicates. */
12679 enum tag_types tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12681 if (tag_code
== union_type
)
12683 cp_error ("derived union `%T' invalid", ref
);
12687 len
= list_length (binfo
);
12689 /* First, make sure that any templates in base-classes are
12690 instantiated. This ensures that if we call ourselves recursively
12691 we do not get confused about which classes are marked and which
12693 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12694 complete_type (TREE_VALUE (base
));
12696 SET_CLASSTYPE_MARKED (ref
);
12697 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12699 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12701 /* The base of a derived struct is public by default. */
12703 = (TREE_PURPOSE (binfo
) == access_public_node
12704 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12705 || (tag_code
!= class_type
12706 && (TREE_PURPOSE (binfo
) == access_default_node
12707 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12709 = (TREE_PURPOSE (binfo
) == access_protected_node
12710 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12712 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12713 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12714 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12715 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12716 tree basetype
= TREE_VALUE (binfo
);
12719 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12720 basetype
= TREE_TYPE (basetype
);
12722 || (TREE_CODE (basetype
) != RECORD_TYPE
12723 && TREE_CODE (basetype
) != TYPENAME_TYPE
12724 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12725 && TREE_CODE (basetype
) != BOUND_TEMPLATE_TEMPLATE_PARM
))
12727 cp_error ("base type `%T' fails to be a struct or class type",
12728 TREE_VALUE (binfo
));
12732 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12734 /* This code replaces similar code in layout_basetypes.
12735 We put the complete_type first for implicit `typename'. */
12736 if (!COMPLETE_TYPE_P (basetype
)
12737 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12739 cp_error ("base class `%T' has incomplete type", basetype
);
12744 if (CLASSTYPE_MARKED (basetype
))
12746 if (basetype
== ref
)
12747 cp_error ("recursive type `%T' undefined", basetype
);
12749 cp_error ("duplicate base type `%T' invalid", basetype
);
12753 if (TYPE_FOR_JAVA (basetype
)
12754 && (current_lang_stack
12755 == &VARRAY_TREE (current_lang_base
, 0)))
12756 TYPE_FOR_JAVA (ref
) = 1;
12758 /* Note that the BINFO records which describe individual
12759 inheritances are *not* shared in the lattice! They
12760 cannot be shared because a given baseclass may be
12761 inherited with different `accessibility' by different
12762 derived classes. (Each BINFO record describing an
12763 individual inheritance contains flags which say what
12764 the `accessibility' of that particular inheritance is.) */
12767 = make_binfo (size_zero_node
, basetype
,
12768 CLASS_TYPE_P (basetype
)
12769 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
12770 CLASS_TYPE_P (basetype
)
12771 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
12773 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
12774 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
12775 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
12776 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
12777 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
12779 /* We need to unshare the binfos now so that lookups during class
12780 definition work. */
12781 unshare_base_binfos (base_binfo
);
12783 SET_CLASSTYPE_MARKED (basetype
);
12785 /* We are free to modify these bits because they are meaningless
12786 at top level, and BASETYPE is a top-level type. */
12787 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
12789 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
12790 /* Converting to a virtual base class requires looking
12791 up the offset of the virtual base. */
12792 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
12795 if (CLASS_TYPE_P (basetype
))
12797 TYPE_HAS_NEW_OPERATOR (ref
)
12798 |= TYPE_HAS_NEW_OPERATOR (basetype
);
12799 TYPE_HAS_ARRAY_NEW_OPERATOR (ref
)
12800 |= TYPE_HAS_ARRAY_NEW_OPERATOR (basetype
);
12801 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
12802 /* If the base-class uses multiple inheritance, so do we. */
12803 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
12804 |= TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
12805 /* Likewise, if converting to a base of the base may require
12806 code, then we may need to generate code to convert to a
12808 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
)
12809 |= TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (basetype
);
12816 TREE_VEC_LENGTH (binfos
) = i
;
12818 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
12822 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
12823 /* If there is more than one non-empty they cannot be at the same
12825 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
12828 /* Unmark all the types. */
12830 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
12831 CLEAR_CLASSTYPE_MARKED (ref
);
12833 /* Now that we know all the base-classes, set up the list of virtual
12835 get_vbase_types (ref
);
12839 /* Begin compiling the definition of an enumeration type.
12840 NAME is its name (or null if anonymous).
12841 Returns the type object, as yet incomplete.
12842 Also records info about it so that build_enumerator
12843 may be used to declare the individual values as they are read. */
12849 register tree enumtype
= NULL_TREE
;
12850 struct binding_level
*b
= current_binding_level
;
12852 /* If this is the real definition for a previous forward reference,
12853 fill in the contents in the same object that used to be the
12854 forward reference. */
12856 if (name
!= NULL_TREE
)
12857 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
12859 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
12861 cp_error ("multiple definition of `%#T'", enumtype
);
12862 cp_error_at ("previous definition here", enumtype
);
12863 /* Clear out TYPE_VALUES, and start again. */
12864 TYPE_VALUES (enumtype
) = NULL_TREE
;
12868 enumtype
= make_node (ENUMERAL_TYPE
);
12869 pushtag (name
, enumtype
, 0);
12872 if (current_class_type
)
12873 TREE_ADDRESSABLE (b
->tags
) = 1;
12875 GNU_xref_decl (current_function_decl
, enumtype
);
12879 /* After processing and defining all the values of an enumeration type,
12880 install their decls in the enumeration type and finish it off.
12881 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12882 Returns ENUMTYPE. */
12885 finish_enum (enumtype
)
12888 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
12889 /* Calculate the maximum value of any enumerator in this type. */
12891 tree values
= TYPE_VALUES (enumtype
);
12896 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
12901 /* The TREE_VALUE is a CONST_DECL for this enumeration
12903 decl
= TREE_VALUE (pair
);
12907 Following the closing brace of an enum-specifier, each
12908 enumerator has the type of its enumeration. Prior to the
12909 closing brace, the type of each enumerator is the type of
12910 its initializing value. */
12911 TREE_TYPE (decl
) = enumtype
;
12913 /* The DECL_INITIAL will be NULL if we are processing a
12914 template declaration and this enumeration constant had no
12915 explicit initializer. */
12916 value
= DECL_INITIAL (decl
);
12917 if (value
&& !processing_template_decl
)
12919 /* Set the TREE_TYPE for the VALUE as well. That's so
12920 that when we call decl_constant_value we get an
12921 entity of the right type (but with the constant
12922 value). Since we shouldn't ever call
12923 decl_constant_value on a template type, there's no
12924 reason to do that when processing_template_decl.
12925 And, if the expression is something like a
12926 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12927 wreak havoc on the intended type of the expression.
12929 Of course, there's also no point in trying to compute
12930 minimum or maximum values if we're in a template. */
12931 TREE_TYPE (value
) = enumtype
;
12934 minnode
= maxnode
= value
;
12935 else if (tree_int_cst_lt (maxnode
, value
))
12937 else if (tree_int_cst_lt (value
, minnode
))
12941 if (processing_template_decl
)
12942 /* If this is just a template, leave the CONST_DECL
12943 alone. That way tsubst_copy will find CONST_DECLs for
12944 CONST_DECLs, and not INTEGER_CSTs. */
12947 /* In the list we're building up, we want the enumeration
12948 values, not the CONST_DECLs. */
12949 TREE_VALUE (pair
) = value
;
12953 maxnode
= minnode
= integer_zero_node
;
12955 TYPE_VALUES (enumtype
) = nreverse (values
);
12957 if (processing_template_decl
)
12959 tree scope
= current_scope ();
12960 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
12961 add_stmt (build_min (TAG_DEFN
, enumtype
));
12965 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
12966 int lowprec
= min_precision (minnode
, unsignedp
);
12967 int highprec
= min_precision (maxnode
, unsignedp
);
12968 int precision
= MAX (lowprec
, highprec
);
12971 TYPE_SIZE (enumtype
) = NULL_TREE
;
12973 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
12975 TYPE_PRECISION (enumtype
) = precision
;
12977 fixup_unsigned_type (enumtype
);
12979 fixup_signed_type (enumtype
);
12981 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
12982 /* Use the width of the narrowest normal C type which is wide
12984 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
12987 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
12989 TYPE_SIZE (enumtype
) = 0;
12990 layout_type (enumtype
);
12992 /* Fix up all variant types of this enum type. */
12993 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
12994 tem
= TYPE_NEXT_VARIANT (tem
))
12996 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
12997 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
12998 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
12999 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
13000 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
13001 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
13002 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
13003 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
13004 TYPE_USER_ALIGN (tem
) = TYPE_USER_ALIGN (enumtype
);
13005 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
13008 /* Finish debugging output for this type. */
13009 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
13015 /* Build and install a CONST_DECL for an enumeration constant of the
13016 enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided.
13017 Assignment of sequential values by default is handled here. */
13020 build_enumerator (name
, value
, enumtype
)
13030 /* Remove no-op casts from the value. */
13032 STRIP_TYPE_NOPS (value
);
13034 if (! processing_template_decl
)
13036 /* Validate and default VALUE. */
13037 if (value
!= NULL_TREE
)
13039 value
= decl_constant_value (value
);
13041 if (TREE_CODE (value
) == INTEGER_CST
)
13043 value
= default_conversion (value
);
13044 constant_expression_warning (value
);
13048 cp_error ("enumerator value for `%D' not integer constant", name
);
13053 /* Default based on previous value. */
13054 if (value
== NULL_TREE
&& ! processing_template_decl
)
13058 if (TYPE_VALUES (enumtype
))
13060 /* The next value is the previous value ... */
13061 prev_value
= DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype
)));
13062 /* ... plus one. */
13063 value
= cp_build_binary_op (PLUS_EXPR
,
13067 if (tree_int_cst_lt (value
, prev_value
))
13068 cp_error ("overflow in enumeration values at `%D'", name
);
13071 value
= integer_zero_node
;
13074 /* Remove no-op casts from the value. */
13076 STRIP_TYPE_NOPS (value
);
13078 /* To fix MAX_VAL enum consts. (bkoz) */
13079 TREE_TYPE (value
) = integer_type_node
;
13083 /* We always have to copy here; not all INTEGER_CSTs are unshared.
13084 Even in other cases, we will later (in finish_enum) be setting
13085 the type of VALUE. But, we don't need to make a copy if this
13086 VALUE is one of the enumeration constants for this same
13087 enumeration type. */
13088 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
13089 if (TREE_VALUE (values
) == value
)
13091 /* If we didn't break out of the loop, then we do need a copy. */
13092 if (!values
&& value
)
13093 value
= copy_node (value
);
13095 /* C++ associates enums with global, function, or class declarations. */
13096 context
= current_scope ();
13098 /* Build the actual enumeration constant. Note that the enumeration
13099 constants have the type of their initializers until the
13100 enumeration is complete:
13104 Following the closing brace of an enum-specifier, each enumer-
13105 ator has the type of its enumeration. Prior to the closing
13106 brace, the type of each enumerator is the type of its
13107 initializing value.
13109 In finish_enum we will reset the type. Of course, if we're
13110 processing a template, there may be no value. */
13111 type
= value
? TREE_TYPE (value
) : NULL_TREE
;
13113 if (context
&& context
== current_class_type
)
13114 /* This enum declaration is local to the class. We need the full
13115 lang_decl so that we can record DECL_CLASS_CONTEXT, for example. */
13116 decl
= build_lang_decl (CONST_DECL
, name
, type
);
13118 /* It's a global enum, or it's local to a function. (Note local to
13119 a function could mean local to a class method. */
13120 decl
= build_decl (CONST_DECL
, name
, type
);
13122 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
13123 DECL_INITIAL (decl
) = value
;
13124 TREE_READONLY (decl
) = 1;
13126 if (context
&& context
== current_class_type
)
13127 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
13128 on the TYPE_FIELDS list for `S'. (That's so that you can say
13129 things like `S::i' later.) */
13130 finish_member_declaration (decl
);
13134 GNU_xref_decl (current_function_decl
, decl
);
13137 /* Add this enumeration constant to the list for this type. */
13138 TYPE_VALUES (enumtype
) = tree_cons (name
, decl
, TYPE_VALUES (enumtype
));
13142 /* We're defining DECL. Make sure that it's type is OK. */
13145 check_function_type (decl
, current_function_parms
)
13147 tree current_function_parms
;
13149 tree fntype
= TREE_TYPE (decl
);
13150 tree return_type
= complete_type (TREE_TYPE (fntype
));
13152 /* In a function definition, arg types must be complete. */
13153 require_complete_types_for_parms (current_function_parms
);
13155 if (!COMPLETE_OR_VOID_TYPE_P (return_type
))
13157 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
13159 /* Make it return void instead, but don't change the
13160 type of the DECL_RESULT, in case we have a named return value. */
13161 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13163 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
13165 = build_cplus_method_type (ctype
,
13167 FUNCTION_ARG_CHAIN (decl
));
13171 = build_function_type (void_type_node
,
13172 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
13174 = build_exception_variant (fntype
,
13175 TYPE_RAISES_EXCEPTIONS (fntype
));
13178 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
13181 /* Create the FUNCTION_DECL for a function definition.
13182 DECLSPECS and DECLARATOR are the parts of the declaration;
13183 they describe the function's name and the type it returns,
13184 but twisted together in a fashion that parallels the syntax of C.
13186 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
13187 DECLARATOR is really the DECL for the function we are about to
13188 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
13189 indicating that the function is an inline defined in-class.
13191 This function creates a binding context for the function body
13192 as well as setting up the FUNCTION_DECL in current_function_decl.
13194 Returns 1 on success. If the DECLARATOR is not suitable for a function
13195 (it defines a datum instead), we return 0, which tells
13196 yyparse to report a parse error.
13198 For C++, we must first check whether that datum makes any sense.
13199 For example, "class A local_a(1,2);" means that variable local_a
13200 is an aggregate of type A, which should have a constructor
13201 applied to it with the argument list [1, 2]. */
13204 start_function (declspecs
, declarator
, attrs
, flags
)
13205 tree declspecs
, declarator
, attrs
;
13209 tree ctype
= NULL_TREE
;
13212 extern int have_extern_spec
;
13213 extern int used_extern_spec
;
13214 int doing_friend
= 0;
13215 struct binding_level
*bl
;
13216 tree current_function_parms
;
13218 /* Sanity check. */
13219 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
13220 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
13222 /* This should only be done once on the top most decl. */
13223 if (have_extern_spec
&& !used_extern_spec
)
13225 declspecs
= tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
13226 used_extern_spec
= 1;
13229 if (flags
& SF_PRE_PARSED
)
13231 decl1
= declarator
;
13233 fntype
= TREE_TYPE (decl1
);
13234 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13235 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13237 /* ISO C++ 11.4/5. A friend function defined in a class is in
13238 the (lexical) scope of the class in which it is defined. */
13239 if (!ctype
&& DECL_FRIEND_P (decl1
))
13241 ctype
= DECL_FRIEND_CONTEXT (decl1
);
13243 /* CTYPE could be null here if we're dealing with a template;
13244 for example, `inline friend float foo()' inside a template
13245 will have no CTYPE set. */
13246 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
13252 last_function_parms
= DECL_ARGUMENTS (decl1
);
13253 last_function_parm_tags
= NULL_TREE
;
13257 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
13258 /* If the declarator is not suitable for a function definition,
13259 cause a syntax error. */
13260 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
13262 fntype
= TREE_TYPE (decl1
);
13264 restype
= TREE_TYPE (fntype
);
13265 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
13267 cp_error ("semicolon missing after declaration of `%#T'", restype
);
13268 shadow_tag (build_tree_list (NULL_TREE
, restype
));
13269 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
13270 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
13271 fntype
= build_function_type (integer_type_node
,
13272 TYPE_ARG_TYPES (fntype
));
13274 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
13276 TYPE_ARG_TYPES (fntype
));
13277 TREE_TYPE (decl1
) = fntype
;
13280 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13281 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13282 else if (DECL_MAIN_P (decl1
))
13284 /* If this doesn't return integer_type, complain. */
13285 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
13287 if (pedantic
|| warn_return_type
)
13288 pedwarn ("return type for `main' changed to `int'");
13289 TREE_TYPE (decl1
) = fntype
= default_function_type
;
13294 /* Sometimes we don't notice that a function is a static member, and
13295 build a METHOD_TYPE for it. Fix that up now. */
13296 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
)
13297 && TREE_CODE (TREE_TYPE (decl1
)) == METHOD_TYPE
)
13299 revert_static_member_fn (decl1
);
13300 last_function_parms
= TREE_CHAIN (last_function_parms
);
13304 /* Warn if function was previously implicitly declared
13305 (but not if we warned then). */
13306 if (! warn_implicit
13307 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
13308 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
13310 /* Set up current_class_type, and enter the scope of the class, if
13313 push_nested_class (ctype
, 1);
13314 else if (DECL_STATIC_FUNCTION_P (decl1
))
13315 push_nested_class (DECL_CONTEXT (decl1
), 2);
13317 /* Now that we have entered the scope of the class, we must restore
13318 the bindings for any template parameters surrounding DECL1, if it
13319 is an inline member template. (Order is important; consider the
13320 case where a template parameter has the same name as a field of
13321 the class.) It is not until after this point that
13322 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
13323 if (flags
& SF_INCLASS_INLINE
)
13324 maybe_begin_member_template_processing (decl1
);
13326 /* Effective C++ rule 15. */
13328 && DECL_OVERLOADED_OPERATOR_P (decl1
) == NOP_EXPR
13329 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
13330 cp_warning ("`operator=' should return a reference to `*this'");
13332 /* Make the init_value nonzero so pushdecl knows this is not tentative.
13333 error_mark_node is replaced below (in poplevel) with the BLOCK. */
13334 if (!DECL_INITIAL (decl1
))
13335 DECL_INITIAL (decl1
) = error_mark_node
;
13337 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
13338 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
13341 /* This function exists in static storage.
13342 (This does not mean `static' in the C sense!) */
13343 TREE_STATIC (decl1
) = 1;
13345 /* We must call push_template_decl after current_class_type is set
13346 up. (If we are processing inline definitions after exiting a
13347 class scope, current_class_type will be NULL_TREE until set above
13348 by push_nested_class.) */
13349 if (processing_template_decl
)
13350 decl1
= push_template_decl (decl1
);
13352 /* We are now in the scope of the function being defined. */
13353 current_function_decl
= decl1
;
13355 /* Save the parm names or decls from this function's declarator
13356 where store_parm_decls will find them. */
13357 current_function_parms
= last_function_parms
;
13358 current_function_parm_tags
= last_function_parm_tags
;
13360 /* Make sure the parameter and return types are reasonable. When
13361 you declare a function, these types can be incomplete, but they
13362 must be complete when you define the function. */
13363 if (! processing_template_decl
)
13364 check_function_type (decl1
, current_function_parms
);
13366 /* Build the return declaration for the function. */
13367 restype
= TREE_TYPE (fntype
);
13368 if (!processing_template_decl
)
13370 if (!DECL_RESULT (decl1
))
13372 DECL_RESULT (decl1
)
13373 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13374 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype
),
13375 DECL_RESULT (decl1
));
13379 /* Just use `void'. Nobody will ever look at this anyhow. */
13380 DECL_RESULT (decl1
) = build_decl (RESULT_DECL
, 0, void_type_node
);
13382 /* Initialize RTL machinery. We cannot do this until
13383 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
13384 even when processing a template; this is how we get
13385 CFUN set up, and our per-function variables initialized.
13386 FIXME factor out the non-RTL stuff. */
13387 bl
= current_binding_level
;
13388 init_function_start (decl1
, input_filename
, lineno
);
13389 current_binding_level
= bl
;
13391 /* Even though we're inside a function body, we still don't want to
13392 call expand_expr to calculate the size of a variable-sized array.
13393 We haven't necessarily assigned RTL to all variables yet, so it's
13394 not safe to try to expand expressions involving them. */
13395 immediate_size_expand
= 0;
13396 cfun
->x_dont_save_pending_sizes_p
= 1;
13398 /* Start the statement-tree, start the tree now. */
13399 begin_stmt_tree (&DECL_SAVED_TREE (decl1
));
13401 /* Let the user know we're compiling this function. */
13402 announce_function (decl1
);
13404 /* Record the decl so that the function name is defined.
13405 If we already have a decl for this name, and it is a FUNCTION_DECL,
13406 use the old decl. */
13407 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
13409 /* A specialization is not used to guide overload resolution. */
13410 if (!DECL_TEMPLATE_SPECIALIZATION (decl1
)
13411 && ! DECL_FUNCTION_MEMBER_P (decl1
))
13412 decl1
= pushdecl (decl1
);
13415 /* We need to set the DECL_CONTEXT. */
13416 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
13417 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
13418 /* And make sure we have enough default args. */
13419 check_default_args (decl1
);
13421 fntype
= TREE_TYPE (decl1
);
13424 /* Reset these in case the call to pushdecl changed them. */
13425 current_function_decl
= decl1
;
13426 cfun
->decl
= decl1
;
13428 /* If we are (erroneously) defining a function that we have already
13429 defined before, wipe out what we knew before. */
13430 if (!DECL_PENDING_INLINE_P (decl1
)
13431 && DECL_SAVED_FUNCTION_DATA (decl1
))
13433 free (DECL_SAVED_FUNCTION_DATA (decl1
));
13434 DECL_SAVED_FUNCTION_DATA (decl1
) = NULL
;
13437 if (ctype
&& !doing_friend
&& !DECL_STATIC_FUNCTION_P (decl1
))
13439 /* We know that this was set up by `grokclassfn'. We do not
13440 wait until `store_parm_decls', since evil parse errors may
13441 never get us to that point. Here we keep the consistency
13442 between `current_class_type' and `current_class_ptr'. */
13443 tree t
= DECL_ARGUMENTS (decl1
);
13445 my_friendly_assert (t
!= NULL_TREE
&& TREE_CODE (t
) == PARM_DECL
,
13447 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
13450 cp_function_chain
->x_current_class_ref
13451 = build_indirect_ref (t
, NULL_PTR
);
13452 cp_function_chain
->x_current_class_ptr
= t
;
13454 /* Constructors and destructors need to know whether they're "in
13455 charge" of initializing virtual base classes. */
13456 t
= TREE_CHAIN (t
);
13457 if (DECL_HAS_IN_CHARGE_PARM_P (decl1
))
13459 current_in_charge_parm
= t
;
13460 t
= TREE_CHAIN (t
);
13462 if (DECL_HAS_VTT_PARM_P (decl1
))
13464 if (DECL_NAME (t
) != vtt_parm_identifier
)
13466 current_vtt_parm
= t
;
13470 if (DECL_INTERFACE_KNOWN (decl1
))
13472 tree ctx
= decl_function_context (decl1
);
13474 if (DECL_NOT_REALLY_EXTERN (decl1
))
13475 DECL_EXTERNAL (decl1
) = 0;
13477 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
13478 && TREE_PUBLIC (ctx
))
13479 /* This is a function in a local class in an extern inline
13481 comdat_linkage (decl1
);
13483 /* If this function belongs to an interface, it is public.
13484 If it belongs to someone else's interface, it is also external.
13485 This only affects inlines and template instantiations. */
13486 else if (interface_unknown
== 0
13487 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13488 || flag_alt_external_templates
))
13490 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
13491 || processing_template_decl
)
13493 DECL_EXTERNAL (decl1
)
13495 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
13496 && !DECL_VINDEX (decl1
)));
13498 /* For WIN32 we also want to put these in linkonce sections. */
13499 maybe_make_one_only (decl1
);
13502 DECL_EXTERNAL (decl1
) = 0;
13503 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
13504 DECL_INTERFACE_KNOWN (decl1
) = 1;
13506 else if (interface_unknown
&& interface_only
13507 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13508 || flag_alt_external_templates
))
13510 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13511 interface, we will have interface_only set but not
13512 interface_known. In that case, we don't want to use the normal
13513 heuristics because someone will supply a #pragma implementation
13514 elsewhere, and deducing it here would produce a conflict. */
13515 comdat_linkage (decl1
);
13516 DECL_EXTERNAL (decl1
) = 0;
13517 DECL_INTERFACE_KNOWN (decl1
) = 1;
13518 DECL_DEFER_OUTPUT (decl1
) = 1;
13522 /* This is a definition, not a reference.
13523 So clear DECL_EXTERNAL. */
13524 DECL_EXTERNAL (decl1
) = 0;
13526 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
13527 && ! DECL_INTERFACE_KNOWN (decl1
)
13528 /* Don't try to defer nested functions for now. */
13529 && ! decl_function_context (decl1
))
13530 DECL_DEFER_OUTPUT (decl1
) = 1;
13532 DECL_INTERFACE_KNOWN (decl1
) = 1;
13536 current_binding_level
->parm_flag
= 1;
13539 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13541 /* We need to do this even if we aren't expanding yet so that
13542 assemble_external works. */
13543 make_decl_rtl (decl1
, NULL
);
13545 /* Promote the value to int before returning it. */
13546 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13547 restype
= type_promotes_to (restype
);
13549 /* If this fcn was already referenced via a block-scope `extern' decl
13550 (or an implicit decl), propagate certain information about the usage. */
13551 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13552 TREE_ADDRESSABLE (decl1
) = 1;
13554 if (DECL_RESULT (decl1
) == NULL_TREE
)
13556 DECL_RESULT (decl1
)
13557 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13558 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13559 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13564 if (DECL_DESTRUCTOR_P (decl1
))
13566 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13567 DECL_CONTEXT (dtor_label
) = current_function_decl
;
13570 store_parm_decls (current_function_parms
);
13575 /* Store the parameter declarations into the current function declaration.
13576 This is called after parsing the parameter declarations, before
13577 digesting the body of the function.
13579 Also install to binding contour return value identifier, if any. */
13582 store_parm_decls (current_function_parms
)
13583 tree current_function_parms
;
13585 register tree fndecl
= current_function_decl
;
13586 register tree parm
;
13587 int parms_have_cleanups
= 0;
13588 tree cleanups
= NULL_TREE
;
13590 /* This is a list of types declared among parms in a prototype. */
13591 tree parmtags
= current_function_parm_tags
;
13593 /* This is a chain of any other decls that came in among the parm
13594 declarations. If a parm is declared with enum {foo, bar} x;
13595 then CONST_DECLs for foo and bar are put here. */
13596 tree nonparms
= NULL_TREE
;
13598 if (current_function_parms
)
13600 /* This case is when the function was defined with an ANSI prototype.
13601 The parms already have decls, so we need not do anything here
13602 except record them as in effect
13603 and complain if any redundant old-style parm decls were written. */
13605 tree specparms
= current_function_parms
;
13608 /* Must clear this because it might contain TYPE_DECLs declared
13610 storedecls (NULL_TREE
);
13612 /* If we're doing semantic analysis, then we'll call pushdecl
13613 for each of these. We must do them in reverse order so that
13614 they end in the correct forward order. */
13615 specparms
= nreverse (specparms
);
13617 for (parm
= specparms
; parm
; parm
= next
)
13619 next
= TREE_CHAIN (parm
);
13620 if (TREE_CODE (parm
) == PARM_DECL
)
13624 if (DECL_NAME (parm
) == NULL_TREE
13625 || TREE_CODE (parm
) != VOID_TYPE
)
13628 cp_error ("parameter `%D' declared void", parm
);
13630 cleanup
= (processing_template_decl
13632 : maybe_build_cleanup (parm
));
13635 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13639 /* If we find an enum constant or a type tag,
13640 put it aside for the moment. */
13641 TREE_CHAIN (parm
) = NULL_TREE
;
13642 nonparms
= chainon (nonparms
, parm
);
13646 /* Get the decls in their original chain order and record in the
13647 function. This is all and only the PARM_DECLs that were
13648 pushed into scope by the loop above. */
13649 DECL_ARGUMENTS (fndecl
) = getdecls ();
13650 storetags (chainon (parmtags
, gettags ()));
13653 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13655 /* Now store the final chain of decls for the arguments
13656 as the decl-chain of the current lexical scope.
13657 Put the enumerators in as well, at the front so that
13658 DECL_ARGUMENTS is not modified. */
13659 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13661 /* Now that we have initialized the parms, we can start their
13662 cleanups. We cannot do this before, since expand_decl_cleanup
13663 should not be called before the parm can be used. */
13666 finish_decl_cleanup (TREE_PURPOSE (cleanups
),
13667 TREE_VALUE (cleanups
));
13668 cleanups
= TREE_CHAIN (cleanups
);
13671 /* Create a binding contour which can be used to catch
13672 cleanup-generated temporaries. */
13673 if (parms_have_cleanups
)
13676 /* Do the starting of the exception specifications, if we have any. */
13677 if (flag_exceptions
&& !processing_template_decl
13678 && flag_enforce_eh_specs
13679 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13680 current_eh_spec_try_block
= expand_start_eh_spec ();
13684 /* We have finished doing semantic analysis on DECL, but have not yet
13685 generated RTL for its body. Save away our current state, so that
13686 when we want to generate RTL later we know what to do. */
13689 save_function_data (decl
)
13692 struct cp_language_function
*f
;
13694 /* Save the language-specific per-function data so that we can
13695 get it back when we really expand this function. */
13696 my_friendly_assert (!DECL_PENDING_INLINE_P (decl
),
13700 f
= ((struct cp_language_function
*)
13701 xmalloc (sizeof (struct cp_language_function
)));
13702 memcpy (f
, cp_function_chain
, sizeof (struct cp_language_function
));
13703 DECL_SAVED_FUNCTION_DATA (decl
) = f
;
13705 /* Clear out the bits we don't need. */
13706 f
->base
.x_stmt_tree
.x_last_stmt
= NULL_TREE
;
13707 f
->base
.x_stmt_tree
.x_last_expr_type
= NULL_TREE
;
13708 f
->x_named_label_uses
= NULL
;
13709 f
->bindings
= NULL
;
13711 /* When we get back here again, we will be expanding. */
13712 f
->x_expanding_p
= 1;
13714 /* If we've already decided that we cannot inline this function, we
13715 must remember that fact when we actually go to expand the
13717 f
->cannot_inline
= current_function_cannot_inline
;
13720 /* At the end of every constructor we generate to code to return
13721 `this'. Do that now. */
13724 finish_constructor_body ()
13726 /* Any return from a constructor will end up here. */
13728 add_stmt (build_stmt (LABEL_STMT
, ctor_label
));
13730 /* Clear CTOR_LABEL so that finish_return_stmt knows to really
13731 generate the return, rather than a goto to CTOR_LABEL. */
13732 ctor_label
= NULL_TREE
;
13733 /* In check_return_expr we translate an empty return from a
13734 constructor to a return of `this'. */
13735 finish_return_stmt (NULL_TREE
);
13736 /* Mark the end of the constructor. */
13737 add_stmt (build_stmt (CTOR_STMT
));
13740 /* At the end of every destructor we generate code to restore virtual
13741 function tables to the values desired by base classes and to call
13742 to base class destructors. Do that now. */
13745 finish_destructor_body ()
13747 tree compound_stmt
;
13750 /* Create a block to contain all the extra code. */
13751 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
13753 /* Any return from a destructor will end up here. */
13754 add_stmt (build_stmt (LABEL_STMT
, dtor_label
));
13756 /* Generate the code to call destructor on base class. If this
13757 destructor belongs to a class with virtual functions, then set
13758 the virtual function table pointer to represent the type of our
13761 /* This side-effect makes call to `build_delete' generate the code
13762 we have to have at the end of this destructor. `build_delete'
13763 will set the flag again. */
13764 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
13766 exprstmt
= build_delete (current_class_type
,
13768 sfk_base_destructor
,
13769 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
,
13772 if (exprstmt
!= error_mark_node
13773 && (TREE_CODE (exprstmt
) != NOP_EXPR
13774 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
13775 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
13777 if (exprstmt
!= void_zero_node
)
13778 /* Don't call `expand_expr_stmt' if we're not going to do
13779 anything, since -Wall will give a diagnostic. */
13780 finish_expr_stmt (exprstmt
);
13782 /* Run destructors for all virtual baseclasses. */
13783 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13788 if_stmt
= begin_if_stmt ();
13789 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13790 current_in_charge_parm
,
13794 vbases
= CLASSTYPE_VBASECLASSES (current_class_type
);
13795 /* The CLASSTYPE_VBASECLASSES list is in initialization
13796 order, so we have to march through it in reverse order. */
13797 for (vbases
= nreverse (copy_list (vbases
));
13799 vbases
= TREE_CHAIN (vbases
))
13801 tree vbase
= TREE_VALUE (vbases
);
13802 tree base_type
= BINFO_TYPE (vbase
);
13804 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (base_type
))
13806 tree base_ptr_type
= build_pointer_type (base_type
);
13807 tree expr
= current_class_ptr
;
13809 /* Convert to the basetype here, as we know the layout is
13810 fixed. What is more, if we let build_method_call do it,
13811 it will use the vtable, which may have been clobbered
13812 by the deletion of our primary base. */
13814 expr
= build1 (NOP_EXPR
, base_ptr_type
, expr
);
13815 expr
= build (PLUS_EXPR
, base_ptr_type
, expr
,
13816 BINFO_OFFSET (vbase
));
13817 expr
= build_indirect_ref (expr
, NULL
);
13818 expr
= build_method_call (expr
, base_dtor_identifier
,
13821 finish_expr_stmt (expr
);
13825 finish_then_clause (if_stmt
);
13830 /* In a virtual destructor, we must call delete. */
13831 if (DECL_VIRTUAL_P (current_function_decl
))
13834 tree virtual_size
= c_sizeof (current_class_type
);
13838 At the point of definition of a virtual destructor (including
13839 an implicit definition), non-placement operator delete shall
13840 be looked up in the scope of the destructor's class and if
13841 found shall be accessible and unambiguous. */
13842 exprstmt
= build_op_delete_call
13843 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
13844 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
13846 if_stmt
= begin_if_stmt ();
13847 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13848 current_in_charge_parm
,
13851 finish_expr_stmt (exprstmt
);
13852 finish_then_clause (if_stmt
);
13856 /* Close the block we started above. */
13857 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
13860 /* Finish up a function declaration and compile that function
13861 all the way to assembler language output. The free the storage
13862 for the function definition.
13864 FLAGS is a bitwise or of the following values:
13866 An extra call to poplevel (and expand_end_bindings) must be
13867 made to take care of the binding contour for the base
13868 initializers. This is only relevant for constructors.
13870 We just finished processing the body of an in-class inline
13871 function definition. (This processing will have taken place
13872 after the class definition is complete.) */
13875 finish_function (flags
)
13878 register tree fndecl
= current_function_decl
;
13879 tree fntype
, ctype
= NULL_TREE
;
13880 int call_poplevel
= (flags
& 1) != 0;
13881 int inclass_inline
= (flags
& 2) != 0;
13884 /* When we get some parse errors, we can end up without a
13885 current_function_decl, so cope. */
13886 if (fndecl
== NULL_TREE
)
13887 return error_mark_node
;
13889 nested
= function_depth
> 1;
13890 fntype
= TREE_TYPE (fndecl
);
13892 /* TREE_READONLY (fndecl) = 1;
13893 This caused &foo to be of type ptr-to-const-function
13894 which then got a warning when stored in a ptr-to-function variable. */
13896 my_friendly_assert (building_stmt_tree (), 20000911);
13898 /* For a cloned function, we've already got all the code we need;
13899 there's no need to add any extra bits. */
13900 if (!DECL_CLONED_FUNCTION_P (fndecl
))
13902 if (DECL_CONSTRUCTOR_P (fndecl
))
13904 finish_constructor_body ();
13908 else if (DECL_DESTRUCTOR_P (fndecl
) && !processing_template_decl
)
13909 finish_destructor_body ();
13910 else if (DECL_MAIN_P (fndecl
))
13912 /* Make it so that `main' always returns 0 by default. */
13914 finish_return_stmt (integer_one_node
);
13916 finish_return_stmt (integer_zero_node
);
13920 /* Finish dealing with exception specifiers. */
13921 if (flag_exceptions
&& !processing_template_decl
13922 && flag_enforce_eh_specs
13923 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13924 expand_end_eh_spec (TYPE_RAISES_EXCEPTIONS
13925 (TREE_TYPE (current_function_decl
)),
13926 current_eh_spec_try_block
);
13929 /* If we're saving up tree structure, tie off the function now. */
13930 finish_stmt_tree (&DECL_SAVED_TREE (fndecl
));
13932 /* This must come after expand_function_end because cleanups might
13933 have declarations (from inline functions) that need to go into
13934 this function's blocks. */
13935 if (current_binding_level
->parm_flag
!= 1)
13936 my_friendly_abort (122);
13937 poplevel (1, 0, 1);
13939 /* Remember that we were in class scope. */
13940 if (current_class_name
)
13941 ctype
= current_class_type
;
13943 /* Must mark the RESULT_DECL as being in this function. */
13944 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
13946 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
13947 to the FUNCTION_DECL node itself. */
13948 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
13950 /* Save away current state, if appropriate. */
13951 if (!processing_template_decl
)
13952 save_function_data (fndecl
);
13954 /* If this function calls `setjmp' it cannot be inlined. When
13955 `longjmp' is called it is not guaranteed to restore the value of
13956 local variables that have been modified since the call to
13957 `setjmp'. So, if were to inline this function into some caller
13958 `c', then when we `longjmp', we might not restore all variables
13959 in `c'. (It might seem, at first blush, that there's no way for
13960 this function to modify local variables in `c', but their
13961 addresses may have been stored somewhere accessible to this
13963 if (!processing_template_decl
&& calls_setjmp_p (fndecl
))
13964 DECL_UNINLINABLE (fndecl
) = 1;
13966 /* Clear out memory we no longer need. */
13967 free_after_parsing (cfun
);
13968 /* Since we never call rest_of_compilation, we never clear
13969 CFUN. Do so explicitly. */
13970 free_after_compilation (cfun
);
13973 /* If this is a in-class inline definition, we may have to pop the
13974 bindings for the template parameters that we added in
13975 maybe_begin_member_template_processing when start_function was
13977 if (inclass_inline
)
13978 maybe_end_member_template_processing ();
13980 /* Leave the scope of the class. */
13982 pop_nested_class ();
13988 /* Let the error reporting routines know that we're outside a
13989 function. For a nested function, this value is used in
13990 pop_cp_function_context and then reset via pop_function_context. */
13991 current_function_decl
= NULL_TREE
;
13996 /* Create the FUNCTION_DECL for a function definition.
13997 DECLSPECS and DECLARATOR are the parts of the declaration;
13998 they describe the return type and the name of the function,
13999 but twisted together in a fashion that parallels the syntax of C.
14001 This function creates a binding context for the function body
14002 as well as setting up the FUNCTION_DECL in current_function_decl.
14004 Returns a FUNCTION_DECL on success.
14006 If the DECLARATOR is not suitable for a function (it defines a datum
14007 instead), we return 0, which tells yyparse to report a parse error.
14009 May return void_type_node indicating that this method is actually
14010 a friend. See grokfield for more details.
14012 Came here with a `.pushlevel' .
14014 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14015 CHANGES TO CODE IN `grokfield'. */
14018 start_method (declspecs
, declarator
, attrlist
)
14019 tree declarator
, declspecs
, attrlist
;
14021 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
14024 /* Something too ugly to handle. */
14025 if (fndecl
== NULL_TREE
)
14028 /* Pass friends other than inline friend functions back. */
14029 if (fndecl
== void_type_node
)
14032 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
14033 /* Not a function, tell parser to report parse error. */
14036 if (DECL_IN_AGGR_P (fndecl
))
14038 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
14040 if (DECL_CONTEXT (fndecl
)
14041 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
14042 cp_error ("`%D' is already defined in class `%T'", fndecl
,
14043 DECL_CONTEXT (fndecl
));
14045 return void_type_node
;
14048 check_template_shadow (fndecl
);
14050 DECL_THIS_INLINE (fndecl
) = 1;
14052 if (flag_default_inline
)
14053 DECL_INLINE (fndecl
) = 1;
14055 /* We process method specializations in finish_struct_1. */
14056 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
14057 fndecl
= push_template_decl (fndecl
);
14059 if (! DECL_FRIEND_P (fndecl
))
14061 if (TREE_CHAIN (fndecl
))
14063 fndecl
= copy_node (fndecl
);
14064 TREE_CHAIN (fndecl
) = NULL_TREE
;
14067 if (DECL_CONSTRUCTOR_P (fndecl
))
14069 if (! grok_ctor_properties (current_class_type
, fndecl
))
14070 return void_type_node
;
14072 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
14073 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
14076 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0);
14078 /* Make a place for the parms */
14080 current_binding_level
->parm_flag
= 1;
14082 DECL_IN_AGGR_P (fndecl
) = 1;
14086 /* Go through the motions of finishing a function definition.
14087 We don't compile this method until after the whole class has
14090 FINISH_METHOD must return something that looks as though it
14091 came from GROKFIELD (since we are defining a method, after all).
14093 This is called after parsing the body of the function definition.
14094 STMTS is the chain of statements that makes up the function body.
14096 DECL is the ..._DECL that `start_method' provided. */
14099 finish_method (decl
)
14102 register tree fndecl
= decl
;
14105 register tree link
;
14107 if (decl
== void_type_node
)
14110 old_initial
= DECL_INITIAL (fndecl
);
14112 /* Undo the level for the parms (from start_method).
14113 This is like poplevel, but it causes nothing to be
14114 saved. Saving information here confuses symbol-table
14115 output routines. Besides, this information will
14116 be correctly output when this method is actually
14119 /* Clear out the meanings of the local variables of this level;
14120 also record in each decl which block it belongs to. */
14122 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
14124 if (DECL_NAME (link
) != NULL_TREE
)
14125 pop_binding (DECL_NAME (link
), link
);
14126 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
14127 DECL_CONTEXT (link
) = NULL_TREE
;
14130 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
14131 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
14132 current_binding_level
->parm_flag
,
14133 current_binding_level
->keep
);
14135 poplevel (0, 0, 0);
14137 DECL_INITIAL (fndecl
) = old_initial
;
14139 /* We used to check if the context of FNDECL was different from
14140 current_class_type as another way to get inside here. This didn't work
14141 for String.cc in libg++. */
14142 if (DECL_FRIEND_P (fndecl
))
14144 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
14145 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
14146 decl
= void_type_node
;
14152 /* Called when a new struct TYPE is defined.
14153 If this structure or union completes the type of any previous
14154 variable declaration, lay it out and output its rtl. */
14157 hack_incomplete_structures (type
)
14161 struct binding_level
*level
;
14163 if (!type
) /* Don't do this for class templates. */
14166 if (namespace_bindings_p ())
14169 list
= &namespace_scope_incomplete
;
14173 level
= innermost_nonclass_level ();
14174 list
= &level
->incomplete
;
14181 tree decl
= TREE_VALUE (*list
);
14182 if ((decl
&& TREE_TYPE (decl
) == type
)
14183 || (TREE_TYPE (decl
)
14184 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14185 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
14187 int toplevel
= toplevel_bindings_p ();
14188 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14189 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
14190 layout_type (TREE_TYPE (decl
));
14191 layout_decl (decl
, 0);
14192 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
14196 expand_decl (decl
);
14197 cleanup
= maybe_build_cleanup (decl
);
14198 expand_decl_init (decl
);
14199 if (! expand_decl_cleanup (decl
, cleanup
))
14200 cp_error ("parser lost in parsing declaration of `%D'",
14203 *list
= TREE_CHAIN (*list
);
14206 list
= &TREE_CHAIN (*list
);
14209 /* Keep looking through artificial binding levels generated
14210 for local variables. */
14211 if (level
&& level
->keep
== 2)
14213 level
= level
->level_chain
;
14214 list
= &level
->incomplete
;
14221 /* If DECL is of a type which needs a cleanup, build that cleanup
14225 maybe_build_cleanup (decl
)
14228 tree type
= TREE_TYPE (decl
);
14230 if (type
!= error_mark_node
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
14232 int flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14235 if (TREE_CODE (type
) == ARRAY_TYPE
)
14239 mark_addressable (decl
);
14240 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14243 /* Optimize for space over speed here. */
14244 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14245 || flag_expensive_optimizations
)
14246 flags
|= LOOKUP_NONVIRTUAL
;
14248 rval
= build_delete (TREE_TYPE (rval
), rval
,
14249 sfk_complete_destructor
, flags
, 0);
14251 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14252 && ! TYPE_HAS_DESTRUCTOR (type
))
14253 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14254 build_tree_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14261 /* When a stmt has been parsed, this function is called. */
14266 /* Always assume this statement was not an expression statement. If
14267 it actually was an expression statement, its our callers
14268 responsibility to fix this up. */
14269 last_expr_type
= NULL_TREE
;
14272 /* DECL was originally constructed as a non-static member function,
14273 but turned out to be static. Update it accordingly. */
14276 revert_static_member_fn (decl
)
14280 tree function
= TREE_TYPE (decl
);
14281 tree args
= TYPE_ARG_TYPES (function
);
14283 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14284 != TYPE_UNQUALIFIED
)
14285 cp_error ("static member function `%#D' declared with type qualifiers",
14288 args
= TREE_CHAIN (args
);
14289 tmp
= build_function_type (TREE_TYPE (function
), args
);
14290 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14291 tmp
= build_exception_variant (tmp
,
14292 TYPE_RAISES_EXCEPTIONS (function
));
14293 TREE_TYPE (decl
) = tmp
;
14294 if (DECL_ARGUMENTS (decl
))
14295 DECL_ARGUMENTS (decl
) = TREE_CHAIN (DECL_ARGUMENTS (decl
));
14296 DECL_STATIC_FUNCTION_P (decl
) = 1;
14299 /* Initialize the variables used during compilation of a C++
14303 push_cp_function_context (f
)
14304 struct function
*f
;
14306 struct cp_language_function
*p
14307 = ((struct cp_language_function
*)
14308 xcalloc (1, sizeof (struct cp_language_function
)));
14309 f
->language
= (struct language_function
*) p
;
14311 /* It takes an explicit call to expand_body to generate RTL for a
14315 /* Whenever we start a new function, we destroy temporaries in the
14317 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
14320 /* Free the language-specific parts of F, now that we've finished
14321 compiling the function. */
14324 pop_cp_function_context (f
)
14325 struct function
*f
;
14328 free (f
->language
);
14332 /* Mark P for GC. */
14335 mark_lang_function (p
)
14336 struct cp_language_function
*p
;
14341 mark_c_language_function (&p
->base
);
14343 ggc_mark_tree (p
->x_ctor_label
);
14344 ggc_mark_tree (p
->x_dtor_label
);
14345 ggc_mark_tree (p
->x_current_class_ptr
);
14346 ggc_mark_tree (p
->x_current_class_ref
);
14347 ggc_mark_tree (p
->x_eh_spec_try_block
);
14349 mark_named_label_lists (&p
->x_named_labels
, &p
->x_named_label_uses
);
14350 mark_binding_level (&p
->bindings
);
14353 /* Mark the language-specific data in F for GC. */
14356 mark_cp_function_context (f
)
14357 struct function
*f
;
14359 mark_lang_function ((struct cp_language_function
*) f
->language
);
14366 enum tree_code code
= TREE_CODE (t
);
14367 if (code
== IDENTIFIER_NODE
)
14369 struct lang_identifier
*li
= (struct lang_identifier
*) t
;
14370 struct lang_id2
*li2
= li
->x
;
14371 ggc_mark_tree (li
->namespace_bindings
);
14372 ggc_mark_tree (li
->bindings
);
14373 ggc_mark_tree (li
->class_value
);
14374 ggc_mark_tree (li
->class_template_info
);
14378 ggc_mark_tree (li2
->label_value
);
14379 ggc_mark_tree (li2
->implicit_decl
);
14380 ggc_mark_tree (li2
->error_locus
);
14383 else if (code
== CPLUS_BINDING
)
14385 if (BINDING_HAS_LEVEL_P (t
))
14386 mark_binding_level (&BINDING_LEVEL (t
));
14388 ggc_mark_tree (BINDING_SCOPE (t
));
14389 ggc_mark_tree (BINDING_VALUE (t
));
14391 else if (code
== OVERLOAD
)
14392 ggc_mark_tree (OVL_FUNCTION (t
));
14393 else if (code
== TEMPLATE_PARM_INDEX
)
14394 ggc_mark_tree (TEMPLATE_PARM_DECL (t
));
14395 else if (TREE_CODE_CLASS (code
) == 'd')
14397 struct lang_decl
*ld
= DECL_LANG_SPECIFIC (t
);
14402 c_mark_lang_decl (&ld
->decl_flags
.base
);
14403 if (!DECL_GLOBAL_CTOR_P (t
)
14404 && !DECL_GLOBAL_DTOR_P (t
)
14405 && !DECL_THUNK_P (t
))
14406 ggc_mark_tree (ld
->decl_flags
.u2
.access
);
14407 else if (DECL_THUNK_P (t
))
14408 ggc_mark_tree (ld
->decl_flags
.u2
.vcall_offset
);
14409 if (TREE_CODE (t
) != NAMESPACE_DECL
)
14410 ggc_mark_tree (ld
->decl_flags
.u
.template_info
);
14412 mark_binding_level (&NAMESPACE_LEVEL (t
));
14413 if (CAN_HAVE_FULL_LANG_DECL_P (t
))
14415 ggc_mark_tree (ld
->befriending_classes
);
14416 ggc_mark_tree (ld
->context
);
14417 ggc_mark_tree (ld
->cloned_function
);
14418 if (TREE_CODE (t
) == TYPE_DECL
)
14419 ggc_mark_tree (ld
->u
.sorted_fields
);
14420 else if (TREE_CODE (t
) == FUNCTION_DECL
14421 && !DECL_PENDING_INLINE_P (t
))
14422 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t
));
14426 else if (TREE_CODE_CLASS (code
) == 't')
14428 struct lang_type
*lt
= TYPE_LANG_SPECIFIC (t
);
14430 if (lt
&& !(TREE_CODE (t
) == POINTER_TYPE
14431 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
14434 ggc_mark_tree (lt
->primary_base
);
14435 ggc_mark_tree (lt
->vfields
);
14436 ggc_mark_tree (lt
->vbases
);
14437 ggc_mark_tree (lt
->tags
);
14438 ggc_mark_tree (lt
->size
);
14439 ggc_mark_tree (lt
->pure_virtuals
);
14440 ggc_mark_tree (lt
->friend_classes
);
14441 ggc_mark_tree (lt
->rtti
);
14442 ggc_mark_tree (lt
->methods
);
14443 ggc_mark_tree (lt
->template_info
);
14444 ggc_mark_tree (lt
->befriending_classes
);
14447 /* In the case of pointer-to-member function types, the
14448 TYPE_LANG_SPECIFIC is really just a tree. */
14449 ggc_mark_tree ((tree
) lt
);
14453 /* Return the IDENTIFIER_GLOBAL_VALUE of T, for use in common code, since
14454 the definition of IDENTIFIER_GLOBAL_VALUE is different for C and C++. */
14457 identifier_global_value (t
)
14460 return IDENTIFIER_GLOBAL_VALUE (t
);
14463 /* Build the void_list_node (void_type_node having been created). */
14465 build_void_list_node ()
14467 tree t
= build_tree_list (NULL_TREE
, void_type_node
);
14468 TREE_PARMLIST (t
) = 1;
14473 cp_missing_noreturn_ok_p (decl
)
14476 /* A missing noreturn is ok for the `main' function. */
14477 return MAIN_NAME_P (DECL_ASSEMBLER_NAME (decl
));