1 /* Process declarations and variables for C compiler.
2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000
3 Free Software Foundation, Inc.
4 Contributed by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GNU CC.
8 GNU CC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GNU CC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GNU CC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
24 /* Process declarations and symbol lookup for C front end.
25 Also constructs types; the standard scalar types at initialization,
26 and structure, union, array and enum types when they are declared. */
28 /* ??? not all decl nodes are given the most useful possible
29 line numbers. For example, the CONST_DECLs for enum values. */
48 extern int current_class_depth
;
50 extern tree global_namespace
;
52 extern int (*valid_lang_attribute
) PARAMS ((tree
, tree
, tree
, tree
));
54 #ifndef BOOL_TYPE_SIZE
55 #ifdef SLOW_BYTE_ACCESS
56 /* In the new ABI, `bool' has size and alignment `1', on all
58 #define BOOL_TYPE_SIZE \
59 ((SLOW_BYTE_ACCESS && !flag_new_abi) ? (POINTER_SIZE) : (CHAR_TYPE_SIZE))
61 #define BOOL_TYPE_SIZE CHAR_TYPE_SIZE
65 /* We let tm.h override the types used here, to handle trivial differences
66 such as the choice of unsigned int or long unsigned int for size_t.
67 When machines start needing nontrivial differences in the size type,
68 it would be best to do something here to figure out automatically
69 from other information what type to use. */
72 #define SIZE_TYPE "long unsigned int"
76 #define PTRDIFF_TYPE "long int"
80 #define WCHAR_TYPE "int"
84 #define WINT_TYPE "unsigned int"
88 #define INTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
90 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
96 #define UINTMAX_TYPE ((INT_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
98 : ((LONG_TYPE_SIZE == LONG_LONG_TYPE_SIZE) \
99 ? "long unsigned int" \
100 : "long long unsigned int"))
103 static tree grokparms
PARAMS ((tree
));
104 static const char *redeclaration_error_message
PARAMS ((tree
, tree
));
106 static void push_binding_level
PARAMS ((struct binding_level
*, int,
108 static void pop_binding_level
PARAMS ((void));
109 static void suspend_binding_level
PARAMS ((void));
110 static void resume_binding_level
PARAMS ((struct binding_level
*));
111 static struct binding_level
*make_binding_level
PARAMS ((void));
112 static void declare_namespace_level
PARAMS ((void));
113 static int decl_jump_unsafe
PARAMS ((tree
));
114 static void storedecls
PARAMS ((tree
));
115 static void require_complete_types_for_parms
PARAMS ((tree
));
116 static int ambi_op_p
PARAMS ((enum tree_code
));
117 static int unary_op_p
PARAMS ((enum tree_code
));
118 static tree store_bindings
PARAMS ((tree
, tree
));
119 static tree lookup_tag_reverse
PARAMS ((tree
, tree
));
120 static tree obscure_complex_init
PARAMS ((tree
, tree
));
121 static tree lookup_name_real
PARAMS ((tree
, int, int, int));
122 static void warn_extern_redeclared_static
PARAMS ((tree
, tree
));
123 static void grok_reference_init
PARAMS ((tree
, tree
, tree
));
124 static tree grokfndecl
PARAMS ((tree
, tree
, tree
, tree
, int,
125 enum overload_flags
, tree
,
126 tree
, int, int, int, int, int, int, tree
));
127 static tree grokvardecl
PARAMS ((tree
, tree
, RID_BIT_TYPE
*, int, int, tree
));
128 static tree lookup_tag
PARAMS ((enum tree_code
, tree
,
129 struct binding_level
*, int));
130 static void set_identifier_type_value_with_scope
131 PARAMS ((tree
, tree
, struct binding_level
*));
132 static void record_builtin_type
PARAMS ((enum rid
, const char *, tree
));
133 static void record_unknown_type
PARAMS ((tree
, const char *));
134 static tree build_library_fn_1
PARAMS ((tree
, enum tree_code
, tree
));
135 static int member_function_or_else
PARAMS ((tree
, tree
, enum overload_flags
));
136 static void bad_specifiers
PARAMS ((tree
, const char *, int, int, int, int,
138 static tree maybe_process_template_type_declaration
PARAMS ((tree
, int, struct binding_level
*));
139 static void check_for_uninitialized_const_var
PARAMS ((tree
));
140 static unsigned long typename_hash
PARAMS ((hash_table_key
));
141 static boolean typename_compare
PARAMS ((hash_table_key
, hash_table_key
));
142 static void push_binding
PARAMS ((tree
, tree
, struct binding_level
*));
143 static int add_binding
PARAMS ((tree
, tree
));
144 static void pop_binding
PARAMS ((tree
, tree
));
145 static tree local_variable_p_walkfn
PARAMS ((tree
*, int *, void *));
146 static tree find_binding
PARAMS ((tree
, tree
));
147 static tree select_decl
PARAMS ((tree
, int));
148 static int lookup_flags
PARAMS ((int, int));
149 static tree qualify_lookup
PARAMS ((tree
, int));
150 static tree record_builtin_java_type
PARAMS ((const char *, int));
151 static const char *tag_name
PARAMS ((enum tag_types code
));
152 static void find_class_binding_level
PARAMS ((void));
153 static struct binding_level
*innermost_nonclass_level
PARAMS ((void));
154 static void warn_about_implicit_typename_lookup
PARAMS ((tree
, tree
));
155 static int walk_namespaces_r
PARAMS ((tree
, walk_namespaces_fn
, void *));
156 static int walk_globals_r
PARAMS ((tree
, void *));
157 static void add_decl_to_level
PARAMS ((tree
, struct binding_level
*));
158 static tree make_label_decl
PARAMS ((tree
, int));
159 static void use_label
PARAMS ((tree
));
160 static void check_previous_goto_1
PARAMS ((tree
, struct binding_level
*, tree
,
162 static void check_previous_goto
PARAMS ((struct named_label_use_list
*));
163 static void check_switch_goto
PARAMS ((struct binding_level
*));
164 static void check_previous_gotos
PARAMS ((tree
));
165 static void pop_label
PARAMS ((tree
, tree
));
166 static void pop_labels
PARAMS ((tree
));
167 static void maybe_deduce_size_from_array_init
PARAMS ((tree
, tree
));
168 static void layout_var_decl
PARAMS ((tree
));
169 static void maybe_commonize_var
PARAMS ((tree
));
170 static tree check_initializer
PARAMS ((tree
, tree
));
171 static void make_rtl_for_nonlocal_decl
PARAMS ((tree
, tree
, const char *));
172 static void push_cp_function_context
PARAMS ((struct function
*));
173 static void pop_cp_function_context
PARAMS ((struct function
*));
174 static void mark_binding_level
PARAMS ((void *));
175 static void mark_named_label_lists
PARAMS ((void *, void *));
176 static void mark_cp_function_context
PARAMS ((struct function
*));
177 static void mark_saved_scope
PARAMS ((void *));
178 static void mark_lang_function
PARAMS ((struct cp_language_function
*));
179 static void save_function_data
PARAMS ((tree
));
180 static void check_function_type
PARAMS ((tree
, tree
));
181 static void destroy_local_var
PARAMS ((tree
));
182 static void finish_constructor_body
PARAMS ((void));
183 static void finish_destructor_body
PARAMS ((void));
184 static tree create_array_type_for_decl
PARAMS ((tree
, tree
, tree
));
185 static tree get_atexit_node
PARAMS ((void));
186 static tree get_dso_handle_node
PARAMS ((void));
187 static tree start_cleanup_fn
PARAMS ((void));
188 static void end_cleanup_fn
PARAMS ((void));
189 static tree cp_make_fname_decl
PARAMS ((tree
, const char *, int));
190 static void initialize_predefined_identifiers
PARAMS ((void));
191 static tree check_special_function_return_type
192 PARAMS ((special_function_kind
, tree
, tree
, tree
));
193 static tree push_cp_library_fn
PARAMS ((enum tree_code
, tree
));
194 static tree build_cp_library_fn
PARAMS ((tree
, enum tree_code
, tree
));
195 static void store_parm_decls
PARAMS ((tree
));
197 #if defined (DEBUG_CP_BINDING_LEVELS)
198 static void indent
PARAMS ((void));
201 /* Erroneous argument lists can use this *IFF* they do not modify it. */
202 tree error_mark_list
;
204 /* The following symbols are subsumed in the cp_global_trees array, and
205 listed here individually for documentation purposes.
208 tree wchar_decl_node;
210 tree vtable_entry_type;
211 tree delta_type_node;
214 tree __baselist_desc_type_node;
215 tree __i_desc_type_node, __m_desc_type_node;
216 tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type;
218 tree __t_desc_type_node;
220 tree __tp_desc_type_node;
222 tree ti_desc_type_node;
223 tree bltn_desc_type_node, ptr_desc_type_node;
224 tree ary_desc_type_node, func_desc_type_node, enum_desc_type_node;
225 tree class_desc_type_node, si_class_desc_type_node, vmi_class_desc_type_node;
226 tree ptm_desc_type_node;
227 tree base_desc_type_node;
229 Not needed yet? May be needed one day?
230 tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type;
231 tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type;
232 tree __ptmf_desc_array_type, __ptmd_desc_array_type;
235 tree class_type_node, record_type_node, union_type_node, enum_type_node;
236 tree unknown_type_node;
238 Array type `vtable_entry_type[]'
241 tree vtbl_ptr_type_node;
248 A FUNCTION_DECL which can call `abort'. Not necessarily the
249 one that the user will declare, but sufficient to be called
250 by routines that want to abort the program.
254 The FUNCTION_DECL for the default `::operator delete'.
256 tree global_delete_fndecl;
259 tree type_info_type_node, tinfo_decl_id, tinfo_decl_type;
264 tree cp_global_trees
[CPTI_MAX
];
266 /* Indicates that there is a type value in some namespace, although
267 that is not necessarily in scope at the moment. */
269 static tree global_type_node
;
271 /* If non-zero, this is the number of times we have entered the `std'
272 namespace when we are treating that namespace as an alias for the
274 static int in_fake_std
;
276 /* Expect only namespace names now. */
277 static int only_namespace_names
;
279 /* Used only for jumps to as-yet undefined labels, since jumps to
280 defined labels can have their validity checked immediately. */
282 struct named_label_use_list
284 struct binding_level
*binding_level
;
287 const char *filename_o_goto
;
289 struct named_label_use_list
*next
;
292 #define named_label_uses cp_function_chain->x_named_label_uses
294 /* A list of objects which have constructors or destructors
295 which reside in the global scope. The decl is stored in
296 the TREE_VALUE slot and the initializer is stored
297 in the TREE_PURPOSE slot. */
298 tree static_aggregates
;
302 /* A node for the integer constants 2, and 3. */
304 tree integer_two_node
, integer_three_node
;
306 /* Parsing a function declarator leaves here a chain of structure
307 and enum types declared in the parmlist. */
309 static tree last_function_parm_tags
;
311 /* Similar, for last_function_parm_tags. */
312 tree last_function_parms
;
313 static tree current_function_parm_tags
;
315 /* A list of all LABEL_DECLs in the function that have names. Here so
316 we can clear out their names' definitions at the end of the
317 function, and so we can check the validity of jumps to these labels. */
319 struct named_label_list
321 struct binding_level
*binding_level
;
327 struct named_label_list
*next
;
330 #define named_labels cp_function_chain->x_named_labels
332 /* Set to 0 at beginning of a function definition, and whenever
333 a label (case or named) is defined. Set to value of expression
334 returned from function when that value can be transformed into
335 a named return value. */
337 tree current_function_return_value
;
339 /* Nonzero means use the ISO C94 dialect of C. */
343 /* Nonzero means use the ISO C99 dialect of C. */
347 /* Nonzero means we are a hosted implementation for code shared with C. */
351 /* Nonzero means add default format_arg attributes for functions not
354 int flag_noniso_default_format_attributes
= 1;
356 /* Nonzero means give `double' the same size as `float'. */
358 extern int flag_short_double
;
360 /* Nonzero if we want to conserve space in the .o files. We do this
361 by putting uninitialized data and runtime initialized data into
362 .common instead of .data at the expense of not flagging multiple
364 extern int flag_conserve_space
;
366 /* C and C++ flags are in decl2.c. */
368 /* Flag used when debugging spew.c */
370 extern int spew_debug
;
372 /* A expression of value 0 with the same precision as a sizetype
374 tree signed_size_zero_node
;
376 /* The name of the anonymous namespace, throughout this translation
378 tree anonymous_namespace_name
;
380 /* The number of function bodies which we are currently processing.
381 (Zero if we are at namespace scope, one inside the body of a
382 function, two inside the body of a function in a local class, etc.) */
385 /* For each binding contour we allocate a binding_level structure
386 which records the names defined in that contour.
389 1) one for each function definition,
390 where internal declarations of the parameters appear.
391 2) one for each compound statement,
392 to record its declarations.
394 The current meaning of a name can be found by searching the levels
395 from the current one out to the global one.
397 Off to the side, may be the class_binding_level. This exists only
398 to catch class-local declarations. It is otherwise nonexistent.
400 Also there may be binding levels that catch cleanups that must be
401 run when exceptions occur. Thus, to see whether a name is bound in
402 the current scope, it is not enough to look in the
403 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
406 /* Note that the information in the `names' component of the global contour
407 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
411 /* A chain of _DECL nodes for all variables, constants, functions,
412 and typedef types. These are in the reverse of the order
413 supplied. There may be OVERLOADs on this list, too, but they
414 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
417 /* A list of structure, union and enum definitions, for looking up
419 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
420 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
421 or ENUMERAL_TYPE node.
423 C++: the TREE_VALUE nodes can be simple types for
424 component_bindings. */
427 /* A list of USING_DECL nodes. */
430 /* A list of used namespaces. PURPOSE is the namespace,
431 VALUE the common ancestor with this binding_level's namespace. */
432 tree using_directives
;
434 /* If this binding level is the binding level for a class, then
435 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
436 is the name of an entity bound in the class; the TREE_VALUE is
437 the IDENTIFIER_CLASS_VALUE before we entered the class. Thus,
438 when leaving class scope, we can restore the
439 IDENTIFIER_CLASS_VALUE by walking this list. The TREE_TYPE is
440 the DECL bound by this name in the class. */
443 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
444 is used for all binding levels. */
447 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
448 label in this scope. The TREE_PURPOSE is the previous value of
449 the IDENTIFIER_LABEL VALUE. */
450 tree shadowed_labels
;
452 /* For each level (except not the global one),
453 a chain of BLOCK nodes for all the levels
454 that were entered and exited one level down. */
457 /* The _TYPE node for this level, if parm_flag == 2. */
460 /* The binding level which this one is contained in (inherits from). */
461 struct binding_level
*level_chain
;
463 /* List of decls in `names' that have incomplete
464 structure or union types. */
467 /* List of VAR_DECLS saved from a previous for statement.
468 These would be dead in ISO-conforming code, but might
469 be referenced in ARM-era code. These are stored in a
470 TREE_LIST; the TREE_VALUE is the actual declaration. */
471 tree dead_vars_from_for
;
473 /* 1 for the level that holds the parameters of a function.
474 2 for the level that holds a class declaration. */
475 unsigned parm_flag
: 2;
477 /* 1 means make a BLOCK for this level regardless of all else.
478 2 for temporary binding contours created by the compiler. */
481 /* Nonzero if this level "doesn't exist" for tags. */
482 unsigned tag_transparent
: 1;
484 /* Nonzero if this level can safely have additional
485 cleanup-needing variables added to it. */
486 unsigned more_cleanups_ok
: 1;
487 unsigned have_cleanups
: 1;
489 /* Nonzero if this scope is for storing the decls for template
490 parameters and generic decls; these decls will be discarded and
491 replaced with a TEMPLATE_DECL. */
492 unsigned template_parms_p
: 1;
494 /* Nonzero if this scope corresponds to the `<>' in a
495 `template <>' clause. Whenever this flag is set,
496 TEMPLATE_PARMS_P will be set as well. */
497 unsigned template_spec_p
: 1;
499 /* This is set for a namespace binding level. */
500 unsigned namespace_p
: 1;
502 /* True if this level is that of a for-statement where we need to
503 worry about ambiguous (ARM or ISO) scope rules. */
504 unsigned is_for_scope
: 1;
506 /* True if this level corresponds to an EH region, as for a try block.
507 Currently this information is only available while building the
509 unsigned eh_region
: 1;
511 /* Four bits left for this word. */
513 #if defined(DEBUG_CP_BINDING_LEVELS)
514 /* Binding depth at which this level began. */
515 unsigned binding_depth
;
516 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
519 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
521 /* The binding level currently in effect. */
523 #define current_binding_level \
525 ? cp_function_chain->bindings \
526 : scope_chain->bindings)
528 /* The binding level of the current class, if any. */
530 #define class_binding_level scope_chain->class_bindings
532 /* A chain of binding_level structures awaiting reuse. */
534 static struct binding_level
*free_binding_level
;
536 /* The outermost binding level, for names of file scope.
537 This is created when the compiler is started and exists
538 through the entire run. */
540 static struct binding_level
*global_binding_level
;
542 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
544 static int keep_next_level_flag
;
546 #if defined(DEBUG_CP_BINDING_LEVELS)
547 static int binding_depth
= 0;
548 static int is_class_level
= 0;
555 for (i
= 0; i
< binding_depth
*2; i
++)
558 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
560 static tree pushdecl_with_scope
PARAMS ((tree
, struct binding_level
*));
563 push_binding_level (newlevel
, tag_transparent
, keep
)
564 struct binding_level
*newlevel
;
565 int tag_transparent
, keep
;
567 /* Add this level to the front of the chain (stack) of levels that
569 memset ((char*) newlevel
, 0, sizeof (struct binding_level
));
570 newlevel
->level_chain
= current_binding_level
;
571 current_binding_level
= newlevel
;
572 newlevel
->tag_transparent
= tag_transparent
;
573 newlevel
->more_cleanups_ok
= 1;
575 newlevel
->keep
= keep
;
576 #if defined(DEBUG_CP_BINDING_LEVELS)
577 newlevel
->binding_depth
= binding_depth
;
579 fprintf (stderr
, "push %s level 0x%08x line %d\n",
580 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
583 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
586 /* Find the innermost enclosing class scope, and reset
587 CLASS_BINDING_LEVEL appropriately. */
590 find_class_binding_level ()
592 struct binding_level
*level
= current_binding_level
;
594 while (level
&& level
->parm_flag
!= 2)
595 level
= level
->level_chain
;
596 if (level
&& level
->parm_flag
== 2)
597 class_binding_level
= level
;
599 class_binding_level
= 0;
605 if (global_binding_level
)
607 /* Cannot pop a level, if there are none left to pop. */
608 if (current_binding_level
== global_binding_level
)
609 my_friendly_abort (123);
611 /* Pop the current level, and free the structure for reuse. */
612 #if defined(DEBUG_CP_BINDING_LEVELS)
615 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
616 (is_class_level
) ? "class" : "block",
617 current_binding_level
, lineno
);
618 if (is_class_level
!= (current_binding_level
== class_binding_level
))
621 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
624 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
626 register struct binding_level
*level
= current_binding_level
;
627 current_binding_level
= current_binding_level
->level_chain
;
628 level
->level_chain
= free_binding_level
;
629 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
630 if (level
->binding_depth
!= binding_depth
)
632 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
633 free_binding_level
= level
;
634 find_class_binding_level ();
639 suspend_binding_level ()
641 if (class_binding_level
)
642 current_binding_level
= class_binding_level
;
644 if (global_binding_level
)
646 /* Cannot suspend a level, if there are none left to suspend. */
647 if (current_binding_level
== global_binding_level
)
648 my_friendly_abort (123);
650 /* Suspend the current level. */
651 #if defined(DEBUG_CP_BINDING_LEVELS)
654 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
655 (is_class_level
) ? "class" : "block",
656 current_binding_level
, lineno
);
657 if (is_class_level
!= (current_binding_level
== class_binding_level
))
660 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
663 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
664 current_binding_level
= current_binding_level
->level_chain
;
665 find_class_binding_level ();
669 resume_binding_level (b
)
670 struct binding_level
*b
;
672 /* Resuming binding levels is meant only for namespaces,
673 and those cannot nest into classes. */
674 my_friendly_assert(!class_binding_level
, 386);
675 /* Also, resuming a non-directly nested namespace is a no-no. */
676 my_friendly_assert(b
->level_chain
== current_binding_level
, 386);
677 current_binding_level
= b
;
678 #if defined(DEBUG_CP_BINDING_LEVELS)
679 b
->binding_depth
= binding_depth
;
681 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
682 (is_class_level
) ? "class" : "block", b
, lineno
);
685 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
688 /* Create a new `struct binding_level'. */
691 struct binding_level
*
692 make_binding_level ()
695 return (struct binding_level
*) xmalloc (sizeof (struct binding_level
));
698 /* Nonzero if we are currently in the global binding level. */
703 return current_binding_level
== global_binding_level
;
706 /* Return the innermost binding level that is not for a class scope. */
708 static struct binding_level
*
709 innermost_nonclass_level ()
711 struct binding_level
*b
;
713 b
= current_binding_level
;
714 while (b
->parm_flag
== 2)
720 /* Nonzero if we are currently in a toplevel binding level. This
721 means either the global binding level or a namespace in a toplevel
722 binding level. Since there are no non-toplevel namespace levels,
723 this really means any namespace or template parameter level. We
724 also include a class whose context is toplevel. */
727 toplevel_bindings_p ()
729 struct binding_level
*b
= innermost_nonclass_level ();
731 return b
->namespace_p
|| b
->template_parms_p
;
734 /* Nonzero if this is a namespace scope, or if we are defining a class
735 which is itself at namespace scope, or whose enclosing class is
736 such a class, etc. */
739 namespace_bindings_p ()
741 struct binding_level
*b
= innermost_nonclass_level ();
743 return b
->namespace_p
;
746 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
747 unconditionally. Otherwise, use the normal logic to decide whether
748 or not to create a BLOCK. */
751 keep_next_level (keep
)
754 keep_next_level_flag
= keep
;
757 /* Nonzero if the current level needs to have a BLOCK made. */
762 return (current_binding_level
->blocks
!= NULL_TREE
763 || current_binding_level
->keep
764 || current_binding_level
->names
!= NULL_TREE
765 || (current_binding_level
->tags
!= NULL_TREE
766 && !current_binding_level
->tag_transparent
));
770 declare_namespace_level ()
772 current_binding_level
->namespace_p
= 1;
775 /* Returns non-zero if this scope was created to store template
779 template_parm_scope_p ()
781 return current_binding_level
->template_parms_p
;
784 /* Returns the kind of template specialization we are currently
785 processing, given that it's declaration contained N_CLASS_SCOPES
786 explicit scope qualifications. */
789 current_tmpl_spec_kind (n_class_scopes
)
792 int n_template_parm_scopes
= 0;
793 int seen_specialization_p
= 0;
794 int innermost_specialization_p
= 0;
795 struct binding_level
*b
;
797 /* Scan through the template parameter scopes. */
798 for (b
= current_binding_level
; b
->template_parms_p
; b
= b
->level_chain
)
800 /* If we see a specialization scope inside a parameter scope,
801 then something is wrong. That corresponds to a declaration
804 template <class T> template <> ...
806 which is always illegal since [temp.expl.spec] forbids the
807 specialization of a class member template if the enclosing
808 class templates are not explicitly specialized as well. */
809 if (b
->template_spec_p
)
811 if (n_template_parm_scopes
== 0)
812 innermost_specialization_p
= 1;
814 seen_specialization_p
= 1;
816 else if (seen_specialization_p
== 1)
817 return tsk_invalid_member_spec
;
819 ++n_template_parm_scopes
;
822 /* Handle explicit instantiations. */
823 if (processing_explicit_instantiation
)
825 if (n_template_parm_scopes
!= 0)
826 /* We've seen a template parameter list during an explicit
827 instantiation. For example:
829 template <class T> template void f(int);
831 This is erroneous. */
832 return tsk_invalid_expl_inst
;
834 return tsk_expl_inst
;
837 if (n_template_parm_scopes
< n_class_scopes
)
838 /* We've not seen enough template headers to match all the
839 specialized classes present. For example:
841 template <class T> void R<T>::S<T>::f(int);
843 This is illegal; there needs to be one set of template
844 parameters for each class. */
845 return tsk_insufficient_parms
;
846 else if (n_template_parm_scopes
== n_class_scopes
)
847 /* We're processing a non-template declaration (even though it may
848 be a member of a template class.) For example:
850 template <class T> void S<T>::f(int);
852 The `class T' maches the `S<T>', leaving no template headers
853 corresponding to the `f'. */
855 else if (n_template_parm_scopes
> n_class_scopes
+ 1)
856 /* We've got too many template headers. For example:
858 template <> template <class T> void f (T);
860 There need to be more enclosing classes. */
861 return tsk_excessive_parms
;
863 /* This must be a template. It's of the form:
865 template <class T> template <class U> void S<T>::f(U);
867 This is a specialization if the innermost level was a
868 specialization; otherwise it's just a definition of the
870 return innermost_specialization_p
? tsk_expl_spec
: tsk_template
;
874 set_class_shadows (shadows
)
877 class_binding_level
->class_shadowed
= shadows
;
880 /* Enter a new binding level.
881 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
882 not for that of tags. */
885 pushlevel (tag_transparent
)
888 struct binding_level
*newlevel
;
890 if (cfun
&& !doing_semantic_analysis_p ())
893 /* Reuse or create a struct for this binding level. */
894 #if defined(DEBUG_CP_BINDING_LEVELS)
896 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
897 if (free_binding_level
)
898 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
900 newlevel
= free_binding_level
;
901 free_binding_level
= free_binding_level
->level_chain
;
904 newlevel
= make_binding_level ();
906 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
907 GNU_xref_start_scope ((HOST_WIDE_INT
) newlevel
);
908 keep_next_level_flag
= 0;
911 /* Enter a new scope. The KIND indicates what kind of scope is being
922 case sk_template_spec
:
923 current_binding_level
->template_spec_p
= 1;
926 case sk_template_parms
:
927 current_binding_level
->template_parms_p
= 1;
931 my_friendly_abort (20000309);
935 /* Exit the current scope. */
944 note_level_for_for ()
946 current_binding_level
->is_for_scope
= 1;
949 /* Record that the current binding level represents a try block. */
954 current_binding_level
->eh_region
= 1;
957 /* For a binding between a name and an entity at a block scope,
958 this is the `struct binding_level' for the block. */
959 #define BINDING_LEVEL(NODE) \
960 (((struct tree_binding*)NODE)->scope.level)
962 /* Make DECL the innermost binding for ID. The LEVEL is the binding
963 level at which this declaration is being bound. */
966 push_binding (id
, decl
, level
)
969 struct binding_level
* level
;
973 binding
= make_node (CPLUS_BINDING
);
975 /* Now, fill in the binding information. */
976 BINDING_VALUE (binding
) = decl
;
977 BINDING_TYPE (binding
) = NULL_TREE
;
978 BINDING_LEVEL (binding
) = level
;
979 INHERITED_VALUE_BINDING_P (binding
) = 0;
980 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
981 BINDING_HAS_LEVEL_P (binding
) = 1;
983 /* And put it on the front of the list of bindings for ID. */
984 TREE_CHAIN (binding
) = IDENTIFIER_BINDING (id
);
985 IDENTIFIER_BINDING (id
) = binding
;
988 /* ID is already bound in the current scope. But, DECL is an
989 additional binding for ID in the same scope. This is the `struct
990 stat' hack whereby a non-typedef class-name or enum-name can be
991 bound at the same level as some other kind of entity. It's the
992 responsibility of the caller to check that inserting this name is
993 legal here. Returns nonzero if the new binding was successful. */
995 add_binding (id
, decl
)
999 tree binding
= IDENTIFIER_BINDING (id
);
1002 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
1003 /* The new name is the type name. */
1004 BINDING_TYPE (binding
) = decl
;
1005 else if (!BINDING_VALUE (binding
))
1006 /* This situation arises when push_class_level_binding moves an
1007 inherited type-binding out of the way to make room for a new
1009 BINDING_VALUE (binding
) = decl
;
1010 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
1011 && DECL_ARTIFICIAL (BINDING_VALUE (binding
)))
1013 /* The old binding was a type name. It was placed in
1014 BINDING_VALUE because it was thought, at the point it was
1015 declared, to be the only entity with such a name. Move the
1016 type name into the type slot; it is now hidden by the new
1018 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
1019 BINDING_VALUE (binding
) = decl
;
1020 INHERITED_VALUE_BINDING_P (binding
) = 0;
1022 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
1023 && TREE_CODE (decl
) == TYPE_DECL
1024 && DECL_NAME (decl
) == DECL_NAME (BINDING_VALUE (binding
))
1025 && same_type_p (TREE_TYPE (decl
),
1026 TREE_TYPE (BINDING_VALUE (binding
))))
1027 /* We have two typedef-names, both naming the same type to have
1028 the same name. This is OK because of:
1032 In a given scope, a typedef specifier can be used to redefine
1033 the name of any type declared in that scope to refer to the
1034 type to which it already refers. */
1036 /* There can be two block-scope declarations of the same variable,
1037 so long as they are `extern' declarations. */
1038 else if (TREE_CODE (decl
) == VAR_DECL
1039 && TREE_CODE (BINDING_VALUE (binding
)) == VAR_DECL
1040 && DECL_EXTERNAL (decl
)
1041 && DECL_EXTERNAL (BINDING_VALUE (binding
)))
1043 duplicate_decls (decl
, BINDING_VALUE (binding
));
1048 cp_error ("declaration of `%#D'", decl
);
1049 cp_error_at ("conflicts with previous declaration `%#D'",
1050 BINDING_VALUE (binding
));
1057 /* Add DECL to the list of things declared in B. */
1060 add_decl_to_level (decl
, b
)
1062 struct binding_level
*b
;
1064 /* We build up the list in reverse order, and reverse it later if
1066 TREE_CHAIN (decl
) = b
->names
;
1070 /* Bind DECL to ID in the current_binding_level, assumed to be a local
1071 binding level. If PUSH_USING is set in FLAGS, we know that DECL
1072 doesn't really belong to this binding level, that it got here
1073 through a using-declaration. */
1076 push_local_binding (id
, decl
, flags
)
1081 struct binding_level
*b
;
1083 /* Skip over any local classes. This makes sense if we call
1084 push_local_binding with a friend decl of a local class. */
1085 b
= current_binding_level
;
1086 while (b
->parm_flag
== 2)
1089 if (lookup_name_current_level (id
))
1091 /* Supplement the existing binding. */
1092 if (!add_binding (id
, decl
))
1093 /* It didn't work. Something else must be bound at this
1094 level. Do not add DECL to the list of things to pop
1099 /* Create a new binding. */
1100 push_binding (id
, decl
, b
);
1102 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
1103 /* We must put the OVERLOAD into a TREE_LIST since the
1104 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1105 decls that got here through a using-declaration. */
1106 decl
= build_tree_list (NULL_TREE
, decl
);
1108 /* And put DECL on the list of things declared by the current
1110 add_decl_to_level (decl
, b
);
1113 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
1114 binding was successful. */
1117 push_class_binding (id
, decl
)
1122 tree binding
= IDENTIFIER_BINDING (id
);
1125 /* Note that we declared this value so that we can issue an error if
1126 this an illegal redeclaration of a name already used for some
1128 note_name_declared_in_class (id
, decl
);
1130 if (binding
&& BINDING_LEVEL (binding
) == class_binding_level
)
1131 /* Supplement the existing binding. */
1132 result
= add_binding (id
, decl
);
1134 /* Create a new binding. */
1135 push_binding (id
, decl
, class_binding_level
);
1137 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1138 class-level declaration. Note that we do not use DECL here
1139 because of the possibility of the `struct stat' hack; if DECL is
1140 a class-name or enum-name we might prefer a field-name, or some
1142 IDENTIFIER_CLASS_VALUE (id
) = BINDING_VALUE (IDENTIFIER_BINDING (id
));
1144 /* If this is a binding from a base class, mark it as such. */
1145 binding
= IDENTIFIER_BINDING (id
);
1146 if (BINDING_VALUE (binding
) == decl
&& TREE_CODE (decl
) != TREE_LIST
)
1148 /* Any implicit typename must be from a base-class. The
1149 context for an implicit typename declaration is always
1150 the derived class in which the lookup was done, so the checks
1151 based on the context of DECL below will not trigger. */
1152 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl
))
1153 INHERITED_VALUE_BINDING_P (binding
) = 1;
1156 if (TREE_CODE (decl
) == OVERLOAD
)
1157 context
= CP_DECL_CONTEXT (OVL_CURRENT (decl
));
1160 my_friendly_assert (DECL_P (decl
), 0);
1161 context
= CP_DECL_CONTEXT (decl
);
1164 if (is_properly_derived_from (current_class_type
, context
))
1165 INHERITED_VALUE_BINDING_P (binding
) = 1;
1167 INHERITED_VALUE_BINDING_P (binding
) = 0;
1170 else if (BINDING_VALUE (binding
) == decl
)
1171 /* We only encounter a TREE_LIST when push_class_decls detects an
1172 ambiguity. Such an ambiguity can be overridden by a definition
1174 INHERITED_VALUE_BINDING_P (binding
) = 1;
1179 /* Remove the binding for DECL which should be the innermost binding
1183 pop_binding (id
, decl
)
1189 if (id
== NULL_TREE
)
1190 /* It's easiest to write the loops that call this function without
1191 checking whether or not the entities involved have names. We
1192 get here for such an entity. */
1195 /* Get the innermost binding for ID. */
1196 binding
= IDENTIFIER_BINDING (id
);
1198 /* The name should be bound. */
1199 my_friendly_assert (binding
!= NULL_TREE
, 0);
1201 /* The DECL will be either the ordinary binding or the type
1202 binding for this identifier. Remove that binding. */
1203 if (BINDING_VALUE (binding
) == decl
)
1204 BINDING_VALUE (binding
) = NULL_TREE
;
1205 else if (BINDING_TYPE (binding
) == decl
)
1206 BINDING_TYPE (binding
) = NULL_TREE
;
1208 my_friendly_abort (0);
1210 if (!BINDING_VALUE (binding
) && !BINDING_TYPE (binding
))
1211 /* We're completely done with the innermost binding for this
1212 identifier. Unhook it from the list of bindings. */
1213 IDENTIFIER_BINDING (id
) = TREE_CHAIN (binding
);
1216 /* When a label goes out of scope, check to see if that label was used
1217 in a valid manner, and issue any appropriate warnings or errors. */
1220 pop_label (label
, old_value
)
1224 if (!processing_template_decl
&& doing_semantic_analysis_p ())
1226 if (DECL_INITIAL (label
) == NULL_TREE
)
1228 cp_error_at ("label `%D' used but not defined", label
);
1229 /* Avoid crashing later. */
1230 define_label (input_filename
, 1, DECL_NAME (label
));
1232 else if (warn_unused_label
&& !TREE_USED (label
))
1233 cp_warning_at ("label `%D' defined but not used", label
);
1236 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), old_value
);
1239 /* At the end of a function, all labels declared within the function
1240 go out of scope. BLOCK is the top-level block for the
1247 struct named_label_list
*link
;
1249 /* Clear out the definitions of all label names, since their scopes
1251 for (link
= named_labels
; link
; link
= link
->next
)
1253 pop_label (link
->label_decl
, link
->old_value
);
1254 /* Put the labels into the "variables" of the top-level block,
1255 so debugger can see them. */
1256 TREE_CHAIN (link
->label_decl
) = BLOCK_VARS (block
);
1257 BLOCK_VARS (block
) = link
->label_decl
;
1260 named_labels
= NULL
;
1263 /* Exit a binding level.
1264 Pop the level off, and restore the state of the identifier-decl mappings
1265 that were in effect when this level was entered.
1267 If KEEP == 1, this level had explicit declarations, so
1268 and create a "block" (a BLOCK node) for the level
1269 to record its declarations and subblocks for symbol table output.
1271 If FUNCTIONBODY is nonzero, this level is the body of a function,
1272 so create a block as if KEEP were set and also clear out all
1275 If REVERSE is nonzero, reverse the order of decls before putting
1276 them into the BLOCK. */
1279 poplevel (keep
, reverse
, functionbody
)
1285 /* The chain of decls was accumulated in reverse order.
1286 Put it into forward order, just for cleanliness. */
1288 int tmp
= functionbody
;
1289 int real_functionbody
;
1292 tree block
= NULL_TREE
;
1294 int leaving_for_scope
;
1296 if (cfun
&& !doing_semantic_analysis_p ())
1299 my_friendly_assert (current_binding_level
->parm_flag
!= 2,
1302 real_functionbody
= (current_binding_level
->keep
== 2
1303 ? ((functionbody
= 0), tmp
) : functionbody
);
1304 tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1305 subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1307 my_friendly_assert (!current_binding_level
->class_shadowed
,
1310 /* We used to use KEEP == 2 to indicate that the new block should go
1311 at the beginning of the list of blocks at this binding level,
1312 rather than the end. This hack is no longer used. */
1313 my_friendly_assert (keep
== 0 || keep
== 1, 0);
1315 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1316 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1317 current_binding_level
->parm_flag
,
1318 current_binding_level
->keep
);
1320 if (current_binding_level
->keep
== 1)
1323 /* Any uses of undefined labels, and any defined labels, now operate
1324 under constraints of next binding contour. */
1325 if (cfun
&& !functionbody
)
1327 struct binding_level
*level_chain
;
1328 level_chain
= current_binding_level
->level_chain
;
1331 struct named_label_use_list
*uses
;
1332 struct named_label_list
*labels
;
1333 for (labels
= named_labels
; labels
; labels
= labels
->next
)
1334 if (labels
->binding_level
== current_binding_level
)
1337 if (current_binding_level
->eh_region
)
1338 labels
->eh_region
= 1;
1339 for (decl
= labels
->names_in_scope
; decl
;
1340 decl
= TREE_CHAIN (decl
))
1341 if (decl_jump_unsafe (decl
))
1342 labels
->bad_decls
= tree_cons (NULL_TREE
, decl
,
1344 labels
->binding_level
= level_chain
;
1345 labels
->names_in_scope
= level_chain
->names
;
1348 for (uses
= named_label_uses
; uses
; uses
= uses
->next
)
1349 if (uses
->binding_level
== current_binding_level
)
1351 uses
->binding_level
= level_chain
;
1352 uses
->names_in_scope
= level_chain
->names
;
1357 /* Get the decls in the order they were written.
1358 Usually current_binding_level->names is in reverse order.
1359 But parameter decls were previously put in forward order. */
1362 current_binding_level
->names
1363 = decls
= nreverse (current_binding_level
->names
);
1365 decls
= current_binding_level
->names
;
1367 /* Output any nested inline functions within this block
1368 if they weren't already output. */
1369 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1370 if (TREE_CODE (decl
) == FUNCTION_DECL
1371 && ! TREE_ASM_WRITTEN (decl
)
1372 && DECL_INITIAL (decl
) != NULL_TREE
1373 && TREE_ADDRESSABLE (decl
)
1374 && decl_function_context (decl
) == current_function_decl
)
1376 /* If this decl was copied from a file-scope decl
1377 on account of a block-scope extern decl,
1378 propagate TREE_ADDRESSABLE to the file-scope decl. */
1379 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1380 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1383 push_function_context ();
1384 output_inline_function (decl
);
1385 pop_function_context ();
1389 /* When not in function-at-a-time mode, expand_end_bindings will
1390 warn about unused variables. But, in function-at-a-time mode
1391 expand_end_bindings is not passed the list of variables in the
1392 current scope, and therefore no warning is emitted. So, we
1393 explicitly warn here. */
1394 if (!processing_template_decl
)
1395 warn_about_unused_variables (getdecls ());
1397 /* If there were any declarations or structure tags in that level,
1398 or if this level is a function body,
1399 create a BLOCK to record them for the life of this function. */
1401 if (keep
== 1 || functionbody
)
1402 block
= make_node (BLOCK
);
1403 if (block
!= NULL_TREE
)
1405 BLOCK_VARS (block
) = decls
;
1406 BLOCK_SUBBLOCKS (block
) = subblocks
;
1409 /* In each subblock, record that this is its superior. */
1411 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1412 BLOCK_SUPERCONTEXT (link
) = block
;
1414 /* We still support the old for-scope rules, whereby the variables
1415 in a for-init statement were in scope after the for-statement
1416 ended. We only use the new rules in flag_new_for_scope is
1419 = current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1;
1421 /* Remove declarations for all the DECLs in this level. */
1422 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1424 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
1425 && DECL_NAME (link
))
1428 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link
)));
1432 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
1434 ns_binding
= NULL_TREE
;
1437 && (BINDING_LEVEL (outer_binding
)
1438 == current_binding_level
->level_chain
))
1439 /* We have something like:
1444 and we are leaving the `for' scope. There's no reason to
1445 keep the binding of the inner `i' in this case. */
1446 pop_binding (DECL_NAME (link
), link
);
1447 else if ((outer_binding
1448 && (TREE_CODE (BINDING_VALUE (outer_binding
))
1451 && TREE_CODE (ns_binding
) == TYPE_DECL
))
1452 /* Here, we have something like:
1460 We must pop the for-scope binding so we know what's a
1461 type and what isn't. */
1462 pop_binding (DECL_NAME (link
), link
);
1465 /* Mark this VAR_DECL as dead so that we can tell we left it
1466 there only for backward compatibility. */
1467 DECL_DEAD_FOR_LOCAL (link
) = 1;
1469 /* Keep track of what should of have happenned when we
1470 popped the binding. */
1471 if (outer_binding
&& BINDING_VALUE (outer_binding
))
1472 DECL_SHADOWED_FOR_VAR (link
)
1473 = BINDING_VALUE (outer_binding
);
1475 /* Add it to the list of dead variables in the next
1476 outermost binding to that we can remove these when we
1477 leave that binding. */
1478 current_binding_level
->level_chain
->dead_vars_from_for
1479 = tree_cons (NULL_TREE
, link
,
1480 current_binding_level
->level_chain
->
1481 dead_vars_from_for
);
1483 /* Although we don't pop the CPLUS_BINDING, we do clear
1484 its BINDING_LEVEL since the level is going away now. */
1485 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link
)))
1491 /* Remove the binding. */
1493 if (TREE_CODE (decl
) == TREE_LIST
)
1494 decl
= TREE_VALUE (decl
);
1496 pop_binding (DECL_NAME (decl
), decl
);
1497 else if (TREE_CODE (decl
) == OVERLOAD
)
1498 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
1500 my_friendly_abort (0);
1504 /* Remove declarations for any `for' variables from inner scopes
1505 that we kept around. */
1506 for (link
= current_binding_level
->dead_vars_from_for
;
1507 link
; link
= TREE_CHAIN (link
))
1508 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
1510 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1511 for (link
= current_binding_level
->type_shadowed
;
1512 link
; link
= TREE_CHAIN (link
))
1513 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1515 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1516 for (link
= current_binding_level
->shadowed_labels
;
1518 link
= TREE_CHAIN (link
))
1519 pop_label (TREE_VALUE (link
), TREE_PURPOSE (link
));
1521 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1522 list if a `using' declaration put them there. The debugging
1523 back-ends won't understand OVERLOAD, so we remove them here.
1524 Because the BLOCK_VARS are (temporarily) shared with
1525 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1526 popped all the bindings. */
1531 for (d
= &BLOCK_VARS (block
); *d
; )
1533 if (TREE_CODE (*d
) == TREE_LIST
)
1534 *d
= TREE_CHAIN (*d
);
1536 d
= &TREE_CHAIN (*d
);
1540 /* If the level being exited is the top level of a function,
1541 check over all the labels. */
1544 /* Since this is the top level block of a function, the vars are
1545 the function's parameters. Don't leave them in the BLOCK
1546 because they are found in the FUNCTION_DECL instead. */
1547 BLOCK_VARS (block
) = 0;
1551 tmp
= current_binding_level
->keep
;
1553 pop_binding_level ();
1555 DECL_INITIAL (current_function_decl
) = block
;
1557 current_binding_level
->blocks
1558 = chainon (current_binding_level
->blocks
, block
);
1560 /* If we did not make a block for the level just exited,
1561 any blocks made for inner levels
1562 (since they cannot be recorded as subblocks in that level)
1563 must be carried forward so they will later become subblocks
1564 of something else. */
1566 current_binding_level
->blocks
1567 = chainon (current_binding_level
->blocks
, subblocks
);
1569 /* Each and every BLOCK node created here in `poplevel' is important
1570 (e.g. for proper debugging information) so if we created one
1571 earlier, mark it as "used". */
1573 TREE_USED (block
) = 1;
1575 /* Take care of compiler's internal binding structures. */
1581 = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/1);
1584 SCOPE_STMT_BLOCK (TREE_PURPOSE (scope_stmts
)) = block
;
1585 SCOPE_STMT_BLOCK (TREE_VALUE (scope_stmts
)) = block
;
1588 block
= poplevel (keep
, reverse
, functionbody
);
1594 /* Delete the node BLOCK from the current binding level.
1595 This is used for the block inside a stmt expr ({...})
1596 so that the block can be reinserted where appropriate. */
1599 delete_block (block
)
1603 if (current_binding_level
->blocks
== block
)
1604 current_binding_level
->blocks
= TREE_CHAIN (block
);
1605 for (t
= current_binding_level
->blocks
; t
;)
1607 if (TREE_CHAIN (t
) == block
)
1608 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1612 TREE_CHAIN (block
) = NULL_TREE
;
1613 /* Clear TREE_USED which is always set by poplevel.
1614 The flag is set again if insert_block is called. */
1615 TREE_USED (block
) = 0;
1618 /* Insert BLOCK at the end of the list of subblocks of the
1619 current binding level. This is used when a BIND_EXPR is expanded,
1620 to handle the BLOCK node inside the BIND_EXPR. */
1623 insert_block (block
)
1626 TREE_USED (block
) = 1;
1627 current_binding_level
->blocks
1628 = chainon (current_binding_level
->blocks
, block
);
1631 /* Set the BLOCK node for the innermost scope
1632 (the one we are currently in). */
1636 tree block ATTRIBUTE_UNUSED
;
1638 /* The RTL expansion machinery requires us to provide this callback,
1639 but it is not applicable in function-at-a-time mode. */
1640 my_friendly_assert (cfun
&& !doing_semantic_analysis_p (), 20000911);
1643 /* Do a pushlevel for class declarations. */
1648 register struct binding_level
*newlevel
;
1650 /* Reuse or create a struct for this binding level. */
1651 #if defined(DEBUG_CP_BINDING_LEVELS)
1653 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1654 if (free_binding_level
)
1655 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1657 newlevel
= free_binding_level
;
1658 free_binding_level
= free_binding_level
->level_chain
;
1661 newlevel
= make_binding_level ();
1663 #if defined(DEBUG_CP_BINDING_LEVELS)
1665 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1667 push_binding_level (newlevel
, 0, 0);
1669 class_binding_level
= current_binding_level
;
1670 class_binding_level
->parm_flag
= 2;
1671 class_binding_level
->this_class
= current_class_type
;
1674 /* ...and a poplevel for class declarations. */
1679 register struct binding_level
*level
= class_binding_level
;
1682 my_friendly_assert (level
!= 0, 354);
1684 /* If we're leaving a toplevel class, don't bother to do the setting
1685 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1686 shouldn't even be used when current_class_type isn't set, and second,
1687 if we don't touch it here, we're able to use the cache effect if the
1688 next time we're entering a class scope, it is the same class. */
1689 if (current_class_depth
!= 1)
1691 struct binding_level
* b
;
1693 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1694 for (shadowed
= level
->class_shadowed
;
1696 shadowed
= TREE_CHAIN (shadowed
))
1697 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = NULL_TREE
;
1699 /* Find the next enclosing class, and recreate
1700 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1701 b
= level
->level_chain
;
1702 while (b
&& b
->parm_flag
!= 2)
1706 for (shadowed
= b
->class_shadowed
;
1708 shadowed
= TREE_CHAIN (shadowed
))
1712 t
= IDENTIFIER_BINDING (TREE_PURPOSE (shadowed
));
1713 while (t
&& BINDING_LEVEL (t
) != b
)
1717 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
))
1718 = BINDING_VALUE (t
);
1722 /* Remember to save what IDENTIFIER's were bound in this scope so we
1723 can recover from cache misses. */
1725 previous_class_type
= current_class_type
;
1726 previous_class_values
= class_binding_level
->class_shadowed
;
1728 for (shadowed
= level
->type_shadowed
;
1730 shadowed
= TREE_CHAIN (shadowed
))
1731 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1733 /* Remove the bindings for all of the class-level declarations. */
1734 for (shadowed
= level
->class_shadowed
;
1736 shadowed
= TREE_CHAIN (shadowed
))
1737 pop_binding (TREE_PURPOSE (shadowed
), TREE_TYPE (shadowed
));
1739 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1740 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1741 class_binding_level
->parm_flag
,
1742 class_binding_level
->keep
);
1744 /* Now, pop out of the binding level which we created up in the
1745 `pushlevel_class' routine. */
1746 #if defined(DEBUG_CP_BINDING_LEVELS)
1748 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1750 pop_binding_level ();
1753 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1754 for any names in enclosing classes. */
1757 clear_identifier_class_values ()
1761 if (!class_binding_level
)
1764 for (t
= class_binding_level
->class_shadowed
;
1767 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
1770 /* Returns non-zero if T is a virtual function table. */
1773 vtable_decl_p (t
, data
)
1775 void *data ATTRIBUTE_UNUSED
;
1777 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
1780 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1784 vtype_decl_p (t
, data
)
1786 void *data ATTRIBUTE_UNUSED
;
1788 return (TREE_CODE (t
) == TYPE_DECL
1789 && TREE_CODE (TREE_TYPE (t
)) == RECORD_TYPE
1790 && TYPE_POLYMORPHIC_P (TREE_TYPE (t
)));
1793 /* Return the declarations that are members of the namespace NS. */
1796 cp_namespace_decls (ns
)
1799 return NAMESPACE_LEVEL (ns
)->names
;
1802 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1803 itself, calling F for each. The DATA is passed to F as well. */
1806 walk_namespaces_r (namespace, f
, data
)
1808 walk_namespaces_fn f
;
1814 result
|= (*f
) (namespace, data
);
1816 for (current
= cp_namespace_decls (namespace);
1818 current
= TREE_CHAIN (current
))
1820 if (TREE_CODE (current
) != NAMESPACE_DECL
1821 || DECL_NAMESPACE_ALIAS (current
))
1823 if (!DECL_LANG_SPECIFIC (current
))
1826 my_friendly_assert (current
== fake_std_node
, 393);
1830 /* We found a namespace. */
1831 result
|= walk_namespaces_r (current
, f
, data
);
1837 /* Walk all the namespaces, calling F for each. The DATA is passed to
1841 walk_namespaces (f
, data
)
1842 walk_namespaces_fn f
;
1845 return walk_namespaces_r (global_namespace
, f
, data
);
1848 struct walk_globals_data
{
1849 walk_globals_pred p
;
1854 /* Walk the global declarations in NAMESPACE. Whenever one is found
1855 for which P returns non-zero, call F with its address. If any call
1856 to F returns a non-zero value, return a non-zero value. */
1859 walk_globals_r (namespace, data
)
1863 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1864 walk_globals_pred p
= wgd
->p
;
1865 walk_globals_fn f
= wgd
->f
;
1866 void *d
= wgd
->data
;
1870 t
= &NAMESPACE_LEVEL (namespace)->names
;
1877 result
|= (*f
) (t
, d
);
1879 /* If F changed *T, then *T still points at the next item to
1882 t
= &TREE_CHAIN (*t
);
1888 /* Walk the global declarations. Whenever one is found for which P
1889 returns non-zero, call F with its address. If any call to F
1890 returns a non-zero value, return a non-zero value. */
1893 walk_globals (p
, f
, data
)
1894 walk_globals_pred p
;
1898 struct walk_globals_data wgd
;
1903 return walk_namespaces (walk_globals_r
, &wgd
);
1906 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1907 DATA is non-NULL, this is the last time we will call
1908 wrapup_global_declarations for this NAMESPACE. */
1911 wrapup_globals_for_namespace (namespace, data
)
1915 tree globals
= cp_namespace_decls (namespace);
1916 int len
= list_length (globals
);
1917 tree
*vec
= (tree
*) alloca (sizeof (tree
) * len
);
1921 int last_time
= (data
!= 0);
1923 if (last_time
&& namespace == global_namespace
)
1924 /* Let compile_file handle the global namespace. */
1927 /* Process the decls in reverse order--earliest first.
1928 Put them into VEC from back to front, then take out from front. */
1929 for (i
= 0, decl
= globals
; i
< len
; i
++, decl
= TREE_CHAIN (decl
))
1930 vec
[len
- i
- 1] = decl
;
1934 check_global_declarations (vec
, len
);
1938 /* Temporarily mark vtables as external. That prevents
1939 wrapup_global_declarations from writing them out; we must process
1940 them ourselves in finish_vtable_vardecl. */
1941 for (i
= 0; i
< len
; ++i
)
1942 if (vtable_decl_p (vec
[i
], /*data=*/0) && !DECL_EXTERNAL (vec
[i
]))
1944 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 1;
1945 DECL_EXTERNAL (vec
[i
]) = 1;
1948 /* Write out any globals that need to be output. */
1949 result
= wrapup_global_declarations (vec
, len
);
1951 /* Undo the hack to DECL_EXTERNAL above. */
1952 for (i
= 0; i
< len
; ++i
)
1953 if (vtable_decl_p (vec
[i
], /*data=*/0)
1954 && DECL_NOT_REALLY_EXTERN (vec
[i
]))
1956 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 0;
1957 DECL_EXTERNAL (vec
[i
]) = 0;
1964 /* Mark ARG (which is really a struct binding_level **) for GC. */
1967 mark_binding_level (arg
)
1970 struct binding_level
*lvl
= *(struct binding_level
**)arg
;
1972 for (; lvl
; lvl
= lvl
->level_chain
)
1974 ggc_mark_tree (lvl
->names
);
1975 ggc_mark_tree (lvl
->tags
);
1976 ggc_mark_tree (lvl
->usings
);
1977 ggc_mark_tree (lvl
->using_directives
);
1978 ggc_mark_tree (lvl
->class_shadowed
);
1979 ggc_mark_tree (lvl
->type_shadowed
);
1980 ggc_mark_tree (lvl
->shadowed_labels
);
1981 ggc_mark_tree (lvl
->blocks
);
1982 ggc_mark_tree (lvl
->this_class
);
1983 ggc_mark_tree (lvl
->incomplete
);
1984 ggc_mark_tree (lvl
->dead_vars_from_for
);
1989 mark_named_label_lists (labs
, uses
)
1993 struct named_label_list
*l
= *(struct named_label_list
**)labs
;
1994 struct named_label_use_list
*u
= *(struct named_label_use_list
**)uses
;
1996 for (; l
; l
= l
->next
)
1999 mark_binding_level (l
->binding_level
);
2000 ggc_mark_tree (l
->old_value
);
2001 ggc_mark_tree (l
->label_decl
);
2002 ggc_mark_tree (l
->bad_decls
);
2005 for (; u
; u
= u
->next
)
2009 /* For debugging. */
2010 static int no_print_functions
= 0;
2011 static int no_print_builtins
= 0;
2014 print_binding_level (lvl
)
2015 struct binding_level
*lvl
;
2019 fprintf (stderr
, " blocks=");
2020 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
2021 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
2022 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
2023 if (lvl
->tag_transparent
)
2024 fprintf (stderr
, " tag-transparent");
2025 if (lvl
->more_cleanups_ok
)
2026 fprintf (stderr
, " more-cleanups-ok");
2027 if (lvl
->have_cleanups
)
2028 fprintf (stderr
, " have-cleanups");
2029 fprintf (stderr
, "\n");
2032 fprintf (stderr
, " names:\t");
2033 /* We can probably fit 3 names to a line? */
2034 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
2036 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
2038 if (no_print_builtins
2039 && (TREE_CODE (t
) == TYPE_DECL
)
2040 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
2043 /* Function decls tend to have longer names. */
2044 if (TREE_CODE (t
) == FUNCTION_DECL
)
2051 fprintf (stderr
, "\n\t");
2054 print_node_brief (stderr
, "", t
, 0);
2055 if (t
== error_mark_node
)
2059 fprintf (stderr
, "\n");
2063 fprintf (stderr
, " tags:\t");
2065 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
2067 if (TREE_PURPOSE (t
) == NULL_TREE
)
2069 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2076 fprintf (stderr
, "\n\t");
2079 if (TREE_PURPOSE (t
) == NULL_TREE
)
2081 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
2082 fprintf (stderr
, ">");
2084 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2085 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2088 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
2089 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2090 fprintf (stderr
, ">");
2094 fprintf (stderr
, "\n");
2096 if (lvl
->class_shadowed
)
2098 fprintf (stderr
, " class-shadowed:");
2099 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
2101 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2103 fprintf (stderr
, "\n");
2105 if (lvl
->type_shadowed
)
2107 fprintf (stderr
, " type-shadowed:");
2108 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2110 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2112 fprintf (stderr
, "\n");
2117 print_other_binding_stack (stack
)
2118 struct binding_level
*stack
;
2120 struct binding_level
*level
;
2121 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
2123 fprintf (stderr
, "binding level ");
2124 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
2125 fprintf (stderr
, "\n");
2126 print_binding_level (level
);
2131 print_binding_stack ()
2133 struct binding_level
*b
;
2134 fprintf (stderr
, "current_binding_level=");
2135 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
2136 fprintf (stderr
, "\nclass_binding_level=");
2137 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
2138 fprintf (stderr
, "\nglobal_binding_level=");
2139 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
2140 fprintf (stderr
, "\n");
2141 if (class_binding_level
)
2143 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
2144 if (b
== current_binding_level
)
2147 b
= class_binding_level
;
2149 b
= current_binding_level
;
2152 b
= current_binding_level
;
2153 print_other_binding_stack (b
);
2154 fprintf (stderr
, "global:\n");
2155 print_binding_level (global_binding_level
);
2158 /* Namespace binding access routines: The namespace_bindings field of
2159 the identifier is polymorphic, with three possible values:
2160 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2161 indicating the BINDING_VALUE of global_namespace. */
2163 /* Check whether the a binding for the name to scope is known.
2164 Assumes that the bindings of the name are already a list
2165 of bindings. Returns the binding found, or NULL_TREE. */
2168 find_binding (name
, scope
)
2172 tree iter
, prev
= NULL_TREE
;
2174 scope
= ORIGINAL_NAMESPACE (scope
);
2176 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
2177 iter
= TREE_CHAIN (iter
))
2179 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
2180 if (BINDING_SCOPE (iter
) == scope
)
2182 /* Move binding found to the front of the list, so
2183 subsequent lookups will find it faster. */
2186 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
2187 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
2188 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
2197 /* Always returns a binding for name in scope. If the
2198 namespace_bindings is not a list, convert it to one first.
2199 If no binding is found, make a new one. */
2202 binding_for_name (name
, scope
)
2206 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2209 scope
= ORIGINAL_NAMESPACE (scope
);
2211 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
2213 /* Get rid of optimization for global scope. */
2214 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
2215 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
2216 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2218 if (b
&& (result
= find_binding (name
, scope
)))
2220 /* Not found, make a new one. */
2221 result
= make_node (CPLUS_BINDING
);
2222 TREE_CHAIN (result
) = b
;
2223 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2224 BINDING_SCOPE (result
) = scope
;
2225 BINDING_TYPE (result
) = NULL_TREE
;
2226 BINDING_VALUE (result
) = NULL_TREE
;
2230 /* Return the binding value for name in scope, considering that
2231 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2234 namespace_binding (name
, scope
)
2238 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2241 if (scope
== NULL_TREE
)
2242 scope
= global_namespace
;
2243 if (TREE_CODE (b
) != CPLUS_BINDING
)
2244 return (scope
== global_namespace
) ? b
: NULL_TREE
;
2245 name
= find_binding (name
,scope
);
2246 if (name
== NULL_TREE
)
2248 return BINDING_VALUE (name
);
2251 /* Set the binding value for name in scope. If modifying the binding
2252 of global_namespace is attempted, try to optimize it. */
2255 set_namespace_binding (name
, scope
, val
)
2262 if (scope
== NULL_TREE
)
2263 scope
= global_namespace
;
2265 if (scope
== global_namespace
)
2267 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2268 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
2270 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
2274 b
= binding_for_name (name
, scope
);
2275 BINDING_VALUE (b
) = val
;
2278 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2279 select a name that is unique to this compilation unit. */
2282 push_namespace (name
)
2287 int implicit_use
= 0;
2289 if (!global_namespace
)
2291 /* This must be ::. */
2292 my_friendly_assert (name
== get_identifier ("::"), 377);
2297 /* The name of anonymous namespace is unique for the translation
2299 if (!anonymous_namespace_name
)
2300 anonymous_namespace_name
= get_file_function_name ('N');
2301 name
= anonymous_namespace_name
;
2302 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2304 /* Reopening anonymous namespace. */
2308 else if (current_namespace
== global_namespace
2310 && name
== std_identifier
)
2317 /* Check whether this is an extended namespace definition. */
2318 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2319 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
2322 if (DECL_NAMESPACE_ALIAS (d
))
2324 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2325 d
, DECL_NAMESPACE_ALIAS (d
));
2326 d
= DECL_NAMESPACE_ALIAS (d
);
2333 /* Make a new namespace, binding the name to it. */
2334 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
2335 /* The global namespace is not pushed, and the global binding
2336 level is set elsewhere. */
2339 DECL_CONTEXT (d
) = FROB_CONTEXT (current_namespace
);
2342 declare_namespace_level ();
2343 NAMESPACE_LEVEL (d
) = current_binding_level
;
2347 resume_binding_level (NAMESPACE_LEVEL (d
));
2350 do_using_directive (d
);
2351 /* Enter the name space. */
2352 current_namespace
= d
;
2355 /* Pop from the scope of the current namespace. */
2360 if (current_namespace
== global_namespace
)
2362 my_friendly_assert (in_fake_std
> 0, 980421);
2366 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
2367 /* The binding level is not popped, as it might be re-opened later. */
2368 suspend_binding_level ();
2371 /* Push into the scope of the namespace NS, even if it is deeply
2372 nested within another namespace. */
2375 push_nested_namespace (ns
)
2378 if (ns
== global_namespace
)
2379 push_to_top_level ();
2382 push_nested_namespace (CP_DECL_CONTEXT (ns
));
2383 push_namespace (DECL_NAME (ns
));
2387 /* Pop back from the scope of the namespace NS, which was previously
2388 entered with push_nested_namespace. */
2391 pop_nested_namespace (ns
)
2394 while (ns
!= global_namespace
)
2397 ns
= CP_DECL_CONTEXT (ns
);
2400 pop_from_top_level ();
2404 /* Subroutines for reverting temporarily to top-level for instantiation
2405 of templates and such. We actually need to clear out the class- and
2406 local-value slots of all identifiers, so that only the global values
2407 are at all visible. Simply setting current_binding_level to the global
2408 scope isn't enough, because more binding levels may be pushed. */
2409 struct saved_scope
*scope_chain
;
2411 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2414 mark_saved_scope (arg
)
2417 struct saved_scope
*t
= *(struct saved_scope
**)arg
;
2420 mark_binding_level (&t
->class_bindings
);
2421 ggc_mark_tree (t
->old_bindings
);
2422 ggc_mark_tree (t
->old_namespace
);
2423 ggc_mark_tree (t
->class_name
);
2424 ggc_mark_tree (t
->class_type
);
2425 ggc_mark_tree (t
->access_specifier
);
2426 ggc_mark_tree (t
->function_decl
);
2428 ggc_mark_tree_varray (t
->lang_base
);
2429 ggc_mark_tree (t
->lang_name
);
2430 ggc_mark_tree (t
->template_parms
);
2431 ggc_mark_tree (t
->x_previous_class_type
);
2432 ggc_mark_tree (t
->x_previous_class_values
);
2433 ggc_mark_tree (t
->x_saved_tree
);
2434 ggc_mark_tree (t
->incomplete
);
2435 ggc_mark_tree (t
->lookups
);
2437 mark_stmt_tree (&t
->x_stmt_tree
);
2438 mark_binding_level (&t
->bindings
);
2444 store_bindings (names
, old_bindings
)
2445 tree names
, old_bindings
;
2448 for (t
= names
; t
; t
= TREE_CHAIN (t
))
2450 tree binding
, t1
, id
;
2452 if (TREE_CODE (t
) == TREE_LIST
)
2453 id
= TREE_PURPOSE (t
);
2458 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2459 we have no IDENTIFIER_BINDING if we have left the class
2460 scope, but cached the class-level declarations. */
2461 || !(IDENTIFIER_BINDING (id
) || IDENTIFIER_CLASS_VALUE (id
)))
2464 for (t1
= old_bindings
; t1
; t1
= TREE_CHAIN (t1
))
2465 if (TREE_VEC_ELT (t1
, 0) == id
)
2468 binding
= make_tree_vec (4);
2472 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
2473 TREE_VEC_ELT (binding
, 0) = id
;
2474 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
2475 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_BINDING (id
);
2476 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
2477 IDENTIFIER_BINDING (id
) = NULL_TREE
;
2478 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
2480 TREE_CHAIN (binding
) = old_bindings
;
2481 old_bindings
= binding
;
2485 return old_bindings
;
2489 maybe_push_to_top_level (pseudo
)
2492 struct saved_scope
*s
;
2493 struct binding_level
*b
;
2497 s
= (struct saved_scope
*) xcalloc (1, sizeof (struct saved_scope
));
2499 b
= scope_chain
? current_binding_level
: 0;
2501 /* If we're in the middle of some function, save our state. */
2505 push_function_context_to (NULL_TREE
);
2510 old_bindings
= NULL_TREE
;
2511 if (scope_chain
&& previous_class_type
)
2512 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
2514 /* Have to include global_binding_level, because class-level decls
2515 aren't listed anywhere useful. */
2516 for (; b
; b
= b
->level_chain
)
2520 /* Template IDs are inserted into the global level. If they were
2521 inserted into namespace level, finish_file wouldn't find them
2522 when doing pending instantiations. Therefore, don't stop at
2523 namespace level, but continue until :: . */
2524 if (b
== global_binding_level
|| (pseudo
&& b
->template_parms_p
))
2527 old_bindings
= store_bindings (b
->names
, old_bindings
);
2528 /* We also need to check class_shadowed to save class-level type
2529 bindings, since pushclass doesn't fill in b->names. */
2530 if (b
->parm_flag
== 2)
2531 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2533 /* Unwind type-value slots back to top level. */
2534 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2535 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2537 s
->prev
= scope_chain
;
2538 s
->old_bindings
= old_bindings
;
2540 s
->need_pop_function_context
= need_pop
;
2541 s
->function_decl
= current_function_decl
;
2544 current_function_decl
= NULL_TREE
;
2545 VARRAY_TREE_INIT (current_lang_base
, 10, "current_lang_base");
2546 current_lang_stack
= &VARRAY_TREE (current_lang_base
, 0);
2547 current_lang_name
= lang_name_cplusplus
;
2548 current_namespace
= global_namespace
;
2552 push_to_top_level ()
2554 maybe_push_to_top_level (0);
2558 pop_from_top_level ()
2560 struct saved_scope
*s
= scope_chain
;
2563 /* Clear out class-level bindings cache. */
2564 if (previous_class_type
)
2565 invalidate_class_lookup_cache ();
2567 VARRAY_FREE (current_lang_base
);
2569 scope_chain
= s
->prev
;
2570 for (t
= s
->old_bindings
; t
; t
= TREE_CHAIN (t
))
2572 tree id
= TREE_VEC_ELT (t
, 0);
2575 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2576 IDENTIFIER_BINDING (id
) = TREE_VEC_ELT (t
, 2);
2577 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2581 /* If we were in the middle of compiling a function, restore our
2583 if (s
->need_pop_function_context
)
2584 pop_function_context_from (NULL_TREE
);
2585 current_function_decl
= s
->function_decl
;
2590 /* Push a definition of struct, union or enum tag "name".
2591 into binding_level "b". "type" should be the type node,
2592 We assume that the tag "name" is not already defined.
2594 Note that the definition may really be just a forward reference.
2595 In that case, the TYPE_SIZE will be a NULL_TREE.
2597 C++ gratuitously puts all these tags in the name space. */
2599 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2600 record the shadowed value for this binding contour. TYPE is
2601 the type that ID maps to. */
2604 set_identifier_type_value_with_scope (id
, type
, b
)
2607 struct binding_level
*b
;
2609 if (!b
->namespace_p
)
2611 /* Shadow the marker, not the real thing, so that the marker
2612 gets restored later. */
2613 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2615 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2619 tree binding
= binding_for_name (id
, current_namespace
);
2620 BINDING_TYPE (binding
) = type
;
2621 /* Store marker instead of real type. */
2622 type
= global_type_node
;
2624 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2627 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2630 set_identifier_type_value (id
, type
)
2634 set_identifier_type_value_with_scope (id
, type
, current_binding_level
);
2637 /* Return the type associated with id. */
2640 identifier_type_value (id
)
2643 /* There is no type with that name, anywhere. */
2644 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2646 /* This is not the type marker, but the real thing. */
2647 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2648 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2649 /* Have to search for it. It must be on the global level, now.
2650 Ask lookup_name not to return non-types. */
2651 id
= lookup_name_real (id
, 2, 1, 0);
2653 return TREE_TYPE (id
);
2657 /* Pop off extraneous binding levels left over due to syntax errors.
2659 We don't pop past namespaces, as they might be valid. */
2664 #ifdef DEBUG_CP_BINDING_LEVELS
2665 fprintf (stderr
, "XXX entering pop_everything ()\n");
2667 while (!toplevel_bindings_p ())
2669 if (current_binding_level
->parm_flag
== 2)
2670 pop_nested_class ();
2674 #ifdef DEBUG_CP_BINDING_LEVELS
2675 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2679 /* The type TYPE is being declared. If it is a class template, or a
2680 specialization of a class template, do any processing required and
2681 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2682 being declared a friend. B is the binding level at which this TYPE
2685 Returns the TYPE_DECL for TYPE, which may have been altered by this
2689 maybe_process_template_type_declaration (type
, globalize
, b
)
2692 struct binding_level
* b
;
2694 tree decl
= TYPE_NAME (type
);
2696 if (processing_template_parmlist
)
2697 /* You can't declare a new template type in a template parameter
2698 list. But, you can declare a non-template type:
2700 template <class A*> struct S;
2702 is a forward-declaration of `A'. */
2706 maybe_check_template_type (type
);
2708 my_friendly_assert (IS_AGGR_TYPE (type
)
2709 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2712 if (processing_template_decl
)
2714 /* This may change after the call to
2715 push_template_decl_real, but we want the original value. */
2716 tree name
= DECL_NAME (decl
);
2718 decl
= push_template_decl_real (decl
, globalize
);
2719 /* If the current binding level is the binding level for the
2720 template parameters (see the comment in
2721 begin_template_parm_list) and the enclosing level is a class
2722 scope, and we're not looking at a friend, push the
2723 declaration of the member class into the class scope. In the
2724 friend case, push_template_decl will already have put the
2725 friend into global scope, if appropriate. */
2726 if (TREE_CODE (type
) != ENUMERAL_TYPE
2727 && !globalize
&& b
->template_parms_p
2728 && b
->level_chain
->parm_flag
== 2)
2730 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2731 /* Put this tag on the list of tags for the class, since
2732 that won't happen below because B is not the class
2733 binding level, but is instead the pseudo-global level. */
2734 b
->level_chain
->tags
=
2735 tree_cons (name
, type
, b
->level_chain
->tags
);
2736 if (!COMPLETE_TYPE_P (current_class_type
))
2737 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2745 /* In C++, you don't have to write `struct S' to refer to `S'; you
2746 can just use `S'. We accomplish this by creating a TYPE_DECL as
2747 if the user had written `typedef struct S S'. Create and return
2748 the TYPE_DECL for TYPE. */
2751 create_implicit_typedef (name
, type
)
2757 decl
= build_decl (TYPE_DECL
, name
, type
);
2758 DECL_ARTIFICIAL (decl
) = 1;
2759 /* There are other implicit type declarations, like the one *within*
2760 a class that allows you to write `S::S'. We must distinguish
2762 SET_DECL_IMPLICIT_TYPEDEF_P (decl
);
2763 TYPE_NAME (type
) = decl
;
2768 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2769 Normally put it into the inner-most non-tag-transparent scope,
2770 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2771 The latter is needed for implicit declarations. */
2774 pushtag (name
, type
, globalize
)
2778 register struct binding_level
*b
;
2780 b
= current_binding_level
;
2781 while (b
->tag_transparent
2782 || (globalize
&& b
->parm_flag
== 2))
2785 b
->tags
= tree_cons (name
, type
, b
->tags
);
2789 /* Do C++ gratuitous typedefing. */
2790 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2792 register tree d
= NULL_TREE
;
2794 tree context
= TYPE_CONTEXT (type
);
2798 tree cs
= current_scope ();
2802 else if (cs
!= NULL_TREE
&& TYPE_P (cs
))
2803 /* When declaring a friend class of a local class, we want
2804 to inject the newly named class into the scope
2805 containing the local class, not the namespace scope. */
2806 context
= decl_function_context (get_type_decl (cs
));
2809 context
= current_namespace
;
2811 if ((b
->template_parms_p
&& b
->level_chain
->parm_flag
== 2)
2812 || b
->parm_flag
== 2)
2815 if (current_lang_name
== lang_name_java
)
2816 TYPE_FOR_JAVA (type
) = 1;
2818 d
= create_implicit_typedef (name
, type
);
2819 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2821 set_identifier_type_value_with_scope (name
, type
, b
);
2823 d
= maybe_process_template_type_declaration (type
,
2826 if (b
->parm_flag
== 2)
2828 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2829 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2830 class. But if it's a member template class, we
2831 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2833 finish_member_declaration (d
);
2835 pushdecl_class_level (d
);
2838 d
= pushdecl_with_scope (d
, b
);
2840 if (ANON_AGGRNAME_P (name
))
2841 DECL_IGNORED_P (d
) = 1;
2843 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2844 DECL_ASSEMBLER_NAME (d
) = DECL_NAME (d
);
2846 /* If this is a local class, keep track of it. We need this
2847 information for name-mangling, and so that it is possible to find
2848 all function definitions in a translation unit in a convenient
2849 way. (It's otherwise tricky to find a member function definition
2850 it's only pointed to from within a local class.) */
2851 if (TYPE_CONTEXT (type
)
2852 && TREE_CODE (TYPE_CONTEXT (type
)) == FUNCTION_DECL
2853 && !processing_template_decl
)
2854 VARRAY_PUSH_TREE (local_classes
, type
);
2856 if (!uses_template_parms (type
))
2859 DECL_ASSEMBLER_NAME (d
) = mangle_type (type
);
2861 DECL_ASSEMBLER_NAME (d
)
2862 = get_identifier (build_overload_name (type
, 1, 1));
2865 if (b
->parm_flag
== 2)
2867 if (!COMPLETE_TYPE_P (current_class_type
))
2868 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2872 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2873 /* Use the canonical TYPE_DECL for this node. */
2874 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2877 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2878 will be the tagged type we just added to the current
2879 binding level. This fake NULL-named TYPE_DECL node helps
2880 dwarfout.c to know when it needs to output a
2881 representation of a tagged type, and it also gives us a
2882 convenient place to record the "scope start" address for
2885 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2886 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2890 /* Counter used to create anonymous type names. */
2892 static int anon_cnt
= 0;
2894 /* Return an IDENTIFIER which can be used as a name for
2895 anonymous structs and unions. */
2902 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2903 return get_identifier (buf
);
2906 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2907 This keeps dbxout from getting confused. */
2912 register struct binding_level
*b
;
2914 static int last_cnt
= 0;
2916 /* Fast out if no new anon names were declared. */
2917 if (last_cnt
== anon_cnt
)
2920 b
= current_binding_level
;
2921 while (b
->tag_transparent
)
2926 /* A NULL purpose means we have already processed all tags
2927 from here to the end of the list. */
2928 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2930 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2931 TREE_PURPOSE (tags
) = NULL_TREE
;
2932 tags
= TREE_CHAIN (tags
);
2934 last_cnt
= anon_cnt
;
2937 /* Subroutine of duplicate_decls: return truthvalue of whether
2938 or not types of these decls match.
2940 For C++, we must compare the parameter list so that `int' can match
2941 `int&' in a parameter position, but `int&' is not confused with
2945 decls_match (newdecl
, olddecl
)
2946 tree newdecl
, olddecl
;
2950 if (newdecl
== olddecl
)
2953 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
2954 /* If the two DECLs are not even the same kind of thing, we're not
2955 interested in their types. */
2958 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2960 tree f1
= TREE_TYPE (newdecl
);
2961 tree f2
= TREE_TYPE (olddecl
);
2962 tree p1
= TYPE_ARG_TYPES (f1
);
2963 tree p2
= TYPE_ARG_TYPES (f2
);
2965 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
)
2966 && ! (DECL_EXTERN_C_P (newdecl
)
2967 && DECL_EXTERN_C_P (olddecl
)))
2970 if (TREE_CODE (f1
) != TREE_CODE (f2
))
2973 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
2975 if (p2
== NULL_TREE
&& DECL_EXTERN_C_P (olddecl
)
2976 && (DECL_BUILT_IN (olddecl
)
2977 #ifndef NO_IMPLICIT_EXTERN_C
2978 || (DECL_IN_SYSTEM_HEADER (newdecl
) && !DECL_CLASS_SCOPE_P (newdecl
))
2979 || (DECL_IN_SYSTEM_HEADER (olddecl
) && !DECL_CLASS_SCOPE_P (olddecl
))
2983 types_match
= self_promoting_args_p (p1
);
2984 if (p1
== void_list_node
)
2985 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2987 #ifndef NO_IMPLICIT_EXTERN_C
2988 else if (p1
== NULL_TREE
2989 && (DECL_EXTERN_C_P (olddecl
)
2990 && DECL_IN_SYSTEM_HEADER (olddecl
)
2991 && !DECL_CLASS_SCOPE_P (olddecl
))
2992 && (DECL_EXTERN_C_P (newdecl
)
2993 && DECL_IN_SYSTEM_HEADER (newdecl
)
2994 && !DECL_CLASS_SCOPE_P (newdecl
)))
2996 types_match
= self_promoting_args_p (p2
);
2997 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
3001 types_match
= compparms (p1
, p2
);
3006 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3008 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3009 DECL_TEMPLATE_PARMS (olddecl
)))
3012 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
))
3013 != TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)))
3016 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3019 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
3020 DECL_TEMPLATE_RESULT (newdecl
));
3024 if (TREE_TYPE (newdecl
) == error_mark_node
)
3025 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
3026 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
3027 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
3028 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
3031 types_match
= comptypes (TREE_TYPE (newdecl
),
3032 TREE_TYPE (olddecl
),
3033 COMPARE_REDECLARATION
);
3039 /* If NEWDECL is `static' and an `extern' was seen previously,
3040 warn about it. OLDDECL is the previous declaration.
3042 Note that this does not apply to the C++ case of declaring
3043 a variable `extern const' and then later `const'.
3045 Don't complain about built-in functions, since they are beyond
3046 the user's control. */
3049 warn_extern_redeclared_static (newdecl
, olddecl
)
3050 tree newdecl
, olddecl
;
3052 static const char *explicit_extern_static_warning
3053 = "`%D' was declared `extern' and later `static'";
3054 static const char *implicit_extern_static_warning
3055 = "`%D' was declared implicitly `extern' and later `static'";
3059 if (TREE_CODE (newdecl
) == TYPE_DECL
3060 || TREE_CODE (newdecl
) == TEMPLATE_DECL
3061 || TREE_CODE (newdecl
) == CONST_DECL
)
3064 /* Don't get confused by static member functions; that's a different
3066 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3067 && DECL_STATIC_FUNCTION_P (newdecl
))
3070 /* If the old declaration was `static', or the new one isn't, then
3071 then everything is OK. */
3072 if (DECL_THIS_STATIC (olddecl
) || !DECL_THIS_STATIC (newdecl
))
3075 /* It's OK to declare a builtin function as `static'. */
3076 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3077 && DECL_ARTIFICIAL (olddecl
))
3080 name
= DECL_ASSEMBLER_NAME (newdecl
);
3081 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
3082 ? implicit_extern_static_warning
3083 : explicit_extern_static_warning
, newdecl
);
3084 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
3087 /* Handle when a new declaration NEWDECL has the same name as an old
3088 one OLDDECL in the same binding contour. Prints an error message
3091 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
3092 Otherwise, return 0. */
3095 duplicate_decls (newdecl
, olddecl
)
3096 tree newdecl
, olddecl
;
3098 unsigned olddecl_uid
= DECL_UID (olddecl
);
3099 int olddecl_friend
= 0, types_match
= 0;
3100 int new_defines_function
= 0;
3102 if (newdecl
== olddecl
)
3105 types_match
= decls_match (newdecl
, olddecl
);
3107 /* If either the type of the new decl or the type of the old decl is an
3108 error_mark_node, then that implies that we have already issued an
3109 error (earlier) for some bogus type specification, and in that case,
3110 it is rather pointless to harass the user with yet more error message
3111 about the same declaration, so just pretend the types match here. */
3112 if (TREE_TYPE (newdecl
) == error_mark_node
3113 || TREE_TYPE (olddecl
) == error_mark_node
)
3116 /* Check for redeclaration and other discrepancies. */
3117 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3118 && DECL_ARTIFICIAL (olddecl
))
3120 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
3122 /* If you declare a built-in or predefined function name as static,
3123 the old definition is overridden, but optionally warn this was a
3124 bad choice of name. */
3125 if (! TREE_PUBLIC (newdecl
))
3128 cp_warning ("shadowing %s function `%#D'",
3129 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3131 /* Discard the old built-in function. */
3134 /* If the built-in is not ansi, then programs can override
3135 it even globally without an error. */
3136 else if (! DECL_BUILT_IN (olddecl
))
3137 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
3141 cp_error ("declaration of `%#D'", newdecl
);
3142 cp_error ("conflicts with built-in declaration `%#D'",
3147 else if (!types_match
)
3149 if ((DECL_EXTERN_C_P (newdecl
)
3150 && DECL_EXTERN_C_P (olddecl
))
3151 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3152 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3154 /* A near match; override the builtin. */
3156 if (TREE_PUBLIC (newdecl
))
3158 cp_warning ("new declaration `%#D'", newdecl
);
3159 cp_warning ("ambiguates built-in declaration `%#D'",
3162 else if (warn_shadow
)
3163 cp_warning ("shadowing %s function `%#D'",
3164 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3168 /* Discard the old built-in function. */
3172 if (DECL_THIS_STATIC (newdecl
) && !DECL_THIS_STATIC (olddecl
))
3174 /* If a builtin function is redeclared as `static', merge
3175 the declarations, but make the original one static. */
3176 DECL_THIS_STATIC (olddecl
) = 1;
3177 TREE_PUBLIC (olddecl
) = 0;
3179 /* Make the old declaration consistent with the new one so
3180 that all remnants of the builtin-ness of this function
3181 will be banished. */
3182 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3183 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3184 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3185 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (newdecl
),
3189 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3191 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3192 && TREE_CODE (newdecl
) != TYPE_DECL
3193 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3194 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3195 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3196 && TREE_CODE (olddecl
) != TYPE_DECL
3197 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3198 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3201 /* We do nothing special here, because C++ does such nasty
3202 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3203 get shadowed, and know that if we need to find a TYPE_DECL
3204 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3205 slot of the identifier. */
3209 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3210 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3211 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3212 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3215 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
3216 if (TREE_CODE (olddecl
) == TREE_LIST
)
3217 olddecl
= TREE_VALUE (olddecl
);
3218 cp_error_at ("previous declaration of `%#D'", olddecl
);
3220 /* New decl is completely inconsistent with the old one =>
3221 tell caller to replace the old one. */
3225 else if (!types_match
)
3227 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
))
3228 /* These are certainly not duplicate declarations; they're
3229 from different scopes. */
3232 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3234 /* The name of a class template may not be declared to refer to
3235 any other template, class, function, object, namespace, value,
3236 or type in the same scope. */
3237 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3238 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3240 cp_error ("declaration of template `%#D'", newdecl
);
3241 cp_error_at ("conflicts with previous declaration `%#D'",
3244 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3245 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3246 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3247 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3248 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3249 DECL_TEMPLATE_PARMS (olddecl
)))
3251 cp_error ("new declaration `%#D'", newdecl
);
3252 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3256 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3258 if (DECL_EXTERN_C_P (newdecl
) && DECL_EXTERN_C_P (olddecl
))
3260 cp_error ("declaration of C function `%#D' conflicts with",
3262 cp_error_at ("previous declaration `%#D' here", olddecl
);
3264 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3265 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3267 cp_error ("new declaration `%#D'", newdecl
);
3268 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3274 /* Already complained about this, so don't do so again. */
3275 else if (current_class_type
== NULL_TREE
3276 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3278 cp_error ("conflicting types for `%#D'", newdecl
);
3279 cp_error_at ("previous declaration as `%#D'", olddecl
);
3282 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3283 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3284 && (!DECL_TEMPLATE_INFO (newdecl
)
3285 || (DECL_TI_TEMPLATE (newdecl
)
3286 != DECL_TI_TEMPLATE (olddecl
))))
3287 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3288 && (!DECL_TEMPLATE_INFO (olddecl
)
3289 || (DECL_TI_TEMPLATE (olddecl
)
3290 != DECL_TI_TEMPLATE (newdecl
))))))
3291 /* It's OK to have a template specialization and a non-template
3292 with the same type, or to have specializations of two
3293 different templates with the same type. Note that if one is a
3294 specialization, and the other is an instantiation of the same
3295 template, that we do not exit at this point. That situation
3296 can occur if we instantiate a template class, and then
3297 specialize one of its methods. This situation is legal, but
3298 the declarations must be merged in the usual way. */
3300 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3301 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3302 && !DECL_USE_TEMPLATE (newdecl
))
3303 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3304 && !DECL_USE_TEMPLATE (olddecl
))))
3305 /* One of the declarations is a template instantiation, and the
3306 other is not a template at all. That's OK. */
3308 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3309 && DECL_NAMESPACE_ALIAS (newdecl
)
3310 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3311 /* Redeclaration of namespace alias, ignore it. */
3315 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3318 cp_error (errmsg
, newdecl
);
3319 if (DECL_NAME (olddecl
) != NULL_TREE
)
3320 cp_error_at ((DECL_INITIAL (olddecl
)
3321 && namespace_bindings_p ())
3322 ? "`%#D' previously defined here"
3323 : "`%#D' previously declared here", olddecl
);
3325 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3326 && DECL_INITIAL (olddecl
) != NULL_TREE
3327 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3328 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3330 /* Prototype decl follows defn w/o prototype. */
3331 cp_warning_at ("prototype for `%#D'", newdecl
);
3332 cp_warning_at ("follows non-prototype definition here", olddecl
);
3334 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3335 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3337 /* extern "C" int foo ();
3338 int foo () { bar (); }
3340 if (current_lang_stack
3341 == &VARRAY_TREE (current_lang_base
, 0))
3342 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3345 cp_error_at ("previous declaration of `%#D' with %L linkage",
3346 olddecl
, DECL_LANGUAGE (olddecl
));
3347 cp_error ("conflicts with new declaration with %L linkage",
3348 DECL_LANGUAGE (newdecl
));
3352 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3354 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3356 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3357 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3360 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3361 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3363 for (; t1
&& t1
!= void_list_node
;
3364 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3365 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3367 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3372 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3374 cp_pedwarn_at ("after previous specification in `%#D'",
3380 cp_error ("default argument given for parameter %d of `%#D'",
3382 cp_error_at ("after previous specification in `%#D'",
3387 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
3388 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3390 cp_warning ("`%#D' was used before it was declared inline",
3392 cp_warning_at ("previous non-inline declaration here",
3398 /* If new decl is `static' and an `extern' was seen previously,
3400 warn_extern_redeclared_static (newdecl
, olddecl
);
3402 /* We have committed to returning 1 at this point. */
3403 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3405 /* Now that functions must hold information normally held
3406 by field decls, there is extra work to do so that
3407 declaration information does not get destroyed during
3409 if (DECL_VINDEX (olddecl
))
3410 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3411 if (DECL_VIRTUAL_CONTEXT (olddecl
))
3412 DECL_VIRTUAL_CONTEXT (newdecl
) = DECL_VIRTUAL_CONTEXT (olddecl
);
3413 if (DECL_CONTEXT (olddecl
))
3414 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3415 if (DECL_PENDING_INLINE_INFO (newdecl
) == 0)
3416 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3417 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3418 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3419 DECL_PURE_VIRTUAL_P (newdecl
) |= DECL_PURE_VIRTUAL_P (olddecl
);
3420 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3421 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3422 DECL_THIS_STATIC (newdecl
) |= DECL_THIS_STATIC (olddecl
);
3423 DECL_LANG_SPECIFIC (newdecl
)->u2
= DECL_LANG_SPECIFIC (olddecl
)->u2
;
3424 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3426 /* Optionally warn about more than one declaration for the same
3427 name, but don't warn about a function declaration followed by a
3429 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3430 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3431 /* Don't warn about extern decl followed by definition. */
3432 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3433 /* Don't warn about friends, let add_friend take care of it. */
3434 && ! DECL_FRIEND_P (newdecl
))
3436 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3437 cp_warning_at ("previous declaration of `%D'", olddecl
);
3441 /* Deal with C++: must preserve virtual function table size. */
3442 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3444 register tree newtype
= TREE_TYPE (newdecl
);
3445 register tree oldtype
= TREE_TYPE (olddecl
);
3447 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3448 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3450 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3451 CLASSTYPE_FRIEND_CLASSES (newtype
)
3452 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3455 DECL_ORIGINAL_TYPE (newdecl
) = DECL_ORIGINAL_TYPE (olddecl
);
3458 /* Copy all the DECL_... slots specified in the new decl
3459 except for any that we copy here from the old type. */
3460 DECL_MACHINE_ATTRIBUTES (newdecl
)
3461 = merge_machine_decl_attributes (olddecl
, newdecl
);
3463 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3465 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3466 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3467 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3468 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3475 /* Automatically handles default parameters. */
3476 tree oldtype
= TREE_TYPE (olddecl
);
3479 /* Merge the data types specified in the two decls. */
3480 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3482 /* If common_type produces a non-typedef type, just use the old type. */
3483 if (TREE_CODE (newdecl
) == TYPE_DECL
3484 && newtype
== DECL_ORIGINAL_TYPE (newdecl
))
3487 if (TREE_CODE (newdecl
) == VAR_DECL
)
3488 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3489 /* Do this after calling `common_type' so that default
3490 parameters don't confuse us. */
3491 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3492 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3493 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3495 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3496 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3497 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3498 TYPE_RAISES_EXCEPTIONS (oldtype
));
3500 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3501 && DECL_SOURCE_LINE (olddecl
) != 0
3503 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
3504 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
3506 cp_error ("declaration of `%F' throws different exceptions",
3508 cp_error_at ("than previous declaration `%F'", olddecl
);
3511 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3513 /* Lay the type out, unless already done. */
3514 if (! same_type_p (newtype
, oldtype
)
3515 && TREE_TYPE (newdecl
) != error_mark_node
3516 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3517 layout_type (TREE_TYPE (newdecl
));
3519 if ((TREE_CODE (newdecl
) == VAR_DECL
3520 || TREE_CODE (newdecl
) == PARM_DECL
3521 || TREE_CODE (newdecl
) == RESULT_DECL
3522 || TREE_CODE (newdecl
) == FIELD_DECL
3523 || TREE_CODE (newdecl
) == TYPE_DECL
)
3524 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3525 layout_decl (newdecl
, 0);
3527 /* Merge the type qualifiers. */
3528 if (TREE_READONLY (newdecl
))
3529 TREE_READONLY (olddecl
) = 1;
3530 if (TREE_THIS_VOLATILE (newdecl
))
3531 TREE_THIS_VOLATILE (olddecl
) = 1;
3533 /* Merge the initialization information. */
3534 if (DECL_INITIAL (newdecl
) == NULL_TREE
3535 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3537 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3538 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3539 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3540 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
3541 && DECL_LANG_SPECIFIC (newdecl
)
3542 && DECL_LANG_SPECIFIC (olddecl
))
3543 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3546 /* Merge the section attribute.
3547 We want to issue an error if the sections conflict but that must be
3548 done later in decl_attributes since we are called before attributes
3550 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3551 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3553 /* Keep the old rtl since we can safely use it. */
3554 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3556 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3558 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (newdecl
)
3559 |= DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (olddecl
);
3560 DECL_NO_CHECK_MEMORY_USAGE (newdecl
)
3561 |= DECL_NO_CHECK_MEMORY_USAGE (olddecl
);
3562 DECL_NO_LIMIT_STACK (newdecl
)
3563 |= DECL_NO_LIMIT_STACK (olddecl
);
3566 /* If cannot merge, then use the new type and qualifiers,
3567 and don't preserve the old rtl. */
3570 /* Clean out any memory we had of the old declaration. */
3571 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3573 TREE_VALUE (oldstatic
) = error_mark_node
;
3575 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3576 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3577 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3578 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3581 /* Merge the storage class information. */
3582 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3583 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3584 DECL_DEFER_OUTPUT (newdecl
) |= DECL_DEFER_OUTPUT (olddecl
);
3585 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3586 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3587 if (! DECL_EXTERNAL (olddecl
))
3588 DECL_EXTERNAL (newdecl
) = 0;
3590 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3592 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3593 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3594 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3595 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3596 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3597 /* Don't really know how much of the language-specific
3598 values we should copy from old to new. */
3599 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3600 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3601 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3602 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3603 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3605 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3606 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3607 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3608 DECL_BEFRIENDING_CLASSES (newdecl
)
3609 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3610 DECL_BEFRIENDING_CLASSES (olddecl
));
3613 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3615 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3616 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3618 /* If newdecl is not a specialization, then it is not a
3619 template-related function at all. And that means that we
3620 shoud have exited above, returning 0. */
3621 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3624 if (TREE_USED (olddecl
))
3625 /* From [temp.expl.spec]:
3627 If a template, a member template or the member of a class
3628 template is explicitly specialized then that
3629 specialization shall be declared before the first use of
3630 that specialization that would cause an implicit
3631 instantiation to take place, in every translation unit in
3632 which such a use occurs. */
3633 cp_error ("explicit specialization of %D after first use",
3636 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3638 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3640 /* If either decl says `inline', this fn is inline, unless its
3641 definition was passed already. */
3642 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3643 DECL_INLINE (olddecl
) = 1;
3644 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3648 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3649 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3650 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3652 if (! types_match
|| new_defines_function
)
3654 /* These need to be copied so that the names are available.
3655 Note that if the types do match, we'll preserve inline
3656 info and other bits, but if not, we won't. */
3657 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3658 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3660 if (new_defines_function
)
3661 /* If defining a function declared with other language
3662 linkage, use the previously declared language linkage. */
3663 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3664 else if (types_match
)
3666 /* If redeclaring a builtin function, and not a definition,
3667 it stays built in. */
3668 if (DECL_BUILT_IN (olddecl
))
3670 DECL_BUILT_IN_CLASS (newdecl
) = DECL_BUILT_IN_CLASS (olddecl
);
3671 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3672 /* If we're keeping the built-in definition, keep the rtl,
3673 regardless of declaration matches. */
3674 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3677 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3679 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3680 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3681 /* Previously saved insns go together with
3682 the function's previous definition. */
3683 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3684 /* Don't clear out the arguments if we're redefining a function. */
3685 if (DECL_ARGUMENTS (olddecl
))
3686 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3690 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3692 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3695 /* Now preserve various other info from the definition. */
3696 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3697 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3698 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3699 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3701 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3705 function_size
= sizeof (struct tree_decl
);
3707 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3708 (char *) olddecl
+ sizeof (struct tree_common
),
3709 function_size
- sizeof (struct tree_common
));
3711 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3713 /* If newdecl is a template instantiation, it is possible that
3714 the following sequence of events has occurred:
3716 o A friend function was declared in a class template. The
3717 class template was instantiated.
3719 o The instantiation of the friend declaration was
3720 recorded on the instantiation list, and is newdecl.
3722 o Later, however, instantiate_class_template called pushdecl
3723 on the newdecl to perform name injection. But, pushdecl in
3724 turn called duplicate_decls when it discovered that another
3725 declaration of a global function with the same name already
3728 o Here, in duplicate_decls, we decided to clobber newdecl.
3730 If we're going to do that, we'd better make sure that
3731 olddecl, and not newdecl, is on the list of
3732 instantiations so that if we try to do the instantiation
3733 again we won't get the clobbered declaration. */
3735 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3736 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3738 for (; decls
; decls
= TREE_CHAIN (decls
))
3739 if (TREE_VALUE (decls
) == newdecl
)
3740 TREE_VALUE (decls
) = olddecl
;
3745 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3746 (char *) olddecl
+ sizeof (struct tree_common
),
3747 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3748 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3751 DECL_UID (olddecl
) = olddecl_uid
;
3753 DECL_FRIEND_P (olddecl
) = 1;
3755 /* NEWDECL contains the merged attribute lists.
3756 Update OLDDECL to be the same. */
3757 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3762 /* Record a decl-node X as belonging to the current lexical scope.
3763 Check for errors (such as an incompatible declaration for the same
3764 name already seen in the same scope).
3766 Returns either X or an old decl for the same name.
3767 If an old decl is returned, it may have been smashed
3768 to agree with what X says. */
3776 int need_new_binding
;
3778 /* We shouldn't be calling pushdecl when we're generating RTL for a
3779 function that we already did semantic analysis on previously. */
3780 my_friendly_assert (!cfun
|| doing_semantic_analysis_p (),
3783 need_new_binding
= 1;
3785 if (DECL_TEMPLATE_PARM_P (x
))
3786 /* Template parameters have no context; they are not X::T even
3787 when declared within a class or namespace. */
3791 if (current_function_decl
&& x
!= current_function_decl
3792 /* A local declaration for a function doesn't constitute
3794 && !(TREE_CODE (x
) == FUNCTION_DECL
&& !DECL_INITIAL (x
))
3795 /* A local declaration for an `extern' variable is in the
3796 scope of the current namespace, not the current
3798 && !(TREE_CODE (x
) == VAR_DECL
&& DECL_EXTERNAL (x
))
3799 && !DECL_CONTEXT (x
))
3800 DECL_CONTEXT (x
) = current_function_decl
;
3802 /* If this is the declaration for a namespace-scope function,
3803 but the declaration itself is in a local scope, mark the
3805 if (TREE_CODE (x
) == FUNCTION_DECL
3806 && DECL_NAMESPACE_SCOPE_P (x
)
3807 && current_function_decl
3808 && x
!= current_function_decl
)
3809 DECL_LOCAL_FUNCTION_P (x
) = 1;
3812 name
= DECL_NAME (x
);
3815 int different_binding_level
= 0;
3817 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3818 name
= TREE_OPERAND (name
, 0);
3820 /* In case this decl was explicitly namespace-qualified, look it
3821 up in its namespace context. */
3822 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
)
3823 && namespace_bindings_p ())
3824 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3826 t
= lookup_name_current_level (name
);
3828 /* [basic.link] If there is a visible declaration of an entity
3829 with linkage having the same name and type, ignoring entities
3830 declared outside the innermost enclosing namespace scope, the
3831 block scope declaration declares that same entity and
3832 receives the linkage of the previous declaration. */
3833 if (! t
&& current_function_decl
&& x
!= current_function_decl
3834 && (TREE_CODE (x
) == FUNCTION_DECL
|| TREE_CODE (x
) == VAR_DECL
)
3835 && DECL_EXTERNAL (x
))
3837 /* Look in block scope. */
3838 t
= IDENTIFIER_VALUE (name
);
3839 /* Or in the innermost namespace. */
3841 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3842 /* Does it have linkage? */
3843 if (t
&& ! (TREE_STATIC (t
) || DECL_EXTERNAL (t
)))
3846 different_binding_level
= 1;
3849 /* If we are declaring a function, and the result of name-lookup
3850 was an OVERLOAD, look for an overloaded instance that is
3851 actually the same as the function we are declaring. (If
3852 there is one, we have to merge our declaration with the
3853 previous declaration.) */
3854 if (t
&& TREE_CODE (t
) == OVERLOAD
)
3858 if (TREE_CODE (x
) == FUNCTION_DECL
)
3859 for (match
= t
; match
; match
= OVL_NEXT (match
))
3861 if (DECL_ASSEMBLER_NAME (OVL_CURRENT (t
))
3862 == DECL_ASSEMBLER_NAME (x
))
3866 /* Just choose one. */
3870 t
= OVL_CURRENT (match
);
3875 if (t
== error_mark_node
)
3877 /* error_mark_node is 0 for a while during initialization! */
3879 cp_error_at ("`%#D' used prior to declaration", x
);
3881 else if (t
!= NULL_TREE
)
3883 if (different_binding_level
)
3885 if (decls_match (x
, t
))
3886 /* The standard only says that the local extern
3887 inherits linkage from the previous decl; in
3888 particular, default args are not shared. It would
3889 be nice to propagate inlining info, though. FIXME. */
3890 TREE_PUBLIC (x
) = TREE_PUBLIC (t
);
3892 else if (TREE_CODE (t
) == PARM_DECL
)
3894 if (DECL_CONTEXT (t
) == NULL_TREE
)
3895 fatal ("parse errors have confused me too much");
3897 /* Check for duplicate params. */
3898 if (duplicate_decls (x
, t
))
3901 else if ((DECL_EXTERN_C_FUNCTION_P (x
)
3902 || DECL_FUNCTION_TEMPLATE_P (x
))
3903 && is_overloaded_fn (t
))
3904 /* Don't do anything just yet. */;
3905 else if (t
== wchar_decl_node
)
3907 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3908 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3910 /* Throw away the redeclaration. */
3913 else if (TREE_CODE (t
) != TREE_CODE (x
))
3915 if (duplicate_decls (x
, t
))
3918 else if (duplicate_decls (x
, t
))
3920 if (TREE_CODE (t
) == TYPE_DECL
)
3921 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3922 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3923 check_default_args (t
);
3927 else if (DECL_MAIN_P (x
))
3929 /* A redeclaration of main, but not a duplicate of the
3934 This function shall not be overloaded. */
3935 cp_error_at ("invalid redeclaration of `%D'", t
);
3936 cp_error ("as `%D'", x
);
3937 /* We don't try to push this declaration since that
3943 check_template_shadow (x
);
3945 /* If this is a function conjured up by the backend, massage it
3946 so it looks friendly. */
3947 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_LANG_SPECIFIC (x
))
3949 retrofit_lang_decl (x
);
3950 DECL_LANGUAGE (x
) = lang_c
;
3953 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_FUNCTION_MEMBER_P (x
))
3955 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
3958 if (!namespace_bindings_p ())
3959 /* We do not need to create a binding for this name;
3960 push_overloaded_decl will have already done so if
3962 need_new_binding
= 0;
3964 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3966 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
3968 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
3972 /* If declaring a type as a typedef, copy the type (unless we're
3973 at line 0), and install this TYPE_DECL as the new type's typedef
3974 name. See the extensive comment in ../c-decl.c (pushdecl). */
3975 if (TREE_CODE (x
) == TYPE_DECL
)
3977 tree type
= TREE_TYPE (x
);
3978 if (DECL_SOURCE_LINE (x
) == 0)
3980 if (TYPE_NAME (type
) == 0)
3981 TYPE_NAME (type
) = x
;
3983 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
3984 /* We don't want to copy the type when all we're
3985 doing is making a TYPE_DECL for the purposes of
3987 && (!TYPE_NAME (type
)
3988 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
3990 DECL_ORIGINAL_TYPE (x
) = type
;
3991 type
= build_type_copy (type
);
3992 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
3993 TYPE_NAME (type
) = x
;
3994 TREE_TYPE (x
) = type
;
3997 if (type
!= error_mark_node
3999 && TYPE_IDENTIFIER (type
))
4000 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
4001 current_binding_level
);
4005 /* Multiple external decls of the same identifier ought to match.
4007 We get warnings about inline functions where they are defined.
4008 We get warnings about other functions from push_overloaded_decl.
4010 Avoid duplicate warnings where they are used. */
4011 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
4015 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
4016 if (decl
&& TREE_CODE (decl
) == OVERLOAD
)
4017 decl
= OVL_FUNCTION (decl
);
4019 if (decl
&& decl
!= error_mark_node
4020 && (DECL_EXTERNAL (decl
) || TREE_PUBLIC (decl
))
4021 /* If different sort of thing, we already gave an error. */
4022 && TREE_CODE (decl
) == TREE_CODE (x
)
4023 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
4025 cp_pedwarn ("type mismatch with previous external decl", x
);
4026 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
4030 /* This name is new in its binding level.
4031 Install the new declaration and return it. */
4032 if (namespace_bindings_p ())
4034 /* Install a global value. */
4036 /* If the first global decl has external linkage,
4037 warn if we later see static one. */
4038 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
4039 TREE_PUBLIC (name
) = 1;
4041 /* Bind the mangled name for the entity. In the future, we
4042 should not need to do this; mangled names are an
4043 implementation detail of which the front-end should not
4044 need to be aware. */
4045 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
4047 /* For an ordinary function, we create a binding from
4048 the mangled name (i.e., NAME) to the DECL. But, for
4049 an `extern "C"' function, the mangled name and the
4050 ordinary name are the same so we need not do this. */
4051 && !DECL_EXTERN_C_FUNCTION_P (x
))
4055 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
4056 || TREE_CODE (x
) == NAMESPACE_DECL
)
4057 mangled_name
= name
;
4059 mangled_name
= DECL_ASSEMBLER_NAME (x
);
4061 if (TREE_CODE (x
) == FUNCTION_DECL
)
4063 ((IDENTIFIER_GLOBAL_VALUE (mangled_name
) == NULL_TREE
)
4064 || (IDENTIFIER_GLOBAL_VALUE (mangled_name
) == x
), 378);
4065 SET_IDENTIFIER_NAMESPACE_VALUE (mangled_name
, x
);
4068 /* Don't forget if the function was used via an implicit decl. */
4069 if (IDENTIFIER_IMPLICIT_DECL (name
)
4070 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
4073 /* Don't forget if its address was taken in that way. */
4074 if (IDENTIFIER_IMPLICIT_DECL (name
)
4075 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
4076 TREE_ADDRESSABLE (x
) = 1;
4078 /* Warn about mismatches against previous implicit decl. */
4079 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
4080 /* If this real decl matches the implicit, don't complain. */
4081 && ! (TREE_CODE (x
) == FUNCTION_DECL
4082 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
4084 ("`%D' was previously implicitly declared to return `int'", x
);
4086 /* If new decl is `static' and an `extern' was seen previously,
4088 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
4089 warn_extern_redeclared_static (x
, t
);
4093 /* Here to install a non-global value. */
4094 tree oldlocal
= IDENTIFIER_VALUE (name
);
4095 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
4097 if (need_new_binding
)
4099 push_local_binding (name
, x
, 0);
4100 /* Because push_local_binding will hook X on to the
4101 current_binding_level's name list, we don't want to
4102 do that again below. */
4103 need_new_binding
= 0;
4106 /* If this is a TYPE_DECL, push it into the type value slot. */
4107 if (TREE_CODE (x
) == TYPE_DECL
)
4108 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
4109 current_binding_level
);
4111 /* Clear out any TYPE_DECL shadowed by a namespace so that
4112 we won't think this is a type. The C struct hack doesn't
4113 go through namespaces. */
4114 if (TREE_CODE (x
) == NAMESPACE_DECL
)
4115 set_identifier_type_value_with_scope (name
, NULL_TREE
,
4116 current_binding_level
);
4123 && TREE_CODE (oldlocal
) == VAR_DECL
4124 && DECL_DEAD_FOR_LOCAL (oldlocal
))
4125 oldlocal
= DECL_SHADOWED_FOR_VAR (oldlocal
);
4127 if (oldlocal
== NULL_TREE
)
4128 oldlocal
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (d
));
4131 /* If this is an extern function declaration, see if we
4132 have a global definition or declaration for the function. */
4133 if (oldlocal
== NULL_TREE
4134 && DECL_EXTERNAL (x
)
4135 && oldglobal
!= NULL_TREE
4136 && TREE_CODE (x
) == FUNCTION_DECL
4137 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
4139 /* We have one. Their types must agree. */
4140 if (decls_match (x
, oldglobal
))
4144 cp_warning ("extern declaration of `%#D' doesn't match", x
);
4145 cp_warning_at ("global declaration `%#D'", oldglobal
);
4148 /* If we have a local external declaration,
4149 and no file-scope declaration has yet been seen,
4150 then if we later have a file-scope decl it must not be static. */
4151 if (oldlocal
== NULL_TREE
4152 && oldglobal
== NULL_TREE
4153 && DECL_EXTERNAL (x
)
4155 TREE_PUBLIC (name
) = 1;
4157 /* Warn if shadowing an argument at the top level of the body. */
4158 if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
4159 /* Inline decls shadow nothing. */
4160 && !DECL_FROM_INLINE (x
)
4161 && TREE_CODE (oldlocal
) == PARM_DECL
4162 /* Don't complain if it's from an enclosing function. */
4163 && DECL_CONTEXT (oldlocal
) == current_function_decl
4164 && TREE_CODE (x
) != PARM_DECL
)
4166 /* Go to where the parms should be and see if we
4168 struct binding_level
*b
= current_binding_level
->level_chain
;
4174 if (b
->parm_flag
== 1)
4175 cp_error ("declaration of `%#D' shadows a parameter", name
);
4178 /* Maybe warn if shadowing something else. */
4179 if (warn_shadow
&& !DECL_EXTERNAL (x
)
4180 /* Inline decls shadow nothing. */
4181 && !DECL_FROM_INLINE (x
)
4182 /* No shadow warnings for internally generated vars. */
4183 && ! DECL_ARTIFICIAL (x
)
4184 /* No shadow warnings for vars made for inlining. */
4185 && ! DECL_FROM_INLINE (x
))
4187 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
4188 warning ("declaration of `%s' shadows a parameter",
4189 IDENTIFIER_POINTER (name
));
4190 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
4191 && current_class_ptr
4192 && !TREE_STATIC (name
))
4193 warning ("declaration of `%s' shadows a member of `this'",
4194 IDENTIFIER_POINTER (name
));
4195 else if (oldlocal
!= NULL_TREE
)
4196 warning ("declaration of `%s' shadows previous local",
4197 IDENTIFIER_POINTER (name
));
4198 else if (oldglobal
!= NULL_TREE
)
4199 /* XXX shadow warnings in outer-more namespaces */
4200 warning ("declaration of `%s' shadows global declaration",
4201 IDENTIFIER_POINTER (name
));
4205 if (TREE_CODE (x
) == FUNCTION_DECL
)
4206 check_default_args (x
);
4208 /* Keep count of variables in this level with incomplete type. */
4209 if (TREE_CODE (x
) == VAR_DECL
4210 && TREE_TYPE (x
) != error_mark_node
4211 && ((!COMPLETE_TYPE_P (TREE_TYPE (x
))
4212 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
4213 /* RTTI TD entries are created while defining the type_info. */
4214 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
4215 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
4217 if (namespace_bindings_p ())
4218 namespace_scope_incomplete
4219 = tree_cons (NULL_TREE
, x
, namespace_scope_incomplete
);
4221 current_binding_level
->incomplete
4222 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4226 if (need_new_binding
)
4227 add_decl_to_level (x
,
4228 DECL_NAMESPACE_SCOPE_P (x
)
4229 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x
))
4230 : current_binding_level
);
4235 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4236 caller to set DECL_CONTEXT properly. */
4239 pushdecl_with_scope (x
, level
)
4241 struct binding_level
*level
;
4243 register struct binding_level
*b
;
4244 tree function_decl
= current_function_decl
;
4246 current_function_decl
= NULL_TREE
;
4247 if (level
->parm_flag
== 2)
4249 b
= class_binding_level
;
4250 class_binding_level
= level
;
4251 pushdecl_class_level (x
);
4252 class_binding_level
= b
;
4256 b
= current_binding_level
;
4257 current_binding_level
= level
;
4259 current_binding_level
= b
;
4261 current_function_decl
= function_decl
;
4265 /* Like pushdecl, only it places X in the current namespace,
4269 pushdecl_namespace_level (x
)
4272 register struct binding_level
*b
= current_binding_level
;
4275 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4277 /* Now, the type_shadowed stack may screw us. Munge it so it does
4279 if (TREE_CODE (x
) == TYPE_DECL
)
4281 tree name
= DECL_NAME (x
);
4283 tree
*ptr
= (tree
*)0;
4284 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4286 tree shadowed
= b
->type_shadowed
;
4287 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4288 if (TREE_PURPOSE (shadowed
) == name
)
4290 ptr
= &TREE_VALUE (shadowed
);
4291 /* Can't break out of the loop here because sometimes
4292 a binding level will have duplicate bindings for
4293 PT names. It's gross, but I haven't time to fix it. */
4296 newval
= TREE_TYPE (x
);
4297 if (ptr
== (tree
*)0)
4299 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4300 up here if this is changed to an assertion. --KR */
4301 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4311 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4315 pushdecl_top_level (x
)
4318 push_to_top_level ();
4319 x
= pushdecl_namespace_level (x
);
4320 pop_from_top_level ();
4324 /* Make the declaration of X appear in CLASS scope. */
4327 pushdecl_class_level (x
)
4330 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4331 scope looks for the pre-mangled name. */
4334 if (TREE_CODE (x
) == OVERLOAD
)
4335 x
= OVL_CURRENT (x
);
4336 name
= DECL_NAME (x
);
4340 push_class_level_binding (name
, x
);
4341 if (TREE_CODE (x
) == TYPE_DECL
)
4342 set_identifier_type_value (name
, TREE_TYPE (x
));
4344 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4348 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4351 pushdecl_class_level (f
);
4355 /* Enter DECL into the symbol table, if that's appropriate. Returns
4356 DECL, or a modified version thereof. */
4359 maybe_push_decl (decl
)
4362 tree type
= TREE_TYPE (decl
);
4364 /* Add this decl to the current binding level, but not if it comes
4365 from another scope, e.g. a static member variable. TEM may equal
4366 DECL or it may be a previous decl of the same name. */
4367 if (decl
== error_mark_node
4368 || (TREE_CODE (decl
) != PARM_DECL
4369 && DECL_CONTEXT (decl
) != NULL_TREE
4370 /* Definitions of namespace members outside their namespace are
4372 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4373 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4374 || TREE_CODE (type
) == UNKNOWN_TYPE
4375 /* The declaration of a template specialization does not affect
4376 the functions available for overload resolution, so we do not
4378 || (TREE_CODE (decl
) == FUNCTION_DECL
4379 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4382 return pushdecl (decl
);
4385 /* Make the declaration(s) of X appear in CLASS scope
4386 under the name NAME. */
4389 push_class_level_binding (name
, x
)
4394 /* The class_binding_level will be NULL if x is a template
4395 parameter name in a member template. */
4396 if (!class_binding_level
)
4399 /* Make sure that this new member does not have the same name
4400 as a template parameter. */
4401 if (TYPE_BEING_DEFINED (current_class_type
))
4402 check_template_shadow (x
);
4404 /* If this declaration shadows a declaration from an enclosing
4405 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4406 we leave this class. Record the shadowed declaration here. */
4407 binding
= IDENTIFIER_BINDING (name
);
4409 && ((TREE_CODE (x
) == OVERLOAD
4410 && BINDING_VALUE (binding
)
4411 && is_overloaded_fn (BINDING_VALUE (binding
)))
4412 || INHERITED_VALUE_BINDING_P (binding
)))
4417 /* If the old binding was from a base class, and was for a tag
4418 name, slide it over to make room for the new binding. The
4419 old binding is still visible if explicitly qualified with a
4421 if (INHERITED_VALUE_BINDING_P (binding
)
4422 && BINDING_VALUE (binding
)
4423 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4424 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4425 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4427 old_decl
= BINDING_TYPE (binding
);
4428 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4429 BINDING_VALUE (binding
) = NULL_TREE
;
4430 INHERITED_VALUE_BINDING_P (binding
) = 0;
4433 old_decl
= BINDING_VALUE (binding
);
4435 /* There was already a binding for X containing fewer
4436 functions than are named in X. Find the previous
4437 declaration of X on the class-shadowed list, and update it. */
4438 for (shadow
= class_binding_level
->class_shadowed
;
4440 shadow
= TREE_CHAIN (shadow
))
4441 if (TREE_PURPOSE (shadow
) == name
4442 && TREE_TYPE (shadow
) == old_decl
)
4444 BINDING_VALUE (binding
) = x
;
4445 INHERITED_VALUE_BINDING_P (binding
) = 0;
4446 TREE_TYPE (shadow
) = x
;
4451 /* If we didn't replace an existing binding, put the binding on the
4452 stack of bindings for the identifier, and update
4453 IDENTIFIER_CLASS_VALUE. */
4454 if (push_class_binding (name
, x
))
4456 class_binding_level
->class_shadowed
4457 = tree_cons (name
, IDENTIFIER_CLASS_VALUE (name
),
4458 class_binding_level
->class_shadowed
);
4459 /* Record the value we are binding NAME to so that we can know
4460 what to pop later. */
4461 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4465 /* Insert another USING_DECL into the current binding level, returning
4466 this declaration. If this is a redeclaration, do nothing, and
4467 return NULL_TREE if this not in namespace scope (in namespace
4468 scope, a using decl might extend any previous bindings). */
4471 push_using_decl (scope
, name
)
4477 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4478 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4479 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4480 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4483 return namespace_bindings_p () ? decl
: NULL_TREE
;
4484 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4485 DECL_INITIAL (decl
) = scope
;
4486 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4487 current_binding_level
->usings
= decl
;
4491 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4492 changed (i.e. there was already a directive), or the fresh
4493 TREE_LIST otherwise. */
4496 push_using_directive (used
)
4499 tree ud
= current_binding_level
->using_directives
;
4500 tree iter
, ancestor
;
4502 /* Check if we already have this. */
4503 if (purpose_member (used
, ud
) != NULL_TREE
)
4506 /* Recursively add all namespaces used. */
4507 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4508 push_using_directive (TREE_PURPOSE (iter
));
4510 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4511 ud
= current_binding_level
->using_directives
;
4512 ud
= tree_cons (used
, ancestor
, ud
);
4513 current_binding_level
->using_directives
= ud
;
4517 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4518 other definitions already in place. We get around this by making
4519 the value of the identifier point to a list of all the things that
4520 want to be referenced by that name. It is then up to the users of
4521 that name to decide what to do with that list.
4523 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its
4524 DECL_TEMPLATE_RESULT. It is dealt with the same way.
4526 FLAGS is a bitwise-or of the following values:
4527 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4529 PUSH_USING: DECL is being pushed as the result of a using
4532 The value returned may be a previous declaration if we guessed wrong
4533 about what language DECL should belong to (C or C++). Otherwise,
4534 it's always DECL (and never something that's not a _DECL). */
4537 push_overloaded_decl (decl
, flags
)
4541 tree name
= DECL_NAME (decl
);
4544 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4547 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4549 old
= lookup_name_current_level (name
);
4553 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4555 tree t
= TREE_TYPE (old
);
4556 if (IS_AGGR_TYPE (t
) && warn_shadow
4557 && (! DECL_IN_SYSTEM_HEADER (decl
)
4558 || ! DECL_IN_SYSTEM_HEADER (old
)))
4559 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4562 else if (is_overloaded_fn (old
))
4566 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4568 tree fn
= OVL_CURRENT (tmp
);
4570 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4571 && !(flags
& PUSH_USING
)
4572 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4573 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4574 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4577 if (duplicate_decls (decl
, fn
))
4581 else if (old
== error_mark_node
)
4582 /* Ignore the undefined symbol marker. */
4586 cp_error_at ("previous non-function declaration `%#D'", old
);
4587 cp_error ("conflicts with function declaration `%#D'", decl
);
4592 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4594 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4595 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4597 new_binding
= ovl_cons (decl
, old
);
4598 if (flags
& PUSH_USING
)
4599 OVL_USED (new_binding
) = 1;
4602 /* NAME is not ambiguous. */
4606 set_namespace_binding (name
, current_namespace
, new_binding
);
4609 /* We only create an OVERLOAD if there was a previous binding at
4610 this level, or if decl is a template. In the former case, we
4611 need to remove the old binding and replace it with the new
4612 binding. We must also run through the NAMES on the binding
4613 level where the name was bound to update the chain. */
4615 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4619 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4621 d
= &TREE_CHAIN (*d
))
4623 || (TREE_CODE (*d
) == TREE_LIST
4624 && TREE_VALUE (*d
) == old
))
4626 if (TREE_CODE (*d
) == TREE_LIST
)
4627 /* Just replace the old binding with the new. */
4628 TREE_VALUE (*d
) = new_binding
;
4630 /* Build a TREE_LIST to wrap the OVERLOAD. */
4631 *d
= tree_cons (NULL_TREE
, new_binding
,
4634 /* And update the CPLUS_BINDING node. */
4635 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4640 /* We should always find a previous binding in this case. */
4641 my_friendly_abort (0);
4644 /* Install the new binding. */
4645 push_local_binding (name
, new_binding
, flags
);
4651 /* Generate an implicit declaration for identifier FUNCTIONID
4652 as a function of type int (). Print a warning if appropriate. */
4655 implicitly_declare (functionid
)
4660 /* We used to reuse an old implicit decl here,
4661 but this loses with inline functions because it can clobber
4662 the saved decl chains. */
4663 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4665 DECL_EXTERNAL (decl
) = 1;
4666 TREE_PUBLIC (decl
) = 1;
4668 /* ISO standard says implicit declarations are in the innermost block.
4669 So we record the decl in the standard fashion. */
4671 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4674 /* Only one warning per identifier. */
4675 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4677 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4680 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4685 /* Return zero if the declaration NEWDECL is valid
4686 when the declaration OLDDECL (assumed to be for the same name)
4687 has already been seen.
4688 Otherwise return an error message format string with a %s
4689 where the identifier should go. */
4692 redeclaration_error_message (newdecl
, olddecl
)
4693 tree newdecl
, olddecl
;
4695 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4697 /* Because C++ can put things into name space for free,
4698 constructs like "typedef struct foo { ... } foo"
4699 would look like an erroneous redeclaration. */
4700 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4703 return "redefinition of `%#D'";
4705 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4707 /* If this is a pure function, its olddecl will actually be
4708 the original initialization to `0' (which we force to call
4709 abort()). Don't complain about redefinition in this case. */
4710 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_PURE_VIRTUAL_P (olddecl
))
4713 /* If both functions come from different namespaces, this is not
4714 a redeclaration - this is a conflict with a used function. */
4715 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4716 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4717 return "`%D' conflicts with used function";
4719 /* We'll complain about linkage mismatches in
4720 warn_extern_redeclared_static. */
4722 /* Defining the same name twice is no good. */
4723 if (DECL_INITIAL (olddecl
) != NULL_TREE
4724 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4726 if (DECL_NAME (olddecl
) == NULL_TREE
)
4727 return "`%#D' not declared in class";
4729 return "redefinition of `%#D'";
4733 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4735 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4736 && (DECL_TEMPLATE_RESULT (newdecl
)
4737 != DECL_TEMPLATE_RESULT (olddecl
))
4738 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4739 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4740 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4741 && COMPLETE_TYPE_P (TREE_TYPE (newdecl
))
4742 && COMPLETE_TYPE_P (TREE_TYPE (olddecl
))))
4743 return "redefinition of `%#D'";
4746 else if (toplevel_bindings_p () || DECL_NAMESPACE_SCOPE_P (newdecl
))
4748 /* Objects declared at top level: */
4749 /* If at least one is a reference, it's ok. */
4750 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4752 /* Reject two definitions. */
4753 return "redefinition of `%#D'";
4757 /* Objects declared with block scope: */
4758 /* Reject two definitions, and reject a definition
4759 together with an external reference. */
4760 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4761 return "redeclaration of `%#D'";
4766 /* Create a new label, named ID. */
4769 make_label_decl (id
, local_p
)
4775 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4777 /* Make sure every label has an rtx. */
4780 DECL_CONTEXT (decl
) = current_function_decl
;
4781 DECL_MODE (decl
) = VOIDmode
;
4782 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
4784 /* Say where one reference is to the label, for the sake of the
4785 error if it is not defined. */
4786 DECL_SOURCE_LINE (decl
) = lineno
;
4787 DECL_SOURCE_FILE (decl
) = input_filename
;
4789 /* Record the fact that this identifier is bound to this label. */
4790 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4795 /* Record this label on the list of used labels so that we can check
4796 at the end of the function to see whether or not the label was
4797 actually defined, and so we can check when the label is defined whether
4798 this use is valid. */
4804 if (named_label_uses
== NULL
4805 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4806 || named_label_uses
->label_decl
!= decl
)
4808 struct named_label_use_list
*new_ent
;
4809 new_ent
= ((struct named_label_use_list
*)
4810 ggc_alloc (sizeof (struct named_label_use_list
)));
4811 new_ent
->label_decl
= decl
;
4812 new_ent
->names_in_scope
= current_binding_level
->names
;
4813 new_ent
->binding_level
= current_binding_level
;
4814 new_ent
->lineno_o_goto
= lineno
;
4815 new_ent
->filename_o_goto
= input_filename
;
4816 new_ent
->next
= named_label_uses
;
4817 named_label_uses
= new_ent
;
4821 /* Look for a label named ID in the current function. If one cannot
4822 be found, create one. (We keep track of used, but undefined,
4823 labels, and complain about them at the end of a function.) */
4830 struct named_label_list
*ent
;
4832 /* You can't use labels at global scope. */
4833 if (current_function_decl
== NULL_TREE
)
4835 error ("label `%s' referenced outside of any function",
4836 IDENTIFIER_POINTER (id
));
4840 /* See if we've already got this label. */
4841 decl
= IDENTIFIER_LABEL_VALUE (id
);
4842 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
4845 /* Record this label on the list of labels used in this function.
4846 We do this before calling make_label_decl so that we get the
4847 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4848 ent
= ((struct named_label_list
*)
4849 ggc_alloc_cleared (sizeof (struct named_label_list
)));
4850 ent
->old_value
= IDENTIFIER_LABEL_VALUE (id
);
4851 ent
->next
= named_labels
;
4854 /* We need a new label. */
4855 decl
= make_label_decl (id
, /*local_p=*/0);
4857 /* Now fill in the information we didn't have before. */
4858 ent
->label_decl
= decl
;
4863 /* Declare a local label named ID. */
4866 declare_local_label (id
)
4871 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4872 this scope we can restore the old value of
4873 IDENTIFIER_TYPE_VALUE. */
4874 current_binding_level
->shadowed_labels
4875 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4876 current_binding_level
->shadowed_labels
);
4877 /* Look for the label. */
4878 decl
= make_label_decl (id
, /*local_p=*/1);
4879 /* Now fill in the information we didn't have before. */
4880 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
4885 /* Returns nonzero if it is ill-formed to jump past the declaration of
4886 DECL. Returns 2 if it's also a real problem. */
4889 decl_jump_unsafe (decl
)
4892 if (TREE_CODE (decl
) != VAR_DECL
|| TREE_STATIC (decl
))
4895 if (DECL_INITIAL (decl
) == NULL_TREE
4896 && pod_type_p (TREE_TYPE (decl
)))
4899 /* This is really only important if we're crossing an initialization.
4900 The POD stuff is just pedantry; why should it matter if the class
4901 contains a field of pointer to member type? */
4902 if (DECL_INITIAL (decl
)
4903 || (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))))
4908 /* Check that a single previously seen jump to a newly defined label
4909 is OK. DECL is the LABEL_DECL or 0; LEVEL is the binding_level for
4910 the jump context; NAMES are the names in scope in LEVEL at the jump
4911 context; FILE and LINE are the source position of the jump or 0. */
4914 check_previous_goto_1 (decl
, level
, names
, file
, line
)
4916 struct binding_level
*level
;
4923 struct binding_level
*b
= current_binding_level
;
4924 for (; b
; b
= b
->level_chain
)
4926 tree new_decls
= b
->names
;
4927 tree old_decls
= (b
== level
? names
: NULL_TREE
);
4928 for (; new_decls
!= old_decls
;
4929 new_decls
= TREE_CHAIN (new_decls
))
4931 int problem
= decl_jump_unsafe (new_decls
);
4938 cp_pedwarn ("jump to label `%D'", decl
);
4940 pedwarn ("jump to case label");
4943 pedwarn_with_file_and_line (file
, line
, " from here");
4947 if (problem
> 1 && DECL_ARTIFICIAL (new_decls
))
4948 /* Can't skip init of __exception_info. */
4949 cp_error_at (" enters catch block", new_decls
);
4950 else if (problem
> 1)
4951 cp_error_at (" crosses initialization of `%#D'",
4954 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4960 if (b
->eh_region
&& ! saw_eh
)
4965 cp_pedwarn ("jump to label `%D'", decl
);
4967 pedwarn ("jump to case label");
4970 pedwarn_with_file_and_line (file
, line
, " from here");
4973 error (" enters try block");
4980 check_previous_goto (use
)
4981 struct named_label_use_list
*use
;
4983 check_previous_goto_1 (use
->label_decl
, use
->binding_level
,
4984 use
->names_in_scope
, use
->filename_o_goto
,
4985 use
->lineno_o_goto
);
4989 check_switch_goto (level
)
4990 struct binding_level
*level
;
4992 check_previous_goto_1 (NULL_TREE
, level
, level
->names
, NULL
, 0);
4995 /* Check that any previously seen jumps to a newly defined label DECL
4996 are OK. Called by define_label. */
4999 check_previous_gotos (decl
)
5002 struct named_label_use_list
**usep
;
5004 if (! TREE_USED (decl
))
5007 for (usep
= &named_label_uses
; *usep
; )
5009 struct named_label_use_list
*use
= *usep
;
5010 if (use
->label_decl
== decl
)
5012 check_previous_goto (use
);
5016 usep
= &(use
->next
);
5020 /* Check that a new jump to a label DECL is OK. Called by
5021 finish_goto_stmt. */
5029 struct named_label_list
*lab
;
5031 /* We can't know where a computed goto is jumping. So we assume
5033 if (! DECL_P (decl
))
5036 /* If the label hasn't been defined yet, defer checking. */
5037 if (! DECL_INITIAL (decl
))
5043 for (lab
= named_labels
; lab
; lab
= lab
->next
)
5044 if (decl
== lab
->label_decl
)
5047 /* If the label is not on named_labels it's a gcc local label, so
5048 it must be in an outer scope, so jumping to it is always OK. */
5052 if ((lab
->eh_region
|| lab
->bad_decls
) && !identified
)
5054 cp_pedwarn_at ("jump to label `%D'", decl
);
5055 pedwarn (" from here");
5059 for (bad
= lab
->bad_decls
; bad
; bad
= TREE_CHAIN (bad
))
5061 tree b
= TREE_VALUE (bad
);
5062 int u
= decl_jump_unsafe (b
);
5064 if (u
> 1 && DECL_ARTIFICIAL (b
))
5065 /* Can't skip init of __exception_info. */
5066 cp_error_at (" enters catch block", b
);
5068 cp_error_at (" skips initialization of `%#D'", b
);
5070 cp_pedwarn_at (" enters scope of non-POD `%#D'", b
);
5074 error (" enters try block");
5077 /* Define a label, specifying the location in the source file.
5078 Return the LABEL_DECL node for the label, if the definition is valid.
5079 Otherwise return 0. */
5082 define_label (filename
, line
, name
)
5083 const char *filename
;
5087 tree decl
= lookup_label (name
);
5088 struct named_label_list
*ent
;
5090 for (ent
= named_labels
; ent
; ent
= ent
->next
)
5091 if (ent
->label_decl
== decl
)
5094 /* After labels, make any new cleanups go into their
5095 own new (temporary) binding contour. */
5096 current_binding_level
->more_cleanups_ok
= 0;
5098 if (name
== get_identifier ("wchar_t"))
5099 cp_pedwarn ("label named wchar_t");
5101 if (DECL_INITIAL (decl
) != NULL_TREE
)
5103 cp_error ("duplicate label `%D'", decl
);
5108 /* Mark label as having been defined. */
5109 DECL_INITIAL (decl
) = error_mark_node
;
5110 /* Say where in the source. */
5111 DECL_SOURCE_FILE (decl
) = filename
;
5112 DECL_SOURCE_LINE (decl
) = line
;
5115 ent
->names_in_scope
= current_binding_level
->names
;
5116 ent
->binding_level
= current_binding_level
;
5118 check_previous_gotos (decl
);
5119 current_function_return_value
= NULL_TREE
;
5126 struct binding_level
*level
;
5127 struct cp_switch
*next
;
5128 /* The SWITCH_STMT being built. */
5130 /* A splay-tree mapping the low element of a case range to the high
5131 element, or NULL_TREE if there is no high element. Used to
5132 determine whether or not a new case label duplicates an old case
5133 label. We need a tree, rather than simply a hash table, because
5134 of the GNU case range extension. */
5138 /* A stack of the currently active switch statements. The innermost
5139 switch statement is on the top of the stack. There is no need to
5140 mark the stack for garbage collection because it is only active
5141 during the processing of the body of a function, and we never
5142 collect at that point. */
5144 static struct cp_switch
*switch_stack
;
5146 /* Called right after a switch-statement condition is parsed.
5147 SWITCH_STMT is the switch statement being parsed. */
5150 push_switch (switch_stmt
)
5154 = (struct cp_switch
*) xmalloc (sizeof (struct cp_switch
));
5155 p
->level
= current_binding_level
;
5156 p
->next
= switch_stack
;
5157 p
->switch_stmt
= switch_stmt
;
5158 p
->cases
= splay_tree_new (case_compare
, NULL
, NULL
);
5165 struct cp_switch
*cs
;
5168 splay_tree_delete (cs
->cases
);
5169 switch_stack
= switch_stack
->next
;
5173 /* Note that we've seen a definition of a case label, and complain if this
5174 is a bad place for one. */
5177 finish_case_label (low_value
, high_value
)
5186 error ("case label not within a switch statement");
5188 cp_error ("case label `%E' not within a switch statement",
5191 error ("`default' label not within a switch statement");
5195 if (processing_template_decl
)
5199 /* For templates, just add the case label; we'll do semantic
5200 analysis at instantiation-time. */
5201 label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
5202 add_stmt (build_case_label (low_value
, high_value
, label
));
5206 /* Find the condition on which this switch statement depends. */
5207 cond
= SWITCH_COND (switch_stack
->switch_stmt
);
5208 if (cond
&& TREE_CODE (cond
) == TREE_LIST
)
5209 cond
= TREE_VALUE (cond
);
5211 c_add_case_label (switch_stack
->cases
, cond
, low_value
, high_value
);
5213 check_switch_goto (switch_stack
->level
);
5215 /* After labels, make any new cleanups go into their
5216 own new (temporary) binding contour. */
5217 current_binding_level
->more_cleanups_ok
= 0;
5218 current_function_return_value
= NULL_TREE
;
5221 /* Return the list of declarations of the current level.
5222 Note that this list is in reverse order unless/until
5223 you nreverse it; and when you do nreverse it, you must
5224 store the result back using `storedecls' or you will lose. */
5229 return current_binding_level
->names
;
5232 /* Return the list of type-tags (for structs, etc) of the current level. */
5237 return current_binding_level
->tags
;
5240 /* Store the list of declarations of the current level.
5241 This is done for the parameter declarations of a function being defined,
5242 after they are modified in the light of any missing parameters. */
5248 current_binding_level
->names
= decls
;
5251 /* Similarly, store the list of tags of the current level. */
5257 current_binding_level
->tags
= tags
;
5260 /* Given NAME, an IDENTIFIER_NODE,
5261 return the structure (or union or enum) definition for that name.
5262 Searches binding levels from BINDING_LEVEL up to the global level.
5263 If THISLEVEL_ONLY is nonzero, searches only the specified context
5264 (but skips any tag-transparent contexts to find one that is
5265 meaningful for tags).
5266 FORM says which kind of type the caller wants;
5267 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
5268 If the wrong kind of type is found, and it's not a template, an error is
5272 lookup_tag (form
, name
, binding_level
, thislevel_only
)
5273 enum tree_code form
;
5275 struct binding_level
*binding_level
;
5278 register struct binding_level
*level
;
5279 /* Non-zero if, we should look past a template parameter level, even
5280 if THISLEVEL_ONLY. */
5281 int allow_template_parms_p
= 1;
5283 for (level
= binding_level
; level
; level
= level
->level_chain
)
5286 if (ANON_AGGRNAME_P (name
))
5287 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5289 /* There's no need for error checking here, because
5290 anon names are unique throughout the compilation. */
5291 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
5292 return TREE_VALUE (tail
);
5294 else if (level
->namespace_p
)
5295 /* Do namespace lookup. */
5296 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
5298 tree old
= binding_for_name (name
, tail
);
5300 /* If we just skipped past a template parameter level,
5301 even though THISLEVEL_ONLY, and we find a template
5302 class declaration, then we use the _TYPE node for the
5303 template. See the example below. */
5304 if (thislevel_only
&& !allow_template_parms_p
5305 && old
&& BINDING_VALUE (old
)
5306 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
5307 old
= TREE_TYPE (BINDING_VALUE (old
));
5309 old
= BINDING_TYPE (old
);
5311 /* If it has an original type, it is a typedef, and we
5312 should not return it. */
5313 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
5315 if (old
&& TREE_CODE (old
) != form
5316 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
5318 cp_error ("`%#D' redeclared as %C", old
, form
);
5323 if (thislevel_only
|| tail
== global_namespace
)
5327 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5329 if (TREE_PURPOSE (tail
) == name
)
5331 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
5332 /* Should tighten this up; it'll probably permit
5333 UNION_TYPE and a struct template, for example. */
5335 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
5337 /* Definition isn't the kind we were looking for. */
5338 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
5342 return TREE_VALUE (tail
);
5345 if (thislevel_only
&& ! level
->tag_transparent
)
5347 if (level
->template_parms_p
&& allow_template_parms_p
)
5349 /* We must deal with cases like this:
5351 template <class T> struct S;
5352 template <class T> struct S {};
5354 When looking up `S', for the second declaration, we
5355 would like to find the first declaration. But, we
5356 are in the pseudo-global level created for the
5357 template parameters, rather than the (surrounding)
5358 namespace level. Thus, we keep going one more level,
5359 even though THISLEVEL_ONLY is non-zero. */
5360 allow_template_parms_p
= 0;
5372 set_current_level_tags_transparency (tags_transparent
)
5373 int tags_transparent
;
5375 current_binding_level
->tag_transparent
= tags_transparent
;
5379 /* Given a type, find the tag that was defined for it and return the tag name.
5380 Otherwise return 0. However, the value can never be 0
5381 in the cases in which this is used.
5383 C++: If NAME is non-zero, this is the new name to install. This is
5384 done when replacing anonymous tags with real tag names. */
5387 lookup_tag_reverse (type
, name
)
5391 register struct binding_level
*level
;
5393 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5396 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5398 if (TREE_VALUE (tail
) == type
)
5401 TREE_PURPOSE (tail
) = name
;
5402 return TREE_PURPOSE (tail
);
5409 /* Look up NAME in the NAMESPACE. */
5412 lookup_namespace_name (namespace, name
)
5413 tree
namespace, name
;
5416 tree template_id
= NULL_TREE
;
5418 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5420 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5421 /* This happens for A::B<int> when B is a namespace. */
5423 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5425 /* This happens for A::B where B is a template, and there are no
5426 template arguments. */
5427 cp_error ("invalid use of `%D'", name
);
5428 return error_mark_node
;
5431 namespace = ORIGINAL_NAMESPACE (namespace);
5433 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5436 name
= TREE_OPERAND (name
, 0);
5437 if (TREE_CODE (name
) == OVERLOAD
)
5438 name
= DECL_NAME (OVL_CURRENT (name
));
5439 else if (DECL_P (name
))
5440 name
= DECL_NAME (name
);
5443 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5445 val
= make_node (CPLUS_BINDING
);
5446 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5447 return error_mark_node
;
5449 if (BINDING_VALUE (val
))
5451 val
= BINDING_VALUE (val
);
5455 if (DECL_CLASS_TEMPLATE_P (val
))
5456 val
= lookup_template_class (val
,
5457 TREE_OPERAND (template_id
, 1),
5458 /*in_decl=*/NULL_TREE
,
5459 /*context=*/NULL_TREE
,
5460 /*entering_scope=*/0);
5461 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5462 || TREE_CODE (val
) == OVERLOAD
)
5463 val
= lookup_template_function (val
,
5464 TREE_OPERAND (template_id
, 1));
5467 cp_error ("`%D::%D' is not a template",
5469 return error_mark_node
;
5473 /* If we have a single function from a using decl, pull it out. */
5474 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5475 val
= OVL_FUNCTION (val
);
5479 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5480 return error_mark_node
;
5483 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5485 static unsigned long
5493 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5494 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5499 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5502 typename_compare (k1
, k2
)
5513 d1
= TYPE_NAME (t1
);
5514 d2
= TYPE_NAME (t2
);
5516 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5517 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5518 && ((TREE_TYPE (t1
) != NULL_TREE
)
5519 == (TREE_TYPE (t2
) != NULL_TREE
))
5520 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5521 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5524 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5525 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5526 is non-NULL, this type is being created by the implicit typename
5527 extension, and BASE_TYPE is a type named `t' in some base class of
5528 `T' which depends on template parameters.
5530 Returns the new TYPENAME_TYPE. */
5533 build_typename_type (context
, name
, fullname
, base_type
)
5541 struct hash_entry
* e
;
5543 static struct hash_table ht
;
5547 static struct hash_table
*h
= &ht
;
5548 if (!hash_table_init (&ht
, &hash_newfunc
, &typename_hash
,
5550 fatal ("virtual memory exhausted");
5551 ggc_add_tree_hash_table_root (&h
, 1);
5554 /* Build the TYPENAME_TYPE. */
5555 t
= make_aggr_type (TYPENAME_TYPE
);
5556 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5557 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5558 TREE_TYPE (t
) = base_type
;
5560 /* Build the corresponding TYPE_DECL. */
5561 d
= build_decl (TYPE_DECL
, name
, t
);
5562 TYPE_NAME (TREE_TYPE (d
)) = d
;
5563 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5564 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5565 DECL_ARTIFICIAL (d
) = 1;
5567 /* See if we already have this type. */
5568 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5572 /* Insert the type into the table. */
5573 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5578 /* Resolve `typename CONTEXT::NAME'. Returns an appropriate type,
5579 unless an error occurs, in which case error_mark_node is returned.
5580 If COMPLAIN zero, don't complain about any errors that occur. */
5583 make_typename_type (context
, name
, complain
)
5591 if (!(TYPE_LANG_SPECIFIC (name
)
5592 && (CLASSTYPE_IS_TEMPLATE (name
)
5593 || CLASSTYPE_USE_TEMPLATE (name
))))
5594 name
= TYPE_IDENTIFIER (name
);
5596 /* Create a TEMPLATE_ID_EXPR for the type. */
5597 name
= build_nt (TEMPLATE_ID_EXPR
,
5598 CLASSTYPE_TI_TEMPLATE (name
),
5599 CLASSTYPE_TI_ARGS (name
));
5601 else if (TREE_CODE (name
) == TYPE_DECL
)
5602 name
= DECL_NAME (name
);
5606 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5608 name
= TREE_OPERAND (name
, 0);
5609 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5610 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5612 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5613 my_friendly_abort (2000);
5615 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5617 /* We can get here from typename_sub0 in the explicit_template_type
5618 expansion. Just fail. */
5620 cp_error ("no class template named `%#T' in `%#T'",
5622 return error_mark_node
;
5625 if (! uses_template_parms (context
)
5626 || currently_open_class (context
))
5628 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5630 tree tmpl
= NULL_TREE
;
5631 if (IS_AGGR_TYPE (context
))
5632 tmpl
= lookup_field (context
, name
, 0, 0);
5633 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5636 cp_error ("no class template named `%#T' in `%#T'",
5638 return error_mark_node
;
5641 return lookup_template_class (tmpl
,
5642 TREE_OPERAND (fullname
, 1),
5644 /*entering_scope=*/0);
5650 if (!IS_AGGR_TYPE (context
))
5653 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5654 return error_mark_node
;
5657 t
= lookup_field (context
, name
, 0, 1);
5659 return TREE_TYPE (t
);
5663 /* If the CONTEXT is not a template type, then either the field is
5664 there now or its never going to be. */
5665 if (!uses_template_parms (context
))
5668 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5669 return error_mark_node
;
5673 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5676 /* Select the right _DECL from multiple choices. */
5679 select_decl (binding
, flags
)
5684 val
= BINDING_VALUE (binding
);
5686 /* When we implicitly declare some builtin entity, we mark it
5687 DECL_ANTICIPATED, so that we know to ignore it until it is
5689 if (val
&& DECL_P (val
)
5690 && DECL_LANG_SPECIFIC (val
)
5691 && DECL_ANTICIPATED (val
))
5694 if (LOOKUP_NAMESPACES_ONLY (flags
))
5696 /* We are not interested in types. */
5697 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5702 /* If we could have a type and
5703 we have nothing or we need a type and have none. */
5704 if (BINDING_TYPE (binding
)
5705 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5706 && TREE_CODE (val
) != TYPE_DECL
)))
5707 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5708 /* Don't return non-types if we really prefer types. */
5709 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5710 && (TREE_CODE (val
) != TEMPLATE_DECL
5711 || !DECL_CLASS_TEMPLATE_P (val
)))
5717 /* Unscoped lookup of a global: iterate over current namespaces,
5718 considering using-directives. If SPACESP is non-NULL, store a list
5719 of the namespaces we've considered in it. */
5722 unqualified_namespace_lookup (name
, flags
, spacesp
)
5727 tree b
= make_node (CPLUS_BINDING
);
5728 tree initial
= current_decl_namespace();
5729 tree scope
= initial
;
5731 struct binding_level
*level
;
5732 tree val
= NULL_TREE
;
5735 *spacesp
= NULL_TREE
;
5737 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5740 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5741 val
= binding_for_name (name
, scope
);
5743 /* Initialize binding for this context. */
5744 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5745 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5747 /* Add all _DECLs seen through local using-directives. */
5748 for (level
= current_binding_level
;
5749 !level
->namespace_p
;
5750 level
= level
->level_chain
)
5751 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5752 scope
, flags
, spacesp
))
5753 /* Give up because of error. */
5754 return error_mark_node
;
5756 /* Add all _DECLs seen through global using-directives. */
5757 /* XXX local and global using lists should work equally. */
5761 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5762 scope
, flags
, spacesp
))
5763 /* Give up because of error. */
5764 return error_mark_node
;
5765 if (siter
== scope
) break;
5766 siter
= CP_DECL_CONTEXT (siter
);
5769 val
= select_decl (b
, flags
);
5770 if (scope
== global_namespace
)
5776 /* Combine prefer_type and namespaces_only into flags. */
5779 lookup_flags (prefer_type
, namespaces_only
)
5780 int prefer_type
, namespaces_only
;
5782 if (namespaces_only
)
5783 return LOOKUP_PREFER_NAMESPACES
;
5784 if (prefer_type
> 1)
5785 return LOOKUP_PREFER_TYPES
;
5786 if (prefer_type
> 0)
5787 return LOOKUP_PREFER_BOTH
;
5791 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5792 ignore it or not. Subroutine of lookup_name_real. */
5795 qualify_lookup (val
, flags
)
5799 if (val
== NULL_TREE
)
5801 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5803 if ((flags
& LOOKUP_PREFER_TYPES
)
5804 && (TREE_CODE (val
) == TYPE_DECL
5805 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5806 && DECL_CLASS_TEMPLATE_P (val
))))
5808 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5813 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5817 warn_about_implicit_typename_lookup (typename
, binding
)
5821 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5822 tree name
= DECL_NAME (typename
);
5824 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5825 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5826 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5827 && ! (TREE_CODE (binding
) == TYPE_DECL
5828 && same_type_p (TREE_TYPE (binding
), subtype
)))
5830 cp_warning ("lookup of `%D' finds `%#D'",
5832 cp_warning (" instead of `%D' from dependent base class",
5834 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5835 constructor_name (current_class_type
), name
);
5839 /* Look up NAME in the current binding level and its superiors in the
5840 namespace of variables, functions and typedefs. Return a ..._DECL
5841 node of some kind representing its definition if there is only one
5842 such declaration, or return a TREE_LIST with all the overloaded
5843 definitions if there are many, or return 0 if it is undefined.
5845 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5846 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5847 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5848 Otherwise we prefer non-TYPE_DECLs.
5850 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5851 using IDENTIFIER_CLASS_VALUE. */
5854 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5856 int prefer_type
, nonclass
, namespaces_only
;
5859 tree val
= NULL_TREE
;
5861 tree from_obj
= NULL_TREE
;
5863 int val_is_implicit_typename
= 0;
5865 /* Hack: copy flag set by parser, if set. */
5866 if (only_namespace_names
)
5867 namespaces_only
= 1;
5869 if (prefer_type
== -2)
5871 extern int looking_for_typename
;
5872 tree type
= NULL_TREE
;
5875 prefer_type
= looking_for_typename
;
5877 flags
= lookup_flags (prefer_type
, namespaces_only
);
5878 /* If the next thing is '<', class templates are types. */
5879 if (looking_for_template
)
5880 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5882 /* std:: becomes :: for now. */
5883 if (got_scope
&& got_scope
== fake_std_node
)
5884 got_scope
= void_type_node
;
5888 else if (got_object
!= error_mark_node
)
5893 if (type
== error_mark_node
)
5894 return error_mark_node
;
5895 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5896 type
= TREE_TYPE (type
);
5899 type
= complete_type (type
);
5901 if (TREE_CODE (type
) == VOID_TYPE
)
5902 type
= global_namespace
;
5903 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5905 val
= make_node (CPLUS_BINDING
);
5906 flags
|= LOOKUP_COMPLAIN
;
5907 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5909 val
= select_decl (val
, flags
);
5911 else if (! IS_AGGR_TYPE (type
)
5912 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5913 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
5914 || TREE_CODE (type
) == TYPENAME_TYPE
)
5915 /* Someone else will give an error about this if needed. */
5917 else if (type
== current_class_type
)
5918 val
= IDENTIFIER_CLASS_VALUE (name
);
5921 val
= lookup_member (type
, name
, 0, prefer_type
);
5922 type_access_control (type
, val
);
5924 /* Restore the containing TYPENAME_TYPE if we looked
5925 through it before. */
5926 if (got_scope
&& got_scope
!= type
5927 && val
&& TREE_CODE (val
) == TYPE_DECL
5928 && TREE_CODE (TREE_TYPE (val
)) == TYPENAME_TYPE
)
5929 TYPE_CONTEXT (TREE_TYPE (val
)) = got_scope
;
5937 else if (got_object
&& val
)
5945 flags
= lookup_flags (prefer_type
, namespaces_only
);
5946 /* If we're not parsing, we need to complain. */
5947 flags
|= LOOKUP_COMPLAIN
;
5950 /* First, look in non-namespace scopes. */
5952 if (current_class_type
== NULL_TREE
)
5955 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5959 if (!LOCAL_BINDING_P (t
) && nonclass
)
5960 /* We're not looking for class-scoped bindings, so keep going. */
5963 /* If this is the kind of thing we're looking for, we're done. */
5964 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5965 binding
= BINDING_VALUE (t
);
5966 else if ((flags
& LOOKUP_PREFER_TYPES
)
5967 && qualify_lookup (BINDING_TYPE (t
), flags
))
5968 binding
= BINDING_TYPE (t
);
5970 binding
= NULL_TREE
;
5972 /* Handle access control on types from enclosing or base classes. */
5973 if (binding
&& ! yylex
5974 && BINDING_LEVEL (t
) && BINDING_LEVEL (t
)->parm_flag
== 2)
5975 type_access_control (BINDING_LEVEL (t
)->this_class
, binding
);
5978 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5980 if (val_is_implicit_typename
&& !yylex
)
5981 warn_about_implicit_typename_lookup (val
, binding
);
5983 val_is_implicit_typename
5984 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5985 if (!val_is_implicit_typename
)
5990 /* Now lookup in namespace scopes. */
5991 if (!val
|| val_is_implicit_typename
)
5993 t
= unqualified_namespace_lookup (name
, flags
, 0);
5996 if (val_is_implicit_typename
&& !yylex
)
5997 warn_about_implicit_typename_lookup (val
, t
);
6005 /* This should only warn about types used in qualified-ids. */
6006 if (from_obj
&& from_obj
!= val
)
6008 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
6009 && TREE_CODE (val
) == TYPE_DECL
6010 && ! same_type_p (TREE_TYPE (from_obj
), TREE_TYPE (val
)))
6012 lookup of `%D' in the scope of `%#T' (`%#T') \
6013 does not match lookup in the current scope (`%#T')",
6014 name
, got_object
, TREE_TYPE (from_obj
),
6017 /* We don't change val to from_obj if got_object depends on
6018 template parms because that breaks implicit typename for
6019 destructor calls. */
6020 if (! uses_template_parms (got_object
))
6024 /* If we have a single function from a using decl, pull it out. */
6025 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
6026 val
= OVL_FUNCTION (val
);
6035 lookup_name_nonclass (name
)
6038 return lookup_name_real (name
, 0, 1, 0);
6042 lookup_function_nonclass (name
, args
)
6046 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
6050 lookup_name_namespace_only (name
)
6053 /* type-or-namespace, nonclass, namespace_only */
6054 return lookup_name_real (name
, 1, 1, 1);
6058 lookup_name (name
, prefer_type
)
6062 return lookup_name_real (name
, prefer_type
, 0, 0);
6065 /* Similar to `lookup_name' but look only in the innermost non-class
6069 lookup_name_current_level (name
)
6072 struct binding_level
*b
;
6075 b
= current_binding_level
;
6076 while (b
->parm_flag
== 2)
6081 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
6083 /* extern "C" function() */
6084 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
6087 else if (IDENTIFIER_BINDING (name
)
6088 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
6092 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
6093 return IDENTIFIER_VALUE (name
);
6105 /* Like lookup_name_current_level, but for types. */
6108 lookup_type_current_level (name
)
6111 register tree t
= NULL_TREE
;
6113 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
6115 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
6116 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
6118 struct binding_level
*b
= current_binding_level
;
6121 if (purpose_member (name
, b
->type_shadowed
))
6122 return REAL_IDENTIFIER_TYPE_VALUE (name
);
6134 begin_only_namespace_names ()
6136 only_namespace_names
= 1;
6140 end_only_namespace_names ()
6142 only_namespace_names
= 0;
6145 /* Push the declarations of builtin types into the namespace.
6146 RID_INDEX is the index of the builtin type
6147 in the array RID_POINTERS. NAME is the name used when looking
6148 up the builtin type. TYPE is the _TYPE node for the builtin type. */
6151 record_builtin_type (rid_index
, name
, type
)
6156 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
6157 tree tdecl
= NULL_TREE
;
6159 if ((int) rid_index
< (int) RID_MAX
)
6160 rname
= ridpointers
[(int) rid_index
];
6162 tname
= get_identifier (name
);
6164 TYPE_BUILT_IN (type
) = 1;
6168 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
6169 set_identifier_type_value (tname
, NULL_TREE
);
6170 if ((int) rid_index
< (int) RID_MAX
)
6171 /* Built-in types live in the global namespace. */
6172 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
6174 if (rname
!= NULL_TREE
)
6176 if (tname
!= NULL_TREE
)
6178 set_identifier_type_value (rname
, NULL_TREE
);
6179 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
6183 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
6184 set_identifier_type_value (rname
, NULL_TREE
);
6189 /* Record one of the standard Java types.
6190 * Declare it as having the given NAME.
6191 * If SIZE > 0, it is the size of one of the integral types;
6192 * otherwise it is the negative of the size of one of the other types. */
6195 record_builtin_java_type (name
, size
)
6201 type
= make_signed_type (size
);
6202 else if (size
> -32)
6203 { /* "__java_char" or ""__java_boolean". */
6204 type
= make_unsigned_type (-size
);
6205 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
6208 { /* "__java_float" or ""__java_double". */
6209 type
= make_node (REAL_TYPE
);
6210 TYPE_PRECISION (type
) = - size
;
6213 record_builtin_type (RID_MAX
, name
, type
);
6214 decl
= TYPE_NAME (type
);
6216 /* Suppress generate debug symbol entries for these types,
6217 since for normal C++ they are just clutter.
6218 However, push_lang_context undoes this if extern "Java" is seen. */
6219 DECL_IGNORED_P (decl
) = 1;
6221 TYPE_FOR_JAVA (type
) = 1;
6225 /* Push a type into the namespace so that the back-ends ignore it. */
6228 record_unknown_type (type
, name
)
6232 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
6233 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
6234 DECL_IGNORED_P (decl
) = 1;
6235 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
6236 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
6237 TYPE_ALIGN (type
) = 1;
6238 TYPE_USER_ALIGN (type
) = 0;
6239 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
6242 /* An string for which we should create an IDENTIFIER_NODE at
6245 typedef struct predefined_identifier
6247 /* The name of the identifier. */
6249 /* The place where the IDENTIFIER_NODE should be stored. */
6251 /* Non-zero if this is the name of a constructor or destructor. */
6253 } predefined_identifier
;
6255 /* Create all the predefined identifiers. */
6258 initialize_predefined_identifiers ()
6260 struct predefined_identifier
*pid
;
6262 /* A table of identifiers to create at startup. */
6263 static predefined_identifier predefined_identifiers
[] = {
6264 { "C++", &lang_name_cplusplus
, 0 },
6265 { "C", &lang_name_c
, 0 },
6266 { "Java", &lang_name_java
, 0 },
6267 { CTOR_NAME
, &ctor_identifier
, 1 },
6268 { "__base_ctor", &base_ctor_identifier
, 1 },
6269 { "__comp_ctor", &complete_ctor_identifier
, 1 },
6270 { DTOR_NAME
, &dtor_identifier
, 1 },
6271 { "__comp_dtor", &complete_dtor_identifier
, 1 },
6272 { "__base_dtor", &base_dtor_identifier
, 1 },
6273 { "__deleting_dtor", &deleting_dtor_identifier
, 1 },
6274 { VTABLE_DELTA2_NAME
, &delta2_identifier
, 0 },
6275 { VTABLE_DELTA_NAME
, &delta_identifier
, 0 },
6276 { IN_CHARGE_NAME
, &in_charge_identifier
, 0 },
6277 { VTABLE_INDEX_NAME
, &index_identifier
, 0 },
6278 { "nelts", &nelts_identifier
, 0 },
6279 { THIS_NAME
, &this_identifier
, 0 },
6280 { VTABLE_PFN_NAME
, &pfn_identifier
, 0 },
6281 { "__pfn_or_delta2", &pfn_or_delta2_identifier
, 0 },
6282 { "_vptr", &vptr_identifier
, 0 },
6283 { "__cp_push_exception", &cp_push_exception_identifier
, 0 },
6284 { "__vtt_parm", &vtt_parm_identifier
, 0 },
6285 { "std", &std_identifier
, 0 },
6289 for (pid
= predefined_identifiers
; pid
->name
; ++pid
)
6291 *pid
->node
= get_identifier (pid
->name
);
6292 if (pid
->ctor_or_dtor_p
)
6293 IDENTIFIER_CTOR_OR_DTOR_P (*pid
->node
) = 1;
6297 /* Create the predefined scalar types of C,
6298 and some nodes representing standard constants (0, 1, (void *)0).
6299 Initialize the global binding level.
6300 Make definitions for built-in primitive functions. */
6303 init_decl_processing ()
6306 int wchar_type_size
;
6307 tree array_domain_type
;
6309 /* Check to see that the user did not specify an invalid combination
6310 of command-line options. */
6311 if (flag_new_abi
&& !flag_vtable_thunks
)
6312 fatal ("the new ABI requires vtable thunks");
6314 /* Create all the identifiers we need. */
6315 initialize_predefined_identifiers ();
6317 /* Fill in back-end hooks. */
6318 init_lang_status
= &push_cp_function_context
;
6319 free_lang_status
= &pop_cp_function_context
;
6320 mark_lang_status
= &mark_cp_function_context
;
6321 lang_safe_from_p
= &c_safe_from_p
;
6322 lang_dump_tree
= &cp_dump_tree
;
6328 /* Create the global variables. */
6329 push_to_top_level ();
6331 /* Enter the global namespace. */
6332 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
6333 push_namespace (get_identifier ("::"));
6334 global_namespace
= current_namespace
;
6335 current_lang_name
= NULL_TREE
;
6337 /* Adjust various flags based on command-line settings. */
6338 if (! flag_permissive
&& ! pedantic
)
6339 flag_pedantic_errors
= 1;
6340 if (!flag_no_inline
)
6341 flag_inline_trees
= 1;
6344 current_lang_name
= lang_name_c
;
6346 current_function_decl
= NULL_TREE
;
6347 current_binding_level
= NULL_BINDING_LEVEL
;
6348 free_binding_level
= NULL_BINDING_LEVEL
;
6350 build_common_tree_nodes (flag_signed_char
);
6352 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6353 TREE_TYPE (error_mark_list
) = error_mark_node
;
6355 /* Make the binding_level structure for global names. */
6357 global_binding_level
= current_binding_level
;
6358 /* The global level is the namespace level of ::. */
6359 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6360 declare_namespace_level ();
6362 /* Create the `std' namespace. */
6365 push_namespace (std_identifier
);
6366 std_node
= current_namespace
;
6368 fake_std_node
= error_mark_node
;
6372 fake_std_node
= build_decl (NAMESPACE_DECL
,
6375 pushdecl (fake_std_node
);
6378 /* Define `int' and `char' first so that dbx will output them first. */
6379 record_builtin_type (RID_INT
, NULL_PTR
, integer_type_node
);
6380 record_builtin_type (RID_CHAR
, "char", char_type_node
);
6382 /* `signed' is the same as `int' */
6383 record_builtin_type (RID_SIGNED
, NULL_PTR
, integer_type_node
);
6384 record_builtin_type (RID_LONG
, "long int", long_integer_type_node
);
6385 record_builtin_type (RID_UNSIGNED
, "unsigned int", unsigned_type_node
);
6386 record_builtin_type (RID_MAX
, "long unsigned int",
6387 long_unsigned_type_node
);
6388 record_builtin_type (RID_MAX
, "unsigned long", long_unsigned_type_node
);
6389 record_builtin_type (RID_MAX
, "long long int",
6390 long_long_integer_type_node
);
6391 record_builtin_type (RID_MAX
, "long long unsigned int",
6392 long_long_unsigned_type_node
);
6393 record_builtin_type (RID_MAX
, "long long unsigned",
6394 long_long_unsigned_type_node
);
6395 record_builtin_type (RID_SHORT
, "short int", short_integer_type_node
);
6396 record_builtin_type (RID_MAX
, "short unsigned int",
6397 short_unsigned_type_node
);
6398 record_builtin_type (RID_MAX
, "unsigned short",
6399 short_unsigned_type_node
);
6402 = TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (PTRDIFF_TYPE
)));
6403 unsigned_ptrdiff_type_node
= unsigned_type (ptrdiff_type_node
);
6405 /* Define both `signed char' and `unsigned char'. */
6406 record_builtin_type (RID_MAX
, "signed char", signed_char_type_node
);
6407 record_builtin_type (RID_MAX
, "unsigned char", unsigned_char_type_node
);
6409 /* `unsigned long' is the standard type for sizeof.
6410 Note that stddef.h uses `unsigned long',
6411 and this must agree, even if long and int are the same size. */
6413 TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (SIZE_TYPE
)));
6414 signed_size_type_node
= signed_type (c_size_type_node
);
6415 set_sizetype (c_size_type_node
);
6417 /* Create the widest literal types. */
6418 widest_integer_literal_type_node
= make_signed_type (HOST_BITS_PER_WIDE_INT
* 2);
6419 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6420 widest_integer_literal_type_node
));
6422 widest_unsigned_literal_type_node
= make_unsigned_type (HOST_BITS_PER_WIDE_INT
* 2);
6423 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
,
6424 widest_unsigned_literal_type_node
));
6426 /* These are types that type_for_size and type_for_mode use. */
6427 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intQI_type_node
));
6428 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intHI_type_node
));
6429 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intSI_type_node
));
6430 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, intDI_type_node
));
6431 #if HOST_BITS_PER_WIDE_INT >= 64
6432 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__int128_t"), intTI_type_node
));
6434 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intQI_type_node
));
6435 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intHI_type_node
));
6436 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intSI_type_node
));
6437 pushdecl (build_decl (TYPE_DECL
, NULL_TREE
, unsigned_intDI_type_node
));
6438 #if HOST_BITS_PER_WIDE_INT >= 64
6439 pushdecl (build_decl (TYPE_DECL
, get_identifier ("__uint128_t"), unsigned_intTI_type_node
));
6442 build_common_tree_nodes_2 (flag_short_double
);
6444 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6445 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6446 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6447 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6448 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6449 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6450 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6451 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6453 integer_two_node
= build_int_2 (2, 0);
6454 TREE_TYPE (integer_two_node
) = integer_type_node
;
6455 integer_three_node
= build_int_2 (3, 0);
6456 TREE_TYPE (integer_three_node
) = integer_type_node
;
6458 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6459 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6460 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6461 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6462 TYPE_PRECISION (boolean_type_node
) = 1;
6463 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6464 boolean_false_node
= build_int_2 (0, 0);
6465 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6466 boolean_true_node
= build_int_2 (1, 0);
6467 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6469 signed_size_zero_node
= build_int_2 (0, 0);
6470 record_builtin_type (RID_FLOAT
, NULL_PTR
, float_type_node
);
6471 record_builtin_type (RID_DOUBLE
, NULL_PTR
, double_type_node
);
6472 record_builtin_type (RID_MAX
, "long double", long_double_type_node
);
6474 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex int"),
6475 complex_integer_type_node
));
6476 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex float"),
6477 complex_float_type_node
));
6478 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex double"),
6479 complex_double_type_node
));
6480 pushdecl (build_decl (TYPE_DECL
, get_identifier ("complex long double"),
6481 complex_long_double_type_node
));
6483 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6485 record_builtin_type (RID_VOID
, NULL_PTR
, void_type_node
);
6486 void_list_node
= build_tree_list (NULL_TREE
, void_type_node
);
6487 TREE_PARMLIST (void_list_node
) = 1;
6489 string_type_node
= build_pointer_type (char_type_node
);
6490 const_string_type_node
6491 = build_pointer_type (build_qualified_type (char_type_node
,
6493 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6495 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
6498 /* Make a type to be the domain of a few array types
6499 whose domains don't really matter.
6500 200 is small enough that it always fits in size_t. */
6501 array_domain_type
= build_index_type (build_int_2 (200, 0));
6503 /* Make a type for arrays of characters.
6504 With luck nothing will ever really depend on the length of this
6506 char_array_type_node
6507 = build_array_type (char_type_node
, array_domain_type
);
6509 /* Likewise for arrays of ints. */
6511 = build_array_type (integer_type_node
, array_domain_type
);
6514 delta_type_node
= ptrdiff_type_node
;
6515 else if (flag_huge_objects
)
6516 delta_type_node
= long_integer_type_node
;
6518 delta_type_node
= short_integer_type_node
;
6521 vtable_index_type
= ptrdiff_type_node
;
6523 vtable_index_type
= delta_type_node
;
6525 default_function_type
6526 = build_function_type (integer_type_node
, NULL_TREE
);
6528 ptr_type_node
= build_pointer_type (void_type_node
);
6530 = build_pointer_type (build_qualified_type (void_type_node
,
6532 vtt_parm_type
= build_pointer_type (const_ptr_type_node
);
6533 c_common_nodes_and_builtins ();
6534 lang_type_promotes_to
= convert_type_from_ellipsis
;
6537 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6539 #ifdef MD_INIT_BUILTINS
6543 /* C++ extensions */
6545 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6546 record_unknown_type (unknown_type_node
, "unknown type");
6548 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6549 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6551 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6553 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6555 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6556 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6558 /* This is special for C++ so functions can be overloaded. */
6559 wchar_type_node
= get_identifier (flag_short_wchar
6560 ? "short unsigned int"
6562 wchar_type_node
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (wchar_type_node
));
6563 wchar_type_size
= TYPE_PRECISION (wchar_type_node
);
6564 if (TREE_UNSIGNED (wchar_type_node
))
6565 wchar_type_node
= make_signed_type (wchar_type_size
);
6567 wchar_type_node
= make_unsigned_type (wchar_type_size
);
6568 record_builtin_type (RID_WCHAR
, "wchar_t", wchar_type_node
);
6570 /* This is for wide string constants. */
6571 wchar_array_type_node
6572 = build_array_type (wchar_type_node
, array_domain_type
);
6575 TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (WINT_TYPE
)));
6578 TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (INTMAX_TYPE
)));
6580 TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (get_identifier (UINTMAX_TYPE
)));
6582 if (flag_vtable_thunks
)
6584 /* Make sure we get a unique function type, so we can give
6585 its pointer type a name. (This wins for gdb.) */
6586 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6587 TREE_TYPE (vfunc_type
) = integer_type_node
;
6588 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6589 layout_type (vfunc_type
);
6591 vtable_entry_type
= build_pointer_type (vfunc_type
);
6595 vtable_entry_type
= make_aggr_type (RECORD_TYPE
);
6596 fields
[0] = build_decl (FIELD_DECL
, delta_identifier
,
6598 fields
[1] = build_decl (FIELD_DECL
, index_identifier
,
6600 fields
[2] = build_decl (FIELD_DECL
, pfn_identifier
,
6602 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6605 /* Make this part of an invisible union. */
6606 fields
[3] = copy_node (fields
[2]);
6607 TREE_TYPE (fields
[3]) = delta_type_node
;
6608 DECL_NAME (fields
[3]) = delta2_identifier
;
6609 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6610 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6611 DECL_SIZE_UNIT (fields
[3]) = TYPE_SIZE_UNIT (delta_type_node
);
6612 TREE_UNSIGNED (fields
[3]) = 0;
6613 TREE_CHAIN (fields
[2]) = fields
[3];
6614 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6617 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6620 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6621 layout_type (vtbl_type_node
);
6622 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6623 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6624 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6625 layout_type (vtbl_ptr_type_node
);
6626 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6630 push_namespace (get_identifier ("__cxxabiv1"));
6631 abi_node
= current_namespace
;
6635 global_type_node
= make_node (LANG_TYPE
);
6636 record_unknown_type (global_type_node
, "global type");
6639 current_lang_name
= lang_name_cplusplus
;
6642 tree bad_alloc_type_node
, newtype
, deltype
;
6644 push_namespace (std_identifier
);
6645 bad_alloc_type_node
= xref_tag
6646 (class_type_node
, get_identifier ("bad_alloc"), 1);
6649 newtype
= build_exception_variant
6650 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6651 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6652 push_cp_library_fn (NEW_EXPR
, newtype
);
6653 push_cp_library_fn (VEC_NEW_EXPR
, newtype
);
6654 global_delete_fndecl
= push_cp_library_fn (DELETE_EXPR
, deltype
);
6655 push_cp_library_fn (VEC_DELETE_EXPR
, deltype
);
6659 = build_library_fn_ptr ((flag_new_abi
6660 ? "__cxa_pure_virtual"
6661 : "__pure_virtual"),
6664 /* Perform other language dependent initializations. */
6665 init_class_processing ();
6666 init_init_processing ();
6667 init_search_processing ();
6668 init_rtti_processing ();
6670 if (flag_exceptions
)
6671 init_exception_processing ();
6674 flag_inline_functions
= 0;
6677 if (! supports_one_only ())
6680 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6681 function_id_node
= get_identifier ("__FUNCTION__");
6682 pretty_function_id_node
= get_identifier ("__PRETTY_FUNCTION__");
6683 func_id_node
= get_identifier ("__func__");
6685 make_fname_decl
= cp_make_fname_decl
;
6686 declare_function_name ();
6688 /* Prepare to check format strings against argument lists. */
6689 init_function_format_info ();
6691 /* Show we use EH for cleanups. */
6692 using_eh_for_cleanups ();
6694 valid_lang_attribute
= cp_valid_lang_attribute
;
6696 /* Maintain consistency. Perhaps we should just complain if they
6697 say -fwritable-strings? */
6698 if (flag_writable_strings
)
6699 flag_const_strings
= 0;
6701 /* Add GC roots for all of our global variables. */
6702 ggc_add_tree_root (c_global_trees
, sizeof c_global_trees
/ sizeof(tree
));
6703 ggc_add_tree_root (cp_global_trees
, sizeof cp_global_trees
/ sizeof(tree
));
6704 ggc_add_tree_root (&integer_three_node
, 1);
6705 ggc_add_tree_root (&integer_two_node
, 1);
6706 ggc_add_tree_root (&signed_size_zero_node
, 1);
6707 ggc_add_tree_root (&size_one_node
, 1);
6708 ggc_add_tree_root (&size_zero_node
, 1);
6709 ggc_add_root (&global_binding_level
, 1, sizeof global_binding_level
,
6710 mark_binding_level
);
6711 ggc_add_root (&scope_chain
, 1, sizeof scope_chain
, &mark_saved_scope
);
6712 ggc_add_tree_root (&static_ctors
, 1);
6713 ggc_add_tree_root (&static_dtors
, 1);
6714 ggc_add_tree_root (&lastiddecl
, 1);
6716 ggc_add_tree_root (&last_function_parm_tags
, 1);
6717 ggc_add_tree_root (¤t_function_return_value
, 1);
6718 ggc_add_tree_root (¤t_function_parm_tags
, 1);
6719 ggc_add_tree_root (&last_function_parms
, 1);
6720 ggc_add_tree_root (&error_mark_list
, 1);
6722 ggc_add_tree_root (&global_namespace
, 1);
6723 ggc_add_tree_root (&global_type_node
, 1);
6724 ggc_add_tree_root (&anonymous_namespace_name
, 1);
6726 ggc_add_tree_root (&got_object
, 1);
6727 ggc_add_tree_root (&got_scope
, 1);
6729 ggc_add_tree_root (¤t_lang_name
, 1);
6730 ggc_add_tree_root (&static_aggregates
, 1);
6733 /* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the
6734 decl, NAME is the initialization string and TYPE_DEP indicates whether
6735 NAME depended on the type of the function. We make use of that to detect
6736 __PRETTY_FUNCTION__ inside a template fn. Because we build a tree for
6737 the function before emitting any of it, we don't need to treat the
6738 VAR_DECL specially. We can decide whether to emit it later, if it was
6742 cp_make_fname_decl (id
, name
, type_dep
)
6747 tree decl
, type
, init
;
6748 size_t length
= strlen (name
);
6749 tree domain
= NULL_TREE
;
6751 if (!processing_template_decl
)
6754 domain
= build_index_type (build_int_2 (length
, 0));
6756 type
= build_cplus_array_type
6757 (build_qualified_type (char_type_node
, TYPE_QUAL_CONST
),
6760 decl
= build_decl (VAR_DECL
, id
, type
);
6761 TREE_STATIC (decl
) = 1;
6762 TREE_READONLY (decl
) = 1;
6763 DECL_SOURCE_LINE (decl
) = 0;
6764 DECL_ARTIFICIAL (decl
) = 1;
6765 DECL_IN_SYSTEM_HEADER (decl
) = 1;
6767 if (processing_template_decl
)
6768 decl
= push_template_decl (decl
);
6771 init
= build (FUNCTION_NAME
, type
);
6772 DECL_PRETTY_FUNCTION_P (decl
) = 1;
6776 init
= build_string (length
+ 1, name
);
6777 TREE_TYPE (init
) = type
;
6779 DECL_INITIAL (decl
) = init
;
6780 cp_finish_decl (decl
, init
, NULL_TREE
, LOOKUP_ONLYCONVERTING
);
6782 /* We will have to make sure we only emit this, if it is actually used. */
6786 /* Entry point for the benefit of c_common_nodes_and_builtins.
6788 Make a definition for a builtin function named NAME and whose data type
6789 is TYPE. TYPE should be a function type with argument types.
6791 CLASS and CODE tell later passes how to compile calls to this function.
6792 See tree.h for possible values.
6794 If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6795 the name to be called if we can't opencode the function. */
6798 builtin_function (name
, type
, code
, class, libname
)
6802 enum built_in_class
class;
6803 const char *libname
;
6805 tree decl
= build_library_fn_1 (get_identifier (name
), ERROR_MARK
, type
);
6806 DECL_BUILT_IN_CLASS (decl
) = class;
6807 DECL_FUNCTION_CODE (decl
) = code
;
6809 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6811 /* All builtins that don't begin with an `_' should go in the `std'
6813 if (flag_honor_std
&& name
[0] != '_')
6815 push_namespace (std_identifier
);
6816 DECL_CONTEXT (decl
) = std_node
;
6819 if (flag_honor_std
&& name
[0] != '_')
6822 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6823 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6824 function in the namespace. */
6826 DECL_ASSEMBLER_NAME (decl
) = get_identifier (libname
);
6827 make_function_rtl (decl
);
6829 /* Warn if a function in the namespace for users
6830 is used without an occasion to consider it declared. */
6831 if (name
[0] != '_' || name
[1] != '_')
6832 DECL_ANTICIPATED (decl
) = 1;
6837 /* Generate a FUNCTION_DECL with the typical flags for a runtime library
6838 function. Not called directly. */
6841 build_library_fn_1 (name
, operator_code
, type
)
6843 enum tree_code operator_code
;
6846 tree fn
= build_lang_decl (FUNCTION_DECL
, name
, type
);
6847 DECL_EXTERNAL (fn
) = 1;
6848 TREE_PUBLIC (fn
) = 1;
6849 DECL_ARTIFICIAL (fn
) = 1;
6850 TREE_NOTHROW (fn
) = 1;
6851 SET_OVERLOADED_OPERATOR_CODE (fn
, operator_code
);
6855 /* Returns the _DECL for a library function with C linkage.
6856 We assume that such functions never throw; if this is incorrect,
6857 callers should unset TREE_NOTHROW. */
6860 build_library_fn (name
, type
)
6864 tree fn
= build_library_fn_1 (name
, ERROR_MARK
, type
);
6865 make_function_rtl (fn
);
6869 /* Returns the _DECL for a library function with C++ linkage. */
6872 build_cp_library_fn (name
, operator_code
, type
)
6874 enum tree_code operator_code
;
6877 tree fn
= build_library_fn_1 (name
, operator_code
, type
);
6878 TREE_NOTHROW (fn
) = TYPE_NOTHROW_P (type
);
6879 DECL_CONTEXT (fn
) = FROB_CONTEXT (current_namespace
);
6880 set_mangled_name_for_decl (fn
);
6881 make_function_rtl (fn
);
6885 /* Like build_library_fn, but takes a C string instead of an
6889 build_library_fn_ptr (name
, type
)
6893 return build_library_fn (get_identifier (name
), type
);
6896 /* Like build_cp_library_fn, but takes a C string instead of an
6900 build_cp_library_fn_ptr (name
, type
)
6904 return build_cp_library_fn (get_identifier (name
), ERROR_MARK
, type
);
6907 /* Like build_library_fn, but also pushes the function so that we will
6908 be able to find it via IDENTIFIER_GLOBAL_VALUE. */
6911 push_library_fn (name
, type
)
6914 tree fn
= build_library_fn (name
, type
);
6915 pushdecl_top_level (fn
);
6919 /* Like build_cp_library_fn, but also pushes the function so that it
6920 will be found by normal lookup. */
6923 push_cp_library_fn (operator_code
, type
)
6924 enum tree_code operator_code
;
6927 tree fn
= build_cp_library_fn (ansi_opname (operator_code
),
6934 /* Like push_library_fn, but takes a TREE_LIST of parm types rather than
6938 push_void_library_fn (name
, parmtypes
)
6939 tree name
, parmtypes
;
6941 tree type
= build_function_type (void_type_node
, parmtypes
);
6942 return push_library_fn (name
, type
);
6945 /* Like push_library_fn, but also note that this function throws
6946 and does not return. Used for __throw_foo and the like. */
6949 push_throw_library_fn (name
, type
)
6952 tree fn
= push_library_fn (name
, type
);
6953 TREE_THIS_VOLATILE (fn
) = 1;
6954 TREE_NOTHROW (fn
) = 0;
6958 /* When we call finish_struct for an anonymous union, we create
6959 default copy constructors and such. But, an anonymous union
6960 shouldn't have such things; this function undoes the damage to the
6961 anonymous union type T.
6963 (The reason that we create the synthesized methods is that we don't
6964 distinguish `union { int i; }' from `typedef union { int i; } U'.
6965 The first is an anonymous union; the second is just an ordinary
6969 fixup_anonymous_aggr (t
)
6974 /* Wipe out memory of synthesized methods */
6975 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6976 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6977 TYPE_HAS_INIT_REF (t
) = 0;
6978 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6979 TYPE_HAS_ASSIGN_REF (t
) = 0;
6980 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6982 /* Splice the implicitly generated functions out of the TYPE_METHODS
6984 q
= &TYPE_METHODS (t
);
6987 if (DECL_ARTIFICIAL (*q
))
6988 *q
= TREE_CHAIN (*q
);
6990 q
= &TREE_CHAIN (*q
);
6993 /* ISO C++ 9.5.3. Anonymous unions may not have function members. */
6994 if (TYPE_METHODS (t
))
6995 error ("an anonymous union cannot have function members");
6998 /* Make sure that a declaration with no declarator is well-formed, i.e.
6999 just defines a tagged type or anonymous union.
7001 Returns the type defined, if any. */
7004 check_tag_decl (declspecs
)
7009 tree ob_modifier
= NULL_TREE
;
7011 register tree t
= NULL_TREE
;
7013 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
7015 register tree value
= TREE_VALUE (link
);
7018 || (TREE_CODE (value
) == IDENTIFIER_NODE
7019 && IDENTIFIER_GLOBAL_VALUE (value
)
7020 && TYPE_P (IDENTIFIER_GLOBAL_VALUE (value
))))
7024 if ((TREE_CODE (value
) != TYPENAME_TYPE
&& IS_AGGR_TYPE (value
))
7025 || TREE_CODE (value
) == ENUMERAL_TYPE
)
7027 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
7031 else if (value
== ridpointers
[(int) RID_FRIEND
])
7033 if (current_class_type
== NULL_TREE
7034 || current_scope () != current_class_type
)
7035 ob_modifier
= value
;
7039 else if (value
== ridpointers
[(int) RID_STATIC
]
7040 || value
== ridpointers
[(int) RID_EXTERN
]
7041 || value
== ridpointers
[(int) RID_AUTO
]
7042 || value
== ridpointers
[(int) RID_REGISTER
]
7043 || value
== ridpointers
[(int) RID_INLINE
]
7044 || value
== ridpointers
[(int) RID_VIRTUAL
]
7045 || value
== ridpointers
[(int) RID_CONST
]
7046 || value
== ridpointers
[(int) RID_VOLATILE
]
7047 || value
== ridpointers
[(int) RID_EXPLICIT
])
7048 ob_modifier
= value
;
7052 error ("multiple types in one declaration");
7054 if (t
== NULL_TREE
&& ! saw_friend
)
7055 pedwarn ("declaration does not declare anything");
7057 /* Check for an anonymous union. We're careful
7058 accessing TYPE_IDENTIFIER because some built-in types, like
7059 pointer-to-member types, do not have TYPE_NAME. */
7060 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
7062 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
7064 /* Anonymous unions are objects, so they can have specifiers. */;
7065 SET_ANON_AGGR_TYPE_P (t
);
7067 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
7068 pedwarn ("ISO C++ prohibits anonymous structs");
7071 else if (ob_modifier
)
7073 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
7074 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
7075 cp_error ("`%D' can only be specified for functions", ob_modifier
);
7076 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
7077 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
7078 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
7079 cp_error ("`%D' can only be specified for constructors",
7082 cp_error ("`%D' can only be specified for objects and functions",
7089 /* Called when a declaration is seen that contains no names to declare.
7090 If its type is a reference to a structure, union or enum inherited
7091 from a containing scope, shadow that tag name for the current scope
7092 with a forward reference.
7093 If its type defines a new named structure or union
7094 or defines an enum, it is valid but we need not do anything here.
7095 Otherwise, it is an error.
7097 C++: may have to grok the declspecs to learn about static,
7098 complain for anonymous unions. */
7101 shadow_tag (declspecs
)
7104 tree t
= check_tag_decl (declspecs
);
7107 maybe_process_partial_specialization (t
);
7109 /* This is where the variables in an anonymous union are
7110 declared. An anonymous union declaration looks like:
7112 because there is no declarator after the union, the parser
7113 sends that declaration here. */
7114 if (t
&& ANON_AGGR_TYPE_P (t
))
7116 fixup_anonymous_aggr (t
);
7118 if (TYPE_FIELDS (t
))
7120 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
7122 finish_anon_union (decl
);
7127 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
7130 groktypename (typename
)
7133 if (TREE_CODE (typename
) != TREE_LIST
)
7135 return grokdeclarator (TREE_VALUE (typename
),
7136 TREE_PURPOSE (typename
),
7137 TYPENAME
, 0, NULL_TREE
);
7140 /* Decode a declarator in an ordinary declaration or data definition.
7141 This is called as soon as the type information and variable name
7142 have been parsed, before parsing the initializer if any.
7143 Here we create the ..._DECL node, fill in its type,
7144 and put it on the list of decls for the current context.
7145 The ..._DECL node is returned as the value.
7147 Exception: for arrays where the length is not specified,
7148 the type is left null, to be filled in by `cp_finish_decl'.
7150 Function definitions do not come here; they go to start_function
7151 instead. However, external and forward declarations of functions
7152 do go through here. Structure field declarations are done by
7153 grokfield and not through here. */
7156 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
7157 tree declarator
, declspecs
;
7159 tree attributes
, prefix_attributes
;
7162 register tree type
, tem
;
7164 extern int have_extern_spec
;
7165 extern int used_extern_spec
;
7169 /* See code below that used this. */
7170 int init_written
= initialized
;
7173 /* This should only be done once on the top most decl. */
7174 if (have_extern_spec
&& !used_extern_spec
)
7176 declspecs
= tree_cons (NULL_TREE
, get_identifier ("extern"),
7178 used_extern_spec
= 1;
7181 if (attributes
|| prefix_attributes
)
7182 attrlist
= build_tree_list (attributes
, prefix_attributes
);
7184 attrlist
= NULL_TREE
;
7186 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
7189 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
7192 type
= TREE_TYPE (decl
);
7194 if (type
== error_mark_node
)
7197 context
= DECL_CONTEXT (decl
);
7199 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
7200 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
7202 /* When parsing the initializer, lookup should use the object's
7204 push_decl_namespace (context
);
7207 /* We are only interested in class contexts, later. */
7208 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
7209 context
= NULL_TREE
;
7212 /* Is it valid for this decl to have an initializer at all?
7213 If not, set INITIALIZED to zero, which will indirectly
7214 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7215 switch (TREE_CODE (decl
))
7218 /* typedef foo = bar means give foo the same type as bar.
7219 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
7220 Any other case of an initialization in a TYPE_DECL is an error. */
7221 if (pedantic
|| list_length (declspecs
) > 1)
7223 cp_error ("typedef `%D' is initialized", decl
);
7229 cp_error ("function `%#D' is initialized like a variable", decl
);
7239 if (! toplevel_bindings_p ()
7240 && DECL_EXTERNAL (decl
))
7241 cp_warning ("declaration of `%#D' has `extern' and is initialized",
7243 DECL_EXTERNAL (decl
) = 0;
7244 if (toplevel_bindings_p ())
7245 TREE_STATIC (decl
) = 1;
7247 /* Tell `pushdecl' this is an initialized decl
7248 even though we don't yet have the initializer expression.
7249 Also tell `cp_finish_decl' it may store the real initializer. */
7250 DECL_INITIAL (decl
) = error_mark_node
;
7253 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
7254 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
7257 /* Set attributes here so if duplicate decl, will have proper attributes. */
7258 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
7260 if (context
&& COMPLETE_TYPE_P (complete_type (context
)))
7262 push_nested_class (context
, 2);
7264 if (TREE_CODE (decl
) == VAR_DECL
)
7266 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
7267 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
7268 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
7271 if (DECL_CONTEXT (field
) != context
)
7273 cp_pedwarn ("ISO C++ does not permit `%T::%D' to be defined as `%T::%D'",
7274 DECL_CONTEXT (field
), DECL_NAME (decl
),
7275 context
, DECL_NAME (decl
));
7276 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
7278 /* Static data member are tricky; an in-class initialization
7279 still doesn't provide a definition, so the in-class
7280 declaration will have DECL_EXTERNAL set, but will have an
7281 initialization. Thus, duplicate_decls won't warn
7282 about this situation, and so we check here. */
7283 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
7284 cp_error ("duplicate initialization of %D", decl
);
7285 if (duplicate_decls (decl
, field
))
7291 tree field
= check_classfn (context
, decl
);
7292 if (field
&& duplicate_decls (decl
, field
))
7296 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
7297 DECL_IN_AGGR_P (decl
) = 0;
7298 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
7299 || CLASSTYPE_TEMPLATE_INSTANTIATION (context
))
7301 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
7302 /* [temp.expl.spec] An explicit specialization of a static data
7303 member of a template is a definition if the declaration
7304 includes an initializer; otherwise, it is a declaration.
7306 We check for processing_specialization so this only applies
7307 to the new specialization syntax. */
7308 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
7309 DECL_EXTERNAL (decl
) = 1;
7312 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
7313 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
7317 /* Enter this declaration into the symbol table. */
7318 tem
= maybe_push_decl (decl
);
7320 if (processing_template_decl
)
7321 tem
= push_template_decl (tem
);
7323 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7324 /* Tell the back-end to use or not use .common as appropriate. If we say
7325 -fconserve-space, we want this to save .data space, at the expense of
7326 wrong semantics. If we say -fno-conserve-space, we want this to
7327 produce errors about redefs; to do this we force variables into the
7329 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
7332 if (! processing_template_decl
)
7342 tree type
= TREE_TYPE (decl
);
7343 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
7345 if (type
== error_mark_node
)
7348 /* If this type of object needs a cleanup, but we're not allowed to
7349 add any more objects with cleanups to the current scope, create a
7350 new binding level. */
7351 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
7352 && current_binding_level
->more_cleanups_ok
== 0)
7354 keep_next_level (2);
7357 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/1);
7361 /* Is it valid for this decl to have an initializer at all?
7362 If not, set INITIALIZED to zero, which will indirectly
7363 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7365 /* Don't allow initializations for incomplete types except for
7366 arrays which might be completed by the initialization. */
7367 if (COMPLETE_TYPE_P (complete_type (type
)))
7368 ; /* A complete type is ok. */
7369 else if (TREE_CODE (type
) != ARRAY_TYPE
)
7371 cp_error ("variable `%#D' has initializer but incomplete type",
7374 type
= TREE_TYPE (decl
) = error_mark_node
;
7376 else if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (type
))))
7378 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
7379 cp_error ("elements of array `%#D' have incomplete type", decl
);
7380 /* else we already gave an error in start_decl. */
7386 && TREE_CODE (decl
) != TYPE_DECL
7387 && TREE_CODE (decl
) != TEMPLATE_DECL
7388 && type
!= error_mark_node
7389 && IS_AGGR_TYPE (type
)
7390 && ! DECL_EXTERNAL (decl
))
7392 if ((! processing_template_decl
|| ! uses_template_parms (type
))
7393 && !COMPLETE_TYPE_P (complete_type (type
)))
7395 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
7397 /* Change the type so that assemble_variable will give
7398 DECL an rtl we can live with: (mem (const_int 0)). */
7399 type
= TREE_TYPE (decl
) = error_mark_node
;
7403 /* If any base type in the hierarchy of TYPE needs a constructor,
7404 then we set initialized to 1. This way any nodes which are
7405 created for the purposes of initializing this aggregate
7406 will live as long as it does. This is necessary for global
7407 aggregates which do not have their initializers processed until
7408 the end of the file. */
7409 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
7414 DECL_INITIAL (decl
) = NULL_TREE
;
7417 /* Handle initialization of references.
7418 These three arguments are from `cp_finish_decl', and have the
7419 same meaning here that they do there.
7421 Quotes on semantics can be found in ARM 8.4.3. */
7424 grok_reference_init (decl
, type
, init
)
7425 tree decl
, type
, init
;
7429 if (init
== NULL_TREE
)
7431 if ((DECL_LANG_SPECIFIC (decl
) == 0
7432 || DECL_IN_AGGR_P (decl
) == 0)
7433 && ! DECL_THIS_EXTERN (decl
))
7434 cp_error ("`%D' declared as reference but not initialized", decl
);
7438 if (init
== error_mark_node
)
7441 if (TREE_CODE (init
) == CONSTRUCTOR
)
7443 cp_error ("ISO C++ forbids use of initializer list to initialize reference `%D'", decl
);
7447 if (TREE_CODE (init
) == TREE_LIST
)
7448 init
= build_compound_expr (init
);
7450 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
7451 init
= convert_from_reference (init
);
7453 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
7454 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
7456 /* Note: default conversion is only called in very special cases. */
7457 init
= default_conversion (init
);
7460 /* Convert INIT to the reference type TYPE. This may involve the
7461 creation of a temporary, whose lifetime must be the same as that
7462 of the reference. If so, a DECL_STMT for the temporary will be
7463 added just after the DECL_STMT for DECL. That's why we don't set
7464 DECL_INITIAL for local references (instead assigning to them
7465 explicitly); we need to allow the temporary to be initialized
7467 tmp
= convert_to_reference
7468 (type
, init
, CONV_IMPLICIT
,
7469 LOOKUP_ONLYCONVERTING
|LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
,
7472 if (tmp
== error_mark_node
)
7474 else if (tmp
!= NULL_TREE
)
7477 tmp
= save_expr (tmp
);
7478 if (building_stmt_tree ())
7480 /* Initialize the declaration. */
7481 tmp
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, tmp
);
7482 finish_expr_stmt (tmp
);
7485 DECL_INITIAL (decl
) = tmp
;
7489 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7493 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
7495 expand_static_init (decl
, DECL_INITIAL (decl
));
7496 DECL_INITIAL (decl
) = NULL_TREE
;
7501 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7502 mucking with forces it does not comprehend (i.e. initialization with a
7503 constructor). If we are at global scope and won't go into COMMON, fill
7504 it in with a dummy CONSTRUCTOR to force the variable into .data;
7505 otherwise we can use error_mark_node. */
7508 obscure_complex_init (decl
, init
)
7511 if (! flag_no_inline
&& TREE_STATIC (decl
))
7513 if (extract_init (decl
, init
))
7517 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7518 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7519 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7523 DECL_INITIAL (decl
) = error_mark_node
;
7528 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7529 array until we finish parsing the initializer. If that's the
7530 situation we're in, update DECL accordingly. */
7533 maybe_deduce_size_from_array_init (decl
, init
)
7537 tree type
= TREE_TYPE (decl
);
7539 if (TREE_CODE (type
) == ARRAY_TYPE
7540 && TYPE_DOMAIN (type
) == NULL_TREE
7541 && TREE_CODE (decl
) != TYPE_DECL
)
7543 /* do_default is really a C-ism to deal with tentative definitions.
7544 But let's leave it here to ease the eventual merge. */
7545 int do_default
= !DECL_EXTERNAL (decl
);
7546 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7547 int failure
= complete_array_type (type
, initializer
, do_default
);
7550 cp_error ("initializer fails to determine size of `%D'", decl
);
7555 cp_error ("array size missing in `%D'", decl
);
7556 /* If a `static' var's size isn't known, make it extern as
7557 well as static, so it does not get allocated. If it's not
7558 `static', then don't mark it extern; finish_incomplete_decl
7559 will give it a default size and it will get allocated. */
7560 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7561 DECL_EXTERNAL (decl
) = 1;
7564 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7565 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7567 cp_error ("zero-size array `%D'", decl
);
7569 layout_decl (decl
, 0);
7573 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7574 any appropriate error messages regarding the layout. */
7577 layout_var_decl (decl
)
7580 tree type
= TREE_TYPE (decl
);
7582 tree ttype
= target_type (type
);
7585 /* If we haven't already layed out this declaration, do so now.
7586 Note that we must not call complete type for an external object
7587 because it's type might involve templates that we are not
7588 supposed to isntantiate yet. (And it's perfectly legal to say
7589 `extern X x' for some incomplete type `X'.) */
7590 if (!DECL_EXTERNAL (decl
))
7591 complete_type (type
);
7592 if (!DECL_SIZE (decl
) && COMPLETE_TYPE_P (type
))
7593 layout_decl (decl
, 0);
7595 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7597 /* An automatic variable with an incomplete type: that is an error.
7598 Don't talk about array types here, since we took care of that
7599 message in grokdeclarator. */
7600 cp_error ("storage size of `%D' isn't known", decl
);
7601 TREE_TYPE (decl
) = error_mark_node
;
7604 /* Keep this code around in case we later want to control debug info
7605 based on whether a type is "used". (jason 1999-11-11) */
7607 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7608 /* Let debugger know it should output info for this type. */
7609 note_debug_info_needed (ttype
);
7611 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7612 note_debug_info_needed (DECL_CONTEXT (decl
));
7615 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7616 && DECL_SIZE (decl
) != NULL_TREE
7617 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7619 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7620 constant_expression_warning (DECL_SIZE (decl
));
7622 cp_error ("storage size of `%D' isn't constant", decl
);
7626 /* If a local static variable is declared in an inline function, or if
7627 we have a weak definition, we must endeavor to create only one
7628 instance of the variable at link-time. */
7631 maybe_commonize_var (decl
)
7634 /* Static data in a function with comdat linkage also has comdat
7636 if (TREE_STATIC (decl
)
7637 /* Don't mess with __FUNCTION__. */
7638 && ! DECL_ARTIFICIAL (decl
)
7639 && current_function_decl
7640 && DECL_CONTEXT (decl
) == current_function_decl
7641 && (DECL_THIS_INLINE (current_function_decl
)
7642 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7643 && TREE_PUBLIC (current_function_decl
))
7645 /* Rather than try to get this right with inlining, we suppress
7646 inlining of such functions. */
7647 current_function_cannot_inline
7648 = "function with static variable cannot be inline";
7649 DECL_UNINLINABLE (current_function_decl
) = 1;
7651 /* If flag_weak, we don't need to mess with this, as we can just
7652 make the function weak, and let it refer to its unique local
7653 copy. This works because we don't allow the function to be
7657 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7659 TREE_PUBLIC (decl
) = 1;
7660 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7662 else if (DECL_INITIAL (decl
) == NULL_TREE
7663 || DECL_INITIAL (decl
) == error_mark_node
)
7665 TREE_PUBLIC (decl
) = 1;
7666 DECL_COMMON (decl
) = 1;
7668 /* else we lose. We can only do this if we can use common,
7669 which we can't if it has been initialized. */
7671 if (TREE_PUBLIC (decl
))
7672 DECL_ASSEMBLER_NAME (decl
)
7673 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7676 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7677 cp_warning_at (" you can work around this by removing the initializer", decl
);
7681 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7682 /* Set it up again; we might have set DECL_INITIAL since the last
7684 comdat_linkage (decl
);
7687 /* Issue an error message if DECL is an uninitialized const variable. */
7690 check_for_uninitialized_const_var (decl
)
7693 tree type
= TREE_TYPE (decl
);
7695 /* ``Unless explicitly declared extern, a const object does not have
7696 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7698 if (TREE_CODE (decl
) == VAR_DECL
7699 && TREE_CODE (type
) != REFERENCE_TYPE
7700 && CP_TYPE_CONST_P (type
)
7701 && !TYPE_NEEDS_CONSTRUCTING (type
)
7702 && !DECL_INITIAL (decl
))
7703 cp_error ("uninitialized const `%D'", decl
);
7706 /* Verify INIT (the initializer for DECL), and record the
7707 initialization in DECL_INITIAL, if appropriate. Returns a new
7711 check_initializer (decl
, init
)
7717 if (TREE_CODE (decl
) == FIELD_DECL
)
7720 type
= TREE_TYPE (decl
);
7722 /* If `start_decl' didn't like having an initialization, ignore it now. */
7723 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7726 /* Check the initializer. */
7729 /* Things that are going to be initialized need to have complete
7731 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7733 if (type
== error_mark_node
)
7734 /* We will have already complained. */
7736 else if (COMPLETE_TYPE_P (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7738 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7741 else if (TREE_CODE (type
) == ARRAY_TYPE
7742 && !COMPLETE_TYPE_P (TREE_TYPE (type
)))
7744 cp_error ("elements of array `%#D' have incomplete type", decl
);
7747 else if (!COMPLETE_TYPE_P (type
))
7749 cp_error ("`%D' has incomplete type", decl
);
7750 TREE_TYPE (decl
) = error_mark_node
;
7755 if (TREE_CODE (decl
) == CONST_DECL
)
7757 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7759 DECL_INITIAL (decl
) = init
;
7761 /* This will keep us from needing to worry about our obstacks. */
7762 my_friendly_assert (init
!= NULL_TREE
, 149);
7765 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7767 if (TREE_STATIC (decl
))
7768 make_decl_rtl (decl
, NULL_PTR
, toplevel_bindings_p ());
7769 grok_reference_init (decl
, type
, init
);
7774 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7776 if (TREE_CODE (type
) == ARRAY_TYPE
)
7777 init
= digest_init (type
, init
, (tree
*) 0);
7778 else if (TREE_CODE (init
) == CONSTRUCTOR
7779 && TREE_HAS_CONSTRUCTOR (init
))
7781 if (TYPE_NON_AGGREGATE_CLASS (type
))
7783 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7785 init
= error_mark_node
;
7788 goto dont_use_constructor
;
7793 dont_use_constructor
:
7794 if (TREE_CODE (init
) != TREE_VEC
)
7795 init
= store_init_value (decl
, init
);
7799 /* We must hide the initializer so that expand_decl
7800 won't try to do something it does not understand. */
7801 init
= obscure_complex_init (decl
, init
);
7803 else if (DECL_EXTERNAL (decl
))
7805 else if (TYPE_P (type
)
7806 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7808 tree core_type
= strip_array_types (type
);
7810 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7812 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7813 cp_error ("structure `%D' with uninitialized const members", decl
);
7814 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7815 cp_error ("structure `%D' with uninitialized reference members",
7819 check_for_uninitialized_const_var (decl
);
7821 if (COMPLETE_TYPE_P (type
) && TYPE_NEEDS_CONSTRUCTING (type
))
7822 init
= obscure_complex_init (decl
, NULL_TREE
);
7826 check_for_uninitialized_const_var (decl
);
7831 /* If DECL is not a local variable, give it RTL. */
7834 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
7837 const char *asmspec
;
7839 int toplev
= toplevel_bindings_p ();
7842 /* Handle non-variables up front. */
7843 if (TREE_CODE (decl
) != VAR_DECL
)
7845 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7849 /* If we see a class member here, it should be a static data
7851 if (DECL_LANG_SPECIFIC (decl
) && DECL_IN_AGGR_P (decl
))
7853 my_friendly_assert (TREE_STATIC (decl
), 19990828);
7854 /* An in-class declaration of a static data member should be
7855 external; it is only a declaration, and not a definition. */
7856 if (init
== NULL_TREE
)
7857 my_friendly_assert (DECL_EXTERNAL (decl
), 20000723);
7860 /* Set the DECL_ASSEMBLER_NAME for the variable. */
7862 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7864 /* We don't create any RTL for local variables. */
7865 if (DECL_FUNCTION_SCOPE_P (decl
) && !TREE_STATIC (decl
))
7868 /* We defer emission of local statics until the corresponding
7869 DECL_STMT is expanded. */
7870 defer_p
= DECL_FUNCTION_SCOPE_P (decl
) || DECL_VIRTUAL_P (decl
);
7872 /* We try to defer namespace-scope static constants so that they are
7873 not emitted into the object file unncessarily. */
7874 if (!DECL_VIRTUAL_P (decl
)
7875 && TREE_READONLY (decl
)
7876 && DECL_INITIAL (decl
) != NULL_TREE
7877 && DECL_INITIAL (decl
) != error_mark_node
7878 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
))
7880 && !TREE_PUBLIC (decl
))
7882 /* Fool with the linkage according to #pragma interface. */
7883 if (!interface_unknown
)
7885 TREE_PUBLIC (decl
) = 1;
7886 DECL_EXTERNAL (decl
) = interface_only
;
7892 /* If we're deferring the variable, just make RTL. Do not actually
7893 emit the variable. */
7895 make_decl_rtl (decl
, asmspec
, toplev
);
7896 /* If we're not deferring, go ahead and assemble the variable. */
7898 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7901 /* The old ARM scoping rules injected variables declared in the
7902 initialization statement of a for-statement into the surrounding
7903 scope. We support this usage, in order to be backward-compatible.
7904 DECL is a just-declared VAR_DECL; if necessary inject its
7905 declaration into the surrounding scope. */
7908 maybe_inject_for_scope_var (decl
)
7911 if (!DECL_NAME (decl
))
7914 if (current_binding_level
->is_for_scope
)
7916 struct binding_level
*outer
7917 = current_binding_level
->level_chain
;
7919 /* Check to see if the same name is already bound at the outer
7920 level, either because it was directly declared, or because a
7921 dead for-decl got preserved. In either case, the code would
7922 not have been valid under the ARM scope rules, so clear
7923 is_for_scope for the current_binding_level.
7925 Otherwise, we need to preserve the temp slot for decl to last
7926 into the outer binding level. */
7929 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7931 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7932 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7934 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7936 BINDING_VALUE (outer_binding
)
7937 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7938 current_binding_level
->is_for_scope
= 0;
7940 else if (DECL_IN_MEMORY_P (decl
))
7941 preserve_temp_slots (DECL_RTL (decl
));
7945 /* Generate code to initialize DECL (a local variable). */
7948 initialize_local_var (decl
, init
, flags
)
7953 tree type
= TREE_TYPE (decl
);
7955 /* If the type is bogus, don't bother initializing the variable. */
7956 if (type
== error_mark_node
)
7959 if (DECL_SIZE (decl
) == NULL_TREE
&& !TREE_STATIC (decl
))
7961 /* If we used it already as memory, it must stay in memory. */
7962 DECL_INITIAL (decl
) = NULL_TREE
;
7963 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7966 /* Local statics are handled differently from ordinary automatic
7968 if (TREE_STATIC (decl
))
7970 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7971 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7972 expand_static_init (decl
, init
);
7976 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7980 /* Compute and store the initial value. */
7981 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7983 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7985 int saved_stmts_are_full_exprs_p
;
7987 my_friendly_assert (building_stmt_tree (), 20000906);
7988 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p ();
7989 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
7990 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7991 current_stmt_tree ()->stmts_are_full_exprs_p
=
7992 saved_stmts_are_full_exprs_p
;
7995 /* Set this to 0 so we can tell whether an aggregate which was
7996 initialized was ever used. Don't do this if it has a
7997 destructor, so we don't complain about the 'resource
7998 allocation is initialization' idiom. Now set
7999 attribute((unused)) on types so decls of that type will be
8000 marked used. (see TREE_USED, above.) */
8001 if (TYPE_NEEDS_CONSTRUCTING (type
)
8003 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type
)
8004 && DECL_NAME (decl
))
8005 TREE_USED (decl
) = 0;
8006 else if (already_used
)
8007 TREE_USED (decl
) = 1;
8011 /* Generate code to destroy DECL (a local variable). */
8014 destroy_local_var (decl
)
8017 tree type
= TREE_TYPE (decl
);
8020 /* Only variables get cleaned up. */
8021 if (TREE_CODE (decl
) != VAR_DECL
)
8024 /* And only things with destructors need cleaning up. */
8025 if (type
== error_mark_node
8026 || TYPE_HAS_TRIVIAL_DESTRUCTOR (type
))
8029 if (TREE_CODE (decl
) == VAR_DECL
&&
8030 (DECL_EXTERNAL (decl
) || TREE_STATIC (decl
)))
8031 /* We don't clean up things that aren't defined in this
8032 translation unit, or that need a static cleanup. The latter
8033 are handled by finish_file. */
8036 /* Compute the cleanup. */
8037 cleanup
= maybe_build_cleanup (decl
);
8039 /* Record the cleanup required for this declaration. */
8040 if (DECL_SIZE (decl
) && TREE_TYPE (decl
) != error_mark_node
8042 finish_decl_cleanup (decl
, cleanup
);
8045 /* Finish processing of a declaration;
8046 install its line number and initial value.
8047 If the length of an array type is not known before,
8048 it must be determined now, from the initial value, or it is an error.
8050 INIT holds the value of an initializer that should be allowed to escape
8053 FLAGS is LOOKUP_ONLYCONVERTING if the = init syntax was used, else 0
8054 if the (init) syntax was used. */
8057 cp_finish_decl (decl
, init
, asmspec_tree
, flags
)
8063 tree ttype
= NULL_TREE
;
8064 const char *asmspec
= NULL
;
8065 int was_readonly
= 0;
8070 error ("assignment (not initialization) in declaration");
8074 /* If a name was specified, get the string. */
8076 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
8078 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
8080 cp_error ("cannot initialize `%D' to namespace `%D'",
8085 if (current_class_type
8086 && CP_DECL_CONTEXT (decl
) == current_class_type
8087 && TYPE_BEING_DEFINED (current_class_type
)
8088 && (DECL_INITIAL (decl
) || init
))
8089 DECL_DEFINED_IN_CLASS_P (decl
) = 1;
8091 if (TREE_CODE (decl
) == VAR_DECL
8092 && DECL_CONTEXT (decl
)
8093 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
8094 && DECL_CONTEXT (decl
) != current_namespace
8097 /* Leave the namespace of the object. */
8098 pop_decl_namespace ();
8101 type
= TREE_TYPE (decl
);
8103 if (type
== error_mark_node
)
8106 /* Add this declaration to the statement-tree. */
8107 if (building_stmt_tree ()
8108 && at_function_scope_p ()
8109 && TREE_CODE (decl
) != RESULT_DECL
)
8110 add_decl_stmt (decl
);
8112 if (TYPE_HAS_MUTABLE_P (type
))
8113 TREE_READONLY (decl
) = 0;
8115 if (processing_template_decl
)
8117 if (init
&& DECL_INITIAL (decl
))
8118 DECL_INITIAL (decl
) = init
;
8122 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
8123 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
8125 /* Take care of TYPE_DECLs up front. */
8126 if (TREE_CODE (decl
) == TYPE_DECL
)
8128 if (init
&& DECL_INITIAL (decl
))
8130 /* typedef foo = bar; store the type of bar as the type of foo. */
8131 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
8132 DECL_INITIAL (decl
) = init
= NULL_TREE
;
8134 if (type
!= error_mark_node
8135 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
8137 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
8138 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
8139 set_identifier_type_value (DECL_NAME (decl
), type
);
8140 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
8142 GNU_xref_decl (current_function_decl
, decl
);
8144 /* If we have installed this as the canonical typedef for this
8145 type, and that type has not been defined yet, delay emitting
8146 the debug information for it, as we will emit it later. */
8147 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
8148 && !COMPLETE_TYPE_P (TREE_TYPE (decl
)))
8149 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
8151 rest_of_decl_compilation (decl
, NULL_PTR
,
8152 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
8156 if (TREE_CODE (decl
) != FUNCTION_DECL
)
8157 ttype
= target_type (type
);
8159 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
8160 && TYPE_NEEDS_CONSTRUCTING (type
))
8162 /* Currently, GNU C++ puts constants in text space, making them
8163 impossible to initialize. In the future, one would hope for
8164 an operating system which understood the difference between
8165 initialization and the running of a program. */
8167 TREE_READONLY (decl
) = 0;
8170 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
8172 /* This must override the asm specifier which was placed by
8173 grokclassfn. Lay this out fresh. */
8174 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
8175 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
8176 make_decl_rtl (decl
, asmspec
, 0);
8179 /* Deduce size of array from initialization, if not already known. */
8180 maybe_deduce_size_from_array_init (decl
, init
);
8181 init
= check_initializer (decl
, init
);
8183 GNU_xref_decl (current_function_decl
, decl
);
8185 if (TREE_CODE (decl
) == VAR_DECL
)
8186 layout_var_decl (decl
);
8188 /* Output the assembler code and/or RTL code for variables and functions,
8189 unless the type is an undefined structure or union.
8190 If not, it will get done when the type is completed. */
8191 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
8192 || TREE_CODE (decl
) == RESULT_DECL
)
8194 if (TREE_CODE (decl
) == VAR_DECL
)
8195 maybe_commonize_var (decl
);
8197 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
8199 if (TREE_CODE (type
) == FUNCTION_TYPE
8200 || TREE_CODE (type
) == METHOD_TYPE
)
8201 abstract_virtuals_error (decl
,
8202 strip_array_types (TREE_TYPE (type
)));
8204 abstract_virtuals_error (decl
, strip_array_types (type
));
8206 if (TREE_CODE (decl
) == FUNCTION_DECL
)
8208 else if (DECL_EXTERNAL (decl
)
8209 && ! (DECL_LANG_SPECIFIC (decl
)
8210 && DECL_NOT_REALLY_EXTERN (decl
)))
8213 DECL_INITIAL (decl
) = init
;
8215 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
8217 /* This is a local declaration. */
8218 if (doing_semantic_analysis_p ())
8219 maybe_inject_for_scope_var (decl
);
8220 /* Initialize the local variable. But, if we're building a
8221 statement-tree, we'll do the initialization when we
8223 if (processing_template_decl
)
8225 if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
8226 DECL_INITIAL (decl
) = init
;
8230 /* If we're not building RTL, then we need to do so
8232 my_friendly_assert (building_stmt_tree (), 20000906);
8233 /* Initialize the variable. */
8234 initialize_local_var (decl
, init
, flags
);
8235 /* Clean up the variable. */
8236 destroy_local_var (decl
);
8239 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
8241 /* Cleanups for static variables are handled by `finish_file'. */
8242 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
8243 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
8244 expand_static_init (decl
, init
);
8248 /* Undo call to `pushclass' that was done in `start_decl'
8249 due to initialization of qualified member variable.
8250 I.e., Foo::x = 10; */
8252 tree context
= CP_DECL_CONTEXT (decl
);
8255 && (TREE_CODE (decl
) == VAR_DECL
8256 /* We also have a pushclass done that we need to undo here
8257 if we're at top level and declare a method. */
8258 || TREE_CODE (decl
) == FUNCTION_DECL
)
8259 /* If size hasn't been set, we're still defining it,
8260 and therefore inside the class body; don't pop
8261 the binding level.. */
8262 && COMPLETE_TYPE_P (context
)
8263 && context
== current_class_type
)
8264 pop_nested_class ();
8271 TREE_READONLY (decl
) = 1;
8274 /* This is here for a midend callback from c-common.c */
8277 finish_decl (decl
, init
, asmspec_tree
)
8281 cp_finish_decl (decl
, init
, asmspec_tree
, 0);
8284 /* Returns a declaration for a VAR_DECL as if:
8286 extern "C" TYPE NAME;
8288 had been seen. Used to create compiler-generated global
8292 declare_global_var (name
, type
)
8298 push_to_top_level ();
8299 decl
= build_decl (VAR_DECL
, name
, type
);
8300 TREE_PUBLIC (decl
) = 1;
8301 DECL_EXTERNAL (decl
) = 1;
8302 DECL_ARTIFICIAL (decl
) = 1;
8304 cp_finish_decl (decl
, NULL_TREE
, NULL_TREE
, 0);
8305 pop_from_top_level ();
8310 /* Returns a pointer to the `atexit' function. Note that if
8311 FLAG_USE_CXA_ATEXIT is non-zero, then this will actually be the new
8312 `__cxa_atexit' function specified in the IA64 C++ ABI. */
8326 if (flag_use_cxa_atexit
)
8328 /* The declaration for `__cxa_atexit' is:
8330 int __cxa_atexit (void (*)(void *), void *, void *)
8332 We build up the argument types and then then function type
8335 /* First, build the pointer-to-function type for the first
8337 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8338 fn_type
= build_function_type (void_type_node
, arg_types
);
8339 fn_ptr_type
= build_pointer_type (fn_type
);
8340 /* Then, build the rest of the argument types. */
8341 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8342 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, arg_types
);
8343 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, arg_types
);
8344 /* And the final __cxa_atexit type. */
8345 fn_type
= build_function_type (integer_type_node
, arg_types
);
8346 fn_ptr_type
= build_pointer_type (fn_type
);
8347 name
= "__cxa_atexit";
8351 /* The declaration for `atexit' is:
8353 int atexit (void (*)());
8355 We build up the argument types and then then function type
8357 fn_type
= build_function_type (void_type_node
, void_list_node
);
8358 fn_ptr_type
= build_pointer_type (fn_type
);
8359 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, void_list_node
);
8360 /* Build the final atexit type. */
8361 fn_type
= build_function_type (integer_type_node
, arg_types
);
8365 /* Now, build the function declaration. */
8366 push_lang_context (lang_name_c
);
8367 atexit_fndecl
= build_library_fn_ptr (name
, fn_type
);
8368 mark_used (atexit_fndecl
);
8369 pop_lang_context ();
8370 atexit_node
= default_conversion (atexit_fndecl
);
8375 /* Returns the __dso_handle VAR_DECL. */
8378 get_dso_handle_node ()
8380 if (dso_handle_node
)
8381 return dso_handle_node
;
8383 /* Declare the variable. */
8384 dso_handle_node
= declare_global_var (get_identifier ("__dso_handle"),
8387 return dso_handle_node
;
8390 /* Begin a new function with internal linkage whose job will be simply
8391 to destroy some particular variable. */
8396 static int counter
= 0;
8397 int old_interface_unknown
= interface_unknown
;
8403 push_to_top_level ();
8405 /* No need to mangle this. */
8406 push_lang_context (lang_name_c
);
8408 interface_unknown
= 1;
8410 /* Build the parameter-types. */
8411 parmtypes
= void_list_node
;
8412 /* Functions passed to __cxa_atexit take an additional parameter.
8413 We'll just ignore it. After we implement the new calling
8414 convention for destructors, we can eliminate the use of
8415 additional cleanup functions entirely in the -fnew-abi case. */
8416 if (flag_use_cxa_atexit
)
8417 parmtypes
= tree_cons (NULL_TREE
, ptr_type_node
, parmtypes
);
8418 /* Build the function type itself. */
8419 fntype
= build_function_type (void_type_node
, parmtypes
);
8420 /* Build the name of the function. */
8421 sprintf (name
, "__tcf_%d", counter
++);
8422 /* Build the function declaration. */
8423 fndecl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), fntype
);
8424 /* It's a function with internal linkage, generated by the
8426 TREE_PUBLIC (fndecl
) = 0;
8427 DECL_ARTIFICIAL (fndecl
) = 1;
8428 /* Make the function `inline' so that it is only emitted if it is
8429 actually needed. It is unlikely that it will be inlined, since
8430 it is only called via a function pointer, but we avoid unncessary
8431 emissions this way. */
8432 DECL_INLINE (fndecl
) = 1;
8433 /* Build the parameter. */
8434 if (flag_use_cxa_atexit
)
8438 parmdecl
= build_decl (PARM_DECL
, NULL_TREE
, ptr_type_node
);
8439 DECL_CONTEXT (parmdecl
) = fndecl
;
8440 DECL_ARG_TYPE (parmdecl
) = ptr_type_node
;
8441 TREE_USED (parmdecl
) = 1;
8442 DECL_ARGUMENTS (fndecl
) = parmdecl
;
8446 start_function (/*specs=*/NULL_TREE
, fndecl
, NULL_TREE
, SF_PRE_PARSED
);
8449 interface_unknown
= old_interface_unknown
;
8451 pop_lang_context ();
8453 return current_function_decl
;
8456 /* Finish the cleanup function begun by start_cleanup_fn. */
8463 expand_body (finish_function (0));
8465 pop_from_top_level ();
8468 /* Generate code to handle the destruction of DECL, an object with
8469 static storage duration. */
8472 register_dtor_fn (decl
)
8480 int saved_flag_access_control
;
8482 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl
)))
8485 /* Call build_cleanup before we enter the anonymous function so that
8486 any access checks will be done relative to the current scope,
8487 rather than the scope of the anonymous function. */
8488 build_cleanup (decl
);
8490 /* Now start the function. */
8491 cleanup
= start_cleanup_fn ();
8493 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
8494 to the original function, rather than the anonymous one. That
8495 will make the back-end think that nested functions are in use,
8496 which causes confusion. */
8497 saved_flag_access_control
= flag_access_control
;
8498 flag_access_control
= 0;
8499 fcall
= build_cleanup (decl
);
8500 flag_access_control
= saved_flag_access_control
;
8502 /* Create the body of the anonymous function. */
8503 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
8504 finish_expr_stmt (fcall
);
8505 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
8508 /* Call atexit with the cleanup function. */
8509 mark_addressable (cleanup
);
8510 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
8511 if (flag_use_cxa_atexit
)
8513 args
= tree_cons (NULL_TREE
, get_dso_handle_node (), NULL_TREE
);
8514 args
= tree_cons (NULL_TREE
, null_pointer_node
, args
);
8515 args
= tree_cons (NULL_TREE
, cleanup
, args
);
8518 args
= tree_cons (NULL_TREE
, cleanup
, NULL_TREE
);
8519 finish_expr_stmt (build_function_call (get_atexit_node (), args
));
8523 expand_static_init (decl
, init
)
8527 tree oldstatic
= value_member (decl
, static_aggregates
);
8531 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
8532 cp_error ("multiple initializations given for `%D'", decl
);
8534 else if (! toplevel_bindings_p ())
8536 /* Emit code to perform this initialization but once. */
8543 /* Emit code to perform this initialization but once. This code
8546 static int guard = 0;
8548 // Do initialization.
8550 // Register variable for destruction at end of program.
8553 Note that the `temp' variable is only set to 1 *after* the
8554 initialization is complete. This ensures that an exception,
8555 thrown during the construction, will cause the variable to
8556 reinitialized when we pass through this code again, as per:
8560 If the initialization exits by throwing an exception, the
8561 initialization is not complete, so it will be tried again
8562 the next time control enters the declaration.
8564 In theory, this process should be thread-safe, too; multiple
8565 threads should not be able to initialize the variable more
8566 than once. We don't yet attempt to ensure thread-safety. */
8568 /* Create the guard variable. */
8569 guard
= get_guard (decl
);
8571 /* Begin the conditional initialization. */
8572 if_stmt
= begin_if_stmt ();
8573 finish_if_stmt_cond (get_guard_cond (guard
), if_stmt
);
8574 then_clause
= begin_compound_stmt (/*has_no_scope=*/0);
8576 /* Do the initialization itself. */
8577 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
8578 || (init
&& TREE_CODE (init
) == TREE_LIST
))
8579 assignment
= build_aggr_init (decl
, init
, 0);
8581 /* The initialization we're doing here is just a bitwise
8583 assignment
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
8585 assignment
= NULL_TREE
;
8587 /* Once the assignment is complete, set TEMP to 1. Since the
8588 construction of the static object is complete at this point,
8589 we want to make sure TEMP is set to 1 even if a temporary
8590 constructed during the initialization throws an exception
8591 when it is destroyed. So, we combine the initialization and
8592 the assignment to TEMP into a single expression, ensuring
8593 that when we call finish_expr_stmt the cleanups will not be
8594 run until after TEMP is set to 1. */
8595 guard_init
= set_guard (guard
);
8598 assignment
= tree_cons (NULL_TREE
, assignment
,
8599 build_tree_list (NULL_TREE
,
8601 assignment
= build_compound_expr (assignment
);
8604 assignment
= guard_init
;
8605 finish_expr_stmt (assignment
);
8607 /* Use atexit to register a function for destroying this static
8609 register_dtor_fn (decl
);
8611 finish_compound_stmt (/*has_no_scope=*/0, then_clause
);
8612 finish_then_clause (if_stmt
);
8616 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8619 /* Finish the declaration of a catch-parameter. */
8622 start_handler_parms (declspecs
, declarator
)
8629 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8631 if (decl
== NULL_TREE
)
8632 error ("invalid catch parameter");
8641 /* Make TYPE a complete type based on INITIAL_VALUE.
8642 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8643 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8646 complete_array_type (type
, initial_value
, do_default
)
8647 tree type
, initial_value
;
8650 register tree maxindex
= NULL_TREE
;
8655 /* An array of character type can be initialized from a
8656 brace-enclosed string constant. */
8657 if (char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (type
)))
8658 && TREE_CODE (initial_value
) == CONSTRUCTOR
8659 && CONSTRUCTOR_ELTS (initial_value
)
8660 && (TREE_CODE (TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
)))
8662 && TREE_CHAIN (CONSTRUCTOR_ELTS (initial_value
)) == NULL_TREE
)
8663 initial_value
= TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
));
8665 /* Note MAXINDEX is really the maximum index, one less than the
8667 if (TREE_CODE (initial_value
) == STRING_CST
)
8670 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8671 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8674 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8676 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8678 maxindex
= ssize_int (-1);
8679 for (; elts
; elts
= TREE_CHAIN (elts
))
8681 if (TREE_PURPOSE (elts
))
8682 maxindex
= TREE_PURPOSE (elts
);
8684 maxindex
= size_binop (PLUS_EXPR
, maxindex
, ssize_int (1));
8686 maxindex
= copy_node (maxindex
);
8690 /* Make an error message unless that happened already. */
8691 if (initial_value
!= error_mark_node
)
8694 initial_value
= NULL_TREE
;
8696 /* Prevent further error messages. */
8697 maxindex
= build_int_2 (0, 0);
8704 maxindex
= build_int_2 (0, 0);
8713 domain
= build_index_type (maxindex
);
8714 TYPE_DOMAIN (type
) = domain
;
8716 if (! TREE_TYPE (maxindex
))
8717 TREE_TYPE (maxindex
) = domain
;
8719 itype
= TREE_TYPE (initial_value
);
8722 if (itype
&& !TYPE_DOMAIN (itype
))
8723 TYPE_DOMAIN (itype
) = domain
;
8724 /* The type of the main variant should never be used for arrays
8725 of different sizes. It should only ever be completed with the
8726 size of the array. */
8727 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8728 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8731 /* Lay out the type now that we can get the real answer. */
8738 /* Return zero if something is declared to be a member of type
8739 CTYPE when in the context of CUR_TYPE. STRING is the error
8740 message to print in that case. Otherwise, quietly return 1. */
8743 member_function_or_else (ctype
, cur_type
, flags
)
8744 tree ctype
, cur_type
;
8745 enum overload_flags flags
;
8747 if (ctype
&& ctype
!= cur_type
)
8749 if (flags
== DTOR_FLAG
)
8750 cp_error ("destructor for alien class `%T' cannot be a member",
8753 cp_error ("constructor for alien class `%T' cannot be a member",
8760 /* Subroutine of `grokdeclarator'. */
8762 /* Generate errors possibly applicable for a given set of specifiers.
8763 This is for ARM $7.1.2. */
8766 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8769 int virtualp
, quals
, friendp
, raises
, inlinep
;
8772 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8774 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8776 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8779 cp_error_at ("`%D' declared as a friend", object
);
8781 cp_error_at ("`%D' declared with an exception specification", object
);
8784 /* CTYPE is class type, or null if non-class.
8785 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8787 DECLARATOR is the function's name.
8788 VIRTUALP is truthvalue of whether the function is virtual or not.
8789 FLAGS are to be passed through to `grokclassfn'.
8790 QUALS are qualifiers indicating whether the function is `const'
8792 RAISES is a list of exceptions that this function can raise.
8793 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8794 not look, and -1 if we should not call `grokclassfn' at all.
8796 Returns `NULL_TREE' if something goes wrong, after issuing
8797 applicable error messages. */
8800 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8801 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8802 template_count
, in_namespace
)
8805 tree orig_declarator
;
8807 enum overload_flags flags
;
8809 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8813 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8814 int has_default_arg
= 0;
8818 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8819 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8825 type
= build_exception_variant (type
, raises
);
8828 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8829 /* Propagate volatile out from type to decl. */
8830 if (TYPE_VOLATILE (type
))
8831 TREE_THIS_VOLATILE (decl
) = 1;
8833 /* If this decl has namespace scope, set that up. */
8835 set_decl_namespace (decl
, in_namespace
, friendp
);
8837 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8839 /* `main' and builtins have implicit 'C' linkage. */
8840 if ((MAIN_NAME_P (declarator
)
8841 || (IDENTIFIER_LENGTH (declarator
) > 10
8842 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8843 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8844 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8845 && current_lang_name
== lang_name_cplusplus
8846 && ctype
== NULL_TREE
8847 /* NULL_TREE means global namespace. */
8848 && DECL_CONTEXT (decl
) == NULL_TREE
)
8849 DECL_LANGUAGE (decl
) = lang_c
;
8851 /* Should probably propagate const out from type to decl I bet (mrs). */
8854 DECL_STATIC_FUNCTION_P (decl
) = 1;
8855 DECL_CONTEXT (decl
) = ctype
;
8859 DECL_CONTEXT (decl
) = ctype
;
8861 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8863 if (processing_template_decl
)
8864 error ("cannot declare `::main' to be a template");
8866 error ("cannot declare `::main' to be inline");
8868 error ("cannot declare `::main' to be static");
8869 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
8871 error ("`main' must return `int'");
8876 /* Members of anonymous types and local classes have no linkage; make
8878 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8879 || decl_function_context (TYPE_MAIN_DECL (ctype
))))
8884 /* [basic.link]: A name with no linkage (notably, the name of a class
8885 or enumeration declared in a local scope) shall not be used to
8886 declare an entity with linkage.
8888 Only check this for public decls for now. */
8889 t
= no_linkage_check (TREE_TYPE (decl
));
8892 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8894 if (DECL_EXTERN_C_P (decl
))
8895 /* Allow this; it's pretty common in C. */;
8897 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8901 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8906 TREE_PUBLIC (decl
) = publicp
;
8909 DECL_INTERFACE_KNOWN (decl
) = 1;
8910 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8914 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8916 DECL_EXTERNAL (decl
) = 1;
8917 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8919 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8920 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8924 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8925 grok_op_properties (decl
, virtualp
, check
< 0);
8927 if (ctype
&& decl_function_context (decl
))
8928 DECL_NO_STATIC_CHAIN (decl
) = 1;
8930 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8931 if (TREE_PURPOSE (t
)
8932 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8934 has_default_arg
= 1;
8939 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8943 ("defining explicit specialization `%D' in friend declaration",
8947 tree fns
= TREE_OPERAND (orig_declarator
, 0);
8948 tree args
= TREE_OPERAND (orig_declarator
, 1);
8950 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8952 /* Something like `template <class T> friend void f<T>()'. */
8953 cp_error ("invalid use of template-id `%D' in declaration of primary template",
8959 /* A friend declaration of the form friend void f<>(). Record
8960 the information in the TEMPLATE_ID_EXPR. */
8961 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8963 if (TREE_CODE (fns
) == COMPONENT_REF
)
8965 /* Due to bison parser ickiness, we will have already looked
8966 up an operator_name or PFUNCNAME within the current class
8967 (see template_id in parse.y). If the current class contains
8968 such a name, we'll get a COMPONENT_REF here. Undo that. */
8970 my_friendly_assert (TREE_TYPE (TREE_OPERAND (fns
, 0))
8971 == current_class_type
, 20001120);
8972 fns
= TREE_OPERAND (fns
, 1);
8974 my_friendly_assert (TREE_CODE (fns
) == IDENTIFIER_NODE
8975 || TREE_CODE (fns
) == LOOKUP_EXPR
8976 || TREE_CODE (fns
) == OVERLOAD
, 20001120);
8977 DECL_TEMPLATE_INFO (decl
) = tree_cons (fns
, args
, NULL_TREE
);
8979 if (has_default_arg
)
8981 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8988 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8995 if (has_default_arg
)
8996 add_defarg_fn (decl
);
8998 /* Plain overloading: will not be grok'd by grokclassfn. */
8999 if (! ctype
&& ! processing_template_decl
9000 && !DECL_EXTERN_C_P (decl
)
9001 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
9002 set_mangled_name_for_decl (decl
);
9005 /* Make the init_value nonzero so pushdecl knows this is not
9006 tentative. error_mark_node is replaced later with the BLOCK. */
9007 DECL_INITIAL (decl
) = error_mark_node
;
9009 if (TYPE_NOTHROW_P (type
) || nothrow_libfn_p (decl
))
9010 TREE_NOTHROW (decl
) = 1;
9012 /* Caller will do the rest of this. */
9016 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
9017 DECL_CONSTRUCTOR_P (decl
) = 1;
9019 /* Function gets the ugly name, field gets the nice one. This call
9020 may change the type of the function (because of default
9022 if (ctype
!= NULL_TREE
)
9023 grokclassfn (ctype
, decl
, flags
, quals
);
9025 decl
= check_explicit_specialization (orig_declarator
, decl
,
9027 2 * (funcdef_flag
!= 0) +
9028 4 * (friendp
!= 0));
9029 if (decl
== error_mark_node
)
9032 if (ctype
!= NULL_TREE
9033 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
9038 old_decl
= check_classfn (ctype
, decl
);
9040 if (old_decl
&& TREE_CODE (old_decl
) == TEMPLATE_DECL
)
9041 /* Because grokfndecl is always supposed to return a
9042 FUNCTION_DECL, we pull out the DECL_TEMPLATE_RESULT
9043 here. We depend on our callers to figure out that its
9044 really a template that's being returned. */
9045 old_decl
= DECL_TEMPLATE_RESULT (old_decl
);
9047 if (old_decl
&& DECL_STATIC_FUNCTION_P (old_decl
)
9048 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
9050 /* Remove the `this' parm added by grokclassfn.
9051 XXX Isn't this done in start_function, too? */
9052 revert_static_member_fn (decl
);
9053 last_function_parms
= TREE_CHAIN (last_function_parms
);
9055 if (old_decl
&& DECL_ARTIFICIAL (old_decl
))
9056 cp_error ("definition of implicitly-declared `%D'", old_decl
);
9060 /* Since we've smashed OLD_DECL to its
9061 DECL_TEMPLATE_RESULT, we must do the same to DECL. */
9062 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
9063 decl
= DECL_TEMPLATE_RESULT (decl
);
9065 /* Attempt to merge the declarations. This can fail, in
9066 the case of some illegal specialization declarations. */
9067 if (!duplicate_decls (decl
, old_decl
))
9068 cp_error ("no `%#D' member function declared in class `%T'",
9074 if (DECL_CONSTRUCTOR_P (decl
) && !grok_ctor_properties (ctype
, decl
))
9077 if (ctype
== NULL_TREE
|| check
)
9082 DECL_VIRTUAL_P (decl
) = 1;
9083 if (DECL_VINDEX (decl
) == NULL_TREE
)
9084 DECL_VINDEX (decl
) = error_mark_node
;
9085 IDENTIFIER_VIRTUAL_P (DECL_NAME (decl
)) = 1;
9092 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
9095 RID_BIT_TYPE
*specbits_in
;
9101 RID_BIT_TYPE specbits
;
9103 specbits
= *specbits_in
;
9105 if (TREE_CODE (type
) == OFFSET_TYPE
)
9107 /* If you declare a static member so that it
9108 can be initialized, the code will reach here. */
9109 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
9110 type
= TREE_TYPE (type
);
9111 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
9112 DECL_CONTEXT (decl
) = basetype
;
9113 /* DECL_ASSEMBLER_NAME is needed only for full-instantiated
9115 if (!uses_template_parms (decl
))
9118 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
9120 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
,
9129 context
= in_namespace
;
9130 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
9131 context
= current_namespace
;
9133 context
= NULL_TREE
;
9135 if (processing_template_decl
&& context
)
9136 /* For global variables, declared in a template, we need the
9138 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
9140 decl
= build_decl (VAR_DECL
, declarator
, type
);
9143 set_decl_namespace (decl
, context
, 0);
9145 context
= DECL_CONTEXT (decl
);
9146 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
9149 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
9151 DECL_ASSEMBLER_NAME (decl
)
9152 = build_static_name (context
, declarator
);
9157 set_decl_namespace (decl
, in_namespace
, 0);
9159 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
9161 DECL_THIS_EXTERN (decl
) = 1;
9162 DECL_EXTERNAL (decl
) = !initialized
;
9165 /* In class context, static means one per class,
9166 public access, and static storage. */
9167 if (DECL_CLASS_SCOPE_P (decl
))
9169 TREE_PUBLIC (decl
) = 1;
9170 TREE_STATIC (decl
) = 1;
9171 DECL_EXTERNAL (decl
) = 0;
9173 /* At top level, either `static' or no s.c. makes a definition
9174 (perhaps tentative), and absence of `static' makes it public. */
9175 else if (toplevel_bindings_p ())
9177 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
9178 && (DECL_THIS_EXTERN (decl
) || ! constp
));
9179 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
9181 /* Not at top level, only `static' makes a static definition. */
9184 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
9185 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
9188 if (TREE_PUBLIC (decl
))
9190 /* [basic.link]: A name with no linkage (notably, the name of a class
9191 or enumeration declared in a local scope) shall not be used to
9192 declare an entity with linkage.
9194 Only check this for public decls for now. */
9195 tree t
= no_linkage_check (TREE_TYPE (decl
));
9198 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
9199 /* Ignore for now; `enum { foo } e' is pretty common. */;
9201 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
9209 /* Create and return a canonical pointer to member function type, for
9210 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
9213 build_ptrmemfunc_type (type
)
9219 tree unqualified_variant
= NULL_TREE
;
9221 if (type
== error_mark_node
)
9224 /* If a canonical type already exists for this type, use it. We use
9225 this method instead of type_hash_canon, because it only does a
9226 simple equality check on the list of field members. */
9228 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
9231 /* Make sure that we always have the unqualified pointer-to-member
9233 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9235 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
9237 t
= make_aggr_type (RECORD_TYPE
);
9238 /* Let the front-end know this is a pointer to member function... */
9239 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
9240 /* ... and not really an aggregate. */
9241 SET_IS_AGGR_TYPE (t
, 0);
9245 u
= make_aggr_type (UNION_TYPE
);
9246 SET_IS_AGGR_TYPE (u
, 0);
9247 fields
[0] = build_decl (FIELD_DECL
, pfn_identifier
, type
);
9248 fields
[1] = build_decl (FIELD_DECL
, delta2_identifier
,
9250 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9251 TYPE_NAME (u
) = NULL_TREE
;
9253 fields
[0] = build_decl (FIELD_DECL
, delta_identifier
,
9255 fields
[1] = build_decl (FIELD_DECL
, index_identifier
,
9257 fields
[2] = build_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
9258 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
9262 fields
[0] = build_decl (FIELD_DECL
, pfn_identifier
, type
);
9263 fields
[1] = build_decl (FIELD_DECL
, delta_identifier
,
9265 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9268 /* Zap out the name so that the back-end will give us the debugging
9269 information for this anonymous RECORD_TYPE. */
9270 TYPE_NAME (t
) = NULL_TREE
;
9272 /* If this is not the unqualified form of this pointer-to-member
9273 type, set the TYPE_MAIN_VARIANT for this type to be the
9274 unqualified type. Since they are actually RECORD_TYPEs that are
9275 not variants of each other, we must do this manually. */
9276 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9278 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
9279 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
9280 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
9281 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
9284 /* Cache this pointer-to-member type so that we can find it again
9286 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
9288 /* Seems to be wanted. */
9289 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
9294 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
9295 Check to see that the definition is valid. Issue appropriate error
9296 messages. Return 1 if the definition is particularly bad, or 0
9300 check_static_variable_definition (decl
, type
)
9304 /* Motion 10 at San Diego: If a static const integral data member is
9305 initialized with an integral constant expression, the initializer
9306 may appear either in the declaration (within the class), or in
9307 the definition, but not both. If it appears in the class, the
9308 member is a member constant. The file-scope definition is always
9310 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
9312 cp_error ("invalid in-class initialization of static data member of non-integral type `%T'",
9314 /* If we just return the declaration, crashes will sometimes
9315 occur. We therefore return void_type_node, as if this was a
9316 friend declaration, to cause callers to completely ignore
9317 this declaration. */
9320 else if (!CP_TYPE_CONST_P (type
))
9321 cp_error ("ISO C++ forbids in-class initialization of non-const static member `%D'",
9323 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
9324 cp_pedwarn ("ISO C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
9329 /* Given the SIZE (i.e., number of elements) in an array, compute an
9330 appropriate index type for the array. If non-NULL, NAME is the
9331 name of the thing being declared. */
9334 compute_array_index_type (name
, size
)
9340 /* The size might be the result of a cast. */
9341 STRIP_TYPE_NOPS (size
);
9343 /* It might be a const variable or enumeration constant. */
9344 size
= decl_constant_value (size
);
9346 /* If this involves a template parameter, it will be a constant at
9347 instantiation time, but we don't know what the value is yet.
9348 Even if no template parameters are involved, we may an expression
9349 that is not a constant; we don't even simplify `1 + 2' when
9350 processing a template. */
9351 if (processing_template_decl
)
9353 /* Resolve a qualified reference to an enumerator or static
9354 const data member of ours. */
9355 if (TREE_CODE (size
) == SCOPE_REF
9356 && TREE_OPERAND (size
, 0) == current_class_type
)
9358 tree t
= lookup_field (current_class_type
,
9359 TREE_OPERAND (size
, 1), 0, 0);
9364 return build_index_type (build_min (MINUS_EXPR
, sizetype
,
9365 size
, integer_one_node
));
9368 /* The array bound must be an integer type. */
9369 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9370 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
9371 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
9374 cp_error ("size of array `%D' has non-integer type", name
);
9376 cp_error ("size of array has non-integer type");
9377 size
= integer_one_node
;
9380 /* Normally, the array-bound will be a constant. */
9381 if (TREE_CODE (size
) == INTEGER_CST
)
9383 /* Check to see if the array bound overflowed. Make that an
9384 error, no matter how generous we're being. */
9385 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9386 int old_pedantic
= pedantic
;
9387 pedantic
= flag_pedantic_errors
= 1;
9388 constant_expression_warning (size
);
9389 pedantic
= old_pedantic
;
9390 flag_pedantic_errors
= old_flag_pedantic_errors
;
9392 /* An array must have a positive number of elements. */
9393 if (INT_CST_LT (size
, integer_zero_node
))
9396 cp_error ("size of array `%D' is negative", name
);
9398 cp_error ("size of array is negative");
9399 size
= integer_one_node
;
9401 /* Except that an extension we allow zero-sized arrays. We
9402 always allow them in system headers because glibc uses
9404 else if (integer_zerop (size
) && pedantic
&& !in_system_header
)
9407 cp_pedwarn ("ISO C++ forbids zero-size array `%D'", name
);
9409 cp_pedwarn ("ISO C++ forbids zero-size array");
9412 else if (TREE_CONSTANT (size
))
9414 /* `(int) &fn' is not a valid array bound. */
9416 cp_error ("size of array `%D' is not an integral constant-expression",
9419 cp_error ("size of array is not an integral constant-expression");
9422 /* Compute the index of the largest element in the array. It is
9423 one less than the number of elements in the array. */
9425 = fold (cp_build_binary_op (MINUS_EXPR
,
9426 cp_convert (ssizetype
, size
),
9427 cp_convert (ssizetype
,
9428 integer_one_node
)));
9430 /* Check for variable-sized arrays. We allow such things as an
9431 extension, even though they are not allowed in ANSI/ISO C++. */
9432 if (!TREE_CONSTANT (itype
))
9437 cp_pedwarn ("ISO C++ forbids variable-size array `%D'",
9440 cp_pedwarn ("ISO C++ forbids variable-size array");
9443 /* Create a variable-sized array index type. */
9444 itype
= variable_size (itype
);
9446 /* Make sure that there was no overflow when creating to a signed
9447 index type. (For example, on a 32-bit machine, an array with
9448 size 2^32 - 1 is too big.) */
9449 else if (TREE_OVERFLOW (itype
))
9451 error ("overflow in array dimension");
9452 TREE_OVERFLOW (itype
) = 0;
9455 /* Create and return the appropriate index type. */
9456 return build_index_type (itype
);
9459 /* Returns an ARRAY_TYPE for an array with SIZE elements of the
9460 indicated TYPE. If non-NULL, NAME is the NAME of the declaration
9464 create_array_type_for_decl (name
, type
, size
)
9469 tree itype
= NULL_TREE
;
9470 const char* error_msg
;
9472 /* If things have already gone awry, bail now. */
9473 if (type
== error_mark_node
|| size
== error_mark_node
)
9474 return error_mark_node
;
9476 /* Assume that everything will go OK. */
9479 /* There are some types which cannot be array elements. */
9480 switch (TREE_CODE (type
))
9483 error_msg
= "array of void";
9487 error_msg
= "array of functions";
9490 case REFERENCE_TYPE
:
9491 error_msg
= "array of references";
9495 error_msg
= "array of data members";
9499 error_msg
= "array of function members";
9506 /* If something went wrong, issue an error-message and return. */
9510 cp_error ("declaration of `%D' as %s", name
, error_msg
);
9512 cp_error ("creating %s", error_msg
);
9514 return error_mark_node
;
9519 The constant expressions that specify the bounds of the arrays
9520 can be omitted only for the first member of the sequence. */
9521 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9523 cp_error ("declaration of `%D' as multidimensional array must have bounds for all dimensions except the first",
9526 return error_mark_node
;
9529 /* Figure out the index type for the array. */
9531 itype
= compute_array_index_type (name
, size
);
9533 return build_cplus_array_type (type
, itype
);
9536 /* Check that it's OK to declare a function with the indicated TYPE.
9537 SFK indicates the kind of special function (if any) that this
9538 function is. CTYPE is the class of which this function is a
9539 member. OPTYPE is the type given in a conversion operator
9540 declaration. Returns the actual return type of the function; that
9541 may be different than TYPE if an error occurs, or for certain
9542 special functions. */
9545 check_special_function_return_type (sfk
, type
, ctype
, optype
)
9546 special_function_kind sfk
;
9553 case sfk_constructor
:
9555 cp_error ("return type specification for constructor invalid");
9557 /* In the old ABI, we return `this'; in the new ABI we don't
9559 type
= flag_new_abi
? void_type_node
: build_pointer_type (ctype
);
9562 case sfk_destructor
:
9564 cp_error ("return type specification for destructor invalid");
9565 type
= void_type_node
;
9568 case sfk_conversion
:
9569 if (type
&& !same_type_p (type
, optype
))
9570 cp_error ("operator `%T' declared to return `%T'", optype
, type
);
9572 cp_pedwarn ("return type specified for `operator %T'", optype
);
9577 my_friendly_abort (20000408);
9584 /* Given declspecs and a declarator,
9585 determine the name and type of the object declared
9586 and construct a ..._DECL node for it.
9587 (In one case we can return a ..._TYPE node instead.
9588 For invalid input we sometimes return 0.)
9590 DECLSPECS is a chain of tree_list nodes whose value fields
9591 are the storage classes and type specifiers.
9593 DECL_CONTEXT says which syntactic context this declaration is in:
9594 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
9595 FUNCDEF for a function definition. Like NORMAL but a few different
9596 error messages in each case. Return value may be zero meaning
9597 this definition is too screwy to try to parse.
9598 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
9599 handle member functions (which have FIELD context).
9600 Return value may be zero meaning this definition is too screwy to
9602 PARM for a parameter declaration (either within a function prototype
9603 or before a function body). Make a PARM_DECL, or return void_type_node.
9604 CATCHPARM for a parameter declaration before a catch clause.
9605 TYPENAME if for a typename (in a cast or sizeof).
9606 Don't make a DECL node; just return the ..._TYPE node.
9607 FIELD for a struct or union field; make a FIELD_DECL.
9608 BITFIELD for a field with specified width.
9609 INITIALIZED is 1 if the decl has an initializer.
9611 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
9612 normal attributes in TREE_PURPOSE, or NULL_TREE.
9614 In the TYPENAME case, DECLARATOR is really an abstract declarator.
9615 It may also be so in the PARM case, for a prototype where the
9616 argument type is specified but not the name.
9618 This function is where the complicated C meanings of `static'
9619 and `extern' are interpreted.
9621 For C++, if there is any monkey business to do, the function which
9622 calls this one must do it, i.e., prepending instance variables,
9623 renaming overloaded function names, etc.
9625 Note that for this C++, it is an error to define a method within a class
9626 which does not belong to that class.
9628 Except in the case where SCOPE_REFs are implicitly known (such as
9629 methods within a class being redundantly qualified),
9630 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
9631 (class_name::decl_name). The caller must also deal with this.
9633 If a constructor or destructor is seen, and the context is FIELD,
9634 then the type gains the attribute TREE_HAS_x. If such a declaration
9635 is erroneous, NULL_TREE is returned.
9637 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
9638 function, these are the qualifiers to give to the `this' pointer. We
9639 apply TYPE_QUAL_RESTRICT to the this ptr, not the object.
9641 May return void_type_node if the declarator turned out to be a friend.
9642 See grokfield for details. */
9645 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
9648 enum decl_context decl_context
;
9652 RID_BIT_TYPE specbits
;
9655 tree type
= NULL_TREE
;
9661 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
9662 int explicit_int
= 0;
9663 int explicit_char
= 0;
9664 int defaulted_int
= 0;
9665 tree typedef_decl
= NULL_TREE
;
9667 tree typedef_type
= NULL_TREE
;
9668 int funcdef_flag
= 0;
9669 enum tree_code innermost_code
= ERROR_MARK
;
9672 /* See the code below that used this. */
9673 tree decl_machine_attr
= NULL_TREE
;
9675 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
9676 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
9677 tree init
= NULL_TREE
;
9679 /* Keep track of what sort of function is being processed
9680 so that we can warn about default return values, or explicit
9681 return values which do not match prescribed defaults. */
9682 special_function_kind sfk
= sfk_none
;
9684 tree dname
= NULL_TREE
;
9685 tree ctype
= current_class_type
;
9686 tree ctor_return_type
= NULL_TREE
;
9687 enum overload_flags flags
= NO_SPECIAL
;
9688 tree quals
= NULL_TREE
;
9689 tree raises
= NULL_TREE
;
9690 int template_count
= 0;
9691 tree in_namespace
= NULL_TREE
;
9695 RIDBIT_RESET_ALL (specbits
);
9696 if (decl_context
== FUNCDEF
)
9697 funcdef_flag
= 1, decl_context
= NORMAL
;
9698 else if (decl_context
== MEMFUNCDEF
)
9699 funcdef_flag
= -1, decl_context
= FIELD
;
9700 else if (decl_context
== BITFIELD
)
9701 bitfield
= 1, decl_context
= FIELD
;
9703 /* Look inside a declarator for the name being declared
9704 and get it as a string, for an error message. */
9706 tree
*next
= &declarator
;
9710 while (next
&& *next
)
9713 switch (TREE_CODE (decl
))
9716 /* For attributes. */
9717 next
= &TREE_VALUE (decl
);
9722 next
= &TREE_OPERAND (decl
, 0);
9725 case BIT_NOT_EXPR
: /* For C++ destructors! */
9727 tree name
= TREE_OPERAND (decl
, 0);
9728 tree rename
= NULL_TREE
;
9730 my_friendly_assert (flags
== NO_SPECIAL
, 152);
9732 sfk
= sfk_destructor
;
9733 if (TREE_CODE (name
) == TYPE_DECL
)
9734 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
9735 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
9736 if (ctype
== NULL_TREE
)
9738 if (current_class_type
== NULL_TREE
)
9740 error ("destructors must be member functions");
9745 tree t
= constructor_name (current_class_name
);
9752 tree t
= constructor_name (ctype
);
9759 cp_error ("destructor `%T' must match class name `%T'",
9761 TREE_OPERAND (decl
, 0) = rename
;
9767 case ADDR_EXPR
: /* C++ reference declaration */
9772 innermost_code
= TREE_CODE (decl
);
9773 next
= &TREE_OPERAND (decl
, 0);
9777 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
9779 /* This is actually a variable declaration using
9780 constructor syntax. We need to call start_decl and
9781 cp_finish_decl so we can get the variable
9784 tree attributes
, prefix_attributes
;
9786 *next
= TREE_OPERAND (decl
, 0);
9787 init
= CALL_DECLARATOR_PARMS (decl
);
9791 attributes
= TREE_PURPOSE (attrlist
);
9792 prefix_attributes
= TREE_VALUE (attrlist
);
9796 attributes
= NULL_TREE
;
9797 prefix_attributes
= NULL_TREE
;
9800 decl
= start_decl (declarator
, declspecs
, 1,
9801 attributes
, prefix_attributes
);
9802 decl_type_access_control (decl
);
9805 /* Look for __unused__ attribute */
9806 if (TREE_USED (TREE_TYPE (decl
)))
9807 TREE_USED (decl
) = 1;
9808 finish_decl (decl
, init
, NULL_TREE
);
9811 cp_error ("invalid declarator");
9814 innermost_code
= TREE_CODE (decl
);
9815 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
9816 ctype
= current_class_type
;
9818 && TREE_OPERAND (decl
, 0)
9819 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
9820 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
9821 == constructor_name_full (ctype
))
9822 || (DECL_NAME (TREE_OPERAND (decl
, 0))
9823 == constructor_name (ctype
)))))
9824 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9825 next
= &TREE_OPERAND (decl
, 0);
9827 if (ctype
!= NULL_TREE
9828 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
9829 && decl
== constructor_name (ctype
))
9831 sfk
= sfk_constructor
;
9832 ctor_return_type
= ctype
;
9837 case TEMPLATE_ID_EXPR
:
9839 tree fns
= TREE_OPERAND (decl
, 0);
9841 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9842 fns
= TREE_OPERAND (fns
, 0);
9845 if (TREE_CODE (dname
) == COMPONENT_REF
)
9846 dname
= TREE_OPERAND (dname
, 1);
9847 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9849 my_friendly_assert (is_overloaded_fn (dname
),
9851 dname
= DECL_NAME (get_first_fn (dname
));
9856 case IDENTIFIER_NODE
:
9857 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9862 if (C_IS_RESERVED_WORD (dname
))
9864 cp_error ("declarator-id missing; using reserved word `%D'",
9866 name
= IDENTIFIER_POINTER (dname
);
9868 else if (!IDENTIFIER_TYPENAME_P (dname
))
9869 name
= IDENTIFIER_POINTER (dname
);
9872 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9873 flags
= TYPENAME_FLAG
;
9874 ctor_return_type
= TREE_TYPE (dname
);
9875 sfk
= sfk_conversion
;
9876 if (IDENTIFIER_GLOBAL_VALUE (dname
)
9877 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (dname
))
9879 name
= IDENTIFIER_POINTER (dname
);
9881 name
= "<invalid operator>";
9888 /* Perform error checking, and decide on a ctype. */
9889 tree cname
= TREE_OPERAND (decl
, 0);
9890 if (cname
== NULL_TREE
)
9892 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9895 in_namespace
= TREE_OPERAND (decl
, 0);
9896 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9898 else if (! is_aggr_type (cname
, 1))
9899 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9900 /* Must test TREE_OPERAND (decl, 1), in case user gives
9901 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9902 else if (TREE_OPERAND (decl
, 1)
9903 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9905 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9906 || TREE_CODE (cname
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
9908 cp_error ("`%T::%D' is not a valid declarator", cname
,
9909 TREE_OPERAND (decl
, 1));
9910 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9911 cname
, TREE_OPERAND (decl
, 1));
9912 return void_type_node
;
9914 else if (ctype
== NULL_TREE
)
9916 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9917 TREE_OPERAND (decl
, 0) = ctype
;
9920 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9922 cp_error ("type `%T' is not derived from type `%T'",
9924 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9930 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9931 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9932 == constructor_name_full (ctype
))
9933 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9934 == constructor_name (ctype
))))
9935 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9936 next
= &TREE_OPERAND (decl
, 1);
9940 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9941 && constructor_name (ctype
) == decl
)
9943 sfk
= sfk_constructor
;
9944 ctor_return_type
= ctype
;
9946 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9947 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9948 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9949 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9951 sfk
= sfk_destructor
;
9952 ctor_return_type
= ctype
;
9954 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9955 next
= &TREE_OPERAND (decl
, 0);
9966 /* Parse error puts this typespec where
9967 a declarator should go. */
9968 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9969 if (TREE_TYPE (decl
) == current_class_type
)
9970 cp_error (" perhaps you want `%T' for a constructor",
9971 current_class_name
);
9972 dname
= DECL_NAME (decl
);
9973 name
= IDENTIFIER_POINTER (dname
);
9975 /* Avoid giving two errors for this. */
9976 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9978 declspecs
= tree_cons (NULL_TREE
, integer_type_node
, declspecs
);
9984 cp_compiler_error ("`%D' as declarator", decl
);
9985 return 0; /* We used to do a 155 abort here. */
9990 /* A function definition's declarator must have the form of
9991 a function declarator. */
9993 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9996 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9997 && innermost_code
!= CALL_EXPR
9998 && ! (ctype
&& declspecs
== NULL_TREE
))
10000 cp_error ("declaration of `%D' as non-function", dname
);
10001 return void_type_node
;
10004 /* Anything declared one level down from the top level
10005 must be one of the parameters of a function
10006 (because the body is at least two levels down). */
10008 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
10009 by not allowing C++ class definitions to specify their parameters
10010 with xdecls (must be spec.d in the parmlist).
10012 Since we now wait to push a class scope until we are sure that
10013 we are in a legitimate method context, we must set oldcname
10014 explicitly (since current_class_name is not yet alive).
10016 We also want to avoid calling this a PARM if it is in a namespace. */
10018 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
10020 struct binding_level
*b
= current_binding_level
;
10021 current_binding_level
= b
->level_chain
;
10022 if (current_binding_level
!= 0 && toplevel_bindings_p ())
10023 decl_context
= PARM
;
10024 current_binding_level
= b
;
10028 name
= decl_context
== PARM
? "parameter" : "type name";
10030 /* Look through the decl specs and record which ones appear.
10031 Some typespecs are defined as built-in typenames.
10032 Others, the ones that are modifiers of other types,
10033 are represented by bits in SPECBITS: set the bits for
10034 the modifiers that appear. Storage class keywords are also in SPECBITS.
10036 If there is a typedef name or a type, store the type in TYPE.
10037 This includes builtin typedefs such as `int'.
10039 Set EXPLICIT_INT if the type is `int' or `char' and did not
10040 come from a user typedef.
10042 Set LONGLONG if `long' is mentioned twice.
10044 For C++, constructors and destructors have their own fast treatment. */
10046 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
10051 /* Certain parse errors slip through. For example,
10052 `int class;' is not caught by the parser. Try
10053 weakly to recover here. */
10054 if (TREE_CODE (spec
) != TREE_LIST
)
10057 id
= TREE_VALUE (spec
);
10059 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
10061 if (id
== ridpointers
[(int) RID_INT
]
10062 || id
== ridpointers
[(int) RID_CHAR
]
10063 || id
== ridpointers
[(int) RID_BOOL
]
10064 || id
== ridpointers
[(int) RID_WCHAR
])
10068 if (id
== ridpointers
[(int) RID_BOOL
])
10069 error ("`bool' is now a keyword");
10071 cp_error ("extraneous `%T' ignored", id
);
10075 if (id
== ridpointers
[(int) RID_INT
])
10077 else if (id
== ridpointers
[(int) RID_CHAR
])
10079 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
10083 /* C++ aggregate types. */
10084 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
10087 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
10089 type
= IDENTIFIER_TYPE_VALUE (id
);
10093 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
10095 if (ridpointers
[i
] == id
)
10097 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
10099 if (pedantic
&& ! in_system_header
&& warn_long_long
)
10100 pedwarn ("ISO C++ does not support `long long'");
10102 error ("`long long long' is too long for GCC");
10106 else if (RIDBIT_SETP (i
, specbits
))
10107 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
10108 RIDBIT_SET (i
, specbits
);
10113 /* C++ aggregate types. */
10114 else if (TREE_CODE (id
) == TYPE_DECL
)
10117 cp_error ("multiple declarations `%T' and `%T'", type
,
10121 type
= TREE_TYPE (id
);
10122 TREE_VALUE (spec
) = type
;
10127 error ("two or more data types in declaration of `%s'", name
);
10128 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
10130 register tree t
= lookup_name (id
, 1);
10131 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
10132 error ("`%s' fails to be a typedef or built in type",
10133 IDENTIFIER_POINTER (id
));
10136 type
= TREE_TYPE (t
);
10138 /* See the code below that used this. */
10139 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
10144 else if (id
!= error_mark_node
)
10145 /* Can't change CLASS nodes into RECORD nodes here! */
10151 typedef_type
= type
;
10153 /* No type at all: default to `int', and set DEFAULTED_INT
10154 because it was not a user-defined typedef. */
10156 if (type
== NULL_TREE
10157 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
10158 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10159 || RIDBIT_SETP (RID_LONG
, specbits
)
10160 || RIDBIT_SETP (RID_SHORT
, specbits
)))
10162 /* These imply 'int'. */
10163 type
= integer_type_node
;
10167 if (sfk
!= sfk_none
)
10168 type
= check_special_function_return_type (sfk
, type
,
10171 else if (type
== NULL_TREE
)
10177 /* We handle `main' specially here, because 'main () { }' is so
10178 common. With no options, it is allowed. With -Wreturn-type,
10179 it is a warning. It is only an error with -pedantic-errors. */
10180 is_main
= (funcdef_flag
10181 && MAIN_NAME_P (dname
)
10182 && ctype
== NULL_TREE
10183 && in_namespace
== NULL_TREE
10184 && current_namespace
== global_namespace
);
10186 if (in_system_header
|| flag_ms_extensions
)
10187 /* Allow it, sigh. */;
10188 else if (pedantic
|| ! is_main
)
10189 cp_pedwarn ("ISO C++ forbids declaration of `%s' with no type",
10191 else if (warn_return_type
)
10192 cp_warning ("ISO C++ forbids declaration of `%s' with no type",
10195 type
= integer_type_node
;
10200 /* Now process the modifiers that were specified
10201 and check for invalid combinations. */
10203 /* Long double is a special combination. */
10205 if (RIDBIT_SETP (RID_LONG
, specbits
)
10206 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
10208 RIDBIT_RESET (RID_LONG
, specbits
);
10209 type
= build_qualified_type (long_double_type_node
,
10210 CP_TYPE_QUALS (type
));
10213 /* Check all other uses of type modifiers. */
10215 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10216 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10217 || RIDBIT_SETP (RID_LONG
, specbits
)
10218 || RIDBIT_SETP (RID_SHORT
, specbits
))
10222 if (TREE_CODE (type
) == REAL_TYPE
)
10223 error ("short, signed or unsigned invalid for `%s'", name
);
10224 else if (TREE_CODE (type
) != INTEGER_TYPE
)
10225 error ("long, short, signed or unsigned invalid for `%s'", name
);
10226 else if (RIDBIT_SETP (RID_LONG
, specbits
)
10227 && RIDBIT_SETP (RID_SHORT
, specbits
))
10228 error ("long and short specified together for `%s'", name
);
10229 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10230 || RIDBIT_SETP (RID_SHORT
, specbits
))
10232 error ("long or short specified with char for `%s'", name
);
10233 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10234 || RIDBIT_SETP (RID_SHORT
, specbits
))
10235 && TREE_CODE (type
) == REAL_TYPE
)
10236 error ("long or short specified with floating type for `%s'", name
);
10237 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10238 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
10239 error ("signed and unsigned given together for `%s'", name
);
10243 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
10245 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
10247 if (flag_pedantic_errors
)
10252 /* Discard the type modifiers if they are invalid. */
10255 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
10256 RIDBIT_RESET (RID_SIGNED
, specbits
);
10257 RIDBIT_RESET (RID_LONG
, specbits
);
10258 RIDBIT_RESET (RID_SHORT
, specbits
);
10263 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
10264 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
10266 error ("complex invalid for `%s'", name
);
10267 RIDBIT_RESET (RID_COMPLEX
, specbits
);
10270 /* Decide whether an integer type is signed or not.
10271 Optionally treat bitfields as signed by default. */
10272 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10275 It is implementation-defined whether a plain (neither
10276 explicitly signed or unsigned) char, short, int, or long
10277 bit-field is signed or unsigned.
10279 Naturally, we extend this to long long as well. Note that
10280 this does not include wchar_t. */
10281 || (bitfield
&& !flag_signed_bitfields
10282 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
10283 /* A typedef for plain `int' without `signed' can be
10284 controlled just like plain `int', but a typedef for
10285 `signed int' cannot be so controlled. */
10287 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
10288 && (TREE_CODE (type
) == INTEGER_TYPE
10289 || TREE_CODE (type
) == CHAR_TYPE
)
10290 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
10293 type
= long_long_unsigned_type_node
;
10294 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10295 type
= long_unsigned_type_node
;
10296 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10297 type
= short_unsigned_type_node
;
10298 else if (type
== char_type_node
)
10299 type
= unsigned_char_type_node
;
10300 else if (typedef_decl
)
10301 type
= unsigned_type (type
);
10303 type
= unsigned_type_node
;
10305 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10306 && type
== char_type_node
)
10307 type
= signed_char_type_node
;
10309 type
= long_long_integer_type_node
;
10310 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10311 type
= long_integer_type_node
;
10312 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10313 type
= short_integer_type_node
;
10315 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
10317 /* If we just have "complex", it is equivalent to
10318 "complex double", but if any modifiers at all are specified it is
10319 the complex form of TYPE. E.g, "complex short" is
10320 "complex short int". */
10322 if (defaulted_int
&& ! longlong
10323 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
10324 || RIDBIT_SETP (RID_SHORT
, specbits
)
10325 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10326 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
10327 type
= complex_double_type_node
;
10328 else if (type
== integer_type_node
)
10329 type
= complex_integer_type_node
;
10330 else if (type
== float_type_node
)
10331 type
= complex_float_type_node
;
10332 else if (type
== double_type_node
)
10333 type
= complex_double_type_node
;
10334 else if (type
== long_double_type_node
)
10335 type
= complex_long_double_type_node
;
10337 type
= build_complex_type (type
);
10340 if (sfk
== sfk_conversion
10341 && (RIDBIT_SETP (RID_CONST
, specbits
)
10342 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
10343 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
10344 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
10347 /* Set CONSTP if this declaration is `const', whether by
10348 explicit specification or via a typedef.
10349 Likewise for VOLATILEP. */
10351 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
10353 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
10355 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
10356 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10357 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10358 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10359 type
= cp_build_qualified_type (type
, type_quals
);
10361 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
10362 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
10363 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
10364 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
10365 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
10367 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10368 staticp
= 1 + (decl_context
== FIELD
);
10370 if (virtualp
&& staticp
== 2)
10372 cp_error ("member `%D' cannot be declared both virtual and static",
10376 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
10377 RIDBIT_RESET (RID_FRIEND
, specbits
);
10379 /* Warn if two storage classes are given. Default to `auto'. */
10381 if (RIDBIT_ANY_SET (specbits
))
10383 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
10384 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
10385 if (decl_context
== PARM
&& nclasses
> 0)
10386 error ("storage class specifiers invalid in parameter declarations");
10387 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10389 if (decl_context
== PARM
)
10390 error ("typedef declaration invalid in parameter declaration");
10393 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
10394 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
10397 /* Give error if `virtual' is used outside of class declaration. */
10399 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
10401 error ("virtual outside class declaration");
10405 /* Static anonymous unions are dealt with here. */
10406 if (staticp
&& decl_context
== TYPENAME
10407 && TREE_CODE (declspecs
) == TREE_LIST
10408 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
10409 decl_context
= FIELD
;
10411 /* Warn about storage classes that are invalid for certain
10412 kinds of declarations (parameters, typenames, etc.). */
10415 error ("multiple storage classes in declaration of `%s'", name
);
10416 else if (decl_context
!= NORMAL
&& nclasses
> 0)
10418 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
10419 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
10420 || RIDBIT_SETP (RID_AUTO
, specbits
)))
10422 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10424 else if (decl_context
== FIELD
10425 /* C++ allows static class elements */
10426 && RIDBIT_SETP (RID_STATIC
, specbits
))
10427 /* C++ also allows inlines and signed and unsigned elements,
10428 but in those cases we don't come in here. */
10432 if (decl_context
== FIELD
)
10434 tree tmp
= NULL_TREE
;
10435 register int op
= 0;
10439 /* Avoid trying to get an operand off an identifier node. */
10440 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10443 tmp
= TREE_OPERAND (declarator
, 0);
10444 op
= IDENTIFIER_OPNAME_P (tmp
);
10445 if (IDENTIFIER_TYPENAME_P (tmp
))
10447 if (IDENTIFIER_GLOBAL_VALUE (tmp
)
10448 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (tmp
))
10450 name
= IDENTIFIER_POINTER (tmp
);
10452 name
= "<invalid operator>";
10455 error ("storage class specified for %s `%s'",
10456 op
? "member operator" : "field",
10461 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10462 error ("storage class specified for parameter `%s'", name
);
10464 error ("storage class specified for typename");
10466 RIDBIT_RESET (RID_REGISTER
, specbits
);
10467 RIDBIT_RESET (RID_AUTO
, specbits
);
10468 RIDBIT_RESET (RID_EXTERN
, specbits
);
10471 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
10473 if (toplevel_bindings_p ())
10475 /* It's common practice (and completely valid) to have a const
10476 be initialized and declared extern. */
10477 if (!(type_quals
& TYPE_QUAL_CONST
))
10478 warning ("`%s' initialized and declared `extern'", name
);
10481 error ("`%s' has both `extern' and initializer", name
);
10483 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
10484 && ! toplevel_bindings_p ())
10485 error ("nested function `%s' declared `extern'", name
);
10486 else if (toplevel_bindings_p ())
10488 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10489 error ("top-level declaration of `%s' specifies `auto'", name
);
10492 if (nclasses
> 0 && friendp
)
10493 error ("storage class specifiers invalid in friend function declarations");
10495 /* Now figure out the structure of the declarator proper.
10496 Descend through it, creating more complex types, until we reach
10497 the declared identifier (or NULL_TREE, in an absolute declarator). */
10499 inner_attrs
= NULL_TREE
;
10502 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
10503 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
10505 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
10506 an INDIRECT_REF (for *...),
10507 a CALL_EXPR (for ...(...)),
10508 an identifier (for the name being declared)
10509 or a null pointer (for the place in an absolute declarator
10510 where the name was omitted).
10511 For the last two cases, we have just exited the loop.
10513 For C++ it could also be
10514 a SCOPE_REF (for class :: ...). In this case, we have converted
10515 sensible names to types, and those are the values we use to
10516 qualify the member name.
10517 an ADDR_EXPR (for &...),
10518 a BIT_NOT_EXPR (for destructors)
10520 At this point, TYPE is the type of elements of an array,
10521 or for a function to return, or for a pointer to point to.
10522 After this sequence of ifs, TYPE is the type of the
10523 array or function or pointer, and DECLARATOR has had its
10524 outermost layer removed. */
10526 if (type
== error_mark_node
)
10528 if (TREE_CODE (declarator
) == SCOPE_REF
)
10529 declarator
= TREE_OPERAND (declarator
, 1);
10531 declarator
= TREE_OPERAND (declarator
, 0);
10534 if (quals
!= NULL_TREE
10535 && (declarator
== NULL_TREE
10536 || TREE_CODE (declarator
) != SCOPE_REF
))
10538 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
10539 ctype
= TYPE_METHOD_BASETYPE (type
);
10540 if (ctype
!= NULL_TREE
)
10542 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
10543 grok_method_quals (ctype
, dummy
, quals
);
10544 type
= TREE_TYPE (dummy
);
10545 ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
)));
10550 /* See the comment for the TREE_LIST case, below. */
10553 else if (inner_attrs
)
10555 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10556 inner_attrs
= NULL_TREE
;
10559 switch (TREE_CODE (declarator
))
10563 /* We encode a declarator with embedded attributes using
10564 a TREE_LIST. The attributes apply to the declarator
10565 directly inside them, so we have to skip an iteration
10566 before applying them to the type. If the declarator just
10567 inside is the declarator-id, we apply the attrs to the
10569 inner_attrs
= TREE_PURPOSE (declarator
);
10571 declarator
= TREE_VALUE (declarator
);
10577 register tree size
;
10579 size
= TREE_OPERAND (declarator
, 1);
10581 /* VC++ spells a zero-sized array with []. */
10582 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
10583 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10584 size
= integer_zero_node
;
10586 declarator
= TREE_OPERAND (declarator
, 0);
10588 type
= create_array_type_for_decl (dname
, type
, size
);
10590 /* VLAs never work as fields. */
10591 if (decl_context
== FIELD
&& !processing_template_decl
10592 && TREE_CODE (type
) == ARRAY_TYPE
10593 && TYPE_DOMAIN (type
) != NULL_TREE
10594 && !TREE_CONSTANT (TYPE_MAX_VALUE (TYPE_DOMAIN (type
))))
10596 cp_error ("size of member `%D' is not constant", dname
);
10597 /* Proceed with arbitrary constant size, so that offset
10598 computations don't get confused. */
10599 type
= create_array_type_for_decl (dname
, TREE_TYPE (type
),
10611 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
10612 tree inner_decl
= TREE_OPERAND (declarator
, 0);
10614 /* Declaring a function type.
10615 Make sure we have a valid type for the function to return. */
10617 /* We now know that the TYPE_QUALS don't apply to the
10618 decl, but to its return type. */
10619 type_quals
= TYPE_UNQUALIFIED
;
10621 /* Warn about some types functions can't return. */
10623 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10625 error ("`%s' declared as function returning a function", name
);
10626 type
= integer_type_node
;
10628 if (TREE_CODE (type
) == ARRAY_TYPE
)
10630 error ("`%s' declared as function returning an array", name
);
10631 type
= integer_type_node
;
10634 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
10635 inner_decl
= TREE_OPERAND (inner_decl
, 1);
10637 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
10638 inner_decl
= dname
;
10640 /* Pick up type qualifiers which should be applied to `this'. */
10641 quals
= CALL_DECLARATOR_QUALS (declarator
);
10643 /* Pick up the exception specifications. */
10644 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
10646 /* Say it's a definition only for the CALL_EXPR
10647 closest to the identifier. */
10650 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
10651 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
10652 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
10654 if (ctype
== NULL_TREE
10655 && decl_context
== FIELD
10657 && (friendp
== 0 || dname
== current_class_name
))
10658 ctype
= current_class_type
;
10660 if (ctype
&& sfk
== sfk_conversion
)
10661 TYPE_HAS_CONVERSION (ctype
) = 1;
10662 if (ctype
&& constructor_name (ctype
) == dname
)
10664 /* We are within a class's scope. If our declarator name
10665 is the same as the class name, and we are defining
10666 a function, then it is a constructor/destructor, and
10667 therefore returns a void type. */
10669 if (flags
== DTOR_FLAG
)
10671 /* ISO C++ 12.4/2. A destructor may not be
10672 declared const or volatile. A destructor may
10675 error ("destructor cannot be static member function");
10678 cp_error ("destructors may not be `%s'",
10679 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10682 if (decl_context
== FIELD
)
10684 if (! member_function_or_else (ctype
,
10685 current_class_type
,
10687 return void_type_node
;
10690 else /* It's a constructor. */
10692 if (explicitp
== 1)
10694 /* ISO C++ 12.1. A constructor may not be
10695 declared const or volatile. A constructor may
10696 not be virtual. A constructor may not be
10699 error ("constructor cannot be static member function");
10702 pedwarn ("constructors cannot be declared virtual");
10707 cp_error ("constructors may not be `%s'",
10708 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10712 RID_BIT_TYPE tmp_bits
;
10713 memcpy (&tmp_bits
, &specbits
, sizeof (RID_BIT_TYPE
));
10714 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10715 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10716 if (RIDBIT_ANY_SET (tmp_bits
))
10717 error ("return value type specifier for constructor ignored");
10719 if (decl_context
== FIELD
)
10721 if (! member_function_or_else (ctype
,
10722 current_class_type
,
10724 return void_type_node
;
10725 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10726 if (sfk
!= sfk_constructor
)
10730 if (decl_context
== FIELD
)
10736 error ("can't initialize friend function `%s'", name
);
10739 /* Cannot be both friend and virtual. */
10740 error ("virtual functions cannot be friends");
10741 RIDBIT_RESET (RID_FRIEND
, specbits
);
10744 if (decl_context
== NORMAL
)
10745 error ("friend declaration not in class definition");
10746 if (current_function_decl
&& funcdef_flag
)
10747 cp_error ("can't define friend function `%s' in a local class definition",
10751 /* Construct the function type and go to the next
10752 inner layer of declarator. */
10754 declarator
= TREE_OPERAND (declarator
, 0);
10756 /* FIXME: This is where default args should be fully
10759 arg_types
= grokparms (inner_parms
);
10761 if (declarator
&& flags
== DTOR_FLAG
)
10763 /* A destructor declared in the body of a class will
10764 be represented as a BIT_NOT_EXPR. But, we just
10765 want the underlying IDENTIFIER. */
10766 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10767 declarator
= TREE_OPERAND (declarator
, 0);
10769 if (arg_types
!= void_list_node
)
10771 cp_error ("destructors may not have parameters");
10772 arg_types
= void_list_node
;
10773 last_function_parms
= NULL_TREE
;
10777 /* ANSI says that `const int foo ();'
10778 does not make the function foo const. */
10779 type
= build_function_type (type
, arg_types
);
10783 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10784 if (TREE_PURPOSE (t
)
10785 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10787 add_defarg_fn (type
);
10796 /* Filter out pointers-to-references and references-to-references.
10797 We can get these if a TYPE_DECL is used. */
10799 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10801 error ("cannot declare %s to references",
10802 TREE_CODE (declarator
) == ADDR_EXPR
10803 ? "references" : "pointers");
10804 declarator
= TREE_OPERAND (declarator
, 0);
10808 if (TREE_CODE (type
) == OFFSET_TYPE
10809 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10810 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10812 cp_error ("cannot declare pointer to `%#T' member",
10814 type
= TREE_TYPE (type
);
10817 /* Merge any constancy or volatility into the target type
10818 for the pointer. */
10820 /* We now know that the TYPE_QUALS don't apply to the decl,
10821 but to the target of the pointer. */
10822 type_quals
= TYPE_UNQUALIFIED
;
10824 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10826 if (TREE_CODE (type
) == VOID_TYPE
)
10827 error ("invalid type: `void &'");
10829 type
= build_reference_type (type
);
10831 else if (TREE_CODE (type
) == METHOD_TYPE
)
10832 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10834 type
= build_pointer_type (type
);
10836 /* Process a list of type modifier keywords (such as
10837 const or volatile) that were given inside the `*' or `&'. */
10839 if (TREE_TYPE (declarator
))
10841 register tree typemodlist
;
10847 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10848 typemodlist
= TREE_CHAIN (typemodlist
))
10850 tree qualifier
= TREE_VALUE (typemodlist
);
10852 if (qualifier
== ridpointers
[(int) RID_CONST
])
10854 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10856 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10861 error ("invalid type modifier within pointer declarator");
10865 pedwarn ("duplicate `const'");
10867 pedwarn ("duplicate `volatile'");
10869 pedwarn ("duplicate `restrict'");
10871 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10872 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10873 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10874 if (TREE_CODE (declarator
) == ADDR_EXPR
10875 && (constp
|| volatilep
))
10878 pedwarn ("discarding `const' applied to a reference");
10880 pedwarn ("discarding `volatile' applied to a reference");
10881 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10883 type
= cp_build_qualified_type (type
, type_quals
);
10885 declarator
= TREE_OPERAND (declarator
, 0);
10891 /* We have converted type names to NULL_TREE if the
10892 name was bogus, or to a _TYPE node, if not.
10894 The variable CTYPE holds the type we will ultimately
10895 resolve to. The code here just needs to build
10896 up appropriate member types. */
10897 tree sname
= TREE_OPERAND (declarator
, 1);
10900 /* Destructors can have their visibilities changed as well. */
10901 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10902 sname
= TREE_OPERAND (sname
, 0);
10904 if (TREE_COMPLEXITY (declarator
) == 0)
10905 /* This needs to be here, in case we are called
10906 multiple times. */ ;
10907 else if (TREE_COMPLEXITY (declarator
) == -1)
10908 /* Namespace member. */
10909 pop_decl_namespace ();
10910 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10911 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10912 else if (! IS_AGGR_TYPE_CODE
10913 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10915 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10917 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10918 that refer to ctype. They couldn't be resolved earlier
10919 because we hadn't pushed into the class yet.
10920 Example: resolve 'B<T>::type' in
10921 'B<typename B<T>::type> B<T>::f () { }'. */
10922 if (current_template_parms
10923 && uses_template_parms (type
)
10924 && uses_template_parms (current_class_type
))
10926 tree args
= current_template_args ();
10927 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10930 /* This pop_nested_class corresponds to the
10931 push_nested_class used to push into class scope for
10932 parsing the argument list of a function decl, in
10934 pop_nested_class ();
10935 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10938 my_friendly_abort (16);
10940 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10942 /* We had a reference to a global decl, or
10943 perhaps we were given a non-aggregate typedef,
10944 in which case we cleared this out, and should just
10945 keep going as though it wasn't there. */
10946 declarator
= sname
;
10949 ctype
= TREE_OPERAND (declarator
, 0);
10952 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10954 /* You're supposed to have one `template <...>'
10955 for every template class, but you don't need one
10956 for a full specialization. For example:
10958 template <class T> struct S{};
10959 template <> struct S<int> { void f(); };
10960 void S<int>::f () {}
10962 is correct; there shouldn't be a `template <>' for
10963 the definition of `S<int>::f'. */
10964 if (CLASSTYPE_TEMPLATE_INFO (t
)
10965 && (CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
10966 || uses_template_parms (CLASSTYPE_TI_ARGS (t
))))
10967 template_count
+= 1;
10969 t
= TYPE_MAIN_DECL (t
);
10970 if (DECL_LANG_SPECIFIC (t
))
10971 t
= DECL_CONTEXT (t
);
10976 if (sname
== NULL_TREE
)
10979 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10981 /* This is the `standard' use of the scoping operator:
10982 basetype :: member . */
10984 if (ctype
== current_class_type
)
10990 Is this ill-formed? */
10993 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10996 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10998 if (current_class_type
== NULL_TREE
11000 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11001 TYPE_ARG_TYPES (type
));
11004 cp_error ("cannot declare member function `%T::%s' within `%T'",
11005 ctype
, name
, current_class_type
);
11006 return void_type_node
;
11009 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
11010 || COMPLETE_TYPE_P (complete_type (ctype
)))
11012 /* Have to move this code elsewhere in this function.
11013 this code is used for i.e., typedef int A::M; M *pm;
11015 It is? How? jason 10/2/94 */
11017 if (current_class_type
)
11019 cp_error ("cannot declare member `%T::%s' within `%T'",
11020 ctype
, name
, current_class_type
);
11021 return void_type_node
;
11023 type
= build_offset_type (ctype
, type
);
11025 else if (uses_template_parms (ctype
))
11027 if (TREE_CODE (type
) == FUNCTION_TYPE
)
11029 = build_cplus_method_type (ctype
, TREE_TYPE (type
),
11030 TYPE_ARG_TYPES (type
));
11034 cp_error ("structure `%T' not yet defined", ctype
);
11035 return error_mark_node
;
11038 declarator
= sname
;
11040 else if (TREE_CODE (sname
) == SCOPE_REF
)
11041 my_friendly_abort (17);
11045 declarator
= TREE_OPERAND (declarator
, 1);
11046 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
11047 /* In this case, we will deal with it later. */
11051 if (TREE_CODE (type
) == FUNCTION_TYPE
)
11052 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11053 TYPE_ARG_TYPES (type
));
11055 type
= build_offset_type (ctype
, type
);
11062 declarator
= TREE_OPERAND (declarator
, 0);
11067 case ENUMERAL_TYPE
:
11068 declarator
= NULL_TREE
;
11072 declarator
= NULL_TREE
;
11076 my_friendly_abort (158);
11080 /* See the comment for the TREE_LIST case, above. */
11083 if (! ignore_attrs
)
11084 decl_attributes (type
, inner_attrs
, NULL_TREE
);
11086 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
11088 attrlist
= build_tree_list (NULL_TREE
, inner_attrs
);
11091 /* Now TYPE has the actual type. */
11093 if (explicitp
== 1 || (explicitp
&& friendp
))
11095 /* [dcl.fct.spec] The explicit specifier shall only be used in
11096 declarations of constructors within a class definition. */
11097 error ("only declarations of constructors can be `explicit'");
11101 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11103 if (current_class_name
== NULL_TREE
|| decl_context
== PARM
|| friendp
)
11105 error ("non-member `%s' cannot be declared `mutable'", name
);
11106 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11108 else if (decl_context
== TYPENAME
|| RIDBIT_SETP (RID_TYPEDEF
, specbits
))
11110 error ("non-object member `%s' cannot be declared `mutable'", name
);
11111 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11113 else if (TREE_CODE (type
) == FUNCTION_TYPE
11114 || TREE_CODE (type
) == METHOD_TYPE
)
11116 error ("function `%s' cannot be declared `mutable'", name
);
11117 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11121 error ("static `%s' cannot be declared `mutable'", name
);
11122 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11124 else if (type_quals
& TYPE_QUAL_CONST
)
11126 error ("const `%s' cannot be declared `mutable'", name
);
11127 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11131 if (declarator
== NULL_TREE
11132 || TREE_CODE (declarator
) == IDENTIFIER_NODE
11133 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
11134 && (TREE_CODE (type
) == FUNCTION_TYPE
11135 || TREE_CODE (type
) == METHOD_TYPE
)))
11137 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11139 cp_error ("template-id `%D' used as a declarator", declarator
);
11140 declarator
= dname
;
11143 /* Unexpected declarator format. */
11144 my_friendly_abort (990210);
11146 /* If this is declaring a typedef name, return a TYPE_DECL. */
11148 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
11152 /* Note that the grammar rejects storage classes
11153 in typenames, fields or parameters. */
11154 if (current_lang_name
== lang_name_java
)
11155 TYPE_FOR_JAVA (type
) = 1;
11157 if (decl_context
== FIELD
)
11159 if (declarator
== constructor_name (current_class_type
))
11160 cp_pedwarn ("ISO C++ forbids nested type `%D' with same name as enclosing class",
11162 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
11165 decl
= build_decl (TYPE_DECL
, declarator
, type
);
11167 /* If the user declares "typedef struct {...} foo" then the
11168 struct will have an anonymous name. Fill that name in now.
11169 Nothing can refer to it, so nothing needs know about the name
11171 if (type
!= error_mark_node
11173 && TYPE_NAME (type
)
11174 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
11175 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
11176 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
11178 tree oldname
= TYPE_NAME (type
);
11181 /* Replace the anonymous name with the real name everywhere. */
11182 lookup_tag_reverse (type
, declarator
);
11183 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
11184 if (TYPE_NAME (t
) == oldname
)
11185 TYPE_NAME (t
) = decl
;
11187 if (TYPE_LANG_SPECIFIC (type
))
11188 TYPE_WAS_ANONYMOUS (type
) = 1;
11190 /* If this is a typedef within a template class, the nested
11191 type is a (non-primary) template. The name for the
11192 template needs updating as well. */
11193 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
11194 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
11195 = TYPE_IDENTIFIER (type
);
11198 DECL_ASSEMBLER_NAME (decl
) = mangle_type (type
);
11201 /* XXX Temporarily set the scope.
11202 When returning, start_decl expects it as NULL_TREE,
11203 and will then then set it using pushdecl. */
11204 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
11205 if (current_class_type
)
11206 DECL_CONTEXT (decl
) = current_class_type
;
11208 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
11210 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
11211 DECL_ASSEMBLER_NAME (decl
)
11212 = get_identifier (build_overload_name (type
, 1, 1));
11213 DECL_CONTEXT (decl
) = NULL_TREE
;
11216 /* FIXME remangle member functions; member functions of a
11217 type with external linkage have external linkage. */
11220 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11222 cp_error_at ("typedef name may not be class-qualified", decl
);
11227 if (ctype
== NULL_TREE
)
11229 if (TREE_CODE (type
) != METHOD_TYPE
)
11230 cp_error_at ("invalid type qualifier for non-member function type", decl
);
11232 ctype
= TYPE_METHOD_BASETYPE (type
);
11234 if (ctype
!= NULL_TREE
)
11235 grok_method_quals (ctype
, decl
, quals
);
11238 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
11239 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
11240 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
11242 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
11243 inlinep
, friendp
, raises
!= NULL_TREE
);
11246 error ("typedef declaration includes an initializer");
11251 /* Detect the case of an array type of unspecified size
11252 which came, as such, direct from a typedef name.
11253 We must copy the type, so that each identifier gets
11254 a distinct type, so that each identifier's size can be
11255 controlled separately by its own initializer. */
11257 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
11258 && TYPE_DOMAIN (type
) == NULL_TREE
)
11260 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
11263 /* If this is a type name (such as, in a cast or sizeof),
11264 compute the type and return it now. */
11266 if (decl_context
== TYPENAME
)
11268 /* Note that the grammar rejects storage classes
11269 in typenames, fields or parameters. */
11270 if (type_quals
!= TYPE_UNQUALIFIED
)
11271 type_quals
= TYPE_UNQUALIFIED
;
11273 /* Special case: "friend class foo" looks like a TYPENAME context. */
11276 if (type_quals
!= TYPE_UNQUALIFIED
)
11278 cp_error ("type qualifiers specified for friend class declaration");
11279 type_quals
= TYPE_UNQUALIFIED
;
11283 cp_error ("`inline' specified for friend class declaration");
11287 /* Until core issue 180 is resolved, allow 'friend typename A::B'.
11288 But don't allow implicit typenames. */
11289 if (!current_aggr
&& (TREE_CODE (type
) != TYPENAME_TYPE
11290 || IMPLICIT_TYPENAME_P (type
)))
11292 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
11293 cp_pedwarn ("template parameters cannot be friends");
11294 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
11296 friend declaration requires class-key, i.e. `friend class %T::%T'",
11297 constructor_name (current_class_type
),
11298 TYPE_IDENTIFIER (type
));
11301 friend declaration requires class-key, i.e. `friend %#T'",
11305 /* Only try to do this stuff if we didn't already give up. */
11306 if (type
!= integer_type_node
)
11308 decl_type_access_control (TYPE_NAME (type
));
11310 /* A friendly class? */
11311 if (current_class_type
)
11312 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
11314 cp_error ("trying to make class `%T' a friend of global scope",
11317 type
= void_type_node
;
11322 if (ctype
== NULL_TREE
)
11324 if (TREE_CODE (type
) != METHOD_TYPE
)
11325 cp_error ("invalid qualifiers on non-member function type");
11327 ctype
= TYPE_METHOD_BASETYPE (type
);
11331 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
11332 grok_method_quals (ctype
, dummy
, quals
);
11333 type
= TREE_TYPE (dummy
);
11339 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
11340 && decl_context
!= CATCHPARM
11341 && TREE_CODE (type
) != UNION_TYPE
11344 cp_error ("abstract declarator `%T' used as declaration", type
);
11345 declarator
= make_anon_name ();
11348 /* `void' at top level (not within pointer)
11349 is allowed only in typedefs or type names.
11350 We don't complain about parms either, but that is because
11351 a better error message can be made later. */
11353 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
11356 error ("unnamed variable or field declared void");
11357 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
11359 if (IDENTIFIER_OPNAME_P (declarator
))
11360 my_friendly_abort (356);
11362 error ("variable or field `%s' declared void", name
);
11365 error ("variable or field declared void");
11366 type
= integer_type_node
;
11369 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
11370 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
11372 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
11374 if (ctype
|| in_namespace
)
11375 error ("cannot use `::' in parameter declaration");
11377 /* A parameter declared as an array of T is really a pointer to T.
11378 One declared as a function is really a pointer to a function.
11379 One declared as a member is really a pointer to member. */
11381 if (TREE_CODE (type
) == ARRAY_TYPE
)
11383 /* Transfer const-ness of array into that of type pointed to. */
11384 type
= build_pointer_type (TREE_TYPE (type
));
11385 type_quals
= TYPE_UNQUALIFIED
;
11387 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11388 type
= build_pointer_type (type
);
11389 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11390 type
= build_pointer_type (type
);
11394 register tree decl
;
11396 if (decl_context
== PARM
)
11398 decl
= build_decl (PARM_DECL
, declarator
, type
);
11400 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
11401 inlinep
, friendp
, raises
!= NULL_TREE
);
11403 /* Compute the type actually passed in the parmlist,
11404 for the case where there is no prototype.
11405 (For example, shorts and chars are passed as ints.)
11406 When there is a prototype, this is overridden later. */
11408 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
11410 else if (decl_context
== FIELD
)
11412 if (type
== error_mark_node
)
11414 /* Happens when declaring arrays of sizes which
11415 are error_mark_node, for example. */
11418 else if (in_namespace
&& !friendp
)
11420 /* Something like struct S { int N::j; }; */
11421 cp_error ("invalid use of `::'");
11424 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11427 tree function_context
;
11429 /* We catch the others as conflicts with the builtin
11431 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
11433 cp_error ("function `%D' cannot be declared friend",
11440 if (ctype
== NULL_TREE
)
11441 ctype
= current_class_type
;
11443 if (ctype
== NULL_TREE
)
11445 cp_error ("can't make `%D' into a method -- not in a class",
11447 return void_type_node
;
11450 /* ``A union may [ ... ] not [ have ] virtual functions.''
11452 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
11454 cp_error ("function `%D' declared virtual inside a union",
11456 return void_type_node
;
11459 if (declarator
== ansi_opname (NEW_EXPR
)
11460 || declarator
== ansi_opname (VEC_NEW_EXPR
)
11461 || declarator
== ansi_opname (DELETE_EXPR
)
11462 || declarator
== ansi_opname (VEC_DELETE_EXPR
))
11466 cp_error ("`%D' cannot be declared virtual, since it is always static",
11471 else if (staticp
< 2)
11472 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11473 TYPE_ARG_TYPES (type
));
11476 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
11477 function_context
= (ctype
!= NULL_TREE
) ?
11478 decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
11479 publicp
= (! friendp
|| ! staticp
)
11480 && function_context
== NULL_TREE
;
11481 decl
= grokfndecl (ctype
, type
,
11482 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
11483 ? declarator
: dname
,
11485 virtualp
, flags
, quals
, raises
,
11486 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
11487 funcdef_flag
, template_count
, in_namespace
);
11488 if (decl
== NULL_TREE
)
11491 /* This clobbers the attrs stored in `decl' from `attrlist'. */
11492 /* The decl and setting of decl_machine_attr is also turned off. */
11493 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
11496 /* [class.conv.ctor]
11498 A constructor declared without the function-specifier
11499 explicit that can be called with a single parameter
11500 specifies a conversion from the type of its first
11501 parameter to the type of its class. Such a constructor
11502 is called a converting constructor. */
11503 if (explicitp
== 2)
11504 DECL_NONCONVERTING_P (decl
) = 1;
11505 else if (DECL_CONSTRUCTOR_P (decl
))
11507 /* The constructor can be called with exactly one
11508 parameter if there is at least one parameter, and
11509 any subsequent parameters have default arguments.
11510 We don't look at the first parameter, which is
11511 really just the `this' parameter for the new
11514 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
11516 /* Skip the `in_chrg' argument too, if present. */
11517 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
11518 arg_types
= TREE_CHAIN (arg_types
);
11520 if (arg_types
== void_list_node
11522 && TREE_CHAIN (arg_types
)
11523 && TREE_CHAIN (arg_types
) != void_list_node
11524 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
11525 DECL_NONCONVERTING_P (decl
) = 1;
11528 else if (TREE_CODE (type
) == METHOD_TYPE
)
11530 /* We only get here for friend declarations of
11531 members of other classes. */
11532 /* All method decls are public, so tell grokfndecl to set
11533 TREE_PUBLIC, also. */
11534 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
11535 virtualp
, flags
, quals
, raises
,
11536 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
11537 template_count
, in_namespace
);
11538 if (decl
== NULL_TREE
)
11541 else if (!staticp
&& ! processing_template_decl
11542 && !COMPLETE_TYPE_P (complete_type (type
))
11543 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
11546 cp_error ("field `%D' has incomplete type", declarator
);
11548 cp_error ("name `%T' has incomplete type", type
);
11550 /* If we're instantiating a template, tell them which
11551 instantiation made the field's type be incomplete. */
11552 if (current_class_type
11553 && TYPE_NAME (current_class_type
)
11554 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
11555 && declspecs
&& TREE_VALUE (declspecs
)
11556 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
11557 cp_error (" in instantiation of template `%T'",
11558 current_class_type
);
11560 type
= error_mark_node
;
11567 error ("`%s' is neither function nor member function; cannot be declared friend",
11568 IDENTIFIER_POINTER (declarator
));
11576 /* Friends are treated specially. */
11577 if (ctype
== current_class_type
)
11578 warning ("member functions are implicitly friends of their class");
11581 tree t
= NULL_TREE
;
11582 if (decl
&& DECL_NAME (decl
))
11584 if (template_class_depth (current_class_type
) == 0)
11587 = check_explicit_specialization
11589 template_count
, 2 * (funcdef_flag
!= 0) + 4);
11590 if (decl
== error_mark_node
)
11591 return error_mark_node
;
11594 t
= do_friend (ctype
, declarator
, decl
,
11595 last_function_parms
, attrlist
, flags
, quals
,
11598 if (t
&& funcdef_flag
)
11601 return void_type_node
;
11605 /* Structure field. It may not be a function, except for C++ */
11607 if (decl
== NULL_TREE
)
11613 /* An attempt is being made to initialize a non-static
11614 member. But, from [class.mem]:
11616 4 A member-declarator can contain a
11617 constant-initializer only if it declares a static
11618 member (_class.static_) of integral or enumeration
11619 type, see _class.static.data_.
11621 This used to be relatively common practice, but
11622 the rest of the compiler does not correctly
11623 handle the initialization unless the member is
11624 static so we make it static below. */
11625 cp_pedwarn ("ISO C++ forbids initialization of member `%D'",
11627 cp_pedwarn ("making `%D' static", declarator
);
11631 if (uses_template_parms (type
))
11632 /* We'll check at instantiation time. */
11634 else if (check_static_variable_definition (declarator
,
11636 /* If we just return the declaration, crashes
11637 will sometimes occur. We therefore return
11638 void_type_node, as if this was a friend
11639 declaration, to cause callers to completely
11640 ignore this declaration. */
11641 return void_type_node
;
11644 /* 9.2p13 [class.mem] */
11645 if (declarator
== constructor_name (current_class_type
)
11646 /* The standard does not allow non-static data members
11647 here either, but we agreed at the 10/99 meeting
11648 to change that in TC 1 so that they are allowed in
11649 classes with no user-defined constructors. */
11651 cp_pedwarn ("ISO C++ forbids static data member `%D' with same name as enclosing class",
11656 /* C++ allows static class members. All other work
11657 for this is done by grokfield. */
11658 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
11659 TREE_STATIC (decl
) = 1;
11660 /* In class context, 'static' means public access. */
11661 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
11665 decl
= build_decl (FIELD_DECL
, declarator
, type
);
11666 DECL_NONADDRESSABLE_P (decl
) = bitfield
;
11667 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11669 DECL_MUTABLE_P (decl
) = 1;
11670 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11674 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
11675 inlinep
, friendp
, raises
!= NULL_TREE
);
11678 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11680 tree original_name
;
11686 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11687 original_name
= dname
;
11689 original_name
= declarator
;
11691 if (RIDBIT_SETP (RID_AUTO
, specbits
))
11692 error ("storage class `auto' invalid for function `%s'", name
);
11693 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11694 error ("storage class `register' invalid for function `%s'", name
);
11696 /* Function declaration not at top level.
11697 Storage classes other than `extern' are not allowed
11698 and `extern' makes no difference. */
11699 if (! toplevel_bindings_p ()
11700 && (RIDBIT_SETP (RID_STATIC
, specbits
)
11701 || RIDBIT_SETP (RID_INLINE
, specbits
))
11704 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11705 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
11707 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
11710 if (ctype
== NULL_TREE
)
11714 error ("virtual non-class function `%s'", name
);
11718 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
11719 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11720 TYPE_ARG_TYPES (type
));
11722 /* Record presence of `static'. */
11723 publicp
= (ctype
!= NULL_TREE
11724 || RIDBIT_SETP (RID_EXTERN
, specbits
)
11725 || !RIDBIT_SETP (RID_STATIC
, specbits
));
11727 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
11728 virtualp
, flags
, quals
, raises
,
11730 publicp
, inlinep
, funcdef_flag
,
11731 template_count
, in_namespace
);
11732 if (decl
== NULL_TREE
)
11737 int illegal_static
= 0;
11739 /* Don't allow a static member function in a class, and forbid
11740 declaring main to be static. */
11741 if (TREE_CODE (type
) == METHOD_TYPE
)
11743 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11744 illegal_static
= 1;
11746 else if (current_function_decl
)
11748 /* FIXME need arm citation */
11749 error ("cannot declare static function inside another function");
11750 illegal_static
= 1;
11753 if (illegal_static
)
11756 RIDBIT_RESET (RID_STATIC
, specbits
);
11762 /* It's a variable. */
11764 /* An uninitialized decl with `extern' is a reference. */
11765 decl
= grokvardecl (type
, declarator
, &specbits
,
11767 (type_quals
& TYPE_QUAL_CONST
) != 0,
11769 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11770 inlinep
, friendp
, raises
!= NULL_TREE
);
11774 DECL_CONTEXT (decl
) = ctype
;
11777 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11779 RIDBIT_RESET (RID_STATIC
, specbits
);
11781 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11783 cp_error ("static member `%D' declared `register'", decl
);
11784 RIDBIT_RESET (RID_REGISTER
, specbits
);
11786 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11788 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11790 RIDBIT_RESET (RID_EXTERN
, specbits
);
11795 my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE
, specbits
), 19990927);
11797 /* Record `register' declaration for warnings on &
11798 and in case doing stupid register allocation. */
11800 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11801 DECL_REGISTER (decl
) = 1;
11803 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11804 DECL_THIS_EXTERN (decl
) = 1;
11806 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11807 DECL_THIS_STATIC (decl
) = 1;
11809 /* Record constancy and volatility. There's no need to do this
11810 when processing a template; we'll do this for the instantiated
11811 declaration based on the type of DECL. */
11812 if (!processing_template_decl
)
11813 c_apply_type_quals_to_decl (type_quals
, decl
);
11819 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11820 An empty exprlist is a parmlist. An exprlist which
11821 contains only identifiers at the global level
11822 is a parmlist. Otherwise, it is an exprlist. */
11825 parmlist_is_exprlist (exprs
)
11828 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11831 if (toplevel_bindings_p ())
11833 /* At the global level, if these are all identifiers,
11834 then it is a parmlist. */
11837 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11839 exprs
= TREE_CHAIN (exprs
);
11846 /* Subroutine of start_function. Ensure that each of the parameter
11847 types (as listed in PARMS) is complete, as is required for a
11848 function definition. */
11851 require_complete_types_for_parms (parms
)
11854 for (; parms
; parms
= TREE_CHAIN (parms
))
11856 if (VOID_TYPE_P (TREE_TYPE (parms
)))
11857 /* grokparms will have already issued an error */
11858 TREE_TYPE (parms
) = error_mark_node
;
11859 else if (complete_type_or_else (TREE_TYPE (parms
), parms
))
11860 layout_decl (parms
, 0);
11862 TREE_TYPE (parms
) = error_mark_node
;
11866 /* Returns non-zero if T is a local variable. */
11869 local_variable_p (t
)
11872 if ((TREE_CODE (t
) == VAR_DECL
11873 /* A VAR_DECL with a context that is a _TYPE is a static data
11875 && !TYPE_P (CP_DECL_CONTEXT (t
))
11876 /* Any other non-local variable must be at namespace scope. */
11877 && !DECL_NAMESPACE_SCOPE_P (t
))
11878 || (TREE_CODE (t
) == PARM_DECL
))
11884 /* Returns non-zero if T is an automatic local variable or a label.
11885 (These are the declarations that need to be remapped when the code
11886 containing them is duplicated.) */
11889 nonstatic_local_decl_p (t
)
11892 return ((local_variable_p (t
) && !TREE_STATIC (t
))
11893 || TREE_CODE (t
) == LABEL_DECL
11894 || TREE_CODE (t
) == RESULT_DECL
);
11897 /* Like local_variable_p, but suitable for use as a tree-walking
11901 local_variable_p_walkfn (tp
, walk_subtrees
, data
)
11903 int *walk_subtrees ATTRIBUTE_UNUSED
;
11904 void *data ATTRIBUTE_UNUSED
;
11906 return ((local_variable_p (*tp
) && !DECL_ARTIFICIAL (*tp
))
11907 ? *tp
: NULL_TREE
);
11910 /* Check that ARG, which is a default-argument expression for a
11911 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11912 something goes wrong. DECL may also be a _TYPE node, rather than a
11913 DECL, if there is no DECL available. */
11916 check_default_argument (decl
, arg
)
11923 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11924 /* We get a DEFAULT_ARG when looking at an in-class declaration
11925 with a default argument. Ignore the argument for now; we'll
11926 deal with it after the class is complete. */
11929 if (processing_template_decl
|| uses_template_parms (arg
))
11930 /* We don't do anything checking until instantiation-time. Note
11931 that there may be uninstantiated arguments even for an
11932 instantiated function, since default arguments are not
11933 instantiated until they are needed. */
11942 decl_type
= TREE_TYPE (decl
);
11944 if (arg
== error_mark_node
11945 || decl
== error_mark_node
11946 || TREE_TYPE (arg
) == error_mark_node
11947 || decl_type
== error_mark_node
)
11948 /* Something already went wrong. There's no need to check
11950 return error_mark_node
;
11952 /* [dcl.fct.default]
11954 A default argument expression is implicitly converted to the
11956 if (!TREE_TYPE (arg
)
11957 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11960 cp_error ("default argument for `%#D' has type `%T'",
11961 decl
, TREE_TYPE (arg
));
11963 cp_error ("default argument for parameter of type `%T' has type `%T'",
11964 decl_type
, TREE_TYPE (arg
));
11966 return error_mark_node
;
11969 /* [dcl.fct.default]
11971 Local variables shall not be used in default argument
11974 The keyword `this' shall not be used in a default argument of a
11975 member function. */
11976 var
= walk_tree_without_duplicates (&arg
, local_variable_p_walkfn
,
11980 cp_error ("default argument `%E' uses local variable `%D'",
11982 return error_mark_node
;
11989 /* Decode the list of parameter types for a function type.
11990 Given the list of things declared inside the parens,
11991 return a list of types.
11993 We determine whether ellipsis parms are used by PARMLIST_ELLIPSIS_P
11994 flag. If unset, we append void_list_node. A parmlist declared
11995 as `(void)' is accepted as the empty parmlist.
11997 Also set last_function_parms to the chain of PARM_DECLs. */
12000 grokparms (first_parm
)
12003 tree result
= NULL_TREE
;
12004 tree decls
= NULL_TREE
;
12005 int ellipsis
= !first_parm
|| PARMLIST_ELLIPSIS_P (first_parm
);
12009 my_friendly_assert (!first_parm
|| TREE_PARMLIST (first_parm
), 20001115);
12011 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
12013 tree type
= NULL_TREE
;
12014 register tree decl
= TREE_VALUE (parm
);
12015 tree init
= TREE_PURPOSE (parm
);
12017 chain
= TREE_CHAIN (parm
);
12018 /* @@ weak defense against parse errors. */
12019 if (TREE_CODE (decl
) != VOID_TYPE
12020 && TREE_CODE (decl
) != TREE_LIST
)
12022 /* Give various messages as the need arises. */
12023 if (TREE_CODE (decl
) == STRING_CST
)
12024 cp_error ("invalid string constant `%E'", decl
);
12025 else if (TREE_CODE (decl
) == INTEGER_CST
)
12026 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
12030 if (parm
== void_list_node
)
12033 decl
= grokdeclarator (TREE_VALUE (decl
), TREE_PURPOSE (decl
),
12034 PARM
, init
!= NULL_TREE
, NULL_TREE
);
12035 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
12038 type
= TREE_TYPE (decl
);
12039 if (VOID_TYPE_P (type
))
12041 if (same_type_p (type
, void_type_node
)
12042 && !DECL_NAME (decl
) && !result
&& !chain
&& !ellipsis
)
12043 /* this is a parmlist of `(void)', which is ok. */
12045 incomplete_type_error (decl
, type
);
12046 /* It's not a good idea to actually create parameters of
12047 type `void'; other parts of the compiler assume that a
12048 void type terminates the parameter list. */
12049 type
= error_mark_node
;
12050 TREE_TYPE (decl
) = error_mark_node
;
12053 if (type
!= error_mark_node
)
12055 /* Top-level qualifiers on the parameters are
12056 ignored for function types. */
12057 type
= TYPE_MAIN_VARIANT (type
);
12058 if (TREE_CODE (type
) == METHOD_TYPE
)
12060 cp_error ("parameter `%D' invalidly declared method type", decl
);
12061 type
= build_pointer_type (type
);
12062 TREE_TYPE (decl
) = type
;
12064 else if (TREE_CODE (type
) == OFFSET_TYPE
)
12066 cp_error ("parameter `%D' invalidly declared offset type", decl
);
12067 type
= build_pointer_type (type
);
12068 TREE_TYPE (decl
) = type
;
12070 else if (abstract_virtuals_error (decl
, type
))
12071 any_error
= 1; /* Seems like a good idea. */
12072 else if (POINTER_TYPE_P (type
))
12074 /* [dcl.fct]/6, parameter types cannot contain pointers
12075 (references) to arrays of unknown bound. */
12078 while (POINTER_TYPE_P (t
)
12079 || (TREE_CODE (t
) == ARRAY_TYPE
12080 && TYPE_DOMAIN (t
) != NULL_TREE
))
12082 if (TREE_CODE (t
) == ARRAY_TYPE
)
12083 cp_error ("parameter `%D' includes %s to array of unknown bound `%T'",
12084 decl
, TYPE_PTR_P (type
) ? "pointer" : "reference", t
);
12087 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
12088 if (PROMOTE_PROTOTYPES
12089 && (TREE_CODE (type
) == INTEGER_TYPE
12090 || TREE_CODE (type
) == ENUMERAL_TYPE
)
12091 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
12092 DECL_ARG_TYPE (decl
) = integer_type_node
;
12093 if (!any_error
&& init
)
12094 init
= check_default_argument (decl
, init
);
12099 TREE_CHAIN (decl
) = decls
;
12101 result
= tree_cons (init
, type
, result
);
12103 decls
= nreverse (decls
);
12104 result
= nreverse (result
);
12106 result
= chainon (result
, void_list_node
);
12107 last_function_parms
= decls
;
12112 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
12113 FUNCTION_TYPE with the newly parsed version of its default argument, which
12114 was previously digested as text. See snarf_defarg et al in lex.c. */
12117 replace_defarg (arg
, init
)
12120 if (! processing_template_decl
12121 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
12122 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
12123 TREE_TYPE (init
), TREE_VALUE (arg
));
12124 TREE_PURPOSE (arg
) = init
;
12127 /* D is a constructor or overloaded `operator='. Returns non-zero if
12128 D's arguments allow it to be a copy constructor, or copy assignment
12137 if (!DECL_FUNCTION_MEMBER_P (d
))
12140 t
= FUNCTION_ARG_CHAIN (d
);
12141 if (DECL_CONSTRUCTOR_P (d
) && DECL_HAS_IN_CHARGE_PARM_P (d
))
12142 t
= TREE_CHAIN (t
);
12143 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
12144 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
12145 == DECL_CONTEXT (d
))
12146 && (TREE_CHAIN (t
) == NULL_TREE
12147 || TREE_CHAIN (t
) == void_list_node
12148 || TREE_PURPOSE (TREE_CHAIN (t
))))
12153 /* These memoizing functions keep track of special properties which
12154 a class may have. `grok_ctor_properties' notices whether a class
12155 has a constructor of the form X(X&), and also complains
12156 if the class has a constructor of the form X(X).
12157 `grok_op_properties' takes notice of the various forms of
12158 operator= which are defined, as well as what sorts of type conversion
12159 may apply. Both functions take a FUNCTION_DECL as an argument. */
12162 grok_ctor_properties (ctype
, decl
)
12165 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
12166 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
12168 /* When a type has virtual baseclasses, a magical first int argument is
12169 added to any ctor so we can tell if the class has been initialized
12170 yet. This could screw things up in this function, so we deliberately
12171 ignore the leading int if we're in that situation. */
12172 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
12174 my_friendly_assert (parmtypes
12175 && TREE_VALUE (parmtypes
) == integer_type_node
,
12177 parmtypes
= TREE_CHAIN (parmtypes
);
12178 parmtype
= TREE_VALUE (parmtypes
);
12183 A non-template constructor for class X is a copy constructor if
12184 its first parameter is of type X&, const X&, volatile X& or const
12185 volatile X&, and either there are no other parameters or else all
12186 other parameters have default arguments. */
12187 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
12188 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
12189 && (TREE_CHAIN (parmtypes
) == NULL_TREE
12190 || TREE_CHAIN (parmtypes
) == void_list_node
12191 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
12192 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12193 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12195 TYPE_HAS_INIT_REF (ctype
) = 1;
12196 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12197 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
12201 A declaration of a constructor for a class X is ill-formed if its
12202 first parameter is of type (optionally cv-qualified) X and either
12203 there are no other parameters or else all other parameters have
12206 We *don't* complain about member template instantiations that
12207 have this form, though; they can occur as we try to decide what
12208 constructor to use during overload resolution. Since overload
12209 resolution will never prefer such a constructor to the
12210 non-template copy constructor (which is either explicitly or
12211 implicitly defined), there's no need to worry about their
12212 existence. Theoretically, they should never even be
12213 instantiated, but that's hard to forestall. */
12214 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
12215 && (TREE_CHAIN (parmtypes
) == NULL_TREE
12216 || TREE_CHAIN (parmtypes
) == void_list_node
12217 || TREE_PURPOSE (TREE_CHAIN (parmtypes
)))
12218 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12219 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12221 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
12223 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
12226 else if (TREE_CODE (parmtype
) == VOID_TYPE
12227 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
12228 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
12233 /* An operator with this code is unary, but can also be binary. */
12237 enum tree_code code
;
12239 return (code
== INDIRECT_REF
12240 || code
== ADDR_EXPR
12241 || code
== CONVERT_EXPR
12242 || code
== NEGATE_EXPR
12243 || code
== PREINCREMENT_EXPR
12244 || code
== PREDECREMENT_EXPR
);
12247 /* An operator with this name can only be unary. */
12251 enum tree_code code
;
12253 return (code
== TRUTH_NOT_EXPR
12254 || code
== BIT_NOT_EXPR
12255 || code
== COMPONENT_REF
12256 || code
== TYPE_EXPR
);
12259 /* Do a little sanity-checking on how they declared their operator. */
12262 grok_op_properties (decl
, virtualp
, friendp
)
12264 int virtualp
, friendp
;
12266 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
12268 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
12269 tree name
= DECL_NAME (decl
);
12270 enum tree_code operator_code
;
12273 /* Count the number of arguments. */
12274 for (argtype
= argtypes
, arity
= 0;
12275 argtype
&& argtype
!= void_list_node
;
12276 argtype
= TREE_CHAIN (argtype
))
12279 if (current_class_type
== NULL_TREE
)
12282 if (DECL_CONV_FN_P (decl
))
12283 operator_code
= TYPE_EXPR
;
12287 #define DEF_OPERATOR(NAME, CODE, NEW_MANGLING, OLD_MANGING, ARITY, ASSN_P) \
12288 if (ansi_opname (CODE) == name) \
12290 operator_code = CODE; \
12293 else if (ansi_assopname (CODE) == name) \
12295 operator_code = CODE; \
12296 DECL_ASSIGNMENT_OPERATOR_P (decl) = 1; \
12300 #include "operators.def"
12301 #undef DEF_OPERATOR
12303 my_friendly_abort (20000527);
12306 my_friendly_assert (operator_code
!= LAST_CPLUS_TREE_CODE
, 20000526);
12307 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12311 switch (operator_code
)
12314 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
12318 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
12321 case COMPONENT_REF
:
12323 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
12327 TYPE_HAS_NEW_OPERATOR (current_class_type
) = 1;
12331 TYPE_GETS_DELETE (current_class_type
) |= 1;
12335 TYPE_HAS_ARRAY_NEW_OPERATOR (current_class_type
) = 1;
12338 case VEC_DELETE_EXPR
:
12339 TYPE_GETS_DELETE (current_class_type
) |= 2;
12347 if (operator_code
== NEW_EXPR
|| operator_code
== VEC_NEW_EXPR
)
12349 /* When the compiler encounters the definition of A::operator new, it
12350 doesn't look at the class declaration to find out if it's static. */
12352 revert_static_member_fn (decl
);
12354 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
12356 else if (operator_code
== DELETE_EXPR
|| operator_code
== VEC_DELETE_EXPR
)
12359 revert_static_member_fn (decl
);
12361 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
12365 /* An operator function must either be a non-static member function
12366 or have at least one parameter of a class, a reference to a class,
12367 an enumeration, or a reference to an enumeration. 13.4.0.6 */
12368 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
12370 if (operator_code
== TYPE_EXPR
12371 || operator_code
== CALL_EXPR
12372 || operator_code
== COMPONENT_REF
12373 || operator_code
== ARRAY_REF
12374 || operator_code
== NOP_EXPR
)
12375 cp_error ("`%D' must be a nonstatic member function", decl
);
12380 if (DECL_STATIC_FUNCTION_P (decl
))
12381 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
12384 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
12386 tree arg
= TREE_VALUE (p
);
12387 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
12388 arg
= TREE_TYPE (arg
);
12390 /* This lets bad template code slip through. */
12391 if (IS_AGGR_TYPE (arg
)
12392 || TREE_CODE (arg
) == ENUMERAL_TYPE
12393 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
12394 || TREE_CODE (arg
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
12398 ("`%D' must have an argument of class or enumerated type",
12405 if (operator_code
== CALL_EXPR
)
12406 return; /* No restrictions on args. */
12408 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
12410 tree t
= TREE_TYPE (name
);
12413 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
12414 const char *what
= 0;
12417 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
12419 if (TREE_CODE (t
) == VOID_TYPE
)
12421 else if (t
== current_class_type
)
12422 what
= "the same type";
12423 /* Don't force t to be complete here. */
12424 else if (IS_AGGR_TYPE (t
)
12425 && COMPLETE_TYPE_P (t
)
12426 && DERIVED_FROM_P (t
, current_class_type
))
12427 what
= "a base class";
12430 warning ("conversion to %s%s will never use a type conversion operator",
12431 ref
? "a reference to " : "", what
);
12435 if (DECL_ASSIGNMENT_OPERATOR_P (decl
)
12436 && operator_code
== NOP_EXPR
)
12440 if (arity
!= 2 && methodp
)
12442 cp_error ("`%D' must take exactly one argument", decl
);
12445 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
12449 A user-declared copy assignment operator X::operator= is
12450 a non-static non-template member function of class X with
12451 exactly one parameter of type X, X&, const X&, volatile
12452 X& or const volatile X&. */
12453 if (copy_assignment_arg_p (parmtype
, virtualp
)
12454 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12455 && is_member_template (DECL_TI_TEMPLATE (decl
)))
12458 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
12459 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
12460 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12461 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
12464 else if (operator_code
== COND_EXPR
)
12467 cp_error ("ISO C++ prohibits overloading operator ?:");
12469 else if (ambi_op_p (operator_code
))
12472 /* We pick the one-argument operator codes by default, so
12473 we don't have to change anything. */
12475 else if (arity
== 2)
12477 /* If we thought this was a unary operator, we now know
12478 it to be a binary operator. */
12479 switch (operator_code
)
12482 operator_code
= MULT_EXPR
;
12486 operator_code
= BIT_AND_EXPR
;
12490 operator_code
= PLUS_EXPR
;
12494 operator_code
= MINUS_EXPR
;
12497 case PREINCREMENT_EXPR
:
12498 operator_code
= POSTINCREMENT_EXPR
;
12501 case PREDECREMENT_EXPR
:
12502 operator_code
= POSTDECREMENT_EXPR
;
12506 my_friendly_abort (20000527);
12509 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12511 if ((operator_code
== POSTINCREMENT_EXPR
12512 || operator_code
== POSTDECREMENT_EXPR
)
12513 && ! processing_template_decl
12514 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
12517 cp_error ("postfix `%D' must take `int' as its argument",
12521 ("postfix `%D' must take `int' as its second argument",
12528 cp_error ("`%D' must take either zero or one argument", decl
);
12530 cp_error ("`%D' must take either one or two arguments", decl
);
12533 /* More Effective C++ rule 6. */
12535 && (operator_code
== POSTINCREMENT_EXPR
12536 || operator_code
== POSTDECREMENT_EXPR
12537 || operator_code
== PREINCREMENT_EXPR
12538 || operator_code
== PREDECREMENT_EXPR
))
12540 tree arg
= TREE_VALUE (argtypes
);
12541 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
12542 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
12543 arg
= TREE_TYPE (arg
);
12544 arg
= TYPE_MAIN_VARIANT (arg
);
12545 if (operator_code
== PREINCREMENT_EXPR
12546 || operator_code
== PREDECREMENT_EXPR
)
12548 if (TREE_CODE (ret
) != REFERENCE_TYPE
12549 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
12551 cp_warning ("prefix `%D' should return `%T'", decl
,
12552 build_reference_type (arg
));
12556 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
12557 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
12561 else if (unary_op_p (operator_code
))
12566 cp_error ("`%D' must take `void'", decl
);
12568 cp_error ("`%D' must take exactly one argument", decl
);
12571 else /* if (binary_op_p (operator_code)) */
12576 cp_error ("`%D' must take exactly one argument", decl
);
12578 cp_error ("`%D' must take exactly two arguments", decl
);
12581 /* More Effective C++ rule 7. */
12583 && (operator_code
== TRUTH_ANDIF_EXPR
12584 || operator_code
== TRUTH_ORIF_EXPR
12585 || operator_code
== COMPOUND_EXPR
))
12586 cp_warning ("user-defined `%D' always evaluates both arguments",
12590 /* Effective C++ rule 23. */
12593 && (operator_code
== PLUS_EXPR
12594 || operator_code
== MINUS_EXPR
12595 || operator_code
== TRUNC_DIV_EXPR
12596 || operator_code
== MULT_EXPR
)
12597 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
12598 cp_warning ("`%D' should return by value", decl
);
12601 for (; argtypes
&& argtypes
!= void_list_node
;
12602 argtypes
= TREE_CHAIN (argtypes
))
12603 if (TREE_PURPOSE (argtypes
))
12605 TREE_PURPOSE (argtypes
) = NULL_TREE
;
12606 if (operator_code
== POSTINCREMENT_EXPR
12607 || operator_code
== POSTDECREMENT_EXPR
)
12610 cp_pedwarn ("`%D' cannot have default arguments", decl
);
12613 cp_error ("`%D' cannot have default arguments", decl
);
12619 static const char *
12621 enum tag_types code
;
12634 my_friendly_abort (981122);
12638 /* Get the struct, enum or union (CODE says which) with tag NAME.
12639 Define the tag as a forward-reference if it is not defined.
12641 C++: If a class derivation is given, process it here, and report
12642 an error if multiple derivation declarations are not identical.
12644 If this is a definition, come in through xref_tag and only look in
12645 the current frame for the name (since C++ allows new names in any
12649 xref_tag (code_type_node
, name
, globalize
)
12650 tree code_type_node
;
12654 enum tag_types tag_code
;
12655 enum tree_code code
;
12656 register tree ref
, t
;
12657 struct binding_level
*b
= current_binding_level
;
12659 tree attributes
= NULL_TREE
;
12660 tree context
= NULL_TREE
;
12662 /* If we are called from the parser, code_type_node will sometimes be a
12663 TREE_LIST. This indicates that the user wrote
12664 "class __attribute__ ((foo)) bar". Extract the attributes so we can
12666 if (TREE_CODE (code_type_node
) == TREE_LIST
)
12668 attributes
= TREE_PURPOSE (code_type_node
);
12669 code_type_node
= TREE_VALUE (code_type_node
);
12672 tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12677 code
= RECORD_TYPE
;
12683 code
= ENUMERAL_TYPE
;
12686 my_friendly_abort (18);
12689 /* If a cross reference is requested, look up the type
12690 already defined for this tag and return it. */
12694 name
= TYPE_IDENTIFIER (t
);
12698 t
= IDENTIFIER_TYPE_VALUE (name
);
12700 /* Warn about 'friend struct Inherited;' doing the wrong thing. */
12701 if (t
&& globalize
&& TREE_CODE (t
) == TYPENAME_TYPE
)
12703 static int explained
;
12705 cp_warning ("`%s %T' declares a new type at namespace scope;\n\
12706 to refer to the inherited type, say `%s %T::%T'%s",
12707 tag_name (tag_code
), name
, tag_name (tag_code
),
12708 constructor_name (current_class_type
), TYPE_IDENTIFIER (t
),
12710 (names from dependent base classes are not visible to unqualified name lookup)"
12716 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
12717 && TREE_CODE (t
) != BOUND_TEMPLATE_TEMPLATE_PARM
)
12722 /* If we know we are defining this tag, only look it up in
12723 this scope and don't try to find it as a type. */
12724 ref
= lookup_tag (code
, name
, b
, 1);
12730 /* [dcl.type.elab] If the identifier resolves to a
12731 typedef-name or a template type-parameter, the
12732 elaborated-type-specifier is ill-formed. */
12733 if (t
!= TYPE_MAIN_VARIANT (t
)
12734 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
12735 cp_pedwarn ("using typedef-name `%D' after `%s'",
12736 TYPE_NAME (t
), tag_name (tag_code
));
12737 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12738 cp_error ("using template type parameter `%T' after `%s'",
12739 t
, tag_name (tag_code
));
12744 ref
= lookup_tag (code
, name
, b
, 0);
12748 /* Try finding it as a type declaration. If that wins,
12750 ref
= lookup_name (name
, 1);
12752 if (ref
!= NULL_TREE
12753 && processing_template_decl
12754 && DECL_CLASS_TEMPLATE_P (ref
)
12755 && template_class_depth (current_class_type
) == 0)
12756 /* Since GLOBALIZE is true, we're declaring a global
12757 template, so we want this type. */
12758 ref
= DECL_TEMPLATE_RESULT (ref
);
12760 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12761 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12762 ref
= TREE_TYPE (ref
);
12767 if (ref
&& current_class_type
12768 && template_class_depth (current_class_type
)
12769 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12771 /* Since GLOBALIZE is non-zero, we are not looking at a
12772 definition of this tag. Since, in addition, we are currently
12773 processing a (member) template declaration of a template
12774 class, we must be very careful; consider:
12781 { template <class V>
12782 friend struct S1; };
12784 Here, the S2::S1 declaration should not be confused with the
12785 outer declaration. In particular, the inner version should
12786 have a template parameter of level 2, not level 1. This
12787 would be particularly important if the member declaration
12790 template <class V = U> friend struct S1;
12792 say, when we should tsubst into `U' when instantiating
12793 S2. On the other hand, when presented with:
12803 we must find the inner binding eventually. We
12804 accomplish this by making sure that the new type we
12805 create to represent this declaration has the right
12807 context
= TYPE_CONTEXT (ref
);
12814 /* If no such tag is yet defined, create a forward-reference node
12815 and record it as the "definition".
12816 When a real declaration of this type is found,
12817 the forward-reference will be altered into a real type. */
12818 if (code
== ENUMERAL_TYPE
)
12820 cp_error ("use of enum `%#D' without previous declaration", name
);
12822 ref
= make_node (ENUMERAL_TYPE
);
12824 /* Give the type a default layout like unsigned int
12825 to avoid crashing if it does not get defined. */
12826 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12827 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12828 TYPE_USER_ALIGN (ref
) = 0;
12829 TREE_UNSIGNED (ref
) = 1;
12830 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12831 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12832 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12834 /* Enable us to recognize when a type is created in class context.
12835 To do nested classes correctly, this should probably be cleared
12836 out when we leave this classes scope. Currently this in only
12837 done in `start_enum'. */
12839 pushtag (name
, ref
, globalize
);
12843 struct binding_level
*old_b
= class_binding_level
;
12845 ref
= make_aggr_type (code
);
12846 TYPE_CONTEXT (ref
) = context
;
12848 #ifdef NONNESTED_CLASSES
12849 /* Class types don't nest the way enums do. */
12850 class_binding_level
= (struct binding_level
*)0;
12852 pushtag (name
, ref
, globalize
);
12853 class_binding_level
= old_b
;
12858 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12859 redeclare_class_template (ref
, current_template_parms
);
12862 /* Until the type is defined, tentatively accept whatever
12863 structure tag the user hands us. */
12864 if (!COMPLETE_TYPE_P (ref
)
12865 && ref
!= current_class_type
12866 /* Have to check this, in case we have contradictory tag info. */
12867 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12869 if (tag_code
== class_type
)
12870 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12871 else if (tag_code
== record_type
)
12872 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12875 TREE_TYPE (ref
) = attributes
;
12881 xref_tag_from_type (old
, id
, globalize
)
12885 tree code_type_node
;
12887 if (TREE_CODE (old
) == RECORD_TYPE
)
12888 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12889 ? class_type_node
: record_type_node
);
12891 code_type_node
= union_type_node
;
12893 if (id
== NULL_TREE
)
12894 id
= TYPE_IDENTIFIER (old
);
12896 return xref_tag (code_type_node
, id
, globalize
);
12899 /* REF is a type (named NAME), for which we have just seen some
12900 baseclasses. BINFO is a list of those baseclasses; the
12901 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12902 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12903 struct, or union. */
12906 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12907 tree code_type_node
;
12911 /* In the declaration `A : X, Y, ... Z' we mark all the types
12912 (A, X, Y, ..., Z) so we can check for duplicates. */
12917 enum tag_types tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12919 if (tag_code
== union_type
)
12921 cp_error ("derived union `%T' invalid", ref
);
12925 len
= list_length (binfo
);
12927 /* First, make sure that any templates in base-classes are
12928 instantiated. This ensures that if we call ourselves recursively
12929 we do not get confused about which classes are marked and which
12931 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12932 complete_type (TREE_VALUE (base
));
12934 SET_CLASSTYPE_MARKED (ref
);
12935 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12937 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12939 /* The base of a derived struct is public by default. */
12941 = (TREE_PURPOSE (binfo
) == access_public_node
12942 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12943 || (tag_code
!= class_type
12944 && (TREE_PURPOSE (binfo
) == access_default_node
12945 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12947 = (TREE_PURPOSE (binfo
) == access_protected_node
12948 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12950 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12951 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12952 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12953 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12954 tree basetype
= TREE_VALUE (binfo
);
12957 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12958 basetype
= TREE_TYPE (basetype
);
12960 || (TREE_CODE (basetype
) != RECORD_TYPE
12961 && TREE_CODE (basetype
) != TYPENAME_TYPE
12962 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12963 && TREE_CODE (basetype
) != BOUND_TEMPLATE_TEMPLATE_PARM
))
12965 cp_error ("base type `%T' fails to be a struct or class type",
12966 TREE_VALUE (binfo
));
12970 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12972 /* This code replaces similar code in layout_basetypes.
12973 We put the complete_type first for implicit `typename'. */
12974 if (!COMPLETE_TYPE_P (basetype
)
12975 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12977 cp_error ("base class `%T' has incomplete type", basetype
);
12982 if (CLASSTYPE_MARKED (basetype
))
12984 if (basetype
== ref
)
12985 cp_error ("recursive type `%T' undefined", basetype
);
12987 cp_error ("duplicate base type `%T' invalid", basetype
);
12991 if (TYPE_FOR_JAVA (basetype
)
12992 && (current_lang_stack
12993 == &VARRAY_TREE (current_lang_base
, 0)))
12994 TYPE_FOR_JAVA (ref
) = 1;
12996 /* Note that the BINFO records which describe individual
12997 inheritances are *not* shared in the lattice! They
12998 cannot be shared because a given baseclass may be
12999 inherited with different `accessibility' by different
13000 derived classes. (Each BINFO record describing an
13001 individual inheritance contains flags which say what
13002 the `accessibility' of that particular inheritance is.) */
13005 = make_binfo (size_zero_node
, basetype
,
13006 CLASS_TYPE_P (basetype
)
13007 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
13008 CLASS_TYPE_P (basetype
)
13009 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
13011 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
13012 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
13013 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
13014 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
13015 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
13017 /* We need to unshare the binfos now so that lookups during class
13018 definition work. */
13019 unshare_base_binfos (base_binfo
);
13021 SET_CLASSTYPE_MARKED (basetype
);
13023 /* We are free to modify these bits because they are meaningless
13024 at top level, and BASETYPE is a top-level type. */
13025 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
13027 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
13028 /* Converting to a virtual base class requires looking
13029 up the offset of the virtual base. */
13030 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
13033 if (CLASS_TYPE_P (basetype
))
13035 TYPE_HAS_NEW_OPERATOR (ref
)
13036 |= TYPE_HAS_NEW_OPERATOR (basetype
);
13037 TYPE_HAS_ARRAY_NEW_OPERATOR (ref
)
13038 |= TYPE_HAS_ARRAY_NEW_OPERATOR (basetype
);
13039 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
13040 /* If the base-class uses multiple inheritance, so do we. */
13041 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
13042 |= TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
13043 /* Likewise, if converting to a base of the base may require
13044 code, then we may need to generate code to convert to a
13046 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
)
13047 |= TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (basetype
);
13054 TREE_VEC_LENGTH (binfos
) = i
;
13056 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
13060 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
13061 /* If there is more than one non-empty they cannot be at the same
13063 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
13066 /* Unmark all the types. */
13068 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
13069 CLEAR_CLASSTYPE_MARKED (ref
);
13071 /* Now that we know all the base-classes, set up the list of virtual
13073 get_vbase_types (ref
);
13077 /* Begin compiling the definition of an enumeration type.
13078 NAME is its name (or null if anonymous).
13079 Returns the type object, as yet incomplete.
13080 Also records info about it so that build_enumerator
13081 may be used to declare the individual values as they are read. */
13087 register tree enumtype
= NULL_TREE
;
13088 struct binding_level
*b
= current_binding_level
;
13090 /* If this is the real definition for a previous forward reference,
13091 fill in the contents in the same object that used to be the
13092 forward reference. */
13094 if (name
!= NULL_TREE
)
13095 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
13097 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
13099 cp_error ("multiple definition of `%#T'", enumtype
);
13100 cp_error_at ("previous definition here", enumtype
);
13101 /* Clear out TYPE_VALUES, and start again. */
13102 TYPE_VALUES (enumtype
) = NULL_TREE
;
13106 enumtype
= make_node (ENUMERAL_TYPE
);
13107 pushtag (name
, enumtype
, 0);
13110 if (current_class_type
)
13111 TREE_ADDRESSABLE (b
->tags
) = 1;
13113 GNU_xref_decl (current_function_decl
, enumtype
);
13117 /* After processing and defining all the values of an enumeration type,
13118 install their decls in the enumeration type and finish it off.
13119 ENUMTYPE is the type object and VALUES a list of name-value pairs.
13120 Returns ENUMTYPE. */
13123 finish_enum (enumtype
)
13126 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
13127 /* Calculate the maximum value of any enumerator in this type. */
13129 tree values
= TYPE_VALUES (enumtype
);
13134 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
13139 /* The TREE_VALUE is a CONST_DECL for this enumeration
13141 decl
= TREE_VALUE (pair
);
13145 Following the closing brace of an enum-specifier, each
13146 enumerator has the type of its enumeration. Prior to the
13147 closing brace, the type of each enumerator is the type of
13148 its initializing value. */
13149 TREE_TYPE (decl
) = enumtype
;
13151 /* The DECL_INITIAL will be NULL if we are processing a
13152 template declaration and this enumeration constant had no
13153 explicit initializer. */
13154 value
= DECL_INITIAL (decl
);
13155 if (value
&& !processing_template_decl
)
13157 /* Set the TREE_TYPE for the VALUE as well. That's so
13158 that when we call decl_constant_value we get an
13159 entity of the right type (but with the constant
13160 value). Since we shouldn't ever call
13161 decl_constant_value on a template type, there's no
13162 reason to do that when processing_template_decl.
13163 And, if the expression is something like a
13164 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
13165 wreak havoc on the intended type of the expression.
13167 Of course, there's also no point in trying to compute
13168 minimum or maximum values if we're in a template. */
13169 TREE_TYPE (value
) = enumtype
;
13172 minnode
= maxnode
= value
;
13173 else if (tree_int_cst_lt (maxnode
, value
))
13175 else if (tree_int_cst_lt (value
, minnode
))
13179 if (processing_template_decl
)
13180 /* If this is just a template, leave the CONST_DECL
13181 alone. That way tsubst_copy will find CONST_DECLs for
13182 CONST_DECLs, and not INTEGER_CSTs. */
13185 /* In the list we're building up, we want the enumeration
13186 values, not the CONST_DECLs. */
13187 TREE_VALUE (pair
) = value
;
13191 maxnode
= minnode
= integer_zero_node
;
13193 TYPE_VALUES (enumtype
) = nreverse (values
);
13195 if (processing_template_decl
)
13197 tree scope
= current_scope ();
13198 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
13199 add_stmt (build_min (TAG_DEFN
, enumtype
));
13203 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
13204 int lowprec
= min_precision (minnode
, unsignedp
);
13205 int highprec
= min_precision (maxnode
, unsignedp
);
13206 int precision
= MAX (lowprec
, highprec
);
13209 TYPE_SIZE (enumtype
) = NULL_TREE
;
13211 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
13213 TYPE_PRECISION (enumtype
) = precision
;
13215 fixup_unsigned_type (enumtype
);
13217 fixup_signed_type (enumtype
);
13219 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
13220 /* Use the width of the narrowest normal C type which is wide
13222 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
13225 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
13227 TYPE_SIZE (enumtype
) = 0;
13228 layout_type (enumtype
);
13230 /* Fix up all variant types of this enum type. */
13231 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
13232 tem
= TYPE_NEXT_VARIANT (tem
))
13234 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
13235 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
13236 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
13237 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
13238 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
13239 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
13240 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
13241 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
13242 TYPE_USER_ALIGN (tem
) = TYPE_USER_ALIGN (enumtype
);
13243 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
13246 /* Finish debugging output for this type. */
13247 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
13253 /* Build and install a CONST_DECL for an enumeration constant of the
13254 enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided.
13255 Assignment of sequential values by default is handled here. */
13258 build_enumerator (name
, value
, enumtype
)
13268 /* Remove no-op casts from the value. */
13270 STRIP_TYPE_NOPS (value
);
13272 if (! processing_template_decl
)
13274 /* Validate and default VALUE. */
13275 if (value
!= NULL_TREE
)
13277 value
= decl_constant_value (value
);
13279 if (TREE_CODE (value
) == INTEGER_CST
)
13281 value
= default_conversion (value
);
13282 constant_expression_warning (value
);
13286 cp_error ("enumerator value for `%D' not integer constant", name
);
13291 /* Default based on previous value. */
13292 if (value
== NULL_TREE
&& ! processing_template_decl
)
13296 if (TYPE_VALUES (enumtype
))
13298 /* The next value is the previous value ... */
13299 prev_value
= DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype
)));
13300 /* ... plus one. */
13301 value
= cp_build_binary_op (PLUS_EXPR
,
13305 if (tree_int_cst_lt (value
, prev_value
))
13306 cp_error ("overflow in enumeration values at `%D'", name
);
13309 value
= integer_zero_node
;
13312 /* Remove no-op casts from the value. */
13314 STRIP_TYPE_NOPS (value
);
13316 /* To fix MAX_VAL enum consts. (bkoz) */
13317 TREE_TYPE (value
) = integer_type_node
;
13321 /* We always have to copy here; not all INTEGER_CSTs are unshared.
13322 Even in other cases, we will later (in finish_enum) be setting
13323 the type of VALUE. But, we don't need to make a copy if this
13324 VALUE is one of the enumeration constants for this same
13325 enumeration type. */
13326 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
13327 if (TREE_VALUE (values
) == value
)
13329 /* If we didn't break out of the loop, then we do need a copy. */
13330 if (!values
&& value
)
13331 value
= copy_node (value
);
13333 /* C++ associates enums with global, function, or class declarations. */
13334 context
= current_scope ();
13336 /* Build the actual enumeration constant. Note that the enumeration
13337 constants have the type of their initializers until the
13338 enumeration is complete:
13342 Following the closing brace of an enum-specifier, each enumer-
13343 ator has the type of its enumeration. Prior to the closing
13344 brace, the type of each enumerator is the type of its
13345 initializing value.
13347 In finish_enum we will reset the type. Of course, if we're
13348 processing a template, there may be no value. */
13349 type
= value
? TREE_TYPE (value
) : NULL_TREE
;
13351 if (context
&& context
== current_class_type
)
13352 /* This enum declaration is local to the class. We need the full
13353 lang_decl so that we can record DECL_CLASS_CONTEXT, for example. */
13354 decl
= build_lang_decl (CONST_DECL
, name
, type
);
13356 /* It's a global enum, or it's local to a function. (Note local to
13357 a function could mean local to a class method. */
13358 decl
= build_decl (CONST_DECL
, name
, type
);
13360 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
13361 DECL_INITIAL (decl
) = value
;
13362 TREE_READONLY (decl
) = 1;
13364 if (context
&& context
== current_class_type
)
13365 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
13366 on the TYPE_FIELDS list for `S'. (That's so that you can say
13367 things like `S::i' later.) */
13368 finish_member_declaration (decl
);
13372 GNU_xref_decl (current_function_decl
, decl
);
13375 /* Add this enumeration constant to the list for this type. */
13376 TYPE_VALUES (enumtype
) = tree_cons (name
, decl
, TYPE_VALUES (enumtype
));
13380 /* We're defining DECL. Make sure that it's type is OK. */
13383 check_function_type (decl
, current_function_parms
)
13385 tree current_function_parms
;
13387 tree fntype
= TREE_TYPE (decl
);
13388 tree return_type
= complete_type (TREE_TYPE (fntype
));
13390 /* In a function definition, arg types must be complete. */
13391 require_complete_types_for_parms (current_function_parms
);
13393 if (!COMPLETE_OR_VOID_TYPE_P (return_type
))
13395 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
13397 /* Make it return void instead, but don't change the
13398 type of the DECL_RESULT, in case we have a named return value. */
13399 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13401 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
13403 = build_cplus_method_type (ctype
,
13405 FUNCTION_ARG_CHAIN (decl
));
13409 = build_function_type (void_type_node
,
13410 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
13412 = build_exception_variant (fntype
,
13413 TYPE_RAISES_EXCEPTIONS (fntype
));
13416 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
13419 /* Create the FUNCTION_DECL for a function definition.
13420 DECLSPECS and DECLARATOR are the parts of the declaration;
13421 they describe the function's name and the type it returns,
13422 but twisted together in a fashion that parallels the syntax of C.
13424 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
13425 DECLARATOR is really the DECL for the function we are about to
13426 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
13427 indicating that the function is an inline defined in-class.
13429 This function creates a binding context for the function body
13430 as well as setting up the FUNCTION_DECL in current_function_decl.
13432 Returns 1 on success. If the DECLARATOR is not suitable for a function
13433 (it defines a datum instead), we return 0, which tells
13434 yyparse to report a parse error.
13436 For C++, we must first check whether that datum makes any sense.
13437 For example, "class A local_a(1,2);" means that variable local_a
13438 is an aggregate of type A, which should have a constructor
13439 applied to it with the argument list [1, 2]. */
13442 start_function (declspecs
, declarator
, attrs
, flags
)
13443 tree declspecs
, declarator
, attrs
;
13447 tree ctype
= NULL_TREE
;
13450 extern int have_extern_spec
;
13451 extern int used_extern_spec
;
13452 int doing_friend
= 0;
13453 struct binding_level
*bl
;
13454 tree current_function_parms
;
13456 /* Sanity check. */
13457 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
13458 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
13460 /* This should only be done once on the top most decl. */
13461 if (have_extern_spec
&& !used_extern_spec
)
13463 declspecs
= tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
13464 used_extern_spec
= 1;
13467 if (flags
& SF_PRE_PARSED
)
13469 decl1
= declarator
;
13471 fntype
= TREE_TYPE (decl1
);
13472 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13473 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13475 /* ISO C++ 11.4/5. A friend function defined in a class is in
13476 the (lexical) scope of the class in which it is defined. */
13477 if (!ctype
&& DECL_FRIEND_P (decl1
))
13479 ctype
= DECL_FRIEND_CONTEXT (decl1
);
13481 /* CTYPE could be null here if we're dealing with a template;
13482 for example, `inline friend float foo()' inside a template
13483 will have no CTYPE set. */
13484 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
13490 last_function_parms
= DECL_ARGUMENTS (decl1
);
13491 last_function_parm_tags
= NULL_TREE
;
13495 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
13496 /* If the declarator is not suitable for a function definition,
13497 cause a syntax error. */
13498 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
13500 fntype
= TREE_TYPE (decl1
);
13502 restype
= TREE_TYPE (fntype
);
13503 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
13505 cp_error ("semicolon missing after declaration of `%#T'", restype
);
13506 shadow_tag (build_tree_list (NULL_TREE
, restype
));
13507 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
13508 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
13509 fntype
= build_function_type (integer_type_node
,
13510 TYPE_ARG_TYPES (fntype
));
13512 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
13514 TYPE_ARG_TYPES (fntype
));
13515 TREE_TYPE (decl1
) = fntype
;
13518 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13519 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13520 else if (DECL_MAIN_P (decl1
))
13522 /* If this doesn't return integer_type, complain. */
13523 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
13525 if (pedantic
|| warn_return_type
)
13526 pedwarn ("return type for `main' changed to `int'");
13527 TREE_TYPE (decl1
) = fntype
= default_function_type
;
13532 /* Sometimes we don't notice that a function is a static member, and
13533 build a METHOD_TYPE for it. Fix that up now. */
13534 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
)
13535 && TREE_CODE (TREE_TYPE (decl1
)) == METHOD_TYPE
)
13537 revert_static_member_fn (decl1
);
13538 last_function_parms
= TREE_CHAIN (last_function_parms
);
13542 /* Warn if function was previously implicitly declared
13543 (but not if we warned then). */
13544 if (! warn_implicit
13545 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
13546 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
13548 /* Set up current_class_type, and enter the scope of the class, if
13551 push_nested_class (ctype
, 1);
13552 else if (DECL_STATIC_FUNCTION_P (decl1
))
13553 push_nested_class (DECL_CONTEXT (decl1
), 2);
13555 /* Now that we have entered the scope of the class, we must restore
13556 the bindings for any template parameters surrounding DECL1, if it
13557 is an inline member template. (Order is important; consider the
13558 case where a template parameter has the same name as a field of
13559 the class.) It is not until after this point that
13560 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
13561 if (flags
& SF_INCLASS_INLINE
)
13562 maybe_begin_member_template_processing (decl1
);
13564 /* Effective C++ rule 15. */
13566 && DECL_OVERLOADED_OPERATOR_P (decl1
) == NOP_EXPR
13567 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
13568 cp_warning ("`operator=' should return a reference to `*this'");
13570 /* Make the init_value nonzero so pushdecl knows this is not tentative.
13571 error_mark_node is replaced below (in poplevel) with the BLOCK. */
13572 if (!DECL_INITIAL (decl1
))
13573 DECL_INITIAL (decl1
) = error_mark_node
;
13575 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
13576 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
13579 /* This function exists in static storage.
13580 (This does not mean `static' in the C sense!) */
13581 TREE_STATIC (decl1
) = 1;
13583 /* We must call push_template_decl after current_class_type is set
13584 up. (If we are processing inline definitions after exiting a
13585 class scope, current_class_type will be NULL_TREE until set above
13586 by push_nested_class.) */
13587 if (processing_template_decl
)
13588 decl1
= push_template_decl (decl1
);
13590 /* We are now in the scope of the function being defined. */
13591 current_function_decl
= decl1
;
13593 /* Save the parm names or decls from this function's declarator
13594 where store_parm_decls will find them. */
13595 current_function_parms
= last_function_parms
;
13596 current_function_parm_tags
= last_function_parm_tags
;
13598 /* Make sure the parameter and return types are reasonable. When
13599 you declare a function, these types can be incomplete, but they
13600 must be complete when you define the function. */
13601 if (! processing_template_decl
)
13602 check_function_type (decl1
, current_function_parms
);
13604 /* Build the return declaration for the function. */
13605 restype
= TREE_TYPE (fntype
);
13606 if (!processing_template_decl
)
13608 if (!DECL_RESULT (decl1
))
13610 DECL_RESULT (decl1
)
13611 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13612 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype
),
13613 DECL_RESULT (decl1
));
13617 /* Just use `void'. Nobody will ever look at this anyhow. */
13618 DECL_RESULT (decl1
) = build_decl (RESULT_DECL
, 0, void_type_node
);
13620 /* Initialize RTL machinery. We cannot do this until
13621 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
13622 even when processing a template; this is how we get
13623 CFUN set up, and our per-function variables initialized. */
13624 bl
= current_binding_level
;
13625 init_function_start (decl1
, input_filename
, lineno
);
13626 current_binding_level
= bl
;
13628 /* Even though we're inside a function body, we still don't want to
13629 call expand_expr to calculate the size of a variable-sized array.
13630 We haven't necessarily assigned RTL to all variables yet, so it's
13631 not safe to try to expand expressions involving them. */
13632 immediate_size_expand
= 0;
13633 cfun
->x_dont_save_pending_sizes_p
= 1;
13635 /* Start the statement-tree, start the tree now. */
13636 begin_stmt_tree (&DECL_SAVED_TREE (decl1
));
13638 /* Let the user know we're compiling this function. */
13639 announce_function (decl1
);
13641 /* Record the decl so that the function name is defined.
13642 If we already have a decl for this name, and it is a FUNCTION_DECL,
13643 use the old decl. */
13644 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
13646 /* A specialization is not used to guide overload resolution. */
13647 if (!DECL_TEMPLATE_SPECIALIZATION (decl1
)
13648 && ! DECL_FUNCTION_MEMBER_P (decl1
))
13649 decl1
= pushdecl (decl1
);
13652 /* We need to set the DECL_CONTEXT. */
13653 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
13654 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
13655 /* And make sure we have enough default args. */
13656 check_default_args (decl1
);
13658 fntype
= TREE_TYPE (decl1
);
13661 /* Reset these in case the call to pushdecl changed them. */
13662 current_function_decl
= decl1
;
13663 cfun
->decl
= decl1
;
13665 /* If we are (erroneously) defining a function that we have already
13666 defined before, wipe out what we knew before. */
13667 if (!DECL_PENDING_INLINE_P (decl1
)
13668 && DECL_SAVED_FUNCTION_DATA (decl1
))
13670 free (DECL_SAVED_FUNCTION_DATA (decl1
));
13671 DECL_SAVED_FUNCTION_DATA (decl1
) = NULL
;
13674 if (ctype
&& !doing_friend
&& !DECL_STATIC_FUNCTION_P (decl1
))
13676 /* We know that this was set up by `grokclassfn'. We do not
13677 wait until `store_parm_decls', since evil parse errors may
13678 never get us to that point. Here we keep the consistency
13679 between `current_class_type' and `current_class_ptr'. */
13680 tree t
= DECL_ARGUMENTS (decl1
);
13682 my_friendly_assert (t
!= NULL_TREE
&& TREE_CODE (t
) == PARM_DECL
,
13684 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
13687 cp_function_chain
->x_current_class_ref
13688 = build_indirect_ref (t
, NULL_PTR
);
13689 cp_function_chain
->x_current_class_ptr
= t
;
13691 /* Constructors and destructors need to know whether they're "in
13692 charge" of initializing virtual base classes. */
13693 if (DECL_HAS_IN_CHARGE_PARM_P (decl1
))
13694 current_in_charge_parm
= TREE_CHAIN (t
);
13697 if (DECL_INTERFACE_KNOWN (decl1
))
13699 tree ctx
= decl_function_context (decl1
);
13701 if (DECL_NOT_REALLY_EXTERN (decl1
))
13702 DECL_EXTERNAL (decl1
) = 0;
13704 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
13705 && TREE_PUBLIC (ctx
))
13706 /* This is a function in a local class in an extern inline
13708 comdat_linkage (decl1
);
13710 /* If this function belongs to an interface, it is public.
13711 If it belongs to someone else's interface, it is also external.
13712 This only affects inlines and template instantiations. */
13713 else if (interface_unknown
== 0
13714 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13715 || flag_alt_external_templates
))
13717 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
13718 || processing_template_decl
)
13720 DECL_EXTERNAL (decl1
)
13722 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
13723 && !DECL_VINDEX (decl1
)));
13725 /* For WIN32 we also want to put these in linkonce sections. */
13726 maybe_make_one_only (decl1
);
13729 DECL_EXTERNAL (decl1
) = 0;
13730 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
13731 DECL_INTERFACE_KNOWN (decl1
) = 1;
13733 else if (interface_unknown
&& interface_only
13734 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13735 || flag_alt_external_templates
))
13737 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13738 interface, we will have interface_only set but not
13739 interface_known. In that case, we don't want to use the normal
13740 heuristics because someone will supply a #pragma implementation
13741 elsewhere, and deducing it here would produce a conflict. */
13742 comdat_linkage (decl1
);
13743 DECL_EXTERNAL (decl1
) = 0;
13744 DECL_INTERFACE_KNOWN (decl1
) = 1;
13745 DECL_DEFER_OUTPUT (decl1
) = 1;
13749 /* This is a definition, not a reference.
13750 So clear DECL_EXTERNAL. */
13751 DECL_EXTERNAL (decl1
) = 0;
13753 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
13754 && ! DECL_INTERFACE_KNOWN (decl1
)
13755 /* Don't try to defer nested functions for now. */
13756 && ! decl_function_context (decl1
))
13757 DECL_DEFER_OUTPUT (decl1
) = 1;
13759 DECL_INTERFACE_KNOWN (decl1
) = 1;
13763 current_binding_level
->parm_flag
= 1;
13766 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13768 /* We need to do this even if we aren't expanding yet so that
13769 assemble_external works. */
13770 make_function_rtl (decl1
);
13772 /* Promote the value to int before returning it. */
13773 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13774 restype
= type_promotes_to (restype
);
13776 /* If this fcn was already referenced via a block-scope `extern' decl
13777 (or an implicit decl), propagate certain information about the usage. */
13778 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13779 TREE_ADDRESSABLE (decl1
) = 1;
13781 if (DECL_RESULT (decl1
) == NULL_TREE
)
13783 DECL_RESULT (decl1
)
13784 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13785 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13786 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13791 if (DECL_DESTRUCTOR_P (decl1
))
13793 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13794 DECL_CONTEXT (dtor_label
) = current_function_decl
;
13796 /* Under the old ABI we return `this' from constructors, so we make
13797 ordinary `return' statements in constructors jump to CTOR_LABEL;
13798 from there we return `this'. Under the new ABI, we don't bother
13799 with any of this. By not setting CTOR_LABEL the remainder of the
13800 machinery is automatically disabled. */
13801 else if (!flag_new_abi
&& DECL_CONSTRUCTOR_P (decl1
))
13803 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13804 DECL_CONTEXT (ctor_label
) = current_function_decl
;
13807 store_parm_decls (current_function_parms
);
13812 /* Store the parameter declarations into the current function declaration.
13813 This is called after parsing the parameter declarations, before
13814 digesting the body of the function.
13816 Also install to binding contour return value identifier, if any. */
13819 store_parm_decls (current_function_parms
)
13820 tree current_function_parms
;
13822 register tree fndecl
= current_function_decl
;
13823 register tree parm
;
13824 int parms_have_cleanups
= 0;
13825 tree cleanups
= NULL_TREE
;
13827 /* This is a list of types declared among parms in a prototype. */
13828 tree parmtags
= current_function_parm_tags
;
13830 /* This is a chain of any other decls that came in among the parm
13831 declarations. If a parm is declared with enum {foo, bar} x;
13832 then CONST_DECLs for foo and bar are put here. */
13833 tree nonparms
= NULL_TREE
;
13835 if (current_function_parms
)
13837 /* This case is when the function was defined with an ANSI prototype.
13838 The parms already have decls, so we need not do anything here
13839 except record them as in effect
13840 and complain if any redundant old-style parm decls were written. */
13842 tree specparms
= current_function_parms
;
13845 /* Must clear this because it might contain TYPE_DECLs declared
13847 storedecls (NULL_TREE
);
13849 /* If we're doing semantic analysis, then we'll call pushdecl
13850 for each of these. We must do them in reverse order so that
13851 they end in the correct forward order. */
13852 specparms
= nreverse (specparms
);
13854 for (parm
= specparms
; parm
; parm
= next
)
13856 next
= TREE_CHAIN (parm
);
13857 if (TREE_CODE (parm
) == PARM_DECL
)
13861 if (DECL_NAME (parm
) == NULL_TREE
13862 || TREE_CODE (parm
) != VOID_TYPE
)
13865 cp_error ("parameter `%D' declared void", parm
);
13867 cleanup
= (processing_template_decl
13869 : maybe_build_cleanup (parm
));
13872 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13876 /* If we find an enum constant or a type tag,
13877 put it aside for the moment. */
13878 TREE_CHAIN (parm
) = NULL_TREE
;
13879 nonparms
= chainon (nonparms
, parm
);
13883 /* Get the decls in their original chain order and record in the
13884 function. This is all and only the PARM_DECLs that were
13885 pushed into scope by the loop above. */
13886 DECL_ARGUMENTS (fndecl
) = getdecls ();
13887 storetags (chainon (parmtags
, gettags ()));
13890 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13892 /* Now store the final chain of decls for the arguments
13893 as the decl-chain of the current lexical scope.
13894 Put the enumerators in as well, at the front so that
13895 DECL_ARGUMENTS is not modified. */
13896 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13898 /* Now that we have initialized the parms, we can start their
13899 cleanups. We cannot do this before, since expand_decl_cleanup
13900 should not be called before the parm can be used. */
13903 finish_decl_cleanup (TREE_PURPOSE (cleanups
),
13904 TREE_VALUE (cleanups
));
13905 cleanups
= TREE_CHAIN (cleanups
);
13908 /* Create a binding contour which can be used to catch
13909 cleanup-generated temporaries. */
13910 if (parms_have_cleanups
)
13913 /* Do the starting of the exception specifications, if we have any. */
13914 if (flag_exceptions
&& !processing_template_decl
13915 && flag_enforce_eh_specs
13916 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13917 current_eh_spec_try_block
= expand_start_eh_spec ();
13921 /* We have finished doing semantic analysis on DECL, but have not yet
13922 generated RTL for its body. Save away our current state, so that
13923 when we want to generate RTL later we know what to do. */
13926 save_function_data (decl
)
13929 struct cp_language_function
*f
;
13931 /* Save the language-specific per-function data so that we can
13932 get it back when we really expand this function. */
13933 my_friendly_assert (!DECL_PENDING_INLINE_P (decl
),
13937 f
= ((struct cp_language_function
*)
13938 xmalloc (sizeof (struct cp_language_function
)));
13939 memcpy (f
, cp_function_chain
, sizeof (struct cp_language_function
));
13940 DECL_SAVED_FUNCTION_DATA (decl
) = f
;
13942 /* Clear out the bits we don't need. */
13943 f
->base
.x_stmt_tree
.x_last_stmt
= NULL_TREE
;
13944 f
->base
.x_stmt_tree
.x_last_expr_type
= NULL_TREE
;
13945 f
->x_named_label_uses
= NULL
;
13946 f
->bindings
= NULL
;
13948 /* When we get back here again, we will be expanding. */
13949 f
->x_expanding_p
= 1;
13951 /* If we've already decided that we cannot inline this function, we
13952 must remember that fact when we actually go to expand the
13954 f
->cannot_inline
= current_function_cannot_inline
;
13957 /* At the end of every constructor we generate to code to return
13958 `this'. Do that now. */
13961 finish_constructor_body ()
13963 /* Any return from a constructor will end up here. */
13965 add_stmt (build_stmt (LABEL_STMT
, ctor_label
));
13967 /* Clear CTOR_LABEL so that finish_return_stmt knows to really
13968 generate the return, rather than a goto to CTOR_LABEL. */
13969 ctor_label
= NULL_TREE
;
13970 /* In check_return_expr we translate an empty return from a
13971 constructor to a return of `this'. */
13972 finish_return_stmt (NULL_TREE
);
13973 /* Mark the end of the constructor. */
13974 add_stmt (build_stmt (CTOR_STMT
));
13977 /* At the end of every destructor we generate code to restore virtual
13978 function tables to the values desired by base classes and to call
13979 to base class destructors. Do that now. */
13982 finish_destructor_body ()
13984 tree compound_stmt
;
13989 /* Create a block to contain all the extra code. */
13990 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
13992 /* Any return from a destructor will end up here. */
13993 add_stmt (build_stmt (LABEL_STMT
, dtor_label
));
13995 /* Generate the code to call destructor on base class. If this
13996 destructor belongs to a class with virtual functions, then set
13997 the virtual function table pointer to represent the type of our
14000 /* This side-effect makes call to `build_delete' generate the code
14001 we have to have at the end of this destructor. `build_delete'
14002 will set the flag again. */
14003 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
14005 exprstmt
= build_delete (current_class_type
,
14007 sfk_base_destructor
,
14008 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
,
14011 if (exprstmt
!= error_mark_node
14012 && (TREE_CODE (exprstmt
) != NOP_EXPR
14013 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
14014 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
14016 if (exprstmt
!= void_zero_node
)
14017 /* Don't call `expand_expr_stmt' if we're not going to do
14018 anything, since -Wall will give a diagnostic. */
14019 finish_expr_stmt (exprstmt
);
14021 /* Run destructors for all virtual baseclasses. */
14022 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
14027 if_stmt
= begin_if_stmt ();
14028 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
14029 current_in_charge_parm
,
14033 vbases
= CLASSTYPE_VBASECLASSES (current_class_type
);
14034 /* The CLASSTYPE_VBASECLASSES list is in initialization
14035 order, so we have to march through it in reverse order. */
14036 for (vbases
= nreverse (copy_list (vbases
));
14038 vbases
= TREE_CHAIN (vbases
))
14040 tree vbase
= TREE_VALUE (vbases
);
14042 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (vbase
)))
14044 tree vb
= get_vbase
14045 (BINFO_TYPE (vbase
),
14046 TYPE_BINFO (current_class_type
));
14048 (build_scoped_method_call
14049 (current_class_ref
, vb
, base_dtor_identifier
,
14054 finish_then_clause (if_stmt
);
14059 virtual_size
= c_sizeof (current_class_type
);
14061 /* At the end, call delete if that's what's requested. */
14063 /* FDIS sez: At the point of definition of a virtual destructor
14064 (including an implicit definition), non-placement operator delete
14065 shall be looked up in the scope of the destructor's class and if
14066 found shall be accessible and unambiguous.
14068 This is somewhat unclear, but I take it to mean that if the class
14069 only defines placement deletes we don't do anything here. So we
14070 pass LOOKUP_SPECULATIVELY; delete_sanity will complain for us if
14071 they ever try to delete one of these. */
14072 exprstmt
= build_op_delete_call
14073 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
14074 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
14076 if_stmt
= begin_if_stmt ();
14077 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
14078 current_in_charge_parm
,
14081 finish_expr_stmt (exprstmt
);
14082 finish_then_clause (if_stmt
);
14085 /* Close the block we started above. */
14086 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
14089 /* Finish up a function declaration and compile that function
14090 all the way to assembler language output. The free the storage
14091 for the function definition.
14093 FLAGS is a bitwise or of the following values:
14095 An extra call to poplevel (and expand_end_bindings) must be
14096 made to take care of the binding contour for the base
14097 initializers. This is only relevant for constructors.
14099 We just finished processing the body of an in-class inline
14100 function definition. (This processing will have taken place
14101 after the class definition is complete.) */
14104 finish_function (flags
)
14107 register tree fndecl
= current_function_decl
;
14108 tree fntype
, ctype
= NULL_TREE
;
14109 int call_poplevel
= (flags
& 1) != 0;
14110 int inclass_inline
= (flags
& 2) != 0;
14113 /* When we get some parse errors, we can end up without a
14114 current_function_decl, so cope. */
14115 if (fndecl
== NULL_TREE
)
14116 return error_mark_node
;
14118 nested
= function_depth
> 1;
14119 fntype
= TREE_TYPE (fndecl
);
14121 /* TREE_READONLY (fndecl) = 1;
14122 This caused &foo to be of type ptr-to-const-function
14123 which then got a warning when stored in a ptr-to-function variable. */
14125 my_friendly_assert (building_stmt_tree (), 20000911);
14127 /* For a cloned function, we've already got all the code we need;
14128 there's no need to add any extra bits. */
14129 if (!DECL_CLONED_FUNCTION_P (fndecl
))
14131 if (DECL_CONSTRUCTOR_P (fndecl
))
14133 finish_constructor_body ();
14137 else if (DECL_DESTRUCTOR_P (fndecl
) && !processing_template_decl
)
14138 finish_destructor_body ();
14139 else if (DECL_MAIN_P (fndecl
))
14141 /* Make it so that `main' always returns 0 by default. */
14143 finish_return_stmt (integer_one_node
);
14145 finish_return_stmt (integer_zero_node
);
14149 /* Finish dealing with exception specifiers. */
14150 if (flag_exceptions
&& !processing_template_decl
14151 && flag_enforce_eh_specs
14152 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
14153 expand_end_eh_spec (TYPE_RAISES_EXCEPTIONS
14154 (TREE_TYPE (current_function_decl
)),
14155 current_eh_spec_try_block
);
14158 /* If we're saving up tree structure, tie off the function now. */
14159 finish_stmt_tree (&DECL_SAVED_TREE (fndecl
));
14161 /* This must come after expand_function_end because cleanups might
14162 have declarations (from inline functions) that need to go into
14163 this function's blocks. */
14164 if (current_binding_level
->parm_flag
!= 1)
14165 my_friendly_abort (122);
14166 poplevel (1, 0, 1);
14168 /* Remember that we were in class scope. */
14169 if (current_class_name
)
14170 ctype
= current_class_type
;
14172 /* Must mark the RESULT_DECL as being in this function. */
14173 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
14175 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
14176 to the FUNCTION_DECL node itself. */
14177 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
14179 /* Save away current state, if appropriate. */
14180 if (!processing_template_decl
)
14181 save_function_data (fndecl
);
14183 /* If this function calls `setjmp' it cannot be inlined. When
14184 `longjmp' is called it is not guaranteed to restore the value of
14185 local variables that have been modified since the call to
14186 `setjmp'. So, if were to inline this function into some caller
14187 `c', then when we `longjmp', we might not restore all variables
14188 in `c'. (It might seem, at first blush, that there's no way for
14189 this function to modify local variables in `c', but their
14190 addresses may have been stored somewhere accessible to this
14192 if (!processing_template_decl
&& calls_setjmp_p (fndecl
))
14193 DECL_UNINLINABLE (fndecl
) = 1;
14195 /* Clear out memory we no longer need. */
14196 free_after_parsing (cfun
);
14197 /* Since we never call rest_of_compilation, we never clear
14198 CFUN. Do so explicitly. */
14199 free_after_compilation (cfun
);
14202 /* If this is a in-class inline definition, we may have to pop the
14203 bindings for the template parameters that we added in
14204 maybe_begin_member_template_processing when start_function was
14206 if (inclass_inline
)
14207 maybe_end_member_template_processing ();
14209 /* Leave the scope of the class. */
14211 pop_nested_class ();
14217 /* Let the error reporting routines know that we're outside a
14218 function. For a nested function, this value is used in
14219 pop_cp_function_context and then reset via pop_function_context. */
14220 current_function_decl
= NULL_TREE
;
14225 /* Create the FUNCTION_DECL for a function definition.
14226 DECLSPECS and DECLARATOR are the parts of the declaration;
14227 they describe the return type and the name of the function,
14228 but twisted together in a fashion that parallels the syntax of C.
14230 This function creates a binding context for the function body
14231 as well as setting up the FUNCTION_DECL in current_function_decl.
14233 Returns a FUNCTION_DECL on success.
14235 If the DECLARATOR is not suitable for a function (it defines a datum
14236 instead), we return 0, which tells yyparse to report a parse error.
14238 May return void_type_node indicating that this method is actually
14239 a friend. See grokfield for more details.
14241 Came here with a `.pushlevel' .
14243 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14244 CHANGES TO CODE IN `grokfield'. */
14247 start_method (declspecs
, declarator
, attrlist
)
14248 tree declarator
, declspecs
, attrlist
;
14250 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
14253 /* Something too ugly to handle. */
14254 if (fndecl
== NULL_TREE
)
14257 /* Pass friends other than inline friend functions back. */
14258 if (fndecl
== void_type_node
)
14261 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
14262 /* Not a function, tell parser to report parse error. */
14265 if (DECL_IN_AGGR_P (fndecl
))
14267 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
14269 if (DECL_CONTEXT (fndecl
)
14270 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
14271 cp_error ("`%D' is already defined in class `%T'", fndecl
,
14272 DECL_CONTEXT (fndecl
));
14274 return void_type_node
;
14277 check_template_shadow (fndecl
);
14279 DECL_THIS_INLINE (fndecl
) = 1;
14281 if (flag_default_inline
)
14282 DECL_INLINE (fndecl
) = 1;
14284 /* We process method specializations in finish_struct_1. */
14285 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
14286 fndecl
= push_template_decl (fndecl
);
14288 if (! DECL_FRIEND_P (fndecl
))
14290 if (TREE_CHAIN (fndecl
))
14292 fndecl
= copy_node (fndecl
);
14293 TREE_CHAIN (fndecl
) = NULL_TREE
;
14296 if (DECL_CONSTRUCTOR_P (fndecl
))
14298 if (! grok_ctor_properties (current_class_type
, fndecl
))
14299 return void_type_node
;
14301 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
14302 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
14305 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0);
14307 /* Make a place for the parms */
14309 current_binding_level
->parm_flag
= 1;
14311 DECL_IN_AGGR_P (fndecl
) = 1;
14315 /* Go through the motions of finishing a function definition.
14316 We don't compile this method until after the whole class has
14319 FINISH_METHOD must return something that looks as though it
14320 came from GROKFIELD (since we are defining a method, after all).
14322 This is called after parsing the body of the function definition.
14323 STMTS is the chain of statements that makes up the function body.
14325 DECL is the ..._DECL that `start_method' provided. */
14328 finish_method (decl
)
14331 register tree fndecl
= decl
;
14334 register tree link
;
14336 if (decl
== void_type_node
)
14339 old_initial
= DECL_INITIAL (fndecl
);
14341 /* Undo the level for the parms (from start_method).
14342 This is like poplevel, but it causes nothing to be
14343 saved. Saving information here confuses symbol-table
14344 output routines. Besides, this information will
14345 be correctly output when this method is actually
14348 /* Clear out the meanings of the local variables of this level;
14349 also record in each decl which block it belongs to. */
14351 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
14353 if (DECL_NAME (link
) != NULL_TREE
)
14354 pop_binding (DECL_NAME (link
), link
);
14355 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
14356 DECL_CONTEXT (link
) = NULL_TREE
;
14359 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
14360 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
14361 current_binding_level
->parm_flag
,
14362 current_binding_level
->keep
);
14364 poplevel (0, 0, 0);
14366 DECL_INITIAL (fndecl
) = old_initial
;
14368 /* We used to check if the context of FNDECL was different from
14369 current_class_type as another way to get inside here. This didn't work
14370 for String.cc in libg++. */
14371 if (DECL_FRIEND_P (fndecl
))
14373 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
14374 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
14375 decl
= void_type_node
;
14381 /* Called when a new struct TYPE is defined.
14382 If this structure or union completes the type of any previous
14383 variable declaration, lay it out and output its rtl. */
14386 hack_incomplete_structures (type
)
14390 struct binding_level
*level
;
14392 if (!type
) /* Don't do this for class templates. */
14395 if (namespace_bindings_p ())
14398 list
= &namespace_scope_incomplete
;
14402 level
= innermost_nonclass_level ();
14403 list
= &level
->incomplete
;
14410 tree decl
= TREE_VALUE (*list
);
14411 if ((decl
&& TREE_TYPE (decl
) == type
)
14412 || (TREE_TYPE (decl
)
14413 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14414 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
14416 int toplevel
= toplevel_bindings_p ();
14417 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14418 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
14419 layout_type (TREE_TYPE (decl
));
14420 layout_decl (decl
, 0);
14421 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
14425 expand_decl (decl
);
14426 cleanup
= maybe_build_cleanup (decl
);
14427 expand_decl_init (decl
);
14428 if (! expand_decl_cleanup (decl
, cleanup
))
14429 cp_error ("parser lost in parsing declaration of `%D'",
14432 *list
= TREE_CHAIN (*list
);
14435 list
= &TREE_CHAIN (*list
);
14438 /* Keep looking through artificial binding levels generated
14439 for local variables. */
14440 if (level
&& level
->keep
== 2)
14442 level
= level
->level_chain
;
14443 list
= &level
->incomplete
;
14450 /* If DECL is of a type which needs a cleanup, build that cleanup
14454 maybe_build_cleanup (decl
)
14457 tree type
= TREE_TYPE (decl
);
14459 if (type
!= error_mark_node
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
14461 int flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14464 if (TREE_CODE (type
) == ARRAY_TYPE
)
14468 mark_addressable (decl
);
14469 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14472 /* Optimize for space over speed here. */
14473 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14474 || flag_expensive_optimizations
)
14475 flags
|= LOOKUP_NONVIRTUAL
;
14477 rval
= build_delete (TREE_TYPE (rval
), rval
,
14478 sfk_complete_destructor
, flags
, 0);
14480 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14481 && ! TYPE_HAS_DESTRUCTOR (type
))
14482 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14483 build_tree_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14490 /* When a stmt has been parsed, this function is called. */
14495 /* Always assume this statement was not an expression statement. If
14496 it actually was an expression statement, its our callers
14497 responsibility to fix this up. */
14498 last_expr_type
= NULL_TREE
;
14501 /* DECL was originally constructed as a non-static member function,
14502 but turned out to be static. Update it accordingly. */
14505 revert_static_member_fn (decl
)
14509 tree function
= TREE_TYPE (decl
);
14510 tree args
= TYPE_ARG_TYPES (function
);
14512 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14513 != TYPE_UNQUALIFIED
)
14514 cp_error ("static member function `%#D' declared with type qualifiers",
14517 args
= TREE_CHAIN (args
);
14518 tmp
= build_function_type (TREE_TYPE (function
), args
);
14519 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14520 tmp
= build_exception_variant (tmp
,
14521 TYPE_RAISES_EXCEPTIONS (function
));
14522 TREE_TYPE (decl
) = tmp
;
14523 if (DECL_ARGUMENTS (decl
))
14524 DECL_ARGUMENTS (decl
) = TREE_CHAIN (DECL_ARGUMENTS (decl
));
14525 DECL_STATIC_FUNCTION_P (decl
) = 1;
14528 /* Initialize the variables used during compilation of a C++
14532 push_cp_function_context (f
)
14533 struct function
*f
;
14535 struct cp_language_function
*p
14536 = ((struct cp_language_function
*)
14537 xcalloc (1, sizeof (struct cp_language_function
)));
14538 f
->language
= (struct language_function
*) p
;
14540 /* It takes an explicit call to expand_body to generate RTL for a
14544 /* Whenever we start a new function, we destroy temporaries in the
14546 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
14549 /* Free the language-specific parts of F, now that we've finished
14550 compiling the function. */
14553 pop_cp_function_context (f
)
14554 struct function
*f
;
14557 free (f
->language
);
14561 /* Mark P for GC. */
14564 mark_lang_function (p
)
14565 struct cp_language_function
*p
;
14570 mark_c_language_function (&p
->base
);
14572 ggc_mark_tree (p
->x_ctor_label
);
14573 ggc_mark_tree (p
->x_dtor_label
);
14574 ggc_mark_tree (p
->x_current_class_ptr
);
14575 ggc_mark_tree (p
->x_current_class_ref
);
14576 ggc_mark_tree (p
->x_eh_spec_try_block
);
14578 mark_named_label_lists (&p
->x_named_labels
, &p
->x_named_label_uses
);
14579 mark_binding_level (&p
->bindings
);
14582 /* Mark the language-specific data in F for GC. */
14585 mark_cp_function_context (f
)
14586 struct function
*f
;
14588 mark_lang_function ((struct cp_language_function
*) f
->language
);
14595 enum tree_code code
= TREE_CODE (t
);
14596 if (code
== IDENTIFIER_NODE
)
14598 struct lang_identifier
*li
= (struct lang_identifier
*) t
;
14599 struct lang_id2
*li2
= li
->x
;
14600 ggc_mark_tree (li
->namespace_bindings
);
14601 ggc_mark_tree (li
->bindings
);
14602 ggc_mark_tree (li
->class_value
);
14603 ggc_mark_tree (li
->class_template_info
);
14607 ggc_mark_tree (li2
->label_value
);
14608 ggc_mark_tree (li2
->implicit_decl
);
14609 ggc_mark_tree (li2
->error_locus
);
14612 else if (code
== CPLUS_BINDING
)
14614 if (BINDING_HAS_LEVEL_P (t
))
14615 mark_binding_level (&BINDING_LEVEL (t
));
14617 ggc_mark_tree (BINDING_SCOPE (t
));
14618 ggc_mark_tree (BINDING_VALUE (t
));
14620 else if (code
== OVERLOAD
)
14621 ggc_mark_tree (OVL_FUNCTION (t
));
14622 else if (code
== TEMPLATE_PARM_INDEX
)
14623 ggc_mark_tree (TEMPLATE_PARM_DECL (t
));
14624 else if (TREE_CODE_CLASS (code
) == 'd')
14626 struct lang_decl
*ld
= DECL_LANG_SPECIFIC (t
);
14631 c_mark_lang_decl (&ld
->decl_flags
.base
);
14632 if (!DECL_GLOBAL_CTOR_P (t
)
14633 && !DECL_GLOBAL_DTOR_P (t
)
14634 && !DECL_THUNK_P (t
))
14635 ggc_mark_tree (ld
->decl_flags
.u2
.access
);
14636 else if (DECL_THUNK_P (t
))
14637 ggc_mark_tree (ld
->decl_flags
.u2
.vcall_offset
);
14638 if (TREE_CODE (t
) != NAMESPACE_DECL
)
14639 ggc_mark_tree (ld
->decl_flags
.u
.template_info
);
14641 mark_binding_level (&NAMESPACE_LEVEL (t
));
14642 if (CAN_HAVE_FULL_LANG_DECL_P (t
))
14644 ggc_mark_tree (ld
->befriending_classes
);
14645 ggc_mark_tree (ld
->context
);
14646 ggc_mark_tree (ld
->cloned_function
);
14647 if (!DECL_OVERLOADED_OPERATOR_P (t
))
14648 ggc_mark_tree (ld
->u2
.vtt_parm
);
14649 if (TREE_CODE (t
) == TYPE_DECL
)
14650 ggc_mark_tree (ld
->u
.sorted_fields
);
14651 else if (TREE_CODE (t
) == FUNCTION_DECL
14652 && !DECL_PENDING_INLINE_P (t
))
14653 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t
));
14657 else if (TREE_CODE_CLASS (code
) == 't')
14659 struct lang_type
*lt
= TYPE_LANG_SPECIFIC (t
);
14661 if (lt
&& !(TREE_CODE (t
) == POINTER_TYPE
14662 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
14665 ggc_mark_tree (lt
->primary_base
);
14666 ggc_mark_tree (lt
->vfields
);
14667 ggc_mark_tree (lt
->vbases
);
14668 ggc_mark_tree (lt
->tags
);
14669 ggc_mark_tree (lt
->size
);
14670 ggc_mark_tree (lt
->pure_virtuals
);
14671 ggc_mark_tree (lt
->friend_classes
);
14672 ggc_mark_tree (lt
->rtti
);
14673 ggc_mark_tree (lt
->methods
);
14674 ggc_mark_tree (lt
->template_info
);
14675 ggc_mark_tree (lt
->befriending_classes
);
14678 /* In the case of pointer-to-member function types, the
14679 TYPE_LANG_SPECIFIC is really just a tree. */
14680 ggc_mark_tree ((tree
) lt
);