1 /* Process declarations and variables for C compiler.
2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001, 2002 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. */
38 #include "tree-inline.h"
50 #include "diagnostic.h"
53 static tree grokparms
PARAMS ((tree
));
54 static const char *redeclaration_error_message
PARAMS ((tree
, tree
));
56 static void push_binding_level
PARAMS ((struct cp_binding_level
*, int,
58 static void pop_binding_level
PARAMS ((void));
59 static void suspend_binding_level
PARAMS ((void));
60 static void resume_binding_level
PARAMS ((struct cp_binding_level
*));
61 static struct cp_binding_level
*make_binding_level
PARAMS ((void));
62 static void declare_namespace_level
PARAMS ((void));
63 static int decl_jump_unsafe
PARAMS ((tree
));
64 static void storedecls
PARAMS ((tree
));
65 static void require_complete_types_for_parms
PARAMS ((tree
));
66 static int ambi_op_p
PARAMS ((enum tree_code
));
67 static int unary_op_p
PARAMS ((enum tree_code
));
68 static tree store_bindings
PARAMS ((tree
, tree
));
69 static tree lookup_tag_reverse
PARAMS ((tree
, tree
));
70 static tree lookup_name_real
PARAMS ((tree
, int, int, int));
71 static void push_local_name
PARAMS ((tree
));
72 static void warn_extern_redeclared_static
PARAMS ((tree
, tree
));
73 static tree grok_reference_init
PARAMS ((tree
, tree
, tree
));
74 static tree grokfndecl
PARAMS ((tree
, tree
, tree
, tree
, int,
75 enum overload_flags
, tree
,
76 tree
, int, int, int, int, int, int, tree
));
77 static tree grokvardecl
PARAMS ((tree
, tree
, RID_BIT_TYPE
*, int, int, tree
));
78 static tree follow_tag_typedef
PARAMS ((tree
));
79 static tree lookup_tag
PARAMS ((enum tree_code
, tree
,
80 struct cp_binding_level
*, int));
81 static void set_identifier_type_value_with_scope
82 PARAMS ((tree
, tree
, struct cp_binding_level
*));
83 static void record_unknown_type
PARAMS ((tree
, const char *));
84 static tree builtin_function_1
PARAMS ((const char *, tree
, tree
, int,
85 enum built_in_class
, const char *,
87 static tree build_library_fn_1
PARAMS ((tree
, enum tree_code
, tree
));
88 static int member_function_or_else
PARAMS ((tree
, tree
, enum overload_flags
));
89 static void bad_specifiers
PARAMS ((tree
, const char *, int, int, int, int,
91 static tree maybe_process_template_type_declaration
PARAMS ((tree
, int, struct cp_binding_level
*));
92 static void check_for_uninitialized_const_var
PARAMS ((tree
));
93 static hashval_t typename_hash
PARAMS ((const void *));
94 static int typename_compare
PARAMS ((const void *, const void *));
95 static void push_binding
PARAMS ((tree
, tree
, struct cp_binding_level
*));
96 static int add_binding
PARAMS ((tree
, tree
));
97 static void pop_binding
PARAMS ((tree
, tree
));
98 static tree local_variable_p_walkfn
PARAMS ((tree
*, int *, void *));
99 static tree find_binding
PARAMS ((tree
, tree
));
100 static tree select_decl
PARAMS ((tree
, int));
101 static int lookup_flags
PARAMS ((int, int));
102 static tree qualify_lookup
PARAMS ((tree
, int));
103 static tree record_builtin_java_type
PARAMS ((const char *, int));
104 static const char *tag_name
PARAMS ((enum tag_types code
));
105 static void find_class_binding_level
PARAMS ((void));
106 static struct cp_binding_level
*innermost_nonclass_level
PARAMS ((void));
107 static void warn_about_implicit_typename_lookup
PARAMS ((tree
, tree
));
108 static int walk_namespaces_r
PARAMS ((tree
, walk_namespaces_fn
, void *));
109 static int walk_globals_r
PARAMS ((tree
, void *));
110 static int walk_vtables_r
PARAMS ((tree
, void*));
111 static void add_decl_to_level
PARAMS ((tree
, struct cp_binding_level
*));
112 static tree make_label_decl
PARAMS ((tree
, int));
113 static void use_label
PARAMS ((tree
));
114 static void check_previous_goto_1
PARAMS ((tree
, struct cp_binding_level
*, tree
,
116 static void check_previous_goto
PARAMS ((struct named_label_use_list
*));
117 static void check_switch_goto
PARAMS ((struct cp_binding_level
*));
118 static void check_previous_gotos
PARAMS ((tree
));
119 static void pop_label
PARAMS ((tree
, tree
));
120 static void pop_labels
PARAMS ((tree
));
121 static void maybe_deduce_size_from_array_init
PARAMS ((tree
, tree
));
122 static void layout_var_decl
PARAMS ((tree
));
123 static void maybe_commonize_var
PARAMS ((tree
));
124 static tree
check_initializer (tree
, tree
, int);
125 static void make_rtl_for_nonlocal_decl
PARAMS ((tree
, tree
, const char *));
126 static void save_function_data
PARAMS ((tree
));
127 static void check_function_type
PARAMS ((tree
, tree
));
128 static void begin_constructor_body
PARAMS ((void));
129 static void finish_constructor_body
PARAMS ((void));
130 static void begin_destructor_body
PARAMS ((void));
131 static void finish_destructor_body
PARAMS ((void));
132 static tree create_array_type_for_decl
PARAMS ((tree
, tree
, tree
));
133 static tree get_atexit_node
PARAMS ((void));
134 static tree get_dso_handle_node
PARAMS ((void));
135 static tree start_cleanup_fn
PARAMS ((void));
136 static void end_cleanup_fn
PARAMS ((void));
137 static tree cp_make_fname_decl
PARAMS ((tree
, int));
138 static void initialize_predefined_identifiers
PARAMS ((void));
139 static tree check_special_function_return_type
140 PARAMS ((special_function_kind
, tree
, tree
));
141 static tree push_cp_library_fn
PARAMS ((enum tree_code
, tree
));
142 static tree build_cp_library_fn
PARAMS ((tree
, enum tree_code
, tree
));
143 static void store_parm_decls
PARAMS ((tree
));
144 static int cp_missing_noreturn_ok_p
PARAMS ((tree
));
145 static void initialize_local_var (tree
, tree
);
146 static void expand_static_init (tree
, tree
);
147 static tree
next_initializable_field (tree
);
148 static tree
reshape_init (tree
, tree
*);
150 #if defined (DEBUG_BINDING_LEVELS)
151 static void indent
PARAMS ((void));
154 /* Erroneous argument lists can use this *IFF* they do not modify it. */
155 tree error_mark_list
;
157 /* The following symbols are subsumed in the cp_global_trees array, and
158 listed here individually for documentation purposes.
161 tree wchar_decl_node;
163 tree vtable_entry_type;
164 tree delta_type_node;
165 tree __t_desc_type_node;
166 tree ti_desc_type_node;
167 tree bltn_desc_type_node, ptr_desc_type_node;
168 tree ary_desc_type_node, func_desc_type_node, enum_desc_type_node;
169 tree class_desc_type_node, si_class_desc_type_node, vmi_class_desc_type_node;
170 tree ptm_desc_type_node;
171 tree base_desc_type_node;
173 tree class_type_node, record_type_node, union_type_node, enum_type_node;
174 tree unknown_type_node;
176 Array type `vtable_entry_type[]'
179 tree vtbl_ptr_type_node;
186 A FUNCTION_DECL which can call `abort'. Not necessarily the
187 one that the user will declare, but sufficient to be called
188 by routines that want to abort the program.
192 The FUNCTION_DECL for the default `::operator delete'.
194 tree global_delete_fndecl;
197 tree type_info_type_node, tinfo_decl_id, tinfo_decl_type;
202 tree cp_global_trees
[CPTI_MAX
];
204 /* Indicates that there is a type value in some namespace, although
205 that is not necessarily in scope at the moment. */
207 static GTY(()) tree global_type_node
;
209 /* Expect only namespace names now. */
210 static int only_namespace_names
;
212 /* Used only for jumps to as-yet undefined labels, since jumps to
213 defined labels can have their validity checked immediately. */
215 struct named_label_use_list
GTY(())
217 struct cp_binding_level
*binding_level
;
220 const char *filename_o_goto
;
222 struct named_label_use_list
*next
;
225 #define named_label_uses cp_function_chain->x_named_label_uses
227 #define local_names cp_function_chain->x_local_names
229 /* A list of objects which have constructors or destructors
230 which reside in the global scope. The decl is stored in
231 the TREE_VALUE slot and the initializer is stored
232 in the TREE_PURPOSE slot. */
233 tree static_aggregates
;
237 /* A node for the integer constants 2, and 3. */
239 tree integer_two_node
, integer_three_node
;
241 /* Similar, for last_function_parm_tags. */
242 tree last_function_parms
;
244 /* A list of all LABEL_DECLs in the function that have names. Here so
245 we can clear out their names' definitions at the end of the
246 function, and so we can check the validity of jumps to these labels. */
248 struct named_label_list
GTY(())
250 struct cp_binding_level
*binding_level
;
255 struct named_label_list
*next
;
256 unsigned int in_try_scope
: 1;
257 unsigned int in_catch_scope
: 1;
260 #define named_labels cp_function_chain->x_named_labels
262 /* The name of the anonymous namespace, throughout this translation
264 tree anonymous_namespace_name
;
266 /* The number of function bodies which we are currently processing.
267 (Zero if we are at namespace scope, one inside the body of a
268 function, two inside the body of a function in a local class, etc.) */
271 /* States indicating how grokdeclarator() should handle declspecs marked
272 with __attribute__((deprecated)). An object declared as
273 __attribute__((deprecated)) suppresses warnings of uses of other
276 enum deprecated_states
{
281 static enum deprecated_states deprecated_state
= DEPRECATED_NORMAL
;
283 /* Set by add_implicitly_declared_members() to keep those members from
284 being flagged as deprecated or reported as using deprecated
286 int adding_implicit_members
= 0;
288 /* True if a declaration with an `extern' linkage specifier is being
290 bool have_extern_spec
;
293 /* For each binding contour we allocate a binding_level structure
294 which records the names defined in that contour.
297 1) one for each function definition,
298 where internal declarations of the parameters appear.
299 2) one for each compound statement,
300 to record its declarations.
302 The current meaning of a name can be found by searching the levels
303 from the current one out to the global one.
305 Off to the side, may be the class_binding_level. This exists only
306 to catch class-local declarations. It is otherwise nonexistent.
308 Also there may be binding levels that catch cleanups that must be
309 run when exceptions occur. Thus, to see whether a name is bound in
310 the current scope, it is not enough to look in the
311 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
314 /* Note that the information in the `names' component of the global contour
315 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
317 struct cp_binding_level
GTY(())
319 /* A chain of _DECL nodes for all variables, constants, functions,
320 and typedef types. These are in the reverse of the order
321 supplied. There may be OVERLOADs on this list, too, but they
322 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
325 /* Count of elements in names chain. */
328 /* A chain of NAMESPACE_DECL nodes. */
331 /* A chain of VTABLE_DECL nodes. */
334 /* A list of structure, union and enum definitions, for looking up
336 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
337 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
338 or ENUMERAL_TYPE node.
340 C++: the TREE_VALUE nodes can be simple types for
341 component_bindings. */
344 /* A list of USING_DECL nodes. */
347 /* A list of used namespaces. PURPOSE is the namespace,
348 VALUE the common ancestor with this binding_level's namespace. */
349 tree using_directives
;
351 /* If this binding level is the binding level for a class, then
352 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
353 is the name of an entity bound in the class. The TREE_TYPE is
354 the DECL bound by this name in the class. */
357 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
358 is used for all binding levels. In addition the TREE_VALUE is the
359 IDENTIFIER_TYPE_VALUE before we entered the class. */
362 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
363 label in this scope. The TREE_PURPOSE is the previous value of
364 the IDENTIFIER_LABEL VALUE. */
365 tree shadowed_labels
;
367 /* For each level (except not the global one),
368 a chain of BLOCK nodes for all the levels
369 that were entered and exited one level down. */
372 /* The _TYPE node for this level, if parm_flag == 2. */
375 /* The binding level which this one is contained in (inherits from). */
376 struct cp_binding_level
*level_chain
;
378 /* List of VAR_DECLS saved from a previous for statement.
379 These would be dead in ISO-conforming code, but might
380 be referenced in ARM-era code. These are stored in a
381 TREE_LIST; the TREE_VALUE is the actual declaration. */
382 tree dead_vars_from_for
;
384 /* 1 for the level that holds the parameters of a function.
385 2 for the level that holds a class declaration. */
386 unsigned parm_flag
: 2;
388 /* 1 means make a BLOCK for this level regardless of all else.
389 2 for temporary binding contours created by the compiler. */
392 /* Nonzero if this level "doesn't exist" for tags. */
393 unsigned tag_transparent
: 1;
395 /* Nonzero if this level can safely have additional
396 cleanup-needing variables added to it. */
397 unsigned more_cleanups_ok
: 1;
398 unsigned have_cleanups
: 1;
400 /* Nonzero if this scope is for storing the decls for template
401 parameters and generic decls; these decls will be discarded and
402 replaced with a TEMPLATE_DECL. */
403 unsigned template_parms_p
: 1;
405 /* Nonzero if this scope corresponds to the `<>' in a
406 `template <>' clause. Whenever this flag is set,
407 TEMPLATE_PARMS_P will be set as well. */
408 unsigned template_spec_p
: 1;
410 /* This is set for a namespace binding level. */
411 unsigned namespace_p
: 1;
413 /* True if this level is that of a for-statement where we need to
414 worry about ambiguous (ARM or ISO) scope rules. */
415 unsigned is_for_scope
: 1;
417 /* True if this level corresponds to a TRY block. Currently this
418 information is only available while building the tree structure. */
419 unsigned is_try_scope
: 1;
421 /* True if this level corresponds to a CATCH block. Currently this
422 information is only available while building the tree structure. */
423 unsigned is_catch_scope
: 1;
425 /* Three bits left for this word. */
427 /* Binding depth at which this level began. */
428 unsigned binding_depth
;
431 #define NULL_BINDING_LEVEL ((struct cp_binding_level *) NULL)
433 /* The binding level currently in effect. */
435 #define current_binding_level \
436 (cfun && cp_function_chain->bindings \
437 ? cp_function_chain->bindings \
438 : scope_chain->bindings)
440 /* The binding level of the current class, if any. */
442 #define class_binding_level scope_chain->class_bindings
444 /* A chain of binding_level structures awaiting reuse. */
446 static GTY((deletable (""))) struct cp_binding_level
*free_binding_level
;
448 /* The outermost binding level, for names of file scope.
449 This is created when the compiler is started and exists
450 through the entire run. */
452 static GTY(()) struct cp_binding_level
*global_binding_level
;
454 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
456 static int keep_next_level_flag
;
458 /* A TREE_LIST of VAR_DECLs. The TREE_PURPOSE is a RECORD_TYPE or
459 UNION_TYPE; the TREE_VALUE is a VAR_DECL with that type. At the
460 time the VAR_DECL was declared, the type was incomplete. */
462 static GTY(()) tree incomplete_vars
;
464 #if defined(DEBUG_BINDING_LEVELS)
465 static int binding_depth
= 0;
466 static int is_class_level
= 0;
473 for (i
= 0; i
< binding_depth
*2; i
++)
476 #endif /* defined(DEBUG_BINDING_LEVELS) */
478 static tree pushdecl_with_scope
PARAMS ((tree
, struct cp_binding_level
*));
481 push_binding_level (newlevel
, tag_transparent
, keep
)
482 struct cp_binding_level
*newlevel
;
483 int tag_transparent
, keep
;
485 /* Add this level to the front of the chain (stack) of levels that
487 memset ((char*) newlevel
, 0, sizeof (struct cp_binding_level
));
488 newlevel
->level_chain
= current_binding_level
;
489 current_binding_level
= newlevel
;
490 newlevel
->tag_transparent
= tag_transparent
;
491 newlevel
->more_cleanups_ok
= 1;
493 newlevel
->keep
= keep
;
494 #if defined(DEBUG_BINDING_LEVELS)
495 newlevel
->binding_depth
= binding_depth
;
497 fprintf (stderr
, "push %s level 0x%08x line %d\n",
498 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
501 #endif /* defined(DEBUG_BINDING_LEVELS) */
504 /* Find the innermost enclosing class scope, and reset
505 CLASS_BINDING_LEVEL appropriately. */
508 find_class_binding_level ()
510 struct cp_binding_level
*level
= current_binding_level
;
512 while (level
&& level
->parm_flag
!= 2)
513 level
= level
->level_chain
;
514 if (level
&& level
->parm_flag
== 2)
515 class_binding_level
= level
;
517 class_binding_level
= 0;
523 if (global_binding_level
)
525 /* Cannot pop a level, if there are none left to pop. */
526 if (current_binding_level
== global_binding_level
)
529 /* Pop the current level, and free the structure for reuse. */
530 #if defined(DEBUG_BINDING_LEVELS)
533 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
534 (is_class_level
) ? "class" : "block",
535 current_binding_level
, lineno
);
536 if (is_class_level
!= (current_binding_level
== class_binding_level
))
539 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
542 #endif /* defined(DEBUG_BINDING_LEVELS) */
544 register struct cp_binding_level
*level
= current_binding_level
;
545 current_binding_level
= current_binding_level
->level_chain
;
546 level
->level_chain
= free_binding_level
;
547 #if 0 /* defined(DEBUG_BINDING_LEVELS) */
548 if (level
->binding_depth
!= binding_depth
)
550 #endif /* defined(DEBUG_BINDING_LEVELS) */
551 free_binding_level
= level
;
552 find_class_binding_level ();
557 suspend_binding_level ()
559 if (class_binding_level
)
560 current_binding_level
= class_binding_level
;
562 if (global_binding_level
)
564 /* Cannot suspend a level, if there are none left to suspend. */
565 if (current_binding_level
== global_binding_level
)
568 /* Suspend the current level. */
569 #if defined(DEBUG_BINDING_LEVELS)
572 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
573 (is_class_level
) ? "class" : "block",
574 current_binding_level
, lineno
);
575 if (is_class_level
!= (current_binding_level
== class_binding_level
))
578 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
581 #endif /* defined(DEBUG_BINDING_LEVELS) */
582 current_binding_level
= current_binding_level
->level_chain
;
583 find_class_binding_level ();
587 resume_binding_level (b
)
588 struct cp_binding_level
*b
;
590 /* Resuming binding levels is meant only for namespaces,
591 and those cannot nest into classes. */
592 my_friendly_assert(!class_binding_level
, 386);
593 /* Also, resuming a non-directly nested namespace is a no-no. */
594 my_friendly_assert(b
->level_chain
== current_binding_level
, 386);
595 current_binding_level
= b
;
596 #if defined(DEBUG_BINDING_LEVELS)
597 b
->binding_depth
= binding_depth
;
599 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
600 (is_class_level
) ? "class" : "block", b
, lineno
);
603 #endif /* defined(DEBUG_BINDING_LEVELS) */
606 /* Create a new `struct cp_binding_level'. */
609 struct cp_binding_level
*
610 make_binding_level ()
613 return (struct cp_binding_level
*) ggc_alloc (sizeof (struct cp_binding_level
));
616 /* Nonzero if we are currently in the global binding level. */
621 return current_binding_level
== global_binding_level
;
624 /* Return the innermost binding level that is not for a class scope. */
626 static struct cp_binding_level
*
627 innermost_nonclass_level ()
629 struct cp_binding_level
*b
;
631 b
= current_binding_level
;
632 while (b
->parm_flag
== 2)
638 /* Nonzero if we are currently in a toplevel binding level. This
639 means either the global binding level or a namespace in a toplevel
640 binding level. Since there are no non-toplevel namespace levels,
641 this really means any namespace or template parameter level. We
642 also include a class whose context is toplevel. */
645 toplevel_bindings_p ()
647 struct cp_binding_level
*b
= innermost_nonclass_level ();
649 return b
->namespace_p
|| b
->template_parms_p
;
652 /* Nonzero if this is a namespace scope, or if we are defining a class
653 which is itself at namespace scope, or whose enclosing class is
654 such a class, etc. */
657 namespace_bindings_p ()
659 struct cp_binding_level
*b
= innermost_nonclass_level ();
661 return b
->namespace_p
;
664 /* If KEEP is nonzero, make a BLOCK node for the next binding level,
665 unconditionally. Otherwise, use the normal logic to decide whether
666 or not to create a BLOCK. */
669 keep_next_level (keep
)
672 keep_next_level_flag
= keep
;
675 /* Nonzero if the current level needs to have a BLOCK made. */
680 return (current_binding_level
->blocks
!= NULL_TREE
681 || current_binding_level
->keep
682 || current_binding_level
->names
!= NULL_TREE
683 || (current_binding_level
->tags
!= NULL_TREE
684 && !current_binding_level
->tag_transparent
));
688 declare_namespace_level ()
690 current_binding_level
->namespace_p
= 1;
693 /* Returns nonzero if this scope was created to store template
697 template_parm_scope_p ()
699 return current_binding_level
->template_parms_p
;
702 /* Returns the kind of template specialization we are currently
703 processing, given that it's declaration contained N_CLASS_SCOPES
704 explicit scope qualifications. */
707 current_tmpl_spec_kind (n_class_scopes
)
710 int n_template_parm_scopes
= 0;
711 int seen_specialization_p
= 0;
712 int innermost_specialization_p
= 0;
713 struct cp_binding_level
*b
;
715 /* Scan through the template parameter scopes. */
716 for (b
= current_binding_level
; b
->template_parms_p
; b
= b
->level_chain
)
718 /* If we see a specialization scope inside a parameter scope,
719 then something is wrong. That corresponds to a declaration
722 template <class T> template <> ...
724 which is always invalid since [temp.expl.spec] forbids the
725 specialization of a class member template if the enclosing
726 class templates are not explicitly specialized as well. */
727 if (b
->template_spec_p
)
729 if (n_template_parm_scopes
== 0)
730 innermost_specialization_p
= 1;
732 seen_specialization_p
= 1;
734 else if (seen_specialization_p
== 1)
735 return tsk_invalid_member_spec
;
737 ++n_template_parm_scopes
;
740 /* Handle explicit instantiations. */
741 if (processing_explicit_instantiation
)
743 if (n_template_parm_scopes
!= 0)
744 /* We've seen a template parameter list during an explicit
745 instantiation. For example:
747 template <class T> template void f(int);
749 This is erroneous. */
750 return tsk_invalid_expl_inst
;
752 return tsk_expl_inst
;
755 if (n_template_parm_scopes
< n_class_scopes
)
756 /* We've not seen enough template headers to match all the
757 specialized classes present. For example:
759 template <class T> void R<T>::S<T>::f(int);
761 This is invalid; there needs to be one set of template
762 parameters for each class. */
763 return tsk_insufficient_parms
;
764 else if (n_template_parm_scopes
== n_class_scopes
)
765 /* We're processing a non-template declaration (even though it may
766 be a member of a template class.) For example:
768 template <class T> void S<T>::f(int);
770 The `class T' maches the `S<T>', leaving no template headers
771 corresponding to the `f'. */
773 else if (n_template_parm_scopes
> n_class_scopes
+ 1)
774 /* We've got too many template headers. For example:
776 template <> template <class T> void f (T);
778 There need to be more enclosing classes. */
779 return tsk_excessive_parms
;
781 /* This must be a template. It's of the form:
783 template <class T> template <class U> void S<T>::f(U);
785 This is a specialization if the innermost level was a
786 specialization; otherwise it's just a definition of the
788 return innermost_specialization_p
? tsk_expl_spec
: tsk_template
;
792 set_class_shadows (shadows
)
795 class_binding_level
->class_shadowed
= shadows
;
798 /* Enter a new binding level.
799 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
800 not for that of tags. */
803 pushlevel (tag_transparent
)
806 struct cp_binding_level
*newlevel
;
808 if (cfun
&& !doing_semantic_analysis_p ())
811 /* Reuse or create a struct for this binding level. */
812 #if defined(DEBUG_BINDING_LEVELS)
814 #else /* !defined(DEBUG_BINDING_LEVELS) */
815 if (free_binding_level
)
816 #endif /* !defined(DEBUG_BINDING_LEVELS) */
818 newlevel
= free_binding_level
;
819 free_binding_level
= free_binding_level
->level_chain
;
822 newlevel
= make_binding_level ();
824 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
825 keep_next_level_flag
= 0;
828 /* We're defining an object of type TYPE. If it needs a cleanup, but
829 we're not allowed to add any more objects with cleanups to the current
830 scope, create a new binding level. */
833 maybe_push_cleanup_level (type
)
836 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
837 && current_binding_level
->more_cleanups_ok
== 0)
842 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/1);
846 /* Enter a new scope. The KIND indicates what kind of scope is being
857 case sk_template_spec
:
858 current_binding_level
->template_spec_p
= 1;
861 case sk_template_parms
:
862 current_binding_level
->template_parms_p
= 1;
870 /* Exit the current scope. */
879 note_level_for_for ()
881 current_binding_level
->is_for_scope
= 1;
884 /* Record that the current binding level represents a try block. */
887 note_level_for_try ()
889 current_binding_level
->is_try_scope
= 1;
892 /* Record that the current binding level represents a catch block. */
895 note_level_for_catch ()
897 current_binding_level
->is_catch_scope
= 1;
900 /* For a binding between a name and an entity at a block scope,
901 this is the `struct cp_binding_level' for the block. */
902 #define BINDING_LEVEL(NODE) \
903 (((struct tree_binding*)(NODE))->scope.level)
905 /* A free list of CPLUS_BINDING nodes, connected by their
908 static GTY((deletable (""))) tree free_bindings
;
910 /* Make DECL the innermost binding for ID. The LEVEL is the binding
911 level at which this declaration is being bound. */
914 push_binding (id
, decl
, level
)
917 struct cp_binding_level
* level
;
923 binding
= free_bindings
;
924 free_bindings
= TREE_CHAIN (binding
);
927 binding
= make_node (CPLUS_BINDING
);
929 /* Now, fill in the binding information. */
930 BINDING_VALUE (binding
) = decl
;
931 BINDING_TYPE (binding
) = NULL_TREE
;
932 BINDING_LEVEL (binding
) = level
;
933 INHERITED_VALUE_BINDING_P (binding
) = 0;
934 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
935 BINDING_HAS_LEVEL_P (binding
) = 1;
937 /* And put it on the front of the list of bindings for ID. */
938 TREE_CHAIN (binding
) = IDENTIFIER_BINDING (id
);
939 IDENTIFIER_BINDING (id
) = binding
;
942 /* ID is already bound in the current scope. But, DECL is an
943 additional binding for ID in the same scope. This is the `struct
944 stat' hack whereby a non-typedef class-name or enum-name can be
945 bound at the same level as some other kind of entity. It's the
946 responsibility of the caller to check that inserting this name is
947 valid here. Returns nonzero if the new binding was successful. */
949 add_binding (id
, decl
)
953 tree binding
= IDENTIFIER_BINDING (id
);
956 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
957 /* The new name is the type name. */
958 BINDING_TYPE (binding
) = decl
;
959 else if (!BINDING_VALUE (binding
))
960 /* This situation arises when push_class_level_binding moves an
961 inherited type-binding out of the way to make room for a new
963 BINDING_VALUE (binding
) = decl
;
964 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
965 && DECL_ARTIFICIAL (BINDING_VALUE (binding
)))
967 /* The old binding was a type name. It was placed in
968 BINDING_VALUE because it was thought, at the point it was
969 declared, to be the only entity with such a name. Move the
970 type name into the type slot; it is now hidden by the new
972 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
973 BINDING_VALUE (binding
) = decl
;
974 INHERITED_VALUE_BINDING_P (binding
) = 0;
976 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
977 && TREE_CODE (decl
) == TYPE_DECL
978 && DECL_NAME (decl
) == DECL_NAME (BINDING_VALUE (binding
))
979 && (same_type_p (TREE_TYPE (decl
),
980 TREE_TYPE (BINDING_VALUE (binding
)))
981 /* If either type involves template parameters, we must
982 wait until instantiation. */
983 || uses_template_parms (TREE_TYPE (decl
))
984 || uses_template_parms (TREE_TYPE (BINDING_VALUE (binding
)))))
985 /* We have two typedef-names, both naming the same type to have
986 the same name. This is OK because of:
990 In a given scope, a typedef specifier can be used to redefine
991 the name of any type declared in that scope to refer to the
992 type to which it already refers. */
994 /* There can be two block-scope declarations of the same variable,
995 so long as they are `extern' declarations. */
996 else if (TREE_CODE (decl
) == VAR_DECL
997 && TREE_CODE (BINDING_VALUE (binding
)) == VAR_DECL
998 && DECL_EXTERNAL (decl
)
999 && DECL_EXTERNAL (BINDING_VALUE (binding
)))
1001 duplicate_decls (decl
, BINDING_VALUE (binding
));
1006 error ("declaration of `%#D'", decl
);
1007 cp_error_at ("conflicts with previous declaration `%#D'",
1008 BINDING_VALUE (binding
));
1015 /* Add DECL to the list of things declared in B. */
1018 add_decl_to_level (decl
, b
)
1020 struct cp_binding_level
*b
;
1022 if (TREE_CODE (decl
) == NAMESPACE_DECL
1023 && !DECL_NAMESPACE_ALIAS (decl
))
1025 TREE_CHAIN (decl
) = b
->namespaces
;
1026 b
->namespaces
= decl
;
1028 else if (TREE_CODE (decl
) == VAR_DECL
&& DECL_VIRTUAL_P (decl
))
1030 TREE_CHAIN (decl
) = b
->vtables
;
1035 /* We build up the list in reverse order, and reverse it later if
1037 TREE_CHAIN (decl
) = b
->names
;
1043 /* Bind DECL to ID in the current_binding_level, assumed to be a local
1044 binding level. If PUSH_USING is set in FLAGS, we know that DECL
1045 doesn't really belong to this binding level, that it got here
1046 through a using-declaration. */
1049 push_local_binding (id
, decl
, flags
)
1054 struct cp_binding_level
*b
;
1056 /* Skip over any local classes. This makes sense if we call
1057 push_local_binding with a friend decl of a local class. */
1058 b
= current_binding_level
;
1059 while (b
->parm_flag
== 2)
1062 if (lookup_name_current_level (id
))
1064 /* Supplement the existing binding. */
1065 if (!add_binding (id
, decl
))
1066 /* It didn't work. Something else must be bound at this
1067 level. Do not add DECL to the list of things to pop
1072 /* Create a new binding. */
1073 push_binding (id
, decl
, b
);
1075 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
1076 /* We must put the OVERLOAD into a TREE_LIST since the
1077 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1078 decls that got here through a using-declaration. */
1079 decl
= build_tree_list (NULL_TREE
, decl
);
1081 /* And put DECL on the list of things declared by the current
1083 add_decl_to_level (decl
, b
);
1086 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
1087 binding was successful. */
1090 push_class_binding (id
, decl
)
1095 tree binding
= IDENTIFIER_BINDING (id
);
1098 /* Note that we declared this value so that we can issue an error if
1099 this is an invalid redeclaration of a name already used for some
1101 note_name_declared_in_class (id
, decl
);
1103 if (binding
&& BINDING_LEVEL (binding
) == class_binding_level
)
1104 /* Supplement the existing binding. */
1105 result
= add_binding (id
, decl
);
1107 /* Create a new binding. */
1108 push_binding (id
, decl
, class_binding_level
);
1110 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1111 class-level declaration. Note that we do not use DECL here
1112 because of the possibility of the `struct stat' hack; if DECL is
1113 a class-name or enum-name we might prefer a field-name, or some
1115 IDENTIFIER_CLASS_VALUE (id
) = BINDING_VALUE (IDENTIFIER_BINDING (id
));
1117 /* If this is a binding from a base class, mark it as such. */
1118 binding
= IDENTIFIER_BINDING (id
);
1119 if (BINDING_VALUE (binding
) == decl
&& TREE_CODE (decl
) != TREE_LIST
)
1121 /* Any implicit typename must be from a base-class. The
1122 context for an implicit typename declaration is always
1123 the derived class in which the lookup was done, so the checks
1124 based on the context of DECL below will not trigger. */
1125 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl
))
1126 INHERITED_VALUE_BINDING_P (binding
) = 1;
1129 if (TREE_CODE (decl
) == OVERLOAD
)
1130 context
= CP_DECL_CONTEXT (OVL_CURRENT (decl
));
1133 my_friendly_assert (DECL_P (decl
), 0);
1134 context
= context_for_name_lookup (decl
);
1137 if (is_properly_derived_from (current_class_type
, context
))
1138 INHERITED_VALUE_BINDING_P (binding
) = 1;
1140 INHERITED_VALUE_BINDING_P (binding
) = 0;
1143 else if (BINDING_VALUE (binding
) == decl
)
1144 /* We only encounter a TREE_LIST when push_class_decls detects an
1145 ambiguity. Such an ambiguity can be overridden by a definition
1147 INHERITED_VALUE_BINDING_P (binding
) = 1;
1152 /* Remove the binding for DECL which should be the innermost binding
1156 pop_binding (id
, decl
)
1162 if (id
== NULL_TREE
)
1163 /* It's easiest to write the loops that call this function without
1164 checking whether or not the entities involved have names. We
1165 get here for such an entity. */
1168 /* Get the innermost binding for ID. */
1169 binding
= IDENTIFIER_BINDING (id
);
1171 /* The name should be bound. */
1172 my_friendly_assert (binding
!= NULL_TREE
, 0);
1174 /* The DECL will be either the ordinary binding or the type
1175 binding for this identifier. Remove that binding. */
1176 if (BINDING_VALUE (binding
) == decl
)
1177 BINDING_VALUE (binding
) = NULL_TREE
;
1178 else if (BINDING_TYPE (binding
) == decl
)
1179 BINDING_TYPE (binding
) = NULL_TREE
;
1183 if (!BINDING_VALUE (binding
) && !BINDING_TYPE (binding
))
1185 /* We're completely done with the innermost binding for this
1186 identifier. Unhook it from the list of bindings. */
1187 IDENTIFIER_BINDING (id
) = TREE_CHAIN (binding
);
1189 /* Add it to the free list. */
1190 TREE_CHAIN (binding
) = free_bindings
;
1191 free_bindings
= binding
;
1193 /* Clear the BINDING_LEVEL so the garbage collector doesn't walk
1195 BINDING_LEVEL (binding
) = NULL
;
1199 /* When a label goes out of scope, check to see if that label was used
1200 in a valid manner, and issue any appropriate warnings or errors. */
1203 pop_label (label
, old_value
)
1207 if (!processing_template_decl
&& doing_semantic_analysis_p ())
1209 if (DECL_INITIAL (label
) == NULL_TREE
)
1211 cp_error_at ("label `%D' used but not defined", label
);
1212 /* Avoid crashing later. */
1213 define_label (input_filename
, 1, DECL_NAME (label
));
1215 else if (warn_unused_label
&& !TREE_USED (label
))
1216 cp_warning_at ("label `%D' defined but not used", label
);
1219 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), old_value
);
1222 /* At the end of a function, all labels declared within the function
1223 go out of scope. BLOCK is the top-level block for the
1230 struct named_label_list
*link
;
1232 /* Clear out the definitions of all label names, since their scopes
1234 for (link
= named_labels
; link
; link
= link
->next
)
1236 pop_label (link
->label_decl
, link
->old_value
);
1237 /* Put the labels into the "variables" of the top-level block,
1238 so debugger can see them. */
1239 TREE_CHAIN (link
->label_decl
) = BLOCK_VARS (block
);
1240 BLOCK_VARS (block
) = link
->label_decl
;
1243 named_labels
= NULL
;
1246 /* Exit a binding level.
1247 Pop the level off, and restore the state of the identifier-decl mappings
1248 that were in effect when this level was entered.
1250 If KEEP == 1, this level had explicit declarations, so
1251 and create a "block" (a BLOCK node) for the level
1252 to record its declarations and subblocks for symbol table output.
1254 If FUNCTIONBODY is nonzero, this level is the body of a function,
1255 so create a block as if KEEP were set and also clear out all
1258 If REVERSE is nonzero, reverse the order of decls before putting
1259 them into the BLOCK. */
1262 poplevel (keep
, reverse
, functionbody
)
1268 /* The chain of decls was accumulated in reverse order.
1269 Put it into forward order, just for cleanliness. */
1271 int tmp
= functionbody
;
1272 int real_functionbody
;
1275 tree block
= NULL_TREE
;
1277 int leaving_for_scope
;
1279 if (cfun
&& !doing_semantic_analysis_p ())
1282 my_friendly_assert (current_binding_level
->parm_flag
!= 2,
1285 real_functionbody
= (current_binding_level
->keep
== 2
1286 ? ((functionbody
= 0), tmp
) : functionbody
);
1287 tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1288 subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1290 my_friendly_assert (!current_binding_level
->class_shadowed
,
1293 /* We used to use KEEP == 2 to indicate that the new block should go
1294 at the beginning of the list of blocks at this binding level,
1295 rather than the end. This hack is no longer used. */
1296 my_friendly_assert (keep
== 0 || keep
== 1, 0);
1298 if (current_binding_level
->keep
== 1)
1301 /* Any uses of undefined labels, and any defined labels, now operate
1302 under constraints of next binding contour. */
1303 if (cfun
&& !functionbody
)
1305 struct cp_binding_level
*level_chain
;
1306 level_chain
= current_binding_level
->level_chain
;
1309 struct named_label_use_list
*uses
;
1310 struct named_label_list
*labels
;
1311 for (labels
= named_labels
; labels
; labels
= labels
->next
)
1312 if (labels
->binding_level
== current_binding_level
)
1315 if (current_binding_level
->is_try_scope
)
1316 labels
->in_try_scope
= 1;
1317 if (current_binding_level
->is_catch_scope
)
1318 labels
->in_catch_scope
= 1;
1319 for (decl
= labels
->names_in_scope
; decl
;
1320 decl
= TREE_CHAIN (decl
))
1321 if (decl_jump_unsafe (decl
))
1322 labels
->bad_decls
= tree_cons (NULL_TREE
, decl
,
1324 labels
->binding_level
= level_chain
;
1325 labels
->names_in_scope
= level_chain
->names
;
1328 for (uses
= named_label_uses
; uses
; uses
= uses
->next
)
1329 if (uses
->binding_level
== current_binding_level
)
1331 uses
->binding_level
= level_chain
;
1332 uses
->names_in_scope
= level_chain
->names
;
1337 /* Get the decls in the order they were written.
1338 Usually current_binding_level->names is in reverse order.
1339 But parameter decls were previously put in forward order. */
1342 current_binding_level
->names
1343 = decls
= nreverse (current_binding_level
->names
);
1345 decls
= current_binding_level
->names
;
1347 /* Output any nested inline functions within this block
1348 if they weren't already output. */
1349 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1350 if (TREE_CODE (decl
) == FUNCTION_DECL
1351 && ! TREE_ASM_WRITTEN (decl
)
1352 && DECL_INITIAL (decl
) != NULL_TREE
1353 && TREE_ADDRESSABLE (decl
)
1354 && decl_function_context (decl
) == current_function_decl
)
1356 /* If this decl was copied from a file-scope decl
1357 on account of a block-scope extern decl,
1358 propagate TREE_ADDRESSABLE to the file-scope decl. */
1359 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1360 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1363 push_function_context ();
1364 output_inline_function (decl
);
1365 pop_function_context ();
1369 /* When not in function-at-a-time mode, expand_end_bindings will
1370 warn about unused variables. But, in function-at-a-time mode
1371 expand_end_bindings is not passed the list of variables in the
1372 current scope, and therefore no warning is emitted. So, we
1373 explicitly warn here. */
1374 if (!processing_template_decl
)
1375 warn_about_unused_variables (getdecls ());
1377 /* If there were any declarations or structure tags in that level,
1378 or if this level is a function body,
1379 create a BLOCK to record them for the life of this function. */
1381 if (keep
== 1 || functionbody
)
1382 block
= make_node (BLOCK
);
1383 if (block
!= NULL_TREE
)
1385 BLOCK_VARS (block
) = decls
;
1386 BLOCK_SUBBLOCKS (block
) = subblocks
;
1389 /* In each subblock, record that this is its superior. */
1391 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1392 BLOCK_SUPERCONTEXT (link
) = block
;
1394 /* We still support the old for-scope rules, whereby the variables
1395 in a for-init statement were in scope after the for-statement
1396 ended. We only use the new rules in flag_new_for_scope is
1399 = current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1;
1401 /* Remove declarations for all the DECLs in this level. */
1402 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1404 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
1405 && DECL_NAME (link
))
1408 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link
)));
1412 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
1414 ns_binding
= NULL_TREE
;
1417 && (BINDING_LEVEL (outer_binding
)
1418 == current_binding_level
->level_chain
))
1419 /* We have something like:
1424 and we are leaving the `for' scope. There's no reason to
1425 keep the binding of the inner `i' in this case. */
1426 pop_binding (DECL_NAME (link
), link
);
1427 else if ((outer_binding
1428 && (TREE_CODE (BINDING_VALUE (outer_binding
))
1431 && TREE_CODE (ns_binding
) == TYPE_DECL
))
1432 /* Here, we have something like:
1440 We must pop the for-scope binding so we know what's a
1441 type and what isn't. */
1442 pop_binding (DECL_NAME (link
), link
);
1445 /* Mark this VAR_DECL as dead so that we can tell we left it
1446 there only for backward compatibility. */
1447 DECL_DEAD_FOR_LOCAL (link
) = 1;
1449 /* Keep track of what should of have happenned when we
1450 popped the binding. */
1451 if (outer_binding
&& BINDING_VALUE (outer_binding
))
1452 DECL_SHADOWED_FOR_VAR (link
)
1453 = BINDING_VALUE (outer_binding
);
1455 /* Add it to the list of dead variables in the next
1456 outermost binding to that we can remove these when we
1457 leave that binding. */
1458 current_binding_level
->level_chain
->dead_vars_from_for
1459 = tree_cons (NULL_TREE
, link
,
1460 current_binding_level
->level_chain
->
1461 dead_vars_from_for
);
1463 /* Although we don't pop the CPLUS_BINDING, we do clear
1464 its BINDING_LEVEL since the level is going away now. */
1465 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link
)))
1471 /* Remove the binding. */
1473 if (TREE_CODE (decl
) == TREE_LIST
)
1474 decl
= TREE_VALUE (decl
);
1476 pop_binding (DECL_NAME (decl
), decl
);
1477 else if (TREE_CODE (decl
) == OVERLOAD
)
1478 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
1484 /* Remove declarations for any `for' variables from inner scopes
1485 that we kept around. */
1486 for (link
= current_binding_level
->dead_vars_from_for
;
1487 link
; link
= TREE_CHAIN (link
))
1488 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
1490 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1491 for (link
= current_binding_level
->type_shadowed
;
1492 link
; link
= TREE_CHAIN (link
))
1493 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1495 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1496 for (link
= current_binding_level
->shadowed_labels
;
1498 link
= TREE_CHAIN (link
))
1499 pop_label (TREE_VALUE (link
), TREE_PURPOSE (link
));
1501 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1502 list if a `using' declaration put them there. The debugging
1503 back-ends won't understand OVERLOAD, so we remove them here.
1504 Because the BLOCK_VARS are (temporarily) shared with
1505 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1506 popped all the bindings. */
1511 for (d
= &BLOCK_VARS (block
); *d
; )
1513 if (TREE_CODE (*d
) == TREE_LIST
)
1514 *d
= TREE_CHAIN (*d
);
1516 d
= &TREE_CHAIN (*d
);
1520 /* If the level being exited is the top level of a function,
1521 check over all the labels. */
1524 /* Since this is the top level block of a function, the vars are
1525 the function's parameters. Don't leave them in the BLOCK
1526 because they are found in the FUNCTION_DECL instead. */
1527 BLOCK_VARS (block
) = 0;
1531 tmp
= current_binding_level
->keep
;
1533 pop_binding_level ();
1535 DECL_INITIAL (current_function_decl
) = block
;
1537 current_binding_level
->blocks
1538 = chainon (current_binding_level
->blocks
, block
);
1540 /* If we did not make a block for the level just exited,
1541 any blocks made for inner levels
1542 (since they cannot be recorded as subblocks in that level)
1543 must be carried forward so they will later become subblocks
1544 of something else. */
1546 current_binding_level
->blocks
1547 = chainon (current_binding_level
->blocks
, subblocks
);
1549 /* Each and every BLOCK node created here in `poplevel' is important
1550 (e.g. for proper debugging information) so if we created one
1551 earlier, mark it as "used". */
1553 TREE_USED (block
) = 1;
1555 /* Take care of compiler's internal binding structures. */
1561 = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/1);
1564 SCOPE_STMT_BLOCK (TREE_PURPOSE (scope_stmts
)) = block
;
1565 SCOPE_STMT_BLOCK (TREE_VALUE (scope_stmts
)) = block
;
1568 block
= poplevel (keep
, reverse
, functionbody
);
1574 /* Delete the node BLOCK from the current binding level.
1575 This is used for the block inside a stmt expr ({...})
1576 so that the block can be reinserted where appropriate. */
1579 delete_block (block
)
1583 if (current_binding_level
->blocks
== block
)
1584 current_binding_level
->blocks
= TREE_CHAIN (block
);
1585 for (t
= current_binding_level
->blocks
; t
;)
1587 if (TREE_CHAIN (t
) == block
)
1588 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1592 TREE_CHAIN (block
) = NULL_TREE
;
1593 /* Clear TREE_USED which is always set by poplevel.
1594 The flag is set again if insert_block is called. */
1595 TREE_USED (block
) = 0;
1598 /* Insert BLOCK at the end of the list of subblocks of the
1599 current binding level. This is used when a BIND_EXPR is expanded,
1600 to handle the BLOCK node inside the BIND_EXPR. */
1603 insert_block (block
)
1606 TREE_USED (block
) = 1;
1607 current_binding_level
->blocks
1608 = chainon (current_binding_level
->blocks
, block
);
1611 /* Set the BLOCK node for the innermost scope
1612 (the one we are currently in). */
1616 tree block ATTRIBUTE_UNUSED
;
1618 /* The RTL expansion machinery requires us to provide this callback,
1619 but it is not applicable in function-at-a-time mode. */
1620 my_friendly_assert (cfun
&& !doing_semantic_analysis_p (), 20000911);
1623 /* Do a pushlevel for class declarations. */
1628 register struct cp_binding_level
*newlevel
;
1630 /* Reuse or create a struct for this binding level. */
1631 #if defined(DEBUG_BINDING_LEVELS)
1633 #else /* !defined(DEBUG_BINDING_LEVELS) */
1634 if (free_binding_level
)
1635 #endif /* !defined(DEBUG_BINDING_LEVELS) */
1637 newlevel
= free_binding_level
;
1638 free_binding_level
= free_binding_level
->level_chain
;
1641 newlevel
= make_binding_level ();
1643 #if defined(DEBUG_BINDING_LEVELS)
1645 #endif /* defined(DEBUG_BINDING_LEVELS) */
1647 push_binding_level (newlevel
, 0, 0);
1649 class_binding_level
= current_binding_level
;
1650 class_binding_level
->parm_flag
= 2;
1651 class_binding_level
->this_class
= current_class_type
;
1654 /* ...and a poplevel for class declarations. */
1659 register struct cp_binding_level
*level
= class_binding_level
;
1662 my_friendly_assert (level
!= 0, 354);
1664 /* If we're leaving a toplevel class, don't bother to do the setting
1665 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1666 shouldn't even be used when current_class_type isn't set, and second,
1667 if we don't touch it here, we're able to use the cache effect if the
1668 next time we're entering a class scope, it is the same class. */
1669 if (current_class_depth
!= 1)
1671 struct cp_binding_level
* b
;
1673 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1674 for (shadowed
= level
->class_shadowed
;
1676 shadowed
= TREE_CHAIN (shadowed
))
1677 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = NULL_TREE
;
1679 /* Find the next enclosing class, and recreate
1680 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1681 b
= level
->level_chain
;
1682 while (b
&& b
->parm_flag
!= 2)
1686 for (shadowed
= b
->class_shadowed
;
1688 shadowed
= TREE_CHAIN (shadowed
))
1692 t
= IDENTIFIER_BINDING (TREE_PURPOSE (shadowed
));
1693 while (t
&& BINDING_LEVEL (t
) != b
)
1697 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
))
1698 = BINDING_VALUE (t
);
1702 /* Remember to save what IDENTIFIER's were bound in this scope so we
1703 can recover from cache misses. */
1705 previous_class_type
= current_class_type
;
1706 previous_class_values
= class_binding_level
->class_shadowed
;
1708 for (shadowed
= level
->type_shadowed
;
1710 shadowed
= TREE_CHAIN (shadowed
))
1711 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1713 /* Remove the bindings for all of the class-level declarations. */
1714 for (shadowed
= level
->class_shadowed
;
1716 shadowed
= TREE_CHAIN (shadowed
))
1717 pop_binding (TREE_PURPOSE (shadowed
), TREE_TYPE (shadowed
));
1719 /* Now, pop out of the binding level which we created up in the
1720 `pushlevel_class' routine. */
1721 #if defined(DEBUG_BINDING_LEVELS)
1723 #endif /* defined(DEBUG_BINDING_LEVELS) */
1725 pop_binding_level ();
1728 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1729 for any names in enclosing classes. */
1732 clear_identifier_class_values ()
1736 if (!class_binding_level
)
1739 for (t
= class_binding_level
->class_shadowed
;
1742 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
1745 /* Returns nonzero if T is a virtual function table. */
1748 vtable_decl_p (t
, data
)
1750 void *data ATTRIBUTE_UNUSED
;
1752 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
1755 /* Returns nonzero if T is a TYPE_DECL for a type with virtual
1759 vtype_decl_p (t
, data
)
1761 void *data ATTRIBUTE_UNUSED
;
1763 return (TREE_CODE (t
) == TYPE_DECL
1764 && TREE_CODE (TREE_TYPE (t
)) == RECORD_TYPE
1765 && TYPE_POLYMORPHIC_P (TREE_TYPE (t
)));
1768 /* Return the declarations that are members of the namespace NS. */
1771 cp_namespace_decls (ns
)
1774 return NAMESPACE_LEVEL (ns
)->names
;
1777 struct walk_globals_data
{
1778 walk_globals_pred p
;
1783 /* Walk the vtable declarations in NAMESPACE. Whenever one is found
1784 for which P returns nonzero, call F with its address. If any call
1785 to F returns a nonzero value, return a nonzero value. */
1788 walk_vtables_r (namespace, data
)
1792 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1793 walk_globals_fn f
= wgd
->f
;
1794 void *d
= wgd
->data
;
1795 tree decl
= NAMESPACE_LEVEL (namespace)->vtables
;
1798 for (; decl
; decl
= TREE_CHAIN (decl
))
1799 result
|= (*f
) (&decl
, d
);
1804 /* Walk the vtable declarations. Whenever one is found for which P
1805 returns nonzero, call F with its address. If any call to F
1806 returns a nonzero value, return a nonzero value. */
1808 walk_vtables (p
, f
, data
)
1809 walk_globals_pred p
;
1813 struct walk_globals_data wgd
;
1818 return walk_namespaces (walk_vtables_r
, &wgd
);
1821 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1822 itself, calling F for each. The DATA is passed to F as well. */
1825 walk_namespaces_r (namespace, f
, data
)
1827 walk_namespaces_fn f
;
1831 tree current
= NAMESPACE_LEVEL (namespace)->namespaces
;
1833 result
|= (*f
) (namespace, data
);
1835 for (; current
; current
= TREE_CHAIN (current
))
1836 result
|= walk_namespaces_r (current
, f
, data
);
1841 /* Walk all the namespaces, calling F for each. The DATA is passed to
1845 walk_namespaces (f
, data
)
1846 walk_namespaces_fn f
;
1849 return walk_namespaces_r (global_namespace
, f
, data
);
1852 /* Walk the global declarations in NAMESPACE. Whenever one is found
1853 for which P returns nonzero, call F with its address. If any call
1854 to F returns a nonzero value, return a nonzero value. */
1857 walk_globals_r (namespace, data
)
1861 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1862 walk_globals_pred p
= wgd
->p
;
1863 walk_globals_fn f
= wgd
->f
;
1864 void *d
= wgd
->data
;
1868 t
= &NAMESPACE_LEVEL (namespace)->names
;
1875 result
|= (*f
) (t
, d
);
1877 /* If F changed *T, then *T still points at the next item to
1880 t
= &TREE_CHAIN (*t
);
1886 /* Walk the global declarations. Whenever one is found for which P
1887 returns nonzero, call F with its address. If any call to F
1888 returns a nonzero value, return a nonzero value. */
1891 walk_globals (p
, f
, data
)
1892 walk_globals_pred p
;
1896 struct walk_globals_data wgd
;
1901 return walk_namespaces (walk_globals_r
, &wgd
);
1904 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1905 DATA is non-NULL, this is the last time we will call
1906 wrapup_global_declarations for this NAMESPACE. */
1909 wrapup_globals_for_namespace (namespace, data
)
1913 tree globals
= cp_namespace_decls (namespace);
1914 int len
= NAMESPACE_LEVEL (namespace)->names_size
;
1915 tree
*vec
= (tree
*) alloca (sizeof (tree
) * len
);
1919 int last_time
= (data
!= 0);
1921 if (last_time
&& namespace == global_namespace
)
1922 /* Let compile_file handle the global namespace. */
1925 /* Process the decls in reverse order--earliest first.
1926 Put them into VEC from back to front, then take out from front. */
1927 for (i
= 0, decl
= globals
; i
< len
; i
++, decl
= TREE_CHAIN (decl
))
1928 vec
[len
- i
- 1] = decl
;
1932 check_global_declarations (vec
, len
);
1936 /* Write out any globals that need to be output. */
1937 result
= wrapup_global_declarations (vec
, len
);
1943 /* For debugging. */
1944 static int no_print_functions
= 0;
1945 static int no_print_builtins
= 0;
1948 print_binding_level (lvl
)
1949 struct cp_binding_level
*lvl
;
1953 fprintf (stderr
, " blocks=");
1954 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
1955 if (lvl
->tag_transparent
)
1956 fprintf (stderr
, " tag-transparent");
1957 if (lvl
->more_cleanups_ok
)
1958 fprintf (stderr
, " more-cleanups-ok");
1959 if (lvl
->have_cleanups
)
1960 fprintf (stderr
, " have-cleanups");
1961 fprintf (stderr
, "\n");
1964 fprintf (stderr
, " names:\t");
1965 /* We can probably fit 3 names to a line? */
1966 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
1968 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
1970 if (no_print_builtins
1971 && (TREE_CODE (t
) == TYPE_DECL
)
1972 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
1975 /* Function decls tend to have longer names. */
1976 if (TREE_CODE (t
) == FUNCTION_DECL
)
1983 fprintf (stderr
, "\n\t");
1986 print_node_brief (stderr
, "", t
, 0);
1987 if (t
== error_mark_node
)
1991 fprintf (stderr
, "\n");
1995 fprintf (stderr
, " tags:\t");
1997 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
1999 if (TREE_PURPOSE (t
) == NULL_TREE
)
2001 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2008 fprintf (stderr
, "\n\t");
2011 if (TREE_PURPOSE (t
) == NULL_TREE
)
2013 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
2014 fprintf (stderr
, ">");
2016 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2017 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2020 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
2021 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2022 fprintf (stderr
, ">");
2026 fprintf (stderr
, "\n");
2028 if (lvl
->class_shadowed
)
2030 fprintf (stderr
, " class-shadowed:");
2031 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
2033 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2035 fprintf (stderr
, "\n");
2037 if (lvl
->type_shadowed
)
2039 fprintf (stderr
, " type-shadowed:");
2040 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2042 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2044 fprintf (stderr
, "\n");
2049 print_other_binding_stack (stack
)
2050 struct cp_binding_level
*stack
;
2052 struct cp_binding_level
*level
;
2053 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
2055 fprintf (stderr
, "binding level ");
2056 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
2057 fprintf (stderr
, "\n");
2058 print_binding_level (level
);
2063 print_binding_stack ()
2065 struct cp_binding_level
*b
;
2066 fprintf (stderr
, "current_binding_level=");
2067 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
2068 fprintf (stderr
, "\nclass_binding_level=");
2069 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
2070 fprintf (stderr
, "\nglobal_binding_level=");
2071 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
2072 fprintf (stderr
, "\n");
2073 if (class_binding_level
)
2075 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
2076 if (b
== current_binding_level
)
2079 b
= class_binding_level
;
2081 b
= current_binding_level
;
2084 b
= current_binding_level
;
2085 print_other_binding_stack (b
);
2086 fprintf (stderr
, "global:\n");
2087 print_binding_level (global_binding_level
);
2090 /* Namespace binding access routines: The namespace_bindings field of
2091 the identifier is polymorphic, with three possible values:
2092 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2093 indicating the BINDING_VALUE of global_namespace. */
2095 /* Check whether the a binding for the name to scope is known.
2096 Assumes that the bindings of the name are already a list
2097 of bindings. Returns the binding found, or NULL_TREE. */
2100 find_binding (name
, scope
)
2104 tree iter
, prev
= NULL_TREE
;
2106 scope
= ORIGINAL_NAMESPACE (scope
);
2108 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
2109 iter
= TREE_CHAIN (iter
))
2111 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
2112 if (BINDING_SCOPE (iter
) == scope
)
2114 /* Move binding found to the front of the list, so
2115 subsequent lookups will find it faster. */
2118 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
2119 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
2120 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
2129 /* Always returns a binding for name in scope. If the
2130 namespace_bindings is not a list, convert it to one first.
2131 If no binding is found, make a new one. */
2134 binding_for_name (name
, scope
)
2138 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2141 scope
= ORIGINAL_NAMESPACE (scope
);
2143 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
2145 /* Get rid of optimization for global scope. */
2146 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
2147 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
2148 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2150 if (b
&& (result
= find_binding (name
, scope
)))
2152 /* Not found, make a new one. */
2153 result
= make_node (CPLUS_BINDING
);
2154 TREE_CHAIN (result
) = b
;
2155 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2156 BINDING_SCOPE (result
) = scope
;
2157 BINDING_TYPE (result
) = NULL_TREE
;
2158 BINDING_VALUE (result
) = NULL_TREE
;
2162 /* Return the binding value for name in scope, considering that
2163 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2166 namespace_binding (name
, scope
)
2170 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2173 if (scope
== NULL_TREE
)
2174 scope
= global_namespace
;
2175 if (TREE_CODE (b
) != CPLUS_BINDING
)
2176 return (scope
== global_namespace
) ? b
: NULL_TREE
;
2177 name
= find_binding (name
,scope
);
2178 if (name
== NULL_TREE
)
2180 return BINDING_VALUE (name
);
2183 /* Set the binding value for name in scope. If modifying the binding
2184 of global_namespace is attempted, try to optimize it. */
2187 set_namespace_binding (name
, scope
, val
)
2194 if (scope
== NULL_TREE
)
2195 scope
= global_namespace
;
2197 if (scope
== global_namespace
)
2199 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2200 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
2202 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
2206 b
= binding_for_name (name
, scope
);
2207 BINDING_VALUE (b
) = val
;
2210 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2211 select a name that is unique to this compilation unit. */
2214 push_namespace (name
)
2219 int implicit_use
= 0;
2221 if (!global_namespace
)
2223 /* This must be ::. */
2224 my_friendly_assert (name
== get_identifier ("::"), 377);
2229 /* The name of anonymous namespace is unique for the translation
2231 if (!anonymous_namespace_name
)
2232 anonymous_namespace_name
= get_file_function_name ('N');
2233 name
= anonymous_namespace_name
;
2234 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2236 /* Reopening anonymous namespace. */
2242 /* Check whether this is an extended namespace definition. */
2243 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2244 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
2247 if (DECL_NAMESPACE_ALIAS (d
))
2249 error ("namespace alias `%D' not allowed here, assuming `%D'",
2250 d
, DECL_NAMESPACE_ALIAS (d
));
2251 d
= DECL_NAMESPACE_ALIAS (d
);
2258 /* Make a new namespace, binding the name to it. */
2259 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
2260 /* The global namespace is not pushed, and the global binding
2261 level is set elsewhere. */
2264 DECL_CONTEXT (d
) = FROB_CONTEXT (current_namespace
);
2267 declare_namespace_level ();
2268 NAMESPACE_LEVEL (d
) = current_binding_level
;
2272 resume_binding_level (NAMESPACE_LEVEL (d
));
2275 do_using_directive (d
);
2276 /* Enter the name space. */
2277 current_namespace
= d
;
2280 /* Pop from the scope of the current namespace. */
2285 my_friendly_assert (current_namespace
!= global_namespace
, 20010801);
2286 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
2287 /* The binding level is not popped, as it might be re-opened later. */
2288 suspend_binding_level ();
2291 /* Push into the scope of the namespace NS, even if it is deeply
2292 nested within another namespace. */
2295 push_nested_namespace (ns
)
2298 if (ns
== global_namespace
)
2299 push_to_top_level ();
2302 push_nested_namespace (CP_DECL_CONTEXT (ns
));
2303 push_namespace (DECL_NAME (ns
));
2307 /* Pop back from the scope of the namespace NS, which was previously
2308 entered with push_nested_namespace. */
2311 pop_nested_namespace (ns
)
2314 while (ns
!= global_namespace
)
2317 ns
= CP_DECL_CONTEXT (ns
);
2320 pop_from_top_level ();
2324 /* Subroutines for reverting temporarily to top-level for instantiation
2325 of templates and such. We actually need to clear out the class- and
2326 local-value slots of all identifiers, so that only the global values
2327 are at all visible. Simply setting current_binding_level to the global
2328 scope isn't enough, because more binding levels may be pushed. */
2329 struct saved_scope
*scope_chain
;
2332 store_bindings (names
, old_bindings
)
2333 tree names
, old_bindings
;
2336 tree search_bindings
= old_bindings
;
2338 for (t
= names
; t
; t
= TREE_CHAIN (t
))
2340 tree binding
, t1
, id
;
2342 if (TREE_CODE (t
) == TREE_LIST
)
2343 id
= TREE_PURPOSE (t
);
2348 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2349 we have no IDENTIFIER_BINDING if we have left the class
2350 scope, but cached the class-level declarations. */
2351 || !(IDENTIFIER_BINDING (id
) || IDENTIFIER_CLASS_VALUE (id
)))
2354 for (t1
= search_bindings
; t1
; t1
= TREE_CHAIN (t1
))
2355 if (TREE_VEC_ELT (t1
, 0) == id
)
2358 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
2359 binding
= make_tree_vec (4);
2360 TREE_VEC_ELT (binding
, 0) = id
;
2361 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
2362 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_BINDING (id
);
2363 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
2364 IDENTIFIER_BINDING (id
) = NULL_TREE
;
2365 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
2366 TREE_CHAIN (binding
) = old_bindings
;
2367 old_bindings
= binding
;
2371 return old_bindings
;
2375 maybe_push_to_top_level (pseudo
)
2378 struct saved_scope
*s
;
2379 struct cp_binding_level
*b
;
2383 s
= (struct saved_scope
*) ggc_alloc_cleared (sizeof (struct saved_scope
));
2385 b
= scope_chain
? current_binding_level
: 0;
2387 /* If we're in the middle of some function, save our state. */
2391 push_function_context_to (NULL_TREE
);
2396 old_bindings
= NULL_TREE
;
2397 if (scope_chain
&& previous_class_type
)
2398 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
2400 /* Have to include global_binding_level, because class-level decls
2401 aren't listed anywhere useful. */
2402 for (; b
; b
= b
->level_chain
)
2406 /* Template IDs are inserted into the global level. If they were
2407 inserted into namespace level, finish_file wouldn't find them
2408 when doing pending instantiations. Therefore, don't stop at
2409 namespace level, but continue until :: . */
2410 if (b
== global_binding_level
|| (pseudo
&& b
->template_parms_p
))
2413 old_bindings
= store_bindings (b
->names
, old_bindings
);
2414 /* We also need to check class_shadowed to save class-level type
2415 bindings, since pushclass doesn't fill in b->names. */
2416 if (b
->parm_flag
== 2)
2417 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2419 /* Unwind type-value slots back to top level. */
2420 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2421 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2423 s
->prev
= scope_chain
;
2424 s
->old_bindings
= old_bindings
;
2426 s
->need_pop_function_context
= need_pop
;
2427 s
->function_decl
= current_function_decl
;
2428 s
->last_parms
= last_function_parms
;
2431 current_function_decl
= NULL_TREE
;
2432 VARRAY_TREE_INIT (current_lang_base
, 10, "current_lang_base");
2433 current_lang_name
= lang_name_cplusplus
;
2434 current_namespace
= global_namespace
;
2438 push_to_top_level ()
2440 maybe_push_to_top_level (0);
2444 pop_from_top_level ()
2446 struct saved_scope
*s
= scope_chain
;
2449 /* Clear out class-level bindings cache. */
2450 if (previous_class_type
)
2451 invalidate_class_lookup_cache ();
2453 current_lang_base
= 0;
2455 scope_chain
= s
->prev
;
2456 for (t
= s
->old_bindings
; t
; t
= TREE_CHAIN (t
))
2458 tree id
= TREE_VEC_ELT (t
, 0);
2460 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2461 IDENTIFIER_BINDING (id
) = TREE_VEC_ELT (t
, 2);
2462 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2465 /* If we were in the middle of compiling a function, restore our
2467 if (s
->need_pop_function_context
)
2468 pop_function_context_from (NULL_TREE
);
2469 current_function_decl
= s
->function_decl
;
2470 last_function_parms
= s
->last_parms
;
2473 /* Push a definition of struct, union or enum tag "name".
2474 into binding_level "b". "type" should be the type node,
2475 We assume that the tag "name" is not already defined.
2477 Note that the definition may really be just a forward reference.
2478 In that case, the TYPE_SIZE will be a NULL_TREE.
2480 C++ gratuitously puts all these tags in the name space. */
2482 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2483 record the shadowed value for this binding contour. TYPE is
2484 the type that ID maps to. */
2487 set_identifier_type_value_with_scope (id
, type
, b
)
2490 struct cp_binding_level
*b
;
2492 if (!b
->namespace_p
)
2494 /* Shadow the marker, not the real thing, so that the marker
2495 gets restored later. */
2496 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2498 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2502 tree binding
= binding_for_name (id
, current_namespace
);
2503 BINDING_TYPE (binding
) = type
;
2504 /* Store marker instead of real type. */
2505 type
= global_type_node
;
2507 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2510 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2513 set_identifier_type_value (id
, type
)
2517 set_identifier_type_value_with_scope (id
, type
, current_binding_level
);
2520 /* Return the type associated with id. */
2523 identifier_type_value (id
)
2526 /* There is no type with that name, anywhere. */
2527 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2529 /* This is not the type marker, but the real thing. */
2530 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2531 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2532 /* Have to search for it. It must be on the global level, now.
2533 Ask lookup_name not to return non-types. */
2534 id
= lookup_name_real (id
, 2, 1, 0);
2536 return TREE_TYPE (id
);
2540 /* Pop off extraneous binding levels left over due to syntax errors.
2542 We don't pop past namespaces, as they might be valid. */
2547 #ifdef DEBUG_BINDING_LEVELS
2548 fprintf (stderr
, "XXX entering pop_everything ()\n");
2550 while (!toplevel_bindings_p ())
2552 if (current_binding_level
->parm_flag
== 2)
2553 pop_nested_class ();
2557 #ifdef DEBUG_BINDING_LEVELS
2558 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2562 /* The type TYPE is being declared. If it is a class template, or a
2563 specialization of a class template, do any processing required and
2564 perform error-checking. If IS_FRIEND is nonzero, this TYPE is
2565 being declared a friend. B is the binding level at which this TYPE
2568 Returns the TYPE_DECL for TYPE, which may have been altered by this
2572 maybe_process_template_type_declaration (type
, globalize
, b
)
2575 struct cp_binding_level
* b
;
2577 tree decl
= TYPE_NAME (type
);
2579 if (processing_template_parmlist
)
2580 /* You can't declare a new template type in a template parameter
2581 list. But, you can declare a non-template type:
2583 template <class A*> struct S;
2585 is a forward-declaration of `A'. */
2589 maybe_check_template_type (type
);
2591 my_friendly_assert (IS_AGGR_TYPE (type
)
2592 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2595 if (processing_template_decl
)
2597 /* This may change after the call to
2598 push_template_decl_real, but we want the original value. */
2599 tree name
= DECL_NAME (decl
);
2601 decl
= push_template_decl_real (decl
, globalize
);
2602 /* If the current binding level is the binding level for the
2603 template parameters (see the comment in
2604 begin_template_parm_list) and the enclosing level is a class
2605 scope, and we're not looking at a friend, push the
2606 declaration of the member class into the class scope. In the
2607 friend case, push_template_decl will already have put the
2608 friend into global scope, if appropriate. */
2609 if (TREE_CODE (type
) != ENUMERAL_TYPE
2610 && !globalize
&& b
->template_parms_p
2611 && b
->level_chain
->parm_flag
== 2)
2613 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2614 /* Put this tag on the list of tags for the class, since
2615 that won't happen below because B is not the class
2616 binding level, but is instead the pseudo-global level. */
2617 b
->level_chain
->tags
=
2618 tree_cons (name
, type
, b
->level_chain
->tags
);
2619 if (!COMPLETE_TYPE_P (current_class_type
))
2620 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2628 /* In C++, you don't have to write `struct S' to refer to `S'; you
2629 can just use `S'. We accomplish this by creating a TYPE_DECL as
2630 if the user had written `typedef struct S S'. Create and return
2631 the TYPE_DECL for TYPE. */
2634 create_implicit_typedef (name
, type
)
2640 decl
= build_decl (TYPE_DECL
, name
, type
);
2641 DECL_ARTIFICIAL (decl
) = 1;
2642 /* There are other implicit type declarations, like the one *within*
2643 a class that allows you to write `S::S'. We must distinguish
2645 SET_DECL_IMPLICIT_TYPEDEF_P (decl
);
2646 TYPE_NAME (type
) = decl
;
2651 /* Remember a local name for name-mangling purposes. */
2654 push_local_name (decl
)
2661 VARRAY_TREE_INIT (local_names
, 8, "local_names");
2663 name
= DECL_NAME (decl
);
2665 nelts
= VARRAY_ACTIVE_SIZE (local_names
);
2666 for (i
= 0; i
< nelts
; i
++)
2668 t
= VARRAY_TREE (local_names
, i
);
2669 if (DECL_NAME (t
) == name
)
2671 if (!DECL_LANG_SPECIFIC (decl
))
2672 retrofit_lang_decl (decl
);
2673 DECL_LANG_SPECIFIC (decl
)->decl_flags
.u2sel
= 1;
2674 if (DECL_LANG_SPECIFIC (t
))
2675 DECL_DISCRIMINATOR (decl
) = DECL_DISCRIMINATOR (t
) + 1;
2677 DECL_DISCRIMINATOR (decl
) = 1;
2679 VARRAY_TREE (local_names
, i
) = decl
;
2684 VARRAY_PUSH_TREE (local_names
, decl
);
2687 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2688 Normally put it into the inner-most non-tag-transparent scope,
2689 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2690 The latter is needed for implicit declarations. */
2693 pushtag (name
, type
, globalize
)
2697 register struct cp_binding_level
*b
;
2699 b
= current_binding_level
;
2700 while (b
->tag_transparent
2701 || (b
->parm_flag
== 2
2703 /* We may be defining a new type in the initializer
2704 of a static member variable. We allow this when
2705 not pedantic, and it is particularly useful for
2706 type punning via an anonymous union. */
2707 || COMPLETE_TYPE_P (b
->this_class
))))
2710 b
->tags
= tree_cons (name
, type
, b
->tags
);
2714 /* Do C++ gratuitous typedefing. */
2715 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2717 register tree d
= NULL_TREE
;
2719 tree context
= TYPE_CONTEXT (type
);
2723 tree cs
= current_scope ();
2727 else if (cs
!= NULL_TREE
&& TYPE_P (cs
))
2728 /* When declaring a friend class of a local class, we want
2729 to inject the newly named class into the scope
2730 containing the local class, not the namespace scope. */
2731 context
= decl_function_context (get_type_decl (cs
));
2734 context
= current_namespace
;
2736 if ((b
->template_parms_p
&& b
->level_chain
->parm_flag
== 2)
2737 || b
->parm_flag
== 2)
2740 if (current_lang_name
== lang_name_java
)
2741 TYPE_FOR_JAVA (type
) = 1;
2743 d
= create_implicit_typedef (name
, type
);
2744 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2746 set_identifier_type_value_with_scope (name
, type
, b
);
2748 d
= maybe_process_template_type_declaration (type
,
2751 if (b
->parm_flag
== 2)
2753 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2754 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2755 class. But if it's a member template class, we
2756 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2758 finish_member_declaration (d
);
2760 pushdecl_class_level (d
);
2763 d
= pushdecl_with_scope (d
, b
);
2765 /* FIXME what if it gets a name from typedef? */
2766 if (ANON_AGGRNAME_P (name
))
2767 DECL_IGNORED_P (d
) = 1;
2769 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2771 /* If this is a local class, keep track of it. We need this
2772 information for name-mangling, and so that it is possible to find
2773 all function definitions in a translation unit in a convenient
2774 way. (It's otherwise tricky to find a member function definition
2775 it's only pointed to from within a local class.) */
2776 if (TYPE_CONTEXT (type
)
2777 && TREE_CODE (TYPE_CONTEXT (type
)) == FUNCTION_DECL
2778 && !processing_template_decl
)
2779 VARRAY_PUSH_TREE (local_classes
, type
);
2781 if (b
->parm_flag
== 2)
2783 if (!COMPLETE_TYPE_P (current_class_type
))
2784 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2788 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2789 /* Use the canonical TYPE_DECL for this node. */
2790 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2793 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2794 will be the tagged type we just added to the current
2795 binding level. This fake NULL-named TYPE_DECL node helps
2796 dwarfout.c to know when it needs to output a
2797 representation of a tagged type, and it also gives us a
2798 convenient place to record the "scope start" address for
2801 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2802 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2806 /* Counter used to create anonymous type names. */
2808 static int anon_cnt
= 0;
2810 /* Return an IDENTIFIER which can be used as a name for
2811 anonymous structs and unions. */
2818 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2819 return get_identifier (buf
);
2822 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2823 This keeps dbxout from getting confused. */
2828 register struct cp_binding_level
*b
;
2830 static int last_cnt
= 0;
2832 /* Fast out if no new anon names were declared. */
2833 if (last_cnt
== anon_cnt
)
2836 b
= current_binding_level
;
2837 while (b
->tag_transparent
)
2842 /* A NULL purpose means we have already processed all tags
2843 from here to the end of the list. */
2844 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2846 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2847 TREE_PURPOSE (tags
) = NULL_TREE
;
2848 tags
= TREE_CHAIN (tags
);
2850 last_cnt
= anon_cnt
;
2853 /* Subroutine of duplicate_decls: return truthvalue of whether
2854 or not types of these decls match.
2856 For C++, we must compare the parameter list so that `int' can match
2857 `int&' in a parameter position, but `int&' is not confused with
2861 decls_match (newdecl
, olddecl
)
2862 tree newdecl
, olddecl
;
2866 if (newdecl
== olddecl
)
2869 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
2870 /* If the two DECLs are not even the same kind of thing, we're not
2871 interested in their types. */
2874 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2876 tree f1
= TREE_TYPE (newdecl
);
2877 tree f2
= TREE_TYPE (olddecl
);
2878 tree p1
= TYPE_ARG_TYPES (f1
);
2879 tree p2
= TYPE_ARG_TYPES (f2
);
2881 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
)
2882 && ! (DECL_EXTERN_C_P (newdecl
)
2883 && DECL_EXTERN_C_P (olddecl
)))
2886 if (TREE_CODE (f1
) != TREE_CODE (f2
))
2889 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
2891 if (p2
== NULL_TREE
&& DECL_EXTERN_C_P (olddecl
)
2892 && (DECL_BUILT_IN (olddecl
)
2893 #ifndef NO_IMPLICIT_EXTERN_C
2894 || (DECL_IN_SYSTEM_HEADER (newdecl
) && !DECL_CLASS_SCOPE_P (newdecl
))
2895 || (DECL_IN_SYSTEM_HEADER (olddecl
) && !DECL_CLASS_SCOPE_P (olddecl
))
2899 types_match
= self_promoting_args_p (p1
);
2900 if (p1
== void_list_node
)
2901 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2903 #ifndef NO_IMPLICIT_EXTERN_C
2904 else if (p1
== NULL_TREE
2905 && (DECL_EXTERN_C_P (olddecl
)
2906 && DECL_IN_SYSTEM_HEADER (olddecl
)
2907 && !DECL_CLASS_SCOPE_P (olddecl
))
2908 && (DECL_EXTERN_C_P (newdecl
)
2909 && DECL_IN_SYSTEM_HEADER (newdecl
)
2910 && !DECL_CLASS_SCOPE_P (newdecl
)))
2912 types_match
= self_promoting_args_p (p2
);
2913 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2917 types_match
= compparms (p1
, p2
);
2922 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2924 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
2925 DECL_TEMPLATE_PARMS (olddecl
)))
2928 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
))
2929 != TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)))
2932 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
2935 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
2936 DECL_TEMPLATE_RESULT (newdecl
));
2940 if (TREE_TYPE (newdecl
) == error_mark_node
)
2941 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
2942 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
2943 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
2944 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
2947 types_match
= comptypes (TREE_TYPE (newdecl
),
2948 TREE_TYPE (olddecl
),
2949 COMPARE_REDECLARATION
);
2955 /* If NEWDECL is `static' and an `extern' was seen previously,
2956 warn about it. OLDDECL is the previous declaration.
2958 Note that this does not apply to the C++ case of declaring
2959 a variable `extern const' and then later `const'.
2961 Don't complain about built-in functions, since they are beyond
2962 the user's control. */
2965 warn_extern_redeclared_static (newdecl
, olddecl
)
2966 tree newdecl
, olddecl
;
2968 static const char *const explicit_extern_static_warning
2969 = "`%D' was declared `extern' and later `static'";
2970 static const char *const implicit_extern_static_warning
2971 = "`%D' was declared implicitly `extern' and later `static'";
2975 if (TREE_CODE (newdecl
) == TYPE_DECL
2976 || TREE_CODE (newdecl
) == TEMPLATE_DECL
2977 || TREE_CODE (newdecl
) == CONST_DECL
)
2980 /* Don't get confused by static member functions; that's a different
2982 if (TREE_CODE (newdecl
) == FUNCTION_DECL
2983 && DECL_STATIC_FUNCTION_P (newdecl
))
2986 /* If the old declaration was `static', or the new one isn't, then
2987 then everything is OK. */
2988 if (DECL_THIS_STATIC (olddecl
) || !DECL_THIS_STATIC (newdecl
))
2991 /* It's OK to declare a builtin function as `static'. */
2992 if (TREE_CODE (olddecl
) == FUNCTION_DECL
2993 && DECL_ARTIFICIAL (olddecl
))
2996 name
= DECL_ASSEMBLER_NAME (newdecl
);
2997 pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
2998 ? implicit_extern_static_warning
2999 : explicit_extern_static_warning
, newdecl
);
3000 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
3003 /* Handle when a new declaration NEWDECL has the same name as an old
3004 one OLDDECL in the same binding contour. Prints an error message
3007 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
3008 Otherwise, return 0. */
3011 duplicate_decls (newdecl
, olddecl
)
3012 tree newdecl
, olddecl
;
3014 unsigned olddecl_uid
= DECL_UID (olddecl
);
3015 int olddecl_friend
= 0, types_match
= 0;
3016 int new_defines_function
= 0;
3018 if (newdecl
== olddecl
)
3021 types_match
= decls_match (newdecl
, olddecl
);
3023 /* If either the type of the new decl or the type of the old decl is an
3024 error_mark_node, then that implies that we have already issued an
3025 error (earlier) for some bogus type specification, and in that case,
3026 it is rather pointless to harass the user with yet more error message
3027 about the same declaration, so just pretend the types match here. */
3028 if (TREE_TYPE (newdecl
) == error_mark_node
3029 || TREE_TYPE (olddecl
) == error_mark_node
)
3032 if (DECL_P (olddecl
)
3033 && TREE_CODE (newdecl
) == FUNCTION_DECL
3034 && TREE_CODE (olddecl
) == FUNCTION_DECL
3035 && (DECL_UNINLINABLE (newdecl
) || DECL_UNINLINABLE (olddecl
)))
3037 if (DECL_DECLARED_INLINE_P (newdecl
)
3038 && DECL_UNINLINABLE (newdecl
)
3039 && lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl
)))
3040 /* Already warned elsewhere. */;
3041 else if (DECL_DECLARED_INLINE_P (olddecl
)
3042 && DECL_UNINLINABLE (olddecl
)
3043 && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl
)))
3044 /* Already warned. */;
3045 else if (DECL_DECLARED_INLINE_P (newdecl
)
3046 && DECL_UNINLINABLE (olddecl
)
3047 && lookup_attribute ("noinline", DECL_ATTRIBUTES (olddecl
)))
3049 warning_with_decl (newdecl
,
3050 "function `%s' redeclared as inline");
3051 warning_with_decl (olddecl
,
3052 "previous declaration of function `%s' with attribute noinline");
3054 else if (DECL_DECLARED_INLINE_P (olddecl
)
3055 && DECL_UNINLINABLE (newdecl
)
3056 && lookup_attribute ("noinline", DECL_ATTRIBUTES (newdecl
)))
3058 warning_with_decl (newdecl
,
3059 "function `%s' redeclared with attribute noinline");
3060 warning_with_decl (olddecl
,
3061 "previous declaration of function `%s' was inline");
3065 /* Check for redeclaration and other discrepancies. */
3066 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3067 && DECL_ARTIFICIAL (olddecl
))
3069 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
3071 /* Avoid warnings redeclaring anticipated built-ins. */
3072 if (DECL_ANTICIPATED (olddecl
))
3075 /* If you declare a built-in or predefined function name as static,
3076 the old definition is overridden, but optionally warn this was a
3077 bad choice of name. */
3078 if (! TREE_PUBLIC (newdecl
))
3081 warning ("shadowing %s function `%#D'",
3082 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3084 /* Discard the old built-in function. */
3087 /* If the built-in is not ansi, then programs can override
3088 it even globally without an error. */
3089 else if (! DECL_BUILT_IN (olddecl
))
3090 warning ("library function `%#D' redeclared as non-function `%#D'",
3094 error ("declaration of `%#D'", newdecl
);
3095 error ("conflicts with built-in declaration `%#D'",
3100 else if (!types_match
)
3102 /* Avoid warnings redeclaring anticipated built-ins. */
3103 if (DECL_ANTICIPATED (olddecl
))
3104 ; /* Do nothing yet. */
3105 else if ((DECL_EXTERN_C_P (newdecl
)
3106 && DECL_EXTERN_C_P (olddecl
))
3107 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3108 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3110 /* A near match; override the builtin. */
3112 if (TREE_PUBLIC (newdecl
))
3114 warning ("new declaration `%#D'", newdecl
);
3115 warning ("ambiguates built-in declaration `%#D'",
3118 else if (warn_shadow
)
3119 warning ("shadowing %s function `%#D'",
3120 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3124 /* Discard the old built-in function. */
3127 /* Replace the old RTL to avoid problems with inlining. */
3128 SET_DECL_RTL (olddecl
, DECL_RTL (newdecl
));
3131 if (DECL_THIS_STATIC (newdecl
) && !DECL_THIS_STATIC (olddecl
))
3133 /* If a builtin function is redeclared as `static', merge
3134 the declarations, but make the original one static. */
3135 DECL_THIS_STATIC (olddecl
) = 1;
3136 TREE_PUBLIC (olddecl
) = 0;
3138 /* Make the old declaration consistent with the new one so
3139 that all remnants of the builtin-ness of this function
3140 will be banished. */
3141 SET_DECL_LANGUAGE (olddecl
, DECL_LANGUAGE (newdecl
));
3142 SET_DECL_RTL (olddecl
, DECL_RTL (newdecl
));
3145 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3147 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3148 && TREE_CODE (newdecl
) != TYPE_DECL
3149 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3150 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3151 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3152 && TREE_CODE (olddecl
) != TYPE_DECL
3153 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3154 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3157 /* We do nothing special here, because C++ does such nasty
3158 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3159 get shadowed, and know that if we need to find a TYPE_DECL
3160 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3161 slot of the identifier. */
3165 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3166 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3167 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3168 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3171 error ("`%#D' redeclared as different kind of symbol", newdecl
);
3172 if (TREE_CODE (olddecl
) == TREE_LIST
)
3173 olddecl
= TREE_VALUE (olddecl
);
3174 cp_error_at ("previous declaration of `%#D'", olddecl
);
3176 /* New decl is completely inconsistent with the old one =>
3177 tell caller to replace the old one. */
3181 else if (!types_match
)
3183 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
))
3184 /* These are certainly not duplicate declarations; they're
3185 from different scopes. */
3188 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3190 /* The name of a class template may not be declared to refer to
3191 any other template, class, function, object, namespace, value,
3192 or type in the same scope. */
3193 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3194 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3196 error ("declaration of template `%#D'", newdecl
);
3197 cp_error_at ("conflicts with previous declaration `%#D'",
3200 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3201 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3202 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3203 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3204 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3205 DECL_TEMPLATE_PARMS (olddecl
)))
3207 error ("new declaration `%#D'", newdecl
);
3208 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3212 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3214 if (DECL_EXTERN_C_P (newdecl
) && DECL_EXTERN_C_P (olddecl
))
3216 error ("declaration of C function `%#D' conflicts with",
3218 cp_error_at ("previous declaration `%#D' here", olddecl
);
3220 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3221 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3223 error ("new declaration `%#D'", newdecl
);
3224 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3230 /* Already complained about this, so don't do so again. */
3231 else if (current_class_type
== NULL_TREE
3232 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3234 error ("conflicting types for `%#D'", newdecl
);
3235 cp_error_at ("previous declaration as `%#D'", olddecl
);
3238 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3239 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3240 && (!DECL_TEMPLATE_INFO (newdecl
)
3241 || (DECL_TI_TEMPLATE (newdecl
)
3242 != DECL_TI_TEMPLATE (olddecl
))))
3243 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3244 && (!DECL_TEMPLATE_INFO (olddecl
)
3245 || (DECL_TI_TEMPLATE (olddecl
)
3246 != DECL_TI_TEMPLATE (newdecl
))))))
3247 /* It's OK to have a template specialization and a non-template
3248 with the same type, or to have specializations of two
3249 different templates with the same type. Note that if one is a
3250 specialization, and the other is an instantiation of the same
3251 template, that we do not exit at this point. That situation
3252 can occur if we instantiate a template class, and then
3253 specialize one of its methods. This situation is valid, but
3254 the declarations must be merged in the usual way. */
3256 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3257 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3258 && !DECL_USE_TEMPLATE (newdecl
))
3259 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3260 && !DECL_USE_TEMPLATE (olddecl
))))
3261 /* One of the declarations is a template instantiation, and the
3262 other is not a template at all. That's OK. */
3264 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3265 && DECL_NAMESPACE_ALIAS (newdecl
)
3266 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3267 /* Redeclaration of namespace alias, ignore it. */
3271 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3274 error (errmsg
, newdecl
);
3275 if (DECL_NAME (olddecl
) != NULL_TREE
)
3276 cp_error_at ((DECL_INITIAL (olddecl
)
3277 && namespace_bindings_p ())
3278 ? "`%#D' previously defined here"
3279 : "`%#D' previously declared here", olddecl
);
3282 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3283 && DECL_INITIAL (olddecl
) != NULL_TREE
3284 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3285 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3287 /* Prototype decl follows defn w/o prototype. */
3288 cp_warning_at ("prototype for `%#D'", newdecl
);
3289 cp_warning_at ("follows non-prototype definition here", olddecl
);
3291 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3292 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3294 /* extern "C" int foo ();
3295 int foo () { bar (); }
3297 if (current_lang_depth () == 0)
3298 SET_DECL_LANGUAGE (newdecl
, DECL_LANGUAGE (olddecl
));
3301 cp_error_at ("previous declaration of `%#D' with %L linkage",
3302 olddecl
, DECL_LANGUAGE (olddecl
));
3303 error ("conflicts with new declaration with %L linkage",
3304 DECL_LANGUAGE (newdecl
));
3308 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3310 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3312 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3313 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3316 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3317 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3319 for (; t1
&& t1
!= void_list_node
;
3320 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3321 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3323 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3326 pedwarn ("default argument given for parameter %d of `%#D'",
3328 cp_pedwarn_at ("after previous specification in `%#D'",
3333 error ("default argument given for parameter %d of `%#D'",
3335 cp_error_at ("after previous specification in `%#D'",
3340 if (DECL_DECLARED_INLINE_P (newdecl
)
3341 && ! DECL_DECLARED_INLINE_P (olddecl
)
3342 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3344 warning ("`%#D' was used before it was declared inline",
3346 cp_warning_at ("previous non-inline declaration here",
3352 /* Do not merge an implicit typedef with an explicit one. In:
3356 typedef class A A __attribute__ ((foo));
3358 the attribute should apply only to the typedef. */
3359 if (TREE_CODE (olddecl
) == TYPE_DECL
3360 && (DECL_IMPLICIT_TYPEDEF_P (olddecl
)
3361 || DECL_IMPLICIT_TYPEDEF_P (newdecl
)))
3364 /* If new decl is `static' and an `extern' was seen previously,
3366 warn_extern_redeclared_static (newdecl
, olddecl
);
3368 /* We have committed to returning 1 at this point. */
3369 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3371 /* Now that functions must hold information normally held
3372 by field decls, there is extra work to do so that
3373 declaration information does not get destroyed during
3375 if (DECL_VINDEX (olddecl
))
3376 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3377 if (DECL_VIRTUAL_CONTEXT (olddecl
))
3378 DECL_VIRTUAL_CONTEXT (newdecl
) = DECL_VIRTUAL_CONTEXT (olddecl
);
3379 if (DECL_CONTEXT (olddecl
))
3380 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3381 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3382 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3383 DECL_PURE_VIRTUAL_P (newdecl
) |= DECL_PURE_VIRTUAL_P (olddecl
);
3384 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3385 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3386 DECL_THIS_STATIC (newdecl
) |= DECL_THIS_STATIC (olddecl
);
3387 if (DECL_OVERLOADED_OPERATOR_P (olddecl
) != ERROR_MARK
)
3388 SET_OVERLOADED_OPERATOR_CODE
3389 (newdecl
, DECL_OVERLOADED_OPERATOR_P (olddecl
));
3390 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3392 /* Optionally warn about more than one declaration for the same
3393 name, but don't warn about a function declaration followed by a
3395 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3396 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3397 /* Don't warn about extern decl followed by definition. */
3398 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3399 /* Don't warn about friends, let add_friend take care of it. */
3400 && ! (DECL_FRIEND_P (newdecl
) || DECL_FRIEND_P (olddecl
)))
3402 warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3403 cp_warning_at ("previous declaration of `%D'", olddecl
);
3407 /* Deal with C++: must preserve virtual function table size. */
3408 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3410 register tree newtype
= TREE_TYPE (newdecl
);
3411 register tree oldtype
= TREE_TYPE (olddecl
);
3413 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3414 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3416 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3417 CLASSTYPE_FRIEND_CLASSES (newtype
)
3418 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3421 DECL_ORIGINAL_TYPE (newdecl
) = DECL_ORIGINAL_TYPE (olddecl
);
3424 /* Copy all the DECL_... slots specified in the new decl
3425 except for any that we copy here from the old type. */
3426 DECL_ATTRIBUTES (newdecl
)
3427 = (*targetm
.merge_decl_attributes
) (olddecl
, newdecl
);
3429 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3431 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3432 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3433 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3434 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3436 /* If the new declaration is a definition, update the file and
3437 line information on the declaration. */
3438 if (DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)) == NULL_TREE
3439 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
)) != NULL_TREE
)
3441 DECL_SOURCE_LOCATION (olddecl
)
3442 = DECL_SOURCE_LOCATION (DECL_TEMPLATE_RESULT (olddecl
))
3443 = DECL_SOURCE_LOCATION (newdecl
);
3451 /* Automatically handles default parameters. */
3452 tree oldtype
= TREE_TYPE (olddecl
);
3455 /* Merge the data types specified in the two decls. */
3456 newtype
= merge_types (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3458 /* If merge_types produces a non-typedef type, just use the old type. */
3459 if (TREE_CODE (newdecl
) == TYPE_DECL
3460 && newtype
== DECL_ORIGINAL_TYPE (newdecl
))
3463 if (TREE_CODE (newdecl
) == VAR_DECL
)
3465 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3466 DECL_INITIALIZED_P (newdecl
) |= DECL_INITIALIZED_P (olddecl
);
3469 /* Do this after calling `merge_types' so that default
3470 parameters don't confuse us. */
3471 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3472 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3473 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3475 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3476 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3477 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3478 TYPE_RAISES_EXCEPTIONS (oldtype
));
3480 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3481 && DECL_SOURCE_LINE (olddecl
) != 0
3483 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
3484 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
3486 error ("declaration of `%F' throws different exceptions",
3488 cp_error_at ("than previous declaration `%F'", olddecl
);
3491 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3493 /* Lay the type out, unless already done. */
3494 if (! same_type_p (newtype
, oldtype
)
3495 && TREE_TYPE (newdecl
) != error_mark_node
3496 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3497 layout_type (TREE_TYPE (newdecl
));
3499 if ((TREE_CODE (newdecl
) == VAR_DECL
3500 || TREE_CODE (newdecl
) == PARM_DECL
3501 || TREE_CODE (newdecl
) == RESULT_DECL
3502 || TREE_CODE (newdecl
) == FIELD_DECL
3503 || TREE_CODE (newdecl
) == TYPE_DECL
)
3504 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3505 layout_decl (newdecl
, 0);
3507 /* Merge the type qualifiers. */
3508 if (TREE_READONLY (newdecl
))
3509 TREE_READONLY (olddecl
) = 1;
3510 if (TREE_THIS_VOLATILE (newdecl
))
3511 TREE_THIS_VOLATILE (olddecl
) = 1;
3513 /* Merge the initialization information. */
3514 if (DECL_INITIAL (newdecl
) == NULL_TREE
3515 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3517 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3518 DECL_SOURCE_LOCATION (newdecl
) = DECL_SOURCE_LOCATION (olddecl
);
3519 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
3520 && DECL_LANG_SPECIFIC (newdecl
)
3521 && DECL_LANG_SPECIFIC (olddecl
))
3522 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3525 /* Merge the section attribute.
3526 We want to issue an error if the sections conflict but that must be
3527 done later in decl_attributes since we are called before attributes
3529 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3530 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3532 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3534 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (newdecl
)
3535 |= DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (olddecl
);
3536 DECL_NO_LIMIT_STACK (newdecl
)
3537 |= DECL_NO_LIMIT_STACK (olddecl
);
3538 /* Keep the old RTL. */
3539 COPY_DECL_RTL (olddecl
, newdecl
);
3541 else if (TREE_CODE (newdecl
) == VAR_DECL
3542 && (DECL_SIZE (olddecl
) || !DECL_SIZE (newdecl
)))
3544 /* Keep the old RTL. We cannot keep the old RTL if the old
3545 declaration was for an incomplete object and the new
3546 declaration is not since many attributes of the RTL will
3548 COPY_DECL_RTL (olddecl
, newdecl
);
3551 /* If cannot merge, then use the new type and qualifiers,
3552 and don't preserve the old rtl. */
3555 /* Clean out any memory we had of the old declaration. */
3556 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3558 TREE_VALUE (oldstatic
) = error_mark_node
;
3560 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3561 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3562 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3563 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3566 /* Merge the storage class information. */
3567 merge_weak (newdecl
, olddecl
);
3569 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3570 DECL_DEFER_OUTPUT (newdecl
) |= DECL_DEFER_OUTPUT (olddecl
);
3571 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3572 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3573 if (! DECL_EXTERNAL (olddecl
))
3574 DECL_EXTERNAL (newdecl
) = 0;
3576 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3578 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3579 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3580 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3581 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3582 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3583 /* Don't really know how much of the language-specific
3584 values we should copy from old to new. */
3585 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3586 DECL_LANG_SPECIFIC (newdecl
)->decl_flags
.u2
=
3587 DECL_LANG_SPECIFIC (olddecl
)->decl_flags
.u2
;
3588 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3589 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3590 DECL_INITIALIZED_IN_CLASS_P (newdecl
)
3591 |= DECL_INITIALIZED_IN_CLASS_P (olddecl
);
3592 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3594 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3595 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3596 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3597 DECL_BEFRIENDING_CLASSES (newdecl
)
3598 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3599 DECL_BEFRIENDING_CLASSES (olddecl
));
3602 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3604 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3605 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3607 /* If newdecl is not a specialization, then it is not a
3608 template-related function at all. And that means that we
3609 shoud have exited above, returning 0. */
3610 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3613 if (TREE_USED (olddecl
))
3614 /* From [temp.expl.spec]:
3616 If a template, a member template or the member of a class
3617 template is explicitly specialized then that
3618 specialization shall be declared before the first use of
3619 that specialization that would cause an implicit
3620 instantiation to take place, in every translation unit in
3621 which such a use occurs. */
3622 error ("explicit specialization of %D after first use",
3625 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3627 /* [temp.expl.spec/14] We don't inline explicit specialization
3628 just because the primary template says so. */
3632 if (DECL_PENDING_INLINE_INFO (newdecl
) == 0)
3633 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3635 DECL_DECLARED_INLINE_P (newdecl
) |= DECL_DECLARED_INLINE_P (olddecl
);
3637 /* If either decl says `inline', this fn is inline, unless
3638 its definition was passed already. */
3639 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3640 DECL_INLINE (olddecl
) = 1;
3641 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3643 DECL_UNINLINABLE (newdecl
) = DECL_UNINLINABLE (olddecl
)
3644 = (DECL_UNINLINABLE (newdecl
) || DECL_UNINLINABLE (olddecl
));
3647 /* Preserve abstractness on cloned [cd]tors. */
3648 DECL_ABSTRACT (newdecl
) = DECL_ABSTRACT (olddecl
);
3652 SET_DECL_LANGUAGE (olddecl
, DECL_LANGUAGE (newdecl
));
3653 COPY_DECL_ASSEMBLER_NAME (newdecl
, olddecl
);
3654 SET_DECL_RTL (olddecl
, DECL_RTL (newdecl
));
3656 if (! types_match
|| new_defines_function
)
3658 /* These need to be copied so that the names are available.
3659 Note that if the types do match, we'll preserve inline
3660 info and other bits, but if not, we won't. */
3661 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3662 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3664 if (new_defines_function
)
3665 /* If defining a function declared with other language
3666 linkage, use the previously declared language linkage. */
3667 SET_DECL_LANGUAGE (newdecl
, DECL_LANGUAGE (olddecl
));
3668 else if (types_match
)
3670 /* If redeclaring a builtin function, and not a definition,
3671 it stays built in. */
3672 if (DECL_BUILT_IN (olddecl
))
3674 DECL_BUILT_IN_CLASS (newdecl
) = DECL_BUILT_IN_CLASS (olddecl
);
3675 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3676 /* If we're keeping the built-in definition, keep the rtl,
3677 regardless of declaration matches. */
3678 SET_DECL_RTL (newdecl
, DECL_RTL (olddecl
));
3681 DECL_NUM_STMTS (newdecl
) = DECL_NUM_STMTS (olddecl
);
3683 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3684 /* Don't clear out the arguments if we're redefining a function. */
3685 if (DECL_ARGUMENTS (olddecl
))
3686 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3689 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3690 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3692 /* Now preserve various other info from the definition. */
3693 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3694 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3695 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3696 COPY_DECL_ASSEMBLER_NAME (olddecl
, newdecl
);
3698 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3702 function_size
= sizeof (struct tree_decl
);
3704 memcpy ((char *) olddecl
+ sizeof (struct tree_common
),
3705 (char *) newdecl
+ sizeof (struct tree_common
),
3706 function_size
- sizeof (struct tree_common
));
3708 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3710 /* If newdecl is a template instantiation, it is possible that
3711 the following sequence of events has occurred:
3713 o A friend function was declared in a class template. The
3714 class template was instantiated.
3716 o The instantiation of the friend declaration was
3717 recorded on the instantiation list, and is newdecl.
3719 o Later, however, instantiate_class_template called pushdecl
3720 on the newdecl to perform name injection. But, pushdecl in
3721 turn called duplicate_decls when it discovered that another
3722 declaration of a global function with the same name already
3725 o Here, in duplicate_decls, we decided to clobber newdecl.
3727 If we're going to do that, we'd better make sure that
3728 olddecl, and not newdecl, is on the list of
3729 instantiations so that if we try to do the instantiation
3730 again we won't get the clobbered declaration. */
3732 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3733 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3735 for (; decls
; decls
= TREE_CHAIN (decls
))
3736 if (TREE_VALUE (decls
) == newdecl
)
3737 TREE_VALUE (decls
) = olddecl
;
3742 memcpy ((char *) olddecl
+ sizeof (struct tree_common
),
3743 (char *) newdecl
+ sizeof (struct tree_common
),
3744 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3745 + TREE_CODE_LENGTH (TREE_CODE (newdecl
)) * sizeof (char *));
3748 DECL_UID (olddecl
) = olddecl_uid
;
3750 DECL_FRIEND_P (olddecl
) = 1;
3752 /* NEWDECL contains the merged attribute lists.
3753 Update OLDDECL to be the same. */
3754 DECL_ATTRIBUTES (olddecl
) = DECL_ATTRIBUTES (newdecl
);
3759 /* Record a decl-node X as belonging to the current lexical scope.
3760 Check for errors (such as an incompatible declaration for the same
3761 name already seen in the same scope).
3763 Returns either X or an old decl for the same name.
3764 If an old decl is returned, it may have been smashed
3765 to agree with what X says. */
3773 int need_new_binding
;
3775 /* We shouldn't be calling pushdecl when we're generating RTL for a
3776 function that we already did semantic analysis on previously. */
3777 my_friendly_assert (!cfun
|| doing_semantic_analysis_p (),
3780 need_new_binding
= 1;
3782 if (DECL_TEMPLATE_PARM_P (x
))
3783 /* Template parameters have no context; they are not X::T even
3784 when declared within a class or namespace. */
3788 if (current_function_decl
&& x
!= current_function_decl
3789 /* A local declaration for a function doesn't constitute
3791 && !(TREE_CODE (x
) == FUNCTION_DECL
&& !DECL_INITIAL (x
))
3792 /* A local declaration for an `extern' variable is in the
3793 scope of the current namespace, not the current
3795 && !(TREE_CODE (x
) == VAR_DECL
&& DECL_EXTERNAL (x
))
3796 && !DECL_CONTEXT (x
))
3797 DECL_CONTEXT (x
) = current_function_decl
;
3799 /* If this is the declaration for a namespace-scope function,
3800 but the declaration itself is in a local scope, mark the
3802 if (TREE_CODE (x
) == FUNCTION_DECL
3803 && DECL_NAMESPACE_SCOPE_P (x
)
3804 && current_function_decl
3805 && x
!= current_function_decl
)
3806 DECL_LOCAL_FUNCTION_P (x
) = 1;
3809 name
= DECL_NAME (x
);
3812 int different_binding_level
= 0;
3814 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3815 name
= TREE_OPERAND (name
, 0);
3817 /* In case this decl was explicitly namespace-qualified, look it
3818 up in its namespace context. */
3819 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
)
3820 && namespace_bindings_p ())
3821 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3823 t
= lookup_name_current_level (name
);
3825 /* [basic.link] If there is a visible declaration of an entity
3826 with linkage having the same name and type, ignoring entities
3827 declared outside the innermost enclosing namespace scope, the
3828 block scope declaration declares that same entity and
3829 receives the linkage of the previous declaration. */
3830 if (! t
&& current_function_decl
&& x
!= current_function_decl
3831 && (TREE_CODE (x
) == FUNCTION_DECL
|| TREE_CODE (x
) == VAR_DECL
)
3832 && DECL_EXTERNAL (x
))
3834 /* Look in block scope. */
3835 t
= IDENTIFIER_VALUE (name
);
3836 /* Or in the innermost namespace. */
3838 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3839 /* Does it have linkage? Note that if this isn't a DECL, it's an
3840 OVERLOAD, which is OK. */
3841 if (t
&& DECL_P (t
) && ! (TREE_STATIC (t
) || DECL_EXTERNAL (t
)))
3844 different_binding_level
= 1;
3847 /* If we are declaring a function, and the result of name-lookup
3848 was an OVERLOAD, look for an overloaded instance that is
3849 actually the same as the function we are declaring. (If
3850 there is one, we have to merge our declaration with the
3851 previous declaration.) */
3852 if (t
&& TREE_CODE (t
) == OVERLOAD
)
3856 if (TREE_CODE (x
) == FUNCTION_DECL
)
3857 for (match
= t
; match
; match
= OVL_NEXT (match
))
3859 if (decls_match (OVL_CURRENT (match
), x
))
3863 /* Just choose one. */
3867 t
= OVL_CURRENT (match
);
3872 if (t
== error_mark_node
)
3874 /* error_mark_node is 0 for a while during initialization! */
3876 cp_error_at ("`%#D' used prior to declaration", x
);
3878 else if (t
!= NULL_TREE
)
3880 if (different_binding_level
)
3882 if (decls_match (x
, t
))
3883 /* The standard only says that the local extern
3884 inherits linkage from the previous decl; in
3885 particular, default args are not shared. It would
3886 be nice to propagate inlining info, though. FIXME. */
3887 TREE_PUBLIC (x
) = TREE_PUBLIC (t
);
3889 else if (TREE_CODE (t
) == PARM_DECL
)
3891 if (DECL_CONTEXT (t
) == NULL_TREE
)
3892 /* This is probaby caused by too many errors, but calling
3893 abort will say that if errors have occurred. */
3896 /* Check for duplicate params. */
3897 if (duplicate_decls (x
, t
))
3900 else if ((DECL_EXTERN_C_FUNCTION_P (x
)
3901 || DECL_FUNCTION_TEMPLATE_P (x
))
3902 && is_overloaded_fn (t
))
3903 /* Don't do anything just yet. */;
3904 else if (t
== wchar_decl_node
)
3906 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3907 pedwarn ("redeclaration of `wchar_t' as `%T'",
3910 /* Throw away the redeclaration. */
3913 else if (TREE_CODE (t
) != TREE_CODE (x
))
3915 if (duplicate_decls (x
, t
))
3918 else if (duplicate_decls (x
, t
))
3920 if (TREE_CODE (t
) == TYPE_DECL
)
3921 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3922 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3923 check_default_args (t
);
3927 else if (DECL_MAIN_P (x
))
3929 /* A redeclaration of main, but not a duplicate of the
3934 This function shall not be overloaded. */
3935 cp_error_at ("invalid redeclaration of `%D'", t
);
3936 error ("as `%D'", x
);
3937 /* We don't try to push this declaration since that
3943 check_template_shadow (x
);
3945 /* If this is a function conjured up by the backend, massage it
3946 so it looks friendly. */
3947 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_LANG_SPECIFIC (x
))
3949 retrofit_lang_decl (x
);
3950 SET_DECL_LANGUAGE (x
, lang_c
);
3953 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_FUNCTION_MEMBER_P (x
))
3955 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
3958 if (!namespace_bindings_p ())
3959 /* We do not need to create a binding for this name;
3960 push_overloaded_decl will have already done so if
3962 need_new_binding
= 0;
3964 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3966 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
3968 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
3972 /* If declaring a type as a typedef, copy the type (unless we're
3973 at line 0), and install this TYPE_DECL as the new type's typedef
3974 name. See the extensive comment in ../c-decl.c (pushdecl). */
3975 if (TREE_CODE (x
) == TYPE_DECL
)
3977 tree type
= TREE_TYPE (x
);
3978 if (DECL_SOURCE_LINE (x
) == 0)
3980 if (TYPE_NAME (type
) == 0)
3981 TYPE_NAME (type
) = x
;
3983 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
3984 /* We don't want to copy the type when all we're
3985 doing is making a TYPE_DECL for the purposes of
3987 && (!TYPE_NAME (type
)
3988 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
3990 DECL_ORIGINAL_TYPE (x
) = type
;
3991 type
= build_type_copy (type
);
3992 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
3993 TYPE_NAME (type
) = x
;
3994 TREE_TYPE (x
) = type
;
3997 if (type
!= error_mark_node
3999 && TYPE_IDENTIFIER (type
))
4000 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
4001 current_binding_level
);
4005 /* Multiple external decls of the same identifier ought to match.
4007 We get warnings about inline functions where they are defined.
4008 We get warnings about other functions from push_overloaded_decl.
4010 Avoid duplicate warnings where they are used. */
4011 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
4015 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
4016 if (decl
&& TREE_CODE (decl
) == OVERLOAD
)
4017 decl
= OVL_FUNCTION (decl
);
4019 if (decl
&& decl
!= error_mark_node
4020 && (DECL_EXTERNAL (decl
) || TREE_PUBLIC (decl
))
4021 /* If different sort of thing, we already gave an error. */
4022 && TREE_CODE (decl
) == TREE_CODE (x
)
4023 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
4025 pedwarn ("type mismatch with previous external decl", x
);
4026 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
4030 /* This name is new in its binding level.
4031 Install the new declaration and return it. */
4032 if (namespace_bindings_p ())
4034 /* Install a global value. */
4036 /* If the first global decl has external linkage,
4037 warn if we later see static one. */
4038 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
4039 TREE_PUBLIC (name
) = 1;
4041 /* Bind the name for the entity. */
4042 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
4044 && (TREE_CODE (x
) == TYPE_DECL
4045 || TREE_CODE (x
) == VAR_DECL
4046 || TREE_CODE (x
) == NAMESPACE_DECL
4047 || TREE_CODE (x
) == CONST_DECL
4048 || TREE_CODE (x
) == TEMPLATE_DECL
))
4049 SET_IDENTIFIER_NAMESPACE_VALUE (name
, x
);
4051 /* Don't forget if the function was used via an implicit decl. */
4052 if (IDENTIFIER_IMPLICIT_DECL (name
)
4053 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
4056 /* Don't forget if its address was taken in that way. */
4057 if (IDENTIFIER_IMPLICIT_DECL (name
)
4058 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
4059 TREE_ADDRESSABLE (x
) = 1;
4061 /* Warn about mismatches against previous implicit decl. */
4062 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
4063 /* If this real decl matches the implicit, don't complain. */
4064 && ! (TREE_CODE (x
) == FUNCTION_DECL
4065 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
4067 ("`%D' was previously implicitly declared to return `int'", x
);
4069 /* If new decl is `static' and an `extern' was seen previously,
4071 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
4072 warn_extern_redeclared_static (x
, t
);
4076 /* Here to install a non-global value. */
4077 tree oldlocal
= IDENTIFIER_VALUE (name
);
4078 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
4080 if (need_new_binding
)
4082 push_local_binding (name
, x
, 0);
4083 /* Because push_local_binding will hook X on to the
4084 current_binding_level's name list, we don't want to
4085 do that again below. */
4086 need_new_binding
= 0;
4089 /* If this is a TYPE_DECL, push it into the type value slot. */
4090 if (TREE_CODE (x
) == TYPE_DECL
)
4091 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
4092 current_binding_level
);
4094 /* Clear out any TYPE_DECL shadowed by a namespace so that
4095 we won't think this is a type. The C struct hack doesn't
4096 go through namespaces. */
4097 if (TREE_CODE (x
) == NAMESPACE_DECL
)
4098 set_identifier_type_value_with_scope (name
, NULL_TREE
,
4099 current_binding_level
);
4106 && TREE_CODE (oldlocal
) == VAR_DECL
4107 && DECL_DEAD_FOR_LOCAL (oldlocal
))
4108 oldlocal
= DECL_SHADOWED_FOR_VAR (oldlocal
);
4110 if (oldlocal
== NULL_TREE
)
4111 oldlocal
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (d
));
4114 /* If this is an extern function declaration, see if we
4115 have a global definition or declaration for the function. */
4116 if (oldlocal
== NULL_TREE
4117 && DECL_EXTERNAL (x
)
4118 && oldglobal
!= NULL_TREE
4119 && TREE_CODE (x
) == FUNCTION_DECL
4120 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
4122 /* We have one. Their types must agree. */
4123 if (decls_match (x
, oldglobal
))
4127 warning ("extern declaration of `%#D' doesn't match", x
);
4128 cp_warning_at ("global declaration `%#D'", oldglobal
);
4131 /* If we have a local external declaration,
4132 and no file-scope declaration has yet been seen,
4133 then if we later have a file-scope decl it must not be static. */
4134 if (oldlocal
== NULL_TREE
4135 && oldglobal
== NULL_TREE
4136 && DECL_EXTERNAL (x
)
4138 TREE_PUBLIC (name
) = 1;
4140 /* Warn if shadowing an argument at the top level of the body. */
4141 if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
4142 /* Inline decls shadow nothing. */
4143 && !DECL_FROM_INLINE (x
)
4144 && TREE_CODE (oldlocal
) == PARM_DECL
)
4148 /* Don't complain if it's from an enclosing function. */
4149 if (DECL_CONTEXT (oldlocal
) == current_function_decl
4150 && TREE_CODE (x
) != PARM_DECL
)
4152 /* Go to where the parms should be and see if we find
4154 struct cp_binding_level
*b
= current_binding_level
->level_chain
;
4157 if (b
->parm_flag
== 1)
4159 error ("declaration of `%#D' shadows a parameter",
4165 if (warn_shadow
&& !err
)
4166 shadow_warning ("a parameter", name
, oldlocal
);
4169 /* Maybe warn if shadowing something else. */
4170 else if (warn_shadow
&& !DECL_EXTERNAL (x
)
4171 /* No shadow warnings for internally generated vars. */
4172 && ! DECL_ARTIFICIAL (x
)
4173 /* No shadow warnings for vars made for inlining. */
4174 && ! DECL_FROM_INLINE (x
))
4176 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 && TREE_CODE (oldlocal
) == VAR_DECL
)
4183 shadow_warning ("a previous local", name
, oldlocal
);
4184 else if (oldglobal
!= NULL_TREE
4185 && TREE_CODE (oldglobal
) == VAR_DECL
)
4186 /* XXX shadow warnings in outer-more namespaces */
4187 shadow_warning ("a global declaration", name
, oldglobal
);
4191 if (TREE_CODE (x
) == FUNCTION_DECL
)
4192 check_default_args (x
);
4194 if (TREE_CODE (x
) == VAR_DECL
)
4195 maybe_register_incomplete_var (x
);
4198 if (need_new_binding
)
4199 add_decl_to_level (x
,
4200 DECL_NAMESPACE_SCOPE_P (x
)
4201 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x
))
4202 : current_binding_level
);
4207 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4208 caller to set DECL_CONTEXT properly. */
4211 pushdecl_with_scope (x
, level
)
4213 struct cp_binding_level
*level
;
4215 register struct cp_binding_level
*b
;
4216 tree function_decl
= current_function_decl
;
4218 current_function_decl
= NULL_TREE
;
4219 if (level
->parm_flag
== 2)
4221 b
= class_binding_level
;
4222 class_binding_level
= level
;
4223 pushdecl_class_level (x
);
4224 class_binding_level
= b
;
4228 b
= current_binding_level
;
4229 current_binding_level
= level
;
4231 current_binding_level
= b
;
4233 current_function_decl
= function_decl
;
4237 /* Like pushdecl, only it places X in the current namespace,
4241 pushdecl_namespace_level (x
)
4244 register struct cp_binding_level
*b
= current_binding_level
;
4247 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4249 /* Now, the type_shadowed stack may screw us. Munge it so it does
4251 if (TREE_CODE (x
) == TYPE_DECL
)
4253 tree name
= DECL_NAME (x
);
4255 tree
*ptr
= (tree
*)0;
4256 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4258 tree shadowed
= b
->type_shadowed
;
4259 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4260 if (TREE_PURPOSE (shadowed
) == name
)
4262 ptr
= &TREE_VALUE (shadowed
);
4263 /* Can't break out of the loop here because sometimes
4264 a binding level will have duplicate bindings for
4265 PT names. It's gross, but I haven't time to fix it. */
4268 newval
= TREE_TYPE (x
);
4269 if (ptr
== (tree
*)0)
4271 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4272 up here if this is changed to an assertion. --KR */
4273 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4283 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4287 pushdecl_top_level (x
)
4290 push_to_top_level ();
4291 x
= pushdecl_namespace_level (x
);
4292 pop_from_top_level ();
4296 /* Make the declaration of X appear in CLASS scope. */
4299 pushdecl_class_level (x
)
4304 /* Get the name of X. */
4305 if (TREE_CODE (x
) == OVERLOAD
)
4306 name
= DECL_NAME (get_first_fn (x
));
4308 name
= DECL_NAME (x
);
4312 push_class_level_binding (name
, x
);
4313 if (TREE_CODE (x
) == TYPE_DECL
)
4314 set_identifier_type_value (name
, TREE_TYPE (x
));
4316 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4318 /* If X is an anonymous aggregate, all of its members are
4319 treated as if they were members of the class containing the
4320 aggregate, for naming purposes. */
4323 for (f
= TYPE_FIELDS (TREE_TYPE (x
)); f
; f
= TREE_CHAIN (f
))
4324 pushdecl_class_level (f
);
4328 /* Enter DECL into the symbol table, if that's appropriate. Returns
4329 DECL, or a modified version thereof. */
4332 maybe_push_decl (decl
)
4335 tree type
= TREE_TYPE (decl
);
4337 /* Add this decl to the current binding level, but not if it comes
4338 from another scope, e.g. a static member variable. TEM may equal
4339 DECL or it may be a previous decl of the same name. */
4340 if (decl
== error_mark_node
4341 || (TREE_CODE (decl
) != PARM_DECL
4342 && DECL_CONTEXT (decl
) != NULL_TREE
4343 /* Definitions of namespace members outside their namespace are
4345 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4346 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4347 || TREE_CODE (type
) == UNKNOWN_TYPE
4348 /* The declaration of a template specialization does not affect
4349 the functions available for overload resolution, so we do not
4351 || (TREE_CODE (decl
) == FUNCTION_DECL
4352 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4355 return pushdecl (decl
);
4358 /* Make the declaration(s) of X appear in CLASS scope
4359 under the name NAME. */
4362 push_class_level_binding (name
, x
)
4367 /* The class_binding_level will be NULL if x is a template
4368 parameter name in a member template. */
4369 if (!class_binding_level
)
4372 /* Make sure that this new member does not have the same name
4373 as a template parameter. */
4374 if (TYPE_BEING_DEFINED (current_class_type
))
4375 check_template_shadow (x
);
4377 /* If this declaration shadows a declaration from an enclosing
4378 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4379 we leave this class. Record the shadowed declaration here. */
4380 binding
= IDENTIFIER_BINDING (name
);
4382 && ((TREE_CODE (x
) == OVERLOAD
4383 && BINDING_VALUE (binding
)
4384 && is_overloaded_fn (BINDING_VALUE (binding
)))
4385 || INHERITED_VALUE_BINDING_P (binding
)))
4390 /* If the old binding was from a base class, and was for a tag
4391 name, slide it over to make room for the new binding. The
4392 old binding is still visible if explicitly qualified with a
4394 if (INHERITED_VALUE_BINDING_P (binding
)
4395 && BINDING_VALUE (binding
)
4396 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4397 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4398 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4400 old_decl
= BINDING_TYPE (binding
);
4401 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4402 BINDING_VALUE (binding
) = NULL_TREE
;
4403 INHERITED_VALUE_BINDING_P (binding
) = 0;
4406 old_decl
= BINDING_VALUE (binding
);
4408 /* Find the previous binding of name on the class-shadowed
4409 list, and update it. */
4410 for (shadow
= class_binding_level
->class_shadowed
;
4412 shadow
= TREE_CHAIN (shadow
))
4413 if (TREE_PURPOSE (shadow
) == name
4414 && TREE_TYPE (shadow
) == old_decl
)
4416 BINDING_VALUE (binding
) = x
;
4417 INHERITED_VALUE_BINDING_P (binding
) = 0;
4418 TREE_TYPE (shadow
) = x
;
4419 IDENTIFIER_CLASS_VALUE (name
) = x
;
4424 /* If we didn't replace an existing binding, put the binding on the
4425 stack of bindings for the identifier, and update the shadowed list. */
4426 if (push_class_binding (name
, x
))
4428 class_binding_level
->class_shadowed
4429 = tree_cons (name
, NULL
,
4430 class_binding_level
->class_shadowed
);
4431 /* Record the value we are binding NAME to so that we can know
4432 what to pop later. */
4433 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4437 /* Insert another USING_DECL into the current binding level, returning
4438 this declaration. If this is a redeclaration, do nothing, and
4439 return NULL_TREE if this not in namespace scope (in namespace
4440 scope, a using decl might extend any previous bindings). */
4443 push_using_decl (scope
, name
)
4449 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4450 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4451 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4452 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4455 return namespace_bindings_p () ? decl
: NULL_TREE
;
4456 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4457 DECL_INITIAL (decl
) = scope
;
4458 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4459 current_binding_level
->usings
= decl
;
4463 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4464 changed (i.e. there was already a directive), or the fresh
4465 TREE_LIST otherwise. */
4468 push_using_directive (used
)
4471 tree ud
= current_binding_level
->using_directives
;
4472 tree iter
, ancestor
;
4474 /* Check if we already have this. */
4475 if (purpose_member (used
, ud
) != NULL_TREE
)
4478 /* Recursively add all namespaces used. */
4479 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4480 push_using_directive (TREE_PURPOSE (iter
));
4482 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4483 ud
= current_binding_level
->using_directives
;
4484 ud
= tree_cons (used
, ancestor
, ud
);
4485 current_binding_level
->using_directives
= ud
;
4489 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4490 other definitions already in place. We get around this by making
4491 the value of the identifier point to a list of all the things that
4492 want to be referenced by that name. It is then up to the users of
4493 that name to decide what to do with that list.
4495 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its
4496 DECL_TEMPLATE_RESULT. It is dealt with the same way.
4498 FLAGS is a bitwise-or of the following values:
4499 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4501 PUSH_USING: DECL is being pushed as the result of a using
4504 The value returned may be a previous declaration if we guessed wrong
4505 about what language DECL should belong to (C or C++). Otherwise,
4506 it's always DECL (and never something that's not a _DECL). */
4509 push_overloaded_decl (decl
, flags
)
4513 tree name
= DECL_NAME (decl
);
4516 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4519 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4521 old
= lookup_name_current_level (name
);
4525 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4527 tree t
= TREE_TYPE (old
);
4528 if (IS_AGGR_TYPE (t
) && warn_shadow
4529 && (! DECL_IN_SYSTEM_HEADER (decl
)
4530 || ! DECL_IN_SYSTEM_HEADER (old
)))
4531 warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4534 else if (is_overloaded_fn (old
))
4538 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4540 tree fn
= OVL_CURRENT (tmp
);
4542 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4543 && !(flags
& PUSH_USING
)
4544 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4545 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4546 error ("`%#D' conflicts with previous using declaration `%#D'",
4549 if (duplicate_decls (decl
, fn
))
4553 else if (old
== error_mark_node
)
4554 /* Ignore the undefined symbol marker. */
4558 cp_error_at ("previous non-function declaration `%#D'", old
);
4559 error ("conflicts with function declaration `%#D'", decl
);
4564 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4566 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4567 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4569 new_binding
= ovl_cons (decl
, old
);
4570 if (flags
& PUSH_USING
)
4571 OVL_USED (new_binding
) = 1;
4574 /* NAME is not ambiguous. */
4578 set_namespace_binding (name
, current_namespace
, new_binding
);
4581 /* We only create an OVERLOAD if there was a previous binding at
4582 this level, or if decl is a template. In the former case, we
4583 need to remove the old binding and replace it with the new
4584 binding. We must also run through the NAMES on the binding
4585 level where the name was bound to update the chain. */
4587 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4591 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4593 d
= &TREE_CHAIN (*d
))
4595 || (TREE_CODE (*d
) == TREE_LIST
4596 && TREE_VALUE (*d
) == old
))
4598 if (TREE_CODE (*d
) == TREE_LIST
)
4599 /* Just replace the old binding with the new. */
4600 TREE_VALUE (*d
) = new_binding
;
4602 /* Build a TREE_LIST to wrap the OVERLOAD. */
4603 *d
= tree_cons (NULL_TREE
, new_binding
,
4606 /* And update the CPLUS_BINDING node. */
4607 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4612 /* We should always find a previous binding in this case. */
4616 /* Install the new binding. */
4617 push_local_binding (name
, new_binding
, flags
);
4623 /* Generate an implicit declaration for identifier FUNCTIONID
4624 as a function of type int (). Print a warning if appropriate. */
4627 implicitly_declare (functionid
)
4632 /* We used to reuse an old implicit decl here,
4633 but this loses with inline functions because it can clobber
4634 the saved decl chains. */
4635 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4637 DECL_EXTERNAL (decl
) = 1;
4638 TREE_PUBLIC (decl
) = 1;
4640 /* ISO standard says implicit declarations are in the innermost block.
4641 So we record the decl in the standard fashion. */
4643 rest_of_decl_compilation (decl
, NULL
, 0, 0);
4646 /* Only one warning per identifier. */
4647 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4649 pedwarn ("implicit declaration of function `%#D'", decl
);
4652 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4657 /* Return zero if the declaration NEWDECL is valid
4658 when the declaration OLDDECL (assumed to be for the same name)
4659 has already been seen.
4660 Otherwise return an error message format string with a %s
4661 where the identifier should go. */
4664 redeclaration_error_message (newdecl
, olddecl
)
4665 tree newdecl
, olddecl
;
4667 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4669 /* Because C++ can put things into name space for free,
4670 constructs like "typedef struct foo { ... } foo"
4671 would look like an erroneous redeclaration. */
4672 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4675 return "redefinition of `%#D'";
4677 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4679 /* If this is a pure function, its olddecl will actually be
4680 the original initialization to `0' (which we force to call
4681 abort()). Don't complain about redefinition in this case. */
4682 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_PURE_VIRTUAL_P (olddecl
))
4685 /* If both functions come from different namespaces, this is not
4686 a redeclaration - this is a conflict with a used function. */
4687 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4688 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4689 return "`%D' conflicts with used function";
4691 /* We'll complain about linkage mismatches in
4692 warn_extern_redeclared_static. */
4694 /* Defining the same name twice is no good. */
4695 if (DECL_INITIAL (olddecl
) != NULL_TREE
4696 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4698 if (DECL_NAME (olddecl
) == NULL_TREE
)
4699 return "`%#D' not declared in class";
4701 return "redefinition of `%#D'";
4705 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4707 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4708 && (DECL_TEMPLATE_RESULT (newdecl
)
4709 != DECL_TEMPLATE_RESULT (olddecl
))
4710 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4711 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4712 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4713 && COMPLETE_TYPE_P (TREE_TYPE (newdecl
))
4714 && COMPLETE_TYPE_P (TREE_TYPE (olddecl
))))
4715 return "redefinition of `%#D'";
4718 else if (toplevel_bindings_p () || DECL_NAMESPACE_SCOPE_P (newdecl
))
4720 /* Objects declared at top level: */
4721 /* If at least one is a reference, it's ok. */
4722 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4724 /* Reject two definitions. */
4725 return "redefinition of `%#D'";
4729 /* Objects declared with block scope: */
4730 /* Reject two definitions, and reject a definition
4731 together with an external reference. */
4732 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4733 return "redeclaration of `%#D'";
4738 /* Create a new label, named ID. */
4741 make_label_decl (id
, local_p
)
4747 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4749 /* Make sure every label has an rtx. */
4752 DECL_CONTEXT (decl
) = current_function_decl
;
4753 DECL_MODE (decl
) = VOIDmode
;
4754 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
4756 /* Say where one reference is to the label, for the sake of the
4757 error if it is not defined. */
4758 DECL_SOURCE_LINE (decl
) = lineno
;
4759 DECL_SOURCE_FILE (decl
) = input_filename
;
4761 /* Record the fact that this identifier is bound to this label. */
4762 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4767 /* Record this label on the list of used labels so that we can check
4768 at the end of the function to see whether or not the label was
4769 actually defined, and so we can check when the label is defined whether
4770 this use is valid. */
4776 if (named_label_uses
== NULL
4777 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4778 || named_label_uses
->label_decl
!= decl
)
4780 struct named_label_use_list
*new_ent
;
4781 new_ent
= ((struct named_label_use_list
*)
4782 ggc_alloc (sizeof (struct named_label_use_list
)));
4783 new_ent
->label_decl
= decl
;
4784 new_ent
->names_in_scope
= current_binding_level
->names
;
4785 new_ent
->binding_level
= current_binding_level
;
4786 new_ent
->lineno_o_goto
= lineno
;
4787 new_ent
->filename_o_goto
= input_filename
;
4788 new_ent
->next
= named_label_uses
;
4789 named_label_uses
= new_ent
;
4793 /* Look for a label named ID in the current function. If one cannot
4794 be found, create one. (We keep track of used, but undefined,
4795 labels, and complain about them at the end of a function.) */
4802 struct named_label_list
*ent
;
4804 /* You can't use labels at global scope. */
4805 if (current_function_decl
== NULL_TREE
)
4807 error ("label `%s' referenced outside of any function",
4808 IDENTIFIER_POINTER (id
));
4812 /* See if we've already got this label. */
4813 decl
= IDENTIFIER_LABEL_VALUE (id
);
4814 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
4817 /* Record this label on the list of labels used in this function.
4818 We do this before calling make_label_decl so that we get the
4819 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4820 ent
= ((struct named_label_list
*)
4821 ggc_alloc_cleared (sizeof (struct named_label_list
)));
4822 ent
->old_value
= IDENTIFIER_LABEL_VALUE (id
);
4823 ent
->next
= named_labels
;
4826 /* We need a new label. */
4827 decl
= make_label_decl (id
, /*local_p=*/0);
4829 /* Now fill in the information we didn't have before. */
4830 ent
->label_decl
= decl
;
4835 /* Declare a local label named ID. */
4838 declare_local_label (id
)
4843 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4844 this scope we can restore the old value of
4845 IDENTIFIER_TYPE_VALUE. */
4846 current_binding_level
->shadowed_labels
4847 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4848 current_binding_level
->shadowed_labels
);
4849 /* Look for the label. */
4850 decl
= make_label_decl (id
, /*local_p=*/1);
4851 /* Now fill in the information we didn't have before. */
4852 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
4857 /* Returns nonzero if it is ill-formed to jump past the declaration of
4858 DECL. Returns 2 if it's also a real problem. */
4861 decl_jump_unsafe (decl
)
4864 if (TREE_CODE (decl
) != VAR_DECL
|| TREE_STATIC (decl
))
4867 if (DECL_INITIAL (decl
) == NULL_TREE
4868 && pod_type_p (TREE_TYPE (decl
)))
4871 /* This is really only important if we're crossing an initialization.
4872 The POD stuff is just pedantry; why should it matter if the class
4873 contains a field of pointer to member type? */
4874 if (DECL_INITIAL (decl
)
4875 || (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))))
4880 /* Check that a single previously seen jump to a newly defined label
4881 is OK. DECL is the LABEL_DECL or 0; LEVEL is the binding_level for
4882 the jump context; NAMES are the names in scope in LEVEL at the jump
4883 context; FILE and LINE are the source position of the jump or 0. */
4886 check_previous_goto_1 (decl
, level
, names
, file
, line
)
4888 struct cp_binding_level
*level
;
4895 struct cp_binding_level
*b
= current_binding_level
;
4896 for (; b
; b
= b
->level_chain
)
4898 tree new_decls
= b
->names
;
4899 tree old_decls
= (b
== level
? names
: NULL_TREE
);
4900 for (; new_decls
!= old_decls
;
4901 new_decls
= TREE_CHAIN (new_decls
))
4903 int problem
= decl_jump_unsafe (new_decls
);
4910 pedwarn ("jump to label `%D'", decl
);
4912 pedwarn ("jump to case label");
4915 pedwarn_with_file_and_line (file
, line
, " from here");
4920 cp_error_at (" crosses initialization of `%#D'",
4923 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4929 if ((b
->is_try_scope
|| b
->is_catch_scope
) && ! saw_eh
)
4934 pedwarn ("jump to label `%D'", decl
);
4936 pedwarn ("jump to case label");
4939 pedwarn_with_file_and_line (file
, line
, " from here");
4942 if (b
->is_try_scope
)
4943 error (" enters try block");
4945 error (" enters catch block");
4952 check_previous_goto (use
)
4953 struct named_label_use_list
*use
;
4955 check_previous_goto_1 (use
->label_decl
, use
->binding_level
,
4956 use
->names_in_scope
, use
->filename_o_goto
,
4957 use
->lineno_o_goto
);
4961 check_switch_goto (level
)
4962 struct cp_binding_level
*level
;
4964 check_previous_goto_1 (NULL_TREE
, level
, level
->names
, NULL
, 0);
4967 /* Check that any previously seen jumps to a newly defined label DECL
4968 are OK. Called by define_label. */
4971 check_previous_gotos (decl
)
4974 struct named_label_use_list
**usep
;
4976 if (! TREE_USED (decl
))
4979 for (usep
= &named_label_uses
; *usep
; )
4981 struct named_label_use_list
*use
= *usep
;
4982 if (use
->label_decl
== decl
)
4984 check_previous_goto (use
);
4988 usep
= &(use
->next
);
4992 /* Check that a new jump to a label DECL is OK. Called by
4993 finish_goto_stmt. */
5001 struct named_label_list
*lab
;
5003 /* We can't know where a computed goto is jumping. So we assume
5005 if (! DECL_P (decl
))
5008 /* If the label hasn't been defined yet, defer checking. */
5009 if (! DECL_INITIAL (decl
))
5015 for (lab
= named_labels
; lab
; lab
= lab
->next
)
5016 if (decl
== lab
->label_decl
)
5019 /* If the label is not on named_labels it's a gcc local label, so
5020 it must be in an outer scope, so jumping to it is always OK. */
5024 if ((lab
->in_try_scope
|| lab
->in_catch_scope
|| lab
->bad_decls
)
5027 cp_pedwarn_at ("jump to label `%D'", decl
);
5028 pedwarn (" from here");
5032 for (bad
= lab
->bad_decls
; bad
; bad
= TREE_CHAIN (bad
))
5034 tree b
= TREE_VALUE (bad
);
5035 int u
= decl_jump_unsafe (b
);
5037 if (u
> 1 && DECL_ARTIFICIAL (b
))
5038 /* Can't skip init of __exception_info. */
5039 cp_error_at (" enters catch block", b
);
5041 cp_error_at (" skips initialization of `%#D'", b
);
5043 cp_pedwarn_at (" enters scope of non-POD `%#D'", b
);
5046 if (lab
->in_try_scope
)
5047 error (" enters try block");
5048 else if (lab
->in_catch_scope
)
5049 error (" enters catch block");
5052 /* Define a label, specifying the location in the source file.
5053 Return the LABEL_DECL node for the label, if the definition is valid.
5054 Otherwise return 0. */
5057 define_label (filename
, line
, name
)
5058 const char *filename
;
5062 tree decl
= lookup_label (name
);
5063 struct named_label_list
*ent
;
5064 register struct cp_binding_level
*p
;
5066 for (ent
= named_labels
; ent
; ent
= ent
->next
)
5067 if (ent
->label_decl
== decl
)
5070 /* After labels, make any new cleanups in the function go into their
5071 own new (temporary) binding contour. */
5072 for (p
= current_binding_level
; !(p
->parm_flag
); p
= p
->level_chain
)
5073 p
->more_cleanups_ok
= 0;
5075 if (name
== get_identifier ("wchar_t"))
5076 pedwarn ("label named wchar_t");
5078 if (DECL_INITIAL (decl
) != NULL_TREE
)
5080 error ("duplicate label `%D'", decl
);
5085 /* Mark label as having been defined. */
5086 DECL_INITIAL (decl
) = error_mark_node
;
5087 /* Say where in the source. */
5088 DECL_SOURCE_FILE (decl
) = filename
;
5089 DECL_SOURCE_LINE (decl
) = line
;
5092 ent
->names_in_scope
= current_binding_level
->names
;
5093 ent
->binding_level
= current_binding_level
;
5095 check_previous_gotos (decl
);
5102 struct cp_binding_level
*level
;
5103 struct cp_switch
*next
;
5104 /* The SWITCH_STMT being built. */
5106 /* A splay-tree mapping the low element of a case range to the high
5107 element, or NULL_TREE if there is no high element. Used to
5108 determine whether or not a new case label duplicates an old case
5109 label. We need a tree, rather than simply a hash table, because
5110 of the GNU case range extension. */
5114 /* A stack of the currently active switch statements. The innermost
5115 switch statement is on the top of the stack. There is no need to
5116 mark the stack for garbage collection because it is only active
5117 during the processing of the body of a function, and we never
5118 collect at that point. */
5120 static struct cp_switch
*switch_stack
;
5122 /* Called right after a switch-statement condition is parsed.
5123 SWITCH_STMT is the switch statement being parsed. */
5126 push_switch (switch_stmt
)
5130 = (struct cp_switch
*) xmalloc (sizeof (struct cp_switch
));
5131 p
->level
= current_binding_level
;
5132 p
->next
= switch_stack
;
5133 p
->switch_stmt
= switch_stmt
;
5134 p
->cases
= splay_tree_new (case_compare
, NULL
, NULL
);
5141 struct cp_switch
*cs
;
5144 splay_tree_delete (cs
->cases
);
5145 switch_stack
= switch_stack
->next
;
5149 /* Note that we've seen a definition of a case label, and complain if this
5150 is a bad place for one. */
5153 finish_case_label (low_value
, high_value
)
5158 register struct cp_binding_level
*p
;
5163 error ("case label not within a switch statement");
5165 error ("case label `%E' not within a switch statement",
5168 error ("`default' label not within a switch statement");
5172 if (processing_template_decl
)
5176 /* For templates, just add the case label; we'll do semantic
5177 analysis at instantiation-time. */
5178 label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
5179 return add_stmt (build_case_label (low_value
, high_value
, label
));
5182 /* Find the condition on which this switch statement depends. */
5183 cond
= SWITCH_COND (switch_stack
->switch_stmt
);
5184 if (cond
&& TREE_CODE (cond
) == TREE_LIST
)
5185 cond
= TREE_VALUE (cond
);
5187 r
= c_add_case_label (switch_stack
->cases
, cond
, low_value
, high_value
);
5188 if (r
== error_mark_node
)
5191 check_switch_goto (switch_stack
->level
);
5193 /* After labels, make any new cleanups in the function go into their
5194 own new (temporary) binding contour. */
5195 for (p
= current_binding_level
; !(p
->parm_flag
); p
= p
->level_chain
)
5196 p
->more_cleanups_ok
= 0;
5201 /* Return the list of declarations of the current level.
5202 Note that this list is in reverse order unless/until
5203 you nreverse it; and when you do nreverse it, you must
5204 store the result back using `storedecls' or you will lose. */
5209 return current_binding_level
->names
;
5212 /* Return the list of type-tags (for structs, etc) of the current level. */
5217 return current_binding_level
->tags
;
5220 /* Store the list of declarations of the current level.
5221 This is done for the parameter declarations of a function being defined,
5222 after they are modified in the light of any missing parameters. */
5228 current_binding_level
->names
= decls
;
5231 /* Similarly, store the list of tags of the current level. */
5237 current_binding_level
->tags
= tags
;
5240 /* Return the type that should be used when TYPE's name is preceded
5241 by a tag such as 'struct' or 'union', or null if the name cannot
5242 be used in this way.
5244 For example, when processing the third line of:
5250 lookup of A will find the typedef. Given A's typedef, this function
5251 will return the type associated with "struct A". For the tag to be
5252 anything other than TYPE, TYPE must be a typedef whose original type
5253 has the same name and context as TYPE itself.
5255 It is not valid for a typedef of an anonymous type to be used with
5258 typedef struct { ... } B;
5261 Return null for this case. */
5264 follow_tag_typedef (type
)
5269 original
= original_type (type
);
5270 if (! TYPE_NAME (original
))
5272 if (TYPE_IDENTIFIER (original
) == TYPE_IDENTIFIER (type
)
5273 && (CP_DECL_CONTEXT (TYPE_NAME (original
))
5274 == CP_DECL_CONTEXT (TYPE_NAME (type
)))
5275 && !(CLASS_TYPE_P (original
) && TYPE_WAS_ANONYMOUS (original
)))
5281 /* Given NAME, an IDENTIFIER_NODE,
5282 return the structure (or union or enum) definition for that name.
5283 Searches binding levels from BINDING_LEVEL up to the global level.
5284 If THISLEVEL_ONLY is nonzero, searches only the specified context
5285 (but skips any tag-transparent contexts to find one that is
5286 meaningful for tags).
5287 FORM says which kind of type the caller wants;
5288 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
5289 If the wrong kind of type is found, and it's not a template, an error is
5293 lookup_tag (form
, name
, binding_level
, thislevel_only
)
5294 enum tree_code form
;
5296 struct cp_binding_level
*binding_level
;
5299 register struct cp_binding_level
*level
;
5300 /* Nonzero if, we should look past a template parameter level, even
5301 if THISLEVEL_ONLY. */
5302 int allow_template_parms_p
= 1;
5304 for (level
= binding_level
; level
; level
= level
->level_chain
)
5307 if (ANON_AGGRNAME_P (name
))
5308 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5310 /* There's no need for error checking here, because
5311 anon names are unique throughout the compilation. */
5312 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
5313 return TREE_VALUE (tail
);
5315 else if (level
->namespace_p
)
5316 /* Do namespace lookup. */
5317 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
5319 tree old
= binding_for_name (name
, tail
);
5321 /* If we just skipped past a template parameter level,
5322 even though THISLEVEL_ONLY, and we find a template
5323 class declaration, then we use the _TYPE node for the
5324 template. See the example below. */
5325 if (thislevel_only
&& !allow_template_parms_p
5326 && old
&& BINDING_VALUE (old
)
5327 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
5328 old
= TREE_TYPE (BINDING_VALUE (old
));
5330 old
= BINDING_TYPE (old
);
5334 /* We've found something at this binding level. If it is
5335 a typedef, extract the tag it refers to. Lookup fails
5336 if the typedef doesn't refer to a taggable type. */
5337 old
= follow_tag_typedef (old
);
5340 if (TREE_CODE (old
) != form
5341 && (form
== ENUMERAL_TYPE
5342 || TREE_CODE (old
) == ENUMERAL_TYPE
))
5344 error ("`%#D' redeclared as %C", old
, form
);
5349 if (thislevel_only
|| tail
== global_namespace
)
5353 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5355 if (TREE_PURPOSE (tail
) == name
)
5357 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
5360 && (form
== ENUMERAL_TYPE
|| code
== ENUMERAL_TYPE
))
5362 /* Definition isn't the kind we were looking for. */
5363 error ("`%#D' redeclared as %C", TREE_VALUE (tail
), form
);
5366 return TREE_VALUE (tail
);
5369 if (thislevel_only
&& ! level
->tag_transparent
)
5371 if (level
->template_parms_p
&& allow_template_parms_p
)
5373 /* We must deal with cases like this:
5375 template <class T> struct S;
5376 template <class T> struct S {};
5378 When looking up `S', for the second declaration, we
5379 would like to find the first declaration. But, we
5380 are in the pseudo-global level created for the
5381 template parameters, rather than the (surrounding)
5382 namespace level. Thus, we keep going one more level,
5383 even though THISLEVEL_ONLY is nonzero. */
5384 allow_template_parms_p
= 0;
5396 set_current_level_tags_transparency (tags_transparent
)
5397 int tags_transparent
;
5399 current_binding_level
->tag_transparent
= tags_transparent
;
5403 /* Given a type, find the tag that was defined for it and return the tag name.
5404 Otherwise return 0. However, the value can never be 0
5405 in the cases in which this is used.
5407 C++: If NAME is nonzero, this is the new name to install. This is
5408 done when replacing anonymous tags with real tag names. */
5411 lookup_tag_reverse (type
, name
)
5415 register struct cp_binding_level
*level
;
5417 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5420 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5422 if (TREE_VALUE (tail
) == type
)
5425 TREE_PURPOSE (tail
) = name
;
5426 return TREE_PURPOSE (tail
);
5433 /* Look up NAME in the NAMESPACE. */
5436 lookup_namespace_name (namespace, name
)
5437 tree
namespace, name
;
5440 tree template_id
= NULL_TREE
;
5442 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5444 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5445 /* This happens for A::B<int> when B is a namespace. */
5447 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5449 /* This happens for A::B where B is a template, and there are no
5450 template arguments. */
5451 error ("invalid use of `%D'", name
);
5452 return error_mark_node
;
5455 namespace = ORIGINAL_NAMESPACE (namespace);
5457 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5460 name
= TREE_OPERAND (name
, 0);
5461 if (TREE_CODE (name
) == OVERLOAD
)
5462 name
= DECL_NAME (OVL_CURRENT (name
));
5463 else if (DECL_P (name
))
5464 name
= DECL_NAME (name
);
5467 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5469 val
= make_node (CPLUS_BINDING
);
5470 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5471 return error_mark_node
;
5473 if (BINDING_VALUE (val
))
5475 val
= BINDING_VALUE (val
);
5479 if (DECL_CLASS_TEMPLATE_P (val
))
5480 val
= lookup_template_class (val
,
5481 TREE_OPERAND (template_id
, 1),
5482 /*in_decl=*/NULL_TREE
,
5483 /*context=*/NULL_TREE
,
5484 /*entering_scope=*/0,
5485 tf_error
| tf_warning
);
5486 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5487 || TREE_CODE (val
) == OVERLOAD
)
5488 val
= lookup_template_function (val
,
5489 TREE_OPERAND (template_id
, 1));
5492 error ("`%D::%D' is not a template",
5494 return error_mark_node
;
5498 /* If we have a single function from a using decl, pull it out. */
5499 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5500 val
= OVL_FUNCTION (val
);
5502 /* Ignore built-in functions that haven't been prototyped yet. */
5503 if (!val
|| !DECL_P(val
)
5504 || !DECL_LANG_SPECIFIC(val
)
5505 || !DECL_ANTICIPATED (val
))
5509 error ("`%D' undeclared in namespace `%D'", name
, namespace);
5510 return error_mark_node
;
5513 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5522 hash
= (htab_hash_pointer (TYPE_CONTEXT (t
))
5523 ^ htab_hash_pointer (DECL_NAME (TYPE_NAME (t
))));
5528 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5531 typename_compare (k1
, k2
)
5542 d1
= TYPE_NAME (t1
);
5543 d2
= TYPE_NAME (t2
);
5545 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5546 && TYPE_CONTEXT (t1
) == TYPE_CONTEXT (t2
)
5547 && ((TREE_TYPE (t1
) != NULL_TREE
)
5548 == (TREE_TYPE (t2
) != NULL_TREE
))
5549 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5550 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5553 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5554 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5555 is non-NULL, this type is being created by the implicit typename
5556 extension, and BASE_TYPE is a type named `t' in some base class of
5557 `T' which depends on template parameters.
5559 Returns the new TYPENAME_TYPE. */
5561 static GTY ((param_is (union tree_node
))) htab_t typename_htab
;
5564 build_typename_type (context
, name
, fullname
, base_type
)
5574 if (typename_htab
== NULL
)
5576 typename_htab
= htab_create_ggc (61, &typename_hash
,
5577 &typename_compare
, NULL
);
5580 /* Build the TYPENAME_TYPE. */
5581 t
= make_aggr_type (TYPENAME_TYPE
);
5582 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5583 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5584 TREE_TYPE (t
) = base_type
;
5586 /* Build the corresponding TYPE_DECL. */
5587 d
= build_decl (TYPE_DECL
, name
, t
);
5588 TYPE_NAME (TREE_TYPE (d
)) = d
;
5589 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5590 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5591 DECL_ARTIFICIAL (d
) = 1;
5593 /* See if we already have this type. */
5594 e
= htab_find_slot (typename_htab
, t
, INSERT
);
5603 /* Resolve `typename CONTEXT::NAME'. Returns an appropriate type,
5604 unless an error occurs, in which case error_mark_node is returned.
5605 If we locate a non-artificial TYPE_DECL and TF_KEEP_TYPE_DECL is
5606 set, we return that, rather than the _TYPE it corresponds to, in
5607 other cases we look through the type decl. If TF_ERROR is set,
5608 complain about errors, otherwise be quiet. */
5611 make_typename_type (context
, name
, complain
)
5613 tsubst_flags_t complain
;
5619 if (!(TYPE_LANG_SPECIFIC (name
)
5620 && (CLASSTYPE_IS_TEMPLATE (name
)
5621 || CLASSTYPE_USE_TEMPLATE (name
))))
5622 name
= TYPE_IDENTIFIER (name
);
5624 /* Create a TEMPLATE_ID_EXPR for the type. */
5625 name
= build_nt (TEMPLATE_ID_EXPR
,
5626 CLASSTYPE_TI_TEMPLATE (name
),
5627 CLASSTYPE_TI_ARGS (name
));
5629 else if (TREE_CODE (name
) == TYPE_DECL
)
5630 name
= DECL_NAME (name
);
5634 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5636 name
= TREE_OPERAND (name
, 0);
5637 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5638 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5640 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5642 error ("`%D' used without template parameters", name
);
5643 return error_mark_node
;
5645 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5648 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5650 /* We can get here from typename_sub0 in the explicit_template_type
5651 expansion. Just fail. */
5652 if (complain
& tf_error
)
5653 error ("no class template named `%#T' in `%#T'",
5655 return error_mark_node
;
5658 if (! uses_template_parms (context
)
5659 || currently_open_class (context
))
5661 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5663 tree tmpl
= NULL_TREE
;
5664 if (IS_AGGR_TYPE (context
))
5665 tmpl
= lookup_field (context
, name
, 0, 0);
5666 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5668 if (complain
& tf_error
)
5669 error ("no class template named `%#T' in `%#T'",
5671 return error_mark_node
;
5674 if (complain
& tf_parsing
)
5675 type_access_control (context
, tmpl
);
5677 enforce_access (context
, tmpl
);
5679 return lookup_template_class (tmpl
,
5680 TREE_OPERAND (fullname
, 1),
5682 /*entering_scope=*/0,
5683 tf_error
| tf_warning
);
5689 if (!IS_AGGR_TYPE (context
))
5691 if (complain
& tf_error
)
5692 error ("no type named `%#T' in `%#T'", name
, context
);
5693 return error_mark_node
;
5696 t
= lookup_field (context
, name
, 0, 1);
5699 if (complain
& tf_parsing
)
5700 type_access_control (context
, t
);
5702 enforce_access (context
, t
);
5704 if (DECL_ARTIFICIAL (t
) || !(complain
& tf_keep_type_decl
))
5706 if (IMPLICIT_TYPENAME_P (t
))
5708 /* Lookup found an implicit typename that we had
5709 injected into the current scope. Doing things
5710 properly would have located the exact same type,
5711 so there is no error here. We must remove the
5712 implicitness so that we do not warn about it. */
5714 TREE_TYPE (t
) = NULL_TREE
;
5722 /* If the CONTEXT is not a template type, then either the field is
5723 there now or its never going to be. */
5724 if (!uses_template_parms (context
))
5726 if (complain
& tf_error
)
5727 error ("no type named `%#T' in `%#T'", name
, context
);
5728 return error_mark_node
;
5731 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5734 /* Resolve `CONTEXT::template NAME'. Returns an appropriate type,
5735 unless an error occurs, in which case error_mark_node is returned.
5736 If we locate a TYPE_DECL, we return that, rather than the _TYPE it
5737 corresponds to. If COMPLAIN zero, don't complain about any errors
5741 make_unbound_class_template (context
, name
, complain
)
5749 name
= TYPE_IDENTIFIER (name
);
5750 else if (DECL_P (name
))
5751 name
= DECL_NAME (name
);
5752 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5755 if (!uses_template_parms (context
)
5756 || currently_open_class (context
))
5758 tree tmpl
= NULL_TREE
;
5760 if (IS_AGGR_TYPE (context
))
5761 tmpl
= lookup_field (context
, name
, 0, 0);
5763 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5766 error ("no class template named `%#T' in `%#T'", name
, context
);
5767 return error_mark_node
;
5770 if (complain
& tf_parsing
)
5771 type_access_control (context
, tmpl
);
5773 enforce_access (context
, tmpl
);
5778 /* Build the UNBOUND_CLASS_TEMPLATE. */
5779 t
= make_aggr_type (UNBOUND_CLASS_TEMPLATE
);
5780 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5781 TREE_TYPE (t
) = NULL_TREE
;
5783 /* Build the corresponding TEMPLATE_DECL. */
5784 d
= build_decl (TEMPLATE_DECL
, name
, t
);
5785 TYPE_NAME (TREE_TYPE (d
)) = d
;
5786 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5787 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5788 DECL_ARTIFICIAL (d
) = 1;
5793 /* Select the right _DECL from multiple choices. */
5796 select_decl (binding
, flags
)
5801 val
= BINDING_VALUE (binding
);
5803 if (LOOKUP_NAMESPACES_ONLY (flags
))
5805 /* We are not interested in types. */
5806 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5811 /* If we could have a type and
5812 we have nothing or we need a type and have none. */
5813 if (BINDING_TYPE (binding
)
5814 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5815 && TREE_CODE (val
) != TYPE_DECL
)))
5816 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5817 /* Don't return non-types if we really prefer types. */
5818 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5819 && (TREE_CODE (val
) != TEMPLATE_DECL
5820 || !DECL_CLASS_TEMPLATE_P (val
)))
5826 /* Unscoped lookup of a global: iterate over current namespaces,
5827 considering using-directives. If SPACESP is non-NULL, store a list
5828 of the namespaces we've considered in it. */
5831 unqualified_namespace_lookup (name
, flags
, spacesp
)
5836 tree b
= make_node (CPLUS_BINDING
);
5837 tree initial
= current_decl_namespace ();
5838 tree scope
= initial
;
5840 struct cp_binding_level
*level
;
5841 tree val
= NULL_TREE
;
5844 *spacesp
= NULL_TREE
;
5846 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5849 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5850 val
= binding_for_name (name
, scope
);
5852 /* Ignore anticipated built-in functions. */
5853 if (val
&& BINDING_VALUE (val
)
5854 && DECL_P (BINDING_VALUE (val
))
5855 && DECL_LANG_SPECIFIC (BINDING_VALUE (val
))
5856 && DECL_ANTICIPATED (BINDING_VALUE (val
)))
5858 BINDING_VALUE (b
) = NULL_TREE
;
5859 BINDING_TYPE (b
) = NULL_TREE
;
5863 /* Initialize binding for this context. */
5864 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5865 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5868 /* Add all _DECLs seen through local using-directives. */
5869 for (level
= current_binding_level
;
5870 !level
->namespace_p
;
5871 level
= level
->level_chain
)
5872 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5873 scope
, flags
, spacesp
))
5874 /* Give up because of error. */
5875 return error_mark_node
;
5877 /* Add all _DECLs seen through global using-directives. */
5878 /* XXX local and global using lists should work equally. */
5882 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5883 scope
, flags
, spacesp
))
5884 /* Give up because of error. */
5885 return error_mark_node
;
5886 if (siter
== scope
) break;
5887 siter
= CP_DECL_CONTEXT (siter
);
5890 val
= select_decl (b
, flags
);
5891 if (scope
== global_namespace
)
5897 /* Combine prefer_type and namespaces_only into flags. */
5900 lookup_flags (prefer_type
, namespaces_only
)
5901 int prefer_type
, namespaces_only
;
5903 if (namespaces_only
)
5904 return LOOKUP_PREFER_NAMESPACES
;
5905 if (prefer_type
> 1)
5906 return LOOKUP_PREFER_TYPES
;
5907 if (prefer_type
> 0)
5908 return LOOKUP_PREFER_BOTH
;
5912 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5913 ignore it or not. Subroutine of lookup_name_real. */
5916 qualify_lookup (val
, flags
)
5920 if (val
== NULL_TREE
)
5922 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5924 if ((flags
& LOOKUP_PREFER_TYPES
)
5925 && (TREE_CODE (val
) == TYPE_DECL
5926 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5927 && DECL_CLASS_TEMPLATE_P (val
))))
5929 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5934 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5938 warn_about_implicit_typename_lookup (typename
, binding
)
5942 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5943 tree name
= DECL_NAME (typename
);
5945 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5946 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5947 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5948 && ! (TREE_CODE (binding
) == TYPE_DECL
5949 && same_type_p (TREE_TYPE (binding
), subtype
)))
5951 warning ("lookup of `%D' finds `%#D'",
5953 warning (" instead of `%D' from dependent base class",
5955 warning (" (use `typename %T::%D' if that's what you meant)",
5956 constructor_name (current_class_type
), name
);
5960 /* Check to see whether or not DECL is a variable that would have been
5961 in scope under the ARM, but is not in scope under the ANSI/ISO
5962 standard. If so, issue an error message. If name lookup would
5963 work in both cases, but return a different result, this function
5964 returns the result of ANSI/ISO lookup. Otherwise, it returns
5968 check_for_out_of_scope_variable (tree decl
)
5972 /* We only care about out of scope variables. */
5973 if (!(TREE_CODE (decl
) == VAR_DECL
&& DECL_DEAD_FOR_LOCAL (decl
)))
5976 shadowed
= DECL_SHADOWED_FOR_VAR (decl
);
5977 while (shadowed
!= NULL_TREE
&& TREE_CODE (shadowed
) == VAR_DECL
5978 && DECL_DEAD_FOR_LOCAL (shadowed
))
5979 shadowed
= DECL_SHADOWED_FOR_VAR (shadowed
);
5981 shadowed
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (decl
));
5984 if (!DECL_ERROR_REPORTED (decl
))
5986 warning ("name lookup of `%D' changed",
5988 cp_warning_at (" matches this `%D' under ISO standard rules",
5990 cp_warning_at (" matches this `%D' under old rules", decl
);
5991 DECL_ERROR_REPORTED (decl
) = 1;
5996 /* If we have already complained about this declaration, there's no
5997 need to do it again. */
5998 if (DECL_ERROR_REPORTED (decl
))
6001 DECL_ERROR_REPORTED (decl
) = 1;
6002 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (decl
)))
6004 error ("name lookup of `%D' changed for new ISO `for' scoping",
6006 cp_error_at (" cannot use obsolete binding at `%D' because it has a destructor", decl
);
6007 return error_mark_node
;
6011 pedwarn ("name lookup of `%D' changed for new ISO `for' scoping",
6013 cp_pedwarn_at (" using obsolete binding at `%D'", decl
);
6019 /* Look up NAME in the current binding level and its superiors in the
6020 namespace of variables, functions and typedefs. Return a ..._DECL
6021 node of some kind representing its definition if there is only one
6022 such declaration, or return a TREE_LIST with all the overloaded
6023 definitions if there are many, or return 0 if it is undefined.
6025 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
6026 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
6027 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
6028 Otherwise we prefer non-TYPE_DECLs.
6030 If NONCLASS is nonzero, we don't look for the NAME in class scope,
6031 using IDENTIFIER_CLASS_VALUE. */
6034 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
6036 int prefer_type
, nonclass
, namespaces_only
;
6039 tree val
= NULL_TREE
;
6041 tree from_obj
= NULL_TREE
;
6043 int val_is_implicit_typename
= 0;
6045 /* Hack: copy flag set by parser, if set. */
6046 if (only_namespace_names
)
6047 namespaces_only
= 1;
6049 if (prefer_type
== -2)
6051 extern int looking_for_typename
;
6052 tree type
= NULL_TREE
;
6055 prefer_type
= looking_for_typename
;
6057 flags
= lookup_flags (prefer_type
, namespaces_only
);
6058 /* If the next thing is '<', class templates are types. */
6059 if (looking_for_template
)
6060 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
6064 else if (got_object
!= error_mark_node
)
6069 if (type
== error_mark_node
)
6070 return error_mark_node
;
6071 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
6072 type
= TREE_TYPE (type
);
6075 type
= complete_type (type
);
6077 if (TREE_CODE (type
) == VOID_TYPE
)
6078 type
= global_namespace
;
6079 if (TREE_CODE (type
) == NAMESPACE_DECL
)
6081 val
= make_node (CPLUS_BINDING
);
6082 flags
|= LOOKUP_COMPLAIN
;
6083 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
6085 val
= select_decl (val
, flags
);
6087 else if (! IS_AGGR_TYPE (type
)
6088 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
6089 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
6090 || TREE_CODE (type
) == TYPENAME_TYPE
)
6091 /* Someone else will give an error about this if needed. */
6093 else if (type
== current_class_type
)
6094 val
= IDENTIFIER_CLASS_VALUE (name
);
6097 val
= lookup_member (type
, name
, 0, prefer_type
);
6098 if (!uses_template_parms (type
))
6099 type_access_control (type
, val
);
6101 /* Restore the containing TYPENAME_TYPE if we looked
6102 through it before. */
6103 if (got_scope
&& got_scope
!= type
6104 && val
&& TREE_CODE (val
) == TYPE_DECL
6105 && TREE_CODE (TREE_TYPE (val
)) == TYPENAME_TYPE
)
6107 val
= TREE_TYPE (val
);
6108 val
= build_typename_type (got_scope
, name
,
6109 TYPENAME_TYPE_FULLNAME (val
),
6111 val
= TYPE_STUB_DECL (val
);
6120 else if (got_object
&& val
)
6128 flags
= lookup_flags (prefer_type
, namespaces_only
);
6129 /* If we're not parsing, we need to complain. */
6130 flags
|= LOOKUP_COMPLAIN
;
6133 /* First, look in non-namespace scopes. */
6135 if (current_class_type
== NULL_TREE
)
6138 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
6142 if (!LOCAL_BINDING_P (t
) && nonclass
)
6143 /* We're not looking for class-scoped bindings, so keep going. */
6146 /* If this is the kind of thing we're looking for, we're done. */
6147 if (qualify_lookup (BINDING_VALUE (t
), flags
))
6148 binding
= BINDING_VALUE (t
);
6149 else if ((flags
& LOOKUP_PREFER_TYPES
)
6150 && qualify_lookup (BINDING_TYPE (t
), flags
))
6151 binding
= BINDING_TYPE (t
);
6153 binding
= NULL_TREE
;
6155 /* Handle access control on types from enclosing or base classes. */
6156 if (binding
&& ! yylex
6157 && BINDING_LEVEL (t
) && BINDING_LEVEL (t
)->parm_flag
== 2)
6158 type_access_control (BINDING_LEVEL (t
)->this_class
, binding
);
6161 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
6163 if (val_is_implicit_typename
&& !yylex
)
6164 warn_about_implicit_typename_lookup (val
, binding
);
6166 val_is_implicit_typename
6167 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
6168 if (!val_is_implicit_typename
)
6173 /* Now lookup in namespace scopes. */
6174 if (!val
|| val_is_implicit_typename
)
6176 t
= unqualified_namespace_lookup (name
, flags
, 0);
6179 if (val_is_implicit_typename
&& !yylex
)
6180 warn_about_implicit_typename_lookup (val
, t
);
6188 /* This should only warn about types used in qualified-ids. */
6189 if (from_obj
&& from_obj
!= val
)
6191 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
6192 && TREE_CODE (val
) == TYPE_DECL
6193 && ! same_type_p (TREE_TYPE (from_obj
), TREE_TYPE (val
)))
6195 lookup of `%D' in the scope of `%#T' (`%#D') \
6196 does not match lookup in the current scope (`%#D')",
6197 name
, got_object
, from_obj
, val
);
6199 /* We don't change val to from_obj if got_object depends on
6200 template parms because that breaks implicit typename for
6201 destructor calls. */
6202 if (! uses_template_parms (got_object
))
6206 /* If we have a single function from a using decl, pull it out. */
6207 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
6208 val
= OVL_FUNCTION (val
);
6217 lookup_name_nonclass (name
)
6220 return lookup_name_real (name
, 0, 1, 0);
6224 lookup_function_nonclass (name
, args
)
6228 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
6232 lookup_name_namespace_only (name
)
6235 /* type-or-namespace, nonclass, namespace_only */
6236 return lookup_name_real (name
, 1, 1, 1);
6240 lookup_name (name
, prefer_type
)
6244 return lookup_name_real (name
, prefer_type
, 0, 0);
6247 /* Similar to `lookup_name' but look only in the innermost non-class
6251 lookup_name_current_level (name
)
6254 struct cp_binding_level
*b
;
6257 b
= current_binding_level
;
6258 while (b
->parm_flag
== 2)
6263 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
6265 /* extern "C" function() */
6266 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
6269 else if (IDENTIFIER_BINDING (name
)
6270 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
6274 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
6275 return IDENTIFIER_VALUE (name
);
6287 /* Like lookup_name_current_level, but for types. */
6290 lookup_type_current_level (name
)
6293 register tree t
= NULL_TREE
;
6295 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
6297 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
6298 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
6300 struct cp_binding_level
*b
= current_binding_level
;
6303 if (purpose_member (name
, b
->type_shadowed
))
6304 return REAL_IDENTIFIER_TYPE_VALUE (name
);
6316 begin_only_namespace_names ()
6318 only_namespace_names
= 1;
6322 end_only_namespace_names ()
6324 only_namespace_names
= 0;
6327 /* Push the declarations of builtin types into the namespace.
6328 RID_INDEX is the index of the builtin type
6329 in the array RID_POINTERS. NAME is the name used when looking
6330 up the builtin type. TYPE is the _TYPE node for the builtin type. */
6333 record_builtin_type (rid_index
, name
, type
)
6338 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
6339 tree tdecl
= NULL_TREE
;
6341 if ((int) rid_index
< (int) RID_MAX
)
6342 rname
= ridpointers
[(int) rid_index
];
6344 tname
= get_identifier (name
);
6346 TYPE_BUILT_IN (type
) = 1;
6350 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
6351 set_identifier_type_value (tname
, NULL_TREE
);
6352 if ((int) rid_index
< (int) RID_MAX
)
6353 /* Built-in types live in the global namespace. */
6354 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
6356 if (rname
!= NULL_TREE
)
6358 if (tname
!= NULL_TREE
)
6360 set_identifier_type_value (rname
, NULL_TREE
);
6361 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
6365 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
6366 set_identifier_type_value (rname
, NULL_TREE
);
6371 /* Record one of the standard Java types.
6372 * Declare it as having the given NAME.
6373 * If SIZE > 0, it is the size of one of the integral types;
6374 * otherwise it is the negative of the size of one of the other types. */
6377 record_builtin_java_type (name
, size
)
6383 type
= make_signed_type (size
);
6384 else if (size
> -32)
6385 { /* "__java_char" or ""__java_boolean". */
6386 type
= make_unsigned_type (-size
);
6387 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
6390 { /* "__java_float" or ""__java_double". */
6391 type
= make_node (REAL_TYPE
);
6392 TYPE_PRECISION (type
) = - size
;
6395 record_builtin_type (RID_MAX
, name
, type
);
6396 decl
= TYPE_NAME (type
);
6398 /* Suppress generate debug symbol entries for these types,
6399 since for normal C++ they are just clutter.
6400 However, push_lang_context undoes this if extern "Java" is seen. */
6401 DECL_IGNORED_P (decl
) = 1;
6403 TYPE_FOR_JAVA (type
) = 1;
6407 /* Push a type into the namespace so that the back-ends ignore it. */
6410 record_unknown_type (type
, name
)
6414 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
6415 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
6416 DECL_IGNORED_P (decl
) = 1;
6417 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
6418 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
6419 TYPE_ALIGN (type
) = 1;
6420 TYPE_USER_ALIGN (type
) = 0;
6421 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
6424 /* An string for which we should create an IDENTIFIER_NODE at
6427 typedef struct predefined_identifier
6429 /* The name of the identifier. */
6430 const char *const name
;
6431 /* The place where the IDENTIFIER_NODE should be stored. */
6433 /* Nonzero if this is the name of a constructor or destructor. */
6434 const int ctor_or_dtor_p
;
6435 } predefined_identifier
;
6437 /* Create all the predefined identifiers. */
6440 initialize_predefined_identifiers ()
6442 const predefined_identifier
*pid
;
6444 /* A table of identifiers to create at startup. */
6445 static const predefined_identifier predefined_identifiers
[] = {
6446 { "C++", &lang_name_cplusplus
, 0 },
6447 { "C", &lang_name_c
, 0 },
6448 { "Java", &lang_name_java
, 0 },
6449 { CTOR_NAME
, &ctor_identifier
, 1 },
6450 { "__base_ctor", &base_ctor_identifier
, 1 },
6451 { "__comp_ctor", &complete_ctor_identifier
, 1 },
6452 { DTOR_NAME
, &dtor_identifier
, 1 },
6453 { "__comp_dtor", &complete_dtor_identifier
, 1 },
6454 { "__base_dtor", &base_dtor_identifier
, 1 },
6455 { "__deleting_dtor", &deleting_dtor_identifier
, 1 },
6456 { IN_CHARGE_NAME
, &in_charge_identifier
, 0 },
6457 { "nelts", &nelts_identifier
, 0 },
6458 { THIS_NAME
, &this_identifier
, 0 },
6459 { VTABLE_DELTA_NAME
, &delta_identifier
, 0 },
6460 { VTABLE_PFN_NAME
, &pfn_identifier
, 0 },
6461 { "_vptr", &vptr_identifier
, 0 },
6462 { "__vtt_parm", &vtt_parm_identifier
, 0 },
6463 { "std", &std_identifier
, 0 },
6467 for (pid
= predefined_identifiers
; pid
->name
; ++pid
)
6469 *pid
->node
= get_identifier (pid
->name
);
6470 if (pid
->ctor_or_dtor_p
)
6471 IDENTIFIER_CTOR_OR_DTOR_P (*pid
->node
) = 1;
6475 /* Create the predefined scalar types of C,
6476 and some nodes representing standard constants (0, 1, (void *)0).
6477 Initialize the global binding level.
6478 Make definitions for built-in primitive functions. */
6481 cxx_init_decl_processing ()
6484 tree void_ftype_ptr
;
6486 /* Create all the identifiers we need. */
6487 initialize_predefined_identifiers ();
6489 /* Fill in back-end hooks. */
6490 lang_missing_noreturn_ok_p
= &cp_missing_noreturn_ok_p
;
6492 /* Create the global variables. */
6493 push_to_top_level ();
6495 /* Enter the global namespace. */
6496 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
6497 push_namespace (get_identifier ("::"));
6498 global_namespace
= current_namespace
;
6499 current_lang_name
= NULL_TREE
;
6501 /* Adjust various flags based on command-line settings. */
6502 if (! flag_permissive
&& ! pedantic
)
6503 flag_pedantic_errors
= 1;
6504 if (!flag_no_inline
)
6506 flag_inline_trees
= 1;
6509 if (flag_inline_functions
)
6511 flag_inline_trees
= 2;
6512 flag_inline_functions
= 0;
6515 /* Force minimum function alignment if using the least significant
6516 bit of function pointers to store the virtual bit. */
6517 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_pfn
6518 && force_align_functions_log
< 1)
6519 force_align_functions_log
= 1;
6522 current_lang_name
= lang_name_c
;
6524 current_function_decl
= NULL_TREE
;
6525 current_binding_level
= NULL_BINDING_LEVEL
;
6526 free_binding_level
= NULL_BINDING_LEVEL
;
6528 build_common_tree_nodes (flag_signed_char
);
6530 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6531 TREE_TYPE (error_mark_list
) = error_mark_node
;
6533 /* Make the binding_level structure for global names. */
6535 global_binding_level
= current_binding_level
;
6536 /* The global level is the namespace level of ::. */
6537 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6538 declare_namespace_level ();
6540 /* Create the `std' namespace. */
6541 push_namespace (std_identifier
);
6542 std_node
= current_namespace
;
6545 c_common_nodes_and_builtins ();
6547 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6548 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6549 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6550 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6551 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6552 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6553 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6554 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6556 integer_two_node
= build_int_2 (2, 0);
6557 TREE_TYPE (integer_two_node
) = integer_type_node
;
6558 integer_three_node
= build_int_2 (3, 0);
6559 TREE_TYPE (integer_three_node
) = integer_type_node
;
6561 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6562 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6563 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6564 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6565 TYPE_PRECISION (boolean_type_node
) = 1;
6566 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6567 boolean_false_node
= build_int_2 (0, 0);
6568 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6569 boolean_true_node
= build_int_2 (1, 0);
6570 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6572 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6575 record_builtin_type (RID_MAX
, NULL
, string_type_node
);
6578 delta_type_node
= ptrdiff_type_node
;
6579 vtable_index_type
= ptrdiff_type_node
;
6581 vtt_parm_type
= build_pointer_type (const_ptr_type_node
);
6582 void_ftype
= build_function_type (void_type_node
, void_list_node
);
6583 void_ftype_ptr
= build_function_type (void_type_node
,
6584 tree_cons (NULL_TREE
,
6588 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6590 /* C++ extensions */
6592 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6593 record_unknown_type (unknown_type_node
, "unknown type");
6595 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6596 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6598 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6600 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6601 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6604 /* Make sure we get a unique function type, so we can give
6605 its pointer type a name. (This wins for gdb.) */
6606 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6607 TREE_TYPE (vfunc_type
) = integer_type_node
;
6608 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6609 layout_type (vfunc_type
);
6611 vtable_entry_type
= build_pointer_type (vfunc_type
);
6613 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6616 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6617 layout_type (vtbl_type_node
);
6618 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6619 record_builtin_type (RID_MAX
, NULL
, vtbl_type_node
);
6620 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6621 layout_type (vtbl_ptr_type_node
);
6622 record_builtin_type (RID_MAX
, NULL
, vtbl_ptr_type_node
);
6624 push_namespace (get_identifier ("__cxxabiv1"));
6625 abi_node
= current_namespace
;
6628 global_type_node
= make_node (LANG_TYPE
);
6629 record_unknown_type (global_type_node
, "global type");
6632 current_lang_name
= lang_name_cplusplus
;
6635 tree bad_alloc_type_node
, newtype
, deltype
;
6636 tree ptr_ftype_sizetype
;
6638 push_namespace (std_identifier
);
6640 = xref_tag (class_type
, get_identifier ("bad_alloc"),
6641 /*attributes=*/NULL_TREE
, 1);
6644 = build_function_type (ptr_type_node
,
6645 tree_cons (NULL_TREE
,
6648 newtype
= build_exception_variant
6649 (ptr_ftype_sizetype
, add_exception_specifier
6650 (NULL_TREE
, bad_alloc_type_node
, -1));
6651 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6652 push_cp_library_fn (NEW_EXPR
, newtype
);
6653 push_cp_library_fn (VEC_NEW_EXPR
, newtype
);
6654 global_delete_fndecl
= push_cp_library_fn (DELETE_EXPR
, deltype
);
6655 push_cp_library_fn (VEC_DELETE_EXPR
, deltype
);
6659 = build_library_fn_ptr ("__cxa_pure_virtual", void_ftype
);
6661 /* Perform other language dependent initializations. */
6662 init_class_processing ();
6663 init_search_processing ();
6664 init_rtti_processing ();
6666 if (flag_exceptions
)
6667 init_exception_processing ();
6669 if (! supports_one_only ())
6672 make_fname_decl
= cp_make_fname_decl
;
6673 start_fname_decls ();
6675 /* Show we use EH for cleanups. */
6676 using_eh_for_cleanups ();
6678 /* Maintain consistency. Perhaps we should just complain if they
6679 say -fwritable-strings? */
6680 if (flag_writable_strings
)
6681 flag_const_strings
= 0;
6684 /* Generate an initializer for a function naming variable from
6685 NAME. NAME may be NULL, in which case we generate a special
6686 ERROR_MARK node which should be replaced later. */
6689 cp_fname_init (name
)
6692 tree domain
= NULL_TREE
;
6694 tree init
= NULL_TREE
;
6699 length
= strlen (name
);
6700 domain
= build_index_type (size_int (length
));
6701 init
= build_string (length
+ 1, name
);
6704 type
= build_qualified_type (char_type_node
, TYPE_QUAL_CONST
);
6705 type
= build_cplus_array_type (type
, domain
);
6708 TREE_TYPE (init
) = type
;
6710 /* We don't know the value until instantiation time. Make
6711 something which will be digested now, but replaced later. */
6712 init
= build (ERROR_MARK
, type
);
6717 /* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the
6718 decl, NAME is the initialization string and TYPE_DEP indicates whether
6719 NAME depended on the type of the function. We make use of that to detect
6720 __PRETTY_FUNCTION__ inside a template fn. This is being done
6721 lazily at the point of first use, so we musn't push the decl now. */
6724 cp_make_fname_decl (id
, type_dep
)
6728 const char *const name
= (type_dep
&& processing_template_decl
6729 ? NULL
: fname_as_string (type_dep
));
6730 tree init
= cp_fname_init (name
);
6731 tree decl
= build_decl (VAR_DECL
, id
, TREE_TYPE (init
));
6733 /* As we don't push the decl here, we must set the context. */
6734 DECL_CONTEXT (decl
) = current_function_decl
;
6735 DECL_PRETTY_FUNCTION_P (decl
) = type_dep
;
6737 TREE_STATIC (decl
) = 1;
6738 TREE_READONLY (decl
) = 1;
6739 DECL_ARTIFICIAL (decl
) = 1;
6740 DECL_INITIAL (decl
) = init
;
6742 TREE_USED (decl
) = 1;
6744 cp_finish_decl (decl
, init
, NULL_TREE
, LOOKUP_ONLYCONVERTING
);
6749 /* Make a definition for a builtin function named NAME in the current
6750 namespace, whose data type is TYPE and whose context is CONTEXT.
6751 TYPE should be a function type with argument types.
6753 CLASS and CODE tell later passes how to compile calls to this function.
6754 See tree.h for possible values.
6756 If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6757 the name to be called if we can't opencode the function.
6758 If ATTRS is nonzero, use that for the function's attribute
6762 builtin_function_1 (name
, type
, context
, code
, class, libname
, attrs
)
6767 enum built_in_class
class;
6768 const char *libname
;
6771 tree decl
= build_library_fn_1 (get_identifier (name
), ERROR_MARK
, type
);
6772 DECL_BUILT_IN_CLASS (decl
) = class;
6773 DECL_FUNCTION_CODE (decl
) = code
;
6774 DECL_CONTEXT (decl
) = context
;
6778 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6779 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6780 function in the namespace. */
6782 SET_DECL_ASSEMBLER_NAME (decl
, get_identifier (libname
));
6783 make_decl_rtl (decl
, NULL
);
6785 /* Warn if a function in the namespace for users
6786 is used without an occasion to consider it declared. */
6787 if (name
[0] != '_' || name
[1] != '_')
6788 DECL_ANTICIPATED (decl
) = 1;
6790 /* Possibly apply some default attributes to this built-in function. */
6792 decl_attributes (&decl
, attrs
, ATTR_FLAG_BUILT_IN
);
6794 decl_attributes (&decl
, NULL_TREE
, 0);
6799 /* Entry point for the benefit of c_common_nodes_and_builtins.
6801 Make a defintion for a builtin function named NAME and whose data type
6802 is TYPE. TYPE should be a function type with argument types. This
6803 function places the anticipated declaration in the global namespace
6804 and additionally in the std namespace if appropriate.
6806 CLASS and CODE tell later passes how to compile calls to this function.
6807 See tree.h for possible values.
6809 If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6810 the name to be called if we can't opencode the function.
6812 If ATTRS is nonzero, use that for the function's attribute
6816 builtin_function (name
, type
, code
, class, libname
, attrs
)
6820 enum built_in_class
class;
6821 const char *libname
;
6824 /* All builtins that don't begin with an '_' should additionally
6825 go in the 'std' namespace. */
6828 push_namespace (std_identifier
);
6829 builtin_function_1 (name
, type
, std_node
, code
, class, libname
, attrs
);
6833 return builtin_function_1 (name
, type
, NULL_TREE
, code
,
6834 class, libname
, attrs
);
6837 /* Generate a FUNCTION_DECL with the typical flags for a runtime library
6838 function. Not called directly. */
6841 build_library_fn_1 (name
, operator_code
, type
)
6843 enum tree_code operator_code
;
6846 tree fn
= build_lang_decl (FUNCTION_DECL
, name
, type
);
6847 DECL_EXTERNAL (fn
) = 1;
6848 TREE_PUBLIC (fn
) = 1;
6849 DECL_ARTIFICIAL (fn
) = 1;
6850 TREE_NOTHROW (fn
) = 1;
6851 SET_OVERLOADED_OPERATOR_CODE (fn
, operator_code
);
6852 SET_DECL_LANGUAGE (fn
, lang_c
);
6856 /* Returns the _DECL for a library function with C linkage.
6857 We assume that such functions never throw; if this is incorrect,
6858 callers should unset TREE_NOTHROW. */
6861 build_library_fn (name
, type
)
6865 return build_library_fn_1 (name
, ERROR_MARK
, type
);
6868 /* Returns the _DECL for a library function with C++ linkage. */
6871 build_cp_library_fn (name
, operator_code
, type
)
6873 enum tree_code operator_code
;
6876 tree fn
= build_library_fn_1 (name
, operator_code
, type
);
6877 TREE_NOTHROW (fn
) = TYPE_NOTHROW_P (type
);
6878 DECL_CONTEXT (fn
) = FROB_CONTEXT (current_namespace
);
6879 SET_DECL_LANGUAGE (fn
, lang_cplusplus
);
6880 set_mangled_name_for_decl (fn
);
6884 /* Like build_library_fn, but takes a C string instead of an
6888 build_library_fn_ptr (name
, type
)
6892 return build_library_fn (get_identifier (name
), type
);
6895 /* Like build_cp_library_fn, but takes a C string instead of an
6899 build_cp_library_fn_ptr (name
, type
)
6903 return build_cp_library_fn (get_identifier (name
), ERROR_MARK
, type
);
6906 /* Like build_library_fn, but also pushes the function so that we will
6907 be able to find it via IDENTIFIER_GLOBAL_VALUE. */
6910 push_library_fn (name
, type
)
6913 tree fn
= build_library_fn (name
, type
);
6914 pushdecl_top_level (fn
);
6918 /* Like build_cp_library_fn, but also pushes the function so that it
6919 will be found by normal lookup. */
6922 push_cp_library_fn (operator_code
, type
)
6923 enum tree_code operator_code
;
6926 tree fn
= build_cp_library_fn (ansi_opname (operator_code
),
6933 /* Like push_library_fn, but takes a TREE_LIST of parm types rather than
6937 push_void_library_fn (name
, parmtypes
)
6938 tree name
, parmtypes
;
6940 tree type
= build_function_type (void_type_node
, parmtypes
);
6941 return push_library_fn (name
, type
);
6944 /* Like push_library_fn, but also note that this function throws
6945 and does not return. Used for __throw_foo and the like. */
6948 push_throw_library_fn (name
, type
)
6951 tree fn
= push_library_fn (name
, type
);
6952 TREE_THIS_VOLATILE (fn
) = 1;
6953 TREE_NOTHROW (fn
) = 0;
6957 /* Apply default attributes to a function, if a system function with default
6961 cxx_insert_default_attributes (decl
)
6964 if (!DECL_EXTERN_C_FUNCTION_P (decl
))
6966 if (!TREE_PUBLIC (decl
))
6968 c_common_insert_default_attributes (decl
);
6971 /* When we call finish_struct for an anonymous union, we create
6972 default copy constructors and such. But, an anonymous union
6973 shouldn't have such things; this function undoes the damage to the
6974 anonymous union type T.
6976 (The reason that we create the synthesized methods is that we don't
6977 distinguish `union { int i; }' from `typedef union { int i; } U'.
6978 The first is an anonymous union; the second is just an ordinary
6982 fixup_anonymous_aggr (t
)
6987 /* Wipe out memory of synthesized methods */
6988 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6989 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6990 TYPE_HAS_INIT_REF (t
) = 0;
6991 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6992 TYPE_HAS_ASSIGN_REF (t
) = 0;
6993 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6995 /* Splice the implicitly generated functions out of the TYPE_METHODS
6997 q
= &TYPE_METHODS (t
);
7000 if (DECL_ARTIFICIAL (*q
))
7001 *q
= TREE_CHAIN (*q
);
7003 q
= &TREE_CHAIN (*q
);
7006 /* ISO C++ 9.5.3. Anonymous unions may not have function members. */
7007 if (TYPE_METHODS (t
))
7008 cp_error_at ("an anonymous union cannot have function members", t
);
7010 /* Anonymous aggregates cannot have fields with ctors, dtors or complex
7011 assignment operators (because they cannot have these methods themselves).
7012 For anonymous unions this is already checked because they are not allowed
7013 in any union, otherwise we have to check it. */
7014 if (TREE_CODE (t
) != UNION_TYPE
)
7018 for (field
= TYPE_FIELDS (t
); field
; field
= TREE_CHAIN (field
))
7019 if (TREE_CODE (field
) == FIELD_DECL
)
7021 type
= TREE_TYPE (field
);
7022 if (CLASS_TYPE_P (type
))
7024 if (TYPE_NEEDS_CONSTRUCTING (type
))
7025 cp_error_at ("member %#D' with constructor not allowed in anonymous aggregate",
7027 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7028 cp_error_at ("member %#D' with destructor not allowed in anonymous aggregate",
7030 if (TYPE_HAS_COMPLEX_ASSIGN_REF (type
))
7031 cp_error_at ("member %#D' with copy assignment operator not allowed in anonymous aggregate",
7038 /* Make sure that a declaration with no declarator is well-formed, i.e.
7039 just defines a tagged type or anonymous union.
7041 Returns the type defined, if any. */
7044 check_tag_decl (declspecs
)
7049 int saw_typedef
= 0;
7050 tree ob_modifier
= NULL_TREE
;
7052 register tree t
= NULL_TREE
;
7054 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
7056 register tree value
= TREE_VALUE (link
);
7059 || TREE_CODE (value
) == TYPE_DECL
7060 || (TREE_CODE (value
) == IDENTIFIER_NODE
7061 && IDENTIFIER_GLOBAL_VALUE (value
)
7062 && TREE_CODE (IDENTIFIER_GLOBAL_VALUE (value
)) == TYPE_DECL
))
7066 if (found_type
== 2 && TREE_CODE (value
) == IDENTIFIER_NODE
)
7068 if (! in_system_header
)
7069 pedwarn ("redeclaration of C++ built-in type `%T'", value
);
7074 && ((TREE_CODE (value
) != TYPENAME_TYPE
&& IS_AGGR_TYPE (value
))
7075 || TREE_CODE (value
) == ENUMERAL_TYPE
))
7077 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
7081 else if (value
== ridpointers
[(int) RID_TYPEDEF
])
7083 else if (value
== ridpointers
[(int) RID_FRIEND
])
7085 if (current_class_type
== NULL_TREE
7086 || current_scope () != current_class_type
)
7087 ob_modifier
= value
;
7091 else if (value
== ridpointers
[(int) RID_STATIC
]
7092 || value
== ridpointers
[(int) RID_EXTERN
]
7093 || value
== ridpointers
[(int) RID_AUTO
]
7094 || value
== ridpointers
[(int) RID_REGISTER
]
7095 || value
== ridpointers
[(int) RID_INLINE
]
7096 || value
== ridpointers
[(int) RID_VIRTUAL
]
7097 || value
== ridpointers
[(int) RID_CONST
]
7098 || value
== ridpointers
[(int) RID_VOLATILE
]
7099 || value
== ridpointers
[(int) RID_EXPLICIT
]
7100 || value
== ridpointers
[(int) RID_THREAD
])
7101 ob_modifier
= value
;
7105 error ("multiple types in one declaration");
7107 if (t
== NULL_TREE
&& ! saw_friend
)
7108 pedwarn ("declaration does not declare anything");
7110 /* Check for an anonymous union. */
7111 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
7112 && TYPE_ANONYMOUS_P (t
))
7114 /* 7/3 In a simple-declaration, the optional init-declarator-list
7115 can be omitted only when declaring a class (clause 9) or
7116 enumeration (7.2), that is, when the decl-specifier-seq contains
7117 either a class-specifier, an elaborated-type-specifier with
7118 a class-key (9.1), or an enum-specifier. In these cases and
7119 whenever a class-specifier or enum-specifier is present in the
7120 decl-specifier-seq, the identifiers in these specifiers are among
7121 the names being declared by the declaration (as class-name,
7122 enum-names, or enumerators, depending on the syntax). In such
7123 cases, and except for the declaration of an unnamed bit-field (9.6),
7124 the decl-specifier-seq shall introduce one or more names into the
7125 program, or shall redeclare a name introduced by a previous
7126 declaration. [Example:
7127 enum { }; // ill-formed
7128 typedef class { }; // ill-formed
7132 error ("missing type-name in typedef-declaration");
7135 /* Anonymous unions are objects, so they can have specifiers. */;
7136 SET_ANON_AGGR_TYPE_P (t
);
7138 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
7139 pedwarn ("ISO C++ prohibits anonymous structs");
7142 else if (ob_modifier
)
7144 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
7145 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
7146 error ("`%D' can only be specified for functions", ob_modifier
);
7147 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
7148 error ("`%D' can only be specified inside a class", ob_modifier
);
7149 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
7150 error ("`%D' can only be specified for constructors",
7153 error ("`%D' can only be specified for objects and functions",
7160 /* Called when a declaration is seen that contains no names to declare.
7161 If its type is a reference to a structure, union or enum inherited
7162 from a containing scope, shadow that tag name for the current scope
7163 with a forward reference.
7164 If its type defines a new named structure or union
7165 or defines an enum, it is valid but we need not do anything here.
7166 Otherwise, it is an error.
7168 C++: may have to grok the declspecs to learn about static,
7169 complain for anonymous unions. */
7172 shadow_tag (declspecs
)
7175 tree t
= check_tag_decl (declspecs
);
7178 maybe_process_partial_specialization (t
);
7180 /* This is where the variables in an anonymous union are
7181 declared. An anonymous union declaration looks like:
7183 because there is no declarator after the union, the parser
7184 sends that declaration here. */
7185 if (t
&& ANON_AGGR_TYPE_P (t
))
7187 fixup_anonymous_aggr (t
);
7189 if (TYPE_FIELDS (t
))
7191 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
7193 finish_anon_union (decl
);
7198 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
7201 groktypename (typename
)
7206 if (TREE_CODE (typename
) != TREE_LIST
)
7208 split_specs_attrs (TREE_PURPOSE (typename
), &specs
, &attrs
);
7209 type
= grokdeclarator (TREE_VALUE (typename
), specs
,
7210 TYPENAME
, 0, &attrs
);
7212 cplus_decl_attributes (&type
, attrs
, 0);
7216 /* Decode a declarator in an ordinary declaration or data definition.
7217 This is called as soon as the type information and variable name
7218 have been parsed, before parsing the initializer if any.
7219 Here we create the ..._DECL node, fill in its type,
7220 and put it on the list of decls for the current context.
7221 The ..._DECL node is returned as the value.
7223 Exception: for arrays where the length is not specified,
7224 the type is left null, to be filled in by `cp_finish_decl'.
7226 Function definitions do not come here; they go to start_function
7227 instead. However, external and forward declarations of functions
7228 do go through here. Structure field declarations are done by
7229 grokfield and not through here. */
7232 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
7233 tree declarator
, declspecs
;
7235 tree attributes
, prefix_attributes
;
7238 register tree type
, tem
;
7242 /* See code below that used this. */
7243 int init_written
= initialized
;
7246 /* This should only be done once on the top most decl. */
7247 if (have_extern_spec
)
7249 declspecs
= tree_cons (NULL_TREE
, get_identifier ("extern"),
7251 have_extern_spec
= false;
7254 /* An object declared as __attribute__((deprecated)) suppresses
7255 warnings of uses of other deprecated items. */
7256 if (lookup_attribute ("deprecated", attributes
))
7257 deprecated_state
= DEPRECATED_SUPPRESS
;
7259 attributes
= chainon (attributes
, prefix_attributes
);
7261 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
7264 deprecated_state
= DEPRECATED_NORMAL
;
7266 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
7269 type
= TREE_TYPE (decl
);
7271 if (type
== error_mark_node
)
7274 context
= DECL_CONTEXT (decl
);
7276 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
7277 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
7279 /* When parsing the initializer, lookup should use the object's
7281 push_decl_namespace (context
);
7284 /* We are only interested in class contexts, later. */
7285 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
7286 context
= NULL_TREE
;
7289 /* Is it valid for this decl to have an initializer at all?
7290 If not, set INITIALIZED to zero, which will indirectly
7291 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7292 switch (TREE_CODE (decl
))
7295 error ("typedef `%D' is initialized", decl
);
7300 error ("function `%#D' is initialized like a variable", decl
);
7310 if (! toplevel_bindings_p ()
7311 && DECL_EXTERNAL (decl
))
7312 warning ("declaration of `%#D' has `extern' and is initialized",
7314 DECL_EXTERNAL (decl
) = 0;
7315 if (toplevel_bindings_p ())
7316 TREE_STATIC (decl
) = 1;
7318 /* Tell `pushdecl' this is an initialized decl
7319 even though we don't yet have the initializer expression.
7320 Also tell `cp_finish_decl' it may store the real initializer. */
7321 DECL_INITIAL (decl
) = error_mark_node
;
7324 /* Set attributes here so if duplicate decl, will have proper attributes. */
7325 cplus_decl_attributes (&decl
, attributes
, 0);
7327 /* If #pragma weak was used, mark the decl weak now. */
7328 if (current_binding_level
== global_binding_level
)
7329 maybe_apply_pragma_weak (decl
);
7331 if (TREE_CODE (decl
) == FUNCTION_DECL
7332 && DECL_DECLARED_INLINE_P (decl
)
7333 && DECL_UNINLINABLE (decl
)
7334 && lookup_attribute ("noinline", DECL_ATTRIBUTES (decl
)))
7335 warning_with_decl (decl
,
7336 "inline function `%s' given attribute noinline");
7338 if (context
&& COMPLETE_TYPE_P (complete_type (context
)))
7340 push_nested_class (context
, 2);
7342 if (TREE_CODE (decl
) == VAR_DECL
)
7344 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
7345 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
7346 error ("`%#D' is not a static member of `%#T'", decl
, context
);
7349 if (DECL_CONTEXT (field
) != context
)
7351 pedwarn ("ISO C++ does not permit `%T::%D' to be defined as `%T::%D'",
7352 DECL_CONTEXT (field
), DECL_NAME (decl
),
7353 context
, DECL_NAME (decl
));
7354 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
7356 /* Static data member are tricky; an in-class initialization
7357 still doesn't provide a definition, so the in-class
7358 declaration will have DECL_EXTERNAL set, but will have an
7359 initialization. Thus, duplicate_decls won't warn
7360 about this situation, and so we check here. */
7361 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
7362 error ("duplicate initialization of %D", decl
);
7363 if (duplicate_decls (decl
, field
))
7369 tree field
= check_classfn (context
, decl
);
7370 if (field
&& duplicate_decls (decl
, field
))
7374 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
7375 DECL_IN_AGGR_P (decl
) = 0;
7376 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
7377 || CLASSTYPE_TEMPLATE_INSTANTIATION (context
))
7379 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
7380 /* [temp.expl.spec] An explicit specialization of a static data
7381 member of a template is a definition if the declaration
7382 includes an initializer; otherwise, it is a declaration.
7384 We check for processing_specialization so this only applies
7385 to the new specialization syntax. */
7386 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
7387 DECL_EXTERNAL (decl
) = 1;
7390 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
7391 pedwarn ("declaration of `%#D' outside of class is not definition",
7395 /* Enter this declaration into the symbol table. */
7396 tem
= maybe_push_decl (decl
);
7398 if (processing_template_decl
)
7399 tem
= push_template_decl (tem
);
7401 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7402 /* Tell the back-end to use or not use .common as appropriate. If we say
7403 -fconserve-space, we want this to save .data space, at the expense of
7404 wrong semantics. If we say -fno-conserve-space, we want this to
7405 produce errors about redefs; to do this we force variables into the
7407 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
7410 if (! processing_template_decl
)
7420 tree type
= TREE_TYPE (decl
);
7421 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
7423 if (type
== error_mark_node
)
7426 maybe_push_cleanup_level (type
);
7429 /* Is it valid for this decl to have an initializer at all?
7430 If not, set INITIALIZED to zero, which will indirectly
7431 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7433 /* Don't allow initializations for incomplete types except for
7434 arrays which might be completed by the initialization. */
7435 if (COMPLETE_TYPE_P (complete_type (type
)))
7436 ; /* A complete type is ok. */
7437 else if (TREE_CODE (type
) != ARRAY_TYPE
)
7439 error ("variable `%#D' has initializer but incomplete type",
7442 type
= TREE_TYPE (decl
) = error_mark_node
;
7444 else if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (type
))))
7446 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
7447 error ("elements of array `%#D' have incomplete type", decl
);
7448 /* else we already gave an error in start_decl. */
7454 && TREE_CODE (decl
) != TYPE_DECL
7455 && TREE_CODE (decl
) != TEMPLATE_DECL
7456 && type
!= error_mark_node
7457 && IS_AGGR_TYPE (type
)
7458 && ! DECL_EXTERNAL (decl
))
7460 if ((! processing_template_decl
|| ! uses_template_parms (type
))
7461 && !COMPLETE_TYPE_P (complete_type (type
)))
7463 error ("aggregate `%#D' has incomplete type and cannot be defined",
7465 /* Change the type so that assemble_variable will give
7466 DECL an rtl we can live with: (mem (const_int 0)). */
7467 type
= TREE_TYPE (decl
) = error_mark_node
;
7471 /* If any base type in the hierarchy of TYPE needs a constructor,
7472 then we set initialized to 1. This way any nodes which are
7473 created for the purposes of initializing this aggregate
7474 will live as long as it does. This is necessary for global
7475 aggregates which do not have their initializers processed until
7476 the end of the file. */
7477 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
7482 DECL_INITIAL (decl
) = NULL_TREE
;
7485 /* Handle initialization of references.
7486 These three arguments are from `cp_finish_decl', and have the
7487 same meaning here that they do there.
7489 Quotes on semantics can be found in ARM 8.4.3. */
7492 grok_reference_init (decl
, type
, init
)
7493 tree decl
, type
, init
;
7497 if (init
== NULL_TREE
)
7499 if ((DECL_LANG_SPECIFIC (decl
) == 0
7500 || DECL_IN_AGGR_P (decl
) == 0)
7501 && ! DECL_THIS_EXTERN (decl
))
7502 error ("`%D' declared as reference but not initialized", decl
);
7506 if (init
== error_mark_node
)
7509 if (TREE_CODE (init
) == CONSTRUCTOR
)
7511 error ("ISO C++ forbids use of initializer list to initialize reference `%D'", decl
);
7515 if (TREE_CODE (init
) == TREE_LIST
)
7516 init
= build_compound_expr (init
);
7518 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
7519 init
= convert_from_reference (init
);
7521 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
7522 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
7524 /* Note: default conversion is only called in very special cases. */
7525 init
= default_conversion (init
);
7528 /* Convert INIT to the reference type TYPE. This may involve the
7529 creation of a temporary, whose lifetime must be the same as that
7530 of the reference. If so, a DECL_STMT for the temporary will be
7531 added just after the DECL_STMT for DECL. That's why we don't set
7532 DECL_INITIAL for local references (instead assigning to them
7533 explicitly); we need to allow the temporary to be initialized
7535 tmp
= convert_to_reference
7536 (type
, init
, CONV_IMPLICIT
,
7537 LOOKUP_ONLYCONVERTING
|LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
,
7540 if (tmp
== error_mark_node
)
7542 else if (tmp
== NULL_TREE
)
7544 error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7548 if (TREE_STATIC (decl
) && !TREE_CONSTANT (tmp
))
7551 DECL_INITIAL (decl
) = tmp
;
7556 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7557 array until we finish parsing the initializer. If that's the
7558 situation we're in, update DECL accordingly. */
7561 maybe_deduce_size_from_array_init (decl
, init
)
7565 tree type
= TREE_TYPE (decl
);
7567 if (TREE_CODE (type
) == ARRAY_TYPE
7568 && TYPE_DOMAIN (type
) == NULL_TREE
7569 && TREE_CODE (decl
) != TYPE_DECL
)
7571 /* do_default is really a C-ism to deal with tentative definitions.
7572 But let's leave it here to ease the eventual merge. */
7573 int do_default
= !DECL_EXTERNAL (decl
);
7574 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7575 int failure
= complete_array_type (type
, initializer
, do_default
);
7578 error ("initializer fails to determine size of `%D'", decl
);
7583 error ("array size missing in `%D'", decl
);
7584 /* If a `static' var's size isn't known, make it extern as
7585 well as static, so it does not get allocated. If it's not
7586 `static', then don't mark it extern; finish_incomplete_decl
7587 will give it a default size and it will get allocated. */
7588 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7589 DECL_EXTERNAL (decl
) = 1;
7592 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7593 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7595 error ("zero-size array `%D'", decl
);
7597 layout_decl (decl
, 0);
7601 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7602 any appropriate error messages regarding the layout. */
7605 layout_var_decl (decl
)
7608 tree type
= TREE_TYPE (decl
);
7610 tree ttype
= target_type (type
);
7613 /* If we haven't already layed out this declaration, do so now.
7614 Note that we must not call complete type for an external object
7615 because it's type might involve templates that we are not
7616 supposed to isntantiate yet. (And it's perfectly valid to say
7617 `extern X x' for some incomplete type `X'.) */
7618 if (!DECL_EXTERNAL (decl
))
7619 complete_type (type
);
7620 if (!DECL_SIZE (decl
) && COMPLETE_TYPE_P (type
))
7621 layout_decl (decl
, 0);
7623 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7625 /* An automatic variable with an incomplete type: that is an error.
7626 Don't talk about array types here, since we took care of that
7627 message in grokdeclarator. */
7628 error ("storage size of `%D' isn't known", decl
);
7629 TREE_TYPE (decl
) = error_mark_node
;
7632 /* Keep this code around in case we later want to control debug info
7633 based on whether a type is "used". (jason 1999-11-11) */
7635 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7636 /* Let debugger know it should output info for this type. */
7637 note_debug_info_needed (ttype
);
7639 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7640 note_debug_info_needed (DECL_CONTEXT (decl
));
7643 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7644 && DECL_SIZE (decl
) != NULL_TREE
7645 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7647 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7648 constant_expression_warning (DECL_SIZE (decl
));
7650 error ("storage size of `%D' isn't constant", decl
);
7653 if (TREE_STATIC (decl
)
7654 && !DECL_ARTIFICIAL (decl
)
7655 && current_function_decl
7656 && DECL_CONTEXT (decl
) == current_function_decl
)
7657 push_local_name (decl
);
7660 /* If a local static variable is declared in an inline function, or if
7661 we have a weak definition, we must endeavor to create only one
7662 instance of the variable at link-time. */
7665 maybe_commonize_var (decl
)
7668 /* Static data in a function with comdat linkage also has comdat
7670 if (TREE_STATIC (decl
)
7671 /* Don't mess with __FUNCTION__. */
7672 && ! DECL_ARTIFICIAL (decl
)
7673 && current_function_decl
7674 && DECL_CONTEXT (decl
) == current_function_decl
7675 && (DECL_DECLARED_INLINE_P (current_function_decl
)
7676 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7677 && TREE_PUBLIC (current_function_decl
))
7679 /* If flag_weak, we don't need to mess with this, as we can just
7680 make the function weak, and let it refer to its unique local
7681 copy. This works because we don't allow the function to be
7685 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7687 TREE_PUBLIC (decl
) = 1;
7688 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7690 else if (DECL_INITIAL (decl
) == NULL_TREE
7691 || DECL_INITIAL (decl
) == error_mark_node
)
7693 TREE_PUBLIC (decl
) = 1;
7694 DECL_COMMON (decl
) = 1;
7696 /* else we lose. We can only do this if we can use common,
7697 which we can't if it has been initialized. */
7699 if (!TREE_PUBLIC (decl
))
7701 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7702 cp_warning_at (" you can work around this by removing the initializer", decl
);
7706 comdat_linkage (decl
);
7708 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7709 /* Set it up again; we might have set DECL_INITIAL since the last
7711 comdat_linkage (decl
);
7714 /* Issue an error message if DECL is an uninitialized const variable. */
7717 check_for_uninitialized_const_var (decl
)
7720 tree type
= TREE_TYPE (decl
);
7722 /* ``Unless explicitly declared extern, a const object does not have
7723 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7725 if (TREE_CODE (decl
) == VAR_DECL
7726 && TREE_CODE (type
) != REFERENCE_TYPE
7727 && CP_TYPE_CONST_P (type
)
7728 && !TYPE_NEEDS_CONSTRUCTING (type
)
7729 && !DECL_INITIAL (decl
))
7730 error ("uninitialized const `%D'", decl
);
7733 /* FIELD is a FIELD_DECL or NULL. In the former case, the value
7734 returned is the next FIELD_DECL (possibly FIELD itself) that can be
7735 initialized. If there are no more such fields, the return value
7739 next_initializable_field (tree field
)
7742 && (TREE_CODE (field
) != FIELD_DECL
7743 || (DECL_C_BIT_FIELD (field
) && !DECL_NAME (field
))
7744 || DECL_ARTIFICIAL (field
)))
7745 field
= TREE_CHAIN (field
);
7750 /* Undo the brace-elision allowed by [dcl.init.aggr] in a
7751 brace-enclosed aggregate initializer.
7753 *INITP is one of a list of initializers describing a brace-enclosed
7754 initializer for an entity of the indicated aggregate TYPE. It may
7755 not presently match the shape of the TYPE; for example:
7757 struct S { int a; int b; };
7758 struct S a[] = { 1, 2, 3, 4 };
7760 Here *INITP will point to TREE_LIST of four elements, rather than a
7761 list of two elements, each itself a list of two elements. This
7762 routine transforms INIT from the former form into the latter. The
7763 revised initializer is returned. */
7766 reshape_init (tree type
, tree
*initp
)
7770 tree old_init_value
;
7772 bool brace_enclosed_p
;
7775 old_init_value
= (TREE_CODE (*initp
) == TREE_LIST
7776 ? TREE_VALUE (*initp
) : old_init
);
7778 /* If the initializer is brace-enclosed, pull initializers from the
7779 enclosed elements. Advance past the brace-enclosed initializer
7781 if (TREE_CODE (old_init_value
) == CONSTRUCTOR
7782 && TREE_HAS_CONSTRUCTOR (old_init_value
))
7784 *initp
= TREE_CHAIN (old_init
);
7785 TREE_CHAIN (old_init
) = NULL_TREE
;
7786 inits
= CONSTRUCTOR_ELTS (old_init_value
);
7788 brace_enclosed_p
= true;
7793 brace_enclosed_p
= false;
7796 /* A non-aggregate type is always initialized with a single
7798 if (!CP_AGGREGATE_TYPE_P (type
))
7800 *initp
= TREE_CHAIN (old_init
);
7801 TREE_CHAIN (old_init
) = NULL_TREE
;
7802 /* It is invalid to initialize a non-aggregate type with a
7803 brace-enclosed initializer. */
7804 if (brace_enclosed_p
)
7806 error ("brace-enclosed initializer used to initialize `%T'",
7808 if (TREE_CODE (old_init
) == TREE_LIST
)
7809 TREE_VALUE (old_init
) = error_mark_node
;
7811 old_init
= error_mark_node
;
7819 All implicit type conversions (clause _conv_) are considered when
7820 initializing the aggregate member with an initializer from an
7821 initializer-list. If the initializer can initialize a member,
7822 the member is initialized. Otherwise, if the member is itself a
7823 non-empty subaggregate, brace elision is assumed and the
7824 initializer is considered for the initialization of the first
7825 member of the subaggregate. */
7826 if (CLASS_TYPE_P (type
)
7827 && !brace_enclosed_p
7828 && can_convert_arg (type
, TREE_TYPE (old_init_value
), old_init_value
))
7830 *initp
= TREE_CHAIN (old_init
);
7831 TREE_CHAIN (old_init
) = NULL_TREE
;
7835 if (TREE_CODE (old_init
) == STRING_CST
7836 && TREE_CODE (type
) == ARRAY_TYPE
7837 && char_type_p (TREE_TYPE (type
)))
7839 /* [dcl.init.string]
7841 A char array (whether plain char, signed char, or unsigned char)
7842 can be initialized by a string-literal (optionally enclosed in
7843 braces); a wchar_t array can be initialized by a wide
7844 string-literal (optionally enclosed in braces). */
7845 new_init
= old_init
;
7846 /* Move past the initializer. */
7847 *initp
= TREE_CHAIN (old_init
);
7848 TREE_CHAIN (old_init
) = NULL_TREE
;
7852 /* Build a CONSTRUCTOR to hold the contents of the aggregate. */
7853 new_init
= build (CONSTRUCTOR
, type
, NULL_TREE
, NULL_TREE
);
7854 TREE_HAS_CONSTRUCTOR (new_init
) = 1;
7856 if (CLASS_TYPE_P (type
))
7860 field
= next_initializable_field (TYPE_FIELDS (type
));
7866 An initializer for an aggregate member that is an
7867 empty class shall have the form of an empty
7868 initializer-list {}. */
7869 if (!brace_enclosed_p
)
7870 error ("initializer for `%T' must be brace-enclosed",
7875 /* Loop through the initializable fields, gathering
7877 while (*initp
&& field
)
7881 field_init
= reshape_init (TREE_TYPE (field
), initp
);
7882 TREE_CHAIN (field_init
) = CONSTRUCTOR_ELTS (new_init
);
7883 CONSTRUCTOR_ELTS (new_init
) = field_init
;
7886 When a union is initialized with a brace-enclosed
7887 initializer, the braces shall only contain an
7888 initializer for the first member of the union. */
7889 if (TREE_CODE (type
) == UNION_TYPE
)
7891 if (TREE_PURPOSE (field_init
))
7892 field
= TREE_PURPOSE (field_init
);
7893 field
= next_initializable_field (TREE_CHAIN (field
));
7897 else if (TREE_CODE (type
) == ARRAY_TYPE
)
7902 /* If the bound of the array is known, take no more initializers
7903 than are allowed. */
7904 max_index
= (TYPE_DOMAIN (type
)
7905 ? array_type_nelts (type
) : NULL_TREE
);
7906 /* Loop through the array elements, gathering initializers. */
7907 for (index
= size_zero_node
;
7908 *initp
&& (!max_index
|| !tree_int_cst_lt (max_index
, index
));
7909 index
= size_binop (PLUS_EXPR
, index
, size_one_node
))
7913 element_init
= reshape_init (TREE_TYPE (type
), initp
);
7914 TREE_CHAIN (element_init
) = CONSTRUCTOR_ELTS (new_init
);
7915 CONSTRUCTOR_ELTS (new_init
) = element_init
;
7916 if (TREE_PURPOSE (element_init
))
7917 index
= TREE_PURPOSE (element_init
);
7923 /* The initializers were placed in reverse order in the
7925 CONSTRUCTOR_ELTS (new_init
) = nreverse (CONSTRUCTOR_ELTS (new_init
));
7927 if (TREE_CODE (old_init
) == TREE_LIST
)
7928 new_init
= build_tree_list (TREE_PURPOSE (old_init
), new_init
);
7931 /* If this was a brace-enclosed initializer and all of the
7932 initializers were not used up, there is a problem. */
7933 if (brace_enclosed_p
&& *initp
)
7934 error ("too many initializers for `%T'", type
);
7939 /* Verify INIT (the initializer for DECL), and record the
7940 initialization in DECL_INITIAL, if appropriate.
7942 If the return value is non-NULL, it is an expression that must be
7943 evaluated dynamically to initialize DECL. */
7946 check_initializer (tree decl
, tree init
, int flags
)
7948 tree type
= TREE_TYPE (decl
);
7950 /* If `start_decl' didn't like having an initialization, ignore it now. */
7951 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7954 /* If an initializer is present, DECL_INITIAL has been
7955 error_mark_node, to indicate that an as-of-yet unevaluated
7956 initialization will occur. From now on, DECL_INITIAL reflects
7957 the static initialization -- if any -- of DECL. */
7958 DECL_INITIAL (decl
) = NULL_TREE
;
7960 /* Check the initializer. */
7963 /* Things that are going to be initialized need to have complete
7965 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7967 if (type
== error_mark_node
)
7968 /* We will have already complained. */
7970 else if (COMPLETE_TYPE_P (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7972 error ("variable-sized object `%D' may not be initialized", decl
);
7975 else if (TREE_CODE (type
) == ARRAY_TYPE
7976 && !COMPLETE_TYPE_P (complete_type (TREE_TYPE (type
))))
7978 error ("elements of array `%#D' have incomplete type", decl
);
7981 else if (TREE_CODE (type
) != ARRAY_TYPE
&& !COMPLETE_TYPE_P (type
))
7983 error ("`%D' has incomplete type", decl
);
7984 TREE_TYPE (decl
) = error_mark_node
;
7989 if (TREE_CODE (decl
) == CONST_DECL
)
7991 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7993 DECL_INITIAL (decl
) = init
;
7995 my_friendly_assert (init
!= NULL_TREE
, 149);
7998 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7999 init
= grok_reference_init (decl
, type
, init
);
8002 if (TREE_CODE (init
) == CONSTRUCTOR
&& TREE_HAS_CONSTRUCTOR (init
))
8003 init
= reshape_init (type
, &init
);
8005 /* If DECL has an array type without a specific bound, deduce the
8006 array size from the initializer. */
8007 maybe_deduce_size_from_array_init (decl
, init
);
8008 type
= TREE_TYPE (decl
);
8009 if (TREE_CODE (init
) == CONSTRUCTOR
&& TREE_HAS_CONSTRUCTOR (init
))
8010 TREE_TYPE (init
) = type
;
8012 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
8014 if (TREE_CODE (type
) == ARRAY_TYPE
)
8015 goto initialize_aggr
;
8016 else if (TREE_CODE (init
) == CONSTRUCTOR
8017 && TREE_HAS_CONSTRUCTOR (init
))
8019 if (TYPE_NON_AGGREGATE_CLASS (type
))
8021 error ("`%D' must be initialized by constructor, not by `{...}'",
8023 init
= error_mark_node
;
8026 goto dont_use_constructor
;
8030 int saved_stmts_are_full_exprs_p
;
8033 saved_stmts_are_full_exprs_p
= 0;
8034 if (building_stmt_tree ())
8036 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p ();
8037 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
8039 init
= build_aggr_init (decl
, init
, flags
);
8040 if (building_stmt_tree ())
8041 current_stmt_tree ()->stmts_are_full_exprs_p
=
8042 saved_stmts_are_full_exprs_p
;
8048 dont_use_constructor
:
8049 if (TREE_CODE (init
) != TREE_VEC
)
8050 init
= store_init_value (decl
, init
);
8053 else if (DECL_EXTERNAL (decl
))
8055 else if (TYPE_P (type
) && TYPE_NEEDS_CONSTRUCTING (type
))
8056 goto initialize_aggr
;
8057 else if (IS_AGGR_TYPE (type
))
8059 tree core_type
= strip_array_types (type
);
8061 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
8062 error ("structure `%D' with uninitialized const members", decl
);
8063 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
8064 error ("structure `%D' with uninitialized reference members",
8067 check_for_uninitialized_const_var (decl
);
8070 check_for_uninitialized_const_var (decl
);
8072 if (init
&& init
!= error_mark_node
)
8073 init
= build (INIT_EXPR
, type
, decl
, init
);
8078 /* If DECL is not a local variable, give it RTL. */
8081 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
8084 const char *asmspec
;
8086 int toplev
= toplevel_bindings_p ();
8089 /* Handle non-variables up front. */
8090 if (TREE_CODE (decl
) != VAR_DECL
)
8092 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
8096 /* If we see a class member here, it should be a static data
8098 if (DECL_LANG_SPECIFIC (decl
) && DECL_IN_AGGR_P (decl
))
8100 my_friendly_assert (TREE_STATIC (decl
), 19990828);
8101 /* An in-class declaration of a static data member should be
8102 external; it is only a declaration, and not a definition. */
8103 if (init
== NULL_TREE
)
8104 my_friendly_assert (DECL_EXTERNAL (decl
), 20000723);
8107 /* Set the DECL_ASSEMBLER_NAME for the variable. */
8110 SET_DECL_ASSEMBLER_NAME (decl
, get_identifier (asmspec
));
8111 /* The `register' keyword, when used together with an
8112 asm-specification, indicates that the variable should be
8113 placed in a particular register. */
8114 if (DECL_REGISTER (decl
))
8115 DECL_C_HARD_REGISTER (decl
) = 1;
8118 /* We don't create any RTL for local variables. */
8119 if (DECL_FUNCTION_SCOPE_P (decl
) && !TREE_STATIC (decl
))
8122 /* We defer emission of local statics until the corresponding
8123 DECL_STMT is expanded. */
8124 defer_p
= DECL_FUNCTION_SCOPE_P (decl
) || DECL_VIRTUAL_P (decl
);
8126 /* We try to defer namespace-scope static constants so that they are
8127 not emitted into the object file unnecessarily. */
8128 if (!DECL_VIRTUAL_P (decl
)
8129 && TREE_READONLY (decl
)
8130 && DECL_INITIAL (decl
) != NULL_TREE
8131 && DECL_INITIAL (decl
) != error_mark_node
8132 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
))
8134 && !TREE_PUBLIC (decl
))
8136 /* Fool with the linkage of static consts according to #pragma
8138 if (!interface_unknown
&& !TREE_PUBLIC (decl
))
8140 TREE_PUBLIC (decl
) = 1;
8141 DECL_EXTERNAL (decl
) = interface_only
;
8146 /* Likewise for template instantiations. */
8147 else if (DECL_COMDAT (decl
))
8150 /* If we're deferring the variable, we only need to make RTL if
8151 there's an ASMSPEC. Otherwise, we'll lazily create it later when
8152 we need it. (There's no way to lazily create RTL for things that
8153 have assembly specs because the information about the specifier
8154 isn't stored in the tree, yet) */
8155 if (defer_p
&& asmspec
)
8156 make_decl_rtl (decl
, asmspec
);
8157 /* If we're not deferring, go ahead and assemble the variable. */
8159 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
8162 /* The old ARM scoping rules injected variables declared in the
8163 initialization statement of a for-statement into the surrounding
8164 scope. We support this usage, in order to be backward-compatible.
8165 DECL is a just-declared VAR_DECL; if necessary inject its
8166 declaration into the surrounding scope. */
8169 maybe_inject_for_scope_var (decl
)
8172 if (!DECL_NAME (decl
))
8175 if (current_binding_level
->is_for_scope
)
8177 struct cp_binding_level
*outer
8178 = current_binding_level
->level_chain
;
8180 /* Check to see if the same name is already bound at the outer
8181 level, either because it was directly declared, or because a
8182 dead for-decl got preserved. In either case, the code would
8183 not have been valid under the ARM scope rules, so clear
8184 is_for_scope for the current_binding_level.
8186 Otherwise, we need to preserve the temp slot for decl to last
8187 into the outer binding level. */
8190 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
8192 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
8193 && (TREE_CODE (BINDING_VALUE (outer_binding
))
8195 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
8197 BINDING_VALUE (outer_binding
)
8198 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
8199 current_binding_level
->is_for_scope
= 0;
8201 else if (DECL_IN_MEMORY_P (decl
))
8202 preserve_temp_slots (DECL_RTL (decl
));
8206 /* Generate code to initialize DECL (a local variable). */
8209 initialize_local_var (decl
, init
)
8213 tree type
= TREE_TYPE (decl
);
8215 my_friendly_assert (TREE_CODE (decl
) == VAR_DECL
8216 || TREE_CODE (decl
) == RESULT_DECL
,
8218 my_friendly_assert (!TREE_STATIC (decl
), 20021010);
8220 if (DECL_SIZE (decl
) == NULL_TREE
)
8222 /* If we used it already as memory, it must stay in memory. */
8223 DECL_INITIAL (decl
) = NULL_TREE
;
8224 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
8227 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
8231 /* Compute and store the initial value. */
8232 already_used
= TREE_USED (decl
) || TREE_USED (type
);
8234 /* Perform the initialization. */
8237 int saved_stmts_are_full_exprs_p
;
8239 my_friendly_assert (building_stmt_tree (), 20000906);
8240 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p ();
8241 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
8242 finish_expr_stmt (init
);
8243 current_stmt_tree ()->stmts_are_full_exprs_p
=
8244 saved_stmts_are_full_exprs_p
;
8247 /* Set this to 0 so we can tell whether an aggregate which was
8248 initialized was ever used. Don't do this if it has a
8249 destructor, so we don't complain about the 'resource
8250 allocation is initialization' idiom. Now set
8251 attribute((unused)) on types so decls of that type will be
8252 marked used. (see TREE_USED, above.) */
8253 if (TYPE_NEEDS_CONSTRUCTING (type
)
8255 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type
)
8256 && DECL_NAME (decl
))
8257 TREE_USED (decl
) = 0;
8258 else if (already_used
)
8259 TREE_USED (decl
) = 1;
8262 /* Generate a cleanup, if necessary. */
8263 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
8267 /* Compute the cleanup. */
8268 cleanup
= cxx_maybe_build_cleanup (decl
);
8270 /* Record the cleanup required for this declaration. */
8271 if (DECL_SIZE (decl
) && cleanup
)
8272 finish_decl_cleanup (decl
, cleanup
);
8276 /* Finish processing of a declaration;
8277 install its line number and initial value.
8278 If the length of an array type is not known before,
8279 it must be determined now, from the initial value, or it is an error.
8281 INIT holds the value of an initializer that should be allowed to escape
8284 FLAGS is LOOKUP_ONLYCONVERTING if the = init syntax was used, else 0
8285 if the (init) syntax was used. */
8288 cp_finish_decl (decl
, init
, asmspec_tree
, flags
)
8294 tree ttype
= NULL_TREE
;
8295 const char *asmspec
= NULL
;
8296 int was_readonly
= 0;
8301 error ("assignment (not initialization) in declaration");
8305 /* If a name was specified, get the string. */
8306 if (current_binding_level
== global_binding_level
)
8307 asmspec_tree
= maybe_apply_renaming_pragma (decl
, asmspec_tree
);
8309 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
8311 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
8313 error ("cannot initialize `%D' to namespace `%D'",
8318 if (current_class_type
8319 && CP_DECL_CONTEXT (decl
) == current_class_type
8320 && TYPE_BEING_DEFINED (current_class_type
)
8321 && (DECL_INITIAL (decl
) || init
))
8322 DECL_INITIALIZED_IN_CLASS_P (decl
) = 1;
8324 if (TREE_CODE (decl
) == VAR_DECL
8325 && DECL_CONTEXT (decl
)
8326 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
8327 && DECL_CONTEXT (decl
) != current_namespace
8330 /* Leave the namespace of the object. */
8331 pop_decl_namespace ();
8334 type
= TREE_TYPE (decl
);
8336 if (type
== error_mark_node
)
8339 if (TYPE_HAS_MUTABLE_P (type
))
8340 TREE_READONLY (decl
) = 0;
8342 if (processing_template_decl
)
8344 /* Add this declaration to the statement-tree. */
8345 if (at_function_scope_p ()
8346 && TREE_CODE (decl
) != RESULT_DECL
)
8347 add_decl_stmt (decl
);
8349 if (init
&& DECL_INITIAL (decl
))
8350 DECL_INITIAL (decl
) = init
;
8354 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
8355 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
8357 /* Take care of TYPE_DECLs up front. */
8358 if (TREE_CODE (decl
) == TYPE_DECL
)
8360 if (type
!= error_mark_node
8361 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
8363 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
8364 warning ("shadowing previous type declaration of `%#D'", decl
);
8365 set_identifier_type_value (DECL_NAME (decl
), type
);
8366 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
8369 /* If we have installed this as the canonical typedef for this
8370 type, and that type has not been defined yet, delay emitting
8371 the debug information for it, as we will emit it later. */
8372 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
8373 && !COMPLETE_TYPE_P (TREE_TYPE (decl
)))
8374 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
8376 rest_of_decl_compilation (decl
, NULL
,
8377 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
8381 if (TREE_CODE (decl
) != FUNCTION_DECL
)
8382 ttype
= target_type (type
);
8384 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
8385 && TYPE_NEEDS_CONSTRUCTING (type
))
8387 /* Currently, GNU C++ puts constants in text space, making them
8388 impossible to initialize. In the future, one would hope for
8389 an operating system which understood the difference between
8390 initialization and the running of a program. */
8392 TREE_READONLY (decl
) = 0;
8395 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
8397 /* This must override the asm specifier which was placed by
8398 grokclassfn. Lay this out fresh. */
8399 SET_DECL_RTL (TREE_TYPE (decl
), NULL_RTX
);
8400 SET_DECL_ASSEMBLER_NAME (decl
, get_identifier (asmspec
));
8401 make_decl_rtl (decl
, asmspec
);
8403 else if (TREE_CODE (decl
) == RESULT_DECL
)
8404 init
= check_initializer (decl
, init
, flags
);
8405 else if (TREE_CODE (decl
) == VAR_DECL
)
8407 /* Only PODs can have thread-local storage. Other types may require
8408 various kinds of non-trivial initialization. */
8409 if (DECL_THREAD_LOCAL (decl
) && !pod_type_p (TREE_TYPE (decl
)))
8410 error ("`%D' cannot be thread-local because it has non-POD type `%T'",
8411 decl
, TREE_TYPE (decl
));
8412 /* Convert the initializer to the type of DECL, if we have not
8413 already initialized DECL. */
8414 if (!DECL_INITIALIZED_P (decl
)
8415 /* If !DECL_EXTERNAL then DECL is being defined. In the
8416 case of a static data member initialized inside the
8417 class-specifier, there can be an initializer even if DECL
8418 is *not* defined. */
8419 && (!DECL_EXTERNAL (decl
) || init
))
8421 init
= check_initializer (decl
, init
, flags
);
8422 /* Thread-local storage cannot be dynamically initialized. */
8423 if (DECL_THREAD_LOCAL (decl
) && init
)
8425 error ("`%D' is thread-local and so cannot be dynamically "
8426 "initialized", decl
);
8433 The memory occupied by any object of static storage
8434 duration is zero-initialized at program startup before
8435 any other initialization takes place.
8437 We cannot create an appropriate initializer until after
8438 the type of DECL is finalized. If DECL_INITIAL is set,
8439 then the DECL is statically initialized, and any
8440 necessary zero-initialization has already been performed. */
8441 if (TREE_STATIC (decl
) && !DECL_INITIAL (decl
))
8442 DECL_INITIAL (decl
) = build_zero_init (TREE_TYPE (decl
),
8443 /*static_storage_p=*/true);
8444 /* Remember that the initialization for this variable has
8446 DECL_INITIALIZED_P (decl
) = 1;
8448 /* If the variable has an array type, lay out the type, even if
8449 there is no initializer. It is valid to index through the
8450 array, and we must get TYPE_ALIGN set correctly on the array
8452 else if (TREE_CODE (type
) == ARRAY_TYPE
)
8456 /* Add this declaration to the statement-tree. This needs to happen
8457 after the call to check_initializer so that the DECL_STMT for a
8458 reference temp is added before the DECL_STMT for the reference itself. */
8459 if (building_stmt_tree ()
8460 && at_function_scope_p ()
8461 && TREE_CODE (decl
) != RESULT_DECL
)
8462 add_decl_stmt (decl
);
8464 if (TREE_CODE (decl
) == VAR_DECL
)
8465 layout_var_decl (decl
);
8467 /* Output the assembler code and/or RTL code for variables and functions,
8468 unless the type is an undefined structure or union.
8469 If not, it will get done when the type is completed. */
8470 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
8471 || TREE_CODE (decl
) == RESULT_DECL
)
8473 if (TREE_CODE (decl
) == VAR_DECL
)
8474 maybe_commonize_var (decl
);
8476 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
8478 if (TREE_CODE (type
) == FUNCTION_TYPE
8479 || TREE_CODE (type
) == METHOD_TYPE
)
8480 abstract_virtuals_error (decl
,
8481 strip_array_types (TREE_TYPE (type
)));
8483 abstract_virtuals_error (decl
, strip_array_types (type
));
8485 if (TREE_CODE (decl
) == FUNCTION_DECL
8486 || TREE_TYPE (decl
) == error_mark_node
)
8487 /* No initialization required. */
8489 else if (DECL_EXTERNAL (decl
)
8490 && ! (DECL_LANG_SPECIFIC (decl
)
8491 && DECL_NOT_REALLY_EXTERN (decl
)))
8494 DECL_INITIAL (decl
) = init
;
8498 /* A variable definition. */
8499 if (DECL_FUNCTION_SCOPE_P (decl
))
8501 /* This is a local declaration. */
8502 if (doing_semantic_analysis_p ())
8503 maybe_inject_for_scope_var (decl
);
8504 /* Initialize the local variable. */
8505 if (processing_template_decl
)
8507 if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
8508 DECL_INITIAL (decl
) = init
;
8510 else if (!TREE_STATIC (decl
))
8511 initialize_local_var (decl
, init
);
8514 if (TREE_STATIC (decl
))
8515 expand_static_init (decl
, init
);
8519 /* Undo call to `pushclass' that was done in `start_decl'
8520 due to initialization of qualified member variable.
8521 I.e., Foo::x = 10; */
8523 tree context
= CP_DECL_CONTEXT (decl
);
8526 && (TREE_CODE (decl
) == VAR_DECL
8527 /* We also have a pushclass done that we need to undo here
8528 if we're at top level and declare a method. */
8529 || TREE_CODE (decl
) == FUNCTION_DECL
)
8530 /* If size hasn't been set, we're still defining it,
8531 and therefore inside the class body; don't pop
8532 the binding level.. */
8533 && COMPLETE_TYPE_P (context
)
8534 && context
== current_class_type
)
8535 pop_nested_class ();
8542 TREE_READONLY (decl
) = 1;
8545 /* This is here for a midend callback from c-common.c */
8548 finish_decl (decl
, init
, asmspec_tree
)
8552 cp_finish_decl (decl
, init
, asmspec_tree
, 0);
8555 /* Returns a declaration for a VAR_DECL as if:
8557 extern "C" TYPE NAME;
8559 had been seen. Used to create compiler-generated global
8563 declare_global_var (name
, type
)
8569 push_to_top_level ();
8570 decl
= build_decl (VAR_DECL
, name
, type
);
8571 TREE_PUBLIC (decl
) = 1;
8572 DECL_EXTERNAL (decl
) = 1;
8573 DECL_ARTIFICIAL (decl
) = 1;
8575 cp_finish_decl (decl
, NULL_TREE
, NULL_TREE
, 0);
8576 pop_from_top_level ();
8581 /* Returns a pointer to the `atexit' function. Note that if
8582 FLAG_USE_CXA_ATEXIT is nonzero, then this will actually be the new
8583 `__cxa_atexit' function specified in the IA64 C++ ABI. */
8597 if (flag_use_cxa_atexit
)
8599 /* The declaration for `__cxa_atexit' is:
8601 int __cxa_atexit (void (*)(void *), void *, void *)
8603 We build up the argument types and then then function type
8606 /* First, build the pointer-to-function type for the first
8608 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8609 fn_type
= build_function_type (void_type_node
, arg_types
);
8610 fn_ptr_type
= build_pointer_type (fn_type
);
8611 /* Then, build the rest of the argument types. */
8612 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8613 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, arg_types
);
8614 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, arg_types
);
8615 /* And the final __cxa_atexit type. */
8616 fn_type
= build_function_type (integer_type_node
, arg_types
);
8617 fn_ptr_type
= build_pointer_type (fn_type
);
8618 name
= "__cxa_atexit";
8622 /* The declaration for `atexit' is:
8624 int atexit (void (*)());
8626 We build up the argument types and then then function type
8628 fn_type
= build_function_type (void_type_node
, void_list_node
);
8629 fn_ptr_type
= build_pointer_type (fn_type
);
8630 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, void_list_node
);
8631 /* Build the final atexit type. */
8632 fn_type
= build_function_type (integer_type_node
, arg_types
);
8636 /* Now, build the function declaration. */
8637 push_lang_context (lang_name_c
);
8638 atexit_fndecl
= build_library_fn_ptr (name
, fn_type
);
8639 mark_used (atexit_fndecl
);
8640 pop_lang_context ();
8641 atexit_node
= default_conversion (atexit_fndecl
);
8646 /* Returns the __dso_handle VAR_DECL. */
8649 get_dso_handle_node ()
8651 if (dso_handle_node
)
8652 return dso_handle_node
;
8654 /* Declare the variable. */
8655 dso_handle_node
= declare_global_var (get_identifier ("__dso_handle"),
8658 return dso_handle_node
;
8661 /* Begin a new function with internal linkage whose job will be simply
8662 to destroy some particular variable. */
8667 static int counter
= 0;
8668 int old_interface_only
= interface_only
;
8669 int old_interface_unknown
= interface_unknown
;
8675 push_to_top_level ();
8677 /* No need to mangle this. */
8678 push_lang_context (lang_name_c
);
8681 interface_unknown
= 1;
8683 /* Build the parameter-types. */
8684 parmtypes
= void_list_node
;
8685 /* Functions passed to __cxa_atexit take an additional parameter.
8686 We'll just ignore it. After we implement the new calling
8687 convention for destructors, we can eliminate the use of
8688 additional cleanup functions entirely in the -fnew-abi case. */
8689 if (flag_use_cxa_atexit
)
8690 parmtypes
= tree_cons (NULL_TREE
, ptr_type_node
, parmtypes
);
8691 /* Build the function type itself. */
8692 fntype
= build_function_type (void_type_node
, parmtypes
);
8693 /* Build the name of the function. */
8694 sprintf (name
, "__tcf_%d", counter
++);
8695 /* Build the function declaration. */
8696 fndecl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), fntype
);
8697 /* It's a function with internal linkage, generated by the
8699 TREE_PUBLIC (fndecl
) = 0;
8700 DECL_ARTIFICIAL (fndecl
) = 1;
8701 /* Make the function `inline' so that it is only emitted if it is
8702 actually needed. It is unlikely that it will be inlined, since
8703 it is only called via a function pointer, but we avoid unnecessary
8704 emissions this way. */
8705 DECL_INLINE (fndecl
) = 1;
8706 /* Build the parameter. */
8707 if (flag_use_cxa_atexit
)
8711 parmdecl
= cp_build_parm_decl (NULL_TREE
, ptr_type_node
);
8712 DECL_CONTEXT (parmdecl
) = fndecl
;
8713 TREE_USED (parmdecl
) = 1;
8714 DECL_ARGUMENTS (fndecl
) = parmdecl
;
8718 start_function (/*specs=*/NULL_TREE
, fndecl
, NULL_TREE
, SF_PRE_PARSED
);
8720 interface_unknown
= old_interface_unknown
;
8721 interface_only
= old_interface_only
;
8723 pop_lang_context ();
8725 return current_function_decl
;
8728 /* Finish the cleanup function begun by start_cleanup_fn. */
8733 expand_body (finish_function (0));
8735 pop_from_top_level ();
8738 /* Generate code to handle the destruction of DECL, an object with
8739 static storage duration. */
8742 register_dtor_fn (decl
)
8750 int saved_flag_access_control
;
8752 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl
)))
8755 /* Call build_cleanup before we enter the anonymous function so that
8756 any access checks will be done relative to the current scope,
8757 rather than the scope of the anonymous function. */
8758 build_cleanup (decl
);
8760 /* Now start the function. */
8761 cleanup
= start_cleanup_fn ();
8763 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
8764 to the original function, rather than the anonymous one. That
8765 will make the back-end think that nested functions are in use,
8766 which causes confusion. */
8767 saved_flag_access_control
= flag_access_control
;
8768 flag_access_control
= 0;
8769 fcall
= build_cleanup (decl
);
8770 flag_access_control
= saved_flag_access_control
;
8772 /* Create the body of the anonymous function. */
8773 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
8774 finish_expr_stmt (fcall
);
8775 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
8778 /* Call atexit with the cleanup function. */
8779 cxx_mark_addressable (cleanup
);
8780 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
8781 if (flag_use_cxa_atexit
)
8783 args
= tree_cons (NULL_TREE
,
8784 build_unary_op (ADDR_EXPR
, get_dso_handle_node (), 0),
8786 args
= tree_cons (NULL_TREE
, null_pointer_node
, args
);
8787 args
= tree_cons (NULL_TREE
, cleanup
, args
);
8790 args
= tree_cons (NULL_TREE
, cleanup
, NULL_TREE
);
8791 finish_expr_stmt (build_function_call (get_atexit_node (), args
));
8794 /* DECL is a VAR_DECL with static storage duration. INIT, if present,
8795 is its initializer. Generate code to handle the construction
8796 and destruction of DECL. */
8799 expand_static_init (decl
, init
)
8805 my_friendly_assert (TREE_CODE (decl
) == VAR_DECL
, 20021010);
8806 my_friendly_assert (TREE_STATIC (decl
), 20021010);
8808 /* Some variables require no initialization. */
8810 && !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
8811 && TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl
)))
8814 oldstatic
= value_member (decl
, static_aggregates
);
8818 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
8819 error ("multiple initializations given for `%D'", decl
);
8821 else if (! toplevel_bindings_p ())
8823 /* Emit code to perform this initialization but once. */
8830 /* Emit code to perform this initialization but once. This code
8833 static int guard = 0;
8835 // Do initialization.
8837 // Register variable for destruction at end of program.
8840 Note that the `temp' variable is only set to 1 *after* the
8841 initialization is complete. This ensures that an exception,
8842 thrown during the construction, will cause the variable to
8843 reinitialized when we pass through this code again, as per:
8847 If the initialization exits by throwing an exception, the
8848 initialization is not complete, so it will be tried again
8849 the next time control enters the declaration.
8851 In theory, this process should be thread-safe, too; multiple
8852 threads should not be able to initialize the variable more
8853 than once. We don't yet attempt to ensure thread-safety. */
8855 /* Create the guard variable. */
8856 guard
= get_guard (decl
);
8858 /* Begin the conditional initialization. */
8859 if_stmt
= begin_if_stmt ();
8860 finish_if_stmt_cond (get_guard_cond (guard
), if_stmt
);
8861 then_clause
= begin_compound_stmt (/*has_no_scope=*/0);
8863 /* Do the initialization itself. */
8864 assignment
= init
? init
: NULL_TREE
;
8866 /* Once the assignment is complete, set TEMP to 1. Since the
8867 construction of the static object is complete at this point,
8868 we want to make sure TEMP is set to 1 even if a temporary
8869 constructed during the initialization throws an exception
8870 when it is destroyed. So, we combine the initialization and
8871 the assignment to TEMP into a single expression, ensuring
8872 that when we call finish_expr_stmt the cleanups will not be
8873 run until after TEMP is set to 1. */
8874 guard_init
= set_guard (guard
);
8877 assignment
= tree_cons (NULL_TREE
, assignment
,
8878 build_tree_list (NULL_TREE
,
8880 assignment
= build_compound_expr (assignment
);
8883 assignment
= guard_init
;
8884 finish_expr_stmt (assignment
);
8886 /* Use atexit to register a function for destroying this static
8888 register_dtor_fn (decl
);
8890 finish_compound_stmt (/*has_no_scope=*/0, then_clause
);
8891 finish_then_clause (if_stmt
);
8895 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8898 /* Finish the declaration of a catch-parameter. */
8901 start_handler_parms (declspecs
, declarator
)
8908 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8910 if (decl
== NULL_TREE
)
8911 error ("invalid catch parameter");
8920 /* Make TYPE a complete type based on INITIAL_VALUE.
8921 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8922 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8925 complete_array_type (type
, initial_value
, do_default
)
8926 tree type
, initial_value
;
8929 register tree maxindex
= NULL_TREE
;
8934 /* An array of character type can be initialized from a
8935 brace-enclosed string constant. */
8936 if (char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (type
)))
8937 && TREE_CODE (initial_value
) == CONSTRUCTOR
8938 && CONSTRUCTOR_ELTS (initial_value
)
8939 && (TREE_CODE (TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
)))
8941 && TREE_CHAIN (CONSTRUCTOR_ELTS (initial_value
)) == NULL_TREE
)
8942 initial_value
= TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
));
8944 /* Note MAXINDEX is really the maximum index, one less than the
8946 if (TREE_CODE (initial_value
) == STRING_CST
)
8949 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8950 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8953 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8955 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8957 maxindex
= ssize_int (-1);
8958 for (; elts
; elts
= TREE_CHAIN (elts
))
8960 if (TREE_PURPOSE (elts
))
8961 maxindex
= TREE_PURPOSE (elts
);
8963 maxindex
= size_binop (PLUS_EXPR
, maxindex
, ssize_int (1));
8965 maxindex
= copy_node (maxindex
);
8969 /* Make an error message unless that happened already. */
8970 if (initial_value
!= error_mark_node
)
8973 initial_value
= NULL_TREE
;
8975 /* Prevent further error messages. */
8976 maxindex
= build_int_2 (0, 0);
8983 maxindex
= build_int_2 (0, 0);
8992 domain
= build_index_type (maxindex
);
8993 TYPE_DOMAIN (type
) = domain
;
8995 if (! TREE_TYPE (maxindex
))
8996 TREE_TYPE (maxindex
) = domain
;
8998 itype
= TREE_TYPE (initial_value
);
9001 if (itype
&& !TYPE_DOMAIN (itype
))
9002 TYPE_DOMAIN (itype
) = domain
;
9003 /* The type of the main variant should never be used for arrays
9004 of different sizes. It should only ever be completed with the
9005 size of the array. */
9006 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
9007 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
9010 /* Lay out the type now that we can get the real answer. */
9017 /* Return zero if something is declared to be a member of type
9018 CTYPE when in the context of CUR_TYPE. STRING is the error
9019 message to print in that case. Otherwise, quietly return 1. */
9022 member_function_or_else (ctype
, cur_type
, flags
)
9023 tree ctype
, cur_type
;
9024 enum overload_flags flags
;
9026 if (ctype
&& ctype
!= cur_type
)
9028 if (flags
== DTOR_FLAG
)
9029 error ("destructor for alien class `%T' cannot be a member",
9032 error ("constructor for alien class `%T' cannot be a member",
9039 /* Subroutine of `grokdeclarator'. */
9041 /* Generate errors possibly applicable for a given set of specifiers.
9042 This is for ARM $7.1.2. */
9045 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
9048 int virtualp
, quals
, friendp
, raises
, inlinep
;
9051 error ("`%D' declared as a `virtual' %s", object
, type
);
9053 error ("`%D' declared as an `inline' %s", object
, type
);
9055 error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
9058 cp_error_at ("`%D' declared as a friend", object
);
9060 && (TREE_CODE (object
) == TYPE_DECL
9061 || (!TYPE_PTRFN_P (TREE_TYPE (object
))
9062 && !TYPE_REFFN_P (TREE_TYPE (object
))
9063 && !TYPE_PTRMEMFUNC_P (TREE_TYPE (object
)))))
9064 cp_error_at ("`%D' declared with an exception specification", object
);
9067 /* CTYPE is class type, or null if non-class.
9068 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
9070 DECLARATOR is the function's name.
9071 VIRTUALP is truthvalue of whether the function is virtual or not.
9072 FLAGS are to be passed through to `grokclassfn'.
9073 QUALS are qualifiers indicating whether the function is `const'
9075 RAISES is a list of exceptions that this function can raise.
9076 CHECK is 1 if we must find this method in CTYPE, 0 if we should
9077 not look, and -1 if we should not call `grokclassfn' at all.
9079 Returns `NULL_TREE' if something goes wrong, after issuing
9080 applicable error messages. */
9083 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
9084 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
9085 template_count
, in_namespace
)
9088 tree orig_declarator
;
9090 enum overload_flags flags
;
9092 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
9096 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
9097 int has_default_arg
= 0;
9101 type
= build_exception_variant (type
, raises
);
9103 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
9104 /* Propagate volatile out from type to decl. */
9105 if (TYPE_VOLATILE (type
))
9106 TREE_THIS_VOLATILE (decl
) = 1;
9108 /* If this decl has namespace scope, set that up. */
9110 set_decl_namespace (decl
, in_namespace
, friendp
);
9112 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
9114 /* `main' and builtins have implicit 'C' linkage. */
9115 if ((MAIN_NAME_P (declarator
)
9116 || (IDENTIFIER_LENGTH (declarator
) > 10
9117 && IDENTIFIER_POINTER (declarator
)[0] == '_'
9118 && IDENTIFIER_POINTER (declarator
)[1] == '_'
9119 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
9120 && current_lang_name
== lang_name_cplusplus
9121 && ctype
== NULL_TREE
9122 /* NULL_TREE means global namespace. */
9123 && DECL_CONTEXT (decl
) == NULL_TREE
)
9124 SET_DECL_LANGUAGE (decl
, lang_c
);
9126 /* Should probably propagate const out from type to decl I bet (mrs). */
9129 DECL_STATIC_FUNCTION_P (decl
) = 1;
9130 DECL_CONTEXT (decl
) = ctype
;
9134 DECL_CONTEXT (decl
) = ctype
;
9136 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
9138 if (processing_template_decl
)
9139 error ("cannot declare `::main' to be a template");
9141 error ("cannot declare `::main' to be inline");
9143 error ("cannot declare `::main' to be static");
9144 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
9146 error ("`main' must return `int'");
9151 /* Members of anonymous types and local classes have no linkage; make
9153 /* FIXME what if it gets a name from typedef? */
9154 if (ctype
&& (TYPE_ANONYMOUS_P (ctype
)
9155 || decl_function_context (TYPE_MAIN_DECL (ctype
))))
9160 /* [basic.link]: A name with no linkage (notably, the name of a class
9161 or enumeration declared in a local scope) shall not be used to
9162 declare an entity with linkage.
9164 Only check this for public decls for now. */
9165 t
= no_linkage_check (TREE_TYPE (decl
));
9168 if (TYPE_ANONYMOUS_P (t
))
9170 if (DECL_EXTERN_C_P (decl
))
9171 /* Allow this; it's pretty common in C. */;
9174 pedwarn ("non-local function `%#D' uses anonymous type",
9176 if (DECL_ORIGINAL_TYPE (TYPE_NAME (t
)))
9178 `%#D' does not refer to the unqualified type, so it is not used for linkage",
9183 pedwarn ("non-local function `%#D' uses local type `%T'",
9188 TREE_PUBLIC (decl
) = publicp
;
9191 DECL_INTERFACE_KNOWN (decl
) = 1;
9192 DECL_NOT_REALLY_EXTERN (decl
) = 1;
9195 /* If the declaration was declared inline, mark it as such. */
9197 DECL_DECLARED_INLINE_P (decl
) = 1;
9198 /* We inline functions that are explicitly declared inline, or, when
9199 the user explicitly asks us to, all functions. */
9200 if (DECL_DECLARED_INLINE_P (decl
) || flag_inline_trees
== 2)
9201 DECL_INLINE (decl
) = 1;
9203 DECL_EXTERNAL (decl
) = 1;
9204 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
9206 error ("%smember function `%D' cannot have `%T' method qualifier",
9207 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
9211 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
9212 grok_op_properties (decl
, friendp
);
9214 if (ctype
&& decl_function_context (decl
))
9215 DECL_NO_STATIC_CHAIN (decl
) = 1;
9217 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
9218 if (TREE_PURPOSE (t
)
9219 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
9221 has_default_arg
= 1;
9226 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
9230 ("defining explicit specialization `%D' in friend declaration",
9234 tree fns
= TREE_OPERAND (orig_declarator
, 0);
9235 tree args
= TREE_OPERAND (orig_declarator
, 1);
9237 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
9239 /* Something like `template <class T> friend void f<T>()'. */
9240 error ("invalid use of template-id `%D' in declaration of primary template",
9246 /* A friend declaration of the form friend void f<>(). Record
9247 the information in the TEMPLATE_ID_EXPR. */
9248 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
9250 if (TREE_CODE (fns
) == COMPONENT_REF
)
9252 /* Due to bison parser ickiness, we will have already looked
9253 up an operator_name or PFUNCNAME within the current class
9254 (see template_id in parse.y). If the current class contains
9255 such a name, we'll get a COMPONENT_REF here. Undo that. */
9257 my_friendly_assert (TREE_TYPE (TREE_OPERAND (fns
, 0))
9258 == current_class_type
, 20001120);
9259 fns
= TREE_OPERAND (fns
, 1);
9261 my_friendly_assert (TREE_CODE (fns
) == IDENTIFIER_NODE
9262 || TREE_CODE (fns
) == LOOKUP_EXPR
9263 || TREE_CODE (fns
) == OVERLOAD
, 20001120);
9264 DECL_TEMPLATE_INFO (decl
) = tree_cons (fns
, args
, NULL_TREE
);
9266 if (has_default_arg
)
9268 error ("default arguments are not allowed in declaration of friend template specialization `%D'",
9275 error ("`inline' is not allowed in declaration of friend template specialization `%D'",
9282 if (has_default_arg
)
9283 add_defarg_fn (decl
);
9286 /* Make the init_value nonzero so pushdecl knows this is not
9287 tentative. error_mark_node is replaced later with the BLOCK. */
9288 DECL_INITIAL (decl
) = error_mark_node
;
9290 if (TYPE_NOTHROW_P (type
) || nothrow_libfn_p (decl
))
9291 TREE_NOTHROW (decl
) = 1;
9293 /* Caller will do the rest of this. */
9297 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (ctype
) == declarator
)
9298 DECL_CONSTRUCTOR_P (decl
) = 1;
9300 /* Function gets the ugly name, field gets the nice one. This call
9301 may change the type of the function (because of default
9303 if (ctype
!= NULL_TREE
)
9304 grokclassfn (ctype
, decl
, flags
, quals
);
9306 decl
= check_explicit_specialization (orig_declarator
, decl
,
9308 2 * (funcdef_flag
!= 0) +
9309 4 * (friendp
!= 0));
9310 if (decl
== error_mark_node
)
9313 if (ctype
!= NULL_TREE
9314 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
9319 old_decl
= check_classfn (ctype
, decl
);
9321 if (old_decl
&& TREE_CODE (old_decl
) == TEMPLATE_DECL
)
9322 /* Because grokfndecl is always supposed to return a
9323 FUNCTION_DECL, we pull out the DECL_TEMPLATE_RESULT
9324 here. We depend on our callers to figure out that its
9325 really a template that's being returned. */
9326 old_decl
= DECL_TEMPLATE_RESULT (old_decl
);
9328 if (old_decl
&& DECL_STATIC_FUNCTION_P (old_decl
)
9329 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
9331 /* Remove the `this' parm added by grokclassfn.
9332 XXX Isn't this done in start_function, too? */
9333 revert_static_member_fn (decl
);
9334 last_function_parms
= TREE_CHAIN (last_function_parms
);
9336 if (old_decl
&& DECL_ARTIFICIAL (old_decl
))
9337 error ("definition of implicitly-declared `%D'", old_decl
);
9341 /* Since we've smashed OLD_DECL to its
9342 DECL_TEMPLATE_RESULT, we must do the same to DECL. */
9343 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
9344 decl
= DECL_TEMPLATE_RESULT (decl
);
9346 /* Attempt to merge the declarations. This can fail, in
9347 the case of some invalid specialization declarations. */
9348 if (!duplicate_decls (decl
, old_decl
))
9349 error ("no `%#D' member function declared in class `%T'",
9355 if (DECL_CONSTRUCTOR_P (decl
) && !grok_ctor_properties (ctype
, decl
))
9358 if (ctype
== NULL_TREE
|| check
)
9362 DECL_VIRTUAL_P (decl
) = 1;
9367 /* Create a VAR_DECL named NAME with the indicated TYPE.
9369 If SCOPE is non-NULL, it is the class type or namespace containing
9370 the variable. If SCOPE is NULL, the variable should is created in
9371 the innermost enclosings scope. */
9374 grokvardecl (type
, name
, specbits_in
, initialized
, constp
, scope
)
9377 RID_BIT_TYPE
*specbits_in
;
9383 RID_BIT_TYPE specbits
;
9385 my_friendly_assert (!name
|| TREE_CODE (name
) == IDENTIFIER_NODE
,
9388 specbits
= *specbits_in
;
9390 /* Compute the scope in which to place the variable. */
9393 /* An explicit "extern" specifier indicates a namespace-scope
9395 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
9396 scope
= current_namespace
;
9397 else if (!at_function_scope_p ())
9399 scope
= current_scope ();
9401 scope
= current_namespace
;
9406 && (/* If the variable is a namespace-scope variable declared in a
9407 template, we need DECL_LANG_SPECIFIC. */
9408 (TREE_CODE (scope
) == NAMESPACE_DECL
&& processing_template_decl
)
9409 /* Similarly for namespace-scope variables with language linkage
9411 || (TREE_CODE (scope
) == NAMESPACE_DECL
9412 && current_lang_name
!= lang_name_cplusplus
)
9413 /* Similarly for static data members. */
9415 decl
= build_lang_decl (VAR_DECL
, name
, type
);
9417 decl
= build_decl (VAR_DECL
, name
, type
);
9419 if (scope
&& TREE_CODE (scope
) == NAMESPACE_DECL
)
9420 set_decl_namespace (decl
, scope
, 0);
9422 DECL_CONTEXT (decl
) = scope
;
9424 if (name
&& scope
&& current_lang_name
!= lang_name_c
)
9425 /* We can't mangle lazily here because we don't have any
9426 way to recover whether or not a variable was `extern
9430 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
9432 DECL_THIS_EXTERN (decl
) = 1;
9433 DECL_EXTERNAL (decl
) = !initialized
;
9436 /* In class context, static means one per class,
9437 public access, and static storage. */
9438 if (DECL_CLASS_SCOPE_P (decl
))
9440 TREE_PUBLIC (decl
) = 1;
9441 TREE_STATIC (decl
) = 1;
9442 DECL_EXTERNAL (decl
) = 0;
9444 /* At top level, either `static' or no s.c. makes a definition
9445 (perhaps tentative), and absence of `static' makes it public. */
9446 else if (toplevel_bindings_p ())
9448 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
9449 && (DECL_THIS_EXTERN (decl
) || ! constp
));
9450 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
9452 /* Not at top level, only `static' makes a static definition. */
9455 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
9456 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
9459 if (RIDBIT_SETP (RID_THREAD
, specbits
))
9461 if (targetm
.have_tls
)
9462 DECL_THREAD_LOCAL (decl
) = 1;
9464 /* A mere warning is sure to result in improper semantics
9465 at runtime. Don't bother to allow this to compile. */
9466 error ("thread-local storage not supported for this target");
9469 if (TREE_PUBLIC (decl
))
9471 /* [basic.link]: A name with no linkage (notably, the name of a class
9472 or enumeration declared in a local scope) shall not be used to
9473 declare an entity with linkage.
9475 Only check this for public decls for now. */
9476 tree t
= no_linkage_check (TREE_TYPE (decl
));
9479 if (TYPE_ANONYMOUS_P (t
))
9480 /* Ignore for now; `enum { foo } e' is pretty common. */;
9482 pedwarn ("non-local variable `%#D' uses local type `%T'",
9490 /* Create and return a canonical pointer to member function type, for
9491 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
9494 build_ptrmemfunc_type (type
)
9499 tree unqualified_variant
= NULL_TREE
;
9501 if (type
== error_mark_node
)
9504 /* If a canonical type already exists for this type, use it. We use
9505 this method instead of type_hash_canon, because it only does a
9506 simple equality check on the list of field members. */
9508 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
9511 /* Make sure that we always have the unqualified pointer-to-member
9513 if (cp_type_quals (type
) != TYPE_UNQUALIFIED
)
9515 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
9517 t
= make_aggr_type (RECORD_TYPE
);
9518 /* Let the front-end know this is a pointer to member function... */
9519 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
9520 /* ... and not really an aggregate. */
9521 SET_IS_AGGR_TYPE (t
, 0);
9523 fields
[0] = build_decl (FIELD_DECL
, pfn_identifier
, type
);
9524 fields
[1] = build_decl (FIELD_DECL
, delta_identifier
,
9526 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9528 /* Zap out the name so that the back-end will give us the debugging
9529 information for this anonymous RECORD_TYPE. */
9530 TYPE_NAME (t
) = NULL_TREE
;
9532 /* If this is not the unqualified form of this pointer-to-member
9533 type, set the TYPE_MAIN_VARIANT for this type to be the
9534 unqualified type. Since they are actually RECORD_TYPEs that are
9535 not variants of each other, we must do this manually. */
9536 if (cp_type_quals (type
) != TYPE_UNQUALIFIED
)
9538 t
= build_qualified_type (t
, cp_type_quals (type
));
9539 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
9540 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
9541 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
9544 /* Cache this pointer-to-member type so that we can find it again
9546 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
9548 /* Seems to be wanted. */
9549 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
9554 /* Create and return a pointer to data member type. */
9557 build_ptrmem_type (tree class_type
, tree member_type
)
9559 return build_pointer_type (build_offset_type (class_type
, member_type
));
9562 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
9563 Check to see that the definition is valid. Issue appropriate error
9564 messages. Return 1 if the definition is particularly bad, or 0
9568 check_static_variable_definition (decl
, type
)
9572 /* Motion 10 at San Diego: If a static const integral data member is
9573 initialized with an integral constant expression, the initializer
9574 may appear either in the declaration (within the class), or in
9575 the definition, but not both. If it appears in the class, the
9576 member is a member constant. The file-scope definition is always
9578 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
9580 error ("invalid in-class initialization of static data member of non-integral type `%T'",
9582 /* If we just return the declaration, crashes will sometimes
9583 occur. We therefore return void_type_node, as if this was a
9584 friend declaration, to cause callers to completely ignore
9585 this declaration. */
9588 else if (!CP_TYPE_CONST_P (type
))
9589 error ("ISO C++ forbids in-class initialization of non-const static member `%D'",
9591 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
9592 pedwarn ("ISO C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
9597 /* Given the SIZE (i.e., number of elements) in an array, compute an
9598 appropriate index type for the array. If non-NULL, NAME is the
9599 name of the thing being declared. */
9602 compute_array_index_type (name
, size
)
9608 /* If this involves a template parameter, it will be a constant at
9609 instantiation time, but we don't know what the value is yet.
9610 Even if no template parameters are involved, we may an expression
9611 that is not a constant; we don't even simplify `1 + 2' when
9612 processing a template. */
9613 if (processing_template_decl
)
9615 /* Resolve a qualified reference to an enumerator or static
9616 const data member of ours. */
9617 if (TREE_CODE (size
) == SCOPE_REF
9618 && TREE_OPERAND (size
, 0) == current_class_type
)
9620 tree t
= lookup_field (current_class_type
,
9621 TREE_OPERAND (size
, 1), 0, 0);
9626 return build_index_type (build_min (MINUS_EXPR
, sizetype
,
9627 size
, integer_one_node
));
9630 /* The size might be the result of a cast. */
9631 STRIP_TYPE_NOPS (size
);
9633 /* It might be a const variable or enumeration constant. */
9634 size
= decl_constant_value (size
);
9636 /* The array bound must be an integer type. */
9637 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9638 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
9639 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
9642 error ("size of array `%D' has non-integer type", name
);
9644 error ("size of array has non-integer type");
9645 size
= integer_one_node
;
9648 /* Normally, the array-bound will be a constant. */
9649 if (TREE_CODE (size
) == INTEGER_CST
)
9651 /* Check to see if the array bound overflowed. Make that an
9652 error, no matter how generous we're being. */
9653 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9654 int old_pedantic
= pedantic
;
9655 pedantic
= flag_pedantic_errors
= 1;
9656 constant_expression_warning (size
);
9657 pedantic
= old_pedantic
;
9658 flag_pedantic_errors
= old_flag_pedantic_errors
;
9660 /* An array must have a positive number of elements. */
9661 if (INT_CST_LT (size
, integer_zero_node
))
9664 error ("size of array `%D' is negative", name
);
9666 error ("size of array is negative");
9667 size
= integer_one_node
;
9669 /* Except that an extension we allow zero-sized arrays. We
9670 always allow them in system headers because glibc uses
9672 else if (integer_zerop (size
) && pedantic
&& !in_system_header
)
9675 pedwarn ("ISO C++ forbids zero-size array `%D'", name
);
9677 pedwarn ("ISO C++ forbids zero-size array");
9680 else if (TREE_CONSTANT (size
))
9682 /* `(int) &fn' is not a valid array bound. */
9684 error ("size of array `%D' is not an integral constant-expression",
9687 error ("size of array is not an integral constant-expression");
9690 /* Compute the index of the largest element in the array. It is
9691 one less than the number of elements in the array. */
9693 = fold (cp_build_binary_op (MINUS_EXPR
,
9694 cp_convert (ssizetype
, size
),
9695 cp_convert (ssizetype
,
9696 integer_one_node
)));
9698 /* Check for variable-sized arrays. We allow such things as an
9699 extension, even though they are not allowed in ANSI/ISO C++. */
9700 if (!TREE_CONSTANT (itype
))
9705 pedwarn ("ISO C++ forbids variable-size array `%D'",
9708 pedwarn ("ISO C++ forbids variable-size array");
9711 /* Create a variable-sized array index type. */
9712 itype
= variable_size (itype
);
9714 /* Make sure that there was no overflow when creating to a signed
9715 index type. (For example, on a 32-bit machine, an array with
9716 size 2^32 - 1 is too big.) */
9717 else if (TREE_OVERFLOW (itype
))
9719 error ("overflow in array dimension");
9720 TREE_OVERFLOW (itype
) = 0;
9723 /* Create and return the appropriate index type. */
9724 return build_index_type (itype
);
9727 /* Returns an ARRAY_TYPE for an array with SIZE elements of the
9728 indicated TYPE. If non-NULL, NAME is the NAME of the declaration
9732 create_array_type_for_decl (name
, type
, size
)
9737 tree itype
= NULL_TREE
;
9738 const char* error_msg
;
9740 /* If things have already gone awry, bail now. */
9741 if (type
== error_mark_node
|| size
== error_mark_node
)
9742 return error_mark_node
;
9744 /* Assume that everything will go OK. */
9747 /* There are some types which cannot be array elements. */
9748 switch (TREE_CODE (type
))
9751 error_msg
= "array of void";
9755 error_msg
= "array of functions";
9758 case REFERENCE_TYPE
:
9759 error_msg
= "array of references";
9763 error_msg
= "array of data members";
9767 error_msg
= "array of function members";
9774 /* If something went wrong, issue an error-message and return. */
9778 error ("declaration of `%D' as %s", name
, error_msg
);
9780 error ("creating %s", error_msg
);
9782 return error_mark_node
;
9787 The constant expressions that specify the bounds of the arrays
9788 can be omitted only for the first member of the sequence. */
9789 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9792 error ("declaration of `%D' as multidimensional array must have bounds for all dimensions except the first",
9795 error ("multidimensional array must have bounds for all dimensions except the first");
9797 return error_mark_node
;
9800 /* Figure out the index type for the array. */
9802 itype
= compute_array_index_type (name
, size
);
9804 return build_cplus_array_type (type
, itype
);
9807 /* Check that it's OK to declare a function with the indicated TYPE.
9808 SFK indicates the kind of special function (if any) that this
9809 function is. OPTYPE is the type given in a conversion operator
9810 declaration. Returns the actual return type of the function; that
9811 may be different than TYPE if an error occurs, or for certain
9812 special functions. */
9815 check_special_function_return_type (sfk
, type
, optype
)
9816 special_function_kind sfk
;
9822 case sfk_constructor
:
9824 error ("return type specification for constructor invalid");
9826 type
= void_type_node
;
9829 case sfk_destructor
:
9831 error ("return type specification for destructor invalid");
9832 type
= void_type_node
;
9835 case sfk_conversion
:
9836 if (type
&& !same_type_p (type
, optype
))
9837 error ("operator `%T' declared to return `%T'", optype
, type
);
9839 pedwarn ("return type specified for `operator %T'", optype
);
9851 /* Given declspecs and a declarator,
9852 determine the name and type of the object declared
9853 and construct a ..._DECL node for it.
9854 (In one case we can return a ..._TYPE node instead.
9855 For invalid input we sometimes return 0.)
9857 DECLSPECS is a chain of tree_list nodes whose value fields
9858 are the storage classes and type specifiers.
9860 DECL_CONTEXT says which syntactic context this declaration is in:
9861 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
9862 FUNCDEF for a function definition. Like NORMAL but a few different
9863 error messages in each case. Return value may be zero meaning
9864 this definition is too screwy to try to parse.
9865 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
9866 handle member functions (which have FIELD context).
9867 Return value may be zero meaning this definition is too screwy to
9869 PARM for a parameter declaration (either within a function prototype
9870 or before a function body). Make a PARM_DECL, or return void_type_node.
9871 CATCHPARM for a parameter declaration before a catch clause.
9872 TYPENAME if for a typename (in a cast or sizeof).
9873 Don't make a DECL node; just return the ..._TYPE node.
9874 FIELD for a struct or union field; make a FIELD_DECL.
9875 BITFIELD for a field with specified width.
9876 INITIALIZED is 1 if the decl has an initializer.
9878 ATTRLIST is a pointer to the list of attributes, which may be NULL
9879 if there are none; *ATTRLIST may be modified if attributes from inside
9880 the declarator should be applied to the declaration.
9882 In the TYPENAME case, DECLARATOR is really an abstract declarator.
9883 It may also be so in the PARM case, for a prototype where the
9884 argument type is specified but not the name.
9886 This function is where the complicated C meanings of `static'
9887 and `extern' are interpreted.
9889 For C++, if there is any monkey business to do, the function which
9890 calls this one must do it, i.e., prepending instance variables,
9891 renaming overloaded function names, etc.
9893 Note that for this C++, it is an error to define a method within a class
9894 which does not belong to that class.
9896 Except in the case where SCOPE_REFs are implicitly known (such as
9897 methods within a class being redundantly qualified),
9898 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
9899 (class_name::decl_name). The caller must also deal with this.
9901 If a constructor or destructor is seen, and the context is FIELD,
9902 then the type gains the attribute TREE_HAS_x. If such a declaration
9903 is erroneous, NULL_TREE is returned.
9905 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
9906 function, these are the qualifiers to give to the `this' pointer. We
9907 apply TYPE_QUAL_RESTRICT to the this ptr, not the object.
9909 May return void_type_node if the declarator turned out to be a friend.
9910 See grokfield for details. */
9913 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
9916 enum decl_context decl_context
;
9920 RID_BIT_TYPE specbits
;
9923 tree type
= NULL_TREE
;
9926 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
9927 int explicit_int
= 0;
9928 int explicit_char
= 0;
9929 int defaulted_int
= 0;
9930 int extern_langp
= 0;
9931 tree dependant_name
= NULL_TREE
;
9933 tree typedef_decl
= NULL_TREE
;
9935 tree typedef_type
= NULL_TREE
;
9936 int funcdef_flag
= 0;
9937 enum tree_code innermost_code
= ERROR_MARK
;
9940 /* See the code below that used this. */
9941 tree decl_attr
= NULL_TREE
;
9943 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
9944 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
9945 tree init
= NULL_TREE
;
9947 /* Keep track of what sort of function is being processed
9948 so that we can warn about default return values, or explicit
9949 return values which do not match prescribed defaults. */
9950 special_function_kind sfk
= sfk_none
;
9952 tree dname
= NULL_TREE
;
9953 tree ctype
= current_class_type
;
9954 tree ctor_return_type
= NULL_TREE
;
9955 enum overload_flags flags
= NO_SPECIAL
;
9956 tree quals
= NULL_TREE
;
9957 tree raises
= NULL_TREE
;
9958 int template_count
= 0;
9959 tree in_namespace
= NULL_TREE
;
9960 tree returned_attrs
= NULL_TREE
;
9962 RIDBIT_RESET_ALL (specbits
);
9963 if (decl_context
== FUNCDEF
)
9964 funcdef_flag
= 1, decl_context
= NORMAL
;
9965 else if (decl_context
== MEMFUNCDEF
)
9966 funcdef_flag
= -1, decl_context
= FIELD
;
9967 else if (decl_context
== BITFIELD
)
9968 bitfield
= 1, decl_context
= FIELD
;
9970 /* Look inside a declarator for the name being declared
9971 and get it as a string, for an error message. */
9973 tree
*next
= &declarator
;
9977 while (next
&& *next
)
9980 switch (TREE_CODE (decl
))
9983 /* For attributes. */
9984 next
= &TREE_VALUE (decl
);
9989 next
= &TREE_OPERAND (decl
, 0);
9992 case BIT_NOT_EXPR
: /* For C++ destructors! */
9994 tree name
= TREE_OPERAND (decl
, 0);
9995 tree rename
= NULL_TREE
;
9997 my_friendly_assert (flags
== NO_SPECIAL
, 152);
9999 sfk
= sfk_destructor
;
10000 if (TREE_CODE (name
) == TYPE_DECL
)
10001 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
10002 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
10003 if (ctype
== NULL_TREE
)
10005 if (current_class_type
== NULL_TREE
)
10007 error ("destructors must be member functions");
10008 flags
= NO_SPECIAL
;
10012 tree t
= constructor_name (current_class_name
);
10019 tree t
= constructor_name (ctype
);
10026 error ("destructor `%T' must match class name `%T'",
10028 TREE_OPERAND (decl
, 0) = rename
;
10034 case ADDR_EXPR
: /* C++ reference declaration */
10035 /* Fall through. */
10039 innermost_code
= TREE_CODE (decl
);
10040 next
= &TREE_OPERAND (decl
, 0);
10044 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
10046 /* This is actually a variable declaration using
10047 constructor syntax. We need to call start_decl and
10048 cp_finish_decl so we can get the variable
10053 if (decl_context
!= NORMAL
)
10055 error ("variable declaration is not allowed here");
10056 return error_mark_node
;
10059 *next
= TREE_OPERAND (decl
, 0);
10060 init
= CALL_DECLARATOR_PARMS (decl
);
10064 attributes
= *attrlist
;
10068 attributes
= NULL_TREE
;
10071 decl
= start_decl (declarator
, declspecs
, 1,
10072 attributes
, NULL_TREE
);
10073 decl_type_access_control (decl
);
10076 /* Look for __unused__ attribute */
10077 if (TREE_USED (TREE_TYPE (decl
)))
10078 TREE_USED (decl
) = 1;
10079 finish_decl (decl
, init
, NULL_TREE
);
10082 error ("invalid declarator");
10085 innermost_code
= TREE_CODE (decl
);
10086 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
10087 ctype
= current_class_type
;
10089 && TREE_OPERAND (decl
, 0)
10090 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
10091 && constructor_name_p (DECL_NAME (TREE_OPERAND (decl
, 0)),
10093 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
10094 next
= &TREE_OPERAND (decl
, 0);
10096 if (ctype
!= NULL_TREE
10097 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
10098 && decl
== constructor_name (ctype
))
10100 sfk
= sfk_constructor
;
10101 ctor_return_type
= ctype
;
10106 case TEMPLATE_ID_EXPR
:
10108 tree fns
= TREE_OPERAND (decl
, 0);
10110 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
10111 fns
= TREE_OPERAND (fns
, 0);
10114 if (TREE_CODE (dname
) == COMPONENT_REF
)
10115 dname
= TREE_OPERAND (dname
, 1);
10116 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
10118 my_friendly_assert (is_overloaded_fn (dname
),
10120 dname
= DECL_NAME (get_first_fn (dname
));
10123 /* Fall through. */
10125 case IDENTIFIER_NODE
:
10126 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
10131 if (C_IS_RESERVED_WORD (dname
))
10133 error ("declarator-id missing; using reserved word `%D'",
10135 name
= IDENTIFIER_POINTER (dname
);
10137 else if (!IDENTIFIER_TYPENAME_P (dname
))
10138 name
= IDENTIFIER_POINTER (dname
);
10141 my_friendly_assert (flags
== NO_SPECIAL
, 154);
10142 flags
= TYPENAME_FLAG
;
10143 ctor_return_type
= TREE_TYPE (dname
);
10144 sfk
= sfk_conversion
;
10145 if (IDENTIFIER_GLOBAL_VALUE (dname
)
10146 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (dname
))
10148 name
= IDENTIFIER_POINTER (dname
);
10150 name
= "<invalid operator>";
10154 /* C++ extension */
10157 /* Perform error checking, and decide on a ctype. */
10158 tree cname
= TREE_OPERAND (decl
, 0);
10159 if (cname
== NULL_TREE
)
10161 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
10164 in_namespace
= TREE_OPERAND (decl
, 0);
10165 TREE_OPERAND (decl
, 0) = NULL_TREE
;
10167 else if (! is_aggr_type (cname
, 1))
10168 TREE_OPERAND (decl
, 0) = NULL_TREE
;
10169 /* Must test TREE_OPERAND (decl, 1), in case user gives
10170 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
10171 else if (TREE_OPERAND (decl
, 1)
10172 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
10174 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
10175 || TREE_CODE (cname
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
10177 /* This might be declaring a member of a template
10178 parm to be a friend. */
10180 dependant_name
= TREE_OPERAND (decl
, 1);
10182 else if (ctype
== NULL_TREE
)
10184 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
10185 TREE_OPERAND (decl
, 0) = ctype
;
10188 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
10190 error ("type `%T' is not derived from type `%T'",
10192 TREE_OPERAND (decl
, 0) = NULL_TREE
;
10198 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
10199 && constructor_name_p (DECL_NAME (TREE_OPERAND (decl
, 1)),
10201 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
10202 next
= &TREE_OPERAND (decl
, 1);
10206 if (TREE_CODE (decl
) == IDENTIFIER_NODE
10207 && constructor_name (ctype
) == decl
)
10209 sfk
= sfk_constructor
;
10210 ctor_return_type
= ctype
;
10212 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
10213 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
10214 && constructor_name_p (TREE_OPERAND (decl
, 0),
10217 sfk
= sfk_destructor
;
10218 ctor_return_type
= ctype
;
10220 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
10221 next
= &TREE_OPERAND (decl
, 0);
10232 /* Parse error puts this typespec where
10233 a declarator should go. */
10234 error ("`%T' specified as declarator-id", DECL_NAME (decl
));
10235 if (TREE_TYPE (decl
) == current_class_type
)
10236 error (" perhaps you want `%T' for a constructor",
10237 current_class_name
);
10238 dname
= DECL_NAME (decl
);
10239 name
= IDENTIFIER_POINTER (dname
);
10241 /* Avoid giving two errors for this. */
10242 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
10244 declspecs
= tree_cons (NULL_TREE
, integer_type_node
, declspecs
);
10250 next
= &BASELINK_FUNCTIONS (decl
);
10253 case TEMPLATE_DECL
:
10254 /* Sometimes, we see a template-name used as part of a
10255 decl-specifier like in
10256 std::allocator alloc;
10257 Handle that gracefully. */
10258 error ("invalid use of template-name '%E' in a declarator", decl
);
10259 return error_mark_node
;
10263 my_friendly_assert (0, 20020917);
10268 /* A function definition's declarator must have the form of
10269 a function declarator. */
10271 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
10274 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
10275 && innermost_code
!= CALL_EXPR
10276 && ! (ctype
&& declspecs
== NULL_TREE
))
10278 error ("declaration of `%D' as non-function", dname
);
10279 return void_type_node
;
10282 /* Anything declared one level down from the top level
10283 must be one of the parameters of a function
10284 (because the body is at least two levels down). */
10286 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
10287 by not allowing C++ class definitions to specify their parameters
10288 with xdecls (must be spec.d in the parmlist).
10290 Since we now wait to push a class scope until we are sure that
10291 we are in a legitimate method context, we must set oldcname
10292 explicitly (since current_class_name is not yet alive).
10294 We also want to avoid calling this a PARM if it is in a namespace. */
10296 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
10298 struct cp_binding_level
*b
= current_binding_level
;
10299 current_binding_level
= b
->level_chain
;
10300 if (current_binding_level
!= 0 && toplevel_bindings_p ())
10301 decl_context
= PARM
;
10302 current_binding_level
= b
;
10306 name
= decl_context
== PARM
? "parameter" : "type name";
10308 /* Look through the decl specs and record which ones appear.
10309 Some typespecs are defined as built-in typenames.
10310 Others, the ones that are modifiers of other types,
10311 are represented by bits in SPECBITS: set the bits for
10312 the modifiers that appear. Storage class keywords are also in SPECBITS.
10314 If there is a typedef name or a type, store the type in TYPE.
10315 This includes builtin typedefs such as `int'.
10317 Set EXPLICIT_INT if the type is `int' or `char' and did not
10318 come from a user typedef.
10320 Set LONGLONG if `long' is mentioned twice.
10322 For C++, constructors and destructors have their own fast treatment. */
10324 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
10329 /* Certain parse errors slip through. For example,
10330 `int class;' is not caught by the parser. Try
10331 weakly to recover here. */
10332 if (TREE_CODE (spec
) != TREE_LIST
)
10335 id
= TREE_VALUE (spec
);
10337 /* If the entire declaration is itself tagged as deprecated then
10338 suppress reports of deprecated items. */
10339 if (!adding_implicit_members
&& id
&& TREE_DEPRECATED (id
))
10341 if (deprecated_state
!= DEPRECATED_SUPPRESS
)
10342 warn_deprecated_use (id
);
10345 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
10347 if (id
== ridpointers
[(int) RID_INT
]
10348 || id
== ridpointers
[(int) RID_CHAR
]
10349 || id
== ridpointers
[(int) RID_BOOL
]
10350 || id
== ridpointers
[(int) RID_WCHAR
])
10354 if (id
== ridpointers
[(int) RID_BOOL
])
10355 error ("`bool' is now a keyword");
10357 error ("extraneous `%T' ignored", id
);
10361 if (id
== ridpointers
[(int) RID_INT
])
10363 else if (id
== ridpointers
[(int) RID_CHAR
])
10365 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
10369 /* C++ aggregate types. */
10370 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
10373 error ("multiple declarations `%T' and `%T'", type
, id
);
10375 type
= IDENTIFIER_TYPE_VALUE (id
);
10379 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
10381 if (ridpointers
[i
] == id
)
10383 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
10385 if (pedantic
&& ! in_system_header
&& warn_long_long
)
10386 pedwarn ("ISO C++ does not support `long long'");
10388 error ("`long long long' is too long for GCC");
10392 else if (RIDBIT_SETP (i
, specbits
))
10393 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
10395 /* Diagnose "__thread extern". Recall that this list
10396 is in the reverse order seen in the text. */
10397 if (i
== (int)RID_THREAD
)
10399 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
10400 error ("`__thread' before `extern'");
10401 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10402 error ("`__thread' before `static'");
10405 if (i
== (int)RID_EXTERN
10406 && TREE_PURPOSE (spec
) == error_mark_node
)
10407 /* This extern was part of a language linkage. */
10410 RIDBIT_SET (i
, specbits
);
10415 else if (TREE_CODE (id
) == TYPE_DECL
)
10418 error ("multiple declarations `%T' and `%T'", type
,
10422 type
= TREE_TYPE (id
);
10423 TREE_VALUE (spec
) = type
;
10429 error ("two or more data types in declaration of `%s'", name
);
10430 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
10432 register tree t
= lookup_name (id
, 1);
10433 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
10434 error ("`%s' fails to be a typedef or built in type",
10435 IDENTIFIER_POINTER (id
));
10438 type
= TREE_TYPE (t
);
10442 else if (id
!= error_mark_node
)
10443 /* Can't change CLASS nodes into RECORD nodes here! */
10450 /* See the code below that used this. */
10452 decl_attr
= DECL_ATTRIBUTES (typedef_decl
);
10454 typedef_type
= type
;
10456 /* No type at all: default to `int', and set DEFAULTED_INT
10457 because it was not a user-defined typedef. */
10459 if (type
== NULL_TREE
10460 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
10461 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10462 || RIDBIT_SETP (RID_LONG
, specbits
)
10463 || RIDBIT_SETP (RID_SHORT
, specbits
)))
10465 /* These imply 'int'. */
10466 type
= integer_type_node
;
10470 if (sfk
!= sfk_none
)
10471 type
= check_special_function_return_type (sfk
, type
,
10473 else if (type
== NULL_TREE
)
10479 /* We handle `main' specially here, because 'main () { }' is so
10480 common. With no options, it is allowed. With -Wreturn-type,
10481 it is a warning. It is only an error with -pedantic-errors. */
10482 is_main
= (funcdef_flag
10483 && dname
&& MAIN_NAME_P (dname
)
10484 && ctype
== NULL_TREE
10485 && in_namespace
== NULL_TREE
10486 && current_namespace
== global_namespace
);
10488 if (in_system_header
|| flag_ms_extensions
)
10489 /* Allow it, sigh. */;
10490 else if (pedantic
|| ! is_main
)
10491 pedwarn ("ISO C++ forbids declaration of `%s' with no type",
10493 else if (warn_return_type
)
10494 warning ("ISO C++ forbids declaration of `%s' with no type",
10497 type
= integer_type_node
;
10500 if (type
&& IMPLICIT_TYPENAME_P (type
))
10502 /* The implicit typename extension is deprecated and will be
10503 removed. Warn about its use now. */
10504 warning ("`%T' is implicitly a typename", type
);
10505 cp_deprecated ("implicit typename");
10507 /* Now remove its implicitness, so that we don't warn again.
10508 For instance this might be a typedef, and we do not want to
10509 warn on uses of the typedef itself. Simply clearing the
10510 TREE_TYPE is insufficient. */
10511 type
= copy_node (type
);
10512 TREE_TYPE (type
) = NULL_TREE
;
10517 /* Now process the modifiers that were specified
10518 and check for invalid combinations. */
10520 /* Long double is a special combination. */
10522 if (RIDBIT_SETP (RID_LONG
, specbits
)
10523 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
10525 RIDBIT_RESET (RID_LONG
, specbits
);
10526 type
= build_qualified_type (long_double_type_node
,
10527 cp_type_quals (type
));
10530 /* Check all other uses of type modifiers. */
10532 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10533 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10534 || RIDBIT_SETP (RID_LONG
, specbits
)
10535 || RIDBIT_SETP (RID_SHORT
, specbits
))
10539 if (TREE_CODE (type
) == REAL_TYPE
)
10540 error ("short, signed or unsigned invalid for `%s'", name
);
10541 else if (TREE_CODE (type
) != INTEGER_TYPE
)
10542 error ("long, short, signed or unsigned invalid for `%s'", name
);
10543 else if (RIDBIT_SETP (RID_LONG
, specbits
)
10544 && RIDBIT_SETP (RID_SHORT
, specbits
))
10545 error ("long and short specified together for `%s'", name
);
10546 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10547 || RIDBIT_SETP (RID_SHORT
, specbits
))
10549 error ("long or short specified with char for `%s'", name
);
10550 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10551 || RIDBIT_SETP (RID_SHORT
, specbits
))
10552 && TREE_CODE (type
) == REAL_TYPE
)
10553 error ("long or short specified with floating type for `%s'", name
);
10554 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10555 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
10556 error ("signed and unsigned given together for `%s'", name
);
10560 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
10562 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
10564 if (flag_pedantic_errors
)
10569 /* Discard the type modifiers if they are invalid. */
10572 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
10573 RIDBIT_RESET (RID_SIGNED
, specbits
);
10574 RIDBIT_RESET (RID_LONG
, specbits
);
10575 RIDBIT_RESET (RID_SHORT
, specbits
);
10580 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
10581 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
10583 error ("complex invalid for `%s'", name
);
10584 RIDBIT_RESET (RID_COMPLEX
, specbits
);
10587 /* Decide whether an integer type is signed or not.
10588 Optionally treat bitfields as signed by default. */
10589 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10592 It is implementation-defined whether a plain (neither
10593 explicitly signed or unsigned) char, short, int, or long
10594 bit-field is signed or unsigned.
10596 Naturally, we extend this to long long as well. Note that
10597 this does not include wchar_t. */
10598 || (bitfield
&& !flag_signed_bitfields
10599 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
10600 /* A typedef for plain `int' without `signed' can be
10601 controlled just like plain `int', but a typedef for
10602 `signed int' cannot be so controlled. */
10604 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
10605 && (TREE_CODE (type
) == INTEGER_TYPE
10606 || TREE_CODE (type
) == CHAR_TYPE
)
10607 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
10610 type
= long_long_unsigned_type_node
;
10611 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10612 type
= long_unsigned_type_node
;
10613 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10614 type
= short_unsigned_type_node
;
10615 else if (type
== char_type_node
)
10616 type
= unsigned_char_type_node
;
10617 else if (typedef_decl
)
10618 type
= c_common_unsigned_type (type
);
10620 type
= unsigned_type_node
;
10622 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10623 && type
== char_type_node
)
10624 type
= signed_char_type_node
;
10626 type
= long_long_integer_type_node
;
10627 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10628 type
= long_integer_type_node
;
10629 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10630 type
= short_integer_type_node
;
10632 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
10634 /* If we just have "complex", it is equivalent to
10635 "complex double", but if any modifiers at all are specified it is
10636 the complex form of TYPE. E.g, "complex short" is
10637 "complex short int". */
10639 if (defaulted_int
&& ! longlong
10640 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
10641 || RIDBIT_SETP (RID_SHORT
, specbits
)
10642 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10643 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
10644 type
= complex_double_type_node
;
10645 else if (type
== integer_type_node
)
10646 type
= complex_integer_type_node
;
10647 else if (type
== float_type_node
)
10648 type
= complex_float_type_node
;
10649 else if (type
== double_type_node
)
10650 type
= complex_double_type_node
;
10651 else if (type
== long_double_type_node
)
10652 type
= complex_long_double_type_node
;
10654 type
= build_complex_type (type
);
10657 type_quals
= TYPE_UNQUALIFIED
;
10658 if (RIDBIT_SETP (RID_CONST
, specbits
))
10659 type_quals
|= TYPE_QUAL_CONST
;
10660 if (RIDBIT_SETP (RID_VOLATILE
, specbits
))
10661 type_quals
|= TYPE_QUAL_VOLATILE
;
10662 if (RIDBIT_SETP (RID_RESTRICT
, specbits
))
10663 type_quals
|= TYPE_QUAL_RESTRICT
;
10664 if (sfk
== sfk_conversion
&& type_quals
!= TYPE_UNQUALIFIED
)
10665 error ("qualifiers are not allowed on declaration of `operator %T'",
10668 type_quals
|= cp_type_quals (type
);
10669 type
= cp_build_qualified_type_real
10670 (type
, type_quals
, ((typedef_decl
&& !DECL_ARTIFICIAL (typedef_decl
)
10671 ? tf_ignore_bad_quals
: 0) | tf_error
| tf_warning
));
10672 /* We might have ignored or rejected some of the qualifiers. */
10673 type_quals
= cp_type_quals (type
);
10676 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
10677 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
10678 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
10679 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
10680 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
10682 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10683 staticp
= 1 + (decl_context
== FIELD
);
10685 if (virtualp
&& staticp
== 2)
10687 error ("member `%D' cannot be declared both virtual and static",
10691 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
10692 RIDBIT_RESET (RID_FRIEND
, specbits
);
10694 if (dependant_name
&& !friendp
)
10696 error ("`%T::%D' is not a valid declarator", ctype
, dependant_name
);
10697 return void_type_node
;
10700 /* Warn if two storage classes are given. Default to `auto'. */
10702 if (RIDBIT_ANY_SET (specbits
))
10704 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
10705 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && !extern_langp
) nclasses
++;
10706 if (RIDBIT_SETP (RID_THREAD
, specbits
)) nclasses
++;
10707 if (decl_context
== PARM
&& nclasses
> 0)
10708 error ("storage class specifiers invalid in parameter declarations");
10709 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10711 if (decl_context
== PARM
)
10712 error ("typedef declaration invalid in parameter declaration");
10715 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
10716 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
10717 if (!nclasses
&& !friendp
&& extern_langp
)
10721 /* Give error if `virtual' is used outside of class declaration. */
10723 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
10725 error ("virtual outside class declaration");
10729 /* Static anonymous unions are dealt with here. */
10730 if (staticp
&& decl_context
== TYPENAME
10731 && TREE_CODE (declspecs
) == TREE_LIST
10732 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
10733 decl_context
= FIELD
;
10735 /* Warn about storage classes that are invalid for certain
10736 kinds of declarations (parameters, typenames, etc.). */
10738 /* "static __thread" and "extern __thread" are allowed. */
10740 && RIDBIT_SETP (RID_THREAD
, specbits
)
10741 && (RIDBIT_SETP (RID_EXTERN
, specbits
)
10742 || RIDBIT_SETP (RID_STATIC
, specbits
)))
10746 error ("multiple storage classes in declaration of `%s'", name
);
10747 else if (decl_context
!= NORMAL
&& nclasses
> 0)
10749 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
10750 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
10751 || RIDBIT_SETP (RID_AUTO
, specbits
)))
10753 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10755 else if (decl_context
== FIELD
10756 /* C++ allows static class elements */
10757 && RIDBIT_SETP (RID_STATIC
, specbits
))
10758 /* C++ also allows inlines and signed and unsigned elements,
10759 but in those cases we don't come in here. */
10763 if (decl_context
== FIELD
)
10765 tree tmp
= NULL_TREE
;
10766 register int op
= 0;
10770 /* Avoid trying to get an operand off an identifier node. */
10771 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10774 tmp
= TREE_OPERAND (declarator
, 0);
10775 op
= IDENTIFIER_OPNAME_P (tmp
);
10776 if (IDENTIFIER_TYPENAME_P (tmp
))
10778 if (IDENTIFIER_GLOBAL_VALUE (tmp
)
10779 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (tmp
))
10781 name
= IDENTIFIER_POINTER (tmp
);
10783 name
= "<invalid operator>";
10786 error ("storage class specified for %s `%s'",
10787 op
? "member operator" : "field",
10792 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10793 error ("storage class specified for parameter `%s'", name
);
10795 error ("storage class specified for typename");
10797 RIDBIT_RESET (RID_REGISTER
, specbits
);
10798 RIDBIT_RESET (RID_AUTO
, specbits
);
10799 RIDBIT_RESET (RID_EXTERN
, specbits
);
10800 RIDBIT_RESET (RID_THREAD
, specbits
);
10803 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
10805 if (toplevel_bindings_p ())
10807 /* It's common practice (and completely valid) to have a const
10808 be initialized and declared extern. */
10809 if (!(type_quals
& TYPE_QUAL_CONST
))
10810 warning ("`%s' initialized and declared `extern'", name
);
10813 error ("`%s' has both `extern' and initializer", name
);
10815 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
10816 && ! toplevel_bindings_p ())
10817 error ("nested function `%s' declared `extern'", name
);
10818 else if (toplevel_bindings_p ())
10820 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10821 error ("top-level declaration of `%s' specifies `auto'", name
);
10823 else if (RIDBIT_SETP (RID_THREAD
, specbits
)
10824 && !RIDBIT_SETP (RID_EXTERN
, specbits
)
10825 && !RIDBIT_SETP (RID_STATIC
, specbits
))
10827 error ("function-scope `%s' implicitly auto and declared `__thread'",
10829 RIDBIT_RESET (RID_THREAD
, specbits
);
10832 if (nclasses
> 0 && friendp
)
10833 error ("storage class specifiers invalid in friend function declarations");
10835 /* Now figure out the structure of the declarator proper.
10836 Descend through it, creating more complex types, until we reach
10837 the declared identifier (or NULL_TREE, in an abstract declarator). */
10839 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
10840 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
10842 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
10843 an INDIRECT_REF (for *...),
10844 a CALL_EXPR (for ...(...)),
10845 an identifier (for the name being declared)
10846 or a null pointer (for the place in an absolute declarator
10847 where the name was omitted).
10848 For the last two cases, we have just exited the loop.
10850 For C++ it could also be
10851 a SCOPE_REF (for class :: ...). In this case, we have converted
10852 sensible names to types, and those are the values we use to
10853 qualify the member name.
10854 an ADDR_EXPR (for &...),
10855 a BIT_NOT_EXPR (for destructors)
10857 At this point, TYPE is the type of elements of an array,
10858 or for a function to return, or for a pointer to point to.
10859 After this sequence of ifs, TYPE is the type of the
10860 array or function or pointer, and DECLARATOR has had its
10861 outermost layer removed. */
10863 if (type
== error_mark_node
)
10865 if (TREE_CODE (declarator
) == SCOPE_REF
)
10866 declarator
= TREE_OPERAND (declarator
, 1);
10868 declarator
= TREE_OPERAND (declarator
, 0);
10871 if (quals
!= NULL_TREE
10872 && (declarator
== NULL_TREE
10873 || TREE_CODE (declarator
) != SCOPE_REF
))
10875 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
10876 ctype
= TYPE_METHOD_BASETYPE (type
);
10877 if (ctype
!= NULL_TREE
)
10879 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
10880 grok_method_quals (ctype
, dummy
, quals
);
10881 type
= TREE_TYPE (dummy
);
10882 ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
)));
10887 switch (TREE_CODE (declarator
))
10891 /* We encode a declarator with embedded attributes using
10893 tree attrs
= TREE_PURPOSE (declarator
);
10897 declarator
= TREE_VALUE (declarator
);
10898 inner_decl
= declarator
;
10899 while (inner_decl
!= NULL_TREE
10900 && TREE_CODE (inner_decl
) == TREE_LIST
)
10901 inner_decl
= TREE_VALUE (inner_decl
);
10903 if (inner_decl
== NULL_TREE
10904 || TREE_CODE (inner_decl
) == IDENTIFIER_NODE
)
10905 attr_flags
|= (int) ATTR_FLAG_DECL_NEXT
;
10906 if (TREE_CODE (inner_decl
) == CALL_EXPR
)
10907 attr_flags
|= (int) ATTR_FLAG_FUNCTION_NEXT
;
10908 if (TREE_CODE (inner_decl
) == ARRAY_REF
)
10909 attr_flags
|= (int) ATTR_FLAG_ARRAY_NEXT
;
10910 returned_attrs
= decl_attributes (&type
,
10911 chainon (returned_attrs
, attrs
),
10918 register tree size
;
10920 size
= TREE_OPERAND (declarator
, 1);
10922 /* VC++ spells a zero-sized array with []. */
10923 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
10924 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10925 size
= integer_zero_node
;
10927 declarator
= TREE_OPERAND (declarator
, 0);
10929 type
= create_array_type_for_decl (dname
, type
, size
);
10939 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
10940 tree inner_decl
= TREE_OPERAND (declarator
, 0);
10942 /* Declaring a function type.
10943 Make sure we have a valid type for the function to return. */
10945 /* We now know that the TYPE_QUALS don't apply to the
10946 decl, but to its return type. */
10947 type_quals
= TYPE_UNQUALIFIED
;
10949 /* Warn about some types functions can't return. */
10951 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10953 error ("`%s' declared as function returning a function", name
);
10954 type
= integer_type_node
;
10956 if (TREE_CODE (type
) == ARRAY_TYPE
)
10958 error ("`%s' declared as function returning an array", name
);
10959 type
= integer_type_node
;
10962 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
10963 inner_decl
= TREE_OPERAND (inner_decl
, 1);
10965 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
10966 inner_decl
= dname
;
10968 /* Pick up type qualifiers which should be applied to `this'. */
10969 quals
= CALL_DECLARATOR_QUALS (declarator
);
10971 /* Pick up the exception specifications. */
10972 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
10974 /* Say it's a definition only for the CALL_EXPR
10975 closest to the identifier. */
10978 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
10979 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
10980 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
10982 if (ctype
== NULL_TREE
10983 && decl_context
== FIELD
10985 && (friendp
== 0 || dname
== current_class_name
))
10986 ctype
= current_class_type
;
10988 if (ctype
&& sfk
== sfk_conversion
)
10989 TYPE_HAS_CONVERSION (ctype
) = 1;
10990 if (ctype
&& constructor_name (ctype
) == dname
)
10992 /* We are within a class's scope. If our declarator name
10993 is the same as the class name, and we are defining
10994 a function, then it is a constructor/destructor, and
10995 therefore returns a void type. */
10997 if (flags
== DTOR_FLAG
)
10999 /* ISO C++ 12.4/2. A destructor may not be
11000 declared const or volatile. A destructor may
11003 error ("destructor cannot be static member function");
11006 error ("destructors may not be `%s'",
11007 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
11010 if (decl_context
== FIELD
)
11012 if (! member_function_or_else (ctype
,
11013 current_class_type
,
11015 return void_type_node
;
11018 else /* It's a constructor. */
11020 if (explicitp
== 1)
11022 /* ISO C++ 12.1. A constructor may not be
11023 declared const or volatile. A constructor may
11024 not be virtual. A constructor may not be
11027 error ("constructor cannot be static member function");
11030 pedwarn ("constructors cannot be declared virtual");
11035 error ("constructors may not be `%s'",
11036 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
11040 RID_BIT_TYPE tmp_bits
;
11041 memcpy (&tmp_bits
, &specbits
, sizeof (RID_BIT_TYPE
));
11042 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
11043 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
11044 if (RIDBIT_ANY_SET (tmp_bits
))
11045 error ("return value type specifier for constructor ignored");
11047 if (decl_context
== FIELD
)
11049 if (! member_function_or_else (ctype
,
11050 current_class_type
,
11052 return void_type_node
;
11053 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
11054 if (sfk
!= sfk_constructor
)
11058 if (decl_context
== FIELD
)
11064 error ("can't initialize friend function `%s'", name
);
11067 /* Cannot be both friend and virtual. */
11068 error ("virtual functions cannot be friends");
11069 RIDBIT_RESET (RID_FRIEND
, specbits
);
11072 if (decl_context
== NORMAL
)
11073 error ("friend declaration not in class definition");
11074 if (current_function_decl
&& funcdef_flag
)
11075 error ("can't define friend function `%s' in a local class definition",
11079 /* Construct the function type and go to the next
11080 inner layer of declarator. */
11082 declarator
= TREE_OPERAND (declarator
, 0);
11084 /* FIXME: This is where default args should be fully
11087 arg_types
= grokparms (inner_parms
);
11089 if (declarator
&& flags
== DTOR_FLAG
)
11091 /* A destructor declared in the body of a class will
11092 be represented as a BIT_NOT_EXPR. But, we just
11093 want the underlying IDENTIFIER. */
11094 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
11095 declarator
= TREE_OPERAND (declarator
, 0);
11097 if (arg_types
!= void_list_node
)
11099 error ("destructors may not have parameters");
11100 arg_types
= void_list_node
;
11101 last_function_parms
= NULL_TREE
;
11105 /* ANSI says that `const int foo ();'
11106 does not make the function foo const. */
11107 type
= build_function_type (type
, arg_types
);
11111 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
11112 if (TREE_PURPOSE (t
)
11113 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
11115 add_defarg_fn (type
);
11124 /* Filter out pointers-to-references and references-to-references.
11125 We can get these if a TYPE_DECL is used. */
11127 if (TREE_CODE (type
) == REFERENCE_TYPE
)
11129 error (TREE_CODE (declarator
) == ADDR_EXPR
11130 ? "cannot declare reference to `%#T'"
11131 : "cannot declare pointer to `%#T'", type
);
11132 type
= TREE_TYPE (type
);
11134 else if (VOID_TYPE_P (type
)
11135 && (ctype
|| TREE_CODE (declarator
) == ADDR_EXPR
))
11136 error (ctype
? "cannot declare pointer to `%#T' member"
11137 : "cannot declare reference to `%#T'", type
);
11139 /* Merge any constancy or volatility into the target type
11140 for the pointer. */
11142 /* We now know that the TYPE_QUALS don't apply to the decl,
11143 but to the target of the pointer. */
11144 type_quals
= TYPE_UNQUALIFIED
;
11146 if (TREE_CODE (declarator
) == ADDR_EXPR
)
11148 if (!VOID_TYPE_P (type
))
11149 type
= build_reference_type (type
);
11151 else if (TREE_CODE (type
) == METHOD_TYPE
)
11152 type
= build_ptrmemfunc_type (build_pointer_type (type
));
11154 type
= build_ptrmem_type (ctype
, type
);
11156 type
= build_pointer_type (type
);
11158 /* Process a list of type modifier keywords (such as
11159 const or volatile) that were given inside the `*' or `&'. */
11161 if (TREE_TYPE (declarator
))
11163 register tree typemodlist
;
11169 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
11170 typemodlist
= TREE_CHAIN (typemodlist
))
11172 tree qualifier
= TREE_VALUE (typemodlist
);
11174 if (qualifier
== ridpointers
[(int) RID_CONST
])
11177 type_quals
|= TYPE_QUAL_CONST
;
11179 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
11182 type_quals
|= TYPE_QUAL_VOLATILE
;
11184 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
11187 type_quals
|= TYPE_QUAL_RESTRICT
;
11192 error ("invalid type modifier within pointer declarator");
11196 pedwarn ("duplicate `const'");
11198 pedwarn ("duplicate `volatile'");
11200 pedwarn ("duplicate `restrict'");
11201 type
= cp_build_qualified_type (type
, type_quals
);
11202 type_quals
= cp_type_quals (type
);
11204 declarator
= TREE_OPERAND (declarator
, 0);
11210 /* We have converted type names to NULL_TREE if the
11211 name was bogus, or to a _TYPE node, if not.
11213 The variable CTYPE holds the type we will ultimately
11214 resolve to. The code here just needs to build
11215 up appropriate member types. */
11216 tree sname
= TREE_OPERAND (declarator
, 1);
11219 /* Destructors can have their visibilities changed as well. */
11220 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
11221 sname
= TREE_OPERAND (sname
, 0);
11223 if (TREE_COMPLEXITY (declarator
) == 0)
11224 /* This needs to be here, in case we are called
11225 multiple times. */ ;
11226 else if (TREE_COMPLEXITY (declarator
) == -1)
11227 /* Namespace member. */
11228 pop_decl_namespace ();
11229 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
11230 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
11231 else if (! IS_AGGR_TYPE_CODE
11232 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
11234 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
11236 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
11237 that refer to ctype. They couldn't be resolved earlier
11238 because we hadn't pushed into the class yet.
11239 Example: resolve 'B<T>::type' in
11240 'B<typename B<T>::type> B<T>::f () { }'. */
11241 if (current_template_parms
11242 && uses_template_parms (type
)
11243 && uses_template_parms (current_class_type
))
11245 tree args
= current_template_args ();
11246 type
= tsubst (type
, args
, tf_error
| tf_warning
,
11250 /* This pop_nested_class corresponds to the
11251 push_nested_class used to push into class scope for
11252 parsing the argument list of a function decl, in
11254 pop_nested_class ();
11255 TREE_COMPLEXITY (declarator
) = current_class_depth
;
11260 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
11262 /* We had a reference to a global decl, or
11263 perhaps we were given a non-aggregate typedef,
11264 in which case we cleared this out, and should just
11265 keep going as though it wasn't there. */
11266 declarator
= sname
;
11269 ctype
= TREE_OPERAND (declarator
, 0);
11272 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
11274 /* You're supposed to have one `template <...>'
11275 for every template class, but you don't need one
11276 for a full specialization. For example:
11278 template <class T> struct S{};
11279 template <> struct S<int> { void f(); };
11280 void S<int>::f () {}
11282 is correct; there shouldn't be a `template <>' for
11283 the definition of `S<int>::f'. */
11284 if (CLASSTYPE_TEMPLATE_INFO (t
)
11285 && (CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
11286 || uses_template_parms (CLASSTYPE_TI_ARGS (t
)))
11287 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
)))
11288 template_count
+= 1;
11290 t
= TYPE_MAIN_DECL (t
);
11291 t
= DECL_CONTEXT (t
);
11294 if (sname
== NULL_TREE
)
11297 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
11299 /* This is the `standard' use of the scoping operator:
11300 basetype :: member . */
11302 if (ctype
== current_class_type
)
11308 Is this ill-formed? */
11311 pedwarn ("extra qualification `%T::' on member `%s' ignored",
11314 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11316 if (current_class_type
== NULL_TREE
|| friendp
)
11317 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11318 TYPE_ARG_TYPES (type
));
11321 error ("cannot declare member function `%T::%s' within `%T'",
11322 ctype
, name
, current_class_type
);
11323 return void_type_node
;
11326 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
11327 || COMPLETE_TYPE_P (complete_type (ctype
)))
11329 /* Have to move this code elsewhere in this function.
11330 this code is used for i.e., typedef int A::M; M *pm;
11332 It is? How? jason 10/2/94 */
11334 if (current_class_type
)
11336 error ("cannot declare member `%T::%s' within `%T'",
11337 ctype
, name
, current_class_type
);
11338 return void_type_node
;
11343 cxx_incomplete_type_error (NULL_TREE
, ctype
);
11344 return error_mark_node
;
11347 declarator
= sname
;
11349 else if (TREE_CODE (sname
) == SCOPE_REF
)
11354 declarator
= TREE_OPERAND (declarator
, 1);
11355 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
11356 /* In this case, we will deal with it later. */
11358 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11359 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11360 TYPE_ARG_TYPES (type
));
11366 declarator
= TREE_OPERAND (declarator
, 0);
11370 declarator
= BASELINK_FUNCTIONS (declarator
);
11375 case ENUMERAL_TYPE
:
11376 declarator
= NULL_TREE
;
11380 declarator
= NULL_TREE
;
11388 if (returned_attrs
)
11391 *attrlist
= chainon (returned_attrs
, *attrlist
);
11393 attrlist
= &returned_attrs
;
11396 /* Now TYPE has the actual type. */
11398 /* Did array size calculations overflow? */
11400 if (TREE_CODE (type
) == ARRAY_TYPE
11401 && COMPLETE_TYPE_P (type
)
11402 && TREE_OVERFLOW (TYPE_SIZE (type
)))
11404 error ("size of array `%s' is too large", name
);
11405 /* If we proceed with the array type as it is, we'll eventually
11406 crash in tree_low_cst(). */
11407 type
= error_mark_node
;
11410 if (decl_context
== FIELD
11411 && !processing_template_decl
11412 && variably_modified_type_p (type
))
11414 error ("data member may not have variably modified type `%T'", type
);
11415 type
= error_mark_node
;
11418 if (explicitp
== 1 || (explicitp
&& friendp
))
11420 /* [dcl.fct.spec] The explicit specifier shall only be used in
11421 declarations of constructors within a class definition. */
11422 error ("only declarations of constructors can be `explicit'");
11426 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11428 if (current_class_name
== NULL_TREE
|| decl_context
== PARM
|| friendp
)
11430 error ("non-member `%s' cannot be declared `mutable'", name
);
11431 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11433 else if (decl_context
== TYPENAME
|| RIDBIT_SETP (RID_TYPEDEF
, specbits
))
11435 error ("non-object member `%s' cannot be declared `mutable'", name
);
11436 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11438 else if (TREE_CODE (type
) == FUNCTION_TYPE
11439 || TREE_CODE (type
) == METHOD_TYPE
)
11441 error ("function `%s' cannot be declared `mutable'", name
);
11442 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11446 error ("static `%s' cannot be declared `mutable'", name
);
11447 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11449 else if (type_quals
& TYPE_QUAL_CONST
)
11451 error ("const `%s' cannot be declared `mutable'", name
);
11452 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11456 if (declarator
== NULL_TREE
11457 || TREE_CODE (declarator
) == IDENTIFIER_NODE
11458 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
11459 && (TREE_CODE (type
) == FUNCTION_TYPE
11460 || TREE_CODE (type
) == METHOD_TYPE
)))
11462 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11464 error ("template-id `%D' used as a declarator", declarator
);
11465 declarator
= dname
;
11468 /* Unexpected declarator format. */
11471 /* If this is declaring a typedef name, return a TYPE_DECL. */
11473 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
11477 /* Note that the grammar rejects storage classes
11478 in typenames, fields or parameters. */
11479 if (current_lang_name
== lang_name_java
)
11480 TYPE_FOR_JAVA (type
) = 1;
11482 if (decl_context
== FIELD
)
11484 if (declarator
== constructor_name (current_class_type
))
11485 pedwarn ("ISO C++ forbids nested type `%D' with same name as enclosing class",
11487 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
11491 decl
= build_decl (TYPE_DECL
, declarator
, type
);
11492 if (!current_function_decl
)
11493 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
11496 /* If the user declares "typedef struct {...} foo" then the
11497 struct will have an anonymous name. Fill that name in now.
11498 Nothing can refer to it, so nothing needs know about the name
11500 if (type
!= error_mark_node
11502 && TYPE_NAME (type
)
11503 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
11504 && TYPE_ANONYMOUS_P (type
)
11505 /* Don't do this if there are attributes. */
11506 && (!attrlist
|| !*attrlist
)
11507 && cp_type_quals (type
) == TYPE_UNQUALIFIED
)
11509 tree oldname
= TYPE_NAME (type
);
11512 /* Replace the anonymous name with the real name everywhere. */
11513 lookup_tag_reverse (type
, declarator
);
11514 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
11515 if (TYPE_NAME (t
) == oldname
)
11516 TYPE_NAME (t
) = decl
;
11518 if (TYPE_LANG_SPECIFIC (type
))
11519 TYPE_WAS_ANONYMOUS (type
) = 1;
11521 /* If this is a typedef within a template class, the nested
11522 type is a (non-primary) template. The name for the
11523 template needs updating as well. */
11524 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
11525 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
11526 = TYPE_IDENTIFIER (type
);
11528 /* FIXME remangle member functions; member functions of a
11529 type with external linkage have external linkage. */
11532 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11534 cp_error_at ("typedef name may not be class-qualified", decl
);
11539 if (ctype
== NULL_TREE
)
11541 if (TREE_CODE (type
) != METHOD_TYPE
)
11542 cp_error_at ("invalid type qualifier for non-member function type", decl
);
11544 ctype
= TYPE_METHOD_BASETYPE (type
);
11546 if (ctype
!= NULL_TREE
)
11547 grok_method_quals (ctype
, decl
, quals
);
11550 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
11551 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
11552 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
11554 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
11555 inlinep
, friendp
, raises
!= NULL_TREE
);
11560 /* Detect the case of an array type of unspecified size
11561 which came, as such, direct from a typedef name.
11562 We must copy the type, so that the array's domain can be
11563 individually set by the object's initializer. */
11565 if (type
&& typedef_type
11566 && TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
)
11567 && TYPE_MAIN_VARIANT (type
) == TYPE_MAIN_VARIANT (typedef_type
))
11568 type
= build_cplus_array_type (TREE_TYPE (type
), NULL_TREE
);
11570 /* Detect where we're using a typedef of function type to declare a
11571 function. last_function_parms will not be set, so we must create
11574 if (type
== typedef_type
&& TREE_CODE (type
) == FUNCTION_TYPE
)
11576 tree decls
= NULL_TREE
;
11579 for (args
= TYPE_ARG_TYPES (type
); args
; args
= TREE_CHAIN (args
))
11581 tree decl
= cp_build_parm_decl (NULL_TREE
, TREE_VALUE (args
));
11583 TREE_CHAIN (decl
) = decls
;
11587 last_function_parms
= nreverse (decls
);
11590 /* If this is a type name (such as, in a cast or sizeof),
11591 compute the type and return it now. */
11593 if (decl_context
== TYPENAME
)
11595 /* Note that the grammar rejects storage classes
11596 in typenames, fields or parameters. */
11597 if (type_quals
!= TYPE_UNQUALIFIED
)
11598 type_quals
= TYPE_UNQUALIFIED
;
11600 /* Special case: "friend class foo" looks like a TYPENAME context. */
11603 if (type_quals
!= TYPE_UNQUALIFIED
)
11605 error ("type qualifiers specified for friend class declaration");
11606 type_quals
= TYPE_UNQUALIFIED
;
11610 error ("`inline' specified for friend class declaration");
11614 /* Until core issue 180 is resolved, allow 'friend typename A::B'.
11615 But don't allow implicit typenames except with a class-key. */
11616 if (!current_aggr
&& (TREE_CODE (type
) != TYPENAME_TYPE
11617 || IMPLICIT_TYPENAME_P (type
)))
11619 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
11620 pedwarn ("template parameters cannot be friends");
11621 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
11623 friend declaration requires class-key, i.e. `friend class %T::%T'",
11624 constructor_name (current_class_type
),
11625 TYPE_IDENTIFIER (type
));
11628 friend declaration requires class-key, i.e. `friend %#T'",
11632 /* Only try to do this stuff if we didn't already give up. */
11633 if (type
!= integer_type_node
)
11635 decl_type_access_control (TYPE_NAME (type
));
11637 /* A friendly class? */
11638 if (current_class_type
)
11639 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
11641 error ("trying to make class `%T' a friend of global scope",
11644 type
= void_type_node
;
11649 if (ctype
== NULL_TREE
)
11651 if (TREE_CODE (type
) != METHOD_TYPE
)
11652 error ("invalid qualifiers on non-member function type");
11654 ctype
= TYPE_METHOD_BASETYPE (type
);
11658 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
11659 grok_method_quals (ctype
, dummy
, quals
);
11660 type
= TREE_TYPE (dummy
);
11666 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
11667 && decl_context
!= CATCHPARM
11668 && TREE_CODE (type
) != UNION_TYPE
11671 error ("abstract declarator `%T' used as declaration", type
);
11672 declarator
= make_anon_name ();
11675 /* `void' at top level (not within pointer)
11676 is allowed only in typedefs or type names.
11677 We don't complain about parms either, but that is because
11678 a better error message can be made later. */
11680 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
11683 error ("unnamed variable or field declared void");
11684 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
11686 if (IDENTIFIER_OPNAME_P (declarator
))
11689 error ("variable or field `%s' declared void", name
);
11692 error ("variable or field declared void");
11693 type
= integer_type_node
;
11696 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
11697 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
11699 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
11701 if (ctype
|| in_namespace
)
11702 error ("cannot use `::' in parameter declaration");
11704 /* A parameter declared as an array of T is really a pointer to T.
11705 One declared as a function is really a pointer to a function.
11706 One declared as a member is really a pointer to member. */
11708 if (TREE_CODE (type
) == ARRAY_TYPE
)
11710 /* Transfer const-ness of array into that of type pointed to. */
11711 type
= build_pointer_type (TREE_TYPE (type
));
11712 type_quals
= TYPE_UNQUALIFIED
;
11714 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11715 type
= build_pointer_type (type
);
11716 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11717 type
= build_pointer_type (type
);
11721 register tree decl
;
11723 if (decl_context
== PARM
)
11725 decl
= cp_build_parm_decl (declarator
, type
);
11727 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
11728 inlinep
, friendp
, raises
!= NULL_TREE
);
11730 else if (decl_context
== FIELD
)
11732 if (type
== error_mark_node
)
11734 /* Happens when declaring arrays of sizes which
11735 are error_mark_node, for example. */
11738 else if (in_namespace
&& !friendp
)
11740 /* Something like struct S { int N::j; }; */
11741 error ("invalid use of `::'");
11744 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11747 tree function_context
;
11749 /* We catch the others as conflicts with the builtin
11751 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
11753 error ("function `%D' cannot be declared friend",
11760 if (ctype
== NULL_TREE
)
11761 ctype
= current_class_type
;
11763 if (ctype
== NULL_TREE
)
11765 error ("can't make `%D' into a method -- not in a class",
11767 return void_type_node
;
11770 /* ``A union may [ ... ] not [ have ] virtual functions.''
11772 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
11774 error ("function `%D' declared virtual inside a union",
11776 return void_type_node
;
11779 if (declarator
== ansi_opname (NEW_EXPR
)
11780 || declarator
== ansi_opname (VEC_NEW_EXPR
)
11781 || declarator
== ansi_opname (DELETE_EXPR
)
11782 || declarator
== ansi_opname (VEC_DELETE_EXPR
))
11786 error ("`%D' cannot be declared virtual, since it is always static",
11791 else if (staticp
< 2)
11792 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11793 TYPE_ARG_TYPES (type
));
11796 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
11797 function_context
= (ctype
!= NULL_TREE
) ?
11798 decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
11799 publicp
= (! friendp
|| ! staticp
)
11800 && function_context
== NULL_TREE
;
11801 decl
= grokfndecl (ctype
, type
,
11802 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
11803 ? declarator
: dname
,
11805 virtualp
, flags
, quals
, raises
,
11806 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
11807 funcdef_flag
, template_count
, in_namespace
);
11808 if (decl
== NULL_TREE
)
11811 /* This clobbers the attrs stored in `decl' from `attrlist'. */
11812 /* The decl and setting of decl_attr is also turned off. */
11813 decl
= build_decl_attribute_variant (decl
, decl_attr
);
11816 /* [class.conv.ctor]
11818 A constructor declared without the function-specifier
11819 explicit that can be called with a single parameter
11820 specifies a conversion from the type of its first
11821 parameter to the type of its class. Such a constructor
11822 is called a converting constructor. */
11823 if (explicitp
== 2)
11824 DECL_NONCONVERTING_P (decl
) = 1;
11825 else if (DECL_CONSTRUCTOR_P (decl
))
11827 /* The constructor can be called with exactly one
11828 parameter if there is at least one parameter, and
11829 any subsequent parameters have default arguments.
11830 Ignore any compiler-added parms. */
11831 tree arg_types
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
11833 if (arg_types
== void_list_node
11835 && TREE_CHAIN (arg_types
)
11836 && TREE_CHAIN (arg_types
) != void_list_node
11837 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
11838 DECL_NONCONVERTING_P (decl
) = 1;
11841 else if (TREE_CODE (type
) == METHOD_TYPE
)
11843 /* We only get here for friend declarations of
11844 members of other classes. */
11845 /* All method decls are public, so tell grokfndecl to set
11846 TREE_PUBLIC, also. */
11847 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
11848 virtualp
, flags
, quals
, raises
,
11849 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
11850 template_count
, in_namespace
);
11851 if (decl
== NULL_TREE
)
11854 else if (!staticp
&& ! processing_template_decl
11855 && !COMPLETE_TYPE_P (complete_type (type
))
11856 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
11859 error ("field `%D' has incomplete type", declarator
);
11861 error ("name `%T' has incomplete type", type
);
11863 /* If we're instantiating a template, tell them which
11864 instantiation made the field's type be incomplete. */
11865 if (current_class_type
11866 && TYPE_NAME (current_class_type
)
11867 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
11868 && declspecs
&& TREE_VALUE (declspecs
)
11869 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
11870 error (" in instantiation of template `%T'",
11871 current_class_type
);
11873 type
= error_mark_node
;
11880 error ("`%s' is neither function nor member function; cannot be declared friend",
11881 IDENTIFIER_POINTER (declarator
));
11889 /* Friends are treated specially. */
11890 if (ctype
== current_class_type
)
11891 warning ("member functions are implicitly friends of their class");
11894 tree t
= NULL_TREE
;
11895 if (decl
&& DECL_NAME (decl
))
11897 if (template_class_depth (current_class_type
) == 0)
11900 = check_explicit_specialization
11902 template_count
, 2 * (funcdef_flag
!= 0) + 4);
11903 if (decl
== error_mark_node
)
11904 return error_mark_node
;
11907 t
= do_friend (ctype
, declarator
, decl
,
11908 last_function_parms
, *attrlist
,
11909 flags
, quals
, funcdef_flag
);
11911 if (t
&& funcdef_flag
)
11914 return void_type_node
;
11918 /* Structure field. It may not be a function, except for C++ */
11920 if (decl
== NULL_TREE
)
11926 /* An attempt is being made to initialize a non-static
11927 member. But, from [class.mem]:
11929 4 A member-declarator can contain a
11930 constant-initializer only if it declares a static
11931 member (_class.static_) of integral or enumeration
11932 type, see _class.static.data_.
11934 This used to be relatively common practice, but
11935 the rest of the compiler does not correctly
11936 handle the initialization unless the member is
11937 static so we make it static below. */
11938 pedwarn ("ISO C++ forbids initialization of member `%D'",
11940 pedwarn ("making `%D' static", declarator
);
11944 if (uses_template_parms (type
))
11945 /* We'll check at instantiation time. */
11947 else if (check_static_variable_definition (declarator
,
11949 /* If we just return the declaration, crashes
11950 will sometimes occur. We therefore return
11951 void_type_node, as if this was a friend
11952 declaration, to cause callers to completely
11953 ignore this declaration. */
11954 return void_type_node
;
11957 /* 9.2p13 [class.mem] */
11958 if (declarator
== constructor_name (current_class_type
)
11959 /* The standard does not allow non-static data members
11960 here either, but we agreed at the 10/99 meeting
11961 to change that in TC 1 so that they are allowed in
11962 classes with no user-defined constructors. */
11964 pedwarn ("ISO C++ forbids static data member `%D' with same name as enclosing class",
11969 /* C++ allows static class members. All other work
11970 for this is done by grokfield. */
11971 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
11972 TREE_STATIC (decl
) = 1;
11973 /* In class context, 'static' means public access. */
11974 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
11978 decl
= build_decl (FIELD_DECL
, declarator
, type
);
11979 DECL_NONADDRESSABLE_P (decl
) = bitfield
;
11980 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11982 DECL_MUTABLE_P (decl
) = 1;
11983 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11987 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
11988 inlinep
, friendp
, raises
!= NULL_TREE
);
11991 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11993 tree original_name
;
11999 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
12000 original_name
= dname
;
12002 original_name
= declarator
;
12004 if (RIDBIT_SETP (RID_AUTO
, specbits
))
12005 error ("storage class `auto' invalid for function `%s'", name
);
12006 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
12007 error ("storage class `register' invalid for function `%s'", name
);
12008 else if (RIDBIT_SETP (RID_THREAD
, specbits
))
12009 error ("storage class `__thread' invalid for function `%s'", name
);
12011 /* Function declaration not at top level.
12012 Storage classes other than `extern' are not allowed
12013 and `extern' makes no difference. */
12014 if (! toplevel_bindings_p ()
12015 && (RIDBIT_SETP (RID_STATIC
, specbits
)
12016 || RIDBIT_SETP (RID_INLINE
, specbits
))
12019 if (RIDBIT_SETP (RID_STATIC
, specbits
))
12020 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
12022 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
12025 if (ctype
== NULL_TREE
)
12029 error ("virtual non-class function `%s'", name
);
12033 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
12034 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
12035 TYPE_ARG_TYPES (type
));
12037 /* Record presence of `static'. */
12038 publicp
= (ctype
!= NULL_TREE
12039 || RIDBIT_SETP (RID_EXTERN
, specbits
)
12040 || !RIDBIT_SETP (RID_STATIC
, specbits
));
12042 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
12043 virtualp
, flags
, quals
, raises
,
12045 publicp
, inlinep
, funcdef_flag
,
12046 template_count
, in_namespace
);
12047 if (decl
== NULL_TREE
)
12052 int invalid_static
= 0;
12054 /* Don't allow a static member function in a class, and forbid
12055 declaring main to be static. */
12056 if (TREE_CODE (type
) == METHOD_TYPE
)
12058 pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
12059 invalid_static
= 1;
12061 else if (current_function_decl
)
12063 /* FIXME need arm citation */
12064 error ("cannot declare static function inside another function");
12065 invalid_static
= 1;
12068 if (invalid_static
)
12071 RIDBIT_RESET (RID_STATIC
, specbits
);
12077 /* It's a variable. */
12079 /* An uninitialized decl with `extern' is a reference. */
12080 decl
= grokvardecl (type
, declarator
, &specbits
,
12082 (type_quals
& TYPE_QUAL_CONST
) != 0,
12083 ctype
? ctype
: in_namespace
);
12084 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
12085 inlinep
, friendp
, raises
!= NULL_TREE
);
12089 DECL_CONTEXT (decl
) = ctype
;
12092 pedwarn ("`static' may not be used when defining (as opposed to declaring) a static data member");
12094 RIDBIT_RESET (RID_STATIC
, specbits
);
12096 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
12098 error ("static member `%D' declared `register'", decl
);
12099 RIDBIT_RESET (RID_REGISTER
, specbits
);
12101 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
12103 pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
12105 RIDBIT_RESET (RID_EXTERN
, specbits
);
12110 my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE
, specbits
), 19990927);
12112 /* Record `register' declaration for warnings on &
12113 and in case doing stupid register allocation. */
12115 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
12116 DECL_REGISTER (decl
) = 1;
12118 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
12119 DECL_THIS_EXTERN (decl
) = 1;
12121 if (RIDBIT_SETP (RID_STATIC
, specbits
))
12122 DECL_THIS_STATIC (decl
) = 1;
12124 /* Record constancy and volatility. There's no need to do this
12125 when processing a template; we'll do this for the instantiated
12126 declaration based on the type of DECL. */
12127 if (!processing_template_decl
)
12128 c_apply_type_quals_to_decl (type_quals
, decl
);
12134 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
12135 An empty exprlist is a parmlist. An exprlist which
12136 contains only identifiers at the global level
12137 is a parmlist. Otherwise, it is an exprlist. */
12140 parmlist_is_exprlist (exprs
)
12143 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
12146 if (toplevel_bindings_p ())
12148 /* At the global level, if these are all identifiers,
12149 then it is a parmlist. */
12152 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
12154 exprs
= TREE_CHAIN (exprs
);
12161 /* Subroutine of start_function. Ensure that each of the parameter
12162 types (as listed in PARMS) is complete, as is required for a
12163 function definition. */
12166 require_complete_types_for_parms (parms
)
12169 for (; parms
; parms
= TREE_CHAIN (parms
))
12171 if (VOID_TYPE_P (TREE_TYPE (parms
)))
12172 /* grokparms will have already issued an error */
12173 TREE_TYPE (parms
) = error_mark_node
;
12174 else if (complete_type_or_else (TREE_TYPE (parms
), parms
))
12175 layout_decl (parms
, 0);
12177 TREE_TYPE (parms
) = error_mark_node
;
12181 /* Returns nonzero if T is a local variable. */
12184 local_variable_p (t
)
12187 if ((TREE_CODE (t
) == VAR_DECL
12188 /* A VAR_DECL with a context that is a _TYPE is a static data
12190 && !TYPE_P (CP_DECL_CONTEXT (t
))
12191 /* Any other non-local variable must be at namespace scope. */
12192 && !DECL_NAMESPACE_SCOPE_P (t
))
12193 || (TREE_CODE (t
) == PARM_DECL
))
12199 /* Returns nonzero if T is an automatic local variable or a label.
12200 (These are the declarations that need to be remapped when the code
12201 containing them is duplicated.) */
12204 nonstatic_local_decl_p (t
)
12207 return ((local_variable_p (t
) && !TREE_STATIC (t
))
12208 || TREE_CODE (t
) == LABEL_DECL
12209 || TREE_CODE (t
) == RESULT_DECL
);
12212 /* Like local_variable_p, but suitable for use as a tree-walking
12216 local_variable_p_walkfn (tp
, walk_subtrees
, data
)
12218 int *walk_subtrees ATTRIBUTE_UNUSED
;
12219 void *data ATTRIBUTE_UNUSED
;
12221 return ((local_variable_p (*tp
) && !DECL_ARTIFICIAL (*tp
))
12222 ? *tp
: NULL_TREE
);
12225 /* Check that ARG, which is a default-argument expression for a
12226 parameter DECL, is valid. Returns ARG, or ERROR_MARK_NODE, if
12227 something goes wrong. DECL may also be a _TYPE node, rather than a
12228 DECL, if there is no DECL available. */
12231 check_default_argument (decl
, arg
)
12238 if (TREE_CODE (arg
) == DEFAULT_ARG
)
12239 /* We get a DEFAULT_ARG when looking at an in-class declaration
12240 with a default argument. Ignore the argument for now; we'll
12241 deal with it after the class is complete. */
12244 if (processing_template_decl
|| uses_template_parms (arg
))
12245 /* We don't do anything checking until instantiation-time. Note
12246 that there may be uninstantiated arguments even for an
12247 instantiated function, since default arguments are not
12248 instantiated until they are needed. */
12257 decl_type
= TREE_TYPE (decl
);
12259 if (arg
== error_mark_node
12260 || decl
== error_mark_node
12261 || TREE_TYPE (arg
) == error_mark_node
12262 || decl_type
== error_mark_node
)
12263 /* Something already went wrong. There's no need to check
12265 return error_mark_node
;
12267 /* [dcl.fct.default]
12269 A default argument expression is implicitly converted to the
12271 if (!TREE_TYPE (arg
)
12272 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
12275 error ("default argument for `%#D' has type `%T'",
12276 decl
, TREE_TYPE (arg
));
12278 error ("default argument for parameter of type `%T' has type `%T'",
12279 decl_type
, TREE_TYPE (arg
));
12281 return error_mark_node
;
12284 /* [dcl.fct.default]
12286 Local variables shall not be used in default argument
12289 The keyword `this' shall not be used in a default argument of a
12290 member function. */
12291 var
= walk_tree_without_duplicates (&arg
, local_variable_p_walkfn
,
12295 error ("default argument `%E' uses local variable `%D'",
12297 return error_mark_node
;
12304 /* Decode the list of parameter types for a function type.
12305 Given the list of things declared inside the parens,
12306 return a list of types.
12308 We determine whether ellipsis parms are used by PARMLIST_ELLIPSIS_P
12309 flag. If unset, we append void_list_node. A parmlist declared
12310 as `(void)' is accepted as the empty parmlist.
12312 Also set last_function_parms to the chain of PARM_DECLs. */
12315 grokparms (first_parm
)
12318 tree result
= NULL_TREE
;
12319 tree decls
= NULL_TREE
;
12320 int ellipsis
= !first_parm
|| PARMLIST_ELLIPSIS_P (first_parm
);
12324 my_friendly_assert (!first_parm
|| TREE_PARMLIST (first_parm
), 20001115);
12326 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
12328 tree type
= NULL_TREE
;
12329 tree decl
= TREE_VALUE (parm
);
12330 tree init
= TREE_PURPOSE (parm
);
12333 chain
= TREE_CHAIN (parm
);
12334 /* @@ weak defense against parse errors. */
12335 if (TREE_CODE (decl
) != VOID_TYPE
12336 && TREE_CODE (decl
) != TREE_LIST
)
12338 /* Give various messages as the need arises. */
12339 if (TREE_CODE (decl
) == STRING_CST
)
12340 error ("invalid string constant `%E'", decl
);
12341 else if (TREE_CODE (decl
) == INTEGER_CST
)
12342 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
12346 if (parm
== void_list_node
)
12349 split_specs_attrs (TREE_PURPOSE (decl
), &specs
, &attrs
);
12350 decl
= grokdeclarator (TREE_VALUE (decl
), specs
,
12351 PARM
, init
!= NULL_TREE
, &attrs
);
12352 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
12356 cplus_decl_attributes (&decl
, attrs
, 0);
12358 type
= TREE_TYPE (decl
);
12359 if (VOID_TYPE_P (type
))
12361 if (same_type_p (type
, void_type_node
)
12362 && !DECL_NAME (decl
) && !result
&& !chain
&& !ellipsis
)
12363 /* this is a parmlist of `(void)', which is ok. */
12365 cxx_incomplete_type_error (decl
, type
);
12366 /* It's not a good idea to actually create parameters of
12367 type `void'; other parts of the compiler assume that a
12368 void type terminates the parameter list. */
12369 type
= error_mark_node
;
12370 TREE_TYPE (decl
) = error_mark_node
;
12373 if (type
!= error_mark_node
)
12375 /* Top-level qualifiers on the parameters are
12376 ignored for function types. */
12377 type
= TYPE_MAIN_VARIANT (type
);
12378 if (TREE_CODE (type
) == METHOD_TYPE
)
12380 error ("parameter `%D' invalidly declared method type", decl
);
12381 type
= build_pointer_type (type
);
12382 TREE_TYPE (decl
) = type
;
12384 else if (TREE_CODE (type
) == OFFSET_TYPE
)
12386 error ("parameter `%D' invalidly declared offset type", decl
);
12387 type
= build_pointer_type (type
);
12388 TREE_TYPE (decl
) = type
;
12390 else if (abstract_virtuals_error (decl
, type
))
12391 any_error
= 1; /* Seems like a good idea. */
12392 else if (POINTER_TYPE_P (type
))
12394 /* [dcl.fct]/6, parameter types cannot contain pointers
12395 (references) to arrays of unknown bound. */
12396 tree t
= TREE_TYPE (type
);
12397 int ptr
= TYPE_PTR_P (type
);
12401 if (TYPE_PTR_P (t
))
12403 else if (TREE_CODE (t
) != ARRAY_TYPE
)
12405 else if (!TYPE_DOMAIN (t
))
12409 if (TREE_CODE (t
) == ARRAY_TYPE
)
12410 error ("parameter `%D' includes %s to array of unknown bound `%T'",
12411 decl
, ptr
? "pointer" : "reference", t
);
12414 if (!any_error
&& init
)
12415 init
= check_default_argument (decl
, init
);
12420 TREE_CHAIN (decl
) = decls
;
12422 result
= tree_cons (init
, type
, result
);
12424 decls
= nreverse (decls
);
12425 result
= nreverse (result
);
12427 result
= chainon (result
, void_list_node
);
12428 last_function_parms
= decls
;
12434 /* D is a constructor or overloaded `operator='.
12436 Let T be the class in which D is declared. Then, this function
12439 -1 if D's is an ill-formed constructor or copy assignment operator
12440 whose first parameter is of type `T'.
12441 0 if D is not a copy constructor or copy assignment
12443 1 if D is a copy constructor or copy assignment operator whose
12444 first parameter is a reference to const qualified T.
12445 2 if D is a copy constructor or copy assignment operator whose
12446 first parameter is a reference to non-const qualified T.
12448 This function can be used as a predicate. Positive values indicate
12449 a copy constructor and nonzero values indicate a copy assignment
12460 my_friendly_assert (DECL_FUNCTION_MEMBER_P (d
), 20011208);
12462 if (DECL_TEMPLATE_INFO (d
) && is_member_template (DECL_TI_TEMPLATE (d
)))
12463 /* Instantiations of template member functions are never copy
12464 functions. Note that member functions of templated classes are
12465 represented as template functions internally, and we must
12466 accept those as copy functions. */
12469 args
= FUNCTION_FIRST_USER_PARMTYPE (d
);
12473 arg_type
= TREE_VALUE (args
);
12475 if (TYPE_MAIN_VARIANT (arg_type
) == DECL_CONTEXT (d
))
12477 /* Pass by value copy assignment operator. */
12480 else if (TREE_CODE (arg_type
) == REFERENCE_TYPE
12481 && TYPE_MAIN_VARIANT (TREE_TYPE (arg_type
)) == DECL_CONTEXT (d
))
12483 if (CP_TYPE_CONST_P (TREE_TYPE (arg_type
)))
12489 args
= TREE_CHAIN (args
);
12491 if (args
&& args
!= void_list_node
&& !TREE_PURPOSE (args
))
12492 /* There are more non-optional args. */
12498 /* Remember any special properties of member function DECL. */
12500 void grok_special_member_properties (decl
)
12503 if (!DECL_NONSTATIC_MEMBER_FUNCTION_P(decl
))
12504 ; /* Not special. */
12505 else if (DECL_CONSTRUCTOR_P (decl
))
12507 int ctor
= copy_fn_p (decl
);
12513 A non-template constructor for class X is a copy
12514 constructor if its first parameter is of type X&, const
12515 X&, volatile X& or const volatile X&, and either there
12516 are no other parameters or else all other parameters have
12517 default arguments. */
12518 TYPE_HAS_INIT_REF (DECL_CONTEXT (decl
)) = 1;
12520 TYPE_HAS_CONST_INIT_REF (DECL_CONTEXT (decl
)) = 1;
12522 else if (sufficient_parms_p (FUNCTION_FIRST_USER_PARMTYPE (decl
)))
12523 TYPE_HAS_DEFAULT_CONSTRUCTOR (DECL_CONTEXT (decl
)) = 1;
12525 else if (DECL_OVERLOADED_OPERATOR_P (decl
) == NOP_EXPR
)
12529 A non-template assignment operator for class X is a copy
12530 assignment operator if its parameter is of type X, X&, const
12531 X&, volatile X& or const volatile X&. */
12533 int assop
= copy_fn_p (decl
);
12537 TYPE_HAS_ASSIGN_REF (DECL_CONTEXT (decl
)) = 1;
12539 TYPE_HAS_CONST_ASSIGN_REF (DECL_CONTEXT (decl
)) = 1;
12540 if (DECL_PURE_VIRTUAL_P (decl
))
12541 TYPE_HAS_ABSTRACT_ASSIGN_REF (DECL_CONTEXT (decl
)) = 1;
12546 /* Check a constructor DECL has the correct form. Complains
12547 if the class has a constructor of the form X(X). */
12550 grok_ctor_properties (ctype
, decl
)
12553 int ctor_parm
= copy_fn_p (decl
);
12559 A declaration of a constructor for a class X is ill-formed if
12560 its first parameter is of type (optionally cv-qualified) X
12561 and either there are no other parameters or else all other
12562 parameters have default arguments.
12564 We *don't* complain about member template instantiations that
12565 have this form, though; they can occur as we try to decide
12566 what constructor to use during overload resolution. Since
12567 overload resolution will never prefer such a constructor to
12568 the non-template copy constructor (which is either explicitly
12569 or implicitly defined), there's no need to worry about their
12570 existence. Theoretically, they should never even be
12571 instantiated, but that's hard to forestall. */
12572 error ("invalid constructor; you probably meant `%T (const %T&)'",
12574 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
12581 /* An operator with this code is unary, but can also be binary. */
12585 enum tree_code code
;
12587 return (code
== INDIRECT_REF
12588 || code
== ADDR_EXPR
12589 || code
== CONVERT_EXPR
12590 || code
== NEGATE_EXPR
12591 || code
== PREINCREMENT_EXPR
12592 || code
== PREDECREMENT_EXPR
);
12595 /* An operator with this name can only be unary. */
12599 enum tree_code code
;
12601 return (code
== TRUTH_NOT_EXPR
12602 || code
== BIT_NOT_EXPR
12603 || code
== COMPONENT_REF
12604 || code
== TYPE_EXPR
);
12607 /* Do a little sanity-checking on how they declared their operator. */
12610 grok_op_properties (decl
, friendp
)
12614 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
12616 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
12617 tree name
= DECL_NAME (decl
);
12618 enum tree_code operator_code
;
12621 /* Count the number of arguments. */
12622 for (argtype
= argtypes
, arity
= 0;
12623 argtype
&& argtype
!= void_list_node
;
12624 argtype
= TREE_CHAIN (argtype
))
12627 if (current_class_type
== NULL_TREE
)
12630 if (DECL_CONV_FN_P (decl
))
12631 operator_code
= TYPE_EXPR
;
12635 #define DEF_OPERATOR(NAME, CODE, MANGLING, ARITY, ASSN_P) \
12636 if (ansi_opname (CODE) == name) \
12638 operator_code = (CODE); \
12641 else if (ansi_assopname (CODE) == name) \
12643 operator_code = (CODE); \
12644 DECL_ASSIGNMENT_OPERATOR_P (decl) = 1; \
12648 #include "operators.def"
12649 #undef DEF_OPERATOR
12654 my_friendly_assert (operator_code
!= LAST_CPLUS_TREE_CODE
, 20000526);
12655 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12659 switch (operator_code
)
12662 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
12666 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
12669 case COMPONENT_REF
:
12671 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
12675 TYPE_HAS_NEW_OPERATOR (current_class_type
) = 1;
12679 TYPE_GETS_DELETE (current_class_type
) |= 1;
12683 TYPE_HAS_ARRAY_NEW_OPERATOR (current_class_type
) = 1;
12686 case VEC_DELETE_EXPR
:
12687 TYPE_GETS_DELETE (current_class_type
) |= 2;
12695 if (operator_code
== NEW_EXPR
|| operator_code
== VEC_NEW_EXPR
)
12697 /* When the compiler encounters the definition of A::operator new, it
12698 doesn't look at the class declaration to find out if it's static. */
12700 revert_static_member_fn (decl
);
12702 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
12704 else if (operator_code
== DELETE_EXPR
|| operator_code
== VEC_DELETE_EXPR
)
12707 revert_static_member_fn (decl
);
12709 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
12713 /* An operator function must either be a non-static member function
12714 or have at least one parameter of a class, a reference to a class,
12715 an enumeration, or a reference to an enumeration. 13.4.0.6 */
12716 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
12718 if (operator_code
== TYPE_EXPR
12719 || operator_code
== CALL_EXPR
12720 || operator_code
== COMPONENT_REF
12721 || operator_code
== ARRAY_REF
12722 || operator_code
== NOP_EXPR
)
12723 error ("`%D' must be a nonstatic member function", decl
);
12728 if (DECL_STATIC_FUNCTION_P (decl
))
12729 error ("`%D' must be either a non-static member function or a non-member function", decl
);
12732 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
12734 tree arg
= TREE_VALUE (p
);
12735 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
12736 arg
= TREE_TYPE (arg
);
12738 /* This lets bad template code slip through. */
12739 if (IS_AGGR_TYPE (arg
)
12740 || TREE_CODE (arg
) == ENUMERAL_TYPE
12741 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
12742 || TREE_CODE (arg
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
12746 ("`%D' must have an argument of class or enumerated type",
12753 if (operator_code
== CALL_EXPR
)
12754 return; /* No restrictions on args. */
12756 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
12758 tree t
= TREE_TYPE (name
);
12761 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
12762 const char *what
= 0;
12765 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
12767 if (TREE_CODE (t
) == VOID_TYPE
)
12769 else if (t
== current_class_type
)
12770 what
= "the same type";
12771 /* Don't force t to be complete here. */
12772 else if (IS_AGGR_TYPE (t
)
12773 && COMPLETE_TYPE_P (t
)
12774 && DERIVED_FROM_P (t
, current_class_type
))
12775 what
= "a base class";
12778 warning ("conversion to %s%s will never use a type conversion operator",
12779 ref
? "a reference to " : "", what
);
12782 if (operator_code
== COND_EXPR
)
12785 error ("ISO C++ prohibits overloading operator ?:");
12787 else if (ambi_op_p (operator_code
))
12790 /* We pick the one-argument operator codes by default, so
12791 we don't have to change anything. */
12793 else if (arity
== 2)
12795 /* If we thought this was a unary operator, we now know
12796 it to be a binary operator. */
12797 switch (operator_code
)
12800 operator_code
= MULT_EXPR
;
12804 operator_code
= BIT_AND_EXPR
;
12808 operator_code
= PLUS_EXPR
;
12812 operator_code
= MINUS_EXPR
;
12815 case PREINCREMENT_EXPR
:
12816 operator_code
= POSTINCREMENT_EXPR
;
12819 case PREDECREMENT_EXPR
:
12820 operator_code
= POSTDECREMENT_EXPR
;
12827 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12829 if ((operator_code
== POSTINCREMENT_EXPR
12830 || operator_code
== POSTDECREMENT_EXPR
)
12831 && ! processing_template_decl
12832 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
12835 error ("postfix `%D' must take `int' as its argument",
12839 ("postfix `%D' must take `int' as its second argument",
12846 error ("`%D' must take either zero or one argument", decl
);
12848 error ("`%D' must take either one or two arguments", decl
);
12851 /* More Effective C++ rule 6. */
12853 && (operator_code
== POSTINCREMENT_EXPR
12854 || operator_code
== POSTDECREMENT_EXPR
12855 || operator_code
== PREINCREMENT_EXPR
12856 || operator_code
== PREDECREMENT_EXPR
))
12858 tree arg
= TREE_VALUE (argtypes
);
12859 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
12860 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
12861 arg
= TREE_TYPE (arg
);
12862 arg
= TYPE_MAIN_VARIANT (arg
);
12863 if (operator_code
== PREINCREMENT_EXPR
12864 || operator_code
== PREDECREMENT_EXPR
)
12866 if (TREE_CODE (ret
) != REFERENCE_TYPE
12867 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
12869 warning ("prefix `%D' should return `%T'", decl
,
12870 build_reference_type (arg
));
12874 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
12875 warning ("postfix `%D' should return `%T'", decl
, arg
);
12879 else if (unary_op_p (operator_code
))
12884 error ("`%D' must take `void'", decl
);
12886 error ("`%D' must take exactly one argument", decl
);
12889 else /* if (binary_op_p (operator_code)) */
12894 error ("`%D' must take exactly one argument", decl
);
12896 error ("`%D' must take exactly two arguments", decl
);
12899 /* More Effective C++ rule 7. */
12901 && (operator_code
== TRUTH_ANDIF_EXPR
12902 || operator_code
== TRUTH_ORIF_EXPR
12903 || operator_code
== COMPOUND_EXPR
))
12904 warning ("user-defined `%D' always evaluates both arguments",
12908 /* Effective C++ rule 23. */
12911 && !DECL_ASSIGNMENT_OPERATOR_P (decl
)
12912 && (operator_code
== PLUS_EXPR
12913 || operator_code
== MINUS_EXPR
12914 || operator_code
== TRUNC_DIV_EXPR
12915 || operator_code
== MULT_EXPR
12916 || operator_code
== TRUNC_MOD_EXPR
)
12917 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
12918 warning ("`%D' should return by value", decl
);
12920 /* [over.oper]/8 */
12921 for (; argtypes
&& argtypes
!= void_list_node
;
12922 argtypes
= TREE_CHAIN (argtypes
))
12923 if (TREE_PURPOSE (argtypes
))
12925 TREE_PURPOSE (argtypes
) = NULL_TREE
;
12926 if (operator_code
== POSTINCREMENT_EXPR
12927 || operator_code
== POSTDECREMENT_EXPR
)
12930 pedwarn ("`%D' cannot have default arguments", decl
);
12933 error ("`%D' cannot have default arguments", decl
);
12939 static const char *
12941 enum tag_types code
;
12958 /* Get the struct, enum or union (CODE says which) with tag NAME.
12959 Define the tag as a forward-reference if it is not defined.
12961 C++: If a class derivation is given, process it here, and report
12962 an error if multiple derivation declarations are not identical.
12964 If this is a definition, come in through xref_tag and only look in
12965 the current frame for the name (since C++ allows new names in any
12969 xref_tag (enum tag_types tag_code
, tree name
, tree attributes
,
12972 enum tree_code code
;
12973 register tree ref
, t
;
12974 struct cp_binding_level
*b
= current_binding_level
;
12975 tree context
= NULL_TREE
;
12981 code
= RECORD_TYPE
;
12987 code
= ENUMERAL_TYPE
;
12993 /* If a cross reference is requested, look up the type
12994 already defined for this tag and return it. */
12998 name
= TYPE_IDENTIFIER (t
);
13001 t
= IDENTIFIER_TYPE_VALUE (name
);
13003 /* Warn about 'friend struct Inherited;' doing the wrong thing. */
13004 if (t
&& globalize
&& TREE_CODE (t
) == TYPENAME_TYPE
)
13006 static int explained
;
13009 warning ("`%s %T' declares a new type at namespace scope",
13010 tag_name (tag_code
), name
);
13012 warning (" names from dependent base classes are not visible to unqualified name lookup - to refer to the inherited type, say `%s %T::%T'",
13013 tag_name (tag_code
),
13014 constructor_name (current_class_type
),
13015 TYPE_IDENTIFIER (t
));
13017 /* We need to remove the class scope binding for the
13018 TYPENAME_TYPE as otherwise poplevel_class gets confused. */
13019 for (shadowed
= b
->class_shadowed
;
13021 shadowed
= TREE_CHAIN (shadowed
))
13022 if (TREE_TYPE (shadowed
) == TYPE_NAME (t
))
13024 TREE_PURPOSE (shadowed
) = NULL_TREE
;
13029 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
13030 && TREE_CODE (t
) != BOUND_TEMPLATE_TEMPLATE_PARM
)
13035 /* If we know we are defining this tag, only look it up in
13036 this scope and don't try to find it as a type. */
13037 ref
= lookup_tag (code
, name
, b
, 1);
13043 ref
= follow_tag_typedef (t
);
13045 /* [dcl.type.elab] If the identifier resolves to a
13046 typedef-name or a template type-parameter, the
13047 elaborated-type-specifier is ill-formed. */
13050 pedwarn ("using typedef-name `%D' after `%s'",
13051 TYPE_NAME (t
), tag_name (tag_code
));
13054 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
13055 error ("using template type parameter `%T' after `%s'",
13056 t
, tag_name (tag_code
));
13059 ref
= lookup_tag (code
, name
, b
, 0);
13063 /* Try finding it as a type declaration. If that wins,
13065 ref
= lookup_name (name
, 1);
13067 if (ref
!= NULL_TREE
13068 && processing_template_decl
13069 && DECL_CLASS_TEMPLATE_P (ref
)
13070 && template_class_depth (current_class_type
) == 0)
13071 /* Since GLOBALIZE is true, we're declaring a global
13072 template, so we want this type. */
13073 ref
= DECL_TEMPLATE_RESULT (ref
);
13075 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
13076 && TREE_CODE (TREE_TYPE (ref
)) == code
)
13077 ref
= TREE_TYPE (ref
);
13082 if (ref
&& current_class_type
13083 && template_class_depth (current_class_type
)
13084 && PROCESSING_REAL_TEMPLATE_DECL_P ())
13086 /* Since GLOBALIZE is nonzero, we are not looking at a
13087 definition of this tag. Since, in addition, we are currently
13088 processing a (member) template declaration of a template
13089 class, we must be very careful; consider:
13096 { template <class V>
13097 friend struct S1; };
13099 Here, the S2::S1 declaration should not be confused with the
13100 outer declaration. In particular, the inner version should
13101 have a template parameter of level 2, not level 1. This
13102 would be particularly important if the member declaration
13105 template <class V = U> friend struct S1;
13107 say, when we should tsubst into `U' when instantiating
13108 S2. On the other hand, when presented with:
13118 we must find the inner binding eventually. We
13119 accomplish this by making sure that the new type we
13120 create to represent this declaration has the right
13122 context
= TYPE_CONTEXT (ref
);
13129 /* If no such tag is yet defined, create a forward-reference node
13130 and record it as the "definition".
13131 When a real declaration of this type is found,
13132 the forward-reference will be altered into a real type. */
13133 if (code
== ENUMERAL_TYPE
)
13135 error ("use of enum `%#D' without previous declaration", name
);
13137 ref
= make_node (ENUMERAL_TYPE
);
13139 /* Give the type a default layout like unsigned int
13140 to avoid crashing if it does not get defined. */
13141 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
13142 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
13143 TYPE_USER_ALIGN (ref
) = 0;
13144 TREE_UNSIGNED (ref
) = 1;
13145 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
13146 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
13147 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
13149 /* Enable us to recognize when a type is created in class context.
13150 To do nested classes correctly, this should probably be cleared
13151 out when we leave this classes scope. Currently this in only
13152 done in `start_enum'. */
13154 pushtag (name
, ref
, globalize
);
13158 struct cp_binding_level
*old_b
= class_binding_level
;
13160 ref
= make_aggr_type (code
);
13161 TYPE_CONTEXT (ref
) = context
;
13163 #ifdef NONNESTED_CLASSES
13164 /* Class types don't nest the way enums do. */
13165 class_binding_level
= (struct cp_binding_level
*)0;
13167 pushtag (name
, ref
, globalize
);
13168 class_binding_level
= old_b
;
13173 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
13174 redeclare_class_template (ref
, current_template_parms
);
13177 TYPE_ATTRIBUTES (ref
) = attributes
;
13183 xref_tag_from_type (old
, id
, globalize
)
13187 enum tag_types tag_kind
;
13189 if (TREE_CODE (old
) == RECORD_TYPE
)
13190 tag_kind
= (CLASSTYPE_DECLARED_CLASS (old
) ? class_type
: record_type
);
13192 tag_kind
= union_type
;
13194 if (id
== NULL_TREE
)
13195 id
= TYPE_IDENTIFIER (old
);
13197 return xref_tag (tag_kind
, id
, /*attributes=*/NULL_TREE
, globalize
);
13200 /* REF is a type (named NAME), for which we have just seen some
13201 baseclasses. BINFO is a list of those baseclasses; the
13202 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
13203 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
13204 struct, or union. */
13207 xref_basetypes (ref
, binfo
)
13211 /* In the declaration `A : X, Y, ... Z' we mark all the types
13212 (A, X, Y, ..., Z) so we can check for duplicates. */
13217 enum tag_types tag_code
;
13219 if (TREE_CODE (ref
) == UNION_TYPE
)
13221 error ("derived union `%T' invalid", ref
);
13225 tag_code
= (CLASSTYPE_DECLARED_CLASS (ref
) ? class_type
: record_type
);
13227 len
= list_length (binfo
);
13229 /* First, make sure that any templates in base-classes are
13230 instantiated. This ensures that if we call ourselves recursively
13231 we do not get confused about which classes are marked and which
13233 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
13234 complete_type (TREE_VALUE (base
));
13236 SET_CLASSTYPE_MARKED (ref
);
13237 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
13239 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
13241 /* The base of a derived struct is public by default. */
13243 = (TREE_PURPOSE (binfo
) == access_public_node
13244 || TREE_PURPOSE (binfo
) == access_public_virtual_node
13245 || (tag_code
!= class_type
13246 && (TREE_PURPOSE (binfo
) == access_default_node
13247 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
13249 = (TREE_PURPOSE (binfo
) == access_protected_node
13250 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
13252 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
13253 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
13254 || TREE_PURPOSE (binfo
) == access_public_virtual_node
13255 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
13256 tree basetype
= TREE_VALUE (binfo
);
13259 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
13260 basetype
= TREE_TYPE (basetype
);
13262 || (TREE_CODE (basetype
) != RECORD_TYPE
13263 && TREE_CODE (basetype
) != TYPENAME_TYPE
13264 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
13265 && TREE_CODE (basetype
) != BOUND_TEMPLATE_TEMPLATE_PARM
))
13267 error ("base type `%T' fails to be a struct or class type",
13268 TREE_VALUE (binfo
));
13272 /* This code replaces similar code in layout_basetypes.
13273 We put the complete_type first for implicit `typename'. */
13274 if (!COMPLETE_TYPE_P (basetype
)
13275 && ! (current_template_parms
&& uses_template_parms (basetype
)))
13277 error ("base class `%T' has incomplete type", basetype
);
13282 if (CLASSTYPE_MARKED (basetype
))
13284 if (basetype
== ref
)
13285 error ("recursive type `%T' undefined", basetype
);
13287 error ("duplicate base type `%T' invalid", basetype
);
13291 if (TYPE_FOR_JAVA (basetype
)
13292 && (current_lang_depth () == 0))
13293 TYPE_FOR_JAVA (ref
) = 1;
13295 /* Note that the BINFO records which describe individual
13296 inheritances are *not* shared in the lattice! They
13297 cannot be shared because a given baseclass may be
13298 inherited with different `accessibility' by different
13299 derived classes. (Each BINFO record describing an
13300 individual inheritance contains flags which say what
13301 the `accessibility' of that particular inheritance is.) */
13304 = make_binfo (size_zero_node
, basetype
,
13305 CLASS_TYPE_P (basetype
)
13306 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
13307 CLASS_TYPE_P (basetype
)
13308 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
13310 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
13311 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
13312 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
13313 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
13314 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
13316 /* We need to unshare the binfos now so that lookups during class
13317 definition work. */
13318 unshare_base_binfos (base_binfo
);
13320 SET_CLASSTYPE_MARKED (basetype
);
13322 /* We are free to modify these bits because they are meaningless
13323 at top level, and BASETYPE is a top-level type. */
13324 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
13326 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
13327 /* Converting to a virtual base class requires looking
13328 up the offset of the virtual base. */
13329 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
13332 if (CLASS_TYPE_P (basetype
))
13334 TYPE_HAS_NEW_OPERATOR (ref
)
13335 |= TYPE_HAS_NEW_OPERATOR (basetype
);
13336 TYPE_HAS_ARRAY_NEW_OPERATOR (ref
)
13337 |= TYPE_HAS_ARRAY_NEW_OPERATOR (basetype
);
13338 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
13339 /* If the base-class uses multiple inheritance, so do we. */
13340 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
13341 |= TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
13342 /* Likewise, if converting to a base of the base may require
13343 code, then we may need to generate code to convert to a
13345 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
)
13346 |= TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (basetype
);
13353 TREE_VEC_LENGTH (binfos
) = i
;
13355 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
13359 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
13360 /* If there is more than one non-empty they cannot be at the same
13362 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
13365 /* Unmark all the types. */
13367 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
13368 CLEAR_CLASSTYPE_MARKED (ref
);
13370 /* Now that we know all the base-classes, set up the list of virtual
13372 get_vbase_types (ref
);
13376 /* Begin compiling the definition of an enumeration type.
13377 NAME is its name (or null if anonymous).
13378 Returns the type object, as yet incomplete.
13379 Also records info about it so that build_enumerator
13380 may be used to declare the individual values as they are read. */
13386 register tree enumtype
= NULL_TREE
;
13387 struct cp_binding_level
*b
= current_binding_level
;
13389 /* If this is the real definition for a previous forward reference,
13390 fill in the contents in the same object that used to be the
13391 forward reference. */
13393 if (name
!= NULL_TREE
)
13394 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
13396 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
13398 error ("multiple definition of `%#T'", enumtype
);
13399 cp_error_at ("previous definition here", enumtype
);
13400 /* Clear out TYPE_VALUES, and start again. */
13401 TYPE_VALUES (enumtype
) = NULL_TREE
;
13405 enumtype
= make_node (ENUMERAL_TYPE
);
13406 pushtag (name
, enumtype
, 0);
13412 /* After processing and defining all the values of an enumeration type,
13413 install their decls in the enumeration type and finish it off.
13414 ENUMTYPE is the type object and VALUES a list of name-value pairs. */
13417 finish_enum (enumtype
)
13429 /* We built up the VALUES in reverse order. */
13430 TYPE_VALUES (enumtype
) = nreverse (TYPE_VALUES (enumtype
));
13434 Following the closing brace of an enum-specifier, each
13435 enumerator has the type of its enumeration. Prior to the
13436 closing brace, the type of each enumerator is the type of
13437 its initializing value. */
13438 for (pair
= TYPE_VALUES (enumtype
); pair
; pair
= TREE_CHAIN (pair
))
13439 TREE_TYPE (TREE_VALUE (pair
)) = enumtype
;
13441 /* For an enum defined in a template, all further processing is
13442 postponed until the template is instantiated. */
13443 if (processing_template_decl
)
13445 if (at_function_scope_p ())
13446 add_stmt (build_min (TAG_DEFN
, enumtype
));
13450 /* Figure out what the minimum and maximum values of the enumerators
13452 if (TYPE_VALUES (enumtype
))
13454 minnode
= maxnode
= NULL_TREE
;
13456 for (pair
= TYPE_VALUES (enumtype
);
13458 pair
= TREE_CHAIN (pair
))
13462 value
= DECL_INITIAL (TREE_VALUE (pair
));
13465 minnode
= maxnode
= value
;
13466 else if (tree_int_cst_lt (maxnode
, value
))
13468 else if (tree_int_cst_lt (value
, minnode
))
13473 minnode
= maxnode
= integer_zero_node
;
13475 /* Compute the number of bits require to represent all values of the
13476 enumeration. We must do this before the type of MINNODE and
13477 MAXNODE are transformed, since min_precision relies on the
13478 TREE_TYPE of the value it is passed. */
13479 unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
13480 lowprec
= min_precision (minnode
, unsignedp
);
13481 highprec
= min_precision (maxnode
, unsignedp
);
13482 precision
= MAX (lowprec
, highprec
);
13484 /* Set the TREE_TYPE for the values as well. That's so that when we
13485 call decl_constant_value we get an entity of the right type (but
13486 with the constant value). In addition, transform the TYPE_VALUES
13487 list to contain the values, rather than the CONST_DECLs for them. */
13488 for (pair
= TYPE_VALUES (enumtype
); pair
; pair
= TREE_CHAIN (pair
))
13490 tree value
= DECL_INITIAL (TREE_VALUE (pair
));
13492 TREE_TYPE (value
) = enumtype
;
13493 TREE_VALUE (pair
) = value
;
13496 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
13497 TYPE_SIZE (enumtype
) = NULL_TREE
;
13498 TYPE_PRECISION (enumtype
) = precision
;
13500 fixup_unsigned_type (enumtype
);
13502 fixup_signed_type (enumtype
);
13504 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
13505 /* Use the width of the narrowest normal C type which is wide
13507 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (c_common_type_for_size
13510 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
13512 TYPE_SIZE (enumtype
) = NULL_TREE
;
13513 layout_type (enumtype
);
13515 /* Fix up all variant types of this enum type. */
13516 for (t
= TYPE_MAIN_VARIANT (enumtype
); t
; t
= TYPE_NEXT_VARIANT (t
))
13518 TYPE_VALUES (t
) = TYPE_VALUES (enumtype
);
13519 TYPE_MIN_VALUE (t
) = TYPE_MIN_VALUE (enumtype
);
13520 TYPE_MAX_VALUE (t
) = TYPE_MAX_VALUE (enumtype
);
13521 TYPE_SIZE (t
) = TYPE_SIZE (enumtype
);
13522 TYPE_SIZE_UNIT (t
) = TYPE_SIZE_UNIT (enumtype
);
13523 TYPE_MODE (t
) = TYPE_MODE (enumtype
);
13524 TYPE_PRECISION (t
) = TYPE_PRECISION (enumtype
);
13525 TYPE_ALIGN (t
) = TYPE_ALIGN (enumtype
);
13526 TYPE_USER_ALIGN (t
) = TYPE_USER_ALIGN (enumtype
);
13527 TREE_UNSIGNED (t
) = TREE_UNSIGNED (enumtype
);
13530 /* Finish debugging output for this type. */
13531 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
13534 /* Build and install a CONST_DECL for an enumeration constant of the
13535 enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided.
13536 Assignment of sequential values by default is handled here. */
13539 build_enumerator (name
, value
, enumtype
)
13549 /* Remove no-op casts from the value. */
13551 STRIP_TYPE_NOPS (value
);
13553 if (! processing_template_decl
)
13555 /* Validate and default VALUE. */
13556 if (value
!= NULL_TREE
)
13558 value
= decl_constant_value (value
);
13560 if (TREE_CODE (value
) == INTEGER_CST
)
13562 value
= default_conversion (value
);
13563 constant_expression_warning (value
);
13567 error ("enumerator value for `%D' not integer constant", name
);
13572 /* Default based on previous value. */
13573 if (value
== NULL_TREE
&& ! processing_template_decl
)
13577 if (TYPE_VALUES (enumtype
))
13579 /* The next value is the previous value ... */
13580 prev_value
= DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype
)));
13581 /* ... plus one. */
13582 value
= cp_build_binary_op (PLUS_EXPR
,
13586 if (tree_int_cst_lt (value
, prev_value
))
13587 error ("overflow in enumeration values at `%D'", name
);
13590 value
= integer_zero_node
;
13593 /* Remove no-op casts from the value. */
13595 STRIP_TYPE_NOPS (value
);
13597 /* To fix MAX_VAL enum consts. (bkoz) */
13598 TREE_TYPE (value
) = integer_type_node
;
13602 /* We always have to copy here; not all INTEGER_CSTs are unshared.
13603 Even in other cases, we will later (in finish_enum) be setting
13604 the type of VALUE. But, we don't need to make a copy if this
13605 VALUE is one of the enumeration constants for this same
13606 enumeration type. */
13607 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
13608 if (TREE_VALUE (values
) == value
)
13610 /* If we didn't break out of the loop, then we do need a copy. */
13611 if (!values
&& value
)
13612 value
= copy_node (value
);
13614 /* C++ associates enums with global, function, or class declarations. */
13615 context
= current_scope ();
13617 /* Build the actual enumeration constant. Note that the enumeration
13618 constants have the type of their initializers until the
13619 enumeration is complete:
13623 Following the closing brace of an enum-specifier, each enumer-
13624 ator has the type of its enumeration. Prior to the closing
13625 brace, the type of each enumerator is the type of its
13626 initializing value.
13628 In finish_enum we will reset the type. Of course, if we're
13629 processing a template, there may be no value. */
13630 type
= value
? TREE_TYPE (value
) : NULL_TREE
;
13632 if (context
&& context
== current_class_type
)
13633 /* This enum declaration is local to the class. We need the full
13634 lang_decl so that we can record DECL_CLASS_CONTEXT, for example. */
13635 decl
= build_lang_decl (CONST_DECL
, name
, type
);
13637 /* It's a global enum, or it's local to a function. (Note local to
13638 a function could mean local to a class method. */
13639 decl
= build_decl (CONST_DECL
, name
, type
);
13641 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
13642 DECL_INITIAL (decl
) = value
;
13643 TREE_READONLY (decl
) = 1;
13645 if (context
&& context
== current_class_type
)
13646 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
13647 on the TYPE_FIELDS list for `S'. (That's so that you can say
13648 things like `S::i' later.) */
13649 finish_member_declaration (decl
);
13653 /* Add this enumeration constant to the list for this type. */
13654 TYPE_VALUES (enumtype
) = tree_cons (name
, decl
, TYPE_VALUES (enumtype
));
13658 /* We're defining DECL. Make sure that it's type is OK. */
13661 check_function_type (decl
, current_function_parms
)
13663 tree current_function_parms
;
13665 tree fntype
= TREE_TYPE (decl
);
13666 tree return_type
= complete_type (TREE_TYPE (fntype
));
13668 /* In a function definition, arg types must be complete. */
13669 require_complete_types_for_parms (current_function_parms
);
13671 if (!COMPLETE_OR_VOID_TYPE_P (return_type
))
13673 error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
13675 /* Make it return void instead, but don't change the
13676 type of the DECL_RESULT, in case we have a named return value. */
13677 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13679 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
13681 = build_cplus_method_type (ctype
,
13683 FUNCTION_ARG_CHAIN (decl
));
13687 = build_function_type (void_type_node
,
13688 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
13690 = build_exception_variant (fntype
,
13691 TYPE_RAISES_EXCEPTIONS (fntype
));
13694 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
13697 /* Create the FUNCTION_DECL for a function definition.
13698 DECLSPECS and DECLARATOR are the parts of the declaration;
13699 they describe the function's name and the type it returns,
13700 but twisted together in a fashion that parallels the syntax of C.
13702 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
13703 DECLARATOR is really the DECL for the function we are about to
13704 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
13705 indicating that the function is an inline defined in-class.
13707 This function creates a binding context for the function body
13708 as well as setting up the FUNCTION_DECL in current_function_decl.
13710 Returns 1 on success. If the DECLARATOR is not suitable for a function
13711 (it defines a datum instead), we return 0, which tells
13712 yyparse to report a parse error.
13714 For C++, we must first check whether that datum makes any sense.
13715 For example, "class A local_a(1,2);" means that variable local_a
13716 is an aggregate of type A, which should have a constructor
13717 applied to it with the argument list [1, 2]. */
13720 start_function (declspecs
, declarator
, attrs
, flags
)
13721 tree declspecs
, declarator
, attrs
;
13725 tree ctype
= NULL_TREE
;
13728 int doing_friend
= 0;
13729 struct cp_binding_level
*bl
;
13730 tree current_function_parms
;
13732 /* Sanity check. */
13733 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
13734 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
13736 /* This should only be done once on the top most decl. */
13737 if (have_extern_spec
)
13739 declspecs
= tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
13740 have_extern_spec
= false;
13743 if (flags
& SF_PRE_PARSED
)
13745 decl1
= declarator
;
13747 fntype
= TREE_TYPE (decl1
);
13748 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13749 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13751 /* ISO C++ 11.4/5. A friend function defined in a class is in
13752 the (lexical) scope of the class in which it is defined. */
13753 if (!ctype
&& DECL_FRIEND_P (decl1
))
13755 ctype
= DECL_FRIEND_CONTEXT (decl1
);
13757 /* CTYPE could be null here if we're dealing with a template;
13758 for example, `inline friend float foo()' inside a template
13759 will have no CTYPE set. */
13760 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
13766 last_function_parms
= DECL_ARGUMENTS (decl1
);
13770 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL
);
13771 /* If the declarator is not suitable for a function definition,
13772 cause a syntax error. */
13773 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
)
13776 cplus_decl_attributes (&decl1
, attrs
, 0);
13778 /* If #pragma weak was used, mark the decl weak now. */
13779 if (current_binding_level
== global_binding_level
)
13780 maybe_apply_pragma_weak (decl1
);
13782 fntype
= TREE_TYPE (decl1
);
13784 restype
= TREE_TYPE (fntype
);
13785 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
13787 error ("semicolon missing after declaration of `%#T'", restype
);
13788 shadow_tag (build_tree_list (NULL_TREE
, restype
));
13789 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
13790 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
13791 fntype
= build_function_type (integer_type_node
,
13792 TYPE_ARG_TYPES (fntype
));
13794 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
13796 TYPE_ARG_TYPES (fntype
));
13797 TREE_TYPE (decl1
) = fntype
;
13800 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13801 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13802 else if (DECL_MAIN_P (decl1
))
13804 /* If this doesn't return integer_type, complain. */
13805 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
13807 if (pedantic
|| warn_return_type
)
13808 pedwarn ("return type for `main' changed to `int'");
13809 TREE_TYPE (decl1
) = fntype
= default_function_type
;
13814 if (DECL_DECLARED_INLINE_P (decl1
)
13815 && lookup_attribute ("noinline", attrs
))
13816 warning_with_decl (decl1
,
13817 "inline function `%s' given attribute noinline");
13819 if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl1
))
13820 /* This is a constructor, we must ensure that any default args
13821 introduced by this definition are propagated to the clones
13822 now. The clones are used directly in overload resolution. */
13823 adjust_clone_args (decl1
);
13825 /* Sometimes we don't notice that a function is a static member, and
13826 build a METHOD_TYPE for it. Fix that up now. */
13827 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
)
13828 && TREE_CODE (TREE_TYPE (decl1
)) == METHOD_TYPE
)
13830 revert_static_member_fn (decl1
);
13831 last_function_parms
= TREE_CHAIN (last_function_parms
);
13835 /* Warn if function was previously implicitly declared
13836 (but not if we warned then). */
13837 if (! warn_implicit
13838 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
13839 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
13841 /* Set up current_class_type, and enter the scope of the class, if
13844 push_nested_class (ctype
, 1);
13845 else if (DECL_STATIC_FUNCTION_P (decl1
))
13846 push_nested_class (DECL_CONTEXT (decl1
), 2);
13848 /* Now that we have entered the scope of the class, we must restore
13849 the bindings for any template parameters surrounding DECL1, if it
13850 is an inline member template. (Order is important; consider the
13851 case where a template parameter has the same name as a field of
13852 the class.) It is not until after this point that
13853 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
13854 if (flags
& SF_INCLASS_INLINE
)
13855 maybe_begin_member_template_processing (decl1
);
13857 /* Effective C++ rule 15. */
13859 && DECL_OVERLOADED_OPERATOR_P (decl1
) == NOP_EXPR
13860 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
13861 warning ("`operator=' should return a reference to `*this'");
13863 /* Make the init_value nonzero so pushdecl knows this is not tentative.
13864 error_mark_node is replaced below (in poplevel) with the BLOCK. */
13865 if (!DECL_INITIAL (decl1
))
13866 DECL_INITIAL (decl1
) = error_mark_node
;
13868 /* This function exists in static storage.
13869 (This does not mean `static' in the C sense!) */
13870 TREE_STATIC (decl1
) = 1;
13872 /* We must call push_template_decl after current_class_type is set
13873 up. (If we are processing inline definitions after exiting a
13874 class scope, current_class_type will be NULL_TREE until set above
13875 by push_nested_class.) */
13876 if (processing_template_decl
)
13877 decl1
= push_template_decl (decl1
);
13879 /* We are now in the scope of the function being defined. */
13880 current_function_decl
= decl1
;
13882 /* Save the parm names or decls from this function's declarator
13883 where store_parm_decls will find them. */
13884 current_function_parms
= last_function_parms
;
13886 /* Make sure the parameter and return types are reasonable. When
13887 you declare a function, these types can be incomplete, but they
13888 must be complete when you define the function. */
13889 if (! processing_template_decl
)
13890 check_function_type (decl1
, current_function_parms
);
13892 /* Build the return declaration for the function. */
13893 restype
= TREE_TYPE (fntype
);
13894 /* Promote the value to int before returning it. */
13895 if (c_promoting_integer_type_p (restype
))
13896 restype
= type_promotes_to (restype
);
13897 if (DECL_RESULT (decl1
) == NULL_TREE
)
13899 DECL_RESULT (decl1
)
13900 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13901 c_apply_type_quals_to_decl (cp_type_quals (restype
),
13902 DECL_RESULT (decl1
));
13905 /* Initialize RTL machinery. We cannot do this until
13906 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
13907 even when processing a template; this is how we get
13908 CFUN set up, and our per-function variables initialized.
13909 FIXME factor out the non-RTL stuff. */
13910 bl
= current_binding_level
;
13911 init_function_start (decl1
, input_filename
, lineno
);
13912 current_binding_level
= bl
;
13914 /* Even though we're inside a function body, we still don't want to
13915 call expand_expr to calculate the size of a variable-sized array.
13916 We haven't necessarily assigned RTL to all variables yet, so it's
13917 not safe to try to expand expressions involving them. */
13918 immediate_size_expand
= 0;
13919 cfun
->x_dont_save_pending_sizes_p
= 1;
13921 /* Start the statement-tree, start the tree now. */
13922 begin_stmt_tree (&DECL_SAVED_TREE (decl1
));
13924 /* Let the user know we're compiling this function. */
13925 announce_function (decl1
);
13927 /* Record the decl so that the function name is defined.
13928 If we already have a decl for this name, and it is a FUNCTION_DECL,
13929 use the old decl. */
13930 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
13932 /* A specialization is not used to guide overload resolution. */
13933 if (!DECL_TEMPLATE_SPECIALIZATION (decl1
)
13934 && ! DECL_FUNCTION_MEMBER_P (decl1
))
13935 decl1
= pushdecl (decl1
);
13938 /* We need to set the DECL_CONTEXT. */
13939 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
13940 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
13941 /* And make sure we have enough default args. */
13942 check_default_args (decl1
);
13944 fntype
= TREE_TYPE (decl1
);
13947 /* Reset these in case the call to pushdecl changed them. */
13948 current_function_decl
= decl1
;
13949 cfun
->decl
= decl1
;
13951 /* If we are (erroneously) defining a function that we have already
13952 defined before, wipe out what we knew before. */
13953 if (!DECL_PENDING_INLINE_P (decl1
))
13954 DECL_SAVED_FUNCTION_DATA (decl1
) = NULL
;
13956 if (ctype
&& !doing_friend
&& !DECL_STATIC_FUNCTION_P (decl1
))
13958 /* We know that this was set up by `grokclassfn'. We do not
13959 wait until `store_parm_decls', since evil parse errors may
13960 never get us to that point. Here we keep the consistency
13961 between `current_class_type' and `current_class_ptr'. */
13962 tree t
= DECL_ARGUMENTS (decl1
);
13964 my_friendly_assert (t
!= NULL_TREE
&& TREE_CODE (t
) == PARM_DECL
,
13966 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
13969 cp_function_chain
->x_current_class_ref
13970 = build_indirect_ref (t
, NULL
);
13971 cp_function_chain
->x_current_class_ptr
= t
;
13973 /* Constructors and destructors need to know whether they're "in
13974 charge" of initializing virtual base classes. */
13975 t
= TREE_CHAIN (t
);
13976 if (DECL_HAS_IN_CHARGE_PARM_P (decl1
))
13978 current_in_charge_parm
= t
;
13979 t
= TREE_CHAIN (t
);
13981 if (DECL_HAS_VTT_PARM_P (decl1
))
13983 if (DECL_NAME (t
) != vtt_parm_identifier
)
13985 current_vtt_parm
= t
;
13989 if (DECL_INTERFACE_KNOWN (decl1
))
13991 tree ctx
= decl_function_context (decl1
);
13993 if (DECL_NOT_REALLY_EXTERN (decl1
))
13994 DECL_EXTERNAL (decl1
) = 0;
13996 if (ctx
!= NULL_TREE
&& DECL_DECLARED_INLINE_P (ctx
)
13997 && TREE_PUBLIC (ctx
))
13998 /* This is a function in a local class in an extern inline
14000 comdat_linkage (decl1
);
14002 /* If this function belongs to an interface, it is public.
14003 If it belongs to someone else's interface, it is also external.
14004 This only affects inlines and template instantiations. */
14005 else if (interface_unknown
== 0
14006 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
14007 || flag_alt_external_templates
))
14009 if (DECL_DECLARED_INLINE_P (decl1
)
14010 || DECL_TEMPLATE_INSTANTIATION (decl1
)
14011 || processing_template_decl
)
14013 DECL_EXTERNAL (decl1
)
14015 || (DECL_DECLARED_INLINE_P (decl1
)
14016 && ! flag_implement_inlines
14017 && !DECL_VINDEX (decl1
)));
14019 /* For WIN32 we also want to put these in linkonce sections. */
14020 maybe_make_one_only (decl1
);
14023 DECL_EXTERNAL (decl1
) = 0;
14024 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
14025 DECL_INTERFACE_KNOWN (decl1
) = 1;
14027 else if (interface_unknown
&& interface_only
14028 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
14029 || flag_alt_external_templates
))
14031 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
14032 interface, we will have interface_only set but not
14033 interface_known. In that case, we don't want to use the normal
14034 heuristics because someone will supply a #pragma implementation
14035 elsewhere, and deducing it here would produce a conflict. */
14036 comdat_linkage (decl1
);
14037 DECL_EXTERNAL (decl1
) = 0;
14038 DECL_INTERFACE_KNOWN (decl1
) = 1;
14039 DECL_DEFER_OUTPUT (decl1
) = 1;
14043 /* This is a definition, not a reference.
14044 So clear DECL_EXTERNAL. */
14045 DECL_EXTERNAL (decl1
) = 0;
14047 if ((DECL_DECLARED_INLINE_P (decl1
)
14048 || DECL_TEMPLATE_INSTANTIATION (decl1
))
14049 && ! DECL_INTERFACE_KNOWN (decl1
)
14050 /* Don't try to defer nested functions for now. */
14051 && ! decl_function_context (decl1
))
14052 DECL_DEFER_OUTPUT (decl1
) = 1;
14054 DECL_INTERFACE_KNOWN (decl1
) = 1;
14058 current_binding_level
->parm_flag
= 1;
14062 if (DECL_DESTRUCTOR_P (decl1
))
14064 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
14065 DECL_CONTEXT (dtor_label
) = current_function_decl
;
14068 start_fname_decls ();
14070 store_parm_decls (current_function_parms
);
14075 /* Store the parameter declarations into the current function declaration.
14076 This is called after parsing the parameter declarations, before
14077 digesting the body of the function.
14079 Also install to binding contour return value identifier, if any. */
14082 store_parm_decls (current_function_parms
)
14083 tree current_function_parms
;
14085 register tree fndecl
= current_function_decl
;
14086 register tree parm
;
14088 /* This is a chain of any other decls that came in among the parm
14089 declarations. If a parm is declared with enum {foo, bar} x;
14090 then CONST_DECLs for foo and bar are put here. */
14091 tree nonparms
= NULL_TREE
;
14093 if (current_function_parms
)
14095 /* This case is when the function was defined with an ANSI prototype.
14096 The parms already have decls, so we need not do anything here
14097 except record them as in effect
14098 and complain if any redundant old-style parm decls were written. */
14100 tree specparms
= current_function_parms
;
14103 /* Must clear this because it might contain TYPE_DECLs declared
14105 storedecls (NULL_TREE
);
14107 /* If we're doing semantic analysis, then we'll call pushdecl
14108 for each of these. We must do them in reverse order so that
14109 they end in the correct forward order. */
14110 specparms
= nreverse (specparms
);
14112 for (parm
= specparms
; parm
; parm
= next
)
14114 next
= TREE_CHAIN (parm
);
14115 if (TREE_CODE (parm
) == PARM_DECL
)
14117 if (DECL_NAME (parm
) == NULL_TREE
14118 || TREE_CODE (parm
) != VOID_TYPE
)
14121 error ("parameter `%D' declared void", parm
);
14125 /* If we find an enum constant or a type tag,
14126 put it aside for the moment. */
14127 TREE_CHAIN (parm
) = NULL_TREE
;
14128 nonparms
= chainon (nonparms
, parm
);
14132 /* Get the decls in their original chain order and record in the
14133 function. This is all and only the PARM_DECLs that were
14134 pushed into scope by the loop above. */
14135 DECL_ARGUMENTS (fndecl
) = getdecls ();
14136 storetags (gettags ());
14139 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
14141 /* Now store the final chain of decls for the arguments
14142 as the decl-chain of the current lexical scope.
14143 Put the enumerators in as well, at the front so that
14144 DECL_ARGUMENTS is not modified. */
14145 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
14147 /* Do the starting of the exception specifications, if we have any. */
14148 if (flag_exceptions
&& !processing_template_decl
14149 && flag_enforce_eh_specs
14150 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
14151 current_eh_spec_block
= begin_eh_spec_block ();
14155 /* We have finished doing semantic analysis on DECL, but have not yet
14156 generated RTL for its body. Save away our current state, so that
14157 when we want to generate RTL later we know what to do. */
14160 save_function_data (decl
)
14163 struct language_function
*f
;
14165 /* Save the language-specific per-function data so that we can
14166 get it back when we really expand this function. */
14167 my_friendly_assert (!DECL_PENDING_INLINE_P (decl
),
14171 f
= ((struct language_function
*)
14172 ggc_alloc (sizeof (struct language_function
)));
14173 memcpy (f
, cp_function_chain
, sizeof (struct language_function
));
14174 DECL_SAVED_FUNCTION_DATA (decl
) = f
;
14176 /* Clear out the bits we don't need. */
14177 f
->base
.x_stmt_tree
.x_last_stmt
= NULL_TREE
;
14178 f
->base
.x_stmt_tree
.x_last_expr_type
= NULL_TREE
;
14179 f
->x_named_label_uses
= NULL
;
14180 f
->bindings
= NULL
;
14181 f
->x_local_names
= NULL
;
14183 /* When we get back here again, we will be expanding. */
14184 f
->x_expanding_p
= 1;
14186 /* If we've already decided that we cannot inline this function, we
14187 must remember that fact when we actually go to expand the
14189 if (current_function_cannot_inline
)
14191 f
->cannot_inline
= current_function_cannot_inline
;
14192 DECL_INLINE (decl
) = 0;
14196 /* Add a note to mark the beginning of the main body of the constructor.
14197 This is used to set up the data structures for the cleanup regions for
14198 fully-constructed bases and members. */
14201 begin_constructor_body ()
14205 /* Add a note to mark the end of the main body of the constructor. This is
14206 used to end the cleanup regions for fully-constructed bases and
14210 finish_constructor_body ()
14214 /* Do all the processing for the beginning of a destructor; set up the
14215 vtable pointers and cleanups for bases and members. */
14218 begin_destructor_body ()
14221 tree compound_stmt
;
14223 /* If the dtor is empty, and we know there is not any possible
14224 way we could use any vtable entries, before they are possibly
14225 set by a base class dtor, we don't have to setup the vtables,
14226 as we know that any base class dtor will set up any vtables
14227 it needs. We avoid MI, because one base class dtor can do a
14228 virtual dispatch to an overridden function that would need to
14229 have a non-related vtable set up, we cannot avoid setting up
14230 vtables in that case. We could change this to see if there
14231 is just one vtable.
14233 ??? In the destructor for a class, the vtables are set
14234 appropriately for that class. There will be no non-related
14235 vtables. jason 2001-12-11. */
14236 if_stmt
= begin_if_stmt ();
14238 /* If it is not safe to avoid setting up the vtables, then
14239 someone will change the condition to be boolean_true_node.
14240 (Actually, for now, we do not have code to set the condition
14241 appropriately, so we just assume that we always need to
14242 initialize the vtables.) */
14243 finish_if_stmt_cond (boolean_true_node
, if_stmt
);
14245 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
14247 /* Make all virtual function table pointers in non-virtual base
14248 classes point to CURRENT_CLASS_TYPE's virtual function
14250 initialize_vtbl_ptrs (current_class_ptr
);
14252 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
14253 finish_then_clause (if_stmt
);
14256 /* And insert cleanups for our bases and members so that they
14257 will be properly destroyed if we throw. */
14258 push_base_cleanups ();
14261 /* At the end of every destructor we generate code to delete the object if
14262 necessary. Do that now. */
14265 finish_destructor_body ()
14269 /* In a virtual destructor, we must call delete. */
14270 if (DECL_VIRTUAL_P (current_function_decl
))
14273 tree virtual_size
= cxx_sizeof (current_class_type
);
14277 At the point of definition of a virtual destructor (including
14278 an implicit definition), non-placement operator delete shall
14279 be looked up in the scope of the destructor's class and if
14280 found shall be accessible and unambiguous. */
14281 exprstmt
= build_op_delete_call
14282 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
14283 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
14285 if_stmt
= begin_if_stmt ();
14286 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
14287 current_in_charge_parm
,
14290 finish_expr_stmt (exprstmt
);
14291 finish_then_clause (if_stmt
);
14296 /* Do the necessary processing for the beginning of a function body, which
14297 in this case includes member-initializers, but not the catch clauses of
14298 a function-try-block. Currently, this means opening a binding level
14299 for the member-initializers (in a ctor) and member cleanups (in a dtor).
14300 In other functions, this isn't necessary, but it doesn't hurt. */
14303 begin_function_body ()
14307 if (processing_template_decl
)
14308 /* Do nothing now. */;
14310 /* Always keep the BLOCK node associated with the outermost pair of
14311 curly braces of a function. These are needed for correct
14312 operation of dwarfout.c. */
14313 keep_next_level (1);
14315 stmt
= begin_compound_stmt (0);
14316 COMPOUND_STMT_BODY_BLOCK (stmt
) = 1;
14318 if (processing_template_decl
)
14319 /* Do nothing now. */;
14320 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
14321 begin_constructor_body ();
14322 else if (DECL_DESTRUCTOR_P (current_function_decl
))
14323 begin_destructor_body ();
14328 /* Do the processing for the end of a function body. Currently, this means
14329 closing out the cleanups for fully-constructed bases and members, and in
14330 the case of the destructor, deleting the object if desired. Again, this
14331 is only meaningful for [cd]tors, since they are the only functions where
14332 there is a significant distinction between the main body and any
14333 function catch clauses. Handling, say, main() return semantics here
14334 would be wrong, as flowing off the end of a function catch clause for
14335 main() would also need to return 0. */
14338 finish_function_body (compstmt
)
14341 if (processing_template_decl
)
14342 /* Do nothing now. */;
14343 else if (DECL_DESTRUCTOR_P (current_function_decl
))
14344 /* Any return from a destructor will end up here. Put it before the
14345 cleanups so that an explicit return doesn't duplicate them. */
14346 add_stmt (build_stmt (LABEL_STMT
, dtor_label
));
14348 /* Close the block; in a destructor, run the member cleanups. */
14349 finish_compound_stmt (0, compstmt
);
14351 if (processing_template_decl
)
14352 /* Do nothing now. */;
14353 else if (DECL_CONSTRUCTOR_P (current_function_decl
))
14354 finish_constructor_body ();
14355 else if (DECL_DESTRUCTOR_P (current_function_decl
))
14356 finish_destructor_body ();
14359 /* Finish up a function declaration and compile that function
14360 all the way to assembler language output. The free the storage
14361 for the function definition.
14363 FLAGS is a bitwise or of the following values:
14365 We just finished processing the body of an in-class inline
14366 function definition. (This processing will have taken place
14367 after the class definition is complete.) */
14370 finish_function (flags
)
14373 register tree fndecl
= current_function_decl
;
14374 tree fntype
, ctype
= NULL_TREE
;
14375 int inclass_inline
= (flags
& 2) != 0;
14378 /* When we get some parse errors, we can end up without a
14379 current_function_decl, so cope. */
14380 if (fndecl
== NULL_TREE
)
14381 return error_mark_node
;
14383 nested
= function_depth
> 1;
14384 fntype
= TREE_TYPE (fndecl
);
14386 /* TREE_READONLY (fndecl) = 1;
14387 This caused &foo to be of type ptr-to-const-function
14388 which then got a warning when stored in a ptr-to-function variable. */
14390 my_friendly_assert (building_stmt_tree (), 20000911);
14392 finish_fname_decls ();
14394 /* For a cloned function, we've already got all the code we need;
14395 there's no need to add any extra bits. */
14396 if (!DECL_CLONED_FUNCTION_P (fndecl
))
14398 if (DECL_MAIN_P (current_function_decl
))
14400 /* Make it so that `main' always returns 0 by default. */
14402 finish_return_stmt (integer_one_node
);
14404 finish_return_stmt (integer_zero_node
);
14408 /* Finish dealing with exception specifiers. */
14409 if (flag_exceptions
&& !processing_template_decl
14410 && flag_enforce_eh_specs
14411 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
14412 finish_eh_spec_block (TYPE_RAISES_EXCEPTIONS
14413 (TREE_TYPE (current_function_decl
)),
14414 current_eh_spec_block
);
14417 /* If we're saving up tree structure, tie off the function now. */
14418 finish_stmt_tree (&DECL_SAVED_TREE (fndecl
));
14420 /* This must come after expand_function_end because cleanups might
14421 have declarations (from inline functions) that need to go into
14422 this function's blocks. */
14424 /* If the current binding level isn't the outermost binding level
14425 for this function, either there is a bug, or we have experienced
14426 syntax errors and the statement tree is malformed. */
14427 if (current_binding_level
->parm_flag
!= 1)
14429 /* Make sure we have already experienced errors. */
14430 if (errorcount
== 0)
14433 /* Throw away the broken statement tree and extra binding
14435 DECL_SAVED_TREE (fndecl
) = build_stmt (COMPOUND_STMT
, NULL_TREE
);
14437 while (current_binding_level
->parm_flag
!= 1)
14439 if (current_binding_level
->parm_flag
== 2)
14440 pop_nested_class ();
14442 poplevel (0, 0, 0);
14445 poplevel (1, 0, 1);
14447 /* Set up the named return value optimization, if we can. Here, we
14448 eliminate the copy from the nrv into the RESULT_DECL and any cleanup
14449 for the nrv. genrtl_start_function and declare_return_variable
14450 handle making the nrv and RESULT_DECL share space. */
14451 if (current_function_return_value
)
14453 tree r
= current_function_return_value
;
14454 /* This is only worth doing for fns that return in memory--and
14455 simpler, since we don't have to worry about promoted modes. */
14456 if (r
!= error_mark_node
14457 && aggregate_value_p (TREE_TYPE (TREE_TYPE (fndecl
))))
14459 DECL_ALIGN (r
) = DECL_ALIGN (DECL_RESULT (fndecl
));
14460 walk_tree_without_duplicates (&DECL_SAVED_TREE (fndecl
),
14461 nullify_returns_r
, r
);
14464 /* Clear it so genrtl_start_function and declare_return_variable
14465 know we're not optimizing. */
14466 current_function_return_value
= NULL_TREE
;
14469 /* Remember that we were in class scope. */
14470 if (current_class_name
)
14471 ctype
= current_class_type
;
14473 /* Must mark the RESULT_DECL as being in this function. */
14474 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
14476 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
14477 to the FUNCTION_DECL node itself. */
14478 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
14480 /* Save away current state, if appropriate. */
14481 if (!processing_template_decl
)
14482 save_function_data (fndecl
);
14484 /* If this function calls `setjmp' it cannot be inlined. When
14485 `longjmp' is called it is not guaranteed to restore the value of
14486 local variables that have been modified since the call to
14487 `setjmp'. So, if were to inline this function into some caller
14488 `c', then when we `longjmp', we might not restore all variables
14489 in `c'. (It might seem, at first blush, that there's no way for
14490 this function to modify local variables in `c', but their
14491 addresses may have been stored somewhere accessible to this
14493 if (!processing_template_decl
&& calls_setjmp_p (fndecl
))
14494 DECL_UNINLINABLE (fndecl
) = 1;
14496 /* Complain if there's just no return statement. */
14497 if (warn_return_type
14498 && !processing_template_decl
14499 && TREE_CODE (TREE_TYPE (fntype
)) != VOID_TYPE
14500 && !current_function_returns_value
&& !current_function_returns_null
14501 /* Don't complain if we abort or throw. */
14502 && !current_function_returns_abnormally
14503 && !DECL_NAME (DECL_RESULT (fndecl
))
14504 /* Normally, with -Wreturn-type, flow will complain. Unless we're an
14505 inline function, as we might never be compiled separately. */
14506 && DECL_INLINE (fndecl
))
14507 warning ("no return statement in function returning non-void");
14509 /* Clear out memory we no longer need. */
14510 free_after_parsing (cfun
);
14511 /* Since we never call rest_of_compilation, we never clear
14512 CFUN. Do so explicitly. */
14513 free_after_compilation (cfun
);
14516 /* If this is an in-class inline definition, we may have to pop the
14517 bindings for the template parameters that we added in
14518 maybe_begin_member_template_processing when start_function was
14520 if (inclass_inline
)
14521 maybe_end_member_template_processing ();
14523 /* Leave the scope of the class. */
14525 pop_nested_class ();
14531 /* Let the error reporting routines know that we're outside a
14532 function. For a nested function, this value is used in
14533 cxx_pop_function_context and then reset via pop_function_context. */
14534 current_function_decl
= NULL_TREE
;
14539 /* Create the FUNCTION_DECL for a function definition.
14540 DECLSPECS and DECLARATOR are the parts of the declaration;
14541 they describe the return type and the name of the function,
14542 but twisted together in a fashion that parallels the syntax of C.
14544 This function creates a binding context for the function body
14545 as well as setting up the FUNCTION_DECL in current_function_decl.
14547 Returns a FUNCTION_DECL on success.
14549 If the DECLARATOR is not suitable for a function (it defines a datum
14550 instead), we return 0, which tells yyparse to report a parse error.
14552 May return void_type_node indicating that this method is actually
14553 a friend. See grokfield for more details.
14555 Came here with a `.pushlevel' .
14557 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14558 CHANGES TO CODE IN `grokfield'. */
14561 start_method (declspecs
, declarator
, attrlist
)
14562 tree declarator
, declspecs
, attrlist
;
14564 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
14567 /* Something too ugly to handle. */
14568 if (fndecl
== NULL_TREE
)
14572 cplus_decl_attributes (&fndecl
, attrlist
, 0);
14574 /* Pass friends other than inline friend functions back. */
14575 if (fndecl
== void_type_node
)
14578 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
14579 /* Not a function, tell parser to report parse error. */
14582 if (DECL_IN_AGGR_P (fndecl
))
14584 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
14586 if (DECL_CONTEXT (fndecl
)
14587 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
14588 error ("`%D' is already defined in class `%T'", fndecl
,
14589 DECL_CONTEXT (fndecl
));
14591 return void_type_node
;
14594 check_template_shadow (fndecl
);
14596 DECL_DECLARED_INLINE_P (fndecl
) = 1;
14598 if (flag_default_inline
)
14599 DECL_INLINE (fndecl
) = 1;
14601 /* We process method specializations in finish_struct_1. */
14602 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
14603 fndecl
= push_template_decl (fndecl
);
14605 if (! DECL_FRIEND_P (fndecl
))
14607 if (TREE_CHAIN (fndecl
))
14609 fndecl
= copy_node (fndecl
);
14610 TREE_CHAIN (fndecl
) = NULL_TREE
;
14612 grok_special_member_properties (fndecl
);
14615 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0);
14617 /* Make a place for the parms */
14619 current_binding_level
->parm_flag
= 1;
14621 DECL_IN_AGGR_P (fndecl
) = 1;
14625 /* Go through the motions of finishing a function definition.
14626 We don't compile this method until after the whole class has
14629 FINISH_METHOD must return something that looks as though it
14630 came from GROKFIELD (since we are defining a method, after all).
14632 This is called after parsing the body of the function definition.
14633 STMTS is the chain of statements that makes up the function body.
14635 DECL is the ..._DECL that `start_method' provided. */
14638 finish_method (decl
)
14641 register tree fndecl
= decl
;
14644 register tree link
;
14646 if (decl
== void_type_node
)
14649 old_initial
= DECL_INITIAL (fndecl
);
14651 /* Undo the level for the parms (from start_method).
14652 This is like poplevel, but it causes nothing to be
14653 saved. Saving information here confuses symbol-table
14654 output routines. Besides, this information will
14655 be correctly output when this method is actually
14658 /* Clear out the meanings of the local variables of this level;
14659 also record in each decl which block it belongs to. */
14661 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
14663 if (DECL_NAME (link
) != NULL_TREE
)
14664 pop_binding (DECL_NAME (link
), link
);
14665 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
14666 DECL_CONTEXT (link
) = NULL_TREE
;
14669 poplevel (0, 0, 0);
14671 DECL_INITIAL (fndecl
) = old_initial
;
14673 /* We used to check if the context of FNDECL was different from
14674 current_class_type as another way to get inside here. This didn't work
14675 for String.cc in libg++. */
14676 if (DECL_FRIEND_P (fndecl
))
14678 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
14679 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
14680 decl
= void_type_node
;
14687 /* VAR is a VAR_DECL. If its type is incomplete, remember VAR so that
14688 we can lay it out later, when and if its type becomes complete. */
14691 maybe_register_incomplete_var (var
)
14694 my_friendly_assert (TREE_CODE (var
) == VAR_DECL
, 20020406);
14696 /* Keep track of variables with incomplete types. */
14697 if (!processing_template_decl
&& TREE_TYPE (var
) != error_mark_node
14698 && DECL_EXTERNAL (var
))
14700 tree inner_type
= TREE_TYPE (var
);
14702 while (TREE_CODE (inner_type
) == ARRAY_TYPE
)
14703 inner_type
= TREE_TYPE (inner_type
);
14704 inner_type
= TYPE_MAIN_VARIANT (inner_type
);
14706 if ((!COMPLETE_TYPE_P (inner_type
) && CLASS_TYPE_P (inner_type
))
14707 /* RTTI TD entries are created while defining the type_info. */
14708 || (TYPE_LANG_SPECIFIC (inner_type
)
14709 && TYPE_BEING_DEFINED (inner_type
)))
14710 incomplete_vars
= tree_cons (inner_type
, var
, incomplete_vars
);
14714 /* Called when a class type (given by TYPE) is defined. If there are
14715 any existing VAR_DECLs whose type hsa been completed by this
14716 declaration, update them now. */
14719 complete_vars (type
)
14722 tree
*list
= &incomplete_vars
;
14724 my_friendly_assert (CLASS_TYPE_P (type
), 20020406);
14727 if (same_type_p (type
, TREE_PURPOSE (*list
)))
14729 tree var
= TREE_VALUE (*list
);
14730 /* Complete the type of the variable. The VAR_DECL itself
14731 will be laid out in expand_expr. */
14732 complete_type (TREE_TYPE (var
));
14733 /* Remove this entry from the list. */
14734 *list
= TREE_CHAIN (*list
);
14737 list
= &TREE_CHAIN (*list
);
14741 /* If DECL is of a type which needs a cleanup, build that cleanup
14745 cxx_maybe_build_cleanup (decl
)
14748 tree type
= TREE_TYPE (decl
);
14750 if (type
!= error_mark_node
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
14752 int flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14755 if (TREE_CODE (type
) == ARRAY_TYPE
)
14759 cxx_mark_addressable (decl
);
14760 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14763 /* Optimize for space over speed here. */
14764 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14765 || flag_expensive_optimizations
)
14766 flags
|= LOOKUP_NONVIRTUAL
;
14768 rval
= build_delete (TREE_TYPE (rval
), rval
,
14769 sfk_complete_destructor
, flags
, 0);
14771 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14772 && ! TYPE_HAS_DESTRUCTOR (type
))
14773 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14774 build_tree_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14781 /* When a stmt has been parsed, this function is called. */
14786 /* Always assume this statement was not an expression statement. If
14787 it actually was an expression statement, its our callers
14788 responsibility to fix this up. */
14789 last_expr_type
= NULL_TREE
;
14792 /* DECL was originally constructed as a non-static member function,
14793 but turned out to be static. Update it accordingly. */
14796 revert_static_member_fn (decl
)
14800 tree function
= TREE_TYPE (decl
);
14801 tree args
= TYPE_ARG_TYPES (function
);
14803 if (cp_type_quals (TREE_TYPE (TREE_VALUE (args
)))
14804 != TYPE_UNQUALIFIED
)
14805 error ("static member function `%#D' declared with type qualifiers",
14808 args
= TREE_CHAIN (args
);
14809 tmp
= build_function_type (TREE_TYPE (function
), args
);
14810 tmp
= build_qualified_type (tmp
, cp_type_quals (function
));
14811 tmp
= build_exception_variant (tmp
,
14812 TYPE_RAISES_EXCEPTIONS (function
));
14813 TREE_TYPE (decl
) = tmp
;
14814 if (DECL_ARGUMENTS (decl
))
14815 DECL_ARGUMENTS (decl
) = TREE_CHAIN (DECL_ARGUMENTS (decl
));
14816 DECL_STATIC_FUNCTION_P (decl
) = 1;
14819 /* Initialize the variables used during compilation of a C++
14823 cxx_push_function_context (f
)
14824 struct function
*f
;
14826 struct language_function
*p
14827 = ((struct language_function
*)
14828 ggc_alloc_cleared (sizeof (struct language_function
)));
14831 /* It takes an explicit call to expand_body to generate RTL for a
14835 /* Whenever we start a new function, we destroy temporaries in the
14837 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
14840 /* Free the language-specific parts of F, now that we've finished
14841 compiling the function. */
14844 cxx_pop_function_context (f
)
14845 struct function
*f
;
14850 /* Return which tree structure is used by T, or TS_CP_GENERIC if T is
14851 one of the language-independent trees. */
14853 enum cp_tree_node_structure_enum
14854 cp_tree_node_structure (t
)
14855 union lang_tree_node
*t
;
14857 switch (TREE_CODE (&t
->generic
))
14859 case DEFAULT_ARG
: return TS_CP_IDENTIFIER
;
14860 case IDENTIFIER_NODE
: return TS_CP_IDENTIFIER
;
14861 case CPLUS_BINDING
: return TS_CP_BINDING
;
14862 case OVERLOAD
: return TS_CP_OVERLOAD
;
14863 case TEMPLATE_PARM_INDEX
: return TS_CP_TPI
;
14864 case PTRMEM_CST
: return TS_CP_PTRMEM
;
14865 case WRAPPER
: return TS_CP_WRAPPER
;
14866 case SRCLOC
: return TS_CP_SRCLOC
;
14867 default: return TS_CP_GENERIC
;
14871 /* Return the IDENTIFIER_GLOBAL_VALUE of T, for use in common code, since
14872 the definition of IDENTIFIER_GLOBAL_VALUE is different for C and C++. */
14875 identifier_global_value (t
)
14878 return IDENTIFIER_GLOBAL_VALUE (t
);
14881 /* Build the void_list_node (void_type_node having been created). */
14883 build_void_list_node ()
14885 tree t
= build_tree_list (NULL_TREE
, void_type_node
);
14886 TREE_PARMLIST (t
) = 1;
14891 cp_missing_noreturn_ok_p (decl
)
14894 /* A missing noreturn is ok for the `main' function. */
14895 return DECL_MAIN_P (decl
);
14898 #include "gt-cp-decl.h"
14899 #include "gtype-cp.h"