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 DECL_INITIALIZED_IN_CLASS_P (newdecl
)
3577 |= DECL_INITIALIZED_IN_CLASS_P (olddecl
);
3578 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3580 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3581 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3582 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3583 DECL_BEFRIENDING_CLASSES (newdecl
)
3584 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3585 DECL_BEFRIENDING_CLASSES (olddecl
));
3588 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3590 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3591 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3593 /* If newdecl is not a specialization, then it is not a
3594 template-related function at all. And that means that we
3595 shoud have exited above, returning 0. */
3596 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3599 if (TREE_USED (olddecl
))
3600 /* From [temp.expl.spec]:
3602 If a template, a member template or the member of a class
3603 template is explicitly specialized then that
3604 specialization shall be declared before the first use of
3605 that specialization that would cause an implicit
3606 instantiation to take place, in every translation unit in
3607 which such a use occurs. */
3608 cp_error ("explicit specialization of %D after first use",
3611 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3613 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3615 /* If either decl says `inline', this fn is inline, unless its
3616 definition was passed already. */
3617 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3618 DECL_INLINE (olddecl
) = 1;
3619 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3623 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3624 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3625 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3627 if (! types_match
|| new_defines_function
)
3629 /* These need to be copied so that the names are available.
3630 Note that if the types do match, we'll preserve inline
3631 info and other bits, but if not, we won't. */
3632 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3633 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3635 if (new_defines_function
)
3636 /* If defining a function declared with other language
3637 linkage, use the previously declared language linkage. */
3638 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3639 else if (types_match
)
3641 /* If redeclaring a builtin function, and not a definition,
3642 it stays built in. */
3643 if (DECL_BUILT_IN (olddecl
))
3645 DECL_BUILT_IN_CLASS (newdecl
) = DECL_BUILT_IN_CLASS (olddecl
);
3646 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3647 /* If we're keeping the built-in definition, keep the rtl,
3648 regardless of declaration matches. */
3649 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3652 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3654 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3655 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3656 /* Previously saved insns go together with
3657 the function's previous definition. */
3658 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3659 /* Don't clear out the arguments if we're redefining a function. */
3660 if (DECL_ARGUMENTS (olddecl
))
3661 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3665 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3667 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3670 /* Now preserve various other info from the definition. */
3671 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3672 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3673 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3674 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3676 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3680 function_size
= sizeof (struct tree_decl
);
3682 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3683 (char *) olddecl
+ sizeof (struct tree_common
),
3684 function_size
- sizeof (struct tree_common
));
3686 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3688 /* If newdecl is a template instantiation, it is possible that
3689 the following sequence of events has occurred:
3691 o A friend function was declared in a class template. The
3692 class template was instantiated.
3694 o The instantiation of the friend declaration was
3695 recorded on the instantiation list, and is newdecl.
3697 o Later, however, instantiate_class_template called pushdecl
3698 on the newdecl to perform name injection. But, pushdecl in
3699 turn called duplicate_decls when it discovered that another
3700 declaration of a global function with the same name already
3703 o Here, in duplicate_decls, we decided to clobber newdecl.
3705 If we're going to do that, we'd better make sure that
3706 olddecl, and not newdecl, is on the list of
3707 instantiations so that if we try to do the instantiation
3708 again we won't get the clobbered declaration. */
3710 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3711 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3713 for (; decls
; decls
= TREE_CHAIN (decls
))
3714 if (TREE_VALUE (decls
) == newdecl
)
3715 TREE_VALUE (decls
) = olddecl
;
3720 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3721 (char *) olddecl
+ sizeof (struct tree_common
),
3722 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3723 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3726 DECL_UID (olddecl
) = olddecl_uid
;
3728 DECL_FRIEND_P (olddecl
) = 1;
3730 /* NEWDECL contains the merged attribute lists.
3731 Update OLDDECL to be the same. */
3732 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3737 /* Record a decl-node X as belonging to the current lexical scope.
3738 Check for errors (such as an incompatible declaration for the same
3739 name already seen in the same scope).
3741 Returns either X or an old decl for the same name.
3742 If an old decl is returned, it may have been smashed
3743 to agree with what X says. */
3751 int need_new_binding
;
3753 /* We shouldn't be calling pushdecl when we're generating RTL for a
3754 function that we already did semantic analysis on previously. */
3755 my_friendly_assert (!cfun
|| doing_semantic_analysis_p (),
3758 need_new_binding
= 1;
3760 if (DECL_TEMPLATE_PARM_P (x
))
3761 /* Template parameters have no context; they are not X::T even
3762 when declared within a class or namespace. */
3766 if (current_function_decl
&& x
!= current_function_decl
3767 /* A local declaration for a function doesn't constitute
3769 && !(TREE_CODE (x
) == FUNCTION_DECL
&& !DECL_INITIAL (x
))
3770 /* A local declaration for an `extern' variable is in the
3771 scope of the current namespace, not the current
3773 && !(TREE_CODE (x
) == VAR_DECL
&& DECL_EXTERNAL (x
))
3774 && !DECL_CONTEXT (x
))
3775 DECL_CONTEXT (x
) = current_function_decl
;
3777 /* If this is the declaration for a namespace-scope function,
3778 but the declaration itself is in a local scope, mark the
3780 if (TREE_CODE (x
) == FUNCTION_DECL
3781 && DECL_NAMESPACE_SCOPE_P (x
)
3782 && current_function_decl
3783 && x
!= current_function_decl
)
3784 DECL_LOCAL_FUNCTION_P (x
) = 1;
3787 name
= DECL_NAME (x
);
3790 int different_binding_level
= 0;
3792 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3793 name
= TREE_OPERAND (name
, 0);
3795 /* In case this decl was explicitly namespace-qualified, look it
3796 up in its namespace context. */
3797 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
)
3798 && namespace_bindings_p ())
3799 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3801 t
= lookup_name_current_level (name
);
3803 /* [basic.link] If there is a visible declaration of an entity
3804 with linkage having the same name and type, ignoring entities
3805 declared outside the innermost enclosing namespace scope, the
3806 block scope declaration declares that same entity and
3807 receives the linkage of the previous declaration. */
3808 if (! t
&& current_function_decl
&& x
!= current_function_decl
3809 && (TREE_CODE (x
) == FUNCTION_DECL
|| TREE_CODE (x
) == VAR_DECL
)
3810 && DECL_EXTERNAL (x
))
3812 /* Look in block scope. */
3813 t
= IDENTIFIER_VALUE (name
);
3814 /* Or in the innermost namespace. */
3816 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3817 /* Does it have linkage? Note that if this isn't a DECL, it's an
3818 OVERLOAD, which is OK. */
3819 if (t
&& DECL_P (t
) && ! (TREE_STATIC (t
) || DECL_EXTERNAL (t
)))
3822 different_binding_level
= 1;
3825 /* If we are declaring a function, and the result of name-lookup
3826 was an OVERLOAD, look for an overloaded instance that is
3827 actually the same as the function we are declaring. (If
3828 there is one, we have to merge our declaration with the
3829 previous declaration.) */
3830 if (t
&& TREE_CODE (t
) == OVERLOAD
)
3834 if (TREE_CODE (x
) == FUNCTION_DECL
)
3835 for (match
= t
; match
; match
= OVL_NEXT (match
))
3837 if (DECL_ASSEMBLER_NAME (OVL_CURRENT (t
))
3838 == DECL_ASSEMBLER_NAME (x
))
3842 /* Just choose one. */
3846 t
= OVL_CURRENT (match
);
3851 if (t
== error_mark_node
)
3853 /* error_mark_node is 0 for a while during initialization! */
3855 cp_error_at ("`%#D' used prior to declaration", x
);
3857 else if (t
!= NULL_TREE
)
3859 if (different_binding_level
)
3861 if (decls_match (x
, t
))
3862 /* The standard only says that the local extern
3863 inherits linkage from the previous decl; in
3864 particular, default args are not shared. It would
3865 be nice to propagate inlining info, though. FIXME. */
3866 TREE_PUBLIC (x
) = TREE_PUBLIC (t
);
3868 else if (TREE_CODE (t
) == PARM_DECL
)
3870 if (DECL_CONTEXT (t
) == NULL_TREE
)
3871 fatal ("parse errors have confused me too much");
3873 /* Check for duplicate params. */
3874 if (duplicate_decls (x
, t
))
3877 else if ((DECL_EXTERN_C_FUNCTION_P (x
)
3878 || DECL_FUNCTION_TEMPLATE_P (x
))
3879 && is_overloaded_fn (t
))
3880 /* Don't do anything just yet. */;
3881 else if (t
== wchar_decl_node
)
3883 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3884 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3886 /* Throw away the redeclaration. */
3889 else if (TREE_CODE (t
) != TREE_CODE (x
))
3891 if (duplicate_decls (x
, t
))
3894 else if (duplicate_decls (x
, t
))
3896 if (TREE_CODE (t
) == TYPE_DECL
)
3897 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3898 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3899 check_default_args (t
);
3903 else if (DECL_MAIN_P (x
))
3905 /* A redeclaration of main, but not a duplicate of the
3910 This function shall not be overloaded. */
3911 cp_error_at ("invalid redeclaration of `%D'", t
);
3912 cp_error ("as `%D'", x
);
3913 /* We don't try to push this declaration since that
3919 check_template_shadow (x
);
3921 /* If this is a function conjured up by the backend, massage it
3922 so it looks friendly. */
3923 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_LANG_SPECIFIC (x
))
3925 retrofit_lang_decl (x
);
3926 DECL_LANGUAGE (x
) = lang_c
;
3929 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_FUNCTION_MEMBER_P (x
))
3931 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
3934 if (!namespace_bindings_p ())
3935 /* We do not need to create a binding for this name;
3936 push_overloaded_decl will have already done so if
3938 need_new_binding
= 0;
3940 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3942 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
3944 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
3948 /* If declaring a type as a typedef, copy the type (unless we're
3949 at line 0), and install this TYPE_DECL as the new type's typedef
3950 name. See the extensive comment in ../c-decl.c (pushdecl). */
3951 if (TREE_CODE (x
) == TYPE_DECL
)
3953 tree type
= TREE_TYPE (x
);
3954 if (DECL_SOURCE_LINE (x
) == 0)
3956 if (TYPE_NAME (type
) == 0)
3957 TYPE_NAME (type
) = x
;
3959 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
3960 /* We don't want to copy the type when all we're
3961 doing is making a TYPE_DECL for the purposes of
3963 && (!TYPE_NAME (type
)
3964 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
3966 DECL_ORIGINAL_TYPE (x
) = type
;
3967 type
= build_type_copy (type
);
3968 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
3969 TYPE_NAME (type
) = x
;
3970 TREE_TYPE (x
) = type
;
3973 if (type
!= error_mark_node
3975 && TYPE_IDENTIFIER (type
))
3976 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
3977 current_binding_level
);
3981 /* Multiple external decls of the same identifier ought to match.
3983 We get warnings about inline functions where they are defined.
3984 We get warnings about other functions from push_overloaded_decl.
3986 Avoid duplicate warnings where they are used. */
3987 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
3991 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
3992 if (decl
&& TREE_CODE (decl
) == OVERLOAD
)
3993 decl
= OVL_FUNCTION (decl
);
3995 if (decl
&& decl
!= error_mark_node
3996 && (DECL_EXTERNAL (decl
) || TREE_PUBLIC (decl
))
3997 /* If different sort of thing, we already gave an error. */
3998 && TREE_CODE (decl
) == TREE_CODE (x
)
3999 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
4001 cp_pedwarn ("type mismatch with previous external decl", x
);
4002 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
4006 /* This name is new in its binding level.
4007 Install the new declaration and return it. */
4008 if (namespace_bindings_p ())
4010 /* Install a global value. */
4012 /* If the first global decl has external linkage,
4013 warn if we later see static one. */
4014 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
4015 TREE_PUBLIC (name
) = 1;
4017 /* Bind the mangled name for the entity. In the future, we
4018 should not need to do this; mangled names are an
4019 implementation detail of which the front-end should not
4020 need to be aware. */
4021 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
4023 /* For an ordinary function, we create a binding from
4024 the mangled name (i.e., NAME) to the DECL. But, for
4025 an `extern "C"' function, the mangled name and the
4026 ordinary name are the same so we need not do this. */
4027 && !DECL_EXTERN_C_FUNCTION_P (x
))
4031 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
4032 || TREE_CODE (x
) == NAMESPACE_DECL
)
4033 mangled_name
= name
;
4035 mangled_name
= DECL_ASSEMBLER_NAME (x
);
4037 if (TREE_CODE (x
) == FUNCTION_DECL
)
4039 ((IDENTIFIER_GLOBAL_VALUE (mangled_name
) == NULL_TREE
)
4040 || (IDENTIFIER_GLOBAL_VALUE (mangled_name
) == x
), 378);
4041 SET_IDENTIFIER_NAMESPACE_VALUE (mangled_name
, x
);
4044 /* Don't forget if the function was used via an implicit decl. */
4045 if (IDENTIFIER_IMPLICIT_DECL (name
)
4046 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
4049 /* Don't forget if its address was taken in that way. */
4050 if (IDENTIFIER_IMPLICIT_DECL (name
)
4051 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
4052 TREE_ADDRESSABLE (x
) = 1;
4054 /* Warn about mismatches against previous implicit decl. */
4055 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
4056 /* If this real decl matches the implicit, don't complain. */
4057 && ! (TREE_CODE (x
) == FUNCTION_DECL
4058 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
4060 ("`%D' was previously implicitly declared to return `int'", x
);
4062 /* If new decl is `static' and an `extern' was seen previously,
4064 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
4065 warn_extern_redeclared_static (x
, t
);
4069 /* Here to install a non-global value. */
4070 tree oldlocal
= IDENTIFIER_VALUE (name
);
4071 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
4073 if (need_new_binding
)
4075 push_local_binding (name
, x
, 0);
4076 /* Because push_local_binding will hook X on to the
4077 current_binding_level's name list, we don't want to
4078 do that again below. */
4079 need_new_binding
= 0;
4082 /* If this is a TYPE_DECL, push it into the type value slot. */
4083 if (TREE_CODE (x
) == TYPE_DECL
)
4084 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
4085 current_binding_level
);
4087 /* Clear out any TYPE_DECL shadowed by a namespace so that
4088 we won't think this is a type. The C struct hack doesn't
4089 go through namespaces. */
4090 if (TREE_CODE (x
) == NAMESPACE_DECL
)
4091 set_identifier_type_value_with_scope (name
, NULL_TREE
,
4092 current_binding_level
);
4099 && TREE_CODE (oldlocal
) == VAR_DECL
4100 && DECL_DEAD_FOR_LOCAL (oldlocal
))
4101 oldlocal
= DECL_SHADOWED_FOR_VAR (oldlocal
);
4103 if (oldlocal
== NULL_TREE
)
4104 oldlocal
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (d
));
4107 /* If this is an extern function declaration, see if we
4108 have a global definition or declaration for the function. */
4109 if (oldlocal
== NULL_TREE
4110 && DECL_EXTERNAL (x
)
4111 && oldglobal
!= NULL_TREE
4112 && TREE_CODE (x
) == FUNCTION_DECL
4113 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
4115 /* We have one. Their types must agree. */
4116 if (decls_match (x
, oldglobal
))
4120 cp_warning ("extern declaration of `%#D' doesn't match", x
);
4121 cp_warning_at ("global declaration `%#D'", oldglobal
);
4124 /* If we have a local external declaration,
4125 and no file-scope declaration has yet been seen,
4126 then if we later have a file-scope decl it must not be static. */
4127 if (oldlocal
== NULL_TREE
4128 && oldglobal
== NULL_TREE
4129 && DECL_EXTERNAL (x
)
4131 TREE_PUBLIC (name
) = 1;
4133 /* Warn if shadowing an argument at the top level of the body. */
4134 if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
4135 /* Inline decls shadow nothing. */
4136 && !DECL_FROM_INLINE (x
)
4137 && TREE_CODE (oldlocal
) == PARM_DECL
4138 /* Don't complain if it's from an enclosing function. */
4139 && DECL_CONTEXT (oldlocal
) == current_function_decl
4140 && TREE_CODE (x
) != PARM_DECL
)
4142 /* Go to where the parms should be and see if we
4144 struct binding_level
*b
= current_binding_level
->level_chain
;
4150 if (b
->parm_flag
== 1)
4151 cp_error ("declaration of `%#D' shadows a parameter", name
);
4154 /* Maybe warn if shadowing something else. */
4155 if (warn_shadow
&& !DECL_EXTERNAL (x
)
4156 /* Inline decls shadow nothing. */
4157 && !DECL_FROM_INLINE (x
)
4158 /* No shadow warnings for internally generated vars. */
4159 && ! DECL_ARTIFICIAL (x
)
4160 /* No shadow warnings for vars made for inlining. */
4161 && ! DECL_FROM_INLINE (x
))
4163 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
4164 warning ("declaration of `%s' shadows a parameter",
4165 IDENTIFIER_POINTER (name
));
4166 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
4167 && current_class_ptr
4168 && !TREE_STATIC (name
))
4169 warning ("declaration of `%s' shadows a member of `this'",
4170 IDENTIFIER_POINTER (name
));
4171 else if (oldlocal
!= NULL_TREE
)
4172 warning ("declaration of `%s' shadows previous local",
4173 IDENTIFIER_POINTER (name
));
4174 else if (oldglobal
!= NULL_TREE
)
4175 /* XXX shadow warnings in outer-more namespaces */
4176 warning ("declaration of `%s' shadows global declaration",
4177 IDENTIFIER_POINTER (name
));
4181 if (TREE_CODE (x
) == FUNCTION_DECL
)
4182 check_default_args (x
);
4184 /* Keep count of variables in this level with incomplete type. */
4185 if (TREE_CODE (x
) == VAR_DECL
4186 && TREE_TYPE (x
) != error_mark_node
4187 && ((!COMPLETE_TYPE_P (TREE_TYPE (x
))
4188 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
4189 /* RTTI TD entries are created while defining the type_info. */
4190 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
4191 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
4193 if (namespace_bindings_p ())
4194 namespace_scope_incomplete
4195 = tree_cons (NULL_TREE
, x
, namespace_scope_incomplete
);
4197 current_binding_level
->incomplete
4198 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4202 if (need_new_binding
)
4203 add_decl_to_level (x
,
4204 DECL_NAMESPACE_SCOPE_P (x
)
4205 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x
))
4206 : current_binding_level
);
4211 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4212 caller to set DECL_CONTEXT properly. */
4215 pushdecl_with_scope (x
, level
)
4217 struct binding_level
*level
;
4219 register struct binding_level
*b
;
4220 tree function_decl
= current_function_decl
;
4222 current_function_decl
= NULL_TREE
;
4223 if (level
->parm_flag
== 2)
4225 b
= class_binding_level
;
4226 class_binding_level
= level
;
4227 pushdecl_class_level (x
);
4228 class_binding_level
= b
;
4232 b
= current_binding_level
;
4233 current_binding_level
= level
;
4235 current_binding_level
= b
;
4237 current_function_decl
= function_decl
;
4241 /* Like pushdecl, only it places X in the current namespace,
4245 pushdecl_namespace_level (x
)
4248 register struct binding_level
*b
= current_binding_level
;
4251 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4253 /* Now, the type_shadowed stack may screw us. Munge it so it does
4255 if (TREE_CODE (x
) == TYPE_DECL
)
4257 tree name
= DECL_NAME (x
);
4259 tree
*ptr
= (tree
*)0;
4260 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4262 tree shadowed
= b
->type_shadowed
;
4263 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4264 if (TREE_PURPOSE (shadowed
) == name
)
4266 ptr
= &TREE_VALUE (shadowed
);
4267 /* Can't break out of the loop here because sometimes
4268 a binding level will have duplicate bindings for
4269 PT names. It's gross, but I haven't time to fix it. */
4272 newval
= TREE_TYPE (x
);
4273 if (ptr
== (tree
*)0)
4275 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4276 up here if this is changed to an assertion. --KR */
4277 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4287 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4291 pushdecl_top_level (x
)
4294 push_to_top_level ();
4295 x
= pushdecl_namespace_level (x
);
4296 pop_from_top_level ();
4300 /* Make the declaration of X appear in CLASS scope. */
4303 pushdecl_class_level (x
)
4306 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4307 scope looks for the pre-mangled name. */
4310 if (TREE_CODE (x
) == OVERLOAD
)
4311 x
= OVL_CURRENT (x
);
4312 name
= DECL_NAME (x
);
4316 push_class_level_binding (name
, x
);
4317 if (TREE_CODE (x
) == TYPE_DECL
)
4318 set_identifier_type_value (name
, TREE_TYPE (x
));
4320 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4324 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4327 pushdecl_class_level (f
);
4331 /* Enter DECL into the symbol table, if that's appropriate. Returns
4332 DECL, or a modified version thereof. */
4335 maybe_push_decl (decl
)
4338 tree type
= TREE_TYPE (decl
);
4340 /* Add this decl to the current binding level, but not if it comes
4341 from another scope, e.g. a static member variable. TEM may equal
4342 DECL or it may be a previous decl of the same name. */
4343 if (decl
== error_mark_node
4344 || (TREE_CODE (decl
) != PARM_DECL
4345 && DECL_CONTEXT (decl
) != NULL_TREE
4346 /* Definitions of namespace members outside their namespace are
4348 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4349 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4350 || TREE_CODE (type
) == UNKNOWN_TYPE
4351 /* The declaration of a template specialization does not affect
4352 the functions available for overload resolution, so we do not
4354 || (TREE_CODE (decl
) == FUNCTION_DECL
4355 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4358 return pushdecl (decl
);
4361 /* Make the declaration(s) of X appear in CLASS scope
4362 under the name NAME. */
4365 push_class_level_binding (name
, x
)
4370 /* The class_binding_level will be NULL if x is a template
4371 parameter name in a member template. */
4372 if (!class_binding_level
)
4375 /* Make sure that this new member does not have the same name
4376 as a template parameter. */
4377 if (TYPE_BEING_DEFINED (current_class_type
))
4378 check_template_shadow (x
);
4380 /* If this declaration shadows a declaration from an enclosing
4381 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4382 we leave this class. Record the shadowed declaration here. */
4383 binding
= IDENTIFIER_BINDING (name
);
4385 && ((TREE_CODE (x
) == OVERLOAD
4386 && BINDING_VALUE (binding
)
4387 && is_overloaded_fn (BINDING_VALUE (binding
)))
4388 || INHERITED_VALUE_BINDING_P (binding
)))
4393 /* If the old binding was from a base class, and was for a tag
4394 name, slide it over to make room for the new binding. The
4395 old binding is still visible if explicitly qualified with a
4397 if (INHERITED_VALUE_BINDING_P (binding
)
4398 && BINDING_VALUE (binding
)
4399 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4400 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4401 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4403 old_decl
= BINDING_TYPE (binding
);
4404 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4405 BINDING_VALUE (binding
) = NULL_TREE
;
4406 INHERITED_VALUE_BINDING_P (binding
) = 0;
4409 old_decl
= BINDING_VALUE (binding
);
4411 /* Find the previous binding of name on the class-shadowed
4412 list, and update it. */
4413 for (shadow
= class_binding_level
->class_shadowed
;
4415 shadow
= TREE_CHAIN (shadow
))
4416 if (TREE_PURPOSE (shadow
) == name
4417 && TREE_TYPE (shadow
) == old_decl
)
4419 BINDING_VALUE (binding
) = x
;
4420 INHERITED_VALUE_BINDING_P (binding
) = 0;
4421 TREE_TYPE (shadow
) = x
;
4422 IDENTIFIER_CLASS_VALUE (name
) = x
;
4427 /* If we didn't replace an existing binding, put the binding on the
4428 stack of bindings for the identifier, and update the shadowed list. */
4429 if (push_class_binding (name
, x
))
4431 class_binding_level
->class_shadowed
4432 = tree_cons (name
, NULL
,
4433 class_binding_level
->class_shadowed
);
4434 /* Record the value we are binding NAME to so that we can know
4435 what to pop later. */
4436 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4440 /* Insert another USING_DECL into the current binding level, returning
4441 this declaration. If this is a redeclaration, do nothing, and
4442 return NULL_TREE if this not in namespace scope (in namespace
4443 scope, a using decl might extend any previous bindings). */
4446 push_using_decl (scope
, name
)
4452 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4453 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4454 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4455 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4458 return namespace_bindings_p () ? decl
: NULL_TREE
;
4459 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4460 DECL_INITIAL (decl
) = scope
;
4461 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4462 current_binding_level
->usings
= decl
;
4466 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4467 changed (i.e. there was already a directive), or the fresh
4468 TREE_LIST otherwise. */
4471 push_using_directive (used
)
4474 tree ud
= current_binding_level
->using_directives
;
4475 tree iter
, ancestor
;
4477 /* Check if we already have this. */
4478 if (purpose_member (used
, ud
) != NULL_TREE
)
4481 /* Recursively add all namespaces used. */
4482 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4483 push_using_directive (TREE_PURPOSE (iter
));
4485 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4486 ud
= current_binding_level
->using_directives
;
4487 ud
= tree_cons (used
, ancestor
, ud
);
4488 current_binding_level
->using_directives
= ud
;
4492 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4493 other definitions already in place. We get around this by making
4494 the value of the identifier point to a list of all the things that
4495 want to be referenced by that name. It is then up to the users of
4496 that name to decide what to do with that list.
4498 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its
4499 DECL_TEMPLATE_RESULT. It is dealt with the same way.
4501 FLAGS is a bitwise-or of the following values:
4502 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4504 PUSH_USING: DECL is being pushed as the result of a using
4507 The value returned may be a previous declaration if we guessed wrong
4508 about what language DECL should belong to (C or C++). Otherwise,
4509 it's always DECL (and never something that's not a _DECL). */
4512 push_overloaded_decl (decl
, flags
)
4516 tree name
= DECL_NAME (decl
);
4519 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4522 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4524 old
= lookup_name_current_level (name
);
4528 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4530 tree t
= TREE_TYPE (old
);
4531 if (IS_AGGR_TYPE (t
) && warn_shadow
4532 && (! DECL_IN_SYSTEM_HEADER (decl
)
4533 || ! DECL_IN_SYSTEM_HEADER (old
)))
4534 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4537 else if (is_overloaded_fn (old
))
4541 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4543 tree fn
= OVL_CURRENT (tmp
);
4545 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4546 && !(flags
& PUSH_USING
)
4547 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4548 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4549 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4552 if (duplicate_decls (decl
, fn
))
4556 else if (old
== error_mark_node
)
4557 /* Ignore the undefined symbol marker. */
4561 cp_error_at ("previous non-function declaration `%#D'", old
);
4562 cp_error ("conflicts with function declaration `%#D'", decl
);
4567 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4569 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4570 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4572 new_binding
= ovl_cons (decl
, old
);
4573 if (flags
& PUSH_USING
)
4574 OVL_USED (new_binding
) = 1;
4577 /* NAME is not ambiguous. */
4581 set_namespace_binding (name
, current_namespace
, new_binding
);
4584 /* We only create an OVERLOAD if there was a previous binding at
4585 this level, or if decl is a template. In the former case, we
4586 need to remove the old binding and replace it with the new
4587 binding. We must also run through the NAMES on the binding
4588 level where the name was bound to update the chain. */
4590 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4594 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4596 d
= &TREE_CHAIN (*d
))
4598 || (TREE_CODE (*d
) == TREE_LIST
4599 && TREE_VALUE (*d
) == old
))
4601 if (TREE_CODE (*d
) == TREE_LIST
)
4602 /* Just replace the old binding with the new. */
4603 TREE_VALUE (*d
) = new_binding
;
4605 /* Build a TREE_LIST to wrap the OVERLOAD. */
4606 *d
= tree_cons (NULL_TREE
, new_binding
,
4609 /* And update the CPLUS_BINDING node. */
4610 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4615 /* We should always find a previous binding in this case. */
4616 my_friendly_abort (0);
4619 /* Install the new binding. */
4620 push_local_binding (name
, new_binding
, flags
);
4626 /* Generate an implicit declaration for identifier FUNCTIONID
4627 as a function of type int (). Print a warning if appropriate. */
4630 implicitly_declare (functionid
)
4635 /* We used to reuse an old implicit decl here,
4636 but this loses with inline functions because it can clobber
4637 the saved decl chains. */
4638 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4640 DECL_EXTERNAL (decl
) = 1;
4641 TREE_PUBLIC (decl
) = 1;
4643 /* ISO standard says implicit declarations are in the innermost block.
4644 So we record the decl in the standard fashion. */
4646 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4649 /* Only one warning per identifier. */
4650 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4652 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4655 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4660 /* Return zero if the declaration NEWDECL is valid
4661 when the declaration OLDDECL (assumed to be for the same name)
4662 has already been seen.
4663 Otherwise return an error message format string with a %s
4664 where the identifier should go. */
4667 redeclaration_error_message (newdecl
, olddecl
)
4668 tree newdecl
, olddecl
;
4670 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4672 /* Because C++ can put things into name space for free,
4673 constructs like "typedef struct foo { ... } foo"
4674 would look like an erroneous redeclaration. */
4675 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4678 return "redefinition of `%#D'";
4680 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4682 /* If this is a pure function, its olddecl will actually be
4683 the original initialization to `0' (which we force to call
4684 abort()). Don't complain about redefinition in this case. */
4685 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_PURE_VIRTUAL_P (olddecl
))
4688 /* If both functions come from different namespaces, this is not
4689 a redeclaration - this is a conflict with a used function. */
4690 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4691 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4692 return "`%D' conflicts with used function";
4694 /* We'll complain about linkage mismatches in
4695 warn_extern_redeclared_static. */
4697 /* Defining the same name twice is no good. */
4698 if (DECL_INITIAL (olddecl
) != NULL_TREE
4699 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4701 if (DECL_NAME (olddecl
) == NULL_TREE
)
4702 return "`%#D' not declared in class";
4704 return "redefinition of `%#D'";
4708 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4710 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4711 && (DECL_TEMPLATE_RESULT (newdecl
)
4712 != DECL_TEMPLATE_RESULT (olddecl
))
4713 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4714 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4715 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4716 && COMPLETE_TYPE_P (TREE_TYPE (newdecl
))
4717 && COMPLETE_TYPE_P (TREE_TYPE (olddecl
))))
4718 return "redefinition of `%#D'";
4721 else if (toplevel_bindings_p () || DECL_NAMESPACE_SCOPE_P (newdecl
))
4723 /* Objects declared at top level: */
4724 /* If at least one is a reference, it's ok. */
4725 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4727 /* Reject two definitions. */
4728 return "redefinition of `%#D'";
4732 /* Objects declared with block scope: */
4733 /* Reject two definitions, and reject a definition
4734 together with an external reference. */
4735 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4736 return "redeclaration of `%#D'";
4741 /* Create a new label, named ID. */
4744 make_label_decl (id
, local_p
)
4750 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4752 /* Make sure every label has an rtx. */
4755 DECL_CONTEXT (decl
) = current_function_decl
;
4756 DECL_MODE (decl
) = VOIDmode
;
4757 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
4759 /* Say where one reference is to the label, for the sake of the
4760 error if it is not defined. */
4761 DECL_SOURCE_LINE (decl
) = lineno
;
4762 DECL_SOURCE_FILE (decl
) = input_filename
;
4764 /* Record the fact that this identifier is bound to this label. */
4765 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4770 /* Record this label on the list of used labels so that we can check
4771 at the end of the function to see whether or not the label was
4772 actually defined, and so we can check when the label is defined whether
4773 this use is valid. */
4779 if (named_label_uses
== NULL
4780 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4781 || named_label_uses
->label_decl
!= decl
)
4783 struct named_label_use_list
*new_ent
;
4784 new_ent
= ((struct named_label_use_list
*)
4785 ggc_alloc (sizeof (struct named_label_use_list
)));
4786 new_ent
->label_decl
= decl
;
4787 new_ent
->names_in_scope
= current_binding_level
->names
;
4788 new_ent
->binding_level
= current_binding_level
;
4789 new_ent
->lineno_o_goto
= lineno
;
4790 new_ent
->filename_o_goto
= input_filename
;
4791 new_ent
->next
= named_label_uses
;
4792 named_label_uses
= new_ent
;
4796 /* Look for a label named ID in the current function. If one cannot
4797 be found, create one. (We keep track of used, but undefined,
4798 labels, and complain about them at the end of a function.) */
4805 struct named_label_list
*ent
;
4807 /* You can't use labels at global scope. */
4808 if (current_function_decl
== NULL_TREE
)
4810 error ("label `%s' referenced outside of any function",
4811 IDENTIFIER_POINTER (id
));
4815 /* See if we've already got this label. */
4816 decl
= IDENTIFIER_LABEL_VALUE (id
);
4817 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
4820 /* Record this label on the list of labels used in this function.
4821 We do this before calling make_label_decl so that we get the
4822 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4823 ent
= ((struct named_label_list
*)
4824 ggc_alloc_cleared (sizeof (struct named_label_list
)));
4825 ent
->old_value
= IDENTIFIER_LABEL_VALUE (id
);
4826 ent
->next
= named_labels
;
4829 /* We need a new label. */
4830 decl
= make_label_decl (id
, /*local_p=*/0);
4832 /* Now fill in the information we didn't have before. */
4833 ent
->label_decl
= decl
;
4838 /* Declare a local label named ID. */
4841 declare_local_label (id
)
4846 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4847 this scope we can restore the old value of
4848 IDENTIFIER_TYPE_VALUE. */
4849 current_binding_level
->shadowed_labels
4850 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4851 current_binding_level
->shadowed_labels
);
4852 /* Look for the label. */
4853 decl
= make_label_decl (id
, /*local_p=*/1);
4854 /* Now fill in the information we didn't have before. */
4855 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
4860 /* Returns nonzero if it is ill-formed to jump past the declaration of
4861 DECL. Returns 2 if it's also a real problem. */
4864 decl_jump_unsafe (decl
)
4867 if (TREE_CODE (decl
) != VAR_DECL
|| TREE_STATIC (decl
))
4870 if (DECL_INITIAL (decl
) == NULL_TREE
4871 && pod_type_p (TREE_TYPE (decl
)))
4874 /* This is really only important if we're crossing an initialization.
4875 The POD stuff is just pedantry; why should it matter if the class
4876 contains a field of pointer to member type? */
4877 if (DECL_INITIAL (decl
)
4878 || (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))))
4883 /* Check that a single previously seen jump to a newly defined label
4884 is OK. DECL is the LABEL_DECL or 0; LEVEL is the binding_level for
4885 the jump context; NAMES are the names in scope in LEVEL at the jump
4886 context; FILE and LINE are the source position of the jump or 0. */
4889 check_previous_goto_1 (decl
, level
, names
, file
, line
)
4891 struct binding_level
*level
;
4898 struct binding_level
*b
= current_binding_level
;
4899 for (; b
; b
= b
->level_chain
)
4901 tree new_decls
= b
->names
;
4902 tree old_decls
= (b
== level
? names
: NULL_TREE
);
4903 for (; new_decls
!= old_decls
;
4904 new_decls
= TREE_CHAIN (new_decls
))
4906 int problem
= decl_jump_unsafe (new_decls
);
4913 cp_pedwarn ("jump to label `%D'", decl
);
4915 pedwarn ("jump to case label");
4918 pedwarn_with_file_and_line (file
, line
, " from here");
4922 if (problem
> 1 && DECL_ARTIFICIAL (new_decls
))
4923 /* Can't skip init of __exception_info. */
4924 cp_error_at (" enters catch block", new_decls
);
4925 else if (problem
> 1)
4926 cp_error_at (" crosses initialization of `%#D'",
4929 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4935 if (b
->eh_region
&& ! saw_eh
)
4940 cp_pedwarn ("jump to label `%D'", decl
);
4942 pedwarn ("jump to case label");
4945 pedwarn_with_file_and_line (file
, line
, " from here");
4948 error (" enters try block");
4955 check_previous_goto (use
)
4956 struct named_label_use_list
*use
;
4958 check_previous_goto_1 (use
->label_decl
, use
->binding_level
,
4959 use
->names_in_scope
, use
->filename_o_goto
,
4960 use
->lineno_o_goto
);
4964 check_switch_goto (level
)
4965 struct binding_level
*level
;
4967 check_previous_goto_1 (NULL_TREE
, level
, level
->names
, NULL
, 0);
4970 /* Check that any previously seen jumps to a newly defined label DECL
4971 are OK. Called by define_label. */
4974 check_previous_gotos (decl
)
4977 struct named_label_use_list
**usep
;
4979 if (! TREE_USED (decl
))
4982 for (usep
= &named_label_uses
; *usep
; )
4984 struct named_label_use_list
*use
= *usep
;
4985 if (use
->label_decl
== decl
)
4987 check_previous_goto (use
);
4991 usep
= &(use
->next
);
4995 /* Check that a new jump to a label DECL is OK. Called by
4996 finish_goto_stmt. */
5004 struct named_label_list
*lab
;
5006 /* We can't know where a computed goto is jumping. So we assume
5008 if (! DECL_P (decl
))
5011 /* If the label hasn't been defined yet, defer checking. */
5012 if (! DECL_INITIAL (decl
))
5018 for (lab
= named_labels
; lab
; lab
= lab
->next
)
5019 if (decl
== lab
->label_decl
)
5022 /* If the label is not on named_labels it's a gcc local label, so
5023 it must be in an outer scope, so jumping to it is always OK. */
5027 if ((lab
->eh_region
|| lab
->bad_decls
) && !identified
)
5029 cp_pedwarn_at ("jump to label `%D'", decl
);
5030 pedwarn (" from here");
5034 for (bad
= lab
->bad_decls
; bad
; bad
= TREE_CHAIN (bad
))
5036 tree b
= TREE_VALUE (bad
);
5037 int u
= decl_jump_unsafe (b
);
5039 if (u
> 1 && DECL_ARTIFICIAL (b
))
5040 /* Can't skip init of __exception_info. */
5041 cp_error_at (" enters catch block", b
);
5043 cp_error_at (" skips initialization of `%#D'", b
);
5045 cp_pedwarn_at (" enters scope of non-POD `%#D'", b
);
5049 error (" enters try block");
5052 /* Define a label, specifying the location in the source file.
5053 Return the LABEL_DECL node for the label, if the definition is valid.
5054 Otherwise return 0. */
5057 define_label (filename
, line
, name
)
5058 const char *filename
;
5062 tree decl
= lookup_label (name
);
5063 struct named_label_list
*ent
;
5064 register struct binding_level
*p
;
5066 for (ent
= named_labels
; ent
; ent
= ent
->next
)
5067 if (ent
->label_decl
== decl
)
5070 /* After labels, make any new cleanups in the function go into their
5071 own new (temporary) binding contour. */
5072 for (p
= current_binding_level
; !(p
->parm_flag
); p
= p
->level_chain
)
5073 p
->more_cleanups_ok
= 0;
5075 if (name
== get_identifier ("wchar_t"))
5076 cp_pedwarn ("label named wchar_t");
5078 if (DECL_INITIAL (decl
) != NULL_TREE
)
5080 cp_error ("duplicate label `%D'", decl
);
5085 /* Mark label as having been defined. */
5086 DECL_INITIAL (decl
) = error_mark_node
;
5087 /* Say where in the source. */
5088 DECL_SOURCE_FILE (decl
) = filename
;
5089 DECL_SOURCE_LINE (decl
) = line
;
5092 ent
->names_in_scope
= current_binding_level
->names
;
5093 ent
->binding_level
= current_binding_level
;
5095 check_previous_gotos (decl
);
5096 current_function_return_value
= NULL_TREE
;
5103 struct binding_level
*level
;
5104 struct cp_switch
*next
;
5105 /* The SWITCH_STMT being built. */
5107 /* A splay-tree mapping the low element of a case range to the high
5108 element, or NULL_TREE if there is no high element. Used to
5109 determine whether or not a new case label duplicates an old case
5110 label. We need a tree, rather than simply a hash table, because
5111 of the GNU case range extension. */
5115 /* A stack of the currently active switch statements. The innermost
5116 switch statement is on the top of the stack. There is no need to
5117 mark the stack for garbage collection because it is only active
5118 during the processing of the body of a function, and we never
5119 collect at that point. */
5121 static struct cp_switch
*switch_stack
;
5123 /* Called right after a switch-statement condition is parsed.
5124 SWITCH_STMT is the switch statement being parsed. */
5127 push_switch (switch_stmt
)
5131 = (struct cp_switch
*) xmalloc (sizeof (struct cp_switch
));
5132 p
->level
= current_binding_level
;
5133 p
->next
= switch_stack
;
5134 p
->switch_stmt
= switch_stmt
;
5135 p
->cases
= splay_tree_new (case_compare
, NULL
, NULL
);
5142 struct cp_switch
*cs
;
5145 splay_tree_delete (cs
->cases
);
5146 switch_stack
= switch_stack
->next
;
5150 /* Note that we've seen a definition of a case label, and complain if this
5151 is a bad place for one. */
5154 finish_case_label (low_value
, high_value
)
5159 register struct binding_level
*p
;
5164 error ("case label not within a switch statement");
5166 cp_error ("case label `%E' not within a switch statement",
5169 error ("`default' label not within a switch statement");
5173 if (processing_template_decl
)
5177 /* For templates, just add the case label; we'll do semantic
5178 analysis at instantiation-time. */
5179 label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
5180 return add_stmt (build_case_label (low_value
, high_value
, label
));
5183 /* Find the condition on which this switch statement depends. */
5184 cond
= SWITCH_COND (switch_stack
->switch_stmt
);
5185 if (cond
&& TREE_CODE (cond
) == TREE_LIST
)
5186 cond
= TREE_VALUE (cond
);
5188 r
= c_add_case_label (switch_stack
->cases
, cond
, low_value
, high_value
);
5189 if (r
== error_mark_node
)
5192 check_switch_goto (switch_stack
->level
);
5194 /* After labels, make any new cleanups in the function go into their
5195 own new (temporary) binding contour. */
5196 for (p
= current_binding_level
; !(p
->parm_flag
); p
= p
->level_chain
)
5197 p
->more_cleanups_ok
= 0;
5198 current_function_return_value
= NULL_TREE
;
5203 /* Return the list of declarations of the current level.
5204 Note that this list is in reverse order unless/until
5205 you nreverse it; and when you do nreverse it, you must
5206 store the result back using `storedecls' or you will lose. */
5211 return current_binding_level
->names
;
5214 /* Return the list of type-tags (for structs, etc) of the current level. */
5219 return current_binding_level
->tags
;
5222 /* Store the list of declarations of the current level.
5223 This is done for the parameter declarations of a function being defined,
5224 after they are modified in the light of any missing parameters. */
5230 current_binding_level
->names
= decls
;
5233 /* Similarly, store the list of tags of the current level. */
5239 current_binding_level
->tags
= tags
;
5242 /* Given NAME, an IDENTIFIER_NODE,
5243 return the structure (or union or enum) definition for that name.
5244 Searches binding levels from BINDING_LEVEL up to the global level.
5245 If THISLEVEL_ONLY is nonzero, searches only the specified context
5246 (but skips any tag-transparent contexts to find one that is
5247 meaningful for tags).
5248 FORM says which kind of type the caller wants;
5249 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
5250 If the wrong kind of type is found, and it's not a template, an error is
5254 lookup_tag (form
, name
, binding_level
, thislevel_only
)
5255 enum tree_code form
;
5257 struct binding_level
*binding_level
;
5260 register struct binding_level
*level
;
5261 /* Non-zero if, we should look past a template parameter level, even
5262 if THISLEVEL_ONLY. */
5263 int allow_template_parms_p
= 1;
5265 for (level
= binding_level
; level
; level
= level
->level_chain
)
5268 if (ANON_AGGRNAME_P (name
))
5269 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5271 /* There's no need for error checking here, because
5272 anon names are unique throughout the compilation. */
5273 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
5274 return TREE_VALUE (tail
);
5276 else if (level
->namespace_p
)
5277 /* Do namespace lookup. */
5278 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
5280 tree old
= binding_for_name (name
, tail
);
5282 /* If we just skipped past a template parameter level,
5283 even though THISLEVEL_ONLY, and we find a template
5284 class declaration, then we use the _TYPE node for the
5285 template. See the example below. */
5286 if (thislevel_only
&& !allow_template_parms_p
5287 && old
&& BINDING_VALUE (old
)
5288 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
5289 old
= TREE_TYPE (BINDING_VALUE (old
));
5291 old
= BINDING_TYPE (old
);
5293 /* If it has an original type, it is a typedef, and we
5294 should not return it. */
5295 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
5297 if (old
&& TREE_CODE (old
) != form
5298 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
5300 cp_error ("`%#D' redeclared as %C", old
, form
);
5305 if (thislevel_only
|| tail
== global_namespace
)
5309 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5311 if (TREE_PURPOSE (tail
) == name
)
5313 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
5314 /* Should tighten this up; it'll probably permit
5315 UNION_TYPE and a struct template, for example. */
5317 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
5319 /* Definition isn't the kind we were looking for. */
5320 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
5324 return TREE_VALUE (tail
);
5327 if (thislevel_only
&& ! level
->tag_transparent
)
5329 if (level
->template_parms_p
&& allow_template_parms_p
)
5331 /* We must deal with cases like this:
5333 template <class T> struct S;
5334 template <class T> struct S {};
5336 When looking up `S', for the second declaration, we
5337 would like to find the first declaration. But, we
5338 are in the pseudo-global level created for the
5339 template parameters, rather than the (surrounding)
5340 namespace level. Thus, we keep going one more level,
5341 even though THISLEVEL_ONLY is non-zero. */
5342 allow_template_parms_p
= 0;
5354 set_current_level_tags_transparency (tags_transparent
)
5355 int tags_transparent
;
5357 current_binding_level
->tag_transparent
= tags_transparent
;
5361 /* Given a type, find the tag that was defined for it and return the tag name.
5362 Otherwise return 0. However, the value can never be 0
5363 in the cases in which this is used.
5365 C++: If NAME is non-zero, this is the new name to install. This is
5366 done when replacing anonymous tags with real tag names. */
5369 lookup_tag_reverse (type
, name
)
5373 register struct binding_level
*level
;
5375 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5378 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5380 if (TREE_VALUE (tail
) == type
)
5383 TREE_PURPOSE (tail
) = name
;
5384 return TREE_PURPOSE (tail
);
5391 /* Look up NAME in the NAMESPACE. */
5394 lookup_namespace_name (namespace, name
)
5395 tree
namespace, name
;
5398 tree template_id
= NULL_TREE
;
5400 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5402 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5403 /* This happens for A::B<int> when B is a namespace. */
5405 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5407 /* This happens for A::B where B is a template, and there are no
5408 template arguments. */
5409 cp_error ("invalid use of `%D'", name
);
5410 return error_mark_node
;
5413 namespace = ORIGINAL_NAMESPACE (namespace);
5415 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5418 name
= TREE_OPERAND (name
, 0);
5419 if (TREE_CODE (name
) == OVERLOAD
)
5420 name
= DECL_NAME (OVL_CURRENT (name
));
5421 else if (DECL_P (name
))
5422 name
= DECL_NAME (name
);
5425 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5427 val
= make_node (CPLUS_BINDING
);
5428 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5429 return error_mark_node
;
5431 if (BINDING_VALUE (val
))
5433 val
= BINDING_VALUE (val
);
5437 if (DECL_CLASS_TEMPLATE_P (val
))
5438 val
= lookup_template_class (val
,
5439 TREE_OPERAND (template_id
, 1),
5440 /*in_decl=*/NULL_TREE
,
5441 /*context=*/NULL_TREE
,
5442 /*entering_scope=*/0);
5443 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5444 || TREE_CODE (val
) == OVERLOAD
)
5445 val
= lookup_template_function (val
,
5446 TREE_OPERAND (template_id
, 1));
5449 cp_error ("`%D::%D' is not a template",
5451 return error_mark_node
;
5455 /* If we have a single function from a using decl, pull it out. */
5456 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5457 val
= OVL_FUNCTION (val
);
5461 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5462 return error_mark_node
;
5465 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5467 static unsigned long
5475 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5476 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5481 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5484 typename_compare (k1
, k2
)
5495 d1
= TYPE_NAME (t1
);
5496 d2
= TYPE_NAME (t2
);
5498 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5499 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5500 && ((TREE_TYPE (t1
) != NULL_TREE
)
5501 == (TREE_TYPE (t2
) != NULL_TREE
))
5502 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5503 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5506 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5507 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5508 is non-NULL, this type is being created by the implicit typename
5509 extension, and BASE_TYPE is a type named `t' in some base class of
5510 `T' which depends on template parameters.
5512 Returns the new TYPENAME_TYPE. */
5515 build_typename_type (context
, name
, fullname
, base_type
)
5523 struct hash_entry
* e
;
5525 static struct hash_table ht
;
5529 static struct hash_table
*h
= &ht
;
5530 if (!hash_table_init (&ht
, &hash_newfunc
, &typename_hash
,
5532 fatal ("virtual memory exhausted");
5533 ggc_add_tree_hash_table_root (&h
, 1);
5536 /* Build the TYPENAME_TYPE. */
5537 t
= make_aggr_type (TYPENAME_TYPE
);
5538 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5539 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5540 TREE_TYPE (t
) = base_type
;
5542 /* Build the corresponding TYPE_DECL. */
5543 d
= build_decl (TYPE_DECL
, name
, t
);
5544 TYPE_NAME (TREE_TYPE (d
)) = d
;
5545 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5546 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5547 DECL_ARTIFICIAL (d
) = 1;
5549 /* See if we already have this type. */
5550 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5554 /* Insert the type into the table. */
5555 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5560 /* Resolve `typename CONTEXT::NAME'. Returns an appropriate type,
5561 unless an error occurs, in which case error_mark_node is returned.
5562 If COMPLAIN zero, don't complain about any errors that occur. */
5565 make_typename_type (context
, name
, complain
)
5573 if (!(TYPE_LANG_SPECIFIC (name
)
5574 && (CLASSTYPE_IS_TEMPLATE (name
)
5575 || CLASSTYPE_USE_TEMPLATE (name
))))
5576 name
= TYPE_IDENTIFIER (name
);
5578 /* Create a TEMPLATE_ID_EXPR for the type. */
5579 name
= build_nt (TEMPLATE_ID_EXPR
,
5580 CLASSTYPE_TI_TEMPLATE (name
),
5581 CLASSTYPE_TI_ARGS (name
));
5583 else if (TREE_CODE (name
) == TYPE_DECL
)
5584 name
= DECL_NAME (name
);
5588 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5590 name
= TREE_OPERAND (name
, 0);
5591 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5592 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5594 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5595 my_friendly_abort (2000);
5597 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5599 /* We can get here from typename_sub0 in the explicit_template_type
5600 expansion. Just fail. */
5602 cp_error ("no class template named `%#T' in `%#T'",
5604 return error_mark_node
;
5607 if (! uses_template_parms (context
)
5608 || currently_open_class (context
))
5610 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5612 tree tmpl
= NULL_TREE
;
5613 if (IS_AGGR_TYPE (context
))
5614 tmpl
= lookup_field (context
, name
, 0, 0);
5615 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5618 cp_error ("no class template named `%#T' in `%#T'",
5620 return error_mark_node
;
5623 return lookup_template_class (tmpl
,
5624 TREE_OPERAND (fullname
, 1),
5626 /*entering_scope=*/0);
5632 if (!IS_AGGR_TYPE (context
))
5635 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5636 return error_mark_node
;
5639 t
= lookup_field (context
, name
, 0, 1);
5641 return TREE_TYPE (t
);
5645 /* If the CONTEXT is not a template type, then either the field is
5646 there now or its never going to be. */
5647 if (!uses_template_parms (context
))
5650 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5651 return error_mark_node
;
5655 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5658 /* Select the right _DECL from multiple choices. */
5661 select_decl (binding
, flags
)
5666 val
= BINDING_VALUE (binding
);
5668 /* When we implicitly declare some builtin entity, we mark it
5669 DECL_ANTICIPATED, so that we know to ignore it until it is
5671 if (val
&& DECL_P (val
)
5672 && DECL_LANG_SPECIFIC (val
)
5673 && DECL_ANTICIPATED (val
))
5676 if (LOOKUP_NAMESPACES_ONLY (flags
))
5678 /* We are not interested in types. */
5679 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5684 /* If we could have a type and
5685 we have nothing or we need a type and have none. */
5686 if (BINDING_TYPE (binding
)
5687 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5688 && TREE_CODE (val
) != TYPE_DECL
)))
5689 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5690 /* Don't return non-types if we really prefer types. */
5691 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5692 && (TREE_CODE (val
) != TEMPLATE_DECL
5693 || !DECL_CLASS_TEMPLATE_P (val
)))
5699 /* Unscoped lookup of a global: iterate over current namespaces,
5700 considering using-directives. If SPACESP is non-NULL, store a list
5701 of the namespaces we've considered in it. */
5704 unqualified_namespace_lookup (name
, flags
, spacesp
)
5709 tree b
= make_node (CPLUS_BINDING
);
5710 tree initial
= current_decl_namespace();
5711 tree scope
= initial
;
5713 struct binding_level
*level
;
5714 tree val
= NULL_TREE
;
5717 *spacesp
= NULL_TREE
;
5719 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5722 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5723 val
= binding_for_name (name
, scope
);
5725 /* Initialize binding for this context. */
5726 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5727 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5729 /* Add all _DECLs seen through local using-directives. */
5730 for (level
= current_binding_level
;
5731 !level
->namespace_p
;
5732 level
= level
->level_chain
)
5733 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5734 scope
, flags
, spacesp
))
5735 /* Give up because of error. */
5736 return error_mark_node
;
5738 /* Add all _DECLs seen through global using-directives. */
5739 /* XXX local and global using lists should work equally. */
5743 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5744 scope
, flags
, spacesp
))
5745 /* Give up because of error. */
5746 return error_mark_node
;
5747 if (siter
== scope
) break;
5748 siter
= CP_DECL_CONTEXT (siter
);
5751 val
= select_decl (b
, flags
);
5752 if (scope
== global_namespace
)
5758 /* Combine prefer_type and namespaces_only into flags. */
5761 lookup_flags (prefer_type
, namespaces_only
)
5762 int prefer_type
, namespaces_only
;
5764 if (namespaces_only
)
5765 return LOOKUP_PREFER_NAMESPACES
;
5766 if (prefer_type
> 1)
5767 return LOOKUP_PREFER_TYPES
;
5768 if (prefer_type
> 0)
5769 return LOOKUP_PREFER_BOTH
;
5773 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5774 ignore it or not. Subroutine of lookup_name_real. */
5777 qualify_lookup (val
, flags
)
5781 if (val
== NULL_TREE
)
5783 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5785 if ((flags
& LOOKUP_PREFER_TYPES
)
5786 && (TREE_CODE (val
) == TYPE_DECL
5787 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5788 && DECL_CLASS_TEMPLATE_P (val
))))
5790 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5795 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5799 warn_about_implicit_typename_lookup (typename
, binding
)
5803 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5804 tree name
= DECL_NAME (typename
);
5806 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5807 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5808 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5809 && ! (TREE_CODE (binding
) == TYPE_DECL
5810 && same_type_p (TREE_TYPE (binding
), subtype
)))
5812 cp_warning ("lookup of `%D' finds `%#D'",
5814 cp_warning (" instead of `%D' from dependent base class",
5816 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5817 constructor_name (current_class_type
), name
);
5821 /* Look up NAME in the current binding level and its superiors in the
5822 namespace of variables, functions and typedefs. Return a ..._DECL
5823 node of some kind representing its definition if there is only one
5824 such declaration, or return a TREE_LIST with all the overloaded
5825 definitions if there are many, or return 0 if it is undefined.
5827 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5828 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5829 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5830 Otherwise we prefer non-TYPE_DECLs.
5832 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5833 using IDENTIFIER_CLASS_VALUE. */
5836 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5838 int prefer_type
, nonclass
, namespaces_only
;
5841 tree val
= NULL_TREE
;
5843 tree from_obj
= NULL_TREE
;
5845 int val_is_implicit_typename
= 0;
5847 /* Hack: copy flag set by parser, if set. */
5848 if (only_namespace_names
)
5849 namespaces_only
= 1;
5851 if (prefer_type
== -2)
5853 extern int looking_for_typename
;
5854 tree type
= NULL_TREE
;
5857 prefer_type
= looking_for_typename
;
5859 flags
= lookup_flags (prefer_type
, namespaces_only
);
5860 /* If the next thing is '<', class templates are types. */
5861 if (looking_for_template
)
5862 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5864 /* std:: becomes :: for now. */
5865 if (got_scope
&& got_scope
== fake_std_node
)
5866 got_scope
= void_type_node
;
5870 else if (got_object
!= error_mark_node
)
5875 if (type
== error_mark_node
)
5876 return error_mark_node
;
5877 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5878 type
= TREE_TYPE (type
);
5881 type
= complete_type (type
);
5883 if (TREE_CODE (type
) == VOID_TYPE
)
5884 type
= global_namespace
;
5885 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5887 val
= make_node (CPLUS_BINDING
);
5888 flags
|= LOOKUP_COMPLAIN
;
5889 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5891 val
= select_decl (val
, flags
);
5893 else if (! IS_AGGR_TYPE (type
)
5894 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5895 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
5896 || TREE_CODE (type
) == TYPENAME_TYPE
)
5897 /* Someone else will give an error about this if needed. */
5899 else if (type
== current_class_type
)
5900 val
= IDENTIFIER_CLASS_VALUE (name
);
5903 val
= lookup_member (type
, name
, 0, prefer_type
);
5904 type_access_control (type
, val
);
5906 /* Restore the containing TYPENAME_TYPE if we looked
5907 through it before. */
5908 if (got_scope
&& got_scope
!= type
5909 && val
&& TREE_CODE (val
) == TYPE_DECL
5910 && TREE_CODE (TREE_TYPE (val
)) == TYPENAME_TYPE
)
5911 TYPE_CONTEXT (TREE_TYPE (val
)) = got_scope
;
5919 else if (got_object
&& val
)
5927 flags
= lookup_flags (prefer_type
, namespaces_only
);
5928 /* If we're not parsing, we need to complain. */
5929 flags
|= LOOKUP_COMPLAIN
;
5932 /* First, look in non-namespace scopes. */
5934 if (current_class_type
== NULL_TREE
)
5937 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5941 if (!LOCAL_BINDING_P (t
) && nonclass
)
5942 /* We're not looking for class-scoped bindings, so keep going. */
5945 /* If this is the kind of thing we're looking for, we're done. */
5946 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5947 binding
= BINDING_VALUE (t
);
5948 else if ((flags
& LOOKUP_PREFER_TYPES
)
5949 && qualify_lookup (BINDING_TYPE (t
), flags
))
5950 binding
= BINDING_TYPE (t
);
5952 binding
= NULL_TREE
;
5954 /* Handle access control on types from enclosing or base classes. */
5955 if (binding
&& ! yylex
5956 && BINDING_LEVEL (t
) && BINDING_LEVEL (t
)->parm_flag
== 2)
5957 type_access_control (BINDING_LEVEL (t
)->this_class
, binding
);
5960 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5962 if (val_is_implicit_typename
&& !yylex
)
5963 warn_about_implicit_typename_lookup (val
, binding
);
5965 val_is_implicit_typename
5966 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5967 if (!val_is_implicit_typename
)
5972 /* Now lookup in namespace scopes. */
5973 if (!val
|| val_is_implicit_typename
)
5975 t
= unqualified_namespace_lookup (name
, flags
, 0);
5978 if (val_is_implicit_typename
&& !yylex
)
5979 warn_about_implicit_typename_lookup (val
, t
);
5987 /* This should only warn about types used in qualified-ids. */
5988 if (from_obj
&& from_obj
!= val
)
5990 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5991 && TREE_CODE (val
) == TYPE_DECL
5992 && ! same_type_p (TREE_TYPE (from_obj
), TREE_TYPE (val
)))
5994 lookup of `%D' in the scope of `%#T' (`%#T') \
5995 does not match lookup in the current scope (`%#T')",
5996 name
, got_object
, TREE_TYPE (from_obj
),
5999 /* We don't change val to from_obj if got_object depends on
6000 template parms because that breaks implicit typename for
6001 destructor calls. */
6002 if (! uses_template_parms (got_object
))
6006 /* If we have a single function from a using decl, pull it out. */
6007 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
6008 val
= OVL_FUNCTION (val
);
6017 lookup_name_nonclass (name
)
6020 return lookup_name_real (name
, 0, 1, 0);
6024 lookup_function_nonclass (name
, args
)
6028 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
6032 lookup_name_namespace_only (name
)
6035 /* type-or-namespace, nonclass, namespace_only */
6036 return lookup_name_real (name
, 1, 1, 1);
6040 lookup_name (name
, prefer_type
)
6044 return lookup_name_real (name
, prefer_type
, 0, 0);
6047 /* Similar to `lookup_name' but look only in the innermost non-class
6051 lookup_name_current_level (name
)
6054 struct binding_level
*b
;
6057 b
= current_binding_level
;
6058 while (b
->parm_flag
== 2)
6063 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
6065 /* extern "C" function() */
6066 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
6069 else if (IDENTIFIER_BINDING (name
)
6070 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
6074 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
6075 return IDENTIFIER_VALUE (name
);
6087 /* Like lookup_name_current_level, but for types. */
6090 lookup_type_current_level (name
)
6093 register tree t
= NULL_TREE
;
6095 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
6097 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
6098 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
6100 struct binding_level
*b
= current_binding_level
;
6103 if (purpose_member (name
, b
->type_shadowed
))
6104 return REAL_IDENTIFIER_TYPE_VALUE (name
);
6116 begin_only_namespace_names ()
6118 only_namespace_names
= 1;
6122 end_only_namespace_names ()
6124 only_namespace_names
= 0;
6127 /* Push the declarations of builtin types into the namespace.
6128 RID_INDEX is the index of the builtin type
6129 in the array RID_POINTERS. NAME is the name used when looking
6130 up the builtin type. TYPE is the _TYPE node for the builtin type. */
6133 record_builtin_type (rid_index
, name
, type
)
6138 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
6139 tree tdecl
= NULL_TREE
;
6141 if ((int) rid_index
< (int) RID_MAX
)
6142 rname
= ridpointers
[(int) rid_index
];
6144 tname
= get_identifier (name
);
6146 TYPE_BUILT_IN (type
) = 1;
6150 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
6151 set_identifier_type_value (tname
, NULL_TREE
);
6152 if ((int) rid_index
< (int) RID_MAX
)
6153 /* Built-in types live in the global namespace. */
6154 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
6156 if (rname
!= NULL_TREE
)
6158 if (tname
!= NULL_TREE
)
6160 set_identifier_type_value (rname
, NULL_TREE
);
6161 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
6165 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
6166 set_identifier_type_value (rname
, NULL_TREE
);
6171 /* Record one of the standard Java types.
6172 * Declare it as having the given NAME.
6173 * If SIZE > 0, it is the size of one of the integral types;
6174 * otherwise it is the negative of the size of one of the other types. */
6177 record_builtin_java_type (name
, size
)
6183 type
= make_signed_type (size
);
6184 else if (size
> -32)
6185 { /* "__java_char" or ""__java_boolean". */
6186 type
= make_unsigned_type (-size
);
6187 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
6190 { /* "__java_float" or ""__java_double". */
6191 type
= make_node (REAL_TYPE
);
6192 TYPE_PRECISION (type
) = - size
;
6195 record_builtin_type (RID_MAX
, name
, type
);
6196 decl
= TYPE_NAME (type
);
6198 /* Suppress generate debug symbol entries for these types,
6199 since for normal C++ they are just clutter.
6200 However, push_lang_context undoes this if extern "Java" is seen. */
6201 DECL_IGNORED_P (decl
) = 1;
6203 TYPE_FOR_JAVA (type
) = 1;
6207 /* Push a type into the namespace so that the back-ends ignore it. */
6210 record_unknown_type (type
, name
)
6214 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
6215 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
6216 DECL_IGNORED_P (decl
) = 1;
6217 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
6218 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
6219 TYPE_ALIGN (type
) = 1;
6220 TYPE_USER_ALIGN (type
) = 0;
6221 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
6224 /* An string for which we should create an IDENTIFIER_NODE at
6227 typedef struct predefined_identifier
6229 /* The name of the identifier. */
6231 /* The place where the IDENTIFIER_NODE should be stored. */
6233 /* Non-zero if this is the name of a constructor or destructor. */
6235 } predefined_identifier
;
6237 /* Create all the predefined identifiers. */
6240 initialize_predefined_identifiers ()
6242 struct predefined_identifier
*pid
;
6244 /* A table of identifiers to create at startup. */
6245 static predefined_identifier predefined_identifiers
[] = {
6246 { "C++", &lang_name_cplusplus
, 0 },
6247 { "C", &lang_name_c
, 0 },
6248 { "Java", &lang_name_java
, 0 },
6249 { CTOR_NAME
, &ctor_identifier
, 1 },
6250 { "__base_ctor", &base_ctor_identifier
, 1 },
6251 { "__comp_ctor", &complete_ctor_identifier
, 1 },
6252 { DTOR_NAME
, &dtor_identifier
, 1 },
6253 { "__comp_dtor", &complete_dtor_identifier
, 1 },
6254 { "__base_dtor", &base_dtor_identifier
, 1 },
6255 { "__deleting_dtor", &deleting_dtor_identifier
, 1 },
6256 { VTABLE_DELTA2_NAME
, &delta2_identifier
, 0 },
6257 { VTABLE_DELTA_NAME
, &delta_identifier
, 0 },
6258 { IN_CHARGE_NAME
, &in_charge_identifier
, 0 },
6259 { VTABLE_INDEX_NAME
, &index_identifier
, 0 },
6260 { "nelts", &nelts_identifier
, 0 },
6261 { THIS_NAME
, &this_identifier
, 0 },
6262 { VTABLE_PFN_NAME
, &pfn_identifier
, 0 },
6263 { "__pfn_or_delta2", &pfn_or_delta2_identifier
, 0 },
6264 { "_vptr", &vptr_identifier
, 0 },
6265 { "__cp_push_exception", &cp_push_exception_identifier
, 0 },
6266 { "__vtt_parm", &vtt_parm_identifier
, 0 },
6267 { "std", &std_identifier
, 0 },
6271 for (pid
= predefined_identifiers
; pid
->name
; ++pid
)
6273 *pid
->node
= get_identifier (pid
->name
);
6274 if (pid
->ctor_or_dtor_p
)
6275 IDENTIFIER_CTOR_OR_DTOR_P (*pid
->node
) = 1;
6279 /* Create the predefined scalar types of C,
6280 and some nodes representing standard constants (0, 1, (void *)0).
6281 Initialize the global binding level.
6282 Make definitions for built-in primitive functions. */
6285 init_decl_processing ()
6289 /* Check to see that the user did not specify an invalid combination
6290 of command-line options. */
6291 if (flag_new_abi
&& !flag_vtable_thunks
)
6292 fatal ("the new ABI requires vtable thunks");
6294 /* Create all the identifiers we need. */
6295 initialize_predefined_identifiers ();
6297 /* Fill in back-end hooks. */
6298 init_lang_status
= &push_cp_function_context
;
6299 free_lang_status
= &pop_cp_function_context
;
6300 mark_lang_status
= &mark_cp_function_context
;
6301 lang_safe_from_p
= &c_safe_from_p
;
6302 lang_dump_tree
= &cp_dump_tree
;
6303 lang_missing_noreturn_ok_p
= &cp_missing_noreturn_ok_p
;
6309 /* Create the global variables. */
6310 push_to_top_level ();
6312 /* Enter the global namespace. */
6313 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
6314 push_namespace (get_identifier ("::"));
6315 global_namespace
= current_namespace
;
6316 current_lang_name
= NULL_TREE
;
6318 /* Adjust various flags based on command-line settings. */
6319 if (! flag_permissive
&& ! pedantic
)
6320 flag_pedantic_errors
= 1;
6321 if (!flag_no_inline
)
6322 flag_inline_trees
= 1;
6325 current_lang_name
= lang_name_c
;
6327 current_function_decl
= NULL_TREE
;
6328 current_binding_level
= NULL_BINDING_LEVEL
;
6329 free_binding_level
= NULL_BINDING_LEVEL
;
6331 build_common_tree_nodes (flag_signed_char
);
6333 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6334 TREE_TYPE (error_mark_list
) = error_mark_node
;
6336 /* Make the binding_level structure for global names. */
6338 global_binding_level
= current_binding_level
;
6339 /* The global level is the namespace level of ::. */
6340 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6341 declare_namespace_level ();
6343 /* Create the `std' namespace. */
6346 push_namespace (std_identifier
);
6347 std_node
= current_namespace
;
6349 fake_std_node
= error_mark_node
;
6353 fake_std_node
= build_decl (NAMESPACE_DECL
,
6356 pushdecl (fake_std_node
);
6359 c_common_nodes_and_builtins ();
6361 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6362 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6363 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6364 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6365 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6366 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6367 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6368 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6370 integer_two_node
= build_int_2 (2, 0);
6371 TREE_TYPE (integer_two_node
) = integer_type_node
;
6372 integer_three_node
= build_int_2 (3, 0);
6373 TREE_TYPE (integer_three_node
) = integer_type_node
;
6375 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6376 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6377 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6378 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6379 TYPE_PRECISION (boolean_type_node
) = 1;
6380 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6381 boolean_false_node
= build_int_2 (0, 0);
6382 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6383 boolean_true_node
= build_int_2 (1, 0);
6384 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6386 signed_size_zero_node
= build_int_2 (0, 0);
6387 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6389 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6392 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
6396 delta_type_node
= ptrdiff_type_node
;
6397 else if (flag_huge_objects
)
6398 delta_type_node
= long_integer_type_node
;
6400 delta_type_node
= short_integer_type_node
;
6403 vtable_index_type
= ptrdiff_type_node
;
6405 vtable_index_type
= delta_type_node
;
6407 vtt_parm_type
= build_pointer_type (const_ptr_type_node
);
6408 lang_type_promotes_to
= convert_type_from_ellipsis
;
6411 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6413 /* C++ extensions */
6415 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6416 record_unknown_type (unknown_type_node
, "unknown type");
6418 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6419 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6421 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6423 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6425 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6426 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6428 if (flag_vtable_thunks
)
6430 /* Make sure we get a unique function type, so we can give
6431 its pointer type a name. (This wins for gdb.) */
6432 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6433 TREE_TYPE (vfunc_type
) = integer_type_node
;
6434 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6435 layout_type (vfunc_type
);
6437 vtable_entry_type
= build_pointer_type (vfunc_type
);
6441 vtable_entry_type
= make_aggr_type (RECORD_TYPE
);
6442 fields
[0] = build_decl (FIELD_DECL
, delta_identifier
,
6444 fields
[1] = build_decl (FIELD_DECL
, index_identifier
,
6446 fields
[2] = build_decl (FIELD_DECL
, pfn_identifier
,
6448 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6451 /* Make this part of an invisible union. */
6452 fields
[3] = copy_node (fields
[2]);
6453 TREE_TYPE (fields
[3]) = delta_type_node
;
6454 DECL_NAME (fields
[3]) = delta2_identifier
;
6455 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6456 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6457 DECL_SIZE_UNIT (fields
[3]) = TYPE_SIZE_UNIT (delta_type_node
);
6458 TREE_UNSIGNED (fields
[3]) = 0;
6459 TREE_CHAIN (fields
[2]) = fields
[3];
6460 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6463 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6466 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6467 layout_type (vtbl_type_node
);
6468 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6469 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6470 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6471 layout_type (vtbl_ptr_type_node
);
6472 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6476 push_namespace (get_identifier ("__cxxabiv1"));
6477 abi_node
= current_namespace
;
6481 global_type_node
= make_node (LANG_TYPE
);
6482 record_unknown_type (global_type_node
, "global type");
6485 current_lang_name
= lang_name_cplusplus
;
6488 tree bad_alloc_type_node
, newtype
, deltype
;
6490 push_namespace (std_identifier
);
6491 bad_alloc_type_node
= xref_tag
6492 (class_type_node
, get_identifier ("bad_alloc"), 1);
6495 newtype
= build_exception_variant
6496 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6497 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6498 push_cp_library_fn (NEW_EXPR
, newtype
);
6499 push_cp_library_fn (VEC_NEW_EXPR
, newtype
);
6500 global_delete_fndecl
= push_cp_library_fn (DELETE_EXPR
, deltype
);
6501 push_cp_library_fn (VEC_DELETE_EXPR
, deltype
);
6505 = build_library_fn_ptr ((flag_new_abi
6506 ? "__cxa_pure_virtual"
6507 : "__pure_virtual"),
6510 /* Perform other language dependent initializations. */
6511 init_class_processing ();
6512 init_init_processing ();
6513 init_search_processing ();
6514 init_rtti_processing ();
6516 if (flag_exceptions
)
6517 init_exception_processing ();
6520 flag_inline_functions
= 0;
6523 if (! supports_one_only ())
6526 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6527 function_id_node
= get_identifier ("__FUNCTION__");
6528 pretty_function_id_node
= get_identifier ("__PRETTY_FUNCTION__");
6529 func_id_node
= get_identifier ("__func__");
6531 make_fname_decl
= cp_make_fname_decl
;
6532 declare_function_name ();
6534 /* Prepare to check format strings against argument lists. */
6535 init_function_format_info ();
6537 /* Show we use EH for cleanups. */
6538 using_eh_for_cleanups ();
6540 valid_lang_attribute
= cp_valid_lang_attribute
;
6542 /* Maintain consistency. Perhaps we should just complain if they
6543 say -fwritable-strings? */
6544 if (flag_writable_strings
)
6545 flag_const_strings
= 0;
6547 /* Add GC roots for all of our global variables. */
6548 ggc_add_tree_root (c_global_trees
, sizeof c_global_trees
/ sizeof(tree
));
6549 ggc_add_tree_root (cp_global_trees
, sizeof cp_global_trees
/ sizeof(tree
));
6550 ggc_add_tree_root (&integer_three_node
, 1);
6551 ggc_add_tree_root (&integer_two_node
, 1);
6552 ggc_add_tree_root (&signed_size_zero_node
, 1);
6553 ggc_add_tree_root (&size_one_node
, 1);
6554 ggc_add_tree_root (&size_zero_node
, 1);
6555 ggc_add_root (&global_binding_level
, 1, sizeof global_binding_level
,
6556 mark_binding_level
);
6557 ggc_add_root (&scope_chain
, 1, sizeof scope_chain
, &mark_saved_scope
);
6558 ggc_add_tree_root (&static_ctors
, 1);
6559 ggc_add_tree_root (&static_dtors
, 1);
6560 ggc_add_tree_root (&lastiddecl
, 1);
6562 ggc_add_tree_root (&last_function_parm_tags
, 1);
6563 ggc_add_tree_root (¤t_function_return_value
, 1);
6564 ggc_add_tree_root (¤t_function_parm_tags
, 1);
6565 ggc_add_tree_root (&last_function_parms
, 1);
6566 ggc_add_tree_root (&error_mark_list
, 1);
6568 ggc_add_tree_root (&global_namespace
, 1);
6569 ggc_add_tree_root (&global_type_node
, 1);
6570 ggc_add_tree_root (&anonymous_namespace_name
, 1);
6572 ggc_add_tree_root (&got_object
, 1);
6573 ggc_add_tree_root (&got_scope
, 1);
6575 ggc_add_tree_root (¤t_lang_name
, 1);
6576 ggc_add_tree_root (&static_aggregates
, 1);
6577 ggc_add_tree_root (&free_bindings
, 1);
6580 /* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the
6581 decl, NAME is the initialization string and TYPE_DEP indicates whether
6582 NAME depended on the type of the function. We make use of that to detect
6583 __PRETTY_FUNCTION__ inside a template fn. Because we build a tree for
6584 the function before emitting any of it, we don't need to treat the
6585 VAR_DECL specially. We can decide whether to emit it later, if it was
6589 cp_make_fname_decl (id
, name
, type_dep
)
6594 tree decl
, type
, init
;
6595 size_t length
= strlen (name
);
6596 tree domain
= NULL_TREE
;
6598 if (!processing_template_decl
)
6601 domain
= build_index_type (size_int (length
));
6603 type
= build_cplus_array_type
6604 (build_qualified_type (char_type_node
, TYPE_QUAL_CONST
),
6607 decl
= build_decl (VAR_DECL
, id
, type
);
6608 TREE_STATIC (decl
) = 1;
6609 TREE_READONLY (decl
) = 1;
6610 DECL_SOURCE_LINE (decl
) = 0;
6611 DECL_ARTIFICIAL (decl
) = 1;
6612 DECL_IN_SYSTEM_HEADER (decl
) = 1;
6614 if (processing_template_decl
)
6615 decl
= push_template_decl (decl
);
6618 init
= build (FUNCTION_NAME
, type
);
6619 DECL_PRETTY_FUNCTION_P (decl
) = 1;
6623 init
= build_string (length
+ 1, name
);
6624 TREE_TYPE (init
) = type
;
6626 DECL_INITIAL (decl
) = init
;
6627 cp_finish_decl (decl
, init
, NULL_TREE
, LOOKUP_ONLYCONVERTING
);
6629 /* We will have to make sure we only emit this, if it is actually used. */
6633 /* Entry point for the benefit of c_common_nodes_and_builtins.
6635 Make a definition for a builtin function named NAME and whose data type
6636 is TYPE. TYPE should be a function type with argument types.
6638 CLASS and CODE tell later passes how to compile calls to this function.
6639 See tree.h for possible values.
6641 If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6642 the name to be called if we can't opencode the function. */
6645 builtin_function (name
, type
, code
, class, libname
)
6649 enum built_in_class
class;
6650 const char *libname
;
6652 tree decl
= build_library_fn_1 (get_identifier (name
), ERROR_MARK
, type
);
6653 DECL_BUILT_IN_CLASS (decl
) = class;
6654 DECL_FUNCTION_CODE (decl
) = code
;
6656 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6658 /* All builtins that don't begin with an `_' should go in the `std'
6660 if (flag_honor_std
&& name
[0] != '_')
6662 push_namespace (std_identifier
);
6663 DECL_CONTEXT (decl
) = std_node
;
6666 if (flag_honor_std
&& name
[0] != '_')
6669 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6670 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6671 function in the namespace. */
6673 DECL_ASSEMBLER_NAME (decl
) = get_identifier (libname
);
6674 make_decl_rtl (decl
, NULL
);
6676 /* Warn if a function in the namespace for users
6677 is used without an occasion to consider it declared. */
6678 if (name
[0] != '_' || name
[1] != '_')
6679 DECL_ANTICIPATED (decl
) = 1;
6684 /* Generate a FUNCTION_DECL with the typical flags for a runtime library
6685 function. Not called directly. */
6688 build_library_fn_1 (name
, operator_code
, type
)
6690 enum tree_code operator_code
;
6693 tree fn
= build_lang_decl (FUNCTION_DECL
, name
, type
);
6694 DECL_EXTERNAL (fn
) = 1;
6695 TREE_PUBLIC (fn
) = 1;
6696 DECL_ARTIFICIAL (fn
) = 1;
6697 TREE_NOTHROW (fn
) = 1;
6698 SET_OVERLOADED_OPERATOR_CODE (fn
, operator_code
);
6702 /* Returns the _DECL for a library function with C linkage.
6703 We assume that such functions never throw; if this is incorrect,
6704 callers should unset TREE_NOTHROW. */
6707 build_library_fn (name
, type
)
6711 tree fn
= build_library_fn_1 (name
, ERROR_MARK
, type
);
6712 make_decl_rtl (fn
, NULL
);
6716 /* Returns the _DECL for a library function with C++ linkage. */
6719 build_cp_library_fn (name
, operator_code
, type
)
6721 enum tree_code operator_code
;
6724 tree fn
= build_library_fn_1 (name
, operator_code
, type
);
6725 TREE_NOTHROW (fn
) = TYPE_NOTHROW_P (type
);
6726 DECL_CONTEXT (fn
) = FROB_CONTEXT (current_namespace
);
6727 set_mangled_name_for_decl (fn
);
6728 make_decl_rtl (fn
, NULL
);
6732 /* Like build_library_fn, but takes a C string instead of an
6736 build_library_fn_ptr (name
, type
)
6740 return build_library_fn (get_identifier (name
), type
);
6743 /* Like build_cp_library_fn, but takes a C string instead of an
6747 build_cp_library_fn_ptr (name
, type
)
6751 return build_cp_library_fn (get_identifier (name
), ERROR_MARK
, type
);
6754 /* Like build_library_fn, but also pushes the function so that we will
6755 be able to find it via IDENTIFIER_GLOBAL_VALUE. */
6758 push_library_fn (name
, type
)
6761 tree fn
= build_library_fn (name
, type
);
6762 pushdecl_top_level (fn
);
6766 /* Like build_cp_library_fn, but also pushes the function so that it
6767 will be found by normal lookup. */
6770 push_cp_library_fn (operator_code
, type
)
6771 enum tree_code operator_code
;
6774 tree fn
= build_cp_library_fn (ansi_opname (operator_code
),
6781 /* Like push_library_fn, but takes a TREE_LIST of parm types rather than
6785 push_void_library_fn (name
, parmtypes
)
6786 tree name
, parmtypes
;
6788 tree type
= build_function_type (void_type_node
, parmtypes
);
6789 return push_library_fn (name
, type
);
6792 /* Like push_library_fn, but also note that this function throws
6793 and does not return. Used for __throw_foo and the like. */
6796 push_throw_library_fn (name
, type
)
6799 tree fn
= push_library_fn (name
, type
);
6800 TREE_THIS_VOLATILE (fn
) = 1;
6801 TREE_NOTHROW (fn
) = 0;
6805 /* When we call finish_struct for an anonymous union, we create
6806 default copy constructors and such. But, an anonymous union
6807 shouldn't have such things; this function undoes the damage to the
6808 anonymous union type T.
6810 (The reason that we create the synthesized methods is that we don't
6811 distinguish `union { int i; }' from `typedef union { int i; } U'.
6812 The first is an anonymous union; the second is just an ordinary
6816 fixup_anonymous_aggr (t
)
6821 /* Wipe out memory of synthesized methods */
6822 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6823 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6824 TYPE_HAS_INIT_REF (t
) = 0;
6825 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6826 TYPE_HAS_ASSIGN_REF (t
) = 0;
6827 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6829 /* Splice the implicitly generated functions out of the TYPE_METHODS
6831 q
= &TYPE_METHODS (t
);
6834 if (DECL_ARTIFICIAL (*q
))
6835 *q
= TREE_CHAIN (*q
);
6837 q
= &TREE_CHAIN (*q
);
6840 /* ISO C++ 9.5.3. Anonymous unions may not have function members. */
6841 if (TYPE_METHODS (t
))
6842 cp_error_at ("an anonymous union cannot have function members", t
);
6845 /* Make sure that a declaration with no declarator is well-formed, i.e.
6846 just defines a tagged type or anonymous union.
6848 Returns the type defined, if any. */
6851 check_tag_decl (declspecs
)
6856 tree ob_modifier
= NULL_TREE
;
6858 register tree t
= NULL_TREE
;
6860 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6862 register tree value
= TREE_VALUE (link
);
6865 || (TREE_CODE (value
) == IDENTIFIER_NODE
6866 && IDENTIFIER_GLOBAL_VALUE (value
)
6867 && TYPE_P (IDENTIFIER_GLOBAL_VALUE (value
))))
6871 if ((TREE_CODE (value
) != TYPENAME_TYPE
&& IS_AGGR_TYPE (value
))
6872 || TREE_CODE (value
) == ENUMERAL_TYPE
)
6874 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6878 else if (value
== ridpointers
[(int) RID_FRIEND
])
6880 if (current_class_type
== NULL_TREE
6881 || current_scope () != current_class_type
)
6882 ob_modifier
= value
;
6886 else if (value
== ridpointers
[(int) RID_STATIC
]
6887 || value
== ridpointers
[(int) RID_EXTERN
]
6888 || value
== ridpointers
[(int) RID_AUTO
]
6889 || value
== ridpointers
[(int) RID_REGISTER
]
6890 || value
== ridpointers
[(int) RID_INLINE
]
6891 || value
== ridpointers
[(int) RID_VIRTUAL
]
6892 || value
== ridpointers
[(int) RID_CONST
]
6893 || value
== ridpointers
[(int) RID_VOLATILE
]
6894 || value
== ridpointers
[(int) RID_EXPLICIT
])
6895 ob_modifier
= value
;
6899 error ("multiple types in one declaration");
6901 if (t
== NULL_TREE
&& ! saw_friend
)
6902 pedwarn ("declaration does not declare anything");
6904 /* Check for an anonymous union. We're careful
6905 accessing TYPE_IDENTIFIER because some built-in types, like
6906 pointer-to-member types, do not have TYPE_NAME. */
6907 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
6909 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
6911 /* Anonymous unions are objects, so they can have specifiers. */;
6912 SET_ANON_AGGR_TYPE_P (t
);
6914 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
6915 pedwarn ("ISO C++ prohibits anonymous structs");
6918 else if (ob_modifier
)
6920 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
6921 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
6922 cp_error ("`%D' can only be specified for functions", ob_modifier
);
6923 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
6924 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
6925 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
6926 cp_error ("`%D' can only be specified for constructors",
6929 cp_error ("`%D' can only be specified for objects and functions",
6936 /* Called when a declaration is seen that contains no names to declare.
6937 If its type is a reference to a structure, union or enum inherited
6938 from a containing scope, shadow that tag name for the current scope
6939 with a forward reference.
6940 If its type defines a new named structure or union
6941 or defines an enum, it is valid but we need not do anything here.
6942 Otherwise, it is an error.
6944 C++: may have to grok the declspecs to learn about static,
6945 complain for anonymous unions. */
6948 shadow_tag (declspecs
)
6951 tree t
= check_tag_decl (declspecs
);
6954 maybe_process_partial_specialization (t
);
6956 /* This is where the variables in an anonymous union are
6957 declared. An anonymous union declaration looks like:
6959 because there is no declarator after the union, the parser
6960 sends that declaration here. */
6961 if (t
&& ANON_AGGR_TYPE_P (t
))
6963 fixup_anonymous_aggr (t
);
6965 if (TYPE_FIELDS (t
))
6967 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
6969 finish_anon_union (decl
);
6974 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6977 groktypename (typename
)
6980 if (TREE_CODE (typename
) != TREE_LIST
)
6982 return grokdeclarator (TREE_VALUE (typename
),
6983 TREE_PURPOSE (typename
),
6984 TYPENAME
, 0, NULL_TREE
);
6987 /* Decode a declarator in an ordinary declaration or data definition.
6988 This is called as soon as the type information and variable name
6989 have been parsed, before parsing the initializer if any.
6990 Here we create the ..._DECL node, fill in its type,
6991 and put it on the list of decls for the current context.
6992 The ..._DECL node is returned as the value.
6994 Exception: for arrays where the length is not specified,
6995 the type is left null, to be filled in by `cp_finish_decl'.
6997 Function definitions do not come here; they go to start_function
6998 instead. However, external and forward declarations of functions
6999 do go through here. Structure field declarations are done by
7000 grokfield and not through here. */
7003 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
7004 tree declarator
, declspecs
;
7006 tree attributes
, prefix_attributes
;
7009 register tree type
, tem
;
7011 extern int have_extern_spec
;
7012 extern int used_extern_spec
;
7016 /* See code below that used this. */
7017 int init_written
= initialized
;
7020 /* This should only be done once on the top most decl. */
7021 if (have_extern_spec
&& !used_extern_spec
)
7023 declspecs
= tree_cons (NULL_TREE
, get_identifier ("extern"),
7025 used_extern_spec
= 1;
7028 if (attributes
|| prefix_attributes
)
7029 attrlist
= build_tree_list (attributes
, prefix_attributes
);
7031 attrlist
= NULL_TREE
;
7033 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
7036 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
7039 type
= TREE_TYPE (decl
);
7041 if (type
== error_mark_node
)
7044 context
= DECL_CONTEXT (decl
);
7046 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
7047 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
7049 /* When parsing the initializer, lookup should use the object's
7051 push_decl_namespace (context
);
7054 /* We are only interested in class contexts, later. */
7055 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
7056 context
= NULL_TREE
;
7059 /* Is it valid for this decl to have an initializer at all?
7060 If not, set INITIALIZED to zero, which will indirectly
7061 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7062 switch (TREE_CODE (decl
))
7065 /* typedef foo = bar means give foo the same type as bar.
7066 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
7067 Any other case of an initialization in a TYPE_DECL is an error. */
7068 if (pedantic
|| list_length (declspecs
) > 1)
7070 cp_error ("typedef `%D' is initialized", decl
);
7076 cp_error ("function `%#D' is initialized like a variable", decl
);
7086 if (! toplevel_bindings_p ()
7087 && DECL_EXTERNAL (decl
))
7088 cp_warning ("declaration of `%#D' has `extern' and is initialized",
7090 DECL_EXTERNAL (decl
) = 0;
7091 if (toplevel_bindings_p ())
7092 TREE_STATIC (decl
) = 1;
7094 /* Tell `pushdecl' this is an initialized decl
7095 even though we don't yet have the initializer expression.
7096 Also tell `cp_finish_decl' it may store the real initializer. */
7097 DECL_INITIAL (decl
) = error_mark_node
;
7100 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
7101 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
7104 /* Set attributes here so if duplicate decl, will have proper attributes. */
7105 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
7107 if (context
&& COMPLETE_TYPE_P (complete_type (context
)))
7109 push_nested_class (context
, 2);
7111 if (TREE_CODE (decl
) == VAR_DECL
)
7113 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
7114 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
7115 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
7118 if (DECL_CONTEXT (field
) != context
)
7120 cp_pedwarn ("ISO C++ does not permit `%T::%D' to be defined as `%T::%D'",
7121 DECL_CONTEXT (field
), DECL_NAME (decl
),
7122 context
, DECL_NAME (decl
));
7123 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
7125 /* Static data member are tricky; an in-class initialization
7126 still doesn't provide a definition, so the in-class
7127 declaration will have DECL_EXTERNAL set, but will have an
7128 initialization. Thus, duplicate_decls won't warn
7129 about this situation, and so we check here. */
7130 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
7131 cp_error ("duplicate initialization of %D", decl
);
7132 if (duplicate_decls (decl
, field
))
7138 tree field
= check_classfn (context
, decl
);
7139 if (field
&& duplicate_decls (decl
, field
))
7143 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
7144 DECL_IN_AGGR_P (decl
) = 0;
7145 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
7146 || CLASSTYPE_TEMPLATE_INSTANTIATION (context
))
7148 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
7149 /* [temp.expl.spec] An explicit specialization of a static data
7150 member of a template is a definition if the declaration
7151 includes an initializer; otherwise, it is a declaration.
7153 We check for processing_specialization so this only applies
7154 to the new specialization syntax. */
7155 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
7156 DECL_EXTERNAL (decl
) = 1;
7159 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
7160 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
7164 /* Enter this declaration into the symbol table. */
7165 tem
= maybe_push_decl (decl
);
7167 if (processing_template_decl
)
7168 tem
= push_template_decl (tem
);
7170 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7171 /* Tell the back-end to use or not use .common as appropriate. If we say
7172 -fconserve-space, we want this to save .data space, at the expense of
7173 wrong semantics. If we say -fno-conserve-space, we want this to
7174 produce errors about redefs; to do this we force variables into the
7176 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
7179 if (! processing_template_decl
)
7189 tree type
= TREE_TYPE (decl
);
7190 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
7192 if (type
== error_mark_node
)
7195 /* If this type of object needs a cleanup, but we're not allowed to
7196 add any more objects with cleanups to the current scope, create a
7197 new binding level. */
7198 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
7199 && current_binding_level
->more_cleanups_ok
== 0)
7201 keep_next_level (2);
7204 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/1);
7208 /* Is it valid for this decl to have an initializer at all?
7209 If not, set INITIALIZED to zero, which will indirectly
7210 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7212 /* Don't allow initializations for incomplete types except for
7213 arrays which might be completed by the initialization. */
7214 if (COMPLETE_TYPE_P (complete_type (type
)))
7215 ; /* A complete type is ok. */
7216 else if (TREE_CODE (type
) != ARRAY_TYPE
)
7218 cp_error ("variable `%#D' has initializer but incomplete type",
7221 type
= TREE_TYPE (decl
) = error_mark_node
;
7223 else if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (type
))))
7225 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
7226 cp_error ("elements of array `%#D' have incomplete type", decl
);
7227 /* else we already gave an error in start_decl. */
7233 && TREE_CODE (decl
) != TYPE_DECL
7234 && TREE_CODE (decl
) != TEMPLATE_DECL
7235 && type
!= error_mark_node
7236 && IS_AGGR_TYPE (type
)
7237 && ! DECL_EXTERNAL (decl
))
7239 if ((! processing_template_decl
|| ! uses_template_parms (type
))
7240 && !COMPLETE_TYPE_P (complete_type (type
)))
7242 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
7244 /* Change the type so that assemble_variable will give
7245 DECL an rtl we can live with: (mem (const_int 0)). */
7246 type
= TREE_TYPE (decl
) = error_mark_node
;
7250 /* If any base type in the hierarchy of TYPE needs a constructor,
7251 then we set initialized to 1. This way any nodes which are
7252 created for the purposes of initializing this aggregate
7253 will live as long as it does. This is necessary for global
7254 aggregates which do not have their initializers processed until
7255 the end of the file. */
7256 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
7261 DECL_INITIAL (decl
) = NULL_TREE
;
7264 /* Handle initialization of references.
7265 These three arguments are from `cp_finish_decl', and have the
7266 same meaning here that they do there.
7268 Quotes on semantics can be found in ARM 8.4.3. */
7271 grok_reference_init (decl
, type
, init
)
7272 tree decl
, type
, init
;
7276 if (init
== NULL_TREE
)
7278 if ((DECL_LANG_SPECIFIC (decl
) == 0
7279 || DECL_IN_AGGR_P (decl
) == 0)
7280 && ! DECL_THIS_EXTERN (decl
))
7281 cp_error ("`%D' declared as reference but not initialized", decl
);
7285 if (init
== error_mark_node
)
7288 if (TREE_CODE (init
) == CONSTRUCTOR
)
7290 cp_error ("ISO C++ forbids use of initializer list to initialize reference `%D'", decl
);
7294 if (TREE_CODE (init
) == TREE_LIST
)
7295 init
= build_compound_expr (init
);
7297 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
7298 init
= convert_from_reference (init
);
7300 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
7301 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
7303 /* Note: default conversion is only called in very special cases. */
7304 init
= default_conversion (init
);
7307 /* Convert INIT to the reference type TYPE. This may involve the
7308 creation of a temporary, whose lifetime must be the same as that
7309 of the reference. If so, a DECL_STMT for the temporary will be
7310 added just after the DECL_STMT for DECL. That's why we don't set
7311 DECL_INITIAL for local references (instead assigning to them
7312 explicitly); we need to allow the temporary to be initialized
7314 tmp
= convert_to_reference
7315 (type
, init
, CONV_IMPLICIT
,
7316 LOOKUP_ONLYCONVERTING
|LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
,
7319 if (tmp
== error_mark_node
)
7321 else if (tmp
!= NULL_TREE
)
7324 tmp
= save_expr (tmp
);
7325 if (building_stmt_tree ())
7327 /* Initialize the declaration. */
7328 tmp
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, tmp
);
7329 finish_expr_stmt (tmp
);
7332 DECL_INITIAL (decl
) = tmp
;
7336 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7340 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
7342 expand_static_init (decl
, DECL_INITIAL (decl
));
7343 DECL_INITIAL (decl
) = NULL_TREE
;
7348 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7349 mucking with forces it does not comprehend (i.e. initialization with a
7350 constructor). If we are at global scope and won't go into COMMON, fill
7351 it in with a dummy CONSTRUCTOR to force the variable into .data;
7352 otherwise we can use error_mark_node. */
7355 obscure_complex_init (decl
, init
)
7358 if (! flag_no_inline
&& TREE_STATIC (decl
))
7360 if (extract_init (decl
, init
))
7364 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7365 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7366 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7370 DECL_INITIAL (decl
) = error_mark_node
;
7375 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7376 array until we finish parsing the initializer. If that's the
7377 situation we're in, update DECL accordingly. */
7380 maybe_deduce_size_from_array_init (decl
, init
)
7384 tree type
= TREE_TYPE (decl
);
7386 if (TREE_CODE (type
) == ARRAY_TYPE
7387 && TYPE_DOMAIN (type
) == NULL_TREE
7388 && TREE_CODE (decl
) != TYPE_DECL
)
7390 /* do_default is really a C-ism to deal with tentative definitions.
7391 But let's leave it here to ease the eventual merge. */
7392 int do_default
= !DECL_EXTERNAL (decl
);
7393 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7394 int failure
= complete_array_type (type
, initializer
, do_default
);
7397 cp_error ("initializer fails to determine size of `%D'", decl
);
7402 cp_error ("array size missing in `%D'", decl
);
7403 /* If a `static' var's size isn't known, make it extern as
7404 well as static, so it does not get allocated. If it's not
7405 `static', then don't mark it extern; finish_incomplete_decl
7406 will give it a default size and it will get allocated. */
7407 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7408 DECL_EXTERNAL (decl
) = 1;
7411 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7412 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7414 cp_error ("zero-size array `%D'", decl
);
7416 layout_decl (decl
, 0);
7420 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7421 any appropriate error messages regarding the layout. */
7424 layout_var_decl (decl
)
7427 tree type
= TREE_TYPE (decl
);
7429 tree ttype
= target_type (type
);
7432 /* If we haven't already layed out this declaration, do so now.
7433 Note that we must not call complete type for an external object
7434 because it's type might involve templates that we are not
7435 supposed to isntantiate yet. (And it's perfectly legal to say
7436 `extern X x' for some incomplete type `X'.) */
7437 if (!DECL_EXTERNAL (decl
))
7438 complete_type (type
);
7439 if (!DECL_SIZE (decl
) && COMPLETE_TYPE_P (type
))
7440 layout_decl (decl
, 0);
7442 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7444 /* An automatic variable with an incomplete type: that is an error.
7445 Don't talk about array types here, since we took care of that
7446 message in grokdeclarator. */
7447 cp_error ("storage size of `%D' isn't known", decl
);
7448 TREE_TYPE (decl
) = error_mark_node
;
7451 /* Keep this code around in case we later want to control debug info
7452 based on whether a type is "used". (jason 1999-11-11) */
7454 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7455 /* Let debugger know it should output info for this type. */
7456 note_debug_info_needed (ttype
);
7458 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7459 note_debug_info_needed (DECL_CONTEXT (decl
));
7462 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7463 && DECL_SIZE (decl
) != NULL_TREE
7464 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7466 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7467 constant_expression_warning (DECL_SIZE (decl
));
7469 cp_error ("storage size of `%D' isn't constant", decl
);
7473 /* If a local static variable is declared in an inline function, or if
7474 we have a weak definition, we must endeavor to create only one
7475 instance of the variable at link-time. */
7478 maybe_commonize_var (decl
)
7481 /* Static data in a function with comdat linkage also has comdat
7483 if (TREE_STATIC (decl
)
7484 /* Don't mess with __FUNCTION__. */
7485 && ! DECL_ARTIFICIAL (decl
)
7486 && current_function_decl
7487 && DECL_CONTEXT (decl
) == current_function_decl
7488 && (DECL_THIS_INLINE (current_function_decl
)
7489 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7490 && TREE_PUBLIC (current_function_decl
))
7492 /* Rather than try to get this right with inlining, we suppress
7493 inlining of such functions. */
7494 current_function_cannot_inline
7495 = "function with static variable cannot be inline";
7496 DECL_UNINLINABLE (current_function_decl
) = 1;
7498 /* If flag_weak, we don't need to mess with this, as we can just
7499 make the function weak, and let it refer to its unique local
7500 copy. This works because we don't allow the function to be
7504 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7506 TREE_PUBLIC (decl
) = 1;
7507 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7509 else if (DECL_INITIAL (decl
) == NULL_TREE
7510 || DECL_INITIAL (decl
) == error_mark_node
)
7512 TREE_PUBLIC (decl
) = 1;
7513 DECL_COMMON (decl
) = 1;
7515 /* else we lose. We can only do this if we can use common,
7516 which we can't if it has been initialized. */
7518 if (TREE_PUBLIC (decl
))
7519 DECL_ASSEMBLER_NAME (decl
)
7520 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7523 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7524 cp_warning_at (" you can work around this by removing the initializer", decl
);
7528 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7529 /* Set it up again; we might have set DECL_INITIAL since the last
7531 comdat_linkage (decl
);
7534 /* Issue an error message if DECL is an uninitialized const variable. */
7537 check_for_uninitialized_const_var (decl
)
7540 tree type
= TREE_TYPE (decl
);
7542 /* ``Unless explicitly declared extern, a const object does not have
7543 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7545 if (TREE_CODE (decl
) == VAR_DECL
7546 && TREE_CODE (type
) != REFERENCE_TYPE
7547 && CP_TYPE_CONST_P (type
)
7548 && !TYPE_NEEDS_CONSTRUCTING (type
)
7549 && !DECL_INITIAL (decl
))
7550 cp_error ("uninitialized const `%D'", decl
);
7553 /* Verify INIT (the initializer for DECL), and record the
7554 initialization in DECL_INITIAL, if appropriate. Returns a new
7558 check_initializer (decl
, init
)
7564 if (TREE_CODE (decl
) == FIELD_DECL
)
7567 type
= TREE_TYPE (decl
);
7569 /* If `start_decl' didn't like having an initialization, ignore it now. */
7570 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7573 /* Check the initializer. */
7576 /* Things that are going to be initialized need to have complete
7578 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7580 if (type
== error_mark_node
)
7581 /* We will have already complained. */
7583 else if (COMPLETE_TYPE_P (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7585 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7588 else if (TREE_CODE (type
) == ARRAY_TYPE
7589 && !COMPLETE_TYPE_P (TREE_TYPE (type
)))
7591 cp_error ("elements of array `%#D' have incomplete type", decl
);
7594 else if (!COMPLETE_TYPE_P (type
))
7596 cp_error ("`%D' has incomplete type", decl
);
7597 TREE_TYPE (decl
) = error_mark_node
;
7602 if (TREE_CODE (decl
) == CONST_DECL
)
7604 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7606 DECL_INITIAL (decl
) = init
;
7608 /* This will keep us from needing to worry about our obstacks. */
7609 my_friendly_assert (init
!= NULL_TREE
, 149);
7612 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7614 if (TREE_STATIC (decl
))
7615 make_decl_rtl (decl
, NULL_PTR
);
7616 grok_reference_init (decl
, type
, init
);
7621 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7623 if (TREE_CODE (type
) == ARRAY_TYPE
)
7624 init
= digest_init (type
, init
, (tree
*) 0);
7625 else if (TREE_CODE (init
) == CONSTRUCTOR
7626 && TREE_HAS_CONSTRUCTOR (init
))
7628 if (TYPE_NON_AGGREGATE_CLASS (type
))
7630 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7632 init
= error_mark_node
;
7635 goto dont_use_constructor
;
7640 dont_use_constructor
:
7641 if (TREE_CODE (init
) != TREE_VEC
)
7642 init
= store_init_value (decl
, init
);
7646 /* We must hide the initializer so that expand_decl
7647 won't try to do something it does not understand. */
7648 init
= obscure_complex_init (decl
, init
);
7650 else if (DECL_EXTERNAL (decl
))
7652 else if (TYPE_P (type
)
7653 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7655 tree core_type
= strip_array_types (type
);
7657 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7659 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7660 cp_error ("structure `%D' with uninitialized const members", decl
);
7661 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7662 cp_error ("structure `%D' with uninitialized reference members",
7666 check_for_uninitialized_const_var (decl
);
7668 if (COMPLETE_TYPE_P (type
) && TYPE_NEEDS_CONSTRUCTING (type
))
7669 init
= obscure_complex_init (decl
, NULL_TREE
);
7673 check_for_uninitialized_const_var (decl
);
7678 /* If DECL is not a local variable, give it RTL. */
7681 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
7684 const char *asmspec
;
7686 int toplev
= toplevel_bindings_p ();
7689 /* Handle non-variables up front. */
7690 if (TREE_CODE (decl
) != VAR_DECL
)
7692 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7696 /* If we see a class member here, it should be a static data
7698 if (DECL_LANG_SPECIFIC (decl
) && DECL_IN_AGGR_P (decl
))
7700 my_friendly_assert (TREE_STATIC (decl
), 19990828);
7701 /* An in-class declaration of a static data member should be
7702 external; it is only a declaration, and not a definition. */
7703 if (init
== NULL_TREE
)
7704 my_friendly_assert (DECL_EXTERNAL (decl
), 20000723);
7707 /* Set the DECL_ASSEMBLER_NAME for the variable. */
7709 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7711 /* We don't create any RTL for local variables. */
7712 if (DECL_FUNCTION_SCOPE_P (decl
) && !TREE_STATIC (decl
))
7715 /* We defer emission of local statics until the corresponding
7716 DECL_STMT is expanded. */
7717 defer_p
= DECL_FUNCTION_SCOPE_P (decl
) || DECL_VIRTUAL_P (decl
);
7719 /* We try to defer namespace-scope static constants so that they are
7720 not emitted into the object file unncessarily. */
7721 if (!DECL_VIRTUAL_P (decl
)
7722 && TREE_READONLY (decl
)
7723 && DECL_INITIAL (decl
) != NULL_TREE
7724 && DECL_INITIAL (decl
) != error_mark_node
7725 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
))
7727 && !TREE_PUBLIC (decl
))
7729 /* Fool with the linkage according to #pragma interface. */
7730 if (!interface_unknown
)
7732 TREE_PUBLIC (decl
) = 1;
7733 DECL_EXTERNAL (decl
) = interface_only
;
7739 /* If we're deferring the variable, just make RTL. Do not actually
7740 emit the variable. */
7742 make_decl_rtl (decl
, asmspec
);
7743 /* If we're not deferring, go ahead and assemble the variable. */
7745 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7748 /* The old ARM scoping rules injected variables declared in the
7749 initialization statement of a for-statement into the surrounding
7750 scope. We support this usage, in order to be backward-compatible.
7751 DECL is a just-declared VAR_DECL; if necessary inject its
7752 declaration into the surrounding scope. */
7755 maybe_inject_for_scope_var (decl
)
7758 if (!DECL_NAME (decl
))
7761 if (current_binding_level
->is_for_scope
)
7763 struct binding_level
*outer
7764 = current_binding_level
->level_chain
;
7766 /* Check to see if the same name is already bound at the outer
7767 level, either because it was directly declared, or because a
7768 dead for-decl got preserved. In either case, the code would
7769 not have been valid under the ARM scope rules, so clear
7770 is_for_scope for the current_binding_level.
7772 Otherwise, we need to preserve the temp slot for decl to last
7773 into the outer binding level. */
7776 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7778 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7779 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7781 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7783 BINDING_VALUE (outer_binding
)
7784 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7785 current_binding_level
->is_for_scope
= 0;
7787 else if (DECL_IN_MEMORY_P (decl
))
7788 preserve_temp_slots (DECL_RTL (decl
));
7792 /* Generate code to initialize DECL (a local variable). */
7795 initialize_local_var (decl
, init
, flags
)
7800 tree type
= TREE_TYPE (decl
);
7802 /* If the type is bogus, don't bother initializing the variable. */
7803 if (type
== error_mark_node
)
7806 if (DECL_SIZE (decl
) == NULL_TREE
&& !TREE_STATIC (decl
))
7808 /* If we used it already as memory, it must stay in memory. */
7809 DECL_INITIAL (decl
) = NULL_TREE
;
7810 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7813 /* Local statics are handled differently from ordinary automatic
7815 if (TREE_STATIC (decl
))
7817 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7818 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7819 expand_static_init (decl
, init
);
7823 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7827 /* Compute and store the initial value. */
7828 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7830 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7832 int saved_stmts_are_full_exprs_p
;
7834 my_friendly_assert (building_stmt_tree (), 20000906);
7835 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p ();
7836 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
7837 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7838 current_stmt_tree ()->stmts_are_full_exprs_p
=
7839 saved_stmts_are_full_exprs_p
;
7842 /* Set this to 0 so we can tell whether an aggregate which was
7843 initialized was ever used. Don't do this if it has a
7844 destructor, so we don't complain about the 'resource
7845 allocation is initialization' idiom. Now set
7846 attribute((unused)) on types so decls of that type will be
7847 marked used. (see TREE_USED, above.) */
7848 if (TYPE_NEEDS_CONSTRUCTING (type
)
7850 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type
)
7851 && DECL_NAME (decl
))
7852 TREE_USED (decl
) = 0;
7853 else if (already_used
)
7854 TREE_USED (decl
) = 1;
7858 /* Generate code to destroy DECL (a local variable). */
7861 destroy_local_var (decl
)
7864 tree type
= TREE_TYPE (decl
);
7867 /* Only variables get cleaned up. */
7868 if (TREE_CODE (decl
) != VAR_DECL
)
7871 /* And only things with destructors need cleaning up. */
7872 if (type
== error_mark_node
7873 || TYPE_HAS_TRIVIAL_DESTRUCTOR (type
))
7876 if (TREE_CODE (decl
) == VAR_DECL
&&
7877 (DECL_EXTERNAL (decl
) || TREE_STATIC (decl
)))
7878 /* We don't clean up things that aren't defined in this
7879 translation unit, or that need a static cleanup. The latter
7880 are handled by finish_file. */
7883 /* Compute the cleanup. */
7884 cleanup
= maybe_build_cleanup (decl
);
7886 /* Record the cleanup required for this declaration. */
7887 if (DECL_SIZE (decl
) && TREE_TYPE (decl
) != error_mark_node
7889 finish_decl_cleanup (decl
, cleanup
);
7892 /* Finish processing of a declaration;
7893 install its line number and initial value.
7894 If the length of an array type is not known before,
7895 it must be determined now, from the initial value, or it is an error.
7897 INIT holds the value of an initializer that should be allowed to escape
7900 FLAGS is LOOKUP_ONLYCONVERTING if the = init syntax was used, else 0
7901 if the (init) syntax was used. */
7904 cp_finish_decl (decl
, init
, asmspec_tree
, flags
)
7910 tree ttype
= NULL_TREE
;
7911 const char *asmspec
= NULL
;
7912 int was_readonly
= 0;
7917 error ("assignment (not initialization) in declaration");
7921 /* If a name was specified, get the string. */
7923 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
7925 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
7927 cp_error ("cannot initialize `%D' to namespace `%D'",
7932 if (current_class_type
7933 && CP_DECL_CONTEXT (decl
) == current_class_type
7934 && TYPE_BEING_DEFINED (current_class_type
)
7935 && (DECL_INITIAL (decl
) || init
))
7936 DECL_INITIALIZED_IN_CLASS_P (decl
) = 1;
7938 if (TREE_CODE (decl
) == VAR_DECL
7939 && DECL_CONTEXT (decl
)
7940 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7941 && DECL_CONTEXT (decl
) != current_namespace
7944 /* Leave the namespace of the object. */
7945 pop_decl_namespace ();
7948 type
= TREE_TYPE (decl
);
7950 if (type
== error_mark_node
)
7953 /* Add this declaration to the statement-tree. */
7954 if (building_stmt_tree ()
7955 && at_function_scope_p ()
7956 && TREE_CODE (decl
) != RESULT_DECL
)
7957 add_decl_stmt (decl
);
7959 if (TYPE_HAS_MUTABLE_P (type
))
7960 TREE_READONLY (decl
) = 0;
7962 if (processing_template_decl
)
7964 if (init
&& DECL_INITIAL (decl
))
7965 DECL_INITIAL (decl
) = init
;
7969 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
7970 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
7972 /* Take care of TYPE_DECLs up front. */
7973 if (TREE_CODE (decl
) == TYPE_DECL
)
7975 if (init
&& DECL_INITIAL (decl
))
7977 /* typedef foo = bar; store the type of bar as the type of foo. */
7978 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
7979 DECL_INITIAL (decl
) = init
= NULL_TREE
;
7981 if (type
!= error_mark_node
7982 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
7984 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
7985 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
7986 set_identifier_type_value (DECL_NAME (decl
), type
);
7987 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
7989 GNU_xref_decl (current_function_decl
, decl
);
7991 /* If we have installed this as the canonical typedef for this
7992 type, and that type has not been defined yet, delay emitting
7993 the debug information for it, as we will emit it later. */
7994 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
7995 && !COMPLETE_TYPE_P (TREE_TYPE (decl
)))
7996 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
7998 rest_of_decl_compilation (decl
, NULL_PTR
,
7999 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
8003 if (TREE_CODE (decl
) != FUNCTION_DECL
)
8004 ttype
= target_type (type
);
8006 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
8007 && TYPE_NEEDS_CONSTRUCTING (type
))
8009 /* Currently, GNU C++ puts constants in text space, making them
8010 impossible to initialize. In the future, one would hope for
8011 an operating system which understood the difference between
8012 initialization and the running of a program. */
8014 TREE_READONLY (decl
) = 0;
8017 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
8019 /* This must override the asm specifier which was placed by
8020 grokclassfn. Lay this out fresh. */
8021 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
8022 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
8023 make_decl_rtl (decl
, asmspec
);
8026 /* Deduce size of array from initialization, if not already known. */
8027 maybe_deduce_size_from_array_init (decl
, init
);
8028 init
= check_initializer (decl
, init
);
8030 GNU_xref_decl (current_function_decl
, decl
);
8032 if (TREE_CODE (decl
) == VAR_DECL
)
8033 layout_var_decl (decl
);
8035 /* Output the assembler code and/or RTL code for variables and functions,
8036 unless the type is an undefined structure or union.
8037 If not, it will get done when the type is completed. */
8038 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
8039 || TREE_CODE (decl
) == RESULT_DECL
)
8041 if (TREE_CODE (decl
) == VAR_DECL
)
8042 maybe_commonize_var (decl
);
8044 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
8046 if (TREE_CODE (type
) == FUNCTION_TYPE
8047 || TREE_CODE (type
) == METHOD_TYPE
)
8048 abstract_virtuals_error (decl
,
8049 strip_array_types (TREE_TYPE (type
)));
8051 abstract_virtuals_error (decl
, strip_array_types (type
));
8053 if (TREE_CODE (decl
) == FUNCTION_DECL
)
8055 else if (DECL_EXTERNAL (decl
)
8056 && ! (DECL_LANG_SPECIFIC (decl
)
8057 && DECL_NOT_REALLY_EXTERN (decl
)))
8060 DECL_INITIAL (decl
) = init
;
8062 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
8064 /* This is a local declaration. */
8065 if (doing_semantic_analysis_p ())
8066 maybe_inject_for_scope_var (decl
);
8067 /* Initialize the local variable. But, if we're building a
8068 statement-tree, we'll do the initialization when we
8070 if (processing_template_decl
)
8072 if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
8073 DECL_INITIAL (decl
) = init
;
8077 /* If we're not building RTL, then we need to do so
8079 my_friendly_assert (building_stmt_tree (), 20000906);
8080 /* Initialize the variable. */
8081 initialize_local_var (decl
, init
, flags
);
8082 /* Clean up the variable. */
8083 destroy_local_var (decl
);
8086 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
8088 /* Cleanups for static variables are handled by `finish_file'. */
8089 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
8090 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
8091 expand_static_init (decl
, init
);
8095 /* Undo call to `pushclass' that was done in `start_decl'
8096 due to initialization of qualified member variable.
8097 I.e., Foo::x = 10; */
8099 tree context
= CP_DECL_CONTEXT (decl
);
8102 && (TREE_CODE (decl
) == VAR_DECL
8103 /* We also have a pushclass done that we need to undo here
8104 if we're at top level and declare a method. */
8105 || TREE_CODE (decl
) == FUNCTION_DECL
)
8106 /* If size hasn't been set, we're still defining it,
8107 and therefore inside the class body; don't pop
8108 the binding level.. */
8109 && COMPLETE_TYPE_P (context
)
8110 && context
== current_class_type
)
8111 pop_nested_class ();
8118 TREE_READONLY (decl
) = 1;
8121 /* This is here for a midend callback from c-common.c */
8124 finish_decl (decl
, init
, asmspec_tree
)
8128 cp_finish_decl (decl
, init
, asmspec_tree
, 0);
8131 /* Returns a declaration for a VAR_DECL as if:
8133 extern "C" TYPE NAME;
8135 had been seen. Used to create compiler-generated global
8139 declare_global_var (name
, type
)
8145 push_to_top_level ();
8146 decl
= build_decl (VAR_DECL
, name
, type
);
8147 TREE_PUBLIC (decl
) = 1;
8148 DECL_EXTERNAL (decl
) = 1;
8149 DECL_ARTIFICIAL (decl
) = 1;
8151 cp_finish_decl (decl
, NULL_TREE
, NULL_TREE
, 0);
8152 pop_from_top_level ();
8157 /* Returns a pointer to the `atexit' function. Note that if
8158 FLAG_USE_CXA_ATEXIT is non-zero, then this will actually be the new
8159 `__cxa_atexit' function specified in the IA64 C++ ABI. */
8173 if (flag_use_cxa_atexit
)
8175 /* The declaration for `__cxa_atexit' is:
8177 int __cxa_atexit (void (*)(void *), void *, void *)
8179 We build up the argument types and then then function type
8182 /* First, build the pointer-to-function type for the first
8184 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8185 fn_type
= build_function_type (void_type_node
, arg_types
);
8186 fn_ptr_type
= build_pointer_type (fn_type
);
8187 /* Then, build the rest of the argument types. */
8188 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8189 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, arg_types
);
8190 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, arg_types
);
8191 /* And the final __cxa_atexit type. */
8192 fn_type
= build_function_type (integer_type_node
, arg_types
);
8193 fn_ptr_type
= build_pointer_type (fn_type
);
8194 name
= "__cxa_atexit";
8198 /* The declaration for `atexit' is:
8200 int atexit (void (*)());
8202 We build up the argument types and then then function type
8204 fn_type
= build_function_type (void_type_node
, void_list_node
);
8205 fn_ptr_type
= build_pointer_type (fn_type
);
8206 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, void_list_node
);
8207 /* Build the final atexit type. */
8208 fn_type
= build_function_type (integer_type_node
, arg_types
);
8212 /* Now, build the function declaration. */
8213 push_lang_context (lang_name_c
);
8214 atexit_fndecl
= build_library_fn_ptr (name
, fn_type
);
8215 mark_used (atexit_fndecl
);
8216 pop_lang_context ();
8217 atexit_node
= default_conversion (atexit_fndecl
);
8222 /* Returns the __dso_handle VAR_DECL. */
8225 get_dso_handle_node ()
8227 if (dso_handle_node
)
8228 return dso_handle_node
;
8230 /* Declare the variable. */
8231 dso_handle_node
= declare_global_var (get_identifier ("__dso_handle"),
8234 return dso_handle_node
;
8237 /* Begin a new function with internal linkage whose job will be simply
8238 to destroy some particular variable. */
8243 static int counter
= 0;
8244 int old_interface_unknown
= interface_unknown
;
8250 push_to_top_level ();
8252 /* No need to mangle this. */
8253 push_lang_context (lang_name_c
);
8255 interface_unknown
= 1;
8257 /* Build the parameter-types. */
8258 parmtypes
= void_list_node
;
8259 /* Functions passed to __cxa_atexit take an additional parameter.
8260 We'll just ignore it. After we implement the new calling
8261 convention for destructors, we can eliminate the use of
8262 additional cleanup functions entirely in the -fnew-abi case. */
8263 if (flag_use_cxa_atexit
)
8264 parmtypes
= tree_cons (NULL_TREE
, ptr_type_node
, parmtypes
);
8265 /* Build the function type itself. */
8266 fntype
= build_function_type (void_type_node
, parmtypes
);
8267 /* Build the name of the function. */
8268 sprintf (name
, "__tcf_%d", counter
++);
8269 /* Build the function declaration. */
8270 fndecl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), fntype
);
8271 /* It's a function with internal linkage, generated by the
8273 TREE_PUBLIC (fndecl
) = 0;
8274 DECL_ARTIFICIAL (fndecl
) = 1;
8275 /* Make the function `inline' so that it is only emitted if it is
8276 actually needed. It is unlikely that it will be inlined, since
8277 it is only called via a function pointer, but we avoid unncessary
8278 emissions this way. */
8279 DECL_INLINE (fndecl
) = 1;
8280 /* Build the parameter. */
8281 if (flag_use_cxa_atexit
)
8285 parmdecl
= build_decl (PARM_DECL
, NULL_TREE
, ptr_type_node
);
8286 DECL_CONTEXT (parmdecl
) = fndecl
;
8287 DECL_ARG_TYPE (parmdecl
) = ptr_type_node
;
8288 TREE_USED (parmdecl
) = 1;
8289 DECL_ARGUMENTS (fndecl
) = parmdecl
;
8293 start_function (/*specs=*/NULL_TREE
, fndecl
, NULL_TREE
, SF_PRE_PARSED
);
8296 interface_unknown
= old_interface_unknown
;
8298 pop_lang_context ();
8300 return current_function_decl
;
8303 /* Finish the cleanup function begun by start_cleanup_fn. */
8310 expand_body (finish_function (0));
8312 pop_from_top_level ();
8315 /* Generate code to handle the destruction of DECL, an object with
8316 static storage duration. */
8319 register_dtor_fn (decl
)
8327 int saved_flag_access_control
;
8329 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl
)))
8332 /* Call build_cleanup before we enter the anonymous function so that
8333 any access checks will be done relative to the current scope,
8334 rather than the scope of the anonymous function. */
8335 build_cleanup (decl
);
8337 /* Now start the function. */
8338 cleanup
= start_cleanup_fn ();
8340 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
8341 to the original function, rather than the anonymous one. That
8342 will make the back-end think that nested functions are in use,
8343 which causes confusion. */
8344 saved_flag_access_control
= flag_access_control
;
8345 flag_access_control
= 0;
8346 fcall
= build_cleanup (decl
);
8347 flag_access_control
= saved_flag_access_control
;
8349 /* Create the body of the anonymous function. */
8350 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
8351 finish_expr_stmt (fcall
);
8352 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
8355 /* Call atexit with the cleanup function. */
8356 mark_addressable (cleanup
);
8357 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
8358 if (flag_use_cxa_atexit
)
8360 args
= tree_cons (NULL_TREE
, get_dso_handle_node (), NULL_TREE
);
8361 args
= tree_cons (NULL_TREE
, null_pointer_node
, args
);
8362 args
= tree_cons (NULL_TREE
, cleanup
, args
);
8365 args
= tree_cons (NULL_TREE
, cleanup
, NULL_TREE
);
8366 finish_expr_stmt (build_function_call (get_atexit_node (), args
));
8370 expand_static_init (decl
, init
)
8374 tree oldstatic
= value_member (decl
, static_aggregates
);
8378 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
8379 cp_error ("multiple initializations given for `%D'", decl
);
8381 else if (! toplevel_bindings_p ())
8383 /* Emit code to perform this initialization but once. */
8390 /* Emit code to perform this initialization but once. This code
8393 static int guard = 0;
8395 // Do initialization.
8397 // Register variable for destruction at end of program.
8400 Note that the `temp' variable is only set to 1 *after* the
8401 initialization is complete. This ensures that an exception,
8402 thrown during the construction, will cause the variable to
8403 reinitialized when we pass through this code again, as per:
8407 If the initialization exits by throwing an exception, the
8408 initialization is not complete, so it will be tried again
8409 the next time control enters the declaration.
8411 In theory, this process should be thread-safe, too; multiple
8412 threads should not be able to initialize the variable more
8413 than once. We don't yet attempt to ensure thread-safety. */
8415 /* Create the guard variable. */
8416 guard
= get_guard (decl
);
8418 /* Begin the conditional initialization. */
8419 if_stmt
= begin_if_stmt ();
8420 finish_if_stmt_cond (get_guard_cond (guard
), if_stmt
);
8421 then_clause
= begin_compound_stmt (/*has_no_scope=*/0);
8423 /* Do the initialization itself. */
8424 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
8425 || (init
&& TREE_CODE (init
) == TREE_LIST
))
8426 assignment
= build_aggr_init (decl
, init
, 0);
8428 /* The initialization we're doing here is just a bitwise
8430 assignment
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
8432 assignment
= NULL_TREE
;
8434 /* Once the assignment is complete, set TEMP to 1. Since the
8435 construction of the static object is complete at this point,
8436 we want to make sure TEMP is set to 1 even if a temporary
8437 constructed during the initialization throws an exception
8438 when it is destroyed. So, we combine the initialization and
8439 the assignment to TEMP into a single expression, ensuring
8440 that when we call finish_expr_stmt the cleanups will not be
8441 run until after TEMP is set to 1. */
8442 guard_init
= set_guard (guard
);
8445 assignment
= tree_cons (NULL_TREE
, assignment
,
8446 build_tree_list (NULL_TREE
,
8448 assignment
= build_compound_expr (assignment
);
8451 assignment
= guard_init
;
8452 finish_expr_stmt (assignment
);
8454 /* Use atexit to register a function for destroying this static
8456 register_dtor_fn (decl
);
8458 finish_compound_stmt (/*has_no_scope=*/0, then_clause
);
8459 finish_then_clause (if_stmt
);
8463 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8466 /* Finish the declaration of a catch-parameter. */
8469 start_handler_parms (declspecs
, declarator
)
8476 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8478 if (decl
== NULL_TREE
)
8479 error ("invalid catch parameter");
8488 /* Make TYPE a complete type based on INITIAL_VALUE.
8489 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8490 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8493 complete_array_type (type
, initial_value
, do_default
)
8494 tree type
, initial_value
;
8497 register tree maxindex
= NULL_TREE
;
8502 /* An array of character type can be initialized from a
8503 brace-enclosed string constant. */
8504 if (char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (type
)))
8505 && TREE_CODE (initial_value
) == CONSTRUCTOR
8506 && CONSTRUCTOR_ELTS (initial_value
)
8507 && (TREE_CODE (TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
)))
8509 && TREE_CHAIN (CONSTRUCTOR_ELTS (initial_value
)) == NULL_TREE
)
8510 initial_value
= TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
));
8512 /* Note MAXINDEX is really the maximum index, one less than the
8514 if (TREE_CODE (initial_value
) == STRING_CST
)
8517 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8518 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8521 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8523 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8525 maxindex
= ssize_int (-1);
8526 for (; elts
; elts
= TREE_CHAIN (elts
))
8528 if (TREE_PURPOSE (elts
))
8529 maxindex
= TREE_PURPOSE (elts
);
8531 maxindex
= size_binop (PLUS_EXPR
, maxindex
, ssize_int (1));
8533 maxindex
= copy_node (maxindex
);
8537 /* Make an error message unless that happened already. */
8538 if (initial_value
!= error_mark_node
)
8541 initial_value
= NULL_TREE
;
8543 /* Prevent further error messages. */
8544 maxindex
= build_int_2 (0, 0);
8551 maxindex
= build_int_2 (0, 0);
8560 domain
= build_index_type (maxindex
);
8561 TYPE_DOMAIN (type
) = domain
;
8563 if (! TREE_TYPE (maxindex
))
8564 TREE_TYPE (maxindex
) = domain
;
8566 itype
= TREE_TYPE (initial_value
);
8569 if (itype
&& !TYPE_DOMAIN (itype
))
8570 TYPE_DOMAIN (itype
) = domain
;
8571 /* The type of the main variant should never be used for arrays
8572 of different sizes. It should only ever be completed with the
8573 size of the array. */
8574 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8575 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8578 /* Lay out the type now that we can get the real answer. */
8585 /* Return zero if something is declared to be a member of type
8586 CTYPE when in the context of CUR_TYPE. STRING is the error
8587 message to print in that case. Otherwise, quietly return 1. */
8590 member_function_or_else (ctype
, cur_type
, flags
)
8591 tree ctype
, cur_type
;
8592 enum overload_flags flags
;
8594 if (ctype
&& ctype
!= cur_type
)
8596 if (flags
== DTOR_FLAG
)
8597 cp_error ("destructor for alien class `%T' cannot be a member",
8600 cp_error ("constructor for alien class `%T' cannot be a member",
8607 /* Subroutine of `grokdeclarator'. */
8609 /* Generate errors possibly applicable for a given set of specifiers.
8610 This is for ARM $7.1.2. */
8613 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8616 int virtualp
, quals
, friendp
, raises
, inlinep
;
8619 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8621 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8623 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8626 cp_error_at ("`%D' declared as a friend", object
);
8628 cp_error_at ("`%D' declared with an exception specification", object
);
8631 /* CTYPE is class type, or null if non-class.
8632 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8634 DECLARATOR is the function's name.
8635 VIRTUALP is truthvalue of whether the function is virtual or not.
8636 FLAGS are to be passed through to `grokclassfn'.
8637 QUALS are qualifiers indicating whether the function is `const'
8639 RAISES is a list of exceptions that this function can raise.
8640 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8641 not look, and -1 if we should not call `grokclassfn' at all.
8643 Returns `NULL_TREE' if something goes wrong, after issuing
8644 applicable error messages. */
8647 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8648 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8649 template_count
, in_namespace
)
8652 tree orig_declarator
;
8654 enum overload_flags flags
;
8656 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8660 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8661 int has_default_arg
= 0;
8665 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8666 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8672 type
= build_exception_variant (type
, raises
);
8675 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8676 /* Propagate volatile out from type to decl. */
8677 if (TYPE_VOLATILE (type
))
8678 TREE_THIS_VOLATILE (decl
) = 1;
8680 /* If this decl has namespace scope, set that up. */
8682 set_decl_namespace (decl
, in_namespace
, friendp
);
8684 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8686 /* `main' and builtins have implicit 'C' linkage. */
8687 if ((MAIN_NAME_P (declarator
)
8688 || (IDENTIFIER_LENGTH (declarator
) > 10
8689 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8690 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8691 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8692 && current_lang_name
== lang_name_cplusplus
8693 && ctype
== NULL_TREE
8694 /* NULL_TREE means global namespace. */
8695 && DECL_CONTEXT (decl
) == NULL_TREE
)
8696 DECL_LANGUAGE (decl
) = lang_c
;
8698 /* Should probably propagate const out from type to decl I bet (mrs). */
8701 DECL_STATIC_FUNCTION_P (decl
) = 1;
8702 DECL_CONTEXT (decl
) = ctype
;
8706 DECL_CONTEXT (decl
) = ctype
;
8708 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8710 if (processing_template_decl
)
8711 error ("cannot declare `::main' to be a template");
8713 error ("cannot declare `::main' to be inline");
8715 error ("cannot declare `::main' to be static");
8716 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
8718 error ("`main' must return `int'");
8723 /* Members of anonymous types and local classes have no linkage; make
8725 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8726 || decl_function_context (TYPE_MAIN_DECL (ctype
))))
8731 /* [basic.link]: A name with no linkage (notably, the name of a class
8732 or enumeration declared in a local scope) shall not be used to
8733 declare an entity with linkage.
8735 Only check this for public decls for now. */
8736 t
= no_linkage_check (TREE_TYPE (decl
));
8739 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8741 if (DECL_EXTERN_C_P (decl
))
8742 /* Allow this; it's pretty common in C. */;
8744 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8748 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8753 TREE_PUBLIC (decl
) = publicp
;
8756 DECL_INTERFACE_KNOWN (decl
) = 1;
8757 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8761 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8763 DECL_EXTERNAL (decl
) = 1;
8764 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8766 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8767 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8771 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8772 grok_op_properties (decl
, virtualp
, check
< 0);
8774 if (ctype
&& decl_function_context (decl
))
8775 DECL_NO_STATIC_CHAIN (decl
) = 1;
8777 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8778 if (TREE_PURPOSE (t
)
8779 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8781 has_default_arg
= 1;
8786 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8790 ("defining explicit specialization `%D' in friend declaration",
8794 tree fns
= TREE_OPERAND (orig_declarator
, 0);
8795 tree args
= TREE_OPERAND (orig_declarator
, 1);
8797 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8799 /* Something like `template <class T> friend void f<T>()'. */
8800 cp_error ("invalid use of template-id `%D' in declaration of primary template",
8806 /* A friend declaration of the form friend void f<>(). Record
8807 the information in the TEMPLATE_ID_EXPR. */
8808 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8810 if (TREE_CODE (fns
) == COMPONENT_REF
)
8812 /* Due to bison parser ickiness, we will have already looked
8813 up an operator_name or PFUNCNAME within the current class
8814 (see template_id in parse.y). If the current class contains
8815 such a name, we'll get a COMPONENT_REF here. Undo that. */
8817 my_friendly_assert (TREE_TYPE (TREE_OPERAND (fns
, 0))
8818 == current_class_type
, 20001120);
8819 fns
= TREE_OPERAND (fns
, 1);
8821 my_friendly_assert (TREE_CODE (fns
) == IDENTIFIER_NODE
8822 || TREE_CODE (fns
) == LOOKUP_EXPR
8823 || TREE_CODE (fns
) == OVERLOAD
, 20001120);
8824 DECL_TEMPLATE_INFO (decl
) = tree_cons (fns
, args
, NULL_TREE
);
8826 if (has_default_arg
)
8828 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8835 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8842 if (has_default_arg
)
8843 add_defarg_fn (decl
);
8845 /* Plain overloading: will not be grok'd by grokclassfn. */
8846 if (! ctype
&& ! processing_template_decl
8847 && !DECL_EXTERN_C_P (decl
)
8848 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8849 set_mangled_name_for_decl (decl
);
8852 /* Make the init_value nonzero so pushdecl knows this is not
8853 tentative. error_mark_node is replaced later with the BLOCK. */
8854 DECL_INITIAL (decl
) = error_mark_node
;
8856 if (TYPE_NOTHROW_P (type
) || nothrow_libfn_p (decl
))
8857 TREE_NOTHROW (decl
) = 1;
8859 /* Caller will do the rest of this. */
8863 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8864 DECL_CONSTRUCTOR_P (decl
) = 1;
8866 /* Function gets the ugly name, field gets the nice one. This call
8867 may change the type of the function (because of default
8869 if (ctype
!= NULL_TREE
)
8870 grokclassfn (ctype
, decl
, flags
, quals
);
8872 decl
= check_explicit_specialization (orig_declarator
, decl
,
8874 2 * (funcdef_flag
!= 0) +
8875 4 * (friendp
!= 0));
8876 if (decl
== error_mark_node
)
8879 if (ctype
!= NULL_TREE
8880 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8885 old_decl
= check_classfn (ctype
, decl
);
8887 if (old_decl
&& TREE_CODE (old_decl
) == TEMPLATE_DECL
)
8888 /* Because grokfndecl is always supposed to return a
8889 FUNCTION_DECL, we pull out the DECL_TEMPLATE_RESULT
8890 here. We depend on our callers to figure out that its
8891 really a template that's being returned. */
8892 old_decl
= DECL_TEMPLATE_RESULT (old_decl
);
8894 if (old_decl
&& DECL_STATIC_FUNCTION_P (old_decl
)
8895 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8897 /* Remove the `this' parm added by grokclassfn.
8898 XXX Isn't this done in start_function, too? */
8899 revert_static_member_fn (decl
);
8900 last_function_parms
= TREE_CHAIN (last_function_parms
);
8902 if (old_decl
&& DECL_ARTIFICIAL (old_decl
))
8903 cp_error ("definition of implicitly-declared `%D'", old_decl
);
8907 /* Since we've smashed OLD_DECL to its
8908 DECL_TEMPLATE_RESULT, we must do the same to DECL. */
8909 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
8910 decl
= DECL_TEMPLATE_RESULT (decl
);
8912 /* Attempt to merge the declarations. This can fail, in
8913 the case of some illegal specialization declarations. */
8914 if (!duplicate_decls (decl
, old_decl
))
8915 cp_error ("no `%#D' member function declared in class `%T'",
8921 if (DECL_CONSTRUCTOR_P (decl
) && !grok_ctor_properties (ctype
, decl
))
8924 if (ctype
== NULL_TREE
|| check
)
8928 DECL_VIRTUAL_P (decl
) = 1;
8934 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
8937 RID_BIT_TYPE
*specbits_in
;
8943 RID_BIT_TYPE specbits
;
8945 specbits
= *specbits_in
;
8947 if (TREE_CODE (type
) == OFFSET_TYPE
)
8949 /* If you declare a static member so that it
8950 can be initialized, the code will reach here. */
8951 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
8952 type
= TREE_TYPE (type
);
8953 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8954 DECL_CONTEXT (decl
) = basetype
;
8955 /* DECL_ASSEMBLER_NAME is needed only for full-instantiated
8957 if (!uses_template_parms (decl
))
8960 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
8962 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
,
8971 context
= in_namespace
;
8972 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
8973 context
= current_namespace
;
8975 context
= NULL_TREE
;
8977 if (processing_template_decl
&& context
)
8978 /* For global variables, declared in a template, we need the
8980 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8982 decl
= build_decl (VAR_DECL
, declarator
, type
);
8985 set_decl_namespace (decl
, context
, 0);
8987 context
= DECL_CONTEXT (decl
);
8988 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
8991 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
8993 DECL_ASSEMBLER_NAME (decl
)
8994 = build_static_name (context
, declarator
);
8999 set_decl_namespace (decl
, in_namespace
, 0);
9001 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
9003 DECL_THIS_EXTERN (decl
) = 1;
9004 DECL_EXTERNAL (decl
) = !initialized
;
9007 /* In class context, static means one per class,
9008 public access, and static storage. */
9009 if (DECL_CLASS_SCOPE_P (decl
))
9011 TREE_PUBLIC (decl
) = 1;
9012 TREE_STATIC (decl
) = 1;
9013 DECL_EXTERNAL (decl
) = 0;
9015 /* At top level, either `static' or no s.c. makes a definition
9016 (perhaps tentative), and absence of `static' makes it public. */
9017 else if (toplevel_bindings_p ())
9019 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
9020 && (DECL_THIS_EXTERN (decl
) || ! constp
));
9021 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
9023 /* Not at top level, only `static' makes a static definition. */
9026 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
9027 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
9030 if (TREE_PUBLIC (decl
))
9032 /* [basic.link]: A name with no linkage (notably, the name of a class
9033 or enumeration declared in a local scope) shall not be used to
9034 declare an entity with linkage.
9036 Only check this for public decls for now. */
9037 tree t
= no_linkage_check (TREE_TYPE (decl
));
9040 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
9041 /* Ignore for now; `enum { foo } e' is pretty common. */;
9043 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
9051 /* Create and return a canonical pointer to member function type, for
9052 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
9055 build_ptrmemfunc_type (type
)
9061 tree unqualified_variant
= NULL_TREE
;
9063 if (type
== error_mark_node
)
9066 /* If a canonical type already exists for this type, use it. We use
9067 this method instead of type_hash_canon, because it only does a
9068 simple equality check on the list of field members. */
9070 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
9073 /* Make sure that we always have the unqualified pointer-to-member
9075 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9077 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
9079 t
= make_aggr_type (RECORD_TYPE
);
9080 /* Let the front-end know this is a pointer to member function... */
9081 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
9082 /* ... and not really an aggregate. */
9083 SET_IS_AGGR_TYPE (t
, 0);
9087 u
= make_aggr_type (UNION_TYPE
);
9088 SET_IS_AGGR_TYPE (u
, 0);
9089 fields
[0] = build_decl (FIELD_DECL
, pfn_identifier
, type
);
9090 fields
[1] = build_decl (FIELD_DECL
, delta2_identifier
,
9092 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9093 TYPE_NAME (u
) = NULL_TREE
;
9095 fields
[0] = build_decl (FIELD_DECL
, delta_identifier
,
9097 fields
[1] = build_decl (FIELD_DECL
, index_identifier
,
9099 fields
[2] = build_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
9100 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
9104 fields
[0] = build_decl (FIELD_DECL
, pfn_identifier
, type
);
9105 fields
[1] = build_decl (FIELD_DECL
, delta_identifier
,
9107 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9110 /* Zap out the name so that the back-end will give us the debugging
9111 information for this anonymous RECORD_TYPE. */
9112 TYPE_NAME (t
) = NULL_TREE
;
9114 /* If this is not the unqualified form of this pointer-to-member
9115 type, set the TYPE_MAIN_VARIANT for this type to be the
9116 unqualified type. Since they are actually RECORD_TYPEs that are
9117 not variants of each other, we must do this manually. */
9118 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9120 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
9121 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
9122 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
9123 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
9126 /* Cache this pointer-to-member type so that we can find it again
9128 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
9130 /* Seems to be wanted. */
9131 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
9136 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
9137 Check to see that the definition is valid. Issue appropriate error
9138 messages. Return 1 if the definition is particularly bad, or 0
9142 check_static_variable_definition (decl
, type
)
9146 /* Motion 10 at San Diego: If a static const integral data member is
9147 initialized with an integral constant expression, the initializer
9148 may appear either in the declaration (within the class), or in
9149 the definition, but not both. If it appears in the class, the
9150 member is a member constant. The file-scope definition is always
9152 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
9154 cp_error ("invalid in-class initialization of static data member of non-integral type `%T'",
9156 /* If we just return the declaration, crashes will sometimes
9157 occur. We therefore return void_type_node, as if this was a
9158 friend declaration, to cause callers to completely ignore
9159 this declaration. */
9162 else if (!CP_TYPE_CONST_P (type
))
9163 cp_error ("ISO C++ forbids in-class initialization of non-const static member `%D'",
9165 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
9166 cp_pedwarn ("ISO C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
9171 /* Given the SIZE (i.e., number of elements) in an array, compute an
9172 appropriate index type for the array. If non-NULL, NAME is the
9173 name of the thing being declared. */
9176 compute_array_index_type (name
, size
)
9182 /* The size might be the result of a cast. */
9183 STRIP_TYPE_NOPS (size
);
9185 /* It might be a const variable or enumeration constant. */
9186 size
= decl_constant_value (size
);
9188 /* If this involves a template parameter, it will be a constant at
9189 instantiation time, but we don't know what the value is yet.
9190 Even if no template parameters are involved, we may an expression
9191 that is not a constant; we don't even simplify `1 + 2' when
9192 processing a template. */
9193 if (processing_template_decl
)
9195 /* Resolve a qualified reference to an enumerator or static
9196 const data member of ours. */
9197 if (TREE_CODE (size
) == SCOPE_REF
9198 && TREE_OPERAND (size
, 0) == current_class_type
)
9200 tree t
= lookup_field (current_class_type
,
9201 TREE_OPERAND (size
, 1), 0, 0);
9206 return build_index_type (build_min (MINUS_EXPR
, sizetype
,
9207 size
, integer_one_node
));
9210 /* The array bound must be an integer type. */
9211 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9212 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
9213 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
9216 cp_error ("size of array `%D' has non-integer type", name
);
9218 cp_error ("size of array has non-integer type");
9219 size
= integer_one_node
;
9222 /* Normally, the array-bound will be a constant. */
9223 if (TREE_CODE (size
) == INTEGER_CST
)
9225 /* Check to see if the array bound overflowed. Make that an
9226 error, no matter how generous we're being. */
9227 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9228 int old_pedantic
= pedantic
;
9229 pedantic
= flag_pedantic_errors
= 1;
9230 constant_expression_warning (size
);
9231 pedantic
= old_pedantic
;
9232 flag_pedantic_errors
= old_flag_pedantic_errors
;
9234 /* An array must have a positive number of elements. */
9235 if (INT_CST_LT (size
, integer_zero_node
))
9238 cp_error ("size of array `%D' is negative", name
);
9240 cp_error ("size of array is negative");
9241 size
= integer_one_node
;
9243 /* Except that an extension we allow zero-sized arrays. We
9244 always allow them in system headers because glibc uses
9246 else if (integer_zerop (size
) && pedantic
&& !in_system_header
)
9249 cp_pedwarn ("ISO C++ forbids zero-size array `%D'", name
);
9251 cp_pedwarn ("ISO C++ forbids zero-size array");
9254 else if (TREE_CONSTANT (size
))
9256 /* `(int) &fn' is not a valid array bound. */
9258 cp_error ("size of array `%D' is not an integral constant-expression",
9261 cp_error ("size of array is not an integral constant-expression");
9264 /* Compute the index of the largest element in the array. It is
9265 one less than the number of elements in the array. */
9267 = fold (cp_build_binary_op (MINUS_EXPR
,
9268 cp_convert (ssizetype
, size
),
9269 cp_convert (ssizetype
,
9270 integer_one_node
)));
9272 /* Check for variable-sized arrays. We allow such things as an
9273 extension, even though they are not allowed in ANSI/ISO C++. */
9274 if (!TREE_CONSTANT (itype
))
9279 cp_pedwarn ("ISO C++ forbids variable-size array `%D'",
9282 cp_pedwarn ("ISO C++ forbids variable-size array");
9285 /* Create a variable-sized array index type. */
9286 itype
= variable_size (itype
);
9288 /* Make sure that there was no overflow when creating to a signed
9289 index type. (For example, on a 32-bit machine, an array with
9290 size 2^32 - 1 is too big.) */
9291 else if (TREE_OVERFLOW (itype
))
9293 error ("overflow in array dimension");
9294 TREE_OVERFLOW (itype
) = 0;
9297 /* Create and return the appropriate index type. */
9298 return build_index_type (itype
);
9301 /* Returns an ARRAY_TYPE for an array with SIZE elements of the
9302 indicated TYPE. If non-NULL, NAME is the NAME of the declaration
9306 create_array_type_for_decl (name
, type
, size
)
9311 tree itype
= NULL_TREE
;
9312 const char* error_msg
;
9314 /* If things have already gone awry, bail now. */
9315 if (type
== error_mark_node
|| size
== error_mark_node
)
9316 return error_mark_node
;
9318 /* Assume that everything will go OK. */
9321 /* There are some types which cannot be array elements. */
9322 switch (TREE_CODE (type
))
9325 error_msg
= "array of void";
9329 error_msg
= "array of functions";
9332 case REFERENCE_TYPE
:
9333 error_msg
= "array of references";
9337 error_msg
= "array of data members";
9341 error_msg
= "array of function members";
9348 /* If something went wrong, issue an error-message and return. */
9352 cp_error ("declaration of `%D' as %s", name
, error_msg
);
9354 cp_error ("creating %s", error_msg
);
9356 return error_mark_node
;
9361 The constant expressions that specify the bounds of the arrays
9362 can be omitted only for the first member of the sequence. */
9363 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9365 cp_error ("declaration of `%D' as multidimensional array must have bounds for all dimensions except the first",
9368 return error_mark_node
;
9371 /* Figure out the index type for the array. */
9373 itype
= compute_array_index_type (name
, size
);
9375 return build_cplus_array_type (type
, itype
);
9378 /* Check that it's OK to declare a function with the indicated TYPE.
9379 SFK indicates the kind of special function (if any) that this
9380 function is. CTYPE is the class of which this function is a
9381 member. OPTYPE is the type given in a conversion operator
9382 declaration. Returns the actual return type of the function; that
9383 may be different than TYPE if an error occurs, or for certain
9384 special functions. */
9387 check_special_function_return_type (sfk
, type
, ctype
, optype
)
9388 special_function_kind sfk
;
9395 case sfk_constructor
:
9397 cp_error ("return type specification for constructor invalid");
9399 /* In the old ABI, we return `this'; in the new ABI we don't
9401 type
= flag_new_abi
? void_type_node
: build_pointer_type (ctype
);
9404 case sfk_destructor
:
9406 cp_error ("return type specification for destructor invalid");
9407 type
= void_type_node
;
9410 case sfk_conversion
:
9411 if (type
&& !same_type_p (type
, optype
))
9412 cp_error ("operator `%T' declared to return `%T'", optype
, type
);
9414 cp_pedwarn ("return type specified for `operator %T'", optype
);
9419 my_friendly_abort (20000408);
9426 /* Given declspecs and a declarator,
9427 determine the name and type of the object declared
9428 and construct a ..._DECL node for it.
9429 (In one case we can return a ..._TYPE node instead.
9430 For invalid input we sometimes return 0.)
9432 DECLSPECS is a chain of tree_list nodes whose value fields
9433 are the storage classes and type specifiers.
9435 DECL_CONTEXT says which syntactic context this declaration is in:
9436 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
9437 FUNCDEF for a function definition. Like NORMAL but a few different
9438 error messages in each case. Return value may be zero meaning
9439 this definition is too screwy to try to parse.
9440 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
9441 handle member functions (which have FIELD context).
9442 Return value may be zero meaning this definition is too screwy to
9444 PARM for a parameter declaration (either within a function prototype
9445 or before a function body). Make a PARM_DECL, or return void_type_node.
9446 CATCHPARM for a parameter declaration before a catch clause.
9447 TYPENAME if for a typename (in a cast or sizeof).
9448 Don't make a DECL node; just return the ..._TYPE node.
9449 FIELD for a struct or union field; make a FIELD_DECL.
9450 BITFIELD for a field with specified width.
9451 INITIALIZED is 1 if the decl has an initializer.
9453 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
9454 normal attributes in TREE_PURPOSE, or NULL_TREE.
9456 In the TYPENAME case, DECLARATOR is really an abstract declarator.
9457 It may also be so in the PARM case, for a prototype where the
9458 argument type is specified but not the name.
9460 This function is where the complicated C meanings of `static'
9461 and `extern' are interpreted.
9463 For C++, if there is any monkey business to do, the function which
9464 calls this one must do it, i.e., prepending instance variables,
9465 renaming overloaded function names, etc.
9467 Note that for this C++, it is an error to define a method within a class
9468 which does not belong to that class.
9470 Except in the case where SCOPE_REFs are implicitly known (such as
9471 methods within a class being redundantly qualified),
9472 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
9473 (class_name::decl_name). The caller must also deal with this.
9475 If a constructor or destructor is seen, and the context is FIELD,
9476 then the type gains the attribute TREE_HAS_x. If such a declaration
9477 is erroneous, NULL_TREE is returned.
9479 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
9480 function, these are the qualifiers to give to the `this' pointer. We
9481 apply TYPE_QUAL_RESTRICT to the this ptr, not the object.
9483 May return void_type_node if the declarator turned out to be a friend.
9484 See grokfield for details. */
9487 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
9490 enum decl_context decl_context
;
9494 RID_BIT_TYPE specbits
;
9497 tree type
= NULL_TREE
;
9503 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
9504 int explicit_int
= 0;
9505 int explicit_char
= 0;
9506 int defaulted_int
= 0;
9507 tree typedef_decl
= NULL_TREE
;
9509 tree typedef_type
= NULL_TREE
;
9510 int funcdef_flag
= 0;
9511 enum tree_code innermost_code
= ERROR_MARK
;
9514 /* See the code below that used this. */
9515 tree decl_machine_attr
= NULL_TREE
;
9517 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
9518 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
9519 tree init
= NULL_TREE
;
9521 /* Keep track of what sort of function is being processed
9522 so that we can warn about default return values, or explicit
9523 return values which do not match prescribed defaults. */
9524 special_function_kind sfk
= sfk_none
;
9526 tree dname
= NULL_TREE
;
9527 tree ctype
= current_class_type
;
9528 tree ctor_return_type
= NULL_TREE
;
9529 enum overload_flags flags
= NO_SPECIAL
;
9530 tree quals
= NULL_TREE
;
9531 tree raises
= NULL_TREE
;
9532 int template_count
= 0;
9533 tree in_namespace
= NULL_TREE
;
9537 RIDBIT_RESET_ALL (specbits
);
9538 if (decl_context
== FUNCDEF
)
9539 funcdef_flag
= 1, decl_context
= NORMAL
;
9540 else if (decl_context
== MEMFUNCDEF
)
9541 funcdef_flag
= -1, decl_context
= FIELD
;
9542 else if (decl_context
== BITFIELD
)
9543 bitfield
= 1, decl_context
= FIELD
;
9545 /* Look inside a declarator for the name being declared
9546 and get it as a string, for an error message. */
9548 tree
*next
= &declarator
;
9552 while (next
&& *next
)
9555 switch (TREE_CODE (decl
))
9558 /* For attributes. */
9559 next
= &TREE_VALUE (decl
);
9564 next
= &TREE_OPERAND (decl
, 0);
9567 case BIT_NOT_EXPR
: /* For C++ destructors! */
9569 tree name
= TREE_OPERAND (decl
, 0);
9570 tree rename
= NULL_TREE
;
9572 my_friendly_assert (flags
== NO_SPECIAL
, 152);
9574 sfk
= sfk_destructor
;
9575 if (TREE_CODE (name
) == TYPE_DECL
)
9576 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
9577 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
9578 if (ctype
== NULL_TREE
)
9580 if (current_class_type
== NULL_TREE
)
9582 error ("destructors must be member functions");
9587 tree t
= constructor_name (current_class_name
);
9594 tree t
= constructor_name (ctype
);
9601 cp_error ("destructor `%T' must match class name `%T'",
9603 TREE_OPERAND (decl
, 0) = rename
;
9609 case ADDR_EXPR
: /* C++ reference declaration */
9614 innermost_code
= TREE_CODE (decl
);
9615 next
= &TREE_OPERAND (decl
, 0);
9619 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
9621 /* This is actually a variable declaration using
9622 constructor syntax. We need to call start_decl and
9623 cp_finish_decl so we can get the variable
9626 tree attributes
, prefix_attributes
;
9628 *next
= TREE_OPERAND (decl
, 0);
9629 init
= CALL_DECLARATOR_PARMS (decl
);
9633 attributes
= TREE_PURPOSE (attrlist
);
9634 prefix_attributes
= TREE_VALUE (attrlist
);
9638 attributes
= NULL_TREE
;
9639 prefix_attributes
= NULL_TREE
;
9642 decl
= start_decl (declarator
, declspecs
, 1,
9643 attributes
, prefix_attributes
);
9644 decl_type_access_control (decl
);
9647 /* Look for __unused__ attribute */
9648 if (TREE_USED (TREE_TYPE (decl
)))
9649 TREE_USED (decl
) = 1;
9650 finish_decl (decl
, init
, NULL_TREE
);
9653 cp_error ("invalid declarator");
9656 innermost_code
= TREE_CODE (decl
);
9657 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
9658 ctype
= current_class_type
;
9660 && TREE_OPERAND (decl
, 0)
9661 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
9662 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
9663 == constructor_name_full (ctype
))
9664 || (DECL_NAME (TREE_OPERAND (decl
, 0))
9665 == constructor_name (ctype
)))))
9666 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9667 next
= &TREE_OPERAND (decl
, 0);
9669 if (ctype
!= NULL_TREE
9670 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
9671 && decl
== constructor_name (ctype
))
9673 sfk
= sfk_constructor
;
9674 ctor_return_type
= ctype
;
9679 case TEMPLATE_ID_EXPR
:
9681 tree fns
= TREE_OPERAND (decl
, 0);
9683 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9684 fns
= TREE_OPERAND (fns
, 0);
9687 if (TREE_CODE (dname
) == COMPONENT_REF
)
9688 dname
= TREE_OPERAND (dname
, 1);
9689 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9691 my_friendly_assert (is_overloaded_fn (dname
),
9693 dname
= DECL_NAME (get_first_fn (dname
));
9698 case IDENTIFIER_NODE
:
9699 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9704 if (C_IS_RESERVED_WORD (dname
))
9706 cp_error ("declarator-id missing; using reserved word `%D'",
9708 name
= IDENTIFIER_POINTER (dname
);
9710 else if (!IDENTIFIER_TYPENAME_P (dname
))
9711 name
= IDENTIFIER_POINTER (dname
);
9714 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9715 flags
= TYPENAME_FLAG
;
9716 ctor_return_type
= TREE_TYPE (dname
);
9717 sfk
= sfk_conversion
;
9718 if (IDENTIFIER_GLOBAL_VALUE (dname
)
9719 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (dname
))
9721 name
= IDENTIFIER_POINTER (dname
);
9723 name
= "<invalid operator>";
9730 /* Perform error checking, and decide on a ctype. */
9731 tree cname
= TREE_OPERAND (decl
, 0);
9732 if (cname
== NULL_TREE
)
9734 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9737 in_namespace
= TREE_OPERAND (decl
, 0);
9738 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9740 else if (! is_aggr_type (cname
, 1))
9741 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9742 /* Must test TREE_OPERAND (decl, 1), in case user gives
9743 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9744 else if (TREE_OPERAND (decl
, 1)
9745 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9747 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9748 || TREE_CODE (cname
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
9750 cp_error ("`%T::%D' is not a valid declarator", cname
,
9751 TREE_OPERAND (decl
, 1));
9752 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9753 cname
, TREE_OPERAND (decl
, 1));
9754 return void_type_node
;
9756 else if (ctype
== NULL_TREE
)
9758 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9759 TREE_OPERAND (decl
, 0) = ctype
;
9762 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9764 cp_error ("type `%T' is not derived from type `%T'",
9766 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9772 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9773 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9774 == constructor_name_full (ctype
))
9775 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9776 == constructor_name (ctype
))))
9777 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9778 next
= &TREE_OPERAND (decl
, 1);
9782 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9783 && constructor_name (ctype
) == decl
)
9785 sfk
= sfk_constructor
;
9786 ctor_return_type
= ctype
;
9788 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9789 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9790 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9791 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9793 sfk
= sfk_destructor
;
9794 ctor_return_type
= ctype
;
9796 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9797 next
= &TREE_OPERAND (decl
, 0);
9808 /* Parse error puts this typespec where
9809 a declarator should go. */
9810 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9811 if (TREE_TYPE (decl
) == current_class_type
)
9812 cp_error (" perhaps you want `%T' for a constructor",
9813 current_class_name
);
9814 dname
= DECL_NAME (decl
);
9815 name
= IDENTIFIER_POINTER (dname
);
9817 /* Avoid giving two errors for this. */
9818 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9820 declspecs
= tree_cons (NULL_TREE
, integer_type_node
, declspecs
);
9826 cp_compiler_error ("`%D' as declarator", decl
);
9827 return 0; /* We used to do a 155 abort here. */
9832 /* A function definition's declarator must have the form of
9833 a function declarator. */
9835 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9838 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9839 && innermost_code
!= CALL_EXPR
9840 && ! (ctype
&& declspecs
== NULL_TREE
))
9842 cp_error ("declaration of `%D' as non-function", dname
);
9843 return void_type_node
;
9846 /* Anything declared one level down from the top level
9847 must be one of the parameters of a function
9848 (because the body is at least two levels down). */
9850 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9851 by not allowing C++ class definitions to specify their parameters
9852 with xdecls (must be spec.d in the parmlist).
9854 Since we now wait to push a class scope until we are sure that
9855 we are in a legitimate method context, we must set oldcname
9856 explicitly (since current_class_name is not yet alive).
9858 We also want to avoid calling this a PARM if it is in a namespace. */
9860 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
9862 struct binding_level
*b
= current_binding_level
;
9863 current_binding_level
= b
->level_chain
;
9864 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9865 decl_context
= PARM
;
9866 current_binding_level
= b
;
9870 name
= decl_context
== PARM
? "parameter" : "type name";
9872 /* Look through the decl specs and record which ones appear.
9873 Some typespecs are defined as built-in typenames.
9874 Others, the ones that are modifiers of other types,
9875 are represented by bits in SPECBITS: set the bits for
9876 the modifiers that appear. Storage class keywords are also in SPECBITS.
9878 If there is a typedef name or a type, store the type in TYPE.
9879 This includes builtin typedefs such as `int'.
9881 Set EXPLICIT_INT if the type is `int' or `char' and did not
9882 come from a user typedef.
9884 Set LONGLONG if `long' is mentioned twice.
9886 For C++, constructors and destructors have their own fast treatment. */
9888 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
9893 /* Certain parse errors slip through. For example,
9894 `int class;' is not caught by the parser. Try
9895 weakly to recover here. */
9896 if (TREE_CODE (spec
) != TREE_LIST
)
9899 id
= TREE_VALUE (spec
);
9901 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9903 if (id
== ridpointers
[(int) RID_INT
]
9904 || id
== ridpointers
[(int) RID_CHAR
]
9905 || id
== ridpointers
[(int) RID_BOOL
]
9906 || id
== ridpointers
[(int) RID_WCHAR
])
9910 if (id
== ridpointers
[(int) RID_BOOL
])
9911 error ("`bool' is now a keyword");
9913 cp_error ("extraneous `%T' ignored", id
);
9917 if (id
== ridpointers
[(int) RID_INT
])
9919 else if (id
== ridpointers
[(int) RID_CHAR
])
9921 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
9925 /* C++ aggregate types. */
9926 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
9929 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
9931 type
= IDENTIFIER_TYPE_VALUE (id
);
9935 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
9937 if (ridpointers
[i
] == id
)
9939 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
9941 if (pedantic
&& ! in_system_header
&& warn_long_long
)
9942 pedwarn ("ISO C++ does not support `long long'");
9944 error ("`long long long' is too long for GCC");
9948 else if (RIDBIT_SETP (i
, specbits
))
9949 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
9950 RIDBIT_SET (i
, specbits
);
9955 /* C++ aggregate types. */
9956 else if (TREE_CODE (id
) == TYPE_DECL
)
9959 cp_error ("multiple declarations `%T' and `%T'", type
,
9963 type
= TREE_TYPE (id
);
9964 TREE_VALUE (spec
) = type
;
9969 error ("two or more data types in declaration of `%s'", name
);
9970 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9972 register tree t
= lookup_name (id
, 1);
9973 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
9974 error ("`%s' fails to be a typedef or built in type",
9975 IDENTIFIER_POINTER (id
));
9978 type
= TREE_TYPE (t
);
9980 /* See the code below that used this. */
9981 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
9986 else if (id
!= error_mark_node
)
9987 /* Can't change CLASS nodes into RECORD nodes here! */
9993 typedef_type
= type
;
9995 /* No type at all: default to `int', and set DEFAULTED_INT
9996 because it was not a user-defined typedef. */
9998 if (type
== NULL_TREE
9999 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
10000 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10001 || RIDBIT_SETP (RID_LONG
, specbits
)
10002 || RIDBIT_SETP (RID_SHORT
, specbits
)))
10004 /* These imply 'int'. */
10005 type
= integer_type_node
;
10009 if (sfk
!= sfk_none
)
10010 type
= check_special_function_return_type (sfk
, type
,
10013 else if (type
== NULL_TREE
)
10019 /* We handle `main' specially here, because 'main () { }' is so
10020 common. With no options, it is allowed. With -Wreturn-type,
10021 it is a warning. It is only an error with -pedantic-errors. */
10022 is_main
= (funcdef_flag
10023 && MAIN_NAME_P (dname
)
10024 && ctype
== NULL_TREE
10025 && in_namespace
== NULL_TREE
10026 && current_namespace
== global_namespace
);
10028 if (in_system_header
|| flag_ms_extensions
)
10029 /* Allow it, sigh. */;
10030 else if (pedantic
|| ! is_main
)
10031 cp_pedwarn ("ISO C++ forbids declaration of `%s' with no type",
10033 else if (warn_return_type
)
10034 cp_warning ("ISO C++ forbids declaration of `%s' with no type",
10037 type
= integer_type_node
;
10042 /* Now process the modifiers that were specified
10043 and check for invalid combinations. */
10045 /* Long double is a special combination. */
10047 if (RIDBIT_SETP (RID_LONG
, specbits
)
10048 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
10050 RIDBIT_RESET (RID_LONG
, specbits
);
10051 type
= build_qualified_type (long_double_type_node
,
10052 CP_TYPE_QUALS (type
));
10055 /* Check all other uses of type modifiers. */
10057 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10058 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10059 || RIDBIT_SETP (RID_LONG
, specbits
)
10060 || RIDBIT_SETP (RID_SHORT
, specbits
))
10064 if (TREE_CODE (type
) == REAL_TYPE
)
10065 error ("short, signed or unsigned invalid for `%s'", name
);
10066 else if (TREE_CODE (type
) != INTEGER_TYPE
)
10067 error ("long, short, signed or unsigned invalid for `%s'", name
);
10068 else if (RIDBIT_SETP (RID_LONG
, specbits
)
10069 && RIDBIT_SETP (RID_SHORT
, specbits
))
10070 error ("long and short specified together for `%s'", name
);
10071 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10072 || RIDBIT_SETP (RID_SHORT
, specbits
))
10074 error ("long or short specified with char for `%s'", name
);
10075 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10076 || RIDBIT_SETP (RID_SHORT
, specbits
))
10077 && TREE_CODE (type
) == REAL_TYPE
)
10078 error ("long or short specified with floating type for `%s'", name
);
10079 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10080 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
10081 error ("signed and unsigned given together for `%s'", name
);
10085 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
10087 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
10089 if (flag_pedantic_errors
)
10094 /* Discard the type modifiers if they are invalid. */
10097 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
10098 RIDBIT_RESET (RID_SIGNED
, specbits
);
10099 RIDBIT_RESET (RID_LONG
, specbits
);
10100 RIDBIT_RESET (RID_SHORT
, specbits
);
10105 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
10106 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
10108 error ("complex invalid for `%s'", name
);
10109 RIDBIT_RESET (RID_COMPLEX
, specbits
);
10112 /* Decide whether an integer type is signed or not.
10113 Optionally treat bitfields as signed by default. */
10114 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10117 It is implementation-defined whether a plain (neither
10118 explicitly signed or unsigned) char, short, int, or long
10119 bit-field is signed or unsigned.
10121 Naturally, we extend this to long long as well. Note that
10122 this does not include wchar_t. */
10123 || (bitfield
&& !flag_signed_bitfields
10124 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
10125 /* A typedef for plain `int' without `signed' can be
10126 controlled just like plain `int', but a typedef for
10127 `signed int' cannot be so controlled. */
10129 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
10130 && (TREE_CODE (type
) == INTEGER_TYPE
10131 || TREE_CODE (type
) == CHAR_TYPE
)
10132 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
10135 type
= long_long_unsigned_type_node
;
10136 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10137 type
= long_unsigned_type_node
;
10138 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10139 type
= short_unsigned_type_node
;
10140 else if (type
== char_type_node
)
10141 type
= unsigned_char_type_node
;
10142 else if (typedef_decl
)
10143 type
= unsigned_type (type
);
10145 type
= unsigned_type_node
;
10147 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10148 && type
== char_type_node
)
10149 type
= signed_char_type_node
;
10151 type
= long_long_integer_type_node
;
10152 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10153 type
= long_integer_type_node
;
10154 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10155 type
= short_integer_type_node
;
10157 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
10159 /* If we just have "complex", it is equivalent to
10160 "complex double", but if any modifiers at all are specified it is
10161 the complex form of TYPE. E.g, "complex short" is
10162 "complex short int". */
10164 if (defaulted_int
&& ! longlong
10165 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
10166 || RIDBIT_SETP (RID_SHORT
, specbits
)
10167 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10168 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
10169 type
= complex_double_type_node
;
10170 else if (type
== integer_type_node
)
10171 type
= complex_integer_type_node
;
10172 else if (type
== float_type_node
)
10173 type
= complex_float_type_node
;
10174 else if (type
== double_type_node
)
10175 type
= complex_double_type_node
;
10176 else if (type
== long_double_type_node
)
10177 type
= complex_long_double_type_node
;
10179 type
= build_complex_type (type
);
10182 if (sfk
== sfk_conversion
10183 && (RIDBIT_SETP (RID_CONST
, specbits
)
10184 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
10185 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
10186 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
10189 /* Set CONSTP if this declaration is `const', whether by
10190 explicit specification or via a typedef.
10191 Likewise for VOLATILEP. */
10193 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
10195 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
10197 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
10198 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10199 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10200 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10201 type
= cp_build_qualified_type (type
, type_quals
);
10203 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
10204 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
10205 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
10206 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
10207 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
10209 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10210 staticp
= 1 + (decl_context
== FIELD
);
10212 if (virtualp
&& staticp
== 2)
10214 cp_error ("member `%D' cannot be declared both virtual and static",
10218 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
10219 RIDBIT_RESET (RID_FRIEND
, specbits
);
10221 /* Warn if two storage classes are given. Default to `auto'. */
10223 if (RIDBIT_ANY_SET (specbits
))
10225 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
10226 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
10227 if (decl_context
== PARM
&& nclasses
> 0)
10228 error ("storage class specifiers invalid in parameter declarations");
10229 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10231 if (decl_context
== PARM
)
10232 error ("typedef declaration invalid in parameter declaration");
10235 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
10236 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
10239 /* Give error if `virtual' is used outside of class declaration. */
10241 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
10243 error ("virtual outside class declaration");
10247 /* Static anonymous unions are dealt with here. */
10248 if (staticp
&& decl_context
== TYPENAME
10249 && TREE_CODE (declspecs
) == TREE_LIST
10250 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
10251 decl_context
= FIELD
;
10253 /* Warn about storage classes that are invalid for certain
10254 kinds of declarations (parameters, typenames, etc.). */
10257 error ("multiple storage classes in declaration of `%s'", name
);
10258 else if (decl_context
!= NORMAL
&& nclasses
> 0)
10260 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
10261 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
10262 || RIDBIT_SETP (RID_AUTO
, specbits
)))
10264 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10266 else if (decl_context
== FIELD
10267 /* C++ allows static class elements */
10268 && RIDBIT_SETP (RID_STATIC
, specbits
))
10269 /* C++ also allows inlines and signed and unsigned elements,
10270 but in those cases we don't come in here. */
10274 if (decl_context
== FIELD
)
10276 tree tmp
= NULL_TREE
;
10277 register int op
= 0;
10281 /* Avoid trying to get an operand off an identifier node. */
10282 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10285 tmp
= TREE_OPERAND (declarator
, 0);
10286 op
= IDENTIFIER_OPNAME_P (tmp
);
10287 if (IDENTIFIER_TYPENAME_P (tmp
))
10289 if (IDENTIFIER_GLOBAL_VALUE (tmp
)
10290 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (tmp
))
10292 name
= IDENTIFIER_POINTER (tmp
);
10294 name
= "<invalid operator>";
10297 error ("storage class specified for %s `%s'",
10298 op
? "member operator" : "field",
10303 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10304 error ("storage class specified for parameter `%s'", name
);
10306 error ("storage class specified for typename");
10308 RIDBIT_RESET (RID_REGISTER
, specbits
);
10309 RIDBIT_RESET (RID_AUTO
, specbits
);
10310 RIDBIT_RESET (RID_EXTERN
, specbits
);
10313 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
10315 if (toplevel_bindings_p ())
10317 /* It's common practice (and completely valid) to have a const
10318 be initialized and declared extern. */
10319 if (!(type_quals
& TYPE_QUAL_CONST
))
10320 warning ("`%s' initialized and declared `extern'", name
);
10323 error ("`%s' has both `extern' and initializer", name
);
10325 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
10326 && ! toplevel_bindings_p ())
10327 error ("nested function `%s' declared `extern'", name
);
10328 else if (toplevel_bindings_p ())
10330 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10331 error ("top-level declaration of `%s' specifies `auto'", name
);
10334 if (nclasses
> 0 && friendp
)
10335 error ("storage class specifiers invalid in friend function declarations");
10337 /* Now figure out the structure of the declarator proper.
10338 Descend through it, creating more complex types, until we reach
10339 the declared identifier (or NULL_TREE, in an absolute declarator). */
10341 inner_attrs
= NULL_TREE
;
10344 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
10345 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
10347 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
10348 an INDIRECT_REF (for *...),
10349 a CALL_EXPR (for ...(...)),
10350 an identifier (for the name being declared)
10351 or a null pointer (for the place in an absolute declarator
10352 where the name was omitted).
10353 For the last two cases, we have just exited the loop.
10355 For C++ it could also be
10356 a SCOPE_REF (for class :: ...). In this case, we have converted
10357 sensible names to types, and those are the values we use to
10358 qualify the member name.
10359 an ADDR_EXPR (for &...),
10360 a BIT_NOT_EXPR (for destructors)
10362 At this point, TYPE is the type of elements of an array,
10363 or for a function to return, or for a pointer to point to.
10364 After this sequence of ifs, TYPE is the type of the
10365 array or function or pointer, and DECLARATOR has had its
10366 outermost layer removed. */
10368 if (type
== error_mark_node
)
10370 if (TREE_CODE (declarator
) == SCOPE_REF
)
10371 declarator
= TREE_OPERAND (declarator
, 1);
10373 declarator
= TREE_OPERAND (declarator
, 0);
10376 if (quals
!= NULL_TREE
10377 && (declarator
== NULL_TREE
10378 || TREE_CODE (declarator
) != SCOPE_REF
))
10380 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
10381 ctype
= TYPE_METHOD_BASETYPE (type
);
10382 if (ctype
!= NULL_TREE
)
10384 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
10385 grok_method_quals (ctype
, dummy
, quals
);
10386 type
= TREE_TYPE (dummy
);
10387 ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
)));
10392 /* See the comment for the TREE_LIST case, below. */
10395 else if (inner_attrs
)
10397 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10398 inner_attrs
= NULL_TREE
;
10401 switch (TREE_CODE (declarator
))
10405 /* We encode a declarator with embedded attributes using
10406 a TREE_LIST. The attributes apply to the declarator
10407 directly inside them, so we have to skip an iteration
10408 before applying them to the type. If the declarator just
10409 inside is the declarator-id, we apply the attrs to the
10411 inner_attrs
= TREE_PURPOSE (declarator
);
10413 declarator
= TREE_VALUE (declarator
);
10419 register tree size
;
10421 size
= TREE_OPERAND (declarator
, 1);
10423 /* VC++ spells a zero-sized array with []. */
10424 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
10425 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10426 size
= integer_zero_node
;
10428 declarator
= TREE_OPERAND (declarator
, 0);
10430 type
= create_array_type_for_decl (dname
, type
, size
);
10432 /* VLAs never work as fields. */
10433 if (decl_context
== FIELD
&& !processing_template_decl
10434 && TREE_CODE (type
) == ARRAY_TYPE
10435 && TYPE_DOMAIN (type
) != NULL_TREE
10436 && !TREE_CONSTANT (TYPE_MAX_VALUE (TYPE_DOMAIN (type
))))
10438 cp_error ("size of member `%D' is not constant", dname
);
10439 /* Proceed with arbitrary constant size, so that offset
10440 computations don't get confused. */
10441 type
= create_array_type_for_decl (dname
, TREE_TYPE (type
),
10453 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
10454 tree inner_decl
= TREE_OPERAND (declarator
, 0);
10456 /* Declaring a function type.
10457 Make sure we have a valid type for the function to return. */
10459 /* We now know that the TYPE_QUALS don't apply to the
10460 decl, but to its return type. */
10461 type_quals
= TYPE_UNQUALIFIED
;
10463 /* Warn about some types functions can't return. */
10465 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10467 error ("`%s' declared as function returning a function", name
);
10468 type
= integer_type_node
;
10470 if (TREE_CODE (type
) == ARRAY_TYPE
)
10472 error ("`%s' declared as function returning an array", name
);
10473 type
= integer_type_node
;
10476 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
10477 inner_decl
= TREE_OPERAND (inner_decl
, 1);
10479 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
10480 inner_decl
= dname
;
10482 /* Pick up type qualifiers which should be applied to `this'. */
10483 quals
= CALL_DECLARATOR_QUALS (declarator
);
10485 /* Pick up the exception specifications. */
10486 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
10488 /* Say it's a definition only for the CALL_EXPR
10489 closest to the identifier. */
10492 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
10493 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
10494 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
10496 if (ctype
== NULL_TREE
10497 && decl_context
== FIELD
10499 && (friendp
== 0 || dname
== current_class_name
))
10500 ctype
= current_class_type
;
10502 if (ctype
&& sfk
== sfk_conversion
)
10503 TYPE_HAS_CONVERSION (ctype
) = 1;
10504 if (ctype
&& constructor_name (ctype
) == dname
)
10506 /* We are within a class's scope. If our declarator name
10507 is the same as the class name, and we are defining
10508 a function, then it is a constructor/destructor, and
10509 therefore returns a void type. */
10511 if (flags
== DTOR_FLAG
)
10513 /* ISO C++ 12.4/2. A destructor may not be
10514 declared const or volatile. A destructor may
10517 error ("destructor cannot be static member function");
10520 cp_error ("destructors may not be `%s'",
10521 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10524 if (decl_context
== FIELD
)
10526 if (! member_function_or_else (ctype
,
10527 current_class_type
,
10529 return void_type_node
;
10532 else /* It's a constructor. */
10534 if (explicitp
== 1)
10536 /* ISO C++ 12.1. A constructor may not be
10537 declared const or volatile. A constructor may
10538 not be virtual. A constructor may not be
10541 error ("constructor cannot be static member function");
10544 pedwarn ("constructors cannot be declared virtual");
10549 cp_error ("constructors may not be `%s'",
10550 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10554 RID_BIT_TYPE tmp_bits
;
10555 memcpy (&tmp_bits
, &specbits
, sizeof (RID_BIT_TYPE
));
10556 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10557 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10558 if (RIDBIT_ANY_SET (tmp_bits
))
10559 error ("return value type specifier for constructor ignored");
10561 if (decl_context
== FIELD
)
10563 if (! member_function_or_else (ctype
,
10564 current_class_type
,
10566 return void_type_node
;
10567 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10568 if (sfk
!= sfk_constructor
)
10572 if (decl_context
== FIELD
)
10578 error ("can't initialize friend function `%s'", name
);
10581 /* Cannot be both friend and virtual. */
10582 error ("virtual functions cannot be friends");
10583 RIDBIT_RESET (RID_FRIEND
, specbits
);
10586 if (decl_context
== NORMAL
)
10587 error ("friend declaration not in class definition");
10588 if (current_function_decl
&& funcdef_flag
)
10589 cp_error ("can't define friend function `%s' in a local class definition",
10593 /* Construct the function type and go to the next
10594 inner layer of declarator. */
10596 declarator
= TREE_OPERAND (declarator
, 0);
10598 /* FIXME: This is where default args should be fully
10601 arg_types
= grokparms (inner_parms
);
10603 if (declarator
&& flags
== DTOR_FLAG
)
10605 /* A destructor declared in the body of a class will
10606 be represented as a BIT_NOT_EXPR. But, we just
10607 want the underlying IDENTIFIER. */
10608 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10609 declarator
= TREE_OPERAND (declarator
, 0);
10611 if (arg_types
!= void_list_node
)
10613 cp_error ("destructors may not have parameters");
10614 arg_types
= void_list_node
;
10615 last_function_parms
= NULL_TREE
;
10619 /* ANSI says that `const int foo ();'
10620 does not make the function foo const. */
10621 type
= build_function_type (type
, arg_types
);
10625 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10626 if (TREE_PURPOSE (t
)
10627 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10629 add_defarg_fn (type
);
10638 /* Filter out pointers-to-references and references-to-references.
10639 We can get these if a TYPE_DECL is used. */
10641 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10643 error ("cannot declare %s to references",
10644 TREE_CODE (declarator
) == ADDR_EXPR
10645 ? "references" : "pointers");
10646 declarator
= TREE_OPERAND (declarator
, 0);
10650 if (TREE_CODE (type
) == OFFSET_TYPE
10651 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10652 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10654 cp_error ("cannot declare pointer to `%#T' member",
10656 type
= TREE_TYPE (type
);
10659 /* Merge any constancy or volatility into the target type
10660 for the pointer. */
10662 /* We now know that the TYPE_QUALS don't apply to the decl,
10663 but to the target of the pointer. */
10664 type_quals
= TYPE_UNQUALIFIED
;
10666 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10668 if (TREE_CODE (type
) == VOID_TYPE
)
10669 error ("invalid type: `void &'");
10671 type
= build_reference_type (type
);
10673 else if (TREE_CODE (type
) == METHOD_TYPE
)
10674 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10676 type
= build_pointer_type (type
);
10678 /* Process a list of type modifier keywords (such as
10679 const or volatile) that were given inside the `*' or `&'. */
10681 if (TREE_TYPE (declarator
))
10683 register tree typemodlist
;
10689 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10690 typemodlist
= TREE_CHAIN (typemodlist
))
10692 tree qualifier
= TREE_VALUE (typemodlist
);
10694 if (qualifier
== ridpointers
[(int) RID_CONST
])
10696 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10698 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10703 error ("invalid type modifier within pointer declarator");
10707 pedwarn ("duplicate `const'");
10709 pedwarn ("duplicate `volatile'");
10711 pedwarn ("duplicate `restrict'");
10713 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10714 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10715 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10716 if (TREE_CODE (declarator
) == ADDR_EXPR
10717 && (constp
|| volatilep
))
10720 pedwarn ("discarding `const' applied to a reference");
10722 pedwarn ("discarding `volatile' applied to a reference");
10723 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10725 type
= cp_build_qualified_type (type
, type_quals
);
10727 declarator
= TREE_OPERAND (declarator
, 0);
10733 /* We have converted type names to NULL_TREE if the
10734 name was bogus, or to a _TYPE node, if not.
10736 The variable CTYPE holds the type we will ultimately
10737 resolve to. The code here just needs to build
10738 up appropriate member types. */
10739 tree sname
= TREE_OPERAND (declarator
, 1);
10742 /* Destructors can have their visibilities changed as well. */
10743 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10744 sname
= TREE_OPERAND (sname
, 0);
10746 if (TREE_COMPLEXITY (declarator
) == 0)
10747 /* This needs to be here, in case we are called
10748 multiple times. */ ;
10749 else if (TREE_COMPLEXITY (declarator
) == -1)
10750 /* Namespace member. */
10751 pop_decl_namespace ();
10752 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10753 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10754 else if (! IS_AGGR_TYPE_CODE
10755 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10757 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10759 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10760 that refer to ctype. They couldn't be resolved earlier
10761 because we hadn't pushed into the class yet.
10762 Example: resolve 'B<T>::type' in
10763 'B<typename B<T>::type> B<T>::f () { }'. */
10764 if (current_template_parms
10765 && uses_template_parms (type
)
10766 && uses_template_parms (current_class_type
))
10768 tree args
= current_template_args ();
10769 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10772 /* This pop_nested_class corresponds to the
10773 push_nested_class used to push into class scope for
10774 parsing the argument list of a function decl, in
10776 pop_nested_class ();
10777 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10780 my_friendly_abort (16);
10782 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10784 /* We had a reference to a global decl, or
10785 perhaps we were given a non-aggregate typedef,
10786 in which case we cleared this out, and should just
10787 keep going as though it wasn't there. */
10788 declarator
= sname
;
10791 ctype
= TREE_OPERAND (declarator
, 0);
10794 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10796 /* You're supposed to have one `template <...>'
10797 for every template class, but you don't need one
10798 for a full specialization. For example:
10800 template <class T> struct S{};
10801 template <> struct S<int> { void f(); };
10802 void S<int>::f () {}
10804 is correct; there shouldn't be a `template <>' for
10805 the definition of `S<int>::f'. */
10806 if (CLASSTYPE_TEMPLATE_INFO (t
)
10807 && (CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
10808 || uses_template_parms (CLASSTYPE_TI_ARGS (t
))))
10809 template_count
+= 1;
10811 t
= TYPE_MAIN_DECL (t
);
10812 if (DECL_LANG_SPECIFIC (t
))
10813 t
= DECL_CONTEXT (t
);
10818 if (sname
== NULL_TREE
)
10821 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10823 /* This is the `standard' use of the scoping operator:
10824 basetype :: member . */
10826 if (ctype
== current_class_type
)
10832 Is this ill-formed? */
10835 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10838 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10840 if (current_class_type
== NULL_TREE
|| friendp
)
10841 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10842 TYPE_ARG_TYPES (type
));
10845 cp_error ("cannot declare member function `%T::%s' within `%T'",
10846 ctype
, name
, current_class_type
);
10847 return void_type_node
;
10850 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10851 || COMPLETE_TYPE_P (complete_type (ctype
)))
10853 /* Have to move this code elsewhere in this function.
10854 this code is used for i.e., typedef int A::M; M *pm;
10856 It is? How? jason 10/2/94 */
10858 if (current_class_type
)
10860 cp_error ("cannot declare member `%T::%s' within `%T'",
10861 ctype
, name
, current_class_type
);
10862 return void_type_node
;
10864 type
= build_offset_type (ctype
, type
);
10868 incomplete_type_error (NULL_TREE
, ctype
);
10869 return error_mark_node
;
10872 declarator
= sname
;
10874 else if (TREE_CODE (sname
) == SCOPE_REF
)
10875 my_friendly_abort (17);
10879 declarator
= TREE_OPERAND (declarator
, 1);
10880 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10881 /* In this case, we will deal with it later. */
10885 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10886 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10887 TYPE_ARG_TYPES (type
));
10889 type
= build_offset_type (ctype
, type
);
10896 declarator
= TREE_OPERAND (declarator
, 0);
10901 case ENUMERAL_TYPE
:
10902 declarator
= NULL_TREE
;
10906 declarator
= NULL_TREE
;
10910 my_friendly_abort (158);
10914 /* See the comment for the TREE_LIST case, above. */
10917 if (! ignore_attrs
)
10918 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10920 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
10922 attrlist
= build_tree_list (NULL_TREE
, inner_attrs
);
10925 /* Now TYPE has the actual type. */
10927 if (explicitp
== 1 || (explicitp
&& friendp
))
10929 /* [dcl.fct.spec] The explicit specifier shall only be used in
10930 declarations of constructors within a class definition. */
10931 error ("only declarations of constructors can be `explicit'");
10935 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10937 if (current_class_name
== NULL_TREE
|| decl_context
== PARM
|| friendp
)
10939 error ("non-member `%s' cannot be declared `mutable'", name
);
10940 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10942 else if (decl_context
== TYPENAME
|| RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10944 error ("non-object member `%s' cannot be declared `mutable'", name
);
10945 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10947 else if (TREE_CODE (type
) == FUNCTION_TYPE
10948 || TREE_CODE (type
) == METHOD_TYPE
)
10950 error ("function `%s' cannot be declared `mutable'", name
);
10951 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10955 error ("static `%s' cannot be declared `mutable'", name
);
10956 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10958 else if (type_quals
& TYPE_QUAL_CONST
)
10960 error ("const `%s' cannot be declared `mutable'", name
);
10961 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10965 if (declarator
== NULL_TREE
10966 || TREE_CODE (declarator
) == IDENTIFIER_NODE
10967 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
10968 && (TREE_CODE (type
) == FUNCTION_TYPE
10969 || TREE_CODE (type
) == METHOD_TYPE
)))
10971 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10973 cp_error ("template-id `%D' used as a declarator", declarator
);
10974 declarator
= dname
;
10977 /* Unexpected declarator format. */
10978 my_friendly_abort (990210);
10980 /* If this is declaring a typedef name, return a TYPE_DECL. */
10982 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
10986 /* Note that the grammar rejects storage classes
10987 in typenames, fields or parameters. */
10988 if (current_lang_name
== lang_name_java
)
10989 TYPE_FOR_JAVA (type
) = 1;
10991 if (decl_context
== FIELD
)
10993 if (declarator
== constructor_name (current_class_type
))
10994 cp_pedwarn ("ISO C++ forbids nested type `%D' with same name as enclosing class",
10996 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
10999 decl
= build_decl (TYPE_DECL
, declarator
, type
);
11001 /* If the user declares "typedef struct {...} foo" then the
11002 struct will have an anonymous name. Fill that name in now.
11003 Nothing can refer to it, so nothing needs know about the name
11005 if (type
!= error_mark_node
11007 && TYPE_NAME (type
)
11008 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
11009 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
11010 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
11012 tree oldname
= TYPE_NAME (type
);
11015 /* Replace the anonymous name with the real name everywhere. */
11016 lookup_tag_reverse (type
, declarator
);
11017 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
11018 if (TYPE_NAME (t
) == oldname
)
11019 TYPE_NAME (t
) = decl
;
11021 if (TYPE_LANG_SPECIFIC (type
))
11022 TYPE_WAS_ANONYMOUS (type
) = 1;
11024 /* If this is a typedef within a template class, the nested
11025 type is a (non-primary) template. The name for the
11026 template needs updating as well. */
11027 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
11028 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
11029 = TYPE_IDENTIFIER (type
);
11032 DECL_ASSEMBLER_NAME (decl
) = mangle_type (type
);
11035 /* XXX Temporarily set the scope.
11036 When returning, start_decl expects it as NULL_TREE,
11037 and will then then set it using pushdecl. */
11038 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
11039 if (current_class_type
)
11040 DECL_CONTEXT (decl
) = current_class_type
;
11042 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
11044 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
11045 DECL_ASSEMBLER_NAME (decl
)
11046 = get_identifier (build_overload_name (type
, 1, 1));
11047 DECL_CONTEXT (decl
) = NULL_TREE
;
11050 /* FIXME remangle member functions; member functions of a
11051 type with external linkage have external linkage. */
11054 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11056 cp_error_at ("typedef name may not be class-qualified", decl
);
11061 if (ctype
== NULL_TREE
)
11063 if (TREE_CODE (type
) != METHOD_TYPE
)
11064 cp_error_at ("invalid type qualifier for non-member function type", decl
);
11066 ctype
= TYPE_METHOD_BASETYPE (type
);
11068 if (ctype
!= NULL_TREE
)
11069 grok_method_quals (ctype
, decl
, quals
);
11072 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
11073 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
11074 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
11076 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
11077 inlinep
, friendp
, raises
!= NULL_TREE
);
11080 error ("typedef declaration includes an initializer");
11085 /* Detect the case of an array type of unspecified size
11086 which came, as such, direct from a typedef name.
11087 We must copy the type, so that each identifier gets
11088 a distinct type, so that each identifier's size can be
11089 controlled separately by its own initializer. */
11091 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
11092 && TYPE_DOMAIN (type
) == NULL_TREE
)
11094 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
11097 /* If this is a type name (such as, in a cast or sizeof),
11098 compute the type and return it now. */
11100 if (decl_context
== TYPENAME
)
11102 /* Note that the grammar rejects storage classes
11103 in typenames, fields or parameters. */
11104 if (type_quals
!= TYPE_UNQUALIFIED
)
11105 type_quals
= TYPE_UNQUALIFIED
;
11107 /* Special case: "friend class foo" looks like a TYPENAME context. */
11110 if (type_quals
!= TYPE_UNQUALIFIED
)
11112 cp_error ("type qualifiers specified for friend class declaration");
11113 type_quals
= TYPE_UNQUALIFIED
;
11117 cp_error ("`inline' specified for friend class declaration");
11121 /* Until core issue 180 is resolved, allow 'friend typename A::B'.
11122 But don't allow implicit typenames except with a class-key. */
11123 if (!current_aggr
&& (TREE_CODE (type
) != TYPENAME_TYPE
11124 || IMPLICIT_TYPENAME_P (type
)))
11126 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
11127 cp_pedwarn ("template parameters cannot be friends");
11128 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
11130 friend declaration requires class-key, i.e. `friend class %T::%T'",
11131 constructor_name (current_class_type
),
11132 TYPE_IDENTIFIER (type
));
11135 friend declaration requires class-key, i.e. `friend %#T'",
11139 /* Only try to do this stuff if we didn't already give up. */
11140 if (type
!= integer_type_node
)
11142 decl_type_access_control (TYPE_NAME (type
));
11144 /* A friendly class? */
11145 if (current_class_type
)
11146 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
11148 cp_error ("trying to make class `%T' a friend of global scope",
11151 type
= void_type_node
;
11156 if (ctype
== NULL_TREE
)
11158 if (TREE_CODE (type
) != METHOD_TYPE
)
11159 cp_error ("invalid qualifiers on non-member function type");
11161 ctype
= TYPE_METHOD_BASETYPE (type
);
11165 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
11166 grok_method_quals (ctype
, dummy
, quals
);
11167 type
= TREE_TYPE (dummy
);
11173 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
11174 && decl_context
!= CATCHPARM
11175 && TREE_CODE (type
) != UNION_TYPE
11178 cp_error ("abstract declarator `%T' used as declaration", type
);
11179 declarator
= make_anon_name ();
11182 /* `void' at top level (not within pointer)
11183 is allowed only in typedefs or type names.
11184 We don't complain about parms either, but that is because
11185 a better error message can be made later. */
11187 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
11190 error ("unnamed variable or field declared void");
11191 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
11193 if (IDENTIFIER_OPNAME_P (declarator
))
11194 my_friendly_abort (356);
11196 error ("variable or field `%s' declared void", name
);
11199 error ("variable or field declared void");
11200 type
= integer_type_node
;
11203 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
11204 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
11206 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
11208 if (ctype
|| in_namespace
)
11209 error ("cannot use `::' in parameter declaration");
11211 /* A parameter declared as an array of T is really a pointer to T.
11212 One declared as a function is really a pointer to a function.
11213 One declared as a member is really a pointer to member. */
11215 if (TREE_CODE (type
) == ARRAY_TYPE
)
11217 /* Transfer const-ness of array into that of type pointed to. */
11218 type
= build_pointer_type (TREE_TYPE (type
));
11219 type_quals
= TYPE_UNQUALIFIED
;
11221 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11222 type
= build_pointer_type (type
);
11223 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11224 type
= build_pointer_type (type
);
11228 register tree decl
;
11230 if (decl_context
== PARM
)
11232 decl
= build_decl (PARM_DECL
, declarator
, type
);
11234 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
11235 inlinep
, friendp
, raises
!= NULL_TREE
);
11237 /* Compute the type actually passed in the parmlist,
11238 for the case where there is no prototype.
11239 (For example, shorts and chars are passed as ints.)
11240 When there is a prototype, this is overridden later. */
11242 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
11244 else if (decl_context
== FIELD
)
11246 if (type
== error_mark_node
)
11248 /* Happens when declaring arrays of sizes which
11249 are error_mark_node, for example. */
11252 else if (in_namespace
&& !friendp
)
11254 /* Something like struct S { int N::j; }; */
11255 cp_error ("invalid use of `::'");
11258 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11261 tree function_context
;
11263 /* We catch the others as conflicts with the builtin
11265 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
11267 cp_error ("function `%D' cannot be declared friend",
11274 if (ctype
== NULL_TREE
)
11275 ctype
= current_class_type
;
11277 if (ctype
== NULL_TREE
)
11279 cp_error ("can't make `%D' into a method -- not in a class",
11281 return void_type_node
;
11284 /* ``A union may [ ... ] not [ have ] virtual functions.''
11286 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
11288 cp_error ("function `%D' declared virtual inside a union",
11290 return void_type_node
;
11293 if (declarator
== ansi_opname (NEW_EXPR
)
11294 || declarator
== ansi_opname (VEC_NEW_EXPR
)
11295 || declarator
== ansi_opname (DELETE_EXPR
)
11296 || declarator
== ansi_opname (VEC_DELETE_EXPR
))
11300 cp_error ("`%D' cannot be declared virtual, since it is always static",
11305 else if (staticp
< 2)
11306 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11307 TYPE_ARG_TYPES (type
));
11310 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
11311 function_context
= (ctype
!= NULL_TREE
) ?
11312 decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
11313 publicp
= (! friendp
|| ! staticp
)
11314 && function_context
== NULL_TREE
;
11315 decl
= grokfndecl (ctype
, type
,
11316 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
11317 ? declarator
: dname
,
11319 virtualp
, flags
, quals
, raises
,
11320 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
11321 funcdef_flag
, template_count
, in_namespace
);
11322 if (decl
== NULL_TREE
)
11325 /* This clobbers the attrs stored in `decl' from `attrlist'. */
11326 /* The decl and setting of decl_machine_attr is also turned off. */
11327 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
11330 /* [class.conv.ctor]
11332 A constructor declared without the function-specifier
11333 explicit that can be called with a single parameter
11334 specifies a conversion from the type of its first
11335 parameter to the type of its class. Such a constructor
11336 is called a converting constructor. */
11337 if (explicitp
== 2)
11338 DECL_NONCONVERTING_P (decl
) = 1;
11339 else if (DECL_CONSTRUCTOR_P (decl
))
11341 /* The constructor can be called with exactly one
11342 parameter if there is at least one parameter, and
11343 any subsequent parameters have default arguments.
11344 We don't look at the first parameter, which is
11345 really just the `this' parameter for the new
11348 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
11350 /* Skip the `in_chrg' argument too, if present. */
11351 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
11352 arg_types
= TREE_CHAIN (arg_types
);
11354 if (arg_types
== void_list_node
11356 && TREE_CHAIN (arg_types
)
11357 && TREE_CHAIN (arg_types
) != void_list_node
11358 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
11359 DECL_NONCONVERTING_P (decl
) = 1;
11362 else if (TREE_CODE (type
) == METHOD_TYPE
)
11364 /* We only get here for friend declarations of
11365 members of other classes. */
11366 /* All method decls are public, so tell grokfndecl to set
11367 TREE_PUBLIC, also. */
11368 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
11369 virtualp
, flags
, quals
, raises
,
11370 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
11371 template_count
, in_namespace
);
11372 if (decl
== NULL_TREE
)
11375 else if (!staticp
&& ! processing_template_decl
11376 && !COMPLETE_TYPE_P (complete_type (type
))
11377 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
11380 cp_error ("field `%D' has incomplete type", declarator
);
11382 cp_error ("name `%T' has incomplete type", type
);
11384 /* If we're instantiating a template, tell them which
11385 instantiation made the field's type be incomplete. */
11386 if (current_class_type
11387 && TYPE_NAME (current_class_type
)
11388 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
11389 && declspecs
&& TREE_VALUE (declspecs
)
11390 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
11391 cp_error (" in instantiation of template `%T'",
11392 current_class_type
);
11394 type
= error_mark_node
;
11401 error ("`%s' is neither function nor member function; cannot be declared friend",
11402 IDENTIFIER_POINTER (declarator
));
11410 /* Friends are treated specially. */
11411 if (ctype
== current_class_type
)
11412 warning ("member functions are implicitly friends of their class");
11415 tree t
= NULL_TREE
;
11416 if (decl
&& DECL_NAME (decl
))
11418 if (template_class_depth (current_class_type
) == 0)
11421 = check_explicit_specialization
11423 template_count
, 2 * (funcdef_flag
!= 0) + 4);
11424 if (decl
== error_mark_node
)
11425 return error_mark_node
;
11428 t
= do_friend (ctype
, declarator
, decl
,
11429 last_function_parms
, attrlist
, flags
, quals
,
11432 if (t
&& funcdef_flag
)
11435 return void_type_node
;
11439 /* Structure field. It may not be a function, except for C++ */
11441 if (decl
== NULL_TREE
)
11447 /* An attempt is being made to initialize a non-static
11448 member. But, from [class.mem]:
11450 4 A member-declarator can contain a
11451 constant-initializer only if it declares a static
11452 member (_class.static_) of integral or enumeration
11453 type, see _class.static.data_.
11455 This used to be relatively common practice, but
11456 the rest of the compiler does not correctly
11457 handle the initialization unless the member is
11458 static so we make it static below. */
11459 cp_pedwarn ("ISO C++ forbids initialization of member `%D'",
11461 cp_pedwarn ("making `%D' static", declarator
);
11465 if (uses_template_parms (type
))
11466 /* We'll check at instantiation time. */
11468 else if (check_static_variable_definition (declarator
,
11470 /* If we just return the declaration, crashes
11471 will sometimes occur. We therefore return
11472 void_type_node, as if this was a friend
11473 declaration, to cause callers to completely
11474 ignore this declaration. */
11475 return void_type_node
;
11478 /* 9.2p13 [class.mem] */
11479 if (declarator
== constructor_name (current_class_type
)
11480 /* The standard does not allow non-static data members
11481 here either, but we agreed at the 10/99 meeting
11482 to change that in TC 1 so that they are allowed in
11483 classes with no user-defined constructors. */
11485 cp_pedwarn ("ISO C++ forbids static data member `%D' with same name as enclosing class",
11490 /* C++ allows static class members. All other work
11491 for this is done by grokfield. */
11492 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
11493 TREE_STATIC (decl
) = 1;
11494 /* In class context, 'static' means public access. */
11495 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
11499 decl
= build_decl (FIELD_DECL
, declarator
, type
);
11500 DECL_NONADDRESSABLE_P (decl
) = bitfield
;
11501 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11503 DECL_MUTABLE_P (decl
) = 1;
11504 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11508 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
11509 inlinep
, friendp
, raises
!= NULL_TREE
);
11512 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11514 tree original_name
;
11520 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11521 original_name
= dname
;
11523 original_name
= declarator
;
11525 if (RIDBIT_SETP (RID_AUTO
, specbits
))
11526 error ("storage class `auto' invalid for function `%s'", name
);
11527 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11528 error ("storage class `register' invalid for function `%s'", name
);
11530 /* Function declaration not at top level.
11531 Storage classes other than `extern' are not allowed
11532 and `extern' makes no difference. */
11533 if (! toplevel_bindings_p ()
11534 && (RIDBIT_SETP (RID_STATIC
, specbits
)
11535 || RIDBIT_SETP (RID_INLINE
, specbits
))
11538 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11539 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
11541 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
11544 if (ctype
== NULL_TREE
)
11548 error ("virtual non-class function `%s'", name
);
11552 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
11553 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11554 TYPE_ARG_TYPES (type
));
11556 /* Record presence of `static'. */
11557 publicp
= (ctype
!= NULL_TREE
11558 || RIDBIT_SETP (RID_EXTERN
, specbits
)
11559 || !RIDBIT_SETP (RID_STATIC
, specbits
));
11561 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
11562 virtualp
, flags
, quals
, raises
,
11564 publicp
, inlinep
, funcdef_flag
,
11565 template_count
, in_namespace
);
11566 if (decl
== NULL_TREE
)
11571 int illegal_static
= 0;
11573 /* Don't allow a static member function in a class, and forbid
11574 declaring main to be static. */
11575 if (TREE_CODE (type
) == METHOD_TYPE
)
11577 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11578 illegal_static
= 1;
11580 else if (current_function_decl
)
11582 /* FIXME need arm citation */
11583 error ("cannot declare static function inside another function");
11584 illegal_static
= 1;
11587 if (illegal_static
)
11590 RIDBIT_RESET (RID_STATIC
, specbits
);
11596 /* It's a variable. */
11598 /* An uninitialized decl with `extern' is a reference. */
11599 decl
= grokvardecl (type
, declarator
, &specbits
,
11601 (type_quals
& TYPE_QUAL_CONST
) != 0,
11603 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11604 inlinep
, friendp
, raises
!= NULL_TREE
);
11608 DECL_CONTEXT (decl
) = ctype
;
11611 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11613 RIDBIT_RESET (RID_STATIC
, specbits
);
11615 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11617 cp_error ("static member `%D' declared `register'", decl
);
11618 RIDBIT_RESET (RID_REGISTER
, specbits
);
11620 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11622 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11624 RIDBIT_RESET (RID_EXTERN
, specbits
);
11629 my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE
, specbits
), 19990927);
11631 /* Record `register' declaration for warnings on &
11632 and in case doing stupid register allocation. */
11634 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11635 DECL_REGISTER (decl
) = 1;
11637 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11638 DECL_THIS_EXTERN (decl
) = 1;
11640 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11641 DECL_THIS_STATIC (decl
) = 1;
11643 /* Record constancy and volatility. There's no need to do this
11644 when processing a template; we'll do this for the instantiated
11645 declaration based on the type of DECL. */
11646 if (!processing_template_decl
)
11647 c_apply_type_quals_to_decl (type_quals
, decl
);
11653 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11654 An empty exprlist is a parmlist. An exprlist which
11655 contains only identifiers at the global level
11656 is a parmlist. Otherwise, it is an exprlist. */
11659 parmlist_is_exprlist (exprs
)
11662 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11665 if (toplevel_bindings_p ())
11667 /* At the global level, if these are all identifiers,
11668 then it is a parmlist. */
11671 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11673 exprs
= TREE_CHAIN (exprs
);
11680 /* Subroutine of start_function. Ensure that each of the parameter
11681 types (as listed in PARMS) is complete, as is required for a
11682 function definition. */
11685 require_complete_types_for_parms (parms
)
11688 for (; parms
; parms
= TREE_CHAIN (parms
))
11690 if (VOID_TYPE_P (TREE_TYPE (parms
)))
11691 /* grokparms will have already issued an error */
11692 TREE_TYPE (parms
) = error_mark_node
;
11693 else if (complete_type_or_else (TREE_TYPE (parms
), parms
))
11694 layout_decl (parms
, 0);
11696 TREE_TYPE (parms
) = error_mark_node
;
11700 /* Returns non-zero if T is a local variable. */
11703 local_variable_p (t
)
11706 if ((TREE_CODE (t
) == VAR_DECL
11707 /* A VAR_DECL with a context that is a _TYPE is a static data
11709 && !TYPE_P (CP_DECL_CONTEXT (t
))
11710 /* Any other non-local variable must be at namespace scope. */
11711 && !DECL_NAMESPACE_SCOPE_P (t
))
11712 || (TREE_CODE (t
) == PARM_DECL
))
11718 /* Returns non-zero if T is an automatic local variable or a label.
11719 (These are the declarations that need to be remapped when the code
11720 containing them is duplicated.) */
11723 nonstatic_local_decl_p (t
)
11726 return ((local_variable_p (t
) && !TREE_STATIC (t
))
11727 || TREE_CODE (t
) == LABEL_DECL
11728 || TREE_CODE (t
) == RESULT_DECL
);
11731 /* Like local_variable_p, but suitable for use as a tree-walking
11735 local_variable_p_walkfn (tp
, walk_subtrees
, data
)
11737 int *walk_subtrees ATTRIBUTE_UNUSED
;
11738 void *data ATTRIBUTE_UNUSED
;
11740 return ((local_variable_p (*tp
) && !DECL_ARTIFICIAL (*tp
))
11741 ? *tp
: NULL_TREE
);
11744 /* Check that ARG, which is a default-argument expression for a
11745 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11746 something goes wrong. DECL may also be a _TYPE node, rather than a
11747 DECL, if there is no DECL available. */
11750 check_default_argument (decl
, arg
)
11757 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11758 /* We get a DEFAULT_ARG when looking at an in-class declaration
11759 with a default argument. Ignore the argument for now; we'll
11760 deal with it after the class is complete. */
11763 if (processing_template_decl
|| uses_template_parms (arg
))
11764 /* We don't do anything checking until instantiation-time. Note
11765 that there may be uninstantiated arguments even for an
11766 instantiated function, since default arguments are not
11767 instantiated until they are needed. */
11776 decl_type
= TREE_TYPE (decl
);
11778 if (arg
== error_mark_node
11779 || decl
== error_mark_node
11780 || TREE_TYPE (arg
) == error_mark_node
11781 || decl_type
== error_mark_node
)
11782 /* Something already went wrong. There's no need to check
11784 return error_mark_node
;
11786 /* [dcl.fct.default]
11788 A default argument expression is implicitly converted to the
11790 if (!TREE_TYPE (arg
)
11791 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11794 cp_error ("default argument for `%#D' has type `%T'",
11795 decl
, TREE_TYPE (arg
));
11797 cp_error ("default argument for parameter of type `%T' has type `%T'",
11798 decl_type
, TREE_TYPE (arg
));
11800 return error_mark_node
;
11803 /* [dcl.fct.default]
11805 Local variables shall not be used in default argument
11808 The keyword `this' shall not be used in a default argument of a
11809 member function. */
11810 var
= walk_tree_without_duplicates (&arg
, local_variable_p_walkfn
,
11814 cp_error ("default argument `%E' uses local variable `%D'",
11816 return error_mark_node
;
11823 /* Decode the list of parameter types for a function type.
11824 Given the list of things declared inside the parens,
11825 return a list of types.
11827 We determine whether ellipsis parms are used by PARMLIST_ELLIPSIS_P
11828 flag. If unset, we append void_list_node. A parmlist declared
11829 as `(void)' is accepted as the empty parmlist.
11831 Also set last_function_parms to the chain of PARM_DECLs. */
11834 grokparms (first_parm
)
11837 tree result
= NULL_TREE
;
11838 tree decls
= NULL_TREE
;
11839 int ellipsis
= !first_parm
|| PARMLIST_ELLIPSIS_P (first_parm
);
11843 my_friendly_assert (!first_parm
|| TREE_PARMLIST (first_parm
), 20001115);
11845 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11847 tree type
= NULL_TREE
;
11848 register tree decl
= TREE_VALUE (parm
);
11849 tree init
= TREE_PURPOSE (parm
);
11851 chain
= TREE_CHAIN (parm
);
11852 /* @@ weak defense against parse errors. */
11853 if (TREE_CODE (decl
) != VOID_TYPE
11854 && TREE_CODE (decl
) != TREE_LIST
)
11856 /* Give various messages as the need arises. */
11857 if (TREE_CODE (decl
) == STRING_CST
)
11858 cp_error ("invalid string constant `%E'", decl
);
11859 else if (TREE_CODE (decl
) == INTEGER_CST
)
11860 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11864 if (parm
== void_list_node
)
11867 decl
= grokdeclarator (TREE_VALUE (decl
), TREE_PURPOSE (decl
),
11868 PARM
, init
!= NULL_TREE
, NULL_TREE
);
11869 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
11872 type
= TREE_TYPE (decl
);
11873 if (VOID_TYPE_P (type
))
11875 if (same_type_p (type
, void_type_node
)
11876 && !DECL_NAME (decl
) && !result
&& !chain
&& !ellipsis
)
11877 /* this is a parmlist of `(void)', which is ok. */
11879 incomplete_type_error (decl
, type
);
11880 /* It's not a good idea to actually create parameters of
11881 type `void'; other parts of the compiler assume that a
11882 void type terminates the parameter list. */
11883 type
= error_mark_node
;
11884 TREE_TYPE (decl
) = error_mark_node
;
11887 if (type
!= error_mark_node
)
11889 /* Top-level qualifiers on the parameters are
11890 ignored for function types. */
11891 type
= TYPE_MAIN_VARIANT (type
);
11892 if (TREE_CODE (type
) == METHOD_TYPE
)
11894 cp_error ("parameter `%D' invalidly declared method type", decl
);
11895 type
= build_pointer_type (type
);
11896 TREE_TYPE (decl
) = type
;
11898 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11900 cp_error ("parameter `%D' invalidly declared offset type", decl
);
11901 type
= build_pointer_type (type
);
11902 TREE_TYPE (decl
) = type
;
11904 else if (abstract_virtuals_error (decl
, type
))
11905 any_error
= 1; /* Seems like a good idea. */
11906 else if (POINTER_TYPE_P (type
))
11908 /* [dcl.fct]/6, parameter types cannot contain pointers
11909 (references) to arrays of unknown bound. */
11910 tree t
= TREE_TYPE (type
);
11911 int ptr
= TYPE_PTR_P (type
);
11915 if (TYPE_PTR_P (t
))
11917 else if (TREE_CODE (t
) != ARRAY_TYPE
)
11919 else if (!TYPE_DOMAIN (t
))
11923 if (TREE_CODE (t
) == ARRAY_TYPE
)
11924 cp_error ("parameter `%D' includes %s to array of unknown bound `%T'",
11925 decl
, ptr
? "pointer" : "reference", t
);
11928 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
11929 if (PROMOTE_PROTOTYPES
11930 && (TREE_CODE (type
) == INTEGER_TYPE
11931 || TREE_CODE (type
) == ENUMERAL_TYPE
)
11932 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
11933 DECL_ARG_TYPE (decl
) = integer_type_node
;
11934 if (!any_error
&& init
)
11935 init
= check_default_argument (decl
, init
);
11940 TREE_CHAIN (decl
) = decls
;
11942 result
= tree_cons (init
, type
, result
);
11944 decls
= nreverse (decls
);
11945 result
= nreverse (result
);
11947 result
= chainon (result
, void_list_node
);
11948 last_function_parms
= decls
;
11953 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
11954 FUNCTION_TYPE with the newly parsed version of its default argument, which
11955 was previously digested as text. See snarf_defarg et al in lex.c. */
11958 replace_defarg (arg
, init
)
11961 if (! processing_template_decl
11962 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
11963 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
11964 TREE_TYPE (init
), TREE_VALUE (arg
));
11965 TREE_PURPOSE (arg
) = init
;
11968 /* D is a constructor or overloaded `operator='. Returns non-zero if
11969 D's arguments allow it to be a copy constructor, or copy assignment
11978 if (!DECL_FUNCTION_MEMBER_P (d
))
11981 t
= FUNCTION_ARG_CHAIN (d
);
11982 if (DECL_CONSTRUCTOR_P (d
) && DECL_HAS_IN_CHARGE_PARM_P (d
))
11983 t
= TREE_CHAIN (t
);
11984 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
11985 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
11986 == DECL_CONTEXT (d
))
11987 && (TREE_CHAIN (t
) == NULL_TREE
11988 || TREE_CHAIN (t
) == void_list_node
11989 || TREE_PURPOSE (TREE_CHAIN (t
))))
11994 /* These memoizing functions keep track of special properties which
11995 a class may have. `grok_ctor_properties' notices whether a class
11996 has a constructor of the form X(X&), and also complains
11997 if the class has a constructor of the form X(X).
11998 `grok_op_properties' takes notice of the various forms of
11999 operator= which are defined, as well as what sorts of type conversion
12000 may apply. Both functions take a FUNCTION_DECL as an argument. */
12003 grok_ctor_properties (ctype
, decl
)
12006 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
12007 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
12009 /* When a type has virtual baseclasses, a magical first int argument is
12010 added to any ctor so we can tell if the class has been initialized
12011 yet. This could screw things up in this function, so we deliberately
12012 ignore the leading int if we're in that situation. */
12013 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
12015 my_friendly_assert (parmtypes
12016 && TREE_VALUE (parmtypes
) == integer_type_node
,
12018 parmtypes
= TREE_CHAIN (parmtypes
);
12019 parmtype
= TREE_VALUE (parmtypes
);
12024 A non-template constructor for class X is a copy constructor if
12025 its first parameter is of type X&, const X&, volatile X& or const
12026 volatile X&, and either there are no other parameters or else all
12027 other parameters have default arguments. */
12028 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
12029 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
12030 && sufficient_parms_p (TREE_CHAIN (parmtypes
))
12031 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12032 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12034 TYPE_HAS_INIT_REF (ctype
) = 1;
12035 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12036 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
12040 A declaration of a constructor for a class X is ill-formed if its
12041 first parameter is of type (optionally cv-qualified) X and either
12042 there are no other parameters or else all other parameters have
12045 We *don't* complain about member template instantiations that
12046 have this form, though; they can occur as we try to decide what
12047 constructor to use during overload resolution. Since overload
12048 resolution will never prefer such a constructor to the
12049 non-template copy constructor (which is either explicitly or
12050 implicitly defined), there's no need to worry about their
12051 existence. Theoretically, they should never even be
12052 instantiated, but that's hard to forestall. */
12053 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
12054 && sufficient_parms_p (TREE_CHAIN (parmtypes
))
12055 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12056 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12058 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
12060 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
12063 else if (TREE_CODE (parmtype
) == VOID_TYPE
12064 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
12065 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
12070 /* An operator with this code is unary, but can also be binary. */
12074 enum tree_code code
;
12076 return (code
== INDIRECT_REF
12077 || code
== ADDR_EXPR
12078 || code
== CONVERT_EXPR
12079 || code
== NEGATE_EXPR
12080 || code
== PREINCREMENT_EXPR
12081 || code
== PREDECREMENT_EXPR
);
12084 /* An operator with this name can only be unary. */
12088 enum tree_code code
;
12090 return (code
== TRUTH_NOT_EXPR
12091 || code
== BIT_NOT_EXPR
12092 || code
== COMPONENT_REF
12093 || code
== TYPE_EXPR
);
12096 /* Do a little sanity-checking on how they declared their operator. */
12099 grok_op_properties (decl
, virtualp
, friendp
)
12101 int virtualp
, friendp
;
12103 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
12105 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
12106 tree name
= DECL_NAME (decl
);
12107 enum tree_code operator_code
;
12110 /* Count the number of arguments. */
12111 for (argtype
= argtypes
, arity
= 0;
12112 argtype
&& argtype
!= void_list_node
;
12113 argtype
= TREE_CHAIN (argtype
))
12116 if (current_class_type
== NULL_TREE
)
12119 if (DECL_CONV_FN_P (decl
))
12120 operator_code
= TYPE_EXPR
;
12124 #define DEF_OPERATOR(NAME, CODE, NEW_MANGLING, OLD_MANGING, ARITY, ASSN_P) \
12125 if (ansi_opname (CODE) == name) \
12127 operator_code = CODE; \
12130 else if (ansi_assopname (CODE) == name) \
12132 operator_code = CODE; \
12133 DECL_ASSIGNMENT_OPERATOR_P (decl) = 1; \
12137 #include "operators.def"
12138 #undef DEF_OPERATOR
12140 my_friendly_abort (20000527);
12143 my_friendly_assert (operator_code
!= LAST_CPLUS_TREE_CODE
, 20000526);
12144 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12148 switch (operator_code
)
12151 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
12155 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
12158 case COMPONENT_REF
:
12160 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
12164 TYPE_HAS_NEW_OPERATOR (current_class_type
) = 1;
12168 TYPE_GETS_DELETE (current_class_type
) |= 1;
12172 TYPE_HAS_ARRAY_NEW_OPERATOR (current_class_type
) = 1;
12175 case VEC_DELETE_EXPR
:
12176 TYPE_GETS_DELETE (current_class_type
) |= 2;
12184 if (operator_code
== NEW_EXPR
|| operator_code
== VEC_NEW_EXPR
)
12186 /* When the compiler encounters the definition of A::operator new, it
12187 doesn't look at the class declaration to find out if it's static. */
12189 revert_static_member_fn (decl
);
12191 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
12193 else if (operator_code
== DELETE_EXPR
|| operator_code
== VEC_DELETE_EXPR
)
12196 revert_static_member_fn (decl
);
12198 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
12202 /* An operator function must either be a non-static member function
12203 or have at least one parameter of a class, a reference to a class,
12204 an enumeration, or a reference to an enumeration. 13.4.0.6 */
12205 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
12207 if (operator_code
== TYPE_EXPR
12208 || operator_code
== CALL_EXPR
12209 || operator_code
== COMPONENT_REF
12210 || operator_code
== ARRAY_REF
12211 || operator_code
== NOP_EXPR
)
12212 cp_error ("`%D' must be a nonstatic member function", decl
);
12217 if (DECL_STATIC_FUNCTION_P (decl
))
12218 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
12221 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
12223 tree arg
= TREE_VALUE (p
);
12224 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
12225 arg
= TREE_TYPE (arg
);
12227 /* This lets bad template code slip through. */
12228 if (IS_AGGR_TYPE (arg
)
12229 || TREE_CODE (arg
) == ENUMERAL_TYPE
12230 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
12231 || TREE_CODE (arg
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
12235 ("`%D' must have an argument of class or enumerated type",
12242 if (operator_code
== CALL_EXPR
)
12243 return; /* No restrictions on args. */
12245 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
12247 tree t
= TREE_TYPE (name
);
12250 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
12251 const char *what
= 0;
12254 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
12256 if (TREE_CODE (t
) == VOID_TYPE
)
12258 else if (t
== current_class_type
)
12259 what
= "the same type";
12260 /* Don't force t to be complete here. */
12261 else if (IS_AGGR_TYPE (t
)
12262 && COMPLETE_TYPE_P (t
)
12263 && DERIVED_FROM_P (t
, current_class_type
))
12264 what
= "a base class";
12267 warning ("conversion to %s%s will never use a type conversion operator",
12268 ref
? "a reference to " : "", what
);
12272 if (DECL_ASSIGNMENT_OPERATOR_P (decl
)
12273 && operator_code
== NOP_EXPR
)
12277 if (arity
!= 2 && methodp
)
12279 cp_error ("`%D' must take exactly one argument", decl
);
12282 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
12286 A user-declared copy assignment operator X::operator= is
12287 a non-static non-template member function of class X with
12288 exactly one parameter of type X, X&, const X&, volatile
12289 X& or const volatile X&. */
12290 if (copy_assignment_arg_p (parmtype
, virtualp
)
12291 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12292 && is_member_template (DECL_TI_TEMPLATE (decl
)))
12295 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
12296 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
12297 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12298 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
12301 else if (operator_code
== COND_EXPR
)
12304 cp_error ("ISO C++ prohibits overloading operator ?:");
12306 else if (ambi_op_p (operator_code
))
12309 /* We pick the one-argument operator codes by default, so
12310 we don't have to change anything. */
12312 else if (arity
== 2)
12314 /* If we thought this was a unary operator, we now know
12315 it to be a binary operator. */
12316 switch (operator_code
)
12319 operator_code
= MULT_EXPR
;
12323 operator_code
= BIT_AND_EXPR
;
12327 operator_code
= PLUS_EXPR
;
12331 operator_code
= MINUS_EXPR
;
12334 case PREINCREMENT_EXPR
:
12335 operator_code
= POSTINCREMENT_EXPR
;
12338 case PREDECREMENT_EXPR
:
12339 operator_code
= POSTDECREMENT_EXPR
;
12343 my_friendly_abort (20000527);
12346 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12348 if ((operator_code
== POSTINCREMENT_EXPR
12349 || operator_code
== POSTDECREMENT_EXPR
)
12350 && ! processing_template_decl
12351 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
12354 cp_error ("postfix `%D' must take `int' as its argument",
12358 ("postfix `%D' must take `int' as its second argument",
12365 cp_error ("`%D' must take either zero or one argument", decl
);
12367 cp_error ("`%D' must take either one or two arguments", decl
);
12370 /* More Effective C++ rule 6. */
12372 && (operator_code
== POSTINCREMENT_EXPR
12373 || operator_code
== POSTDECREMENT_EXPR
12374 || operator_code
== PREINCREMENT_EXPR
12375 || operator_code
== PREDECREMENT_EXPR
))
12377 tree arg
= TREE_VALUE (argtypes
);
12378 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
12379 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
12380 arg
= TREE_TYPE (arg
);
12381 arg
= TYPE_MAIN_VARIANT (arg
);
12382 if (operator_code
== PREINCREMENT_EXPR
12383 || operator_code
== PREDECREMENT_EXPR
)
12385 if (TREE_CODE (ret
) != REFERENCE_TYPE
12386 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
12388 cp_warning ("prefix `%D' should return `%T'", decl
,
12389 build_reference_type (arg
));
12393 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
12394 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
12398 else if (unary_op_p (operator_code
))
12403 cp_error ("`%D' must take `void'", decl
);
12405 cp_error ("`%D' must take exactly one argument", decl
);
12408 else /* if (binary_op_p (operator_code)) */
12413 cp_error ("`%D' must take exactly one argument", decl
);
12415 cp_error ("`%D' must take exactly two arguments", decl
);
12418 /* More Effective C++ rule 7. */
12420 && (operator_code
== TRUTH_ANDIF_EXPR
12421 || operator_code
== TRUTH_ORIF_EXPR
12422 || operator_code
== COMPOUND_EXPR
))
12423 cp_warning ("user-defined `%D' always evaluates both arguments",
12427 /* Effective C++ rule 23. */
12430 && (operator_code
== PLUS_EXPR
12431 || operator_code
== MINUS_EXPR
12432 || operator_code
== TRUNC_DIV_EXPR
12433 || operator_code
== MULT_EXPR
)
12434 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
12435 cp_warning ("`%D' should return by value", decl
);
12438 for (; argtypes
&& argtypes
!= void_list_node
;
12439 argtypes
= TREE_CHAIN (argtypes
))
12440 if (TREE_PURPOSE (argtypes
))
12442 TREE_PURPOSE (argtypes
) = NULL_TREE
;
12443 if (operator_code
== POSTINCREMENT_EXPR
12444 || operator_code
== POSTDECREMENT_EXPR
)
12447 cp_pedwarn ("`%D' cannot have default arguments", decl
);
12450 cp_error ("`%D' cannot have default arguments", decl
);
12456 static const char *
12458 enum tag_types code
;
12471 my_friendly_abort (981122);
12475 /* Get the struct, enum or union (CODE says which) with tag NAME.
12476 Define the tag as a forward-reference if it is not defined.
12478 C++: If a class derivation is given, process it here, and report
12479 an error if multiple derivation declarations are not identical.
12481 If this is a definition, come in through xref_tag and only look in
12482 the current frame for the name (since C++ allows new names in any
12486 xref_tag (code_type_node
, name
, globalize
)
12487 tree code_type_node
;
12491 enum tag_types tag_code
;
12492 enum tree_code code
;
12493 register tree ref
, t
;
12494 struct binding_level
*b
= current_binding_level
;
12496 tree attributes
= NULL_TREE
;
12497 tree context
= NULL_TREE
;
12499 /* If we are called from the parser, code_type_node will sometimes be a
12500 TREE_LIST. This indicates that the user wrote
12501 "class __attribute__ ((foo)) bar". Extract the attributes so we can
12503 if (TREE_CODE (code_type_node
) == TREE_LIST
)
12505 attributes
= TREE_PURPOSE (code_type_node
);
12506 code_type_node
= TREE_VALUE (code_type_node
);
12509 tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12514 code
= RECORD_TYPE
;
12520 code
= ENUMERAL_TYPE
;
12523 my_friendly_abort (18);
12526 /* If a cross reference is requested, look up the type
12527 already defined for this tag and return it. */
12531 name
= TYPE_IDENTIFIER (t
);
12535 t
= IDENTIFIER_TYPE_VALUE (name
);
12537 /* Warn about 'friend struct Inherited;' doing the wrong thing. */
12538 if (t
&& globalize
&& TREE_CODE (t
) == TYPENAME_TYPE
)
12540 static int explained
;
12542 cp_warning ("`%s %T' declares a new type at namespace scope;\n\
12543 to refer to the inherited type, say `%s %T::%T'%s",
12544 tag_name (tag_code
), name
, tag_name (tag_code
),
12545 constructor_name (current_class_type
), TYPE_IDENTIFIER (t
),
12547 (names from dependent base classes are not visible to unqualified name lookup)"
12553 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
12554 && TREE_CODE (t
) != BOUND_TEMPLATE_TEMPLATE_PARM
)
12559 /* If we know we are defining this tag, only look it up in
12560 this scope and don't try to find it as a type. */
12561 ref
= lookup_tag (code
, name
, b
, 1);
12567 /* [dcl.type.elab] If the identifier resolves to a
12568 typedef-name or a template type-parameter, the
12569 elaborated-type-specifier is ill-formed. */
12570 if (t
!= TYPE_MAIN_VARIANT (t
)
12571 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
12572 cp_pedwarn ("using typedef-name `%D' after `%s'",
12573 TYPE_NAME (t
), tag_name (tag_code
));
12574 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12575 cp_error ("using template type parameter `%T' after `%s'",
12576 t
, tag_name (tag_code
));
12581 ref
= lookup_tag (code
, name
, b
, 0);
12585 /* Try finding it as a type declaration. If that wins,
12587 ref
= lookup_name (name
, 1);
12589 if (ref
!= NULL_TREE
12590 && processing_template_decl
12591 && DECL_CLASS_TEMPLATE_P (ref
)
12592 && template_class_depth (current_class_type
) == 0)
12593 /* Since GLOBALIZE is true, we're declaring a global
12594 template, so we want this type. */
12595 ref
= DECL_TEMPLATE_RESULT (ref
);
12597 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12598 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12599 ref
= TREE_TYPE (ref
);
12604 if (ref
&& current_class_type
12605 && template_class_depth (current_class_type
)
12606 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12608 /* Since GLOBALIZE is non-zero, we are not looking at a
12609 definition of this tag. Since, in addition, we are currently
12610 processing a (member) template declaration of a template
12611 class, we must be very careful; consider:
12618 { template <class V>
12619 friend struct S1; };
12621 Here, the S2::S1 declaration should not be confused with the
12622 outer declaration. In particular, the inner version should
12623 have a template parameter of level 2, not level 1. This
12624 would be particularly important if the member declaration
12627 template <class V = U> friend struct S1;
12629 say, when we should tsubst into `U' when instantiating
12630 S2. On the other hand, when presented with:
12640 we must find the inner binding eventually. We
12641 accomplish this by making sure that the new type we
12642 create to represent this declaration has the right
12644 context
= TYPE_CONTEXT (ref
);
12651 /* If no such tag is yet defined, create a forward-reference node
12652 and record it as the "definition".
12653 When a real declaration of this type is found,
12654 the forward-reference will be altered into a real type. */
12655 if (code
== ENUMERAL_TYPE
)
12657 cp_error ("use of enum `%#D' without previous declaration", name
);
12659 ref
= make_node (ENUMERAL_TYPE
);
12661 /* Give the type a default layout like unsigned int
12662 to avoid crashing if it does not get defined. */
12663 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12664 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12665 TYPE_USER_ALIGN (ref
) = 0;
12666 TREE_UNSIGNED (ref
) = 1;
12667 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12668 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12669 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12671 /* Enable us to recognize when a type is created in class context.
12672 To do nested classes correctly, this should probably be cleared
12673 out when we leave this classes scope. Currently this in only
12674 done in `start_enum'. */
12676 pushtag (name
, ref
, globalize
);
12680 struct binding_level
*old_b
= class_binding_level
;
12682 ref
= make_aggr_type (code
);
12683 TYPE_CONTEXT (ref
) = context
;
12685 #ifdef NONNESTED_CLASSES
12686 /* Class types don't nest the way enums do. */
12687 class_binding_level
= (struct binding_level
*)0;
12689 pushtag (name
, ref
, globalize
);
12690 class_binding_level
= old_b
;
12695 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12696 redeclare_class_template (ref
, current_template_parms
);
12699 /* Until the type is defined, tentatively accept whatever
12700 structure tag the user hands us. */
12701 if (!COMPLETE_TYPE_P (ref
)
12702 && ref
!= current_class_type
12703 /* Have to check this, in case we have contradictory tag info. */
12704 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12706 if (tag_code
== class_type
)
12707 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12708 else if (tag_code
== record_type
)
12709 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12712 TREE_TYPE (ref
) = attributes
;
12718 xref_tag_from_type (old
, id
, globalize
)
12722 tree code_type_node
;
12724 if (TREE_CODE (old
) == RECORD_TYPE
)
12725 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12726 ? class_type_node
: record_type_node
);
12728 code_type_node
= union_type_node
;
12730 if (id
== NULL_TREE
)
12731 id
= TYPE_IDENTIFIER (old
);
12733 return xref_tag (code_type_node
, id
, globalize
);
12736 /* REF is a type (named NAME), for which we have just seen some
12737 baseclasses. BINFO is a list of those baseclasses; the
12738 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12739 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12740 struct, or union. */
12743 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12744 tree code_type_node
;
12748 /* In the declaration `A : X, Y, ... Z' we mark all the types
12749 (A, X, Y, ..., Z) so we can check for duplicates. */
12754 enum tag_types tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12756 if (tag_code
== union_type
)
12758 cp_error ("derived union `%T' invalid", ref
);
12762 len
= list_length (binfo
);
12764 /* First, make sure that any templates in base-classes are
12765 instantiated. This ensures that if we call ourselves recursively
12766 we do not get confused about which classes are marked and which
12768 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12769 complete_type (TREE_VALUE (base
));
12771 SET_CLASSTYPE_MARKED (ref
);
12772 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12774 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12776 /* The base of a derived struct is public by default. */
12778 = (TREE_PURPOSE (binfo
) == access_public_node
12779 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12780 || (tag_code
!= class_type
12781 && (TREE_PURPOSE (binfo
) == access_default_node
12782 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12784 = (TREE_PURPOSE (binfo
) == access_protected_node
12785 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12787 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12788 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12789 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12790 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12791 tree basetype
= TREE_VALUE (binfo
);
12794 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12795 basetype
= TREE_TYPE (basetype
);
12797 || (TREE_CODE (basetype
) != RECORD_TYPE
12798 && TREE_CODE (basetype
) != TYPENAME_TYPE
12799 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12800 && TREE_CODE (basetype
) != BOUND_TEMPLATE_TEMPLATE_PARM
))
12802 cp_error ("base type `%T' fails to be a struct or class type",
12803 TREE_VALUE (binfo
));
12807 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12809 /* This code replaces similar code in layout_basetypes.
12810 We put the complete_type first for implicit `typename'. */
12811 if (!COMPLETE_TYPE_P (basetype
)
12812 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12814 cp_error ("base class `%T' has incomplete type", basetype
);
12819 if (CLASSTYPE_MARKED (basetype
))
12821 if (basetype
== ref
)
12822 cp_error ("recursive type `%T' undefined", basetype
);
12824 cp_error ("duplicate base type `%T' invalid", basetype
);
12828 if (TYPE_FOR_JAVA (basetype
)
12829 && (current_lang_stack
12830 == &VARRAY_TREE (current_lang_base
, 0)))
12831 TYPE_FOR_JAVA (ref
) = 1;
12833 /* Note that the BINFO records which describe individual
12834 inheritances are *not* shared in the lattice! They
12835 cannot be shared because a given baseclass may be
12836 inherited with different `accessibility' by different
12837 derived classes. (Each BINFO record describing an
12838 individual inheritance contains flags which say what
12839 the `accessibility' of that particular inheritance is.) */
12842 = make_binfo (size_zero_node
, basetype
,
12843 CLASS_TYPE_P (basetype
)
12844 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
12845 CLASS_TYPE_P (basetype
)
12846 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
12848 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
12849 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
12850 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
12851 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
12852 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
12854 /* We need to unshare the binfos now so that lookups during class
12855 definition work. */
12856 unshare_base_binfos (base_binfo
);
12858 SET_CLASSTYPE_MARKED (basetype
);
12860 /* We are free to modify these bits because they are meaningless
12861 at top level, and BASETYPE is a top-level type. */
12862 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
12864 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
12865 /* Converting to a virtual base class requires looking
12866 up the offset of the virtual base. */
12867 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
12870 if (CLASS_TYPE_P (basetype
))
12872 TYPE_HAS_NEW_OPERATOR (ref
)
12873 |= TYPE_HAS_NEW_OPERATOR (basetype
);
12874 TYPE_HAS_ARRAY_NEW_OPERATOR (ref
)
12875 |= TYPE_HAS_ARRAY_NEW_OPERATOR (basetype
);
12876 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
12877 /* If the base-class uses multiple inheritance, so do we. */
12878 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
12879 |= TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
12880 /* Likewise, if converting to a base of the base may require
12881 code, then we may need to generate code to convert to a
12883 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
)
12884 |= TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (basetype
);
12891 TREE_VEC_LENGTH (binfos
) = i
;
12893 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
12897 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
12898 /* If there is more than one non-empty they cannot be at the same
12900 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
12903 /* Unmark all the types. */
12905 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
12906 CLEAR_CLASSTYPE_MARKED (ref
);
12908 /* Now that we know all the base-classes, set up the list of virtual
12910 get_vbase_types (ref
);
12914 /* Begin compiling the definition of an enumeration type.
12915 NAME is its name (or null if anonymous).
12916 Returns the type object, as yet incomplete.
12917 Also records info about it so that build_enumerator
12918 may be used to declare the individual values as they are read. */
12924 register tree enumtype
= NULL_TREE
;
12925 struct binding_level
*b
= current_binding_level
;
12927 /* If this is the real definition for a previous forward reference,
12928 fill in the contents in the same object that used to be the
12929 forward reference. */
12931 if (name
!= NULL_TREE
)
12932 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
12934 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
12936 cp_error ("multiple definition of `%#T'", enumtype
);
12937 cp_error_at ("previous definition here", enumtype
);
12938 /* Clear out TYPE_VALUES, and start again. */
12939 TYPE_VALUES (enumtype
) = NULL_TREE
;
12943 enumtype
= make_node (ENUMERAL_TYPE
);
12944 pushtag (name
, enumtype
, 0);
12947 if (current_class_type
)
12948 TREE_ADDRESSABLE (b
->tags
) = 1;
12950 GNU_xref_decl (current_function_decl
, enumtype
);
12954 /* After processing and defining all the values of an enumeration type,
12955 install their decls in the enumeration type and finish it off.
12956 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12957 Returns ENUMTYPE. */
12960 finish_enum (enumtype
)
12963 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
12964 /* Calculate the maximum value of any enumerator in this type. */
12966 tree values
= TYPE_VALUES (enumtype
);
12971 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
12976 /* The TREE_VALUE is a CONST_DECL for this enumeration
12978 decl
= TREE_VALUE (pair
);
12982 Following the closing brace of an enum-specifier, each
12983 enumerator has the type of its enumeration. Prior to the
12984 closing brace, the type of each enumerator is the type of
12985 its initializing value. */
12986 TREE_TYPE (decl
) = enumtype
;
12988 /* The DECL_INITIAL will be NULL if we are processing a
12989 template declaration and this enumeration constant had no
12990 explicit initializer. */
12991 value
= DECL_INITIAL (decl
);
12992 if (value
&& !processing_template_decl
)
12994 /* Set the TREE_TYPE for the VALUE as well. That's so
12995 that when we call decl_constant_value we get an
12996 entity of the right type (but with the constant
12997 value). Since we shouldn't ever call
12998 decl_constant_value on a template type, there's no
12999 reason to do that when processing_template_decl.
13000 And, if the expression is something like a
13001 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
13002 wreak havoc on the intended type of the expression.
13004 Of course, there's also no point in trying to compute
13005 minimum or maximum values if we're in a template. */
13006 TREE_TYPE (value
) = enumtype
;
13009 minnode
= maxnode
= value
;
13010 else if (tree_int_cst_lt (maxnode
, value
))
13012 else if (tree_int_cst_lt (value
, minnode
))
13016 if (processing_template_decl
)
13017 /* If this is just a template, leave the CONST_DECL
13018 alone. That way tsubst_copy will find CONST_DECLs for
13019 CONST_DECLs, and not INTEGER_CSTs. */
13022 /* In the list we're building up, we want the enumeration
13023 values, not the CONST_DECLs. */
13024 TREE_VALUE (pair
) = value
;
13028 maxnode
= minnode
= integer_zero_node
;
13030 TYPE_VALUES (enumtype
) = nreverse (values
);
13032 if (processing_template_decl
)
13034 tree scope
= current_scope ();
13035 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
13036 add_stmt (build_min (TAG_DEFN
, enumtype
));
13040 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
13041 int lowprec
= min_precision (minnode
, unsignedp
);
13042 int highprec
= min_precision (maxnode
, unsignedp
);
13043 int precision
= MAX (lowprec
, highprec
);
13046 TYPE_SIZE (enumtype
) = NULL_TREE
;
13048 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
13050 TYPE_PRECISION (enumtype
) = precision
;
13052 fixup_unsigned_type (enumtype
);
13054 fixup_signed_type (enumtype
);
13056 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
13057 /* Use the width of the narrowest normal C type which is wide
13059 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
13062 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
13064 TYPE_SIZE (enumtype
) = 0;
13065 layout_type (enumtype
);
13067 /* Fix up all variant types of this enum type. */
13068 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
13069 tem
= TYPE_NEXT_VARIANT (tem
))
13071 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
13072 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
13073 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
13074 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
13075 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
13076 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
13077 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
13078 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
13079 TYPE_USER_ALIGN (tem
) = TYPE_USER_ALIGN (enumtype
);
13080 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
13083 /* Finish debugging output for this type. */
13084 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
13090 /* Build and install a CONST_DECL for an enumeration constant of the
13091 enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided.
13092 Assignment of sequential values by default is handled here. */
13095 build_enumerator (name
, value
, enumtype
)
13105 /* Remove no-op casts from the value. */
13107 STRIP_TYPE_NOPS (value
);
13109 if (! processing_template_decl
)
13111 /* Validate and default VALUE. */
13112 if (value
!= NULL_TREE
)
13114 value
= decl_constant_value (value
);
13116 if (TREE_CODE (value
) == INTEGER_CST
)
13118 value
= default_conversion (value
);
13119 constant_expression_warning (value
);
13123 cp_error ("enumerator value for `%D' not integer constant", name
);
13128 /* Default based on previous value. */
13129 if (value
== NULL_TREE
&& ! processing_template_decl
)
13133 if (TYPE_VALUES (enumtype
))
13135 /* The next value is the previous value ... */
13136 prev_value
= DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype
)));
13137 /* ... plus one. */
13138 value
= cp_build_binary_op (PLUS_EXPR
,
13142 if (tree_int_cst_lt (value
, prev_value
))
13143 cp_error ("overflow in enumeration values at `%D'", name
);
13146 value
= integer_zero_node
;
13149 /* Remove no-op casts from the value. */
13151 STRIP_TYPE_NOPS (value
);
13153 /* To fix MAX_VAL enum consts. (bkoz) */
13154 TREE_TYPE (value
) = integer_type_node
;
13158 /* We always have to copy here; not all INTEGER_CSTs are unshared.
13159 Even in other cases, we will later (in finish_enum) be setting
13160 the type of VALUE. But, we don't need to make a copy if this
13161 VALUE is one of the enumeration constants for this same
13162 enumeration type. */
13163 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
13164 if (TREE_VALUE (values
) == value
)
13166 /* If we didn't break out of the loop, then we do need a copy. */
13167 if (!values
&& value
)
13168 value
= copy_node (value
);
13170 /* C++ associates enums with global, function, or class declarations. */
13171 context
= current_scope ();
13173 /* Build the actual enumeration constant. Note that the enumeration
13174 constants have the type of their initializers until the
13175 enumeration is complete:
13179 Following the closing brace of an enum-specifier, each enumer-
13180 ator has the type of its enumeration. Prior to the closing
13181 brace, the type of each enumerator is the type of its
13182 initializing value.
13184 In finish_enum we will reset the type. Of course, if we're
13185 processing a template, there may be no value. */
13186 type
= value
? TREE_TYPE (value
) : NULL_TREE
;
13188 if (context
&& context
== current_class_type
)
13189 /* This enum declaration is local to the class. We need the full
13190 lang_decl so that we can record DECL_CLASS_CONTEXT, for example. */
13191 decl
= build_lang_decl (CONST_DECL
, name
, type
);
13193 /* It's a global enum, or it's local to a function. (Note local to
13194 a function could mean local to a class method. */
13195 decl
= build_decl (CONST_DECL
, name
, type
);
13197 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
13198 DECL_INITIAL (decl
) = value
;
13199 TREE_READONLY (decl
) = 1;
13201 if (context
&& context
== current_class_type
)
13202 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
13203 on the TYPE_FIELDS list for `S'. (That's so that you can say
13204 things like `S::i' later.) */
13205 finish_member_declaration (decl
);
13209 GNU_xref_decl (current_function_decl
, decl
);
13212 /* Add this enumeration constant to the list for this type. */
13213 TYPE_VALUES (enumtype
) = tree_cons (name
, decl
, TYPE_VALUES (enumtype
));
13217 /* We're defining DECL. Make sure that it's type is OK. */
13220 check_function_type (decl
, current_function_parms
)
13222 tree current_function_parms
;
13224 tree fntype
= TREE_TYPE (decl
);
13225 tree return_type
= complete_type (TREE_TYPE (fntype
));
13227 /* In a function definition, arg types must be complete. */
13228 require_complete_types_for_parms (current_function_parms
);
13230 if (!COMPLETE_OR_VOID_TYPE_P (return_type
))
13232 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
13234 /* Make it return void instead, but don't change the
13235 type of the DECL_RESULT, in case we have a named return value. */
13236 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13238 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
13240 = build_cplus_method_type (ctype
,
13242 FUNCTION_ARG_CHAIN (decl
));
13246 = build_function_type (void_type_node
,
13247 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
13249 = build_exception_variant (fntype
,
13250 TYPE_RAISES_EXCEPTIONS (fntype
));
13253 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
13256 /* Create the FUNCTION_DECL for a function definition.
13257 DECLSPECS and DECLARATOR are the parts of the declaration;
13258 they describe the function's name and the type it returns,
13259 but twisted together in a fashion that parallels the syntax of C.
13261 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
13262 DECLARATOR is really the DECL for the function we are about to
13263 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
13264 indicating that the function is an inline defined in-class.
13266 This function creates a binding context for the function body
13267 as well as setting up the FUNCTION_DECL in current_function_decl.
13269 Returns 1 on success. If the DECLARATOR is not suitable for a function
13270 (it defines a datum instead), we return 0, which tells
13271 yyparse to report a parse error.
13273 For C++, we must first check whether that datum makes any sense.
13274 For example, "class A local_a(1,2);" means that variable local_a
13275 is an aggregate of type A, which should have a constructor
13276 applied to it with the argument list [1, 2]. */
13279 start_function (declspecs
, declarator
, attrs
, flags
)
13280 tree declspecs
, declarator
, attrs
;
13284 tree ctype
= NULL_TREE
;
13287 extern int have_extern_spec
;
13288 extern int used_extern_spec
;
13289 int doing_friend
= 0;
13290 struct binding_level
*bl
;
13291 tree current_function_parms
;
13293 /* Sanity check. */
13294 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
13295 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
13297 /* This should only be done once on the top most decl. */
13298 if (have_extern_spec
&& !used_extern_spec
)
13300 declspecs
= tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
13301 used_extern_spec
= 1;
13304 if (flags
& SF_PRE_PARSED
)
13306 decl1
= declarator
;
13308 fntype
= TREE_TYPE (decl1
);
13309 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13310 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13312 /* ISO C++ 11.4/5. A friend function defined in a class is in
13313 the (lexical) scope of the class in which it is defined. */
13314 if (!ctype
&& DECL_FRIEND_P (decl1
))
13316 ctype
= DECL_FRIEND_CONTEXT (decl1
);
13318 /* CTYPE could be null here if we're dealing with a template;
13319 for example, `inline friend float foo()' inside a template
13320 will have no CTYPE set. */
13321 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
13327 last_function_parms
= DECL_ARGUMENTS (decl1
);
13328 last_function_parm_tags
= NULL_TREE
;
13332 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
13333 /* If the declarator is not suitable for a function definition,
13334 cause a syntax error. */
13335 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
13337 fntype
= TREE_TYPE (decl1
);
13339 restype
= TREE_TYPE (fntype
);
13340 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
13342 cp_error ("semicolon missing after declaration of `%#T'", restype
);
13343 shadow_tag (build_tree_list (NULL_TREE
, restype
));
13344 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
13345 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
13346 fntype
= build_function_type (integer_type_node
,
13347 TYPE_ARG_TYPES (fntype
));
13349 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
13351 TYPE_ARG_TYPES (fntype
));
13352 TREE_TYPE (decl1
) = fntype
;
13355 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13356 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13357 else if (DECL_MAIN_P (decl1
))
13359 /* If this doesn't return integer_type, complain. */
13360 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
13362 if (pedantic
|| warn_return_type
)
13363 pedwarn ("return type for `main' changed to `int'");
13364 TREE_TYPE (decl1
) = fntype
= default_function_type
;
13369 /* Sometimes we don't notice that a function is a static member, and
13370 build a METHOD_TYPE for it. Fix that up now. */
13371 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
)
13372 && TREE_CODE (TREE_TYPE (decl1
)) == METHOD_TYPE
)
13374 revert_static_member_fn (decl1
);
13375 last_function_parms
= TREE_CHAIN (last_function_parms
);
13379 /* Warn if function was previously implicitly declared
13380 (but not if we warned then). */
13381 if (! warn_implicit
13382 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
13383 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
13385 /* Set up current_class_type, and enter the scope of the class, if
13388 push_nested_class (ctype
, 1);
13389 else if (DECL_STATIC_FUNCTION_P (decl1
))
13390 push_nested_class (DECL_CONTEXT (decl1
), 2);
13392 /* Now that we have entered the scope of the class, we must restore
13393 the bindings for any template parameters surrounding DECL1, if it
13394 is an inline member template. (Order is important; consider the
13395 case where a template parameter has the same name as a field of
13396 the class.) It is not until after this point that
13397 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
13398 if (flags
& SF_INCLASS_INLINE
)
13399 maybe_begin_member_template_processing (decl1
);
13401 /* Effective C++ rule 15. */
13403 && DECL_OVERLOADED_OPERATOR_P (decl1
) == NOP_EXPR
13404 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
13405 cp_warning ("`operator=' should return a reference to `*this'");
13407 /* Make the init_value nonzero so pushdecl knows this is not tentative.
13408 error_mark_node is replaced below (in poplevel) with the BLOCK. */
13409 if (!DECL_INITIAL (decl1
))
13410 DECL_INITIAL (decl1
) = error_mark_node
;
13412 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
13413 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
13416 /* This function exists in static storage.
13417 (This does not mean `static' in the C sense!) */
13418 TREE_STATIC (decl1
) = 1;
13420 /* We must call push_template_decl after current_class_type is set
13421 up. (If we are processing inline definitions after exiting a
13422 class scope, current_class_type will be NULL_TREE until set above
13423 by push_nested_class.) */
13424 if (processing_template_decl
)
13425 decl1
= push_template_decl (decl1
);
13427 /* We are now in the scope of the function being defined. */
13428 current_function_decl
= decl1
;
13430 /* Save the parm names or decls from this function's declarator
13431 where store_parm_decls will find them. */
13432 current_function_parms
= last_function_parms
;
13433 current_function_parm_tags
= last_function_parm_tags
;
13435 /* Make sure the parameter and return types are reasonable. When
13436 you declare a function, these types can be incomplete, but they
13437 must be complete when you define the function. */
13438 if (! processing_template_decl
)
13439 check_function_type (decl1
, current_function_parms
);
13441 /* Build the return declaration for the function. */
13442 restype
= TREE_TYPE (fntype
);
13443 if (!processing_template_decl
)
13445 if (!DECL_RESULT (decl1
))
13447 DECL_RESULT (decl1
)
13448 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13449 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype
),
13450 DECL_RESULT (decl1
));
13454 /* Just use `void'. Nobody will ever look at this anyhow. */
13455 DECL_RESULT (decl1
) = build_decl (RESULT_DECL
, 0, void_type_node
);
13457 /* Initialize RTL machinery. We cannot do this until
13458 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
13459 even when processing a template; this is how we get
13460 CFUN set up, and our per-function variables initialized.
13461 FIXME factor out the non-RTL stuff. */
13462 bl
= current_binding_level
;
13463 init_function_start (decl1
, input_filename
, lineno
);
13464 current_binding_level
= bl
;
13466 /* Even though we're inside a function body, we still don't want to
13467 call expand_expr to calculate the size of a variable-sized array.
13468 We haven't necessarily assigned RTL to all variables yet, so it's
13469 not safe to try to expand expressions involving them. */
13470 immediate_size_expand
= 0;
13471 cfun
->x_dont_save_pending_sizes_p
= 1;
13473 /* Start the statement-tree, start the tree now. */
13474 begin_stmt_tree (&DECL_SAVED_TREE (decl1
));
13476 /* Let the user know we're compiling this function. */
13477 announce_function (decl1
);
13479 /* Record the decl so that the function name is defined.
13480 If we already have a decl for this name, and it is a FUNCTION_DECL,
13481 use the old decl. */
13482 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
13484 /* A specialization is not used to guide overload resolution. */
13485 if (!DECL_TEMPLATE_SPECIALIZATION (decl1
)
13486 && ! DECL_FUNCTION_MEMBER_P (decl1
))
13487 decl1
= pushdecl (decl1
);
13490 /* We need to set the DECL_CONTEXT. */
13491 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
13492 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
13493 /* And make sure we have enough default args. */
13494 check_default_args (decl1
);
13496 fntype
= TREE_TYPE (decl1
);
13499 /* Reset these in case the call to pushdecl changed them. */
13500 current_function_decl
= decl1
;
13501 cfun
->decl
= decl1
;
13503 /* If we are (erroneously) defining a function that we have already
13504 defined before, wipe out what we knew before. */
13505 if (!DECL_PENDING_INLINE_P (decl1
)
13506 && DECL_SAVED_FUNCTION_DATA (decl1
))
13508 free (DECL_SAVED_FUNCTION_DATA (decl1
));
13509 DECL_SAVED_FUNCTION_DATA (decl1
) = NULL
;
13512 if (ctype
&& !doing_friend
&& !DECL_STATIC_FUNCTION_P (decl1
))
13514 /* We know that this was set up by `grokclassfn'. We do not
13515 wait until `store_parm_decls', since evil parse errors may
13516 never get us to that point. Here we keep the consistency
13517 between `current_class_type' and `current_class_ptr'. */
13518 tree t
= DECL_ARGUMENTS (decl1
);
13520 my_friendly_assert (t
!= NULL_TREE
&& TREE_CODE (t
) == PARM_DECL
,
13522 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
13525 cp_function_chain
->x_current_class_ref
13526 = build_indirect_ref (t
, NULL_PTR
);
13527 cp_function_chain
->x_current_class_ptr
= t
;
13529 /* Constructors and destructors need to know whether they're "in
13530 charge" of initializing virtual base classes. */
13531 if (DECL_HAS_IN_CHARGE_PARM_P (decl1
))
13532 current_in_charge_parm
= TREE_CHAIN (t
);
13535 if (DECL_INTERFACE_KNOWN (decl1
))
13537 tree ctx
= decl_function_context (decl1
);
13539 if (DECL_NOT_REALLY_EXTERN (decl1
))
13540 DECL_EXTERNAL (decl1
) = 0;
13542 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
13543 && TREE_PUBLIC (ctx
))
13544 /* This is a function in a local class in an extern inline
13546 comdat_linkage (decl1
);
13548 /* If this function belongs to an interface, it is public.
13549 If it belongs to someone else's interface, it is also external.
13550 This only affects inlines and template instantiations. */
13551 else if (interface_unknown
== 0
13552 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13553 || flag_alt_external_templates
))
13555 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
13556 || processing_template_decl
)
13558 DECL_EXTERNAL (decl1
)
13560 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
13561 && !DECL_VINDEX (decl1
)));
13563 /* For WIN32 we also want to put these in linkonce sections. */
13564 maybe_make_one_only (decl1
);
13567 DECL_EXTERNAL (decl1
) = 0;
13568 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
13569 DECL_INTERFACE_KNOWN (decl1
) = 1;
13571 else if (interface_unknown
&& interface_only
13572 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13573 || flag_alt_external_templates
))
13575 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13576 interface, we will have interface_only set but not
13577 interface_known. In that case, we don't want to use the normal
13578 heuristics because someone will supply a #pragma implementation
13579 elsewhere, and deducing it here would produce a conflict. */
13580 comdat_linkage (decl1
);
13581 DECL_EXTERNAL (decl1
) = 0;
13582 DECL_INTERFACE_KNOWN (decl1
) = 1;
13583 DECL_DEFER_OUTPUT (decl1
) = 1;
13587 /* This is a definition, not a reference.
13588 So clear DECL_EXTERNAL. */
13589 DECL_EXTERNAL (decl1
) = 0;
13591 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
13592 && ! DECL_INTERFACE_KNOWN (decl1
)
13593 /* Don't try to defer nested functions for now. */
13594 && ! decl_function_context (decl1
))
13595 DECL_DEFER_OUTPUT (decl1
) = 1;
13597 DECL_INTERFACE_KNOWN (decl1
) = 1;
13601 current_binding_level
->parm_flag
= 1;
13604 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13606 /* We need to do this even if we aren't expanding yet so that
13607 assemble_external works. */
13608 make_decl_rtl (decl1
, NULL
);
13610 /* Promote the value to int before returning it. */
13611 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13612 restype
= type_promotes_to (restype
);
13614 /* If this fcn was already referenced via a block-scope `extern' decl
13615 (or an implicit decl), propagate certain information about the usage. */
13616 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13617 TREE_ADDRESSABLE (decl1
) = 1;
13619 if (DECL_RESULT (decl1
) == NULL_TREE
)
13621 DECL_RESULT (decl1
)
13622 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13623 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13624 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13629 if (DECL_DESTRUCTOR_P (decl1
))
13631 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13632 DECL_CONTEXT (dtor_label
) = current_function_decl
;
13634 /* Under the old ABI we return `this' from constructors, so we make
13635 ordinary `return' statements in constructors jump to CTOR_LABEL;
13636 from there we return `this'. Under the new ABI, we don't bother
13637 with any of this. By not setting CTOR_LABEL the remainder of the
13638 machinery is automatically disabled. */
13639 else if (!flag_new_abi
&& DECL_CONSTRUCTOR_P (decl1
))
13641 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13642 DECL_CONTEXT (ctor_label
) = current_function_decl
;
13645 store_parm_decls (current_function_parms
);
13650 /* Store the parameter declarations into the current function declaration.
13651 This is called after parsing the parameter declarations, before
13652 digesting the body of the function.
13654 Also install to binding contour return value identifier, if any. */
13657 store_parm_decls (current_function_parms
)
13658 tree current_function_parms
;
13660 register tree fndecl
= current_function_decl
;
13661 register tree parm
;
13662 int parms_have_cleanups
= 0;
13663 tree cleanups
= NULL_TREE
;
13665 /* This is a list of types declared among parms in a prototype. */
13666 tree parmtags
= current_function_parm_tags
;
13668 /* This is a chain of any other decls that came in among the parm
13669 declarations. If a parm is declared with enum {foo, bar} x;
13670 then CONST_DECLs for foo and bar are put here. */
13671 tree nonparms
= NULL_TREE
;
13673 if (current_function_parms
)
13675 /* This case is when the function was defined with an ANSI prototype.
13676 The parms already have decls, so we need not do anything here
13677 except record them as in effect
13678 and complain if any redundant old-style parm decls were written. */
13680 tree specparms
= current_function_parms
;
13683 /* Must clear this because it might contain TYPE_DECLs declared
13685 storedecls (NULL_TREE
);
13687 /* If we're doing semantic analysis, then we'll call pushdecl
13688 for each of these. We must do them in reverse order so that
13689 they end in the correct forward order. */
13690 specparms
= nreverse (specparms
);
13692 for (parm
= specparms
; parm
; parm
= next
)
13694 next
= TREE_CHAIN (parm
);
13695 if (TREE_CODE (parm
) == PARM_DECL
)
13699 if (DECL_NAME (parm
) == NULL_TREE
13700 || TREE_CODE (parm
) != VOID_TYPE
)
13703 cp_error ("parameter `%D' declared void", parm
);
13705 cleanup
= (processing_template_decl
13707 : maybe_build_cleanup (parm
));
13710 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13714 /* If we find an enum constant or a type tag,
13715 put it aside for the moment. */
13716 TREE_CHAIN (parm
) = NULL_TREE
;
13717 nonparms
= chainon (nonparms
, parm
);
13721 /* Get the decls in their original chain order and record in the
13722 function. This is all and only the PARM_DECLs that were
13723 pushed into scope by the loop above. */
13724 DECL_ARGUMENTS (fndecl
) = getdecls ();
13725 storetags (chainon (parmtags
, gettags ()));
13728 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13730 /* Now store the final chain of decls for the arguments
13731 as the decl-chain of the current lexical scope.
13732 Put the enumerators in as well, at the front so that
13733 DECL_ARGUMENTS is not modified. */
13734 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13736 /* Now that we have initialized the parms, we can start their
13737 cleanups. We cannot do this before, since expand_decl_cleanup
13738 should not be called before the parm can be used. */
13741 finish_decl_cleanup (TREE_PURPOSE (cleanups
),
13742 TREE_VALUE (cleanups
));
13743 cleanups
= TREE_CHAIN (cleanups
);
13746 /* Create a binding contour which can be used to catch
13747 cleanup-generated temporaries. */
13748 if (parms_have_cleanups
)
13751 /* Do the starting of the exception specifications, if we have any. */
13752 if (flag_exceptions
&& !processing_template_decl
13753 && flag_enforce_eh_specs
13754 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13755 current_eh_spec_try_block
= expand_start_eh_spec ();
13759 /* We have finished doing semantic analysis on DECL, but have not yet
13760 generated RTL for its body. Save away our current state, so that
13761 when we want to generate RTL later we know what to do. */
13764 save_function_data (decl
)
13767 struct cp_language_function
*f
;
13769 /* Save the language-specific per-function data so that we can
13770 get it back when we really expand this function. */
13771 my_friendly_assert (!DECL_PENDING_INLINE_P (decl
),
13775 f
= ((struct cp_language_function
*)
13776 xmalloc (sizeof (struct cp_language_function
)));
13777 memcpy (f
, cp_function_chain
, sizeof (struct cp_language_function
));
13778 DECL_SAVED_FUNCTION_DATA (decl
) = f
;
13780 /* Clear out the bits we don't need. */
13781 f
->base
.x_stmt_tree
.x_last_stmt
= NULL_TREE
;
13782 f
->base
.x_stmt_tree
.x_last_expr_type
= NULL_TREE
;
13783 f
->x_named_label_uses
= NULL
;
13784 f
->bindings
= NULL
;
13786 /* When we get back here again, we will be expanding. */
13787 f
->x_expanding_p
= 1;
13789 /* If we've already decided that we cannot inline this function, we
13790 must remember that fact when we actually go to expand the
13792 f
->cannot_inline
= current_function_cannot_inline
;
13795 /* At the end of every constructor we generate to code to return
13796 `this'. Do that now. */
13799 finish_constructor_body ()
13801 /* Any return from a constructor will end up here. */
13803 add_stmt (build_stmt (LABEL_STMT
, ctor_label
));
13805 /* Clear CTOR_LABEL so that finish_return_stmt knows to really
13806 generate the return, rather than a goto to CTOR_LABEL. */
13807 ctor_label
= NULL_TREE
;
13808 /* In check_return_expr we translate an empty return from a
13809 constructor to a return of `this'. */
13810 finish_return_stmt (NULL_TREE
);
13811 /* Mark the end of the constructor. */
13812 add_stmt (build_stmt (CTOR_STMT
));
13815 /* At the end of every destructor we generate code to restore virtual
13816 function tables to the values desired by base classes and to call
13817 to base class destructors. Do that now. */
13820 finish_destructor_body ()
13822 tree compound_stmt
;
13827 /* Create a block to contain all the extra code. */
13828 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
13830 /* Any return from a destructor will end up here. */
13831 add_stmt (build_stmt (LABEL_STMT
, dtor_label
));
13833 /* Generate the code to call destructor on base class. If this
13834 destructor belongs to a class with virtual functions, then set
13835 the virtual function table pointer to represent the type of our
13838 /* This side-effect makes call to `build_delete' generate the code
13839 we have to have at the end of this destructor. `build_delete'
13840 will set the flag again. */
13841 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
13843 exprstmt
= build_delete (current_class_type
,
13845 sfk_base_destructor
,
13846 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
,
13849 if (exprstmt
!= error_mark_node
13850 && (TREE_CODE (exprstmt
) != NOP_EXPR
13851 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
13852 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
13854 if (exprstmt
!= void_zero_node
)
13855 /* Don't call `expand_expr_stmt' if we're not going to do
13856 anything, since -Wall will give a diagnostic. */
13857 finish_expr_stmt (exprstmt
);
13859 /* Run destructors for all virtual baseclasses. */
13860 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13865 if_stmt
= begin_if_stmt ();
13866 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13867 current_in_charge_parm
,
13871 vbases
= CLASSTYPE_VBASECLASSES (current_class_type
);
13872 /* The CLASSTYPE_VBASECLASSES list is in initialization
13873 order, so we have to march through it in reverse order. */
13874 for (vbases
= nreverse (copy_list (vbases
));
13876 vbases
= TREE_CHAIN (vbases
))
13878 tree vbase
= TREE_VALUE (vbases
);
13880 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (vbase
)))
13882 tree vb
= get_vbase
13883 (BINFO_TYPE (vbase
),
13884 TYPE_BINFO (current_class_type
));
13886 (build_scoped_method_call
13887 (current_class_ref
, vb
, base_dtor_identifier
,
13892 finish_then_clause (if_stmt
);
13897 virtual_size
= c_sizeof (current_class_type
);
13899 /* At the end, call delete if that's what's requested. */
13901 /* FDIS sez: At the point of definition of a virtual destructor
13902 (including an implicit definition), non-placement operator delete
13903 shall be looked up in the scope of the destructor's class and if
13904 found shall be accessible and unambiguous.
13906 This is somewhat unclear, but I take it to mean that if the class
13907 only defines placement deletes we don't do anything here. So we
13908 pass LOOKUP_SPECULATIVELY; delete_sanity will complain for us if
13909 they ever try to delete one of these. */
13910 exprstmt
= build_op_delete_call
13911 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
13912 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
13914 if_stmt
= begin_if_stmt ();
13915 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13916 current_in_charge_parm
,
13919 finish_expr_stmt (exprstmt
);
13920 finish_then_clause (if_stmt
);
13923 /* Close the block we started above. */
13924 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
13927 /* Finish up a function declaration and compile that function
13928 all the way to assembler language output. The free the storage
13929 for the function definition.
13931 FLAGS is a bitwise or of the following values:
13933 An extra call to poplevel (and expand_end_bindings) must be
13934 made to take care of the binding contour for the base
13935 initializers. This is only relevant for constructors.
13937 We just finished processing the body of an in-class inline
13938 function definition. (This processing will have taken place
13939 after the class definition is complete.) */
13942 finish_function (flags
)
13945 register tree fndecl
= current_function_decl
;
13946 tree fntype
, ctype
= NULL_TREE
;
13947 int call_poplevel
= (flags
& 1) != 0;
13948 int inclass_inline
= (flags
& 2) != 0;
13951 /* When we get some parse errors, we can end up without a
13952 current_function_decl, so cope. */
13953 if (fndecl
== NULL_TREE
)
13954 return error_mark_node
;
13956 nested
= function_depth
> 1;
13957 fntype
= TREE_TYPE (fndecl
);
13959 /* TREE_READONLY (fndecl) = 1;
13960 This caused &foo to be of type ptr-to-const-function
13961 which then got a warning when stored in a ptr-to-function variable. */
13963 my_friendly_assert (building_stmt_tree (), 20000911);
13965 /* For a cloned function, we've already got all the code we need;
13966 there's no need to add any extra bits. */
13967 if (!DECL_CLONED_FUNCTION_P (fndecl
))
13969 if (DECL_CONSTRUCTOR_P (fndecl
))
13971 finish_constructor_body ();
13975 else if (DECL_DESTRUCTOR_P (fndecl
) && !processing_template_decl
)
13976 finish_destructor_body ();
13977 else if (DECL_MAIN_P (fndecl
))
13979 /* Make it so that `main' always returns 0 by default. */
13981 finish_return_stmt (integer_one_node
);
13983 finish_return_stmt (integer_zero_node
);
13987 /* Finish dealing with exception specifiers. */
13988 if (flag_exceptions
&& !processing_template_decl
13989 && flag_enforce_eh_specs
13990 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13991 expand_end_eh_spec (TYPE_RAISES_EXCEPTIONS
13992 (TREE_TYPE (current_function_decl
)),
13993 current_eh_spec_try_block
);
13996 /* If we're saving up tree structure, tie off the function now. */
13997 finish_stmt_tree (&DECL_SAVED_TREE (fndecl
));
13999 /* This must come after expand_function_end because cleanups might
14000 have declarations (from inline functions) that need to go into
14001 this function's blocks. */
14002 if (current_binding_level
->parm_flag
!= 1)
14003 my_friendly_abort (122);
14004 poplevel (1, 0, 1);
14006 /* Remember that we were in class scope. */
14007 if (current_class_name
)
14008 ctype
= current_class_type
;
14010 /* Must mark the RESULT_DECL as being in this function. */
14011 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
14013 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
14014 to the FUNCTION_DECL node itself. */
14015 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
14017 /* Save away current state, if appropriate. */
14018 if (!processing_template_decl
)
14019 save_function_data (fndecl
);
14021 /* If this function calls `setjmp' it cannot be inlined. When
14022 `longjmp' is called it is not guaranteed to restore the value of
14023 local variables that have been modified since the call to
14024 `setjmp'. So, if were to inline this function into some caller
14025 `c', then when we `longjmp', we might not restore all variables
14026 in `c'. (It might seem, at first blush, that there's no way for
14027 this function to modify local variables in `c', but their
14028 addresses may have been stored somewhere accessible to this
14030 if (!processing_template_decl
&& calls_setjmp_p (fndecl
))
14031 DECL_UNINLINABLE (fndecl
) = 1;
14033 /* Clear out memory we no longer need. */
14034 free_after_parsing (cfun
);
14035 /* Since we never call rest_of_compilation, we never clear
14036 CFUN. Do so explicitly. */
14037 free_after_compilation (cfun
);
14040 /* If this is a in-class inline definition, we may have to pop the
14041 bindings for the template parameters that we added in
14042 maybe_begin_member_template_processing when start_function was
14044 if (inclass_inline
)
14045 maybe_end_member_template_processing ();
14047 /* Leave the scope of the class. */
14049 pop_nested_class ();
14055 /* Let the error reporting routines know that we're outside a
14056 function. For a nested function, this value is used in
14057 pop_cp_function_context and then reset via pop_function_context. */
14058 current_function_decl
= NULL_TREE
;
14063 /* Create the FUNCTION_DECL for a function definition.
14064 DECLSPECS and DECLARATOR are the parts of the declaration;
14065 they describe the return type and the name of the function,
14066 but twisted together in a fashion that parallels the syntax of C.
14068 This function creates a binding context for the function body
14069 as well as setting up the FUNCTION_DECL in current_function_decl.
14071 Returns a FUNCTION_DECL on success.
14073 If the DECLARATOR is not suitable for a function (it defines a datum
14074 instead), we return 0, which tells yyparse to report a parse error.
14076 May return void_type_node indicating that this method is actually
14077 a friend. See grokfield for more details.
14079 Came here with a `.pushlevel' .
14081 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14082 CHANGES TO CODE IN `grokfield'. */
14085 start_method (declspecs
, declarator
, attrlist
)
14086 tree declarator
, declspecs
, attrlist
;
14088 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
14091 /* Something too ugly to handle. */
14092 if (fndecl
== NULL_TREE
)
14095 /* Pass friends other than inline friend functions back. */
14096 if (fndecl
== void_type_node
)
14099 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
14100 /* Not a function, tell parser to report parse error. */
14103 if (DECL_IN_AGGR_P (fndecl
))
14105 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
14107 if (DECL_CONTEXT (fndecl
)
14108 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
14109 cp_error ("`%D' is already defined in class `%T'", fndecl
,
14110 DECL_CONTEXT (fndecl
));
14112 return void_type_node
;
14115 check_template_shadow (fndecl
);
14117 DECL_THIS_INLINE (fndecl
) = 1;
14119 if (flag_default_inline
)
14120 DECL_INLINE (fndecl
) = 1;
14122 /* We process method specializations in finish_struct_1. */
14123 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
14124 fndecl
= push_template_decl (fndecl
);
14126 if (! DECL_FRIEND_P (fndecl
))
14128 if (TREE_CHAIN (fndecl
))
14130 fndecl
= copy_node (fndecl
);
14131 TREE_CHAIN (fndecl
) = NULL_TREE
;
14134 if (DECL_CONSTRUCTOR_P (fndecl
))
14136 if (! grok_ctor_properties (current_class_type
, fndecl
))
14137 return void_type_node
;
14139 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
14140 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
14143 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0);
14145 /* Make a place for the parms */
14147 current_binding_level
->parm_flag
= 1;
14149 DECL_IN_AGGR_P (fndecl
) = 1;
14153 /* Go through the motions of finishing a function definition.
14154 We don't compile this method until after the whole class has
14157 FINISH_METHOD must return something that looks as though it
14158 came from GROKFIELD (since we are defining a method, after all).
14160 This is called after parsing the body of the function definition.
14161 STMTS is the chain of statements that makes up the function body.
14163 DECL is the ..._DECL that `start_method' provided. */
14166 finish_method (decl
)
14169 register tree fndecl
= decl
;
14172 register tree link
;
14174 if (decl
== void_type_node
)
14177 old_initial
= DECL_INITIAL (fndecl
);
14179 /* Undo the level for the parms (from start_method).
14180 This is like poplevel, but it causes nothing to be
14181 saved. Saving information here confuses symbol-table
14182 output routines. Besides, this information will
14183 be correctly output when this method is actually
14186 /* Clear out the meanings of the local variables of this level;
14187 also record in each decl which block it belongs to. */
14189 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
14191 if (DECL_NAME (link
) != NULL_TREE
)
14192 pop_binding (DECL_NAME (link
), link
);
14193 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
14194 DECL_CONTEXT (link
) = NULL_TREE
;
14197 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
14198 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
14199 current_binding_level
->parm_flag
,
14200 current_binding_level
->keep
);
14202 poplevel (0, 0, 0);
14204 DECL_INITIAL (fndecl
) = old_initial
;
14206 /* We used to check if the context of FNDECL was different from
14207 current_class_type as another way to get inside here. This didn't work
14208 for String.cc in libg++. */
14209 if (DECL_FRIEND_P (fndecl
))
14211 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
14212 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
14213 decl
= void_type_node
;
14219 /* Called when a new struct TYPE is defined.
14220 If this structure or union completes the type of any previous
14221 variable declaration, lay it out and output its rtl. */
14224 hack_incomplete_structures (type
)
14228 struct binding_level
*level
;
14230 if (!type
) /* Don't do this for class templates. */
14233 if (namespace_bindings_p ())
14236 list
= &namespace_scope_incomplete
;
14240 level
= innermost_nonclass_level ();
14241 list
= &level
->incomplete
;
14248 tree decl
= TREE_VALUE (*list
);
14249 if ((decl
&& TREE_TYPE (decl
) == type
)
14250 || (TREE_TYPE (decl
)
14251 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14252 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
14254 int toplevel
= toplevel_bindings_p ();
14255 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14256 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
14257 layout_type (TREE_TYPE (decl
));
14258 layout_decl (decl
, 0);
14259 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
14263 expand_decl (decl
);
14264 cleanup
= maybe_build_cleanup (decl
);
14265 expand_decl_init (decl
);
14266 if (! expand_decl_cleanup (decl
, cleanup
))
14267 cp_error ("parser lost in parsing declaration of `%D'",
14270 *list
= TREE_CHAIN (*list
);
14273 list
= &TREE_CHAIN (*list
);
14276 /* Keep looking through artificial binding levels generated
14277 for local variables. */
14278 if (level
&& level
->keep
== 2)
14280 level
= level
->level_chain
;
14281 list
= &level
->incomplete
;
14288 /* If DECL is of a type which needs a cleanup, build that cleanup
14292 maybe_build_cleanup (decl
)
14295 tree type
= TREE_TYPE (decl
);
14297 if (type
!= error_mark_node
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
14299 int flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14302 if (TREE_CODE (type
) == ARRAY_TYPE
)
14306 mark_addressable (decl
);
14307 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14310 /* Optimize for space over speed here. */
14311 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14312 || flag_expensive_optimizations
)
14313 flags
|= LOOKUP_NONVIRTUAL
;
14315 rval
= build_delete (TREE_TYPE (rval
), rval
,
14316 sfk_complete_destructor
, flags
, 0);
14318 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14319 && ! TYPE_HAS_DESTRUCTOR (type
))
14320 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14321 build_tree_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14328 /* When a stmt has been parsed, this function is called. */
14333 /* Always assume this statement was not an expression statement. If
14334 it actually was an expression statement, its our callers
14335 responsibility to fix this up. */
14336 last_expr_type
= NULL_TREE
;
14339 /* DECL was originally constructed as a non-static member function,
14340 but turned out to be static. Update it accordingly. */
14343 revert_static_member_fn (decl
)
14347 tree function
= TREE_TYPE (decl
);
14348 tree args
= TYPE_ARG_TYPES (function
);
14350 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14351 != TYPE_UNQUALIFIED
)
14352 cp_error ("static member function `%#D' declared with type qualifiers",
14355 args
= TREE_CHAIN (args
);
14356 tmp
= build_function_type (TREE_TYPE (function
), args
);
14357 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14358 tmp
= build_exception_variant (tmp
,
14359 TYPE_RAISES_EXCEPTIONS (function
));
14360 TREE_TYPE (decl
) = tmp
;
14361 if (DECL_ARGUMENTS (decl
))
14362 DECL_ARGUMENTS (decl
) = TREE_CHAIN (DECL_ARGUMENTS (decl
));
14363 DECL_STATIC_FUNCTION_P (decl
) = 1;
14366 /* Initialize the variables used during compilation of a C++
14370 push_cp_function_context (f
)
14371 struct function
*f
;
14373 struct cp_language_function
*p
14374 = ((struct cp_language_function
*)
14375 xcalloc (1, sizeof (struct cp_language_function
)));
14376 f
->language
= (struct language_function
*) p
;
14378 /* It takes an explicit call to expand_body to generate RTL for a
14382 /* Whenever we start a new function, we destroy temporaries in the
14384 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
14387 /* Free the language-specific parts of F, now that we've finished
14388 compiling the function. */
14391 pop_cp_function_context (f
)
14392 struct function
*f
;
14395 free (f
->language
);
14399 /* Mark P for GC. */
14402 mark_lang_function (p
)
14403 struct cp_language_function
*p
;
14408 mark_c_language_function (&p
->base
);
14410 ggc_mark_tree (p
->x_ctor_label
);
14411 ggc_mark_tree (p
->x_dtor_label
);
14412 ggc_mark_tree (p
->x_current_class_ptr
);
14413 ggc_mark_tree (p
->x_current_class_ref
);
14414 ggc_mark_tree (p
->x_eh_spec_try_block
);
14416 mark_named_label_lists (&p
->x_named_labels
, &p
->x_named_label_uses
);
14417 mark_binding_level (&p
->bindings
);
14420 /* Mark the language-specific data in F for GC. */
14423 mark_cp_function_context (f
)
14424 struct function
*f
;
14426 mark_lang_function ((struct cp_language_function
*) f
->language
);
14433 enum tree_code code
= TREE_CODE (t
);
14434 if (code
== IDENTIFIER_NODE
)
14436 struct lang_identifier
*li
= (struct lang_identifier
*) t
;
14437 struct lang_id2
*li2
= li
->x
;
14438 ggc_mark_tree (li
->namespace_bindings
);
14439 ggc_mark_tree (li
->bindings
);
14440 ggc_mark_tree (li
->class_value
);
14441 ggc_mark_tree (li
->class_template_info
);
14445 ggc_mark_tree (li2
->label_value
);
14446 ggc_mark_tree (li2
->implicit_decl
);
14447 ggc_mark_tree (li2
->error_locus
);
14450 else if (code
== CPLUS_BINDING
)
14452 if (BINDING_HAS_LEVEL_P (t
))
14453 mark_binding_level (&BINDING_LEVEL (t
));
14455 ggc_mark_tree (BINDING_SCOPE (t
));
14456 ggc_mark_tree (BINDING_VALUE (t
));
14458 else if (code
== OVERLOAD
)
14459 ggc_mark_tree (OVL_FUNCTION (t
));
14460 else if (code
== TEMPLATE_PARM_INDEX
)
14461 ggc_mark_tree (TEMPLATE_PARM_DECL (t
));
14462 else if (TREE_CODE_CLASS (code
) == 'd')
14464 struct lang_decl
*ld
= DECL_LANG_SPECIFIC (t
);
14469 c_mark_lang_decl (&ld
->decl_flags
.base
);
14470 if (!DECL_GLOBAL_CTOR_P (t
)
14471 && !DECL_GLOBAL_DTOR_P (t
)
14472 && !DECL_THUNK_P (t
))
14473 ggc_mark_tree (ld
->decl_flags
.u2
.access
);
14474 else if (DECL_THUNK_P (t
))
14475 ggc_mark_tree (ld
->decl_flags
.u2
.vcall_offset
);
14476 if (TREE_CODE (t
) != NAMESPACE_DECL
)
14477 ggc_mark_tree (ld
->decl_flags
.u
.template_info
);
14479 mark_binding_level (&NAMESPACE_LEVEL (t
));
14480 if (CAN_HAVE_FULL_LANG_DECL_P (t
))
14482 ggc_mark_tree (ld
->befriending_classes
);
14483 ggc_mark_tree (ld
->context
);
14484 ggc_mark_tree (ld
->cloned_function
);
14485 if (!DECL_OVERLOADED_OPERATOR_P (t
))
14486 ggc_mark_tree (ld
->u2
.vtt_parm
);
14487 if (TREE_CODE (t
) == TYPE_DECL
)
14488 ggc_mark_tree (ld
->u
.sorted_fields
);
14489 else if (TREE_CODE (t
) == FUNCTION_DECL
14490 && !DECL_PENDING_INLINE_P (t
))
14491 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t
));
14495 else if (TREE_CODE_CLASS (code
) == 't')
14497 struct lang_type
*lt
= TYPE_LANG_SPECIFIC (t
);
14499 if (lt
&& !(TREE_CODE (t
) == POINTER_TYPE
14500 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
14503 ggc_mark_tree (lt
->primary_base
);
14504 ggc_mark_tree (lt
->vfields
);
14505 ggc_mark_tree (lt
->vbases
);
14506 ggc_mark_tree (lt
->tags
);
14507 ggc_mark_tree (lt
->size
);
14508 ggc_mark_tree (lt
->pure_virtuals
);
14509 ggc_mark_tree (lt
->friend_classes
);
14510 ggc_mark_tree (lt
->rtti
);
14511 ggc_mark_tree (lt
->methods
);
14512 ggc_mark_tree (lt
->template_info
);
14513 ggc_mark_tree (lt
->befriending_classes
);
14516 /* In the case of pointer-to-member function types, the
14517 TYPE_LANG_SPECIFIC is really just a tree. */
14518 ggc_mark_tree ((tree
) lt
);
14522 /* Return the IDENTIFIER_GLOBAL_VALUE of T, for use in common code, since
14523 the definition of IDENTIFIER_GLOBAL_VALUE is different for C and C++. */
14526 identifier_global_value (t
)
14529 return IDENTIFIER_GLOBAL_VALUE (t
);
14532 /* Build the void_list_node (void_type_node having been created). */
14534 build_void_list_node ()
14536 tree t
= build_tree_list (NULL_TREE
, void_type_node
);
14537 TREE_PARMLIST (t
) = 1;
14542 cp_missing_noreturn_ok_p (decl
)
14545 /* A missing noreturn is ok for the `main' function. */
14546 return MAIN_NAME_P (DECL_ASSEMBLER_NAME (decl
));