1 /* Process declarations and variables for C compiler.
2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
3 2001 Free Software Foundation, Inc.
4 Contributed by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GNU CC.
8 GNU CC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GNU CC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GNU CC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
24 /* Process declarations and symbol lookup for C front end.
25 Also constructs types; the standard scalar types at initialization,
26 and structure, union, array and enum types when they are declared. */
28 /* ??? not all decl nodes are given the most useful possible
29 line numbers. For example, the CONST_DECLs for enum values. */
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 static tree grokparms
PARAMS ((tree
));
66 static const char *redeclaration_error_message
PARAMS ((tree
, tree
));
68 static void push_binding_level
PARAMS ((struct binding_level
*, int,
70 static void pop_binding_level
PARAMS ((void));
71 static void suspend_binding_level
PARAMS ((void));
72 static void resume_binding_level
PARAMS ((struct binding_level
*));
73 static struct binding_level
*make_binding_level
PARAMS ((void));
74 static void declare_namespace_level
PARAMS ((void));
75 static int decl_jump_unsafe
PARAMS ((tree
));
76 static void storedecls
PARAMS ((tree
));
77 static void require_complete_types_for_parms
PARAMS ((tree
));
78 static int ambi_op_p
PARAMS ((enum tree_code
));
79 static int unary_op_p
PARAMS ((enum tree_code
));
80 static tree store_bindings
PARAMS ((tree
, tree
));
81 static tree lookup_tag_reverse
PARAMS ((tree
, tree
));
82 static tree obscure_complex_init
PARAMS ((tree
, tree
));
83 static tree lookup_name_real
PARAMS ((tree
, int, int, int));
84 static void warn_extern_redeclared_static
PARAMS ((tree
, tree
));
85 static void grok_reference_init
PARAMS ((tree
, tree
, tree
));
86 static tree grokfndecl
PARAMS ((tree
, tree
, tree
, tree
, int,
87 enum overload_flags
, tree
,
88 tree
, int, int, int, int, int, int, tree
));
89 static tree grokvardecl
PARAMS ((tree
, tree
, RID_BIT_TYPE
*, int, int, tree
));
90 static tree lookup_tag
PARAMS ((enum tree_code
, tree
,
91 struct binding_level
*, int));
92 static void set_identifier_type_value_with_scope
93 PARAMS ((tree
, tree
, struct binding_level
*));
94 static void record_unknown_type
PARAMS ((tree
, const char *));
95 static tree build_library_fn_1
PARAMS ((tree
, enum tree_code
, tree
));
96 static int member_function_or_else
PARAMS ((tree
, tree
, enum overload_flags
));
97 static void bad_specifiers
PARAMS ((tree
, const char *, int, int, int, int,
99 static tree maybe_process_template_type_declaration
PARAMS ((tree
, int, struct binding_level
*));
100 static void check_for_uninitialized_const_var
PARAMS ((tree
));
101 static unsigned long typename_hash
PARAMS ((hash_table_key
));
102 static boolean typename_compare
PARAMS ((hash_table_key
, hash_table_key
));
103 static void push_binding
PARAMS ((tree
, tree
, struct binding_level
*));
104 static int add_binding
PARAMS ((tree
, tree
));
105 static void pop_binding
PARAMS ((tree
, tree
));
106 static tree local_variable_p_walkfn
PARAMS ((tree
*, int *, void *));
107 static tree find_binding
PARAMS ((tree
, tree
));
108 static tree select_decl
PARAMS ((tree
, int));
109 static int lookup_flags
PARAMS ((int, int));
110 static tree qualify_lookup
PARAMS ((tree
, int));
111 static tree record_builtin_java_type
PARAMS ((const char *, int));
112 static const char *tag_name
PARAMS ((enum tag_types code
));
113 static void find_class_binding_level
PARAMS ((void));
114 static struct binding_level
*innermost_nonclass_level
PARAMS ((void));
115 static void warn_about_implicit_typename_lookup
PARAMS ((tree
, tree
));
116 static int walk_namespaces_r
PARAMS ((tree
, walk_namespaces_fn
, void *));
117 static int walk_globals_r
PARAMS ((tree
, void *));
118 static void add_decl_to_level
PARAMS ((tree
, struct binding_level
*));
119 static tree make_label_decl
PARAMS ((tree
, int));
120 static void use_label
PARAMS ((tree
));
121 static void check_previous_goto_1
PARAMS ((tree
, struct binding_level
*, tree
,
123 static void check_previous_goto
PARAMS ((struct named_label_use_list
*));
124 static void check_switch_goto
PARAMS ((struct binding_level
*));
125 static void check_previous_gotos
PARAMS ((tree
));
126 static void pop_label
PARAMS ((tree
, tree
));
127 static void pop_labels
PARAMS ((tree
));
128 static void maybe_deduce_size_from_array_init
PARAMS ((tree
, tree
));
129 static void layout_var_decl
PARAMS ((tree
));
130 static void maybe_commonize_var
PARAMS ((tree
));
131 static tree check_initializer
PARAMS ((tree
, tree
));
132 static void make_rtl_for_nonlocal_decl
PARAMS ((tree
, tree
, const char *));
133 static void push_cp_function_context
PARAMS ((struct function
*));
134 static void pop_cp_function_context
PARAMS ((struct function
*));
135 static void mark_binding_level
PARAMS ((void *));
136 static void mark_named_label_lists
PARAMS ((void *, void *));
137 static void mark_cp_function_context
PARAMS ((struct function
*));
138 static void mark_saved_scope
PARAMS ((void *));
139 static void mark_lang_function
PARAMS ((struct cp_language_function
*));
140 static void save_function_data
PARAMS ((tree
));
141 static void check_function_type
PARAMS ((tree
, tree
));
142 static void destroy_local_var
PARAMS ((tree
));
143 static void finish_constructor_body
PARAMS ((void));
144 static void finish_destructor_body
PARAMS ((void));
145 static tree create_array_type_for_decl
PARAMS ((tree
, tree
, tree
));
146 static tree get_atexit_node
PARAMS ((void));
147 static tree get_dso_handle_node
PARAMS ((void));
148 static tree start_cleanup_fn
PARAMS ((void));
149 static void end_cleanup_fn
PARAMS ((void));
150 static tree cp_make_fname_decl
PARAMS ((tree
, const char *, int));
151 static void initialize_predefined_identifiers
PARAMS ((void));
152 static tree check_special_function_return_type
153 PARAMS ((special_function_kind
, tree
, tree
, tree
));
154 static tree push_cp_library_fn
PARAMS ((enum tree_code
, tree
));
155 static tree build_cp_library_fn
PARAMS ((tree
, enum tree_code
, tree
));
156 static void store_parm_decls
PARAMS ((tree
));
157 static int cp_missing_noreturn_ok_p
PARAMS ((tree
));
159 #if defined (DEBUG_CP_BINDING_LEVELS)
160 static void indent
PARAMS ((void));
163 /* Erroneous argument lists can use this *IFF* they do not modify it. */
164 tree error_mark_list
;
166 /* The following symbols are subsumed in the cp_global_trees array, and
167 listed here individually for documentation purposes.
170 tree wchar_decl_node;
172 tree vtable_entry_type;
173 tree delta_type_node;
176 tree __baselist_desc_type_node;
177 tree __i_desc_type_node, __m_desc_type_node;
178 tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type;
180 tree __t_desc_type_node;
182 tree __tp_desc_type_node;
184 tree ti_desc_type_node;
185 tree bltn_desc_type_node, ptr_desc_type_node;
186 tree ary_desc_type_node, func_desc_type_node, enum_desc_type_node;
187 tree class_desc_type_node, si_class_desc_type_node, vmi_class_desc_type_node;
188 tree ptm_desc_type_node;
189 tree base_desc_type_node;
191 Not needed yet? May be needed one day?
192 tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type;
193 tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type;
194 tree __ptmf_desc_array_type, __ptmd_desc_array_type;
197 tree class_type_node, record_type_node, union_type_node, enum_type_node;
198 tree unknown_type_node;
200 Array type `vtable_entry_type[]'
203 tree vtbl_ptr_type_node;
210 A FUNCTION_DECL which can call `abort'. Not necessarily the
211 one that the user will declare, but sufficient to be called
212 by routines that want to abort the program.
216 The FUNCTION_DECL for the default `::operator delete'.
218 tree global_delete_fndecl;
221 tree type_info_type_node, tinfo_decl_id, tinfo_decl_type;
226 tree cp_global_trees
[CPTI_MAX
];
228 /* Indicates that there is a type value in some namespace, although
229 that is not necessarily in scope at the moment. */
231 static tree global_type_node
;
233 /* If non-zero, this is the number of times we have entered the `std'
234 namespace when we are treating that namespace as an alias for the
236 static int in_fake_std
;
238 /* Expect only namespace names now. */
239 static int only_namespace_names
;
241 /* Used only for jumps to as-yet undefined labels, since jumps to
242 defined labels can have their validity checked immediately. */
244 struct named_label_use_list
246 struct binding_level
*binding_level
;
249 const char *filename_o_goto
;
251 struct named_label_use_list
*next
;
254 #define named_label_uses cp_function_chain->x_named_label_uses
256 /* A list of objects which have constructors or destructors
257 which reside in the global scope. The decl is stored in
258 the TREE_VALUE slot and the initializer is stored
259 in the TREE_PURPOSE slot. */
260 tree static_aggregates
;
264 /* A node for the integer constants 2, and 3. */
266 tree integer_two_node
, integer_three_node
;
268 /* Parsing a function declarator leaves here a chain of structure
269 and enum types declared in the parmlist. */
271 static tree last_function_parm_tags
;
273 /* Similar, for last_function_parm_tags. */
274 tree last_function_parms
;
275 static tree current_function_parm_tags
;
277 /* A list of all LABEL_DECLs in the function that have names. Here so
278 we can clear out their names' definitions at the end of the
279 function, and so we can check the validity of jumps to these labels. */
281 struct named_label_list
283 struct binding_level
*binding_level
;
289 struct named_label_list
*next
;
292 #define named_labels cp_function_chain->x_named_labels
294 /* Set to 0 at beginning of a function definition, and whenever
295 a label (case or named) is defined. Set to value of expression
296 returned from function when that value can be transformed into
297 a named return value. */
299 tree current_function_return_value
;
301 /* Nonzero means use the ISO C94 dialect of C. */
305 /* Nonzero means use the ISO C99 dialect of C. */
309 /* Nonzero means we are a hosted implementation for code shared with C. */
313 /* Nonzero means add default format_arg attributes for functions not
316 int flag_noniso_default_format_attributes
= 1;
318 /* Nonzero if we want to conserve space in the .o files. We do this
319 by putting uninitialized data and runtime initialized data into
320 .common instead of .data at the expense of not flagging multiple
322 extern int flag_conserve_space
;
324 /* C and C++ flags are in decl2.c. */
326 /* Flag used when debugging spew.c */
328 extern int spew_debug
;
330 /* A expression of value 0 with the same precision as a sizetype
332 tree signed_size_zero_node
;
334 /* The name of the anonymous namespace, throughout this translation
336 tree anonymous_namespace_name
;
338 /* The number of function bodies which we are currently processing.
339 (Zero if we are at namespace scope, one inside the body of a
340 function, two inside the body of a function in a local class, etc.) */
343 /* For each binding contour we allocate a binding_level structure
344 which records the names defined in that contour.
347 1) one for each function definition,
348 where internal declarations of the parameters appear.
349 2) one for each compound statement,
350 to record its declarations.
352 The current meaning of a name can be found by searching the levels
353 from the current one out to the global one.
355 Off to the side, may be the class_binding_level. This exists only
356 to catch class-local declarations. It is otherwise nonexistent.
358 Also there may be binding levels that catch cleanups that must be
359 run when exceptions occur. Thus, to see whether a name is bound in
360 the current scope, it is not enough to look in the
361 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
364 /* Note that the information in the `names' component of the global contour
365 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
369 /* A chain of _DECL nodes for all variables, constants, functions,
370 and typedef types. These are in the reverse of the order
371 supplied. There may be OVERLOADs on this list, too, but they
372 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
375 /* A list of structure, union and enum definitions, for looking up
377 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
378 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
379 or ENUMERAL_TYPE node.
381 C++: the TREE_VALUE nodes can be simple types for
382 component_bindings. */
385 /* A list of USING_DECL nodes. */
388 /* A list of used namespaces. PURPOSE is the namespace,
389 VALUE the common ancestor with this binding_level's namespace. */
390 tree using_directives
;
392 /* If this binding level is the binding level for a class, then
393 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
394 is the name of an entity bound in the class. The TREE_TYPE is
395 the DECL bound by this name in the class. */
398 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
399 is used for all binding levels. In addition the TREE_VALUE is the
400 IDENTIFIER_TYPE_VALUE before we entered the class. */
403 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
404 label in this scope. The TREE_PURPOSE is the previous value of
405 the IDENTIFIER_LABEL VALUE. */
406 tree shadowed_labels
;
408 /* For each level (except not the global one),
409 a chain of BLOCK nodes for all the levels
410 that were entered and exited one level down. */
413 /* The _TYPE node for this level, if parm_flag == 2. */
416 /* The binding level which this one is contained in (inherits from). */
417 struct binding_level
*level_chain
;
419 /* List of decls in `names' that have incomplete
420 structure or union types. */
423 /* List of VAR_DECLS saved from a previous for statement.
424 These would be dead in ISO-conforming code, but might
425 be referenced in ARM-era code. These are stored in a
426 TREE_LIST; the TREE_VALUE is the actual declaration. */
427 tree dead_vars_from_for
;
429 /* 1 for the level that holds the parameters of a function.
430 2 for the level that holds a class declaration. */
431 unsigned parm_flag
: 2;
433 /* 1 means make a BLOCK for this level regardless of all else.
434 2 for temporary binding contours created by the compiler. */
437 /* Nonzero if this level "doesn't exist" for tags. */
438 unsigned tag_transparent
: 1;
440 /* Nonzero if this level can safely have additional
441 cleanup-needing variables added to it. */
442 unsigned more_cleanups_ok
: 1;
443 unsigned have_cleanups
: 1;
445 /* Nonzero if this scope is for storing the decls for template
446 parameters and generic decls; these decls will be discarded and
447 replaced with a TEMPLATE_DECL. */
448 unsigned template_parms_p
: 1;
450 /* Nonzero if this scope corresponds to the `<>' in a
451 `template <>' clause. Whenever this flag is set,
452 TEMPLATE_PARMS_P will be set as well. */
453 unsigned template_spec_p
: 1;
455 /* This is set for a namespace binding level. */
456 unsigned namespace_p
: 1;
458 /* True if this level is that of a for-statement where we need to
459 worry about ambiguous (ARM or ISO) scope rules. */
460 unsigned is_for_scope
: 1;
462 /* True if this level corresponds to an EH region, as for a try block.
463 Currently this information is only available while building the
465 unsigned eh_region
: 1;
467 /* Four bits left for this word. */
469 #if defined(DEBUG_CP_BINDING_LEVELS)
470 /* Binding depth at which this level began. */
471 unsigned binding_depth
;
472 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
475 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
477 /* The binding level currently in effect. */
479 #define current_binding_level \
481 ? cp_function_chain->bindings \
482 : scope_chain->bindings)
484 /* The binding level of the current class, if any. */
486 #define class_binding_level scope_chain->class_bindings
488 /* A chain of binding_level structures awaiting reuse. */
490 static struct binding_level
*free_binding_level
;
492 /* The outermost binding level, for names of file scope.
493 This is created when the compiler is started and exists
494 through the entire run. */
496 static struct binding_level
*global_binding_level
;
498 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
500 static int keep_next_level_flag
;
502 #if defined(DEBUG_CP_BINDING_LEVELS)
503 static int binding_depth
= 0;
504 static int is_class_level
= 0;
511 for (i
= 0; i
< binding_depth
*2; i
++)
514 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
516 static tree pushdecl_with_scope
PARAMS ((tree
, struct binding_level
*));
519 push_binding_level (newlevel
, tag_transparent
, keep
)
520 struct binding_level
*newlevel
;
521 int tag_transparent
, keep
;
523 /* Add this level to the front of the chain (stack) of levels that
525 memset ((char*) newlevel
, 0, sizeof (struct binding_level
));
526 newlevel
->level_chain
= current_binding_level
;
527 current_binding_level
= newlevel
;
528 newlevel
->tag_transparent
= tag_transparent
;
529 newlevel
->more_cleanups_ok
= 1;
531 newlevel
->keep
= keep
;
532 #if defined(DEBUG_CP_BINDING_LEVELS)
533 newlevel
->binding_depth
= binding_depth
;
535 fprintf (stderr
, "push %s level 0x%08x line %d\n",
536 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
539 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
542 /* Find the innermost enclosing class scope, and reset
543 CLASS_BINDING_LEVEL appropriately. */
546 find_class_binding_level ()
548 struct binding_level
*level
= current_binding_level
;
550 while (level
&& level
->parm_flag
!= 2)
551 level
= level
->level_chain
;
552 if (level
&& level
->parm_flag
== 2)
553 class_binding_level
= level
;
555 class_binding_level
= 0;
561 if (global_binding_level
)
563 /* Cannot pop a level, if there are none left to pop. */
564 if (current_binding_level
== global_binding_level
)
565 my_friendly_abort (123);
567 /* Pop the current level, and free the structure for reuse. */
568 #if defined(DEBUG_CP_BINDING_LEVELS)
571 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
572 (is_class_level
) ? "class" : "block",
573 current_binding_level
, lineno
);
574 if (is_class_level
!= (current_binding_level
== class_binding_level
))
577 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
580 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
582 register struct binding_level
*level
= current_binding_level
;
583 current_binding_level
= current_binding_level
->level_chain
;
584 level
->level_chain
= free_binding_level
;
585 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
586 if (level
->binding_depth
!= binding_depth
)
588 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
589 free_binding_level
= level
;
590 find_class_binding_level ();
595 suspend_binding_level ()
597 if (class_binding_level
)
598 current_binding_level
= class_binding_level
;
600 if (global_binding_level
)
602 /* Cannot suspend a level, if there are none left to suspend. */
603 if (current_binding_level
== global_binding_level
)
604 my_friendly_abort (123);
606 /* Suspend the current level. */
607 #if defined(DEBUG_CP_BINDING_LEVELS)
610 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
611 (is_class_level
) ? "class" : "block",
612 current_binding_level
, lineno
);
613 if (is_class_level
!= (current_binding_level
== class_binding_level
))
616 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
619 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
620 current_binding_level
= current_binding_level
->level_chain
;
621 find_class_binding_level ();
625 resume_binding_level (b
)
626 struct binding_level
*b
;
628 /* Resuming binding levels is meant only for namespaces,
629 and those cannot nest into classes. */
630 my_friendly_assert(!class_binding_level
, 386);
631 /* Also, resuming a non-directly nested namespace is a no-no. */
632 my_friendly_assert(b
->level_chain
== current_binding_level
, 386);
633 current_binding_level
= b
;
634 #if defined(DEBUG_CP_BINDING_LEVELS)
635 b
->binding_depth
= binding_depth
;
637 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
638 (is_class_level
) ? "class" : "block", b
, lineno
);
641 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
644 /* Create a new `struct binding_level'. */
647 struct binding_level
*
648 make_binding_level ()
651 return (struct binding_level
*) xmalloc (sizeof (struct binding_level
));
654 /* Nonzero if we are currently in the global binding level. */
659 return current_binding_level
== global_binding_level
;
662 /* Return the innermost binding level that is not for a class scope. */
664 static struct binding_level
*
665 innermost_nonclass_level ()
667 struct binding_level
*b
;
669 b
= current_binding_level
;
670 while (b
->parm_flag
== 2)
676 /* Nonzero if we are currently in a toplevel binding level. This
677 means either the global binding level or a namespace in a toplevel
678 binding level. Since there are no non-toplevel namespace levels,
679 this really means any namespace or template parameter level. We
680 also include a class whose context is toplevel. */
683 toplevel_bindings_p ()
685 struct binding_level
*b
= innermost_nonclass_level ();
687 return b
->namespace_p
|| b
->template_parms_p
;
690 /* Nonzero if this is a namespace scope, or if we are defining a class
691 which is itself at namespace scope, or whose enclosing class is
692 such a class, etc. */
695 namespace_bindings_p ()
697 struct binding_level
*b
= innermost_nonclass_level ();
699 return b
->namespace_p
;
702 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
703 unconditionally. Otherwise, use the normal logic to decide whether
704 or not to create a BLOCK. */
707 keep_next_level (keep
)
710 keep_next_level_flag
= keep
;
713 /* Nonzero if the current level needs to have a BLOCK made. */
718 return (current_binding_level
->blocks
!= NULL_TREE
719 || current_binding_level
->keep
720 || current_binding_level
->names
!= NULL_TREE
721 || (current_binding_level
->tags
!= NULL_TREE
722 && !current_binding_level
->tag_transparent
));
726 declare_namespace_level ()
728 current_binding_level
->namespace_p
= 1;
731 /* Returns non-zero if this scope was created to store template
735 template_parm_scope_p ()
737 return current_binding_level
->template_parms_p
;
740 /* Returns the kind of template specialization we are currently
741 processing, given that it's declaration contained N_CLASS_SCOPES
742 explicit scope qualifications. */
745 current_tmpl_spec_kind (n_class_scopes
)
748 int n_template_parm_scopes
= 0;
749 int seen_specialization_p
= 0;
750 int innermost_specialization_p
= 0;
751 struct binding_level
*b
;
753 /* Scan through the template parameter scopes. */
754 for (b
= current_binding_level
; b
->template_parms_p
; b
= b
->level_chain
)
756 /* If we see a specialization scope inside a parameter scope,
757 then something is wrong. That corresponds to a declaration
760 template <class T> template <> ...
762 which is always illegal since [temp.expl.spec] forbids the
763 specialization of a class member template if the enclosing
764 class templates are not explicitly specialized as well. */
765 if (b
->template_spec_p
)
767 if (n_template_parm_scopes
== 0)
768 innermost_specialization_p
= 1;
770 seen_specialization_p
= 1;
772 else if (seen_specialization_p
== 1)
773 return tsk_invalid_member_spec
;
775 ++n_template_parm_scopes
;
778 /* Handle explicit instantiations. */
779 if (processing_explicit_instantiation
)
781 if (n_template_parm_scopes
!= 0)
782 /* We've seen a template parameter list during an explicit
783 instantiation. For example:
785 template <class T> template void f(int);
787 This is erroneous. */
788 return tsk_invalid_expl_inst
;
790 return tsk_expl_inst
;
793 if (n_template_parm_scopes
< n_class_scopes
)
794 /* We've not seen enough template headers to match all the
795 specialized classes present. For example:
797 template <class T> void R<T>::S<T>::f(int);
799 This is illegal; there needs to be one set of template
800 parameters for each class. */
801 return tsk_insufficient_parms
;
802 else if (n_template_parm_scopes
== n_class_scopes
)
803 /* We're processing a non-template declaration (even though it may
804 be a member of a template class.) For example:
806 template <class T> void S<T>::f(int);
808 The `class T' maches the `S<T>', leaving no template headers
809 corresponding to the `f'. */
811 else if (n_template_parm_scopes
> n_class_scopes
+ 1)
812 /* We've got too many template headers. For example:
814 template <> template <class T> void f (T);
816 There need to be more enclosing classes. */
817 return tsk_excessive_parms
;
819 /* This must be a template. It's of the form:
821 template <class T> template <class U> void S<T>::f(U);
823 This is a specialization if the innermost level was a
824 specialization; otherwise it's just a definition of the
826 return innermost_specialization_p
? tsk_expl_spec
: tsk_template
;
830 set_class_shadows (shadows
)
833 class_binding_level
->class_shadowed
= shadows
;
836 /* Enter a new binding level.
837 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
838 not for that of tags. */
841 pushlevel (tag_transparent
)
844 struct binding_level
*newlevel
;
846 if (cfun
&& !doing_semantic_analysis_p ())
849 /* Reuse or create a struct for this binding level. */
850 #if defined(DEBUG_CP_BINDING_LEVELS)
852 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
853 if (free_binding_level
)
854 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
856 newlevel
= free_binding_level
;
857 free_binding_level
= free_binding_level
->level_chain
;
860 newlevel
= make_binding_level ();
862 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
863 GNU_xref_start_scope ((HOST_WIDE_INT
) newlevel
);
864 keep_next_level_flag
= 0;
867 /* Enter a new scope. The KIND indicates what kind of scope is being
878 case sk_template_spec
:
879 current_binding_level
->template_spec_p
= 1;
882 case sk_template_parms
:
883 current_binding_level
->template_parms_p
= 1;
887 my_friendly_abort (20000309);
891 /* Exit the current scope. */
900 note_level_for_for ()
902 current_binding_level
->is_for_scope
= 1;
905 /* Record that the current binding level represents a try block. */
910 current_binding_level
->eh_region
= 1;
913 /* For a binding between a name and an entity at a block scope,
914 this is the `struct binding_level' for the block. */
915 #define BINDING_LEVEL(NODE) \
916 (((struct tree_binding*)NODE)->scope.level)
918 /* A free list of CPLUS_BINDING nodes, connected by their
921 static tree free_bindings
;
923 /* Make DECL the innermost binding for ID. The LEVEL is the binding
924 level at which this declaration is being bound. */
927 push_binding (id
, decl
, level
)
930 struct binding_level
* level
;
936 binding
= free_bindings
;
937 free_bindings
= TREE_CHAIN (binding
);
940 binding
= make_node (CPLUS_BINDING
);
942 /* Now, fill in the binding information. */
943 BINDING_VALUE (binding
) = decl
;
944 BINDING_TYPE (binding
) = NULL_TREE
;
945 BINDING_LEVEL (binding
) = level
;
946 INHERITED_VALUE_BINDING_P (binding
) = 0;
947 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
948 BINDING_HAS_LEVEL_P (binding
) = 1;
950 /* And put it on the front of the list of bindings for ID. */
951 TREE_CHAIN (binding
) = IDENTIFIER_BINDING (id
);
952 IDENTIFIER_BINDING (id
) = binding
;
955 /* ID is already bound in the current scope. But, DECL is an
956 additional binding for ID in the same scope. This is the `struct
957 stat' hack whereby a non-typedef class-name or enum-name can be
958 bound at the same level as some other kind of entity. It's the
959 responsibility of the caller to check that inserting this name is
960 legal here. Returns nonzero if the new binding was successful. */
962 add_binding (id
, decl
)
966 tree binding
= IDENTIFIER_BINDING (id
);
969 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
970 /* The new name is the type name. */
971 BINDING_TYPE (binding
) = decl
;
972 else if (!BINDING_VALUE (binding
))
973 /* This situation arises when push_class_level_binding moves an
974 inherited type-binding out of the way to make room for a new
976 BINDING_VALUE (binding
) = decl
;
977 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
978 && DECL_ARTIFICIAL (BINDING_VALUE (binding
)))
980 /* The old binding was a type name. It was placed in
981 BINDING_VALUE because it was thought, at the point it was
982 declared, to be the only entity with such a name. Move the
983 type name into the type slot; it is now hidden by the new
985 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
986 BINDING_VALUE (binding
) = decl
;
987 INHERITED_VALUE_BINDING_P (binding
) = 0;
989 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
990 && TREE_CODE (decl
) == TYPE_DECL
991 && DECL_NAME (decl
) == DECL_NAME (BINDING_VALUE (binding
))
992 && same_type_p (TREE_TYPE (decl
),
993 TREE_TYPE (BINDING_VALUE (binding
))))
994 /* We have two typedef-names, both naming the same type to have
995 the same name. This is OK because of:
999 In a given scope, a typedef specifier can be used to redefine
1000 the name of any type declared in that scope to refer to the
1001 type to which it already refers. */
1003 /* There can be two block-scope declarations of the same variable,
1004 so long as they are `extern' declarations. */
1005 else if (TREE_CODE (decl
) == VAR_DECL
1006 && TREE_CODE (BINDING_VALUE (binding
)) == VAR_DECL
1007 && DECL_EXTERNAL (decl
)
1008 && DECL_EXTERNAL (BINDING_VALUE (binding
)))
1010 duplicate_decls (decl
, BINDING_VALUE (binding
));
1015 cp_error ("declaration of `%#D'", decl
);
1016 cp_error_at ("conflicts with previous declaration `%#D'",
1017 BINDING_VALUE (binding
));
1024 /* Add DECL to the list of things declared in B. */
1027 add_decl_to_level (decl
, b
)
1029 struct binding_level
*b
;
1031 /* We build up the list in reverse order, and reverse it later if
1033 TREE_CHAIN (decl
) = b
->names
;
1037 /* Bind DECL to ID in the current_binding_level, assumed to be a local
1038 binding level. If PUSH_USING is set in FLAGS, we know that DECL
1039 doesn't really belong to this binding level, that it got here
1040 through a using-declaration. */
1043 push_local_binding (id
, decl
, flags
)
1048 struct binding_level
*b
;
1050 /* Skip over any local classes. This makes sense if we call
1051 push_local_binding with a friend decl of a local class. */
1052 b
= current_binding_level
;
1053 while (b
->parm_flag
== 2)
1056 if (lookup_name_current_level (id
))
1058 /* Supplement the existing binding. */
1059 if (!add_binding (id
, decl
))
1060 /* It didn't work. Something else must be bound at this
1061 level. Do not add DECL to the list of things to pop
1066 /* Create a new binding. */
1067 push_binding (id
, decl
, b
);
1069 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
1070 /* We must put the OVERLOAD into a TREE_LIST since the
1071 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1072 decls that got here through a using-declaration. */
1073 decl
= build_tree_list (NULL_TREE
, decl
);
1075 /* And put DECL on the list of things declared by the current
1077 add_decl_to_level (decl
, b
);
1080 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
1081 binding was successful. */
1084 push_class_binding (id
, decl
)
1089 tree binding
= IDENTIFIER_BINDING (id
);
1092 /* Note that we declared this value so that we can issue an error if
1093 this an illegal redeclaration of a name already used for some
1095 note_name_declared_in_class (id
, decl
);
1097 if (binding
&& BINDING_LEVEL (binding
) == class_binding_level
)
1098 /* Supplement the existing binding. */
1099 result
= add_binding (id
, decl
);
1101 /* Create a new binding. */
1102 push_binding (id
, decl
, class_binding_level
);
1104 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1105 class-level declaration. Note that we do not use DECL here
1106 because of the possibility of the `struct stat' hack; if DECL is
1107 a class-name or enum-name we might prefer a field-name, or some
1109 IDENTIFIER_CLASS_VALUE (id
) = BINDING_VALUE (IDENTIFIER_BINDING (id
));
1111 /* If this is a binding from a base class, mark it as such. */
1112 binding
= IDENTIFIER_BINDING (id
);
1113 if (BINDING_VALUE (binding
) == decl
&& TREE_CODE (decl
) != TREE_LIST
)
1115 /* Any implicit typename must be from a base-class. The
1116 context for an implicit typename declaration is always
1117 the derived class in which the lookup was done, so the checks
1118 based on the context of DECL below will not trigger. */
1119 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl
))
1120 INHERITED_VALUE_BINDING_P (binding
) = 1;
1123 if (TREE_CODE (decl
) == OVERLOAD
)
1124 context
= CP_DECL_CONTEXT (OVL_CURRENT (decl
));
1127 my_friendly_assert (DECL_P (decl
), 0);
1128 context
= CP_DECL_CONTEXT (decl
);
1131 if (is_properly_derived_from (current_class_type
, context
))
1132 INHERITED_VALUE_BINDING_P (binding
) = 1;
1134 INHERITED_VALUE_BINDING_P (binding
) = 0;
1137 else if (BINDING_VALUE (binding
) == decl
)
1138 /* We only encounter a TREE_LIST when push_class_decls detects an
1139 ambiguity. Such an ambiguity can be overridden by a definition
1141 INHERITED_VALUE_BINDING_P (binding
) = 1;
1146 /* Remove the binding for DECL which should be the innermost binding
1150 pop_binding (id
, decl
)
1156 if (id
== NULL_TREE
)
1157 /* It's easiest to write the loops that call this function without
1158 checking whether or not the entities involved have names. We
1159 get here for such an entity. */
1162 /* Get the innermost binding for ID. */
1163 binding
= IDENTIFIER_BINDING (id
);
1165 /* The name should be bound. */
1166 my_friendly_assert (binding
!= NULL_TREE
, 0);
1168 /* The DECL will be either the ordinary binding or the type
1169 binding for this identifier. Remove that binding. */
1170 if (BINDING_VALUE (binding
) == decl
)
1171 BINDING_VALUE (binding
) = NULL_TREE
;
1172 else if (BINDING_TYPE (binding
) == decl
)
1173 BINDING_TYPE (binding
) = NULL_TREE
;
1175 my_friendly_abort (0);
1177 if (!BINDING_VALUE (binding
) && !BINDING_TYPE (binding
))
1179 /* We're completely done with the innermost binding for this
1180 identifier. Unhook it from the list of bindings. */
1181 IDENTIFIER_BINDING (id
) = TREE_CHAIN (binding
);
1183 /* Add it to the free list. */
1184 TREE_CHAIN (binding
) = free_bindings
;
1185 free_bindings
= binding
;
1187 /* Clear the BINDING_LEVEL so the garbage collector doesn't walk
1189 BINDING_LEVEL (binding
) = NULL
;
1193 /* When a label goes out of scope, check to see if that label was used
1194 in a valid manner, and issue any appropriate warnings or errors. */
1197 pop_label (label
, old_value
)
1201 if (!processing_template_decl
&& doing_semantic_analysis_p ())
1203 if (DECL_INITIAL (label
) == NULL_TREE
)
1205 cp_error_at ("label `%D' used but not defined", label
);
1206 /* Avoid crashing later. */
1207 define_label (input_filename
, 1, DECL_NAME (label
));
1209 else if (warn_unused_label
&& !TREE_USED (label
))
1210 cp_warning_at ("label `%D' defined but not used", label
);
1213 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), old_value
);
1216 /* At the end of a function, all labels declared within the function
1217 go out of scope. BLOCK is the top-level block for the
1224 struct named_label_list
*link
;
1226 /* Clear out the definitions of all label names, since their scopes
1228 for (link
= named_labels
; link
; link
= link
->next
)
1230 pop_label (link
->label_decl
, link
->old_value
);
1231 /* Put the labels into the "variables" of the top-level block,
1232 so debugger can see them. */
1233 TREE_CHAIN (link
->label_decl
) = BLOCK_VARS (block
);
1234 BLOCK_VARS (block
) = link
->label_decl
;
1237 named_labels
= NULL
;
1240 /* Exit a binding level.
1241 Pop the level off, and restore the state of the identifier-decl mappings
1242 that were in effect when this level was entered.
1244 If KEEP == 1, this level had explicit declarations, so
1245 and create a "block" (a BLOCK node) for the level
1246 to record its declarations and subblocks for symbol table output.
1248 If FUNCTIONBODY is nonzero, this level is the body of a function,
1249 so create a block as if KEEP were set and also clear out all
1252 If REVERSE is nonzero, reverse the order of decls before putting
1253 them into the BLOCK. */
1256 poplevel (keep
, reverse
, functionbody
)
1262 /* The chain of decls was accumulated in reverse order.
1263 Put it into forward order, just for cleanliness. */
1265 int tmp
= functionbody
;
1266 int real_functionbody
;
1269 tree block
= NULL_TREE
;
1271 int leaving_for_scope
;
1273 if (cfun
&& !doing_semantic_analysis_p ())
1276 my_friendly_assert (current_binding_level
->parm_flag
!= 2,
1279 real_functionbody
= (current_binding_level
->keep
== 2
1280 ? ((functionbody
= 0), tmp
) : functionbody
);
1281 tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1282 subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1284 my_friendly_assert (!current_binding_level
->class_shadowed
,
1287 /* We used to use KEEP == 2 to indicate that the new block should go
1288 at the beginning of the list of blocks at this binding level,
1289 rather than the end. This hack is no longer used. */
1290 my_friendly_assert (keep
== 0 || keep
== 1, 0);
1292 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1293 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1294 current_binding_level
->parm_flag
,
1295 current_binding_level
->keep
);
1297 if (current_binding_level
->keep
== 1)
1300 /* Any uses of undefined labels, and any defined labels, now operate
1301 under constraints of next binding contour. */
1302 if (cfun
&& !functionbody
)
1304 struct binding_level
*level_chain
;
1305 level_chain
= current_binding_level
->level_chain
;
1308 struct named_label_use_list
*uses
;
1309 struct named_label_list
*labels
;
1310 for (labels
= named_labels
; labels
; labels
= labels
->next
)
1311 if (labels
->binding_level
== current_binding_level
)
1314 if (current_binding_level
->eh_region
)
1315 labels
->eh_region
= 1;
1316 for (decl
= labels
->names_in_scope
; decl
;
1317 decl
= TREE_CHAIN (decl
))
1318 if (decl_jump_unsafe (decl
))
1319 labels
->bad_decls
= tree_cons (NULL_TREE
, decl
,
1321 labels
->binding_level
= level_chain
;
1322 labels
->names_in_scope
= level_chain
->names
;
1325 for (uses
= named_label_uses
; uses
; uses
= uses
->next
)
1326 if (uses
->binding_level
== current_binding_level
)
1328 uses
->binding_level
= level_chain
;
1329 uses
->names_in_scope
= level_chain
->names
;
1334 /* Get the decls in the order they were written.
1335 Usually current_binding_level->names is in reverse order.
1336 But parameter decls were previously put in forward order. */
1339 current_binding_level
->names
1340 = decls
= nreverse (current_binding_level
->names
);
1342 decls
= current_binding_level
->names
;
1344 /* Output any nested inline functions within this block
1345 if they weren't already output. */
1346 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1347 if (TREE_CODE (decl
) == FUNCTION_DECL
1348 && ! TREE_ASM_WRITTEN (decl
)
1349 && DECL_INITIAL (decl
) != NULL_TREE
1350 && TREE_ADDRESSABLE (decl
)
1351 && decl_function_context (decl
) == current_function_decl
)
1353 /* If this decl was copied from a file-scope decl
1354 on account of a block-scope extern decl,
1355 propagate TREE_ADDRESSABLE to the file-scope decl. */
1356 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1357 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1360 push_function_context ();
1361 output_inline_function (decl
);
1362 pop_function_context ();
1366 /* When not in function-at-a-time mode, expand_end_bindings will
1367 warn about unused variables. But, in function-at-a-time mode
1368 expand_end_bindings is not passed the list of variables in the
1369 current scope, and therefore no warning is emitted. So, we
1370 explicitly warn here. */
1371 if (!processing_template_decl
)
1372 warn_about_unused_variables (getdecls ());
1374 /* If there were any declarations or structure tags in that level,
1375 or if this level is a function body,
1376 create a BLOCK to record them for the life of this function. */
1378 if (keep
== 1 || functionbody
)
1379 block
= make_node (BLOCK
);
1380 if (block
!= NULL_TREE
)
1382 BLOCK_VARS (block
) = decls
;
1383 BLOCK_SUBBLOCKS (block
) = subblocks
;
1386 /* In each subblock, record that this is its superior. */
1388 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1389 BLOCK_SUPERCONTEXT (link
) = block
;
1391 /* We still support the old for-scope rules, whereby the variables
1392 in a for-init statement were in scope after the for-statement
1393 ended. We only use the new rules in flag_new_for_scope is
1396 = current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1;
1398 /* Remove declarations for all the DECLs in this level. */
1399 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1401 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
1402 && DECL_NAME (link
))
1405 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link
)));
1409 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
1411 ns_binding
= NULL_TREE
;
1414 && (BINDING_LEVEL (outer_binding
)
1415 == current_binding_level
->level_chain
))
1416 /* We have something like:
1421 and we are leaving the `for' scope. There's no reason to
1422 keep the binding of the inner `i' in this case. */
1423 pop_binding (DECL_NAME (link
), link
);
1424 else if ((outer_binding
1425 && (TREE_CODE (BINDING_VALUE (outer_binding
))
1428 && TREE_CODE (ns_binding
) == TYPE_DECL
))
1429 /* Here, we have something like:
1437 We must pop the for-scope binding so we know what's a
1438 type and what isn't. */
1439 pop_binding (DECL_NAME (link
), link
);
1442 /* Mark this VAR_DECL as dead so that we can tell we left it
1443 there only for backward compatibility. */
1444 DECL_DEAD_FOR_LOCAL (link
) = 1;
1446 /* Keep track of what should of have happenned when we
1447 popped the binding. */
1448 if (outer_binding
&& BINDING_VALUE (outer_binding
))
1449 DECL_SHADOWED_FOR_VAR (link
)
1450 = BINDING_VALUE (outer_binding
);
1452 /* Add it to the list of dead variables in the next
1453 outermost binding to that we can remove these when we
1454 leave that binding. */
1455 current_binding_level
->level_chain
->dead_vars_from_for
1456 = tree_cons (NULL_TREE
, link
,
1457 current_binding_level
->level_chain
->
1458 dead_vars_from_for
);
1460 /* Although we don't pop the CPLUS_BINDING, we do clear
1461 its BINDING_LEVEL since the level is going away now. */
1462 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link
)))
1468 /* Remove the binding. */
1470 if (TREE_CODE (decl
) == TREE_LIST
)
1471 decl
= TREE_VALUE (decl
);
1473 pop_binding (DECL_NAME (decl
), decl
);
1474 else if (TREE_CODE (decl
) == OVERLOAD
)
1475 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
1477 my_friendly_abort (0);
1481 /* Remove declarations for any `for' variables from inner scopes
1482 that we kept around. */
1483 for (link
= current_binding_level
->dead_vars_from_for
;
1484 link
; link
= TREE_CHAIN (link
))
1485 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
1487 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1488 for (link
= current_binding_level
->type_shadowed
;
1489 link
; link
= TREE_CHAIN (link
))
1490 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1492 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1493 for (link
= current_binding_level
->shadowed_labels
;
1495 link
= TREE_CHAIN (link
))
1496 pop_label (TREE_VALUE (link
), TREE_PURPOSE (link
));
1498 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1499 list if a `using' declaration put them there. The debugging
1500 back-ends won't understand OVERLOAD, so we remove them here.
1501 Because the BLOCK_VARS are (temporarily) shared with
1502 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1503 popped all the bindings. */
1508 for (d
= &BLOCK_VARS (block
); *d
; )
1510 if (TREE_CODE (*d
) == TREE_LIST
)
1511 *d
= TREE_CHAIN (*d
);
1513 d
= &TREE_CHAIN (*d
);
1517 /* If the level being exited is the top level of a function,
1518 check over all the labels. */
1521 /* Since this is the top level block of a function, the vars are
1522 the function's parameters. Don't leave them in the BLOCK
1523 because they are found in the FUNCTION_DECL instead. */
1524 BLOCK_VARS (block
) = 0;
1528 tmp
= current_binding_level
->keep
;
1530 pop_binding_level ();
1532 DECL_INITIAL (current_function_decl
) = block
;
1534 current_binding_level
->blocks
1535 = chainon (current_binding_level
->blocks
, block
);
1537 /* If we did not make a block for the level just exited,
1538 any blocks made for inner levels
1539 (since they cannot be recorded as subblocks in that level)
1540 must be carried forward so they will later become subblocks
1541 of something else. */
1543 current_binding_level
->blocks
1544 = chainon (current_binding_level
->blocks
, subblocks
);
1546 /* Each and every BLOCK node created here in `poplevel' is important
1547 (e.g. for proper debugging information) so if we created one
1548 earlier, mark it as "used". */
1550 TREE_USED (block
) = 1;
1552 /* Take care of compiler's internal binding structures. */
1558 = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/1);
1561 SCOPE_STMT_BLOCK (TREE_PURPOSE (scope_stmts
)) = block
;
1562 SCOPE_STMT_BLOCK (TREE_VALUE (scope_stmts
)) = block
;
1565 block
= poplevel (keep
, reverse
, functionbody
);
1571 /* Delete the node BLOCK from the current binding level.
1572 This is used for the block inside a stmt expr ({...})
1573 so that the block can be reinserted where appropriate. */
1576 delete_block (block
)
1580 if (current_binding_level
->blocks
== block
)
1581 current_binding_level
->blocks
= TREE_CHAIN (block
);
1582 for (t
= current_binding_level
->blocks
; t
;)
1584 if (TREE_CHAIN (t
) == block
)
1585 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1589 TREE_CHAIN (block
) = NULL_TREE
;
1590 /* Clear TREE_USED which is always set by poplevel.
1591 The flag is set again if insert_block is called. */
1592 TREE_USED (block
) = 0;
1595 /* Insert BLOCK at the end of the list of subblocks of the
1596 current binding level. This is used when a BIND_EXPR is expanded,
1597 to handle the BLOCK node inside the BIND_EXPR. */
1600 insert_block (block
)
1603 TREE_USED (block
) = 1;
1604 current_binding_level
->blocks
1605 = chainon (current_binding_level
->blocks
, block
);
1608 /* Set the BLOCK node for the innermost scope
1609 (the one we are currently in). */
1613 tree block ATTRIBUTE_UNUSED
;
1615 /* The RTL expansion machinery requires us to provide this callback,
1616 but it is not applicable in function-at-a-time mode. */
1617 my_friendly_assert (cfun
&& !doing_semantic_analysis_p (), 20000911);
1620 /* Do a pushlevel for class declarations. */
1625 register struct binding_level
*newlevel
;
1627 /* Reuse or create a struct for this binding level. */
1628 #if defined(DEBUG_CP_BINDING_LEVELS)
1630 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1631 if (free_binding_level
)
1632 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1634 newlevel
= free_binding_level
;
1635 free_binding_level
= free_binding_level
->level_chain
;
1638 newlevel
= make_binding_level ();
1640 #if defined(DEBUG_CP_BINDING_LEVELS)
1642 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1644 push_binding_level (newlevel
, 0, 0);
1646 class_binding_level
= current_binding_level
;
1647 class_binding_level
->parm_flag
= 2;
1648 class_binding_level
->this_class
= current_class_type
;
1651 /* ...and a poplevel for class declarations. */
1656 register struct binding_level
*level
= class_binding_level
;
1659 my_friendly_assert (level
!= 0, 354);
1661 /* If we're leaving a toplevel class, don't bother to do the setting
1662 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1663 shouldn't even be used when current_class_type isn't set, and second,
1664 if we don't touch it here, we're able to use the cache effect if the
1665 next time we're entering a class scope, it is the same class. */
1666 if (current_class_depth
!= 1)
1668 struct binding_level
* b
;
1670 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1671 for (shadowed
= level
->class_shadowed
;
1673 shadowed
= TREE_CHAIN (shadowed
))
1674 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = NULL_TREE
;
1676 /* Find the next enclosing class, and recreate
1677 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1678 b
= level
->level_chain
;
1679 while (b
&& b
->parm_flag
!= 2)
1683 for (shadowed
= b
->class_shadowed
;
1685 shadowed
= TREE_CHAIN (shadowed
))
1689 t
= IDENTIFIER_BINDING (TREE_PURPOSE (shadowed
));
1690 while (t
&& BINDING_LEVEL (t
) != b
)
1694 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
))
1695 = BINDING_VALUE (t
);
1699 /* Remember to save what IDENTIFIER's were bound in this scope so we
1700 can recover from cache misses. */
1702 previous_class_type
= current_class_type
;
1703 previous_class_values
= class_binding_level
->class_shadowed
;
1705 for (shadowed
= level
->type_shadowed
;
1707 shadowed
= TREE_CHAIN (shadowed
))
1708 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1710 /* Remove the bindings for all of the class-level declarations. */
1711 for (shadowed
= level
->class_shadowed
;
1713 shadowed
= TREE_CHAIN (shadowed
))
1714 pop_binding (TREE_PURPOSE (shadowed
), TREE_TYPE (shadowed
));
1716 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1717 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1718 class_binding_level
->parm_flag
,
1719 class_binding_level
->keep
);
1721 /* Now, pop out of the binding level which we created up in the
1722 `pushlevel_class' routine. */
1723 #if defined(DEBUG_CP_BINDING_LEVELS)
1725 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1727 pop_binding_level ();
1730 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1731 for any names in enclosing classes. */
1734 clear_identifier_class_values ()
1738 if (!class_binding_level
)
1741 for (t
= class_binding_level
->class_shadowed
;
1744 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
1747 /* Returns non-zero if T is a virtual function table. */
1750 vtable_decl_p (t
, data
)
1752 void *data ATTRIBUTE_UNUSED
;
1754 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
1757 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1761 vtype_decl_p (t
, data
)
1763 void *data ATTRIBUTE_UNUSED
;
1765 return (TREE_CODE (t
) == TYPE_DECL
1766 && TREE_CODE (TREE_TYPE (t
)) == RECORD_TYPE
1767 && TYPE_POLYMORPHIC_P (TREE_TYPE (t
)));
1770 /* Return the declarations that are members of the namespace NS. */
1773 cp_namespace_decls (ns
)
1776 return NAMESPACE_LEVEL (ns
)->names
;
1779 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1780 itself, calling F for each. The DATA is passed to F as well. */
1783 walk_namespaces_r (namespace, f
, data
)
1785 walk_namespaces_fn f
;
1791 result
|= (*f
) (namespace, data
);
1793 for (current
= cp_namespace_decls (namespace);
1795 current
= TREE_CHAIN (current
))
1797 if (TREE_CODE (current
) != NAMESPACE_DECL
1798 || DECL_NAMESPACE_ALIAS (current
))
1800 if (!DECL_LANG_SPECIFIC (current
))
1803 my_friendly_assert (current
== fake_std_node
, 393);
1807 /* We found a namespace. */
1808 result
|= walk_namespaces_r (current
, f
, data
);
1814 /* Walk all the namespaces, calling F for each. The DATA is passed to
1818 walk_namespaces (f
, data
)
1819 walk_namespaces_fn f
;
1822 return walk_namespaces_r (global_namespace
, f
, data
);
1825 struct walk_globals_data
{
1826 walk_globals_pred p
;
1831 /* Walk the global declarations in NAMESPACE. Whenever one is found
1832 for which P returns non-zero, call F with its address. If any call
1833 to F returns a non-zero value, return a non-zero value. */
1836 walk_globals_r (namespace, data
)
1840 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1841 walk_globals_pred p
= wgd
->p
;
1842 walk_globals_fn f
= wgd
->f
;
1843 void *d
= wgd
->data
;
1847 t
= &NAMESPACE_LEVEL (namespace)->names
;
1854 result
|= (*f
) (t
, d
);
1856 /* If F changed *T, then *T still points at the next item to
1859 t
= &TREE_CHAIN (*t
);
1865 /* Walk the global declarations. Whenever one is found for which P
1866 returns non-zero, call F with its address. If any call to F
1867 returns a non-zero value, return a non-zero value. */
1870 walk_globals (p
, f
, data
)
1871 walk_globals_pred p
;
1875 struct walk_globals_data wgd
;
1880 return walk_namespaces (walk_globals_r
, &wgd
);
1883 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1884 DATA is non-NULL, this is the last time we will call
1885 wrapup_global_declarations for this NAMESPACE. */
1888 wrapup_globals_for_namespace (namespace, data
)
1892 tree globals
= cp_namespace_decls (namespace);
1893 int len
= list_length (globals
);
1894 tree
*vec
= (tree
*) alloca (sizeof (tree
) * len
);
1898 int last_time
= (data
!= 0);
1900 if (last_time
&& namespace == global_namespace
)
1901 /* Let compile_file handle the global namespace. */
1904 /* Process the decls in reverse order--earliest first.
1905 Put them into VEC from back to front, then take out from front. */
1906 for (i
= 0, decl
= globals
; i
< len
; i
++, decl
= TREE_CHAIN (decl
))
1907 vec
[len
- i
- 1] = decl
;
1911 check_global_declarations (vec
, len
);
1915 /* Temporarily mark vtables as external. That prevents
1916 wrapup_global_declarations from writing them out; we must process
1917 them ourselves in finish_vtable_vardecl. */
1918 for (i
= 0; i
< len
; ++i
)
1919 if (vtable_decl_p (vec
[i
], /*data=*/0) && !DECL_EXTERNAL (vec
[i
]))
1921 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 1;
1922 DECL_EXTERNAL (vec
[i
]) = 1;
1925 /* Write out any globals that need to be output. */
1926 result
= wrapup_global_declarations (vec
, len
);
1928 /* Undo the hack to DECL_EXTERNAL above. */
1929 for (i
= 0; i
< len
; ++i
)
1930 if (vtable_decl_p (vec
[i
], /*data=*/0)
1931 && DECL_NOT_REALLY_EXTERN (vec
[i
]))
1933 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 0;
1934 DECL_EXTERNAL (vec
[i
]) = 0;
1941 /* Mark ARG (which is really a struct binding_level **) for GC. */
1944 mark_binding_level (arg
)
1947 struct binding_level
*lvl
= *(struct binding_level
**)arg
;
1949 for (; lvl
; lvl
= lvl
->level_chain
)
1951 ggc_mark_tree (lvl
->names
);
1952 ggc_mark_tree (lvl
->tags
);
1953 ggc_mark_tree (lvl
->usings
);
1954 ggc_mark_tree (lvl
->using_directives
);
1955 ggc_mark_tree (lvl
->class_shadowed
);
1956 ggc_mark_tree (lvl
->type_shadowed
);
1957 ggc_mark_tree (lvl
->shadowed_labels
);
1958 ggc_mark_tree (lvl
->blocks
);
1959 ggc_mark_tree (lvl
->this_class
);
1960 ggc_mark_tree (lvl
->incomplete
);
1961 ggc_mark_tree (lvl
->dead_vars_from_for
);
1966 mark_named_label_lists (labs
, uses
)
1970 struct named_label_list
*l
= *(struct named_label_list
**)labs
;
1971 struct named_label_use_list
*u
= *(struct named_label_use_list
**)uses
;
1973 for (; l
; l
= l
->next
)
1976 mark_binding_level (l
->binding_level
);
1977 ggc_mark_tree (l
->old_value
);
1978 ggc_mark_tree (l
->label_decl
);
1979 ggc_mark_tree (l
->bad_decls
);
1982 for (; u
; u
= u
->next
)
1986 /* For debugging. */
1987 static int no_print_functions
= 0;
1988 static int no_print_builtins
= 0;
1991 print_binding_level (lvl
)
1992 struct binding_level
*lvl
;
1996 fprintf (stderr
, " blocks=");
1997 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
1998 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
1999 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
2000 if (lvl
->tag_transparent
)
2001 fprintf (stderr
, " tag-transparent");
2002 if (lvl
->more_cleanups_ok
)
2003 fprintf (stderr
, " more-cleanups-ok");
2004 if (lvl
->have_cleanups
)
2005 fprintf (stderr
, " have-cleanups");
2006 fprintf (stderr
, "\n");
2009 fprintf (stderr
, " names:\t");
2010 /* We can probably fit 3 names to a line? */
2011 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
2013 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
2015 if (no_print_builtins
2016 && (TREE_CODE (t
) == TYPE_DECL
)
2017 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
2020 /* Function decls tend to have longer names. */
2021 if (TREE_CODE (t
) == FUNCTION_DECL
)
2028 fprintf (stderr
, "\n\t");
2031 print_node_brief (stderr
, "", t
, 0);
2032 if (t
== error_mark_node
)
2036 fprintf (stderr
, "\n");
2040 fprintf (stderr
, " tags:\t");
2042 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
2044 if (TREE_PURPOSE (t
) == NULL_TREE
)
2046 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2053 fprintf (stderr
, "\n\t");
2056 if (TREE_PURPOSE (t
) == NULL_TREE
)
2058 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
2059 fprintf (stderr
, ">");
2061 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2062 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2065 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
2066 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2067 fprintf (stderr
, ">");
2071 fprintf (stderr
, "\n");
2073 if (lvl
->class_shadowed
)
2075 fprintf (stderr
, " class-shadowed:");
2076 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
2078 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2080 fprintf (stderr
, "\n");
2082 if (lvl
->type_shadowed
)
2084 fprintf (stderr
, " type-shadowed:");
2085 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2087 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2089 fprintf (stderr
, "\n");
2094 print_other_binding_stack (stack
)
2095 struct binding_level
*stack
;
2097 struct binding_level
*level
;
2098 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
2100 fprintf (stderr
, "binding level ");
2101 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
2102 fprintf (stderr
, "\n");
2103 print_binding_level (level
);
2108 print_binding_stack ()
2110 struct binding_level
*b
;
2111 fprintf (stderr
, "current_binding_level=");
2112 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
2113 fprintf (stderr
, "\nclass_binding_level=");
2114 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
2115 fprintf (stderr
, "\nglobal_binding_level=");
2116 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
2117 fprintf (stderr
, "\n");
2118 if (class_binding_level
)
2120 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
2121 if (b
== current_binding_level
)
2124 b
= class_binding_level
;
2126 b
= current_binding_level
;
2129 b
= current_binding_level
;
2130 print_other_binding_stack (b
);
2131 fprintf (stderr
, "global:\n");
2132 print_binding_level (global_binding_level
);
2135 /* Namespace binding access routines: The namespace_bindings field of
2136 the identifier is polymorphic, with three possible values:
2137 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2138 indicating the BINDING_VALUE of global_namespace. */
2140 /* Check whether the a binding for the name to scope is known.
2141 Assumes that the bindings of the name are already a list
2142 of bindings. Returns the binding found, or NULL_TREE. */
2145 find_binding (name
, scope
)
2149 tree iter
, prev
= NULL_TREE
;
2151 scope
= ORIGINAL_NAMESPACE (scope
);
2153 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
2154 iter
= TREE_CHAIN (iter
))
2156 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
2157 if (BINDING_SCOPE (iter
) == scope
)
2159 /* Move binding found to the front of the list, so
2160 subsequent lookups will find it faster. */
2163 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
2164 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
2165 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
2174 /* Always returns a binding for name in scope. If the
2175 namespace_bindings is not a list, convert it to one first.
2176 If no binding is found, make a new one. */
2179 binding_for_name (name
, scope
)
2183 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2186 scope
= ORIGINAL_NAMESPACE (scope
);
2188 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
2190 /* Get rid of optimization for global scope. */
2191 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
2192 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
2193 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2195 if (b
&& (result
= find_binding (name
, scope
)))
2197 /* Not found, make a new one. */
2198 result
= make_node (CPLUS_BINDING
);
2199 TREE_CHAIN (result
) = b
;
2200 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2201 BINDING_SCOPE (result
) = scope
;
2202 BINDING_TYPE (result
) = NULL_TREE
;
2203 BINDING_VALUE (result
) = NULL_TREE
;
2207 /* Return the binding value for name in scope, considering that
2208 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2211 namespace_binding (name
, scope
)
2215 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2218 if (scope
== NULL_TREE
)
2219 scope
= global_namespace
;
2220 if (TREE_CODE (b
) != CPLUS_BINDING
)
2221 return (scope
== global_namespace
) ? b
: NULL_TREE
;
2222 name
= find_binding (name
,scope
);
2223 if (name
== NULL_TREE
)
2225 return BINDING_VALUE (name
);
2228 /* Set the binding value for name in scope. If modifying the binding
2229 of global_namespace is attempted, try to optimize it. */
2232 set_namespace_binding (name
, scope
, val
)
2239 if (scope
== NULL_TREE
)
2240 scope
= global_namespace
;
2242 if (scope
== global_namespace
)
2244 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2245 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
2247 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
2251 b
= binding_for_name (name
, scope
);
2252 BINDING_VALUE (b
) = val
;
2255 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2256 select a name that is unique to this compilation unit. */
2259 push_namespace (name
)
2264 int implicit_use
= 0;
2266 if (!global_namespace
)
2268 /* This must be ::. */
2269 my_friendly_assert (name
== get_identifier ("::"), 377);
2274 /* The name of anonymous namespace is unique for the translation
2276 if (!anonymous_namespace_name
)
2277 anonymous_namespace_name
= get_file_function_name ('N');
2278 name
= anonymous_namespace_name
;
2279 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2281 /* Reopening anonymous namespace. */
2285 else if (current_namespace
== global_namespace
2287 && name
== std_identifier
)
2294 /* Check whether this is an extended namespace definition. */
2295 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2296 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
2299 if (DECL_NAMESPACE_ALIAS (d
))
2301 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2302 d
, DECL_NAMESPACE_ALIAS (d
));
2303 d
= DECL_NAMESPACE_ALIAS (d
);
2310 /* Make a new namespace, binding the name to it. */
2311 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
2312 /* The global namespace is not pushed, and the global binding
2313 level is set elsewhere. */
2316 DECL_CONTEXT (d
) = FROB_CONTEXT (current_namespace
);
2319 declare_namespace_level ();
2320 NAMESPACE_LEVEL (d
) = current_binding_level
;
2324 resume_binding_level (NAMESPACE_LEVEL (d
));
2327 do_using_directive (d
);
2328 /* Enter the name space. */
2329 current_namespace
= d
;
2332 /* Pop from the scope of the current namespace. */
2337 if (current_namespace
== global_namespace
)
2339 my_friendly_assert (in_fake_std
> 0, 980421);
2343 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
2344 /* The binding level is not popped, as it might be re-opened later. */
2345 suspend_binding_level ();
2348 /* Push into the scope of the namespace NS, even if it is deeply
2349 nested within another namespace. */
2352 push_nested_namespace (ns
)
2355 if (ns
== global_namespace
)
2356 push_to_top_level ();
2359 push_nested_namespace (CP_DECL_CONTEXT (ns
));
2360 push_namespace (DECL_NAME (ns
));
2364 /* Pop back from the scope of the namespace NS, which was previously
2365 entered with push_nested_namespace. */
2368 pop_nested_namespace (ns
)
2371 while (ns
!= global_namespace
)
2374 ns
= CP_DECL_CONTEXT (ns
);
2377 pop_from_top_level ();
2381 /* Subroutines for reverting temporarily to top-level for instantiation
2382 of templates and such. We actually need to clear out the class- and
2383 local-value slots of all identifiers, so that only the global values
2384 are at all visible. Simply setting current_binding_level to the global
2385 scope isn't enough, because more binding levels may be pushed. */
2386 struct saved_scope
*scope_chain
;
2388 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2391 mark_saved_scope (arg
)
2394 struct saved_scope
*t
= *(struct saved_scope
**)arg
;
2397 mark_binding_level (&t
->class_bindings
);
2398 ggc_mark_tree (t
->old_bindings
);
2399 ggc_mark_tree (t
->old_namespace
);
2400 ggc_mark_tree (t
->class_name
);
2401 ggc_mark_tree (t
->class_type
);
2402 ggc_mark_tree (t
->access_specifier
);
2403 ggc_mark_tree (t
->function_decl
);
2405 ggc_mark_tree_varray (t
->lang_base
);
2406 ggc_mark_tree (t
->lang_name
);
2407 ggc_mark_tree (t
->template_parms
);
2408 ggc_mark_tree (t
->x_previous_class_type
);
2409 ggc_mark_tree (t
->x_previous_class_values
);
2410 ggc_mark_tree (t
->x_saved_tree
);
2411 ggc_mark_tree (t
->incomplete
);
2412 ggc_mark_tree (t
->lookups
);
2414 mark_stmt_tree (&t
->x_stmt_tree
);
2415 mark_binding_level (&t
->bindings
);
2421 store_bindings (names
, old_bindings
)
2422 tree names
, old_bindings
;
2425 tree search_bindings
= old_bindings
;
2427 for (t
= names
; t
; t
= TREE_CHAIN (t
))
2429 tree binding
, t1
, id
;
2431 if (TREE_CODE (t
) == TREE_LIST
)
2432 id
= TREE_PURPOSE (t
);
2437 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2438 we have no IDENTIFIER_BINDING if we have left the class
2439 scope, but cached the class-level declarations. */
2440 || !(IDENTIFIER_BINDING (id
) || IDENTIFIER_CLASS_VALUE (id
)))
2443 for (t1
= search_bindings
; t1
; t1
= TREE_CHAIN (t1
))
2444 if (TREE_VEC_ELT (t1
, 0) == id
)
2447 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
2448 binding
= make_tree_vec (4);
2449 TREE_VEC_ELT (binding
, 0) = id
;
2450 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
2451 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_BINDING (id
);
2452 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
2453 IDENTIFIER_BINDING (id
) = NULL_TREE
;
2454 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
2455 TREE_CHAIN (binding
) = old_bindings
;
2456 old_bindings
= binding
;
2460 return old_bindings
;
2464 maybe_push_to_top_level (pseudo
)
2467 struct saved_scope
*s
;
2468 struct binding_level
*b
;
2472 s
= (struct saved_scope
*) xcalloc (1, sizeof (struct saved_scope
));
2474 b
= scope_chain
? current_binding_level
: 0;
2476 /* If we're in the middle of some function, save our state. */
2480 push_function_context_to (NULL_TREE
);
2485 old_bindings
= NULL_TREE
;
2486 if (scope_chain
&& previous_class_type
)
2487 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
2489 /* Have to include global_binding_level, because class-level decls
2490 aren't listed anywhere useful. */
2491 for (; b
; b
= b
->level_chain
)
2495 /* Template IDs are inserted into the global level. If they were
2496 inserted into namespace level, finish_file wouldn't find them
2497 when doing pending instantiations. Therefore, don't stop at
2498 namespace level, but continue until :: . */
2499 if (b
== global_binding_level
|| (pseudo
&& b
->template_parms_p
))
2502 old_bindings
= store_bindings (b
->names
, old_bindings
);
2503 /* We also need to check class_shadowed to save class-level type
2504 bindings, since pushclass doesn't fill in b->names. */
2505 if (b
->parm_flag
== 2)
2506 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2508 /* Unwind type-value slots back to top level. */
2509 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2510 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2512 s
->prev
= scope_chain
;
2513 s
->old_bindings
= old_bindings
;
2515 s
->need_pop_function_context
= need_pop
;
2516 s
->function_decl
= current_function_decl
;
2519 current_function_decl
= NULL_TREE
;
2520 VARRAY_TREE_INIT (current_lang_base
, 10, "current_lang_base");
2521 current_lang_stack
= &VARRAY_TREE (current_lang_base
, 0);
2522 current_lang_name
= lang_name_cplusplus
;
2523 current_namespace
= global_namespace
;
2527 push_to_top_level ()
2529 maybe_push_to_top_level (0);
2533 pop_from_top_level ()
2535 struct saved_scope
*s
= scope_chain
;
2538 /* Clear out class-level bindings cache. */
2539 if (previous_class_type
)
2540 invalidate_class_lookup_cache ();
2542 VARRAY_FREE (current_lang_base
);
2544 scope_chain
= s
->prev
;
2545 for (t
= s
->old_bindings
; t
; t
= TREE_CHAIN (t
))
2547 tree id
= TREE_VEC_ELT (t
, 0);
2549 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2550 IDENTIFIER_BINDING (id
) = TREE_VEC_ELT (t
, 2);
2551 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2554 /* If we were in the middle of compiling a function, restore our
2556 if (s
->need_pop_function_context
)
2557 pop_function_context_from (NULL_TREE
);
2558 current_function_decl
= s
->function_decl
;
2563 /* Push a definition of struct, union or enum tag "name".
2564 into binding_level "b". "type" should be the type node,
2565 We assume that the tag "name" is not already defined.
2567 Note that the definition may really be just a forward reference.
2568 In that case, the TYPE_SIZE will be a NULL_TREE.
2570 C++ gratuitously puts all these tags in the name space. */
2572 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2573 record the shadowed value for this binding contour. TYPE is
2574 the type that ID maps to. */
2577 set_identifier_type_value_with_scope (id
, type
, b
)
2580 struct binding_level
*b
;
2582 if (!b
->namespace_p
)
2584 /* Shadow the marker, not the real thing, so that the marker
2585 gets restored later. */
2586 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2588 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2592 tree binding
= binding_for_name (id
, current_namespace
);
2593 BINDING_TYPE (binding
) = type
;
2594 /* Store marker instead of real type. */
2595 type
= global_type_node
;
2597 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2600 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2603 set_identifier_type_value (id
, type
)
2607 set_identifier_type_value_with_scope (id
, type
, current_binding_level
);
2610 /* Return the type associated with id. */
2613 identifier_type_value (id
)
2616 /* There is no type with that name, anywhere. */
2617 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2619 /* This is not the type marker, but the real thing. */
2620 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2621 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2622 /* Have to search for it. It must be on the global level, now.
2623 Ask lookup_name not to return non-types. */
2624 id
= lookup_name_real (id
, 2, 1, 0);
2626 return TREE_TYPE (id
);
2630 /* Pop off extraneous binding levels left over due to syntax errors.
2632 We don't pop past namespaces, as they might be valid. */
2637 #ifdef DEBUG_CP_BINDING_LEVELS
2638 fprintf (stderr
, "XXX entering pop_everything ()\n");
2640 while (!toplevel_bindings_p ())
2642 if (current_binding_level
->parm_flag
== 2)
2643 pop_nested_class ();
2647 #ifdef DEBUG_CP_BINDING_LEVELS
2648 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2652 /* The type TYPE is being declared. If it is a class template, or a
2653 specialization of a class template, do any processing required and
2654 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2655 being declared a friend. B is the binding level at which this TYPE
2658 Returns the TYPE_DECL for TYPE, which may have been altered by this
2662 maybe_process_template_type_declaration (type
, globalize
, b
)
2665 struct binding_level
* b
;
2667 tree decl
= TYPE_NAME (type
);
2669 if (processing_template_parmlist
)
2670 /* You can't declare a new template type in a template parameter
2671 list. But, you can declare a non-template type:
2673 template <class A*> struct S;
2675 is a forward-declaration of `A'. */
2679 maybe_check_template_type (type
);
2681 my_friendly_assert (IS_AGGR_TYPE (type
)
2682 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2685 if (processing_template_decl
)
2687 /* This may change after the call to
2688 push_template_decl_real, but we want the original value. */
2689 tree name
= DECL_NAME (decl
);
2691 decl
= push_template_decl_real (decl
, globalize
);
2692 /* If the current binding level is the binding level for the
2693 template parameters (see the comment in
2694 begin_template_parm_list) and the enclosing level is a class
2695 scope, and we're not looking at a friend, push the
2696 declaration of the member class into the class scope. In the
2697 friend case, push_template_decl will already have put the
2698 friend into global scope, if appropriate. */
2699 if (TREE_CODE (type
) != ENUMERAL_TYPE
2700 && !globalize
&& b
->template_parms_p
2701 && b
->level_chain
->parm_flag
== 2)
2703 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2704 /* Put this tag on the list of tags for the class, since
2705 that won't happen below because B is not the class
2706 binding level, but is instead the pseudo-global level. */
2707 b
->level_chain
->tags
=
2708 tree_cons (name
, type
, b
->level_chain
->tags
);
2709 if (!COMPLETE_TYPE_P (current_class_type
))
2710 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2718 /* In C++, you don't have to write `struct S' to refer to `S'; you
2719 can just use `S'. We accomplish this by creating a TYPE_DECL as
2720 if the user had written `typedef struct S S'. Create and return
2721 the TYPE_DECL for TYPE. */
2724 create_implicit_typedef (name
, type
)
2730 decl
= build_decl (TYPE_DECL
, name
, type
);
2731 DECL_ARTIFICIAL (decl
) = 1;
2732 /* There are other implicit type declarations, like the one *within*
2733 a class that allows you to write `S::S'. We must distinguish
2735 SET_DECL_IMPLICIT_TYPEDEF_P (decl
);
2736 TYPE_NAME (type
) = decl
;
2741 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2742 Normally put it into the inner-most non-tag-transparent scope,
2743 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2744 The latter is needed for implicit declarations. */
2747 pushtag (name
, type
, globalize
)
2751 register struct binding_level
*b
;
2753 b
= current_binding_level
;
2754 while (b
->tag_transparent
2755 || (globalize
&& b
->parm_flag
== 2))
2758 b
->tags
= tree_cons (name
, type
, b
->tags
);
2762 /* Do C++ gratuitous typedefing. */
2763 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2765 register tree d
= NULL_TREE
;
2767 tree context
= TYPE_CONTEXT (type
);
2771 tree cs
= current_scope ();
2775 else if (cs
!= NULL_TREE
&& TYPE_P (cs
))
2776 /* When declaring a friend class of a local class, we want
2777 to inject the newly named class into the scope
2778 containing the local class, not the namespace scope. */
2779 context
= decl_function_context (get_type_decl (cs
));
2782 context
= current_namespace
;
2784 if ((b
->template_parms_p
&& b
->level_chain
->parm_flag
== 2)
2785 || b
->parm_flag
== 2)
2788 if (current_lang_name
== lang_name_java
)
2789 TYPE_FOR_JAVA (type
) = 1;
2791 d
= create_implicit_typedef (name
, type
);
2792 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2794 set_identifier_type_value_with_scope (name
, type
, b
);
2796 d
= maybe_process_template_type_declaration (type
,
2799 if (b
->parm_flag
== 2)
2801 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2802 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2803 class. But if it's a member template class, we
2804 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2806 finish_member_declaration (d
);
2808 pushdecl_class_level (d
);
2811 d
= pushdecl_with_scope (d
, b
);
2813 if (ANON_AGGRNAME_P (name
))
2814 DECL_IGNORED_P (d
) = 1;
2816 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2817 DECL_ASSEMBLER_NAME (d
) = DECL_NAME (d
);
2819 /* If this is a local class, keep track of it. We need this
2820 information for name-mangling, and so that it is possible to find
2821 all function definitions in a translation unit in a convenient
2822 way. (It's otherwise tricky to find a member function definition
2823 it's only pointed to from within a local class.) */
2824 if (TYPE_CONTEXT (type
)
2825 && TREE_CODE (TYPE_CONTEXT (type
)) == FUNCTION_DECL
2826 && !processing_template_decl
)
2827 VARRAY_PUSH_TREE (local_classes
, type
);
2829 if (!uses_template_parms (type
))
2832 DECL_ASSEMBLER_NAME (d
) = mangle_type (type
);
2834 DECL_ASSEMBLER_NAME (d
)
2835 = get_identifier (build_overload_name (type
, 1, 1));
2838 if (b
->parm_flag
== 2)
2840 if (!COMPLETE_TYPE_P (current_class_type
))
2841 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2845 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2846 /* Use the canonical TYPE_DECL for this node. */
2847 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2850 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2851 will be the tagged type we just added to the current
2852 binding level. This fake NULL-named TYPE_DECL node helps
2853 dwarfout.c to know when it needs to output a
2854 representation of a tagged type, and it also gives us a
2855 convenient place to record the "scope start" address for
2858 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2859 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2863 /* Counter used to create anonymous type names. */
2865 static int anon_cnt
= 0;
2867 /* Return an IDENTIFIER which can be used as a name for
2868 anonymous structs and unions. */
2875 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2876 return get_identifier (buf
);
2879 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2880 This keeps dbxout from getting confused. */
2885 register struct binding_level
*b
;
2887 static int last_cnt
= 0;
2889 /* Fast out if no new anon names were declared. */
2890 if (last_cnt
== anon_cnt
)
2893 b
= current_binding_level
;
2894 while (b
->tag_transparent
)
2899 /* A NULL purpose means we have already processed all tags
2900 from here to the end of the list. */
2901 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2903 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2904 TREE_PURPOSE (tags
) = NULL_TREE
;
2905 tags
= TREE_CHAIN (tags
);
2907 last_cnt
= anon_cnt
;
2910 /* Subroutine of duplicate_decls: return truthvalue of whether
2911 or not types of these decls match.
2913 For C++, we must compare the parameter list so that `int' can match
2914 `int&' in a parameter position, but `int&' is not confused with
2918 decls_match (newdecl
, olddecl
)
2919 tree newdecl
, olddecl
;
2923 if (newdecl
== olddecl
)
2926 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
2927 /* If the two DECLs are not even the same kind of thing, we're not
2928 interested in their types. */
2931 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2933 tree f1
= TREE_TYPE (newdecl
);
2934 tree f2
= TREE_TYPE (olddecl
);
2935 tree p1
= TYPE_ARG_TYPES (f1
);
2936 tree p2
= TYPE_ARG_TYPES (f2
);
2938 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
)
2939 && ! (DECL_EXTERN_C_P (newdecl
)
2940 && DECL_EXTERN_C_P (olddecl
)))
2943 if (TREE_CODE (f1
) != TREE_CODE (f2
))
2946 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
2948 if (p2
== NULL_TREE
&& DECL_EXTERN_C_P (olddecl
)
2949 && (DECL_BUILT_IN (olddecl
)
2950 #ifndef NO_IMPLICIT_EXTERN_C
2951 || (DECL_IN_SYSTEM_HEADER (newdecl
) && !DECL_CLASS_SCOPE_P (newdecl
))
2952 || (DECL_IN_SYSTEM_HEADER (olddecl
) && !DECL_CLASS_SCOPE_P (olddecl
))
2956 types_match
= self_promoting_args_p (p1
);
2957 if (p1
== void_list_node
)
2958 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2960 #ifndef NO_IMPLICIT_EXTERN_C
2961 else if (p1
== NULL_TREE
2962 && (DECL_EXTERN_C_P (olddecl
)
2963 && DECL_IN_SYSTEM_HEADER (olddecl
)
2964 && !DECL_CLASS_SCOPE_P (olddecl
))
2965 && (DECL_EXTERN_C_P (newdecl
)
2966 && DECL_IN_SYSTEM_HEADER (newdecl
)
2967 && !DECL_CLASS_SCOPE_P (newdecl
)))
2969 types_match
= self_promoting_args_p (p2
);
2970 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2974 types_match
= compparms (p1
, p2
);
2979 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2981 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
2982 DECL_TEMPLATE_PARMS (olddecl
)))
2985 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
))
2986 != TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)))
2989 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
2992 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
2993 DECL_TEMPLATE_RESULT (newdecl
));
2997 if (TREE_TYPE (newdecl
) == error_mark_node
)
2998 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
2999 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
3000 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
3001 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
3004 types_match
= comptypes (TREE_TYPE (newdecl
),
3005 TREE_TYPE (olddecl
),
3006 COMPARE_REDECLARATION
);
3012 /* If NEWDECL is `static' and an `extern' was seen previously,
3013 warn about it. OLDDECL is the previous declaration.
3015 Note that this does not apply to the C++ case of declaring
3016 a variable `extern const' and then later `const'.
3018 Don't complain about built-in functions, since they are beyond
3019 the user's control. */
3022 warn_extern_redeclared_static (newdecl
, olddecl
)
3023 tree newdecl
, olddecl
;
3025 static const char *explicit_extern_static_warning
3026 = "`%D' was declared `extern' and later `static'";
3027 static const char *implicit_extern_static_warning
3028 = "`%D' was declared implicitly `extern' and later `static'";
3032 if (TREE_CODE (newdecl
) == TYPE_DECL
3033 || TREE_CODE (newdecl
) == TEMPLATE_DECL
3034 || TREE_CODE (newdecl
) == CONST_DECL
)
3037 /* Don't get confused by static member functions; that's a different
3039 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3040 && DECL_STATIC_FUNCTION_P (newdecl
))
3043 /* If the old declaration was `static', or the new one isn't, then
3044 then everything is OK. */
3045 if (DECL_THIS_STATIC (olddecl
) || !DECL_THIS_STATIC (newdecl
))
3048 /* It's OK to declare a builtin function as `static'. */
3049 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3050 && DECL_ARTIFICIAL (olddecl
))
3053 name
= DECL_ASSEMBLER_NAME (newdecl
);
3054 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
3055 ? implicit_extern_static_warning
3056 : explicit_extern_static_warning
, newdecl
);
3057 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
3060 /* Handle when a new declaration NEWDECL has the same name as an old
3061 one OLDDECL in the same binding contour. Prints an error message
3064 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
3065 Otherwise, return 0. */
3068 duplicate_decls (newdecl
, olddecl
)
3069 tree newdecl
, olddecl
;
3071 unsigned olddecl_uid
= DECL_UID (olddecl
);
3072 int olddecl_friend
= 0, types_match
= 0;
3073 int new_defines_function
= 0;
3075 if (newdecl
== olddecl
)
3078 types_match
= decls_match (newdecl
, olddecl
);
3080 /* If either the type of the new decl or the type of the old decl is an
3081 error_mark_node, then that implies that we have already issued an
3082 error (earlier) for some bogus type specification, and in that case,
3083 it is rather pointless to harass the user with yet more error message
3084 about the same declaration, so just pretend the types match here. */
3085 if (TREE_TYPE (newdecl
) == error_mark_node
3086 || TREE_TYPE (olddecl
) == error_mark_node
)
3089 /* Check for redeclaration and other discrepancies. */
3090 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3091 && DECL_ARTIFICIAL (olddecl
))
3093 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
3095 /* If you declare a built-in or predefined function name as static,
3096 the old definition is overridden, but optionally warn this was a
3097 bad choice of name. */
3098 if (! TREE_PUBLIC (newdecl
))
3101 cp_warning ("shadowing %s function `%#D'",
3102 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3104 /* Discard the old built-in function. */
3107 /* If the built-in is not ansi, then programs can override
3108 it even globally without an error. */
3109 else if (! DECL_BUILT_IN (olddecl
))
3110 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
3114 cp_error ("declaration of `%#D'", newdecl
);
3115 cp_error ("conflicts with built-in declaration `%#D'",
3120 else if (!types_match
)
3122 if ((DECL_EXTERN_C_P (newdecl
)
3123 && DECL_EXTERN_C_P (olddecl
))
3124 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3125 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3127 /* A near match; override the builtin. */
3129 if (TREE_PUBLIC (newdecl
))
3131 cp_warning ("new declaration `%#D'", newdecl
);
3132 cp_warning ("ambiguates built-in declaration `%#D'",
3135 else if (warn_shadow
)
3136 cp_warning ("shadowing %s function `%#D'",
3137 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3141 /* Discard the old built-in function. */
3145 if (DECL_THIS_STATIC (newdecl
) && !DECL_THIS_STATIC (olddecl
))
3147 /* If a builtin function is redeclared as `static', merge
3148 the declarations, but make the original one static. */
3149 DECL_THIS_STATIC (olddecl
) = 1;
3150 TREE_PUBLIC (olddecl
) = 0;
3152 /* Make the old declaration consistent with the new one so
3153 that all remnants of the builtin-ness of this function
3154 will be banished. */
3155 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3156 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3157 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3158 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (newdecl
),
3162 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3164 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3165 && TREE_CODE (newdecl
) != TYPE_DECL
3166 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3167 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3168 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3169 && TREE_CODE (olddecl
) != TYPE_DECL
3170 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3171 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3174 /* We do nothing special here, because C++ does such nasty
3175 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3176 get shadowed, and know that if we need to find a TYPE_DECL
3177 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3178 slot of the identifier. */
3182 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3183 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3184 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3185 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3188 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
3189 if (TREE_CODE (olddecl
) == TREE_LIST
)
3190 olddecl
= TREE_VALUE (olddecl
);
3191 cp_error_at ("previous declaration of `%#D'", olddecl
);
3193 /* New decl is completely inconsistent with the old one =>
3194 tell caller to replace the old one. */
3198 else if (!types_match
)
3200 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
))
3201 /* These are certainly not duplicate declarations; they're
3202 from different scopes. */
3205 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3207 /* The name of a class template may not be declared to refer to
3208 any other template, class, function, object, namespace, value,
3209 or type in the same scope. */
3210 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3211 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3213 cp_error ("declaration of template `%#D'", newdecl
);
3214 cp_error_at ("conflicts with previous declaration `%#D'",
3217 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3218 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3219 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3220 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3221 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3222 DECL_TEMPLATE_PARMS (olddecl
)))
3224 cp_error ("new declaration `%#D'", newdecl
);
3225 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3229 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3231 if (DECL_EXTERN_C_P (newdecl
) && DECL_EXTERN_C_P (olddecl
))
3233 cp_error ("declaration of C function `%#D' conflicts with",
3235 cp_error_at ("previous declaration `%#D' here", olddecl
);
3237 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3238 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3240 cp_error ("new declaration `%#D'", newdecl
);
3241 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3247 /* Already complained about this, so don't do so again. */
3248 else if (current_class_type
== NULL_TREE
3249 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3251 cp_error ("conflicting types for `%#D'", newdecl
);
3252 cp_error_at ("previous declaration as `%#D'", olddecl
);
3255 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3256 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3257 && (!DECL_TEMPLATE_INFO (newdecl
)
3258 || (DECL_TI_TEMPLATE (newdecl
)
3259 != DECL_TI_TEMPLATE (olddecl
))))
3260 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3261 && (!DECL_TEMPLATE_INFO (olddecl
)
3262 || (DECL_TI_TEMPLATE (olddecl
)
3263 != DECL_TI_TEMPLATE (newdecl
))))))
3264 /* It's OK to have a template specialization and a non-template
3265 with the same type, or to have specializations of two
3266 different templates with the same type. Note that if one is a
3267 specialization, and the other is an instantiation of the same
3268 template, that we do not exit at this point. That situation
3269 can occur if we instantiate a template class, and then
3270 specialize one of its methods. This situation is legal, but
3271 the declarations must be merged in the usual way. */
3273 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3274 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3275 && !DECL_USE_TEMPLATE (newdecl
))
3276 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3277 && !DECL_USE_TEMPLATE (olddecl
))))
3278 /* One of the declarations is a template instantiation, and the
3279 other is not a template at all. That's OK. */
3281 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3282 && DECL_NAMESPACE_ALIAS (newdecl
)
3283 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3284 /* Redeclaration of namespace alias, ignore it. */
3288 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3291 cp_error (errmsg
, newdecl
);
3292 if (DECL_NAME (olddecl
) != NULL_TREE
)
3293 cp_error_at ((DECL_INITIAL (olddecl
)
3294 && namespace_bindings_p ())
3295 ? "`%#D' previously defined here"
3296 : "`%#D' previously declared here", olddecl
);
3298 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3299 && DECL_INITIAL (olddecl
) != NULL_TREE
3300 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3301 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3303 /* Prototype decl follows defn w/o prototype. */
3304 cp_warning_at ("prototype for `%#D'", newdecl
);
3305 cp_warning_at ("follows non-prototype definition here", olddecl
);
3307 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3308 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3310 /* extern "C" int foo ();
3311 int foo () { bar (); }
3313 if (current_lang_stack
3314 == &VARRAY_TREE (current_lang_base
, 0))
3315 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3318 cp_error_at ("previous declaration of `%#D' with %L linkage",
3319 olddecl
, DECL_LANGUAGE (olddecl
));
3320 cp_error ("conflicts with new declaration with %L linkage",
3321 DECL_LANGUAGE (newdecl
));
3325 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3327 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3329 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3330 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3333 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3334 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3336 for (; t1
&& t1
!= void_list_node
;
3337 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3338 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3340 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3345 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3347 cp_pedwarn_at ("after previous specification in `%#D'",
3353 cp_error ("default argument given for parameter %d of `%#D'",
3355 cp_error_at ("after previous specification in `%#D'",
3360 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
3361 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3363 cp_warning ("`%#D' was used before it was declared inline",
3365 cp_warning_at ("previous non-inline declaration here",
3371 /* If new decl is `static' and an `extern' was seen previously,
3373 warn_extern_redeclared_static (newdecl
, olddecl
);
3375 /* We have committed to returning 1 at this point. */
3376 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3378 /* Now that functions must hold information normally held
3379 by field decls, there is extra work to do so that
3380 declaration information does not get destroyed during
3382 if (DECL_VINDEX (olddecl
))
3383 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3384 if (DECL_VIRTUAL_CONTEXT (olddecl
))
3385 DECL_VIRTUAL_CONTEXT (newdecl
) = DECL_VIRTUAL_CONTEXT (olddecl
);
3386 if (DECL_CONTEXT (olddecl
))
3387 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3388 if (DECL_PENDING_INLINE_INFO (newdecl
) == 0)
3389 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3390 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3391 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3392 DECL_PURE_VIRTUAL_P (newdecl
) |= DECL_PURE_VIRTUAL_P (olddecl
);
3393 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3394 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3395 DECL_THIS_STATIC (newdecl
) |= DECL_THIS_STATIC (olddecl
);
3396 DECL_LANG_SPECIFIC (newdecl
)->u2
= DECL_LANG_SPECIFIC (olddecl
)->u2
;
3397 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3399 /* Optionally warn about more than one declaration for the same
3400 name, but don't warn about a function declaration followed by a
3402 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3403 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3404 /* Don't warn about extern decl followed by definition. */
3405 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3406 /* Don't warn about friends, let add_friend take care of it. */
3407 && ! DECL_FRIEND_P (newdecl
))
3409 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3410 cp_warning_at ("previous declaration of `%D'", olddecl
);
3414 /* Deal with C++: must preserve virtual function table size. */
3415 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3417 register tree newtype
= TREE_TYPE (newdecl
);
3418 register tree oldtype
= TREE_TYPE (olddecl
);
3420 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3421 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3423 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3424 CLASSTYPE_FRIEND_CLASSES (newtype
)
3425 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3428 DECL_ORIGINAL_TYPE (newdecl
) = DECL_ORIGINAL_TYPE (olddecl
);
3431 /* Copy all the DECL_... slots specified in the new decl
3432 except for any that we copy here from the old type. */
3433 DECL_MACHINE_ATTRIBUTES (newdecl
)
3434 = merge_machine_decl_attributes (olddecl
, newdecl
);
3436 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3438 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3439 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3440 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3441 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3448 /* Automatically handles default parameters. */
3449 tree oldtype
= TREE_TYPE (olddecl
);
3452 /* Merge the data types specified in the two decls. */
3453 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3455 /* If common_type produces a non-typedef type, just use the old type. */
3456 if (TREE_CODE (newdecl
) == TYPE_DECL
3457 && newtype
== DECL_ORIGINAL_TYPE (newdecl
))
3460 if (TREE_CODE (newdecl
) == VAR_DECL
)
3461 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3462 /* Do this after calling `common_type' so that default
3463 parameters don't confuse us. */
3464 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3465 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3466 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3468 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3469 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3470 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3471 TYPE_RAISES_EXCEPTIONS (oldtype
));
3473 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3474 && DECL_SOURCE_LINE (olddecl
) != 0
3476 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
3477 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
3479 cp_error ("declaration of `%F' throws different exceptions",
3481 cp_error_at ("than previous declaration `%F'", olddecl
);
3484 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3486 /* Lay the type out, unless already done. */
3487 if (! same_type_p (newtype
, oldtype
)
3488 && TREE_TYPE (newdecl
) != error_mark_node
3489 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3490 layout_type (TREE_TYPE (newdecl
));
3492 if ((TREE_CODE (newdecl
) == VAR_DECL
3493 || TREE_CODE (newdecl
) == PARM_DECL
3494 || TREE_CODE (newdecl
) == RESULT_DECL
3495 || TREE_CODE (newdecl
) == FIELD_DECL
3496 || TREE_CODE (newdecl
) == TYPE_DECL
)
3497 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3498 layout_decl (newdecl
, 0);
3500 /* Merge the type qualifiers. */
3501 if (TREE_READONLY (newdecl
))
3502 TREE_READONLY (olddecl
) = 1;
3503 if (TREE_THIS_VOLATILE (newdecl
))
3504 TREE_THIS_VOLATILE (olddecl
) = 1;
3506 /* Merge the initialization information. */
3507 if (DECL_INITIAL (newdecl
) == NULL_TREE
3508 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3510 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3511 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3512 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3513 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
3514 && DECL_LANG_SPECIFIC (newdecl
)
3515 && DECL_LANG_SPECIFIC (olddecl
))
3516 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3519 /* Merge the section attribute.
3520 We want to issue an error if the sections conflict but that must be
3521 done later in decl_attributes since we are called before attributes
3523 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3524 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3526 /* Keep the old rtl since we can safely use it. */
3527 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3529 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3531 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (newdecl
)
3532 |= DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (olddecl
);
3533 DECL_NO_CHECK_MEMORY_USAGE (newdecl
)
3534 |= DECL_NO_CHECK_MEMORY_USAGE (olddecl
);
3535 DECL_NO_LIMIT_STACK (newdecl
)
3536 |= DECL_NO_LIMIT_STACK (olddecl
);
3539 /* If cannot merge, then use the new type and qualifiers,
3540 and don't preserve the old rtl. */
3543 /* Clean out any memory we had of the old declaration. */
3544 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3546 TREE_VALUE (oldstatic
) = error_mark_node
;
3548 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3549 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3550 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3551 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3554 /* Merge the storage class information. */
3555 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3556 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3557 DECL_DEFER_OUTPUT (newdecl
) |= DECL_DEFER_OUTPUT (olddecl
);
3558 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3559 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3560 if (! DECL_EXTERNAL (olddecl
))
3561 DECL_EXTERNAL (newdecl
) = 0;
3563 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3565 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3566 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3567 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3568 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3569 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3570 /* Don't really know how much of the language-specific
3571 values we should copy from old to new. */
3572 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3573 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3574 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3575 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3576 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3578 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3579 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3580 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3581 DECL_BEFRIENDING_CLASSES (newdecl
)
3582 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3583 DECL_BEFRIENDING_CLASSES (olddecl
));
3586 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3588 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3589 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3591 /* If newdecl is not a specialization, then it is not a
3592 template-related function at all. And that means that we
3593 shoud have exited above, returning 0. */
3594 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3597 if (TREE_USED (olddecl
))
3598 /* From [temp.expl.spec]:
3600 If a template, a member template or the member of a class
3601 template is explicitly specialized then that
3602 specialization shall be declared before the first use of
3603 that specialization that would cause an implicit
3604 instantiation to take place, in every translation unit in
3605 which such a use occurs. */
3606 cp_error ("explicit specialization of %D after first use",
3609 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3611 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3613 /* If either decl says `inline', this fn is inline, unless its
3614 definition was passed already. */
3615 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3616 DECL_INLINE (olddecl
) = 1;
3617 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3621 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3622 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3623 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3625 if (! types_match
|| new_defines_function
)
3627 /* These need to be copied so that the names are available.
3628 Note that if the types do match, we'll preserve inline
3629 info and other bits, but if not, we won't. */
3630 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3631 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3633 if (new_defines_function
)
3634 /* If defining a function declared with other language
3635 linkage, use the previously declared language linkage. */
3636 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3637 else if (types_match
)
3639 /* If redeclaring a builtin function, and not a definition,
3640 it stays built in. */
3641 if (DECL_BUILT_IN (olddecl
))
3643 DECL_BUILT_IN_CLASS (newdecl
) = DECL_BUILT_IN_CLASS (olddecl
);
3644 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3645 /* If we're keeping the built-in definition, keep the rtl,
3646 regardless of declaration matches. */
3647 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3650 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3652 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3653 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3654 /* Previously saved insns go together with
3655 the function's previous definition. */
3656 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3657 /* Don't clear out the arguments if we're redefining a function. */
3658 if (DECL_ARGUMENTS (olddecl
))
3659 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3663 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3665 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3668 /* Now preserve various other info from the definition. */
3669 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3670 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3671 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3672 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3674 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3678 function_size
= sizeof (struct tree_decl
);
3680 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3681 (char *) olddecl
+ sizeof (struct tree_common
),
3682 function_size
- sizeof (struct tree_common
));
3684 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3686 /* If newdecl is a template instantiation, it is possible that
3687 the following sequence of events has occurred:
3689 o A friend function was declared in a class template. The
3690 class template was instantiated.
3692 o The instantiation of the friend declaration was
3693 recorded on the instantiation list, and is newdecl.
3695 o Later, however, instantiate_class_template called pushdecl
3696 on the newdecl to perform name injection. But, pushdecl in
3697 turn called duplicate_decls when it discovered that another
3698 declaration of a global function with the same name already
3701 o Here, in duplicate_decls, we decided to clobber newdecl.
3703 If we're going to do that, we'd better make sure that
3704 olddecl, and not newdecl, is on the list of
3705 instantiations so that if we try to do the instantiation
3706 again we won't get the clobbered declaration. */
3708 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3709 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3711 for (; decls
; decls
= TREE_CHAIN (decls
))
3712 if (TREE_VALUE (decls
) == newdecl
)
3713 TREE_VALUE (decls
) = olddecl
;
3718 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3719 (char *) olddecl
+ sizeof (struct tree_common
),
3720 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3721 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3724 DECL_UID (olddecl
) = olddecl_uid
;
3726 DECL_FRIEND_P (olddecl
) = 1;
3728 /* NEWDECL contains the merged attribute lists.
3729 Update OLDDECL to be the same. */
3730 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3735 /* Record a decl-node X as belonging to the current lexical scope.
3736 Check for errors (such as an incompatible declaration for the same
3737 name already seen in the same scope).
3739 Returns either X or an old decl for the same name.
3740 If an old decl is returned, it may have been smashed
3741 to agree with what X says. */
3749 int need_new_binding
;
3751 /* We shouldn't be calling pushdecl when we're generating RTL for a
3752 function that we already did semantic analysis on previously. */
3753 my_friendly_assert (!cfun
|| doing_semantic_analysis_p (),
3756 need_new_binding
= 1;
3758 if (DECL_TEMPLATE_PARM_P (x
))
3759 /* Template parameters have no context; they are not X::T even
3760 when declared within a class or namespace. */
3764 if (current_function_decl
&& x
!= current_function_decl
3765 /* A local declaration for a function doesn't constitute
3767 && !(TREE_CODE (x
) == FUNCTION_DECL
&& !DECL_INITIAL (x
))
3768 /* A local declaration for an `extern' variable is in the
3769 scope of the current namespace, not the current
3771 && !(TREE_CODE (x
) == VAR_DECL
&& DECL_EXTERNAL (x
))
3772 && !DECL_CONTEXT (x
))
3773 DECL_CONTEXT (x
) = current_function_decl
;
3775 /* If this is the declaration for a namespace-scope function,
3776 but the declaration itself is in a local scope, mark the
3778 if (TREE_CODE (x
) == FUNCTION_DECL
3779 && DECL_NAMESPACE_SCOPE_P (x
)
3780 && current_function_decl
3781 && x
!= current_function_decl
)
3782 DECL_LOCAL_FUNCTION_P (x
) = 1;
3785 name
= DECL_NAME (x
);
3788 int different_binding_level
= 0;
3790 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3791 name
= TREE_OPERAND (name
, 0);
3793 /* In case this decl was explicitly namespace-qualified, look it
3794 up in its namespace context. */
3795 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
)
3796 && namespace_bindings_p ())
3797 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3799 t
= lookup_name_current_level (name
);
3801 /* [basic.link] If there is a visible declaration of an entity
3802 with linkage having the same name and type, ignoring entities
3803 declared outside the innermost enclosing namespace scope, the
3804 block scope declaration declares that same entity and
3805 receives the linkage of the previous declaration. */
3806 if (! t
&& current_function_decl
&& x
!= current_function_decl
3807 && (TREE_CODE (x
) == FUNCTION_DECL
|| TREE_CODE (x
) == VAR_DECL
)
3808 && DECL_EXTERNAL (x
))
3810 /* Look in block scope. */
3811 t
= IDENTIFIER_VALUE (name
);
3812 /* Or in the innermost namespace. */
3814 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3815 /* Does it have linkage? Note that if this isn't a DECL, it's an
3816 OVERLOAD, which is OK. */
3817 if (t
&& DECL_P (t
) && ! (TREE_STATIC (t
) || DECL_EXTERNAL (t
)))
3820 different_binding_level
= 1;
3823 /* If we are declaring a function, and the result of name-lookup
3824 was an OVERLOAD, look for an overloaded instance that is
3825 actually the same as the function we are declaring. (If
3826 there is one, we have to merge our declaration with the
3827 previous declaration.) */
3828 if (t
&& TREE_CODE (t
) == OVERLOAD
)
3832 if (TREE_CODE (x
) == FUNCTION_DECL
)
3833 for (match
= t
; match
; match
= OVL_NEXT (match
))
3835 if (DECL_ASSEMBLER_NAME (OVL_CURRENT (t
))
3836 == DECL_ASSEMBLER_NAME (x
))
3840 /* Just choose one. */
3844 t
= OVL_CURRENT (match
);
3849 if (t
== error_mark_node
)
3851 /* error_mark_node is 0 for a while during initialization! */
3853 cp_error_at ("`%#D' used prior to declaration", x
);
3855 else if (t
!= NULL_TREE
)
3857 if (different_binding_level
)
3859 if (decls_match (x
, t
))
3860 /* The standard only says that the local extern
3861 inherits linkage from the previous decl; in
3862 particular, default args are not shared. It would
3863 be nice to propagate inlining info, though. FIXME. */
3864 TREE_PUBLIC (x
) = TREE_PUBLIC (t
);
3866 else if (TREE_CODE (t
) == PARM_DECL
)
3868 if (DECL_CONTEXT (t
) == NULL_TREE
)
3869 fatal ("parse errors have confused me too much");
3871 /* Check for duplicate params. */
3872 if (duplicate_decls (x
, t
))
3875 else if ((DECL_EXTERN_C_FUNCTION_P (x
)
3876 || DECL_FUNCTION_TEMPLATE_P (x
))
3877 && is_overloaded_fn (t
))
3878 /* Don't do anything just yet. */;
3879 else if (t
== wchar_decl_node
)
3881 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3882 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3884 /* Throw away the redeclaration. */
3887 else if (TREE_CODE (t
) != TREE_CODE (x
))
3889 if (duplicate_decls (x
, t
))
3892 else if (duplicate_decls (x
, t
))
3894 if (TREE_CODE (t
) == TYPE_DECL
)
3895 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3896 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3897 check_default_args (t
);
3901 else if (DECL_MAIN_P (x
))
3903 /* A redeclaration of main, but not a duplicate of the
3908 This function shall not be overloaded. */
3909 cp_error_at ("invalid redeclaration of `%D'", t
);
3910 cp_error ("as `%D'", x
);
3911 /* We don't try to push this declaration since that
3917 check_template_shadow (x
);
3919 /* If this is a function conjured up by the backend, massage it
3920 so it looks friendly. */
3921 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_LANG_SPECIFIC (x
))
3923 retrofit_lang_decl (x
);
3924 DECL_LANGUAGE (x
) = lang_c
;
3927 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_FUNCTION_MEMBER_P (x
))
3929 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
3932 if (!namespace_bindings_p ())
3933 /* We do not need to create a binding for this name;
3934 push_overloaded_decl will have already done so if
3936 need_new_binding
= 0;
3938 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3940 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
3942 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
3946 /* If declaring a type as a typedef, copy the type (unless we're
3947 at line 0), and install this TYPE_DECL as the new type's typedef
3948 name. See the extensive comment in ../c-decl.c (pushdecl). */
3949 if (TREE_CODE (x
) == TYPE_DECL
)
3951 tree type
= TREE_TYPE (x
);
3952 if (DECL_SOURCE_LINE (x
) == 0)
3954 if (TYPE_NAME (type
) == 0)
3955 TYPE_NAME (type
) = x
;
3957 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
3958 /* We don't want to copy the type when all we're
3959 doing is making a TYPE_DECL for the purposes of
3961 && (!TYPE_NAME (type
)
3962 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
3964 DECL_ORIGINAL_TYPE (x
) = type
;
3965 type
= build_type_copy (type
);
3966 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
3967 TYPE_NAME (type
) = x
;
3968 TREE_TYPE (x
) = type
;
3971 if (type
!= error_mark_node
3973 && TYPE_IDENTIFIER (type
))
3974 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
3975 current_binding_level
);
3979 /* Multiple external decls of the same identifier ought to match.
3981 We get warnings about inline functions where they are defined.
3982 We get warnings about other functions from push_overloaded_decl.
3984 Avoid duplicate warnings where they are used. */
3985 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
3989 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
3990 if (decl
&& TREE_CODE (decl
) == OVERLOAD
)
3991 decl
= OVL_FUNCTION (decl
);
3993 if (decl
&& decl
!= error_mark_node
3994 && (DECL_EXTERNAL (decl
) || TREE_PUBLIC (decl
))
3995 /* If different sort of thing, we already gave an error. */
3996 && TREE_CODE (decl
) == TREE_CODE (x
)
3997 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
3999 cp_pedwarn ("type mismatch with previous external decl", x
);
4000 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
4004 /* This name is new in its binding level.
4005 Install the new declaration and return it. */
4006 if (namespace_bindings_p ())
4008 /* Install a global value. */
4010 /* If the first global decl has external linkage,
4011 warn if we later see static one. */
4012 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
4013 TREE_PUBLIC (name
) = 1;
4015 /* Bind the mangled name for the entity. In the future, we
4016 should not need to do this; mangled names are an
4017 implementation detail of which the front-end should not
4018 need to be aware. */
4019 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
4021 /* For an ordinary function, we create a binding from
4022 the mangled name (i.e., NAME) to the DECL. But, for
4023 an `extern "C"' function, the mangled name and the
4024 ordinary name are the same so we need not do this. */
4025 && !DECL_EXTERN_C_FUNCTION_P (x
))
4029 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
4030 || TREE_CODE (x
) == NAMESPACE_DECL
)
4031 mangled_name
= name
;
4033 mangled_name
= DECL_ASSEMBLER_NAME (x
);
4035 if (TREE_CODE (x
) == FUNCTION_DECL
)
4037 ((IDENTIFIER_GLOBAL_VALUE (mangled_name
) == NULL_TREE
)
4038 || (IDENTIFIER_GLOBAL_VALUE (mangled_name
) == x
), 378);
4039 SET_IDENTIFIER_NAMESPACE_VALUE (mangled_name
, x
);
4042 /* Don't forget if the function was used via an implicit decl. */
4043 if (IDENTIFIER_IMPLICIT_DECL (name
)
4044 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
4047 /* Don't forget if its address was taken in that way. */
4048 if (IDENTIFIER_IMPLICIT_DECL (name
)
4049 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
4050 TREE_ADDRESSABLE (x
) = 1;
4052 /* Warn about mismatches against previous implicit decl. */
4053 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
4054 /* If this real decl matches the implicit, don't complain. */
4055 && ! (TREE_CODE (x
) == FUNCTION_DECL
4056 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
4058 ("`%D' was previously implicitly declared to return `int'", x
);
4060 /* If new decl is `static' and an `extern' was seen previously,
4062 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
4063 warn_extern_redeclared_static (x
, t
);
4067 /* Here to install a non-global value. */
4068 tree oldlocal
= IDENTIFIER_VALUE (name
);
4069 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
4071 if (need_new_binding
)
4073 push_local_binding (name
, x
, 0);
4074 /* Because push_local_binding will hook X on to the
4075 current_binding_level's name list, we don't want to
4076 do that again below. */
4077 need_new_binding
= 0;
4080 /* If this is a TYPE_DECL, push it into the type value slot. */
4081 if (TREE_CODE (x
) == TYPE_DECL
)
4082 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
4083 current_binding_level
);
4085 /* Clear out any TYPE_DECL shadowed by a namespace so that
4086 we won't think this is a type. The C struct hack doesn't
4087 go through namespaces. */
4088 if (TREE_CODE (x
) == NAMESPACE_DECL
)
4089 set_identifier_type_value_with_scope (name
, NULL_TREE
,
4090 current_binding_level
);
4097 && TREE_CODE (oldlocal
) == VAR_DECL
4098 && DECL_DEAD_FOR_LOCAL (oldlocal
))
4099 oldlocal
= DECL_SHADOWED_FOR_VAR (oldlocal
);
4101 if (oldlocal
== NULL_TREE
)
4102 oldlocal
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (d
));
4105 /* If this is an extern function declaration, see if we
4106 have a global definition or declaration for the function. */
4107 if (oldlocal
== NULL_TREE
4108 && DECL_EXTERNAL (x
)
4109 && oldglobal
!= NULL_TREE
4110 && TREE_CODE (x
) == FUNCTION_DECL
4111 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
4113 /* We have one. Their types must agree. */
4114 if (decls_match (x
, oldglobal
))
4118 cp_warning ("extern declaration of `%#D' doesn't match", x
);
4119 cp_warning_at ("global declaration `%#D'", oldglobal
);
4122 /* If we have a local external declaration,
4123 and no file-scope declaration has yet been seen,
4124 then if we later have a file-scope decl it must not be static. */
4125 if (oldlocal
== NULL_TREE
4126 && oldglobal
== NULL_TREE
4127 && DECL_EXTERNAL (x
)
4129 TREE_PUBLIC (name
) = 1;
4131 /* Warn if shadowing an argument at the top level of the body. */
4132 if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
4133 /* Inline decls shadow nothing. */
4134 && !DECL_FROM_INLINE (x
)
4135 && TREE_CODE (oldlocal
) == PARM_DECL
4136 /* Don't complain if it's from an enclosing function. */
4137 && DECL_CONTEXT (oldlocal
) == current_function_decl
4138 && TREE_CODE (x
) != PARM_DECL
)
4140 /* Go to where the parms should be and see if we
4142 struct binding_level
*b
= current_binding_level
->level_chain
;
4148 if (b
->parm_flag
== 1)
4149 cp_error ("declaration of `%#D' shadows a parameter", name
);
4152 /* Maybe warn if shadowing something else. */
4153 if (warn_shadow
&& !DECL_EXTERNAL (x
)
4154 /* Inline decls shadow nothing. */
4155 && !DECL_FROM_INLINE (x
)
4156 /* No shadow warnings for internally generated vars. */
4157 && ! DECL_ARTIFICIAL (x
)
4158 /* No shadow warnings for vars made for inlining. */
4159 && ! DECL_FROM_INLINE (x
))
4161 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
4162 warning ("declaration of `%s' shadows a parameter",
4163 IDENTIFIER_POINTER (name
));
4164 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
4165 && current_class_ptr
4166 && !TREE_STATIC (name
))
4167 warning ("declaration of `%s' shadows a member of `this'",
4168 IDENTIFIER_POINTER (name
));
4169 else if (oldlocal
!= NULL_TREE
)
4170 warning ("declaration of `%s' shadows previous local",
4171 IDENTIFIER_POINTER (name
));
4172 else if (oldglobal
!= NULL_TREE
)
4173 /* XXX shadow warnings in outer-more namespaces */
4174 warning ("declaration of `%s' shadows global declaration",
4175 IDENTIFIER_POINTER (name
));
4179 if (TREE_CODE (x
) == FUNCTION_DECL
)
4180 check_default_args (x
);
4182 /* Keep count of variables in this level with incomplete type. */
4183 if (TREE_CODE (x
) == VAR_DECL
4184 && TREE_TYPE (x
) != error_mark_node
4185 && ((!COMPLETE_TYPE_P (TREE_TYPE (x
))
4186 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
4187 /* RTTI TD entries are created while defining the type_info. */
4188 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
4189 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
4191 if (namespace_bindings_p ())
4192 namespace_scope_incomplete
4193 = tree_cons (NULL_TREE
, x
, namespace_scope_incomplete
);
4195 current_binding_level
->incomplete
4196 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4200 if (need_new_binding
)
4201 add_decl_to_level (x
,
4202 DECL_NAMESPACE_SCOPE_P (x
)
4203 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x
))
4204 : current_binding_level
);
4209 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4210 caller to set DECL_CONTEXT properly. */
4213 pushdecl_with_scope (x
, level
)
4215 struct binding_level
*level
;
4217 register struct binding_level
*b
;
4218 tree function_decl
= current_function_decl
;
4220 current_function_decl
= NULL_TREE
;
4221 if (level
->parm_flag
== 2)
4223 b
= class_binding_level
;
4224 class_binding_level
= level
;
4225 pushdecl_class_level (x
);
4226 class_binding_level
= b
;
4230 b
= current_binding_level
;
4231 current_binding_level
= level
;
4233 current_binding_level
= b
;
4235 current_function_decl
= function_decl
;
4239 /* Like pushdecl, only it places X in the current namespace,
4243 pushdecl_namespace_level (x
)
4246 register struct binding_level
*b
= current_binding_level
;
4249 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4251 /* Now, the type_shadowed stack may screw us. Munge it so it does
4253 if (TREE_CODE (x
) == TYPE_DECL
)
4255 tree name
= DECL_NAME (x
);
4257 tree
*ptr
= (tree
*)0;
4258 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4260 tree shadowed
= b
->type_shadowed
;
4261 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4262 if (TREE_PURPOSE (shadowed
) == name
)
4264 ptr
= &TREE_VALUE (shadowed
);
4265 /* Can't break out of the loop here because sometimes
4266 a binding level will have duplicate bindings for
4267 PT names. It's gross, but I haven't time to fix it. */
4270 newval
= TREE_TYPE (x
);
4271 if (ptr
== (tree
*)0)
4273 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4274 up here if this is changed to an assertion. --KR */
4275 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4285 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4289 pushdecl_top_level (x
)
4292 push_to_top_level ();
4293 x
= pushdecl_namespace_level (x
);
4294 pop_from_top_level ();
4298 /* Make the declaration of X appear in CLASS scope. */
4301 pushdecl_class_level (x
)
4304 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4305 scope looks for the pre-mangled name. */
4308 if (TREE_CODE (x
) == OVERLOAD
)
4309 x
= OVL_CURRENT (x
);
4310 name
= DECL_NAME (x
);
4314 push_class_level_binding (name
, x
);
4315 if (TREE_CODE (x
) == TYPE_DECL
)
4316 set_identifier_type_value (name
, TREE_TYPE (x
));
4318 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4322 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4325 pushdecl_class_level (f
);
4329 /* Enter DECL into the symbol table, if that's appropriate. Returns
4330 DECL, or a modified version thereof. */
4333 maybe_push_decl (decl
)
4336 tree type
= TREE_TYPE (decl
);
4338 /* Add this decl to the current binding level, but not if it comes
4339 from another scope, e.g. a static member variable. TEM may equal
4340 DECL or it may be a previous decl of the same name. */
4341 if (decl
== error_mark_node
4342 || (TREE_CODE (decl
) != PARM_DECL
4343 && DECL_CONTEXT (decl
) != NULL_TREE
4344 /* Definitions of namespace members outside their namespace are
4346 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4347 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4348 || TREE_CODE (type
) == UNKNOWN_TYPE
4349 /* The declaration of a template specialization does not affect
4350 the functions available for overload resolution, so we do not
4352 || (TREE_CODE (decl
) == FUNCTION_DECL
4353 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4356 return pushdecl (decl
);
4359 /* Make the declaration(s) of X appear in CLASS scope
4360 under the name NAME. */
4363 push_class_level_binding (name
, x
)
4368 /* The class_binding_level will be NULL if x is a template
4369 parameter name in a member template. */
4370 if (!class_binding_level
)
4373 /* Make sure that this new member does not have the same name
4374 as a template parameter. */
4375 if (TYPE_BEING_DEFINED (current_class_type
))
4376 check_template_shadow (x
);
4378 /* If this declaration shadows a declaration from an enclosing
4379 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4380 we leave this class. Record the shadowed declaration here. */
4381 binding
= IDENTIFIER_BINDING (name
);
4383 && ((TREE_CODE (x
) == OVERLOAD
4384 && BINDING_VALUE (binding
)
4385 && is_overloaded_fn (BINDING_VALUE (binding
)))
4386 || INHERITED_VALUE_BINDING_P (binding
)))
4391 /* If the old binding was from a base class, and was for a tag
4392 name, slide it over to make room for the new binding. The
4393 old binding is still visible if explicitly qualified with a
4395 if (INHERITED_VALUE_BINDING_P (binding
)
4396 && BINDING_VALUE (binding
)
4397 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4398 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4399 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4401 old_decl
= BINDING_TYPE (binding
);
4402 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4403 BINDING_VALUE (binding
) = NULL_TREE
;
4404 INHERITED_VALUE_BINDING_P (binding
) = 0;
4407 old_decl
= BINDING_VALUE (binding
);
4409 /* Find the previous binding of name on the class-shadowed
4410 list, and update it. */
4411 for (shadow
= class_binding_level
->class_shadowed
;
4413 shadow
= TREE_CHAIN (shadow
))
4414 if (TREE_PURPOSE (shadow
) == name
4415 && TREE_TYPE (shadow
) == old_decl
)
4417 BINDING_VALUE (binding
) = x
;
4418 INHERITED_VALUE_BINDING_P (binding
) = 0;
4419 TREE_TYPE (shadow
) = x
;
4420 IDENTIFIER_CLASS_VALUE (name
) = x
;
4425 /* If we didn't replace an existing binding, put the binding on the
4426 stack of bindings for the identifier, and update the shadowed list. */
4427 if (push_class_binding (name
, x
))
4429 class_binding_level
->class_shadowed
4430 = tree_cons (name
, NULL
,
4431 class_binding_level
->class_shadowed
);
4432 /* Record the value we are binding NAME to so that we can know
4433 what to pop later. */
4434 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4438 /* Insert another USING_DECL into the current binding level, returning
4439 this declaration. If this is a redeclaration, do nothing, and
4440 return NULL_TREE if this not in namespace scope (in namespace
4441 scope, a using decl might extend any previous bindings). */
4444 push_using_decl (scope
, name
)
4450 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4451 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4452 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4453 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4456 return namespace_bindings_p () ? decl
: NULL_TREE
;
4457 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4458 DECL_INITIAL (decl
) = scope
;
4459 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4460 current_binding_level
->usings
= decl
;
4464 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4465 changed (i.e. there was already a directive), or the fresh
4466 TREE_LIST otherwise. */
4469 push_using_directive (used
)
4472 tree ud
= current_binding_level
->using_directives
;
4473 tree iter
, ancestor
;
4475 /* Check if we already have this. */
4476 if (purpose_member (used
, ud
) != NULL_TREE
)
4479 /* Recursively add all namespaces used. */
4480 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4481 push_using_directive (TREE_PURPOSE (iter
));
4483 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4484 ud
= current_binding_level
->using_directives
;
4485 ud
= tree_cons (used
, ancestor
, ud
);
4486 current_binding_level
->using_directives
= ud
;
4490 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4491 other definitions already in place. We get around this by making
4492 the value of the identifier point to a list of all the things that
4493 want to be referenced by that name. It is then up to the users of
4494 that name to decide what to do with that list.
4496 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its
4497 DECL_TEMPLATE_RESULT. It is dealt with the same way.
4499 FLAGS is a bitwise-or of the following values:
4500 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4502 PUSH_USING: DECL is being pushed as the result of a using
4505 The value returned may be a previous declaration if we guessed wrong
4506 about what language DECL should belong to (C or C++). Otherwise,
4507 it's always DECL (and never something that's not a _DECL). */
4510 push_overloaded_decl (decl
, flags
)
4514 tree name
= DECL_NAME (decl
);
4517 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4520 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4522 old
= lookup_name_current_level (name
);
4526 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4528 tree t
= TREE_TYPE (old
);
4529 if (IS_AGGR_TYPE (t
) && warn_shadow
4530 && (! DECL_IN_SYSTEM_HEADER (decl
)
4531 || ! DECL_IN_SYSTEM_HEADER (old
)))
4532 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4535 else if (is_overloaded_fn (old
))
4539 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4541 tree fn
= OVL_CURRENT (tmp
);
4543 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4544 && !(flags
& PUSH_USING
)
4545 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4546 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4547 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4550 if (duplicate_decls (decl
, fn
))
4554 else if (old
== error_mark_node
)
4555 /* Ignore the undefined symbol marker. */
4559 cp_error_at ("previous non-function declaration `%#D'", old
);
4560 cp_error ("conflicts with function declaration `%#D'", decl
);
4565 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4567 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4568 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4570 new_binding
= ovl_cons (decl
, old
);
4571 if (flags
& PUSH_USING
)
4572 OVL_USED (new_binding
) = 1;
4575 /* NAME is not ambiguous. */
4579 set_namespace_binding (name
, current_namespace
, new_binding
);
4582 /* We only create an OVERLOAD if there was a previous binding at
4583 this level, or if decl is a template. In the former case, we
4584 need to remove the old binding and replace it with the new
4585 binding. We must also run through the NAMES on the binding
4586 level where the name was bound to update the chain. */
4588 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4592 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4594 d
= &TREE_CHAIN (*d
))
4596 || (TREE_CODE (*d
) == TREE_LIST
4597 && TREE_VALUE (*d
) == old
))
4599 if (TREE_CODE (*d
) == TREE_LIST
)
4600 /* Just replace the old binding with the new. */
4601 TREE_VALUE (*d
) = new_binding
;
4603 /* Build a TREE_LIST to wrap the OVERLOAD. */
4604 *d
= tree_cons (NULL_TREE
, new_binding
,
4607 /* And update the CPLUS_BINDING node. */
4608 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4613 /* We should always find a previous binding in this case. */
4614 my_friendly_abort (0);
4617 /* Install the new binding. */
4618 push_local_binding (name
, new_binding
, flags
);
4624 /* Generate an implicit declaration for identifier FUNCTIONID
4625 as a function of type int (). Print a warning if appropriate. */
4628 implicitly_declare (functionid
)
4633 /* We used to reuse an old implicit decl here,
4634 but this loses with inline functions because it can clobber
4635 the saved decl chains. */
4636 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4638 DECL_EXTERNAL (decl
) = 1;
4639 TREE_PUBLIC (decl
) = 1;
4641 /* ISO standard says implicit declarations are in the innermost block.
4642 So we record the decl in the standard fashion. */
4644 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4647 /* Only one warning per identifier. */
4648 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4650 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4653 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4658 /* Return zero if the declaration NEWDECL is valid
4659 when the declaration OLDDECL (assumed to be for the same name)
4660 has already been seen.
4661 Otherwise return an error message format string with a %s
4662 where the identifier should go. */
4665 redeclaration_error_message (newdecl
, olddecl
)
4666 tree newdecl
, olddecl
;
4668 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4670 /* Because C++ can put things into name space for free,
4671 constructs like "typedef struct foo { ... } foo"
4672 would look like an erroneous redeclaration. */
4673 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4676 return "redefinition of `%#D'";
4678 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4680 /* If this is a pure function, its olddecl will actually be
4681 the original initialization to `0' (which we force to call
4682 abort()). Don't complain about redefinition in this case. */
4683 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_PURE_VIRTUAL_P (olddecl
))
4686 /* If both functions come from different namespaces, this is not
4687 a redeclaration - this is a conflict with a used function. */
4688 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4689 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4690 return "`%D' conflicts with used function";
4692 /* We'll complain about linkage mismatches in
4693 warn_extern_redeclared_static. */
4695 /* Defining the same name twice is no good. */
4696 if (DECL_INITIAL (olddecl
) != NULL_TREE
4697 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4699 if (DECL_NAME (olddecl
) == NULL_TREE
)
4700 return "`%#D' not declared in class";
4702 return "redefinition of `%#D'";
4706 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4708 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4709 && (DECL_TEMPLATE_RESULT (newdecl
)
4710 != DECL_TEMPLATE_RESULT (olddecl
))
4711 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4712 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4713 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4714 && COMPLETE_TYPE_P (TREE_TYPE (newdecl
))
4715 && COMPLETE_TYPE_P (TREE_TYPE (olddecl
))))
4716 return "redefinition of `%#D'";
4719 else if (toplevel_bindings_p () || DECL_NAMESPACE_SCOPE_P (newdecl
))
4721 /* Objects declared at top level: */
4722 /* If at least one is a reference, it's ok. */
4723 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4725 /* Reject two definitions. */
4726 return "redefinition of `%#D'";
4730 /* Objects declared with block scope: */
4731 /* Reject two definitions, and reject a definition
4732 together with an external reference. */
4733 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4734 return "redeclaration of `%#D'";
4739 /* Create a new label, named ID. */
4742 make_label_decl (id
, local_p
)
4748 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4750 /* Make sure every label has an rtx. */
4753 DECL_CONTEXT (decl
) = current_function_decl
;
4754 DECL_MODE (decl
) = VOIDmode
;
4755 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
4757 /* Say where one reference is to the label, for the sake of the
4758 error if it is not defined. */
4759 DECL_SOURCE_LINE (decl
) = lineno
;
4760 DECL_SOURCE_FILE (decl
) = input_filename
;
4762 /* Record the fact that this identifier is bound to this label. */
4763 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4768 /* Record this label on the list of used labels so that we can check
4769 at the end of the function to see whether or not the label was
4770 actually defined, and so we can check when the label is defined whether
4771 this use is valid. */
4777 if (named_label_uses
== NULL
4778 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4779 || named_label_uses
->label_decl
!= decl
)
4781 struct named_label_use_list
*new_ent
;
4782 new_ent
= ((struct named_label_use_list
*)
4783 ggc_alloc (sizeof (struct named_label_use_list
)));
4784 new_ent
->label_decl
= decl
;
4785 new_ent
->names_in_scope
= current_binding_level
->names
;
4786 new_ent
->binding_level
= current_binding_level
;
4787 new_ent
->lineno_o_goto
= lineno
;
4788 new_ent
->filename_o_goto
= input_filename
;
4789 new_ent
->next
= named_label_uses
;
4790 named_label_uses
= new_ent
;
4794 /* Look for a label named ID in the current function. If one cannot
4795 be found, create one. (We keep track of used, but undefined,
4796 labels, and complain about them at the end of a function.) */
4803 struct named_label_list
*ent
;
4805 /* You can't use labels at global scope. */
4806 if (current_function_decl
== NULL_TREE
)
4808 error ("label `%s' referenced outside of any function",
4809 IDENTIFIER_POINTER (id
));
4813 /* See if we've already got this label. */
4814 decl
= IDENTIFIER_LABEL_VALUE (id
);
4815 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
4818 /* Record this label on the list of labels used in this function.
4819 We do this before calling make_label_decl so that we get the
4820 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4821 ent
= ((struct named_label_list
*)
4822 ggc_alloc_cleared (sizeof (struct named_label_list
)));
4823 ent
->old_value
= IDENTIFIER_LABEL_VALUE (id
);
4824 ent
->next
= named_labels
;
4827 /* We need a new label. */
4828 decl
= make_label_decl (id
, /*local_p=*/0);
4830 /* Now fill in the information we didn't have before. */
4831 ent
->label_decl
= decl
;
4836 /* Declare a local label named ID. */
4839 declare_local_label (id
)
4844 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4845 this scope we can restore the old value of
4846 IDENTIFIER_TYPE_VALUE. */
4847 current_binding_level
->shadowed_labels
4848 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4849 current_binding_level
->shadowed_labels
);
4850 /* Look for the label. */
4851 decl
= make_label_decl (id
, /*local_p=*/1);
4852 /* Now fill in the information we didn't have before. */
4853 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
4858 /* Returns nonzero if it is ill-formed to jump past the declaration of
4859 DECL. Returns 2 if it's also a real problem. */
4862 decl_jump_unsafe (decl
)
4865 if (TREE_CODE (decl
) != VAR_DECL
|| TREE_STATIC (decl
))
4868 if (DECL_INITIAL (decl
) == NULL_TREE
4869 && pod_type_p (TREE_TYPE (decl
)))
4872 /* This is really only important if we're crossing an initialization.
4873 The POD stuff is just pedantry; why should it matter if the class
4874 contains a field of pointer to member type? */
4875 if (DECL_INITIAL (decl
)
4876 || (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))))
4881 /* Check that a single previously seen jump to a newly defined label
4882 is OK. DECL is the LABEL_DECL or 0; LEVEL is the binding_level for
4883 the jump context; NAMES are the names in scope in LEVEL at the jump
4884 context; FILE and LINE are the source position of the jump or 0. */
4887 check_previous_goto_1 (decl
, level
, names
, file
, line
)
4889 struct binding_level
*level
;
4896 struct binding_level
*b
= current_binding_level
;
4897 for (; b
; b
= b
->level_chain
)
4899 tree new_decls
= b
->names
;
4900 tree old_decls
= (b
== level
? names
: NULL_TREE
);
4901 for (; new_decls
!= old_decls
;
4902 new_decls
= TREE_CHAIN (new_decls
))
4904 int problem
= decl_jump_unsafe (new_decls
);
4911 cp_pedwarn ("jump to label `%D'", decl
);
4913 pedwarn ("jump to case label");
4916 pedwarn_with_file_and_line (file
, line
, " from here");
4920 if (problem
> 1 && DECL_ARTIFICIAL (new_decls
))
4921 /* Can't skip init of __exception_info. */
4922 cp_error_at (" enters catch block", new_decls
);
4923 else if (problem
> 1)
4924 cp_error_at (" crosses initialization of `%#D'",
4927 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4933 if (b
->eh_region
&& ! saw_eh
)
4938 cp_pedwarn ("jump to label `%D'", decl
);
4940 pedwarn ("jump to case label");
4943 pedwarn_with_file_and_line (file
, line
, " from here");
4946 error (" enters try block");
4953 check_previous_goto (use
)
4954 struct named_label_use_list
*use
;
4956 check_previous_goto_1 (use
->label_decl
, use
->binding_level
,
4957 use
->names_in_scope
, use
->filename_o_goto
,
4958 use
->lineno_o_goto
);
4962 check_switch_goto (level
)
4963 struct binding_level
*level
;
4965 check_previous_goto_1 (NULL_TREE
, level
, level
->names
, NULL
, 0);
4968 /* Check that any previously seen jumps to a newly defined label DECL
4969 are OK. Called by define_label. */
4972 check_previous_gotos (decl
)
4975 struct named_label_use_list
**usep
;
4977 if (! TREE_USED (decl
))
4980 for (usep
= &named_label_uses
; *usep
; )
4982 struct named_label_use_list
*use
= *usep
;
4983 if (use
->label_decl
== decl
)
4985 check_previous_goto (use
);
4989 usep
= &(use
->next
);
4993 /* Check that a new jump to a label DECL is OK. Called by
4994 finish_goto_stmt. */
5002 struct named_label_list
*lab
;
5004 /* We can't know where a computed goto is jumping. So we assume
5006 if (! DECL_P (decl
))
5009 /* If the label hasn't been defined yet, defer checking. */
5010 if (! DECL_INITIAL (decl
))
5016 for (lab
= named_labels
; lab
; lab
= lab
->next
)
5017 if (decl
== lab
->label_decl
)
5020 /* If the label is not on named_labels it's a gcc local label, so
5021 it must be in an outer scope, so jumping to it is always OK. */
5025 if ((lab
->eh_region
|| lab
->bad_decls
) && !identified
)
5027 cp_pedwarn_at ("jump to label `%D'", decl
);
5028 pedwarn (" from here");
5032 for (bad
= lab
->bad_decls
; bad
; bad
= TREE_CHAIN (bad
))
5034 tree b
= TREE_VALUE (bad
);
5035 int u
= decl_jump_unsafe (b
);
5037 if (u
> 1 && DECL_ARTIFICIAL (b
))
5038 /* Can't skip init of __exception_info. */
5039 cp_error_at (" enters catch block", b
);
5041 cp_error_at (" skips initialization of `%#D'", b
);
5043 cp_pedwarn_at (" enters scope of non-POD `%#D'", b
);
5047 error (" enters try block");
5050 /* Define a label, specifying the location in the source file.
5051 Return the LABEL_DECL node for the label, if the definition is valid.
5052 Otherwise return 0. */
5055 define_label (filename
, line
, name
)
5056 const char *filename
;
5060 tree decl
= lookup_label (name
);
5061 struct named_label_list
*ent
;
5062 register struct binding_level
*p
;
5064 for (ent
= named_labels
; ent
; ent
= ent
->next
)
5065 if (ent
->label_decl
== decl
)
5068 /* After labels, make any new cleanups in the function go into their
5069 own new (temporary) binding contour. */
5070 for (p
= current_binding_level
; !(p
->parm_flag
); p
= p
->level_chain
)
5071 p
->more_cleanups_ok
= 0;
5073 if (name
== get_identifier ("wchar_t"))
5074 cp_pedwarn ("label named wchar_t");
5076 if (DECL_INITIAL (decl
) != NULL_TREE
)
5078 cp_error ("duplicate label `%D'", decl
);
5083 /* Mark label as having been defined. */
5084 DECL_INITIAL (decl
) = error_mark_node
;
5085 /* Say where in the source. */
5086 DECL_SOURCE_FILE (decl
) = filename
;
5087 DECL_SOURCE_LINE (decl
) = line
;
5090 ent
->names_in_scope
= current_binding_level
->names
;
5091 ent
->binding_level
= current_binding_level
;
5093 check_previous_gotos (decl
);
5094 current_function_return_value
= NULL_TREE
;
5101 struct binding_level
*level
;
5102 struct cp_switch
*next
;
5103 /* The SWITCH_STMT being built. */
5105 /* A splay-tree mapping the low element of a case range to the high
5106 element, or NULL_TREE if there is no high element. Used to
5107 determine whether or not a new case label duplicates an old case
5108 label. We need a tree, rather than simply a hash table, because
5109 of the GNU case range extension. */
5113 /* A stack of the currently active switch statements. The innermost
5114 switch statement is on the top of the stack. There is no need to
5115 mark the stack for garbage collection because it is only active
5116 during the processing of the body of a function, and we never
5117 collect at that point. */
5119 static struct cp_switch
*switch_stack
;
5121 /* Called right after a switch-statement condition is parsed.
5122 SWITCH_STMT is the switch statement being parsed. */
5125 push_switch (switch_stmt
)
5129 = (struct cp_switch
*) xmalloc (sizeof (struct cp_switch
));
5130 p
->level
= current_binding_level
;
5131 p
->next
= switch_stack
;
5132 p
->switch_stmt
= switch_stmt
;
5133 p
->cases
= splay_tree_new (case_compare
, NULL
, NULL
);
5140 struct cp_switch
*cs
;
5143 splay_tree_delete (cs
->cases
);
5144 switch_stack
= switch_stack
->next
;
5148 /* Note that we've seen a definition of a case label, and complain if this
5149 is a bad place for one. */
5152 finish_case_label (low_value
, high_value
)
5157 register struct binding_level
*p
;
5162 error ("case label not within a switch statement");
5164 cp_error ("case label `%E' not within a switch statement",
5167 error ("`default' label not within a switch statement");
5171 if (processing_template_decl
)
5175 /* For templates, just add the case label; we'll do semantic
5176 analysis at instantiation-time. */
5177 label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
5178 return add_stmt (build_case_label (low_value
, high_value
, label
));
5181 /* Find the condition on which this switch statement depends. */
5182 cond
= SWITCH_COND (switch_stack
->switch_stmt
);
5183 if (cond
&& TREE_CODE (cond
) == TREE_LIST
)
5184 cond
= TREE_VALUE (cond
);
5186 r
= c_add_case_label (switch_stack
->cases
, cond
, low_value
, high_value
);
5187 if (r
== error_mark_node
)
5190 check_switch_goto (switch_stack
->level
);
5192 /* After labels, make any new cleanups in the function go into their
5193 own new (temporary) binding contour. */
5194 for (p
= current_binding_level
; !(p
->parm_flag
); p
= p
->level_chain
)
5195 p
->more_cleanups_ok
= 0;
5196 current_function_return_value
= NULL_TREE
;
5201 /* Return the list of declarations of the current level.
5202 Note that this list is in reverse order unless/until
5203 you nreverse it; and when you do nreverse it, you must
5204 store the result back using `storedecls' or you will lose. */
5209 return current_binding_level
->names
;
5212 /* Return the list of type-tags (for structs, etc) of the current level. */
5217 return current_binding_level
->tags
;
5220 /* Store the list of declarations of the current level.
5221 This is done for the parameter declarations of a function being defined,
5222 after they are modified in the light of any missing parameters. */
5228 current_binding_level
->names
= decls
;
5231 /* Similarly, store the list of tags of the current level. */
5237 current_binding_level
->tags
= tags
;
5240 /* Given NAME, an IDENTIFIER_NODE,
5241 return the structure (or union or enum) definition for that name.
5242 Searches binding levels from BINDING_LEVEL up to the global level.
5243 If THISLEVEL_ONLY is nonzero, searches only the specified context
5244 (but skips any tag-transparent contexts to find one that is
5245 meaningful for tags).
5246 FORM says which kind of type the caller wants;
5247 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
5248 If the wrong kind of type is found, and it's not a template, an error is
5252 lookup_tag (form
, name
, binding_level
, thislevel_only
)
5253 enum tree_code form
;
5255 struct binding_level
*binding_level
;
5258 register struct binding_level
*level
;
5259 /* Non-zero if, we should look past a template parameter level, even
5260 if THISLEVEL_ONLY. */
5261 int allow_template_parms_p
= 1;
5263 for (level
= binding_level
; level
; level
= level
->level_chain
)
5266 if (ANON_AGGRNAME_P (name
))
5267 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5269 /* There's no need for error checking here, because
5270 anon names are unique throughout the compilation. */
5271 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
5272 return TREE_VALUE (tail
);
5274 else if (level
->namespace_p
)
5275 /* Do namespace lookup. */
5276 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
5278 tree old
= binding_for_name (name
, tail
);
5280 /* If we just skipped past a template parameter level,
5281 even though THISLEVEL_ONLY, and we find a template
5282 class declaration, then we use the _TYPE node for the
5283 template. See the example below. */
5284 if (thislevel_only
&& !allow_template_parms_p
5285 && old
&& BINDING_VALUE (old
)
5286 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
5287 old
= TREE_TYPE (BINDING_VALUE (old
));
5289 old
= BINDING_TYPE (old
);
5291 /* If it has an original type, it is a typedef, and we
5292 should not return it. */
5293 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
5295 if (old
&& TREE_CODE (old
) != form
5296 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
5298 cp_error ("`%#D' redeclared as %C", old
, form
);
5303 if (thislevel_only
|| tail
== global_namespace
)
5307 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5309 if (TREE_PURPOSE (tail
) == name
)
5311 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
5312 /* Should tighten this up; it'll probably permit
5313 UNION_TYPE and a struct template, for example. */
5315 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
5317 /* Definition isn't the kind we were looking for. */
5318 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
5322 return TREE_VALUE (tail
);
5325 if (thislevel_only
&& ! level
->tag_transparent
)
5327 if (level
->template_parms_p
&& allow_template_parms_p
)
5329 /* We must deal with cases like this:
5331 template <class T> struct S;
5332 template <class T> struct S {};
5334 When looking up `S', for the second declaration, we
5335 would like to find the first declaration. But, we
5336 are in the pseudo-global level created for the
5337 template parameters, rather than the (surrounding)
5338 namespace level. Thus, we keep going one more level,
5339 even though THISLEVEL_ONLY is non-zero. */
5340 allow_template_parms_p
= 0;
5352 set_current_level_tags_transparency (tags_transparent
)
5353 int tags_transparent
;
5355 current_binding_level
->tag_transparent
= tags_transparent
;
5359 /* Given a type, find the tag that was defined for it and return the tag name.
5360 Otherwise return 0. However, the value can never be 0
5361 in the cases in which this is used.
5363 C++: If NAME is non-zero, this is the new name to install. This is
5364 done when replacing anonymous tags with real tag names. */
5367 lookup_tag_reverse (type
, name
)
5371 register struct binding_level
*level
;
5373 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5376 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5378 if (TREE_VALUE (tail
) == type
)
5381 TREE_PURPOSE (tail
) = name
;
5382 return TREE_PURPOSE (tail
);
5389 /* Look up NAME in the NAMESPACE. */
5392 lookup_namespace_name (namespace, name
)
5393 tree
namespace, name
;
5396 tree template_id
= NULL_TREE
;
5398 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5400 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5401 /* This happens for A::B<int> when B is a namespace. */
5403 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5405 /* This happens for A::B where B is a template, and there are no
5406 template arguments. */
5407 cp_error ("invalid use of `%D'", name
);
5408 return error_mark_node
;
5411 namespace = ORIGINAL_NAMESPACE (namespace);
5413 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5416 name
= TREE_OPERAND (name
, 0);
5417 if (TREE_CODE (name
) == OVERLOAD
)
5418 name
= DECL_NAME (OVL_CURRENT (name
));
5419 else if (DECL_P (name
))
5420 name
= DECL_NAME (name
);
5423 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5425 val
= make_node (CPLUS_BINDING
);
5426 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5427 return error_mark_node
;
5429 if (BINDING_VALUE (val
))
5431 val
= BINDING_VALUE (val
);
5435 if (DECL_CLASS_TEMPLATE_P (val
))
5436 val
= lookup_template_class (val
,
5437 TREE_OPERAND (template_id
, 1),
5438 /*in_decl=*/NULL_TREE
,
5439 /*context=*/NULL_TREE
,
5440 /*entering_scope=*/0);
5441 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5442 || TREE_CODE (val
) == OVERLOAD
)
5443 val
= lookup_template_function (val
,
5444 TREE_OPERAND (template_id
, 1));
5447 cp_error ("`%D::%D' is not a template",
5449 return error_mark_node
;
5453 /* If we have a single function from a using decl, pull it out. */
5454 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5455 val
= OVL_FUNCTION (val
);
5459 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5460 return error_mark_node
;
5463 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5465 static unsigned long
5473 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5474 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5479 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5482 typename_compare (k1
, k2
)
5493 d1
= TYPE_NAME (t1
);
5494 d2
= TYPE_NAME (t2
);
5496 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5497 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5498 && ((TREE_TYPE (t1
) != NULL_TREE
)
5499 == (TREE_TYPE (t2
) != NULL_TREE
))
5500 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5501 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5504 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5505 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5506 is non-NULL, this type is being created by the implicit typename
5507 extension, and BASE_TYPE is a type named `t' in some base class of
5508 `T' which depends on template parameters.
5510 Returns the new TYPENAME_TYPE. */
5513 build_typename_type (context
, name
, fullname
, base_type
)
5521 struct hash_entry
* e
;
5523 static struct hash_table ht
;
5527 static struct hash_table
*h
= &ht
;
5528 if (!hash_table_init (&ht
, &hash_newfunc
, &typename_hash
,
5530 fatal ("virtual memory exhausted");
5531 ggc_add_tree_hash_table_root (&h
, 1);
5534 /* Build the TYPENAME_TYPE. */
5535 t
= make_aggr_type (TYPENAME_TYPE
);
5536 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5537 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5538 TREE_TYPE (t
) = base_type
;
5540 /* Build the corresponding TYPE_DECL. */
5541 d
= build_decl (TYPE_DECL
, name
, t
);
5542 TYPE_NAME (TREE_TYPE (d
)) = d
;
5543 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5544 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5545 DECL_ARTIFICIAL (d
) = 1;
5547 /* See if we already have this type. */
5548 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5552 /* Insert the type into the table. */
5553 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5558 /* Resolve `typename CONTEXT::NAME'. Returns an appropriate type,
5559 unless an error occurs, in which case error_mark_node is returned.
5560 If COMPLAIN zero, don't complain about any errors that occur. */
5563 make_typename_type (context
, name
, complain
)
5571 if (!(TYPE_LANG_SPECIFIC (name
)
5572 && (CLASSTYPE_IS_TEMPLATE (name
)
5573 || CLASSTYPE_USE_TEMPLATE (name
))))
5574 name
= TYPE_IDENTIFIER (name
);
5576 /* Create a TEMPLATE_ID_EXPR for the type. */
5577 name
= build_nt (TEMPLATE_ID_EXPR
,
5578 CLASSTYPE_TI_TEMPLATE (name
),
5579 CLASSTYPE_TI_ARGS (name
));
5581 else if (TREE_CODE (name
) == TYPE_DECL
)
5582 name
= DECL_NAME (name
);
5586 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5588 name
= TREE_OPERAND (name
, 0);
5589 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5590 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5592 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5593 my_friendly_abort (2000);
5595 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5597 /* We can get here from typename_sub0 in the explicit_template_type
5598 expansion. Just fail. */
5600 cp_error ("no class template named `%#T' in `%#T'",
5602 return error_mark_node
;
5605 if (! uses_template_parms (context
)
5606 || currently_open_class (context
))
5608 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5610 tree tmpl
= NULL_TREE
;
5611 if (IS_AGGR_TYPE (context
))
5612 tmpl
= lookup_field (context
, name
, 0, 0);
5613 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5616 cp_error ("no class template named `%#T' in `%#T'",
5618 return error_mark_node
;
5621 return lookup_template_class (tmpl
,
5622 TREE_OPERAND (fullname
, 1),
5624 /*entering_scope=*/0);
5630 if (!IS_AGGR_TYPE (context
))
5633 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5634 return error_mark_node
;
5637 t
= lookup_field (context
, name
, 0, 1);
5639 return TREE_TYPE (t
);
5643 /* If the CONTEXT is not a template type, then either the field is
5644 there now or its never going to be. */
5645 if (!uses_template_parms (context
))
5648 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5649 return error_mark_node
;
5653 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5656 /* Select the right _DECL from multiple choices. */
5659 select_decl (binding
, flags
)
5664 val
= BINDING_VALUE (binding
);
5666 /* When we implicitly declare some builtin entity, we mark it
5667 DECL_ANTICIPATED, so that we know to ignore it until it is
5669 if (val
&& DECL_P (val
)
5670 && DECL_LANG_SPECIFIC (val
)
5671 && DECL_ANTICIPATED (val
))
5674 if (LOOKUP_NAMESPACES_ONLY (flags
))
5676 /* We are not interested in types. */
5677 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5682 /* If we could have a type and
5683 we have nothing or we need a type and have none. */
5684 if (BINDING_TYPE (binding
)
5685 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5686 && TREE_CODE (val
) != TYPE_DECL
)))
5687 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5688 /* Don't return non-types if we really prefer types. */
5689 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5690 && (TREE_CODE (val
) != TEMPLATE_DECL
5691 || !DECL_CLASS_TEMPLATE_P (val
)))
5697 /* Unscoped lookup of a global: iterate over current namespaces,
5698 considering using-directives. If SPACESP is non-NULL, store a list
5699 of the namespaces we've considered in it. */
5702 unqualified_namespace_lookup (name
, flags
, spacesp
)
5707 tree b
= make_node (CPLUS_BINDING
);
5708 tree initial
= current_decl_namespace();
5709 tree scope
= initial
;
5711 struct binding_level
*level
;
5712 tree val
= NULL_TREE
;
5715 *spacesp
= NULL_TREE
;
5717 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5720 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5721 val
= binding_for_name (name
, scope
);
5723 /* Initialize binding for this context. */
5724 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5725 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5727 /* Add all _DECLs seen through local using-directives. */
5728 for (level
= current_binding_level
;
5729 !level
->namespace_p
;
5730 level
= level
->level_chain
)
5731 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5732 scope
, flags
, spacesp
))
5733 /* Give up because of error. */
5734 return error_mark_node
;
5736 /* Add all _DECLs seen through global using-directives. */
5737 /* XXX local and global using lists should work equally. */
5741 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5742 scope
, flags
, spacesp
))
5743 /* Give up because of error. */
5744 return error_mark_node
;
5745 if (siter
== scope
) break;
5746 siter
= CP_DECL_CONTEXT (siter
);
5749 val
= select_decl (b
, flags
);
5750 if (scope
== global_namespace
)
5756 /* Combine prefer_type and namespaces_only into flags. */
5759 lookup_flags (prefer_type
, namespaces_only
)
5760 int prefer_type
, namespaces_only
;
5762 if (namespaces_only
)
5763 return LOOKUP_PREFER_NAMESPACES
;
5764 if (prefer_type
> 1)
5765 return LOOKUP_PREFER_TYPES
;
5766 if (prefer_type
> 0)
5767 return LOOKUP_PREFER_BOTH
;
5771 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5772 ignore it or not. Subroutine of lookup_name_real. */
5775 qualify_lookup (val
, flags
)
5779 if (val
== NULL_TREE
)
5781 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5783 if ((flags
& LOOKUP_PREFER_TYPES
)
5784 && (TREE_CODE (val
) == TYPE_DECL
5785 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5786 && DECL_CLASS_TEMPLATE_P (val
))))
5788 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5793 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5797 warn_about_implicit_typename_lookup (typename
, binding
)
5801 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5802 tree name
= DECL_NAME (typename
);
5804 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5805 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5806 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5807 && ! (TREE_CODE (binding
) == TYPE_DECL
5808 && same_type_p (TREE_TYPE (binding
), subtype
)))
5810 cp_warning ("lookup of `%D' finds `%#D'",
5812 cp_warning (" instead of `%D' from dependent base class",
5814 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5815 constructor_name (current_class_type
), name
);
5819 /* Look up NAME in the current binding level and its superiors in the
5820 namespace of variables, functions and typedefs. Return a ..._DECL
5821 node of some kind representing its definition if there is only one
5822 such declaration, or return a TREE_LIST with all the overloaded
5823 definitions if there are many, or return 0 if it is undefined.
5825 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5826 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5827 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5828 Otherwise we prefer non-TYPE_DECLs.
5830 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5831 using IDENTIFIER_CLASS_VALUE. */
5834 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5836 int prefer_type
, nonclass
, namespaces_only
;
5839 tree val
= NULL_TREE
;
5841 tree from_obj
= NULL_TREE
;
5843 int val_is_implicit_typename
= 0;
5845 /* Hack: copy flag set by parser, if set. */
5846 if (only_namespace_names
)
5847 namespaces_only
= 1;
5849 if (prefer_type
== -2)
5851 extern int looking_for_typename
;
5852 tree type
= NULL_TREE
;
5855 prefer_type
= looking_for_typename
;
5857 flags
= lookup_flags (prefer_type
, namespaces_only
);
5858 /* If the next thing is '<', class templates are types. */
5859 if (looking_for_template
)
5860 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5862 /* std:: becomes :: for now. */
5863 if (got_scope
&& got_scope
== fake_std_node
)
5864 got_scope
= void_type_node
;
5868 else if (got_object
!= error_mark_node
)
5873 if (type
== error_mark_node
)
5874 return error_mark_node
;
5875 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5876 type
= TREE_TYPE (type
);
5879 type
= complete_type (type
);
5881 if (TREE_CODE (type
) == VOID_TYPE
)
5882 type
= global_namespace
;
5883 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5885 val
= make_node (CPLUS_BINDING
);
5886 flags
|= LOOKUP_COMPLAIN
;
5887 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5889 val
= select_decl (val
, flags
);
5891 else if (! IS_AGGR_TYPE (type
)
5892 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5893 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
5894 || TREE_CODE (type
) == TYPENAME_TYPE
)
5895 /* Someone else will give an error about this if needed. */
5897 else if (type
== current_class_type
)
5898 val
= IDENTIFIER_CLASS_VALUE (name
);
5901 val
= lookup_member (type
, name
, 0, prefer_type
);
5902 type_access_control (type
, val
);
5904 /* Restore the containing TYPENAME_TYPE if we looked
5905 through it before. */
5906 if (got_scope
&& got_scope
!= type
5907 && val
&& TREE_CODE (val
) == TYPE_DECL
5908 && TREE_CODE (TREE_TYPE (val
)) == TYPENAME_TYPE
)
5909 TYPE_CONTEXT (TREE_TYPE (val
)) = got_scope
;
5917 else if (got_object
&& val
)
5925 flags
= lookup_flags (prefer_type
, namespaces_only
);
5926 /* If we're not parsing, we need to complain. */
5927 flags
|= LOOKUP_COMPLAIN
;
5930 /* First, look in non-namespace scopes. */
5932 if (current_class_type
== NULL_TREE
)
5935 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5939 if (!LOCAL_BINDING_P (t
) && nonclass
)
5940 /* We're not looking for class-scoped bindings, so keep going. */
5943 /* If this is the kind of thing we're looking for, we're done. */
5944 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5945 binding
= BINDING_VALUE (t
);
5946 else if ((flags
& LOOKUP_PREFER_TYPES
)
5947 && qualify_lookup (BINDING_TYPE (t
), flags
))
5948 binding
= BINDING_TYPE (t
);
5950 binding
= NULL_TREE
;
5952 /* Handle access control on types from enclosing or base classes. */
5953 if (binding
&& ! yylex
5954 && BINDING_LEVEL (t
) && BINDING_LEVEL (t
)->parm_flag
== 2)
5955 type_access_control (BINDING_LEVEL (t
)->this_class
, binding
);
5958 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5960 if (val_is_implicit_typename
&& !yylex
)
5961 warn_about_implicit_typename_lookup (val
, binding
);
5963 val_is_implicit_typename
5964 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5965 if (!val_is_implicit_typename
)
5970 /* Now lookup in namespace scopes. */
5971 if (!val
|| val_is_implicit_typename
)
5973 t
= unqualified_namespace_lookup (name
, flags
, 0);
5976 if (val_is_implicit_typename
&& !yylex
)
5977 warn_about_implicit_typename_lookup (val
, t
);
5985 /* This should only warn about types used in qualified-ids. */
5986 if (from_obj
&& from_obj
!= val
)
5988 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5989 && TREE_CODE (val
) == TYPE_DECL
5990 && ! same_type_p (TREE_TYPE (from_obj
), TREE_TYPE (val
)))
5992 lookup of `%D' in the scope of `%#T' (`%#T') \
5993 does not match lookup in the current scope (`%#T')",
5994 name
, got_object
, TREE_TYPE (from_obj
),
5997 /* We don't change val to from_obj if got_object depends on
5998 template parms because that breaks implicit typename for
5999 destructor calls. */
6000 if (! uses_template_parms (got_object
))
6004 /* If we have a single function from a using decl, pull it out. */
6005 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
6006 val
= OVL_FUNCTION (val
);
6015 lookup_name_nonclass (name
)
6018 return lookup_name_real (name
, 0, 1, 0);
6022 lookup_function_nonclass (name
, args
)
6026 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
6030 lookup_name_namespace_only (name
)
6033 /* type-or-namespace, nonclass, namespace_only */
6034 return lookup_name_real (name
, 1, 1, 1);
6038 lookup_name (name
, prefer_type
)
6042 return lookup_name_real (name
, prefer_type
, 0, 0);
6045 /* Similar to `lookup_name' but look only in the innermost non-class
6049 lookup_name_current_level (name
)
6052 struct binding_level
*b
;
6055 b
= current_binding_level
;
6056 while (b
->parm_flag
== 2)
6061 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
6063 /* extern "C" function() */
6064 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
6067 else if (IDENTIFIER_BINDING (name
)
6068 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
6072 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
6073 return IDENTIFIER_VALUE (name
);
6085 /* Like lookup_name_current_level, but for types. */
6088 lookup_type_current_level (name
)
6091 register tree t
= NULL_TREE
;
6093 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
6095 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
6096 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
6098 struct binding_level
*b
= current_binding_level
;
6101 if (purpose_member (name
, b
->type_shadowed
))
6102 return REAL_IDENTIFIER_TYPE_VALUE (name
);
6114 begin_only_namespace_names ()
6116 only_namespace_names
= 1;
6120 end_only_namespace_names ()
6122 only_namespace_names
= 0;
6125 /* Push the declarations of builtin types into the namespace.
6126 RID_INDEX is the index of the builtin type
6127 in the array RID_POINTERS. NAME is the name used when looking
6128 up the builtin type. TYPE is the _TYPE node for the builtin type. */
6131 record_builtin_type (rid_index
, name
, type
)
6136 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
6137 tree tdecl
= NULL_TREE
;
6139 if ((int) rid_index
< (int) RID_MAX
)
6140 rname
= ridpointers
[(int) rid_index
];
6142 tname
= get_identifier (name
);
6144 TYPE_BUILT_IN (type
) = 1;
6148 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
6149 set_identifier_type_value (tname
, NULL_TREE
);
6150 if ((int) rid_index
< (int) RID_MAX
)
6151 /* Built-in types live in the global namespace. */
6152 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
6154 if (rname
!= NULL_TREE
)
6156 if (tname
!= NULL_TREE
)
6158 set_identifier_type_value (rname
, NULL_TREE
);
6159 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
6163 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
6164 set_identifier_type_value (rname
, NULL_TREE
);
6169 /* Record one of the standard Java types.
6170 * Declare it as having the given NAME.
6171 * If SIZE > 0, it is the size of one of the integral types;
6172 * otherwise it is the negative of the size of one of the other types. */
6175 record_builtin_java_type (name
, size
)
6181 type
= make_signed_type (size
);
6182 else if (size
> -32)
6183 { /* "__java_char" or ""__java_boolean". */
6184 type
= make_unsigned_type (-size
);
6185 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
6188 { /* "__java_float" or ""__java_double". */
6189 type
= make_node (REAL_TYPE
);
6190 TYPE_PRECISION (type
) = - size
;
6193 record_builtin_type (RID_MAX
, name
, type
);
6194 decl
= TYPE_NAME (type
);
6196 /* Suppress generate debug symbol entries for these types,
6197 since for normal C++ they are just clutter.
6198 However, push_lang_context undoes this if extern "Java" is seen. */
6199 DECL_IGNORED_P (decl
) = 1;
6201 TYPE_FOR_JAVA (type
) = 1;
6205 /* Push a type into the namespace so that the back-ends ignore it. */
6208 record_unknown_type (type
, name
)
6212 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
6213 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
6214 DECL_IGNORED_P (decl
) = 1;
6215 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
6216 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
6217 TYPE_ALIGN (type
) = 1;
6218 TYPE_USER_ALIGN (type
) = 0;
6219 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
6222 /* An string for which we should create an IDENTIFIER_NODE at
6225 typedef struct predefined_identifier
6227 /* The name of the identifier. */
6229 /* The place where the IDENTIFIER_NODE should be stored. */
6231 /* Non-zero if this is the name of a constructor or destructor. */
6233 } predefined_identifier
;
6235 /* Create all the predefined identifiers. */
6238 initialize_predefined_identifiers ()
6240 struct predefined_identifier
*pid
;
6242 /* A table of identifiers to create at startup. */
6243 static predefined_identifier predefined_identifiers
[] = {
6244 { "C++", &lang_name_cplusplus
, 0 },
6245 { "C", &lang_name_c
, 0 },
6246 { "Java", &lang_name_java
, 0 },
6247 { CTOR_NAME
, &ctor_identifier
, 1 },
6248 { "__base_ctor", &base_ctor_identifier
, 1 },
6249 { "__comp_ctor", &complete_ctor_identifier
, 1 },
6250 { DTOR_NAME
, &dtor_identifier
, 1 },
6251 { "__comp_dtor", &complete_dtor_identifier
, 1 },
6252 { "__base_dtor", &base_dtor_identifier
, 1 },
6253 { "__deleting_dtor", &deleting_dtor_identifier
, 1 },
6254 { VTABLE_DELTA2_NAME
, &delta2_identifier
, 0 },
6255 { VTABLE_DELTA_NAME
, &delta_identifier
, 0 },
6256 { IN_CHARGE_NAME
, &in_charge_identifier
, 0 },
6257 { VTABLE_INDEX_NAME
, &index_identifier
, 0 },
6258 { "nelts", &nelts_identifier
, 0 },
6259 { THIS_NAME
, &this_identifier
, 0 },
6260 { VTABLE_PFN_NAME
, &pfn_identifier
, 0 },
6261 { "__pfn_or_delta2", &pfn_or_delta2_identifier
, 0 },
6262 { "_vptr", &vptr_identifier
, 0 },
6263 { "__cp_push_exception", &cp_push_exception_identifier
, 0 },
6264 { "__vtt_parm", &vtt_parm_identifier
, 0 },
6265 { "std", &std_identifier
, 0 },
6269 for (pid
= predefined_identifiers
; pid
->name
; ++pid
)
6271 *pid
->node
= get_identifier (pid
->name
);
6272 if (pid
->ctor_or_dtor_p
)
6273 IDENTIFIER_CTOR_OR_DTOR_P (*pid
->node
) = 1;
6277 /* Create the predefined scalar types of C,
6278 and some nodes representing standard constants (0, 1, (void *)0).
6279 Initialize the global binding level.
6280 Make definitions for built-in primitive functions. */
6283 init_decl_processing ()
6287 /* Check to see that the user did not specify an invalid combination
6288 of command-line options. */
6289 if (flag_new_abi
&& !flag_vtable_thunks
)
6290 fatal ("the new ABI requires vtable thunks");
6292 /* Create all the identifiers we need. */
6293 initialize_predefined_identifiers ();
6295 /* Fill in back-end hooks. */
6296 init_lang_status
= &push_cp_function_context
;
6297 free_lang_status
= &pop_cp_function_context
;
6298 mark_lang_status
= &mark_cp_function_context
;
6299 lang_safe_from_p
= &c_safe_from_p
;
6300 lang_dump_tree
= &cp_dump_tree
;
6301 lang_missing_noreturn_ok_p
= &cp_missing_noreturn_ok_p
;
6307 /* Create the global variables. */
6308 push_to_top_level ();
6310 /* Enter the global namespace. */
6311 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
6312 push_namespace (get_identifier ("::"));
6313 global_namespace
= current_namespace
;
6314 current_lang_name
= NULL_TREE
;
6316 /* Adjust various flags based on command-line settings. */
6317 if (! flag_permissive
&& ! pedantic
)
6318 flag_pedantic_errors
= 1;
6319 if (!flag_no_inline
)
6320 flag_inline_trees
= 1;
6323 current_lang_name
= lang_name_c
;
6325 current_function_decl
= NULL_TREE
;
6326 current_binding_level
= NULL_BINDING_LEVEL
;
6327 free_binding_level
= NULL_BINDING_LEVEL
;
6329 build_common_tree_nodes (flag_signed_char
);
6331 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6332 TREE_TYPE (error_mark_list
) = error_mark_node
;
6334 /* Make the binding_level structure for global names. */
6336 global_binding_level
= current_binding_level
;
6337 /* The global level is the namespace level of ::. */
6338 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6339 declare_namespace_level ();
6341 /* Create the `std' namespace. */
6344 push_namespace (std_identifier
);
6345 std_node
= current_namespace
;
6347 fake_std_node
= error_mark_node
;
6351 fake_std_node
= build_decl (NAMESPACE_DECL
,
6354 pushdecl (fake_std_node
);
6357 c_common_nodes_and_builtins ();
6359 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6360 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6361 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6362 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6363 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6364 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6365 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6366 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6368 integer_two_node
= build_int_2 (2, 0);
6369 TREE_TYPE (integer_two_node
) = integer_type_node
;
6370 integer_three_node
= build_int_2 (3, 0);
6371 TREE_TYPE (integer_three_node
) = integer_type_node
;
6373 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6374 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6375 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6376 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6377 TYPE_PRECISION (boolean_type_node
) = 1;
6378 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6379 boolean_false_node
= build_int_2 (0, 0);
6380 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6381 boolean_true_node
= build_int_2 (1, 0);
6382 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6384 signed_size_zero_node
= build_int_2 (0, 0);
6385 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6387 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6390 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
6394 delta_type_node
= ptrdiff_type_node
;
6395 else if (flag_huge_objects
)
6396 delta_type_node
= long_integer_type_node
;
6398 delta_type_node
= short_integer_type_node
;
6401 vtable_index_type
= ptrdiff_type_node
;
6403 vtable_index_type
= delta_type_node
;
6405 vtt_parm_type
= build_pointer_type (const_ptr_type_node
);
6406 lang_type_promotes_to
= convert_type_from_ellipsis
;
6409 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6411 /* C++ extensions */
6413 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6414 record_unknown_type (unknown_type_node
, "unknown type");
6416 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6417 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6419 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6421 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6423 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6424 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6426 if (flag_vtable_thunks
)
6428 /* Make sure we get a unique function type, so we can give
6429 its pointer type a name. (This wins for gdb.) */
6430 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6431 TREE_TYPE (vfunc_type
) = integer_type_node
;
6432 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6433 layout_type (vfunc_type
);
6435 vtable_entry_type
= build_pointer_type (vfunc_type
);
6439 vtable_entry_type
= make_aggr_type (RECORD_TYPE
);
6440 fields
[0] = build_decl (FIELD_DECL
, delta_identifier
,
6442 fields
[1] = build_decl (FIELD_DECL
, index_identifier
,
6444 fields
[2] = build_decl (FIELD_DECL
, pfn_identifier
,
6446 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6449 /* Make this part of an invisible union. */
6450 fields
[3] = copy_node (fields
[2]);
6451 TREE_TYPE (fields
[3]) = delta_type_node
;
6452 DECL_NAME (fields
[3]) = delta2_identifier
;
6453 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6454 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6455 DECL_SIZE_UNIT (fields
[3]) = TYPE_SIZE_UNIT (delta_type_node
);
6456 TREE_UNSIGNED (fields
[3]) = 0;
6457 TREE_CHAIN (fields
[2]) = fields
[3];
6458 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6461 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6464 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6465 layout_type (vtbl_type_node
);
6466 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6467 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6468 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6469 layout_type (vtbl_ptr_type_node
);
6470 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6474 push_namespace (get_identifier ("__cxxabiv1"));
6475 abi_node
= current_namespace
;
6479 global_type_node
= make_node (LANG_TYPE
);
6480 record_unknown_type (global_type_node
, "global type");
6483 current_lang_name
= lang_name_cplusplus
;
6486 tree bad_alloc_type_node
, newtype
, deltype
;
6488 push_namespace (std_identifier
);
6489 bad_alloc_type_node
= xref_tag
6490 (class_type_node
, get_identifier ("bad_alloc"), 1);
6493 newtype
= build_exception_variant
6494 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6495 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6496 push_cp_library_fn (NEW_EXPR
, newtype
);
6497 push_cp_library_fn (VEC_NEW_EXPR
, newtype
);
6498 global_delete_fndecl
= push_cp_library_fn (DELETE_EXPR
, deltype
);
6499 push_cp_library_fn (VEC_DELETE_EXPR
, deltype
);
6503 = build_library_fn_ptr ((flag_new_abi
6504 ? "__cxa_pure_virtual"
6505 : "__pure_virtual"),
6508 /* Perform other language dependent initializations. */
6509 init_class_processing ();
6510 init_init_processing ();
6511 init_search_processing ();
6512 init_rtti_processing ();
6514 if (flag_exceptions
)
6515 init_exception_processing ();
6518 flag_inline_functions
= 0;
6521 if (! supports_one_only ())
6524 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6525 function_id_node
= get_identifier ("__FUNCTION__");
6526 pretty_function_id_node
= get_identifier ("__PRETTY_FUNCTION__");
6527 func_id_node
= get_identifier ("__func__");
6529 make_fname_decl
= cp_make_fname_decl
;
6530 declare_function_name ();
6532 /* Prepare to check format strings against argument lists. */
6533 init_function_format_info ();
6535 /* Show we use EH for cleanups. */
6536 using_eh_for_cleanups ();
6538 valid_lang_attribute
= cp_valid_lang_attribute
;
6540 /* Maintain consistency. Perhaps we should just complain if they
6541 say -fwritable-strings? */
6542 if (flag_writable_strings
)
6543 flag_const_strings
= 0;
6545 /* Add GC roots for all of our global variables. */
6546 ggc_add_tree_root (c_global_trees
, sizeof c_global_trees
/ sizeof(tree
));
6547 ggc_add_tree_root (cp_global_trees
, sizeof cp_global_trees
/ sizeof(tree
));
6548 ggc_add_tree_root (&integer_three_node
, 1);
6549 ggc_add_tree_root (&integer_two_node
, 1);
6550 ggc_add_tree_root (&signed_size_zero_node
, 1);
6551 ggc_add_tree_root (&size_one_node
, 1);
6552 ggc_add_tree_root (&size_zero_node
, 1);
6553 ggc_add_root (&global_binding_level
, 1, sizeof global_binding_level
,
6554 mark_binding_level
);
6555 ggc_add_root (&scope_chain
, 1, sizeof scope_chain
, &mark_saved_scope
);
6556 ggc_add_tree_root (&static_ctors
, 1);
6557 ggc_add_tree_root (&static_dtors
, 1);
6558 ggc_add_tree_root (&lastiddecl
, 1);
6560 ggc_add_tree_root (&last_function_parm_tags
, 1);
6561 ggc_add_tree_root (¤t_function_return_value
, 1);
6562 ggc_add_tree_root (¤t_function_parm_tags
, 1);
6563 ggc_add_tree_root (&last_function_parms
, 1);
6564 ggc_add_tree_root (&error_mark_list
, 1);
6566 ggc_add_tree_root (&global_namespace
, 1);
6567 ggc_add_tree_root (&global_type_node
, 1);
6568 ggc_add_tree_root (&anonymous_namespace_name
, 1);
6570 ggc_add_tree_root (&got_object
, 1);
6571 ggc_add_tree_root (&got_scope
, 1);
6573 ggc_add_tree_root (¤t_lang_name
, 1);
6574 ggc_add_tree_root (&static_aggregates
, 1);
6575 ggc_add_tree_root (&free_bindings
, 1);
6578 /* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the
6579 decl, NAME is the initialization string and TYPE_DEP indicates whether
6580 NAME depended on the type of the function. We make use of that to detect
6581 __PRETTY_FUNCTION__ inside a template fn. Because we build a tree for
6582 the function before emitting any of it, we don't need to treat the
6583 VAR_DECL specially. We can decide whether to emit it later, if it was
6587 cp_make_fname_decl (id
, name
, type_dep
)
6592 tree decl
, type
, init
;
6593 size_t length
= strlen (name
);
6594 tree domain
= NULL_TREE
;
6596 if (!processing_template_decl
)
6599 domain
= build_index_type (size_int (length
));
6601 type
= build_cplus_array_type
6602 (build_qualified_type (char_type_node
, TYPE_QUAL_CONST
),
6605 decl
= build_decl (VAR_DECL
, id
, type
);
6606 TREE_STATIC (decl
) = 1;
6607 TREE_READONLY (decl
) = 1;
6608 DECL_SOURCE_LINE (decl
) = 0;
6609 DECL_ARTIFICIAL (decl
) = 1;
6610 DECL_IN_SYSTEM_HEADER (decl
) = 1;
6612 if (processing_template_decl
)
6613 decl
= push_template_decl (decl
);
6616 init
= build (FUNCTION_NAME
, type
);
6617 DECL_PRETTY_FUNCTION_P (decl
) = 1;
6621 init
= build_string (length
+ 1, name
);
6622 TREE_TYPE (init
) = type
;
6624 DECL_INITIAL (decl
) = init
;
6625 cp_finish_decl (decl
, init
, NULL_TREE
, LOOKUP_ONLYCONVERTING
);
6627 /* We will have to make sure we only emit this, if it is actually used. */
6631 /* Entry point for the benefit of c_common_nodes_and_builtins.
6633 Make a definition for a builtin function named NAME and whose data type
6634 is TYPE. TYPE should be a function type with argument types.
6636 CLASS and CODE tell later passes how to compile calls to this function.
6637 See tree.h for possible values.
6639 If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6640 the name to be called if we can't opencode the function. */
6643 builtin_function (name
, type
, code
, class, libname
)
6647 enum built_in_class
class;
6648 const char *libname
;
6650 tree decl
= build_library_fn_1 (get_identifier (name
), ERROR_MARK
, type
);
6651 DECL_BUILT_IN_CLASS (decl
) = class;
6652 DECL_FUNCTION_CODE (decl
) = code
;
6654 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6656 /* All builtins that don't begin with an `_' should go in the `std'
6658 if (flag_honor_std
&& name
[0] != '_')
6660 push_namespace (std_identifier
);
6661 DECL_CONTEXT (decl
) = std_node
;
6664 if (flag_honor_std
&& name
[0] != '_')
6667 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6668 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6669 function in the namespace. */
6671 DECL_ASSEMBLER_NAME (decl
) = get_identifier (libname
);
6672 make_function_rtl (decl
);
6674 /* Warn if a function in the namespace for users
6675 is used without an occasion to consider it declared. */
6676 if (name
[0] != '_' || name
[1] != '_')
6677 DECL_ANTICIPATED (decl
) = 1;
6682 /* Generate a FUNCTION_DECL with the typical flags for a runtime library
6683 function. Not called directly. */
6686 build_library_fn_1 (name
, operator_code
, type
)
6688 enum tree_code operator_code
;
6691 tree fn
= build_lang_decl (FUNCTION_DECL
, name
, type
);
6692 DECL_EXTERNAL (fn
) = 1;
6693 TREE_PUBLIC (fn
) = 1;
6694 DECL_ARTIFICIAL (fn
) = 1;
6695 TREE_NOTHROW (fn
) = 1;
6696 SET_OVERLOADED_OPERATOR_CODE (fn
, operator_code
);
6700 /* Returns the _DECL for a library function with C linkage.
6701 We assume that such functions never throw; if this is incorrect,
6702 callers should unset TREE_NOTHROW. */
6705 build_library_fn (name
, type
)
6709 tree fn
= build_library_fn_1 (name
, ERROR_MARK
, type
);
6710 make_function_rtl (fn
);
6714 /* Returns the _DECL for a library function with C++ linkage. */
6717 build_cp_library_fn (name
, operator_code
, type
)
6719 enum tree_code operator_code
;
6722 tree fn
= build_library_fn_1 (name
, operator_code
, type
);
6723 TREE_NOTHROW (fn
) = TYPE_NOTHROW_P (type
);
6724 DECL_CONTEXT (fn
) = FROB_CONTEXT (current_namespace
);
6725 set_mangled_name_for_decl (fn
);
6726 make_function_rtl (fn
);
6730 /* Like build_library_fn, but takes a C string instead of an
6734 build_library_fn_ptr (name
, type
)
6738 return build_library_fn (get_identifier (name
), type
);
6741 /* Like build_cp_library_fn, but takes a C string instead of an
6745 build_cp_library_fn_ptr (name
, type
)
6749 return build_cp_library_fn (get_identifier (name
), ERROR_MARK
, type
);
6752 /* Like build_library_fn, but also pushes the function so that we will
6753 be able to find it via IDENTIFIER_GLOBAL_VALUE. */
6756 push_library_fn (name
, type
)
6759 tree fn
= build_library_fn (name
, type
);
6760 pushdecl_top_level (fn
);
6764 /* Like build_cp_library_fn, but also pushes the function so that it
6765 will be found by normal lookup. */
6768 push_cp_library_fn (operator_code
, type
)
6769 enum tree_code operator_code
;
6772 tree fn
= build_cp_library_fn (ansi_opname (operator_code
),
6779 /* Like push_library_fn, but takes a TREE_LIST of parm types rather than
6783 push_void_library_fn (name
, parmtypes
)
6784 tree name
, parmtypes
;
6786 tree type
= build_function_type (void_type_node
, parmtypes
);
6787 return push_library_fn (name
, type
);
6790 /* Like push_library_fn, but also note that this function throws
6791 and does not return. Used for __throw_foo and the like. */
6794 push_throw_library_fn (name
, type
)
6797 tree fn
= push_library_fn (name
, type
);
6798 TREE_THIS_VOLATILE (fn
) = 1;
6799 TREE_NOTHROW (fn
) = 0;
6803 /* When we call finish_struct for an anonymous union, we create
6804 default copy constructors and such. But, an anonymous union
6805 shouldn't have such things; this function undoes the damage to the
6806 anonymous union type T.
6808 (The reason that we create the synthesized methods is that we don't
6809 distinguish `union { int i; }' from `typedef union { int i; } U'.
6810 The first is an anonymous union; the second is just an ordinary
6814 fixup_anonymous_aggr (t
)
6819 /* Wipe out memory of synthesized methods */
6820 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6821 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6822 TYPE_HAS_INIT_REF (t
) = 0;
6823 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6824 TYPE_HAS_ASSIGN_REF (t
) = 0;
6825 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6827 /* Splice the implicitly generated functions out of the TYPE_METHODS
6829 q
= &TYPE_METHODS (t
);
6832 if (DECL_ARTIFICIAL (*q
))
6833 *q
= TREE_CHAIN (*q
);
6835 q
= &TREE_CHAIN (*q
);
6838 /* ISO C++ 9.5.3. Anonymous unions may not have function members. */
6839 if (TYPE_METHODS (t
))
6840 error ("an anonymous union cannot have function members");
6843 /* Make sure that a declaration with no declarator is well-formed, i.e.
6844 just defines a tagged type or anonymous union.
6846 Returns the type defined, if any. */
6849 check_tag_decl (declspecs
)
6854 tree ob_modifier
= NULL_TREE
;
6856 register tree t
= NULL_TREE
;
6858 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6860 register tree value
= TREE_VALUE (link
);
6863 || (TREE_CODE (value
) == IDENTIFIER_NODE
6864 && IDENTIFIER_GLOBAL_VALUE (value
)
6865 && TYPE_P (IDENTIFIER_GLOBAL_VALUE (value
))))
6869 if ((TREE_CODE (value
) != TYPENAME_TYPE
&& IS_AGGR_TYPE (value
))
6870 || TREE_CODE (value
) == ENUMERAL_TYPE
)
6872 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6876 else if (value
== ridpointers
[(int) RID_FRIEND
])
6878 if (current_class_type
== NULL_TREE
6879 || current_scope () != current_class_type
)
6880 ob_modifier
= value
;
6884 else if (value
== ridpointers
[(int) RID_STATIC
]
6885 || value
== ridpointers
[(int) RID_EXTERN
]
6886 || value
== ridpointers
[(int) RID_AUTO
]
6887 || value
== ridpointers
[(int) RID_REGISTER
]
6888 || value
== ridpointers
[(int) RID_INLINE
]
6889 || value
== ridpointers
[(int) RID_VIRTUAL
]
6890 || value
== ridpointers
[(int) RID_CONST
]
6891 || value
== ridpointers
[(int) RID_VOLATILE
]
6892 || value
== ridpointers
[(int) RID_EXPLICIT
])
6893 ob_modifier
= value
;
6897 error ("multiple types in one declaration");
6899 if (t
== NULL_TREE
&& ! saw_friend
)
6900 pedwarn ("declaration does not declare anything");
6902 /* Check for an anonymous union. We're careful
6903 accessing TYPE_IDENTIFIER because some built-in types, like
6904 pointer-to-member types, do not have TYPE_NAME. */
6905 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
6907 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
6909 /* Anonymous unions are objects, so they can have specifiers. */;
6910 SET_ANON_AGGR_TYPE_P (t
);
6912 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
6913 pedwarn ("ISO C++ prohibits anonymous structs");
6916 else if (ob_modifier
)
6918 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
6919 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
6920 cp_error ("`%D' can only be specified for functions", ob_modifier
);
6921 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
6922 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
6923 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
6924 cp_error ("`%D' can only be specified for constructors",
6927 cp_error ("`%D' can only be specified for objects and functions",
6934 /* Called when a declaration is seen that contains no names to declare.
6935 If its type is a reference to a structure, union or enum inherited
6936 from a containing scope, shadow that tag name for the current scope
6937 with a forward reference.
6938 If its type defines a new named structure or union
6939 or defines an enum, it is valid but we need not do anything here.
6940 Otherwise, it is an error.
6942 C++: may have to grok the declspecs to learn about static,
6943 complain for anonymous unions. */
6946 shadow_tag (declspecs
)
6949 tree t
= check_tag_decl (declspecs
);
6952 maybe_process_partial_specialization (t
);
6954 /* This is where the variables in an anonymous union are
6955 declared. An anonymous union declaration looks like:
6957 because there is no declarator after the union, the parser
6958 sends that declaration here. */
6959 if (t
&& ANON_AGGR_TYPE_P (t
))
6961 fixup_anonymous_aggr (t
);
6963 if (TYPE_FIELDS (t
))
6965 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
6967 finish_anon_union (decl
);
6972 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6975 groktypename (typename
)
6978 if (TREE_CODE (typename
) != TREE_LIST
)
6980 return grokdeclarator (TREE_VALUE (typename
),
6981 TREE_PURPOSE (typename
),
6982 TYPENAME
, 0, NULL_TREE
);
6985 /* Decode a declarator in an ordinary declaration or data definition.
6986 This is called as soon as the type information and variable name
6987 have been parsed, before parsing the initializer if any.
6988 Here we create the ..._DECL node, fill in its type,
6989 and put it on the list of decls for the current context.
6990 The ..._DECL node is returned as the value.
6992 Exception: for arrays where the length is not specified,
6993 the type is left null, to be filled in by `cp_finish_decl'.
6995 Function definitions do not come here; they go to start_function
6996 instead. However, external and forward declarations of functions
6997 do go through here. Structure field declarations are done by
6998 grokfield and not through here. */
7001 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
7002 tree declarator
, declspecs
;
7004 tree attributes
, prefix_attributes
;
7007 register tree type
, tem
;
7009 extern int have_extern_spec
;
7010 extern int used_extern_spec
;
7014 /* See code below that used this. */
7015 int init_written
= initialized
;
7018 /* This should only be done once on the top most decl. */
7019 if (have_extern_spec
&& !used_extern_spec
)
7021 declspecs
= tree_cons (NULL_TREE
, get_identifier ("extern"),
7023 used_extern_spec
= 1;
7026 if (attributes
|| prefix_attributes
)
7027 attrlist
= build_tree_list (attributes
, prefix_attributes
);
7029 attrlist
= NULL_TREE
;
7031 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
7034 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
7037 type
= TREE_TYPE (decl
);
7039 if (type
== error_mark_node
)
7042 context
= DECL_CONTEXT (decl
);
7044 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
7045 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
7047 /* When parsing the initializer, lookup should use the object's
7049 push_decl_namespace (context
);
7052 /* We are only interested in class contexts, later. */
7053 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
7054 context
= NULL_TREE
;
7057 /* Is it valid for this decl to have an initializer at all?
7058 If not, set INITIALIZED to zero, which will indirectly
7059 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7060 switch (TREE_CODE (decl
))
7063 /* typedef foo = bar means give foo the same type as bar.
7064 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
7065 Any other case of an initialization in a TYPE_DECL is an error. */
7066 if (pedantic
|| list_length (declspecs
) > 1)
7068 cp_error ("typedef `%D' is initialized", decl
);
7074 cp_error ("function `%#D' is initialized like a variable", decl
);
7084 if (! toplevel_bindings_p ()
7085 && DECL_EXTERNAL (decl
))
7086 cp_warning ("declaration of `%#D' has `extern' and is initialized",
7088 DECL_EXTERNAL (decl
) = 0;
7089 if (toplevel_bindings_p ())
7090 TREE_STATIC (decl
) = 1;
7092 /* Tell `pushdecl' this is an initialized decl
7093 even though we don't yet have the initializer expression.
7094 Also tell `cp_finish_decl' it may store the real initializer. */
7095 DECL_INITIAL (decl
) = error_mark_node
;
7098 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
7099 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
7102 /* Set attributes here so if duplicate decl, will have proper attributes. */
7103 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
7105 if (context
&& COMPLETE_TYPE_P (complete_type (context
)))
7107 push_nested_class (context
, 2);
7109 if (TREE_CODE (decl
) == VAR_DECL
)
7111 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
7112 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
7113 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
7116 if (DECL_CONTEXT (field
) != context
)
7118 cp_pedwarn ("ISO C++ does not permit `%T::%D' to be defined as `%T::%D'",
7119 DECL_CONTEXT (field
), DECL_NAME (decl
),
7120 context
, DECL_NAME (decl
));
7121 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
7123 /* Static data member are tricky; an in-class initialization
7124 still doesn't provide a definition, so the in-class
7125 declaration will have DECL_EXTERNAL set, but will have an
7126 initialization. Thus, duplicate_decls won't warn
7127 about this situation, and so we check here. */
7128 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
7129 cp_error ("duplicate initialization of %D", decl
);
7130 if (duplicate_decls (decl
, field
))
7136 tree field
= check_classfn (context
, decl
);
7137 if (field
&& duplicate_decls (decl
, field
))
7141 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
7142 DECL_IN_AGGR_P (decl
) = 0;
7143 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
7144 || CLASSTYPE_TEMPLATE_INSTANTIATION (context
))
7146 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
7147 /* [temp.expl.spec] An explicit specialization of a static data
7148 member of a template is a definition if the declaration
7149 includes an initializer; otherwise, it is a declaration.
7151 We check for processing_specialization so this only applies
7152 to the new specialization syntax. */
7153 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
7154 DECL_EXTERNAL (decl
) = 1;
7157 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
7158 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
7162 /* Enter this declaration into the symbol table. */
7163 tem
= maybe_push_decl (decl
);
7165 if (processing_template_decl
)
7166 tem
= push_template_decl (tem
);
7168 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7169 /* Tell the back-end to use or not use .common as appropriate. If we say
7170 -fconserve-space, we want this to save .data space, at the expense of
7171 wrong semantics. If we say -fno-conserve-space, we want this to
7172 produce errors about redefs; to do this we force variables into the
7174 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
7177 if (! processing_template_decl
)
7187 tree type
= TREE_TYPE (decl
);
7188 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
7190 if (type
== error_mark_node
)
7193 /* If this type of object needs a cleanup, but we're not allowed to
7194 add any more objects with cleanups to the current scope, create a
7195 new binding level. */
7196 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
7197 && current_binding_level
->more_cleanups_ok
== 0)
7199 keep_next_level (2);
7202 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/1);
7206 /* Is it valid for this decl to have an initializer at all?
7207 If not, set INITIALIZED to zero, which will indirectly
7208 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7210 /* Don't allow initializations for incomplete types except for
7211 arrays which might be completed by the initialization. */
7212 if (COMPLETE_TYPE_P (complete_type (type
)))
7213 ; /* A complete type is ok. */
7214 else if (TREE_CODE (type
) != ARRAY_TYPE
)
7216 cp_error ("variable `%#D' has initializer but incomplete type",
7219 type
= TREE_TYPE (decl
) = error_mark_node
;
7221 else if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (type
))))
7223 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
7224 cp_error ("elements of array `%#D' have incomplete type", decl
);
7225 /* else we already gave an error in start_decl. */
7231 && TREE_CODE (decl
) != TYPE_DECL
7232 && TREE_CODE (decl
) != TEMPLATE_DECL
7233 && type
!= error_mark_node
7234 && IS_AGGR_TYPE (type
)
7235 && ! DECL_EXTERNAL (decl
))
7237 if ((! processing_template_decl
|| ! uses_template_parms (type
))
7238 && !COMPLETE_TYPE_P (complete_type (type
)))
7240 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
7242 /* Change the type so that assemble_variable will give
7243 DECL an rtl we can live with: (mem (const_int 0)). */
7244 type
= TREE_TYPE (decl
) = error_mark_node
;
7248 /* If any base type in the hierarchy of TYPE needs a constructor,
7249 then we set initialized to 1. This way any nodes which are
7250 created for the purposes of initializing this aggregate
7251 will live as long as it does. This is necessary for global
7252 aggregates which do not have their initializers processed until
7253 the end of the file. */
7254 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
7259 DECL_INITIAL (decl
) = NULL_TREE
;
7262 /* Handle initialization of references.
7263 These three arguments are from `cp_finish_decl', and have the
7264 same meaning here that they do there.
7266 Quotes on semantics can be found in ARM 8.4.3. */
7269 grok_reference_init (decl
, type
, init
)
7270 tree decl
, type
, init
;
7274 if (init
== NULL_TREE
)
7276 if ((DECL_LANG_SPECIFIC (decl
) == 0
7277 || DECL_IN_AGGR_P (decl
) == 0)
7278 && ! DECL_THIS_EXTERN (decl
))
7279 cp_error ("`%D' declared as reference but not initialized", decl
);
7283 if (init
== error_mark_node
)
7286 if (TREE_CODE (init
) == CONSTRUCTOR
)
7288 cp_error ("ISO C++ forbids use of initializer list to initialize reference `%D'", decl
);
7292 if (TREE_CODE (init
) == TREE_LIST
)
7293 init
= build_compound_expr (init
);
7295 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
7296 init
= convert_from_reference (init
);
7298 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
7299 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
7301 /* Note: default conversion is only called in very special cases. */
7302 init
= default_conversion (init
);
7305 /* Convert INIT to the reference type TYPE. This may involve the
7306 creation of a temporary, whose lifetime must be the same as that
7307 of the reference. If so, a DECL_STMT for the temporary will be
7308 added just after the DECL_STMT for DECL. That's why we don't set
7309 DECL_INITIAL for local references (instead assigning to them
7310 explicitly); we need to allow the temporary to be initialized
7312 tmp
= convert_to_reference
7313 (type
, init
, CONV_IMPLICIT
,
7314 LOOKUP_ONLYCONVERTING
|LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
,
7317 if (tmp
== error_mark_node
)
7319 else if (tmp
!= NULL_TREE
)
7322 tmp
= save_expr (tmp
);
7323 if (building_stmt_tree ())
7325 /* Initialize the declaration. */
7326 tmp
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, tmp
);
7327 finish_expr_stmt (tmp
);
7330 DECL_INITIAL (decl
) = tmp
;
7334 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7338 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
7340 expand_static_init (decl
, DECL_INITIAL (decl
));
7341 DECL_INITIAL (decl
) = NULL_TREE
;
7346 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7347 mucking with forces it does not comprehend (i.e. initialization with a
7348 constructor). If we are at global scope and won't go into COMMON, fill
7349 it in with a dummy CONSTRUCTOR to force the variable into .data;
7350 otherwise we can use error_mark_node. */
7353 obscure_complex_init (decl
, init
)
7356 if (! flag_no_inline
&& TREE_STATIC (decl
))
7358 if (extract_init (decl
, init
))
7362 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7363 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7364 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7368 DECL_INITIAL (decl
) = error_mark_node
;
7373 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7374 array until we finish parsing the initializer. If that's the
7375 situation we're in, update DECL accordingly. */
7378 maybe_deduce_size_from_array_init (decl
, init
)
7382 tree type
= TREE_TYPE (decl
);
7384 if (TREE_CODE (type
) == ARRAY_TYPE
7385 && TYPE_DOMAIN (type
) == NULL_TREE
7386 && TREE_CODE (decl
) != TYPE_DECL
)
7388 /* do_default is really a C-ism to deal with tentative definitions.
7389 But let's leave it here to ease the eventual merge. */
7390 int do_default
= !DECL_EXTERNAL (decl
);
7391 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7392 int failure
= complete_array_type (type
, initializer
, do_default
);
7395 cp_error ("initializer fails to determine size of `%D'", decl
);
7400 cp_error ("array size missing in `%D'", decl
);
7401 /* If a `static' var's size isn't known, make it extern as
7402 well as static, so it does not get allocated. If it's not
7403 `static', then don't mark it extern; finish_incomplete_decl
7404 will give it a default size and it will get allocated. */
7405 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7406 DECL_EXTERNAL (decl
) = 1;
7409 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7410 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7412 cp_error ("zero-size array `%D'", decl
);
7414 layout_decl (decl
, 0);
7418 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7419 any appropriate error messages regarding the layout. */
7422 layout_var_decl (decl
)
7425 tree type
= TREE_TYPE (decl
);
7427 tree ttype
= target_type (type
);
7430 /* If we haven't already layed out this declaration, do so now.
7431 Note that we must not call complete type for an external object
7432 because it's type might involve templates that we are not
7433 supposed to isntantiate yet. (And it's perfectly legal to say
7434 `extern X x' for some incomplete type `X'.) */
7435 if (!DECL_EXTERNAL (decl
))
7436 complete_type (type
);
7437 if (!DECL_SIZE (decl
) && COMPLETE_TYPE_P (type
))
7438 layout_decl (decl
, 0);
7440 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7442 /* An automatic variable with an incomplete type: that is an error.
7443 Don't talk about array types here, since we took care of that
7444 message in grokdeclarator. */
7445 cp_error ("storage size of `%D' isn't known", decl
);
7446 TREE_TYPE (decl
) = error_mark_node
;
7449 /* Keep this code around in case we later want to control debug info
7450 based on whether a type is "used". (jason 1999-11-11) */
7452 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7453 /* Let debugger know it should output info for this type. */
7454 note_debug_info_needed (ttype
);
7456 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7457 note_debug_info_needed (DECL_CONTEXT (decl
));
7460 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7461 && DECL_SIZE (decl
) != NULL_TREE
7462 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7464 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7465 constant_expression_warning (DECL_SIZE (decl
));
7467 cp_error ("storage size of `%D' isn't constant", decl
);
7471 /* If a local static variable is declared in an inline function, or if
7472 we have a weak definition, we must endeavor to create only one
7473 instance of the variable at link-time. */
7476 maybe_commonize_var (decl
)
7479 /* Static data in a function with comdat linkage also has comdat
7481 if (TREE_STATIC (decl
)
7482 /* Don't mess with __FUNCTION__. */
7483 && ! DECL_ARTIFICIAL (decl
)
7484 && current_function_decl
7485 && DECL_CONTEXT (decl
) == current_function_decl
7486 && (DECL_THIS_INLINE (current_function_decl
)
7487 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7488 && TREE_PUBLIC (current_function_decl
))
7490 /* Rather than try to get this right with inlining, we suppress
7491 inlining of such functions. */
7492 current_function_cannot_inline
7493 = "function with static variable cannot be inline";
7494 DECL_UNINLINABLE (current_function_decl
) = 1;
7496 /* If flag_weak, we don't need to mess with this, as we can just
7497 make the function weak, and let it refer to its unique local
7498 copy. This works because we don't allow the function to be
7502 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7504 TREE_PUBLIC (decl
) = 1;
7505 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7507 else if (DECL_INITIAL (decl
) == NULL_TREE
7508 || DECL_INITIAL (decl
) == error_mark_node
)
7510 TREE_PUBLIC (decl
) = 1;
7511 DECL_COMMON (decl
) = 1;
7513 /* else we lose. We can only do this if we can use common,
7514 which we can't if it has been initialized. */
7516 if (TREE_PUBLIC (decl
))
7517 DECL_ASSEMBLER_NAME (decl
)
7518 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7521 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7522 cp_warning_at (" you can work around this by removing the initializer", decl
);
7526 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7527 /* Set it up again; we might have set DECL_INITIAL since the last
7529 comdat_linkage (decl
);
7532 /* Issue an error message if DECL is an uninitialized const variable. */
7535 check_for_uninitialized_const_var (decl
)
7538 tree type
= TREE_TYPE (decl
);
7540 /* ``Unless explicitly declared extern, a const object does not have
7541 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7543 if (TREE_CODE (decl
) == VAR_DECL
7544 && TREE_CODE (type
) != REFERENCE_TYPE
7545 && CP_TYPE_CONST_P (type
)
7546 && !TYPE_NEEDS_CONSTRUCTING (type
)
7547 && !DECL_INITIAL (decl
))
7548 cp_error ("uninitialized const `%D'", decl
);
7551 /* Verify INIT (the initializer for DECL), and record the
7552 initialization in DECL_INITIAL, if appropriate. Returns a new
7556 check_initializer (decl
, init
)
7562 if (TREE_CODE (decl
) == FIELD_DECL
)
7565 type
= TREE_TYPE (decl
);
7567 /* If `start_decl' didn't like having an initialization, ignore it now. */
7568 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7571 /* Check the initializer. */
7574 /* Things that are going to be initialized need to have complete
7576 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7578 if (type
== error_mark_node
)
7579 /* We will have already complained. */
7581 else if (COMPLETE_TYPE_P (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7583 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7586 else if (TREE_CODE (type
) == ARRAY_TYPE
7587 && !COMPLETE_TYPE_P (TREE_TYPE (type
)))
7589 cp_error ("elements of array `%#D' have incomplete type", decl
);
7592 else if (!COMPLETE_TYPE_P (type
))
7594 cp_error ("`%D' has incomplete type", decl
);
7595 TREE_TYPE (decl
) = error_mark_node
;
7600 if (TREE_CODE (decl
) == CONST_DECL
)
7602 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7604 DECL_INITIAL (decl
) = init
;
7606 /* This will keep us from needing to worry about our obstacks. */
7607 my_friendly_assert (init
!= NULL_TREE
, 149);
7610 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7612 if (TREE_STATIC (decl
))
7613 make_decl_rtl (decl
, NULL_PTR
, toplevel_bindings_p ());
7614 grok_reference_init (decl
, type
, init
);
7619 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7621 if (TREE_CODE (type
) == ARRAY_TYPE
)
7622 init
= digest_init (type
, init
, (tree
*) 0);
7623 else if (TREE_CODE (init
) == CONSTRUCTOR
7624 && TREE_HAS_CONSTRUCTOR (init
))
7626 if (TYPE_NON_AGGREGATE_CLASS (type
))
7628 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7630 init
= error_mark_node
;
7633 goto dont_use_constructor
;
7638 dont_use_constructor
:
7639 if (TREE_CODE (init
) != TREE_VEC
)
7640 init
= store_init_value (decl
, init
);
7644 /* We must hide the initializer so that expand_decl
7645 won't try to do something it does not understand. */
7646 init
= obscure_complex_init (decl
, init
);
7648 else if (DECL_EXTERNAL (decl
))
7650 else if (TYPE_P (type
)
7651 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7653 tree core_type
= strip_array_types (type
);
7655 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7657 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7658 cp_error ("structure `%D' with uninitialized const members", decl
);
7659 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7660 cp_error ("structure `%D' with uninitialized reference members",
7664 check_for_uninitialized_const_var (decl
);
7666 if (COMPLETE_TYPE_P (type
) && TYPE_NEEDS_CONSTRUCTING (type
))
7667 init
= obscure_complex_init (decl
, NULL_TREE
);
7671 check_for_uninitialized_const_var (decl
);
7676 /* If DECL is not a local variable, give it RTL. */
7679 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
7682 const char *asmspec
;
7684 int toplev
= toplevel_bindings_p ();
7687 /* Handle non-variables up front. */
7688 if (TREE_CODE (decl
) != VAR_DECL
)
7690 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7694 /* If we see a class member here, it should be a static data
7696 if (DECL_LANG_SPECIFIC (decl
) && DECL_IN_AGGR_P (decl
))
7698 my_friendly_assert (TREE_STATIC (decl
), 19990828);
7699 /* An in-class declaration of a static data member should be
7700 external; it is only a declaration, and not a definition. */
7701 if (init
== NULL_TREE
)
7702 my_friendly_assert (DECL_EXTERNAL (decl
), 20000723);
7705 /* Set the DECL_ASSEMBLER_NAME for the variable. */
7707 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7709 /* We don't create any RTL for local variables. */
7710 if (DECL_FUNCTION_SCOPE_P (decl
) && !TREE_STATIC (decl
))
7713 /* We defer emission of local statics until the corresponding
7714 DECL_STMT is expanded. */
7715 defer_p
= DECL_FUNCTION_SCOPE_P (decl
) || DECL_VIRTUAL_P (decl
);
7717 /* We try to defer namespace-scope static constants so that they are
7718 not emitted into the object file unncessarily. */
7719 if (!DECL_VIRTUAL_P (decl
)
7720 && TREE_READONLY (decl
)
7721 && DECL_INITIAL (decl
) != NULL_TREE
7722 && DECL_INITIAL (decl
) != error_mark_node
7723 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
))
7725 && !TREE_PUBLIC (decl
))
7727 /* Fool with the linkage according to #pragma interface. */
7728 if (!interface_unknown
)
7730 TREE_PUBLIC (decl
) = 1;
7731 DECL_EXTERNAL (decl
) = interface_only
;
7737 /* If we're deferring the variable, just make RTL. Do not actually
7738 emit the variable. */
7740 make_decl_rtl (decl
, asmspec
, toplev
);
7741 /* If we're not deferring, go ahead and assemble the variable. */
7743 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7746 /* The old ARM scoping rules injected variables declared in the
7747 initialization statement of a for-statement into the surrounding
7748 scope. We support this usage, in order to be backward-compatible.
7749 DECL is a just-declared VAR_DECL; if necessary inject its
7750 declaration into the surrounding scope. */
7753 maybe_inject_for_scope_var (decl
)
7756 if (!DECL_NAME (decl
))
7759 if (current_binding_level
->is_for_scope
)
7761 struct binding_level
*outer
7762 = current_binding_level
->level_chain
;
7764 /* Check to see if the same name is already bound at the outer
7765 level, either because it was directly declared, or because a
7766 dead for-decl got preserved. In either case, the code would
7767 not have been valid under the ARM scope rules, so clear
7768 is_for_scope for the current_binding_level.
7770 Otherwise, we need to preserve the temp slot for decl to last
7771 into the outer binding level. */
7774 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7776 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7777 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7779 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7781 BINDING_VALUE (outer_binding
)
7782 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7783 current_binding_level
->is_for_scope
= 0;
7785 else if (DECL_IN_MEMORY_P (decl
))
7786 preserve_temp_slots (DECL_RTL (decl
));
7790 /* Generate code to initialize DECL (a local variable). */
7793 initialize_local_var (decl
, init
, flags
)
7798 tree type
= TREE_TYPE (decl
);
7800 /* If the type is bogus, don't bother initializing the variable. */
7801 if (type
== error_mark_node
)
7804 if (DECL_SIZE (decl
) == NULL_TREE
&& !TREE_STATIC (decl
))
7806 /* If we used it already as memory, it must stay in memory. */
7807 DECL_INITIAL (decl
) = NULL_TREE
;
7808 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7811 /* Local statics are handled differently from ordinary automatic
7813 if (TREE_STATIC (decl
))
7815 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7816 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7817 expand_static_init (decl
, init
);
7821 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7825 /* Compute and store the initial value. */
7826 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7828 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7830 int saved_stmts_are_full_exprs_p
;
7832 my_friendly_assert (building_stmt_tree (), 20000906);
7833 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p ();
7834 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
7835 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7836 current_stmt_tree ()->stmts_are_full_exprs_p
=
7837 saved_stmts_are_full_exprs_p
;
7840 /* Set this to 0 so we can tell whether an aggregate which was
7841 initialized was ever used. Don't do this if it has a
7842 destructor, so we don't complain about the 'resource
7843 allocation is initialization' idiom. Now set
7844 attribute((unused)) on types so decls of that type will be
7845 marked used. (see TREE_USED, above.) */
7846 if (TYPE_NEEDS_CONSTRUCTING (type
)
7848 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type
)
7849 && DECL_NAME (decl
))
7850 TREE_USED (decl
) = 0;
7851 else if (already_used
)
7852 TREE_USED (decl
) = 1;
7856 /* Generate code to destroy DECL (a local variable). */
7859 destroy_local_var (decl
)
7862 tree type
= TREE_TYPE (decl
);
7865 /* Only variables get cleaned up. */
7866 if (TREE_CODE (decl
) != VAR_DECL
)
7869 /* And only things with destructors need cleaning up. */
7870 if (type
== error_mark_node
7871 || TYPE_HAS_TRIVIAL_DESTRUCTOR (type
))
7874 if (TREE_CODE (decl
) == VAR_DECL
&&
7875 (DECL_EXTERNAL (decl
) || TREE_STATIC (decl
)))
7876 /* We don't clean up things that aren't defined in this
7877 translation unit, or that need a static cleanup. The latter
7878 are handled by finish_file. */
7881 /* Compute the cleanup. */
7882 cleanup
= maybe_build_cleanup (decl
);
7884 /* Record the cleanup required for this declaration. */
7885 if (DECL_SIZE (decl
) && TREE_TYPE (decl
) != error_mark_node
7887 finish_decl_cleanup (decl
, cleanup
);
7890 /* Finish processing of a declaration;
7891 install its line number and initial value.
7892 If the length of an array type is not known before,
7893 it must be determined now, from the initial value, or it is an error.
7895 INIT holds the value of an initializer that should be allowed to escape
7898 FLAGS is LOOKUP_ONLYCONVERTING if the = init syntax was used, else 0
7899 if the (init) syntax was used. */
7902 cp_finish_decl (decl
, init
, asmspec_tree
, flags
)
7908 tree ttype
= NULL_TREE
;
7909 const char *asmspec
= NULL
;
7910 int was_readonly
= 0;
7915 error ("assignment (not initialization) in declaration");
7919 /* If a name was specified, get the string. */
7921 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
7923 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
7925 cp_error ("cannot initialize `%D' to namespace `%D'",
7930 if (current_class_type
7931 && CP_DECL_CONTEXT (decl
) == current_class_type
7932 && TYPE_BEING_DEFINED (current_class_type
)
7933 && (DECL_INITIAL (decl
) || init
))
7934 DECL_DEFINED_IN_CLASS_P (decl
) = 1;
7936 if (TREE_CODE (decl
) == VAR_DECL
7937 && DECL_CONTEXT (decl
)
7938 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7939 && DECL_CONTEXT (decl
) != current_namespace
7942 /* Leave the namespace of the object. */
7943 pop_decl_namespace ();
7946 type
= TREE_TYPE (decl
);
7948 if (type
== error_mark_node
)
7951 /* Add this declaration to the statement-tree. */
7952 if (building_stmt_tree ()
7953 && at_function_scope_p ()
7954 && TREE_CODE (decl
) != RESULT_DECL
)
7955 add_decl_stmt (decl
);
7957 if (TYPE_HAS_MUTABLE_P (type
))
7958 TREE_READONLY (decl
) = 0;
7960 if (processing_template_decl
)
7962 if (init
&& DECL_INITIAL (decl
))
7963 DECL_INITIAL (decl
) = init
;
7967 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
7968 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
7970 /* Take care of TYPE_DECLs up front. */
7971 if (TREE_CODE (decl
) == TYPE_DECL
)
7973 if (init
&& DECL_INITIAL (decl
))
7975 /* typedef foo = bar; store the type of bar as the type of foo. */
7976 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
7977 DECL_INITIAL (decl
) = init
= NULL_TREE
;
7979 if (type
!= error_mark_node
7980 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
7982 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
7983 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
7984 set_identifier_type_value (DECL_NAME (decl
), type
);
7985 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
7987 GNU_xref_decl (current_function_decl
, decl
);
7989 /* If we have installed this as the canonical typedef for this
7990 type, and that type has not been defined yet, delay emitting
7991 the debug information for it, as we will emit it later. */
7992 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
7993 && !COMPLETE_TYPE_P (TREE_TYPE (decl
)))
7994 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
7996 rest_of_decl_compilation (decl
, NULL_PTR
,
7997 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
8001 if (TREE_CODE (decl
) != FUNCTION_DECL
)
8002 ttype
= target_type (type
);
8004 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
8005 && TYPE_NEEDS_CONSTRUCTING (type
))
8007 /* Currently, GNU C++ puts constants in text space, making them
8008 impossible to initialize. In the future, one would hope for
8009 an operating system which understood the difference between
8010 initialization and the running of a program. */
8012 TREE_READONLY (decl
) = 0;
8015 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
8017 /* This must override the asm specifier which was placed by
8018 grokclassfn. Lay this out fresh. */
8019 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
8020 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
8021 make_decl_rtl (decl
, asmspec
, 0);
8024 /* Deduce size of array from initialization, if not already known. */
8025 maybe_deduce_size_from_array_init (decl
, init
);
8026 init
= check_initializer (decl
, init
);
8028 GNU_xref_decl (current_function_decl
, decl
);
8030 if (TREE_CODE (decl
) == VAR_DECL
)
8031 layout_var_decl (decl
);
8033 /* Output the assembler code and/or RTL code for variables and functions,
8034 unless the type is an undefined structure or union.
8035 If not, it will get done when the type is completed. */
8036 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
8037 || TREE_CODE (decl
) == RESULT_DECL
)
8039 if (TREE_CODE (decl
) == VAR_DECL
)
8040 maybe_commonize_var (decl
);
8042 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
8044 if (TREE_CODE (type
) == FUNCTION_TYPE
8045 || TREE_CODE (type
) == METHOD_TYPE
)
8046 abstract_virtuals_error (decl
,
8047 strip_array_types (TREE_TYPE (type
)));
8049 abstract_virtuals_error (decl
, strip_array_types (type
));
8051 if (TREE_CODE (decl
) == FUNCTION_DECL
)
8053 else if (DECL_EXTERNAL (decl
)
8054 && ! (DECL_LANG_SPECIFIC (decl
)
8055 && DECL_NOT_REALLY_EXTERN (decl
)))
8058 DECL_INITIAL (decl
) = init
;
8060 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
8062 /* This is a local declaration. */
8063 if (doing_semantic_analysis_p ())
8064 maybe_inject_for_scope_var (decl
);
8065 /* Initialize the local variable. But, if we're building a
8066 statement-tree, we'll do the initialization when we
8068 if (processing_template_decl
)
8070 if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
8071 DECL_INITIAL (decl
) = init
;
8075 /* If we're not building RTL, then we need to do so
8077 my_friendly_assert (building_stmt_tree (), 20000906);
8078 /* Initialize the variable. */
8079 initialize_local_var (decl
, init
, flags
);
8080 /* Clean up the variable. */
8081 destroy_local_var (decl
);
8084 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
8086 /* Cleanups for static variables are handled by `finish_file'. */
8087 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
8088 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
8089 expand_static_init (decl
, init
);
8093 /* Undo call to `pushclass' that was done in `start_decl'
8094 due to initialization of qualified member variable.
8095 I.e., Foo::x = 10; */
8097 tree context
= CP_DECL_CONTEXT (decl
);
8100 && (TREE_CODE (decl
) == VAR_DECL
8101 /* We also have a pushclass done that we need to undo here
8102 if we're at top level and declare a method. */
8103 || TREE_CODE (decl
) == FUNCTION_DECL
)
8104 /* If size hasn't been set, we're still defining it,
8105 and therefore inside the class body; don't pop
8106 the binding level.. */
8107 && COMPLETE_TYPE_P (context
)
8108 && context
== current_class_type
)
8109 pop_nested_class ();
8116 TREE_READONLY (decl
) = 1;
8119 /* This is here for a midend callback from c-common.c */
8122 finish_decl (decl
, init
, asmspec_tree
)
8126 cp_finish_decl (decl
, init
, asmspec_tree
, 0);
8129 /* Returns a declaration for a VAR_DECL as if:
8131 extern "C" TYPE NAME;
8133 had been seen. Used to create compiler-generated global
8137 declare_global_var (name
, type
)
8143 push_to_top_level ();
8144 decl
= build_decl (VAR_DECL
, name
, type
);
8145 TREE_PUBLIC (decl
) = 1;
8146 DECL_EXTERNAL (decl
) = 1;
8147 DECL_ARTIFICIAL (decl
) = 1;
8149 cp_finish_decl (decl
, NULL_TREE
, NULL_TREE
, 0);
8150 pop_from_top_level ();
8155 /* Returns a pointer to the `atexit' function. Note that if
8156 FLAG_USE_CXA_ATEXIT is non-zero, then this will actually be the new
8157 `__cxa_atexit' function specified in the IA64 C++ ABI. */
8171 if (flag_use_cxa_atexit
)
8173 /* The declaration for `__cxa_atexit' is:
8175 int __cxa_atexit (void (*)(void *), void *, void *)
8177 We build up the argument types and then then function type
8180 /* First, build the pointer-to-function type for the first
8182 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8183 fn_type
= build_function_type (void_type_node
, arg_types
);
8184 fn_ptr_type
= build_pointer_type (fn_type
);
8185 /* Then, build the rest of the argument types. */
8186 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8187 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, arg_types
);
8188 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, arg_types
);
8189 /* And the final __cxa_atexit type. */
8190 fn_type
= build_function_type (integer_type_node
, arg_types
);
8191 fn_ptr_type
= build_pointer_type (fn_type
);
8192 name
= "__cxa_atexit";
8196 /* The declaration for `atexit' is:
8198 int atexit (void (*)());
8200 We build up the argument types and then then function type
8202 fn_type
= build_function_type (void_type_node
, void_list_node
);
8203 fn_ptr_type
= build_pointer_type (fn_type
);
8204 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, void_list_node
);
8205 /* Build the final atexit type. */
8206 fn_type
= build_function_type (integer_type_node
, arg_types
);
8210 /* Now, build the function declaration. */
8211 push_lang_context (lang_name_c
);
8212 atexit_fndecl
= build_library_fn_ptr (name
, fn_type
);
8213 mark_used (atexit_fndecl
);
8214 pop_lang_context ();
8215 atexit_node
= default_conversion (atexit_fndecl
);
8220 /* Returns the __dso_handle VAR_DECL. */
8223 get_dso_handle_node ()
8225 if (dso_handle_node
)
8226 return dso_handle_node
;
8228 /* Declare the variable. */
8229 dso_handle_node
= declare_global_var (get_identifier ("__dso_handle"),
8232 return dso_handle_node
;
8235 /* Begin a new function with internal linkage whose job will be simply
8236 to destroy some particular variable. */
8241 static int counter
= 0;
8242 int old_interface_unknown
= interface_unknown
;
8248 push_to_top_level ();
8250 /* No need to mangle this. */
8251 push_lang_context (lang_name_c
);
8253 interface_unknown
= 1;
8255 /* Build the parameter-types. */
8256 parmtypes
= void_list_node
;
8257 /* Functions passed to __cxa_atexit take an additional parameter.
8258 We'll just ignore it. After we implement the new calling
8259 convention for destructors, we can eliminate the use of
8260 additional cleanup functions entirely in the -fnew-abi case. */
8261 if (flag_use_cxa_atexit
)
8262 parmtypes
= tree_cons (NULL_TREE
, ptr_type_node
, parmtypes
);
8263 /* Build the function type itself. */
8264 fntype
= build_function_type (void_type_node
, parmtypes
);
8265 /* Build the name of the function. */
8266 sprintf (name
, "__tcf_%d", counter
++);
8267 /* Build the function declaration. */
8268 fndecl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), fntype
);
8269 /* It's a function with internal linkage, generated by the
8271 TREE_PUBLIC (fndecl
) = 0;
8272 DECL_ARTIFICIAL (fndecl
) = 1;
8273 /* Make the function `inline' so that it is only emitted if it is
8274 actually needed. It is unlikely that it will be inlined, since
8275 it is only called via a function pointer, but we avoid unncessary
8276 emissions this way. */
8277 DECL_INLINE (fndecl
) = 1;
8278 /* Build the parameter. */
8279 if (flag_use_cxa_atexit
)
8283 parmdecl
= build_decl (PARM_DECL
, NULL_TREE
, ptr_type_node
);
8284 DECL_CONTEXT (parmdecl
) = fndecl
;
8285 DECL_ARG_TYPE (parmdecl
) = ptr_type_node
;
8286 TREE_USED (parmdecl
) = 1;
8287 DECL_ARGUMENTS (fndecl
) = parmdecl
;
8291 start_function (/*specs=*/NULL_TREE
, fndecl
, NULL_TREE
, SF_PRE_PARSED
);
8294 interface_unknown
= old_interface_unknown
;
8296 pop_lang_context ();
8298 return current_function_decl
;
8301 /* Finish the cleanup function begun by start_cleanup_fn. */
8308 expand_body (finish_function (0));
8310 pop_from_top_level ();
8313 /* Generate code to handle the destruction of DECL, an object with
8314 static storage duration. */
8317 register_dtor_fn (decl
)
8325 int saved_flag_access_control
;
8327 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl
)))
8330 /* Call build_cleanup before we enter the anonymous function so that
8331 any access checks will be done relative to the current scope,
8332 rather than the scope of the anonymous function. */
8333 build_cleanup (decl
);
8335 /* Now start the function. */
8336 cleanup
= start_cleanup_fn ();
8338 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
8339 to the original function, rather than the anonymous one. That
8340 will make the back-end think that nested functions are in use,
8341 which causes confusion. */
8342 saved_flag_access_control
= flag_access_control
;
8343 flag_access_control
= 0;
8344 fcall
= build_cleanup (decl
);
8345 flag_access_control
= saved_flag_access_control
;
8347 /* Create the body of the anonymous function. */
8348 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
8349 finish_expr_stmt (fcall
);
8350 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
8353 /* Call atexit with the cleanup function. */
8354 mark_addressable (cleanup
);
8355 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
8356 if (flag_use_cxa_atexit
)
8358 args
= tree_cons (NULL_TREE
, get_dso_handle_node (), NULL_TREE
);
8359 args
= tree_cons (NULL_TREE
, null_pointer_node
, args
);
8360 args
= tree_cons (NULL_TREE
, cleanup
, args
);
8363 args
= tree_cons (NULL_TREE
, cleanup
, NULL_TREE
);
8364 finish_expr_stmt (build_function_call (get_atexit_node (), args
));
8368 expand_static_init (decl
, init
)
8372 tree oldstatic
= value_member (decl
, static_aggregates
);
8376 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
8377 cp_error ("multiple initializations given for `%D'", decl
);
8379 else if (! toplevel_bindings_p ())
8381 /* Emit code to perform this initialization but once. */
8388 /* Emit code to perform this initialization but once. This code
8391 static int guard = 0;
8393 // Do initialization.
8395 // Register variable for destruction at end of program.
8398 Note that the `temp' variable is only set to 1 *after* the
8399 initialization is complete. This ensures that an exception,
8400 thrown during the construction, will cause the variable to
8401 reinitialized when we pass through this code again, as per:
8405 If the initialization exits by throwing an exception, the
8406 initialization is not complete, so it will be tried again
8407 the next time control enters the declaration.
8409 In theory, this process should be thread-safe, too; multiple
8410 threads should not be able to initialize the variable more
8411 than once. We don't yet attempt to ensure thread-safety. */
8413 /* Create the guard variable. */
8414 guard
= get_guard (decl
);
8416 /* Begin the conditional initialization. */
8417 if_stmt
= begin_if_stmt ();
8418 finish_if_stmt_cond (get_guard_cond (guard
), if_stmt
);
8419 then_clause
= begin_compound_stmt (/*has_no_scope=*/0);
8421 /* Do the initialization itself. */
8422 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
8423 || (init
&& TREE_CODE (init
) == TREE_LIST
))
8424 assignment
= build_aggr_init (decl
, init
, 0);
8426 /* The initialization we're doing here is just a bitwise
8428 assignment
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
8430 assignment
= NULL_TREE
;
8432 /* Once the assignment is complete, set TEMP to 1. Since the
8433 construction of the static object is complete at this point,
8434 we want to make sure TEMP is set to 1 even if a temporary
8435 constructed during the initialization throws an exception
8436 when it is destroyed. So, we combine the initialization and
8437 the assignment to TEMP into a single expression, ensuring
8438 that when we call finish_expr_stmt the cleanups will not be
8439 run until after TEMP is set to 1. */
8440 guard_init
= set_guard (guard
);
8443 assignment
= tree_cons (NULL_TREE
, assignment
,
8444 build_tree_list (NULL_TREE
,
8446 assignment
= build_compound_expr (assignment
);
8449 assignment
= guard_init
;
8450 finish_expr_stmt (assignment
);
8452 /* Use atexit to register a function for destroying this static
8454 register_dtor_fn (decl
);
8456 finish_compound_stmt (/*has_no_scope=*/0, then_clause
);
8457 finish_then_clause (if_stmt
);
8461 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8464 /* Finish the declaration of a catch-parameter. */
8467 start_handler_parms (declspecs
, declarator
)
8474 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8476 if (decl
== NULL_TREE
)
8477 error ("invalid catch parameter");
8486 /* Make TYPE a complete type based on INITIAL_VALUE.
8487 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8488 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8491 complete_array_type (type
, initial_value
, do_default
)
8492 tree type
, initial_value
;
8495 register tree maxindex
= NULL_TREE
;
8500 /* An array of character type can be initialized from a
8501 brace-enclosed string constant. */
8502 if (char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (type
)))
8503 && TREE_CODE (initial_value
) == CONSTRUCTOR
8504 && CONSTRUCTOR_ELTS (initial_value
)
8505 && (TREE_CODE (TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
)))
8507 && TREE_CHAIN (CONSTRUCTOR_ELTS (initial_value
)) == NULL_TREE
)
8508 initial_value
= TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
));
8510 /* Note MAXINDEX is really the maximum index, one less than the
8512 if (TREE_CODE (initial_value
) == STRING_CST
)
8515 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8516 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8519 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8521 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8523 maxindex
= ssize_int (-1);
8524 for (; elts
; elts
= TREE_CHAIN (elts
))
8526 if (TREE_PURPOSE (elts
))
8527 maxindex
= TREE_PURPOSE (elts
);
8529 maxindex
= size_binop (PLUS_EXPR
, maxindex
, ssize_int (1));
8531 maxindex
= copy_node (maxindex
);
8535 /* Make an error message unless that happened already. */
8536 if (initial_value
!= error_mark_node
)
8539 initial_value
= NULL_TREE
;
8541 /* Prevent further error messages. */
8542 maxindex
= build_int_2 (0, 0);
8549 maxindex
= build_int_2 (0, 0);
8558 domain
= build_index_type (maxindex
);
8559 TYPE_DOMAIN (type
) = domain
;
8561 if (! TREE_TYPE (maxindex
))
8562 TREE_TYPE (maxindex
) = domain
;
8564 itype
= TREE_TYPE (initial_value
);
8567 if (itype
&& !TYPE_DOMAIN (itype
))
8568 TYPE_DOMAIN (itype
) = domain
;
8569 /* The type of the main variant should never be used for arrays
8570 of different sizes. It should only ever be completed with the
8571 size of the array. */
8572 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8573 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8576 /* Lay out the type now that we can get the real answer. */
8583 /* Return zero if something is declared to be a member of type
8584 CTYPE when in the context of CUR_TYPE. STRING is the error
8585 message to print in that case. Otherwise, quietly return 1. */
8588 member_function_or_else (ctype
, cur_type
, flags
)
8589 tree ctype
, cur_type
;
8590 enum overload_flags flags
;
8592 if (ctype
&& ctype
!= cur_type
)
8594 if (flags
== DTOR_FLAG
)
8595 cp_error ("destructor for alien class `%T' cannot be a member",
8598 cp_error ("constructor for alien class `%T' cannot be a member",
8605 /* Subroutine of `grokdeclarator'. */
8607 /* Generate errors possibly applicable for a given set of specifiers.
8608 This is for ARM $7.1.2. */
8611 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8614 int virtualp
, quals
, friendp
, raises
, inlinep
;
8617 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8619 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8621 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8624 cp_error_at ("`%D' declared as a friend", object
);
8626 cp_error_at ("`%D' declared with an exception specification", object
);
8629 /* CTYPE is class type, or null if non-class.
8630 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8632 DECLARATOR is the function's name.
8633 VIRTUALP is truthvalue of whether the function is virtual or not.
8634 FLAGS are to be passed through to `grokclassfn'.
8635 QUALS are qualifiers indicating whether the function is `const'
8637 RAISES is a list of exceptions that this function can raise.
8638 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8639 not look, and -1 if we should not call `grokclassfn' at all.
8641 Returns `NULL_TREE' if something goes wrong, after issuing
8642 applicable error messages. */
8645 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8646 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8647 template_count
, in_namespace
)
8650 tree orig_declarator
;
8652 enum overload_flags flags
;
8654 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8658 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8659 int has_default_arg
= 0;
8663 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8664 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8670 type
= build_exception_variant (type
, raises
);
8673 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8674 /* Propagate volatile out from type to decl. */
8675 if (TYPE_VOLATILE (type
))
8676 TREE_THIS_VOLATILE (decl
) = 1;
8678 /* If this decl has namespace scope, set that up. */
8680 set_decl_namespace (decl
, in_namespace
, friendp
);
8682 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8684 /* `main' and builtins have implicit 'C' linkage. */
8685 if ((MAIN_NAME_P (declarator
)
8686 || (IDENTIFIER_LENGTH (declarator
) > 10
8687 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8688 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8689 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8690 && current_lang_name
== lang_name_cplusplus
8691 && ctype
== NULL_TREE
8692 /* NULL_TREE means global namespace. */
8693 && DECL_CONTEXT (decl
) == NULL_TREE
)
8694 DECL_LANGUAGE (decl
) = lang_c
;
8696 /* Should probably propagate const out from type to decl I bet (mrs). */
8699 DECL_STATIC_FUNCTION_P (decl
) = 1;
8700 DECL_CONTEXT (decl
) = ctype
;
8704 DECL_CONTEXT (decl
) = ctype
;
8706 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8708 if (processing_template_decl
)
8709 error ("cannot declare `::main' to be a template");
8711 error ("cannot declare `::main' to be inline");
8713 error ("cannot declare `::main' to be static");
8714 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
8716 error ("`main' must return `int'");
8721 /* Members of anonymous types and local classes have no linkage; make
8723 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8724 || decl_function_context (TYPE_MAIN_DECL (ctype
))))
8729 /* [basic.link]: A name with no linkage (notably, the name of a class
8730 or enumeration declared in a local scope) shall not be used to
8731 declare an entity with linkage.
8733 Only check this for public decls for now. */
8734 t
= no_linkage_check (TREE_TYPE (decl
));
8737 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8739 if (DECL_EXTERN_C_P (decl
))
8740 /* Allow this; it's pretty common in C. */;
8742 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8746 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8751 TREE_PUBLIC (decl
) = publicp
;
8754 DECL_INTERFACE_KNOWN (decl
) = 1;
8755 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8759 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8761 DECL_EXTERNAL (decl
) = 1;
8762 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8764 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8765 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8769 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8770 grok_op_properties (decl
, virtualp
, check
< 0);
8772 if (ctype
&& decl_function_context (decl
))
8773 DECL_NO_STATIC_CHAIN (decl
) = 1;
8775 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8776 if (TREE_PURPOSE (t
)
8777 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8779 has_default_arg
= 1;
8784 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8788 ("defining explicit specialization `%D' in friend declaration",
8792 tree fns
= TREE_OPERAND (orig_declarator
, 0);
8793 tree args
= TREE_OPERAND (orig_declarator
, 1);
8795 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8797 /* Something like `template <class T> friend void f<T>()'. */
8798 cp_error ("invalid use of template-id `%D' in declaration of primary template",
8804 /* A friend declaration of the form friend void f<>(). Record
8805 the information in the TEMPLATE_ID_EXPR. */
8806 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8808 if (TREE_CODE (fns
) == COMPONENT_REF
)
8810 /* Due to bison parser ickiness, we will have already looked
8811 up an operator_name or PFUNCNAME within the current class
8812 (see template_id in parse.y). If the current class contains
8813 such a name, we'll get a COMPONENT_REF here. Undo that. */
8815 my_friendly_assert (TREE_TYPE (TREE_OPERAND (fns
, 0))
8816 == current_class_type
, 20001120);
8817 fns
= TREE_OPERAND (fns
, 1);
8819 my_friendly_assert (TREE_CODE (fns
) == IDENTIFIER_NODE
8820 || TREE_CODE (fns
) == LOOKUP_EXPR
8821 || TREE_CODE (fns
) == OVERLOAD
, 20001120);
8822 DECL_TEMPLATE_INFO (decl
) = tree_cons (fns
, args
, NULL_TREE
);
8824 if (has_default_arg
)
8826 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8833 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8840 if (has_default_arg
)
8841 add_defarg_fn (decl
);
8843 /* Plain overloading: will not be grok'd by grokclassfn. */
8844 if (! ctype
&& ! processing_template_decl
8845 && !DECL_EXTERN_C_P (decl
)
8846 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8847 set_mangled_name_for_decl (decl
);
8850 /* Make the init_value nonzero so pushdecl knows this is not
8851 tentative. error_mark_node is replaced later with the BLOCK. */
8852 DECL_INITIAL (decl
) = error_mark_node
;
8854 if (TYPE_NOTHROW_P (type
) || nothrow_libfn_p (decl
))
8855 TREE_NOTHROW (decl
) = 1;
8857 /* Caller will do the rest of this. */
8861 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8862 DECL_CONSTRUCTOR_P (decl
) = 1;
8864 /* Function gets the ugly name, field gets the nice one. This call
8865 may change the type of the function (because of default
8867 if (ctype
!= NULL_TREE
)
8868 grokclassfn (ctype
, decl
, flags
, quals
);
8870 decl
= check_explicit_specialization (orig_declarator
, decl
,
8872 2 * (funcdef_flag
!= 0) +
8873 4 * (friendp
!= 0));
8874 if (decl
== error_mark_node
)
8877 if (ctype
!= NULL_TREE
8878 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8883 old_decl
= check_classfn (ctype
, decl
);
8885 if (old_decl
&& TREE_CODE (old_decl
) == TEMPLATE_DECL
)
8886 /* Because grokfndecl is always supposed to return a
8887 FUNCTION_DECL, we pull out the DECL_TEMPLATE_RESULT
8888 here. We depend on our callers to figure out that its
8889 really a template that's being returned. */
8890 old_decl
= DECL_TEMPLATE_RESULT (old_decl
);
8892 if (old_decl
&& DECL_STATIC_FUNCTION_P (old_decl
)
8893 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8895 /* Remove the `this' parm added by grokclassfn.
8896 XXX Isn't this done in start_function, too? */
8897 revert_static_member_fn (decl
);
8898 last_function_parms
= TREE_CHAIN (last_function_parms
);
8900 if (old_decl
&& DECL_ARTIFICIAL (old_decl
))
8901 cp_error ("definition of implicitly-declared `%D'", old_decl
);
8905 /* Since we've smashed OLD_DECL to its
8906 DECL_TEMPLATE_RESULT, we must do the same to DECL. */
8907 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
8908 decl
= DECL_TEMPLATE_RESULT (decl
);
8910 /* Attempt to merge the declarations. This can fail, in
8911 the case of some illegal specialization declarations. */
8912 if (!duplicate_decls (decl
, old_decl
))
8913 cp_error ("no `%#D' member function declared in class `%T'",
8919 if (DECL_CONSTRUCTOR_P (decl
) && !grok_ctor_properties (ctype
, decl
))
8922 if (ctype
== NULL_TREE
|| check
)
8926 DECL_VIRTUAL_P (decl
) = 1;
8932 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
8935 RID_BIT_TYPE
*specbits_in
;
8941 RID_BIT_TYPE specbits
;
8943 specbits
= *specbits_in
;
8945 if (TREE_CODE (type
) == OFFSET_TYPE
)
8947 /* If you declare a static member so that it
8948 can be initialized, the code will reach here. */
8949 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
8950 type
= TREE_TYPE (type
);
8951 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8952 DECL_CONTEXT (decl
) = basetype
;
8953 /* DECL_ASSEMBLER_NAME is needed only for full-instantiated
8955 if (!uses_template_parms (decl
))
8958 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
8960 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
,
8969 context
= in_namespace
;
8970 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
8971 context
= current_namespace
;
8973 context
= NULL_TREE
;
8975 if (processing_template_decl
&& context
)
8976 /* For global variables, declared in a template, we need the
8978 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8980 decl
= build_decl (VAR_DECL
, declarator
, type
);
8983 set_decl_namespace (decl
, context
, 0);
8985 context
= DECL_CONTEXT (decl
);
8986 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
8989 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
8991 DECL_ASSEMBLER_NAME (decl
)
8992 = build_static_name (context
, declarator
);
8997 set_decl_namespace (decl
, in_namespace
, 0);
8999 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
9001 DECL_THIS_EXTERN (decl
) = 1;
9002 DECL_EXTERNAL (decl
) = !initialized
;
9005 /* In class context, static means one per class,
9006 public access, and static storage. */
9007 if (DECL_CLASS_SCOPE_P (decl
))
9009 TREE_PUBLIC (decl
) = 1;
9010 TREE_STATIC (decl
) = 1;
9011 DECL_EXTERNAL (decl
) = 0;
9013 /* At top level, either `static' or no s.c. makes a definition
9014 (perhaps tentative), and absence of `static' makes it public. */
9015 else if (toplevel_bindings_p ())
9017 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
9018 && (DECL_THIS_EXTERN (decl
) || ! constp
));
9019 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
9021 /* Not at top level, only `static' makes a static definition. */
9024 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
9025 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
9028 if (TREE_PUBLIC (decl
))
9030 /* [basic.link]: A name with no linkage (notably, the name of a class
9031 or enumeration declared in a local scope) shall not be used to
9032 declare an entity with linkage.
9034 Only check this for public decls for now. */
9035 tree t
= no_linkage_check (TREE_TYPE (decl
));
9038 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
9039 /* Ignore for now; `enum { foo } e' is pretty common. */;
9041 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
9049 /* Create and return a canonical pointer to member function type, for
9050 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
9053 build_ptrmemfunc_type (type
)
9059 tree unqualified_variant
= NULL_TREE
;
9061 if (type
== error_mark_node
)
9064 /* If a canonical type already exists for this type, use it. We use
9065 this method instead of type_hash_canon, because it only does a
9066 simple equality check on the list of field members. */
9068 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
9071 /* Make sure that we always have the unqualified pointer-to-member
9073 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9075 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
9077 t
= make_aggr_type (RECORD_TYPE
);
9078 /* Let the front-end know this is a pointer to member function... */
9079 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
9080 /* ... and not really an aggregate. */
9081 SET_IS_AGGR_TYPE (t
, 0);
9085 u
= make_aggr_type (UNION_TYPE
);
9086 SET_IS_AGGR_TYPE (u
, 0);
9087 fields
[0] = build_decl (FIELD_DECL
, pfn_identifier
, type
);
9088 fields
[1] = build_decl (FIELD_DECL
, delta2_identifier
,
9090 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9091 TYPE_NAME (u
) = NULL_TREE
;
9093 fields
[0] = build_decl (FIELD_DECL
, delta_identifier
,
9095 fields
[1] = build_decl (FIELD_DECL
, index_identifier
,
9097 fields
[2] = build_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
9098 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
9102 fields
[0] = build_decl (FIELD_DECL
, pfn_identifier
, type
);
9103 fields
[1] = build_decl (FIELD_DECL
, delta_identifier
,
9105 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9108 /* Zap out the name so that the back-end will give us the debugging
9109 information for this anonymous RECORD_TYPE. */
9110 TYPE_NAME (t
) = NULL_TREE
;
9112 /* If this is not the unqualified form of this pointer-to-member
9113 type, set the TYPE_MAIN_VARIANT for this type to be the
9114 unqualified type. Since they are actually RECORD_TYPEs that are
9115 not variants of each other, we must do this manually. */
9116 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9118 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
9119 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
9120 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
9121 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
9124 /* Cache this pointer-to-member type so that we can find it again
9126 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
9128 /* Seems to be wanted. */
9129 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
9134 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
9135 Check to see that the definition is valid. Issue appropriate error
9136 messages. Return 1 if the definition is particularly bad, or 0
9140 check_static_variable_definition (decl
, type
)
9144 /* Motion 10 at San Diego: If a static const integral data member is
9145 initialized with an integral constant expression, the initializer
9146 may appear either in the declaration (within the class), or in
9147 the definition, but not both. If it appears in the class, the
9148 member is a member constant. The file-scope definition is always
9150 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
9152 cp_error ("invalid in-class initialization of static data member of non-integral type `%T'",
9154 /* If we just return the declaration, crashes will sometimes
9155 occur. We therefore return void_type_node, as if this was a
9156 friend declaration, to cause callers to completely ignore
9157 this declaration. */
9160 else if (!CP_TYPE_CONST_P (type
))
9161 cp_error ("ISO C++ forbids in-class initialization of non-const static member `%D'",
9163 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
9164 cp_pedwarn ("ISO C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
9169 /* Given the SIZE (i.e., number of elements) in an array, compute an
9170 appropriate index type for the array. If non-NULL, NAME is the
9171 name of the thing being declared. */
9174 compute_array_index_type (name
, size
)
9180 /* The size might be the result of a cast. */
9181 STRIP_TYPE_NOPS (size
);
9183 /* It might be a const variable or enumeration constant. */
9184 size
= decl_constant_value (size
);
9186 /* If this involves a template parameter, it will be a constant at
9187 instantiation time, but we don't know what the value is yet.
9188 Even if no template parameters are involved, we may an expression
9189 that is not a constant; we don't even simplify `1 + 2' when
9190 processing a template. */
9191 if (processing_template_decl
)
9193 /* Resolve a qualified reference to an enumerator or static
9194 const data member of ours. */
9195 if (TREE_CODE (size
) == SCOPE_REF
9196 && TREE_OPERAND (size
, 0) == current_class_type
)
9198 tree t
= lookup_field (current_class_type
,
9199 TREE_OPERAND (size
, 1), 0, 0);
9204 return build_index_type (build_min (MINUS_EXPR
, sizetype
,
9205 size
, integer_one_node
));
9208 /* The array bound must be an integer type. */
9209 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9210 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
9211 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
9214 cp_error ("size of array `%D' has non-integer type", name
);
9216 cp_error ("size of array has non-integer type");
9217 size
= integer_one_node
;
9220 /* Normally, the array-bound will be a constant. */
9221 if (TREE_CODE (size
) == INTEGER_CST
)
9223 /* Check to see if the array bound overflowed. Make that an
9224 error, no matter how generous we're being. */
9225 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9226 int old_pedantic
= pedantic
;
9227 pedantic
= flag_pedantic_errors
= 1;
9228 constant_expression_warning (size
);
9229 pedantic
= old_pedantic
;
9230 flag_pedantic_errors
= old_flag_pedantic_errors
;
9232 /* An array must have a positive number of elements. */
9233 if (INT_CST_LT (size
, integer_zero_node
))
9236 cp_error ("size of array `%D' is negative", name
);
9238 cp_error ("size of array is negative");
9239 size
= integer_one_node
;
9241 /* Except that an extension we allow zero-sized arrays. We
9242 always allow them in system headers because glibc uses
9244 else if (integer_zerop (size
) && pedantic
&& !in_system_header
)
9247 cp_pedwarn ("ISO C++ forbids zero-size array `%D'", name
);
9249 cp_pedwarn ("ISO C++ forbids zero-size array");
9252 else if (TREE_CONSTANT (size
))
9254 /* `(int) &fn' is not a valid array bound. */
9256 cp_error ("size of array `%D' is not an integral constant-expression",
9259 cp_error ("size of array is not an integral constant-expression");
9262 /* Compute the index of the largest element in the array. It is
9263 one less than the number of elements in the array. */
9265 = fold (cp_build_binary_op (MINUS_EXPR
,
9266 cp_convert (ssizetype
, size
),
9267 cp_convert (ssizetype
,
9268 integer_one_node
)));
9270 /* Check for variable-sized arrays. We allow such things as an
9271 extension, even though they are not allowed in ANSI/ISO C++. */
9272 if (!TREE_CONSTANT (itype
))
9277 cp_pedwarn ("ISO C++ forbids variable-size array `%D'",
9280 cp_pedwarn ("ISO C++ forbids variable-size array");
9283 /* Create a variable-sized array index type. */
9284 itype
= variable_size (itype
);
9286 /* Make sure that there was no overflow when creating to a signed
9287 index type. (For example, on a 32-bit machine, an array with
9288 size 2^32 - 1 is too big.) */
9289 else if (TREE_OVERFLOW (itype
))
9291 error ("overflow in array dimension");
9292 TREE_OVERFLOW (itype
) = 0;
9295 /* Create and return the appropriate index type. */
9296 return build_index_type (itype
);
9299 /* Returns an ARRAY_TYPE for an array with SIZE elements of the
9300 indicated TYPE. If non-NULL, NAME is the NAME of the declaration
9304 create_array_type_for_decl (name
, type
, size
)
9309 tree itype
= NULL_TREE
;
9310 const char* error_msg
;
9312 /* If things have already gone awry, bail now. */
9313 if (type
== error_mark_node
|| size
== error_mark_node
)
9314 return error_mark_node
;
9316 /* Assume that everything will go OK. */
9319 /* There are some types which cannot be array elements. */
9320 switch (TREE_CODE (type
))
9323 error_msg
= "array of void";
9327 error_msg
= "array of functions";
9330 case REFERENCE_TYPE
:
9331 error_msg
= "array of references";
9335 error_msg
= "array of data members";
9339 error_msg
= "array of function members";
9346 /* If something went wrong, issue an error-message and return. */
9350 cp_error ("declaration of `%D' as %s", name
, error_msg
);
9352 cp_error ("creating %s", error_msg
);
9354 return error_mark_node
;
9359 The constant expressions that specify the bounds of the arrays
9360 can be omitted only for the first member of the sequence. */
9361 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9363 cp_error ("declaration of `%D' as multidimensional array must have bounds for all dimensions except the first",
9366 return error_mark_node
;
9369 /* Figure out the index type for the array. */
9371 itype
= compute_array_index_type (name
, size
);
9373 return build_cplus_array_type (type
, itype
);
9376 /* Check that it's OK to declare a function with the indicated TYPE.
9377 SFK indicates the kind of special function (if any) that this
9378 function is. CTYPE is the class of which this function is a
9379 member. OPTYPE is the type given in a conversion operator
9380 declaration. Returns the actual return type of the function; that
9381 may be different than TYPE if an error occurs, or for certain
9382 special functions. */
9385 check_special_function_return_type (sfk
, type
, ctype
, optype
)
9386 special_function_kind sfk
;
9393 case sfk_constructor
:
9395 cp_error ("return type specification for constructor invalid");
9397 /* In the old ABI, we return `this'; in the new ABI we don't
9399 type
= flag_new_abi
? void_type_node
: build_pointer_type (ctype
);
9402 case sfk_destructor
:
9404 cp_error ("return type specification for destructor invalid");
9405 type
= void_type_node
;
9408 case sfk_conversion
:
9409 if (type
&& !same_type_p (type
, optype
))
9410 cp_error ("operator `%T' declared to return `%T'", optype
, type
);
9412 cp_pedwarn ("return type specified for `operator %T'", optype
);
9417 my_friendly_abort (20000408);
9424 /* Given declspecs and a declarator,
9425 determine the name and type of the object declared
9426 and construct a ..._DECL node for it.
9427 (In one case we can return a ..._TYPE node instead.
9428 For invalid input we sometimes return 0.)
9430 DECLSPECS is a chain of tree_list nodes whose value fields
9431 are the storage classes and type specifiers.
9433 DECL_CONTEXT says which syntactic context this declaration is in:
9434 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
9435 FUNCDEF for a function definition. Like NORMAL but a few different
9436 error messages in each case. Return value may be zero meaning
9437 this definition is too screwy to try to parse.
9438 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
9439 handle member functions (which have FIELD context).
9440 Return value may be zero meaning this definition is too screwy to
9442 PARM for a parameter declaration (either within a function prototype
9443 or before a function body). Make a PARM_DECL, or return void_type_node.
9444 CATCHPARM for a parameter declaration before a catch clause.
9445 TYPENAME if for a typename (in a cast or sizeof).
9446 Don't make a DECL node; just return the ..._TYPE node.
9447 FIELD for a struct or union field; make a FIELD_DECL.
9448 BITFIELD for a field with specified width.
9449 INITIALIZED is 1 if the decl has an initializer.
9451 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
9452 normal attributes in TREE_PURPOSE, or NULL_TREE.
9454 In the TYPENAME case, DECLARATOR is really an abstract declarator.
9455 It may also be so in the PARM case, for a prototype where the
9456 argument type is specified but not the name.
9458 This function is where the complicated C meanings of `static'
9459 and `extern' are interpreted.
9461 For C++, if there is any monkey business to do, the function which
9462 calls this one must do it, i.e., prepending instance variables,
9463 renaming overloaded function names, etc.
9465 Note that for this C++, it is an error to define a method within a class
9466 which does not belong to that class.
9468 Except in the case where SCOPE_REFs are implicitly known (such as
9469 methods within a class being redundantly qualified),
9470 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
9471 (class_name::decl_name). The caller must also deal with this.
9473 If a constructor or destructor is seen, and the context is FIELD,
9474 then the type gains the attribute TREE_HAS_x. If such a declaration
9475 is erroneous, NULL_TREE is returned.
9477 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
9478 function, these are the qualifiers to give to the `this' pointer. We
9479 apply TYPE_QUAL_RESTRICT to the this ptr, not the object.
9481 May return void_type_node if the declarator turned out to be a friend.
9482 See grokfield for details. */
9485 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
9488 enum decl_context decl_context
;
9492 RID_BIT_TYPE specbits
;
9495 tree type
= NULL_TREE
;
9501 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
9502 int explicit_int
= 0;
9503 int explicit_char
= 0;
9504 int defaulted_int
= 0;
9505 tree typedef_decl
= NULL_TREE
;
9507 tree typedef_type
= NULL_TREE
;
9508 int funcdef_flag
= 0;
9509 enum tree_code innermost_code
= ERROR_MARK
;
9512 /* See the code below that used this. */
9513 tree decl_machine_attr
= NULL_TREE
;
9515 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
9516 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
9517 tree init
= NULL_TREE
;
9519 /* Keep track of what sort of function is being processed
9520 so that we can warn about default return values, or explicit
9521 return values which do not match prescribed defaults. */
9522 special_function_kind sfk
= sfk_none
;
9524 tree dname
= NULL_TREE
;
9525 tree ctype
= current_class_type
;
9526 tree ctor_return_type
= NULL_TREE
;
9527 enum overload_flags flags
= NO_SPECIAL
;
9528 tree quals
= NULL_TREE
;
9529 tree raises
= NULL_TREE
;
9530 int template_count
= 0;
9531 tree in_namespace
= NULL_TREE
;
9535 RIDBIT_RESET_ALL (specbits
);
9536 if (decl_context
== FUNCDEF
)
9537 funcdef_flag
= 1, decl_context
= NORMAL
;
9538 else if (decl_context
== MEMFUNCDEF
)
9539 funcdef_flag
= -1, decl_context
= FIELD
;
9540 else if (decl_context
== BITFIELD
)
9541 bitfield
= 1, decl_context
= FIELD
;
9543 /* Look inside a declarator for the name being declared
9544 and get it as a string, for an error message. */
9546 tree
*next
= &declarator
;
9550 while (next
&& *next
)
9553 switch (TREE_CODE (decl
))
9556 /* For attributes. */
9557 next
= &TREE_VALUE (decl
);
9562 next
= &TREE_OPERAND (decl
, 0);
9565 case BIT_NOT_EXPR
: /* For C++ destructors! */
9567 tree name
= TREE_OPERAND (decl
, 0);
9568 tree rename
= NULL_TREE
;
9570 my_friendly_assert (flags
== NO_SPECIAL
, 152);
9572 sfk
= sfk_destructor
;
9573 if (TREE_CODE (name
) == TYPE_DECL
)
9574 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
9575 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
9576 if (ctype
== NULL_TREE
)
9578 if (current_class_type
== NULL_TREE
)
9580 error ("destructors must be member functions");
9585 tree t
= constructor_name (current_class_name
);
9592 tree t
= constructor_name (ctype
);
9599 cp_error ("destructor `%T' must match class name `%T'",
9601 TREE_OPERAND (decl
, 0) = rename
;
9607 case ADDR_EXPR
: /* C++ reference declaration */
9612 innermost_code
= TREE_CODE (decl
);
9613 next
= &TREE_OPERAND (decl
, 0);
9617 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
9619 /* This is actually a variable declaration using
9620 constructor syntax. We need to call start_decl and
9621 cp_finish_decl so we can get the variable
9624 tree attributes
, prefix_attributes
;
9626 *next
= TREE_OPERAND (decl
, 0);
9627 init
= CALL_DECLARATOR_PARMS (decl
);
9631 attributes
= TREE_PURPOSE (attrlist
);
9632 prefix_attributes
= TREE_VALUE (attrlist
);
9636 attributes
= NULL_TREE
;
9637 prefix_attributes
= NULL_TREE
;
9640 decl
= start_decl (declarator
, declspecs
, 1,
9641 attributes
, prefix_attributes
);
9642 decl_type_access_control (decl
);
9645 /* Look for __unused__ attribute */
9646 if (TREE_USED (TREE_TYPE (decl
)))
9647 TREE_USED (decl
) = 1;
9648 finish_decl (decl
, init
, NULL_TREE
);
9651 cp_error ("invalid declarator");
9654 innermost_code
= TREE_CODE (decl
);
9655 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
9656 ctype
= current_class_type
;
9658 && TREE_OPERAND (decl
, 0)
9659 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
9660 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
9661 == constructor_name_full (ctype
))
9662 || (DECL_NAME (TREE_OPERAND (decl
, 0))
9663 == constructor_name (ctype
)))))
9664 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9665 next
= &TREE_OPERAND (decl
, 0);
9667 if (ctype
!= NULL_TREE
9668 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
9669 && decl
== constructor_name (ctype
))
9671 sfk
= sfk_constructor
;
9672 ctor_return_type
= ctype
;
9677 case TEMPLATE_ID_EXPR
:
9679 tree fns
= TREE_OPERAND (decl
, 0);
9681 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9682 fns
= TREE_OPERAND (fns
, 0);
9685 if (TREE_CODE (dname
) == COMPONENT_REF
)
9686 dname
= TREE_OPERAND (dname
, 1);
9687 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9689 my_friendly_assert (is_overloaded_fn (dname
),
9691 dname
= DECL_NAME (get_first_fn (dname
));
9696 case IDENTIFIER_NODE
:
9697 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9702 if (C_IS_RESERVED_WORD (dname
))
9704 cp_error ("declarator-id missing; using reserved word `%D'",
9706 name
= IDENTIFIER_POINTER (dname
);
9708 else if (!IDENTIFIER_TYPENAME_P (dname
))
9709 name
= IDENTIFIER_POINTER (dname
);
9712 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9713 flags
= TYPENAME_FLAG
;
9714 ctor_return_type
= TREE_TYPE (dname
);
9715 sfk
= sfk_conversion
;
9716 if (IDENTIFIER_GLOBAL_VALUE (dname
)
9717 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (dname
))
9719 name
= IDENTIFIER_POINTER (dname
);
9721 name
= "<invalid operator>";
9728 /* Perform error checking, and decide on a ctype. */
9729 tree cname
= TREE_OPERAND (decl
, 0);
9730 if (cname
== NULL_TREE
)
9732 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9735 in_namespace
= TREE_OPERAND (decl
, 0);
9736 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9738 else if (! is_aggr_type (cname
, 1))
9739 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9740 /* Must test TREE_OPERAND (decl, 1), in case user gives
9741 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9742 else if (TREE_OPERAND (decl
, 1)
9743 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9745 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9746 || TREE_CODE (cname
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
9748 cp_error ("`%T::%D' is not a valid declarator", cname
,
9749 TREE_OPERAND (decl
, 1));
9750 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9751 cname
, TREE_OPERAND (decl
, 1));
9752 return void_type_node
;
9754 else if (ctype
== NULL_TREE
)
9756 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9757 TREE_OPERAND (decl
, 0) = ctype
;
9760 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9762 cp_error ("type `%T' is not derived from type `%T'",
9764 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9770 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9771 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9772 == constructor_name_full (ctype
))
9773 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9774 == constructor_name (ctype
))))
9775 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9776 next
= &TREE_OPERAND (decl
, 1);
9780 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9781 && constructor_name (ctype
) == decl
)
9783 sfk
= sfk_constructor
;
9784 ctor_return_type
= ctype
;
9786 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9787 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9788 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9789 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9791 sfk
= sfk_destructor
;
9792 ctor_return_type
= ctype
;
9794 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9795 next
= &TREE_OPERAND (decl
, 0);
9806 /* Parse error puts this typespec where
9807 a declarator should go. */
9808 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9809 if (TREE_TYPE (decl
) == current_class_type
)
9810 cp_error (" perhaps you want `%T' for a constructor",
9811 current_class_name
);
9812 dname
= DECL_NAME (decl
);
9813 name
= IDENTIFIER_POINTER (dname
);
9815 /* Avoid giving two errors for this. */
9816 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9818 declspecs
= tree_cons (NULL_TREE
, integer_type_node
, declspecs
);
9824 cp_compiler_error ("`%D' as declarator", decl
);
9825 return 0; /* We used to do a 155 abort here. */
9830 /* A function definition's declarator must have the form of
9831 a function declarator. */
9833 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9836 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9837 && innermost_code
!= CALL_EXPR
9838 && ! (ctype
&& declspecs
== NULL_TREE
))
9840 cp_error ("declaration of `%D' as non-function", dname
);
9841 return void_type_node
;
9844 /* Anything declared one level down from the top level
9845 must be one of the parameters of a function
9846 (because the body is at least two levels down). */
9848 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9849 by not allowing C++ class definitions to specify their parameters
9850 with xdecls (must be spec.d in the parmlist).
9852 Since we now wait to push a class scope until we are sure that
9853 we are in a legitimate method context, we must set oldcname
9854 explicitly (since current_class_name is not yet alive).
9856 We also want to avoid calling this a PARM if it is in a namespace. */
9858 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
9860 struct binding_level
*b
= current_binding_level
;
9861 current_binding_level
= b
->level_chain
;
9862 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9863 decl_context
= PARM
;
9864 current_binding_level
= b
;
9868 name
= decl_context
== PARM
? "parameter" : "type name";
9870 /* Look through the decl specs and record which ones appear.
9871 Some typespecs are defined as built-in typenames.
9872 Others, the ones that are modifiers of other types,
9873 are represented by bits in SPECBITS: set the bits for
9874 the modifiers that appear. Storage class keywords are also in SPECBITS.
9876 If there is a typedef name or a type, store the type in TYPE.
9877 This includes builtin typedefs such as `int'.
9879 Set EXPLICIT_INT if the type is `int' or `char' and did not
9880 come from a user typedef.
9882 Set LONGLONG if `long' is mentioned twice.
9884 For C++, constructors and destructors have their own fast treatment. */
9886 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
9891 /* Certain parse errors slip through. For example,
9892 `int class;' is not caught by the parser. Try
9893 weakly to recover here. */
9894 if (TREE_CODE (spec
) != TREE_LIST
)
9897 id
= TREE_VALUE (spec
);
9899 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9901 if (id
== ridpointers
[(int) RID_INT
]
9902 || id
== ridpointers
[(int) RID_CHAR
]
9903 || id
== ridpointers
[(int) RID_BOOL
]
9904 || id
== ridpointers
[(int) RID_WCHAR
])
9908 if (id
== ridpointers
[(int) RID_BOOL
])
9909 error ("`bool' is now a keyword");
9911 cp_error ("extraneous `%T' ignored", id
);
9915 if (id
== ridpointers
[(int) RID_INT
])
9917 else if (id
== ridpointers
[(int) RID_CHAR
])
9919 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
9923 /* C++ aggregate types. */
9924 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
9927 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
9929 type
= IDENTIFIER_TYPE_VALUE (id
);
9933 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
9935 if (ridpointers
[i
] == id
)
9937 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
9939 if (pedantic
&& ! in_system_header
&& warn_long_long
)
9940 pedwarn ("ISO C++ does not support `long long'");
9942 error ("`long long long' is too long for GCC");
9946 else if (RIDBIT_SETP (i
, specbits
))
9947 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
9948 RIDBIT_SET (i
, specbits
);
9953 /* C++ aggregate types. */
9954 else if (TREE_CODE (id
) == TYPE_DECL
)
9957 cp_error ("multiple declarations `%T' and `%T'", type
,
9961 type
= TREE_TYPE (id
);
9962 TREE_VALUE (spec
) = type
;
9967 error ("two or more data types in declaration of `%s'", name
);
9968 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9970 register tree t
= lookup_name (id
, 1);
9971 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
9972 error ("`%s' fails to be a typedef or built in type",
9973 IDENTIFIER_POINTER (id
));
9976 type
= TREE_TYPE (t
);
9978 /* See the code below that used this. */
9979 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
9984 else if (id
!= error_mark_node
)
9985 /* Can't change CLASS nodes into RECORD nodes here! */
9991 typedef_type
= type
;
9993 /* No type at all: default to `int', and set DEFAULTED_INT
9994 because it was not a user-defined typedef. */
9996 if (type
== NULL_TREE
9997 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
9998 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
9999 || RIDBIT_SETP (RID_LONG
, specbits
)
10000 || RIDBIT_SETP (RID_SHORT
, specbits
)))
10002 /* These imply 'int'. */
10003 type
= integer_type_node
;
10007 if (sfk
!= sfk_none
)
10008 type
= check_special_function_return_type (sfk
, type
,
10011 else if (type
== NULL_TREE
)
10017 /* We handle `main' specially here, because 'main () { }' is so
10018 common. With no options, it is allowed. With -Wreturn-type,
10019 it is a warning. It is only an error with -pedantic-errors. */
10020 is_main
= (funcdef_flag
10021 && MAIN_NAME_P (dname
)
10022 && ctype
== NULL_TREE
10023 && in_namespace
== NULL_TREE
10024 && current_namespace
== global_namespace
);
10026 if (in_system_header
|| flag_ms_extensions
)
10027 /* Allow it, sigh. */;
10028 else if (pedantic
|| ! is_main
)
10029 cp_pedwarn ("ISO C++ forbids declaration of `%s' with no type",
10031 else if (warn_return_type
)
10032 cp_warning ("ISO C++ forbids declaration of `%s' with no type",
10035 type
= integer_type_node
;
10040 /* Now process the modifiers that were specified
10041 and check for invalid combinations. */
10043 /* Long double is a special combination. */
10045 if (RIDBIT_SETP (RID_LONG
, specbits
)
10046 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
10048 RIDBIT_RESET (RID_LONG
, specbits
);
10049 type
= build_qualified_type (long_double_type_node
,
10050 CP_TYPE_QUALS (type
));
10053 /* Check all other uses of type modifiers. */
10055 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10056 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10057 || RIDBIT_SETP (RID_LONG
, specbits
)
10058 || RIDBIT_SETP (RID_SHORT
, specbits
))
10062 if (TREE_CODE (type
) == REAL_TYPE
)
10063 error ("short, signed or unsigned invalid for `%s'", name
);
10064 else if (TREE_CODE (type
) != INTEGER_TYPE
)
10065 error ("long, short, signed or unsigned invalid for `%s'", name
);
10066 else if (RIDBIT_SETP (RID_LONG
, specbits
)
10067 && RIDBIT_SETP (RID_SHORT
, specbits
))
10068 error ("long and short specified together for `%s'", name
);
10069 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10070 || RIDBIT_SETP (RID_SHORT
, specbits
))
10072 error ("long or short specified with char for `%s'", name
);
10073 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10074 || RIDBIT_SETP (RID_SHORT
, specbits
))
10075 && TREE_CODE (type
) == REAL_TYPE
)
10076 error ("long or short specified with floating type for `%s'", name
);
10077 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10078 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
10079 error ("signed and unsigned given together for `%s'", name
);
10083 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
10085 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
10087 if (flag_pedantic_errors
)
10092 /* Discard the type modifiers if they are invalid. */
10095 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
10096 RIDBIT_RESET (RID_SIGNED
, specbits
);
10097 RIDBIT_RESET (RID_LONG
, specbits
);
10098 RIDBIT_RESET (RID_SHORT
, specbits
);
10103 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
10104 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
10106 error ("complex invalid for `%s'", name
);
10107 RIDBIT_RESET (RID_COMPLEX
, specbits
);
10110 /* Decide whether an integer type is signed or not.
10111 Optionally treat bitfields as signed by default. */
10112 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10115 It is implementation-defined whether a plain (neither
10116 explicitly signed or unsigned) char, short, int, or long
10117 bit-field is signed or unsigned.
10119 Naturally, we extend this to long long as well. Note that
10120 this does not include wchar_t. */
10121 || (bitfield
&& !flag_signed_bitfields
10122 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
10123 /* A typedef for plain `int' without `signed' can be
10124 controlled just like plain `int', but a typedef for
10125 `signed int' cannot be so controlled. */
10127 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
10128 && (TREE_CODE (type
) == INTEGER_TYPE
10129 || TREE_CODE (type
) == CHAR_TYPE
)
10130 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
10133 type
= long_long_unsigned_type_node
;
10134 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10135 type
= long_unsigned_type_node
;
10136 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10137 type
= short_unsigned_type_node
;
10138 else if (type
== char_type_node
)
10139 type
= unsigned_char_type_node
;
10140 else if (typedef_decl
)
10141 type
= unsigned_type (type
);
10143 type
= unsigned_type_node
;
10145 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10146 && type
== char_type_node
)
10147 type
= signed_char_type_node
;
10149 type
= long_long_integer_type_node
;
10150 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10151 type
= long_integer_type_node
;
10152 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10153 type
= short_integer_type_node
;
10155 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
10157 /* If we just have "complex", it is equivalent to
10158 "complex double", but if any modifiers at all are specified it is
10159 the complex form of TYPE. E.g, "complex short" is
10160 "complex short int". */
10162 if (defaulted_int
&& ! longlong
10163 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
10164 || RIDBIT_SETP (RID_SHORT
, specbits
)
10165 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10166 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
10167 type
= complex_double_type_node
;
10168 else if (type
== integer_type_node
)
10169 type
= complex_integer_type_node
;
10170 else if (type
== float_type_node
)
10171 type
= complex_float_type_node
;
10172 else if (type
== double_type_node
)
10173 type
= complex_double_type_node
;
10174 else if (type
== long_double_type_node
)
10175 type
= complex_long_double_type_node
;
10177 type
= build_complex_type (type
);
10180 if (sfk
== sfk_conversion
10181 && (RIDBIT_SETP (RID_CONST
, specbits
)
10182 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
10183 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
10184 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
10187 /* Set CONSTP if this declaration is `const', whether by
10188 explicit specification or via a typedef.
10189 Likewise for VOLATILEP. */
10191 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
10193 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
10195 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
10196 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10197 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10198 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10199 type
= cp_build_qualified_type (type
, type_quals
);
10201 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
10202 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
10203 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
10204 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
10205 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
10207 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10208 staticp
= 1 + (decl_context
== FIELD
);
10210 if (virtualp
&& staticp
== 2)
10212 cp_error ("member `%D' cannot be declared both virtual and static",
10216 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
10217 RIDBIT_RESET (RID_FRIEND
, specbits
);
10219 /* Warn if two storage classes are given. Default to `auto'. */
10221 if (RIDBIT_ANY_SET (specbits
))
10223 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
10224 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
10225 if (decl_context
== PARM
&& nclasses
> 0)
10226 error ("storage class specifiers invalid in parameter declarations");
10227 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10229 if (decl_context
== PARM
)
10230 error ("typedef declaration invalid in parameter declaration");
10233 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
10234 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
10237 /* Give error if `virtual' is used outside of class declaration. */
10239 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
10241 error ("virtual outside class declaration");
10245 /* Static anonymous unions are dealt with here. */
10246 if (staticp
&& decl_context
== TYPENAME
10247 && TREE_CODE (declspecs
) == TREE_LIST
10248 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
10249 decl_context
= FIELD
;
10251 /* Warn about storage classes that are invalid for certain
10252 kinds of declarations (parameters, typenames, etc.). */
10255 error ("multiple storage classes in declaration of `%s'", name
);
10256 else if (decl_context
!= NORMAL
&& nclasses
> 0)
10258 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
10259 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
10260 || RIDBIT_SETP (RID_AUTO
, specbits
)))
10262 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10264 else if (decl_context
== FIELD
10265 /* C++ allows static class elements */
10266 && RIDBIT_SETP (RID_STATIC
, specbits
))
10267 /* C++ also allows inlines and signed and unsigned elements,
10268 but in those cases we don't come in here. */
10272 if (decl_context
== FIELD
)
10274 tree tmp
= NULL_TREE
;
10275 register int op
= 0;
10279 /* Avoid trying to get an operand off an identifier node. */
10280 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10283 tmp
= TREE_OPERAND (declarator
, 0);
10284 op
= IDENTIFIER_OPNAME_P (tmp
);
10285 if (IDENTIFIER_TYPENAME_P (tmp
))
10287 if (IDENTIFIER_GLOBAL_VALUE (tmp
)
10288 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (tmp
))
10290 name
= IDENTIFIER_POINTER (tmp
);
10292 name
= "<invalid operator>";
10295 error ("storage class specified for %s `%s'",
10296 op
? "member operator" : "field",
10301 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10302 error ("storage class specified for parameter `%s'", name
);
10304 error ("storage class specified for typename");
10306 RIDBIT_RESET (RID_REGISTER
, specbits
);
10307 RIDBIT_RESET (RID_AUTO
, specbits
);
10308 RIDBIT_RESET (RID_EXTERN
, specbits
);
10311 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
10313 if (toplevel_bindings_p ())
10315 /* It's common practice (and completely valid) to have a const
10316 be initialized and declared extern. */
10317 if (!(type_quals
& TYPE_QUAL_CONST
))
10318 warning ("`%s' initialized and declared `extern'", name
);
10321 error ("`%s' has both `extern' and initializer", name
);
10323 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
10324 && ! toplevel_bindings_p ())
10325 error ("nested function `%s' declared `extern'", name
);
10326 else if (toplevel_bindings_p ())
10328 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10329 error ("top-level declaration of `%s' specifies `auto'", name
);
10332 if (nclasses
> 0 && friendp
)
10333 error ("storage class specifiers invalid in friend function declarations");
10335 /* Now figure out the structure of the declarator proper.
10336 Descend through it, creating more complex types, until we reach
10337 the declared identifier (or NULL_TREE, in an absolute declarator). */
10339 inner_attrs
= NULL_TREE
;
10342 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
10343 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
10345 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
10346 an INDIRECT_REF (for *...),
10347 a CALL_EXPR (for ...(...)),
10348 an identifier (for the name being declared)
10349 or a null pointer (for the place in an absolute declarator
10350 where the name was omitted).
10351 For the last two cases, we have just exited the loop.
10353 For C++ it could also be
10354 a SCOPE_REF (for class :: ...). In this case, we have converted
10355 sensible names to types, and those are the values we use to
10356 qualify the member name.
10357 an ADDR_EXPR (for &...),
10358 a BIT_NOT_EXPR (for destructors)
10360 At this point, TYPE is the type of elements of an array,
10361 or for a function to return, or for a pointer to point to.
10362 After this sequence of ifs, TYPE is the type of the
10363 array or function or pointer, and DECLARATOR has had its
10364 outermost layer removed. */
10366 if (type
== error_mark_node
)
10368 if (TREE_CODE (declarator
) == SCOPE_REF
)
10369 declarator
= TREE_OPERAND (declarator
, 1);
10371 declarator
= TREE_OPERAND (declarator
, 0);
10374 if (quals
!= NULL_TREE
10375 && (declarator
== NULL_TREE
10376 || TREE_CODE (declarator
) != SCOPE_REF
))
10378 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
10379 ctype
= TYPE_METHOD_BASETYPE (type
);
10380 if (ctype
!= NULL_TREE
)
10382 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
10383 grok_method_quals (ctype
, dummy
, quals
);
10384 type
= TREE_TYPE (dummy
);
10385 ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
)));
10390 /* See the comment for the TREE_LIST case, below. */
10393 else if (inner_attrs
)
10395 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10396 inner_attrs
= NULL_TREE
;
10399 switch (TREE_CODE (declarator
))
10403 /* We encode a declarator with embedded attributes using
10404 a TREE_LIST. The attributes apply to the declarator
10405 directly inside them, so we have to skip an iteration
10406 before applying them to the type. If the declarator just
10407 inside is the declarator-id, we apply the attrs to the
10409 inner_attrs
= TREE_PURPOSE (declarator
);
10411 declarator
= TREE_VALUE (declarator
);
10417 register tree size
;
10419 size
= TREE_OPERAND (declarator
, 1);
10421 /* VC++ spells a zero-sized array with []. */
10422 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
10423 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10424 size
= integer_zero_node
;
10426 declarator
= TREE_OPERAND (declarator
, 0);
10428 type
= create_array_type_for_decl (dname
, type
, size
);
10430 /* VLAs never work as fields. */
10431 if (decl_context
== FIELD
&& !processing_template_decl
10432 && TREE_CODE (type
) == ARRAY_TYPE
10433 && TYPE_DOMAIN (type
) != NULL_TREE
10434 && !TREE_CONSTANT (TYPE_MAX_VALUE (TYPE_DOMAIN (type
))))
10436 cp_error ("size of member `%D' is not constant", dname
);
10437 /* Proceed with arbitrary constant size, so that offset
10438 computations don't get confused. */
10439 type
= create_array_type_for_decl (dname
, TREE_TYPE (type
),
10451 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
10452 tree inner_decl
= TREE_OPERAND (declarator
, 0);
10454 /* Declaring a function type.
10455 Make sure we have a valid type for the function to return. */
10457 /* We now know that the TYPE_QUALS don't apply to the
10458 decl, but to its return type. */
10459 type_quals
= TYPE_UNQUALIFIED
;
10461 /* Warn about some types functions can't return. */
10463 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10465 error ("`%s' declared as function returning a function", name
);
10466 type
= integer_type_node
;
10468 if (TREE_CODE (type
) == ARRAY_TYPE
)
10470 error ("`%s' declared as function returning an array", name
);
10471 type
= integer_type_node
;
10474 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
10475 inner_decl
= TREE_OPERAND (inner_decl
, 1);
10477 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
10478 inner_decl
= dname
;
10480 /* Pick up type qualifiers which should be applied to `this'. */
10481 quals
= CALL_DECLARATOR_QUALS (declarator
);
10483 /* Pick up the exception specifications. */
10484 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
10486 /* Say it's a definition only for the CALL_EXPR
10487 closest to the identifier. */
10490 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
10491 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
10492 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
10494 if (ctype
== NULL_TREE
10495 && decl_context
== FIELD
10497 && (friendp
== 0 || dname
== current_class_name
))
10498 ctype
= current_class_type
;
10500 if (ctype
&& sfk
== sfk_conversion
)
10501 TYPE_HAS_CONVERSION (ctype
) = 1;
10502 if (ctype
&& constructor_name (ctype
) == dname
)
10504 /* We are within a class's scope. If our declarator name
10505 is the same as the class name, and we are defining
10506 a function, then it is a constructor/destructor, and
10507 therefore returns a void type. */
10509 if (flags
== DTOR_FLAG
)
10511 /* ISO C++ 12.4/2. A destructor may not be
10512 declared const or volatile. A destructor may
10515 error ("destructor cannot be static member function");
10518 cp_error ("destructors may not be `%s'",
10519 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10522 if (decl_context
== FIELD
)
10524 if (! member_function_or_else (ctype
,
10525 current_class_type
,
10527 return void_type_node
;
10530 else /* It's a constructor. */
10532 if (explicitp
== 1)
10534 /* ISO C++ 12.1. A constructor may not be
10535 declared const or volatile. A constructor may
10536 not be virtual. A constructor may not be
10539 error ("constructor cannot be static member function");
10542 pedwarn ("constructors cannot be declared virtual");
10547 cp_error ("constructors may not be `%s'",
10548 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10552 RID_BIT_TYPE tmp_bits
;
10553 memcpy (&tmp_bits
, &specbits
, sizeof (RID_BIT_TYPE
));
10554 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10555 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10556 if (RIDBIT_ANY_SET (tmp_bits
))
10557 error ("return value type specifier for constructor ignored");
10559 if (decl_context
== FIELD
)
10561 if (! member_function_or_else (ctype
,
10562 current_class_type
,
10564 return void_type_node
;
10565 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10566 if (sfk
!= sfk_constructor
)
10570 if (decl_context
== FIELD
)
10576 error ("can't initialize friend function `%s'", name
);
10579 /* Cannot be both friend and virtual. */
10580 error ("virtual functions cannot be friends");
10581 RIDBIT_RESET (RID_FRIEND
, specbits
);
10584 if (decl_context
== NORMAL
)
10585 error ("friend declaration not in class definition");
10586 if (current_function_decl
&& funcdef_flag
)
10587 cp_error ("can't define friend function `%s' in a local class definition",
10591 /* Construct the function type and go to the next
10592 inner layer of declarator. */
10594 declarator
= TREE_OPERAND (declarator
, 0);
10596 /* FIXME: This is where default args should be fully
10599 arg_types
= grokparms (inner_parms
);
10601 if (declarator
&& flags
== DTOR_FLAG
)
10603 /* A destructor declared in the body of a class will
10604 be represented as a BIT_NOT_EXPR. But, we just
10605 want the underlying IDENTIFIER. */
10606 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10607 declarator
= TREE_OPERAND (declarator
, 0);
10609 if (arg_types
!= void_list_node
)
10611 cp_error ("destructors may not have parameters");
10612 arg_types
= void_list_node
;
10613 last_function_parms
= NULL_TREE
;
10617 /* ANSI says that `const int foo ();'
10618 does not make the function foo const. */
10619 type
= build_function_type (type
, arg_types
);
10623 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10624 if (TREE_PURPOSE (t
)
10625 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10627 add_defarg_fn (type
);
10636 /* Filter out pointers-to-references and references-to-references.
10637 We can get these if a TYPE_DECL is used. */
10639 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10641 error ("cannot declare %s to references",
10642 TREE_CODE (declarator
) == ADDR_EXPR
10643 ? "references" : "pointers");
10644 declarator
= TREE_OPERAND (declarator
, 0);
10648 if (TREE_CODE (type
) == OFFSET_TYPE
10649 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10650 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10652 cp_error ("cannot declare pointer to `%#T' member",
10654 type
= TREE_TYPE (type
);
10657 /* Merge any constancy or volatility into the target type
10658 for the pointer. */
10660 /* We now know that the TYPE_QUALS don't apply to the decl,
10661 but to the target of the pointer. */
10662 type_quals
= TYPE_UNQUALIFIED
;
10664 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10666 if (TREE_CODE (type
) == VOID_TYPE
)
10667 error ("invalid type: `void &'");
10669 type
= build_reference_type (type
);
10671 else if (TREE_CODE (type
) == METHOD_TYPE
)
10672 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10674 type
= build_pointer_type (type
);
10676 /* Process a list of type modifier keywords (such as
10677 const or volatile) that were given inside the `*' or `&'. */
10679 if (TREE_TYPE (declarator
))
10681 register tree typemodlist
;
10687 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10688 typemodlist
= TREE_CHAIN (typemodlist
))
10690 tree qualifier
= TREE_VALUE (typemodlist
);
10692 if (qualifier
== ridpointers
[(int) RID_CONST
])
10694 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10696 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10701 error ("invalid type modifier within pointer declarator");
10705 pedwarn ("duplicate `const'");
10707 pedwarn ("duplicate `volatile'");
10709 pedwarn ("duplicate `restrict'");
10711 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10712 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10713 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10714 if (TREE_CODE (declarator
) == ADDR_EXPR
10715 && (constp
|| volatilep
))
10718 pedwarn ("discarding `const' applied to a reference");
10720 pedwarn ("discarding `volatile' applied to a reference");
10721 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10723 type
= cp_build_qualified_type (type
, type_quals
);
10725 declarator
= TREE_OPERAND (declarator
, 0);
10731 /* We have converted type names to NULL_TREE if the
10732 name was bogus, or to a _TYPE node, if not.
10734 The variable CTYPE holds the type we will ultimately
10735 resolve to. The code here just needs to build
10736 up appropriate member types. */
10737 tree sname
= TREE_OPERAND (declarator
, 1);
10740 /* Destructors can have their visibilities changed as well. */
10741 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10742 sname
= TREE_OPERAND (sname
, 0);
10744 if (TREE_COMPLEXITY (declarator
) == 0)
10745 /* This needs to be here, in case we are called
10746 multiple times. */ ;
10747 else if (TREE_COMPLEXITY (declarator
) == -1)
10748 /* Namespace member. */
10749 pop_decl_namespace ();
10750 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10751 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10752 else if (! IS_AGGR_TYPE_CODE
10753 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10755 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10757 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10758 that refer to ctype. They couldn't be resolved earlier
10759 because we hadn't pushed into the class yet.
10760 Example: resolve 'B<T>::type' in
10761 'B<typename B<T>::type> B<T>::f () { }'. */
10762 if (current_template_parms
10763 && uses_template_parms (type
)
10764 && uses_template_parms (current_class_type
))
10766 tree args
= current_template_args ();
10767 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10770 /* This pop_nested_class corresponds to the
10771 push_nested_class used to push into class scope for
10772 parsing the argument list of a function decl, in
10774 pop_nested_class ();
10775 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10778 my_friendly_abort (16);
10780 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10782 /* We had a reference to a global decl, or
10783 perhaps we were given a non-aggregate typedef,
10784 in which case we cleared this out, and should just
10785 keep going as though it wasn't there. */
10786 declarator
= sname
;
10789 ctype
= TREE_OPERAND (declarator
, 0);
10792 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10794 /* You're supposed to have one `template <...>'
10795 for every template class, but you don't need one
10796 for a full specialization. For example:
10798 template <class T> struct S{};
10799 template <> struct S<int> { void f(); };
10800 void S<int>::f () {}
10802 is correct; there shouldn't be a `template <>' for
10803 the definition of `S<int>::f'. */
10804 if (CLASSTYPE_TEMPLATE_INFO (t
)
10805 && (CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
10806 || uses_template_parms (CLASSTYPE_TI_ARGS (t
))))
10807 template_count
+= 1;
10809 t
= TYPE_MAIN_DECL (t
);
10810 if (DECL_LANG_SPECIFIC (t
))
10811 t
= DECL_CONTEXT (t
);
10816 if (sname
== NULL_TREE
)
10819 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10821 /* This is the `standard' use of the scoping operator:
10822 basetype :: member . */
10824 if (ctype
== current_class_type
)
10830 Is this ill-formed? */
10833 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10836 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10838 if (current_class_type
== NULL_TREE
|| friendp
)
10839 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10840 TYPE_ARG_TYPES (type
));
10843 cp_error ("cannot declare member function `%T::%s' within `%T'",
10844 ctype
, name
, current_class_type
);
10845 return void_type_node
;
10848 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10849 || COMPLETE_TYPE_P (complete_type (ctype
)))
10851 /* Have to move this code elsewhere in this function.
10852 this code is used for i.e., typedef int A::M; M *pm;
10854 It is? How? jason 10/2/94 */
10856 if (current_class_type
)
10858 cp_error ("cannot declare member `%T::%s' within `%T'",
10859 ctype
, name
, current_class_type
);
10860 return void_type_node
;
10862 type
= build_offset_type (ctype
, type
);
10866 incomplete_type_error (NULL_TREE
, ctype
);
10867 return error_mark_node
;
10870 declarator
= sname
;
10872 else if (TREE_CODE (sname
) == SCOPE_REF
)
10873 my_friendly_abort (17);
10877 declarator
= TREE_OPERAND (declarator
, 1);
10878 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10879 /* In this case, we will deal with it later. */
10883 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10884 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10885 TYPE_ARG_TYPES (type
));
10887 type
= build_offset_type (ctype
, type
);
10894 declarator
= TREE_OPERAND (declarator
, 0);
10899 case ENUMERAL_TYPE
:
10900 declarator
= NULL_TREE
;
10904 declarator
= NULL_TREE
;
10908 my_friendly_abort (158);
10912 /* See the comment for the TREE_LIST case, above. */
10915 if (! ignore_attrs
)
10916 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10918 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
10920 attrlist
= build_tree_list (NULL_TREE
, inner_attrs
);
10923 /* Now TYPE has the actual type. */
10925 if (explicitp
== 1 || (explicitp
&& friendp
))
10927 /* [dcl.fct.spec] The explicit specifier shall only be used in
10928 declarations of constructors within a class definition. */
10929 error ("only declarations of constructors can be `explicit'");
10933 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10935 if (current_class_name
== NULL_TREE
|| decl_context
== PARM
|| friendp
)
10937 error ("non-member `%s' cannot be declared `mutable'", name
);
10938 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10940 else if (decl_context
== TYPENAME
|| RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10942 error ("non-object member `%s' cannot be declared `mutable'", name
);
10943 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10945 else if (TREE_CODE (type
) == FUNCTION_TYPE
10946 || TREE_CODE (type
) == METHOD_TYPE
)
10948 error ("function `%s' cannot be declared `mutable'", name
);
10949 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10953 error ("static `%s' cannot be declared `mutable'", name
);
10954 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10956 else if (type_quals
& TYPE_QUAL_CONST
)
10958 error ("const `%s' cannot be declared `mutable'", name
);
10959 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10963 if (declarator
== NULL_TREE
10964 || TREE_CODE (declarator
) == IDENTIFIER_NODE
10965 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
10966 && (TREE_CODE (type
) == FUNCTION_TYPE
10967 || TREE_CODE (type
) == METHOD_TYPE
)))
10969 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10971 cp_error ("template-id `%D' used as a declarator", declarator
);
10972 declarator
= dname
;
10975 /* Unexpected declarator format. */
10976 my_friendly_abort (990210);
10978 /* If this is declaring a typedef name, return a TYPE_DECL. */
10980 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
10984 /* Note that the grammar rejects storage classes
10985 in typenames, fields or parameters. */
10986 if (current_lang_name
== lang_name_java
)
10987 TYPE_FOR_JAVA (type
) = 1;
10989 if (decl_context
== FIELD
)
10991 if (declarator
== constructor_name (current_class_type
))
10992 cp_pedwarn ("ISO C++ forbids nested type `%D' with same name as enclosing class",
10994 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10997 decl
= build_decl (TYPE_DECL
, declarator
, type
);
10999 /* If the user declares "typedef struct {...} foo" then the
11000 struct will have an anonymous name. Fill that name in now.
11001 Nothing can refer to it, so nothing needs know about the name
11003 if (type
!= error_mark_node
11005 && TYPE_NAME (type
)
11006 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
11007 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
11008 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
11010 tree oldname
= TYPE_NAME (type
);
11013 /* Replace the anonymous name with the real name everywhere. */
11014 lookup_tag_reverse (type
, declarator
);
11015 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
11016 if (TYPE_NAME (t
) == oldname
)
11017 TYPE_NAME (t
) = decl
;
11019 if (TYPE_LANG_SPECIFIC (type
))
11020 TYPE_WAS_ANONYMOUS (type
) = 1;
11022 /* If this is a typedef within a template class, the nested
11023 type is a (non-primary) template. The name for the
11024 template needs updating as well. */
11025 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
11026 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
11027 = TYPE_IDENTIFIER (type
);
11030 DECL_ASSEMBLER_NAME (decl
) = mangle_type (type
);
11033 /* XXX Temporarily set the scope.
11034 When returning, start_decl expects it as NULL_TREE,
11035 and will then then set it using pushdecl. */
11036 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
11037 if (current_class_type
)
11038 DECL_CONTEXT (decl
) = current_class_type
;
11040 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
11042 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
11043 DECL_ASSEMBLER_NAME (decl
)
11044 = get_identifier (build_overload_name (type
, 1, 1));
11045 DECL_CONTEXT (decl
) = NULL_TREE
;
11048 /* FIXME remangle member functions; member functions of a
11049 type with external linkage have external linkage. */
11052 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11054 cp_error_at ("typedef name may not be class-qualified", decl
);
11059 if (ctype
== NULL_TREE
)
11061 if (TREE_CODE (type
) != METHOD_TYPE
)
11062 cp_error_at ("invalid type qualifier for non-member function type", decl
);
11064 ctype
= TYPE_METHOD_BASETYPE (type
);
11066 if (ctype
!= NULL_TREE
)
11067 grok_method_quals (ctype
, decl
, quals
);
11070 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
11071 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
11072 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
11074 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
11075 inlinep
, friendp
, raises
!= NULL_TREE
);
11078 error ("typedef declaration includes an initializer");
11083 /* Detect the case of an array type of unspecified size
11084 which came, as such, direct from a typedef name.
11085 We must copy the type, so that each identifier gets
11086 a distinct type, so that each identifier's size can be
11087 controlled separately by its own initializer. */
11089 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
11090 && TYPE_DOMAIN (type
) == NULL_TREE
)
11092 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
11095 /* If this is a type name (such as, in a cast or sizeof),
11096 compute the type and return it now. */
11098 if (decl_context
== TYPENAME
)
11100 /* Note that the grammar rejects storage classes
11101 in typenames, fields or parameters. */
11102 if (type_quals
!= TYPE_UNQUALIFIED
)
11103 type_quals
= TYPE_UNQUALIFIED
;
11105 /* Special case: "friend class foo" looks like a TYPENAME context. */
11108 if (type_quals
!= TYPE_UNQUALIFIED
)
11110 cp_error ("type qualifiers specified for friend class declaration");
11111 type_quals
= TYPE_UNQUALIFIED
;
11115 cp_error ("`inline' specified for friend class declaration");
11119 /* Until core issue 180 is resolved, allow 'friend typename A::B'.
11120 But don't allow implicit typenames except with a class-key. */
11121 if (!current_aggr
&& (TREE_CODE (type
) != TYPENAME_TYPE
11122 || IMPLICIT_TYPENAME_P (type
)))
11124 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
11125 cp_pedwarn ("template parameters cannot be friends");
11126 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
11128 friend declaration requires class-key, i.e. `friend class %T::%T'",
11129 constructor_name (current_class_type
),
11130 TYPE_IDENTIFIER (type
));
11133 friend declaration requires class-key, i.e. `friend %#T'",
11137 /* Only try to do this stuff if we didn't already give up. */
11138 if (type
!= integer_type_node
)
11140 decl_type_access_control (TYPE_NAME (type
));
11142 /* A friendly class? */
11143 if (current_class_type
)
11144 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
11146 cp_error ("trying to make class `%T' a friend of global scope",
11149 type
= void_type_node
;
11154 if (ctype
== NULL_TREE
)
11156 if (TREE_CODE (type
) != METHOD_TYPE
)
11157 cp_error ("invalid qualifiers on non-member function type");
11159 ctype
= TYPE_METHOD_BASETYPE (type
);
11163 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
11164 grok_method_quals (ctype
, dummy
, quals
);
11165 type
= TREE_TYPE (dummy
);
11171 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
11172 && decl_context
!= CATCHPARM
11173 && TREE_CODE (type
) != UNION_TYPE
11176 cp_error ("abstract declarator `%T' used as declaration", type
);
11177 declarator
= make_anon_name ();
11180 /* `void' at top level (not within pointer)
11181 is allowed only in typedefs or type names.
11182 We don't complain about parms either, but that is because
11183 a better error message can be made later. */
11185 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
11188 error ("unnamed variable or field declared void");
11189 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
11191 if (IDENTIFIER_OPNAME_P (declarator
))
11192 my_friendly_abort (356);
11194 error ("variable or field `%s' declared void", name
);
11197 error ("variable or field declared void");
11198 type
= integer_type_node
;
11201 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
11202 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
11204 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
11206 if (ctype
|| in_namespace
)
11207 error ("cannot use `::' in parameter declaration");
11209 /* A parameter declared as an array of T is really a pointer to T.
11210 One declared as a function is really a pointer to a function.
11211 One declared as a member is really a pointer to member. */
11213 if (TREE_CODE (type
) == ARRAY_TYPE
)
11215 /* Transfer const-ness of array into that of type pointed to. */
11216 type
= build_pointer_type (TREE_TYPE (type
));
11217 type_quals
= TYPE_UNQUALIFIED
;
11219 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11220 type
= build_pointer_type (type
);
11221 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11222 type
= build_pointer_type (type
);
11226 register tree decl
;
11228 if (decl_context
== PARM
)
11230 decl
= build_decl (PARM_DECL
, declarator
, type
);
11232 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
11233 inlinep
, friendp
, raises
!= NULL_TREE
);
11235 /* Compute the type actually passed in the parmlist,
11236 for the case where there is no prototype.
11237 (For example, shorts and chars are passed as ints.)
11238 When there is a prototype, this is overridden later. */
11240 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
11242 else if (decl_context
== FIELD
)
11244 if (type
== error_mark_node
)
11246 /* Happens when declaring arrays of sizes which
11247 are error_mark_node, for example. */
11250 else if (in_namespace
&& !friendp
)
11252 /* Something like struct S { int N::j; }; */
11253 cp_error ("invalid use of `::'");
11256 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11259 tree function_context
;
11261 /* We catch the others as conflicts with the builtin
11263 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
11265 cp_error ("function `%D' cannot be declared friend",
11272 if (ctype
== NULL_TREE
)
11273 ctype
= current_class_type
;
11275 if (ctype
== NULL_TREE
)
11277 cp_error ("can't make `%D' into a method -- not in a class",
11279 return void_type_node
;
11282 /* ``A union may [ ... ] not [ have ] virtual functions.''
11284 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
11286 cp_error ("function `%D' declared virtual inside a union",
11288 return void_type_node
;
11291 if (declarator
== ansi_opname (NEW_EXPR
)
11292 || declarator
== ansi_opname (VEC_NEW_EXPR
)
11293 || declarator
== ansi_opname (DELETE_EXPR
)
11294 || declarator
== ansi_opname (VEC_DELETE_EXPR
))
11298 cp_error ("`%D' cannot be declared virtual, since it is always static",
11303 else if (staticp
< 2)
11304 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11305 TYPE_ARG_TYPES (type
));
11308 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
11309 function_context
= (ctype
!= NULL_TREE
) ?
11310 decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
11311 publicp
= (! friendp
|| ! staticp
)
11312 && function_context
== NULL_TREE
;
11313 decl
= grokfndecl (ctype
, type
,
11314 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
11315 ? declarator
: dname
,
11317 virtualp
, flags
, quals
, raises
,
11318 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
11319 funcdef_flag
, template_count
, in_namespace
);
11320 if (decl
== NULL_TREE
)
11323 /* This clobbers the attrs stored in `decl' from `attrlist'. */
11324 /* The decl and setting of decl_machine_attr is also turned off. */
11325 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
11328 /* [class.conv.ctor]
11330 A constructor declared without the function-specifier
11331 explicit that can be called with a single parameter
11332 specifies a conversion from the type of its first
11333 parameter to the type of its class. Such a constructor
11334 is called a converting constructor. */
11335 if (explicitp
== 2)
11336 DECL_NONCONVERTING_P (decl
) = 1;
11337 else if (DECL_CONSTRUCTOR_P (decl
))
11339 /* The constructor can be called with exactly one
11340 parameter if there is at least one parameter, and
11341 any subsequent parameters have default arguments.
11342 We don't look at the first parameter, which is
11343 really just the `this' parameter for the new
11346 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
11348 /* Skip the `in_chrg' argument too, if present. */
11349 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
11350 arg_types
= TREE_CHAIN (arg_types
);
11352 if (arg_types
== void_list_node
11354 && TREE_CHAIN (arg_types
)
11355 && TREE_CHAIN (arg_types
) != void_list_node
11356 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
11357 DECL_NONCONVERTING_P (decl
) = 1;
11360 else if (TREE_CODE (type
) == METHOD_TYPE
)
11362 /* We only get here for friend declarations of
11363 members of other classes. */
11364 /* All method decls are public, so tell grokfndecl to set
11365 TREE_PUBLIC, also. */
11366 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
11367 virtualp
, flags
, quals
, raises
,
11368 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
11369 template_count
, in_namespace
);
11370 if (decl
== NULL_TREE
)
11373 else if (!staticp
&& ! processing_template_decl
11374 && !COMPLETE_TYPE_P (complete_type (type
))
11375 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
11378 cp_error ("field `%D' has incomplete type", declarator
);
11380 cp_error ("name `%T' has incomplete type", type
);
11382 /* If we're instantiating a template, tell them which
11383 instantiation made the field's type be incomplete. */
11384 if (current_class_type
11385 && TYPE_NAME (current_class_type
)
11386 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
11387 && declspecs
&& TREE_VALUE (declspecs
)
11388 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
11389 cp_error (" in instantiation of template `%T'",
11390 current_class_type
);
11392 type
= error_mark_node
;
11399 error ("`%s' is neither function nor member function; cannot be declared friend",
11400 IDENTIFIER_POINTER (declarator
));
11408 /* Friends are treated specially. */
11409 if (ctype
== current_class_type
)
11410 warning ("member functions are implicitly friends of their class");
11413 tree t
= NULL_TREE
;
11414 if (decl
&& DECL_NAME (decl
))
11416 if (template_class_depth (current_class_type
) == 0)
11419 = check_explicit_specialization
11421 template_count
, 2 * (funcdef_flag
!= 0) + 4);
11422 if (decl
== error_mark_node
)
11423 return error_mark_node
;
11426 t
= do_friend (ctype
, declarator
, decl
,
11427 last_function_parms
, attrlist
, flags
, quals
,
11430 if (t
&& funcdef_flag
)
11433 return void_type_node
;
11437 /* Structure field. It may not be a function, except for C++ */
11439 if (decl
== NULL_TREE
)
11445 /* An attempt is being made to initialize a non-static
11446 member. But, from [class.mem]:
11448 4 A member-declarator can contain a
11449 constant-initializer only if it declares a static
11450 member (_class.static_) of integral or enumeration
11451 type, see _class.static.data_.
11453 This used to be relatively common practice, but
11454 the rest of the compiler does not correctly
11455 handle the initialization unless the member is
11456 static so we make it static below. */
11457 cp_pedwarn ("ISO C++ forbids initialization of member `%D'",
11459 cp_pedwarn ("making `%D' static", declarator
);
11463 if (uses_template_parms (type
))
11464 /* We'll check at instantiation time. */
11466 else if (check_static_variable_definition (declarator
,
11468 /* If we just return the declaration, crashes
11469 will sometimes occur. We therefore return
11470 void_type_node, as if this was a friend
11471 declaration, to cause callers to completely
11472 ignore this declaration. */
11473 return void_type_node
;
11476 /* 9.2p13 [class.mem] */
11477 if (declarator
== constructor_name (current_class_type
)
11478 /* The standard does not allow non-static data members
11479 here either, but we agreed at the 10/99 meeting
11480 to change that in TC 1 so that they are allowed in
11481 classes with no user-defined constructors. */
11483 cp_pedwarn ("ISO C++ forbids static data member `%D' with same name as enclosing class",
11488 /* C++ allows static class members. All other work
11489 for this is done by grokfield. */
11490 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
11491 TREE_STATIC (decl
) = 1;
11492 /* In class context, 'static' means public access. */
11493 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
11497 decl
= build_decl (FIELD_DECL
, declarator
, type
);
11498 DECL_NONADDRESSABLE_P (decl
) = bitfield
;
11499 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11501 DECL_MUTABLE_P (decl
) = 1;
11502 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11506 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
11507 inlinep
, friendp
, raises
!= NULL_TREE
);
11510 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11512 tree original_name
;
11518 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11519 original_name
= dname
;
11521 original_name
= declarator
;
11523 if (RIDBIT_SETP (RID_AUTO
, specbits
))
11524 error ("storage class `auto' invalid for function `%s'", name
);
11525 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11526 error ("storage class `register' invalid for function `%s'", name
);
11528 /* Function declaration not at top level.
11529 Storage classes other than `extern' are not allowed
11530 and `extern' makes no difference. */
11531 if (! toplevel_bindings_p ()
11532 && (RIDBIT_SETP (RID_STATIC
, specbits
)
11533 || RIDBIT_SETP (RID_INLINE
, specbits
))
11536 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11537 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
11539 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
11542 if (ctype
== NULL_TREE
)
11546 error ("virtual non-class function `%s'", name
);
11550 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
11551 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11552 TYPE_ARG_TYPES (type
));
11554 /* Record presence of `static'. */
11555 publicp
= (ctype
!= NULL_TREE
11556 || RIDBIT_SETP (RID_EXTERN
, specbits
)
11557 || !RIDBIT_SETP (RID_STATIC
, specbits
));
11559 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
11560 virtualp
, flags
, quals
, raises
,
11562 publicp
, inlinep
, funcdef_flag
,
11563 template_count
, in_namespace
);
11564 if (decl
== NULL_TREE
)
11569 int illegal_static
= 0;
11571 /* Don't allow a static member function in a class, and forbid
11572 declaring main to be static. */
11573 if (TREE_CODE (type
) == METHOD_TYPE
)
11575 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11576 illegal_static
= 1;
11578 else if (current_function_decl
)
11580 /* FIXME need arm citation */
11581 error ("cannot declare static function inside another function");
11582 illegal_static
= 1;
11585 if (illegal_static
)
11588 RIDBIT_RESET (RID_STATIC
, specbits
);
11594 /* It's a variable. */
11596 /* An uninitialized decl with `extern' is a reference. */
11597 decl
= grokvardecl (type
, declarator
, &specbits
,
11599 (type_quals
& TYPE_QUAL_CONST
) != 0,
11601 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11602 inlinep
, friendp
, raises
!= NULL_TREE
);
11606 DECL_CONTEXT (decl
) = ctype
;
11609 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11611 RIDBIT_RESET (RID_STATIC
, specbits
);
11613 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11615 cp_error ("static member `%D' declared `register'", decl
);
11616 RIDBIT_RESET (RID_REGISTER
, specbits
);
11618 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11620 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11622 RIDBIT_RESET (RID_EXTERN
, specbits
);
11627 my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE
, specbits
), 19990927);
11629 /* Record `register' declaration for warnings on &
11630 and in case doing stupid register allocation. */
11632 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11633 DECL_REGISTER (decl
) = 1;
11635 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11636 DECL_THIS_EXTERN (decl
) = 1;
11638 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11639 DECL_THIS_STATIC (decl
) = 1;
11641 /* Record constancy and volatility. There's no need to do this
11642 when processing a template; we'll do this for the instantiated
11643 declaration based on the type of DECL. */
11644 if (!processing_template_decl
)
11645 c_apply_type_quals_to_decl (type_quals
, decl
);
11651 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11652 An empty exprlist is a parmlist. An exprlist which
11653 contains only identifiers at the global level
11654 is a parmlist. Otherwise, it is an exprlist. */
11657 parmlist_is_exprlist (exprs
)
11660 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11663 if (toplevel_bindings_p ())
11665 /* At the global level, if these are all identifiers,
11666 then it is a parmlist. */
11669 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11671 exprs
= TREE_CHAIN (exprs
);
11678 /* Subroutine of start_function. Ensure that each of the parameter
11679 types (as listed in PARMS) is complete, as is required for a
11680 function definition. */
11683 require_complete_types_for_parms (parms
)
11686 for (; parms
; parms
= TREE_CHAIN (parms
))
11688 if (VOID_TYPE_P (TREE_TYPE (parms
)))
11689 /* grokparms will have already issued an error */
11690 TREE_TYPE (parms
) = error_mark_node
;
11691 else if (complete_type_or_else (TREE_TYPE (parms
), parms
))
11692 layout_decl (parms
, 0);
11694 TREE_TYPE (parms
) = error_mark_node
;
11698 /* Returns non-zero if T is a local variable. */
11701 local_variable_p (t
)
11704 if ((TREE_CODE (t
) == VAR_DECL
11705 /* A VAR_DECL with a context that is a _TYPE is a static data
11707 && !TYPE_P (CP_DECL_CONTEXT (t
))
11708 /* Any other non-local variable must be at namespace scope. */
11709 && !DECL_NAMESPACE_SCOPE_P (t
))
11710 || (TREE_CODE (t
) == PARM_DECL
))
11716 /* Returns non-zero if T is an automatic local variable or a label.
11717 (These are the declarations that need to be remapped when the code
11718 containing them is duplicated.) */
11721 nonstatic_local_decl_p (t
)
11724 return ((local_variable_p (t
) && !TREE_STATIC (t
))
11725 || TREE_CODE (t
) == LABEL_DECL
11726 || TREE_CODE (t
) == RESULT_DECL
);
11729 /* Like local_variable_p, but suitable for use as a tree-walking
11733 local_variable_p_walkfn (tp
, walk_subtrees
, data
)
11735 int *walk_subtrees ATTRIBUTE_UNUSED
;
11736 void *data ATTRIBUTE_UNUSED
;
11738 return ((local_variable_p (*tp
) && !DECL_ARTIFICIAL (*tp
))
11739 ? *tp
: NULL_TREE
);
11742 /* Check that ARG, which is a default-argument expression for a
11743 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11744 something goes wrong. DECL may also be a _TYPE node, rather than a
11745 DECL, if there is no DECL available. */
11748 check_default_argument (decl
, arg
)
11755 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11756 /* We get a DEFAULT_ARG when looking at an in-class declaration
11757 with a default argument. Ignore the argument for now; we'll
11758 deal with it after the class is complete. */
11761 if (processing_template_decl
|| uses_template_parms (arg
))
11762 /* We don't do anything checking until instantiation-time. Note
11763 that there may be uninstantiated arguments even for an
11764 instantiated function, since default arguments are not
11765 instantiated until they are needed. */
11774 decl_type
= TREE_TYPE (decl
);
11776 if (arg
== error_mark_node
11777 || decl
== error_mark_node
11778 || TREE_TYPE (arg
) == error_mark_node
11779 || decl_type
== error_mark_node
)
11780 /* Something already went wrong. There's no need to check
11782 return error_mark_node
;
11784 /* [dcl.fct.default]
11786 A default argument expression is implicitly converted to the
11788 if (!TREE_TYPE (arg
)
11789 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11792 cp_error ("default argument for `%#D' has type `%T'",
11793 decl
, TREE_TYPE (arg
));
11795 cp_error ("default argument for parameter of type `%T' has type `%T'",
11796 decl_type
, TREE_TYPE (arg
));
11798 return error_mark_node
;
11801 /* [dcl.fct.default]
11803 Local variables shall not be used in default argument
11806 The keyword `this' shall not be used in a default argument of a
11807 member function. */
11808 var
= walk_tree_without_duplicates (&arg
, local_variable_p_walkfn
,
11812 cp_error ("default argument `%E' uses local variable `%D'",
11814 return error_mark_node
;
11821 /* Decode the list of parameter types for a function type.
11822 Given the list of things declared inside the parens,
11823 return a list of types.
11825 We determine whether ellipsis parms are used by PARMLIST_ELLIPSIS_P
11826 flag. If unset, we append void_list_node. A parmlist declared
11827 as `(void)' is accepted as the empty parmlist.
11829 Also set last_function_parms to the chain of PARM_DECLs. */
11832 grokparms (first_parm
)
11835 tree result
= NULL_TREE
;
11836 tree decls
= NULL_TREE
;
11837 int ellipsis
= !first_parm
|| PARMLIST_ELLIPSIS_P (first_parm
);
11841 my_friendly_assert (!first_parm
|| TREE_PARMLIST (first_parm
), 20001115);
11843 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11845 tree type
= NULL_TREE
;
11846 register tree decl
= TREE_VALUE (parm
);
11847 tree init
= TREE_PURPOSE (parm
);
11849 chain
= TREE_CHAIN (parm
);
11850 /* @@ weak defense against parse errors. */
11851 if (TREE_CODE (decl
) != VOID_TYPE
11852 && TREE_CODE (decl
) != TREE_LIST
)
11854 /* Give various messages as the need arises. */
11855 if (TREE_CODE (decl
) == STRING_CST
)
11856 cp_error ("invalid string constant `%E'", decl
);
11857 else if (TREE_CODE (decl
) == INTEGER_CST
)
11858 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11862 if (parm
== void_list_node
)
11865 decl
= grokdeclarator (TREE_VALUE (decl
), TREE_PURPOSE (decl
),
11866 PARM
, init
!= NULL_TREE
, NULL_TREE
);
11867 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
11870 type
= TREE_TYPE (decl
);
11871 if (VOID_TYPE_P (type
))
11873 if (same_type_p (type
, void_type_node
)
11874 && !DECL_NAME (decl
) && !result
&& !chain
&& !ellipsis
)
11875 /* this is a parmlist of `(void)', which is ok. */
11877 incomplete_type_error (decl
, type
);
11878 /* It's not a good idea to actually create parameters of
11879 type `void'; other parts of the compiler assume that a
11880 void type terminates the parameter list. */
11881 type
= error_mark_node
;
11882 TREE_TYPE (decl
) = error_mark_node
;
11885 if (type
!= error_mark_node
)
11887 /* Top-level qualifiers on the parameters are
11888 ignored for function types. */
11889 type
= TYPE_MAIN_VARIANT (type
);
11890 if (TREE_CODE (type
) == METHOD_TYPE
)
11892 cp_error ("parameter `%D' invalidly declared method type", decl
);
11893 type
= build_pointer_type (type
);
11894 TREE_TYPE (decl
) = type
;
11896 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11898 cp_error ("parameter `%D' invalidly declared offset type", decl
);
11899 type
= build_pointer_type (type
);
11900 TREE_TYPE (decl
) = type
;
11902 else if (abstract_virtuals_error (decl
, type
))
11903 any_error
= 1; /* Seems like a good idea. */
11904 else if (POINTER_TYPE_P (type
))
11906 /* [dcl.fct]/6, parameter types cannot contain pointers
11907 (references) to arrays of unknown bound. */
11910 while (POINTER_TYPE_P (t
)
11911 || (TREE_CODE (t
) == ARRAY_TYPE
11912 && TYPE_DOMAIN (t
) != NULL_TREE
))
11914 if (TREE_CODE (t
) == ARRAY_TYPE
)
11915 cp_error ("parameter `%D' includes %s to array of unknown bound `%T'",
11916 decl
, TYPE_PTR_P (type
) ? "pointer" : "reference", t
);
11919 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
11920 if (PROMOTE_PROTOTYPES
11921 && (TREE_CODE (type
) == INTEGER_TYPE
11922 || TREE_CODE (type
) == ENUMERAL_TYPE
)
11923 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
11924 DECL_ARG_TYPE (decl
) = integer_type_node
;
11925 if (!any_error
&& init
)
11926 init
= check_default_argument (decl
, init
);
11931 TREE_CHAIN (decl
) = decls
;
11933 result
= tree_cons (init
, type
, result
);
11935 decls
= nreverse (decls
);
11936 result
= nreverse (result
);
11938 result
= chainon (result
, void_list_node
);
11939 last_function_parms
= decls
;
11944 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
11945 FUNCTION_TYPE with the newly parsed version of its default argument, which
11946 was previously digested as text. See snarf_defarg et al in lex.c. */
11949 replace_defarg (arg
, init
)
11952 if (! processing_template_decl
11953 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
11954 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
11955 TREE_TYPE (init
), TREE_VALUE (arg
));
11956 TREE_PURPOSE (arg
) = init
;
11959 /* D is a constructor or overloaded `operator='. Returns non-zero if
11960 D's arguments allow it to be a copy constructor, or copy assignment
11969 if (!DECL_FUNCTION_MEMBER_P (d
))
11972 t
= FUNCTION_ARG_CHAIN (d
);
11973 if (DECL_CONSTRUCTOR_P (d
) && DECL_HAS_IN_CHARGE_PARM_P (d
))
11974 t
= TREE_CHAIN (t
);
11975 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
11976 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
11977 == DECL_CONTEXT (d
))
11978 && (TREE_CHAIN (t
) == NULL_TREE
11979 || TREE_CHAIN (t
) == void_list_node
11980 || TREE_PURPOSE (TREE_CHAIN (t
))))
11985 /* These memoizing functions keep track of special properties which
11986 a class may have. `grok_ctor_properties' notices whether a class
11987 has a constructor of the form X(X&), and also complains
11988 if the class has a constructor of the form X(X).
11989 `grok_op_properties' takes notice of the various forms of
11990 operator= which are defined, as well as what sorts of type conversion
11991 may apply. Both functions take a FUNCTION_DECL as an argument. */
11994 grok_ctor_properties (ctype
, decl
)
11997 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
11998 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
12000 /* When a type has virtual baseclasses, a magical first int argument is
12001 added to any ctor so we can tell if the class has been initialized
12002 yet. This could screw things up in this function, so we deliberately
12003 ignore the leading int if we're in that situation. */
12004 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
12006 my_friendly_assert (parmtypes
12007 && TREE_VALUE (parmtypes
) == integer_type_node
,
12009 parmtypes
= TREE_CHAIN (parmtypes
);
12010 parmtype
= TREE_VALUE (parmtypes
);
12015 A non-template constructor for class X is a copy constructor if
12016 its first parameter is of type X&, const X&, volatile X& or const
12017 volatile X&, and either there are no other parameters or else all
12018 other parameters have default arguments. */
12019 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
12020 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
12021 && sufficient_parms_p (TREE_CHAIN (parmtypes
))
12022 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12023 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12025 TYPE_HAS_INIT_REF (ctype
) = 1;
12026 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12027 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
12031 A declaration of a constructor for a class X is ill-formed if its
12032 first parameter is of type (optionally cv-qualified) X and either
12033 there are no other parameters or else all other parameters have
12036 We *don't* complain about member template instantiations that
12037 have this form, though; they can occur as we try to decide what
12038 constructor to use during overload resolution. Since overload
12039 resolution will never prefer such a constructor to the
12040 non-template copy constructor (which is either explicitly or
12041 implicitly defined), there's no need to worry about their
12042 existence. Theoretically, they should never even be
12043 instantiated, but that's hard to forestall. */
12044 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
12045 && sufficient_parms_p (TREE_CHAIN (parmtypes
))
12046 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12047 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12049 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
12051 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
12054 else if (TREE_CODE (parmtype
) == VOID_TYPE
12055 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
12056 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
12061 /* An operator with this code is unary, but can also be binary. */
12065 enum tree_code code
;
12067 return (code
== INDIRECT_REF
12068 || code
== ADDR_EXPR
12069 || code
== CONVERT_EXPR
12070 || code
== NEGATE_EXPR
12071 || code
== PREINCREMENT_EXPR
12072 || code
== PREDECREMENT_EXPR
);
12075 /* An operator with this name can only be unary. */
12079 enum tree_code code
;
12081 return (code
== TRUTH_NOT_EXPR
12082 || code
== BIT_NOT_EXPR
12083 || code
== COMPONENT_REF
12084 || code
== TYPE_EXPR
);
12087 /* Do a little sanity-checking on how they declared their operator. */
12090 grok_op_properties (decl
, virtualp
, friendp
)
12092 int virtualp
, friendp
;
12094 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
12096 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
12097 tree name
= DECL_NAME (decl
);
12098 enum tree_code operator_code
;
12101 /* Count the number of arguments. */
12102 for (argtype
= argtypes
, arity
= 0;
12103 argtype
&& argtype
!= void_list_node
;
12104 argtype
= TREE_CHAIN (argtype
))
12107 if (current_class_type
== NULL_TREE
)
12110 if (DECL_CONV_FN_P (decl
))
12111 operator_code
= TYPE_EXPR
;
12115 #define DEF_OPERATOR(NAME, CODE, NEW_MANGLING, OLD_MANGING, ARITY, ASSN_P) \
12116 if (ansi_opname (CODE) == name) \
12118 operator_code = CODE; \
12121 else if (ansi_assopname (CODE) == name) \
12123 operator_code = CODE; \
12124 DECL_ASSIGNMENT_OPERATOR_P (decl) = 1; \
12128 #include "operators.def"
12129 #undef DEF_OPERATOR
12131 my_friendly_abort (20000527);
12134 my_friendly_assert (operator_code
!= LAST_CPLUS_TREE_CODE
, 20000526);
12135 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12139 switch (operator_code
)
12142 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
12146 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
12149 case COMPONENT_REF
:
12151 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
12155 TYPE_HAS_NEW_OPERATOR (current_class_type
) = 1;
12159 TYPE_GETS_DELETE (current_class_type
) |= 1;
12163 TYPE_HAS_ARRAY_NEW_OPERATOR (current_class_type
) = 1;
12166 case VEC_DELETE_EXPR
:
12167 TYPE_GETS_DELETE (current_class_type
) |= 2;
12175 if (operator_code
== NEW_EXPR
|| operator_code
== VEC_NEW_EXPR
)
12177 /* When the compiler encounters the definition of A::operator new, it
12178 doesn't look at the class declaration to find out if it's static. */
12180 revert_static_member_fn (decl
);
12182 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
12184 else if (operator_code
== DELETE_EXPR
|| operator_code
== VEC_DELETE_EXPR
)
12187 revert_static_member_fn (decl
);
12189 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
12193 /* An operator function must either be a non-static member function
12194 or have at least one parameter of a class, a reference to a class,
12195 an enumeration, or a reference to an enumeration. 13.4.0.6 */
12196 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
12198 if (operator_code
== TYPE_EXPR
12199 || operator_code
== CALL_EXPR
12200 || operator_code
== COMPONENT_REF
12201 || operator_code
== ARRAY_REF
12202 || operator_code
== NOP_EXPR
)
12203 cp_error ("`%D' must be a nonstatic member function", decl
);
12208 if (DECL_STATIC_FUNCTION_P (decl
))
12209 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
12212 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
12214 tree arg
= TREE_VALUE (p
);
12215 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
12216 arg
= TREE_TYPE (arg
);
12218 /* This lets bad template code slip through. */
12219 if (IS_AGGR_TYPE (arg
)
12220 || TREE_CODE (arg
) == ENUMERAL_TYPE
12221 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
12222 || TREE_CODE (arg
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
12226 ("`%D' must have an argument of class or enumerated type",
12233 if (operator_code
== CALL_EXPR
)
12234 return; /* No restrictions on args. */
12236 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
12238 tree t
= TREE_TYPE (name
);
12241 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
12242 const char *what
= 0;
12245 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
12247 if (TREE_CODE (t
) == VOID_TYPE
)
12249 else if (t
== current_class_type
)
12250 what
= "the same type";
12251 /* Don't force t to be complete here. */
12252 else if (IS_AGGR_TYPE (t
)
12253 && COMPLETE_TYPE_P (t
)
12254 && DERIVED_FROM_P (t
, current_class_type
))
12255 what
= "a base class";
12258 warning ("conversion to %s%s will never use a type conversion operator",
12259 ref
? "a reference to " : "", what
);
12263 if (DECL_ASSIGNMENT_OPERATOR_P (decl
)
12264 && operator_code
== NOP_EXPR
)
12268 if (arity
!= 2 && methodp
)
12270 cp_error ("`%D' must take exactly one argument", decl
);
12273 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
12277 A user-declared copy assignment operator X::operator= is
12278 a non-static non-template member function of class X with
12279 exactly one parameter of type X, X&, const X&, volatile
12280 X& or const volatile X&. */
12281 if (copy_assignment_arg_p (parmtype
, virtualp
)
12282 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12283 && is_member_template (DECL_TI_TEMPLATE (decl
)))
12286 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
12287 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
12288 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12289 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
12292 else if (operator_code
== COND_EXPR
)
12295 cp_error ("ISO C++ prohibits overloading operator ?:");
12297 else if (ambi_op_p (operator_code
))
12300 /* We pick the one-argument operator codes by default, so
12301 we don't have to change anything. */
12303 else if (arity
== 2)
12305 /* If we thought this was a unary operator, we now know
12306 it to be a binary operator. */
12307 switch (operator_code
)
12310 operator_code
= MULT_EXPR
;
12314 operator_code
= BIT_AND_EXPR
;
12318 operator_code
= PLUS_EXPR
;
12322 operator_code
= MINUS_EXPR
;
12325 case PREINCREMENT_EXPR
:
12326 operator_code
= POSTINCREMENT_EXPR
;
12329 case PREDECREMENT_EXPR
:
12330 operator_code
= POSTDECREMENT_EXPR
;
12334 my_friendly_abort (20000527);
12337 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12339 if ((operator_code
== POSTINCREMENT_EXPR
12340 || operator_code
== POSTDECREMENT_EXPR
)
12341 && ! processing_template_decl
12342 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
12345 cp_error ("postfix `%D' must take `int' as its argument",
12349 ("postfix `%D' must take `int' as its second argument",
12356 cp_error ("`%D' must take either zero or one argument", decl
);
12358 cp_error ("`%D' must take either one or two arguments", decl
);
12361 /* More Effective C++ rule 6. */
12363 && (operator_code
== POSTINCREMENT_EXPR
12364 || operator_code
== POSTDECREMENT_EXPR
12365 || operator_code
== PREINCREMENT_EXPR
12366 || operator_code
== PREDECREMENT_EXPR
))
12368 tree arg
= TREE_VALUE (argtypes
);
12369 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
12370 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
12371 arg
= TREE_TYPE (arg
);
12372 arg
= TYPE_MAIN_VARIANT (arg
);
12373 if (operator_code
== PREINCREMENT_EXPR
12374 || operator_code
== PREDECREMENT_EXPR
)
12376 if (TREE_CODE (ret
) != REFERENCE_TYPE
12377 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
12379 cp_warning ("prefix `%D' should return `%T'", decl
,
12380 build_reference_type (arg
));
12384 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
12385 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
12389 else if (unary_op_p (operator_code
))
12394 cp_error ("`%D' must take `void'", decl
);
12396 cp_error ("`%D' must take exactly one argument", decl
);
12399 else /* if (binary_op_p (operator_code)) */
12404 cp_error ("`%D' must take exactly one argument", decl
);
12406 cp_error ("`%D' must take exactly two arguments", decl
);
12409 /* More Effective C++ rule 7. */
12411 && (operator_code
== TRUTH_ANDIF_EXPR
12412 || operator_code
== TRUTH_ORIF_EXPR
12413 || operator_code
== COMPOUND_EXPR
))
12414 cp_warning ("user-defined `%D' always evaluates both arguments",
12418 /* Effective C++ rule 23. */
12421 && (operator_code
== PLUS_EXPR
12422 || operator_code
== MINUS_EXPR
12423 || operator_code
== TRUNC_DIV_EXPR
12424 || operator_code
== MULT_EXPR
)
12425 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
12426 cp_warning ("`%D' should return by value", decl
);
12429 for (; argtypes
&& argtypes
!= void_list_node
;
12430 argtypes
= TREE_CHAIN (argtypes
))
12431 if (TREE_PURPOSE (argtypes
))
12433 TREE_PURPOSE (argtypes
) = NULL_TREE
;
12434 if (operator_code
== POSTINCREMENT_EXPR
12435 || operator_code
== POSTDECREMENT_EXPR
)
12438 cp_pedwarn ("`%D' cannot have default arguments", decl
);
12441 cp_error ("`%D' cannot have default arguments", decl
);
12447 static const char *
12449 enum tag_types code
;
12462 my_friendly_abort (981122);
12466 /* Get the struct, enum or union (CODE says which) with tag NAME.
12467 Define the tag as a forward-reference if it is not defined.
12469 C++: If a class derivation is given, process it here, and report
12470 an error if multiple derivation declarations are not identical.
12472 If this is a definition, come in through xref_tag and only look in
12473 the current frame for the name (since C++ allows new names in any
12477 xref_tag (code_type_node
, name
, globalize
)
12478 tree code_type_node
;
12482 enum tag_types tag_code
;
12483 enum tree_code code
;
12484 register tree ref
, t
;
12485 struct binding_level
*b
= current_binding_level
;
12487 tree attributes
= NULL_TREE
;
12488 tree context
= NULL_TREE
;
12490 /* If we are called from the parser, code_type_node will sometimes be a
12491 TREE_LIST. This indicates that the user wrote
12492 "class __attribute__ ((foo)) bar". Extract the attributes so we can
12494 if (TREE_CODE (code_type_node
) == TREE_LIST
)
12496 attributes
= TREE_PURPOSE (code_type_node
);
12497 code_type_node
= TREE_VALUE (code_type_node
);
12500 tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12505 code
= RECORD_TYPE
;
12511 code
= ENUMERAL_TYPE
;
12514 my_friendly_abort (18);
12517 /* If a cross reference is requested, look up the type
12518 already defined for this tag and return it. */
12522 name
= TYPE_IDENTIFIER (t
);
12526 t
= IDENTIFIER_TYPE_VALUE (name
);
12528 /* Warn about 'friend struct Inherited;' doing the wrong thing. */
12529 if (t
&& globalize
&& TREE_CODE (t
) == TYPENAME_TYPE
)
12531 static int explained
;
12533 cp_warning ("`%s %T' declares a new type at namespace scope;\n\
12534 to refer to the inherited type, say `%s %T::%T'%s",
12535 tag_name (tag_code
), name
, tag_name (tag_code
),
12536 constructor_name (current_class_type
), TYPE_IDENTIFIER (t
),
12538 (names from dependent base classes are not visible to unqualified name lookup)"
12544 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
12545 && TREE_CODE (t
) != BOUND_TEMPLATE_TEMPLATE_PARM
)
12550 /* If we know we are defining this tag, only look it up in
12551 this scope and don't try to find it as a type. */
12552 ref
= lookup_tag (code
, name
, b
, 1);
12558 /* [dcl.type.elab] If the identifier resolves to a
12559 typedef-name or a template type-parameter, the
12560 elaborated-type-specifier is ill-formed. */
12561 if (t
!= TYPE_MAIN_VARIANT (t
)
12562 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
12563 cp_pedwarn ("using typedef-name `%D' after `%s'",
12564 TYPE_NAME (t
), tag_name (tag_code
));
12565 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12566 cp_error ("using template type parameter `%T' after `%s'",
12567 t
, tag_name (tag_code
));
12572 ref
= lookup_tag (code
, name
, b
, 0);
12576 /* Try finding it as a type declaration. If that wins,
12578 ref
= lookup_name (name
, 1);
12580 if (ref
!= NULL_TREE
12581 && processing_template_decl
12582 && DECL_CLASS_TEMPLATE_P (ref
)
12583 && template_class_depth (current_class_type
) == 0)
12584 /* Since GLOBALIZE is true, we're declaring a global
12585 template, so we want this type. */
12586 ref
= DECL_TEMPLATE_RESULT (ref
);
12588 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12589 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12590 ref
= TREE_TYPE (ref
);
12595 if (ref
&& current_class_type
12596 && template_class_depth (current_class_type
)
12597 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12599 /* Since GLOBALIZE is non-zero, we are not looking at a
12600 definition of this tag. Since, in addition, we are currently
12601 processing a (member) template declaration of a template
12602 class, we must be very careful; consider:
12609 { template <class V>
12610 friend struct S1; };
12612 Here, the S2::S1 declaration should not be confused with the
12613 outer declaration. In particular, the inner version should
12614 have a template parameter of level 2, not level 1. This
12615 would be particularly important if the member declaration
12618 template <class V = U> friend struct S1;
12620 say, when we should tsubst into `U' when instantiating
12621 S2. On the other hand, when presented with:
12631 we must find the inner binding eventually. We
12632 accomplish this by making sure that the new type we
12633 create to represent this declaration has the right
12635 context
= TYPE_CONTEXT (ref
);
12642 /* If no such tag is yet defined, create a forward-reference node
12643 and record it as the "definition".
12644 When a real declaration of this type is found,
12645 the forward-reference will be altered into a real type. */
12646 if (code
== ENUMERAL_TYPE
)
12648 cp_error ("use of enum `%#D' without previous declaration", name
);
12650 ref
= make_node (ENUMERAL_TYPE
);
12652 /* Give the type a default layout like unsigned int
12653 to avoid crashing if it does not get defined. */
12654 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12655 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12656 TYPE_USER_ALIGN (ref
) = 0;
12657 TREE_UNSIGNED (ref
) = 1;
12658 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12659 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12660 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12662 /* Enable us to recognize when a type is created in class context.
12663 To do nested classes correctly, this should probably be cleared
12664 out when we leave this classes scope. Currently this in only
12665 done in `start_enum'. */
12667 pushtag (name
, ref
, globalize
);
12671 struct binding_level
*old_b
= class_binding_level
;
12673 ref
= make_aggr_type (code
);
12674 TYPE_CONTEXT (ref
) = context
;
12676 #ifdef NONNESTED_CLASSES
12677 /* Class types don't nest the way enums do. */
12678 class_binding_level
= (struct binding_level
*)0;
12680 pushtag (name
, ref
, globalize
);
12681 class_binding_level
= old_b
;
12686 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12687 redeclare_class_template (ref
, current_template_parms
);
12690 /* Until the type is defined, tentatively accept whatever
12691 structure tag the user hands us. */
12692 if (!COMPLETE_TYPE_P (ref
)
12693 && ref
!= current_class_type
12694 /* Have to check this, in case we have contradictory tag info. */
12695 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12697 if (tag_code
== class_type
)
12698 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12699 else if (tag_code
== record_type
)
12700 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12703 TREE_TYPE (ref
) = attributes
;
12709 xref_tag_from_type (old
, id
, globalize
)
12713 tree code_type_node
;
12715 if (TREE_CODE (old
) == RECORD_TYPE
)
12716 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12717 ? class_type_node
: record_type_node
);
12719 code_type_node
= union_type_node
;
12721 if (id
== NULL_TREE
)
12722 id
= TYPE_IDENTIFIER (old
);
12724 return xref_tag (code_type_node
, id
, globalize
);
12727 /* REF is a type (named NAME), for which we have just seen some
12728 baseclasses. BINFO is a list of those baseclasses; the
12729 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12730 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12731 struct, or union. */
12734 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12735 tree code_type_node
;
12739 /* In the declaration `A : X, Y, ... Z' we mark all the types
12740 (A, X, Y, ..., Z) so we can check for duplicates. */
12745 enum tag_types tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12747 if (tag_code
== union_type
)
12749 cp_error ("derived union `%T' invalid", ref
);
12753 len
= list_length (binfo
);
12755 /* First, make sure that any templates in base-classes are
12756 instantiated. This ensures that if we call ourselves recursively
12757 we do not get confused about which classes are marked and which
12759 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12760 complete_type (TREE_VALUE (base
));
12762 SET_CLASSTYPE_MARKED (ref
);
12763 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12765 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12767 /* The base of a derived struct is public by default. */
12769 = (TREE_PURPOSE (binfo
) == access_public_node
12770 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12771 || (tag_code
!= class_type
12772 && (TREE_PURPOSE (binfo
) == access_default_node
12773 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12775 = (TREE_PURPOSE (binfo
) == access_protected_node
12776 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12778 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12779 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12780 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12781 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12782 tree basetype
= TREE_VALUE (binfo
);
12785 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12786 basetype
= TREE_TYPE (basetype
);
12788 || (TREE_CODE (basetype
) != RECORD_TYPE
12789 && TREE_CODE (basetype
) != TYPENAME_TYPE
12790 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12791 && TREE_CODE (basetype
) != BOUND_TEMPLATE_TEMPLATE_PARM
))
12793 cp_error ("base type `%T' fails to be a struct or class type",
12794 TREE_VALUE (binfo
));
12798 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12800 /* This code replaces similar code in layout_basetypes.
12801 We put the complete_type first for implicit `typename'. */
12802 if (!COMPLETE_TYPE_P (basetype
)
12803 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12805 cp_error ("base class `%T' has incomplete type", basetype
);
12810 if (CLASSTYPE_MARKED (basetype
))
12812 if (basetype
== ref
)
12813 cp_error ("recursive type `%T' undefined", basetype
);
12815 cp_error ("duplicate base type `%T' invalid", basetype
);
12819 if (TYPE_FOR_JAVA (basetype
)
12820 && (current_lang_stack
12821 == &VARRAY_TREE (current_lang_base
, 0)))
12822 TYPE_FOR_JAVA (ref
) = 1;
12824 /* Note that the BINFO records which describe individual
12825 inheritances are *not* shared in the lattice! They
12826 cannot be shared because a given baseclass may be
12827 inherited with different `accessibility' by different
12828 derived classes. (Each BINFO record describing an
12829 individual inheritance contains flags which say what
12830 the `accessibility' of that particular inheritance is.) */
12833 = make_binfo (size_zero_node
, basetype
,
12834 CLASS_TYPE_P (basetype
)
12835 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
12836 CLASS_TYPE_P (basetype
)
12837 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
12839 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
12840 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
12841 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
12842 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
12843 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
12845 /* We need to unshare the binfos now so that lookups during class
12846 definition work. */
12847 unshare_base_binfos (base_binfo
);
12849 SET_CLASSTYPE_MARKED (basetype
);
12851 /* We are free to modify these bits because they are meaningless
12852 at top level, and BASETYPE is a top-level type. */
12853 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
12855 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
12856 /* Converting to a virtual base class requires looking
12857 up the offset of the virtual base. */
12858 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
12861 if (CLASS_TYPE_P (basetype
))
12863 TYPE_HAS_NEW_OPERATOR (ref
)
12864 |= TYPE_HAS_NEW_OPERATOR (basetype
);
12865 TYPE_HAS_ARRAY_NEW_OPERATOR (ref
)
12866 |= TYPE_HAS_ARRAY_NEW_OPERATOR (basetype
);
12867 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
12868 /* If the base-class uses multiple inheritance, so do we. */
12869 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
12870 |= TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
12871 /* Likewise, if converting to a base of the base may require
12872 code, then we may need to generate code to convert to a
12874 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
)
12875 |= TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (basetype
);
12882 TREE_VEC_LENGTH (binfos
) = i
;
12884 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
12888 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
12889 /* If there is more than one non-empty they cannot be at the same
12891 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
12894 /* Unmark all the types. */
12896 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
12897 CLEAR_CLASSTYPE_MARKED (ref
);
12899 /* Now that we know all the base-classes, set up the list of virtual
12901 get_vbase_types (ref
);
12905 /* Begin compiling the definition of an enumeration type.
12906 NAME is its name (or null if anonymous).
12907 Returns the type object, as yet incomplete.
12908 Also records info about it so that build_enumerator
12909 may be used to declare the individual values as they are read. */
12915 register tree enumtype
= NULL_TREE
;
12916 struct binding_level
*b
= current_binding_level
;
12918 /* If this is the real definition for a previous forward reference,
12919 fill in the contents in the same object that used to be the
12920 forward reference. */
12922 if (name
!= NULL_TREE
)
12923 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
12925 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
12927 cp_error ("multiple definition of `%#T'", enumtype
);
12928 cp_error_at ("previous definition here", enumtype
);
12929 /* Clear out TYPE_VALUES, and start again. */
12930 TYPE_VALUES (enumtype
) = NULL_TREE
;
12934 enumtype
= make_node (ENUMERAL_TYPE
);
12935 pushtag (name
, enumtype
, 0);
12938 if (current_class_type
)
12939 TREE_ADDRESSABLE (b
->tags
) = 1;
12941 GNU_xref_decl (current_function_decl
, enumtype
);
12945 /* After processing and defining all the values of an enumeration type,
12946 install their decls in the enumeration type and finish it off.
12947 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12948 Returns ENUMTYPE. */
12951 finish_enum (enumtype
)
12954 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
12955 /* Calculate the maximum value of any enumerator in this type. */
12957 tree values
= TYPE_VALUES (enumtype
);
12962 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
12967 /* The TREE_VALUE is a CONST_DECL for this enumeration
12969 decl
= TREE_VALUE (pair
);
12973 Following the closing brace of an enum-specifier, each
12974 enumerator has the type of its enumeration. Prior to the
12975 closing brace, the type of each enumerator is the type of
12976 its initializing value. */
12977 TREE_TYPE (decl
) = enumtype
;
12979 /* The DECL_INITIAL will be NULL if we are processing a
12980 template declaration and this enumeration constant had no
12981 explicit initializer. */
12982 value
= DECL_INITIAL (decl
);
12983 if (value
&& !processing_template_decl
)
12985 /* Set the TREE_TYPE for the VALUE as well. That's so
12986 that when we call decl_constant_value we get an
12987 entity of the right type (but with the constant
12988 value). Since we shouldn't ever call
12989 decl_constant_value on a template type, there's no
12990 reason to do that when processing_template_decl.
12991 And, if the expression is something like a
12992 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12993 wreak havoc on the intended type of the expression.
12995 Of course, there's also no point in trying to compute
12996 minimum or maximum values if we're in a template. */
12997 TREE_TYPE (value
) = enumtype
;
13000 minnode
= maxnode
= value
;
13001 else if (tree_int_cst_lt (maxnode
, value
))
13003 else if (tree_int_cst_lt (value
, minnode
))
13007 if (processing_template_decl
)
13008 /* If this is just a template, leave the CONST_DECL
13009 alone. That way tsubst_copy will find CONST_DECLs for
13010 CONST_DECLs, and not INTEGER_CSTs. */
13013 /* In the list we're building up, we want the enumeration
13014 values, not the CONST_DECLs. */
13015 TREE_VALUE (pair
) = value
;
13019 maxnode
= minnode
= integer_zero_node
;
13021 TYPE_VALUES (enumtype
) = nreverse (values
);
13023 if (processing_template_decl
)
13025 tree scope
= current_scope ();
13026 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
13027 add_stmt (build_min (TAG_DEFN
, enumtype
));
13031 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
13032 int lowprec
= min_precision (minnode
, unsignedp
);
13033 int highprec
= min_precision (maxnode
, unsignedp
);
13034 int precision
= MAX (lowprec
, highprec
);
13037 TYPE_SIZE (enumtype
) = NULL_TREE
;
13039 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
13041 TYPE_PRECISION (enumtype
) = precision
;
13043 fixup_unsigned_type (enumtype
);
13045 fixup_signed_type (enumtype
);
13047 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
13048 /* Use the width of the narrowest normal C type which is wide
13050 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
13053 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
13055 TYPE_SIZE (enumtype
) = 0;
13056 layout_type (enumtype
);
13058 /* Fix up all variant types of this enum type. */
13059 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
13060 tem
= TYPE_NEXT_VARIANT (tem
))
13062 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
13063 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
13064 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
13065 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
13066 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
13067 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
13068 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
13069 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
13070 TYPE_USER_ALIGN (tem
) = TYPE_USER_ALIGN (enumtype
);
13071 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
13074 /* Finish debugging output for this type. */
13075 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
13081 /* Build and install a CONST_DECL for an enumeration constant of the
13082 enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided.
13083 Assignment of sequential values by default is handled here. */
13086 build_enumerator (name
, value
, enumtype
)
13096 /* Remove no-op casts from the value. */
13098 STRIP_TYPE_NOPS (value
);
13100 if (! processing_template_decl
)
13102 /* Validate and default VALUE. */
13103 if (value
!= NULL_TREE
)
13105 value
= decl_constant_value (value
);
13107 if (TREE_CODE (value
) == INTEGER_CST
)
13109 value
= default_conversion (value
);
13110 constant_expression_warning (value
);
13114 cp_error ("enumerator value for `%D' not integer constant", name
);
13119 /* Default based on previous value. */
13120 if (value
== NULL_TREE
&& ! processing_template_decl
)
13124 if (TYPE_VALUES (enumtype
))
13126 /* The next value is the previous value ... */
13127 prev_value
= DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype
)));
13128 /* ... plus one. */
13129 value
= cp_build_binary_op (PLUS_EXPR
,
13133 if (tree_int_cst_lt (value
, prev_value
))
13134 cp_error ("overflow in enumeration values at `%D'", name
);
13137 value
= integer_zero_node
;
13140 /* Remove no-op casts from the value. */
13142 STRIP_TYPE_NOPS (value
);
13144 /* To fix MAX_VAL enum consts. (bkoz) */
13145 TREE_TYPE (value
) = integer_type_node
;
13149 /* We always have to copy here; not all INTEGER_CSTs are unshared.
13150 Even in other cases, we will later (in finish_enum) be setting
13151 the type of VALUE. But, we don't need to make a copy if this
13152 VALUE is one of the enumeration constants for this same
13153 enumeration type. */
13154 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
13155 if (TREE_VALUE (values
) == value
)
13157 /* If we didn't break out of the loop, then we do need a copy. */
13158 if (!values
&& value
)
13159 value
= copy_node (value
);
13161 /* C++ associates enums with global, function, or class declarations. */
13162 context
= current_scope ();
13164 /* Build the actual enumeration constant. Note that the enumeration
13165 constants have the type of their initializers until the
13166 enumeration is complete:
13170 Following the closing brace of an enum-specifier, each enumer-
13171 ator has the type of its enumeration. Prior to the closing
13172 brace, the type of each enumerator is the type of its
13173 initializing value.
13175 In finish_enum we will reset the type. Of course, if we're
13176 processing a template, there may be no value. */
13177 type
= value
? TREE_TYPE (value
) : NULL_TREE
;
13179 if (context
&& context
== current_class_type
)
13180 /* This enum declaration is local to the class. We need the full
13181 lang_decl so that we can record DECL_CLASS_CONTEXT, for example. */
13182 decl
= build_lang_decl (CONST_DECL
, name
, type
);
13184 /* It's a global enum, or it's local to a function. (Note local to
13185 a function could mean local to a class method. */
13186 decl
= build_decl (CONST_DECL
, name
, type
);
13188 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
13189 DECL_INITIAL (decl
) = value
;
13190 TREE_READONLY (decl
) = 1;
13192 if (context
&& context
== current_class_type
)
13193 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
13194 on the TYPE_FIELDS list for `S'. (That's so that you can say
13195 things like `S::i' later.) */
13196 finish_member_declaration (decl
);
13200 GNU_xref_decl (current_function_decl
, decl
);
13203 /* Add this enumeration constant to the list for this type. */
13204 TYPE_VALUES (enumtype
) = tree_cons (name
, decl
, TYPE_VALUES (enumtype
));
13208 /* We're defining DECL. Make sure that it's type is OK. */
13211 check_function_type (decl
, current_function_parms
)
13213 tree current_function_parms
;
13215 tree fntype
= TREE_TYPE (decl
);
13216 tree return_type
= complete_type (TREE_TYPE (fntype
));
13218 /* In a function definition, arg types must be complete. */
13219 require_complete_types_for_parms (current_function_parms
);
13221 if (!COMPLETE_OR_VOID_TYPE_P (return_type
))
13223 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
13225 /* Make it return void instead, but don't change the
13226 type of the DECL_RESULT, in case we have a named return value. */
13227 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13229 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
13231 = build_cplus_method_type (ctype
,
13233 FUNCTION_ARG_CHAIN (decl
));
13237 = build_function_type (void_type_node
,
13238 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
13240 = build_exception_variant (fntype
,
13241 TYPE_RAISES_EXCEPTIONS (fntype
));
13244 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
13247 /* Create the FUNCTION_DECL for a function definition.
13248 DECLSPECS and DECLARATOR are the parts of the declaration;
13249 they describe the function's name and the type it returns,
13250 but twisted together in a fashion that parallels the syntax of C.
13252 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
13253 DECLARATOR is really the DECL for the function we are about to
13254 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
13255 indicating that the function is an inline defined in-class.
13257 This function creates a binding context for the function body
13258 as well as setting up the FUNCTION_DECL in current_function_decl.
13260 Returns 1 on success. If the DECLARATOR is not suitable for a function
13261 (it defines a datum instead), we return 0, which tells
13262 yyparse to report a parse error.
13264 For C++, we must first check whether that datum makes any sense.
13265 For example, "class A local_a(1,2);" means that variable local_a
13266 is an aggregate of type A, which should have a constructor
13267 applied to it with the argument list [1, 2]. */
13270 start_function (declspecs
, declarator
, attrs
, flags
)
13271 tree declspecs
, declarator
, attrs
;
13275 tree ctype
= NULL_TREE
;
13278 extern int have_extern_spec
;
13279 extern int used_extern_spec
;
13280 int doing_friend
= 0;
13281 struct binding_level
*bl
;
13282 tree current_function_parms
;
13284 /* Sanity check. */
13285 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
13286 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
13288 /* This should only be done once on the top most decl. */
13289 if (have_extern_spec
&& !used_extern_spec
)
13291 declspecs
= tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
13292 used_extern_spec
= 1;
13295 if (flags
& SF_PRE_PARSED
)
13297 decl1
= declarator
;
13299 fntype
= TREE_TYPE (decl1
);
13300 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13301 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13303 /* ISO C++ 11.4/5. A friend function defined in a class is in
13304 the (lexical) scope of the class in which it is defined. */
13305 if (!ctype
&& DECL_FRIEND_P (decl1
))
13307 ctype
= DECL_FRIEND_CONTEXT (decl1
);
13309 /* CTYPE could be null here if we're dealing with a template;
13310 for example, `inline friend float foo()' inside a template
13311 will have no CTYPE set. */
13312 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
13318 last_function_parms
= DECL_ARGUMENTS (decl1
);
13319 last_function_parm_tags
= NULL_TREE
;
13323 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
13324 /* If the declarator is not suitable for a function definition,
13325 cause a syntax error. */
13326 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
13328 fntype
= TREE_TYPE (decl1
);
13330 restype
= TREE_TYPE (fntype
);
13331 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
13333 cp_error ("semicolon missing after declaration of `%#T'", restype
);
13334 shadow_tag (build_tree_list (NULL_TREE
, restype
));
13335 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
13336 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
13337 fntype
= build_function_type (integer_type_node
,
13338 TYPE_ARG_TYPES (fntype
));
13340 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
13342 TYPE_ARG_TYPES (fntype
));
13343 TREE_TYPE (decl1
) = fntype
;
13346 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13347 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13348 else if (DECL_MAIN_P (decl1
))
13350 /* If this doesn't return integer_type, complain. */
13351 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
13353 if (pedantic
|| warn_return_type
)
13354 pedwarn ("return type for `main' changed to `int'");
13355 TREE_TYPE (decl1
) = fntype
= default_function_type
;
13360 /* Sometimes we don't notice that a function is a static member, and
13361 build a METHOD_TYPE for it. Fix that up now. */
13362 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
)
13363 && TREE_CODE (TREE_TYPE (decl1
)) == METHOD_TYPE
)
13365 revert_static_member_fn (decl1
);
13366 last_function_parms
= TREE_CHAIN (last_function_parms
);
13370 /* Warn if function was previously implicitly declared
13371 (but not if we warned then). */
13372 if (! warn_implicit
13373 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
13374 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
13376 /* Set up current_class_type, and enter the scope of the class, if
13379 push_nested_class (ctype
, 1);
13380 else if (DECL_STATIC_FUNCTION_P (decl1
))
13381 push_nested_class (DECL_CONTEXT (decl1
), 2);
13383 /* Now that we have entered the scope of the class, we must restore
13384 the bindings for any template parameters surrounding DECL1, if it
13385 is an inline member template. (Order is important; consider the
13386 case where a template parameter has the same name as a field of
13387 the class.) It is not until after this point that
13388 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
13389 if (flags
& SF_INCLASS_INLINE
)
13390 maybe_begin_member_template_processing (decl1
);
13392 /* Effective C++ rule 15. */
13394 && DECL_OVERLOADED_OPERATOR_P (decl1
) == NOP_EXPR
13395 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
13396 cp_warning ("`operator=' should return a reference to `*this'");
13398 /* Make the init_value nonzero so pushdecl knows this is not tentative.
13399 error_mark_node is replaced below (in poplevel) with the BLOCK. */
13400 if (!DECL_INITIAL (decl1
))
13401 DECL_INITIAL (decl1
) = error_mark_node
;
13403 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
13404 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
13407 /* This function exists in static storage.
13408 (This does not mean `static' in the C sense!) */
13409 TREE_STATIC (decl1
) = 1;
13411 /* We must call push_template_decl after current_class_type is set
13412 up. (If we are processing inline definitions after exiting a
13413 class scope, current_class_type will be NULL_TREE until set above
13414 by push_nested_class.) */
13415 if (processing_template_decl
)
13416 decl1
= push_template_decl (decl1
);
13418 /* We are now in the scope of the function being defined. */
13419 current_function_decl
= decl1
;
13421 /* Save the parm names or decls from this function's declarator
13422 where store_parm_decls will find them. */
13423 current_function_parms
= last_function_parms
;
13424 current_function_parm_tags
= last_function_parm_tags
;
13426 /* Make sure the parameter and return types are reasonable. When
13427 you declare a function, these types can be incomplete, but they
13428 must be complete when you define the function. */
13429 if (! processing_template_decl
)
13430 check_function_type (decl1
, current_function_parms
);
13432 /* Build the return declaration for the function. */
13433 restype
= TREE_TYPE (fntype
);
13434 if (!processing_template_decl
)
13436 if (!DECL_RESULT (decl1
))
13438 DECL_RESULT (decl1
)
13439 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13440 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype
),
13441 DECL_RESULT (decl1
));
13445 /* Just use `void'. Nobody will ever look at this anyhow. */
13446 DECL_RESULT (decl1
) = build_decl (RESULT_DECL
, 0, void_type_node
);
13448 /* Initialize RTL machinery. We cannot do this until
13449 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
13450 even when processing a template; this is how we get
13451 CFUN set up, and our per-function variables initialized.
13452 FIXME factor out the non-RTL stuff. */
13453 bl
= current_binding_level
;
13454 init_function_start (decl1
, input_filename
, lineno
);
13455 current_binding_level
= bl
;
13457 /* Even though we're inside a function body, we still don't want to
13458 call expand_expr to calculate the size of a variable-sized array.
13459 We haven't necessarily assigned RTL to all variables yet, so it's
13460 not safe to try to expand expressions involving them. */
13461 immediate_size_expand
= 0;
13462 cfun
->x_dont_save_pending_sizes_p
= 1;
13464 /* Start the statement-tree, start the tree now. */
13465 begin_stmt_tree (&DECL_SAVED_TREE (decl1
));
13467 /* Let the user know we're compiling this function. */
13468 announce_function (decl1
);
13470 /* Record the decl so that the function name is defined.
13471 If we already have a decl for this name, and it is a FUNCTION_DECL,
13472 use the old decl. */
13473 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
13475 /* A specialization is not used to guide overload resolution. */
13476 if (!DECL_TEMPLATE_SPECIALIZATION (decl1
)
13477 && ! DECL_FUNCTION_MEMBER_P (decl1
))
13478 decl1
= pushdecl (decl1
);
13481 /* We need to set the DECL_CONTEXT. */
13482 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
13483 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
13484 /* And make sure we have enough default args. */
13485 check_default_args (decl1
);
13487 fntype
= TREE_TYPE (decl1
);
13490 /* Reset these in case the call to pushdecl changed them. */
13491 current_function_decl
= decl1
;
13492 cfun
->decl
= decl1
;
13494 /* If we are (erroneously) defining a function that we have already
13495 defined before, wipe out what we knew before. */
13496 if (!DECL_PENDING_INLINE_P (decl1
)
13497 && DECL_SAVED_FUNCTION_DATA (decl1
))
13499 free (DECL_SAVED_FUNCTION_DATA (decl1
));
13500 DECL_SAVED_FUNCTION_DATA (decl1
) = NULL
;
13503 if (ctype
&& !doing_friend
&& !DECL_STATIC_FUNCTION_P (decl1
))
13505 /* We know that this was set up by `grokclassfn'. We do not
13506 wait until `store_parm_decls', since evil parse errors may
13507 never get us to that point. Here we keep the consistency
13508 between `current_class_type' and `current_class_ptr'. */
13509 tree t
= DECL_ARGUMENTS (decl1
);
13511 my_friendly_assert (t
!= NULL_TREE
&& TREE_CODE (t
) == PARM_DECL
,
13513 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
13516 cp_function_chain
->x_current_class_ref
13517 = build_indirect_ref (t
, NULL_PTR
);
13518 cp_function_chain
->x_current_class_ptr
= t
;
13520 /* Constructors and destructors need to know whether they're "in
13521 charge" of initializing virtual base classes. */
13522 if (DECL_HAS_IN_CHARGE_PARM_P (decl1
))
13523 current_in_charge_parm
= TREE_CHAIN (t
);
13526 if (DECL_INTERFACE_KNOWN (decl1
))
13528 tree ctx
= decl_function_context (decl1
);
13530 if (DECL_NOT_REALLY_EXTERN (decl1
))
13531 DECL_EXTERNAL (decl1
) = 0;
13533 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
13534 && TREE_PUBLIC (ctx
))
13535 /* This is a function in a local class in an extern inline
13537 comdat_linkage (decl1
);
13539 /* If this function belongs to an interface, it is public.
13540 If it belongs to someone else's interface, it is also external.
13541 This only affects inlines and template instantiations. */
13542 else if (interface_unknown
== 0
13543 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13544 || flag_alt_external_templates
))
13546 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
13547 || processing_template_decl
)
13549 DECL_EXTERNAL (decl1
)
13551 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
13552 && !DECL_VINDEX (decl1
)));
13554 /* For WIN32 we also want to put these in linkonce sections. */
13555 maybe_make_one_only (decl1
);
13558 DECL_EXTERNAL (decl1
) = 0;
13559 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
13560 DECL_INTERFACE_KNOWN (decl1
) = 1;
13562 else if (interface_unknown
&& interface_only
13563 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13564 || flag_alt_external_templates
))
13566 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13567 interface, we will have interface_only set but not
13568 interface_known. In that case, we don't want to use the normal
13569 heuristics because someone will supply a #pragma implementation
13570 elsewhere, and deducing it here would produce a conflict. */
13571 comdat_linkage (decl1
);
13572 DECL_EXTERNAL (decl1
) = 0;
13573 DECL_INTERFACE_KNOWN (decl1
) = 1;
13574 DECL_DEFER_OUTPUT (decl1
) = 1;
13578 /* This is a definition, not a reference.
13579 So clear DECL_EXTERNAL. */
13580 DECL_EXTERNAL (decl1
) = 0;
13582 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
13583 && ! DECL_INTERFACE_KNOWN (decl1
)
13584 /* Don't try to defer nested functions for now. */
13585 && ! decl_function_context (decl1
))
13586 DECL_DEFER_OUTPUT (decl1
) = 1;
13588 DECL_INTERFACE_KNOWN (decl1
) = 1;
13592 current_binding_level
->parm_flag
= 1;
13595 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13597 /* We need to do this even if we aren't expanding yet so that
13598 assemble_external works. */
13599 make_function_rtl (decl1
);
13601 /* Promote the value to int before returning it. */
13602 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13603 restype
= type_promotes_to (restype
);
13605 /* If this fcn was already referenced via a block-scope `extern' decl
13606 (or an implicit decl), propagate certain information about the usage. */
13607 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13608 TREE_ADDRESSABLE (decl1
) = 1;
13610 if (DECL_RESULT (decl1
) == NULL_TREE
)
13612 DECL_RESULT (decl1
)
13613 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13614 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13615 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13620 if (DECL_DESTRUCTOR_P (decl1
))
13622 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13623 DECL_CONTEXT (dtor_label
) = current_function_decl
;
13625 /* Under the old ABI we return `this' from constructors, so we make
13626 ordinary `return' statements in constructors jump to CTOR_LABEL;
13627 from there we return `this'. Under the new ABI, we don't bother
13628 with any of this. By not setting CTOR_LABEL the remainder of the
13629 machinery is automatically disabled. */
13630 else if (!flag_new_abi
&& DECL_CONSTRUCTOR_P (decl1
))
13632 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13633 DECL_CONTEXT (ctor_label
) = current_function_decl
;
13636 store_parm_decls (current_function_parms
);
13641 /* Store the parameter declarations into the current function declaration.
13642 This is called after parsing the parameter declarations, before
13643 digesting the body of the function.
13645 Also install to binding contour return value identifier, if any. */
13648 store_parm_decls (current_function_parms
)
13649 tree current_function_parms
;
13651 register tree fndecl
= current_function_decl
;
13652 register tree parm
;
13653 int parms_have_cleanups
= 0;
13654 tree cleanups
= NULL_TREE
;
13656 /* This is a list of types declared among parms in a prototype. */
13657 tree parmtags
= current_function_parm_tags
;
13659 /* This is a chain of any other decls that came in among the parm
13660 declarations. If a parm is declared with enum {foo, bar} x;
13661 then CONST_DECLs for foo and bar are put here. */
13662 tree nonparms
= NULL_TREE
;
13664 if (current_function_parms
)
13666 /* This case is when the function was defined with an ANSI prototype.
13667 The parms already have decls, so we need not do anything here
13668 except record them as in effect
13669 and complain if any redundant old-style parm decls were written. */
13671 tree specparms
= current_function_parms
;
13674 /* Must clear this because it might contain TYPE_DECLs declared
13676 storedecls (NULL_TREE
);
13678 /* If we're doing semantic analysis, then we'll call pushdecl
13679 for each of these. We must do them in reverse order so that
13680 they end in the correct forward order. */
13681 specparms
= nreverse (specparms
);
13683 for (parm
= specparms
; parm
; parm
= next
)
13685 next
= TREE_CHAIN (parm
);
13686 if (TREE_CODE (parm
) == PARM_DECL
)
13690 if (DECL_NAME (parm
) == NULL_TREE
13691 || TREE_CODE (parm
) != VOID_TYPE
)
13694 cp_error ("parameter `%D' declared void", parm
);
13696 cleanup
= (processing_template_decl
13698 : maybe_build_cleanup (parm
));
13701 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13705 /* If we find an enum constant or a type tag,
13706 put it aside for the moment. */
13707 TREE_CHAIN (parm
) = NULL_TREE
;
13708 nonparms
= chainon (nonparms
, parm
);
13712 /* Get the decls in their original chain order and record in the
13713 function. This is all and only the PARM_DECLs that were
13714 pushed into scope by the loop above. */
13715 DECL_ARGUMENTS (fndecl
) = getdecls ();
13716 storetags (chainon (parmtags
, gettags ()));
13719 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13721 /* Now store the final chain of decls for the arguments
13722 as the decl-chain of the current lexical scope.
13723 Put the enumerators in as well, at the front so that
13724 DECL_ARGUMENTS is not modified. */
13725 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13727 /* Now that we have initialized the parms, we can start their
13728 cleanups. We cannot do this before, since expand_decl_cleanup
13729 should not be called before the parm can be used. */
13732 finish_decl_cleanup (TREE_PURPOSE (cleanups
),
13733 TREE_VALUE (cleanups
));
13734 cleanups
= TREE_CHAIN (cleanups
);
13737 /* Create a binding contour which can be used to catch
13738 cleanup-generated temporaries. */
13739 if (parms_have_cleanups
)
13742 /* Do the starting of the exception specifications, if we have any. */
13743 if (flag_exceptions
&& !processing_template_decl
13744 && flag_enforce_eh_specs
13745 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13746 current_eh_spec_try_block
= expand_start_eh_spec ();
13750 /* We have finished doing semantic analysis on DECL, but have not yet
13751 generated RTL for its body. Save away our current state, so that
13752 when we want to generate RTL later we know what to do. */
13755 save_function_data (decl
)
13758 struct cp_language_function
*f
;
13760 /* Save the language-specific per-function data so that we can
13761 get it back when we really expand this function. */
13762 my_friendly_assert (!DECL_PENDING_INLINE_P (decl
),
13766 f
= ((struct cp_language_function
*)
13767 xmalloc (sizeof (struct cp_language_function
)));
13768 memcpy (f
, cp_function_chain
, sizeof (struct cp_language_function
));
13769 DECL_SAVED_FUNCTION_DATA (decl
) = f
;
13771 /* Clear out the bits we don't need. */
13772 f
->base
.x_stmt_tree
.x_last_stmt
= NULL_TREE
;
13773 f
->base
.x_stmt_tree
.x_last_expr_type
= NULL_TREE
;
13774 f
->x_named_label_uses
= NULL
;
13775 f
->bindings
= NULL
;
13777 /* When we get back here again, we will be expanding. */
13778 f
->x_expanding_p
= 1;
13780 /* If we've already decided that we cannot inline this function, we
13781 must remember that fact when we actually go to expand the
13783 f
->cannot_inline
= current_function_cannot_inline
;
13786 /* At the end of every constructor we generate to code to return
13787 `this'. Do that now. */
13790 finish_constructor_body ()
13792 /* Any return from a constructor will end up here. */
13794 add_stmt (build_stmt (LABEL_STMT
, ctor_label
));
13796 /* Clear CTOR_LABEL so that finish_return_stmt knows to really
13797 generate the return, rather than a goto to CTOR_LABEL. */
13798 ctor_label
= NULL_TREE
;
13799 /* In check_return_expr we translate an empty return from a
13800 constructor to a return of `this'. */
13801 finish_return_stmt (NULL_TREE
);
13802 /* Mark the end of the constructor. */
13803 add_stmt (build_stmt (CTOR_STMT
));
13806 /* At the end of every destructor we generate code to restore virtual
13807 function tables to the values desired by base classes and to call
13808 to base class destructors. Do that now. */
13811 finish_destructor_body ()
13813 tree compound_stmt
;
13818 /* Create a block to contain all the extra code. */
13819 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
13821 /* Any return from a destructor will end up here. */
13822 add_stmt (build_stmt (LABEL_STMT
, dtor_label
));
13824 /* Generate the code to call destructor on base class. If this
13825 destructor belongs to a class with virtual functions, then set
13826 the virtual function table pointer to represent the type of our
13829 /* This side-effect makes call to `build_delete' generate the code
13830 we have to have at the end of this destructor. `build_delete'
13831 will set the flag again. */
13832 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
13834 exprstmt
= build_delete (current_class_type
,
13836 sfk_base_destructor
,
13837 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
,
13840 if (exprstmt
!= error_mark_node
13841 && (TREE_CODE (exprstmt
) != NOP_EXPR
13842 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
13843 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
13845 if (exprstmt
!= void_zero_node
)
13846 /* Don't call `expand_expr_stmt' if we're not going to do
13847 anything, since -Wall will give a diagnostic. */
13848 finish_expr_stmt (exprstmt
);
13850 /* Run destructors for all virtual baseclasses. */
13851 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13856 if_stmt
= begin_if_stmt ();
13857 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13858 current_in_charge_parm
,
13862 vbases
= CLASSTYPE_VBASECLASSES (current_class_type
);
13863 /* The CLASSTYPE_VBASECLASSES list is in initialization
13864 order, so we have to march through it in reverse order. */
13865 for (vbases
= nreverse (copy_list (vbases
));
13867 vbases
= TREE_CHAIN (vbases
))
13869 tree vbase
= TREE_VALUE (vbases
);
13871 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (vbase
)))
13873 tree vb
= get_vbase
13874 (BINFO_TYPE (vbase
),
13875 TYPE_BINFO (current_class_type
));
13877 (build_scoped_method_call
13878 (current_class_ref
, vb
, base_dtor_identifier
,
13883 finish_then_clause (if_stmt
);
13888 virtual_size
= c_sizeof (current_class_type
);
13890 /* At the end, call delete if that's what's requested. */
13892 /* FDIS sez: At the point of definition of a virtual destructor
13893 (including an implicit definition), non-placement operator delete
13894 shall be looked up in the scope of the destructor's class and if
13895 found shall be accessible and unambiguous.
13897 This is somewhat unclear, but I take it to mean that if the class
13898 only defines placement deletes we don't do anything here. So we
13899 pass LOOKUP_SPECULATIVELY; delete_sanity will complain for us if
13900 they ever try to delete one of these. */
13901 exprstmt
= build_op_delete_call
13902 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
13903 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
13905 if_stmt
= begin_if_stmt ();
13906 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13907 current_in_charge_parm
,
13910 finish_expr_stmt (exprstmt
);
13911 finish_then_clause (if_stmt
);
13914 /* Close the block we started above. */
13915 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
13918 /* Finish up a function declaration and compile that function
13919 all the way to assembler language output. The free the storage
13920 for the function definition.
13922 FLAGS is a bitwise or of the following values:
13924 An extra call to poplevel (and expand_end_bindings) must be
13925 made to take care of the binding contour for the base
13926 initializers. This is only relevant for constructors.
13928 We just finished processing the body of an in-class inline
13929 function definition. (This processing will have taken place
13930 after the class definition is complete.) */
13933 finish_function (flags
)
13936 register tree fndecl
= current_function_decl
;
13937 tree fntype
, ctype
= NULL_TREE
;
13938 int call_poplevel
= (flags
& 1) != 0;
13939 int inclass_inline
= (flags
& 2) != 0;
13942 /* When we get some parse errors, we can end up without a
13943 current_function_decl, so cope. */
13944 if (fndecl
== NULL_TREE
)
13945 return error_mark_node
;
13947 nested
= function_depth
> 1;
13948 fntype
= TREE_TYPE (fndecl
);
13950 /* TREE_READONLY (fndecl) = 1;
13951 This caused &foo to be of type ptr-to-const-function
13952 which then got a warning when stored in a ptr-to-function variable. */
13954 my_friendly_assert (building_stmt_tree (), 20000911);
13956 /* For a cloned function, we've already got all the code we need;
13957 there's no need to add any extra bits. */
13958 if (!DECL_CLONED_FUNCTION_P (fndecl
))
13960 if (DECL_CONSTRUCTOR_P (fndecl
))
13962 finish_constructor_body ();
13966 else if (DECL_DESTRUCTOR_P (fndecl
) && !processing_template_decl
)
13967 finish_destructor_body ();
13968 else if (DECL_MAIN_P (fndecl
))
13970 /* Make it so that `main' always returns 0 by default. */
13972 finish_return_stmt (integer_one_node
);
13974 finish_return_stmt (integer_zero_node
);
13978 /* Finish dealing with exception specifiers. */
13979 if (flag_exceptions
&& !processing_template_decl
13980 && flag_enforce_eh_specs
13981 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13982 expand_end_eh_spec (TYPE_RAISES_EXCEPTIONS
13983 (TREE_TYPE (current_function_decl
)),
13984 current_eh_spec_try_block
);
13987 /* If we're saving up tree structure, tie off the function now. */
13988 finish_stmt_tree (&DECL_SAVED_TREE (fndecl
));
13990 /* This must come after expand_function_end because cleanups might
13991 have declarations (from inline functions) that need to go into
13992 this function's blocks. */
13993 if (current_binding_level
->parm_flag
!= 1)
13994 my_friendly_abort (122);
13995 poplevel (1, 0, 1);
13997 /* Remember that we were in class scope. */
13998 if (current_class_name
)
13999 ctype
= current_class_type
;
14001 /* Must mark the RESULT_DECL as being in this function. */
14002 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
14004 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
14005 to the FUNCTION_DECL node itself. */
14006 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
14008 /* Save away current state, if appropriate. */
14009 if (!processing_template_decl
)
14010 save_function_data (fndecl
);
14012 /* If this function calls `setjmp' it cannot be inlined. When
14013 `longjmp' is called it is not guaranteed to restore the value of
14014 local variables that have been modified since the call to
14015 `setjmp'. So, if were to inline this function into some caller
14016 `c', then when we `longjmp', we might not restore all variables
14017 in `c'. (It might seem, at first blush, that there's no way for
14018 this function to modify local variables in `c', but their
14019 addresses may have been stored somewhere accessible to this
14021 if (!processing_template_decl
&& calls_setjmp_p (fndecl
))
14022 DECL_UNINLINABLE (fndecl
) = 1;
14024 /* Clear out memory we no longer need. */
14025 free_after_parsing (cfun
);
14026 /* Since we never call rest_of_compilation, we never clear
14027 CFUN. Do so explicitly. */
14028 free_after_compilation (cfun
);
14031 /* If this is a in-class inline definition, we may have to pop the
14032 bindings for the template parameters that we added in
14033 maybe_begin_member_template_processing when start_function was
14035 if (inclass_inline
)
14036 maybe_end_member_template_processing ();
14038 /* Leave the scope of the class. */
14040 pop_nested_class ();
14046 /* Let the error reporting routines know that we're outside a
14047 function. For a nested function, this value is used in
14048 pop_cp_function_context and then reset via pop_function_context. */
14049 current_function_decl
= NULL_TREE
;
14054 /* Create the FUNCTION_DECL for a function definition.
14055 DECLSPECS and DECLARATOR are the parts of the declaration;
14056 they describe the return type and the name of the function,
14057 but twisted together in a fashion that parallels the syntax of C.
14059 This function creates a binding context for the function body
14060 as well as setting up the FUNCTION_DECL in current_function_decl.
14062 Returns a FUNCTION_DECL on success.
14064 If the DECLARATOR is not suitable for a function (it defines a datum
14065 instead), we return 0, which tells yyparse to report a parse error.
14067 May return void_type_node indicating that this method is actually
14068 a friend. See grokfield for more details.
14070 Came here with a `.pushlevel' .
14072 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14073 CHANGES TO CODE IN `grokfield'. */
14076 start_method (declspecs
, declarator
, attrlist
)
14077 tree declarator
, declspecs
, attrlist
;
14079 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
14082 /* Something too ugly to handle. */
14083 if (fndecl
== NULL_TREE
)
14086 /* Pass friends other than inline friend functions back. */
14087 if (fndecl
== void_type_node
)
14090 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
14091 /* Not a function, tell parser to report parse error. */
14094 if (DECL_IN_AGGR_P (fndecl
))
14096 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
14098 if (DECL_CONTEXT (fndecl
)
14099 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
14100 cp_error ("`%D' is already defined in class `%T'", fndecl
,
14101 DECL_CONTEXT (fndecl
));
14103 return void_type_node
;
14106 check_template_shadow (fndecl
);
14108 DECL_THIS_INLINE (fndecl
) = 1;
14110 if (flag_default_inline
)
14111 DECL_INLINE (fndecl
) = 1;
14113 /* We process method specializations in finish_struct_1. */
14114 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
14115 fndecl
= push_template_decl (fndecl
);
14117 if (! DECL_FRIEND_P (fndecl
))
14119 if (TREE_CHAIN (fndecl
))
14121 fndecl
= copy_node (fndecl
);
14122 TREE_CHAIN (fndecl
) = NULL_TREE
;
14125 if (DECL_CONSTRUCTOR_P (fndecl
))
14127 if (! grok_ctor_properties (current_class_type
, fndecl
))
14128 return void_type_node
;
14130 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
14131 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
14134 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0);
14136 /* Make a place for the parms */
14138 current_binding_level
->parm_flag
= 1;
14140 DECL_IN_AGGR_P (fndecl
) = 1;
14144 /* Go through the motions of finishing a function definition.
14145 We don't compile this method until after the whole class has
14148 FINISH_METHOD must return something that looks as though it
14149 came from GROKFIELD (since we are defining a method, after all).
14151 This is called after parsing the body of the function definition.
14152 STMTS is the chain of statements that makes up the function body.
14154 DECL is the ..._DECL that `start_method' provided. */
14157 finish_method (decl
)
14160 register tree fndecl
= decl
;
14163 register tree link
;
14165 if (decl
== void_type_node
)
14168 old_initial
= DECL_INITIAL (fndecl
);
14170 /* Undo the level for the parms (from start_method).
14171 This is like poplevel, but it causes nothing to be
14172 saved. Saving information here confuses symbol-table
14173 output routines. Besides, this information will
14174 be correctly output when this method is actually
14177 /* Clear out the meanings of the local variables of this level;
14178 also record in each decl which block it belongs to. */
14180 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
14182 if (DECL_NAME (link
) != NULL_TREE
)
14183 pop_binding (DECL_NAME (link
), link
);
14184 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
14185 DECL_CONTEXT (link
) = NULL_TREE
;
14188 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
14189 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
14190 current_binding_level
->parm_flag
,
14191 current_binding_level
->keep
);
14193 poplevel (0, 0, 0);
14195 DECL_INITIAL (fndecl
) = old_initial
;
14197 /* We used to check if the context of FNDECL was different from
14198 current_class_type as another way to get inside here. This didn't work
14199 for String.cc in libg++. */
14200 if (DECL_FRIEND_P (fndecl
))
14202 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
14203 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
14204 decl
= void_type_node
;
14210 /* Called when a new struct TYPE is defined.
14211 If this structure or union completes the type of any previous
14212 variable declaration, lay it out and output its rtl. */
14215 hack_incomplete_structures (type
)
14219 struct binding_level
*level
;
14221 if (!type
) /* Don't do this for class templates. */
14224 if (namespace_bindings_p ())
14227 list
= &namespace_scope_incomplete
;
14231 level
= innermost_nonclass_level ();
14232 list
= &level
->incomplete
;
14239 tree decl
= TREE_VALUE (*list
);
14240 if ((decl
&& TREE_TYPE (decl
) == type
)
14241 || (TREE_TYPE (decl
)
14242 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14243 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
14245 int toplevel
= toplevel_bindings_p ();
14246 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14247 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
14248 layout_type (TREE_TYPE (decl
));
14249 layout_decl (decl
, 0);
14250 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
14254 expand_decl (decl
);
14255 cleanup
= maybe_build_cleanup (decl
);
14256 expand_decl_init (decl
);
14257 if (! expand_decl_cleanup (decl
, cleanup
))
14258 cp_error ("parser lost in parsing declaration of `%D'",
14261 *list
= TREE_CHAIN (*list
);
14264 list
= &TREE_CHAIN (*list
);
14267 /* Keep looking through artificial binding levels generated
14268 for local variables. */
14269 if (level
&& level
->keep
== 2)
14271 level
= level
->level_chain
;
14272 list
= &level
->incomplete
;
14279 /* If DECL is of a type which needs a cleanup, build that cleanup
14283 maybe_build_cleanup (decl
)
14286 tree type
= TREE_TYPE (decl
);
14288 if (type
!= error_mark_node
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
14290 int flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14293 if (TREE_CODE (type
) == ARRAY_TYPE
)
14297 mark_addressable (decl
);
14298 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14301 /* Optimize for space over speed here. */
14302 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14303 || flag_expensive_optimizations
)
14304 flags
|= LOOKUP_NONVIRTUAL
;
14306 rval
= build_delete (TREE_TYPE (rval
), rval
,
14307 sfk_complete_destructor
, flags
, 0);
14309 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14310 && ! TYPE_HAS_DESTRUCTOR (type
))
14311 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14312 build_tree_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14319 /* When a stmt has been parsed, this function is called. */
14324 /* Always assume this statement was not an expression statement. If
14325 it actually was an expression statement, its our callers
14326 responsibility to fix this up. */
14327 last_expr_type
= NULL_TREE
;
14330 /* DECL was originally constructed as a non-static member function,
14331 but turned out to be static. Update it accordingly. */
14334 revert_static_member_fn (decl
)
14338 tree function
= TREE_TYPE (decl
);
14339 tree args
= TYPE_ARG_TYPES (function
);
14341 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14342 != TYPE_UNQUALIFIED
)
14343 cp_error ("static member function `%#D' declared with type qualifiers",
14346 args
= TREE_CHAIN (args
);
14347 tmp
= build_function_type (TREE_TYPE (function
), args
);
14348 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14349 tmp
= build_exception_variant (tmp
,
14350 TYPE_RAISES_EXCEPTIONS (function
));
14351 TREE_TYPE (decl
) = tmp
;
14352 if (DECL_ARGUMENTS (decl
))
14353 DECL_ARGUMENTS (decl
) = TREE_CHAIN (DECL_ARGUMENTS (decl
));
14354 DECL_STATIC_FUNCTION_P (decl
) = 1;
14357 /* Initialize the variables used during compilation of a C++
14361 push_cp_function_context (f
)
14362 struct function
*f
;
14364 struct cp_language_function
*p
14365 = ((struct cp_language_function
*)
14366 xcalloc (1, sizeof (struct cp_language_function
)));
14367 f
->language
= (struct language_function
*) p
;
14369 /* It takes an explicit call to expand_body to generate RTL for a
14373 /* Whenever we start a new function, we destroy temporaries in the
14375 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
14378 /* Free the language-specific parts of F, now that we've finished
14379 compiling the function. */
14382 pop_cp_function_context (f
)
14383 struct function
*f
;
14386 free (f
->language
);
14390 /* Mark P for GC. */
14393 mark_lang_function (p
)
14394 struct cp_language_function
*p
;
14399 mark_c_language_function (&p
->base
);
14401 ggc_mark_tree (p
->x_ctor_label
);
14402 ggc_mark_tree (p
->x_dtor_label
);
14403 ggc_mark_tree (p
->x_current_class_ptr
);
14404 ggc_mark_tree (p
->x_current_class_ref
);
14405 ggc_mark_tree (p
->x_eh_spec_try_block
);
14407 mark_named_label_lists (&p
->x_named_labels
, &p
->x_named_label_uses
);
14408 mark_binding_level (&p
->bindings
);
14411 /* Mark the language-specific data in F for GC. */
14414 mark_cp_function_context (f
)
14415 struct function
*f
;
14417 mark_lang_function ((struct cp_language_function
*) f
->language
);
14424 enum tree_code code
= TREE_CODE (t
);
14425 if (code
== IDENTIFIER_NODE
)
14427 struct lang_identifier
*li
= (struct lang_identifier
*) t
;
14428 struct lang_id2
*li2
= li
->x
;
14429 ggc_mark_tree (li
->namespace_bindings
);
14430 ggc_mark_tree (li
->bindings
);
14431 ggc_mark_tree (li
->class_value
);
14432 ggc_mark_tree (li
->class_template_info
);
14436 ggc_mark_tree (li2
->label_value
);
14437 ggc_mark_tree (li2
->implicit_decl
);
14438 ggc_mark_tree (li2
->error_locus
);
14441 else if (code
== CPLUS_BINDING
)
14443 if (BINDING_HAS_LEVEL_P (t
))
14444 mark_binding_level (&BINDING_LEVEL (t
));
14446 ggc_mark_tree (BINDING_SCOPE (t
));
14447 ggc_mark_tree (BINDING_VALUE (t
));
14449 else if (code
== OVERLOAD
)
14450 ggc_mark_tree (OVL_FUNCTION (t
));
14451 else if (code
== TEMPLATE_PARM_INDEX
)
14452 ggc_mark_tree (TEMPLATE_PARM_DECL (t
));
14453 else if (TREE_CODE_CLASS (code
) == 'd')
14455 struct lang_decl
*ld
= DECL_LANG_SPECIFIC (t
);
14460 c_mark_lang_decl (&ld
->decl_flags
.base
);
14461 if (!DECL_GLOBAL_CTOR_P (t
)
14462 && !DECL_GLOBAL_DTOR_P (t
)
14463 && !DECL_THUNK_P (t
))
14464 ggc_mark_tree (ld
->decl_flags
.u2
.access
);
14465 else if (DECL_THUNK_P (t
))
14466 ggc_mark_tree (ld
->decl_flags
.u2
.vcall_offset
);
14467 if (TREE_CODE (t
) != NAMESPACE_DECL
)
14468 ggc_mark_tree (ld
->decl_flags
.u
.template_info
);
14470 mark_binding_level (&NAMESPACE_LEVEL (t
));
14471 if (CAN_HAVE_FULL_LANG_DECL_P (t
))
14473 ggc_mark_tree (ld
->befriending_classes
);
14474 ggc_mark_tree (ld
->context
);
14475 ggc_mark_tree (ld
->cloned_function
);
14476 if (!DECL_OVERLOADED_OPERATOR_P (t
))
14477 ggc_mark_tree (ld
->u2
.vtt_parm
);
14478 if (TREE_CODE (t
) == TYPE_DECL
)
14479 ggc_mark_tree (ld
->u
.sorted_fields
);
14480 else if (TREE_CODE (t
) == FUNCTION_DECL
14481 && !DECL_PENDING_INLINE_P (t
))
14482 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t
));
14486 else if (TREE_CODE_CLASS (code
) == 't')
14488 struct lang_type
*lt
= TYPE_LANG_SPECIFIC (t
);
14490 if (lt
&& !(TREE_CODE (t
) == POINTER_TYPE
14491 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
14494 ggc_mark_tree (lt
->primary_base
);
14495 ggc_mark_tree (lt
->vfields
);
14496 ggc_mark_tree (lt
->vbases
);
14497 ggc_mark_tree (lt
->tags
);
14498 ggc_mark_tree (lt
->size
);
14499 ggc_mark_tree (lt
->pure_virtuals
);
14500 ggc_mark_tree (lt
->friend_classes
);
14501 ggc_mark_tree (lt
->rtti
);
14502 ggc_mark_tree (lt
->methods
);
14503 ggc_mark_tree (lt
->template_info
);
14504 ggc_mark_tree (lt
->befriending_classes
);
14507 /* In the case of pointer-to-member function types, the
14508 TYPE_LANG_SPECIFIC is really just a tree. */
14509 ggc_mark_tree ((tree
) lt
);
14513 /* Return the IDENTIFIER_GLOBAL_VALUE of T, for use in common code, since
14514 the definition of IDENTIFIER_GLOBAL_VALUE is different for C and C++. */
14517 identifier_global_value (t
)
14520 return IDENTIFIER_GLOBAL_VALUE (t
);
14523 /* Build the void_list_node (void_type_node having been created). */
14525 build_void_list_node ()
14527 tree t
= build_tree_list (NULL_TREE
, void_type_node
);
14528 TREE_PARMLIST (t
) = 1;
14533 cp_missing_noreturn_ok_p (decl
)
14536 /* A missing noreturn is ok for the `main' function. */
14537 return MAIN_NAME_P (DECL_ASSEMBLER_NAME (decl
));