1 /* Process declarations and variables for C compiler.
2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001 Free Software Foundation, Inc.
4 Contributed by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GNU CC.
8 GNU CC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GNU CC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GNU CC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
24 /* Process declarations and symbol lookup for C front end.
25 Also constructs types; the standard scalar types at initialization,
26 and structure, union, array and enum types when they are declared. */
28 /* ??? not all decl nodes are given the most useful possible
29 line numbers. For example, the CONST_DECLs for enum values. */
47 extern int current_class_depth
;
49 extern tree global_namespace
;
51 extern int (*valid_lang_attribute
) PARAMS ((tree
, tree
, tree
, tree
));
53 #ifndef BOOL_TYPE_SIZE
54 /* In the new ABI, `bool' has size and alignment `1', on all
56 #define BOOL_TYPE_SIZE CHAR_TYPE_SIZE
59 static tree grokparms
PARAMS ((tree
));
60 static const char *redeclaration_error_message
PARAMS ((tree
, tree
));
62 static void push_binding_level
PARAMS ((struct binding_level
*, int,
64 static void pop_binding_level
PARAMS ((void));
65 static void suspend_binding_level
PARAMS ((void));
66 static void resume_binding_level
PARAMS ((struct binding_level
*));
67 static struct binding_level
*make_binding_level
PARAMS ((void));
68 static void declare_namespace_level
PARAMS ((void));
69 static int decl_jump_unsafe
PARAMS ((tree
));
70 static void storedecls
PARAMS ((tree
));
71 static void require_complete_types_for_parms
PARAMS ((tree
));
72 static int ambi_op_p
PARAMS ((enum tree_code
));
73 static int unary_op_p
PARAMS ((enum tree_code
));
74 static tree store_bindings
PARAMS ((tree
, tree
));
75 static tree lookup_tag_reverse
PARAMS ((tree
, tree
));
76 static tree obscure_complex_init
PARAMS ((tree
, tree
));
77 static tree lookup_name_real
PARAMS ((tree
, int, int, int));
78 static void warn_extern_redeclared_static
PARAMS ((tree
, tree
));
79 static void grok_reference_init
PARAMS ((tree
, tree
, tree
));
80 static tree grokfndecl
PARAMS ((tree
, tree
, tree
, tree
, int,
81 enum overload_flags
, tree
,
82 tree
, int, int, int, int, int, int, tree
));
83 static tree grokvardecl
PARAMS ((tree
, tree
, RID_BIT_TYPE
*, int, int, tree
));
84 static tree lookup_tag
PARAMS ((enum tree_code
, tree
,
85 struct binding_level
*, int));
86 static void set_identifier_type_value_with_scope
87 PARAMS ((tree
, tree
, struct binding_level
*));
88 static void record_unknown_type
PARAMS ((tree
, const char *));
89 static tree build_library_fn_1
PARAMS ((tree
, enum tree_code
, tree
));
90 static int member_function_or_else
PARAMS ((tree
, tree
, enum overload_flags
));
91 static void bad_specifiers
PARAMS ((tree
, const char *, int, int, int, int,
93 static tree maybe_process_template_type_declaration
PARAMS ((tree
, int, struct binding_level
*));
94 static void check_for_uninitialized_const_var
PARAMS ((tree
));
95 static unsigned long typename_hash
PARAMS ((hash_table_key
));
96 static boolean typename_compare
PARAMS ((hash_table_key
, hash_table_key
));
97 static void push_binding
PARAMS ((tree
, tree
, struct binding_level
*));
98 static int add_binding
PARAMS ((tree
, tree
));
99 static void pop_binding
PARAMS ((tree
, tree
));
100 static tree local_variable_p_walkfn
PARAMS ((tree
*, int *, void *));
101 static tree find_binding
PARAMS ((tree
, tree
));
102 static tree select_decl
PARAMS ((tree
, int));
103 static int lookup_flags
PARAMS ((int, int));
104 static tree qualify_lookup
PARAMS ((tree
, int));
105 static tree record_builtin_java_type
PARAMS ((const char *, int));
106 static const char *tag_name
PARAMS ((enum tag_types code
));
107 static void find_class_binding_level
PARAMS ((void));
108 static struct binding_level
*innermost_nonclass_level
PARAMS ((void));
109 static void warn_about_implicit_typename_lookup
PARAMS ((tree
, tree
));
110 static int walk_namespaces_r
PARAMS ((tree
, walk_namespaces_fn
, void *));
111 static int walk_globals_r
PARAMS ((tree
, void *));
112 static void add_decl_to_level
PARAMS ((tree
, struct binding_level
*));
113 static tree make_label_decl
PARAMS ((tree
, int));
114 static void use_label
PARAMS ((tree
));
115 static void check_previous_goto_1
PARAMS ((tree
, struct binding_level
*, tree
,
117 static void check_previous_goto
PARAMS ((struct named_label_use_list
*));
118 static void check_switch_goto
PARAMS ((struct binding_level
*));
119 static void check_previous_gotos
PARAMS ((tree
));
120 static void pop_label
PARAMS ((tree
, tree
));
121 static void pop_labels
PARAMS ((tree
));
122 static void maybe_deduce_size_from_array_init
PARAMS ((tree
, tree
));
123 static void layout_var_decl
PARAMS ((tree
));
124 static void maybe_commonize_var
PARAMS ((tree
));
125 static tree check_initializer
PARAMS ((tree
, tree
));
126 static void make_rtl_for_nonlocal_decl
PARAMS ((tree
, tree
, const char *));
127 static void push_cp_function_context
PARAMS ((struct function
*));
128 static void pop_cp_function_context
PARAMS ((struct function
*));
129 static void mark_binding_level
PARAMS ((void *));
130 static void mark_named_label_lists
PARAMS ((void *, void *));
131 static void mark_cp_function_context
PARAMS ((struct function
*));
132 static void mark_saved_scope
PARAMS ((void *));
133 static void mark_lang_function
PARAMS ((struct cp_language_function
*));
134 static void save_function_data
PARAMS ((tree
));
135 static void check_function_type
PARAMS ((tree
, tree
));
136 static void destroy_local_var
PARAMS ((tree
));
137 static void finish_constructor_body
PARAMS ((void));
138 static void finish_destructor_body
PARAMS ((void));
139 static tree create_array_type_for_decl
PARAMS ((tree
, tree
, tree
));
140 static tree get_atexit_node
PARAMS ((void));
141 static tree get_dso_handle_node
PARAMS ((void));
142 static tree start_cleanup_fn
PARAMS ((void));
143 static void end_cleanup_fn
PARAMS ((void));
144 static tree cp_make_fname_decl
PARAMS ((tree
, const char *, int));
145 static void initialize_predefined_identifiers
PARAMS ((void));
146 static tree check_special_function_return_type
147 PARAMS ((special_function_kind
, tree
, tree
));
148 static tree push_cp_library_fn
PARAMS ((enum tree_code
, tree
));
149 static tree build_cp_library_fn
PARAMS ((tree
, enum tree_code
, tree
));
150 static void store_parm_decls
PARAMS ((tree
));
151 static int cp_missing_noreturn_ok_p
PARAMS ((tree
));
153 #if defined (DEBUG_CP_BINDING_LEVELS)
154 static void indent
PARAMS ((void));
157 /* Erroneous argument lists can use this *IFF* they do not modify it. */
158 tree error_mark_list
;
160 /* The following symbols are subsumed in the cp_global_trees array, and
161 listed here individually for documentation purposes.
164 tree wchar_decl_node;
166 tree vtable_entry_type;
167 tree delta_type_node;
170 tree __baselist_desc_type_node;
171 tree __i_desc_type_node, __m_desc_type_node;
172 tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type;
174 tree __t_desc_type_node;
176 tree __tp_desc_type_node;
178 tree ti_desc_type_node;
179 tree bltn_desc_type_node, ptr_desc_type_node;
180 tree ary_desc_type_node, func_desc_type_node, enum_desc_type_node;
181 tree class_desc_type_node, si_class_desc_type_node, vmi_class_desc_type_node;
182 tree ptm_desc_type_node;
183 tree base_desc_type_node;
185 Not needed yet? May be needed one day?
186 tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type;
187 tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type;
188 tree __ptmf_desc_array_type, __ptmd_desc_array_type;
191 tree class_type_node, record_type_node, union_type_node, enum_type_node;
192 tree unknown_type_node;
194 Array type `vtable_entry_type[]'
197 tree vtbl_ptr_type_node;
204 A FUNCTION_DECL which can call `abort'. Not necessarily the
205 one that the user will declare, but sufficient to be called
206 by routines that want to abort the program.
210 The FUNCTION_DECL for the default `::operator delete'.
212 tree global_delete_fndecl;
215 tree type_info_type_node, tinfo_decl_id, tinfo_decl_type;
220 tree cp_global_trees
[CPTI_MAX
];
222 /* Indicates that there is a type value in some namespace, although
223 that is not necessarily in scope at the moment. */
225 static tree global_type_node
;
227 /* If non-zero, this is the number of times we have entered the `std'
228 namespace when we are treating that namespace as an alias for the
230 static int in_fake_std
;
232 /* Expect only namespace names now. */
233 static int only_namespace_names
;
235 /* Used only for jumps to as-yet undefined labels, since jumps to
236 defined labels can have their validity checked immediately. */
238 struct named_label_use_list
240 struct binding_level
*binding_level
;
243 const char *filename_o_goto
;
245 struct named_label_use_list
*next
;
248 #define named_label_uses cp_function_chain->x_named_label_uses
250 /* A list of objects which have constructors or destructors
251 which reside in the global scope. The decl is stored in
252 the TREE_VALUE slot and the initializer is stored
253 in the TREE_PURPOSE slot. */
254 tree static_aggregates
;
258 /* A node for the integer constants 2, and 3. */
260 tree integer_two_node
, integer_three_node
;
262 /* Parsing a function declarator leaves here a chain of structure
263 and enum types declared in the parmlist. */
265 static tree last_function_parm_tags
;
267 /* Similar, for last_function_parm_tags. */
268 tree last_function_parms
;
269 static tree current_function_parm_tags
;
271 /* A list of all LABEL_DECLs in the function that have names. Here so
272 we can clear out their names' definitions at the end of the
273 function, and so we can check the validity of jumps to these labels. */
275 struct named_label_list
277 struct binding_level
*binding_level
;
283 struct named_label_list
*next
;
286 #define named_labels cp_function_chain->x_named_labels
288 /* Set to 0 at beginning of a function definition, and whenever
289 a label (case or named) is defined. Set to value of expression
290 returned from function when that value can be transformed into
291 a named return value. */
293 tree current_function_return_value
;
295 /* Nonzero means use the ISO C94 dialect of C. */
299 /* Nonzero means use the ISO C99 dialect of C. */
303 /* Nonzero means we are a hosted implementation for code shared with C. */
307 /* Nonzero means add default format_arg attributes for functions not
310 int flag_noniso_default_format_attributes
= 1;
312 /* Nonzero if we want to conserve space in the .o files. We do this
313 by putting uninitialized data and runtime initialized data into
314 .common instead of .data at the expense of not flagging multiple
316 extern int flag_conserve_space
;
318 /* C and C++ flags are in decl2.c. */
320 /* Flag used when debugging spew.c */
322 extern int spew_debug
;
324 /* A expression of value 0 with the same precision as a sizetype
326 tree signed_size_zero_node
;
328 /* The name of the anonymous namespace, throughout this translation
330 tree anonymous_namespace_name
;
332 /* The number of function bodies which we are currently processing.
333 (Zero if we are at namespace scope, one inside the body of a
334 function, two inside the body of a function in a local class, etc.) */
337 /* For each binding contour we allocate a binding_level structure
338 which records the names defined in that contour.
341 1) one for each function definition,
342 where internal declarations of the parameters appear.
343 2) one for each compound statement,
344 to record its declarations.
346 The current meaning of a name can be found by searching the levels
347 from the current one out to the global one.
349 Off to the side, may be the class_binding_level. This exists only
350 to catch class-local declarations. It is otherwise nonexistent.
352 Also there may be binding levels that catch cleanups that must be
353 run when exceptions occur. Thus, to see whether a name is bound in
354 the current scope, it is not enough to look in the
355 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
358 /* Note that the information in the `names' component of the global contour
359 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
363 /* A chain of _DECL nodes for all variables, constants, functions,
364 and typedef types. These are in the reverse of the order
365 supplied. There may be OVERLOADs on this list, too, but they
366 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
369 /* A list of structure, union and enum definitions, for looking up
371 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
372 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
373 or ENUMERAL_TYPE node.
375 C++: the TREE_VALUE nodes can be simple types for
376 component_bindings. */
379 /* A list of USING_DECL nodes. */
382 /* A list of used namespaces. PURPOSE is the namespace,
383 VALUE the common ancestor with this binding_level's namespace. */
384 tree using_directives
;
386 /* If this binding level is the binding level for a class, then
387 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
388 is the name of an entity bound in the class. The TREE_TYPE is
389 the DECL bound by this name in the class. */
392 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
393 is used for all binding levels. In addition the TREE_VALUE is the
394 IDENTIFIER_TYPE_VALUE before we entered the class. */
397 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
398 label in this scope. The TREE_PURPOSE is the previous value of
399 the IDENTIFIER_LABEL VALUE. */
400 tree shadowed_labels
;
402 /* For each level (except not the global one),
403 a chain of BLOCK nodes for all the levels
404 that were entered and exited one level down. */
407 /* The _TYPE node for this level, if parm_flag == 2. */
410 /* The binding level which this one is contained in (inherits from). */
411 struct binding_level
*level_chain
;
413 /* List of decls in `names' that have incomplete
414 structure or union types. */
417 /* List of VAR_DECLS saved from a previous for statement.
418 These would be dead in ISO-conforming code, but might
419 be referenced in ARM-era code. These are stored in a
420 TREE_LIST; the TREE_VALUE is the actual declaration. */
421 tree dead_vars_from_for
;
423 /* 1 for the level that holds the parameters of a function.
424 2 for the level that holds a class declaration. */
425 unsigned parm_flag
: 2;
427 /* 1 means make a BLOCK for this level regardless of all else.
428 2 for temporary binding contours created by the compiler. */
431 /* Nonzero if this level "doesn't exist" for tags. */
432 unsigned tag_transparent
: 1;
434 /* Nonzero if this level can safely have additional
435 cleanup-needing variables added to it. */
436 unsigned more_cleanups_ok
: 1;
437 unsigned have_cleanups
: 1;
439 /* Nonzero if this scope is for storing the decls for template
440 parameters and generic decls; these decls will be discarded and
441 replaced with a TEMPLATE_DECL. */
442 unsigned template_parms_p
: 1;
444 /* Nonzero if this scope corresponds to the `<>' in a
445 `template <>' clause. Whenever this flag is set,
446 TEMPLATE_PARMS_P will be set as well. */
447 unsigned template_spec_p
: 1;
449 /* This is set for a namespace binding level. */
450 unsigned namespace_p
: 1;
452 /* True if this level is that of a for-statement where we need to
453 worry about ambiguous (ARM or ISO) scope rules. */
454 unsigned is_for_scope
: 1;
456 /* True if this level corresponds to an EH region, as for a try block.
457 Currently this information is only available while building the
459 unsigned eh_region
: 1;
461 /* Four bits left for this word. */
463 #if defined(DEBUG_CP_BINDING_LEVELS)
464 /* Binding depth at which this level began. */
465 unsigned binding_depth
;
466 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
469 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
471 /* The binding level currently in effect. */
473 #define current_binding_level \
475 ? cp_function_chain->bindings \
476 : scope_chain->bindings)
478 /* The binding level of the current class, if any. */
480 #define class_binding_level scope_chain->class_bindings
482 /* A chain of binding_level structures awaiting reuse. */
484 static struct binding_level
*free_binding_level
;
486 /* The outermost binding level, for names of file scope.
487 This is created when the compiler is started and exists
488 through the entire run. */
490 static struct binding_level
*global_binding_level
;
492 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
494 static int keep_next_level_flag
;
496 #if defined(DEBUG_CP_BINDING_LEVELS)
497 static int binding_depth
= 0;
498 static int is_class_level
= 0;
505 for (i
= 0; i
< binding_depth
*2; i
++)
508 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
510 static tree pushdecl_with_scope
PARAMS ((tree
, struct binding_level
*));
513 push_binding_level (newlevel
, tag_transparent
, keep
)
514 struct binding_level
*newlevel
;
515 int tag_transparent
, keep
;
517 /* Add this level to the front of the chain (stack) of levels that
519 memset ((char*) newlevel
, 0, sizeof (struct binding_level
));
520 newlevel
->level_chain
= current_binding_level
;
521 current_binding_level
= newlevel
;
522 newlevel
->tag_transparent
= tag_transparent
;
523 newlevel
->more_cleanups_ok
= 1;
525 newlevel
->keep
= keep
;
526 #if defined(DEBUG_CP_BINDING_LEVELS)
527 newlevel
->binding_depth
= binding_depth
;
529 fprintf (stderr
, "push %s level 0x%08x line %d\n",
530 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
533 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
536 /* Find the innermost enclosing class scope, and reset
537 CLASS_BINDING_LEVEL appropriately. */
540 find_class_binding_level ()
542 struct binding_level
*level
= current_binding_level
;
544 while (level
&& level
->parm_flag
!= 2)
545 level
= level
->level_chain
;
546 if (level
&& level
->parm_flag
== 2)
547 class_binding_level
= level
;
549 class_binding_level
= 0;
555 if (global_binding_level
)
557 /* Cannot pop a level, if there are none left to pop. */
558 if (current_binding_level
== global_binding_level
)
559 my_friendly_abort (123);
561 /* Pop the current level, and free the structure for reuse. */
562 #if defined(DEBUG_CP_BINDING_LEVELS)
565 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
566 (is_class_level
) ? "class" : "block",
567 current_binding_level
, lineno
);
568 if (is_class_level
!= (current_binding_level
== class_binding_level
))
571 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
574 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
576 register struct binding_level
*level
= current_binding_level
;
577 current_binding_level
= current_binding_level
->level_chain
;
578 level
->level_chain
= free_binding_level
;
579 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
580 if (level
->binding_depth
!= binding_depth
)
582 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
583 free_binding_level
= level
;
584 find_class_binding_level ();
589 suspend_binding_level ()
591 if (class_binding_level
)
592 current_binding_level
= class_binding_level
;
594 if (global_binding_level
)
596 /* Cannot suspend a level, if there are none left to suspend. */
597 if (current_binding_level
== global_binding_level
)
598 my_friendly_abort (123);
600 /* Suspend the current level. */
601 #if defined(DEBUG_CP_BINDING_LEVELS)
604 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
605 (is_class_level
) ? "class" : "block",
606 current_binding_level
, lineno
);
607 if (is_class_level
!= (current_binding_level
== class_binding_level
))
610 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
613 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
614 current_binding_level
= current_binding_level
->level_chain
;
615 find_class_binding_level ();
619 resume_binding_level (b
)
620 struct binding_level
*b
;
622 /* Resuming binding levels is meant only for namespaces,
623 and those cannot nest into classes. */
624 my_friendly_assert(!class_binding_level
, 386);
625 /* Also, resuming a non-directly nested namespace is a no-no. */
626 my_friendly_assert(b
->level_chain
== current_binding_level
, 386);
627 current_binding_level
= b
;
628 #if defined(DEBUG_CP_BINDING_LEVELS)
629 b
->binding_depth
= binding_depth
;
631 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
632 (is_class_level
) ? "class" : "block", b
, lineno
);
635 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
638 /* Create a new `struct binding_level'. */
641 struct binding_level
*
642 make_binding_level ()
645 return (struct binding_level
*) xmalloc (sizeof (struct binding_level
));
648 /* Nonzero if we are currently in the global binding level. */
653 return current_binding_level
== global_binding_level
;
656 /* Return the innermost binding level that is not for a class scope. */
658 static struct binding_level
*
659 innermost_nonclass_level ()
661 struct binding_level
*b
;
663 b
= current_binding_level
;
664 while (b
->parm_flag
== 2)
670 /* Nonzero if we are currently in a toplevel binding level. This
671 means either the global binding level or a namespace in a toplevel
672 binding level. Since there are no non-toplevel namespace levels,
673 this really means any namespace or template parameter level. We
674 also include a class whose context is toplevel. */
677 toplevel_bindings_p ()
679 struct binding_level
*b
= innermost_nonclass_level ();
681 return b
->namespace_p
|| b
->template_parms_p
;
684 /* Nonzero if this is a namespace scope, or if we are defining a class
685 which is itself at namespace scope, or whose enclosing class is
686 such a class, etc. */
689 namespace_bindings_p ()
691 struct binding_level
*b
= innermost_nonclass_level ();
693 return b
->namespace_p
;
696 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
697 unconditionally. Otherwise, use the normal logic to decide whether
698 or not to create a BLOCK. */
701 keep_next_level (keep
)
704 keep_next_level_flag
= keep
;
707 /* Nonzero if the current level needs to have a BLOCK made. */
712 return (current_binding_level
->blocks
!= NULL_TREE
713 || current_binding_level
->keep
714 || current_binding_level
->names
!= NULL_TREE
715 || (current_binding_level
->tags
!= NULL_TREE
716 && !current_binding_level
->tag_transparent
));
720 declare_namespace_level ()
722 current_binding_level
->namespace_p
= 1;
725 /* Returns non-zero if this scope was created to store template
729 template_parm_scope_p ()
731 return current_binding_level
->template_parms_p
;
734 /* Returns the kind of template specialization we are currently
735 processing, given that it's declaration contained N_CLASS_SCOPES
736 explicit scope qualifications. */
739 current_tmpl_spec_kind (n_class_scopes
)
742 int n_template_parm_scopes
= 0;
743 int seen_specialization_p
= 0;
744 int innermost_specialization_p
= 0;
745 struct binding_level
*b
;
747 /* Scan through the template parameter scopes. */
748 for (b
= current_binding_level
; b
->template_parms_p
; b
= b
->level_chain
)
750 /* If we see a specialization scope inside a parameter scope,
751 then something is wrong. That corresponds to a declaration
754 template <class T> template <> ...
756 which is always illegal since [temp.expl.spec] forbids the
757 specialization of a class member template if the enclosing
758 class templates are not explicitly specialized as well. */
759 if (b
->template_spec_p
)
761 if (n_template_parm_scopes
== 0)
762 innermost_specialization_p
= 1;
764 seen_specialization_p
= 1;
766 else if (seen_specialization_p
== 1)
767 return tsk_invalid_member_spec
;
769 ++n_template_parm_scopes
;
772 /* Handle explicit instantiations. */
773 if (processing_explicit_instantiation
)
775 if (n_template_parm_scopes
!= 0)
776 /* We've seen a template parameter list during an explicit
777 instantiation. For example:
779 template <class T> template void f(int);
781 This is erroneous. */
782 return tsk_invalid_expl_inst
;
784 return tsk_expl_inst
;
787 if (n_template_parm_scopes
< n_class_scopes
)
788 /* We've not seen enough template headers to match all the
789 specialized classes present. For example:
791 template <class T> void R<T>::S<T>::f(int);
793 This is illegal; there needs to be one set of template
794 parameters for each class. */
795 return tsk_insufficient_parms
;
796 else if (n_template_parm_scopes
== n_class_scopes
)
797 /* We're processing a non-template declaration (even though it may
798 be a member of a template class.) For example:
800 template <class T> void S<T>::f(int);
802 The `class T' maches the `S<T>', leaving no template headers
803 corresponding to the `f'. */
805 else if (n_template_parm_scopes
> n_class_scopes
+ 1)
806 /* We've got too many template headers. For example:
808 template <> template <class T> void f (T);
810 There need to be more enclosing classes. */
811 return tsk_excessive_parms
;
813 /* This must be a template. It's of the form:
815 template <class T> template <class U> void S<T>::f(U);
817 This is a specialization if the innermost level was a
818 specialization; otherwise it's just a definition of the
820 return innermost_specialization_p
? tsk_expl_spec
: tsk_template
;
824 set_class_shadows (shadows
)
827 class_binding_level
->class_shadowed
= shadows
;
830 /* Enter a new binding level.
831 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
832 not for that of tags. */
835 pushlevel (tag_transparent
)
838 struct binding_level
*newlevel
;
840 if (cfun
&& !doing_semantic_analysis_p ())
843 /* Reuse or create a struct for this binding level. */
844 #if defined(DEBUG_CP_BINDING_LEVELS)
846 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
847 if (free_binding_level
)
848 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
850 newlevel
= free_binding_level
;
851 free_binding_level
= free_binding_level
->level_chain
;
854 newlevel
= make_binding_level ();
856 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
857 GNU_xref_start_scope ((HOST_WIDE_INT
) newlevel
);
858 keep_next_level_flag
= 0;
861 /* We're defining an object of type TYPE. If it needs a cleanup, but
862 we're not allowed to add any more objects with cleanups to the current
863 scope, create a new binding level. */
866 maybe_push_cleanup_level (type
)
869 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
870 && current_binding_level
->more_cleanups_ok
== 0)
875 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/1);
879 /* Enter a new scope. The KIND indicates what kind of scope is being
890 case sk_template_spec
:
891 current_binding_level
->template_spec_p
= 1;
894 case sk_template_parms
:
895 current_binding_level
->template_parms_p
= 1;
899 my_friendly_abort (20000309);
903 /* Exit the current scope. */
912 note_level_for_for ()
914 current_binding_level
->is_for_scope
= 1;
917 /* Record that the current binding level represents a try block. */
922 current_binding_level
->eh_region
= 1;
925 /* For a binding between a name and an entity at a block scope,
926 this is the `struct binding_level' for the block. */
927 #define BINDING_LEVEL(NODE) \
928 (((struct tree_binding*)NODE)->scope.level)
930 /* A free list of CPLUS_BINDING nodes, connected by their
933 static tree free_bindings
;
935 /* Make DECL the innermost binding for ID. The LEVEL is the binding
936 level at which this declaration is being bound. */
939 push_binding (id
, decl
, level
)
942 struct binding_level
* level
;
948 binding
= free_bindings
;
949 free_bindings
= TREE_CHAIN (binding
);
952 binding
= make_node (CPLUS_BINDING
);
954 /* Now, fill in the binding information. */
955 BINDING_VALUE (binding
) = decl
;
956 BINDING_TYPE (binding
) = NULL_TREE
;
957 BINDING_LEVEL (binding
) = level
;
958 INHERITED_VALUE_BINDING_P (binding
) = 0;
959 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
960 BINDING_HAS_LEVEL_P (binding
) = 1;
962 /* And put it on the front of the list of bindings for ID. */
963 TREE_CHAIN (binding
) = IDENTIFIER_BINDING (id
);
964 IDENTIFIER_BINDING (id
) = binding
;
967 /* ID is already bound in the current scope. But, DECL is an
968 additional binding for ID in the same scope. This is the `struct
969 stat' hack whereby a non-typedef class-name or enum-name can be
970 bound at the same level as some other kind of entity. It's the
971 responsibility of the caller to check that inserting this name is
972 legal here. Returns nonzero if the new binding was successful. */
974 add_binding (id
, decl
)
978 tree binding
= IDENTIFIER_BINDING (id
);
981 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
982 /* The new name is the type name. */
983 BINDING_TYPE (binding
) = decl
;
984 else if (!BINDING_VALUE (binding
))
985 /* This situation arises when push_class_level_binding moves an
986 inherited type-binding out of the way to make room for a new
988 BINDING_VALUE (binding
) = decl
;
989 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
990 && DECL_ARTIFICIAL (BINDING_VALUE (binding
)))
992 /* The old binding was a type name. It was placed in
993 BINDING_VALUE because it was thought, at the point it was
994 declared, to be the only entity with such a name. Move the
995 type name into the type slot; it is now hidden by the new
997 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
998 BINDING_VALUE (binding
) = decl
;
999 INHERITED_VALUE_BINDING_P (binding
) = 0;
1001 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
1002 && TREE_CODE (decl
) == TYPE_DECL
1003 && DECL_NAME (decl
) == DECL_NAME (BINDING_VALUE (binding
))
1004 && same_type_p (TREE_TYPE (decl
),
1005 TREE_TYPE (BINDING_VALUE (binding
))))
1006 /* We have two typedef-names, both naming the same type to have
1007 the same name. This is OK because of:
1011 In a given scope, a typedef specifier can be used to redefine
1012 the name of any type declared in that scope to refer to the
1013 type to which it already refers. */
1015 /* There can be two block-scope declarations of the same variable,
1016 so long as they are `extern' declarations. */
1017 else if (TREE_CODE (decl
) == VAR_DECL
1018 && TREE_CODE (BINDING_VALUE (binding
)) == VAR_DECL
1019 && DECL_EXTERNAL (decl
)
1020 && DECL_EXTERNAL (BINDING_VALUE (binding
)))
1022 duplicate_decls (decl
, BINDING_VALUE (binding
));
1027 cp_error ("declaration of `%#D'", decl
);
1028 cp_error_at ("conflicts with previous declaration `%#D'",
1029 BINDING_VALUE (binding
));
1036 /* Add DECL to the list of things declared in B. */
1039 add_decl_to_level (decl
, b
)
1041 struct binding_level
*b
;
1043 /* We build up the list in reverse order, and reverse it later if
1045 TREE_CHAIN (decl
) = b
->names
;
1049 /* Bind DECL to ID in the current_binding_level, assumed to be a local
1050 binding level. If PUSH_USING is set in FLAGS, we know that DECL
1051 doesn't really belong to this binding level, that it got here
1052 through a using-declaration. */
1055 push_local_binding (id
, decl
, flags
)
1060 struct binding_level
*b
;
1062 /* Skip over any local classes. This makes sense if we call
1063 push_local_binding with a friend decl of a local class. */
1064 b
= current_binding_level
;
1065 while (b
->parm_flag
== 2)
1068 if (lookup_name_current_level (id
))
1070 /* Supplement the existing binding. */
1071 if (!add_binding (id
, decl
))
1072 /* It didn't work. Something else must be bound at this
1073 level. Do not add DECL to the list of things to pop
1078 /* Create a new binding. */
1079 push_binding (id
, decl
, b
);
1081 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
1082 /* We must put the OVERLOAD into a TREE_LIST since the
1083 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1084 decls that got here through a using-declaration. */
1085 decl
= build_tree_list (NULL_TREE
, decl
);
1087 /* And put DECL on the list of things declared by the current
1089 add_decl_to_level (decl
, b
);
1092 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
1093 binding was successful. */
1096 push_class_binding (id
, decl
)
1101 tree binding
= IDENTIFIER_BINDING (id
);
1104 /* Note that we declared this value so that we can issue an error if
1105 this an illegal redeclaration of a name already used for some
1107 note_name_declared_in_class (id
, decl
);
1109 if (binding
&& BINDING_LEVEL (binding
) == class_binding_level
)
1110 /* Supplement the existing binding. */
1111 result
= add_binding (id
, decl
);
1113 /* Create a new binding. */
1114 push_binding (id
, decl
, class_binding_level
);
1116 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1117 class-level declaration. Note that we do not use DECL here
1118 because of the possibility of the `struct stat' hack; if DECL is
1119 a class-name or enum-name we might prefer a field-name, or some
1121 IDENTIFIER_CLASS_VALUE (id
) = BINDING_VALUE (IDENTIFIER_BINDING (id
));
1123 /* If this is a binding from a base class, mark it as such. */
1124 binding
= IDENTIFIER_BINDING (id
);
1125 if (BINDING_VALUE (binding
) == decl
&& TREE_CODE (decl
) != TREE_LIST
)
1127 /* Any implicit typename must be from a base-class. The
1128 context for an implicit typename declaration is always
1129 the derived class in which the lookup was done, so the checks
1130 based on the context of DECL below will not trigger. */
1131 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl
))
1132 INHERITED_VALUE_BINDING_P (binding
) = 1;
1135 if (TREE_CODE (decl
) == OVERLOAD
)
1136 context
= CP_DECL_CONTEXT (OVL_CURRENT (decl
));
1139 my_friendly_assert (DECL_P (decl
), 0);
1140 context
= context_for_name_lookup (decl
);
1143 if (is_properly_derived_from (current_class_type
, context
))
1144 INHERITED_VALUE_BINDING_P (binding
) = 1;
1146 INHERITED_VALUE_BINDING_P (binding
) = 0;
1149 else if (BINDING_VALUE (binding
) == decl
)
1150 /* We only encounter a TREE_LIST when push_class_decls detects an
1151 ambiguity. Such an ambiguity can be overridden by a definition
1153 INHERITED_VALUE_BINDING_P (binding
) = 1;
1158 /* Remove the binding for DECL which should be the innermost binding
1162 pop_binding (id
, decl
)
1168 if (id
== NULL_TREE
)
1169 /* It's easiest to write the loops that call this function without
1170 checking whether or not the entities involved have names. We
1171 get here for such an entity. */
1174 /* Get the innermost binding for ID. */
1175 binding
= IDENTIFIER_BINDING (id
);
1177 /* The name should be bound. */
1178 my_friendly_assert (binding
!= NULL_TREE
, 0);
1180 /* The DECL will be either the ordinary binding or the type
1181 binding for this identifier. Remove that binding. */
1182 if (BINDING_VALUE (binding
) == decl
)
1183 BINDING_VALUE (binding
) = NULL_TREE
;
1184 else if (BINDING_TYPE (binding
) == decl
)
1185 BINDING_TYPE (binding
) = NULL_TREE
;
1187 my_friendly_abort (0);
1189 if (!BINDING_VALUE (binding
) && !BINDING_TYPE (binding
))
1191 /* We're completely done with the innermost binding for this
1192 identifier. Unhook it from the list of bindings. */
1193 IDENTIFIER_BINDING (id
) = TREE_CHAIN (binding
);
1195 /* Add it to the free list. */
1196 TREE_CHAIN (binding
) = free_bindings
;
1197 free_bindings
= binding
;
1199 /* Clear the BINDING_LEVEL so the garbage collector doesn't walk
1201 BINDING_LEVEL (binding
) = NULL
;
1205 /* When a label goes out of scope, check to see if that label was used
1206 in a valid manner, and issue any appropriate warnings or errors. */
1209 pop_label (label
, old_value
)
1213 if (!processing_template_decl
&& doing_semantic_analysis_p ())
1215 if (DECL_INITIAL (label
) == NULL_TREE
)
1217 cp_error_at ("label `%D' used but not defined", label
);
1218 /* Avoid crashing later. */
1219 define_label (input_filename
, 1, DECL_NAME (label
));
1221 else if (warn_unused_label
&& !TREE_USED (label
))
1222 cp_warning_at ("label `%D' defined but not used", label
);
1225 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), old_value
);
1228 /* At the end of a function, all labels declared within the function
1229 go out of scope. BLOCK is the top-level block for the
1236 struct named_label_list
*link
;
1238 /* Clear out the definitions of all label names, since their scopes
1240 for (link
= named_labels
; link
; link
= link
->next
)
1242 pop_label (link
->label_decl
, link
->old_value
);
1243 /* Put the labels into the "variables" of the top-level block,
1244 so debugger can see them. */
1245 TREE_CHAIN (link
->label_decl
) = BLOCK_VARS (block
);
1246 BLOCK_VARS (block
) = link
->label_decl
;
1249 named_labels
= NULL
;
1252 /* Exit a binding level.
1253 Pop the level off, and restore the state of the identifier-decl mappings
1254 that were in effect when this level was entered.
1256 If KEEP == 1, this level had explicit declarations, so
1257 and create a "block" (a BLOCK node) for the level
1258 to record its declarations and subblocks for symbol table output.
1260 If FUNCTIONBODY is nonzero, this level is the body of a function,
1261 so create a block as if KEEP were set and also clear out all
1264 If REVERSE is nonzero, reverse the order of decls before putting
1265 them into the BLOCK. */
1268 poplevel (keep
, reverse
, functionbody
)
1274 /* The chain of decls was accumulated in reverse order.
1275 Put it into forward order, just for cleanliness. */
1277 int tmp
= functionbody
;
1278 int real_functionbody
;
1281 tree block
= NULL_TREE
;
1283 int leaving_for_scope
;
1285 if (cfun
&& !doing_semantic_analysis_p ())
1288 my_friendly_assert (current_binding_level
->parm_flag
!= 2,
1291 real_functionbody
= (current_binding_level
->keep
== 2
1292 ? ((functionbody
= 0), tmp
) : functionbody
);
1293 tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1294 subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1296 my_friendly_assert (!current_binding_level
->class_shadowed
,
1299 /* We used to use KEEP == 2 to indicate that the new block should go
1300 at the beginning of the list of blocks at this binding level,
1301 rather than the end. This hack is no longer used. */
1302 my_friendly_assert (keep
== 0 || keep
== 1, 0);
1304 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1305 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1306 current_binding_level
->parm_flag
,
1307 current_binding_level
->keep
);
1309 if (current_binding_level
->keep
== 1)
1312 /* Any uses of undefined labels, and any defined labels, now operate
1313 under constraints of next binding contour. */
1314 if (cfun
&& !functionbody
)
1316 struct binding_level
*level_chain
;
1317 level_chain
= current_binding_level
->level_chain
;
1320 struct named_label_use_list
*uses
;
1321 struct named_label_list
*labels
;
1322 for (labels
= named_labels
; labels
; labels
= labels
->next
)
1323 if (labels
->binding_level
== current_binding_level
)
1326 if (current_binding_level
->eh_region
)
1327 labels
->eh_region
= 1;
1328 for (decl
= labels
->names_in_scope
; decl
;
1329 decl
= TREE_CHAIN (decl
))
1330 if (decl_jump_unsafe (decl
))
1331 labels
->bad_decls
= tree_cons (NULL_TREE
, decl
,
1333 labels
->binding_level
= level_chain
;
1334 labels
->names_in_scope
= level_chain
->names
;
1337 for (uses
= named_label_uses
; uses
; uses
= uses
->next
)
1338 if (uses
->binding_level
== current_binding_level
)
1340 uses
->binding_level
= level_chain
;
1341 uses
->names_in_scope
= level_chain
->names
;
1346 /* Get the decls in the order they were written.
1347 Usually current_binding_level->names is in reverse order.
1348 But parameter decls were previously put in forward order. */
1351 current_binding_level
->names
1352 = decls
= nreverse (current_binding_level
->names
);
1354 decls
= current_binding_level
->names
;
1356 /* Output any nested inline functions within this block
1357 if they weren't already output. */
1358 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1359 if (TREE_CODE (decl
) == FUNCTION_DECL
1360 && ! TREE_ASM_WRITTEN (decl
)
1361 && DECL_INITIAL (decl
) != NULL_TREE
1362 && TREE_ADDRESSABLE (decl
)
1363 && decl_function_context (decl
) == current_function_decl
)
1365 /* If this decl was copied from a file-scope decl
1366 on account of a block-scope extern decl,
1367 propagate TREE_ADDRESSABLE to the file-scope decl. */
1368 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1369 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1372 push_function_context ();
1373 output_inline_function (decl
);
1374 pop_function_context ();
1378 /* When not in function-at-a-time mode, expand_end_bindings will
1379 warn about unused variables. But, in function-at-a-time mode
1380 expand_end_bindings is not passed the list of variables in the
1381 current scope, and therefore no warning is emitted. So, we
1382 explicitly warn here. */
1383 if (!processing_template_decl
)
1384 warn_about_unused_variables (getdecls ());
1386 /* If there were any declarations or structure tags in that level,
1387 or if this level is a function body,
1388 create a BLOCK to record them for the life of this function. */
1390 if (keep
== 1 || functionbody
)
1391 block
= make_node (BLOCK
);
1392 if (block
!= NULL_TREE
)
1394 BLOCK_VARS (block
) = decls
;
1395 BLOCK_SUBBLOCKS (block
) = subblocks
;
1398 /* In each subblock, record that this is its superior. */
1400 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1401 BLOCK_SUPERCONTEXT (link
) = block
;
1403 /* We still support the old for-scope rules, whereby the variables
1404 in a for-init statement were in scope after the for-statement
1405 ended. We only use the new rules in flag_new_for_scope is
1408 = current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1;
1410 /* Remove declarations for all the DECLs in this level. */
1411 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1413 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
1414 && DECL_NAME (link
))
1417 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link
)));
1421 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
1423 ns_binding
= NULL_TREE
;
1426 && (BINDING_LEVEL (outer_binding
)
1427 == current_binding_level
->level_chain
))
1428 /* We have something like:
1433 and we are leaving the `for' scope. There's no reason to
1434 keep the binding of the inner `i' in this case. */
1435 pop_binding (DECL_NAME (link
), link
);
1436 else if ((outer_binding
1437 && (TREE_CODE (BINDING_VALUE (outer_binding
))
1440 && TREE_CODE (ns_binding
) == TYPE_DECL
))
1441 /* Here, we have something like:
1449 We must pop the for-scope binding so we know what's a
1450 type and what isn't. */
1451 pop_binding (DECL_NAME (link
), link
);
1454 /* Mark this VAR_DECL as dead so that we can tell we left it
1455 there only for backward compatibility. */
1456 DECL_DEAD_FOR_LOCAL (link
) = 1;
1458 /* Keep track of what should of have happenned when we
1459 popped the binding. */
1460 if (outer_binding
&& BINDING_VALUE (outer_binding
))
1461 DECL_SHADOWED_FOR_VAR (link
)
1462 = BINDING_VALUE (outer_binding
);
1464 /* Add it to the list of dead variables in the next
1465 outermost binding to that we can remove these when we
1466 leave that binding. */
1467 current_binding_level
->level_chain
->dead_vars_from_for
1468 = tree_cons (NULL_TREE
, link
,
1469 current_binding_level
->level_chain
->
1470 dead_vars_from_for
);
1472 /* Although we don't pop the CPLUS_BINDING, we do clear
1473 its BINDING_LEVEL since the level is going away now. */
1474 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link
)))
1480 /* Remove the binding. */
1482 if (TREE_CODE (decl
) == TREE_LIST
)
1483 decl
= TREE_VALUE (decl
);
1485 pop_binding (DECL_NAME (decl
), decl
);
1486 else if (TREE_CODE (decl
) == OVERLOAD
)
1487 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
1489 my_friendly_abort (0);
1493 /* Remove declarations for any `for' variables from inner scopes
1494 that we kept around. */
1495 for (link
= current_binding_level
->dead_vars_from_for
;
1496 link
; link
= TREE_CHAIN (link
))
1497 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
1499 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1500 for (link
= current_binding_level
->type_shadowed
;
1501 link
; link
= TREE_CHAIN (link
))
1502 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1504 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1505 for (link
= current_binding_level
->shadowed_labels
;
1507 link
= TREE_CHAIN (link
))
1508 pop_label (TREE_VALUE (link
), TREE_PURPOSE (link
));
1510 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1511 list if a `using' declaration put them there. The debugging
1512 back-ends won't understand OVERLOAD, so we remove them here.
1513 Because the BLOCK_VARS are (temporarily) shared with
1514 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1515 popped all the bindings. */
1520 for (d
= &BLOCK_VARS (block
); *d
; )
1522 if (TREE_CODE (*d
) == TREE_LIST
)
1523 *d
= TREE_CHAIN (*d
);
1525 d
= &TREE_CHAIN (*d
);
1529 /* If the level being exited is the top level of a function,
1530 check over all the labels. */
1533 /* Since this is the top level block of a function, the vars are
1534 the function's parameters. Don't leave them in the BLOCK
1535 because they are found in the FUNCTION_DECL instead. */
1536 BLOCK_VARS (block
) = 0;
1540 tmp
= current_binding_level
->keep
;
1542 pop_binding_level ();
1544 DECL_INITIAL (current_function_decl
) = block
;
1546 current_binding_level
->blocks
1547 = chainon (current_binding_level
->blocks
, block
);
1549 /* If we did not make a block for the level just exited,
1550 any blocks made for inner levels
1551 (since they cannot be recorded as subblocks in that level)
1552 must be carried forward so they will later become subblocks
1553 of something else. */
1555 current_binding_level
->blocks
1556 = chainon (current_binding_level
->blocks
, subblocks
);
1558 /* Each and every BLOCK node created here in `poplevel' is important
1559 (e.g. for proper debugging information) so if we created one
1560 earlier, mark it as "used". */
1562 TREE_USED (block
) = 1;
1564 /* Take care of compiler's internal binding structures. */
1570 = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/1);
1573 SCOPE_STMT_BLOCK (TREE_PURPOSE (scope_stmts
)) = block
;
1574 SCOPE_STMT_BLOCK (TREE_VALUE (scope_stmts
)) = block
;
1577 block
= poplevel (keep
, reverse
, functionbody
);
1583 /* Delete the node BLOCK from the current binding level.
1584 This is used for the block inside a stmt expr ({...})
1585 so that the block can be reinserted where appropriate. */
1588 delete_block (block
)
1592 if (current_binding_level
->blocks
== block
)
1593 current_binding_level
->blocks
= TREE_CHAIN (block
);
1594 for (t
= current_binding_level
->blocks
; t
;)
1596 if (TREE_CHAIN (t
) == block
)
1597 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1601 TREE_CHAIN (block
) = NULL_TREE
;
1602 /* Clear TREE_USED which is always set by poplevel.
1603 The flag is set again if insert_block is called. */
1604 TREE_USED (block
) = 0;
1607 /* Insert BLOCK at the end of the list of subblocks of the
1608 current binding level. This is used when a BIND_EXPR is expanded,
1609 to handle the BLOCK node inside the BIND_EXPR. */
1612 insert_block (block
)
1615 TREE_USED (block
) = 1;
1616 current_binding_level
->blocks
1617 = chainon (current_binding_level
->blocks
, block
);
1620 /* Set the BLOCK node for the innermost scope
1621 (the one we are currently in). */
1625 tree block ATTRIBUTE_UNUSED
;
1627 /* The RTL expansion machinery requires us to provide this callback,
1628 but it is not applicable in function-at-a-time mode. */
1629 my_friendly_assert (cfun
&& !doing_semantic_analysis_p (), 20000911);
1632 /* Do a pushlevel for class declarations. */
1637 register struct binding_level
*newlevel
;
1639 /* Reuse or create a struct for this binding level. */
1640 #if defined(DEBUG_CP_BINDING_LEVELS)
1642 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1643 if (free_binding_level
)
1644 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1646 newlevel
= free_binding_level
;
1647 free_binding_level
= free_binding_level
->level_chain
;
1650 newlevel
= make_binding_level ();
1652 #if defined(DEBUG_CP_BINDING_LEVELS)
1654 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1656 push_binding_level (newlevel
, 0, 0);
1658 class_binding_level
= current_binding_level
;
1659 class_binding_level
->parm_flag
= 2;
1660 class_binding_level
->this_class
= current_class_type
;
1663 /* ...and a poplevel for class declarations. */
1668 register struct binding_level
*level
= class_binding_level
;
1671 my_friendly_assert (level
!= 0, 354);
1673 /* If we're leaving a toplevel class, don't bother to do the setting
1674 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1675 shouldn't even be used when current_class_type isn't set, and second,
1676 if we don't touch it here, we're able to use the cache effect if the
1677 next time we're entering a class scope, it is the same class. */
1678 if (current_class_depth
!= 1)
1680 struct binding_level
* b
;
1682 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1683 for (shadowed
= level
->class_shadowed
;
1685 shadowed
= TREE_CHAIN (shadowed
))
1686 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = NULL_TREE
;
1688 /* Find the next enclosing class, and recreate
1689 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1690 b
= level
->level_chain
;
1691 while (b
&& b
->parm_flag
!= 2)
1695 for (shadowed
= b
->class_shadowed
;
1697 shadowed
= TREE_CHAIN (shadowed
))
1701 t
= IDENTIFIER_BINDING (TREE_PURPOSE (shadowed
));
1702 while (t
&& BINDING_LEVEL (t
) != b
)
1706 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
))
1707 = BINDING_VALUE (t
);
1711 /* Remember to save what IDENTIFIER's were bound in this scope so we
1712 can recover from cache misses. */
1714 previous_class_type
= current_class_type
;
1715 previous_class_values
= class_binding_level
->class_shadowed
;
1717 for (shadowed
= level
->type_shadowed
;
1719 shadowed
= TREE_CHAIN (shadowed
))
1720 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1722 /* Remove the bindings for all of the class-level declarations. */
1723 for (shadowed
= level
->class_shadowed
;
1725 shadowed
= TREE_CHAIN (shadowed
))
1726 pop_binding (TREE_PURPOSE (shadowed
), TREE_TYPE (shadowed
));
1728 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1729 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1730 class_binding_level
->parm_flag
,
1731 class_binding_level
->keep
);
1733 /* Now, pop out of the binding level which we created up in the
1734 `pushlevel_class' routine. */
1735 #if defined(DEBUG_CP_BINDING_LEVELS)
1737 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1739 pop_binding_level ();
1742 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1743 for any names in enclosing classes. */
1746 clear_identifier_class_values ()
1750 if (!class_binding_level
)
1753 for (t
= class_binding_level
->class_shadowed
;
1756 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
1759 /* Returns non-zero if T is a virtual function table. */
1762 vtable_decl_p (t
, data
)
1764 void *data ATTRIBUTE_UNUSED
;
1766 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
1769 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1773 vtype_decl_p (t
, data
)
1775 void *data ATTRIBUTE_UNUSED
;
1777 return (TREE_CODE (t
) == TYPE_DECL
1778 && TREE_CODE (TREE_TYPE (t
)) == RECORD_TYPE
1779 && TYPE_POLYMORPHIC_P (TREE_TYPE (t
)));
1782 /* Return the declarations that are members of the namespace NS. */
1785 cp_namespace_decls (ns
)
1788 return NAMESPACE_LEVEL (ns
)->names
;
1791 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1792 itself, calling F for each. The DATA is passed to F as well. */
1795 walk_namespaces_r (namespace, f
, data
)
1797 walk_namespaces_fn f
;
1803 result
|= (*f
) (namespace, data
);
1805 for (current
= cp_namespace_decls (namespace);
1807 current
= TREE_CHAIN (current
))
1809 if (TREE_CODE (current
) != NAMESPACE_DECL
1810 || DECL_NAMESPACE_ALIAS (current
))
1812 if (!DECL_LANG_SPECIFIC (current
))
1815 my_friendly_assert (current
== fake_std_node
, 393);
1819 /* We found a namespace. */
1820 result
|= walk_namespaces_r (current
, f
, data
);
1826 /* Walk all the namespaces, calling F for each. The DATA is passed to
1830 walk_namespaces (f
, data
)
1831 walk_namespaces_fn f
;
1834 return walk_namespaces_r (global_namespace
, f
, data
);
1837 struct walk_globals_data
{
1838 walk_globals_pred p
;
1843 /* Walk the global declarations in NAMESPACE. Whenever one is found
1844 for which P returns non-zero, call F with its address. If any call
1845 to F returns a non-zero value, return a non-zero value. */
1848 walk_globals_r (namespace, data
)
1852 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1853 walk_globals_pred p
= wgd
->p
;
1854 walk_globals_fn f
= wgd
->f
;
1855 void *d
= wgd
->data
;
1859 t
= &NAMESPACE_LEVEL (namespace)->names
;
1866 result
|= (*f
) (t
, d
);
1868 /* If F changed *T, then *T still points at the next item to
1871 t
= &TREE_CHAIN (*t
);
1877 /* Walk the global declarations. Whenever one is found for which P
1878 returns non-zero, call F with its address. If any call to F
1879 returns a non-zero value, return a non-zero value. */
1882 walk_globals (p
, f
, data
)
1883 walk_globals_pred p
;
1887 struct walk_globals_data wgd
;
1892 return walk_namespaces (walk_globals_r
, &wgd
);
1895 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1896 DATA is non-NULL, this is the last time we will call
1897 wrapup_global_declarations for this NAMESPACE. */
1900 wrapup_globals_for_namespace (namespace, data
)
1904 tree globals
= cp_namespace_decls (namespace);
1905 int len
= list_length (globals
);
1906 tree
*vec
= (tree
*) alloca (sizeof (tree
) * len
);
1910 int last_time
= (data
!= 0);
1912 if (last_time
&& namespace == global_namespace
)
1913 /* Let compile_file handle the global namespace. */
1916 /* Process the decls in reverse order--earliest first.
1917 Put them into VEC from back to front, then take out from front. */
1918 for (i
= 0, decl
= globals
; i
< len
; i
++, decl
= TREE_CHAIN (decl
))
1919 vec
[len
- i
- 1] = decl
;
1923 check_global_declarations (vec
, len
);
1927 /* Temporarily mark vtables as external. That prevents
1928 wrapup_global_declarations from writing them out; we must process
1929 them ourselves in finish_vtable_vardecl. */
1930 for (i
= 0; i
< len
; ++i
)
1931 if (vtable_decl_p (vec
[i
], /*data=*/0) && !DECL_EXTERNAL (vec
[i
]))
1933 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 1;
1934 DECL_EXTERNAL (vec
[i
]) = 1;
1937 /* Write out any globals that need to be output. */
1938 result
= wrapup_global_declarations (vec
, len
);
1940 /* Undo the hack to DECL_EXTERNAL above. */
1941 for (i
= 0; i
< len
; ++i
)
1942 if (vtable_decl_p (vec
[i
], /*data=*/0)
1943 && DECL_NOT_REALLY_EXTERN (vec
[i
]))
1945 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 0;
1946 DECL_EXTERNAL (vec
[i
]) = 0;
1953 /* Mark ARG (which is really a struct binding_level **) for GC. */
1956 mark_binding_level (arg
)
1959 struct binding_level
*lvl
= *(struct binding_level
**)arg
;
1961 for (; lvl
; lvl
= lvl
->level_chain
)
1963 ggc_mark_tree (lvl
->names
);
1964 ggc_mark_tree (lvl
->tags
);
1965 ggc_mark_tree (lvl
->usings
);
1966 ggc_mark_tree (lvl
->using_directives
);
1967 ggc_mark_tree (lvl
->class_shadowed
);
1968 ggc_mark_tree (lvl
->type_shadowed
);
1969 ggc_mark_tree (lvl
->shadowed_labels
);
1970 ggc_mark_tree (lvl
->blocks
);
1971 ggc_mark_tree (lvl
->this_class
);
1972 ggc_mark_tree (lvl
->incomplete
);
1973 ggc_mark_tree (lvl
->dead_vars_from_for
);
1978 mark_named_label_lists (labs
, uses
)
1982 struct named_label_list
*l
= *(struct named_label_list
**)labs
;
1983 struct named_label_use_list
*u
= *(struct named_label_use_list
**)uses
;
1985 for (; l
; l
= l
->next
)
1988 mark_binding_level (l
->binding_level
);
1989 ggc_mark_tree (l
->old_value
);
1990 ggc_mark_tree (l
->label_decl
);
1991 ggc_mark_tree (l
->bad_decls
);
1994 for (; u
; u
= u
->next
)
1998 /* For debugging. */
1999 static int no_print_functions
= 0;
2000 static int no_print_builtins
= 0;
2003 print_binding_level (lvl
)
2004 struct binding_level
*lvl
;
2008 fprintf (stderr
, " blocks=");
2009 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
2010 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
2011 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
2012 if (lvl
->tag_transparent
)
2013 fprintf (stderr
, " tag-transparent");
2014 if (lvl
->more_cleanups_ok
)
2015 fprintf (stderr
, " more-cleanups-ok");
2016 if (lvl
->have_cleanups
)
2017 fprintf (stderr
, " have-cleanups");
2018 fprintf (stderr
, "\n");
2021 fprintf (stderr
, " names:\t");
2022 /* We can probably fit 3 names to a line? */
2023 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
2025 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
2027 if (no_print_builtins
2028 && (TREE_CODE (t
) == TYPE_DECL
)
2029 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
2032 /* Function decls tend to have longer names. */
2033 if (TREE_CODE (t
) == FUNCTION_DECL
)
2040 fprintf (stderr
, "\n\t");
2043 print_node_brief (stderr
, "", t
, 0);
2044 if (t
== error_mark_node
)
2048 fprintf (stderr
, "\n");
2052 fprintf (stderr
, " tags:\t");
2054 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
2056 if (TREE_PURPOSE (t
) == NULL_TREE
)
2058 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2065 fprintf (stderr
, "\n\t");
2068 if (TREE_PURPOSE (t
) == NULL_TREE
)
2070 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
2071 fprintf (stderr
, ">");
2073 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2074 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2077 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
2078 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2079 fprintf (stderr
, ">");
2083 fprintf (stderr
, "\n");
2085 if (lvl
->class_shadowed
)
2087 fprintf (stderr
, " class-shadowed:");
2088 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
2090 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2092 fprintf (stderr
, "\n");
2094 if (lvl
->type_shadowed
)
2096 fprintf (stderr
, " type-shadowed:");
2097 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2099 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2101 fprintf (stderr
, "\n");
2106 print_other_binding_stack (stack
)
2107 struct binding_level
*stack
;
2109 struct binding_level
*level
;
2110 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
2112 fprintf (stderr
, "binding level ");
2113 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
2114 fprintf (stderr
, "\n");
2115 print_binding_level (level
);
2120 print_binding_stack ()
2122 struct binding_level
*b
;
2123 fprintf (stderr
, "current_binding_level=");
2124 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
2125 fprintf (stderr
, "\nclass_binding_level=");
2126 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
2127 fprintf (stderr
, "\nglobal_binding_level=");
2128 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
2129 fprintf (stderr
, "\n");
2130 if (class_binding_level
)
2132 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
2133 if (b
== current_binding_level
)
2136 b
= class_binding_level
;
2138 b
= current_binding_level
;
2141 b
= current_binding_level
;
2142 print_other_binding_stack (b
);
2143 fprintf (stderr
, "global:\n");
2144 print_binding_level (global_binding_level
);
2147 /* Namespace binding access routines: The namespace_bindings field of
2148 the identifier is polymorphic, with three possible values:
2149 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2150 indicating the BINDING_VALUE of global_namespace. */
2152 /* Check whether the a binding for the name to scope is known.
2153 Assumes that the bindings of the name are already a list
2154 of bindings. Returns the binding found, or NULL_TREE. */
2157 find_binding (name
, scope
)
2161 tree iter
, prev
= NULL_TREE
;
2163 scope
= ORIGINAL_NAMESPACE (scope
);
2165 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
2166 iter
= TREE_CHAIN (iter
))
2168 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
2169 if (BINDING_SCOPE (iter
) == scope
)
2171 /* Move binding found to the front of the list, so
2172 subsequent lookups will find it faster. */
2175 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
2176 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
2177 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
2186 /* Always returns a binding for name in scope. If the
2187 namespace_bindings is not a list, convert it to one first.
2188 If no binding is found, make a new one. */
2191 binding_for_name (name
, scope
)
2195 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2198 scope
= ORIGINAL_NAMESPACE (scope
);
2200 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
2202 /* Get rid of optimization for global scope. */
2203 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
2204 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
2205 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2207 if (b
&& (result
= find_binding (name
, scope
)))
2209 /* Not found, make a new one. */
2210 result
= make_node (CPLUS_BINDING
);
2211 TREE_CHAIN (result
) = b
;
2212 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2213 BINDING_SCOPE (result
) = scope
;
2214 BINDING_TYPE (result
) = NULL_TREE
;
2215 BINDING_VALUE (result
) = NULL_TREE
;
2219 /* Return the binding value for name in scope, considering that
2220 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2223 namespace_binding (name
, scope
)
2227 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2230 if (scope
== NULL_TREE
)
2231 scope
= global_namespace
;
2232 if (TREE_CODE (b
) != CPLUS_BINDING
)
2233 return (scope
== global_namespace
) ? b
: NULL_TREE
;
2234 name
= find_binding (name
,scope
);
2235 if (name
== NULL_TREE
)
2237 return BINDING_VALUE (name
);
2240 /* Set the binding value for name in scope. If modifying the binding
2241 of global_namespace is attempted, try to optimize it. */
2244 set_namespace_binding (name
, scope
, val
)
2251 if (scope
== NULL_TREE
)
2252 scope
= global_namespace
;
2254 if (scope
== global_namespace
)
2256 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2257 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
2259 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
2263 b
= binding_for_name (name
, scope
);
2264 BINDING_VALUE (b
) = val
;
2267 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2268 select a name that is unique to this compilation unit. */
2271 push_namespace (name
)
2276 int implicit_use
= 0;
2278 if (!global_namespace
)
2280 /* This must be ::. */
2281 my_friendly_assert (name
== get_identifier ("::"), 377);
2286 /* The name of anonymous namespace is unique for the translation
2288 if (!anonymous_namespace_name
)
2289 anonymous_namespace_name
= get_file_function_name ('N');
2290 name
= anonymous_namespace_name
;
2291 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2293 /* Reopening anonymous namespace. */
2297 else if (current_namespace
== global_namespace
2299 && name
== std_identifier
)
2306 /* Check whether this is an extended namespace definition. */
2307 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2308 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
2311 if (DECL_NAMESPACE_ALIAS (d
))
2313 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2314 d
, DECL_NAMESPACE_ALIAS (d
));
2315 d
= DECL_NAMESPACE_ALIAS (d
);
2322 /* Make a new namespace, binding the name to it. */
2323 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
2324 /* The global namespace is not pushed, and the global binding
2325 level is set elsewhere. */
2328 DECL_CONTEXT (d
) = FROB_CONTEXT (current_namespace
);
2331 declare_namespace_level ();
2332 NAMESPACE_LEVEL (d
) = current_binding_level
;
2336 resume_binding_level (NAMESPACE_LEVEL (d
));
2339 do_using_directive (d
);
2340 /* Enter the name space. */
2341 current_namespace
= d
;
2344 /* Pop from the scope of the current namespace. */
2349 if (current_namespace
== global_namespace
)
2351 my_friendly_assert (in_fake_std
> 0, 980421);
2355 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
2356 /* The binding level is not popped, as it might be re-opened later. */
2357 suspend_binding_level ();
2360 /* Push into the scope of the namespace NS, even if it is deeply
2361 nested within another namespace. */
2364 push_nested_namespace (ns
)
2367 if (ns
== global_namespace
)
2368 push_to_top_level ();
2371 push_nested_namespace (CP_DECL_CONTEXT (ns
));
2372 push_namespace (DECL_NAME (ns
));
2376 /* Pop back from the scope of the namespace NS, which was previously
2377 entered with push_nested_namespace. */
2380 pop_nested_namespace (ns
)
2383 while (ns
!= global_namespace
)
2386 ns
= CP_DECL_CONTEXT (ns
);
2389 pop_from_top_level ();
2393 /* Subroutines for reverting temporarily to top-level for instantiation
2394 of templates and such. We actually need to clear out the class- and
2395 local-value slots of all identifiers, so that only the global values
2396 are at all visible. Simply setting current_binding_level to the global
2397 scope isn't enough, because more binding levels may be pushed. */
2398 struct saved_scope
*scope_chain
;
2400 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2403 mark_saved_scope (arg
)
2406 struct saved_scope
*t
= *(struct saved_scope
**)arg
;
2409 mark_binding_level (&t
->class_bindings
);
2410 ggc_mark_tree (t
->old_bindings
);
2411 ggc_mark_tree (t
->old_namespace
);
2412 ggc_mark_tree (t
->class_name
);
2413 ggc_mark_tree (t
->class_type
);
2414 ggc_mark_tree (t
->access_specifier
);
2415 ggc_mark_tree (t
->function_decl
);
2417 ggc_mark_tree_varray (t
->lang_base
);
2418 ggc_mark_tree (t
->lang_name
);
2419 ggc_mark_tree (t
->template_parms
);
2420 ggc_mark_tree (t
->x_previous_class_type
);
2421 ggc_mark_tree (t
->x_previous_class_values
);
2422 ggc_mark_tree (t
->x_saved_tree
);
2423 ggc_mark_tree (t
->incomplete
);
2424 ggc_mark_tree (t
->lookups
);
2426 mark_stmt_tree (&t
->x_stmt_tree
);
2427 mark_binding_level (&t
->bindings
);
2433 store_bindings (names
, old_bindings
)
2434 tree names
, old_bindings
;
2437 tree search_bindings
= old_bindings
;
2439 for (t
= names
; t
; t
= TREE_CHAIN (t
))
2441 tree binding
, t1
, id
;
2443 if (TREE_CODE (t
) == TREE_LIST
)
2444 id
= TREE_PURPOSE (t
);
2449 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2450 we have no IDENTIFIER_BINDING if we have left the class
2451 scope, but cached the class-level declarations. */
2452 || !(IDENTIFIER_BINDING (id
) || IDENTIFIER_CLASS_VALUE (id
)))
2455 for (t1
= search_bindings
; t1
; t1
= TREE_CHAIN (t1
))
2456 if (TREE_VEC_ELT (t1
, 0) == id
)
2459 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
2460 binding
= make_tree_vec (4);
2461 TREE_VEC_ELT (binding
, 0) = id
;
2462 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
2463 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_BINDING (id
);
2464 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
2465 IDENTIFIER_BINDING (id
) = NULL_TREE
;
2466 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
2467 TREE_CHAIN (binding
) = old_bindings
;
2468 old_bindings
= binding
;
2472 return old_bindings
;
2476 maybe_push_to_top_level (pseudo
)
2479 struct saved_scope
*s
;
2480 struct binding_level
*b
;
2484 s
= (struct saved_scope
*) xcalloc (1, sizeof (struct saved_scope
));
2486 b
= scope_chain
? current_binding_level
: 0;
2488 /* If we're in the middle of some function, save our state. */
2492 push_function_context_to (NULL_TREE
);
2497 old_bindings
= NULL_TREE
;
2498 if (scope_chain
&& previous_class_type
)
2499 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
2501 /* Have to include global_binding_level, because class-level decls
2502 aren't listed anywhere useful. */
2503 for (; b
; b
= b
->level_chain
)
2507 /* Template IDs are inserted into the global level. If they were
2508 inserted into namespace level, finish_file wouldn't find them
2509 when doing pending instantiations. Therefore, don't stop at
2510 namespace level, but continue until :: . */
2511 if (b
== global_binding_level
|| (pseudo
&& b
->template_parms_p
))
2514 old_bindings
= store_bindings (b
->names
, old_bindings
);
2515 /* We also need to check class_shadowed to save class-level type
2516 bindings, since pushclass doesn't fill in b->names. */
2517 if (b
->parm_flag
== 2)
2518 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2520 /* Unwind type-value slots back to top level. */
2521 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2522 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2524 s
->prev
= scope_chain
;
2525 s
->old_bindings
= old_bindings
;
2527 s
->need_pop_function_context
= need_pop
;
2528 s
->function_decl
= current_function_decl
;
2531 current_function_decl
= NULL_TREE
;
2532 VARRAY_TREE_INIT (current_lang_base
, 10, "current_lang_base");
2533 current_lang_stack
= &VARRAY_TREE (current_lang_base
, 0);
2534 current_lang_name
= lang_name_cplusplus
;
2535 current_namespace
= global_namespace
;
2539 push_to_top_level ()
2541 maybe_push_to_top_level (0);
2545 pop_from_top_level ()
2547 struct saved_scope
*s
= scope_chain
;
2550 /* Clear out class-level bindings cache. */
2551 if (previous_class_type
)
2552 invalidate_class_lookup_cache ();
2554 VARRAY_FREE (current_lang_base
);
2556 scope_chain
= s
->prev
;
2557 for (t
= s
->old_bindings
; t
; t
= TREE_CHAIN (t
))
2559 tree id
= TREE_VEC_ELT (t
, 0);
2561 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2562 IDENTIFIER_BINDING (id
) = TREE_VEC_ELT (t
, 2);
2563 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2566 /* If we were in the middle of compiling a function, restore our
2568 if (s
->need_pop_function_context
)
2569 pop_function_context_from (NULL_TREE
);
2570 current_function_decl
= s
->function_decl
;
2575 /* Push a definition of struct, union or enum tag "name".
2576 into binding_level "b". "type" should be the type node,
2577 We assume that the tag "name" is not already defined.
2579 Note that the definition may really be just a forward reference.
2580 In that case, the TYPE_SIZE will be a NULL_TREE.
2582 C++ gratuitously puts all these tags in the name space. */
2584 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2585 record the shadowed value for this binding contour. TYPE is
2586 the type that ID maps to. */
2589 set_identifier_type_value_with_scope (id
, type
, b
)
2592 struct binding_level
*b
;
2594 if (!b
->namespace_p
)
2596 /* Shadow the marker, not the real thing, so that the marker
2597 gets restored later. */
2598 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2600 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2604 tree binding
= binding_for_name (id
, current_namespace
);
2605 BINDING_TYPE (binding
) = type
;
2606 /* Store marker instead of real type. */
2607 type
= global_type_node
;
2609 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2612 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2615 set_identifier_type_value (id
, type
)
2619 set_identifier_type_value_with_scope (id
, type
, current_binding_level
);
2622 /* Return the type associated with id. */
2625 identifier_type_value (id
)
2628 /* There is no type with that name, anywhere. */
2629 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2631 /* This is not the type marker, but the real thing. */
2632 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2633 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2634 /* Have to search for it. It must be on the global level, now.
2635 Ask lookup_name not to return non-types. */
2636 id
= lookup_name_real (id
, 2, 1, 0);
2638 return TREE_TYPE (id
);
2642 /* Pop off extraneous binding levels left over due to syntax errors.
2644 We don't pop past namespaces, as they might be valid. */
2649 #ifdef DEBUG_CP_BINDING_LEVELS
2650 fprintf (stderr
, "XXX entering pop_everything ()\n");
2652 while (!toplevel_bindings_p ())
2654 if (current_binding_level
->parm_flag
== 2)
2655 pop_nested_class ();
2659 #ifdef DEBUG_CP_BINDING_LEVELS
2660 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2664 /* The type TYPE is being declared. If it is a class template, or a
2665 specialization of a class template, do any processing required and
2666 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2667 being declared a friend. B is the binding level at which this TYPE
2670 Returns the TYPE_DECL for TYPE, which may have been altered by this
2674 maybe_process_template_type_declaration (type
, globalize
, b
)
2677 struct binding_level
* b
;
2679 tree decl
= TYPE_NAME (type
);
2681 if (processing_template_parmlist
)
2682 /* You can't declare a new template type in a template parameter
2683 list. But, you can declare a non-template type:
2685 template <class A*> struct S;
2687 is a forward-declaration of `A'. */
2691 maybe_check_template_type (type
);
2693 my_friendly_assert (IS_AGGR_TYPE (type
)
2694 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2697 if (processing_template_decl
)
2699 /* This may change after the call to
2700 push_template_decl_real, but we want the original value. */
2701 tree name
= DECL_NAME (decl
);
2703 decl
= push_template_decl_real (decl
, globalize
);
2704 /* If the current binding level is the binding level for the
2705 template parameters (see the comment in
2706 begin_template_parm_list) and the enclosing level is a class
2707 scope, and we're not looking at a friend, push the
2708 declaration of the member class into the class scope. In the
2709 friend case, push_template_decl will already have put the
2710 friend into global scope, if appropriate. */
2711 if (TREE_CODE (type
) != ENUMERAL_TYPE
2712 && !globalize
&& b
->template_parms_p
2713 && b
->level_chain
->parm_flag
== 2)
2715 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2716 /* Put this tag on the list of tags for the class, since
2717 that won't happen below because B is not the class
2718 binding level, but is instead the pseudo-global level. */
2719 b
->level_chain
->tags
=
2720 tree_cons (name
, type
, b
->level_chain
->tags
);
2721 if (!COMPLETE_TYPE_P (current_class_type
))
2722 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2730 /* In C++, you don't have to write `struct S' to refer to `S'; you
2731 can just use `S'. We accomplish this by creating a TYPE_DECL as
2732 if the user had written `typedef struct S S'. Create and return
2733 the TYPE_DECL for TYPE. */
2736 create_implicit_typedef (name
, type
)
2742 decl
= build_decl (TYPE_DECL
, name
, type
);
2743 DECL_ARTIFICIAL (decl
) = 1;
2744 /* There are other implicit type declarations, like the one *within*
2745 a class that allows you to write `S::S'. We must distinguish
2747 SET_DECL_IMPLICIT_TYPEDEF_P (decl
);
2748 TYPE_NAME (type
) = decl
;
2753 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2754 Normally put it into the inner-most non-tag-transparent scope,
2755 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2756 The latter is needed for implicit declarations. */
2759 pushtag (name
, type
, globalize
)
2763 register struct binding_level
*b
;
2765 b
= current_binding_level
;
2766 while (b
->tag_transparent
2767 || (globalize
&& b
->parm_flag
== 2))
2770 b
->tags
= tree_cons (name
, type
, b
->tags
);
2774 /* Do C++ gratuitous typedefing. */
2775 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2777 register tree d
= NULL_TREE
;
2779 tree context
= TYPE_CONTEXT (type
);
2783 tree cs
= current_scope ();
2787 else if (cs
!= NULL_TREE
&& TYPE_P (cs
))
2788 /* When declaring a friend class of a local class, we want
2789 to inject the newly named class into the scope
2790 containing the local class, not the namespace scope. */
2791 context
= decl_function_context (get_type_decl (cs
));
2794 context
= current_namespace
;
2796 if ((b
->template_parms_p
&& b
->level_chain
->parm_flag
== 2)
2797 || b
->parm_flag
== 2)
2800 if (current_lang_name
== lang_name_java
)
2801 TYPE_FOR_JAVA (type
) = 1;
2803 d
= create_implicit_typedef (name
, type
);
2804 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2806 set_identifier_type_value_with_scope (name
, type
, b
);
2808 d
= maybe_process_template_type_declaration (type
,
2811 if (b
->parm_flag
== 2)
2813 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2814 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2815 class. But if it's a member template class, we
2816 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2818 finish_member_declaration (d
);
2820 pushdecl_class_level (d
);
2823 d
= pushdecl_with_scope (d
, b
);
2825 if (ANON_AGGRNAME_P (name
))
2826 DECL_IGNORED_P (d
) = 1;
2828 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2829 DECL_ASSEMBLER_NAME (d
) = DECL_NAME (d
);
2831 /* If this is a local class, keep track of it. We need this
2832 information for name-mangling, and so that it is possible to find
2833 all function definitions in a translation unit in a convenient
2834 way. (It's otherwise tricky to find a member function definition
2835 it's only pointed to from within a local class.) */
2836 if (TYPE_CONTEXT (type
)
2837 && TREE_CODE (TYPE_CONTEXT (type
)) == FUNCTION_DECL
2838 && !processing_template_decl
)
2839 VARRAY_PUSH_TREE (local_classes
, type
);
2841 if (!uses_template_parms (type
))
2842 DECL_ASSEMBLER_NAME (d
) = mangle_type (type
);
2844 if (b
->parm_flag
== 2)
2846 if (!COMPLETE_TYPE_P (current_class_type
))
2847 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2851 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2852 /* Use the canonical TYPE_DECL for this node. */
2853 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2856 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2857 will be the tagged type we just added to the current
2858 binding level. This fake NULL-named TYPE_DECL node helps
2859 dwarfout.c to know when it needs to output a
2860 representation of a tagged type, and it also gives us a
2861 convenient place to record the "scope start" address for
2864 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2865 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2869 /* Counter used to create anonymous type names. */
2871 static int anon_cnt
= 0;
2873 /* Return an IDENTIFIER which can be used as a name for
2874 anonymous structs and unions. */
2881 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2882 return get_identifier (buf
);
2885 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2886 This keeps dbxout from getting confused. */
2891 register struct binding_level
*b
;
2893 static int last_cnt
= 0;
2895 /* Fast out if no new anon names were declared. */
2896 if (last_cnt
== anon_cnt
)
2899 b
= current_binding_level
;
2900 while (b
->tag_transparent
)
2905 /* A NULL purpose means we have already processed all tags
2906 from here to the end of the list. */
2907 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2909 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2910 TREE_PURPOSE (tags
) = NULL_TREE
;
2911 tags
= TREE_CHAIN (tags
);
2913 last_cnt
= anon_cnt
;
2916 /* Subroutine of duplicate_decls: return truthvalue of whether
2917 or not types of these decls match.
2919 For C++, we must compare the parameter list so that `int' can match
2920 `int&' in a parameter position, but `int&' is not confused with
2924 decls_match (newdecl
, olddecl
)
2925 tree newdecl
, olddecl
;
2929 if (newdecl
== olddecl
)
2932 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
2933 /* If the two DECLs are not even the same kind of thing, we're not
2934 interested in their types. */
2937 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2939 tree f1
= TREE_TYPE (newdecl
);
2940 tree f2
= TREE_TYPE (olddecl
);
2941 tree p1
= TYPE_ARG_TYPES (f1
);
2942 tree p2
= TYPE_ARG_TYPES (f2
);
2944 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
)
2945 && ! (DECL_EXTERN_C_P (newdecl
)
2946 && DECL_EXTERN_C_P (olddecl
)))
2949 if (TREE_CODE (f1
) != TREE_CODE (f2
))
2952 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
2954 if (p2
== NULL_TREE
&& DECL_EXTERN_C_P (olddecl
)
2955 && (DECL_BUILT_IN (olddecl
)
2956 #ifndef NO_IMPLICIT_EXTERN_C
2957 || (DECL_IN_SYSTEM_HEADER (newdecl
) && !DECL_CLASS_SCOPE_P (newdecl
))
2958 || (DECL_IN_SYSTEM_HEADER (olddecl
) && !DECL_CLASS_SCOPE_P (olddecl
))
2962 types_match
= self_promoting_args_p (p1
);
2963 if (p1
== void_list_node
)
2964 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2966 #ifndef NO_IMPLICIT_EXTERN_C
2967 else if (p1
== NULL_TREE
2968 && (DECL_EXTERN_C_P (olddecl
)
2969 && DECL_IN_SYSTEM_HEADER (olddecl
)
2970 && !DECL_CLASS_SCOPE_P (olddecl
))
2971 && (DECL_EXTERN_C_P (newdecl
)
2972 && DECL_IN_SYSTEM_HEADER (newdecl
)
2973 && !DECL_CLASS_SCOPE_P (newdecl
)))
2975 types_match
= self_promoting_args_p (p2
);
2976 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2980 types_match
= compparms (p1
, p2
);
2985 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2987 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
2988 DECL_TEMPLATE_PARMS (olddecl
)))
2991 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
))
2992 != TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)))
2995 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
2998 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
2999 DECL_TEMPLATE_RESULT (newdecl
));
3003 if (TREE_TYPE (newdecl
) == error_mark_node
)
3004 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
3005 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
3006 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
3007 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
3010 types_match
= comptypes (TREE_TYPE (newdecl
),
3011 TREE_TYPE (olddecl
),
3012 COMPARE_REDECLARATION
);
3018 /* If NEWDECL is `static' and an `extern' was seen previously,
3019 warn about it. OLDDECL is the previous declaration.
3021 Note that this does not apply to the C++ case of declaring
3022 a variable `extern const' and then later `const'.
3024 Don't complain about built-in functions, since they are beyond
3025 the user's control. */
3028 warn_extern_redeclared_static (newdecl
, olddecl
)
3029 tree newdecl
, olddecl
;
3031 static const char *explicit_extern_static_warning
3032 = "`%D' was declared `extern' and later `static'";
3033 static const char *implicit_extern_static_warning
3034 = "`%D' was declared implicitly `extern' and later `static'";
3038 if (TREE_CODE (newdecl
) == TYPE_DECL
3039 || TREE_CODE (newdecl
) == TEMPLATE_DECL
3040 || TREE_CODE (newdecl
) == CONST_DECL
)
3043 /* Don't get confused by static member functions; that's a different
3045 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3046 && DECL_STATIC_FUNCTION_P (newdecl
))
3049 /* If the old declaration was `static', or the new one isn't, then
3050 then everything is OK. */
3051 if (DECL_THIS_STATIC (olddecl
) || !DECL_THIS_STATIC (newdecl
))
3054 /* It's OK to declare a builtin function as `static'. */
3055 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3056 && DECL_ARTIFICIAL (olddecl
))
3059 name
= DECL_ASSEMBLER_NAME (newdecl
);
3060 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
3061 ? implicit_extern_static_warning
3062 : explicit_extern_static_warning
, newdecl
);
3063 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
3066 /* Handle when a new declaration NEWDECL has the same name as an old
3067 one OLDDECL in the same binding contour. Prints an error message
3070 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
3071 Otherwise, return 0. */
3074 duplicate_decls (newdecl
, olddecl
)
3075 tree newdecl
, olddecl
;
3077 unsigned olddecl_uid
= DECL_UID (olddecl
);
3078 int olddecl_friend
= 0, types_match
= 0;
3079 int new_defines_function
= 0;
3081 if (newdecl
== olddecl
)
3084 types_match
= decls_match (newdecl
, olddecl
);
3086 /* If either the type of the new decl or the type of the old decl is an
3087 error_mark_node, then that implies that we have already issued an
3088 error (earlier) for some bogus type specification, and in that case,
3089 it is rather pointless to harass the user with yet more error message
3090 about the same declaration, so just pretend the types match here. */
3091 if (TREE_TYPE (newdecl
) == error_mark_node
3092 || TREE_TYPE (olddecl
) == error_mark_node
)
3095 /* Check for redeclaration and other discrepancies. */
3096 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3097 && DECL_ARTIFICIAL (olddecl
))
3099 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
3101 /* If you declare a built-in or predefined function name as static,
3102 the old definition is overridden, but optionally warn this was a
3103 bad choice of name. */
3104 if (! TREE_PUBLIC (newdecl
))
3107 cp_warning ("shadowing %s function `%#D'",
3108 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3110 /* Discard the old built-in function. */
3113 /* If the built-in is not ansi, then programs can override
3114 it even globally without an error. */
3115 else if (! DECL_BUILT_IN (olddecl
))
3116 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
3120 cp_error ("declaration of `%#D'", newdecl
);
3121 cp_error ("conflicts with built-in declaration `%#D'",
3126 else if (!types_match
)
3128 if ((DECL_EXTERN_C_P (newdecl
)
3129 && DECL_EXTERN_C_P (olddecl
))
3130 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3131 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3133 /* A near match; override the builtin. */
3135 if (TREE_PUBLIC (newdecl
))
3137 cp_warning ("new declaration `%#D'", newdecl
);
3138 cp_warning ("ambiguates built-in declaration `%#D'",
3141 else if (warn_shadow
)
3142 cp_warning ("shadowing %s function `%#D'",
3143 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3147 /* Discard the old built-in function. */
3151 if (DECL_THIS_STATIC (newdecl
) && !DECL_THIS_STATIC (olddecl
))
3153 /* If a builtin function is redeclared as `static', merge
3154 the declarations, but make the original one static. */
3155 DECL_THIS_STATIC (olddecl
) = 1;
3156 TREE_PUBLIC (olddecl
) = 0;
3158 /* Make the old declaration consistent with the new one so
3159 that all remnants of the builtin-ness of this function
3160 will be banished. */
3161 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3162 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3163 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3164 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (newdecl
),
3168 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3170 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3171 && TREE_CODE (newdecl
) != TYPE_DECL
3172 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3173 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3174 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3175 && TREE_CODE (olddecl
) != TYPE_DECL
3176 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3177 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3180 /* We do nothing special here, because C++ does such nasty
3181 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3182 get shadowed, and know that if we need to find a TYPE_DECL
3183 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3184 slot of the identifier. */
3188 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3189 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3190 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3191 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3194 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
3195 if (TREE_CODE (olddecl
) == TREE_LIST
)
3196 olddecl
= TREE_VALUE (olddecl
);
3197 cp_error_at ("previous declaration of `%#D'", olddecl
);
3199 /* New decl is completely inconsistent with the old one =>
3200 tell caller to replace the old one. */
3204 else if (!types_match
)
3206 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
))
3207 /* These are certainly not duplicate declarations; they're
3208 from different scopes. */
3211 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3213 /* The name of a class template may not be declared to refer to
3214 any other template, class, function, object, namespace, value,
3215 or type in the same scope. */
3216 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3217 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3219 cp_error ("declaration of template `%#D'", newdecl
);
3220 cp_error_at ("conflicts with previous declaration `%#D'",
3223 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3224 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3225 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3226 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3227 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3228 DECL_TEMPLATE_PARMS (olddecl
)))
3230 cp_error ("new declaration `%#D'", newdecl
);
3231 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3235 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3237 if (DECL_EXTERN_C_P (newdecl
) && DECL_EXTERN_C_P (olddecl
))
3239 cp_error ("declaration of C function `%#D' conflicts with",
3241 cp_error_at ("previous declaration `%#D' here", olddecl
);
3243 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3244 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3246 cp_error ("new declaration `%#D'", newdecl
);
3247 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3253 /* Already complained about this, so don't do so again. */
3254 else if (current_class_type
== NULL_TREE
3255 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3257 cp_error ("conflicting types for `%#D'", newdecl
);
3258 cp_error_at ("previous declaration as `%#D'", olddecl
);
3261 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3262 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3263 && (!DECL_TEMPLATE_INFO (newdecl
)
3264 || (DECL_TI_TEMPLATE (newdecl
)
3265 != DECL_TI_TEMPLATE (olddecl
))))
3266 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3267 && (!DECL_TEMPLATE_INFO (olddecl
)
3268 || (DECL_TI_TEMPLATE (olddecl
)
3269 != DECL_TI_TEMPLATE (newdecl
))))))
3270 /* It's OK to have a template specialization and a non-template
3271 with the same type, or to have specializations of two
3272 different templates with the same type. Note that if one is a
3273 specialization, and the other is an instantiation of the same
3274 template, that we do not exit at this point. That situation
3275 can occur if we instantiate a template class, and then
3276 specialize one of its methods. This situation is legal, but
3277 the declarations must be merged in the usual way. */
3279 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3280 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3281 && !DECL_USE_TEMPLATE (newdecl
))
3282 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3283 && !DECL_USE_TEMPLATE (olddecl
))))
3284 /* One of the declarations is a template instantiation, and the
3285 other is not a template at all. That's OK. */
3287 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3288 && DECL_NAMESPACE_ALIAS (newdecl
)
3289 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3290 /* Redeclaration of namespace alias, ignore it. */
3294 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3297 cp_error (errmsg
, newdecl
);
3298 if (DECL_NAME (olddecl
) != NULL_TREE
)
3299 cp_error_at ((DECL_INITIAL (olddecl
)
3300 && namespace_bindings_p ())
3301 ? "`%#D' previously defined here"
3302 : "`%#D' previously declared here", olddecl
);
3304 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3305 && DECL_INITIAL (olddecl
) != NULL_TREE
3306 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3307 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3309 /* Prototype decl follows defn w/o prototype. */
3310 cp_warning_at ("prototype for `%#D'", newdecl
);
3311 cp_warning_at ("follows non-prototype definition here", olddecl
);
3313 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3314 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3316 /* extern "C" int foo ();
3317 int foo () { bar (); }
3319 if (current_lang_stack
3320 == &VARRAY_TREE (current_lang_base
, 0))
3321 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3324 cp_error_at ("previous declaration of `%#D' with %L linkage",
3325 olddecl
, DECL_LANGUAGE (olddecl
));
3326 cp_error ("conflicts with new declaration with %L linkage",
3327 DECL_LANGUAGE (newdecl
));
3331 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3333 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3335 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3336 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3339 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3340 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3342 for (; t1
&& t1
!= void_list_node
;
3343 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3344 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3346 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3351 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3353 cp_pedwarn_at ("after previous specification in `%#D'",
3359 cp_error ("default argument given for parameter %d of `%#D'",
3361 cp_error_at ("after previous specification in `%#D'",
3366 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
3367 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3369 cp_warning ("`%#D' was used before it was declared inline",
3371 cp_warning_at ("previous non-inline declaration here",
3377 /* If new decl is `static' and an `extern' was seen previously,
3379 warn_extern_redeclared_static (newdecl
, olddecl
);
3381 /* We have committed to returning 1 at this point. */
3382 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3384 /* Now that functions must hold information normally held
3385 by field decls, there is extra work to do so that
3386 declaration information does not get destroyed during
3388 if (DECL_VINDEX (olddecl
))
3389 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3390 if (DECL_VIRTUAL_CONTEXT (olddecl
))
3391 DECL_VIRTUAL_CONTEXT (newdecl
) = DECL_VIRTUAL_CONTEXT (olddecl
);
3392 if (DECL_CONTEXT (olddecl
))
3393 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3394 if (DECL_PENDING_INLINE_INFO (newdecl
) == 0)
3395 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3396 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3397 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3398 DECL_PURE_VIRTUAL_P (newdecl
) |= DECL_PURE_VIRTUAL_P (olddecl
);
3399 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3400 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3401 DECL_THIS_STATIC (newdecl
) |= DECL_THIS_STATIC (olddecl
);
3402 if (DECL_OVERLOADED_OPERATOR_P (olddecl
) != ERROR_MARK
)
3403 SET_OVERLOADED_OPERATOR_CODE
3404 (newdecl
, DECL_OVERLOADED_OPERATOR_P (olddecl
));
3405 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3407 /* Optionally warn about more than one declaration for the same
3408 name, but don't warn about a function declaration followed by a
3410 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3411 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3412 /* Don't warn about extern decl followed by definition. */
3413 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3414 /* Don't warn about friends, let add_friend take care of it. */
3415 && ! DECL_FRIEND_P (newdecl
))
3417 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3418 cp_warning_at ("previous declaration of `%D'", olddecl
);
3422 /* Deal with C++: must preserve virtual function table size. */
3423 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3425 register tree newtype
= TREE_TYPE (newdecl
);
3426 register tree oldtype
= TREE_TYPE (olddecl
);
3428 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3429 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3431 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3432 CLASSTYPE_FRIEND_CLASSES (newtype
)
3433 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3436 DECL_ORIGINAL_TYPE (newdecl
) = DECL_ORIGINAL_TYPE (olddecl
);
3439 /* Copy all the DECL_... slots specified in the new decl
3440 except for any that we copy here from the old type. */
3441 DECL_MACHINE_ATTRIBUTES (newdecl
)
3442 = merge_machine_decl_attributes (olddecl
, newdecl
);
3444 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3446 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3447 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3448 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3449 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3456 /* Automatically handles default parameters. */
3457 tree oldtype
= TREE_TYPE (olddecl
);
3460 /* Merge the data types specified in the two decls. */
3461 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3463 /* If common_type produces a non-typedef type, just use the old type. */
3464 if (TREE_CODE (newdecl
) == TYPE_DECL
3465 && newtype
== DECL_ORIGINAL_TYPE (newdecl
))
3468 if (TREE_CODE (newdecl
) == VAR_DECL
)
3469 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3470 /* Do this after calling `common_type' so that default
3471 parameters don't confuse us. */
3472 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3473 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3474 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3476 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3477 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3478 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3479 TYPE_RAISES_EXCEPTIONS (oldtype
));
3481 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3482 && DECL_SOURCE_LINE (olddecl
) != 0
3484 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
3485 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
3487 cp_error ("declaration of `%F' throws different exceptions",
3489 cp_error_at ("than previous declaration `%F'", olddecl
);
3492 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3494 /* Lay the type out, unless already done. */
3495 if (! same_type_p (newtype
, oldtype
)
3496 && TREE_TYPE (newdecl
) != error_mark_node
3497 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3498 layout_type (TREE_TYPE (newdecl
));
3500 if ((TREE_CODE (newdecl
) == VAR_DECL
3501 || TREE_CODE (newdecl
) == PARM_DECL
3502 || TREE_CODE (newdecl
) == RESULT_DECL
3503 || TREE_CODE (newdecl
) == FIELD_DECL
3504 || TREE_CODE (newdecl
) == TYPE_DECL
)
3505 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3506 layout_decl (newdecl
, 0);
3508 /* Merge the type qualifiers. */
3509 if (TREE_READONLY (newdecl
))
3510 TREE_READONLY (olddecl
) = 1;
3511 if (TREE_THIS_VOLATILE (newdecl
))
3512 TREE_THIS_VOLATILE (olddecl
) = 1;
3514 /* Merge the initialization information. */
3515 if (DECL_INITIAL (newdecl
) == NULL_TREE
3516 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3518 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3519 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3520 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3521 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
3522 && DECL_LANG_SPECIFIC (newdecl
)
3523 && DECL_LANG_SPECIFIC (olddecl
))
3524 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3527 /* Merge the section attribute.
3528 We want to issue an error if the sections conflict but that must be
3529 done later in decl_attributes since we are called before attributes
3531 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3532 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3534 /* Keep the old rtl since we can safely use it. */
3535 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3537 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3539 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (newdecl
)
3540 |= DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (olddecl
);
3541 DECL_NO_CHECK_MEMORY_USAGE (newdecl
)
3542 |= DECL_NO_CHECK_MEMORY_USAGE (olddecl
);
3543 DECL_NO_LIMIT_STACK (newdecl
)
3544 |= DECL_NO_LIMIT_STACK (olddecl
);
3547 /* If cannot merge, then use the new type and qualifiers,
3548 and don't preserve the old rtl. */
3551 /* Clean out any memory we had of the old declaration. */
3552 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3554 TREE_VALUE (oldstatic
) = error_mark_node
;
3556 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3557 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3558 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3559 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3562 /* Merge the storage class information. */
3563 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3564 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3565 DECL_DEFER_OUTPUT (newdecl
) |= DECL_DEFER_OUTPUT (olddecl
);
3566 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3567 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3568 if (! DECL_EXTERNAL (olddecl
))
3569 DECL_EXTERNAL (newdecl
) = 0;
3571 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3573 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3574 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3575 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3576 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3577 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3578 /* Don't really know how much of the language-specific
3579 values we should copy from old to new. */
3580 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3581 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3582 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3583 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3584 DECL_INITIALIZED_IN_CLASS_P (newdecl
)
3585 |= DECL_INITIALIZED_IN_CLASS_P (olddecl
);
3586 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3588 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3589 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3590 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3591 DECL_BEFRIENDING_CLASSES (newdecl
)
3592 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3593 DECL_BEFRIENDING_CLASSES (olddecl
));
3596 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3598 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3599 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3601 /* If newdecl is not a specialization, then it is not a
3602 template-related function at all. And that means that we
3603 shoud have exited above, returning 0. */
3604 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3607 if (TREE_USED (olddecl
))
3608 /* From [temp.expl.spec]:
3610 If a template, a member template or the member of a class
3611 template is explicitly specialized then that
3612 specialization shall be declared before the first use of
3613 that specialization that would cause an implicit
3614 instantiation to take place, in every translation unit in
3615 which such a use occurs. */
3616 cp_error ("explicit specialization of %D after first use",
3619 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3621 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3623 /* If either decl says `inline', this fn is inline, unless its
3624 definition was passed already. */
3625 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3626 DECL_INLINE (olddecl
) = 1;
3627 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3629 /* Preserve abstractness on cloned [cd]tors. */
3630 DECL_ABSTRACT (newdecl
) = DECL_ABSTRACT (olddecl
);
3634 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3635 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3636 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3638 if (! types_match
|| new_defines_function
)
3640 /* These need to be copied so that the names are available.
3641 Note that if the types do match, we'll preserve inline
3642 info and other bits, but if not, we won't. */
3643 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3644 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3646 if (new_defines_function
)
3647 /* If defining a function declared with other language
3648 linkage, use the previously declared language linkage. */
3649 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3650 else if (types_match
)
3652 /* If redeclaring a builtin function, and not a definition,
3653 it stays built in. */
3654 if (DECL_BUILT_IN (olddecl
))
3656 DECL_BUILT_IN_CLASS (newdecl
) = DECL_BUILT_IN_CLASS (olddecl
);
3657 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3658 /* If we're keeping the built-in definition, keep the rtl,
3659 regardless of declaration matches. */
3660 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3663 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3665 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3666 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3667 /* Previously saved insns go together with
3668 the function's previous definition. */
3669 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3670 /* Don't clear out the arguments if we're redefining a function. */
3671 if (DECL_ARGUMENTS (olddecl
))
3672 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3676 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3678 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3681 /* Now preserve various other info from the definition. */
3682 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3683 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3684 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3685 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3687 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3691 function_size
= sizeof (struct tree_decl
);
3693 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3694 (char *) olddecl
+ sizeof (struct tree_common
),
3695 function_size
- sizeof (struct tree_common
));
3697 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3699 /* If newdecl is a template instantiation, it is possible that
3700 the following sequence of events has occurred:
3702 o A friend function was declared in a class template. The
3703 class template was instantiated.
3705 o The instantiation of the friend declaration was
3706 recorded on the instantiation list, and is newdecl.
3708 o Later, however, instantiate_class_template called pushdecl
3709 on the newdecl to perform name injection. But, pushdecl in
3710 turn called duplicate_decls when it discovered that another
3711 declaration of a global function with the same name already
3714 o Here, in duplicate_decls, we decided to clobber newdecl.
3716 If we're going to do that, we'd better make sure that
3717 olddecl, and not newdecl, is on the list of
3718 instantiations so that if we try to do the instantiation
3719 again we won't get the clobbered declaration. */
3721 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3722 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3724 for (; decls
; decls
= TREE_CHAIN (decls
))
3725 if (TREE_VALUE (decls
) == newdecl
)
3726 TREE_VALUE (decls
) = olddecl
;
3731 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3732 (char *) olddecl
+ sizeof (struct tree_common
),
3733 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3734 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3737 DECL_UID (olddecl
) = olddecl_uid
;
3739 DECL_FRIEND_P (olddecl
) = 1;
3741 /* NEWDECL contains the merged attribute lists.
3742 Update OLDDECL to be the same. */
3743 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3748 /* Record a decl-node X as belonging to the current lexical scope.
3749 Check for errors (such as an incompatible declaration for the same
3750 name already seen in the same scope).
3752 Returns either X or an old decl for the same name.
3753 If an old decl is returned, it may have been smashed
3754 to agree with what X says. */
3762 int need_new_binding
;
3764 /* We shouldn't be calling pushdecl when we're generating RTL for a
3765 function that we already did semantic analysis on previously. */
3766 my_friendly_assert (!cfun
|| doing_semantic_analysis_p (),
3769 need_new_binding
= 1;
3771 if (DECL_TEMPLATE_PARM_P (x
))
3772 /* Template parameters have no context; they are not X::T even
3773 when declared within a class or namespace. */
3777 if (current_function_decl
&& x
!= current_function_decl
3778 /* A local declaration for a function doesn't constitute
3780 && !(TREE_CODE (x
) == FUNCTION_DECL
&& !DECL_INITIAL (x
))
3781 /* A local declaration for an `extern' variable is in the
3782 scope of the current namespace, not the current
3784 && !(TREE_CODE (x
) == VAR_DECL
&& DECL_EXTERNAL (x
))
3785 && !DECL_CONTEXT (x
))
3786 DECL_CONTEXT (x
) = current_function_decl
;
3788 /* If this is the declaration for a namespace-scope function,
3789 but the declaration itself is in a local scope, mark the
3791 if (TREE_CODE (x
) == FUNCTION_DECL
3792 && DECL_NAMESPACE_SCOPE_P (x
)
3793 && current_function_decl
3794 && x
!= current_function_decl
)
3795 DECL_LOCAL_FUNCTION_P (x
) = 1;
3798 name
= DECL_NAME (x
);
3801 int different_binding_level
= 0;
3803 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3804 name
= TREE_OPERAND (name
, 0);
3806 /* In case this decl was explicitly namespace-qualified, look it
3807 up in its namespace context. */
3808 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
)
3809 && namespace_bindings_p ())
3810 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3812 t
= lookup_name_current_level (name
);
3814 /* [basic.link] If there is a visible declaration of an entity
3815 with linkage having the same name and type, ignoring entities
3816 declared outside the innermost enclosing namespace scope, the
3817 block scope declaration declares that same entity and
3818 receives the linkage of the previous declaration. */
3819 if (! t
&& current_function_decl
&& x
!= current_function_decl
3820 && (TREE_CODE (x
) == FUNCTION_DECL
|| TREE_CODE (x
) == VAR_DECL
)
3821 && DECL_EXTERNAL (x
))
3823 /* Look in block scope. */
3824 t
= IDENTIFIER_VALUE (name
);
3825 /* Or in the innermost namespace. */
3827 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3828 /* Does it have linkage? Note that if this isn't a DECL, it's an
3829 OVERLOAD, which is OK. */
3830 if (t
&& DECL_P (t
) && ! (TREE_STATIC (t
) || DECL_EXTERNAL (t
)))
3833 different_binding_level
= 1;
3836 /* If we are declaring a function, and the result of name-lookup
3837 was an OVERLOAD, look for an overloaded instance that is
3838 actually the same as the function we are declaring. (If
3839 there is one, we have to merge our declaration with the
3840 previous declaration.) */
3841 if (t
&& TREE_CODE (t
) == OVERLOAD
)
3845 if (TREE_CODE (x
) == FUNCTION_DECL
)
3846 for (match
= t
; match
; match
= OVL_NEXT (match
))
3848 if (DECL_ASSEMBLER_NAME (OVL_CURRENT (t
))
3849 == DECL_ASSEMBLER_NAME (x
))
3853 /* Just choose one. */
3857 t
= OVL_CURRENT (match
);
3862 if (t
== error_mark_node
)
3864 /* error_mark_node is 0 for a while during initialization! */
3866 cp_error_at ("`%#D' used prior to declaration", x
);
3868 else if (t
!= NULL_TREE
)
3870 if (different_binding_level
)
3872 if (decls_match (x
, t
))
3873 /* The standard only says that the local extern
3874 inherits linkage from the previous decl; in
3875 particular, default args are not shared. It would
3876 be nice to propagate inlining info, though. FIXME. */
3877 TREE_PUBLIC (x
) = TREE_PUBLIC (t
);
3879 else if (TREE_CODE (t
) == PARM_DECL
)
3881 if (DECL_CONTEXT (t
) == NULL_TREE
)
3882 /* This is probaby caused by too many errors, but calling
3883 abort will say that if errors have occurred. */
3886 /* Check for duplicate params. */
3887 if (duplicate_decls (x
, t
))
3890 else if ((DECL_EXTERN_C_FUNCTION_P (x
)
3891 || DECL_FUNCTION_TEMPLATE_P (x
))
3892 && is_overloaded_fn (t
))
3893 /* Don't do anything just yet. */;
3894 else if (t
== wchar_decl_node
)
3896 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3897 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3899 /* Throw away the redeclaration. */
3902 else if (TREE_CODE (t
) != TREE_CODE (x
))
3904 if (duplicate_decls (x
, t
))
3907 else if (duplicate_decls (x
, t
))
3909 if (TREE_CODE (t
) == TYPE_DECL
)
3910 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3911 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3912 check_default_args (t
);
3916 else if (DECL_MAIN_P (x
))
3918 /* A redeclaration of main, but not a duplicate of the
3923 This function shall not be overloaded. */
3924 cp_error_at ("invalid redeclaration of `%D'", t
);
3925 cp_error ("as `%D'", x
);
3926 /* We don't try to push this declaration since that
3932 check_template_shadow (x
);
3934 /* If this is a function conjured up by the backend, massage it
3935 so it looks friendly. */
3936 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_LANG_SPECIFIC (x
))
3938 retrofit_lang_decl (x
);
3939 DECL_LANGUAGE (x
) = lang_c
;
3942 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_FUNCTION_MEMBER_P (x
))
3944 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
3947 if (!namespace_bindings_p ())
3948 /* We do not need to create a binding for this name;
3949 push_overloaded_decl will have already done so if
3951 need_new_binding
= 0;
3953 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3955 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
3957 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
3961 /* If declaring a type as a typedef, copy the type (unless we're
3962 at line 0), and install this TYPE_DECL as the new type's typedef
3963 name. See the extensive comment in ../c-decl.c (pushdecl). */
3964 if (TREE_CODE (x
) == TYPE_DECL
)
3966 tree type
= TREE_TYPE (x
);
3967 if (DECL_SOURCE_LINE (x
) == 0)
3969 if (TYPE_NAME (type
) == 0)
3970 TYPE_NAME (type
) = x
;
3972 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
3973 /* We don't want to copy the type when all we're
3974 doing is making a TYPE_DECL for the purposes of
3976 && (!TYPE_NAME (type
)
3977 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
3979 DECL_ORIGINAL_TYPE (x
) = type
;
3980 type
= build_type_copy (type
);
3981 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
3982 TYPE_NAME (type
) = x
;
3983 TREE_TYPE (x
) = type
;
3986 if (type
!= error_mark_node
3988 && TYPE_IDENTIFIER (type
))
3989 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
3990 current_binding_level
);
3994 /* Multiple external decls of the same identifier ought to match.
3996 We get warnings about inline functions where they are defined.
3997 We get warnings about other functions from push_overloaded_decl.
3999 Avoid duplicate warnings where they are used. */
4000 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
4004 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
4005 if (decl
&& TREE_CODE (decl
) == OVERLOAD
)
4006 decl
= OVL_FUNCTION (decl
);
4008 if (decl
&& decl
!= error_mark_node
4009 && (DECL_EXTERNAL (decl
) || TREE_PUBLIC (decl
))
4010 /* If different sort of thing, we already gave an error. */
4011 && TREE_CODE (decl
) == TREE_CODE (x
)
4012 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
4014 cp_pedwarn ("type mismatch with previous external decl", x
);
4015 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
4019 /* This name is new in its binding level.
4020 Install the new declaration and return it. */
4021 if (namespace_bindings_p ())
4023 /* Install a global value. */
4025 /* If the first global decl has external linkage,
4026 warn if we later see static one. */
4027 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
4028 TREE_PUBLIC (name
) = 1;
4030 /* Bind the mangled name for the entity. In the future, we
4031 should not need to do this; mangled names are an
4032 implementation detail of which the front-end should not
4033 need to be aware. */
4034 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
4036 /* For an ordinary function, we create a binding from
4037 the mangled name (i.e., NAME) to the DECL. But, for
4038 an `extern "C"' function, the mangled name and the
4039 ordinary name are the same so we need not do this. */
4040 && !DECL_EXTERN_C_FUNCTION_P (x
))
4044 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
4045 || TREE_CODE (x
) == NAMESPACE_DECL
)
4046 mangled_name
= name
;
4048 mangled_name
= DECL_ASSEMBLER_NAME (x
);
4050 if (TREE_CODE (x
) == FUNCTION_DECL
)
4052 ((IDENTIFIER_GLOBAL_VALUE (mangled_name
) == NULL_TREE
)
4053 || (IDENTIFIER_GLOBAL_VALUE (mangled_name
) == x
), 378);
4054 SET_IDENTIFIER_NAMESPACE_VALUE (mangled_name
, x
);
4057 /* Don't forget if the function was used via an implicit decl. */
4058 if (IDENTIFIER_IMPLICIT_DECL (name
)
4059 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
4062 /* Don't forget if its address was taken in that way. */
4063 if (IDENTIFIER_IMPLICIT_DECL (name
)
4064 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
4065 TREE_ADDRESSABLE (x
) = 1;
4067 /* Warn about mismatches against previous implicit decl. */
4068 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
4069 /* If this real decl matches the implicit, don't complain. */
4070 && ! (TREE_CODE (x
) == FUNCTION_DECL
4071 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
4073 ("`%D' was previously implicitly declared to return `int'", x
);
4075 /* If new decl is `static' and an `extern' was seen previously,
4077 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
4078 warn_extern_redeclared_static (x
, t
);
4082 /* Here to install a non-global value. */
4083 tree oldlocal
= IDENTIFIER_VALUE (name
);
4084 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
4086 if (need_new_binding
)
4088 push_local_binding (name
, x
, 0);
4089 /* Because push_local_binding will hook X on to the
4090 current_binding_level's name list, we don't want to
4091 do that again below. */
4092 need_new_binding
= 0;
4095 /* If this is a TYPE_DECL, push it into the type value slot. */
4096 if (TREE_CODE (x
) == TYPE_DECL
)
4097 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
4098 current_binding_level
);
4100 /* Clear out any TYPE_DECL shadowed by a namespace so that
4101 we won't think this is a type. The C struct hack doesn't
4102 go through namespaces. */
4103 if (TREE_CODE (x
) == NAMESPACE_DECL
)
4104 set_identifier_type_value_with_scope (name
, NULL_TREE
,
4105 current_binding_level
);
4112 && TREE_CODE (oldlocal
) == VAR_DECL
4113 && DECL_DEAD_FOR_LOCAL (oldlocal
))
4114 oldlocal
= DECL_SHADOWED_FOR_VAR (oldlocal
);
4116 if (oldlocal
== NULL_TREE
)
4117 oldlocal
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (d
));
4120 /* If this is an extern function declaration, see if we
4121 have a global definition or declaration for the function. */
4122 if (oldlocal
== NULL_TREE
4123 && DECL_EXTERNAL (x
)
4124 && oldglobal
!= NULL_TREE
4125 && TREE_CODE (x
) == FUNCTION_DECL
4126 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
4128 /* We have one. Their types must agree. */
4129 if (decls_match (x
, oldglobal
))
4133 cp_warning ("extern declaration of `%#D' doesn't match", x
);
4134 cp_warning_at ("global declaration `%#D'", oldglobal
);
4137 /* If we have a local external declaration,
4138 and no file-scope declaration has yet been seen,
4139 then if we later have a file-scope decl it must not be static. */
4140 if (oldlocal
== NULL_TREE
4141 && oldglobal
== NULL_TREE
4142 && DECL_EXTERNAL (x
)
4144 TREE_PUBLIC (name
) = 1;
4146 /* Warn if shadowing an argument at the top level of the body. */
4147 if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
4148 /* Inline decls shadow nothing. */
4149 && !DECL_FROM_INLINE (x
)
4150 && TREE_CODE (oldlocal
) == PARM_DECL
4151 /* Don't complain if it's from an enclosing function. */
4152 && DECL_CONTEXT (oldlocal
) == current_function_decl
4153 && TREE_CODE (x
) != PARM_DECL
)
4155 /* Go to where the parms should be and see if we
4157 struct binding_level
*b
= current_binding_level
->level_chain
;
4163 if (b
->parm_flag
== 1)
4164 cp_error ("declaration of `%#D' shadows a parameter", name
);
4167 /* Maybe warn if shadowing something else. */
4168 if (warn_shadow
&& !DECL_EXTERNAL (x
)
4169 /* Inline decls shadow nothing. */
4170 && !DECL_FROM_INLINE (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 (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
4177 warning ("declaration of `%s' shadows a parameter",
4178 IDENTIFIER_POINTER (name
));
4179 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
4180 && current_class_ptr
4181 && !TREE_STATIC (name
))
4182 warning ("declaration of `%s' shadows a member of `this'",
4183 IDENTIFIER_POINTER (name
));
4184 else if (oldlocal
!= NULL_TREE
)
4185 warning ("declaration of `%s' shadows previous local",
4186 IDENTIFIER_POINTER (name
));
4187 else if (oldglobal
!= NULL_TREE
)
4188 /* XXX shadow warnings in outer-more namespaces */
4189 warning ("declaration of `%s' shadows global declaration",
4190 IDENTIFIER_POINTER (name
));
4194 if (TREE_CODE (x
) == FUNCTION_DECL
)
4195 check_default_args (x
);
4197 /* Keep count of variables in this level with incomplete type. */
4198 if (TREE_CODE (x
) == VAR_DECL
4199 && TREE_TYPE (x
) != error_mark_node
4200 && ((!COMPLETE_TYPE_P (TREE_TYPE (x
))
4201 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
4202 /* RTTI TD entries are created while defining the type_info. */
4203 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
4204 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
4206 if (namespace_bindings_p ())
4207 namespace_scope_incomplete
4208 = tree_cons (NULL_TREE
, x
, namespace_scope_incomplete
);
4210 current_binding_level
->incomplete
4211 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4215 if (need_new_binding
)
4216 add_decl_to_level (x
,
4217 DECL_NAMESPACE_SCOPE_P (x
)
4218 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x
))
4219 : current_binding_level
);
4224 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4225 caller to set DECL_CONTEXT properly. */
4228 pushdecl_with_scope (x
, level
)
4230 struct binding_level
*level
;
4232 register struct binding_level
*b
;
4233 tree function_decl
= current_function_decl
;
4235 current_function_decl
= NULL_TREE
;
4236 if (level
->parm_flag
== 2)
4238 b
= class_binding_level
;
4239 class_binding_level
= level
;
4240 pushdecl_class_level (x
);
4241 class_binding_level
= b
;
4245 b
= current_binding_level
;
4246 current_binding_level
= level
;
4248 current_binding_level
= b
;
4250 current_function_decl
= function_decl
;
4254 /* Like pushdecl, only it places X in the current namespace,
4258 pushdecl_namespace_level (x
)
4261 register struct binding_level
*b
= current_binding_level
;
4264 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4266 /* Now, the type_shadowed stack may screw us. Munge it so it does
4268 if (TREE_CODE (x
) == TYPE_DECL
)
4270 tree name
= DECL_NAME (x
);
4272 tree
*ptr
= (tree
*)0;
4273 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4275 tree shadowed
= b
->type_shadowed
;
4276 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4277 if (TREE_PURPOSE (shadowed
) == name
)
4279 ptr
= &TREE_VALUE (shadowed
);
4280 /* Can't break out of the loop here because sometimes
4281 a binding level will have duplicate bindings for
4282 PT names. It's gross, but I haven't time to fix it. */
4285 newval
= TREE_TYPE (x
);
4286 if (ptr
== (tree
*)0)
4288 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4289 up here if this is changed to an assertion. --KR */
4290 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4300 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4304 pushdecl_top_level (x
)
4307 push_to_top_level ();
4308 x
= pushdecl_namespace_level (x
);
4309 pop_from_top_level ();
4313 /* Make the declaration of X appear in CLASS scope. */
4316 pushdecl_class_level (x
)
4319 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4320 scope looks for the pre-mangled name. */
4323 if (TREE_CODE (x
) == OVERLOAD
)
4324 x
= OVL_CURRENT (x
);
4325 name
= DECL_NAME (x
);
4329 push_class_level_binding (name
, x
);
4330 if (TREE_CODE (x
) == TYPE_DECL
)
4331 set_identifier_type_value (name
, TREE_TYPE (x
));
4333 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4337 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4340 pushdecl_class_level (f
);
4344 /* Enter DECL into the symbol table, if that's appropriate. Returns
4345 DECL, or a modified version thereof. */
4348 maybe_push_decl (decl
)
4351 tree type
= TREE_TYPE (decl
);
4353 /* Add this decl to the current binding level, but not if it comes
4354 from another scope, e.g. a static member variable. TEM may equal
4355 DECL or it may be a previous decl of the same name. */
4356 if (decl
== error_mark_node
4357 || (TREE_CODE (decl
) != PARM_DECL
4358 && DECL_CONTEXT (decl
) != NULL_TREE
4359 /* Definitions of namespace members outside their namespace are
4361 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4362 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4363 || TREE_CODE (type
) == UNKNOWN_TYPE
4364 /* The declaration of a template specialization does not affect
4365 the functions available for overload resolution, so we do not
4367 || (TREE_CODE (decl
) == FUNCTION_DECL
4368 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4371 return pushdecl (decl
);
4374 /* Make the declaration(s) of X appear in CLASS scope
4375 under the name NAME. */
4378 push_class_level_binding (name
, x
)
4383 /* The class_binding_level will be NULL if x is a template
4384 parameter name in a member template. */
4385 if (!class_binding_level
)
4388 /* Make sure that this new member does not have the same name
4389 as a template parameter. */
4390 if (TYPE_BEING_DEFINED (current_class_type
))
4391 check_template_shadow (x
);
4393 /* If this declaration shadows a declaration from an enclosing
4394 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4395 we leave this class. Record the shadowed declaration here. */
4396 binding
= IDENTIFIER_BINDING (name
);
4398 && ((TREE_CODE (x
) == OVERLOAD
4399 && BINDING_VALUE (binding
)
4400 && is_overloaded_fn (BINDING_VALUE (binding
)))
4401 || INHERITED_VALUE_BINDING_P (binding
)))
4406 /* If the old binding was from a base class, and was for a tag
4407 name, slide it over to make room for the new binding. The
4408 old binding is still visible if explicitly qualified with a
4410 if (INHERITED_VALUE_BINDING_P (binding
)
4411 && BINDING_VALUE (binding
)
4412 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4413 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4414 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4416 old_decl
= BINDING_TYPE (binding
);
4417 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4418 BINDING_VALUE (binding
) = NULL_TREE
;
4419 INHERITED_VALUE_BINDING_P (binding
) = 0;
4422 old_decl
= BINDING_VALUE (binding
);
4424 /* Find the previous binding of name on the class-shadowed
4425 list, and update it. */
4426 for (shadow
= class_binding_level
->class_shadowed
;
4428 shadow
= TREE_CHAIN (shadow
))
4429 if (TREE_PURPOSE (shadow
) == name
4430 && TREE_TYPE (shadow
) == old_decl
)
4432 BINDING_VALUE (binding
) = x
;
4433 INHERITED_VALUE_BINDING_P (binding
) = 0;
4434 TREE_TYPE (shadow
) = x
;
4435 IDENTIFIER_CLASS_VALUE (name
) = x
;
4440 /* If we didn't replace an existing binding, put the binding on the
4441 stack of bindings for the identifier, and update the shadowed list. */
4442 if (push_class_binding (name
, x
))
4444 class_binding_level
->class_shadowed
4445 = tree_cons (name
, NULL
,
4446 class_binding_level
->class_shadowed
);
4447 /* Record the value we are binding NAME to so that we can know
4448 what to pop later. */
4449 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4453 /* Insert another USING_DECL into the current binding level, returning
4454 this declaration. If this is a redeclaration, do nothing, and
4455 return NULL_TREE if this not in namespace scope (in namespace
4456 scope, a using decl might extend any previous bindings). */
4459 push_using_decl (scope
, name
)
4465 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4466 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4467 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4468 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4471 return namespace_bindings_p () ? decl
: NULL_TREE
;
4472 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4473 DECL_INITIAL (decl
) = scope
;
4474 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4475 current_binding_level
->usings
= decl
;
4479 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4480 changed (i.e. there was already a directive), or the fresh
4481 TREE_LIST otherwise. */
4484 push_using_directive (used
)
4487 tree ud
= current_binding_level
->using_directives
;
4488 tree iter
, ancestor
;
4490 /* Check if we already have this. */
4491 if (purpose_member (used
, ud
) != NULL_TREE
)
4494 /* Recursively add all namespaces used. */
4495 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4496 push_using_directive (TREE_PURPOSE (iter
));
4498 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4499 ud
= current_binding_level
->using_directives
;
4500 ud
= tree_cons (used
, ancestor
, ud
);
4501 current_binding_level
->using_directives
= ud
;
4505 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4506 other definitions already in place. We get around this by making
4507 the value of the identifier point to a list of all the things that
4508 want to be referenced by that name. It is then up to the users of
4509 that name to decide what to do with that list.
4511 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its
4512 DECL_TEMPLATE_RESULT. It is dealt with the same way.
4514 FLAGS is a bitwise-or of the following values:
4515 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4517 PUSH_USING: DECL is being pushed as the result of a using
4520 The value returned may be a previous declaration if we guessed wrong
4521 about what language DECL should belong to (C or C++). Otherwise,
4522 it's always DECL (and never something that's not a _DECL). */
4525 push_overloaded_decl (decl
, flags
)
4529 tree name
= DECL_NAME (decl
);
4532 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4535 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4537 old
= lookup_name_current_level (name
);
4541 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4543 tree t
= TREE_TYPE (old
);
4544 if (IS_AGGR_TYPE (t
) && warn_shadow
4545 && (! DECL_IN_SYSTEM_HEADER (decl
)
4546 || ! DECL_IN_SYSTEM_HEADER (old
)))
4547 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4550 else if (is_overloaded_fn (old
))
4554 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4556 tree fn
= OVL_CURRENT (tmp
);
4558 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4559 && !(flags
& PUSH_USING
)
4560 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4561 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4562 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4565 if (duplicate_decls (decl
, fn
))
4569 else if (old
== error_mark_node
)
4570 /* Ignore the undefined symbol marker. */
4574 cp_error_at ("previous non-function declaration `%#D'", old
);
4575 cp_error ("conflicts with function declaration `%#D'", decl
);
4580 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4582 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4583 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4585 new_binding
= ovl_cons (decl
, old
);
4586 if (flags
& PUSH_USING
)
4587 OVL_USED (new_binding
) = 1;
4590 /* NAME is not ambiguous. */
4594 set_namespace_binding (name
, current_namespace
, new_binding
);
4597 /* We only create an OVERLOAD if there was a previous binding at
4598 this level, or if decl is a template. In the former case, we
4599 need to remove the old binding and replace it with the new
4600 binding. We must also run through the NAMES on the binding
4601 level where the name was bound to update the chain. */
4603 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4607 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4609 d
= &TREE_CHAIN (*d
))
4611 || (TREE_CODE (*d
) == TREE_LIST
4612 && TREE_VALUE (*d
) == old
))
4614 if (TREE_CODE (*d
) == TREE_LIST
)
4615 /* Just replace the old binding with the new. */
4616 TREE_VALUE (*d
) = new_binding
;
4618 /* Build a TREE_LIST to wrap the OVERLOAD. */
4619 *d
= tree_cons (NULL_TREE
, new_binding
,
4622 /* And update the CPLUS_BINDING node. */
4623 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4628 /* We should always find a previous binding in this case. */
4629 my_friendly_abort (0);
4632 /* Install the new binding. */
4633 push_local_binding (name
, new_binding
, flags
);
4639 /* Generate an implicit declaration for identifier FUNCTIONID
4640 as a function of type int (). Print a warning if appropriate. */
4643 implicitly_declare (functionid
)
4648 /* We used to reuse an old implicit decl here,
4649 but this loses with inline functions because it can clobber
4650 the saved decl chains. */
4651 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4653 DECL_EXTERNAL (decl
) = 1;
4654 TREE_PUBLIC (decl
) = 1;
4656 /* ISO standard says implicit declarations are in the innermost block.
4657 So we record the decl in the standard fashion. */
4659 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4662 /* Only one warning per identifier. */
4663 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4665 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4668 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4673 /* Return zero if the declaration NEWDECL is valid
4674 when the declaration OLDDECL (assumed to be for the same name)
4675 has already been seen.
4676 Otherwise return an error message format string with a %s
4677 where the identifier should go. */
4680 redeclaration_error_message (newdecl
, olddecl
)
4681 tree newdecl
, olddecl
;
4683 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4685 /* Because C++ can put things into name space for free,
4686 constructs like "typedef struct foo { ... } foo"
4687 would look like an erroneous redeclaration. */
4688 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4691 return "redefinition of `%#D'";
4693 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4695 /* If this is a pure function, its olddecl will actually be
4696 the original initialization to `0' (which we force to call
4697 abort()). Don't complain about redefinition in this case. */
4698 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_PURE_VIRTUAL_P (olddecl
))
4701 /* If both functions come from different namespaces, this is not
4702 a redeclaration - this is a conflict with a used function. */
4703 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4704 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4705 return "`%D' conflicts with used function";
4707 /* We'll complain about linkage mismatches in
4708 warn_extern_redeclared_static. */
4710 /* Defining the same name twice is no good. */
4711 if (DECL_INITIAL (olddecl
) != NULL_TREE
4712 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4714 if (DECL_NAME (olddecl
) == NULL_TREE
)
4715 return "`%#D' not declared in class";
4717 return "redefinition of `%#D'";
4721 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4723 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4724 && (DECL_TEMPLATE_RESULT (newdecl
)
4725 != DECL_TEMPLATE_RESULT (olddecl
))
4726 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4727 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4728 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4729 && COMPLETE_TYPE_P (TREE_TYPE (newdecl
))
4730 && COMPLETE_TYPE_P (TREE_TYPE (olddecl
))))
4731 return "redefinition of `%#D'";
4734 else if (toplevel_bindings_p () || DECL_NAMESPACE_SCOPE_P (newdecl
))
4736 /* Objects declared at top level: */
4737 /* If at least one is a reference, it's ok. */
4738 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4740 /* Reject two definitions. */
4741 return "redefinition of `%#D'";
4745 /* Objects declared with block scope: */
4746 /* Reject two definitions, and reject a definition
4747 together with an external reference. */
4748 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4749 return "redeclaration of `%#D'";
4754 /* Create a new label, named ID. */
4757 make_label_decl (id
, local_p
)
4763 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4765 /* Make sure every label has an rtx. */
4768 DECL_CONTEXT (decl
) = current_function_decl
;
4769 DECL_MODE (decl
) = VOIDmode
;
4770 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
4772 /* Say where one reference is to the label, for the sake of the
4773 error if it is not defined. */
4774 DECL_SOURCE_LINE (decl
) = lineno
;
4775 DECL_SOURCE_FILE (decl
) = input_filename
;
4777 /* Record the fact that this identifier is bound to this label. */
4778 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4783 /* Record this label on the list of used labels so that we can check
4784 at the end of the function to see whether or not the label was
4785 actually defined, and so we can check when the label is defined whether
4786 this use is valid. */
4792 if (named_label_uses
== NULL
4793 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4794 || named_label_uses
->label_decl
!= decl
)
4796 struct named_label_use_list
*new_ent
;
4797 new_ent
= ((struct named_label_use_list
*)
4798 ggc_alloc (sizeof (struct named_label_use_list
)));
4799 new_ent
->label_decl
= decl
;
4800 new_ent
->names_in_scope
= current_binding_level
->names
;
4801 new_ent
->binding_level
= current_binding_level
;
4802 new_ent
->lineno_o_goto
= lineno
;
4803 new_ent
->filename_o_goto
= input_filename
;
4804 new_ent
->next
= named_label_uses
;
4805 named_label_uses
= new_ent
;
4809 /* Look for a label named ID in the current function. If one cannot
4810 be found, create one. (We keep track of used, but undefined,
4811 labels, and complain about them at the end of a function.) */
4818 struct named_label_list
*ent
;
4820 /* You can't use labels at global scope. */
4821 if (current_function_decl
== NULL_TREE
)
4823 error ("label `%s' referenced outside of any function",
4824 IDENTIFIER_POINTER (id
));
4828 /* See if we've already got this label. */
4829 decl
= IDENTIFIER_LABEL_VALUE (id
);
4830 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
4833 /* Record this label on the list of labels used in this function.
4834 We do this before calling make_label_decl so that we get the
4835 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4836 ent
= ((struct named_label_list
*)
4837 ggc_alloc_cleared (sizeof (struct named_label_list
)));
4838 ent
->old_value
= IDENTIFIER_LABEL_VALUE (id
);
4839 ent
->next
= named_labels
;
4842 /* We need a new label. */
4843 decl
= make_label_decl (id
, /*local_p=*/0);
4845 /* Now fill in the information we didn't have before. */
4846 ent
->label_decl
= decl
;
4851 /* Declare a local label named ID. */
4854 declare_local_label (id
)
4859 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4860 this scope we can restore the old value of
4861 IDENTIFIER_TYPE_VALUE. */
4862 current_binding_level
->shadowed_labels
4863 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4864 current_binding_level
->shadowed_labels
);
4865 /* Look for the label. */
4866 decl
= make_label_decl (id
, /*local_p=*/1);
4867 /* Now fill in the information we didn't have before. */
4868 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
4873 /* Returns nonzero if it is ill-formed to jump past the declaration of
4874 DECL. Returns 2 if it's also a real problem. */
4877 decl_jump_unsafe (decl
)
4880 if (TREE_CODE (decl
) != VAR_DECL
|| TREE_STATIC (decl
))
4883 if (DECL_INITIAL (decl
) == NULL_TREE
4884 && pod_type_p (TREE_TYPE (decl
)))
4887 /* This is really only important if we're crossing an initialization.
4888 The POD stuff is just pedantry; why should it matter if the class
4889 contains a field of pointer to member type? */
4890 if (DECL_INITIAL (decl
)
4891 || (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))))
4896 /* Check that a single previously seen jump to a newly defined label
4897 is OK. DECL is the LABEL_DECL or 0; LEVEL is the binding_level for
4898 the jump context; NAMES are the names in scope in LEVEL at the jump
4899 context; FILE and LINE are the source position of the jump or 0. */
4902 check_previous_goto_1 (decl
, level
, names
, file
, line
)
4904 struct binding_level
*level
;
4911 struct binding_level
*b
= current_binding_level
;
4912 for (; b
; b
= b
->level_chain
)
4914 tree new_decls
= b
->names
;
4915 tree old_decls
= (b
== level
? names
: NULL_TREE
);
4916 for (; new_decls
!= old_decls
;
4917 new_decls
= TREE_CHAIN (new_decls
))
4919 int problem
= decl_jump_unsafe (new_decls
);
4926 cp_pedwarn ("jump to label `%D'", decl
);
4928 pedwarn ("jump to case label");
4931 pedwarn_with_file_and_line (file
, line
, " from here");
4935 if (problem
> 1 && DECL_ARTIFICIAL (new_decls
))
4936 /* Can't skip init of __exception_info. */
4937 cp_error_at (" enters catch block", new_decls
);
4938 else if (problem
> 1)
4939 cp_error_at (" crosses initialization of `%#D'",
4942 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4948 if (b
->eh_region
&& ! saw_eh
)
4953 cp_pedwarn ("jump to label `%D'", decl
);
4955 pedwarn ("jump to case label");
4958 pedwarn_with_file_and_line (file
, line
, " from here");
4961 error (" enters try block");
4968 check_previous_goto (use
)
4969 struct named_label_use_list
*use
;
4971 check_previous_goto_1 (use
->label_decl
, use
->binding_level
,
4972 use
->names_in_scope
, use
->filename_o_goto
,
4973 use
->lineno_o_goto
);
4977 check_switch_goto (level
)
4978 struct binding_level
*level
;
4980 check_previous_goto_1 (NULL_TREE
, level
, level
->names
, NULL
, 0);
4983 /* Check that any previously seen jumps to a newly defined label DECL
4984 are OK. Called by define_label. */
4987 check_previous_gotos (decl
)
4990 struct named_label_use_list
**usep
;
4992 if (! TREE_USED (decl
))
4995 for (usep
= &named_label_uses
; *usep
; )
4997 struct named_label_use_list
*use
= *usep
;
4998 if (use
->label_decl
== decl
)
5000 check_previous_goto (use
);
5004 usep
= &(use
->next
);
5008 /* Check that a new jump to a label DECL is OK. Called by
5009 finish_goto_stmt. */
5017 struct named_label_list
*lab
;
5019 /* We can't know where a computed goto is jumping. So we assume
5021 if (! DECL_P (decl
))
5024 /* If the label hasn't been defined yet, defer checking. */
5025 if (! DECL_INITIAL (decl
))
5031 for (lab
= named_labels
; lab
; lab
= lab
->next
)
5032 if (decl
== lab
->label_decl
)
5035 /* If the label is not on named_labels it's a gcc local label, so
5036 it must be in an outer scope, so jumping to it is always OK. */
5040 if ((lab
->eh_region
|| lab
->bad_decls
) && !identified
)
5042 cp_pedwarn_at ("jump to label `%D'", decl
);
5043 pedwarn (" from here");
5047 for (bad
= lab
->bad_decls
; bad
; bad
= TREE_CHAIN (bad
))
5049 tree b
= TREE_VALUE (bad
);
5050 int u
= decl_jump_unsafe (b
);
5052 if (u
> 1 && DECL_ARTIFICIAL (b
))
5053 /* Can't skip init of __exception_info. */
5054 cp_error_at (" enters catch block", b
);
5056 cp_error_at (" skips initialization of `%#D'", b
);
5058 cp_pedwarn_at (" enters scope of non-POD `%#D'", b
);
5062 error (" enters try block");
5065 /* Define a label, specifying the location in the source file.
5066 Return the LABEL_DECL node for the label, if the definition is valid.
5067 Otherwise return 0. */
5070 define_label (filename
, line
, name
)
5071 const char *filename
;
5075 tree decl
= lookup_label (name
);
5076 struct named_label_list
*ent
;
5077 register struct binding_level
*p
;
5079 for (ent
= named_labels
; ent
; ent
= ent
->next
)
5080 if (ent
->label_decl
== decl
)
5083 /* After labels, make any new cleanups in the function go into their
5084 own new (temporary) binding contour. */
5085 for (p
= current_binding_level
; !(p
->parm_flag
); p
= p
->level_chain
)
5086 p
->more_cleanups_ok
= 0;
5088 if (name
== get_identifier ("wchar_t"))
5089 cp_pedwarn ("label named wchar_t");
5091 if (DECL_INITIAL (decl
) != NULL_TREE
)
5093 cp_error ("duplicate label `%D'", decl
);
5098 /* Mark label as having been defined. */
5099 DECL_INITIAL (decl
) = error_mark_node
;
5100 /* Say where in the source. */
5101 DECL_SOURCE_FILE (decl
) = filename
;
5102 DECL_SOURCE_LINE (decl
) = line
;
5105 ent
->names_in_scope
= current_binding_level
->names
;
5106 ent
->binding_level
= current_binding_level
;
5108 check_previous_gotos (decl
);
5109 current_function_return_value
= NULL_TREE
;
5116 struct binding_level
*level
;
5117 struct cp_switch
*next
;
5118 /* The SWITCH_STMT being built. */
5120 /* A splay-tree mapping the low element of a case range to the high
5121 element, or NULL_TREE if there is no high element. Used to
5122 determine whether or not a new case label duplicates an old case
5123 label. We need a tree, rather than simply a hash table, because
5124 of the GNU case range extension. */
5128 /* A stack of the currently active switch statements. The innermost
5129 switch statement is on the top of the stack. There is no need to
5130 mark the stack for garbage collection because it is only active
5131 during the processing of the body of a function, and we never
5132 collect at that point. */
5134 static struct cp_switch
*switch_stack
;
5136 /* Called right after a switch-statement condition is parsed.
5137 SWITCH_STMT is the switch statement being parsed. */
5140 push_switch (switch_stmt
)
5144 = (struct cp_switch
*) xmalloc (sizeof (struct cp_switch
));
5145 p
->level
= current_binding_level
;
5146 p
->next
= switch_stack
;
5147 p
->switch_stmt
= switch_stmt
;
5148 p
->cases
= splay_tree_new (case_compare
, NULL
, NULL
);
5155 struct cp_switch
*cs
;
5158 splay_tree_delete (cs
->cases
);
5159 switch_stack
= switch_stack
->next
;
5163 /* Note that we've seen a definition of a case label, and complain if this
5164 is a bad place for one. */
5167 finish_case_label (low_value
, high_value
)
5172 register struct binding_level
*p
;
5177 error ("case label not within a switch statement");
5179 cp_error ("case label `%E' not within a switch statement",
5182 error ("`default' label not within a switch statement");
5186 if (processing_template_decl
)
5190 /* For templates, just add the case label; we'll do semantic
5191 analysis at instantiation-time. */
5192 label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
5193 return add_stmt (build_case_label (low_value
, high_value
, label
));
5196 /* Find the condition on which this switch statement depends. */
5197 cond
= SWITCH_COND (switch_stack
->switch_stmt
);
5198 if (cond
&& TREE_CODE (cond
) == TREE_LIST
)
5199 cond
= TREE_VALUE (cond
);
5201 r
= c_add_case_label (switch_stack
->cases
, cond
, low_value
, high_value
);
5202 if (r
== error_mark_node
)
5205 check_switch_goto (switch_stack
->level
);
5207 /* After labels, make any new cleanups in the function go into their
5208 own new (temporary) binding contour. */
5209 for (p
= current_binding_level
; !(p
->parm_flag
); p
= p
->level_chain
)
5210 p
->more_cleanups_ok
= 0;
5211 current_function_return_value
= NULL_TREE
;
5216 /* Return the list of declarations of the current level.
5217 Note that this list is in reverse order unless/until
5218 you nreverse it; and when you do nreverse it, you must
5219 store the result back using `storedecls' or you will lose. */
5224 return current_binding_level
->names
;
5227 /* Return the list of type-tags (for structs, etc) of the current level. */
5232 return current_binding_level
->tags
;
5235 /* Store the list of declarations of the current level.
5236 This is done for the parameter declarations of a function being defined,
5237 after they are modified in the light of any missing parameters. */
5243 current_binding_level
->names
= decls
;
5246 /* Similarly, store the list of tags of the current level. */
5252 current_binding_level
->tags
= tags
;
5255 /* Given NAME, an IDENTIFIER_NODE,
5256 return the structure (or union or enum) definition for that name.
5257 Searches binding levels from BINDING_LEVEL up to the global level.
5258 If THISLEVEL_ONLY is nonzero, searches only the specified context
5259 (but skips any tag-transparent contexts to find one that is
5260 meaningful for tags).
5261 FORM says which kind of type the caller wants;
5262 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
5263 If the wrong kind of type is found, and it's not a template, an error is
5267 lookup_tag (form
, name
, binding_level
, thislevel_only
)
5268 enum tree_code form
;
5270 struct binding_level
*binding_level
;
5273 register struct binding_level
*level
;
5274 /* Non-zero if, we should look past a template parameter level, even
5275 if THISLEVEL_ONLY. */
5276 int allow_template_parms_p
= 1;
5278 for (level
= binding_level
; level
; level
= level
->level_chain
)
5281 if (ANON_AGGRNAME_P (name
))
5282 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5284 /* There's no need for error checking here, because
5285 anon names are unique throughout the compilation. */
5286 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
5287 return TREE_VALUE (tail
);
5289 else if (level
->namespace_p
)
5290 /* Do namespace lookup. */
5291 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
5293 tree old
= binding_for_name (name
, tail
);
5295 /* If we just skipped past a template parameter level,
5296 even though THISLEVEL_ONLY, and we find a template
5297 class declaration, then we use the _TYPE node for the
5298 template. See the example below. */
5299 if (thislevel_only
&& !allow_template_parms_p
5300 && old
&& BINDING_VALUE (old
)
5301 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
5302 old
= TREE_TYPE (BINDING_VALUE (old
));
5304 old
= BINDING_TYPE (old
);
5306 /* If it has an original type, it is a typedef, and we
5307 should not return it. */
5308 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
5310 if (old
&& TREE_CODE (old
) != form
5311 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
5313 cp_error ("`%#D' redeclared as %C", old
, form
);
5318 if (thislevel_only
|| tail
== global_namespace
)
5322 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5324 if (TREE_PURPOSE (tail
) == name
)
5326 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
5327 /* Should tighten this up; it'll probably permit
5328 UNION_TYPE and a struct template, for example. */
5330 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
5332 /* Definition isn't the kind we were looking for. */
5333 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
5337 return TREE_VALUE (tail
);
5340 if (thislevel_only
&& ! level
->tag_transparent
)
5342 if (level
->template_parms_p
&& allow_template_parms_p
)
5344 /* We must deal with cases like this:
5346 template <class T> struct S;
5347 template <class T> struct S {};
5349 When looking up `S', for the second declaration, we
5350 would like to find the first declaration. But, we
5351 are in the pseudo-global level created for the
5352 template parameters, rather than the (surrounding)
5353 namespace level. Thus, we keep going one more level,
5354 even though THISLEVEL_ONLY is non-zero. */
5355 allow_template_parms_p
= 0;
5367 set_current_level_tags_transparency (tags_transparent
)
5368 int tags_transparent
;
5370 current_binding_level
->tag_transparent
= tags_transparent
;
5374 /* Given a type, find the tag that was defined for it and return the tag name.
5375 Otherwise return 0. However, the value can never be 0
5376 in the cases in which this is used.
5378 C++: If NAME is non-zero, this is the new name to install. This is
5379 done when replacing anonymous tags with real tag names. */
5382 lookup_tag_reverse (type
, name
)
5386 register struct binding_level
*level
;
5388 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5391 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5393 if (TREE_VALUE (tail
) == type
)
5396 TREE_PURPOSE (tail
) = name
;
5397 return TREE_PURPOSE (tail
);
5404 /* Look up NAME in the NAMESPACE. */
5407 lookup_namespace_name (namespace, name
)
5408 tree
namespace, name
;
5411 tree template_id
= NULL_TREE
;
5413 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5415 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5416 /* This happens for A::B<int> when B is a namespace. */
5418 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5420 /* This happens for A::B where B is a template, and there are no
5421 template arguments. */
5422 cp_error ("invalid use of `%D'", name
);
5423 return error_mark_node
;
5426 namespace = ORIGINAL_NAMESPACE (namespace);
5428 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5431 name
= TREE_OPERAND (name
, 0);
5432 if (TREE_CODE (name
) == OVERLOAD
)
5433 name
= DECL_NAME (OVL_CURRENT (name
));
5434 else if (DECL_P (name
))
5435 name
= DECL_NAME (name
);
5438 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5440 val
= make_node (CPLUS_BINDING
);
5441 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5442 return error_mark_node
;
5444 if (BINDING_VALUE (val
))
5446 val
= BINDING_VALUE (val
);
5450 if (DECL_CLASS_TEMPLATE_P (val
))
5451 val
= lookup_template_class (val
,
5452 TREE_OPERAND (template_id
, 1),
5453 /*in_decl=*/NULL_TREE
,
5454 /*context=*/NULL_TREE
,
5455 /*entering_scope=*/0,
5457 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5458 || TREE_CODE (val
) == OVERLOAD
)
5459 val
= lookup_template_function (val
,
5460 TREE_OPERAND (template_id
, 1));
5463 cp_error ("`%D::%D' is not a template",
5465 return error_mark_node
;
5469 /* If we have a single function from a using decl, pull it out. */
5470 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5471 val
= OVL_FUNCTION (val
);
5475 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5476 return error_mark_node
;
5479 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5481 static unsigned long
5489 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5490 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5495 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5498 typename_compare (k1
, k2
)
5509 d1
= TYPE_NAME (t1
);
5510 d2
= TYPE_NAME (t2
);
5512 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5513 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5514 && ((TREE_TYPE (t1
) != NULL_TREE
)
5515 == (TREE_TYPE (t2
) != NULL_TREE
))
5516 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5517 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5520 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5521 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5522 is non-NULL, this type is being created by the implicit typename
5523 extension, and BASE_TYPE is a type named `t' in some base class of
5524 `T' which depends on template parameters.
5526 Returns the new TYPENAME_TYPE. */
5529 build_typename_type (context
, name
, fullname
, base_type
)
5537 struct hash_entry
*e
;
5539 static struct hash_table ht
;
5543 static struct hash_table
*h
= &ht
;
5545 hash_table_init (&ht
, &hash_newfunc
, &typename_hash
, &typename_compare
);
5546 ggc_add_tree_hash_table_root (&h
, 1);
5549 /* Build the TYPENAME_TYPE. */
5550 t
= make_aggr_type (TYPENAME_TYPE
);
5551 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5552 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5553 TREE_TYPE (t
) = base_type
;
5555 /* Build the corresponding TYPE_DECL. */
5556 d
= build_decl (TYPE_DECL
, name
, t
);
5557 TYPE_NAME (TREE_TYPE (d
)) = d
;
5558 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5559 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5560 DECL_ARTIFICIAL (d
) = 1;
5562 /* See if we already have this type. */
5563 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5567 /* Insert the type into the table. */
5568 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5573 /* Resolve `typename CONTEXT::NAME'. Returns an appropriate type,
5574 unless an error occurs, in which case error_mark_node is returned.
5575 If COMPLAIN zero, don't complain about any errors that occur. */
5578 make_typename_type (context
, name
, complain
)
5586 if (!(TYPE_LANG_SPECIFIC (name
)
5587 && (CLASSTYPE_IS_TEMPLATE (name
)
5588 || CLASSTYPE_USE_TEMPLATE (name
))))
5589 name
= TYPE_IDENTIFIER (name
);
5591 /* Create a TEMPLATE_ID_EXPR for the type. */
5592 name
= build_nt (TEMPLATE_ID_EXPR
,
5593 CLASSTYPE_TI_TEMPLATE (name
),
5594 CLASSTYPE_TI_ARGS (name
));
5596 else if (TREE_CODE (name
) == TYPE_DECL
)
5597 name
= DECL_NAME (name
);
5601 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5603 name
= TREE_OPERAND (name
, 0);
5604 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5605 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5607 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5608 my_friendly_abort (2000);
5610 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5612 /* We can get here from typename_sub0 in the explicit_template_type
5613 expansion. Just fail. */
5615 cp_error ("no class template named `%#T' in `%#T'",
5617 return error_mark_node
;
5620 if (! uses_template_parms (context
)
5621 || currently_open_class (context
))
5623 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5625 tree tmpl
= NULL_TREE
;
5626 if (IS_AGGR_TYPE (context
))
5627 tmpl
= lookup_field (context
, name
, 0, 0);
5628 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5631 cp_error ("no class template named `%#T' in `%#T'",
5633 return error_mark_node
;
5636 return lookup_template_class (tmpl
,
5637 TREE_OPERAND (fullname
, 1),
5639 /*entering_scope=*/0,
5646 if (!IS_AGGR_TYPE (context
))
5649 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5650 return error_mark_node
;
5653 t
= lookup_field (context
, name
, 0, 1);
5655 return TREE_TYPE (t
);
5659 /* If the CONTEXT is not a template type, then either the field is
5660 there now or its never going to be. */
5661 if (!uses_template_parms (context
))
5664 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5665 return error_mark_node
;
5669 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5672 /* Select the right _DECL from multiple choices. */
5675 select_decl (binding
, flags
)
5680 val
= BINDING_VALUE (binding
);
5682 /* When we implicitly declare some builtin entity, we mark it
5683 DECL_ANTICIPATED, so that we know to ignore it until it is
5685 if (val
&& DECL_P (val
)
5686 && DECL_LANG_SPECIFIC (val
)
5687 && DECL_ANTICIPATED (val
))
5690 if (LOOKUP_NAMESPACES_ONLY (flags
))
5692 /* We are not interested in types. */
5693 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5698 /* If we could have a type and
5699 we have nothing or we need a type and have none. */
5700 if (BINDING_TYPE (binding
)
5701 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5702 && TREE_CODE (val
) != TYPE_DECL
)))
5703 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5704 /* Don't return non-types if we really prefer types. */
5705 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5706 && (TREE_CODE (val
) != TEMPLATE_DECL
5707 || !DECL_CLASS_TEMPLATE_P (val
)))
5713 /* Unscoped lookup of a global: iterate over current namespaces,
5714 considering using-directives. If SPACESP is non-NULL, store a list
5715 of the namespaces we've considered in it. */
5718 unqualified_namespace_lookup (name
, flags
, spacesp
)
5723 tree b
= make_node (CPLUS_BINDING
);
5724 tree initial
= current_decl_namespace();
5725 tree scope
= initial
;
5727 struct binding_level
*level
;
5728 tree val
= NULL_TREE
;
5731 *spacesp
= NULL_TREE
;
5733 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5736 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5737 val
= binding_for_name (name
, scope
);
5739 /* Initialize binding for this context. */
5740 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5741 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5743 /* Add all _DECLs seen through local using-directives. */
5744 for (level
= current_binding_level
;
5745 !level
->namespace_p
;
5746 level
= level
->level_chain
)
5747 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5748 scope
, flags
, spacesp
))
5749 /* Give up because of error. */
5750 return error_mark_node
;
5752 /* Add all _DECLs seen through global using-directives. */
5753 /* XXX local and global using lists should work equally. */
5757 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5758 scope
, flags
, spacesp
))
5759 /* Give up because of error. */
5760 return error_mark_node
;
5761 if (siter
== scope
) break;
5762 siter
= CP_DECL_CONTEXT (siter
);
5765 val
= select_decl (b
, flags
);
5766 if (scope
== global_namespace
)
5772 /* Combine prefer_type and namespaces_only into flags. */
5775 lookup_flags (prefer_type
, namespaces_only
)
5776 int prefer_type
, namespaces_only
;
5778 if (namespaces_only
)
5779 return LOOKUP_PREFER_NAMESPACES
;
5780 if (prefer_type
> 1)
5781 return LOOKUP_PREFER_TYPES
;
5782 if (prefer_type
> 0)
5783 return LOOKUP_PREFER_BOTH
;
5787 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5788 ignore it or not. Subroutine of lookup_name_real. */
5791 qualify_lookup (val
, flags
)
5795 if (val
== NULL_TREE
)
5797 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5799 if ((flags
& LOOKUP_PREFER_TYPES
)
5800 && (TREE_CODE (val
) == TYPE_DECL
5801 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5802 && DECL_CLASS_TEMPLATE_P (val
))))
5804 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5809 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5813 warn_about_implicit_typename_lookup (typename
, binding
)
5817 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5818 tree name
= DECL_NAME (typename
);
5820 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5821 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5822 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5823 && ! (TREE_CODE (binding
) == TYPE_DECL
5824 && same_type_p (TREE_TYPE (binding
), subtype
)))
5826 cp_warning ("lookup of `%D' finds `%#D'",
5828 cp_warning (" instead of `%D' from dependent base class",
5830 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5831 constructor_name (current_class_type
), name
);
5835 /* Look up NAME in the current binding level and its superiors in the
5836 namespace of variables, functions and typedefs. Return a ..._DECL
5837 node of some kind representing its definition if there is only one
5838 such declaration, or return a TREE_LIST with all the overloaded
5839 definitions if there are many, or return 0 if it is undefined.
5841 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5842 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5843 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5844 Otherwise we prefer non-TYPE_DECLs.
5846 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5847 using IDENTIFIER_CLASS_VALUE. */
5850 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5852 int prefer_type
, nonclass
, namespaces_only
;
5855 tree val
= NULL_TREE
;
5857 tree from_obj
= NULL_TREE
;
5859 int val_is_implicit_typename
= 0;
5861 /* Hack: copy flag set by parser, if set. */
5862 if (only_namespace_names
)
5863 namespaces_only
= 1;
5865 if (prefer_type
== -2)
5867 extern int looking_for_typename
;
5868 tree type
= NULL_TREE
;
5871 prefer_type
= looking_for_typename
;
5873 flags
= lookup_flags (prefer_type
, namespaces_only
);
5874 /* If the next thing is '<', class templates are types. */
5875 if (looking_for_template
)
5876 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5878 /* std:: becomes :: for now. */
5879 if (got_scope
&& got_scope
== fake_std_node
)
5880 got_scope
= void_type_node
;
5884 else if (got_object
!= error_mark_node
)
5889 if (type
== error_mark_node
)
5890 return error_mark_node
;
5891 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5892 type
= TREE_TYPE (type
);
5895 type
= complete_type (type
);
5897 if (TREE_CODE (type
) == VOID_TYPE
)
5898 type
= global_namespace
;
5899 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5901 val
= make_node (CPLUS_BINDING
);
5902 flags
|= LOOKUP_COMPLAIN
;
5903 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5905 val
= select_decl (val
, flags
);
5907 else if (! IS_AGGR_TYPE (type
)
5908 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5909 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
5910 || TREE_CODE (type
) == TYPENAME_TYPE
)
5911 /* Someone else will give an error about this if needed. */
5913 else if (type
== current_class_type
)
5914 val
= IDENTIFIER_CLASS_VALUE (name
);
5917 val
= lookup_member (type
, name
, 0, prefer_type
);
5918 type_access_control (type
, val
);
5920 /* Restore the containing TYPENAME_TYPE if we looked
5921 through it before. */
5922 if (got_scope
&& got_scope
!= type
5923 && val
&& TREE_CODE (val
) == TYPE_DECL
5924 && TREE_CODE (TREE_TYPE (val
)) == TYPENAME_TYPE
)
5925 TYPE_CONTEXT (TREE_TYPE (val
)) = got_scope
;
5933 else if (got_object
&& val
)
5941 flags
= lookup_flags (prefer_type
, namespaces_only
);
5942 /* If we're not parsing, we need to complain. */
5943 flags
|= LOOKUP_COMPLAIN
;
5946 /* First, look in non-namespace scopes. */
5948 if (current_class_type
== NULL_TREE
)
5951 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5955 if (!LOCAL_BINDING_P (t
) && nonclass
)
5956 /* We're not looking for class-scoped bindings, so keep going. */
5959 /* If this is the kind of thing we're looking for, we're done. */
5960 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5961 binding
= BINDING_VALUE (t
);
5962 else if ((flags
& LOOKUP_PREFER_TYPES
)
5963 && qualify_lookup (BINDING_TYPE (t
), flags
))
5964 binding
= BINDING_TYPE (t
);
5966 binding
= NULL_TREE
;
5968 /* Handle access control on types from enclosing or base classes. */
5969 if (binding
&& ! yylex
5970 && BINDING_LEVEL (t
) && BINDING_LEVEL (t
)->parm_flag
== 2)
5971 type_access_control (BINDING_LEVEL (t
)->this_class
, binding
);
5974 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5976 if (val_is_implicit_typename
&& !yylex
)
5977 warn_about_implicit_typename_lookup (val
, binding
);
5979 val_is_implicit_typename
5980 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5981 if (!val_is_implicit_typename
)
5986 /* Now lookup in namespace scopes. */
5987 if (!val
|| val_is_implicit_typename
)
5989 t
= unqualified_namespace_lookup (name
, flags
, 0);
5992 if (val_is_implicit_typename
&& !yylex
)
5993 warn_about_implicit_typename_lookup (val
, t
);
6001 /* This should only warn about types used in qualified-ids. */
6002 if (from_obj
&& from_obj
!= val
)
6004 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
6005 && TREE_CODE (val
) == TYPE_DECL
6006 && ! same_type_p (TREE_TYPE (from_obj
), TREE_TYPE (val
)))
6008 lookup of `%D' in the scope of `%#T' (`%#D') \
6009 does not match lookup in the current scope (`%#D')",
6010 name
, got_object
, from_obj
, val
);
6012 /* We don't change val to from_obj if got_object depends on
6013 template parms because that breaks implicit typename for
6014 destructor calls. */
6015 if (! uses_template_parms (got_object
))
6019 /* If we have a single function from a using decl, pull it out. */
6020 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
6021 val
= OVL_FUNCTION (val
);
6030 lookup_name_nonclass (name
)
6033 return lookup_name_real (name
, 0, 1, 0);
6037 lookup_function_nonclass (name
, args
)
6041 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
6045 lookup_name_namespace_only (name
)
6048 /* type-or-namespace, nonclass, namespace_only */
6049 return lookup_name_real (name
, 1, 1, 1);
6053 lookup_name (name
, prefer_type
)
6057 return lookup_name_real (name
, prefer_type
, 0, 0);
6060 /* Similar to `lookup_name' but look only in the innermost non-class
6064 lookup_name_current_level (name
)
6067 struct binding_level
*b
;
6070 b
= current_binding_level
;
6071 while (b
->parm_flag
== 2)
6076 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
6078 /* extern "C" function() */
6079 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
6082 else if (IDENTIFIER_BINDING (name
)
6083 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
6087 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
6088 return IDENTIFIER_VALUE (name
);
6100 /* Like lookup_name_current_level, but for types. */
6103 lookup_type_current_level (name
)
6106 register tree t
= NULL_TREE
;
6108 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
6110 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
6111 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
6113 struct binding_level
*b
= current_binding_level
;
6116 if (purpose_member (name
, b
->type_shadowed
))
6117 return REAL_IDENTIFIER_TYPE_VALUE (name
);
6129 begin_only_namespace_names ()
6131 only_namespace_names
= 1;
6135 end_only_namespace_names ()
6137 only_namespace_names
= 0;
6140 /* Push the declarations of builtin types into the namespace.
6141 RID_INDEX is the index of the builtin type
6142 in the array RID_POINTERS. NAME is the name used when looking
6143 up the builtin type. TYPE is the _TYPE node for the builtin type. */
6146 record_builtin_type (rid_index
, name
, type
)
6151 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
6152 tree tdecl
= NULL_TREE
;
6154 if ((int) rid_index
< (int) RID_MAX
)
6155 rname
= ridpointers
[(int) rid_index
];
6157 tname
= get_identifier (name
);
6159 TYPE_BUILT_IN (type
) = 1;
6163 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
6164 set_identifier_type_value (tname
, NULL_TREE
);
6165 if ((int) rid_index
< (int) RID_MAX
)
6166 /* Built-in types live in the global namespace. */
6167 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
6169 if (rname
!= NULL_TREE
)
6171 if (tname
!= NULL_TREE
)
6173 set_identifier_type_value (rname
, NULL_TREE
);
6174 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
6178 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
6179 set_identifier_type_value (rname
, NULL_TREE
);
6184 /* Record one of the standard Java types.
6185 * Declare it as having the given NAME.
6186 * If SIZE > 0, it is the size of one of the integral types;
6187 * otherwise it is the negative of the size of one of the other types. */
6190 record_builtin_java_type (name
, size
)
6196 type
= make_signed_type (size
);
6197 else if (size
> -32)
6198 { /* "__java_char" or ""__java_boolean". */
6199 type
= make_unsigned_type (-size
);
6200 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
6203 { /* "__java_float" or ""__java_double". */
6204 type
= make_node (REAL_TYPE
);
6205 TYPE_PRECISION (type
) = - size
;
6208 record_builtin_type (RID_MAX
, name
, type
);
6209 decl
= TYPE_NAME (type
);
6211 /* Suppress generate debug symbol entries for these types,
6212 since for normal C++ they are just clutter.
6213 However, push_lang_context undoes this if extern "Java" is seen. */
6214 DECL_IGNORED_P (decl
) = 1;
6216 TYPE_FOR_JAVA (type
) = 1;
6220 /* Push a type into the namespace so that the back-ends ignore it. */
6223 record_unknown_type (type
, name
)
6227 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
6228 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
6229 DECL_IGNORED_P (decl
) = 1;
6230 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
6231 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
6232 TYPE_ALIGN (type
) = 1;
6233 TYPE_USER_ALIGN (type
) = 0;
6234 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
6237 /* An string for which we should create an IDENTIFIER_NODE at
6240 typedef struct predefined_identifier
6242 /* The name of the identifier. */
6244 /* The place where the IDENTIFIER_NODE should be stored. */
6246 /* Non-zero if this is the name of a constructor or destructor. */
6248 } predefined_identifier
;
6250 /* Create all the predefined identifiers. */
6253 initialize_predefined_identifiers ()
6255 struct predefined_identifier
*pid
;
6257 /* A table of identifiers to create at startup. */
6258 static predefined_identifier predefined_identifiers
[] = {
6259 { "C++", &lang_name_cplusplus
, 0 },
6260 { "C", &lang_name_c
, 0 },
6261 { "Java", &lang_name_java
, 0 },
6262 { CTOR_NAME
, &ctor_identifier
, 1 },
6263 { "__base_ctor", &base_ctor_identifier
, 1 },
6264 { "__comp_ctor", &complete_ctor_identifier
, 1 },
6265 { DTOR_NAME
, &dtor_identifier
, 1 },
6266 { "__comp_dtor", &complete_dtor_identifier
, 1 },
6267 { "__base_dtor", &base_dtor_identifier
, 1 },
6268 { "__deleting_dtor", &deleting_dtor_identifier
, 1 },
6269 { VTABLE_DELTA2_NAME
, &delta2_identifier
, 0 },
6270 { VTABLE_DELTA_NAME
, &delta_identifier
, 0 },
6271 { IN_CHARGE_NAME
, &in_charge_identifier
, 0 },
6272 { VTABLE_INDEX_NAME
, &index_identifier
, 0 },
6273 { "nelts", &nelts_identifier
, 0 },
6274 { THIS_NAME
, &this_identifier
, 0 },
6275 { VTABLE_PFN_NAME
, &pfn_identifier
, 0 },
6276 { "__pfn_or_delta2", &pfn_or_delta2_identifier
, 0 },
6277 { "_vptr", &vptr_identifier
, 0 },
6278 { "__cp_push_exception", &cp_push_exception_identifier
, 0 },
6279 { "__vtt_parm", &vtt_parm_identifier
, 0 },
6280 { "std", &std_identifier
, 0 },
6284 for (pid
= predefined_identifiers
; pid
->name
; ++pid
)
6286 *pid
->node
= get_identifier (pid
->name
);
6287 if (pid
->ctor_or_dtor_p
)
6288 IDENTIFIER_CTOR_OR_DTOR_P (*pid
->node
) = 1;
6292 /* Create the predefined scalar types of C,
6293 and some nodes representing standard constants (0, 1, (void *)0).
6294 Initialize the global binding level.
6295 Make definitions for built-in primitive functions. */
6298 init_decl_processing ()
6302 /* Check to see that the user did not specify an invalid combination
6303 of command-line options. */
6304 if (!flag_vtable_thunks
)
6305 error ("the ABI requires vtable thunks");
6307 /* Create all the identifiers we need. */
6308 initialize_predefined_identifiers ();
6310 /* Fill in back-end hooks. */
6311 init_lang_status
= &push_cp_function_context
;
6312 free_lang_status
= &pop_cp_function_context
;
6313 mark_lang_status
= &mark_cp_function_context
;
6314 lang_safe_from_p
= &c_safe_from_p
;
6315 lang_dump_tree
= &cp_dump_tree
;
6316 lang_missing_noreturn_ok_p
= &cp_missing_noreturn_ok_p
;
6322 /* Create the global variables. */
6323 push_to_top_level ();
6325 /* Enter the global namespace. */
6326 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
6327 push_namespace (get_identifier ("::"));
6328 global_namespace
= current_namespace
;
6329 current_lang_name
= NULL_TREE
;
6331 /* Adjust various flags based on command-line settings. */
6332 if (! flag_permissive
&& ! pedantic
)
6333 flag_pedantic_errors
= 1;
6334 if (!flag_no_inline
)
6335 flag_inline_trees
= 1;
6338 current_lang_name
= lang_name_c
;
6340 current_function_decl
= NULL_TREE
;
6341 current_binding_level
= NULL_BINDING_LEVEL
;
6342 free_binding_level
= NULL_BINDING_LEVEL
;
6344 build_common_tree_nodes (flag_signed_char
);
6346 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6347 TREE_TYPE (error_mark_list
) = error_mark_node
;
6349 /* Make the binding_level structure for global names. */
6351 global_binding_level
= current_binding_level
;
6352 /* The global level is the namespace level of ::. */
6353 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6354 declare_namespace_level ();
6356 /* Create the `std' namespace. */
6359 push_namespace (std_identifier
);
6360 std_node
= current_namespace
;
6362 fake_std_node
= error_mark_node
;
6366 fake_std_node
= build_decl (NAMESPACE_DECL
,
6369 pushdecl (fake_std_node
);
6372 c_common_nodes_and_builtins ();
6374 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6375 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6376 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6377 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6378 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6379 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6380 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6381 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6383 integer_two_node
= build_int_2 (2, 0);
6384 TREE_TYPE (integer_two_node
) = integer_type_node
;
6385 integer_three_node
= build_int_2 (3, 0);
6386 TREE_TYPE (integer_three_node
) = integer_type_node
;
6388 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6389 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6390 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6391 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6392 TYPE_PRECISION (boolean_type_node
) = 1;
6393 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6394 boolean_false_node
= build_int_2 (0, 0);
6395 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6396 boolean_true_node
= build_int_2 (1, 0);
6397 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6399 signed_size_zero_node
= build_int_2 (0, 0);
6400 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6402 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6405 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
6408 delta_type_node
= ptrdiff_type_node
;
6409 vtable_index_type
= ptrdiff_type_node
;
6411 vtt_parm_type
= build_pointer_type (const_ptr_type_node
);
6412 lang_type_promotes_to
= convert_type_from_ellipsis
;
6415 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6417 /* C++ extensions */
6419 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6420 record_unknown_type (unknown_type_node
, "unknown type");
6422 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6423 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6425 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6427 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6429 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6430 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6432 if (flag_vtable_thunks
)
6434 /* Make sure we get a unique function type, so we can give
6435 its pointer type a name. (This wins for gdb.) */
6436 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6437 TREE_TYPE (vfunc_type
) = integer_type_node
;
6438 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6439 layout_type (vfunc_type
);
6441 vtable_entry_type
= build_pointer_type (vfunc_type
);
6445 vtable_entry_type
= make_aggr_type (RECORD_TYPE
);
6446 fields
[0] = build_decl (FIELD_DECL
, delta_identifier
,
6448 fields
[1] = build_decl (FIELD_DECL
, index_identifier
,
6450 fields
[2] = build_decl (FIELD_DECL
, pfn_identifier
,
6452 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6455 /* Make this part of an invisible union. */
6456 fields
[3] = copy_node (fields
[2]);
6457 TREE_TYPE (fields
[3]) = delta_type_node
;
6458 DECL_NAME (fields
[3]) = delta2_identifier
;
6459 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6460 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6461 DECL_SIZE_UNIT (fields
[3]) = TYPE_SIZE_UNIT (delta_type_node
);
6462 TREE_UNSIGNED (fields
[3]) = 0;
6463 TREE_CHAIN (fields
[2]) = fields
[3];
6464 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6467 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6470 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6471 layout_type (vtbl_type_node
);
6472 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6473 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6474 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6475 layout_type (vtbl_ptr_type_node
);
6476 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6478 push_namespace (get_identifier ("__cxxabiv1"));
6479 abi_node
= current_namespace
;
6482 global_type_node
= make_node (LANG_TYPE
);
6483 record_unknown_type (global_type_node
, "global type");
6486 current_lang_name
= lang_name_cplusplus
;
6489 tree bad_alloc_type_node
, newtype
, deltype
;
6491 push_namespace (std_identifier
);
6492 bad_alloc_type_node
= xref_tag
6493 (class_type_node
, get_identifier ("bad_alloc"), 1);
6496 newtype
= build_exception_variant
6497 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6498 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6499 push_cp_library_fn (NEW_EXPR
, newtype
);
6500 push_cp_library_fn (VEC_NEW_EXPR
, newtype
);
6501 global_delete_fndecl
= push_cp_library_fn (DELETE_EXPR
, deltype
);
6502 push_cp_library_fn (VEC_DELETE_EXPR
, deltype
);
6506 = build_library_fn_ptr ("__cxa_pure_virtual", void_ftype
);
6508 /* Perform other language dependent initializations. */
6509 init_class_processing ();
6510 init_init_processing ();
6511 init_search_processing ();
6512 init_rtti_processing ();
6514 if (flag_exceptions
)
6515 init_exception_processing ();
6518 flag_inline_functions
= 0;
6521 if (! supports_one_only ())
6524 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6525 function_id_node
= get_identifier ("__FUNCTION__");
6526 pretty_function_id_node
= get_identifier ("__PRETTY_FUNCTION__");
6527 func_id_node
= get_identifier ("__func__");
6529 make_fname_decl
= cp_make_fname_decl
;
6530 declare_function_name ();
6532 /* Prepare to check format strings against argument lists. */
6533 init_function_format_info ();
6535 /* Show we use EH for cleanups. */
6536 using_eh_for_cleanups ();
6538 valid_lang_attribute
= cp_valid_lang_attribute
;
6540 /* Maintain consistency. Perhaps we should just complain if they
6541 say -fwritable-strings? */
6542 if (flag_writable_strings
)
6543 flag_const_strings
= 0;
6545 /* Add GC roots for all of our global variables. */
6546 ggc_add_tree_root (c_global_trees
, sizeof c_global_trees
/ sizeof(tree
));
6547 ggc_add_tree_root (cp_global_trees
, sizeof cp_global_trees
/ sizeof(tree
));
6548 ggc_add_tree_root (&integer_three_node
, 1);
6549 ggc_add_tree_root (&integer_two_node
, 1);
6550 ggc_add_tree_root (&signed_size_zero_node
, 1);
6551 ggc_add_tree_root (&size_one_node
, 1);
6552 ggc_add_tree_root (&size_zero_node
, 1);
6553 ggc_add_root (&global_binding_level
, 1, sizeof global_binding_level
,
6554 mark_binding_level
);
6555 ggc_add_root (&scope_chain
, 1, sizeof scope_chain
, &mark_saved_scope
);
6556 ggc_add_tree_root (&static_ctors
, 1);
6557 ggc_add_tree_root (&static_dtors
, 1);
6558 ggc_add_tree_root (&lastiddecl
, 1);
6560 ggc_add_tree_root (&last_function_parm_tags
, 1);
6561 ggc_add_tree_root (¤t_function_return_value
, 1);
6562 ggc_add_tree_root (¤t_function_parm_tags
, 1);
6563 ggc_add_tree_root (&last_function_parms
, 1);
6564 ggc_add_tree_root (&error_mark_list
, 1);
6566 ggc_add_tree_root (&global_namespace
, 1);
6567 ggc_add_tree_root (&global_type_node
, 1);
6568 ggc_add_tree_root (&anonymous_namespace_name
, 1);
6570 ggc_add_tree_root (&got_object
, 1);
6571 ggc_add_tree_root (&got_scope
, 1);
6573 ggc_add_tree_root (¤t_lang_name
, 1);
6574 ggc_add_tree_root (&static_aggregates
, 1);
6575 ggc_add_tree_root (&free_bindings
, 1);
6578 /* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the
6579 decl, NAME is the initialization string and TYPE_DEP indicates whether
6580 NAME depended on the type of the function. We make use of that to detect
6581 __PRETTY_FUNCTION__ inside a template fn. Because we build a tree for
6582 the function before emitting any of it, we don't need to treat the
6583 VAR_DECL specially. We can decide whether to emit it later, if it was
6587 cp_make_fname_decl (id
, name
, type_dep
)
6592 tree decl
, type
, init
;
6593 size_t length
= strlen (name
);
6594 tree domain
= NULL_TREE
;
6596 if (!processing_template_decl
)
6599 domain
= build_index_type (size_int (length
));
6601 type
= build_cplus_array_type
6602 (build_qualified_type (char_type_node
, TYPE_QUAL_CONST
),
6605 decl
= build_decl (VAR_DECL
, id
, type
);
6606 TREE_STATIC (decl
) = 1;
6607 TREE_READONLY (decl
) = 1;
6608 DECL_SOURCE_LINE (decl
) = 0;
6609 DECL_ARTIFICIAL (decl
) = 1;
6610 DECL_IN_SYSTEM_HEADER (decl
) = 1;
6612 if (processing_template_decl
)
6613 decl
= push_template_decl (decl
);
6616 init
= build (FUNCTION_NAME
, type
);
6617 DECL_PRETTY_FUNCTION_P (decl
) = 1;
6621 init
= build_string (length
+ 1, name
);
6622 TREE_TYPE (init
) = type
;
6624 DECL_INITIAL (decl
) = init
;
6625 cp_finish_decl (decl
, init
, NULL_TREE
, LOOKUP_ONLYCONVERTING
);
6627 /* We will have to make sure we only emit this, if it is actually used. */
6631 /* Entry point for the benefit of c_common_nodes_and_builtins.
6633 Make a definition for a builtin function named NAME and whose data type
6634 is TYPE. TYPE should be a function type with argument types.
6636 CLASS and CODE tell later passes how to compile calls to this function.
6637 See tree.h for possible values.
6639 If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6640 the name to be called if we can't opencode the function. */
6643 builtin_function (name
, type
, code
, class, libname
)
6647 enum built_in_class
class;
6648 const char *libname
;
6650 tree decl
= build_library_fn_1 (get_identifier (name
), ERROR_MARK
, type
);
6651 DECL_BUILT_IN_CLASS (decl
) = class;
6652 DECL_FUNCTION_CODE (decl
) = code
;
6654 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6656 /* All builtins that don't begin with an `_' should go in the `std'
6658 if (flag_honor_std
&& name
[0] != '_')
6660 push_namespace (std_identifier
);
6661 DECL_CONTEXT (decl
) = std_node
;
6664 if (flag_honor_std
&& name
[0] != '_')
6667 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6668 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6669 function in the namespace. */
6671 DECL_ASSEMBLER_NAME (decl
) = get_identifier (libname
);
6672 make_decl_rtl (decl
, NULL
);
6674 /* Warn if a function in the namespace for users
6675 is used without an occasion to consider it declared. */
6676 if (name
[0] != '_' || name
[1] != '_')
6677 DECL_ANTICIPATED (decl
) = 1;
6682 /* Generate a FUNCTION_DECL with the typical flags for a runtime library
6683 function. Not called directly. */
6686 build_library_fn_1 (name
, operator_code
, type
)
6688 enum tree_code operator_code
;
6691 tree fn
= build_lang_decl (FUNCTION_DECL
, name
, type
);
6692 DECL_EXTERNAL (fn
) = 1;
6693 TREE_PUBLIC (fn
) = 1;
6694 DECL_ARTIFICIAL (fn
) = 1;
6695 TREE_NOTHROW (fn
) = 1;
6696 SET_OVERLOADED_OPERATOR_CODE (fn
, operator_code
);
6700 /* Returns the _DECL for a library function with C linkage.
6701 We assume that such functions never throw; if this is incorrect,
6702 callers should unset TREE_NOTHROW. */
6705 build_library_fn (name
, type
)
6709 tree fn
= build_library_fn_1 (name
, ERROR_MARK
, type
);
6710 make_decl_rtl (fn
, NULL
);
6714 /* Returns the _DECL for a library function with C++ linkage. */
6717 build_cp_library_fn (name
, operator_code
, type
)
6719 enum tree_code operator_code
;
6722 tree fn
= build_library_fn_1 (name
, operator_code
, type
);
6723 TREE_NOTHROW (fn
) = TYPE_NOTHROW_P (type
);
6724 DECL_CONTEXT (fn
) = FROB_CONTEXT (current_namespace
);
6725 set_mangled_name_for_decl (fn
);
6726 make_decl_rtl (fn
, NULL
);
6730 /* Like build_library_fn, but takes a C string instead of an
6734 build_library_fn_ptr (name
, type
)
6738 return build_library_fn (get_identifier (name
), type
);
6741 /* Like build_cp_library_fn, but takes a C string instead of an
6745 build_cp_library_fn_ptr (name
, type
)
6749 return build_cp_library_fn (get_identifier (name
), ERROR_MARK
, type
);
6752 /* Like build_library_fn, but also pushes the function so that we will
6753 be able to find it via IDENTIFIER_GLOBAL_VALUE. */
6756 push_library_fn (name
, type
)
6759 tree fn
= build_library_fn (name
, type
);
6760 pushdecl_top_level (fn
);
6764 /* Like build_cp_library_fn, but also pushes the function so that it
6765 will be found by normal lookup. */
6768 push_cp_library_fn (operator_code
, type
)
6769 enum tree_code operator_code
;
6772 tree fn
= build_cp_library_fn (ansi_opname (operator_code
),
6779 /* Like push_library_fn, but takes a TREE_LIST of parm types rather than
6783 push_void_library_fn (name
, parmtypes
)
6784 tree name
, parmtypes
;
6786 tree type
= build_function_type (void_type_node
, parmtypes
);
6787 return push_library_fn (name
, type
);
6790 /* Like push_library_fn, but also note that this function throws
6791 and does not return. Used for __throw_foo and the like. */
6794 push_throw_library_fn (name
, type
)
6797 tree fn
= push_library_fn (name
, type
);
6798 TREE_THIS_VOLATILE (fn
) = 1;
6799 TREE_NOTHROW (fn
) = 0;
6803 /* When we call finish_struct for an anonymous union, we create
6804 default copy constructors and such. But, an anonymous union
6805 shouldn't have such things; this function undoes the damage to the
6806 anonymous union type T.
6808 (The reason that we create the synthesized methods is that we don't
6809 distinguish `union { int i; }' from `typedef union { int i; } U'.
6810 The first is an anonymous union; the second is just an ordinary
6814 fixup_anonymous_aggr (t
)
6819 /* Wipe out memory of synthesized methods */
6820 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6821 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6822 TYPE_HAS_INIT_REF (t
) = 0;
6823 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6824 TYPE_HAS_ASSIGN_REF (t
) = 0;
6825 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6827 /* Splice the implicitly generated functions out of the TYPE_METHODS
6829 q
= &TYPE_METHODS (t
);
6832 if (DECL_ARTIFICIAL (*q
))
6833 *q
= TREE_CHAIN (*q
);
6835 q
= &TREE_CHAIN (*q
);
6838 /* ISO C++ 9.5.3. Anonymous unions may not have function members. */
6839 if (TYPE_METHODS (t
))
6840 cp_error_at ("an anonymous union cannot have function members", t
);
6843 /* Make sure that a declaration with no declarator is well-formed, i.e.
6844 just defines a tagged type or anonymous union.
6846 Returns the type defined, if any. */
6849 check_tag_decl (declspecs
)
6854 int saw_typedef
= 0;
6855 tree ob_modifier
= NULL_TREE
;
6857 register tree t
= NULL_TREE
;
6859 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6861 register tree value
= TREE_VALUE (link
);
6864 || TREE_CODE (value
) == TYPE_DECL
6865 || (TREE_CODE (value
) == IDENTIFIER_NODE
6866 && IDENTIFIER_GLOBAL_VALUE (value
)
6867 && TREE_CODE (IDENTIFIER_GLOBAL_VALUE (value
)) == TYPE_DECL
))
6871 if (found_type
== 2 && TREE_CODE (value
) == IDENTIFIER_NODE
)
6873 if (! in_system_header
)
6874 cp_pedwarn ("redeclaration of C++ built-in type `%T'", value
);
6879 && ((TREE_CODE (value
) != TYPENAME_TYPE
&& IS_AGGR_TYPE (value
))
6880 || TREE_CODE (value
) == ENUMERAL_TYPE
))
6882 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6886 else if (value
== ridpointers
[(int) RID_TYPEDEF
])
6888 else if (value
== ridpointers
[(int) RID_FRIEND
])
6890 if (current_class_type
== NULL_TREE
6891 || current_scope () != current_class_type
)
6892 ob_modifier
= value
;
6896 else if (value
== ridpointers
[(int) RID_STATIC
]
6897 || value
== ridpointers
[(int) RID_EXTERN
]
6898 || value
== ridpointers
[(int) RID_AUTO
]
6899 || value
== ridpointers
[(int) RID_REGISTER
]
6900 || value
== ridpointers
[(int) RID_INLINE
]
6901 || value
== ridpointers
[(int) RID_VIRTUAL
]
6902 || value
== ridpointers
[(int) RID_CONST
]
6903 || value
== ridpointers
[(int) RID_VOLATILE
]
6904 || value
== ridpointers
[(int) RID_EXPLICIT
])
6905 ob_modifier
= value
;
6909 error ("multiple types in one declaration");
6911 if (t
== NULL_TREE
&& ! saw_friend
)
6912 pedwarn ("declaration does not declare anything");
6914 /* Check for an anonymous union. We're careful
6915 accessing TYPE_IDENTIFIER because some built-in types, like
6916 pointer-to-member types, do not have TYPE_NAME. */
6917 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
6919 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
6921 /* 7/3 In a simple-declaration, the optional init-declarator-list
6922 can be omitted only when declaring a class (clause 9) or
6923 enumeration (7.2), that is, when the decl-specifier-seq contains
6924 either a class-specifier, an elaborated-type-specifier with
6925 a class-key (9.1), or an enum-specifier. In these cases and
6926 whenever a class-specifier or enum-specifier is present in the
6927 decl-specifier-seq, the identifiers in these specifiers are among
6928 the names being declared by the declaration (as class-name,
6929 enum-names, or enumerators, depending on the syntax). In such
6930 cases, and except for the declaration of an unnamed bit-field (9.6),
6931 the decl-specifier-seq shall introduce one or more names into the
6932 program, or shall redeclare a name introduced by a previous
6933 declaration. [Example:
6934 enum { }; // ill-formed
6935 typedef class { }; // ill-formed
6939 error ("Missing type-name in typedef-declaration.");
6942 /* Anonymous unions are objects, so they can have specifiers. */;
6943 SET_ANON_AGGR_TYPE_P (t
);
6945 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
6946 pedwarn ("ISO C++ prohibits anonymous structs");
6949 else if (ob_modifier
)
6951 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
6952 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
6953 cp_error ("`%D' can only be specified for functions", ob_modifier
);
6954 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
6955 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
6956 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
6957 cp_error ("`%D' can only be specified for constructors",
6960 cp_error ("`%D' can only be specified for objects and functions",
6967 /* Called when a declaration is seen that contains no names to declare.
6968 If its type is a reference to a structure, union or enum inherited
6969 from a containing scope, shadow that tag name for the current scope
6970 with a forward reference.
6971 If its type defines a new named structure or union
6972 or defines an enum, it is valid but we need not do anything here.
6973 Otherwise, it is an error.
6975 C++: may have to grok the declspecs to learn about static,
6976 complain for anonymous unions. */
6979 shadow_tag (declspecs
)
6982 tree t
= check_tag_decl (declspecs
);
6985 maybe_process_partial_specialization (t
);
6987 /* This is where the variables in an anonymous union are
6988 declared. An anonymous union declaration looks like:
6990 because there is no declarator after the union, the parser
6991 sends that declaration here. */
6992 if (t
&& ANON_AGGR_TYPE_P (t
))
6994 fixup_anonymous_aggr (t
);
6996 if (TYPE_FIELDS (t
))
6998 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
7000 finish_anon_union (decl
);
7005 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
7008 groktypename (typename
)
7011 if (TREE_CODE (typename
) != TREE_LIST
)
7013 return grokdeclarator (TREE_VALUE (typename
),
7014 TREE_PURPOSE (typename
),
7015 TYPENAME
, 0, NULL_TREE
);
7018 /* Decode a declarator in an ordinary declaration or data definition.
7019 This is called as soon as the type information and variable name
7020 have been parsed, before parsing the initializer if any.
7021 Here we create the ..._DECL node, fill in its type,
7022 and put it on the list of decls for the current context.
7023 The ..._DECL node is returned as the value.
7025 Exception: for arrays where the length is not specified,
7026 the type is left null, to be filled in by `cp_finish_decl'.
7028 Function definitions do not come here; they go to start_function
7029 instead. However, external and forward declarations of functions
7030 do go through here. Structure field declarations are done by
7031 grokfield and not through here. */
7034 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
7035 tree declarator
, declspecs
;
7037 tree attributes
, prefix_attributes
;
7040 register tree type
, tem
;
7042 extern int have_extern_spec
;
7043 extern int used_extern_spec
;
7047 /* See code below that used this. */
7048 int init_written
= initialized
;
7051 /* This should only be done once on the top most decl. */
7052 if (have_extern_spec
&& !used_extern_spec
)
7054 declspecs
= tree_cons (NULL_TREE
, get_identifier ("extern"),
7056 used_extern_spec
= 1;
7059 if (attributes
|| prefix_attributes
)
7060 attrlist
= build_tree_list (attributes
, prefix_attributes
);
7062 attrlist
= NULL_TREE
;
7064 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
7067 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
7070 type
= TREE_TYPE (decl
);
7072 if (type
== error_mark_node
)
7075 context
= DECL_CONTEXT (decl
);
7077 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
7078 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
7080 /* When parsing the initializer, lookup should use the object's
7082 push_decl_namespace (context
);
7085 /* We are only interested in class contexts, later. */
7086 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
7087 context
= NULL_TREE
;
7090 /* Is it valid for this decl to have an initializer at all?
7091 If not, set INITIALIZED to zero, which will indirectly
7092 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7093 switch (TREE_CODE (decl
))
7096 /* typedef foo = bar means give foo the same type as bar.
7097 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
7098 Any other case of an initialization in a TYPE_DECL is an error. */
7099 if (pedantic
|| list_length (declspecs
) > 1)
7101 cp_error ("typedef `%D' is initialized", decl
);
7107 cp_error ("function `%#D' is initialized like a variable", decl
);
7117 if (! toplevel_bindings_p ()
7118 && DECL_EXTERNAL (decl
))
7119 cp_warning ("declaration of `%#D' has `extern' and is initialized",
7121 DECL_EXTERNAL (decl
) = 0;
7122 if (toplevel_bindings_p ())
7123 TREE_STATIC (decl
) = 1;
7125 /* Tell `pushdecl' this is an initialized decl
7126 even though we don't yet have the initializer expression.
7127 Also tell `cp_finish_decl' it may store the real initializer. */
7128 DECL_INITIAL (decl
) = error_mark_node
;
7131 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
7132 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
7135 /* Set attributes here so if duplicate decl, will have proper attributes. */
7136 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
7138 if (context
&& COMPLETE_TYPE_P (complete_type (context
)))
7140 push_nested_class (context
, 2);
7142 if (TREE_CODE (decl
) == VAR_DECL
)
7144 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
7145 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
7146 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
7149 if (DECL_CONTEXT (field
) != context
)
7151 cp_pedwarn ("ISO C++ does not permit `%T::%D' to be defined as `%T::%D'",
7152 DECL_CONTEXT (field
), DECL_NAME (decl
),
7153 context
, DECL_NAME (decl
));
7154 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
7156 /* Static data member are tricky; an in-class initialization
7157 still doesn't provide a definition, so the in-class
7158 declaration will have DECL_EXTERNAL set, but will have an
7159 initialization. Thus, duplicate_decls won't warn
7160 about this situation, and so we check here. */
7161 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
7162 cp_error ("duplicate initialization of %D", decl
);
7163 if (duplicate_decls (decl
, field
))
7169 tree field
= check_classfn (context
, decl
);
7170 if (field
&& duplicate_decls (decl
, field
))
7174 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
7175 DECL_IN_AGGR_P (decl
) = 0;
7176 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
7177 || CLASSTYPE_TEMPLATE_INSTANTIATION (context
))
7179 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
7180 /* [temp.expl.spec] An explicit specialization of a static data
7181 member of a template is a definition if the declaration
7182 includes an initializer; otherwise, it is a declaration.
7184 We check for processing_specialization so this only applies
7185 to the new specialization syntax. */
7186 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
7187 DECL_EXTERNAL (decl
) = 1;
7190 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
7191 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
7195 /* Enter this declaration into the symbol table. */
7196 tem
= maybe_push_decl (decl
);
7198 if (processing_template_decl
)
7199 tem
= push_template_decl (tem
);
7201 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7202 /* Tell the back-end to use or not use .common as appropriate. If we say
7203 -fconserve-space, we want this to save .data space, at the expense of
7204 wrong semantics. If we say -fno-conserve-space, we want this to
7205 produce errors about redefs; to do this we force variables into the
7207 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
7210 if (! processing_template_decl
)
7220 tree type
= TREE_TYPE (decl
);
7221 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
7223 if (type
== error_mark_node
)
7226 maybe_push_cleanup_level (type
);
7229 /* Is it valid for this decl to have an initializer at all?
7230 If not, set INITIALIZED to zero, which will indirectly
7231 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7233 /* Don't allow initializations for incomplete types except for
7234 arrays which might be completed by the initialization. */
7235 if (COMPLETE_TYPE_P (complete_type (type
)))
7236 ; /* A complete type is ok. */
7237 else if (TREE_CODE (type
) != ARRAY_TYPE
)
7239 cp_error ("variable `%#D' has initializer but incomplete type",
7242 type
= TREE_TYPE (decl
) = error_mark_node
;
7244 else if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (type
))))
7246 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
7247 cp_error ("elements of array `%#D' have incomplete type", decl
);
7248 /* else we already gave an error in start_decl. */
7254 && TREE_CODE (decl
) != TYPE_DECL
7255 && TREE_CODE (decl
) != TEMPLATE_DECL
7256 && type
!= error_mark_node
7257 && IS_AGGR_TYPE (type
)
7258 && ! DECL_EXTERNAL (decl
))
7260 if ((! processing_template_decl
|| ! uses_template_parms (type
))
7261 && !COMPLETE_TYPE_P (complete_type (type
)))
7263 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
7265 /* Change the type so that assemble_variable will give
7266 DECL an rtl we can live with: (mem (const_int 0)). */
7267 type
= TREE_TYPE (decl
) = error_mark_node
;
7271 /* If any base type in the hierarchy of TYPE needs a constructor,
7272 then we set initialized to 1. This way any nodes which are
7273 created for the purposes of initializing this aggregate
7274 will live as long as it does. This is necessary for global
7275 aggregates which do not have their initializers processed until
7276 the end of the file. */
7277 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
7282 DECL_INITIAL (decl
) = NULL_TREE
;
7285 /* Handle initialization of references.
7286 These three arguments are from `cp_finish_decl', and have the
7287 same meaning here that they do there.
7289 Quotes on semantics can be found in ARM 8.4.3. */
7292 grok_reference_init (decl
, type
, init
)
7293 tree decl
, type
, init
;
7297 if (init
== NULL_TREE
)
7299 if ((DECL_LANG_SPECIFIC (decl
) == 0
7300 || DECL_IN_AGGR_P (decl
) == 0)
7301 && ! DECL_THIS_EXTERN (decl
))
7302 cp_error ("`%D' declared as reference but not initialized", decl
);
7306 if (init
== error_mark_node
)
7309 if (TREE_CODE (init
) == CONSTRUCTOR
)
7311 cp_error ("ISO C++ forbids use of initializer list to initialize reference `%D'", decl
);
7315 if (TREE_CODE (init
) == TREE_LIST
)
7316 init
= build_compound_expr (init
);
7318 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
7319 init
= convert_from_reference (init
);
7321 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
7322 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
7324 /* Note: default conversion is only called in very special cases. */
7325 init
= default_conversion (init
);
7328 /* Convert INIT to the reference type TYPE. This may involve the
7329 creation of a temporary, whose lifetime must be the same as that
7330 of the reference. If so, a DECL_STMT for the temporary will be
7331 added just after the DECL_STMT for DECL. That's why we don't set
7332 DECL_INITIAL for local references (instead assigning to them
7333 explicitly); we need to allow the temporary to be initialized
7335 tmp
= convert_to_reference
7336 (type
, init
, CONV_IMPLICIT
,
7337 LOOKUP_ONLYCONVERTING
|LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
,
7340 if (tmp
== error_mark_node
)
7342 else if (tmp
!= NULL_TREE
)
7345 tmp
= save_expr (tmp
);
7346 if (building_stmt_tree ())
7348 /* Initialize the declaration. */
7349 tmp
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, tmp
);
7350 finish_expr_stmt (tmp
);
7353 DECL_INITIAL (decl
) = tmp
;
7357 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7361 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
7363 expand_static_init (decl
, DECL_INITIAL (decl
));
7364 DECL_INITIAL (decl
) = NULL_TREE
;
7369 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7370 mucking with forces it does not comprehend (i.e. initialization with a
7371 constructor). If we are at global scope and won't go into COMMON, fill
7372 it in with a dummy CONSTRUCTOR to force the variable into .data;
7373 otherwise we can use error_mark_node. */
7376 obscure_complex_init (decl
, init
)
7379 if (! flag_no_inline
&& TREE_STATIC (decl
))
7381 if (extract_init (decl
, init
))
7385 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7386 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7387 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7391 DECL_INITIAL (decl
) = error_mark_node
;
7396 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7397 array until we finish parsing the initializer. If that's the
7398 situation we're in, update DECL accordingly. */
7401 maybe_deduce_size_from_array_init (decl
, init
)
7405 tree type
= TREE_TYPE (decl
);
7407 if (TREE_CODE (type
) == ARRAY_TYPE
7408 && TYPE_DOMAIN (type
) == NULL_TREE
7409 && TREE_CODE (decl
) != TYPE_DECL
)
7411 /* do_default is really a C-ism to deal with tentative definitions.
7412 But let's leave it here to ease the eventual merge. */
7413 int do_default
= !DECL_EXTERNAL (decl
);
7414 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7415 int failure
= complete_array_type (type
, initializer
, do_default
);
7418 cp_error ("initializer fails to determine size of `%D'", decl
);
7423 cp_error ("array size missing in `%D'", decl
);
7424 /* If a `static' var's size isn't known, make it extern as
7425 well as static, so it does not get allocated. If it's not
7426 `static', then don't mark it extern; finish_incomplete_decl
7427 will give it a default size and it will get allocated. */
7428 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7429 DECL_EXTERNAL (decl
) = 1;
7432 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7433 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7435 cp_error ("zero-size array `%D'", decl
);
7437 layout_decl (decl
, 0);
7441 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7442 any appropriate error messages regarding the layout. */
7445 layout_var_decl (decl
)
7448 tree type
= TREE_TYPE (decl
);
7450 tree ttype
= target_type (type
);
7453 /* If we haven't already layed out this declaration, do so now.
7454 Note that we must not call complete type for an external object
7455 because it's type might involve templates that we are not
7456 supposed to isntantiate yet. (And it's perfectly legal to say
7457 `extern X x' for some incomplete type `X'.) */
7458 if (!DECL_EXTERNAL (decl
))
7459 complete_type (type
);
7460 if (!DECL_SIZE (decl
) && COMPLETE_TYPE_P (type
))
7461 layout_decl (decl
, 0);
7463 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7465 /* An automatic variable with an incomplete type: that is an error.
7466 Don't talk about array types here, since we took care of that
7467 message in grokdeclarator. */
7468 cp_error ("storage size of `%D' isn't known", decl
);
7469 TREE_TYPE (decl
) = error_mark_node
;
7472 /* Keep this code around in case we later want to control debug info
7473 based on whether a type is "used". (jason 1999-11-11) */
7475 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7476 /* Let debugger know it should output info for this type. */
7477 note_debug_info_needed (ttype
);
7479 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7480 note_debug_info_needed (DECL_CONTEXT (decl
));
7483 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7484 && DECL_SIZE (decl
) != NULL_TREE
7485 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7487 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7488 constant_expression_warning (DECL_SIZE (decl
));
7490 cp_error ("storage size of `%D' isn't constant", decl
);
7494 /* If a local static variable is declared in an inline function, or if
7495 we have a weak definition, we must endeavor to create only one
7496 instance of the variable at link-time. */
7499 maybe_commonize_var (decl
)
7502 /* Static data in a function with comdat linkage also has comdat
7504 if (TREE_STATIC (decl
)
7505 /* Don't mess with __FUNCTION__. */
7506 && ! DECL_ARTIFICIAL (decl
)
7507 && current_function_decl
7508 && DECL_CONTEXT (decl
) == current_function_decl
7509 && (DECL_THIS_INLINE (current_function_decl
)
7510 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7511 && TREE_PUBLIC (current_function_decl
))
7513 /* Rather than try to get this right with inlining, we suppress
7514 inlining of such functions. */
7515 current_function_cannot_inline
7516 = "function with static variable cannot be inline";
7517 DECL_UNINLINABLE (current_function_decl
) = 1;
7519 /* If flag_weak, we don't need to mess with this, as we can just
7520 make the function weak, and let it refer to its unique local
7521 copy. This works because we don't allow the function to be
7525 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7527 TREE_PUBLIC (decl
) = 1;
7528 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7530 else if (DECL_INITIAL (decl
) == NULL_TREE
7531 || DECL_INITIAL (decl
) == error_mark_node
)
7533 TREE_PUBLIC (decl
) = 1;
7534 DECL_COMMON (decl
) = 1;
7536 /* else we lose. We can only do this if we can use common,
7537 which we can't if it has been initialized. */
7539 if (TREE_PUBLIC (decl
))
7540 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
7543 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7544 cp_warning_at (" you can work around this by removing the initializer", decl
);
7548 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7549 /* Set it up again; we might have set DECL_INITIAL since the last
7551 comdat_linkage (decl
);
7554 /* Issue an error message if DECL is an uninitialized const variable. */
7557 check_for_uninitialized_const_var (decl
)
7560 tree type
= TREE_TYPE (decl
);
7562 /* ``Unless explicitly declared extern, a const object does not have
7563 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7565 if (TREE_CODE (decl
) == VAR_DECL
7566 && TREE_CODE (type
) != REFERENCE_TYPE
7567 && CP_TYPE_CONST_P (type
)
7568 && !TYPE_NEEDS_CONSTRUCTING (type
)
7569 && !DECL_INITIAL (decl
))
7570 cp_error ("uninitialized const `%D'", decl
);
7573 /* Verify INIT (the initializer for DECL), and record the
7574 initialization in DECL_INITIAL, if appropriate. Returns a new
7578 check_initializer (decl
, init
)
7584 if (TREE_CODE (decl
) == FIELD_DECL
)
7587 type
= TREE_TYPE (decl
);
7589 /* If `start_decl' didn't like having an initialization, ignore it now. */
7590 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7593 /* Check the initializer. */
7596 /* Things that are going to be initialized need to have complete
7598 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7600 if (type
== error_mark_node
)
7601 /* We will have already complained. */
7603 else if (COMPLETE_TYPE_P (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7605 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7608 else if (TREE_CODE (type
) == ARRAY_TYPE
7609 && !COMPLETE_TYPE_P (TREE_TYPE (type
)))
7611 cp_error ("elements of array `%#D' have incomplete type", decl
);
7614 else if (!COMPLETE_TYPE_P (type
))
7616 cp_error ("`%D' has incomplete type", decl
);
7617 TREE_TYPE (decl
) = error_mark_node
;
7622 if (TREE_CODE (decl
) == CONST_DECL
)
7624 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7626 DECL_INITIAL (decl
) = init
;
7628 my_friendly_assert (init
!= NULL_TREE
, 149);
7631 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7633 if (TREE_STATIC (decl
))
7634 make_decl_rtl (decl
, NULL_PTR
);
7635 grok_reference_init (decl
, type
, init
);
7640 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7642 if (TREE_CODE (type
) == ARRAY_TYPE
)
7643 init
= digest_init (type
, init
, (tree
*) 0);
7644 else if (TREE_CODE (init
) == CONSTRUCTOR
7645 && TREE_HAS_CONSTRUCTOR (init
))
7647 if (TYPE_NON_AGGREGATE_CLASS (type
))
7649 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7651 init
= error_mark_node
;
7654 goto dont_use_constructor
;
7659 dont_use_constructor
:
7660 if (TREE_CODE (init
) != TREE_VEC
)
7661 init
= store_init_value (decl
, init
);
7665 /* We must hide the initializer so that expand_decl
7666 won't try to do something it does not understand. */
7667 init
= obscure_complex_init (decl
, init
);
7669 else if (DECL_EXTERNAL (decl
))
7671 else if (TYPE_P (type
)
7672 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7674 tree core_type
= strip_array_types (type
);
7676 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7678 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7679 cp_error ("structure `%D' with uninitialized const members", decl
);
7680 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7681 cp_error ("structure `%D' with uninitialized reference members",
7685 check_for_uninitialized_const_var (decl
);
7687 if (COMPLETE_TYPE_P (type
) && TYPE_NEEDS_CONSTRUCTING (type
))
7688 init
= obscure_complex_init (decl
, NULL_TREE
);
7692 check_for_uninitialized_const_var (decl
);
7697 /* If DECL is not a local variable, give it RTL. */
7700 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
7703 const char *asmspec
;
7705 int toplev
= toplevel_bindings_p ();
7708 /* Handle non-variables up front. */
7709 if (TREE_CODE (decl
) != VAR_DECL
)
7711 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7715 /* If we see a class member here, it should be a static data
7717 if (DECL_LANG_SPECIFIC (decl
) && DECL_IN_AGGR_P (decl
))
7719 my_friendly_assert (TREE_STATIC (decl
), 19990828);
7720 /* An in-class declaration of a static data member should be
7721 external; it is only a declaration, and not a definition. */
7722 if (init
== NULL_TREE
)
7723 my_friendly_assert (DECL_EXTERNAL (decl
), 20000723);
7726 /* Set the DECL_ASSEMBLER_NAME for the variable. */
7728 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7730 /* We don't create any RTL for local variables. */
7731 if (DECL_FUNCTION_SCOPE_P (decl
) && !TREE_STATIC (decl
))
7734 /* We defer emission of local statics until the corresponding
7735 DECL_STMT is expanded. */
7736 defer_p
= DECL_FUNCTION_SCOPE_P (decl
) || DECL_VIRTUAL_P (decl
);
7738 /* We try to defer namespace-scope static constants so that they are
7739 not emitted into the object file unncessarily. */
7740 if (!DECL_VIRTUAL_P (decl
)
7741 && TREE_READONLY (decl
)
7742 && DECL_INITIAL (decl
) != NULL_TREE
7743 && DECL_INITIAL (decl
) != error_mark_node
7744 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
))
7746 && !TREE_PUBLIC (decl
))
7748 /* Fool with the linkage according to #pragma interface. */
7749 if (!interface_unknown
)
7751 TREE_PUBLIC (decl
) = 1;
7752 DECL_EXTERNAL (decl
) = interface_only
;
7758 /* If we're deferring the variable, just make RTL. Do not actually
7759 emit the variable. */
7761 make_decl_rtl (decl
, asmspec
);
7762 /* If we're not deferring, go ahead and assemble the variable. */
7764 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7767 /* The old ARM scoping rules injected variables declared in the
7768 initialization statement of a for-statement into the surrounding
7769 scope. We support this usage, in order to be backward-compatible.
7770 DECL is a just-declared VAR_DECL; if necessary inject its
7771 declaration into the surrounding scope. */
7774 maybe_inject_for_scope_var (decl
)
7777 if (!DECL_NAME (decl
))
7780 if (current_binding_level
->is_for_scope
)
7782 struct binding_level
*outer
7783 = current_binding_level
->level_chain
;
7785 /* Check to see if the same name is already bound at the outer
7786 level, either because it was directly declared, or because a
7787 dead for-decl got preserved. In either case, the code would
7788 not have been valid under the ARM scope rules, so clear
7789 is_for_scope for the current_binding_level.
7791 Otherwise, we need to preserve the temp slot for decl to last
7792 into the outer binding level. */
7795 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7797 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7798 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7800 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7802 BINDING_VALUE (outer_binding
)
7803 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7804 current_binding_level
->is_for_scope
= 0;
7806 else if (DECL_IN_MEMORY_P (decl
))
7807 preserve_temp_slots (DECL_RTL (decl
));
7811 /* Generate code to initialize DECL (a local variable). */
7814 initialize_local_var (decl
, init
, flags
)
7819 tree type
= TREE_TYPE (decl
);
7821 /* If the type is bogus, don't bother initializing the variable. */
7822 if (type
== error_mark_node
)
7825 if (DECL_SIZE (decl
) == NULL_TREE
&& !TREE_STATIC (decl
))
7827 /* If we used it already as memory, it must stay in memory. */
7828 DECL_INITIAL (decl
) = NULL_TREE
;
7829 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7832 /* Local statics are handled differently from ordinary automatic
7834 if (TREE_STATIC (decl
))
7836 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7837 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7838 expand_static_init (decl
, init
);
7842 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7846 /* Compute and store the initial value. */
7847 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7849 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7851 int saved_stmts_are_full_exprs_p
;
7853 my_friendly_assert (building_stmt_tree (), 20000906);
7854 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p ();
7855 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
7856 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7857 current_stmt_tree ()->stmts_are_full_exprs_p
=
7858 saved_stmts_are_full_exprs_p
;
7861 /* Set this to 0 so we can tell whether an aggregate which was
7862 initialized was ever used. Don't do this if it has a
7863 destructor, so we don't complain about the 'resource
7864 allocation is initialization' idiom. Now set
7865 attribute((unused)) on types so decls of that type will be
7866 marked used. (see TREE_USED, above.) */
7867 if (TYPE_NEEDS_CONSTRUCTING (type
)
7869 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type
)
7870 && DECL_NAME (decl
))
7871 TREE_USED (decl
) = 0;
7872 else if (already_used
)
7873 TREE_USED (decl
) = 1;
7877 /* Generate code to destroy DECL (a local variable). */
7880 destroy_local_var (decl
)
7883 tree type
= TREE_TYPE (decl
);
7886 /* Only variables get cleaned up. */
7887 if (TREE_CODE (decl
) != VAR_DECL
)
7890 /* And only things with destructors need cleaning up. */
7891 if (type
== error_mark_node
7892 || TYPE_HAS_TRIVIAL_DESTRUCTOR (type
))
7895 if (TREE_CODE (decl
) == VAR_DECL
&&
7896 (DECL_EXTERNAL (decl
) || TREE_STATIC (decl
)))
7897 /* We don't clean up things that aren't defined in this
7898 translation unit, or that need a static cleanup. The latter
7899 are handled by finish_file. */
7902 /* Compute the cleanup. */
7903 cleanup
= maybe_build_cleanup (decl
);
7905 /* Record the cleanup required for this declaration. */
7906 if (DECL_SIZE (decl
) && TREE_TYPE (decl
) != error_mark_node
7908 finish_decl_cleanup (decl
, cleanup
);
7911 /* Finish processing of a declaration;
7912 install its line number and initial value.
7913 If the length of an array type is not known before,
7914 it must be determined now, from the initial value, or it is an error.
7916 INIT holds the value of an initializer that should be allowed to escape
7919 FLAGS is LOOKUP_ONLYCONVERTING if the = init syntax was used, else 0
7920 if the (init) syntax was used. */
7923 cp_finish_decl (decl
, init
, asmspec_tree
, flags
)
7929 tree ttype
= NULL_TREE
;
7930 const char *asmspec
= NULL
;
7931 int was_readonly
= 0;
7936 error ("assignment (not initialization) in declaration");
7940 /* If a name was specified, get the string. */
7942 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
7944 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
7946 cp_error ("cannot initialize `%D' to namespace `%D'",
7951 if (current_class_type
7952 && CP_DECL_CONTEXT (decl
) == current_class_type
7953 && TYPE_BEING_DEFINED (current_class_type
)
7954 && (DECL_INITIAL (decl
) || init
))
7955 DECL_INITIALIZED_IN_CLASS_P (decl
) = 1;
7957 if (TREE_CODE (decl
) == VAR_DECL
7958 && DECL_CONTEXT (decl
)
7959 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7960 && DECL_CONTEXT (decl
) != current_namespace
7963 /* Leave the namespace of the object. */
7964 pop_decl_namespace ();
7967 type
= TREE_TYPE (decl
);
7969 if (type
== error_mark_node
)
7972 /* Add this declaration to the statement-tree. */
7973 if (building_stmt_tree ()
7974 && at_function_scope_p ()
7975 && TREE_CODE (decl
) != RESULT_DECL
)
7976 add_decl_stmt (decl
);
7978 if (TYPE_HAS_MUTABLE_P (type
))
7979 TREE_READONLY (decl
) = 0;
7981 if (processing_template_decl
)
7983 if (init
&& DECL_INITIAL (decl
))
7984 DECL_INITIAL (decl
) = init
;
7988 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
7989 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
7991 /* Take care of TYPE_DECLs up front. */
7992 if (TREE_CODE (decl
) == TYPE_DECL
)
7994 if (init
&& DECL_INITIAL (decl
))
7996 /* typedef foo = bar; store the type of bar as the type of foo. */
7997 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
7998 DECL_INITIAL (decl
) = init
= NULL_TREE
;
8000 if (type
!= error_mark_node
8001 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
8003 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
8004 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
8005 set_identifier_type_value (DECL_NAME (decl
), type
);
8006 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
8008 GNU_xref_decl (current_function_decl
, decl
);
8010 /* If we have installed this as the canonical typedef for this
8011 type, and that type has not been defined yet, delay emitting
8012 the debug information for it, as we will emit it later. */
8013 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
8014 && !COMPLETE_TYPE_P (TREE_TYPE (decl
)))
8015 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
8017 rest_of_decl_compilation (decl
, NULL_PTR
,
8018 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
8022 if (TREE_CODE (decl
) != FUNCTION_DECL
)
8023 ttype
= target_type (type
);
8025 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
8026 && TYPE_NEEDS_CONSTRUCTING (type
))
8028 /* Currently, GNU C++ puts constants in text space, making them
8029 impossible to initialize. In the future, one would hope for
8030 an operating system which understood the difference between
8031 initialization and the running of a program. */
8033 TREE_READONLY (decl
) = 0;
8036 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
8038 /* This must override the asm specifier which was placed by
8039 grokclassfn. Lay this out fresh. */
8040 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
8041 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
8042 make_decl_rtl (decl
, asmspec
);
8045 /* Deduce size of array from initialization, if not already known. */
8046 maybe_deduce_size_from_array_init (decl
, init
);
8047 init
= check_initializer (decl
, init
);
8049 GNU_xref_decl (current_function_decl
, decl
);
8051 if (TREE_CODE (decl
) == VAR_DECL
)
8052 layout_var_decl (decl
);
8054 /* Output the assembler code and/or RTL code for variables and functions,
8055 unless the type is an undefined structure or union.
8056 If not, it will get done when the type is completed. */
8057 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
8058 || TREE_CODE (decl
) == RESULT_DECL
)
8060 if (TREE_CODE (decl
) == VAR_DECL
)
8061 maybe_commonize_var (decl
);
8063 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
8065 if (TREE_CODE (type
) == FUNCTION_TYPE
8066 || TREE_CODE (type
) == METHOD_TYPE
)
8067 abstract_virtuals_error (decl
,
8068 strip_array_types (TREE_TYPE (type
)));
8070 abstract_virtuals_error (decl
, strip_array_types (type
));
8072 if (TREE_CODE (decl
) == FUNCTION_DECL
)
8074 else if (DECL_EXTERNAL (decl
)
8075 && ! (DECL_LANG_SPECIFIC (decl
)
8076 && DECL_NOT_REALLY_EXTERN (decl
)))
8079 DECL_INITIAL (decl
) = init
;
8081 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
8083 /* This is a local declaration. */
8084 if (doing_semantic_analysis_p ())
8085 maybe_inject_for_scope_var (decl
);
8086 /* Initialize the local variable. But, if we're building a
8087 statement-tree, we'll do the initialization when we
8089 if (processing_template_decl
)
8091 if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
8092 DECL_INITIAL (decl
) = init
;
8096 /* If we're not building RTL, then we need to do so
8098 my_friendly_assert (building_stmt_tree (), 20000906);
8099 /* Initialize the variable. */
8100 initialize_local_var (decl
, init
, flags
);
8101 /* Clean up the variable. */
8102 destroy_local_var (decl
);
8105 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
8107 /* Cleanups for static variables are handled by `finish_file'. */
8108 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
8109 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
8110 expand_static_init (decl
, init
);
8114 /* Undo call to `pushclass' that was done in `start_decl'
8115 due to initialization of qualified member variable.
8116 I.e., Foo::x = 10; */
8118 tree context
= CP_DECL_CONTEXT (decl
);
8121 && (TREE_CODE (decl
) == VAR_DECL
8122 /* We also have a pushclass done that we need to undo here
8123 if we're at top level and declare a method. */
8124 || TREE_CODE (decl
) == FUNCTION_DECL
)
8125 /* If size hasn't been set, we're still defining it,
8126 and therefore inside the class body; don't pop
8127 the binding level.. */
8128 && COMPLETE_TYPE_P (context
)
8129 && context
== current_class_type
)
8130 pop_nested_class ();
8137 TREE_READONLY (decl
) = 1;
8140 /* This is here for a midend callback from c-common.c */
8143 finish_decl (decl
, init
, asmspec_tree
)
8147 cp_finish_decl (decl
, init
, asmspec_tree
, 0);
8150 /* Returns a declaration for a VAR_DECL as if:
8152 extern "C" TYPE NAME;
8154 had been seen. Used to create compiler-generated global
8158 declare_global_var (name
, type
)
8164 push_to_top_level ();
8165 decl
= build_decl (VAR_DECL
, name
, type
);
8166 TREE_PUBLIC (decl
) = 1;
8167 DECL_EXTERNAL (decl
) = 1;
8168 DECL_ARTIFICIAL (decl
) = 1;
8170 cp_finish_decl (decl
, NULL_TREE
, NULL_TREE
, 0);
8171 pop_from_top_level ();
8176 /* Returns a pointer to the `atexit' function. Note that if
8177 FLAG_USE_CXA_ATEXIT is non-zero, then this will actually be the new
8178 `__cxa_atexit' function specified in the IA64 C++ ABI. */
8192 if (flag_use_cxa_atexit
)
8194 /* The declaration for `__cxa_atexit' is:
8196 int __cxa_atexit (void (*)(void *), void *, void *)
8198 We build up the argument types and then then function type
8201 /* First, build the pointer-to-function type for the first
8203 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8204 fn_type
= build_function_type (void_type_node
, arg_types
);
8205 fn_ptr_type
= build_pointer_type (fn_type
);
8206 /* Then, build the rest of the argument types. */
8207 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8208 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, arg_types
);
8209 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, arg_types
);
8210 /* And the final __cxa_atexit type. */
8211 fn_type
= build_function_type (integer_type_node
, arg_types
);
8212 fn_ptr_type
= build_pointer_type (fn_type
);
8213 name
= "__cxa_atexit";
8217 /* The declaration for `atexit' is:
8219 int atexit (void (*)());
8221 We build up the argument types and then then function type
8223 fn_type
= build_function_type (void_type_node
, void_list_node
);
8224 fn_ptr_type
= build_pointer_type (fn_type
);
8225 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, void_list_node
);
8226 /* Build the final atexit type. */
8227 fn_type
= build_function_type (integer_type_node
, arg_types
);
8231 /* Now, build the function declaration. */
8232 push_lang_context (lang_name_c
);
8233 atexit_fndecl
= build_library_fn_ptr (name
, fn_type
);
8234 mark_used (atexit_fndecl
);
8235 pop_lang_context ();
8236 atexit_node
= default_conversion (atexit_fndecl
);
8241 /* Returns the __dso_handle VAR_DECL. */
8244 get_dso_handle_node ()
8246 if (dso_handle_node
)
8247 return dso_handle_node
;
8249 /* Declare the variable. */
8250 dso_handle_node
= declare_global_var (get_identifier ("__dso_handle"),
8253 return dso_handle_node
;
8256 /* Begin a new function with internal linkage whose job will be simply
8257 to destroy some particular variable. */
8262 static int counter
= 0;
8263 int old_interface_unknown
= interface_unknown
;
8269 push_to_top_level ();
8271 /* No need to mangle this. */
8272 push_lang_context (lang_name_c
);
8274 interface_unknown
= 1;
8276 /* Build the parameter-types. */
8277 parmtypes
= void_list_node
;
8278 /* Functions passed to __cxa_atexit take an additional parameter.
8279 We'll just ignore it. After we implement the new calling
8280 convention for destructors, we can eliminate the use of
8281 additional cleanup functions entirely in the -fnew-abi case. */
8282 if (flag_use_cxa_atexit
)
8283 parmtypes
= tree_cons (NULL_TREE
, ptr_type_node
, parmtypes
);
8284 /* Build the function type itself. */
8285 fntype
= build_function_type (void_type_node
, parmtypes
);
8286 /* Build the name of the function. */
8287 sprintf (name
, "__tcf_%d", counter
++);
8288 /* Build the function declaration. */
8289 fndecl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), fntype
);
8290 /* It's a function with internal linkage, generated by the
8292 TREE_PUBLIC (fndecl
) = 0;
8293 DECL_ARTIFICIAL (fndecl
) = 1;
8294 /* Make the function `inline' so that it is only emitted if it is
8295 actually needed. It is unlikely that it will be inlined, since
8296 it is only called via a function pointer, but we avoid unncessary
8297 emissions this way. */
8298 DECL_INLINE (fndecl
) = 1;
8299 /* Build the parameter. */
8300 if (flag_use_cxa_atexit
)
8304 parmdecl
= build_decl (PARM_DECL
, NULL_TREE
, ptr_type_node
);
8305 DECL_CONTEXT (parmdecl
) = fndecl
;
8306 DECL_ARG_TYPE (parmdecl
) = ptr_type_node
;
8307 TREE_USED (parmdecl
) = 1;
8308 DECL_ARGUMENTS (fndecl
) = parmdecl
;
8312 start_function (/*specs=*/NULL_TREE
, fndecl
, NULL_TREE
, SF_PRE_PARSED
);
8315 interface_unknown
= old_interface_unknown
;
8317 pop_lang_context ();
8319 return current_function_decl
;
8322 /* Finish the cleanup function begun by start_cleanup_fn. */
8329 expand_body (finish_function (0));
8331 pop_from_top_level ();
8334 /* Generate code to handle the destruction of DECL, an object with
8335 static storage duration. */
8338 register_dtor_fn (decl
)
8346 int saved_flag_access_control
;
8348 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl
)))
8351 /* Call build_cleanup before we enter the anonymous function so that
8352 any access checks will be done relative to the current scope,
8353 rather than the scope of the anonymous function. */
8354 build_cleanup (decl
);
8356 /* Now start the function. */
8357 cleanup
= start_cleanup_fn ();
8359 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
8360 to the original function, rather than the anonymous one. That
8361 will make the back-end think that nested functions are in use,
8362 which causes confusion. */
8363 saved_flag_access_control
= flag_access_control
;
8364 flag_access_control
= 0;
8365 fcall
= build_cleanup (decl
);
8366 flag_access_control
= saved_flag_access_control
;
8368 /* Create the body of the anonymous function. */
8369 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
8370 finish_expr_stmt (fcall
);
8371 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
8374 /* Call atexit with the cleanup function. */
8375 mark_addressable (cleanup
);
8376 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
8377 if (flag_use_cxa_atexit
)
8379 args
= tree_cons (NULL_TREE
, get_dso_handle_node (), NULL_TREE
);
8380 args
= tree_cons (NULL_TREE
, null_pointer_node
, args
);
8381 args
= tree_cons (NULL_TREE
, cleanup
, args
);
8384 args
= tree_cons (NULL_TREE
, cleanup
, NULL_TREE
);
8385 finish_expr_stmt (build_function_call (get_atexit_node (), args
));
8389 expand_static_init (decl
, init
)
8393 tree oldstatic
= value_member (decl
, static_aggregates
);
8397 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
8398 cp_error ("multiple initializations given for `%D'", decl
);
8400 else if (! toplevel_bindings_p ())
8402 /* Emit code to perform this initialization but once. */
8409 /* Emit code to perform this initialization but once. This code
8412 static int guard = 0;
8414 // Do initialization.
8416 // Register variable for destruction at end of program.
8419 Note that the `temp' variable is only set to 1 *after* the
8420 initialization is complete. This ensures that an exception,
8421 thrown during the construction, will cause the variable to
8422 reinitialized when we pass through this code again, as per:
8426 If the initialization exits by throwing an exception, the
8427 initialization is not complete, so it will be tried again
8428 the next time control enters the declaration.
8430 In theory, this process should be thread-safe, too; multiple
8431 threads should not be able to initialize the variable more
8432 than once. We don't yet attempt to ensure thread-safety. */
8434 /* Create the guard variable. */
8435 guard
= get_guard (decl
);
8437 /* Begin the conditional initialization. */
8438 if_stmt
= begin_if_stmt ();
8439 finish_if_stmt_cond (get_guard_cond (guard
), if_stmt
);
8440 then_clause
= begin_compound_stmt (/*has_no_scope=*/0);
8442 /* Do the initialization itself. */
8443 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
8444 || (init
&& TREE_CODE (init
) == TREE_LIST
))
8445 assignment
= build_aggr_init (decl
, init
, 0);
8447 /* The initialization we're doing here is just a bitwise
8449 assignment
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
8451 assignment
= NULL_TREE
;
8453 /* Once the assignment is complete, set TEMP to 1. Since the
8454 construction of the static object is complete at this point,
8455 we want to make sure TEMP is set to 1 even if a temporary
8456 constructed during the initialization throws an exception
8457 when it is destroyed. So, we combine the initialization and
8458 the assignment to TEMP into a single expression, ensuring
8459 that when we call finish_expr_stmt the cleanups will not be
8460 run until after TEMP is set to 1. */
8461 guard_init
= set_guard (guard
);
8464 assignment
= tree_cons (NULL_TREE
, assignment
,
8465 build_tree_list (NULL_TREE
,
8467 assignment
= build_compound_expr (assignment
);
8470 assignment
= guard_init
;
8471 finish_expr_stmt (assignment
);
8473 /* Use atexit to register a function for destroying this static
8475 register_dtor_fn (decl
);
8477 finish_compound_stmt (/*has_no_scope=*/0, then_clause
);
8478 finish_then_clause (if_stmt
);
8482 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8485 /* Finish the declaration of a catch-parameter. */
8488 start_handler_parms (declspecs
, declarator
)
8495 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8497 if (decl
== NULL_TREE
)
8498 error ("invalid catch parameter");
8507 /* Make TYPE a complete type based on INITIAL_VALUE.
8508 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8509 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8512 complete_array_type (type
, initial_value
, do_default
)
8513 tree type
, initial_value
;
8516 register tree maxindex
= NULL_TREE
;
8521 /* An array of character type can be initialized from a
8522 brace-enclosed string constant. */
8523 if (char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (type
)))
8524 && TREE_CODE (initial_value
) == CONSTRUCTOR
8525 && CONSTRUCTOR_ELTS (initial_value
)
8526 && (TREE_CODE (TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
)))
8528 && TREE_CHAIN (CONSTRUCTOR_ELTS (initial_value
)) == NULL_TREE
)
8529 initial_value
= TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
));
8531 /* Note MAXINDEX is really the maximum index, one less than the
8533 if (TREE_CODE (initial_value
) == STRING_CST
)
8536 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8537 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8540 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8542 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8544 maxindex
= ssize_int (-1);
8545 for (; elts
; elts
= TREE_CHAIN (elts
))
8547 if (TREE_PURPOSE (elts
))
8548 maxindex
= TREE_PURPOSE (elts
);
8550 maxindex
= size_binop (PLUS_EXPR
, maxindex
, ssize_int (1));
8552 maxindex
= copy_node (maxindex
);
8556 /* Make an error message unless that happened already. */
8557 if (initial_value
!= error_mark_node
)
8560 initial_value
= NULL_TREE
;
8562 /* Prevent further error messages. */
8563 maxindex
= build_int_2 (0, 0);
8570 maxindex
= build_int_2 (0, 0);
8579 domain
= build_index_type (maxindex
);
8580 TYPE_DOMAIN (type
) = domain
;
8582 if (! TREE_TYPE (maxindex
))
8583 TREE_TYPE (maxindex
) = domain
;
8585 itype
= TREE_TYPE (initial_value
);
8588 if (itype
&& !TYPE_DOMAIN (itype
))
8589 TYPE_DOMAIN (itype
) = domain
;
8590 /* The type of the main variant should never be used for arrays
8591 of different sizes. It should only ever be completed with the
8592 size of the array. */
8593 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8594 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8597 /* Lay out the type now that we can get the real answer. */
8604 /* Return zero if something is declared to be a member of type
8605 CTYPE when in the context of CUR_TYPE. STRING is the error
8606 message to print in that case. Otherwise, quietly return 1. */
8609 member_function_or_else (ctype
, cur_type
, flags
)
8610 tree ctype
, cur_type
;
8611 enum overload_flags flags
;
8613 if (ctype
&& ctype
!= cur_type
)
8615 if (flags
== DTOR_FLAG
)
8616 cp_error ("destructor for alien class `%T' cannot be a member",
8619 cp_error ("constructor for alien class `%T' cannot be a member",
8626 /* Subroutine of `grokdeclarator'. */
8628 /* Generate errors possibly applicable for a given set of specifiers.
8629 This is for ARM $7.1.2. */
8632 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8635 int virtualp
, quals
, friendp
, raises
, inlinep
;
8638 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8640 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8642 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8645 cp_error_at ("`%D' declared as a friend", object
);
8646 if (raises
&& !TYPE_PTRFN_P (TREE_TYPE (object
))
8647 && !TYPE_PTRMEMFUNC_P (TREE_TYPE (object
)))
8648 cp_error_at ("`%D' declared with an exception specification", object
);
8651 /* CTYPE is class type, or null if non-class.
8652 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8654 DECLARATOR is the function's name.
8655 VIRTUALP is truthvalue of whether the function is virtual or not.
8656 FLAGS are to be passed through to `grokclassfn'.
8657 QUALS are qualifiers indicating whether the function is `const'
8659 RAISES is a list of exceptions that this function can raise.
8660 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8661 not look, and -1 if we should not call `grokclassfn' at all.
8663 Returns `NULL_TREE' if something goes wrong, after issuing
8664 applicable error messages. */
8667 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8668 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8669 template_count
, in_namespace
)
8672 tree orig_declarator
;
8674 enum overload_flags flags
;
8676 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8680 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8681 int has_default_arg
= 0;
8685 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8686 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8692 type
= build_exception_variant (type
, raises
);
8695 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8696 /* Propagate volatile out from type to decl. */
8697 if (TYPE_VOLATILE (type
))
8698 TREE_THIS_VOLATILE (decl
) = 1;
8700 /* If this decl has namespace scope, set that up. */
8702 set_decl_namespace (decl
, in_namespace
, friendp
);
8704 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8706 /* `main' and builtins have implicit 'C' linkage. */
8707 if ((MAIN_NAME_P (declarator
)
8708 || (IDENTIFIER_LENGTH (declarator
) > 10
8709 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8710 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8711 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8712 && current_lang_name
== lang_name_cplusplus
8713 && ctype
== NULL_TREE
8714 /* NULL_TREE means global namespace. */
8715 && DECL_CONTEXT (decl
) == NULL_TREE
)
8716 DECL_LANGUAGE (decl
) = lang_c
;
8718 /* Should probably propagate const out from type to decl I bet (mrs). */
8721 DECL_STATIC_FUNCTION_P (decl
) = 1;
8722 DECL_CONTEXT (decl
) = ctype
;
8726 DECL_CONTEXT (decl
) = ctype
;
8728 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8730 if (processing_template_decl
)
8731 error ("cannot declare `::main' to be a template");
8733 error ("cannot declare `::main' to be inline");
8735 error ("cannot declare `::main' to be static");
8736 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
8738 error ("`main' must return `int'");
8743 /* Members of anonymous types and local classes have no linkage; make
8745 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8746 || decl_function_context (TYPE_MAIN_DECL (ctype
))))
8751 /* [basic.link]: A name with no linkage (notably, the name of a class
8752 or enumeration declared in a local scope) shall not be used to
8753 declare an entity with linkage.
8755 Only check this for public decls for now. */
8756 t
= no_linkage_check (TREE_TYPE (decl
));
8759 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8761 if (DECL_EXTERN_C_P (decl
))
8762 /* Allow this; it's pretty common in C. */;
8764 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8768 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8773 TREE_PUBLIC (decl
) = publicp
;
8776 DECL_INTERFACE_KNOWN (decl
) = 1;
8777 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8781 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8783 DECL_EXTERNAL (decl
) = 1;
8784 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8786 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8787 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8791 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8792 grok_op_properties (decl
, virtualp
, check
< 0);
8794 if (ctype
&& decl_function_context (decl
))
8795 DECL_NO_STATIC_CHAIN (decl
) = 1;
8797 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8798 if (TREE_PURPOSE (t
)
8799 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8801 has_default_arg
= 1;
8806 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8810 ("defining explicit specialization `%D' in friend declaration",
8814 tree fns
= TREE_OPERAND (orig_declarator
, 0);
8815 tree args
= TREE_OPERAND (orig_declarator
, 1);
8817 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8819 /* Something like `template <class T> friend void f<T>()'. */
8820 cp_error ("invalid use of template-id `%D' in declaration of primary template",
8826 /* A friend declaration of the form friend void f<>(). Record
8827 the information in the TEMPLATE_ID_EXPR. */
8828 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8830 if (TREE_CODE (fns
) == COMPONENT_REF
)
8832 /* Due to bison parser ickiness, we will have already looked
8833 up an operator_name or PFUNCNAME within the current class
8834 (see template_id in parse.y). If the current class contains
8835 such a name, we'll get a COMPONENT_REF here. Undo that. */
8837 my_friendly_assert (TREE_TYPE (TREE_OPERAND (fns
, 0))
8838 == current_class_type
, 20001120);
8839 fns
= TREE_OPERAND (fns
, 1);
8841 my_friendly_assert (TREE_CODE (fns
) == IDENTIFIER_NODE
8842 || TREE_CODE (fns
) == LOOKUP_EXPR
8843 || TREE_CODE (fns
) == OVERLOAD
, 20001120);
8844 DECL_TEMPLATE_INFO (decl
) = tree_cons (fns
, args
, NULL_TREE
);
8846 if (has_default_arg
)
8848 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8855 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8862 if (has_default_arg
)
8863 add_defarg_fn (decl
);
8865 /* Plain overloading: will not be grok'd by grokclassfn. */
8866 if (! ctype
&& ! processing_template_decl
8867 && (! DECL_EXTERN_C_P (decl
) || DECL_OVERLOADED_OPERATOR_P (decl
))
8868 && ! DECL_USE_TEMPLATE (decl
))
8869 set_mangled_name_for_decl (decl
);
8872 /* Make the init_value nonzero so pushdecl knows this is not
8873 tentative. error_mark_node is replaced later with the BLOCK. */
8874 DECL_INITIAL (decl
) = error_mark_node
;
8876 if (TYPE_NOTHROW_P (type
) || nothrow_libfn_p (decl
))
8877 TREE_NOTHROW (decl
) = 1;
8879 /* Caller will do the rest of this. */
8883 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8884 DECL_CONSTRUCTOR_P (decl
) = 1;
8886 /* Function gets the ugly name, field gets the nice one. This call
8887 may change the type of the function (because of default
8889 if (ctype
!= NULL_TREE
)
8890 grokclassfn (ctype
, decl
, flags
, quals
);
8892 decl
= check_explicit_specialization (orig_declarator
, decl
,
8894 2 * (funcdef_flag
!= 0) +
8895 4 * (friendp
!= 0));
8896 if (decl
== error_mark_node
)
8899 if (ctype
!= NULL_TREE
8900 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8905 old_decl
= check_classfn (ctype
, decl
);
8907 if (old_decl
&& TREE_CODE (old_decl
) == TEMPLATE_DECL
)
8908 /* Because grokfndecl is always supposed to return a
8909 FUNCTION_DECL, we pull out the DECL_TEMPLATE_RESULT
8910 here. We depend on our callers to figure out that its
8911 really a template that's being returned. */
8912 old_decl
= DECL_TEMPLATE_RESULT (old_decl
);
8914 if (old_decl
&& DECL_STATIC_FUNCTION_P (old_decl
)
8915 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8917 /* Remove the `this' parm added by grokclassfn.
8918 XXX Isn't this done in start_function, too? */
8919 revert_static_member_fn (decl
);
8920 last_function_parms
= TREE_CHAIN (last_function_parms
);
8922 if (old_decl
&& DECL_ARTIFICIAL (old_decl
))
8923 cp_error ("definition of implicitly-declared `%D'", old_decl
);
8927 /* Since we've smashed OLD_DECL to its
8928 DECL_TEMPLATE_RESULT, we must do the same to DECL. */
8929 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
8930 decl
= DECL_TEMPLATE_RESULT (decl
);
8932 /* Attempt to merge the declarations. This can fail, in
8933 the case of some illegal specialization declarations. */
8934 if (!duplicate_decls (decl
, old_decl
))
8935 cp_error ("no `%#D' member function declared in class `%T'",
8941 if (DECL_CONSTRUCTOR_P (decl
) && !grok_ctor_properties (ctype
, decl
))
8944 if (ctype
== NULL_TREE
|| check
)
8948 DECL_VIRTUAL_P (decl
) = 1;
8954 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
8957 RID_BIT_TYPE
*specbits_in
;
8963 RID_BIT_TYPE specbits
;
8965 specbits
= *specbits_in
;
8967 if (TREE_CODE (type
) == OFFSET_TYPE
)
8969 /* If you declare a static member so that it
8970 can be initialized, the code will reach here. */
8971 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
8972 type
= TREE_TYPE (type
);
8973 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8974 DECL_CONTEXT (decl
) = basetype
;
8975 /* DECL_ASSEMBLER_NAME is needed only for full-instantiated
8977 if (!uses_template_parms (decl
))
8978 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
8985 context
= in_namespace
;
8986 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
8987 context
= current_namespace
;
8989 context
= NULL_TREE
;
8991 if (processing_template_decl
&& context
)
8992 /* For global variables, declared in a template, we need the
8994 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8996 decl
= build_decl (VAR_DECL
, declarator
, type
);
8999 set_decl_namespace (decl
, context
, 0);
9001 context
= DECL_CONTEXT (decl
);
9002 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
9003 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
9007 set_decl_namespace (decl
, in_namespace
, 0);
9009 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
9011 DECL_THIS_EXTERN (decl
) = 1;
9012 DECL_EXTERNAL (decl
) = !initialized
;
9015 /* In class context, static means one per class,
9016 public access, and static storage. */
9017 if (DECL_CLASS_SCOPE_P (decl
))
9019 TREE_PUBLIC (decl
) = 1;
9020 TREE_STATIC (decl
) = 1;
9021 DECL_EXTERNAL (decl
) = 0;
9023 /* At top level, either `static' or no s.c. makes a definition
9024 (perhaps tentative), and absence of `static' makes it public. */
9025 else if (toplevel_bindings_p ())
9027 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
9028 && (DECL_THIS_EXTERN (decl
) || ! constp
));
9029 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
9031 /* Not at top level, only `static' makes a static definition. */
9034 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
9035 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
9038 if (TREE_PUBLIC (decl
))
9040 /* [basic.link]: A name with no linkage (notably, the name of a class
9041 or enumeration declared in a local scope) shall not be used to
9042 declare an entity with linkage.
9044 Only check this for public decls for now. */
9045 tree t
= no_linkage_check (TREE_TYPE (decl
));
9048 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
9049 /* Ignore for now; `enum { foo } e' is pretty common. */;
9051 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
9059 /* Create and return a canonical pointer to member function type, for
9060 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
9063 build_ptrmemfunc_type (type
)
9068 tree unqualified_variant
= NULL_TREE
;
9070 if (type
== error_mark_node
)
9073 /* If a canonical type already exists for this type, use it. We use
9074 this method instead of type_hash_canon, because it only does a
9075 simple equality check on the list of field members. */
9077 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
9080 /* Make sure that we always have the unqualified pointer-to-member
9082 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9084 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
9086 t
= make_aggr_type (RECORD_TYPE
);
9087 /* Let the front-end know this is a pointer to member function... */
9088 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
9089 /* ... and not really an aggregate. */
9090 SET_IS_AGGR_TYPE (t
, 0);
9092 fields
[0] = build_decl (FIELD_DECL
, pfn_identifier
, type
);
9093 fields
[1] = build_decl (FIELD_DECL
, delta_identifier
,
9095 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9097 /* Zap out the name so that the back-end will give us the debugging
9098 information for this anonymous RECORD_TYPE. */
9099 TYPE_NAME (t
) = NULL_TREE
;
9101 /* If this is not the unqualified form of this pointer-to-member
9102 type, set the TYPE_MAIN_VARIANT for this type to be the
9103 unqualified type. Since they are actually RECORD_TYPEs that are
9104 not variants of each other, we must do this manually. */
9105 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9107 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
9108 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
9109 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
9110 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
9113 /* Cache this pointer-to-member type so that we can find it again
9115 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
9117 /* Seems to be wanted. */
9118 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
9123 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
9124 Check to see that the definition is valid. Issue appropriate error
9125 messages. Return 1 if the definition is particularly bad, or 0
9129 check_static_variable_definition (decl
, type
)
9133 /* Motion 10 at San Diego: If a static const integral data member is
9134 initialized with an integral constant expression, the initializer
9135 may appear either in the declaration (within the class), or in
9136 the definition, but not both. If it appears in the class, the
9137 member is a member constant. The file-scope definition is always
9139 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
9141 cp_error ("invalid in-class initialization of static data member of non-integral type `%T'",
9143 /* If we just return the declaration, crashes will sometimes
9144 occur. We therefore return void_type_node, as if this was a
9145 friend declaration, to cause callers to completely ignore
9146 this declaration. */
9149 else if (!CP_TYPE_CONST_P (type
))
9150 cp_error ("ISO C++ forbids in-class initialization of non-const static member `%D'",
9152 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
9153 cp_pedwarn ("ISO C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
9158 /* Given the SIZE (i.e., number of elements) in an array, compute an
9159 appropriate index type for the array. If non-NULL, NAME is the
9160 name of the thing being declared. */
9163 compute_array_index_type (name
, size
)
9169 /* The size might be the result of a cast. */
9170 STRIP_TYPE_NOPS (size
);
9172 /* It might be a const variable or enumeration constant. */
9173 size
= decl_constant_value (size
);
9175 /* If this involves a template parameter, it will be a constant at
9176 instantiation time, but we don't know what the value is yet.
9177 Even if no template parameters are involved, we may an expression
9178 that is not a constant; we don't even simplify `1 + 2' when
9179 processing a template. */
9180 if (processing_template_decl
)
9182 /* Resolve a qualified reference to an enumerator or static
9183 const data member of ours. */
9184 if (TREE_CODE (size
) == SCOPE_REF
9185 && TREE_OPERAND (size
, 0) == current_class_type
)
9187 tree t
= lookup_field (current_class_type
,
9188 TREE_OPERAND (size
, 1), 0, 0);
9193 return build_index_type (build_min (MINUS_EXPR
, sizetype
,
9194 size
, integer_one_node
));
9197 /* The array bound must be an integer type. */
9198 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9199 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
9200 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
9203 cp_error ("size of array `%D' has non-integer type", name
);
9205 cp_error ("size of array has non-integer type");
9206 size
= integer_one_node
;
9209 /* Normally, the array-bound will be a constant. */
9210 if (TREE_CODE (size
) == INTEGER_CST
)
9212 /* Check to see if the array bound overflowed. Make that an
9213 error, no matter how generous we're being. */
9214 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9215 int old_pedantic
= pedantic
;
9216 pedantic
= flag_pedantic_errors
= 1;
9217 constant_expression_warning (size
);
9218 pedantic
= old_pedantic
;
9219 flag_pedantic_errors
= old_flag_pedantic_errors
;
9221 /* An array must have a positive number of elements. */
9222 if (INT_CST_LT (size
, integer_zero_node
))
9225 cp_error ("size of array `%D' is negative", name
);
9227 cp_error ("size of array is negative");
9228 size
= integer_one_node
;
9230 /* Except that an extension we allow zero-sized arrays. We
9231 always allow them in system headers because glibc uses
9233 else if (integer_zerop (size
) && pedantic
&& !in_system_header
)
9236 cp_pedwarn ("ISO C++ forbids zero-size array `%D'", name
);
9238 cp_pedwarn ("ISO C++ forbids zero-size array");
9241 else if (TREE_CONSTANT (size
))
9243 /* `(int) &fn' is not a valid array bound. */
9245 cp_error ("size of array `%D' is not an integral constant-expression",
9248 cp_error ("size of array is not an integral constant-expression");
9251 /* Compute the index of the largest element in the array. It is
9252 one less than the number of elements in the array. */
9254 = fold (cp_build_binary_op (MINUS_EXPR
,
9255 cp_convert (ssizetype
, size
),
9256 cp_convert (ssizetype
,
9257 integer_one_node
)));
9259 /* Check for variable-sized arrays. We allow such things as an
9260 extension, even though they are not allowed in ANSI/ISO C++. */
9261 if (!TREE_CONSTANT (itype
))
9266 cp_pedwarn ("ISO C++ forbids variable-size array `%D'",
9269 cp_pedwarn ("ISO C++ forbids variable-size array");
9272 /* Create a variable-sized array index type. */
9273 itype
= variable_size (itype
);
9275 /* Make sure that there was no overflow when creating to a signed
9276 index type. (For example, on a 32-bit machine, an array with
9277 size 2^32 - 1 is too big.) */
9278 else if (TREE_OVERFLOW (itype
))
9280 error ("overflow in array dimension");
9281 TREE_OVERFLOW (itype
) = 0;
9284 /* Create and return the appropriate index type. */
9285 return build_index_type (itype
);
9288 /* Returns an ARRAY_TYPE for an array with SIZE elements of the
9289 indicated TYPE. If non-NULL, NAME is the NAME of the declaration
9293 create_array_type_for_decl (name
, type
, size
)
9298 tree itype
= NULL_TREE
;
9299 const char* error_msg
;
9301 /* If things have already gone awry, bail now. */
9302 if (type
== error_mark_node
|| size
== error_mark_node
)
9303 return error_mark_node
;
9305 /* Assume that everything will go OK. */
9308 /* There are some types which cannot be array elements. */
9309 switch (TREE_CODE (type
))
9312 error_msg
= "array of void";
9316 error_msg
= "array of functions";
9319 case REFERENCE_TYPE
:
9320 error_msg
= "array of references";
9324 error_msg
= "array of data members";
9328 error_msg
= "array of function members";
9335 /* If something went wrong, issue an error-message and return. */
9339 cp_error ("declaration of `%D' as %s", name
, error_msg
);
9341 cp_error ("creating %s", error_msg
);
9343 return error_mark_node
;
9348 The constant expressions that specify the bounds of the arrays
9349 can be omitted only for the first member of the sequence. */
9350 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9352 cp_error ("declaration of `%D' as multidimensional array must have bounds for all dimensions except the first",
9355 return error_mark_node
;
9358 /* Figure out the index type for the array. */
9360 itype
= compute_array_index_type (name
, size
);
9362 return build_cplus_array_type (type
, itype
);
9365 /* Check that it's OK to declare a function with the indicated TYPE.
9366 SFK indicates the kind of special function (if any) that this
9367 function is. OPTYPE is the type given in a conversion operator
9368 declaration. Returns the actual return type of the function; that
9369 may be different than TYPE if an error occurs, or for certain
9370 special functions. */
9373 check_special_function_return_type (sfk
, type
, optype
)
9374 special_function_kind sfk
;
9380 case sfk_constructor
:
9382 cp_error ("return type specification for constructor invalid");
9384 /* In the new ABI constructors do not return a value. */
9385 type
= void_type_node
;
9388 case sfk_destructor
:
9390 cp_error ("return type specification for destructor invalid");
9391 type
= void_type_node
;
9394 case sfk_conversion
:
9395 if (type
&& !same_type_p (type
, optype
))
9396 cp_error ("operator `%T' declared to return `%T'", optype
, type
);
9398 cp_pedwarn ("return type specified for `operator %T'", optype
);
9403 my_friendly_abort (20000408);
9410 /* Given declspecs and a declarator,
9411 determine the name and type of the object declared
9412 and construct a ..._DECL node for it.
9413 (In one case we can return a ..._TYPE node instead.
9414 For invalid input we sometimes return 0.)
9416 DECLSPECS is a chain of tree_list nodes whose value fields
9417 are the storage classes and type specifiers.
9419 DECL_CONTEXT says which syntactic context this declaration is in:
9420 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
9421 FUNCDEF for a function definition. Like NORMAL but a few different
9422 error messages in each case. Return value may be zero meaning
9423 this definition is too screwy to try to parse.
9424 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
9425 handle member functions (which have FIELD context).
9426 Return value may be zero meaning this definition is too screwy to
9428 PARM for a parameter declaration (either within a function prototype
9429 or before a function body). Make a PARM_DECL, or return void_type_node.
9430 CATCHPARM for a parameter declaration before a catch clause.
9431 TYPENAME if for a typename (in a cast or sizeof).
9432 Don't make a DECL node; just return the ..._TYPE node.
9433 FIELD for a struct or union field; make a FIELD_DECL.
9434 BITFIELD for a field with specified width.
9435 INITIALIZED is 1 if the decl has an initializer.
9437 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
9438 normal attributes in TREE_PURPOSE, or NULL_TREE.
9440 In the TYPENAME case, DECLARATOR is really an abstract declarator.
9441 It may also be so in the PARM case, for a prototype where the
9442 argument type is specified but not the name.
9444 This function is where the complicated C meanings of `static'
9445 and `extern' are interpreted.
9447 For C++, if there is any monkey business to do, the function which
9448 calls this one must do it, i.e., prepending instance variables,
9449 renaming overloaded function names, etc.
9451 Note that for this C++, it is an error to define a method within a class
9452 which does not belong to that class.
9454 Except in the case where SCOPE_REFs are implicitly known (such as
9455 methods within a class being redundantly qualified),
9456 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
9457 (class_name::decl_name). The caller must also deal with this.
9459 If a constructor or destructor is seen, and the context is FIELD,
9460 then the type gains the attribute TREE_HAS_x. If such a declaration
9461 is erroneous, NULL_TREE is returned.
9463 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
9464 function, these are the qualifiers to give to the `this' pointer. We
9465 apply TYPE_QUAL_RESTRICT to the this ptr, not the object.
9467 May return void_type_node if the declarator turned out to be a friend.
9468 See grokfield for details. */
9471 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
9474 enum decl_context decl_context
;
9478 RID_BIT_TYPE specbits
;
9481 tree type
= NULL_TREE
;
9487 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
9488 int explicit_int
= 0;
9489 int explicit_char
= 0;
9490 int defaulted_int
= 0;
9491 tree typedef_decl
= NULL_TREE
;
9493 tree typedef_type
= NULL_TREE
;
9494 int funcdef_flag
= 0;
9495 enum tree_code innermost_code
= ERROR_MARK
;
9498 /* See the code below that used this. */
9499 tree decl_machine_attr
= NULL_TREE
;
9501 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
9502 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
9503 tree init
= NULL_TREE
;
9505 /* Keep track of what sort of function is being processed
9506 so that we can warn about default return values, or explicit
9507 return values which do not match prescribed defaults. */
9508 special_function_kind sfk
= sfk_none
;
9510 tree dname
= NULL_TREE
;
9511 tree ctype
= current_class_type
;
9512 tree ctor_return_type
= NULL_TREE
;
9513 enum overload_flags flags
= NO_SPECIAL
;
9514 tree quals
= NULL_TREE
;
9515 tree raises
= NULL_TREE
;
9516 int template_count
= 0;
9517 tree in_namespace
= NULL_TREE
;
9521 RIDBIT_RESET_ALL (specbits
);
9522 if (decl_context
== FUNCDEF
)
9523 funcdef_flag
= 1, decl_context
= NORMAL
;
9524 else if (decl_context
== MEMFUNCDEF
)
9525 funcdef_flag
= -1, decl_context
= FIELD
;
9526 else if (decl_context
== BITFIELD
)
9527 bitfield
= 1, decl_context
= FIELD
;
9529 /* Look inside a declarator for the name being declared
9530 and get it as a string, for an error message. */
9532 tree
*next
= &declarator
;
9536 while (next
&& *next
)
9539 switch (TREE_CODE (decl
))
9542 /* For attributes. */
9543 next
= &TREE_VALUE (decl
);
9548 next
= &TREE_OPERAND (decl
, 0);
9551 case BIT_NOT_EXPR
: /* For C++ destructors! */
9553 tree name
= TREE_OPERAND (decl
, 0);
9554 tree rename
= NULL_TREE
;
9556 my_friendly_assert (flags
== NO_SPECIAL
, 152);
9558 sfk
= sfk_destructor
;
9559 if (TREE_CODE (name
) == TYPE_DECL
)
9560 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
9561 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
9562 if (ctype
== NULL_TREE
)
9564 if (current_class_type
== NULL_TREE
)
9566 error ("destructors must be member functions");
9571 tree t
= constructor_name (current_class_name
);
9578 tree t
= constructor_name (ctype
);
9585 cp_error ("destructor `%T' must match class name `%T'",
9587 TREE_OPERAND (decl
, 0) = rename
;
9593 case ADDR_EXPR
: /* C++ reference declaration */
9598 innermost_code
= TREE_CODE (decl
);
9599 next
= &TREE_OPERAND (decl
, 0);
9603 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
9605 /* This is actually a variable declaration using
9606 constructor syntax. We need to call start_decl and
9607 cp_finish_decl so we can get the variable
9610 tree attributes
, prefix_attributes
;
9612 *next
= TREE_OPERAND (decl
, 0);
9613 init
= CALL_DECLARATOR_PARMS (decl
);
9617 attributes
= TREE_PURPOSE (attrlist
);
9618 prefix_attributes
= TREE_VALUE (attrlist
);
9622 attributes
= NULL_TREE
;
9623 prefix_attributes
= NULL_TREE
;
9626 decl
= start_decl (declarator
, declspecs
, 1,
9627 attributes
, prefix_attributes
);
9628 decl_type_access_control (decl
);
9631 /* Look for __unused__ attribute */
9632 if (TREE_USED (TREE_TYPE (decl
)))
9633 TREE_USED (decl
) = 1;
9634 finish_decl (decl
, init
, NULL_TREE
);
9637 cp_error ("invalid declarator");
9640 innermost_code
= TREE_CODE (decl
);
9641 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
9642 ctype
= current_class_type
;
9644 && TREE_OPERAND (decl
, 0)
9645 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
9646 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
9647 == constructor_name_full (ctype
))
9648 || (DECL_NAME (TREE_OPERAND (decl
, 0))
9649 == constructor_name (ctype
)))))
9650 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9651 next
= &TREE_OPERAND (decl
, 0);
9653 if (ctype
!= NULL_TREE
9654 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
9655 && decl
== constructor_name (ctype
))
9657 sfk
= sfk_constructor
;
9658 ctor_return_type
= ctype
;
9663 case TEMPLATE_ID_EXPR
:
9665 tree fns
= TREE_OPERAND (decl
, 0);
9667 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9668 fns
= TREE_OPERAND (fns
, 0);
9671 if (TREE_CODE (dname
) == COMPONENT_REF
)
9672 dname
= TREE_OPERAND (dname
, 1);
9673 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9675 my_friendly_assert (is_overloaded_fn (dname
),
9677 dname
= DECL_NAME (get_first_fn (dname
));
9682 case IDENTIFIER_NODE
:
9683 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9688 if (C_IS_RESERVED_WORD (dname
))
9690 cp_error ("declarator-id missing; using reserved word `%D'",
9692 name
= IDENTIFIER_POINTER (dname
);
9694 else if (!IDENTIFIER_TYPENAME_P (dname
))
9695 name
= IDENTIFIER_POINTER (dname
);
9698 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9699 flags
= TYPENAME_FLAG
;
9700 ctor_return_type
= TREE_TYPE (dname
);
9701 sfk
= sfk_conversion
;
9702 if (IDENTIFIER_GLOBAL_VALUE (dname
)
9703 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (dname
))
9705 name
= IDENTIFIER_POINTER (dname
);
9707 name
= "<invalid operator>";
9714 /* Perform error checking, and decide on a ctype. */
9715 tree cname
= TREE_OPERAND (decl
, 0);
9716 if (cname
== NULL_TREE
)
9718 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9721 in_namespace
= TREE_OPERAND (decl
, 0);
9722 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9724 else if (! is_aggr_type (cname
, 1))
9725 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9726 /* Must test TREE_OPERAND (decl, 1), in case user gives
9727 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9728 else if (TREE_OPERAND (decl
, 1)
9729 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9731 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9732 || TREE_CODE (cname
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
9734 cp_error ("`%T::%D' is not a valid declarator", cname
,
9735 TREE_OPERAND (decl
, 1));
9736 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9737 cname
, TREE_OPERAND (decl
, 1));
9738 return void_type_node
;
9740 else if (ctype
== NULL_TREE
)
9742 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9743 TREE_OPERAND (decl
, 0) = ctype
;
9746 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9748 cp_error ("type `%T' is not derived from type `%T'",
9750 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9756 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9757 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9758 == constructor_name_full (ctype
))
9759 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9760 == constructor_name (ctype
))))
9761 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9762 next
= &TREE_OPERAND (decl
, 1);
9766 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9767 && constructor_name (ctype
) == decl
)
9769 sfk
= sfk_constructor
;
9770 ctor_return_type
= ctype
;
9772 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9773 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9774 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9775 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9777 sfk
= sfk_destructor
;
9778 ctor_return_type
= ctype
;
9780 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9781 next
= &TREE_OPERAND (decl
, 0);
9792 /* Parse error puts this typespec where
9793 a declarator should go. */
9794 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9795 if (TREE_TYPE (decl
) == current_class_type
)
9796 cp_error (" perhaps you want `%T' for a constructor",
9797 current_class_name
);
9798 dname
= DECL_NAME (decl
);
9799 name
= IDENTIFIER_POINTER (dname
);
9801 /* Avoid giving two errors for this. */
9802 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9804 declspecs
= tree_cons (NULL_TREE
, integer_type_node
, declspecs
);
9810 cp_compiler_error ("`%D' as declarator", decl
);
9811 return 0; /* We used to do a 155 abort here. */
9816 /* A function definition's declarator must have the form of
9817 a function declarator. */
9819 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9822 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9823 && innermost_code
!= CALL_EXPR
9824 && ! (ctype
&& declspecs
== NULL_TREE
))
9826 cp_error ("declaration of `%D' as non-function", dname
);
9827 return void_type_node
;
9830 /* Anything declared one level down from the top level
9831 must be one of the parameters of a function
9832 (because the body is at least two levels down). */
9834 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9835 by not allowing C++ class definitions to specify their parameters
9836 with xdecls (must be spec.d in the parmlist).
9838 Since we now wait to push a class scope until we are sure that
9839 we are in a legitimate method context, we must set oldcname
9840 explicitly (since current_class_name is not yet alive).
9842 We also want to avoid calling this a PARM if it is in a namespace. */
9844 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
9846 struct binding_level
*b
= current_binding_level
;
9847 current_binding_level
= b
->level_chain
;
9848 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9849 decl_context
= PARM
;
9850 current_binding_level
= b
;
9854 name
= decl_context
== PARM
? "parameter" : "type name";
9856 /* Look through the decl specs and record which ones appear.
9857 Some typespecs are defined as built-in typenames.
9858 Others, the ones that are modifiers of other types,
9859 are represented by bits in SPECBITS: set the bits for
9860 the modifiers that appear. Storage class keywords are also in SPECBITS.
9862 If there is a typedef name or a type, store the type in TYPE.
9863 This includes builtin typedefs such as `int'.
9865 Set EXPLICIT_INT if the type is `int' or `char' and did not
9866 come from a user typedef.
9868 Set LONGLONG if `long' is mentioned twice.
9870 For C++, constructors and destructors have their own fast treatment. */
9872 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
9877 /* Certain parse errors slip through. For example,
9878 `int class;' is not caught by the parser. Try
9879 weakly to recover here. */
9880 if (TREE_CODE (spec
) != TREE_LIST
)
9883 id
= TREE_VALUE (spec
);
9885 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9887 if (id
== ridpointers
[(int) RID_INT
]
9888 || id
== ridpointers
[(int) RID_CHAR
]
9889 || id
== ridpointers
[(int) RID_BOOL
]
9890 || id
== ridpointers
[(int) RID_WCHAR
])
9894 if (id
== ridpointers
[(int) RID_BOOL
])
9895 error ("`bool' is now a keyword");
9897 cp_error ("extraneous `%T' ignored", id
);
9901 if (id
== ridpointers
[(int) RID_INT
])
9903 else if (id
== ridpointers
[(int) RID_CHAR
])
9905 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
9909 /* C++ aggregate types. */
9910 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
9913 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
9915 type
= IDENTIFIER_TYPE_VALUE (id
);
9919 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
9921 if (ridpointers
[i
] == id
)
9923 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
9925 if (pedantic
&& ! in_system_header
&& warn_long_long
)
9926 pedwarn ("ISO C++ does not support `long long'");
9928 error ("`long long long' is too long for GCC");
9932 else if (RIDBIT_SETP (i
, specbits
))
9933 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
9934 RIDBIT_SET (i
, specbits
);
9939 /* C++ aggregate types. */
9940 else if (TREE_CODE (id
) == TYPE_DECL
)
9943 cp_error ("multiple declarations `%T' and `%T'", type
,
9947 type
= TREE_TYPE (id
);
9948 TREE_VALUE (spec
) = type
;
9953 error ("two or more data types in declaration of `%s'", name
);
9954 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9956 register tree t
= lookup_name (id
, 1);
9957 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
9958 error ("`%s' fails to be a typedef or built in type",
9959 IDENTIFIER_POINTER (id
));
9962 type
= TREE_TYPE (t
);
9964 /* See the code below that used this. */
9965 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
9970 else if (id
!= error_mark_node
)
9971 /* Can't change CLASS nodes into RECORD nodes here! */
9977 typedef_type
= type
;
9979 /* No type at all: default to `int', and set DEFAULTED_INT
9980 because it was not a user-defined typedef. */
9982 if (type
== NULL_TREE
9983 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
9984 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9985 || RIDBIT_SETP (RID_LONG
, specbits
)
9986 || RIDBIT_SETP (RID_SHORT
, specbits
)))
9988 /* These imply 'int'. */
9989 type
= integer_type_node
;
9993 if (sfk
!= sfk_none
)
9994 type
= check_special_function_return_type (sfk
, type
,
9996 else if (type
== NULL_TREE
)
10002 /* We handle `main' specially here, because 'main () { }' is so
10003 common. With no options, it is allowed. With -Wreturn-type,
10004 it is a warning. It is only an error with -pedantic-errors. */
10005 is_main
= (funcdef_flag
10006 && MAIN_NAME_P (dname
)
10007 && ctype
== NULL_TREE
10008 && in_namespace
== NULL_TREE
10009 && current_namespace
== global_namespace
);
10011 if (in_system_header
|| flag_ms_extensions
)
10012 /* Allow it, sigh. */;
10013 else if (pedantic
|| ! is_main
)
10014 cp_pedwarn ("ISO C++ forbids declaration of `%s' with no type",
10016 else if (warn_return_type
)
10017 cp_warning ("ISO C++ forbids declaration of `%s' with no type",
10020 type
= integer_type_node
;
10025 /* Now process the modifiers that were specified
10026 and check for invalid combinations. */
10028 /* Long double is a special combination. */
10030 if (RIDBIT_SETP (RID_LONG
, specbits
)
10031 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
10033 RIDBIT_RESET (RID_LONG
, specbits
);
10034 type
= build_qualified_type (long_double_type_node
,
10035 CP_TYPE_QUALS (type
));
10038 /* Check all other uses of type modifiers. */
10040 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10041 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10042 || RIDBIT_SETP (RID_LONG
, specbits
)
10043 || RIDBIT_SETP (RID_SHORT
, specbits
))
10047 if (TREE_CODE (type
) == REAL_TYPE
)
10048 error ("short, signed or unsigned invalid for `%s'", name
);
10049 else if (TREE_CODE (type
) != INTEGER_TYPE
)
10050 error ("long, short, signed or unsigned invalid for `%s'", name
);
10051 else if (RIDBIT_SETP (RID_LONG
, specbits
)
10052 && RIDBIT_SETP (RID_SHORT
, specbits
))
10053 error ("long and short specified together for `%s'", name
);
10054 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10055 || RIDBIT_SETP (RID_SHORT
, specbits
))
10057 error ("long or short specified with char for `%s'", name
);
10058 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10059 || RIDBIT_SETP (RID_SHORT
, specbits
))
10060 && TREE_CODE (type
) == REAL_TYPE
)
10061 error ("long or short specified with floating type for `%s'", name
);
10062 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10063 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
10064 error ("signed and unsigned given together for `%s'", name
);
10068 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
10070 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
10072 if (flag_pedantic_errors
)
10077 /* Discard the type modifiers if they are invalid. */
10080 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
10081 RIDBIT_RESET (RID_SIGNED
, specbits
);
10082 RIDBIT_RESET (RID_LONG
, specbits
);
10083 RIDBIT_RESET (RID_SHORT
, specbits
);
10088 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
10089 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
10091 error ("complex invalid for `%s'", name
);
10092 RIDBIT_RESET (RID_COMPLEX
, specbits
);
10095 /* Decide whether an integer type is signed or not.
10096 Optionally treat bitfields as signed by default. */
10097 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10100 It is implementation-defined whether a plain (neither
10101 explicitly signed or unsigned) char, short, int, or long
10102 bit-field is signed or unsigned.
10104 Naturally, we extend this to long long as well. Note that
10105 this does not include wchar_t. */
10106 || (bitfield
&& !flag_signed_bitfields
10107 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
10108 /* A typedef for plain `int' without `signed' can be
10109 controlled just like plain `int', but a typedef for
10110 `signed int' cannot be so controlled. */
10112 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
10113 && (TREE_CODE (type
) == INTEGER_TYPE
10114 || TREE_CODE (type
) == CHAR_TYPE
)
10115 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
10118 type
= long_long_unsigned_type_node
;
10119 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10120 type
= long_unsigned_type_node
;
10121 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10122 type
= short_unsigned_type_node
;
10123 else if (type
== char_type_node
)
10124 type
= unsigned_char_type_node
;
10125 else if (typedef_decl
)
10126 type
= unsigned_type (type
);
10128 type
= unsigned_type_node
;
10130 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10131 && type
== char_type_node
)
10132 type
= signed_char_type_node
;
10134 type
= long_long_integer_type_node
;
10135 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10136 type
= long_integer_type_node
;
10137 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10138 type
= short_integer_type_node
;
10140 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
10142 /* If we just have "complex", it is equivalent to
10143 "complex double", but if any modifiers at all are specified it is
10144 the complex form of TYPE. E.g, "complex short" is
10145 "complex short int". */
10147 if (defaulted_int
&& ! longlong
10148 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
10149 || RIDBIT_SETP (RID_SHORT
, specbits
)
10150 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10151 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
10152 type
= complex_double_type_node
;
10153 else if (type
== integer_type_node
)
10154 type
= complex_integer_type_node
;
10155 else if (type
== float_type_node
)
10156 type
= complex_float_type_node
;
10157 else if (type
== double_type_node
)
10158 type
= complex_double_type_node
;
10159 else if (type
== long_double_type_node
)
10160 type
= complex_long_double_type_node
;
10162 type
= build_complex_type (type
);
10165 if (sfk
== sfk_conversion
10166 && (RIDBIT_SETP (RID_CONST
, specbits
)
10167 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
10168 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
10169 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
10172 /* Set CONSTP if this declaration is `const', whether by
10173 explicit specification or via a typedef.
10174 Likewise for VOLATILEP. */
10176 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
10178 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
10180 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
10181 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10182 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10183 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10184 type
= cp_build_qualified_type (type
, type_quals
);
10186 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
10187 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
10188 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
10189 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
10190 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
10192 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10193 staticp
= 1 + (decl_context
== FIELD
);
10195 if (virtualp
&& staticp
== 2)
10197 cp_error ("member `%D' cannot be declared both virtual and static",
10201 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
10202 RIDBIT_RESET (RID_FRIEND
, specbits
);
10204 /* Warn if two storage classes are given. Default to `auto'. */
10206 if (RIDBIT_ANY_SET (specbits
))
10208 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
10209 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
10210 if (decl_context
== PARM
&& nclasses
> 0)
10211 error ("storage class specifiers invalid in parameter declarations");
10212 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10214 if (decl_context
== PARM
)
10215 error ("typedef declaration invalid in parameter declaration");
10218 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
10219 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
10222 /* Give error if `virtual' is used outside of class declaration. */
10224 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
10226 error ("virtual outside class declaration");
10230 /* Static anonymous unions are dealt with here. */
10231 if (staticp
&& decl_context
== TYPENAME
10232 && TREE_CODE (declspecs
) == TREE_LIST
10233 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
10234 decl_context
= FIELD
;
10236 /* Warn about storage classes that are invalid for certain
10237 kinds of declarations (parameters, typenames, etc.). */
10240 error ("multiple storage classes in declaration of `%s'", name
);
10241 else if (decl_context
!= NORMAL
&& nclasses
> 0)
10243 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
10244 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
10245 || RIDBIT_SETP (RID_AUTO
, specbits
)))
10247 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10249 else if (decl_context
== FIELD
10250 /* C++ allows static class elements */
10251 && RIDBIT_SETP (RID_STATIC
, specbits
))
10252 /* C++ also allows inlines and signed and unsigned elements,
10253 but in those cases we don't come in here. */
10257 if (decl_context
== FIELD
)
10259 tree tmp
= NULL_TREE
;
10260 register int op
= 0;
10264 /* Avoid trying to get an operand off an identifier node. */
10265 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10268 tmp
= TREE_OPERAND (declarator
, 0);
10269 op
= IDENTIFIER_OPNAME_P (tmp
);
10270 if (IDENTIFIER_TYPENAME_P (tmp
))
10272 if (IDENTIFIER_GLOBAL_VALUE (tmp
)
10273 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (tmp
))
10275 name
= IDENTIFIER_POINTER (tmp
);
10277 name
= "<invalid operator>";
10280 error ("storage class specified for %s `%s'",
10281 op
? "member operator" : "field",
10286 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10287 error ("storage class specified for parameter `%s'", name
);
10289 error ("storage class specified for typename");
10291 RIDBIT_RESET (RID_REGISTER
, specbits
);
10292 RIDBIT_RESET (RID_AUTO
, specbits
);
10293 RIDBIT_RESET (RID_EXTERN
, specbits
);
10296 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
10298 if (toplevel_bindings_p ())
10300 /* It's common practice (and completely valid) to have a const
10301 be initialized and declared extern. */
10302 if (!(type_quals
& TYPE_QUAL_CONST
))
10303 warning ("`%s' initialized and declared `extern'", name
);
10306 error ("`%s' has both `extern' and initializer", name
);
10308 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
10309 && ! toplevel_bindings_p ())
10310 error ("nested function `%s' declared `extern'", name
);
10311 else if (toplevel_bindings_p ())
10313 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10314 error ("top-level declaration of `%s' specifies `auto'", name
);
10317 if (nclasses
> 0 && friendp
)
10318 error ("storage class specifiers invalid in friend function declarations");
10320 /* Now figure out the structure of the declarator proper.
10321 Descend through it, creating more complex types, until we reach
10322 the declared identifier (or NULL_TREE, in an absolute declarator). */
10324 inner_attrs
= NULL_TREE
;
10327 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
10328 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
10330 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
10331 an INDIRECT_REF (for *...),
10332 a CALL_EXPR (for ...(...)),
10333 an identifier (for the name being declared)
10334 or a null pointer (for the place in an absolute declarator
10335 where the name was omitted).
10336 For the last two cases, we have just exited the loop.
10338 For C++ it could also be
10339 a SCOPE_REF (for class :: ...). In this case, we have converted
10340 sensible names to types, and those are the values we use to
10341 qualify the member name.
10342 an ADDR_EXPR (for &...),
10343 a BIT_NOT_EXPR (for destructors)
10345 At this point, TYPE is the type of elements of an array,
10346 or for a function to return, or for a pointer to point to.
10347 After this sequence of ifs, TYPE is the type of the
10348 array or function or pointer, and DECLARATOR has had its
10349 outermost layer removed. */
10351 if (type
== error_mark_node
)
10353 if (TREE_CODE (declarator
) == SCOPE_REF
)
10354 declarator
= TREE_OPERAND (declarator
, 1);
10356 declarator
= TREE_OPERAND (declarator
, 0);
10359 if (quals
!= NULL_TREE
10360 && (declarator
== NULL_TREE
10361 || TREE_CODE (declarator
) != SCOPE_REF
))
10363 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
10364 ctype
= TYPE_METHOD_BASETYPE (type
);
10365 if (ctype
!= NULL_TREE
)
10367 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
10368 grok_method_quals (ctype
, dummy
, quals
);
10369 type
= TREE_TYPE (dummy
);
10370 ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
)));
10375 /* See the comment for the TREE_LIST case, below. */
10378 else if (inner_attrs
)
10380 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10381 inner_attrs
= NULL_TREE
;
10384 switch (TREE_CODE (declarator
))
10388 /* We encode a declarator with embedded attributes using
10389 a TREE_LIST. The attributes apply to the declarator
10390 directly inside them, so we have to skip an iteration
10391 before applying them to the type. If the declarator just
10392 inside is the declarator-id, we apply the attrs to the
10394 inner_attrs
= TREE_PURPOSE (declarator
);
10396 declarator
= TREE_VALUE (declarator
);
10402 register tree size
;
10404 size
= TREE_OPERAND (declarator
, 1);
10406 /* VC++ spells a zero-sized array with []. */
10407 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
10408 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10409 size
= integer_zero_node
;
10411 declarator
= TREE_OPERAND (declarator
, 0);
10413 type
= create_array_type_for_decl (dname
, type
, size
);
10415 /* VLAs never work as fields. */
10416 if (decl_context
== FIELD
&& !processing_template_decl
10417 && TREE_CODE (type
) == ARRAY_TYPE
10418 && TYPE_DOMAIN (type
) != NULL_TREE
10419 && !TREE_CONSTANT (TYPE_MAX_VALUE (TYPE_DOMAIN (type
))))
10421 cp_error ("size of member `%D' is not constant", dname
);
10422 /* Proceed with arbitrary constant size, so that offset
10423 computations don't get confused. */
10424 type
= create_array_type_for_decl (dname
, TREE_TYPE (type
),
10436 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
10437 tree inner_decl
= TREE_OPERAND (declarator
, 0);
10439 /* Declaring a function type.
10440 Make sure we have a valid type for the function to return. */
10442 /* We now know that the TYPE_QUALS don't apply to the
10443 decl, but to its return type. */
10444 type_quals
= TYPE_UNQUALIFIED
;
10446 /* Warn about some types functions can't return. */
10448 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10450 error ("`%s' declared as function returning a function", name
);
10451 type
= integer_type_node
;
10453 if (TREE_CODE (type
) == ARRAY_TYPE
)
10455 error ("`%s' declared as function returning an array", name
);
10456 type
= integer_type_node
;
10459 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
10460 inner_decl
= TREE_OPERAND (inner_decl
, 1);
10462 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
10463 inner_decl
= dname
;
10465 /* Pick up type qualifiers which should be applied to `this'. */
10466 quals
= CALL_DECLARATOR_QUALS (declarator
);
10468 /* Pick up the exception specifications. */
10469 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
10471 /* Say it's a definition only for the CALL_EXPR
10472 closest to the identifier. */
10475 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
10476 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
10477 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
10479 if (ctype
== NULL_TREE
10480 && decl_context
== FIELD
10482 && (friendp
== 0 || dname
== current_class_name
))
10483 ctype
= current_class_type
;
10485 if (ctype
&& sfk
== sfk_conversion
)
10486 TYPE_HAS_CONVERSION (ctype
) = 1;
10487 if (ctype
&& constructor_name (ctype
) == dname
)
10489 /* We are within a class's scope. If our declarator name
10490 is the same as the class name, and we are defining
10491 a function, then it is a constructor/destructor, and
10492 therefore returns a void type. */
10494 if (flags
== DTOR_FLAG
)
10496 /* ISO C++ 12.4/2. A destructor may not be
10497 declared const or volatile. A destructor may
10500 error ("destructor cannot be static member function");
10503 cp_error ("destructors may not be `%s'",
10504 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10507 if (decl_context
== FIELD
)
10509 if (! member_function_or_else (ctype
,
10510 current_class_type
,
10512 return void_type_node
;
10515 else /* It's a constructor. */
10517 if (explicitp
== 1)
10519 /* ISO C++ 12.1. A constructor may not be
10520 declared const or volatile. A constructor may
10521 not be virtual. A constructor may not be
10524 error ("constructor cannot be static member function");
10527 pedwarn ("constructors cannot be declared virtual");
10532 cp_error ("constructors may not be `%s'",
10533 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10537 RID_BIT_TYPE tmp_bits
;
10538 memcpy (&tmp_bits
, &specbits
, sizeof (RID_BIT_TYPE
));
10539 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10540 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10541 if (RIDBIT_ANY_SET (tmp_bits
))
10542 error ("return value type specifier for constructor ignored");
10544 if (decl_context
== FIELD
)
10546 if (! member_function_or_else (ctype
,
10547 current_class_type
,
10549 return void_type_node
;
10550 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10551 if (sfk
!= sfk_constructor
)
10555 if (decl_context
== FIELD
)
10561 error ("can't initialize friend function `%s'", name
);
10564 /* Cannot be both friend and virtual. */
10565 error ("virtual functions cannot be friends");
10566 RIDBIT_RESET (RID_FRIEND
, specbits
);
10569 if (decl_context
== NORMAL
)
10570 error ("friend declaration not in class definition");
10571 if (current_function_decl
&& funcdef_flag
)
10572 cp_error ("can't define friend function `%s' in a local class definition",
10576 /* Construct the function type and go to the next
10577 inner layer of declarator. */
10579 declarator
= TREE_OPERAND (declarator
, 0);
10581 /* FIXME: This is where default args should be fully
10584 arg_types
= grokparms (inner_parms
);
10586 if (declarator
&& flags
== DTOR_FLAG
)
10588 /* A destructor declared in the body of a class will
10589 be represented as a BIT_NOT_EXPR. But, we just
10590 want the underlying IDENTIFIER. */
10591 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10592 declarator
= TREE_OPERAND (declarator
, 0);
10594 if (arg_types
!= void_list_node
)
10596 cp_error ("destructors may not have parameters");
10597 arg_types
= void_list_node
;
10598 last_function_parms
= NULL_TREE
;
10602 /* ANSI says that `const int foo ();'
10603 does not make the function foo const. */
10604 type
= build_function_type (type
, arg_types
);
10608 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10609 if (TREE_PURPOSE (t
)
10610 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10612 add_defarg_fn (type
);
10621 /* Filter out pointers-to-references and references-to-references.
10622 We can get these if a TYPE_DECL is used. */
10624 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10626 error ("cannot declare %s to references",
10627 TREE_CODE (declarator
) == ADDR_EXPR
10628 ? "references" : "pointers");
10629 declarator
= TREE_OPERAND (declarator
, 0);
10633 if (TREE_CODE (type
) == OFFSET_TYPE
10634 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10635 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10637 cp_error ("cannot declare pointer to `%#T' member",
10639 type
= TREE_TYPE (type
);
10642 /* Merge any constancy or volatility into the target type
10643 for the pointer. */
10645 /* We now know that the TYPE_QUALS don't apply to the decl,
10646 but to the target of the pointer. */
10647 type_quals
= TYPE_UNQUALIFIED
;
10649 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10651 if (TREE_CODE (type
) == VOID_TYPE
)
10652 error ("invalid type: `void &'");
10654 type
= build_reference_type (type
);
10656 else if (TREE_CODE (type
) == METHOD_TYPE
)
10657 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10659 type
= build_pointer_type (type
);
10661 /* Process a list of type modifier keywords (such as
10662 const or volatile) that were given inside the `*' or `&'. */
10664 if (TREE_TYPE (declarator
))
10666 register tree typemodlist
;
10672 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10673 typemodlist
= TREE_CHAIN (typemodlist
))
10675 tree qualifier
= TREE_VALUE (typemodlist
);
10677 if (qualifier
== ridpointers
[(int) RID_CONST
])
10679 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10681 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10686 error ("invalid type modifier within pointer declarator");
10690 pedwarn ("duplicate `const'");
10692 pedwarn ("duplicate `volatile'");
10694 pedwarn ("duplicate `restrict'");
10696 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10697 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10698 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10699 if (TREE_CODE (declarator
) == ADDR_EXPR
10700 && (constp
|| volatilep
))
10703 pedwarn ("discarding `const' applied to a reference");
10705 pedwarn ("discarding `volatile' applied to a reference");
10706 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10708 type
= cp_build_qualified_type (type
, type_quals
);
10710 declarator
= TREE_OPERAND (declarator
, 0);
10716 /* We have converted type names to NULL_TREE if the
10717 name was bogus, or to a _TYPE node, if not.
10719 The variable CTYPE holds the type we will ultimately
10720 resolve to. The code here just needs to build
10721 up appropriate member types. */
10722 tree sname
= TREE_OPERAND (declarator
, 1);
10725 /* Destructors can have their visibilities changed as well. */
10726 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10727 sname
= TREE_OPERAND (sname
, 0);
10729 if (TREE_COMPLEXITY (declarator
) == 0)
10730 /* This needs to be here, in case we are called
10731 multiple times. */ ;
10732 else if (TREE_COMPLEXITY (declarator
) == -1)
10733 /* Namespace member. */
10734 pop_decl_namespace ();
10735 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10736 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10737 else if (! IS_AGGR_TYPE_CODE
10738 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10740 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10742 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10743 that refer to ctype. They couldn't be resolved earlier
10744 because we hadn't pushed into the class yet.
10745 Example: resolve 'B<T>::type' in
10746 'B<typename B<T>::type> B<T>::f () { }'. */
10747 if (current_template_parms
10748 && uses_template_parms (type
)
10749 && uses_template_parms (current_class_type
))
10751 tree args
= current_template_args ();
10752 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10755 /* This pop_nested_class corresponds to the
10756 push_nested_class used to push into class scope for
10757 parsing the argument list of a function decl, in
10759 pop_nested_class ();
10760 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10763 my_friendly_abort (16);
10765 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10767 /* We had a reference to a global decl, or
10768 perhaps we were given a non-aggregate typedef,
10769 in which case we cleared this out, and should just
10770 keep going as though it wasn't there. */
10771 declarator
= sname
;
10774 ctype
= TREE_OPERAND (declarator
, 0);
10777 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10779 /* You're supposed to have one `template <...>'
10780 for every template class, but you don't need one
10781 for a full specialization. For example:
10783 template <class T> struct S{};
10784 template <> struct S<int> { void f(); };
10785 void S<int>::f () {}
10787 is correct; there shouldn't be a `template <>' for
10788 the definition of `S<int>::f'. */
10789 if (CLASSTYPE_TEMPLATE_INFO (t
)
10790 && (CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
10791 || uses_template_parms (CLASSTYPE_TI_ARGS (t
)))
10792 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
)))
10793 template_count
+= 1;
10795 t
= TYPE_MAIN_DECL (t
);
10796 t
= DECL_CONTEXT (t
);
10799 if (sname
== NULL_TREE
)
10802 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10804 /* This is the `standard' use of the scoping operator:
10805 basetype :: member . */
10807 if (ctype
== current_class_type
)
10813 Is this ill-formed? */
10816 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10819 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10821 if (current_class_type
== NULL_TREE
|| friendp
)
10822 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10823 TYPE_ARG_TYPES (type
));
10826 cp_error ("cannot declare member function `%T::%s' within `%T'",
10827 ctype
, name
, current_class_type
);
10828 return void_type_node
;
10831 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10832 || COMPLETE_TYPE_P (complete_type (ctype
)))
10834 /* Have to move this code elsewhere in this function.
10835 this code is used for i.e., typedef int A::M; M *pm;
10837 It is? How? jason 10/2/94 */
10839 if (current_class_type
)
10841 cp_error ("cannot declare member `%T::%s' within `%T'",
10842 ctype
, name
, current_class_type
);
10843 return void_type_node
;
10845 type
= build_offset_type (ctype
, type
);
10849 incomplete_type_error (NULL_TREE
, ctype
);
10850 return error_mark_node
;
10853 declarator
= sname
;
10855 else if (TREE_CODE (sname
) == SCOPE_REF
)
10856 my_friendly_abort (17);
10860 declarator
= TREE_OPERAND (declarator
, 1);
10861 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10862 /* In this case, we will deal with it later. */
10866 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10867 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10868 TYPE_ARG_TYPES (type
));
10870 type
= build_offset_type (ctype
, type
);
10877 declarator
= TREE_OPERAND (declarator
, 0);
10882 case ENUMERAL_TYPE
:
10883 declarator
= NULL_TREE
;
10887 declarator
= NULL_TREE
;
10891 my_friendly_abort (158);
10895 /* See the comment for the TREE_LIST case, above. */
10898 if (! ignore_attrs
)
10899 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10901 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
10903 attrlist
= build_tree_list (NULL_TREE
, inner_attrs
);
10906 /* Now TYPE has the actual type. */
10908 if (explicitp
== 1 || (explicitp
&& friendp
))
10910 /* [dcl.fct.spec] The explicit specifier shall only be used in
10911 declarations of constructors within a class definition. */
10912 error ("only declarations of constructors can be `explicit'");
10916 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10918 if (current_class_name
== NULL_TREE
|| decl_context
== PARM
|| friendp
)
10920 error ("non-member `%s' cannot be declared `mutable'", name
);
10921 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10923 else if (decl_context
== TYPENAME
|| RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10925 error ("non-object member `%s' cannot be declared `mutable'", name
);
10926 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10928 else if (TREE_CODE (type
) == FUNCTION_TYPE
10929 || TREE_CODE (type
) == METHOD_TYPE
)
10931 error ("function `%s' cannot be declared `mutable'", name
);
10932 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10936 error ("static `%s' cannot be declared `mutable'", name
);
10937 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10939 else if (type_quals
& TYPE_QUAL_CONST
)
10941 error ("const `%s' cannot be declared `mutable'", name
);
10942 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10946 if (declarator
== NULL_TREE
10947 || TREE_CODE (declarator
) == IDENTIFIER_NODE
10948 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
10949 && (TREE_CODE (type
) == FUNCTION_TYPE
10950 || TREE_CODE (type
) == METHOD_TYPE
)))
10952 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10954 cp_error ("template-id `%D' used as a declarator", declarator
);
10955 declarator
= dname
;
10958 /* Unexpected declarator format. */
10959 my_friendly_abort (990210);
10961 /* If this is declaring a typedef name, return a TYPE_DECL. */
10963 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
10967 /* Note that the grammar rejects storage classes
10968 in typenames, fields or parameters. */
10969 if (current_lang_name
== lang_name_java
)
10970 TYPE_FOR_JAVA (type
) = 1;
10972 if (decl_context
== FIELD
)
10974 if (declarator
== constructor_name (current_class_type
))
10975 cp_pedwarn ("ISO C++ forbids nested type `%D' with same name as enclosing class",
10977 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10980 decl
= build_decl (TYPE_DECL
, declarator
, type
);
10982 /* If the user declares "typedef struct {...} foo" then the
10983 struct will have an anonymous name. Fill that name in now.
10984 Nothing can refer to it, so nothing needs know about the name
10986 if (type
!= error_mark_node
10988 && TYPE_NAME (type
)
10989 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
10990 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
10991 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
10993 tree oldname
= TYPE_NAME (type
);
10996 /* Replace the anonymous name with the real name everywhere. */
10997 lookup_tag_reverse (type
, declarator
);
10998 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
10999 if (TYPE_NAME (t
) == oldname
)
11000 TYPE_NAME (t
) = decl
;
11002 if (TYPE_LANG_SPECIFIC (type
))
11003 TYPE_WAS_ANONYMOUS (type
) = 1;
11005 /* If this is a typedef within a template class, the nested
11006 type is a (non-primary) template. The name for the
11007 template needs updating as well. */
11008 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
11009 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
11010 = TYPE_IDENTIFIER (type
);
11012 DECL_ASSEMBLER_NAME (decl
) = mangle_type (type
);
11014 /* FIXME remangle member functions; member functions of a
11015 type with external linkage have external linkage. */
11018 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11020 cp_error_at ("typedef name may not be class-qualified", decl
);
11025 if (ctype
== NULL_TREE
)
11027 if (TREE_CODE (type
) != METHOD_TYPE
)
11028 cp_error_at ("invalid type qualifier for non-member function type", decl
);
11030 ctype
= TYPE_METHOD_BASETYPE (type
);
11032 if (ctype
!= NULL_TREE
)
11033 grok_method_quals (ctype
, decl
, quals
);
11036 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
11037 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
11038 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
11040 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
11041 inlinep
, friendp
, raises
!= NULL_TREE
);
11044 error ("typedef declaration includes an initializer");
11049 /* Detect the case of an array type of unspecified size
11050 which came, as such, direct from a typedef name.
11051 We must copy the type, so that each identifier gets
11052 a distinct type, so that each identifier's size can be
11053 controlled separately by its own initializer. */
11055 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
11056 && TYPE_DOMAIN (type
) == NULL_TREE
)
11058 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
11061 /* If this is a type name (such as, in a cast or sizeof),
11062 compute the type and return it now. */
11064 if (decl_context
== TYPENAME
)
11066 /* Note that the grammar rejects storage classes
11067 in typenames, fields or parameters. */
11068 if (type_quals
!= TYPE_UNQUALIFIED
)
11069 type_quals
= TYPE_UNQUALIFIED
;
11071 /* Special case: "friend class foo" looks like a TYPENAME context. */
11074 if (type_quals
!= TYPE_UNQUALIFIED
)
11076 cp_error ("type qualifiers specified for friend class declaration");
11077 type_quals
= TYPE_UNQUALIFIED
;
11081 cp_error ("`inline' specified for friend class declaration");
11085 /* Until core issue 180 is resolved, allow 'friend typename A::B'.
11086 But don't allow implicit typenames except with a class-key. */
11087 if (!current_aggr
&& (TREE_CODE (type
) != TYPENAME_TYPE
11088 || IMPLICIT_TYPENAME_P (type
)))
11090 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
11091 cp_pedwarn ("template parameters cannot be friends");
11092 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
11094 friend declaration requires class-key, i.e. `friend class %T::%T'",
11095 constructor_name (current_class_type
),
11096 TYPE_IDENTIFIER (type
));
11099 friend declaration requires class-key, i.e. `friend %#T'",
11103 /* Only try to do this stuff if we didn't already give up. */
11104 if (type
!= integer_type_node
)
11106 decl_type_access_control (TYPE_NAME (type
));
11108 /* A friendly class? */
11109 if (current_class_type
)
11110 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
11112 cp_error ("trying to make class `%T' a friend of global scope",
11115 type
= void_type_node
;
11120 if (ctype
== NULL_TREE
)
11122 if (TREE_CODE (type
) != METHOD_TYPE
)
11123 cp_error ("invalid qualifiers on non-member function type");
11125 ctype
= TYPE_METHOD_BASETYPE (type
);
11129 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
11130 grok_method_quals (ctype
, dummy
, quals
);
11131 type
= TREE_TYPE (dummy
);
11137 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
11138 && decl_context
!= CATCHPARM
11139 && TREE_CODE (type
) != UNION_TYPE
11142 cp_error ("abstract declarator `%T' used as declaration", type
);
11143 declarator
= make_anon_name ();
11146 /* `void' at top level (not within pointer)
11147 is allowed only in typedefs or type names.
11148 We don't complain about parms either, but that is because
11149 a better error message can be made later. */
11151 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
11154 error ("unnamed variable or field declared void");
11155 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
11157 if (IDENTIFIER_OPNAME_P (declarator
))
11158 my_friendly_abort (356);
11160 error ("variable or field `%s' declared void", name
);
11163 error ("variable or field declared void");
11164 type
= integer_type_node
;
11167 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
11168 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
11170 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
11172 if (ctype
|| in_namespace
)
11173 error ("cannot use `::' in parameter declaration");
11175 /* A parameter declared as an array of T is really a pointer to T.
11176 One declared as a function is really a pointer to a function.
11177 One declared as a member is really a pointer to member. */
11179 if (TREE_CODE (type
) == ARRAY_TYPE
)
11181 /* Transfer const-ness of array into that of type pointed to. */
11182 type
= build_pointer_type (TREE_TYPE (type
));
11183 type_quals
= TYPE_UNQUALIFIED
;
11185 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11186 type
= build_pointer_type (type
);
11187 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11188 type
= build_pointer_type (type
);
11192 register tree decl
;
11194 if (decl_context
== PARM
)
11196 decl
= build_decl (PARM_DECL
, declarator
, type
);
11198 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
11199 inlinep
, friendp
, raises
!= NULL_TREE
);
11201 /* Compute the type actually passed in the parmlist,
11202 for the case where there is no prototype.
11203 (For example, shorts and chars are passed as ints.)
11204 When there is a prototype, this is overridden later. */
11206 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
11208 else if (decl_context
== FIELD
)
11210 if (type
== error_mark_node
)
11212 /* Happens when declaring arrays of sizes which
11213 are error_mark_node, for example. */
11216 else if (in_namespace
&& !friendp
)
11218 /* Something like struct S { int N::j; }; */
11219 cp_error ("invalid use of `::'");
11222 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11225 tree function_context
;
11227 /* We catch the others as conflicts with the builtin
11229 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
11231 cp_error ("function `%D' cannot be declared friend",
11238 if (ctype
== NULL_TREE
)
11239 ctype
= current_class_type
;
11241 if (ctype
== NULL_TREE
)
11243 cp_error ("can't make `%D' into a method -- not in a class",
11245 return void_type_node
;
11248 /* ``A union may [ ... ] not [ have ] virtual functions.''
11250 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
11252 cp_error ("function `%D' declared virtual inside a union",
11254 return void_type_node
;
11257 if (declarator
== ansi_opname (NEW_EXPR
)
11258 || declarator
== ansi_opname (VEC_NEW_EXPR
)
11259 || declarator
== ansi_opname (DELETE_EXPR
)
11260 || declarator
== ansi_opname (VEC_DELETE_EXPR
))
11264 cp_error ("`%D' cannot be declared virtual, since it is always static",
11269 else if (staticp
< 2)
11270 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11271 TYPE_ARG_TYPES (type
));
11274 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
11275 function_context
= (ctype
!= NULL_TREE
) ?
11276 decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
11277 publicp
= (! friendp
|| ! staticp
)
11278 && function_context
== NULL_TREE
;
11279 decl
= grokfndecl (ctype
, type
,
11280 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
11281 ? declarator
: dname
,
11283 virtualp
, flags
, quals
, raises
,
11284 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
11285 funcdef_flag
, template_count
, in_namespace
);
11286 if (decl
== NULL_TREE
)
11289 /* This clobbers the attrs stored in `decl' from `attrlist'. */
11290 /* The decl and setting of decl_machine_attr is also turned off. */
11291 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
11294 /* [class.conv.ctor]
11296 A constructor declared without the function-specifier
11297 explicit that can be called with a single parameter
11298 specifies a conversion from the type of its first
11299 parameter to the type of its class. Such a constructor
11300 is called a converting constructor. */
11301 if (explicitp
== 2)
11302 DECL_NONCONVERTING_P (decl
) = 1;
11303 else if (DECL_CONSTRUCTOR_P (decl
))
11305 /* The constructor can be called with exactly one
11306 parameter if there is at least one parameter, and
11307 any subsequent parameters have default arguments.
11308 Ignore any compiler-added parms. */
11309 tree arg_types
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
11311 if (arg_types
== void_list_node
11313 && TREE_CHAIN (arg_types
)
11314 && TREE_CHAIN (arg_types
) != void_list_node
11315 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
11316 DECL_NONCONVERTING_P (decl
) = 1;
11319 else if (TREE_CODE (type
) == METHOD_TYPE
)
11321 /* We only get here for friend declarations of
11322 members of other classes. */
11323 /* All method decls are public, so tell grokfndecl to set
11324 TREE_PUBLIC, also. */
11325 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
11326 virtualp
, flags
, quals
, raises
,
11327 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
11328 template_count
, in_namespace
);
11329 if (decl
== NULL_TREE
)
11332 else if (!staticp
&& ! processing_template_decl
11333 && !COMPLETE_TYPE_P (complete_type (type
))
11334 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
11337 cp_error ("field `%D' has incomplete type", declarator
);
11339 cp_error ("name `%T' has incomplete type", type
);
11341 /* If we're instantiating a template, tell them which
11342 instantiation made the field's type be incomplete. */
11343 if (current_class_type
11344 && TYPE_NAME (current_class_type
)
11345 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
11346 && declspecs
&& TREE_VALUE (declspecs
)
11347 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
11348 cp_error (" in instantiation of template `%T'",
11349 current_class_type
);
11351 type
= error_mark_node
;
11358 error ("`%s' is neither function nor member function; cannot be declared friend",
11359 IDENTIFIER_POINTER (declarator
));
11367 /* Friends are treated specially. */
11368 if (ctype
== current_class_type
)
11369 warning ("member functions are implicitly friends of their class");
11372 tree t
= NULL_TREE
;
11373 if (decl
&& DECL_NAME (decl
))
11375 if (template_class_depth (current_class_type
) == 0)
11378 = check_explicit_specialization
11380 template_count
, 2 * (funcdef_flag
!= 0) + 4);
11381 if (decl
== error_mark_node
)
11382 return error_mark_node
;
11385 t
= do_friend (ctype
, declarator
, decl
,
11386 last_function_parms
, attrlist
, flags
, quals
,
11389 if (t
&& funcdef_flag
)
11392 return void_type_node
;
11396 /* Structure field. It may not be a function, except for C++ */
11398 if (decl
== NULL_TREE
)
11404 /* An attempt is being made to initialize a non-static
11405 member. But, from [class.mem]:
11407 4 A member-declarator can contain a
11408 constant-initializer only if it declares a static
11409 member (_class.static_) of integral or enumeration
11410 type, see _class.static.data_.
11412 This used to be relatively common practice, but
11413 the rest of the compiler does not correctly
11414 handle the initialization unless the member is
11415 static so we make it static below. */
11416 cp_pedwarn ("ISO C++ forbids initialization of member `%D'",
11418 cp_pedwarn ("making `%D' static", declarator
);
11422 if (uses_template_parms (type
))
11423 /* We'll check at instantiation time. */
11425 else if (check_static_variable_definition (declarator
,
11427 /* If we just return the declaration, crashes
11428 will sometimes occur. We therefore return
11429 void_type_node, as if this was a friend
11430 declaration, to cause callers to completely
11431 ignore this declaration. */
11432 return void_type_node
;
11435 /* 9.2p13 [class.mem] */
11436 if (declarator
== constructor_name (current_class_type
)
11437 /* The standard does not allow non-static data members
11438 here either, but we agreed at the 10/99 meeting
11439 to change that in TC 1 so that they are allowed in
11440 classes with no user-defined constructors. */
11442 cp_pedwarn ("ISO C++ forbids static data member `%D' with same name as enclosing class",
11447 /* C++ allows static class members. All other work
11448 for this is done by grokfield. */
11449 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
11450 TREE_STATIC (decl
) = 1;
11451 /* In class context, 'static' means public access. */
11452 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
11456 decl
= build_decl (FIELD_DECL
, declarator
, type
);
11457 DECL_NONADDRESSABLE_P (decl
) = bitfield
;
11458 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11460 DECL_MUTABLE_P (decl
) = 1;
11461 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11465 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
11466 inlinep
, friendp
, raises
!= NULL_TREE
);
11469 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11471 tree original_name
;
11477 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11478 original_name
= dname
;
11480 original_name
= declarator
;
11482 if (RIDBIT_SETP (RID_AUTO
, specbits
))
11483 error ("storage class `auto' invalid for function `%s'", name
);
11484 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11485 error ("storage class `register' invalid for function `%s'", name
);
11487 /* Function declaration not at top level.
11488 Storage classes other than `extern' are not allowed
11489 and `extern' makes no difference. */
11490 if (! toplevel_bindings_p ()
11491 && (RIDBIT_SETP (RID_STATIC
, specbits
)
11492 || RIDBIT_SETP (RID_INLINE
, specbits
))
11495 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11496 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
11498 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
11501 if (ctype
== NULL_TREE
)
11505 error ("virtual non-class function `%s'", name
);
11509 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
11510 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11511 TYPE_ARG_TYPES (type
));
11513 /* Record presence of `static'. */
11514 publicp
= (ctype
!= NULL_TREE
11515 || RIDBIT_SETP (RID_EXTERN
, specbits
)
11516 || !RIDBIT_SETP (RID_STATIC
, specbits
));
11518 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
11519 virtualp
, flags
, quals
, raises
,
11521 publicp
, inlinep
, funcdef_flag
,
11522 template_count
, in_namespace
);
11523 if (decl
== NULL_TREE
)
11528 int illegal_static
= 0;
11530 /* Don't allow a static member function in a class, and forbid
11531 declaring main to be static. */
11532 if (TREE_CODE (type
) == METHOD_TYPE
)
11534 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11535 illegal_static
= 1;
11537 else if (current_function_decl
)
11539 /* FIXME need arm citation */
11540 error ("cannot declare static function inside another function");
11541 illegal_static
= 1;
11544 if (illegal_static
)
11547 RIDBIT_RESET (RID_STATIC
, specbits
);
11553 /* It's a variable. */
11555 /* An uninitialized decl with `extern' is a reference. */
11556 decl
= grokvardecl (type
, declarator
, &specbits
,
11558 (type_quals
& TYPE_QUAL_CONST
) != 0,
11560 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11561 inlinep
, friendp
, raises
!= NULL_TREE
);
11565 DECL_CONTEXT (decl
) = ctype
;
11568 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11570 RIDBIT_RESET (RID_STATIC
, specbits
);
11572 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11574 cp_error ("static member `%D' declared `register'", decl
);
11575 RIDBIT_RESET (RID_REGISTER
, specbits
);
11577 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11579 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11581 RIDBIT_RESET (RID_EXTERN
, specbits
);
11586 my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE
, specbits
), 19990927);
11588 /* Record `register' declaration for warnings on &
11589 and in case doing stupid register allocation. */
11591 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11592 DECL_REGISTER (decl
) = 1;
11594 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11595 DECL_THIS_EXTERN (decl
) = 1;
11597 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11598 DECL_THIS_STATIC (decl
) = 1;
11600 /* Record constancy and volatility. There's no need to do this
11601 when processing a template; we'll do this for the instantiated
11602 declaration based on the type of DECL. */
11603 if (!processing_template_decl
)
11604 c_apply_type_quals_to_decl (type_quals
, decl
);
11610 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11611 An empty exprlist is a parmlist. An exprlist which
11612 contains only identifiers at the global level
11613 is a parmlist. Otherwise, it is an exprlist. */
11616 parmlist_is_exprlist (exprs
)
11619 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11622 if (toplevel_bindings_p ())
11624 /* At the global level, if these are all identifiers,
11625 then it is a parmlist. */
11628 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11630 exprs
= TREE_CHAIN (exprs
);
11637 /* Subroutine of start_function. Ensure that each of the parameter
11638 types (as listed in PARMS) is complete, as is required for a
11639 function definition. */
11642 require_complete_types_for_parms (parms
)
11645 for (; parms
; parms
= TREE_CHAIN (parms
))
11647 if (VOID_TYPE_P (TREE_TYPE (parms
)))
11648 /* grokparms will have already issued an error */
11649 TREE_TYPE (parms
) = error_mark_node
;
11650 else if (complete_type_or_else (TREE_TYPE (parms
), parms
))
11651 layout_decl (parms
, 0);
11653 TREE_TYPE (parms
) = error_mark_node
;
11657 /* Returns non-zero if T is a local variable. */
11660 local_variable_p (t
)
11663 if ((TREE_CODE (t
) == VAR_DECL
11664 /* A VAR_DECL with a context that is a _TYPE is a static data
11666 && !TYPE_P (CP_DECL_CONTEXT (t
))
11667 /* Any other non-local variable must be at namespace scope. */
11668 && !DECL_NAMESPACE_SCOPE_P (t
))
11669 || (TREE_CODE (t
) == PARM_DECL
))
11675 /* Returns non-zero if T is an automatic local variable or a label.
11676 (These are the declarations that need to be remapped when the code
11677 containing them is duplicated.) */
11680 nonstatic_local_decl_p (t
)
11683 return ((local_variable_p (t
) && !TREE_STATIC (t
))
11684 || TREE_CODE (t
) == LABEL_DECL
11685 || TREE_CODE (t
) == RESULT_DECL
);
11688 /* Like local_variable_p, but suitable for use as a tree-walking
11692 local_variable_p_walkfn (tp
, walk_subtrees
, data
)
11694 int *walk_subtrees ATTRIBUTE_UNUSED
;
11695 void *data ATTRIBUTE_UNUSED
;
11697 return ((local_variable_p (*tp
) && !DECL_ARTIFICIAL (*tp
))
11698 ? *tp
: NULL_TREE
);
11701 /* Check that ARG, which is a default-argument expression for a
11702 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11703 something goes wrong. DECL may also be a _TYPE node, rather than a
11704 DECL, if there is no DECL available. */
11707 check_default_argument (decl
, arg
)
11714 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11715 /* We get a DEFAULT_ARG when looking at an in-class declaration
11716 with a default argument. Ignore the argument for now; we'll
11717 deal with it after the class is complete. */
11720 if (processing_template_decl
|| uses_template_parms (arg
))
11721 /* We don't do anything checking until instantiation-time. Note
11722 that there may be uninstantiated arguments even for an
11723 instantiated function, since default arguments are not
11724 instantiated until they are needed. */
11733 decl_type
= TREE_TYPE (decl
);
11735 if (arg
== error_mark_node
11736 || decl
== error_mark_node
11737 || TREE_TYPE (arg
) == error_mark_node
11738 || decl_type
== error_mark_node
)
11739 /* Something already went wrong. There's no need to check
11741 return error_mark_node
;
11743 /* [dcl.fct.default]
11745 A default argument expression is implicitly converted to the
11747 if (!TREE_TYPE (arg
)
11748 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11751 cp_error ("default argument for `%#D' has type `%T'",
11752 decl
, TREE_TYPE (arg
));
11754 cp_error ("default argument for parameter of type `%T' has type `%T'",
11755 decl_type
, TREE_TYPE (arg
));
11757 return error_mark_node
;
11760 /* [dcl.fct.default]
11762 Local variables shall not be used in default argument
11765 The keyword `this' shall not be used in a default argument of a
11766 member function. */
11767 var
= walk_tree_without_duplicates (&arg
, local_variable_p_walkfn
,
11771 cp_error ("default argument `%E' uses local variable `%D'",
11773 return error_mark_node
;
11780 /* Decode the list of parameter types for a function type.
11781 Given the list of things declared inside the parens,
11782 return a list of types.
11784 We determine whether ellipsis parms are used by PARMLIST_ELLIPSIS_P
11785 flag. If unset, we append void_list_node. A parmlist declared
11786 as `(void)' is accepted as the empty parmlist.
11788 Also set last_function_parms to the chain of PARM_DECLs. */
11791 grokparms (first_parm
)
11794 tree result
= NULL_TREE
;
11795 tree decls
= NULL_TREE
;
11796 int ellipsis
= !first_parm
|| PARMLIST_ELLIPSIS_P (first_parm
);
11800 my_friendly_assert (!first_parm
|| TREE_PARMLIST (first_parm
), 20001115);
11802 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11804 tree type
= NULL_TREE
;
11805 register tree decl
= TREE_VALUE (parm
);
11806 tree init
= TREE_PURPOSE (parm
);
11808 chain
= TREE_CHAIN (parm
);
11809 /* @@ weak defense against parse errors. */
11810 if (TREE_CODE (decl
) != VOID_TYPE
11811 && TREE_CODE (decl
) != TREE_LIST
)
11813 /* Give various messages as the need arises. */
11814 if (TREE_CODE (decl
) == STRING_CST
)
11815 cp_error ("invalid string constant `%E'", decl
);
11816 else if (TREE_CODE (decl
) == INTEGER_CST
)
11817 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11821 if (parm
== void_list_node
)
11824 decl
= grokdeclarator (TREE_VALUE (decl
), TREE_PURPOSE (decl
),
11825 PARM
, init
!= NULL_TREE
, NULL_TREE
);
11826 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
11829 type
= TREE_TYPE (decl
);
11830 if (VOID_TYPE_P (type
))
11832 if (same_type_p (type
, void_type_node
)
11833 && !DECL_NAME (decl
) && !result
&& !chain
&& !ellipsis
)
11834 /* this is a parmlist of `(void)', which is ok. */
11836 incomplete_type_error (decl
, type
);
11837 /* It's not a good idea to actually create parameters of
11838 type `void'; other parts of the compiler assume that a
11839 void type terminates the parameter list. */
11840 type
= error_mark_node
;
11841 TREE_TYPE (decl
) = error_mark_node
;
11844 if (type
!= error_mark_node
)
11846 /* Top-level qualifiers on the parameters are
11847 ignored for function types. */
11848 type
= TYPE_MAIN_VARIANT (type
);
11849 if (TREE_CODE (type
) == METHOD_TYPE
)
11851 cp_error ("parameter `%D' invalidly declared method type", decl
);
11852 type
= build_pointer_type (type
);
11853 TREE_TYPE (decl
) = type
;
11855 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11857 cp_error ("parameter `%D' invalidly declared offset type", decl
);
11858 type
= build_pointer_type (type
);
11859 TREE_TYPE (decl
) = type
;
11861 else if (abstract_virtuals_error (decl
, type
))
11862 any_error
= 1; /* Seems like a good idea. */
11863 else if (POINTER_TYPE_P (type
))
11865 /* [dcl.fct]/6, parameter types cannot contain pointers
11866 (references) to arrays of unknown bound. */
11867 tree t
= TREE_TYPE (type
);
11868 int ptr
= TYPE_PTR_P (type
);
11872 if (TYPE_PTR_P (t
))
11874 else if (TREE_CODE (t
) != ARRAY_TYPE
)
11876 else if (!TYPE_DOMAIN (t
))
11880 if (TREE_CODE (t
) == ARRAY_TYPE
)
11881 cp_error ("parameter `%D' includes %s to array of unknown bound `%T'",
11882 decl
, ptr
? "pointer" : "reference", t
);
11885 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
11886 if (PROMOTE_PROTOTYPES
11887 && (TREE_CODE (type
) == INTEGER_TYPE
11888 || TREE_CODE (type
) == ENUMERAL_TYPE
)
11889 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
11890 DECL_ARG_TYPE (decl
) = integer_type_node
;
11891 if (!any_error
&& init
)
11892 init
= check_default_argument (decl
, init
);
11897 TREE_CHAIN (decl
) = decls
;
11899 result
= tree_cons (init
, type
, result
);
11901 decls
= nreverse (decls
);
11902 result
= nreverse (result
);
11904 result
= chainon (result
, void_list_node
);
11905 last_function_parms
= decls
;
11911 /* D is a constructor or overloaded `operator='. Returns non-zero if
11912 D's arguments allow it to be a copy constructor, or copy assignment
11921 if (!DECL_FUNCTION_MEMBER_P (d
))
11924 t
= FUNCTION_FIRST_USER_PARMTYPE (d
);
11925 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
11926 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
11927 == DECL_CONTEXT (d
))
11928 && (TREE_CHAIN (t
) == NULL_TREE
11929 || TREE_CHAIN (t
) == void_list_node
11930 || TREE_PURPOSE (TREE_CHAIN (t
))))
11935 /* These memoizing functions keep track of special properties which
11936 a class may have. `grok_ctor_properties' notices whether a class
11937 has a constructor of the form X(X&), and also complains
11938 if the class has a constructor of the form X(X).
11939 `grok_op_properties' takes notice of the various forms of
11940 operator= which are defined, as well as what sorts of type conversion
11941 may apply. Both functions take a FUNCTION_DECL as an argument. */
11944 grok_ctor_properties (ctype
, decl
)
11947 tree parmtypes
= FUNCTION_FIRST_USER_PARMTYPE (decl
);
11948 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
11952 A non-template constructor for class X is a copy constructor if
11953 its first parameter is of type X&, const X&, volatile X& or const
11954 volatile X&, and either there are no other parameters or else all
11955 other parameters have default arguments. */
11956 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
11957 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
11958 && sufficient_parms_p (TREE_CHAIN (parmtypes
))
11959 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11960 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11962 TYPE_HAS_INIT_REF (ctype
) = 1;
11963 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
11964 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
11968 A declaration of a constructor for a class X is ill-formed if its
11969 first parameter is of type (optionally cv-qualified) X and either
11970 there are no other parameters or else all other parameters have
11973 We *don't* complain about member template instantiations that
11974 have this form, though; they can occur as we try to decide what
11975 constructor to use during overload resolution. Since overload
11976 resolution will never prefer such a constructor to the
11977 non-template copy constructor (which is either explicitly or
11978 implicitly defined), there's no need to worry about their
11979 existence. Theoretically, they should never even be
11980 instantiated, but that's hard to forestall. */
11981 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
11982 && sufficient_parms_p (TREE_CHAIN (parmtypes
))
11983 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
11984 && is_member_template (DECL_TI_TEMPLATE (decl
))))
11986 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
11988 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
11991 else if (TREE_CODE (parmtype
) == VOID_TYPE
11992 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
11993 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
11998 /* An operator with this code is unary, but can also be binary. */
12002 enum tree_code code
;
12004 return (code
== INDIRECT_REF
12005 || code
== ADDR_EXPR
12006 || code
== CONVERT_EXPR
12007 || code
== NEGATE_EXPR
12008 || code
== PREINCREMENT_EXPR
12009 || code
== PREDECREMENT_EXPR
);
12012 /* An operator with this name can only be unary. */
12016 enum tree_code code
;
12018 return (code
== TRUTH_NOT_EXPR
12019 || code
== BIT_NOT_EXPR
12020 || code
== COMPONENT_REF
12021 || code
== TYPE_EXPR
);
12024 /* Do a little sanity-checking on how they declared their operator. */
12027 grok_op_properties (decl
, virtualp
, friendp
)
12029 int virtualp
, friendp
;
12031 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
12033 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
12034 tree name
= DECL_NAME (decl
);
12035 enum tree_code operator_code
;
12038 /* Count the number of arguments. */
12039 for (argtype
= argtypes
, arity
= 0;
12040 argtype
&& argtype
!= void_list_node
;
12041 argtype
= TREE_CHAIN (argtype
))
12044 if (current_class_type
== NULL_TREE
)
12047 if (DECL_CONV_FN_P (decl
))
12048 operator_code
= TYPE_EXPR
;
12052 #define DEF_OPERATOR(NAME, CODE, NEW_MANGLING, OLD_MANGING, ARITY, ASSN_P) \
12053 if (ansi_opname (CODE) == name) \
12055 operator_code = CODE; \
12058 else if (ansi_assopname (CODE) == name) \
12060 operator_code = CODE; \
12061 DECL_ASSIGNMENT_OPERATOR_P (decl) = 1; \
12065 #include "operators.def"
12066 #undef DEF_OPERATOR
12068 my_friendly_abort (20000527);
12071 my_friendly_assert (operator_code
!= LAST_CPLUS_TREE_CODE
, 20000526);
12072 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12076 switch (operator_code
)
12079 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
12083 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
12086 case COMPONENT_REF
:
12088 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
12092 TYPE_HAS_NEW_OPERATOR (current_class_type
) = 1;
12096 TYPE_GETS_DELETE (current_class_type
) |= 1;
12100 TYPE_HAS_ARRAY_NEW_OPERATOR (current_class_type
) = 1;
12103 case VEC_DELETE_EXPR
:
12104 TYPE_GETS_DELETE (current_class_type
) |= 2;
12112 if (operator_code
== NEW_EXPR
|| operator_code
== VEC_NEW_EXPR
)
12114 /* When the compiler encounters the definition of A::operator new, it
12115 doesn't look at the class declaration to find out if it's static. */
12117 revert_static_member_fn (decl
);
12119 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
12121 else if (operator_code
== DELETE_EXPR
|| operator_code
== VEC_DELETE_EXPR
)
12124 revert_static_member_fn (decl
);
12126 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
12130 /* An operator function must either be a non-static member function
12131 or have at least one parameter of a class, a reference to a class,
12132 an enumeration, or a reference to an enumeration. 13.4.0.6 */
12133 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
12135 if (operator_code
== TYPE_EXPR
12136 || operator_code
== CALL_EXPR
12137 || operator_code
== COMPONENT_REF
12138 || operator_code
== ARRAY_REF
12139 || operator_code
== NOP_EXPR
)
12140 cp_error ("`%D' must be a nonstatic member function", decl
);
12145 if (DECL_STATIC_FUNCTION_P (decl
))
12146 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
12149 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
12151 tree arg
= TREE_VALUE (p
);
12152 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
12153 arg
= TREE_TYPE (arg
);
12155 /* This lets bad template code slip through. */
12156 if (IS_AGGR_TYPE (arg
)
12157 || TREE_CODE (arg
) == ENUMERAL_TYPE
12158 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
12159 || TREE_CODE (arg
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
12163 ("`%D' must have an argument of class or enumerated type",
12170 if (operator_code
== CALL_EXPR
)
12171 return; /* No restrictions on args. */
12173 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
12175 tree t
= TREE_TYPE (name
);
12178 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
12179 const char *what
= 0;
12182 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
12184 if (TREE_CODE (t
) == VOID_TYPE
)
12186 else if (t
== current_class_type
)
12187 what
= "the same type";
12188 /* Don't force t to be complete here. */
12189 else if (IS_AGGR_TYPE (t
)
12190 && COMPLETE_TYPE_P (t
)
12191 && DERIVED_FROM_P (t
, current_class_type
))
12192 what
= "a base class";
12195 warning ("conversion to %s%s will never use a type conversion operator",
12196 ref
? "a reference to " : "", what
);
12200 if (DECL_ASSIGNMENT_OPERATOR_P (decl
)
12201 && operator_code
== NOP_EXPR
)
12205 if (arity
!= 2 && methodp
)
12207 cp_error ("`%D' must take exactly one argument", decl
);
12210 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
12214 A user-declared copy assignment operator X::operator= is
12215 a non-static non-template member function of class X with
12216 exactly one parameter of type X, X&, const X&, volatile
12217 X& or const volatile X&. */
12218 if (copy_assignment_arg_p (parmtype
, virtualp
)
12219 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12220 && is_member_template (DECL_TI_TEMPLATE (decl
)))
12223 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
12224 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
12225 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12226 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
12229 else if (operator_code
== COND_EXPR
)
12232 cp_error ("ISO C++ prohibits overloading operator ?:");
12234 else if (ambi_op_p (operator_code
))
12237 /* We pick the one-argument operator codes by default, so
12238 we don't have to change anything. */
12240 else if (arity
== 2)
12242 /* If we thought this was a unary operator, we now know
12243 it to be a binary operator. */
12244 switch (operator_code
)
12247 operator_code
= MULT_EXPR
;
12251 operator_code
= BIT_AND_EXPR
;
12255 operator_code
= PLUS_EXPR
;
12259 operator_code
= MINUS_EXPR
;
12262 case PREINCREMENT_EXPR
:
12263 operator_code
= POSTINCREMENT_EXPR
;
12266 case PREDECREMENT_EXPR
:
12267 operator_code
= POSTDECREMENT_EXPR
;
12271 my_friendly_abort (20000527);
12274 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12276 if ((operator_code
== POSTINCREMENT_EXPR
12277 || operator_code
== POSTDECREMENT_EXPR
)
12278 && ! processing_template_decl
12279 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
12282 cp_error ("postfix `%D' must take `int' as its argument",
12286 ("postfix `%D' must take `int' as its second argument",
12293 cp_error ("`%D' must take either zero or one argument", decl
);
12295 cp_error ("`%D' must take either one or two arguments", decl
);
12298 /* More Effective C++ rule 6. */
12300 && (operator_code
== POSTINCREMENT_EXPR
12301 || operator_code
== POSTDECREMENT_EXPR
12302 || operator_code
== PREINCREMENT_EXPR
12303 || operator_code
== PREDECREMENT_EXPR
))
12305 tree arg
= TREE_VALUE (argtypes
);
12306 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
12307 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
12308 arg
= TREE_TYPE (arg
);
12309 arg
= TYPE_MAIN_VARIANT (arg
);
12310 if (operator_code
== PREINCREMENT_EXPR
12311 || operator_code
== PREDECREMENT_EXPR
)
12313 if (TREE_CODE (ret
) != REFERENCE_TYPE
12314 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
12316 cp_warning ("prefix `%D' should return `%T'", decl
,
12317 build_reference_type (arg
));
12321 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
12322 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
12326 else if (unary_op_p (operator_code
))
12331 cp_error ("`%D' must take `void'", decl
);
12333 cp_error ("`%D' must take exactly one argument", decl
);
12336 else /* if (binary_op_p (operator_code)) */
12341 cp_error ("`%D' must take exactly one argument", decl
);
12343 cp_error ("`%D' must take exactly two arguments", decl
);
12346 /* More Effective C++ rule 7. */
12348 && (operator_code
== TRUTH_ANDIF_EXPR
12349 || operator_code
== TRUTH_ORIF_EXPR
12350 || operator_code
== COMPOUND_EXPR
))
12351 cp_warning ("user-defined `%D' always evaluates both arguments",
12355 /* Effective C++ rule 23. */
12358 && (operator_code
== PLUS_EXPR
12359 || operator_code
== MINUS_EXPR
12360 || operator_code
== TRUNC_DIV_EXPR
12361 || operator_code
== MULT_EXPR
)
12362 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
12363 cp_warning ("`%D' should return by value", decl
);
12366 for (; argtypes
&& argtypes
!= void_list_node
;
12367 argtypes
= TREE_CHAIN (argtypes
))
12368 if (TREE_PURPOSE (argtypes
))
12370 TREE_PURPOSE (argtypes
) = NULL_TREE
;
12371 if (operator_code
== POSTINCREMENT_EXPR
12372 || operator_code
== POSTDECREMENT_EXPR
)
12375 cp_pedwarn ("`%D' cannot have default arguments", decl
);
12378 cp_error ("`%D' cannot have default arguments", decl
);
12384 static const char *
12386 enum tag_types code
;
12399 my_friendly_abort (981122);
12403 /* Get the struct, enum or union (CODE says which) with tag NAME.
12404 Define the tag as a forward-reference if it is not defined.
12406 C++: If a class derivation is given, process it here, and report
12407 an error if multiple derivation declarations are not identical.
12409 If this is a definition, come in through xref_tag and only look in
12410 the current frame for the name (since C++ allows new names in any
12414 xref_tag (code_type_node
, name
, globalize
)
12415 tree code_type_node
;
12419 enum tag_types tag_code
;
12420 enum tree_code code
;
12421 register tree ref
, t
;
12422 struct binding_level
*b
= current_binding_level
;
12424 tree attributes
= NULL_TREE
;
12425 tree context
= NULL_TREE
;
12427 /* If we are called from the parser, code_type_node will sometimes be a
12428 TREE_LIST. This indicates that the user wrote
12429 "class __attribute__ ((foo)) bar". Extract the attributes so we can
12431 if (TREE_CODE (code_type_node
) == TREE_LIST
)
12433 attributes
= TREE_PURPOSE (code_type_node
);
12434 code_type_node
= TREE_VALUE (code_type_node
);
12437 tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12442 code
= RECORD_TYPE
;
12448 code
= ENUMERAL_TYPE
;
12451 my_friendly_abort (18);
12454 /* If a cross reference is requested, look up the type
12455 already defined for this tag and return it. */
12459 name
= TYPE_IDENTIFIER (t
);
12463 t
= IDENTIFIER_TYPE_VALUE (name
);
12465 /* Warn about 'friend struct Inherited;' doing the wrong thing. */
12466 if (t
&& globalize
&& TREE_CODE (t
) == TYPENAME_TYPE
)
12468 static int explained
;
12470 cp_warning ("`%s %T' declares a new type at namespace scope;\n\
12471 to refer to the inherited type, say `%s %T::%T'%s",
12472 tag_name (tag_code
), name
, tag_name (tag_code
),
12473 constructor_name (current_class_type
), TYPE_IDENTIFIER (t
),
12475 (names from dependent base classes are not visible to unqualified name lookup)"
12481 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
12482 && TREE_CODE (t
) != BOUND_TEMPLATE_TEMPLATE_PARM
)
12487 /* If we know we are defining this tag, only look it up in
12488 this scope and don't try to find it as a type. */
12489 ref
= lookup_tag (code
, name
, b
, 1);
12495 /* [dcl.type.elab] If the identifier resolves to a
12496 typedef-name or a template type-parameter, the
12497 elaborated-type-specifier is ill-formed. */
12498 if (t
!= TYPE_MAIN_VARIANT (t
)
12499 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
12500 cp_pedwarn ("using typedef-name `%D' after `%s'",
12501 TYPE_NAME (t
), tag_name (tag_code
));
12502 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12503 cp_error ("using template type parameter `%T' after `%s'",
12504 t
, tag_name (tag_code
));
12509 ref
= lookup_tag (code
, name
, b
, 0);
12513 /* Try finding it as a type declaration. If that wins,
12515 ref
= lookup_name (name
, 1);
12517 if (ref
!= NULL_TREE
12518 && processing_template_decl
12519 && DECL_CLASS_TEMPLATE_P (ref
)
12520 && template_class_depth (current_class_type
) == 0)
12521 /* Since GLOBALIZE is true, we're declaring a global
12522 template, so we want this type. */
12523 ref
= DECL_TEMPLATE_RESULT (ref
);
12525 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12526 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12527 ref
= TREE_TYPE (ref
);
12532 if (ref
&& current_class_type
12533 && template_class_depth (current_class_type
)
12534 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12536 /* Since GLOBALIZE is non-zero, we are not looking at a
12537 definition of this tag. Since, in addition, we are currently
12538 processing a (member) template declaration of a template
12539 class, we must be very careful; consider:
12546 { template <class V>
12547 friend struct S1; };
12549 Here, the S2::S1 declaration should not be confused with the
12550 outer declaration. In particular, the inner version should
12551 have a template parameter of level 2, not level 1. This
12552 would be particularly important if the member declaration
12555 template <class V = U> friend struct S1;
12557 say, when we should tsubst into `U' when instantiating
12558 S2. On the other hand, when presented with:
12568 we must find the inner binding eventually. We
12569 accomplish this by making sure that the new type we
12570 create to represent this declaration has the right
12572 context
= TYPE_CONTEXT (ref
);
12579 /* If no such tag is yet defined, create a forward-reference node
12580 and record it as the "definition".
12581 When a real declaration of this type is found,
12582 the forward-reference will be altered into a real type. */
12583 if (code
== ENUMERAL_TYPE
)
12585 cp_error ("use of enum `%#D' without previous declaration", name
);
12587 ref
= make_node (ENUMERAL_TYPE
);
12589 /* Give the type a default layout like unsigned int
12590 to avoid crashing if it does not get defined. */
12591 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12592 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12593 TYPE_USER_ALIGN (ref
) = 0;
12594 TREE_UNSIGNED (ref
) = 1;
12595 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12596 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12597 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12599 /* Enable us to recognize when a type is created in class context.
12600 To do nested classes correctly, this should probably be cleared
12601 out when we leave this classes scope. Currently this in only
12602 done in `start_enum'. */
12604 pushtag (name
, ref
, globalize
);
12608 struct binding_level
*old_b
= class_binding_level
;
12610 ref
= make_aggr_type (code
);
12611 TYPE_CONTEXT (ref
) = context
;
12613 #ifdef NONNESTED_CLASSES
12614 /* Class types don't nest the way enums do. */
12615 class_binding_level
= (struct binding_level
*)0;
12617 pushtag (name
, ref
, globalize
);
12618 class_binding_level
= old_b
;
12623 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12624 redeclare_class_template (ref
, current_template_parms
);
12627 /* Until the type is defined, tentatively accept whatever
12628 structure tag the user hands us. */
12629 if (!COMPLETE_TYPE_P (ref
)
12630 && ref
!= current_class_type
12631 /* Have to check this, in case we have contradictory tag info. */
12632 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12634 if (tag_code
== class_type
)
12635 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12636 else if (tag_code
== record_type
)
12637 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12640 TREE_TYPE (ref
) = attributes
;
12646 xref_tag_from_type (old
, id
, globalize
)
12650 tree code_type_node
;
12652 if (TREE_CODE (old
) == RECORD_TYPE
)
12653 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12654 ? class_type_node
: record_type_node
);
12656 code_type_node
= union_type_node
;
12658 if (id
== NULL_TREE
)
12659 id
= TYPE_IDENTIFIER (old
);
12661 return xref_tag (code_type_node
, id
, globalize
);
12664 /* REF is a type (named NAME), for which we have just seen some
12665 baseclasses. BINFO is a list of those baseclasses; the
12666 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12667 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12668 struct, or union. */
12671 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12672 tree code_type_node
;
12676 /* In the declaration `A : X, Y, ... Z' we mark all the types
12677 (A, X, Y, ..., Z) so we can check for duplicates. */
12682 enum tag_types tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12684 if (tag_code
== union_type
)
12686 cp_error ("derived union `%T' invalid", ref
);
12690 len
= list_length (binfo
);
12692 /* First, make sure that any templates in base-classes are
12693 instantiated. This ensures that if we call ourselves recursively
12694 we do not get confused about which classes are marked and which
12696 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12697 complete_type (TREE_VALUE (base
));
12699 SET_CLASSTYPE_MARKED (ref
);
12700 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12702 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12704 /* The base of a derived struct is public by default. */
12706 = (TREE_PURPOSE (binfo
) == access_public_node
12707 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12708 || (tag_code
!= class_type
12709 && (TREE_PURPOSE (binfo
) == access_default_node
12710 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12712 = (TREE_PURPOSE (binfo
) == access_protected_node
12713 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12715 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12716 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12717 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12718 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12719 tree basetype
= TREE_VALUE (binfo
);
12722 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12723 basetype
= TREE_TYPE (basetype
);
12725 || (TREE_CODE (basetype
) != RECORD_TYPE
12726 && TREE_CODE (basetype
) != TYPENAME_TYPE
12727 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12728 && TREE_CODE (basetype
) != BOUND_TEMPLATE_TEMPLATE_PARM
))
12730 cp_error ("base type `%T' fails to be a struct or class type",
12731 TREE_VALUE (binfo
));
12735 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12737 /* This code replaces similar code in layout_basetypes.
12738 We put the complete_type first for implicit `typename'. */
12739 if (!COMPLETE_TYPE_P (basetype
)
12740 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12742 cp_error ("base class `%T' has incomplete type", basetype
);
12747 if (CLASSTYPE_MARKED (basetype
))
12749 if (basetype
== ref
)
12750 cp_error ("recursive type `%T' undefined", basetype
);
12752 cp_error ("duplicate base type `%T' invalid", basetype
);
12756 if (TYPE_FOR_JAVA (basetype
)
12757 && (current_lang_stack
12758 == &VARRAY_TREE (current_lang_base
, 0)))
12759 TYPE_FOR_JAVA (ref
) = 1;
12761 /* Note that the BINFO records which describe individual
12762 inheritances are *not* shared in the lattice! They
12763 cannot be shared because a given baseclass may be
12764 inherited with different `accessibility' by different
12765 derived classes. (Each BINFO record describing an
12766 individual inheritance contains flags which say what
12767 the `accessibility' of that particular inheritance is.) */
12770 = make_binfo (size_zero_node
, basetype
,
12771 CLASS_TYPE_P (basetype
)
12772 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
12773 CLASS_TYPE_P (basetype
)
12774 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
12776 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
12777 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
12778 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
12779 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
12780 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
12782 /* We need to unshare the binfos now so that lookups during class
12783 definition work. */
12784 unshare_base_binfos (base_binfo
);
12786 SET_CLASSTYPE_MARKED (basetype
);
12788 /* We are free to modify these bits because they are meaningless
12789 at top level, and BASETYPE is a top-level type. */
12790 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
12792 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
12793 /* Converting to a virtual base class requires looking
12794 up the offset of the virtual base. */
12795 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
12798 if (CLASS_TYPE_P (basetype
))
12800 TYPE_HAS_NEW_OPERATOR (ref
)
12801 |= TYPE_HAS_NEW_OPERATOR (basetype
);
12802 TYPE_HAS_ARRAY_NEW_OPERATOR (ref
)
12803 |= TYPE_HAS_ARRAY_NEW_OPERATOR (basetype
);
12804 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
12805 /* If the base-class uses multiple inheritance, so do we. */
12806 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
12807 |= TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
12808 /* Likewise, if converting to a base of the base may require
12809 code, then we may need to generate code to convert to a
12811 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
)
12812 |= TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (basetype
);
12819 TREE_VEC_LENGTH (binfos
) = i
;
12821 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
12825 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
12826 /* If there is more than one non-empty they cannot be at the same
12828 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
12831 /* Unmark all the types. */
12833 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
12834 CLEAR_CLASSTYPE_MARKED (ref
);
12836 /* Now that we know all the base-classes, set up the list of virtual
12838 get_vbase_types (ref
);
12842 /* Begin compiling the definition of an enumeration type.
12843 NAME is its name (or null if anonymous).
12844 Returns the type object, as yet incomplete.
12845 Also records info about it so that build_enumerator
12846 may be used to declare the individual values as they are read. */
12852 register tree enumtype
= NULL_TREE
;
12853 struct binding_level
*b
= current_binding_level
;
12855 /* If this is the real definition for a previous forward reference,
12856 fill in the contents in the same object that used to be the
12857 forward reference. */
12859 if (name
!= NULL_TREE
)
12860 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
12862 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
12864 cp_error ("multiple definition of `%#T'", enumtype
);
12865 cp_error_at ("previous definition here", enumtype
);
12866 /* Clear out TYPE_VALUES, and start again. */
12867 TYPE_VALUES (enumtype
) = NULL_TREE
;
12871 enumtype
= make_node (ENUMERAL_TYPE
);
12872 pushtag (name
, enumtype
, 0);
12875 if (current_class_type
)
12876 TREE_ADDRESSABLE (b
->tags
) = 1;
12878 GNU_xref_decl (current_function_decl
, enumtype
);
12882 /* After processing and defining all the values of an enumeration type,
12883 install their decls in the enumeration type and finish it off.
12884 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12885 Returns ENUMTYPE. */
12888 finish_enum (enumtype
)
12891 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
12892 /* Calculate the maximum value of any enumerator in this type. */
12894 tree values
= TYPE_VALUES (enumtype
);
12899 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
12904 /* The TREE_VALUE is a CONST_DECL for this enumeration
12906 decl
= TREE_VALUE (pair
);
12910 Following the closing brace of an enum-specifier, each
12911 enumerator has the type of its enumeration. Prior to the
12912 closing brace, the type of each enumerator is the type of
12913 its initializing value. */
12914 TREE_TYPE (decl
) = enumtype
;
12916 /* The DECL_INITIAL will be NULL if we are processing a
12917 template declaration and this enumeration constant had no
12918 explicit initializer. */
12919 value
= DECL_INITIAL (decl
);
12920 if (value
&& !processing_template_decl
)
12922 /* Set the TREE_TYPE for the VALUE as well. That's so
12923 that when we call decl_constant_value we get an
12924 entity of the right type (but with the constant
12925 value). Since we shouldn't ever call
12926 decl_constant_value on a template type, there's no
12927 reason to do that when processing_template_decl.
12928 And, if the expression is something like a
12929 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12930 wreak havoc on the intended type of the expression.
12932 Of course, there's also no point in trying to compute
12933 minimum or maximum values if we're in a template. */
12934 TREE_TYPE (value
) = enumtype
;
12937 minnode
= maxnode
= value
;
12938 else if (tree_int_cst_lt (maxnode
, value
))
12940 else if (tree_int_cst_lt (value
, minnode
))
12944 if (processing_template_decl
)
12945 /* If this is just a template, leave the CONST_DECL
12946 alone. That way tsubst_copy will find CONST_DECLs for
12947 CONST_DECLs, and not INTEGER_CSTs. */
12950 /* In the list we're building up, we want the enumeration
12951 values, not the CONST_DECLs. */
12952 TREE_VALUE (pair
) = value
;
12956 maxnode
= minnode
= integer_zero_node
;
12958 TYPE_VALUES (enumtype
) = nreverse (values
);
12960 if (processing_template_decl
)
12962 tree scope
= current_scope ();
12963 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
12964 add_stmt (build_min (TAG_DEFN
, enumtype
));
12968 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
12969 int lowprec
= min_precision (minnode
, unsignedp
);
12970 int highprec
= min_precision (maxnode
, unsignedp
);
12971 int precision
= MAX (lowprec
, highprec
);
12974 TYPE_SIZE (enumtype
) = NULL_TREE
;
12976 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
12978 TYPE_PRECISION (enumtype
) = precision
;
12980 fixup_unsigned_type (enumtype
);
12982 fixup_signed_type (enumtype
);
12984 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
12985 /* Use the width of the narrowest normal C type which is wide
12987 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
12990 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
12992 TYPE_SIZE (enumtype
) = 0;
12993 layout_type (enumtype
);
12995 /* Fix up all variant types of this enum type. */
12996 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
12997 tem
= TYPE_NEXT_VARIANT (tem
))
12999 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
13000 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
13001 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
13002 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
13003 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
13004 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
13005 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
13006 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
13007 TYPE_USER_ALIGN (tem
) = TYPE_USER_ALIGN (enumtype
);
13008 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
13011 /* Finish debugging output for this type. */
13012 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
13018 /* Build and install a CONST_DECL for an enumeration constant of the
13019 enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided.
13020 Assignment of sequential values by default is handled here. */
13023 build_enumerator (name
, value
, enumtype
)
13033 /* Remove no-op casts from the value. */
13035 STRIP_TYPE_NOPS (value
);
13037 if (! processing_template_decl
)
13039 /* Validate and default VALUE. */
13040 if (value
!= NULL_TREE
)
13042 value
= decl_constant_value (value
);
13044 if (TREE_CODE (value
) == INTEGER_CST
)
13046 value
= default_conversion (value
);
13047 constant_expression_warning (value
);
13051 cp_error ("enumerator value for `%D' not integer constant", name
);
13056 /* Default based on previous value. */
13057 if (value
== NULL_TREE
&& ! processing_template_decl
)
13061 if (TYPE_VALUES (enumtype
))
13063 /* The next value is the previous value ... */
13064 prev_value
= DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype
)));
13065 /* ... plus one. */
13066 value
= cp_build_binary_op (PLUS_EXPR
,
13070 if (tree_int_cst_lt (value
, prev_value
))
13071 cp_error ("overflow in enumeration values at `%D'", name
);
13074 value
= integer_zero_node
;
13077 /* Remove no-op casts from the value. */
13079 STRIP_TYPE_NOPS (value
);
13081 /* To fix MAX_VAL enum consts. (bkoz) */
13082 TREE_TYPE (value
) = integer_type_node
;
13086 /* We always have to copy here; not all INTEGER_CSTs are unshared.
13087 Even in other cases, we will later (in finish_enum) be setting
13088 the type of VALUE. But, we don't need to make a copy if this
13089 VALUE is one of the enumeration constants for this same
13090 enumeration type. */
13091 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
13092 if (TREE_VALUE (values
) == value
)
13094 /* If we didn't break out of the loop, then we do need a copy. */
13095 if (!values
&& value
)
13096 value
= copy_node (value
);
13098 /* C++ associates enums with global, function, or class declarations. */
13099 context
= current_scope ();
13101 /* Build the actual enumeration constant. Note that the enumeration
13102 constants have the type of their initializers until the
13103 enumeration is complete:
13107 Following the closing brace of an enum-specifier, each enumer-
13108 ator has the type of its enumeration. Prior to the closing
13109 brace, the type of each enumerator is the type of its
13110 initializing value.
13112 In finish_enum we will reset the type. Of course, if we're
13113 processing a template, there may be no value. */
13114 type
= value
? TREE_TYPE (value
) : NULL_TREE
;
13116 if (context
&& context
== current_class_type
)
13117 /* This enum declaration is local to the class. We need the full
13118 lang_decl so that we can record DECL_CLASS_CONTEXT, for example. */
13119 decl
= build_lang_decl (CONST_DECL
, name
, type
);
13121 /* It's a global enum, or it's local to a function. (Note local to
13122 a function could mean local to a class method. */
13123 decl
= build_decl (CONST_DECL
, name
, type
);
13125 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
13126 DECL_INITIAL (decl
) = value
;
13127 TREE_READONLY (decl
) = 1;
13129 if (context
&& context
== current_class_type
)
13130 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
13131 on the TYPE_FIELDS list for `S'. (That's so that you can say
13132 things like `S::i' later.) */
13133 finish_member_declaration (decl
);
13137 GNU_xref_decl (current_function_decl
, decl
);
13140 /* Add this enumeration constant to the list for this type. */
13141 TYPE_VALUES (enumtype
) = tree_cons (name
, decl
, TYPE_VALUES (enumtype
));
13145 /* We're defining DECL. Make sure that it's type is OK. */
13148 check_function_type (decl
, current_function_parms
)
13150 tree current_function_parms
;
13152 tree fntype
= TREE_TYPE (decl
);
13153 tree return_type
= complete_type (TREE_TYPE (fntype
));
13155 /* In a function definition, arg types must be complete. */
13156 require_complete_types_for_parms (current_function_parms
);
13158 if (!COMPLETE_OR_VOID_TYPE_P (return_type
))
13160 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
13162 /* Make it return void instead, but don't change the
13163 type of the DECL_RESULT, in case we have a named return value. */
13164 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13166 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
13168 = build_cplus_method_type (ctype
,
13170 FUNCTION_ARG_CHAIN (decl
));
13174 = build_function_type (void_type_node
,
13175 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
13177 = build_exception_variant (fntype
,
13178 TYPE_RAISES_EXCEPTIONS (fntype
));
13181 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
13184 /* Create the FUNCTION_DECL for a function definition.
13185 DECLSPECS and DECLARATOR are the parts of the declaration;
13186 they describe the function's name and the type it returns,
13187 but twisted together in a fashion that parallels the syntax of C.
13189 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
13190 DECLARATOR is really the DECL for the function we are about to
13191 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
13192 indicating that the function is an inline defined in-class.
13194 This function creates a binding context for the function body
13195 as well as setting up the FUNCTION_DECL in current_function_decl.
13197 Returns 1 on success. If the DECLARATOR is not suitable for a function
13198 (it defines a datum instead), we return 0, which tells
13199 yyparse to report a parse error.
13201 For C++, we must first check whether that datum makes any sense.
13202 For example, "class A local_a(1,2);" means that variable local_a
13203 is an aggregate of type A, which should have a constructor
13204 applied to it with the argument list [1, 2]. */
13207 start_function (declspecs
, declarator
, attrs
, flags
)
13208 tree declspecs
, declarator
, attrs
;
13212 tree ctype
= NULL_TREE
;
13215 extern int have_extern_spec
;
13216 extern int used_extern_spec
;
13217 int doing_friend
= 0;
13218 struct binding_level
*bl
;
13219 tree current_function_parms
;
13221 /* Sanity check. */
13222 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
13223 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
13225 /* This should only be done once on the top most decl. */
13226 if (have_extern_spec
&& !used_extern_spec
)
13228 declspecs
= tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
13229 used_extern_spec
= 1;
13232 if (flags
& SF_PRE_PARSED
)
13234 decl1
= declarator
;
13236 fntype
= TREE_TYPE (decl1
);
13237 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13238 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13240 /* ISO C++ 11.4/5. A friend function defined in a class is in
13241 the (lexical) scope of the class in which it is defined. */
13242 if (!ctype
&& DECL_FRIEND_P (decl1
))
13244 ctype
= DECL_FRIEND_CONTEXT (decl1
);
13246 /* CTYPE could be null here if we're dealing with a template;
13247 for example, `inline friend float foo()' inside a template
13248 will have no CTYPE set. */
13249 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
13255 last_function_parms
= DECL_ARGUMENTS (decl1
);
13256 last_function_parm_tags
= NULL_TREE
;
13260 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
13261 /* If the declarator is not suitable for a function definition,
13262 cause a syntax error. */
13263 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
13265 fntype
= TREE_TYPE (decl1
);
13267 restype
= TREE_TYPE (fntype
);
13268 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
13270 cp_error ("semicolon missing after declaration of `%#T'", restype
);
13271 shadow_tag (build_tree_list (NULL_TREE
, restype
));
13272 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
13273 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
13274 fntype
= build_function_type (integer_type_node
,
13275 TYPE_ARG_TYPES (fntype
));
13277 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
13279 TYPE_ARG_TYPES (fntype
));
13280 TREE_TYPE (decl1
) = fntype
;
13283 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13284 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13285 else if (DECL_MAIN_P (decl1
))
13287 /* If this doesn't return integer_type, complain. */
13288 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
13290 if (pedantic
|| warn_return_type
)
13291 pedwarn ("return type for `main' changed to `int'");
13292 TREE_TYPE (decl1
) = fntype
= default_function_type
;
13297 /* Sometimes we don't notice that a function is a static member, and
13298 build a METHOD_TYPE for it. Fix that up now. */
13299 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
)
13300 && TREE_CODE (TREE_TYPE (decl1
)) == METHOD_TYPE
)
13302 revert_static_member_fn (decl1
);
13303 last_function_parms
= TREE_CHAIN (last_function_parms
);
13307 /* Warn if function was previously implicitly declared
13308 (but not if we warned then). */
13309 if (! warn_implicit
13310 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
13311 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
13313 /* Set up current_class_type, and enter the scope of the class, if
13316 push_nested_class (ctype
, 1);
13317 else if (DECL_STATIC_FUNCTION_P (decl1
))
13318 push_nested_class (DECL_CONTEXT (decl1
), 2);
13320 /* Now that we have entered the scope of the class, we must restore
13321 the bindings for any template parameters surrounding DECL1, if it
13322 is an inline member template. (Order is important; consider the
13323 case where a template parameter has the same name as a field of
13324 the class.) It is not until after this point that
13325 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
13326 if (flags
& SF_INCLASS_INLINE
)
13327 maybe_begin_member_template_processing (decl1
);
13329 /* Effective C++ rule 15. */
13331 && DECL_OVERLOADED_OPERATOR_P (decl1
) == NOP_EXPR
13332 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
13333 cp_warning ("`operator=' should return a reference to `*this'");
13335 /* Make the init_value nonzero so pushdecl knows this is not tentative.
13336 error_mark_node is replaced below (in poplevel) with the BLOCK. */
13337 if (!DECL_INITIAL (decl1
))
13338 DECL_INITIAL (decl1
) = error_mark_node
;
13340 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
13341 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
13344 /* This function exists in static storage.
13345 (This does not mean `static' in the C sense!) */
13346 TREE_STATIC (decl1
) = 1;
13348 /* We must call push_template_decl after current_class_type is set
13349 up. (If we are processing inline definitions after exiting a
13350 class scope, current_class_type will be NULL_TREE until set above
13351 by push_nested_class.) */
13352 if (processing_template_decl
)
13353 decl1
= push_template_decl (decl1
);
13355 /* We are now in the scope of the function being defined. */
13356 current_function_decl
= decl1
;
13358 /* Save the parm names or decls from this function's declarator
13359 where store_parm_decls will find them. */
13360 current_function_parms
= last_function_parms
;
13361 current_function_parm_tags
= last_function_parm_tags
;
13363 /* Make sure the parameter and return types are reasonable. When
13364 you declare a function, these types can be incomplete, but they
13365 must be complete when you define the function. */
13366 if (! processing_template_decl
)
13367 check_function_type (decl1
, current_function_parms
);
13369 /* Build the return declaration for the function. */
13370 restype
= TREE_TYPE (fntype
);
13371 if (!processing_template_decl
)
13373 if (!DECL_RESULT (decl1
))
13375 DECL_RESULT (decl1
)
13376 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13377 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype
),
13378 DECL_RESULT (decl1
));
13382 /* Just use `void'. Nobody will ever look at this anyhow. */
13383 DECL_RESULT (decl1
) = build_decl (RESULT_DECL
, 0, void_type_node
);
13385 /* Initialize RTL machinery. We cannot do this until
13386 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
13387 even when processing a template; this is how we get
13388 CFUN set up, and our per-function variables initialized.
13389 FIXME factor out the non-RTL stuff. */
13390 bl
= current_binding_level
;
13391 init_function_start (decl1
, input_filename
, lineno
);
13392 current_binding_level
= bl
;
13394 /* Even though we're inside a function body, we still don't want to
13395 call expand_expr to calculate the size of a variable-sized array.
13396 We haven't necessarily assigned RTL to all variables yet, so it's
13397 not safe to try to expand expressions involving them. */
13398 immediate_size_expand
= 0;
13399 cfun
->x_dont_save_pending_sizes_p
= 1;
13401 /* Start the statement-tree, start the tree now. */
13402 begin_stmt_tree (&DECL_SAVED_TREE (decl1
));
13404 /* Let the user know we're compiling this function. */
13405 announce_function (decl1
);
13407 /* Record the decl so that the function name is defined.
13408 If we already have a decl for this name, and it is a FUNCTION_DECL,
13409 use the old decl. */
13410 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
13412 /* A specialization is not used to guide overload resolution. */
13413 if (!DECL_TEMPLATE_SPECIALIZATION (decl1
)
13414 && ! DECL_FUNCTION_MEMBER_P (decl1
))
13415 decl1
= pushdecl (decl1
);
13418 /* We need to set the DECL_CONTEXT. */
13419 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
13420 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
13421 /* And make sure we have enough default args. */
13422 check_default_args (decl1
);
13424 fntype
= TREE_TYPE (decl1
);
13427 /* Reset these in case the call to pushdecl changed them. */
13428 current_function_decl
= decl1
;
13429 cfun
->decl
= decl1
;
13431 /* If we are (erroneously) defining a function that we have already
13432 defined before, wipe out what we knew before. */
13433 if (!DECL_PENDING_INLINE_P (decl1
)
13434 && DECL_SAVED_FUNCTION_DATA (decl1
))
13436 free (DECL_SAVED_FUNCTION_DATA (decl1
));
13437 DECL_SAVED_FUNCTION_DATA (decl1
) = NULL
;
13440 if (ctype
&& !doing_friend
&& !DECL_STATIC_FUNCTION_P (decl1
))
13442 /* We know that this was set up by `grokclassfn'. We do not
13443 wait until `store_parm_decls', since evil parse errors may
13444 never get us to that point. Here we keep the consistency
13445 between `current_class_type' and `current_class_ptr'. */
13446 tree t
= DECL_ARGUMENTS (decl1
);
13448 my_friendly_assert (t
!= NULL_TREE
&& TREE_CODE (t
) == PARM_DECL
,
13450 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
13453 cp_function_chain
->x_current_class_ref
13454 = build_indirect_ref (t
, NULL_PTR
);
13455 cp_function_chain
->x_current_class_ptr
= t
;
13457 /* Constructors and destructors need to know whether they're "in
13458 charge" of initializing virtual base classes. */
13459 t
= TREE_CHAIN (t
);
13460 if (DECL_HAS_IN_CHARGE_PARM_P (decl1
))
13462 current_in_charge_parm
= t
;
13463 t
= TREE_CHAIN (t
);
13465 if (DECL_HAS_VTT_PARM_P (decl1
))
13467 if (DECL_NAME (t
) != vtt_parm_identifier
)
13469 current_vtt_parm
= t
;
13473 if (DECL_INTERFACE_KNOWN (decl1
))
13475 tree ctx
= decl_function_context (decl1
);
13477 if (DECL_NOT_REALLY_EXTERN (decl1
))
13478 DECL_EXTERNAL (decl1
) = 0;
13480 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
13481 && TREE_PUBLIC (ctx
))
13482 /* This is a function in a local class in an extern inline
13484 comdat_linkage (decl1
);
13486 /* If this function belongs to an interface, it is public.
13487 If it belongs to someone else's interface, it is also external.
13488 This only affects inlines and template instantiations. */
13489 else if (interface_unknown
== 0
13490 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13491 || flag_alt_external_templates
))
13493 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
13494 || processing_template_decl
)
13496 DECL_EXTERNAL (decl1
)
13498 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
13499 && !DECL_VINDEX (decl1
)));
13501 /* For WIN32 we also want to put these in linkonce sections. */
13502 maybe_make_one_only (decl1
);
13505 DECL_EXTERNAL (decl1
) = 0;
13506 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
13507 DECL_INTERFACE_KNOWN (decl1
) = 1;
13509 else if (interface_unknown
&& interface_only
13510 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13511 || flag_alt_external_templates
))
13513 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13514 interface, we will have interface_only set but not
13515 interface_known. In that case, we don't want to use the normal
13516 heuristics because someone will supply a #pragma implementation
13517 elsewhere, and deducing it here would produce a conflict. */
13518 comdat_linkage (decl1
);
13519 DECL_EXTERNAL (decl1
) = 0;
13520 DECL_INTERFACE_KNOWN (decl1
) = 1;
13521 DECL_DEFER_OUTPUT (decl1
) = 1;
13525 /* This is a definition, not a reference.
13526 So clear DECL_EXTERNAL. */
13527 DECL_EXTERNAL (decl1
) = 0;
13529 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
13530 && ! DECL_INTERFACE_KNOWN (decl1
)
13531 /* Don't try to defer nested functions for now. */
13532 && ! decl_function_context (decl1
))
13533 DECL_DEFER_OUTPUT (decl1
) = 1;
13535 DECL_INTERFACE_KNOWN (decl1
) = 1;
13539 current_binding_level
->parm_flag
= 1;
13542 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13544 /* We need to do this even if we aren't expanding yet so that
13545 assemble_external works. */
13546 make_decl_rtl (decl1
, NULL
);
13548 /* Promote the value to int before returning it. */
13549 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13550 restype
= type_promotes_to (restype
);
13552 /* If this fcn was already referenced via a block-scope `extern' decl
13553 (or an implicit decl), propagate certain information about the usage. */
13554 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13555 TREE_ADDRESSABLE (decl1
) = 1;
13557 if (DECL_RESULT (decl1
) == NULL_TREE
)
13559 DECL_RESULT (decl1
)
13560 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13561 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13562 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13567 if (DECL_DESTRUCTOR_P (decl1
))
13569 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13570 DECL_CONTEXT (dtor_label
) = current_function_decl
;
13573 store_parm_decls (current_function_parms
);
13578 /* Store the parameter declarations into the current function declaration.
13579 This is called after parsing the parameter declarations, before
13580 digesting the body of the function.
13582 Also install to binding contour return value identifier, if any. */
13585 store_parm_decls (current_function_parms
)
13586 tree current_function_parms
;
13588 register tree fndecl
= current_function_decl
;
13589 register tree parm
;
13590 int parms_have_cleanups
= 0;
13591 tree cleanups
= NULL_TREE
;
13593 /* This is a list of types declared among parms in a prototype. */
13594 tree parmtags
= current_function_parm_tags
;
13596 /* This is a chain of any other decls that came in among the parm
13597 declarations. If a parm is declared with enum {foo, bar} x;
13598 then CONST_DECLs for foo and bar are put here. */
13599 tree nonparms
= NULL_TREE
;
13601 if (current_function_parms
)
13603 /* This case is when the function was defined with an ANSI prototype.
13604 The parms already have decls, so we need not do anything here
13605 except record them as in effect
13606 and complain if any redundant old-style parm decls were written. */
13608 tree specparms
= current_function_parms
;
13611 /* Must clear this because it might contain TYPE_DECLs declared
13613 storedecls (NULL_TREE
);
13615 /* If we're doing semantic analysis, then we'll call pushdecl
13616 for each of these. We must do them in reverse order so that
13617 they end in the correct forward order. */
13618 specparms
= nreverse (specparms
);
13620 for (parm
= specparms
; parm
; parm
= next
)
13622 next
= TREE_CHAIN (parm
);
13623 if (TREE_CODE (parm
) == PARM_DECL
)
13627 if (DECL_NAME (parm
) == NULL_TREE
13628 || TREE_CODE (parm
) != VOID_TYPE
)
13631 cp_error ("parameter `%D' declared void", parm
);
13633 cleanup
= (processing_template_decl
13635 : maybe_build_cleanup (parm
));
13638 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13642 /* If we find an enum constant or a type tag,
13643 put it aside for the moment. */
13644 TREE_CHAIN (parm
) = NULL_TREE
;
13645 nonparms
= chainon (nonparms
, parm
);
13649 /* Get the decls in their original chain order and record in the
13650 function. This is all and only the PARM_DECLs that were
13651 pushed into scope by the loop above. */
13652 DECL_ARGUMENTS (fndecl
) = getdecls ();
13653 storetags (chainon (parmtags
, gettags ()));
13656 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13658 /* Now store the final chain of decls for the arguments
13659 as the decl-chain of the current lexical scope.
13660 Put the enumerators in as well, at the front so that
13661 DECL_ARGUMENTS is not modified. */
13662 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13664 /* Now that we have initialized the parms, we can start their
13665 cleanups. We cannot do this before, since expand_decl_cleanup
13666 should not be called before the parm can be used. */
13669 finish_decl_cleanup (TREE_PURPOSE (cleanups
),
13670 TREE_VALUE (cleanups
));
13671 cleanups
= TREE_CHAIN (cleanups
);
13674 /* Create a binding contour which can be used to catch
13675 cleanup-generated temporaries. */
13676 if (parms_have_cleanups
)
13679 /* Do the starting of the exception specifications, if we have any. */
13680 if (flag_exceptions
&& !processing_template_decl
13681 && flag_enforce_eh_specs
13682 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13683 current_eh_spec_try_block
= expand_start_eh_spec ();
13687 /* We have finished doing semantic analysis on DECL, but have not yet
13688 generated RTL for its body. Save away our current state, so that
13689 when we want to generate RTL later we know what to do. */
13692 save_function_data (decl
)
13695 struct cp_language_function
*f
;
13697 /* Save the language-specific per-function data so that we can
13698 get it back when we really expand this function. */
13699 my_friendly_assert (!DECL_PENDING_INLINE_P (decl
),
13703 f
= ((struct cp_language_function
*)
13704 xmalloc (sizeof (struct cp_language_function
)));
13705 memcpy (f
, cp_function_chain
, sizeof (struct cp_language_function
));
13706 DECL_SAVED_FUNCTION_DATA (decl
) = f
;
13708 /* Clear out the bits we don't need. */
13709 f
->base
.x_stmt_tree
.x_last_stmt
= NULL_TREE
;
13710 f
->base
.x_stmt_tree
.x_last_expr_type
= NULL_TREE
;
13711 f
->x_named_label_uses
= NULL
;
13712 f
->bindings
= NULL
;
13714 /* When we get back here again, we will be expanding. */
13715 f
->x_expanding_p
= 1;
13717 /* If we've already decided that we cannot inline this function, we
13718 must remember that fact when we actually go to expand the
13720 f
->cannot_inline
= current_function_cannot_inline
;
13723 /* At the end of every constructor we generate to code to return
13724 `this'. Do that now. */
13727 finish_constructor_body ()
13729 /* Any return from a constructor will end up here. */
13731 add_stmt (build_stmt (LABEL_STMT
, ctor_label
));
13733 /* Clear CTOR_LABEL so that finish_return_stmt knows to really
13734 generate the return, rather than a goto to CTOR_LABEL. */
13735 ctor_label
= NULL_TREE
;
13736 /* In check_return_expr we translate an empty return from a
13737 constructor to a return of `this'. */
13738 finish_return_stmt (NULL_TREE
);
13739 /* Mark the end of the constructor. */
13740 add_stmt (build_stmt (CTOR_STMT
));
13743 /* At the end of every destructor we generate code to restore virtual
13744 function tables to the values desired by base classes and to call
13745 to base class destructors. Do that now. */
13748 finish_destructor_body ()
13750 tree compound_stmt
;
13753 /* Create a block to contain all the extra code. */
13754 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
13756 /* Any return from a destructor will end up here. */
13757 add_stmt (build_stmt (LABEL_STMT
, dtor_label
));
13759 /* Generate the code to call destructor on base class. If this
13760 destructor belongs to a class with virtual functions, then set
13761 the virtual function table pointer to represent the type of our
13764 /* This side-effect makes call to `build_delete' generate the code
13765 we have to have at the end of this destructor. `build_delete'
13766 will set the flag again. */
13767 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
13769 exprstmt
= build_delete (current_class_type
,
13771 sfk_base_destructor
,
13772 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
,
13775 if (exprstmt
!= error_mark_node
13776 && (TREE_CODE (exprstmt
) != NOP_EXPR
13777 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
13778 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
13780 if (exprstmt
!= void_zero_node
)
13781 /* Don't call `expand_expr_stmt' if we're not going to do
13782 anything, since -Wall will give a diagnostic. */
13783 finish_expr_stmt (exprstmt
);
13785 /* Run destructors for all virtual baseclasses. */
13786 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13791 if_stmt
= begin_if_stmt ();
13792 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13793 current_in_charge_parm
,
13797 vbases
= CLASSTYPE_VBASECLASSES (current_class_type
);
13798 /* The CLASSTYPE_VBASECLASSES list is in initialization
13799 order, so we have to march through it in reverse order. */
13800 for (vbases
= nreverse (copy_list (vbases
));
13802 vbases
= TREE_CHAIN (vbases
))
13804 tree vbase
= TREE_VALUE (vbases
);
13805 tree base_type
= BINFO_TYPE (vbase
);
13807 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (base_type
))
13809 tree base_ptr_type
= build_pointer_type (base_type
);
13810 tree expr
= current_class_ptr
;
13812 /* Convert to the basetype here, as we know the layout is
13813 fixed. What is more, if we let build_method_call do it,
13814 it will use the vtable, which may have been clobbered
13815 by the deletion of our primary base. */
13817 expr
= build1 (NOP_EXPR
, base_ptr_type
, expr
);
13818 expr
= build (PLUS_EXPR
, base_ptr_type
, expr
,
13819 BINFO_OFFSET (vbase
));
13820 expr
= build_indirect_ref (expr
, NULL
);
13821 expr
= build_method_call (expr
, base_dtor_identifier
,
13824 finish_expr_stmt (expr
);
13828 finish_then_clause (if_stmt
);
13833 /* In a virtual destructor, we must call delete. */
13834 if (DECL_VIRTUAL_P (current_function_decl
))
13837 tree virtual_size
= c_sizeof (current_class_type
);
13841 At the point of definition of a virtual destructor (including
13842 an implicit definition), non-placement operator delete shall
13843 be looked up in the scope of the destructor's class and if
13844 found shall be accessible and unambiguous. */
13845 exprstmt
= build_op_delete_call
13846 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
13847 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
13849 if_stmt
= begin_if_stmt ();
13850 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13851 current_in_charge_parm
,
13854 finish_expr_stmt (exprstmt
);
13855 finish_then_clause (if_stmt
);
13859 /* Close the block we started above. */
13860 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
13863 /* Finish up a function declaration and compile that function
13864 all the way to assembler language output. The free the storage
13865 for the function definition.
13867 FLAGS is a bitwise or of the following values:
13869 An extra call to poplevel (and expand_end_bindings) must be
13870 made to take care of the binding contour for the base
13871 initializers. This is only relevant for constructors.
13873 We just finished processing the body of an in-class inline
13874 function definition. (This processing will have taken place
13875 after the class definition is complete.) */
13878 finish_function (flags
)
13881 register tree fndecl
= current_function_decl
;
13882 tree fntype
, ctype
= NULL_TREE
;
13883 int call_poplevel
= (flags
& 1) != 0;
13884 int inclass_inline
= (flags
& 2) != 0;
13887 /* When we get some parse errors, we can end up without a
13888 current_function_decl, so cope. */
13889 if (fndecl
== NULL_TREE
)
13890 return error_mark_node
;
13892 nested
= function_depth
> 1;
13893 fntype
= TREE_TYPE (fndecl
);
13895 /* TREE_READONLY (fndecl) = 1;
13896 This caused &foo to be of type ptr-to-const-function
13897 which then got a warning when stored in a ptr-to-function variable. */
13899 my_friendly_assert (building_stmt_tree (), 20000911);
13901 /* For a cloned function, we've already got all the code we need;
13902 there's no need to add any extra bits. */
13903 if (!DECL_CLONED_FUNCTION_P (fndecl
))
13905 if (DECL_CONSTRUCTOR_P (fndecl
))
13907 finish_constructor_body ();
13911 else if (DECL_DESTRUCTOR_P (fndecl
) && !processing_template_decl
)
13912 finish_destructor_body ();
13913 else if (DECL_MAIN_P (fndecl
))
13915 /* Make it so that `main' always returns 0 by default. */
13917 finish_return_stmt (integer_one_node
);
13919 finish_return_stmt (integer_zero_node
);
13923 /* Finish dealing with exception specifiers. */
13924 if (flag_exceptions
&& !processing_template_decl
13925 && flag_enforce_eh_specs
13926 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13927 expand_end_eh_spec (TYPE_RAISES_EXCEPTIONS
13928 (TREE_TYPE (current_function_decl
)),
13929 current_eh_spec_try_block
);
13932 /* If we're saving up tree structure, tie off the function now. */
13933 finish_stmt_tree (&DECL_SAVED_TREE (fndecl
));
13935 /* This must come after expand_function_end because cleanups might
13936 have declarations (from inline functions) that need to go into
13937 this function's blocks. */
13938 if (current_binding_level
->parm_flag
!= 1)
13939 my_friendly_abort (122);
13940 poplevel (1, 0, 1);
13942 /* Remember that we were in class scope. */
13943 if (current_class_name
)
13944 ctype
= current_class_type
;
13946 /* Must mark the RESULT_DECL as being in this function. */
13947 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
13949 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
13950 to the FUNCTION_DECL node itself. */
13951 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
13953 /* Save away current state, if appropriate. */
13954 if (!processing_template_decl
)
13955 save_function_data (fndecl
);
13957 /* If this function calls `setjmp' it cannot be inlined. When
13958 `longjmp' is called it is not guaranteed to restore the value of
13959 local variables that have been modified since the call to
13960 `setjmp'. So, if were to inline this function into some caller
13961 `c', then when we `longjmp', we might not restore all variables
13962 in `c'. (It might seem, at first blush, that there's no way for
13963 this function to modify local variables in `c', but their
13964 addresses may have been stored somewhere accessible to this
13966 if (!processing_template_decl
&& calls_setjmp_p (fndecl
))
13967 DECL_UNINLINABLE (fndecl
) = 1;
13969 /* Clear out memory we no longer need. */
13970 free_after_parsing (cfun
);
13971 /* Since we never call rest_of_compilation, we never clear
13972 CFUN. Do so explicitly. */
13973 free_after_compilation (cfun
);
13976 /* If this is a in-class inline definition, we may have to pop the
13977 bindings for the template parameters that we added in
13978 maybe_begin_member_template_processing when start_function was
13980 if (inclass_inline
)
13981 maybe_end_member_template_processing ();
13983 /* Leave the scope of the class. */
13985 pop_nested_class ();
13991 /* Let the error reporting routines know that we're outside a
13992 function. For a nested function, this value is used in
13993 pop_cp_function_context and then reset via pop_function_context. */
13994 current_function_decl
= NULL_TREE
;
13999 /* Create the FUNCTION_DECL for a function definition.
14000 DECLSPECS and DECLARATOR are the parts of the declaration;
14001 they describe the return type and the name of the function,
14002 but twisted together in a fashion that parallels the syntax of C.
14004 This function creates a binding context for the function body
14005 as well as setting up the FUNCTION_DECL in current_function_decl.
14007 Returns a FUNCTION_DECL on success.
14009 If the DECLARATOR is not suitable for a function (it defines a datum
14010 instead), we return 0, which tells yyparse to report a parse error.
14012 May return void_type_node indicating that this method is actually
14013 a friend. See grokfield for more details.
14015 Came here with a `.pushlevel' .
14017 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14018 CHANGES TO CODE IN `grokfield'. */
14021 start_method (declspecs
, declarator
, attrlist
)
14022 tree declarator
, declspecs
, attrlist
;
14024 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
14027 /* Something too ugly to handle. */
14028 if (fndecl
== NULL_TREE
)
14031 /* Pass friends other than inline friend functions back. */
14032 if (fndecl
== void_type_node
)
14035 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
14036 /* Not a function, tell parser to report parse error. */
14039 if (DECL_IN_AGGR_P (fndecl
))
14041 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
14043 if (DECL_CONTEXT (fndecl
)
14044 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
14045 cp_error ("`%D' is already defined in class `%T'", fndecl
,
14046 DECL_CONTEXT (fndecl
));
14048 return void_type_node
;
14051 check_template_shadow (fndecl
);
14053 DECL_THIS_INLINE (fndecl
) = 1;
14055 if (flag_default_inline
)
14056 DECL_INLINE (fndecl
) = 1;
14058 /* We process method specializations in finish_struct_1. */
14059 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
14060 fndecl
= push_template_decl (fndecl
);
14062 if (! DECL_FRIEND_P (fndecl
))
14064 if (TREE_CHAIN (fndecl
))
14066 fndecl
= copy_node (fndecl
);
14067 TREE_CHAIN (fndecl
) = NULL_TREE
;
14070 if (DECL_CONSTRUCTOR_P (fndecl
))
14072 if (! grok_ctor_properties (current_class_type
, fndecl
))
14073 return void_type_node
;
14075 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
14076 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
14079 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0);
14081 /* Make a place for the parms */
14083 current_binding_level
->parm_flag
= 1;
14085 DECL_IN_AGGR_P (fndecl
) = 1;
14089 /* Go through the motions of finishing a function definition.
14090 We don't compile this method until after the whole class has
14093 FINISH_METHOD must return something that looks as though it
14094 came from GROKFIELD (since we are defining a method, after all).
14096 This is called after parsing the body of the function definition.
14097 STMTS is the chain of statements that makes up the function body.
14099 DECL is the ..._DECL that `start_method' provided. */
14102 finish_method (decl
)
14105 register tree fndecl
= decl
;
14108 register tree link
;
14110 if (decl
== void_type_node
)
14113 old_initial
= DECL_INITIAL (fndecl
);
14115 /* Undo the level for the parms (from start_method).
14116 This is like poplevel, but it causes nothing to be
14117 saved. Saving information here confuses symbol-table
14118 output routines. Besides, this information will
14119 be correctly output when this method is actually
14122 /* Clear out the meanings of the local variables of this level;
14123 also record in each decl which block it belongs to. */
14125 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
14127 if (DECL_NAME (link
) != NULL_TREE
)
14128 pop_binding (DECL_NAME (link
), link
);
14129 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
14130 DECL_CONTEXT (link
) = NULL_TREE
;
14133 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
14134 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
14135 current_binding_level
->parm_flag
,
14136 current_binding_level
->keep
);
14138 poplevel (0, 0, 0);
14140 DECL_INITIAL (fndecl
) = old_initial
;
14142 /* We used to check if the context of FNDECL was different from
14143 current_class_type as another way to get inside here. This didn't work
14144 for String.cc in libg++. */
14145 if (DECL_FRIEND_P (fndecl
))
14147 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
14148 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
14149 decl
= void_type_node
;
14155 /* Called when a new struct TYPE is defined.
14156 If this structure or union completes the type of any previous
14157 variable declaration, lay it out and output its rtl. */
14160 hack_incomplete_structures (type
)
14164 struct binding_level
*level
;
14166 if (!type
) /* Don't do this for class templates. */
14169 if (namespace_bindings_p ())
14172 list
= &namespace_scope_incomplete
;
14176 level
= innermost_nonclass_level ();
14177 list
= &level
->incomplete
;
14184 tree decl
= TREE_VALUE (*list
);
14185 if ((decl
&& TREE_TYPE (decl
) == type
)
14186 || (TREE_TYPE (decl
)
14187 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14188 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
14190 int toplevel
= toplevel_bindings_p ();
14191 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14192 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
14193 layout_type (TREE_TYPE (decl
));
14194 layout_decl (decl
, 0);
14195 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
14199 expand_decl (decl
);
14200 cleanup
= maybe_build_cleanup (decl
);
14201 expand_decl_init (decl
);
14202 if (! expand_decl_cleanup (decl
, cleanup
))
14203 cp_error ("parser lost in parsing declaration of `%D'",
14206 *list
= TREE_CHAIN (*list
);
14209 list
= &TREE_CHAIN (*list
);
14212 /* Keep looking through artificial binding levels generated
14213 for local variables. */
14214 if (level
&& level
->keep
== 2)
14216 level
= level
->level_chain
;
14217 list
= &level
->incomplete
;
14224 /* If DECL is of a type which needs a cleanup, build that cleanup
14228 maybe_build_cleanup (decl
)
14231 tree type
= TREE_TYPE (decl
);
14233 if (type
!= error_mark_node
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
14235 int flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14238 if (TREE_CODE (type
) == ARRAY_TYPE
)
14242 mark_addressable (decl
);
14243 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14246 /* Optimize for space over speed here. */
14247 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14248 || flag_expensive_optimizations
)
14249 flags
|= LOOKUP_NONVIRTUAL
;
14251 rval
= build_delete (TREE_TYPE (rval
), rval
,
14252 sfk_complete_destructor
, flags
, 0);
14254 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14255 && ! TYPE_HAS_DESTRUCTOR (type
))
14256 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14257 build_tree_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14264 /* When a stmt has been parsed, this function is called. */
14269 /* Always assume this statement was not an expression statement. If
14270 it actually was an expression statement, its our callers
14271 responsibility to fix this up. */
14272 last_expr_type
= NULL_TREE
;
14275 /* DECL was originally constructed as a non-static member function,
14276 but turned out to be static. Update it accordingly. */
14279 revert_static_member_fn (decl
)
14283 tree function
= TREE_TYPE (decl
);
14284 tree args
= TYPE_ARG_TYPES (function
);
14286 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14287 != TYPE_UNQUALIFIED
)
14288 cp_error ("static member function `%#D' declared with type qualifiers",
14291 args
= TREE_CHAIN (args
);
14292 tmp
= build_function_type (TREE_TYPE (function
), args
);
14293 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14294 tmp
= build_exception_variant (tmp
,
14295 TYPE_RAISES_EXCEPTIONS (function
));
14296 TREE_TYPE (decl
) = tmp
;
14297 if (DECL_ARGUMENTS (decl
))
14298 DECL_ARGUMENTS (decl
) = TREE_CHAIN (DECL_ARGUMENTS (decl
));
14299 DECL_STATIC_FUNCTION_P (decl
) = 1;
14302 /* Initialize the variables used during compilation of a C++
14306 push_cp_function_context (f
)
14307 struct function
*f
;
14309 struct cp_language_function
*p
14310 = ((struct cp_language_function
*)
14311 xcalloc (1, sizeof (struct cp_language_function
)));
14312 f
->language
= (struct language_function
*) p
;
14314 /* It takes an explicit call to expand_body to generate RTL for a
14318 /* Whenever we start a new function, we destroy temporaries in the
14320 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
14323 /* Free the language-specific parts of F, now that we've finished
14324 compiling the function. */
14327 pop_cp_function_context (f
)
14328 struct function
*f
;
14331 free (f
->language
);
14335 /* Mark P for GC. */
14338 mark_lang_function (p
)
14339 struct cp_language_function
*p
;
14344 mark_c_language_function (&p
->base
);
14346 ggc_mark_tree (p
->x_ctor_label
);
14347 ggc_mark_tree (p
->x_dtor_label
);
14348 ggc_mark_tree (p
->x_current_class_ptr
);
14349 ggc_mark_tree (p
->x_current_class_ref
);
14350 ggc_mark_tree (p
->x_eh_spec_try_block
);
14352 mark_named_label_lists (&p
->x_named_labels
, &p
->x_named_label_uses
);
14353 mark_binding_level (&p
->bindings
);
14356 /* Mark the language-specific data in F for GC. */
14359 mark_cp_function_context (f
)
14360 struct function
*f
;
14362 mark_lang_function ((struct cp_language_function
*) f
->language
);
14369 enum tree_code code
= TREE_CODE (t
);
14370 if (code
== IDENTIFIER_NODE
)
14372 struct lang_identifier
*li
= (struct lang_identifier
*) t
;
14373 struct lang_id2
*li2
= li
->x
;
14374 ggc_mark_tree (li
->namespace_bindings
);
14375 ggc_mark_tree (li
->bindings
);
14376 ggc_mark_tree (li
->class_value
);
14377 ggc_mark_tree (li
->class_template_info
);
14381 ggc_mark_tree (li2
->label_value
);
14382 ggc_mark_tree (li2
->implicit_decl
);
14383 ggc_mark_tree (li2
->error_locus
);
14386 else if (code
== CPLUS_BINDING
)
14388 if (BINDING_HAS_LEVEL_P (t
))
14389 mark_binding_level (&BINDING_LEVEL (t
));
14391 ggc_mark_tree (BINDING_SCOPE (t
));
14392 ggc_mark_tree (BINDING_VALUE (t
));
14394 else if (code
== OVERLOAD
)
14395 ggc_mark_tree (OVL_FUNCTION (t
));
14396 else if (code
== TEMPLATE_PARM_INDEX
)
14397 ggc_mark_tree (TEMPLATE_PARM_DECL (t
));
14398 else if (TREE_CODE_CLASS (code
) == 'd')
14400 struct lang_decl
*ld
= DECL_LANG_SPECIFIC (t
);
14405 c_mark_lang_decl (&ld
->decl_flags
.base
);
14406 if (!DECL_GLOBAL_CTOR_P (t
)
14407 && !DECL_GLOBAL_DTOR_P (t
)
14408 && !DECL_THUNK_P (t
))
14409 ggc_mark_tree (ld
->decl_flags
.u2
.access
);
14410 else if (DECL_THUNK_P (t
))
14411 ggc_mark_tree (ld
->decl_flags
.u2
.vcall_offset
);
14412 if (TREE_CODE (t
) != NAMESPACE_DECL
)
14413 ggc_mark_tree (ld
->decl_flags
.u
.template_info
);
14415 mark_binding_level (&NAMESPACE_LEVEL (t
));
14416 if (CAN_HAVE_FULL_LANG_DECL_P (t
))
14418 ggc_mark_tree (ld
->befriending_classes
);
14419 ggc_mark_tree (ld
->context
);
14420 ggc_mark_tree (ld
->cloned_function
);
14421 if (TREE_CODE (t
) == TYPE_DECL
)
14422 ggc_mark_tree (ld
->u
.sorted_fields
);
14423 else if (TREE_CODE (t
) == FUNCTION_DECL
14424 && !DECL_PENDING_INLINE_P (t
))
14425 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t
));
14429 else if (TREE_CODE_CLASS (code
) == 't')
14431 struct lang_type
*lt
= TYPE_LANG_SPECIFIC (t
);
14433 if (lt
&& !(TREE_CODE (t
) == POINTER_TYPE
14434 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
14437 ggc_mark_tree (lt
->primary_base
);
14438 ggc_mark_tree (lt
->vfields
);
14439 ggc_mark_tree (lt
->vbases
);
14440 ggc_mark_tree (lt
->tags
);
14441 ggc_mark_tree (lt
->size
);
14442 ggc_mark_tree (lt
->pure_virtuals
);
14443 ggc_mark_tree (lt
->friend_classes
);
14444 ggc_mark_tree (lt
->rtti
);
14445 ggc_mark_tree (lt
->methods
);
14446 ggc_mark_tree (lt
->template_info
);
14447 ggc_mark_tree (lt
->befriending_classes
);
14450 /* In the case of pointer-to-member function types, the
14451 TYPE_LANG_SPECIFIC is really just a tree. */
14452 ggc_mark_tree ((tree
) lt
);
14456 /* Return the IDENTIFIER_GLOBAL_VALUE of T, for use in common code, since
14457 the definition of IDENTIFIER_GLOBAL_VALUE is different for C and C++. */
14460 identifier_global_value (t
)
14463 return IDENTIFIER_GLOBAL_VALUE (t
);
14466 /* Build the void_list_node (void_type_node having been created). */
14468 build_void_list_node ()
14470 tree t
= build_tree_list (NULL_TREE
, void_type_node
);
14471 TREE_PARMLIST (t
) = 1;
14476 cp_missing_noreturn_ok_p (decl
)
14479 /* A missing noreturn is ok for the `main' function. */
14480 return MAIN_NAME_P (DECL_ASSEMBLER_NAME (decl
));