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,
5444 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5445 || TREE_CODE (val
) == OVERLOAD
)
5446 val
= lookup_template_function (val
,
5447 TREE_OPERAND (template_id
, 1));
5450 cp_error ("`%D::%D' is not a template",
5452 return error_mark_node
;
5456 /* If we have a single function from a using decl, pull it out. */
5457 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5458 val
= OVL_FUNCTION (val
);
5462 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5463 return error_mark_node
;
5466 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5468 static unsigned long
5476 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5477 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5482 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5485 typename_compare (k1
, k2
)
5496 d1
= TYPE_NAME (t1
);
5497 d2
= TYPE_NAME (t2
);
5499 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5500 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5501 && ((TREE_TYPE (t1
) != NULL_TREE
)
5502 == (TREE_TYPE (t2
) != NULL_TREE
))
5503 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5504 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5507 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5508 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5509 is non-NULL, this type is being created by the implicit typename
5510 extension, and BASE_TYPE is a type named `t' in some base class of
5511 `T' which depends on template parameters.
5513 Returns the new TYPENAME_TYPE. */
5516 build_typename_type (context
, name
, fullname
, base_type
)
5524 struct hash_entry
* e
;
5526 static struct hash_table ht
;
5530 static struct hash_table
*h
= &ht
;
5531 if (!hash_table_init (&ht
, &hash_newfunc
, &typename_hash
,
5533 fatal ("virtual memory exhausted");
5534 ggc_add_tree_hash_table_root (&h
, 1);
5537 /* Build the TYPENAME_TYPE. */
5538 t
= make_aggr_type (TYPENAME_TYPE
);
5539 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5540 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5541 TREE_TYPE (t
) = base_type
;
5543 /* Build the corresponding TYPE_DECL. */
5544 d
= build_decl (TYPE_DECL
, name
, t
);
5545 TYPE_NAME (TREE_TYPE (d
)) = d
;
5546 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5547 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5548 DECL_ARTIFICIAL (d
) = 1;
5550 /* See if we already have this type. */
5551 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5555 /* Insert the type into the table. */
5556 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5561 /* Resolve `typename CONTEXT::NAME'. Returns an appropriate type,
5562 unless an error occurs, in which case error_mark_node is returned.
5563 If COMPLAIN zero, don't complain about any errors that occur. */
5566 make_typename_type (context
, name
, complain
)
5574 if (!(TYPE_LANG_SPECIFIC (name
)
5575 && (CLASSTYPE_IS_TEMPLATE (name
)
5576 || CLASSTYPE_USE_TEMPLATE (name
))))
5577 name
= TYPE_IDENTIFIER (name
);
5579 /* Create a TEMPLATE_ID_EXPR for the type. */
5580 name
= build_nt (TEMPLATE_ID_EXPR
,
5581 CLASSTYPE_TI_TEMPLATE (name
),
5582 CLASSTYPE_TI_ARGS (name
));
5584 else if (TREE_CODE (name
) == TYPE_DECL
)
5585 name
= DECL_NAME (name
);
5589 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5591 name
= TREE_OPERAND (name
, 0);
5592 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5593 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5595 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5596 my_friendly_abort (2000);
5598 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5600 /* We can get here from typename_sub0 in the explicit_template_type
5601 expansion. Just fail. */
5603 cp_error ("no class template named `%#T' in `%#T'",
5605 return error_mark_node
;
5608 if (! uses_template_parms (context
)
5609 || currently_open_class (context
))
5611 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5613 tree tmpl
= NULL_TREE
;
5614 if (IS_AGGR_TYPE (context
))
5615 tmpl
= lookup_field (context
, name
, 0, 0);
5616 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5619 cp_error ("no class template named `%#T' in `%#T'",
5621 return error_mark_node
;
5624 return lookup_template_class (tmpl
,
5625 TREE_OPERAND (fullname
, 1),
5627 /*entering_scope=*/0,
5634 if (!IS_AGGR_TYPE (context
))
5637 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5638 return error_mark_node
;
5641 t
= lookup_field (context
, name
, 0, 1);
5643 return TREE_TYPE (t
);
5647 /* If the CONTEXT is not a template type, then either the field is
5648 there now or its never going to be. */
5649 if (!uses_template_parms (context
))
5652 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5653 return error_mark_node
;
5657 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5660 /* Select the right _DECL from multiple choices. */
5663 select_decl (binding
, flags
)
5668 val
= BINDING_VALUE (binding
);
5670 /* When we implicitly declare some builtin entity, we mark it
5671 DECL_ANTICIPATED, so that we know to ignore it until it is
5673 if (val
&& DECL_P (val
)
5674 && DECL_LANG_SPECIFIC (val
)
5675 && DECL_ANTICIPATED (val
))
5678 if (LOOKUP_NAMESPACES_ONLY (flags
))
5680 /* We are not interested in types. */
5681 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5686 /* If we could have a type and
5687 we have nothing or we need a type and have none. */
5688 if (BINDING_TYPE (binding
)
5689 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5690 && TREE_CODE (val
) != TYPE_DECL
)))
5691 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5692 /* Don't return non-types if we really prefer types. */
5693 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5694 && (TREE_CODE (val
) != TEMPLATE_DECL
5695 || !DECL_CLASS_TEMPLATE_P (val
)))
5701 /* Unscoped lookup of a global: iterate over current namespaces,
5702 considering using-directives. If SPACESP is non-NULL, store a list
5703 of the namespaces we've considered in it. */
5706 unqualified_namespace_lookup (name
, flags
, spacesp
)
5711 tree b
= make_node (CPLUS_BINDING
);
5712 tree initial
= current_decl_namespace();
5713 tree scope
= initial
;
5715 struct binding_level
*level
;
5716 tree val
= NULL_TREE
;
5719 *spacesp
= NULL_TREE
;
5721 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5724 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5725 val
= binding_for_name (name
, scope
);
5727 /* Initialize binding for this context. */
5728 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5729 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5731 /* Add all _DECLs seen through local using-directives. */
5732 for (level
= current_binding_level
;
5733 !level
->namespace_p
;
5734 level
= level
->level_chain
)
5735 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5736 scope
, flags
, spacesp
))
5737 /* Give up because of error. */
5738 return error_mark_node
;
5740 /* Add all _DECLs seen through global using-directives. */
5741 /* XXX local and global using lists should work equally. */
5745 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5746 scope
, flags
, spacesp
))
5747 /* Give up because of error. */
5748 return error_mark_node
;
5749 if (siter
== scope
) break;
5750 siter
= CP_DECL_CONTEXT (siter
);
5753 val
= select_decl (b
, flags
);
5754 if (scope
== global_namespace
)
5760 /* Combine prefer_type and namespaces_only into flags. */
5763 lookup_flags (prefer_type
, namespaces_only
)
5764 int prefer_type
, namespaces_only
;
5766 if (namespaces_only
)
5767 return LOOKUP_PREFER_NAMESPACES
;
5768 if (prefer_type
> 1)
5769 return LOOKUP_PREFER_TYPES
;
5770 if (prefer_type
> 0)
5771 return LOOKUP_PREFER_BOTH
;
5775 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5776 ignore it or not. Subroutine of lookup_name_real. */
5779 qualify_lookup (val
, flags
)
5783 if (val
== NULL_TREE
)
5785 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5787 if ((flags
& LOOKUP_PREFER_TYPES
)
5788 && (TREE_CODE (val
) == TYPE_DECL
5789 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5790 && DECL_CLASS_TEMPLATE_P (val
))))
5792 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5797 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5801 warn_about_implicit_typename_lookup (typename
, binding
)
5805 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5806 tree name
= DECL_NAME (typename
);
5808 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5809 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5810 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5811 && ! (TREE_CODE (binding
) == TYPE_DECL
5812 && same_type_p (TREE_TYPE (binding
), subtype
)))
5814 cp_warning ("lookup of `%D' finds `%#D'",
5816 cp_warning (" instead of `%D' from dependent base class",
5818 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5819 constructor_name (current_class_type
), name
);
5823 /* Look up NAME in the current binding level and its superiors in the
5824 namespace of variables, functions and typedefs. Return a ..._DECL
5825 node of some kind representing its definition if there is only one
5826 such declaration, or return a TREE_LIST with all the overloaded
5827 definitions if there are many, or return 0 if it is undefined.
5829 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5830 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5831 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5832 Otherwise we prefer non-TYPE_DECLs.
5834 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5835 using IDENTIFIER_CLASS_VALUE. */
5838 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5840 int prefer_type
, nonclass
, namespaces_only
;
5843 tree val
= NULL_TREE
;
5845 tree from_obj
= NULL_TREE
;
5847 int val_is_implicit_typename
= 0;
5849 /* Hack: copy flag set by parser, if set. */
5850 if (only_namespace_names
)
5851 namespaces_only
= 1;
5853 if (prefer_type
== -2)
5855 extern int looking_for_typename
;
5856 tree type
= NULL_TREE
;
5859 prefer_type
= looking_for_typename
;
5861 flags
= lookup_flags (prefer_type
, namespaces_only
);
5862 /* If the next thing is '<', class templates are types. */
5863 if (looking_for_template
)
5864 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5866 /* std:: becomes :: for now. */
5867 if (got_scope
&& got_scope
== fake_std_node
)
5868 got_scope
= void_type_node
;
5872 else if (got_object
!= error_mark_node
)
5877 if (type
== error_mark_node
)
5878 return error_mark_node
;
5879 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5880 type
= TREE_TYPE (type
);
5883 type
= complete_type (type
);
5885 if (TREE_CODE (type
) == VOID_TYPE
)
5886 type
= global_namespace
;
5887 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5889 val
= make_node (CPLUS_BINDING
);
5890 flags
|= LOOKUP_COMPLAIN
;
5891 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5893 val
= select_decl (val
, flags
);
5895 else if (! IS_AGGR_TYPE (type
)
5896 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5897 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
5898 || TREE_CODE (type
) == TYPENAME_TYPE
)
5899 /* Someone else will give an error about this if needed. */
5901 else if (type
== current_class_type
)
5902 val
= IDENTIFIER_CLASS_VALUE (name
);
5905 val
= lookup_member (type
, name
, 0, prefer_type
);
5906 type_access_control (type
, val
);
5908 /* Restore the containing TYPENAME_TYPE if we looked
5909 through it before. */
5910 if (got_scope
&& got_scope
!= type
5911 && val
&& TREE_CODE (val
) == TYPE_DECL
5912 && TREE_CODE (TREE_TYPE (val
)) == TYPENAME_TYPE
)
5913 TYPE_CONTEXT (TREE_TYPE (val
)) = got_scope
;
5921 else if (got_object
&& val
)
5929 flags
= lookup_flags (prefer_type
, namespaces_only
);
5930 /* If we're not parsing, we need to complain. */
5931 flags
|= LOOKUP_COMPLAIN
;
5934 /* First, look in non-namespace scopes. */
5936 if (current_class_type
== NULL_TREE
)
5939 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5943 if (!LOCAL_BINDING_P (t
) && nonclass
)
5944 /* We're not looking for class-scoped bindings, so keep going. */
5947 /* If this is the kind of thing we're looking for, we're done. */
5948 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5949 binding
= BINDING_VALUE (t
);
5950 else if ((flags
& LOOKUP_PREFER_TYPES
)
5951 && qualify_lookup (BINDING_TYPE (t
), flags
))
5952 binding
= BINDING_TYPE (t
);
5954 binding
= NULL_TREE
;
5956 /* Handle access control on types from enclosing or base classes. */
5957 if (binding
&& ! yylex
5958 && BINDING_LEVEL (t
) && BINDING_LEVEL (t
)->parm_flag
== 2)
5959 type_access_control (BINDING_LEVEL (t
)->this_class
, binding
);
5962 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5964 if (val_is_implicit_typename
&& !yylex
)
5965 warn_about_implicit_typename_lookup (val
, binding
);
5967 val_is_implicit_typename
5968 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5969 if (!val_is_implicit_typename
)
5974 /* Now lookup in namespace scopes. */
5975 if (!val
|| val_is_implicit_typename
)
5977 t
= unqualified_namespace_lookup (name
, flags
, 0);
5980 if (val_is_implicit_typename
&& !yylex
)
5981 warn_about_implicit_typename_lookup (val
, t
);
5989 /* This should only warn about types used in qualified-ids. */
5990 if (from_obj
&& from_obj
!= val
)
5992 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5993 && TREE_CODE (val
) == TYPE_DECL
5994 && ! same_type_p (TREE_TYPE (from_obj
), TREE_TYPE (val
)))
5996 lookup of `%D' in the scope of `%#T' (`%#T') \
5997 does not match lookup in the current scope (`%#T')",
5998 name
, got_object
, TREE_TYPE (from_obj
),
6001 /* We don't change val to from_obj if got_object depends on
6002 template parms because that breaks implicit typename for
6003 destructor calls. */
6004 if (! uses_template_parms (got_object
))
6008 /* If we have a single function from a using decl, pull it out. */
6009 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
6010 val
= OVL_FUNCTION (val
);
6019 lookup_name_nonclass (name
)
6022 return lookup_name_real (name
, 0, 1, 0);
6026 lookup_function_nonclass (name
, args
)
6030 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
6034 lookup_name_namespace_only (name
)
6037 /* type-or-namespace, nonclass, namespace_only */
6038 return lookup_name_real (name
, 1, 1, 1);
6042 lookup_name (name
, prefer_type
)
6046 return lookup_name_real (name
, prefer_type
, 0, 0);
6049 /* Similar to `lookup_name' but look only in the innermost non-class
6053 lookup_name_current_level (name
)
6056 struct binding_level
*b
;
6059 b
= current_binding_level
;
6060 while (b
->parm_flag
== 2)
6065 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
6067 /* extern "C" function() */
6068 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
6071 else if (IDENTIFIER_BINDING (name
)
6072 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
6076 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
6077 return IDENTIFIER_VALUE (name
);
6089 /* Like lookup_name_current_level, but for types. */
6092 lookup_type_current_level (name
)
6095 register tree t
= NULL_TREE
;
6097 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
6099 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
6100 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
6102 struct binding_level
*b
= current_binding_level
;
6105 if (purpose_member (name
, b
->type_shadowed
))
6106 return REAL_IDENTIFIER_TYPE_VALUE (name
);
6118 begin_only_namespace_names ()
6120 only_namespace_names
= 1;
6124 end_only_namespace_names ()
6126 only_namespace_names
= 0;
6129 /* Push the declarations of builtin types into the namespace.
6130 RID_INDEX is the index of the builtin type
6131 in the array RID_POINTERS. NAME is the name used when looking
6132 up the builtin type. TYPE is the _TYPE node for the builtin type. */
6135 record_builtin_type (rid_index
, name
, type
)
6140 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
6141 tree tdecl
= NULL_TREE
;
6143 if ((int) rid_index
< (int) RID_MAX
)
6144 rname
= ridpointers
[(int) rid_index
];
6146 tname
= get_identifier (name
);
6148 TYPE_BUILT_IN (type
) = 1;
6152 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
6153 set_identifier_type_value (tname
, NULL_TREE
);
6154 if ((int) rid_index
< (int) RID_MAX
)
6155 /* Built-in types live in the global namespace. */
6156 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
6158 if (rname
!= NULL_TREE
)
6160 if (tname
!= NULL_TREE
)
6162 set_identifier_type_value (rname
, NULL_TREE
);
6163 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
6167 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
6168 set_identifier_type_value (rname
, NULL_TREE
);
6173 /* Record one of the standard Java types.
6174 * Declare it as having the given NAME.
6175 * If SIZE > 0, it is the size of one of the integral types;
6176 * otherwise it is the negative of the size of one of the other types. */
6179 record_builtin_java_type (name
, size
)
6185 type
= make_signed_type (size
);
6186 else if (size
> -32)
6187 { /* "__java_char" or ""__java_boolean". */
6188 type
= make_unsigned_type (-size
);
6189 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
6192 { /* "__java_float" or ""__java_double". */
6193 type
= make_node (REAL_TYPE
);
6194 TYPE_PRECISION (type
) = - size
;
6197 record_builtin_type (RID_MAX
, name
, type
);
6198 decl
= TYPE_NAME (type
);
6200 /* Suppress generate debug symbol entries for these types,
6201 since for normal C++ they are just clutter.
6202 However, push_lang_context undoes this if extern "Java" is seen. */
6203 DECL_IGNORED_P (decl
) = 1;
6205 TYPE_FOR_JAVA (type
) = 1;
6209 /* Push a type into the namespace so that the back-ends ignore it. */
6212 record_unknown_type (type
, name
)
6216 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
6217 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
6218 DECL_IGNORED_P (decl
) = 1;
6219 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
6220 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
6221 TYPE_ALIGN (type
) = 1;
6222 TYPE_USER_ALIGN (type
) = 0;
6223 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
6226 /* An string for which we should create an IDENTIFIER_NODE at
6229 typedef struct predefined_identifier
6231 /* The name of the identifier. */
6233 /* The place where the IDENTIFIER_NODE should be stored. */
6235 /* Non-zero if this is the name of a constructor or destructor. */
6237 } predefined_identifier
;
6239 /* Create all the predefined identifiers. */
6242 initialize_predefined_identifiers ()
6244 struct predefined_identifier
*pid
;
6246 /* A table of identifiers to create at startup. */
6247 static predefined_identifier predefined_identifiers
[] = {
6248 { "C++", &lang_name_cplusplus
, 0 },
6249 { "C", &lang_name_c
, 0 },
6250 { "Java", &lang_name_java
, 0 },
6251 { CTOR_NAME
, &ctor_identifier
, 1 },
6252 { "__base_ctor", &base_ctor_identifier
, 1 },
6253 { "__comp_ctor", &complete_ctor_identifier
, 1 },
6254 { DTOR_NAME
, &dtor_identifier
, 1 },
6255 { "__comp_dtor", &complete_dtor_identifier
, 1 },
6256 { "__base_dtor", &base_dtor_identifier
, 1 },
6257 { "__deleting_dtor", &deleting_dtor_identifier
, 1 },
6258 { VTABLE_DELTA2_NAME
, &delta2_identifier
, 0 },
6259 { VTABLE_DELTA_NAME
, &delta_identifier
, 0 },
6260 { IN_CHARGE_NAME
, &in_charge_identifier
, 0 },
6261 { VTABLE_INDEX_NAME
, &index_identifier
, 0 },
6262 { "nelts", &nelts_identifier
, 0 },
6263 { THIS_NAME
, &this_identifier
, 0 },
6264 { VTABLE_PFN_NAME
, &pfn_identifier
, 0 },
6265 { "__pfn_or_delta2", &pfn_or_delta2_identifier
, 0 },
6266 { "_vptr", &vptr_identifier
, 0 },
6267 { "__cp_push_exception", &cp_push_exception_identifier
, 0 },
6268 { "__vtt_parm", &vtt_parm_identifier
, 0 },
6269 { "std", &std_identifier
, 0 },
6273 for (pid
= predefined_identifiers
; pid
->name
; ++pid
)
6275 *pid
->node
= get_identifier (pid
->name
);
6276 if (pid
->ctor_or_dtor_p
)
6277 IDENTIFIER_CTOR_OR_DTOR_P (*pid
->node
) = 1;
6281 /* Create the predefined scalar types of C,
6282 and some nodes representing standard constants (0, 1, (void *)0).
6283 Initialize the global binding level.
6284 Make definitions for built-in primitive functions. */
6287 init_decl_processing ()
6291 /* Check to see that the user did not specify an invalid combination
6292 of command-line options. */
6293 if (flag_new_abi
&& !flag_vtable_thunks
)
6294 fatal ("the new ABI requires vtable thunks");
6296 /* Create all the identifiers we need. */
6297 initialize_predefined_identifiers ();
6299 /* Fill in back-end hooks. */
6300 init_lang_status
= &push_cp_function_context
;
6301 free_lang_status
= &pop_cp_function_context
;
6302 mark_lang_status
= &mark_cp_function_context
;
6303 lang_safe_from_p
= &c_safe_from_p
;
6304 lang_dump_tree
= &cp_dump_tree
;
6305 lang_missing_noreturn_ok_p
= &cp_missing_noreturn_ok_p
;
6311 /* Create the global variables. */
6312 push_to_top_level ();
6314 /* Enter the global namespace. */
6315 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
6316 push_namespace (get_identifier ("::"));
6317 global_namespace
= current_namespace
;
6318 current_lang_name
= NULL_TREE
;
6320 /* Adjust various flags based on command-line settings. */
6321 if (! flag_permissive
&& ! pedantic
)
6322 flag_pedantic_errors
= 1;
6323 if (!flag_no_inline
)
6324 flag_inline_trees
= 1;
6327 current_lang_name
= lang_name_c
;
6329 current_function_decl
= NULL_TREE
;
6330 current_binding_level
= NULL_BINDING_LEVEL
;
6331 free_binding_level
= NULL_BINDING_LEVEL
;
6333 build_common_tree_nodes (flag_signed_char
);
6335 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6336 TREE_TYPE (error_mark_list
) = error_mark_node
;
6338 /* Make the binding_level structure for global names. */
6340 global_binding_level
= current_binding_level
;
6341 /* The global level is the namespace level of ::. */
6342 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6343 declare_namespace_level ();
6345 /* Create the `std' namespace. */
6348 push_namespace (std_identifier
);
6349 std_node
= current_namespace
;
6351 fake_std_node
= error_mark_node
;
6355 fake_std_node
= build_decl (NAMESPACE_DECL
,
6358 pushdecl (fake_std_node
);
6361 c_common_nodes_and_builtins ();
6363 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6364 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6365 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6366 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6367 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6368 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6369 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6370 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6372 integer_two_node
= build_int_2 (2, 0);
6373 TREE_TYPE (integer_two_node
) = integer_type_node
;
6374 integer_three_node
= build_int_2 (3, 0);
6375 TREE_TYPE (integer_three_node
) = integer_type_node
;
6377 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6378 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6379 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6380 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6381 TYPE_PRECISION (boolean_type_node
) = 1;
6382 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6383 boolean_false_node
= build_int_2 (0, 0);
6384 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6385 boolean_true_node
= build_int_2 (1, 0);
6386 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6388 signed_size_zero_node
= build_int_2 (0, 0);
6389 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6391 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6394 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
6398 delta_type_node
= ptrdiff_type_node
;
6399 else if (flag_huge_objects
)
6400 delta_type_node
= long_integer_type_node
;
6402 delta_type_node
= short_integer_type_node
;
6405 vtable_index_type
= ptrdiff_type_node
;
6407 vtable_index_type
= delta_type_node
;
6409 vtt_parm_type
= build_pointer_type (const_ptr_type_node
);
6410 lang_type_promotes_to
= convert_type_from_ellipsis
;
6413 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6415 /* C++ extensions */
6417 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6418 record_unknown_type (unknown_type_node
, "unknown type");
6420 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6421 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6423 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6425 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6427 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6428 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6430 if (flag_vtable_thunks
)
6432 /* Make sure we get a unique function type, so we can give
6433 its pointer type a name. (This wins for gdb.) */
6434 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6435 TREE_TYPE (vfunc_type
) = integer_type_node
;
6436 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6437 layout_type (vfunc_type
);
6439 vtable_entry_type
= build_pointer_type (vfunc_type
);
6443 vtable_entry_type
= make_aggr_type (RECORD_TYPE
);
6444 fields
[0] = build_decl (FIELD_DECL
, delta_identifier
,
6446 fields
[1] = build_decl (FIELD_DECL
, index_identifier
,
6448 fields
[2] = build_decl (FIELD_DECL
, pfn_identifier
,
6450 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6453 /* Make this part of an invisible union. */
6454 fields
[3] = copy_node (fields
[2]);
6455 TREE_TYPE (fields
[3]) = delta_type_node
;
6456 DECL_NAME (fields
[3]) = delta2_identifier
;
6457 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6458 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6459 DECL_SIZE_UNIT (fields
[3]) = TYPE_SIZE_UNIT (delta_type_node
);
6460 TREE_UNSIGNED (fields
[3]) = 0;
6461 TREE_CHAIN (fields
[2]) = fields
[3];
6462 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6465 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6468 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6469 layout_type (vtbl_type_node
);
6470 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6471 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6472 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6473 layout_type (vtbl_ptr_type_node
);
6474 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6478 push_namespace (get_identifier ("__cxxabiv1"));
6479 abi_node
= current_namespace
;
6483 global_type_node
= make_node (LANG_TYPE
);
6484 record_unknown_type (global_type_node
, "global type");
6487 current_lang_name
= lang_name_cplusplus
;
6490 tree bad_alloc_type_node
, newtype
, deltype
;
6492 push_namespace (std_identifier
);
6493 bad_alloc_type_node
= xref_tag
6494 (class_type_node
, get_identifier ("bad_alloc"), 1);
6497 newtype
= build_exception_variant
6498 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6499 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6500 push_cp_library_fn (NEW_EXPR
, newtype
);
6501 push_cp_library_fn (VEC_NEW_EXPR
, newtype
);
6502 global_delete_fndecl
= push_cp_library_fn (DELETE_EXPR
, deltype
);
6503 push_cp_library_fn (VEC_DELETE_EXPR
, deltype
);
6507 = build_library_fn_ptr ((flag_new_abi
6508 ? "__cxa_pure_virtual"
6509 : "__pure_virtual"),
6512 /* Perform other language dependent initializations. */
6513 init_class_processing ();
6514 init_init_processing ();
6515 init_search_processing ();
6516 init_rtti_processing ();
6518 if (flag_exceptions
)
6519 init_exception_processing ();
6522 flag_inline_functions
= 0;
6525 if (! supports_one_only ())
6528 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6529 function_id_node
= get_identifier ("__FUNCTION__");
6530 pretty_function_id_node
= get_identifier ("__PRETTY_FUNCTION__");
6531 func_id_node
= get_identifier ("__func__");
6533 make_fname_decl
= cp_make_fname_decl
;
6534 declare_function_name ();
6536 /* Prepare to check format strings against argument lists. */
6537 init_function_format_info ();
6539 /* Show we use EH for cleanups. */
6540 using_eh_for_cleanups ();
6542 valid_lang_attribute
= cp_valid_lang_attribute
;
6544 /* Maintain consistency. Perhaps we should just complain if they
6545 say -fwritable-strings? */
6546 if (flag_writable_strings
)
6547 flag_const_strings
= 0;
6549 /* Add GC roots for all of our global variables. */
6550 ggc_add_tree_root (c_global_trees
, sizeof c_global_trees
/ sizeof(tree
));
6551 ggc_add_tree_root (cp_global_trees
, sizeof cp_global_trees
/ sizeof(tree
));
6552 ggc_add_tree_root (&integer_three_node
, 1);
6553 ggc_add_tree_root (&integer_two_node
, 1);
6554 ggc_add_tree_root (&signed_size_zero_node
, 1);
6555 ggc_add_tree_root (&size_one_node
, 1);
6556 ggc_add_tree_root (&size_zero_node
, 1);
6557 ggc_add_root (&global_binding_level
, 1, sizeof global_binding_level
,
6558 mark_binding_level
);
6559 ggc_add_root (&scope_chain
, 1, sizeof scope_chain
, &mark_saved_scope
);
6560 ggc_add_tree_root (&static_ctors
, 1);
6561 ggc_add_tree_root (&static_dtors
, 1);
6562 ggc_add_tree_root (&lastiddecl
, 1);
6564 ggc_add_tree_root (&last_function_parm_tags
, 1);
6565 ggc_add_tree_root (¤t_function_return_value
, 1);
6566 ggc_add_tree_root (¤t_function_parm_tags
, 1);
6567 ggc_add_tree_root (&last_function_parms
, 1);
6568 ggc_add_tree_root (&error_mark_list
, 1);
6570 ggc_add_tree_root (&global_namespace
, 1);
6571 ggc_add_tree_root (&global_type_node
, 1);
6572 ggc_add_tree_root (&anonymous_namespace_name
, 1);
6574 ggc_add_tree_root (&got_object
, 1);
6575 ggc_add_tree_root (&got_scope
, 1);
6577 ggc_add_tree_root (¤t_lang_name
, 1);
6578 ggc_add_tree_root (&static_aggregates
, 1);
6579 ggc_add_tree_root (&free_bindings
, 1);
6582 /* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the
6583 decl, NAME is the initialization string and TYPE_DEP indicates whether
6584 NAME depended on the type of the function. We make use of that to detect
6585 __PRETTY_FUNCTION__ inside a template fn. Because we build a tree for
6586 the function before emitting any of it, we don't need to treat the
6587 VAR_DECL specially. We can decide whether to emit it later, if it was
6591 cp_make_fname_decl (id
, name
, type_dep
)
6596 tree decl
, type
, init
;
6597 size_t length
= strlen (name
);
6598 tree domain
= NULL_TREE
;
6600 if (!processing_template_decl
)
6603 domain
= build_index_type (size_int (length
));
6605 type
= build_cplus_array_type
6606 (build_qualified_type (char_type_node
, TYPE_QUAL_CONST
),
6609 decl
= build_decl (VAR_DECL
, id
, type
);
6610 TREE_STATIC (decl
) = 1;
6611 TREE_READONLY (decl
) = 1;
6612 DECL_SOURCE_LINE (decl
) = 0;
6613 DECL_ARTIFICIAL (decl
) = 1;
6614 DECL_IN_SYSTEM_HEADER (decl
) = 1;
6616 if (processing_template_decl
)
6617 decl
= push_template_decl (decl
);
6620 init
= build (FUNCTION_NAME
, type
);
6621 DECL_PRETTY_FUNCTION_P (decl
) = 1;
6625 init
= build_string (length
+ 1, name
);
6626 TREE_TYPE (init
) = type
;
6628 DECL_INITIAL (decl
) = init
;
6629 cp_finish_decl (decl
, init
, NULL_TREE
, LOOKUP_ONLYCONVERTING
);
6631 /* We will have to make sure we only emit this, if it is actually used. */
6635 /* Entry point for the benefit of c_common_nodes_and_builtins.
6637 Make a definition for a builtin function named NAME and whose data type
6638 is TYPE. TYPE should be a function type with argument types.
6640 CLASS and CODE tell later passes how to compile calls to this function.
6641 See tree.h for possible values.
6643 If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6644 the name to be called if we can't opencode the function. */
6647 builtin_function (name
, type
, code
, class, libname
)
6651 enum built_in_class
class;
6652 const char *libname
;
6654 tree decl
= build_library_fn_1 (get_identifier (name
), ERROR_MARK
, type
);
6655 DECL_BUILT_IN_CLASS (decl
) = class;
6656 DECL_FUNCTION_CODE (decl
) = code
;
6658 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6660 /* All builtins that don't begin with an `_' should go in the `std'
6662 if (flag_honor_std
&& name
[0] != '_')
6664 push_namespace (std_identifier
);
6665 DECL_CONTEXT (decl
) = std_node
;
6668 if (flag_honor_std
&& name
[0] != '_')
6671 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6672 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6673 function in the namespace. */
6675 DECL_ASSEMBLER_NAME (decl
) = get_identifier (libname
);
6676 make_decl_rtl (decl
, NULL
);
6678 /* Warn if a function in the namespace for users
6679 is used without an occasion to consider it declared. */
6680 if (name
[0] != '_' || name
[1] != '_')
6681 DECL_ANTICIPATED (decl
) = 1;
6686 /* Generate a FUNCTION_DECL with the typical flags for a runtime library
6687 function. Not called directly. */
6690 build_library_fn_1 (name
, operator_code
, type
)
6692 enum tree_code operator_code
;
6695 tree fn
= build_lang_decl (FUNCTION_DECL
, name
, type
);
6696 DECL_EXTERNAL (fn
) = 1;
6697 TREE_PUBLIC (fn
) = 1;
6698 DECL_ARTIFICIAL (fn
) = 1;
6699 TREE_NOTHROW (fn
) = 1;
6700 SET_OVERLOADED_OPERATOR_CODE (fn
, operator_code
);
6704 /* Returns the _DECL for a library function with C linkage.
6705 We assume that such functions never throw; if this is incorrect,
6706 callers should unset TREE_NOTHROW. */
6709 build_library_fn (name
, type
)
6713 tree fn
= build_library_fn_1 (name
, ERROR_MARK
, type
);
6714 make_decl_rtl (fn
, NULL
);
6718 /* Returns the _DECL for a library function with C++ linkage. */
6721 build_cp_library_fn (name
, operator_code
, type
)
6723 enum tree_code operator_code
;
6726 tree fn
= build_library_fn_1 (name
, operator_code
, type
);
6727 TREE_NOTHROW (fn
) = TYPE_NOTHROW_P (type
);
6728 DECL_CONTEXT (fn
) = FROB_CONTEXT (current_namespace
);
6729 set_mangled_name_for_decl (fn
);
6730 make_decl_rtl (fn
, NULL
);
6734 /* Like build_library_fn, but takes a C string instead of an
6738 build_library_fn_ptr (name
, type
)
6742 return build_library_fn (get_identifier (name
), type
);
6745 /* Like build_cp_library_fn, but takes a C string instead of an
6749 build_cp_library_fn_ptr (name
, type
)
6753 return build_cp_library_fn (get_identifier (name
), ERROR_MARK
, type
);
6756 /* Like build_library_fn, but also pushes the function so that we will
6757 be able to find it via IDENTIFIER_GLOBAL_VALUE. */
6760 push_library_fn (name
, type
)
6763 tree fn
= build_library_fn (name
, type
);
6764 pushdecl_top_level (fn
);
6768 /* Like build_cp_library_fn, but also pushes the function so that it
6769 will be found by normal lookup. */
6772 push_cp_library_fn (operator_code
, type
)
6773 enum tree_code operator_code
;
6776 tree fn
= build_cp_library_fn (ansi_opname (operator_code
),
6783 /* Like push_library_fn, but takes a TREE_LIST of parm types rather than
6787 push_void_library_fn (name
, parmtypes
)
6788 tree name
, parmtypes
;
6790 tree type
= build_function_type (void_type_node
, parmtypes
);
6791 return push_library_fn (name
, type
);
6794 /* Like push_library_fn, but also note that this function throws
6795 and does not return. Used for __throw_foo and the like. */
6798 push_throw_library_fn (name
, type
)
6801 tree fn
= push_library_fn (name
, type
);
6802 TREE_THIS_VOLATILE (fn
) = 1;
6803 TREE_NOTHROW (fn
) = 0;
6807 /* When we call finish_struct for an anonymous union, we create
6808 default copy constructors and such. But, an anonymous union
6809 shouldn't have such things; this function undoes the damage to the
6810 anonymous union type T.
6812 (The reason that we create the synthesized methods is that we don't
6813 distinguish `union { int i; }' from `typedef union { int i; } U'.
6814 The first is an anonymous union; the second is just an ordinary
6818 fixup_anonymous_aggr (t
)
6823 /* Wipe out memory of synthesized methods */
6824 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6825 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6826 TYPE_HAS_INIT_REF (t
) = 0;
6827 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6828 TYPE_HAS_ASSIGN_REF (t
) = 0;
6829 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6831 /* Splice the implicitly generated functions out of the TYPE_METHODS
6833 q
= &TYPE_METHODS (t
);
6836 if (DECL_ARTIFICIAL (*q
))
6837 *q
= TREE_CHAIN (*q
);
6839 q
= &TREE_CHAIN (*q
);
6842 /* ISO C++ 9.5.3. Anonymous unions may not have function members. */
6843 if (TYPE_METHODS (t
))
6844 cp_error_at ("an anonymous union cannot have function members", t
);
6847 /* Make sure that a declaration with no declarator is well-formed, i.e.
6848 just defines a tagged type or anonymous union.
6850 Returns the type defined, if any. */
6853 check_tag_decl (declspecs
)
6858 tree ob_modifier
= NULL_TREE
;
6860 register tree t
= NULL_TREE
;
6862 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6864 register tree value
= TREE_VALUE (link
);
6867 || (TREE_CODE (value
) == IDENTIFIER_NODE
6868 && IDENTIFIER_GLOBAL_VALUE (value
)
6869 && TYPE_P (IDENTIFIER_GLOBAL_VALUE (value
))))
6873 if ((TREE_CODE (value
) != TYPENAME_TYPE
&& IS_AGGR_TYPE (value
))
6874 || TREE_CODE (value
) == ENUMERAL_TYPE
)
6876 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6880 else if (value
== ridpointers
[(int) RID_FRIEND
])
6882 if (current_class_type
== NULL_TREE
6883 || current_scope () != current_class_type
)
6884 ob_modifier
= value
;
6888 else if (value
== ridpointers
[(int) RID_STATIC
]
6889 || value
== ridpointers
[(int) RID_EXTERN
]
6890 || value
== ridpointers
[(int) RID_AUTO
]
6891 || value
== ridpointers
[(int) RID_REGISTER
]
6892 || value
== ridpointers
[(int) RID_INLINE
]
6893 || value
== ridpointers
[(int) RID_VIRTUAL
]
6894 || value
== ridpointers
[(int) RID_CONST
]
6895 || value
== ridpointers
[(int) RID_VOLATILE
]
6896 || value
== ridpointers
[(int) RID_EXPLICIT
])
6897 ob_modifier
= value
;
6901 error ("multiple types in one declaration");
6903 if (t
== NULL_TREE
&& ! saw_friend
)
6904 pedwarn ("declaration does not declare anything");
6906 /* Check for an anonymous union. We're careful
6907 accessing TYPE_IDENTIFIER because some built-in types, like
6908 pointer-to-member types, do not have TYPE_NAME. */
6909 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
6911 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
6913 /* Anonymous unions are objects, so they can have specifiers. */;
6914 SET_ANON_AGGR_TYPE_P (t
);
6916 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
6917 pedwarn ("ISO C++ prohibits anonymous structs");
6920 else if (ob_modifier
)
6922 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
6923 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
6924 cp_error ("`%D' can only be specified for functions", ob_modifier
);
6925 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
6926 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
6927 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
6928 cp_error ("`%D' can only be specified for constructors",
6931 cp_error ("`%D' can only be specified for objects and functions",
6938 /* Called when a declaration is seen that contains no names to declare.
6939 If its type is a reference to a structure, union or enum inherited
6940 from a containing scope, shadow that tag name for the current scope
6941 with a forward reference.
6942 If its type defines a new named structure or union
6943 or defines an enum, it is valid but we need not do anything here.
6944 Otherwise, it is an error.
6946 C++: may have to grok the declspecs to learn about static,
6947 complain for anonymous unions. */
6950 shadow_tag (declspecs
)
6953 tree t
= check_tag_decl (declspecs
);
6956 maybe_process_partial_specialization (t
);
6958 /* This is where the variables in an anonymous union are
6959 declared. An anonymous union declaration looks like:
6961 because there is no declarator after the union, the parser
6962 sends that declaration here. */
6963 if (t
&& ANON_AGGR_TYPE_P (t
))
6965 fixup_anonymous_aggr (t
);
6967 if (TYPE_FIELDS (t
))
6969 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
6971 finish_anon_union (decl
);
6976 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6979 groktypename (typename
)
6982 if (TREE_CODE (typename
) != TREE_LIST
)
6984 return grokdeclarator (TREE_VALUE (typename
),
6985 TREE_PURPOSE (typename
),
6986 TYPENAME
, 0, NULL_TREE
);
6989 /* Decode a declarator in an ordinary declaration or data definition.
6990 This is called as soon as the type information and variable name
6991 have been parsed, before parsing the initializer if any.
6992 Here we create the ..._DECL node, fill in its type,
6993 and put it on the list of decls for the current context.
6994 The ..._DECL node is returned as the value.
6996 Exception: for arrays where the length is not specified,
6997 the type is left null, to be filled in by `cp_finish_decl'.
6999 Function definitions do not come here; they go to start_function
7000 instead. However, external and forward declarations of functions
7001 do go through here. Structure field declarations are done by
7002 grokfield and not through here. */
7005 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
7006 tree declarator
, declspecs
;
7008 tree attributes
, prefix_attributes
;
7011 register tree type
, tem
;
7013 extern int have_extern_spec
;
7014 extern int used_extern_spec
;
7018 /* See code below that used this. */
7019 int init_written
= initialized
;
7022 /* This should only be done once on the top most decl. */
7023 if (have_extern_spec
&& !used_extern_spec
)
7025 declspecs
= tree_cons (NULL_TREE
, get_identifier ("extern"),
7027 used_extern_spec
= 1;
7030 if (attributes
|| prefix_attributes
)
7031 attrlist
= build_tree_list (attributes
, prefix_attributes
);
7033 attrlist
= NULL_TREE
;
7035 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
7038 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
7041 type
= TREE_TYPE (decl
);
7043 if (type
== error_mark_node
)
7046 context
= DECL_CONTEXT (decl
);
7048 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
7049 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
7051 /* When parsing the initializer, lookup should use the object's
7053 push_decl_namespace (context
);
7056 /* We are only interested in class contexts, later. */
7057 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
7058 context
= NULL_TREE
;
7061 /* Is it valid for this decl to have an initializer at all?
7062 If not, set INITIALIZED to zero, which will indirectly
7063 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7064 switch (TREE_CODE (decl
))
7067 /* typedef foo = bar means give foo the same type as bar.
7068 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
7069 Any other case of an initialization in a TYPE_DECL is an error. */
7070 if (pedantic
|| list_length (declspecs
) > 1)
7072 cp_error ("typedef `%D' is initialized", decl
);
7078 cp_error ("function `%#D' is initialized like a variable", decl
);
7088 if (! toplevel_bindings_p ()
7089 && DECL_EXTERNAL (decl
))
7090 cp_warning ("declaration of `%#D' has `extern' and is initialized",
7092 DECL_EXTERNAL (decl
) = 0;
7093 if (toplevel_bindings_p ())
7094 TREE_STATIC (decl
) = 1;
7096 /* Tell `pushdecl' this is an initialized decl
7097 even though we don't yet have the initializer expression.
7098 Also tell `cp_finish_decl' it may store the real initializer. */
7099 DECL_INITIAL (decl
) = error_mark_node
;
7102 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
7103 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
7106 /* Set attributes here so if duplicate decl, will have proper attributes. */
7107 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
7109 if (context
&& COMPLETE_TYPE_P (complete_type (context
)))
7111 push_nested_class (context
, 2);
7113 if (TREE_CODE (decl
) == VAR_DECL
)
7115 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
7116 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
7117 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
7120 if (DECL_CONTEXT (field
) != context
)
7122 cp_pedwarn ("ISO C++ does not permit `%T::%D' to be defined as `%T::%D'",
7123 DECL_CONTEXT (field
), DECL_NAME (decl
),
7124 context
, DECL_NAME (decl
));
7125 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
7127 /* Static data member are tricky; an in-class initialization
7128 still doesn't provide a definition, so the in-class
7129 declaration will have DECL_EXTERNAL set, but will have an
7130 initialization. Thus, duplicate_decls won't warn
7131 about this situation, and so we check here. */
7132 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
7133 cp_error ("duplicate initialization of %D", decl
);
7134 if (duplicate_decls (decl
, field
))
7140 tree field
= check_classfn (context
, decl
);
7141 if (field
&& duplicate_decls (decl
, field
))
7145 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
7146 DECL_IN_AGGR_P (decl
) = 0;
7147 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
7148 || CLASSTYPE_TEMPLATE_INSTANTIATION (context
))
7150 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
7151 /* [temp.expl.spec] An explicit specialization of a static data
7152 member of a template is a definition if the declaration
7153 includes an initializer; otherwise, it is a declaration.
7155 We check for processing_specialization so this only applies
7156 to the new specialization syntax. */
7157 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
7158 DECL_EXTERNAL (decl
) = 1;
7161 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
7162 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
7166 /* Enter this declaration into the symbol table. */
7167 tem
= maybe_push_decl (decl
);
7169 if (processing_template_decl
)
7170 tem
= push_template_decl (tem
);
7172 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7173 /* Tell the back-end to use or not use .common as appropriate. If we say
7174 -fconserve-space, we want this to save .data space, at the expense of
7175 wrong semantics. If we say -fno-conserve-space, we want this to
7176 produce errors about redefs; to do this we force variables into the
7178 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
7181 if (! processing_template_decl
)
7191 tree type
= TREE_TYPE (decl
);
7192 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
7194 if (type
== error_mark_node
)
7197 /* If this type of object needs a cleanup, but we're not allowed to
7198 add any more objects with cleanups to the current scope, create a
7199 new binding level. */
7200 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
7201 && current_binding_level
->more_cleanups_ok
== 0)
7203 keep_next_level (2);
7206 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/1);
7210 /* Is it valid for this decl to have an initializer at all?
7211 If not, set INITIALIZED to zero, which will indirectly
7212 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7214 /* Don't allow initializations for incomplete types except for
7215 arrays which might be completed by the initialization. */
7216 if (COMPLETE_TYPE_P (complete_type (type
)))
7217 ; /* A complete type is ok. */
7218 else if (TREE_CODE (type
) != ARRAY_TYPE
)
7220 cp_error ("variable `%#D' has initializer but incomplete type",
7223 type
= TREE_TYPE (decl
) = error_mark_node
;
7225 else if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (type
))))
7227 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
7228 cp_error ("elements of array `%#D' have incomplete type", decl
);
7229 /* else we already gave an error in start_decl. */
7235 && TREE_CODE (decl
) != TYPE_DECL
7236 && TREE_CODE (decl
) != TEMPLATE_DECL
7237 && type
!= error_mark_node
7238 && IS_AGGR_TYPE (type
)
7239 && ! DECL_EXTERNAL (decl
))
7241 if ((! processing_template_decl
|| ! uses_template_parms (type
))
7242 && !COMPLETE_TYPE_P (complete_type (type
)))
7244 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
7246 /* Change the type so that assemble_variable will give
7247 DECL an rtl we can live with: (mem (const_int 0)). */
7248 type
= TREE_TYPE (decl
) = error_mark_node
;
7252 /* If any base type in the hierarchy of TYPE needs a constructor,
7253 then we set initialized to 1. This way any nodes which are
7254 created for the purposes of initializing this aggregate
7255 will live as long as it does. This is necessary for global
7256 aggregates which do not have their initializers processed until
7257 the end of the file. */
7258 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
7263 DECL_INITIAL (decl
) = NULL_TREE
;
7266 /* Handle initialization of references.
7267 These three arguments are from `cp_finish_decl', and have the
7268 same meaning here that they do there.
7270 Quotes on semantics can be found in ARM 8.4.3. */
7273 grok_reference_init (decl
, type
, init
)
7274 tree decl
, type
, init
;
7278 if (init
== NULL_TREE
)
7280 if ((DECL_LANG_SPECIFIC (decl
) == 0
7281 || DECL_IN_AGGR_P (decl
) == 0)
7282 && ! DECL_THIS_EXTERN (decl
))
7283 cp_error ("`%D' declared as reference but not initialized", decl
);
7287 if (init
== error_mark_node
)
7290 if (TREE_CODE (init
) == CONSTRUCTOR
)
7292 cp_error ("ISO C++ forbids use of initializer list to initialize reference `%D'", decl
);
7296 if (TREE_CODE (init
) == TREE_LIST
)
7297 init
= build_compound_expr (init
);
7299 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
7300 init
= convert_from_reference (init
);
7302 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
7303 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
7305 /* Note: default conversion is only called in very special cases. */
7306 init
= default_conversion (init
);
7309 /* Convert INIT to the reference type TYPE. This may involve the
7310 creation of a temporary, whose lifetime must be the same as that
7311 of the reference. If so, a DECL_STMT for the temporary will be
7312 added just after the DECL_STMT for DECL. That's why we don't set
7313 DECL_INITIAL for local references (instead assigning to them
7314 explicitly); we need to allow the temporary to be initialized
7316 tmp
= convert_to_reference
7317 (type
, init
, CONV_IMPLICIT
,
7318 LOOKUP_ONLYCONVERTING
|LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
,
7321 if (tmp
== error_mark_node
)
7323 else if (tmp
!= NULL_TREE
)
7326 tmp
= save_expr (tmp
);
7327 if (building_stmt_tree ())
7329 /* Initialize the declaration. */
7330 tmp
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, tmp
);
7331 finish_expr_stmt (tmp
);
7334 DECL_INITIAL (decl
) = tmp
;
7338 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7342 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
7344 expand_static_init (decl
, DECL_INITIAL (decl
));
7345 DECL_INITIAL (decl
) = NULL_TREE
;
7350 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7351 mucking with forces it does not comprehend (i.e. initialization with a
7352 constructor). If we are at global scope and won't go into COMMON, fill
7353 it in with a dummy CONSTRUCTOR to force the variable into .data;
7354 otherwise we can use error_mark_node. */
7357 obscure_complex_init (decl
, init
)
7360 if (! flag_no_inline
&& TREE_STATIC (decl
))
7362 if (extract_init (decl
, init
))
7366 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7367 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7368 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7372 DECL_INITIAL (decl
) = error_mark_node
;
7377 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7378 array until we finish parsing the initializer. If that's the
7379 situation we're in, update DECL accordingly. */
7382 maybe_deduce_size_from_array_init (decl
, init
)
7386 tree type
= TREE_TYPE (decl
);
7388 if (TREE_CODE (type
) == ARRAY_TYPE
7389 && TYPE_DOMAIN (type
) == NULL_TREE
7390 && TREE_CODE (decl
) != TYPE_DECL
)
7392 /* do_default is really a C-ism to deal with tentative definitions.
7393 But let's leave it here to ease the eventual merge. */
7394 int do_default
= !DECL_EXTERNAL (decl
);
7395 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7396 int failure
= complete_array_type (type
, initializer
, do_default
);
7399 cp_error ("initializer fails to determine size of `%D'", decl
);
7404 cp_error ("array size missing in `%D'", decl
);
7405 /* If a `static' var's size isn't known, make it extern as
7406 well as static, so it does not get allocated. If it's not
7407 `static', then don't mark it extern; finish_incomplete_decl
7408 will give it a default size and it will get allocated. */
7409 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7410 DECL_EXTERNAL (decl
) = 1;
7413 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7414 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7416 cp_error ("zero-size array `%D'", decl
);
7418 layout_decl (decl
, 0);
7422 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7423 any appropriate error messages regarding the layout. */
7426 layout_var_decl (decl
)
7429 tree type
= TREE_TYPE (decl
);
7431 tree ttype
= target_type (type
);
7434 /* If we haven't already layed out this declaration, do so now.
7435 Note that we must not call complete type for an external object
7436 because it's type might involve templates that we are not
7437 supposed to isntantiate yet. (And it's perfectly legal to say
7438 `extern X x' for some incomplete type `X'.) */
7439 if (!DECL_EXTERNAL (decl
))
7440 complete_type (type
);
7441 if (!DECL_SIZE (decl
) && COMPLETE_TYPE_P (type
))
7442 layout_decl (decl
, 0);
7444 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7446 /* An automatic variable with an incomplete type: that is an error.
7447 Don't talk about array types here, since we took care of that
7448 message in grokdeclarator. */
7449 cp_error ("storage size of `%D' isn't known", decl
);
7450 TREE_TYPE (decl
) = error_mark_node
;
7453 /* Keep this code around in case we later want to control debug info
7454 based on whether a type is "used". (jason 1999-11-11) */
7456 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7457 /* Let debugger know it should output info for this type. */
7458 note_debug_info_needed (ttype
);
7460 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7461 note_debug_info_needed (DECL_CONTEXT (decl
));
7464 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7465 && DECL_SIZE (decl
) != NULL_TREE
7466 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7468 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7469 constant_expression_warning (DECL_SIZE (decl
));
7471 cp_error ("storage size of `%D' isn't constant", decl
);
7475 /* If a local static variable is declared in an inline function, or if
7476 we have a weak definition, we must endeavor to create only one
7477 instance of the variable at link-time. */
7480 maybe_commonize_var (decl
)
7483 /* Static data in a function with comdat linkage also has comdat
7485 if (TREE_STATIC (decl
)
7486 /* Don't mess with __FUNCTION__. */
7487 && ! DECL_ARTIFICIAL (decl
)
7488 && current_function_decl
7489 && DECL_CONTEXT (decl
) == current_function_decl
7490 && (DECL_THIS_INLINE (current_function_decl
)
7491 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7492 && TREE_PUBLIC (current_function_decl
))
7494 /* Rather than try to get this right with inlining, we suppress
7495 inlining of such functions. */
7496 current_function_cannot_inline
7497 = "function with static variable cannot be inline";
7498 DECL_UNINLINABLE (current_function_decl
) = 1;
7500 /* If flag_weak, we don't need to mess with this, as we can just
7501 make the function weak, and let it refer to its unique local
7502 copy. This works because we don't allow the function to be
7506 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7508 TREE_PUBLIC (decl
) = 1;
7509 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7511 else if (DECL_INITIAL (decl
) == NULL_TREE
7512 || DECL_INITIAL (decl
) == error_mark_node
)
7514 TREE_PUBLIC (decl
) = 1;
7515 DECL_COMMON (decl
) = 1;
7517 /* else we lose. We can only do this if we can use common,
7518 which we can't if it has been initialized. */
7520 if (TREE_PUBLIC (decl
))
7521 DECL_ASSEMBLER_NAME (decl
)
7522 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7525 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7526 cp_warning_at (" you can work around this by removing the initializer", decl
);
7530 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7531 /* Set it up again; we might have set DECL_INITIAL since the last
7533 comdat_linkage (decl
);
7536 /* Issue an error message if DECL is an uninitialized const variable. */
7539 check_for_uninitialized_const_var (decl
)
7542 tree type
= TREE_TYPE (decl
);
7544 /* ``Unless explicitly declared extern, a const object does not have
7545 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7547 if (TREE_CODE (decl
) == VAR_DECL
7548 && TREE_CODE (type
) != REFERENCE_TYPE
7549 && CP_TYPE_CONST_P (type
)
7550 && !TYPE_NEEDS_CONSTRUCTING (type
)
7551 && !DECL_INITIAL (decl
))
7552 cp_error ("uninitialized const `%D'", decl
);
7555 /* Verify INIT (the initializer for DECL), and record the
7556 initialization in DECL_INITIAL, if appropriate. Returns a new
7560 check_initializer (decl
, init
)
7566 if (TREE_CODE (decl
) == FIELD_DECL
)
7569 type
= TREE_TYPE (decl
);
7571 /* If `start_decl' didn't like having an initialization, ignore it now. */
7572 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7575 /* Check the initializer. */
7578 /* Things that are going to be initialized need to have complete
7580 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7582 if (type
== error_mark_node
)
7583 /* We will have already complained. */
7585 else if (COMPLETE_TYPE_P (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7587 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7590 else if (TREE_CODE (type
) == ARRAY_TYPE
7591 && !COMPLETE_TYPE_P (TREE_TYPE (type
)))
7593 cp_error ("elements of array `%#D' have incomplete type", decl
);
7596 else if (!COMPLETE_TYPE_P (type
))
7598 cp_error ("`%D' has incomplete type", decl
);
7599 TREE_TYPE (decl
) = error_mark_node
;
7604 if (TREE_CODE (decl
) == CONST_DECL
)
7606 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7608 DECL_INITIAL (decl
) = init
;
7610 /* This will keep us from needing to worry about our obstacks. */
7611 my_friendly_assert (init
!= NULL_TREE
, 149);
7614 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7616 if (TREE_STATIC (decl
))
7617 make_decl_rtl (decl
, NULL_PTR
);
7618 grok_reference_init (decl
, type
, init
);
7623 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7625 if (TREE_CODE (type
) == ARRAY_TYPE
)
7626 init
= digest_init (type
, init
, (tree
*) 0);
7627 else if (TREE_CODE (init
) == CONSTRUCTOR
7628 && TREE_HAS_CONSTRUCTOR (init
))
7630 if (TYPE_NON_AGGREGATE_CLASS (type
))
7632 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7634 init
= error_mark_node
;
7637 goto dont_use_constructor
;
7642 dont_use_constructor
:
7643 if (TREE_CODE (init
) != TREE_VEC
)
7644 init
= store_init_value (decl
, init
);
7648 /* We must hide the initializer so that expand_decl
7649 won't try to do something it does not understand. */
7650 init
= obscure_complex_init (decl
, init
);
7652 else if (DECL_EXTERNAL (decl
))
7654 else if (TYPE_P (type
)
7655 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7657 tree core_type
= strip_array_types (type
);
7659 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7661 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7662 cp_error ("structure `%D' with uninitialized const members", decl
);
7663 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7664 cp_error ("structure `%D' with uninitialized reference members",
7668 check_for_uninitialized_const_var (decl
);
7670 if (COMPLETE_TYPE_P (type
) && TYPE_NEEDS_CONSTRUCTING (type
))
7671 init
= obscure_complex_init (decl
, NULL_TREE
);
7675 check_for_uninitialized_const_var (decl
);
7680 /* If DECL is not a local variable, give it RTL. */
7683 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
7686 const char *asmspec
;
7688 int toplev
= toplevel_bindings_p ();
7691 /* Handle non-variables up front. */
7692 if (TREE_CODE (decl
) != VAR_DECL
)
7694 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7698 /* If we see a class member here, it should be a static data
7700 if (DECL_LANG_SPECIFIC (decl
) && DECL_IN_AGGR_P (decl
))
7702 my_friendly_assert (TREE_STATIC (decl
), 19990828);
7703 /* An in-class declaration of a static data member should be
7704 external; it is only a declaration, and not a definition. */
7705 if (init
== NULL_TREE
)
7706 my_friendly_assert (DECL_EXTERNAL (decl
), 20000723);
7709 /* Set the DECL_ASSEMBLER_NAME for the variable. */
7711 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7713 /* We don't create any RTL for local variables. */
7714 if (DECL_FUNCTION_SCOPE_P (decl
) && !TREE_STATIC (decl
))
7717 /* We defer emission of local statics until the corresponding
7718 DECL_STMT is expanded. */
7719 defer_p
= DECL_FUNCTION_SCOPE_P (decl
) || DECL_VIRTUAL_P (decl
);
7721 /* We try to defer namespace-scope static constants so that they are
7722 not emitted into the object file unncessarily. */
7723 if (!DECL_VIRTUAL_P (decl
)
7724 && TREE_READONLY (decl
)
7725 && DECL_INITIAL (decl
) != NULL_TREE
7726 && DECL_INITIAL (decl
) != error_mark_node
7727 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
))
7729 && !TREE_PUBLIC (decl
))
7731 /* Fool with the linkage according to #pragma interface. */
7732 if (!interface_unknown
)
7734 TREE_PUBLIC (decl
) = 1;
7735 DECL_EXTERNAL (decl
) = interface_only
;
7741 /* If we're deferring the variable, just make RTL. Do not actually
7742 emit the variable. */
7744 make_decl_rtl (decl
, asmspec
);
7745 /* If we're not deferring, go ahead and assemble the variable. */
7747 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7750 /* The old ARM scoping rules injected variables declared in the
7751 initialization statement of a for-statement into the surrounding
7752 scope. We support this usage, in order to be backward-compatible.
7753 DECL is a just-declared VAR_DECL; if necessary inject its
7754 declaration into the surrounding scope. */
7757 maybe_inject_for_scope_var (decl
)
7760 if (!DECL_NAME (decl
))
7763 if (current_binding_level
->is_for_scope
)
7765 struct binding_level
*outer
7766 = current_binding_level
->level_chain
;
7768 /* Check to see if the same name is already bound at the outer
7769 level, either because it was directly declared, or because a
7770 dead for-decl got preserved. In either case, the code would
7771 not have been valid under the ARM scope rules, so clear
7772 is_for_scope for the current_binding_level.
7774 Otherwise, we need to preserve the temp slot for decl to last
7775 into the outer binding level. */
7778 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7780 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7781 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7783 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7785 BINDING_VALUE (outer_binding
)
7786 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7787 current_binding_level
->is_for_scope
= 0;
7789 else if (DECL_IN_MEMORY_P (decl
))
7790 preserve_temp_slots (DECL_RTL (decl
));
7794 /* Generate code to initialize DECL (a local variable). */
7797 initialize_local_var (decl
, init
, flags
)
7802 tree type
= TREE_TYPE (decl
);
7804 /* If the type is bogus, don't bother initializing the variable. */
7805 if (type
== error_mark_node
)
7808 if (DECL_SIZE (decl
) == NULL_TREE
&& !TREE_STATIC (decl
))
7810 /* If we used it already as memory, it must stay in memory. */
7811 DECL_INITIAL (decl
) = NULL_TREE
;
7812 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7815 /* Local statics are handled differently from ordinary automatic
7817 if (TREE_STATIC (decl
))
7819 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7820 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7821 expand_static_init (decl
, init
);
7825 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7829 /* Compute and store the initial value. */
7830 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7832 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7834 int saved_stmts_are_full_exprs_p
;
7836 my_friendly_assert (building_stmt_tree (), 20000906);
7837 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p ();
7838 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
7839 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7840 current_stmt_tree ()->stmts_are_full_exprs_p
=
7841 saved_stmts_are_full_exprs_p
;
7844 /* Set this to 0 so we can tell whether an aggregate which was
7845 initialized was ever used. Don't do this if it has a
7846 destructor, so we don't complain about the 'resource
7847 allocation is initialization' idiom. Now set
7848 attribute((unused)) on types so decls of that type will be
7849 marked used. (see TREE_USED, above.) */
7850 if (TYPE_NEEDS_CONSTRUCTING (type
)
7852 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type
)
7853 && DECL_NAME (decl
))
7854 TREE_USED (decl
) = 0;
7855 else if (already_used
)
7856 TREE_USED (decl
) = 1;
7860 /* Generate code to destroy DECL (a local variable). */
7863 destroy_local_var (decl
)
7866 tree type
= TREE_TYPE (decl
);
7869 /* Only variables get cleaned up. */
7870 if (TREE_CODE (decl
) != VAR_DECL
)
7873 /* And only things with destructors need cleaning up. */
7874 if (type
== error_mark_node
7875 || TYPE_HAS_TRIVIAL_DESTRUCTOR (type
))
7878 if (TREE_CODE (decl
) == VAR_DECL
&&
7879 (DECL_EXTERNAL (decl
) || TREE_STATIC (decl
)))
7880 /* We don't clean up things that aren't defined in this
7881 translation unit, or that need a static cleanup. The latter
7882 are handled by finish_file. */
7885 /* Compute the cleanup. */
7886 cleanup
= maybe_build_cleanup (decl
);
7888 /* Record the cleanup required for this declaration. */
7889 if (DECL_SIZE (decl
) && TREE_TYPE (decl
) != error_mark_node
7891 finish_decl_cleanup (decl
, cleanup
);
7894 /* Finish processing of a declaration;
7895 install its line number and initial value.
7896 If the length of an array type is not known before,
7897 it must be determined now, from the initial value, or it is an error.
7899 INIT holds the value of an initializer that should be allowed to escape
7902 FLAGS is LOOKUP_ONLYCONVERTING if the = init syntax was used, else 0
7903 if the (init) syntax was used. */
7906 cp_finish_decl (decl
, init
, asmspec_tree
, flags
)
7912 tree ttype
= NULL_TREE
;
7913 const char *asmspec
= NULL
;
7914 int was_readonly
= 0;
7919 error ("assignment (not initialization) in declaration");
7923 /* If a name was specified, get the string. */
7925 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
7927 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
7929 cp_error ("cannot initialize `%D' to namespace `%D'",
7934 if (current_class_type
7935 && CP_DECL_CONTEXT (decl
) == current_class_type
7936 && TYPE_BEING_DEFINED (current_class_type
)
7937 && (DECL_INITIAL (decl
) || init
))
7938 DECL_INITIALIZED_IN_CLASS_P (decl
) = 1;
7940 if (TREE_CODE (decl
) == VAR_DECL
7941 && DECL_CONTEXT (decl
)
7942 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7943 && DECL_CONTEXT (decl
) != current_namespace
7946 /* Leave the namespace of the object. */
7947 pop_decl_namespace ();
7950 type
= TREE_TYPE (decl
);
7952 if (type
== error_mark_node
)
7955 /* Add this declaration to the statement-tree. */
7956 if (building_stmt_tree ()
7957 && at_function_scope_p ()
7958 && TREE_CODE (decl
) != RESULT_DECL
)
7959 add_decl_stmt (decl
);
7961 if (TYPE_HAS_MUTABLE_P (type
))
7962 TREE_READONLY (decl
) = 0;
7964 if (processing_template_decl
)
7966 if (init
&& DECL_INITIAL (decl
))
7967 DECL_INITIAL (decl
) = init
;
7971 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
7972 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
7974 /* Take care of TYPE_DECLs up front. */
7975 if (TREE_CODE (decl
) == TYPE_DECL
)
7977 if (init
&& DECL_INITIAL (decl
))
7979 /* typedef foo = bar; store the type of bar as the type of foo. */
7980 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
7981 DECL_INITIAL (decl
) = init
= NULL_TREE
;
7983 if (type
!= error_mark_node
7984 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
7986 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
7987 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
7988 set_identifier_type_value (DECL_NAME (decl
), type
);
7989 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
7991 GNU_xref_decl (current_function_decl
, decl
);
7993 /* If we have installed this as the canonical typedef for this
7994 type, and that type has not been defined yet, delay emitting
7995 the debug information for it, as we will emit it later. */
7996 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
7997 && !COMPLETE_TYPE_P (TREE_TYPE (decl
)))
7998 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
8000 rest_of_decl_compilation (decl
, NULL_PTR
,
8001 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
8005 if (TREE_CODE (decl
) != FUNCTION_DECL
)
8006 ttype
= target_type (type
);
8008 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
8009 && TYPE_NEEDS_CONSTRUCTING (type
))
8011 /* Currently, GNU C++ puts constants in text space, making them
8012 impossible to initialize. In the future, one would hope for
8013 an operating system which understood the difference between
8014 initialization and the running of a program. */
8016 TREE_READONLY (decl
) = 0;
8019 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
8021 /* This must override the asm specifier which was placed by
8022 grokclassfn. Lay this out fresh. */
8023 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
8024 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
8025 make_decl_rtl (decl
, asmspec
);
8028 /* Deduce size of array from initialization, if not already known. */
8029 maybe_deduce_size_from_array_init (decl
, init
);
8030 init
= check_initializer (decl
, init
);
8032 GNU_xref_decl (current_function_decl
, decl
);
8034 if (TREE_CODE (decl
) == VAR_DECL
)
8035 layout_var_decl (decl
);
8037 /* Output the assembler code and/or RTL code for variables and functions,
8038 unless the type is an undefined structure or union.
8039 If not, it will get done when the type is completed. */
8040 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
8041 || TREE_CODE (decl
) == RESULT_DECL
)
8043 if (TREE_CODE (decl
) == VAR_DECL
)
8044 maybe_commonize_var (decl
);
8046 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
8048 if (TREE_CODE (type
) == FUNCTION_TYPE
8049 || TREE_CODE (type
) == METHOD_TYPE
)
8050 abstract_virtuals_error (decl
,
8051 strip_array_types (TREE_TYPE (type
)));
8053 abstract_virtuals_error (decl
, strip_array_types (type
));
8055 if (TREE_CODE (decl
) == FUNCTION_DECL
)
8057 else if (DECL_EXTERNAL (decl
)
8058 && ! (DECL_LANG_SPECIFIC (decl
)
8059 && DECL_NOT_REALLY_EXTERN (decl
)))
8062 DECL_INITIAL (decl
) = init
;
8064 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
8066 /* This is a local declaration. */
8067 if (doing_semantic_analysis_p ())
8068 maybe_inject_for_scope_var (decl
);
8069 /* Initialize the local variable. But, if we're building a
8070 statement-tree, we'll do the initialization when we
8072 if (processing_template_decl
)
8074 if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
8075 DECL_INITIAL (decl
) = init
;
8079 /* If we're not building RTL, then we need to do so
8081 my_friendly_assert (building_stmt_tree (), 20000906);
8082 /* Initialize the variable. */
8083 initialize_local_var (decl
, init
, flags
);
8084 /* Clean up the variable. */
8085 destroy_local_var (decl
);
8088 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
8090 /* Cleanups for static variables are handled by `finish_file'. */
8091 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
8092 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
8093 expand_static_init (decl
, init
);
8097 /* Undo call to `pushclass' that was done in `start_decl'
8098 due to initialization of qualified member variable.
8099 I.e., Foo::x = 10; */
8101 tree context
= CP_DECL_CONTEXT (decl
);
8104 && (TREE_CODE (decl
) == VAR_DECL
8105 /* We also have a pushclass done that we need to undo here
8106 if we're at top level and declare a method. */
8107 || TREE_CODE (decl
) == FUNCTION_DECL
)
8108 /* If size hasn't been set, we're still defining it,
8109 and therefore inside the class body; don't pop
8110 the binding level.. */
8111 && COMPLETE_TYPE_P (context
)
8112 && context
== current_class_type
)
8113 pop_nested_class ();
8120 TREE_READONLY (decl
) = 1;
8123 /* This is here for a midend callback from c-common.c */
8126 finish_decl (decl
, init
, asmspec_tree
)
8130 cp_finish_decl (decl
, init
, asmspec_tree
, 0);
8133 /* Returns a declaration for a VAR_DECL as if:
8135 extern "C" TYPE NAME;
8137 had been seen. Used to create compiler-generated global
8141 declare_global_var (name
, type
)
8147 push_to_top_level ();
8148 decl
= build_decl (VAR_DECL
, name
, type
);
8149 TREE_PUBLIC (decl
) = 1;
8150 DECL_EXTERNAL (decl
) = 1;
8151 DECL_ARTIFICIAL (decl
) = 1;
8153 cp_finish_decl (decl
, NULL_TREE
, NULL_TREE
, 0);
8154 pop_from_top_level ();
8159 /* Returns a pointer to the `atexit' function. Note that if
8160 FLAG_USE_CXA_ATEXIT is non-zero, then this will actually be the new
8161 `__cxa_atexit' function specified in the IA64 C++ ABI. */
8175 if (flag_use_cxa_atexit
)
8177 /* The declaration for `__cxa_atexit' is:
8179 int __cxa_atexit (void (*)(void *), void *, void *)
8181 We build up the argument types and then then function type
8184 /* First, build the pointer-to-function type for the first
8186 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8187 fn_type
= build_function_type (void_type_node
, arg_types
);
8188 fn_ptr_type
= build_pointer_type (fn_type
);
8189 /* Then, build the rest of the argument types. */
8190 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8191 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, arg_types
);
8192 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, arg_types
);
8193 /* And the final __cxa_atexit type. */
8194 fn_type
= build_function_type (integer_type_node
, arg_types
);
8195 fn_ptr_type
= build_pointer_type (fn_type
);
8196 name
= "__cxa_atexit";
8200 /* The declaration for `atexit' is:
8202 int atexit (void (*)());
8204 We build up the argument types and then then function type
8206 fn_type
= build_function_type (void_type_node
, void_list_node
);
8207 fn_ptr_type
= build_pointer_type (fn_type
);
8208 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, void_list_node
);
8209 /* Build the final atexit type. */
8210 fn_type
= build_function_type (integer_type_node
, arg_types
);
8214 /* Now, build the function declaration. */
8215 push_lang_context (lang_name_c
);
8216 atexit_fndecl
= build_library_fn_ptr (name
, fn_type
);
8217 mark_used (atexit_fndecl
);
8218 pop_lang_context ();
8219 atexit_node
= default_conversion (atexit_fndecl
);
8224 /* Returns the __dso_handle VAR_DECL. */
8227 get_dso_handle_node ()
8229 if (dso_handle_node
)
8230 return dso_handle_node
;
8232 /* Declare the variable. */
8233 dso_handle_node
= declare_global_var (get_identifier ("__dso_handle"),
8236 return dso_handle_node
;
8239 /* Begin a new function with internal linkage whose job will be simply
8240 to destroy some particular variable. */
8245 static int counter
= 0;
8246 int old_interface_unknown
= interface_unknown
;
8252 push_to_top_level ();
8254 /* No need to mangle this. */
8255 push_lang_context (lang_name_c
);
8257 interface_unknown
= 1;
8259 /* Build the parameter-types. */
8260 parmtypes
= void_list_node
;
8261 /* Functions passed to __cxa_atexit take an additional parameter.
8262 We'll just ignore it. After we implement the new calling
8263 convention for destructors, we can eliminate the use of
8264 additional cleanup functions entirely in the -fnew-abi case. */
8265 if (flag_use_cxa_atexit
)
8266 parmtypes
= tree_cons (NULL_TREE
, ptr_type_node
, parmtypes
);
8267 /* Build the function type itself. */
8268 fntype
= build_function_type (void_type_node
, parmtypes
);
8269 /* Build the name of the function. */
8270 sprintf (name
, "__tcf_%d", counter
++);
8271 /* Build the function declaration. */
8272 fndecl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), fntype
);
8273 /* It's a function with internal linkage, generated by the
8275 TREE_PUBLIC (fndecl
) = 0;
8276 DECL_ARTIFICIAL (fndecl
) = 1;
8277 /* Make the function `inline' so that it is only emitted if it is
8278 actually needed. It is unlikely that it will be inlined, since
8279 it is only called via a function pointer, but we avoid unncessary
8280 emissions this way. */
8281 DECL_INLINE (fndecl
) = 1;
8282 /* Build the parameter. */
8283 if (flag_use_cxa_atexit
)
8287 parmdecl
= build_decl (PARM_DECL
, NULL_TREE
, ptr_type_node
);
8288 DECL_CONTEXT (parmdecl
) = fndecl
;
8289 DECL_ARG_TYPE (parmdecl
) = ptr_type_node
;
8290 TREE_USED (parmdecl
) = 1;
8291 DECL_ARGUMENTS (fndecl
) = parmdecl
;
8295 start_function (/*specs=*/NULL_TREE
, fndecl
, NULL_TREE
, SF_PRE_PARSED
);
8298 interface_unknown
= old_interface_unknown
;
8300 pop_lang_context ();
8302 return current_function_decl
;
8305 /* Finish the cleanup function begun by start_cleanup_fn. */
8312 expand_body (finish_function (0));
8314 pop_from_top_level ();
8317 /* Generate code to handle the destruction of DECL, an object with
8318 static storage duration. */
8321 register_dtor_fn (decl
)
8329 int saved_flag_access_control
;
8331 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl
)))
8334 /* Call build_cleanup before we enter the anonymous function so that
8335 any access checks will be done relative to the current scope,
8336 rather than the scope of the anonymous function. */
8337 build_cleanup (decl
);
8339 /* Now start the function. */
8340 cleanup
= start_cleanup_fn ();
8342 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
8343 to the original function, rather than the anonymous one. That
8344 will make the back-end think that nested functions are in use,
8345 which causes confusion. */
8346 saved_flag_access_control
= flag_access_control
;
8347 flag_access_control
= 0;
8348 fcall
= build_cleanup (decl
);
8349 flag_access_control
= saved_flag_access_control
;
8351 /* Create the body of the anonymous function. */
8352 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
8353 finish_expr_stmt (fcall
);
8354 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
8357 /* Call atexit with the cleanup function. */
8358 mark_addressable (cleanup
);
8359 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
8360 if (flag_use_cxa_atexit
)
8362 args
= tree_cons (NULL_TREE
, get_dso_handle_node (), NULL_TREE
);
8363 args
= tree_cons (NULL_TREE
, null_pointer_node
, args
);
8364 args
= tree_cons (NULL_TREE
, cleanup
, args
);
8367 args
= tree_cons (NULL_TREE
, cleanup
, NULL_TREE
);
8368 finish_expr_stmt (build_function_call (get_atexit_node (), args
));
8372 expand_static_init (decl
, init
)
8376 tree oldstatic
= value_member (decl
, static_aggregates
);
8380 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
8381 cp_error ("multiple initializations given for `%D'", decl
);
8383 else if (! toplevel_bindings_p ())
8385 /* Emit code to perform this initialization but once. */
8392 /* Emit code to perform this initialization but once. This code
8395 static int guard = 0;
8397 // Do initialization.
8399 // Register variable for destruction at end of program.
8402 Note that the `temp' variable is only set to 1 *after* the
8403 initialization is complete. This ensures that an exception,
8404 thrown during the construction, will cause the variable to
8405 reinitialized when we pass through this code again, as per:
8409 If the initialization exits by throwing an exception, the
8410 initialization is not complete, so it will be tried again
8411 the next time control enters the declaration.
8413 In theory, this process should be thread-safe, too; multiple
8414 threads should not be able to initialize the variable more
8415 than once. We don't yet attempt to ensure thread-safety. */
8417 /* Create the guard variable. */
8418 guard
= get_guard (decl
);
8420 /* Begin the conditional initialization. */
8421 if_stmt
= begin_if_stmt ();
8422 finish_if_stmt_cond (get_guard_cond (guard
), if_stmt
);
8423 then_clause
= begin_compound_stmt (/*has_no_scope=*/0);
8425 /* Do the initialization itself. */
8426 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
8427 || (init
&& TREE_CODE (init
) == TREE_LIST
))
8428 assignment
= build_aggr_init (decl
, init
, 0);
8430 /* The initialization we're doing here is just a bitwise
8432 assignment
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
8434 assignment
= NULL_TREE
;
8436 /* Once the assignment is complete, set TEMP to 1. Since the
8437 construction of the static object is complete at this point,
8438 we want to make sure TEMP is set to 1 even if a temporary
8439 constructed during the initialization throws an exception
8440 when it is destroyed. So, we combine the initialization and
8441 the assignment to TEMP into a single expression, ensuring
8442 that when we call finish_expr_stmt the cleanups will not be
8443 run until after TEMP is set to 1. */
8444 guard_init
= set_guard (guard
);
8447 assignment
= tree_cons (NULL_TREE
, assignment
,
8448 build_tree_list (NULL_TREE
,
8450 assignment
= build_compound_expr (assignment
);
8453 assignment
= guard_init
;
8454 finish_expr_stmt (assignment
);
8456 /* Use atexit to register a function for destroying this static
8458 register_dtor_fn (decl
);
8460 finish_compound_stmt (/*has_no_scope=*/0, then_clause
);
8461 finish_then_clause (if_stmt
);
8465 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8468 /* Finish the declaration of a catch-parameter. */
8471 start_handler_parms (declspecs
, declarator
)
8478 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8480 if (decl
== NULL_TREE
)
8481 error ("invalid catch parameter");
8490 /* Make TYPE a complete type based on INITIAL_VALUE.
8491 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8492 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8495 complete_array_type (type
, initial_value
, do_default
)
8496 tree type
, initial_value
;
8499 register tree maxindex
= NULL_TREE
;
8504 /* An array of character type can be initialized from a
8505 brace-enclosed string constant. */
8506 if (char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (type
)))
8507 && TREE_CODE (initial_value
) == CONSTRUCTOR
8508 && CONSTRUCTOR_ELTS (initial_value
)
8509 && (TREE_CODE (TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
)))
8511 && TREE_CHAIN (CONSTRUCTOR_ELTS (initial_value
)) == NULL_TREE
)
8512 initial_value
= TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
));
8514 /* Note MAXINDEX is really the maximum index, one less than the
8516 if (TREE_CODE (initial_value
) == STRING_CST
)
8519 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8520 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8523 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8525 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8527 maxindex
= ssize_int (-1);
8528 for (; elts
; elts
= TREE_CHAIN (elts
))
8530 if (TREE_PURPOSE (elts
))
8531 maxindex
= TREE_PURPOSE (elts
);
8533 maxindex
= size_binop (PLUS_EXPR
, maxindex
, ssize_int (1));
8535 maxindex
= copy_node (maxindex
);
8539 /* Make an error message unless that happened already. */
8540 if (initial_value
!= error_mark_node
)
8543 initial_value
= NULL_TREE
;
8545 /* Prevent further error messages. */
8546 maxindex
= build_int_2 (0, 0);
8553 maxindex
= build_int_2 (0, 0);
8562 domain
= build_index_type (maxindex
);
8563 TYPE_DOMAIN (type
) = domain
;
8565 if (! TREE_TYPE (maxindex
))
8566 TREE_TYPE (maxindex
) = domain
;
8568 itype
= TREE_TYPE (initial_value
);
8571 if (itype
&& !TYPE_DOMAIN (itype
))
8572 TYPE_DOMAIN (itype
) = domain
;
8573 /* The type of the main variant should never be used for arrays
8574 of different sizes. It should only ever be completed with the
8575 size of the array. */
8576 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8577 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8580 /* Lay out the type now that we can get the real answer. */
8587 /* Return zero if something is declared to be a member of type
8588 CTYPE when in the context of CUR_TYPE. STRING is the error
8589 message to print in that case. Otherwise, quietly return 1. */
8592 member_function_or_else (ctype
, cur_type
, flags
)
8593 tree ctype
, cur_type
;
8594 enum overload_flags flags
;
8596 if (ctype
&& ctype
!= cur_type
)
8598 if (flags
== DTOR_FLAG
)
8599 cp_error ("destructor for alien class `%T' cannot be a member",
8602 cp_error ("constructor for alien class `%T' cannot be a member",
8609 /* Subroutine of `grokdeclarator'. */
8611 /* Generate errors possibly applicable for a given set of specifiers.
8612 This is for ARM $7.1.2. */
8615 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8618 int virtualp
, quals
, friendp
, raises
, inlinep
;
8621 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8623 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8625 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8628 cp_error_at ("`%D' declared as a friend", object
);
8630 cp_error_at ("`%D' declared with an exception specification", object
);
8633 /* CTYPE is class type, or null if non-class.
8634 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8636 DECLARATOR is the function's name.
8637 VIRTUALP is truthvalue of whether the function is virtual or not.
8638 FLAGS are to be passed through to `grokclassfn'.
8639 QUALS are qualifiers indicating whether the function is `const'
8641 RAISES is a list of exceptions that this function can raise.
8642 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8643 not look, and -1 if we should not call `grokclassfn' at all.
8645 Returns `NULL_TREE' if something goes wrong, after issuing
8646 applicable error messages. */
8649 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8650 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8651 template_count
, in_namespace
)
8654 tree orig_declarator
;
8656 enum overload_flags flags
;
8658 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8662 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8663 int has_default_arg
= 0;
8667 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8668 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8674 type
= build_exception_variant (type
, raises
);
8677 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8678 /* Propagate volatile out from type to decl. */
8679 if (TYPE_VOLATILE (type
))
8680 TREE_THIS_VOLATILE (decl
) = 1;
8682 /* If this decl has namespace scope, set that up. */
8684 set_decl_namespace (decl
, in_namespace
, friendp
);
8686 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8688 /* `main' and builtins have implicit 'C' linkage. */
8689 if ((MAIN_NAME_P (declarator
)
8690 || (IDENTIFIER_LENGTH (declarator
) > 10
8691 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8692 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8693 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8694 && current_lang_name
== lang_name_cplusplus
8695 && ctype
== NULL_TREE
8696 /* NULL_TREE means global namespace. */
8697 && DECL_CONTEXT (decl
) == NULL_TREE
)
8698 DECL_LANGUAGE (decl
) = lang_c
;
8700 /* Should probably propagate const out from type to decl I bet (mrs). */
8703 DECL_STATIC_FUNCTION_P (decl
) = 1;
8704 DECL_CONTEXT (decl
) = ctype
;
8708 DECL_CONTEXT (decl
) = ctype
;
8710 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8712 if (processing_template_decl
)
8713 error ("cannot declare `::main' to be a template");
8715 error ("cannot declare `::main' to be inline");
8717 error ("cannot declare `::main' to be static");
8718 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
8720 error ("`main' must return `int'");
8725 /* Members of anonymous types and local classes have no linkage; make
8727 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8728 || decl_function_context (TYPE_MAIN_DECL (ctype
))))
8733 /* [basic.link]: A name with no linkage (notably, the name of a class
8734 or enumeration declared in a local scope) shall not be used to
8735 declare an entity with linkage.
8737 Only check this for public decls for now. */
8738 t
= no_linkage_check (TREE_TYPE (decl
));
8741 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8743 if (DECL_EXTERN_C_P (decl
))
8744 /* Allow this; it's pretty common in C. */;
8746 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8750 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8755 TREE_PUBLIC (decl
) = publicp
;
8758 DECL_INTERFACE_KNOWN (decl
) = 1;
8759 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8763 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8765 DECL_EXTERNAL (decl
) = 1;
8766 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8768 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8769 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8773 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8774 grok_op_properties (decl
, virtualp
, check
< 0);
8776 if (ctype
&& decl_function_context (decl
))
8777 DECL_NO_STATIC_CHAIN (decl
) = 1;
8779 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8780 if (TREE_PURPOSE (t
)
8781 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8783 has_default_arg
= 1;
8788 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8792 ("defining explicit specialization `%D' in friend declaration",
8796 tree fns
= TREE_OPERAND (orig_declarator
, 0);
8797 tree args
= TREE_OPERAND (orig_declarator
, 1);
8799 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8801 /* Something like `template <class T> friend void f<T>()'. */
8802 cp_error ("invalid use of template-id `%D' in declaration of primary template",
8808 /* A friend declaration of the form friend void f<>(). Record
8809 the information in the TEMPLATE_ID_EXPR. */
8810 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8812 if (TREE_CODE (fns
) == COMPONENT_REF
)
8814 /* Due to bison parser ickiness, we will have already looked
8815 up an operator_name or PFUNCNAME within the current class
8816 (see template_id in parse.y). If the current class contains
8817 such a name, we'll get a COMPONENT_REF here. Undo that. */
8819 my_friendly_assert (TREE_TYPE (TREE_OPERAND (fns
, 0))
8820 == current_class_type
, 20001120);
8821 fns
= TREE_OPERAND (fns
, 1);
8823 my_friendly_assert (TREE_CODE (fns
) == IDENTIFIER_NODE
8824 || TREE_CODE (fns
) == LOOKUP_EXPR
8825 || TREE_CODE (fns
) == OVERLOAD
, 20001120);
8826 DECL_TEMPLATE_INFO (decl
) = tree_cons (fns
, args
, NULL_TREE
);
8828 if (has_default_arg
)
8830 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8837 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8844 if (has_default_arg
)
8845 add_defarg_fn (decl
);
8847 /* Plain overloading: will not be grok'd by grokclassfn. */
8848 if (! ctype
&& ! processing_template_decl
8849 && !DECL_EXTERN_C_P (decl
)
8850 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8851 set_mangled_name_for_decl (decl
);
8854 /* Make the init_value nonzero so pushdecl knows this is not
8855 tentative. error_mark_node is replaced later with the BLOCK. */
8856 DECL_INITIAL (decl
) = error_mark_node
;
8858 if (TYPE_NOTHROW_P (type
) || nothrow_libfn_p (decl
))
8859 TREE_NOTHROW (decl
) = 1;
8861 /* Caller will do the rest of this. */
8865 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8866 DECL_CONSTRUCTOR_P (decl
) = 1;
8868 /* Function gets the ugly name, field gets the nice one. This call
8869 may change the type of the function (because of default
8871 if (ctype
!= NULL_TREE
)
8872 grokclassfn (ctype
, decl
, flags
, quals
);
8874 decl
= check_explicit_specialization (orig_declarator
, decl
,
8876 2 * (funcdef_flag
!= 0) +
8877 4 * (friendp
!= 0));
8878 if (decl
== error_mark_node
)
8881 if (ctype
!= NULL_TREE
8882 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8887 old_decl
= check_classfn (ctype
, decl
);
8889 if (old_decl
&& TREE_CODE (old_decl
) == TEMPLATE_DECL
)
8890 /* Because grokfndecl is always supposed to return a
8891 FUNCTION_DECL, we pull out the DECL_TEMPLATE_RESULT
8892 here. We depend on our callers to figure out that its
8893 really a template that's being returned. */
8894 old_decl
= DECL_TEMPLATE_RESULT (old_decl
);
8896 if (old_decl
&& DECL_STATIC_FUNCTION_P (old_decl
)
8897 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8899 /* Remove the `this' parm added by grokclassfn.
8900 XXX Isn't this done in start_function, too? */
8901 revert_static_member_fn (decl
);
8902 last_function_parms
= TREE_CHAIN (last_function_parms
);
8904 if (old_decl
&& DECL_ARTIFICIAL (old_decl
))
8905 cp_error ("definition of implicitly-declared `%D'", old_decl
);
8909 /* Since we've smashed OLD_DECL to its
8910 DECL_TEMPLATE_RESULT, we must do the same to DECL. */
8911 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
8912 decl
= DECL_TEMPLATE_RESULT (decl
);
8914 /* Attempt to merge the declarations. This can fail, in
8915 the case of some illegal specialization declarations. */
8916 if (!duplicate_decls (decl
, old_decl
))
8917 cp_error ("no `%#D' member function declared in class `%T'",
8923 if (DECL_CONSTRUCTOR_P (decl
) && !grok_ctor_properties (ctype
, decl
))
8926 if (ctype
== NULL_TREE
|| check
)
8930 DECL_VIRTUAL_P (decl
) = 1;
8936 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
8939 RID_BIT_TYPE
*specbits_in
;
8945 RID_BIT_TYPE specbits
;
8947 specbits
= *specbits_in
;
8949 if (TREE_CODE (type
) == OFFSET_TYPE
)
8951 /* If you declare a static member so that it
8952 can be initialized, the code will reach here. */
8953 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
8954 type
= TREE_TYPE (type
);
8955 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8956 DECL_CONTEXT (decl
) = basetype
;
8957 /* DECL_ASSEMBLER_NAME is needed only for full-instantiated
8959 if (!uses_template_parms (decl
))
8962 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
8964 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
,
8973 context
= in_namespace
;
8974 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
8975 context
= current_namespace
;
8977 context
= NULL_TREE
;
8979 if (processing_template_decl
&& context
)
8980 /* For global variables, declared in a template, we need the
8982 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8984 decl
= build_decl (VAR_DECL
, declarator
, type
);
8987 set_decl_namespace (decl
, context
, 0);
8989 context
= DECL_CONTEXT (decl
);
8990 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
8993 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
8995 DECL_ASSEMBLER_NAME (decl
)
8996 = build_static_name (context
, declarator
);
9001 set_decl_namespace (decl
, in_namespace
, 0);
9003 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
9005 DECL_THIS_EXTERN (decl
) = 1;
9006 DECL_EXTERNAL (decl
) = !initialized
;
9009 /* In class context, static means one per class,
9010 public access, and static storage. */
9011 if (DECL_CLASS_SCOPE_P (decl
))
9013 TREE_PUBLIC (decl
) = 1;
9014 TREE_STATIC (decl
) = 1;
9015 DECL_EXTERNAL (decl
) = 0;
9017 /* At top level, either `static' or no s.c. makes a definition
9018 (perhaps tentative), and absence of `static' makes it public. */
9019 else if (toplevel_bindings_p ())
9021 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
9022 && (DECL_THIS_EXTERN (decl
) || ! constp
));
9023 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
9025 /* Not at top level, only `static' makes a static definition. */
9028 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
9029 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
9032 if (TREE_PUBLIC (decl
))
9034 /* [basic.link]: A name with no linkage (notably, the name of a class
9035 or enumeration declared in a local scope) shall not be used to
9036 declare an entity with linkage.
9038 Only check this for public decls for now. */
9039 tree t
= no_linkage_check (TREE_TYPE (decl
));
9042 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
9043 /* Ignore for now; `enum { foo } e' is pretty common. */;
9045 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
9053 /* Create and return a canonical pointer to member function type, for
9054 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
9057 build_ptrmemfunc_type (type
)
9063 tree unqualified_variant
= NULL_TREE
;
9065 if (type
== error_mark_node
)
9068 /* If a canonical type already exists for this type, use it. We use
9069 this method instead of type_hash_canon, because it only does a
9070 simple equality check on the list of field members. */
9072 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
9075 /* Make sure that we always have the unqualified pointer-to-member
9077 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9079 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
9081 t
= make_aggr_type (RECORD_TYPE
);
9082 /* Let the front-end know this is a pointer to member function... */
9083 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
9084 /* ... and not really an aggregate. */
9085 SET_IS_AGGR_TYPE (t
, 0);
9089 u
= make_aggr_type (UNION_TYPE
);
9090 SET_IS_AGGR_TYPE (u
, 0);
9091 fields
[0] = build_decl (FIELD_DECL
, pfn_identifier
, type
);
9092 fields
[1] = build_decl (FIELD_DECL
, delta2_identifier
,
9094 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9095 TYPE_NAME (u
) = NULL_TREE
;
9097 fields
[0] = build_decl (FIELD_DECL
, delta_identifier
,
9099 fields
[1] = build_decl (FIELD_DECL
, index_identifier
,
9101 fields
[2] = build_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
9102 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
9106 fields
[0] = build_decl (FIELD_DECL
, pfn_identifier
, type
);
9107 fields
[1] = build_decl (FIELD_DECL
, delta_identifier
,
9109 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9112 /* Zap out the name so that the back-end will give us the debugging
9113 information for this anonymous RECORD_TYPE. */
9114 TYPE_NAME (t
) = NULL_TREE
;
9116 /* If this is not the unqualified form of this pointer-to-member
9117 type, set the TYPE_MAIN_VARIANT for this type to be the
9118 unqualified type. Since they are actually RECORD_TYPEs that are
9119 not variants of each other, we must do this manually. */
9120 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9122 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
9123 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
9124 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
9125 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
9128 /* Cache this pointer-to-member type so that we can find it again
9130 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
9132 /* Seems to be wanted. */
9133 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
9138 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
9139 Check to see that the definition is valid. Issue appropriate error
9140 messages. Return 1 if the definition is particularly bad, or 0
9144 check_static_variable_definition (decl
, type
)
9148 /* Motion 10 at San Diego: If a static const integral data member is
9149 initialized with an integral constant expression, the initializer
9150 may appear either in the declaration (within the class), or in
9151 the definition, but not both. If it appears in the class, the
9152 member is a member constant. The file-scope definition is always
9154 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
9156 cp_error ("invalid in-class initialization of static data member of non-integral type `%T'",
9158 /* If we just return the declaration, crashes will sometimes
9159 occur. We therefore return void_type_node, as if this was a
9160 friend declaration, to cause callers to completely ignore
9161 this declaration. */
9164 else if (!CP_TYPE_CONST_P (type
))
9165 cp_error ("ISO C++ forbids in-class initialization of non-const static member `%D'",
9167 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
9168 cp_pedwarn ("ISO C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
9173 /* Given the SIZE (i.e., number of elements) in an array, compute an
9174 appropriate index type for the array. If non-NULL, NAME is the
9175 name of the thing being declared. */
9178 compute_array_index_type (name
, size
)
9184 /* The size might be the result of a cast. */
9185 STRIP_TYPE_NOPS (size
);
9187 /* It might be a const variable or enumeration constant. */
9188 size
= decl_constant_value (size
);
9190 /* If this involves a template parameter, it will be a constant at
9191 instantiation time, but we don't know what the value is yet.
9192 Even if no template parameters are involved, we may an expression
9193 that is not a constant; we don't even simplify `1 + 2' when
9194 processing a template. */
9195 if (processing_template_decl
)
9197 /* Resolve a qualified reference to an enumerator or static
9198 const data member of ours. */
9199 if (TREE_CODE (size
) == SCOPE_REF
9200 && TREE_OPERAND (size
, 0) == current_class_type
)
9202 tree t
= lookup_field (current_class_type
,
9203 TREE_OPERAND (size
, 1), 0, 0);
9208 return build_index_type (build_min (MINUS_EXPR
, sizetype
,
9209 size
, integer_one_node
));
9212 /* The array bound must be an integer type. */
9213 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9214 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
9215 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
9218 cp_error ("size of array `%D' has non-integer type", name
);
9220 cp_error ("size of array has non-integer type");
9221 size
= integer_one_node
;
9224 /* Normally, the array-bound will be a constant. */
9225 if (TREE_CODE (size
) == INTEGER_CST
)
9227 /* Check to see if the array bound overflowed. Make that an
9228 error, no matter how generous we're being. */
9229 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9230 int old_pedantic
= pedantic
;
9231 pedantic
= flag_pedantic_errors
= 1;
9232 constant_expression_warning (size
);
9233 pedantic
= old_pedantic
;
9234 flag_pedantic_errors
= old_flag_pedantic_errors
;
9236 /* An array must have a positive number of elements. */
9237 if (INT_CST_LT (size
, integer_zero_node
))
9240 cp_error ("size of array `%D' is negative", name
);
9242 cp_error ("size of array is negative");
9243 size
= integer_one_node
;
9245 /* Except that an extension we allow zero-sized arrays. We
9246 always allow them in system headers because glibc uses
9248 else if (integer_zerop (size
) && pedantic
&& !in_system_header
)
9251 cp_pedwarn ("ISO C++ forbids zero-size array `%D'", name
);
9253 cp_pedwarn ("ISO C++ forbids zero-size array");
9256 else if (TREE_CONSTANT (size
))
9258 /* `(int) &fn' is not a valid array bound. */
9260 cp_error ("size of array `%D' is not an integral constant-expression",
9263 cp_error ("size of array is not an integral constant-expression");
9266 /* Compute the index of the largest element in the array. It is
9267 one less than the number of elements in the array. */
9269 = fold (cp_build_binary_op (MINUS_EXPR
,
9270 cp_convert (ssizetype
, size
),
9271 cp_convert (ssizetype
,
9272 integer_one_node
)));
9274 /* Check for variable-sized arrays. We allow such things as an
9275 extension, even though they are not allowed in ANSI/ISO C++. */
9276 if (!TREE_CONSTANT (itype
))
9281 cp_pedwarn ("ISO C++ forbids variable-size array `%D'",
9284 cp_pedwarn ("ISO C++ forbids variable-size array");
9287 /* Create a variable-sized array index type. */
9288 itype
= variable_size (itype
);
9290 /* Make sure that there was no overflow when creating to a signed
9291 index type. (For example, on a 32-bit machine, an array with
9292 size 2^32 - 1 is too big.) */
9293 else if (TREE_OVERFLOW (itype
))
9295 error ("overflow in array dimension");
9296 TREE_OVERFLOW (itype
) = 0;
9299 /* Create and return the appropriate index type. */
9300 return build_index_type (itype
);
9303 /* Returns an ARRAY_TYPE for an array with SIZE elements of the
9304 indicated TYPE. If non-NULL, NAME is the NAME of the declaration
9308 create_array_type_for_decl (name
, type
, size
)
9313 tree itype
= NULL_TREE
;
9314 const char* error_msg
;
9316 /* If things have already gone awry, bail now. */
9317 if (type
== error_mark_node
|| size
== error_mark_node
)
9318 return error_mark_node
;
9320 /* Assume that everything will go OK. */
9323 /* There are some types which cannot be array elements. */
9324 switch (TREE_CODE (type
))
9327 error_msg
= "array of void";
9331 error_msg
= "array of functions";
9334 case REFERENCE_TYPE
:
9335 error_msg
= "array of references";
9339 error_msg
= "array of data members";
9343 error_msg
= "array of function members";
9350 /* If something went wrong, issue an error-message and return. */
9354 cp_error ("declaration of `%D' as %s", name
, error_msg
);
9356 cp_error ("creating %s", error_msg
);
9358 return error_mark_node
;
9363 The constant expressions that specify the bounds of the arrays
9364 can be omitted only for the first member of the sequence. */
9365 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9367 cp_error ("declaration of `%D' as multidimensional array must have bounds for all dimensions except the first",
9370 return error_mark_node
;
9373 /* Figure out the index type for the array. */
9375 itype
= compute_array_index_type (name
, size
);
9377 return build_cplus_array_type (type
, itype
);
9380 /* Check that it's OK to declare a function with the indicated TYPE.
9381 SFK indicates the kind of special function (if any) that this
9382 function is. CTYPE is the class of which this function is a
9383 member. OPTYPE is the type given in a conversion operator
9384 declaration. Returns the actual return type of the function; that
9385 may be different than TYPE if an error occurs, or for certain
9386 special functions. */
9389 check_special_function_return_type (sfk
, type
, ctype
, optype
)
9390 special_function_kind sfk
;
9397 case sfk_constructor
:
9399 cp_error ("return type specification for constructor invalid");
9401 /* In the old ABI, we return `this'; in the new ABI we don't
9403 type
= flag_new_abi
? void_type_node
: build_pointer_type (ctype
);
9406 case sfk_destructor
:
9408 cp_error ("return type specification for destructor invalid");
9409 type
= void_type_node
;
9412 case sfk_conversion
:
9413 if (type
&& !same_type_p (type
, optype
))
9414 cp_error ("operator `%T' declared to return `%T'", optype
, type
);
9416 cp_pedwarn ("return type specified for `operator %T'", optype
);
9421 my_friendly_abort (20000408);
9428 /* Given declspecs and a declarator,
9429 determine the name and type of the object declared
9430 and construct a ..._DECL node for it.
9431 (In one case we can return a ..._TYPE node instead.
9432 For invalid input we sometimes return 0.)
9434 DECLSPECS is a chain of tree_list nodes whose value fields
9435 are the storage classes and type specifiers.
9437 DECL_CONTEXT says which syntactic context this declaration is in:
9438 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
9439 FUNCDEF for a function definition. Like NORMAL but a few different
9440 error messages in each case. Return value may be zero meaning
9441 this definition is too screwy to try to parse.
9442 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
9443 handle member functions (which have FIELD context).
9444 Return value may be zero meaning this definition is too screwy to
9446 PARM for a parameter declaration (either within a function prototype
9447 or before a function body). Make a PARM_DECL, or return void_type_node.
9448 CATCHPARM for a parameter declaration before a catch clause.
9449 TYPENAME if for a typename (in a cast or sizeof).
9450 Don't make a DECL node; just return the ..._TYPE node.
9451 FIELD for a struct or union field; make a FIELD_DECL.
9452 BITFIELD for a field with specified width.
9453 INITIALIZED is 1 if the decl has an initializer.
9455 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
9456 normal attributes in TREE_PURPOSE, or NULL_TREE.
9458 In the TYPENAME case, DECLARATOR is really an abstract declarator.
9459 It may also be so in the PARM case, for a prototype where the
9460 argument type is specified but not the name.
9462 This function is where the complicated C meanings of `static'
9463 and `extern' are interpreted.
9465 For C++, if there is any monkey business to do, the function which
9466 calls this one must do it, i.e., prepending instance variables,
9467 renaming overloaded function names, etc.
9469 Note that for this C++, it is an error to define a method within a class
9470 which does not belong to that class.
9472 Except in the case where SCOPE_REFs are implicitly known (such as
9473 methods within a class being redundantly qualified),
9474 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
9475 (class_name::decl_name). The caller must also deal with this.
9477 If a constructor or destructor is seen, and the context is FIELD,
9478 then the type gains the attribute TREE_HAS_x. If such a declaration
9479 is erroneous, NULL_TREE is returned.
9481 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
9482 function, these are the qualifiers to give to the `this' pointer. We
9483 apply TYPE_QUAL_RESTRICT to the this ptr, not the object.
9485 May return void_type_node if the declarator turned out to be a friend.
9486 See grokfield for details. */
9489 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
9492 enum decl_context decl_context
;
9496 RID_BIT_TYPE specbits
;
9499 tree type
= NULL_TREE
;
9505 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
9506 int explicit_int
= 0;
9507 int explicit_char
= 0;
9508 int defaulted_int
= 0;
9509 tree typedef_decl
= NULL_TREE
;
9511 tree typedef_type
= NULL_TREE
;
9512 int funcdef_flag
= 0;
9513 enum tree_code innermost_code
= ERROR_MARK
;
9516 /* See the code below that used this. */
9517 tree decl_machine_attr
= NULL_TREE
;
9519 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
9520 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
9521 tree init
= NULL_TREE
;
9523 /* Keep track of what sort of function is being processed
9524 so that we can warn about default return values, or explicit
9525 return values which do not match prescribed defaults. */
9526 special_function_kind sfk
= sfk_none
;
9528 tree dname
= NULL_TREE
;
9529 tree ctype
= current_class_type
;
9530 tree ctor_return_type
= NULL_TREE
;
9531 enum overload_flags flags
= NO_SPECIAL
;
9532 tree quals
= NULL_TREE
;
9533 tree raises
= NULL_TREE
;
9534 int template_count
= 0;
9535 tree in_namespace
= NULL_TREE
;
9539 RIDBIT_RESET_ALL (specbits
);
9540 if (decl_context
== FUNCDEF
)
9541 funcdef_flag
= 1, decl_context
= NORMAL
;
9542 else if (decl_context
== MEMFUNCDEF
)
9543 funcdef_flag
= -1, decl_context
= FIELD
;
9544 else if (decl_context
== BITFIELD
)
9545 bitfield
= 1, decl_context
= FIELD
;
9547 /* Look inside a declarator for the name being declared
9548 and get it as a string, for an error message. */
9550 tree
*next
= &declarator
;
9554 while (next
&& *next
)
9557 switch (TREE_CODE (decl
))
9560 /* For attributes. */
9561 next
= &TREE_VALUE (decl
);
9566 next
= &TREE_OPERAND (decl
, 0);
9569 case BIT_NOT_EXPR
: /* For C++ destructors! */
9571 tree name
= TREE_OPERAND (decl
, 0);
9572 tree rename
= NULL_TREE
;
9574 my_friendly_assert (flags
== NO_SPECIAL
, 152);
9576 sfk
= sfk_destructor
;
9577 if (TREE_CODE (name
) == TYPE_DECL
)
9578 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
9579 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
9580 if (ctype
== NULL_TREE
)
9582 if (current_class_type
== NULL_TREE
)
9584 error ("destructors must be member functions");
9589 tree t
= constructor_name (current_class_name
);
9596 tree t
= constructor_name (ctype
);
9603 cp_error ("destructor `%T' must match class name `%T'",
9605 TREE_OPERAND (decl
, 0) = rename
;
9611 case ADDR_EXPR
: /* C++ reference declaration */
9616 innermost_code
= TREE_CODE (decl
);
9617 next
= &TREE_OPERAND (decl
, 0);
9621 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
9623 /* This is actually a variable declaration using
9624 constructor syntax. We need to call start_decl and
9625 cp_finish_decl so we can get the variable
9628 tree attributes
, prefix_attributes
;
9630 *next
= TREE_OPERAND (decl
, 0);
9631 init
= CALL_DECLARATOR_PARMS (decl
);
9635 attributes
= TREE_PURPOSE (attrlist
);
9636 prefix_attributes
= TREE_VALUE (attrlist
);
9640 attributes
= NULL_TREE
;
9641 prefix_attributes
= NULL_TREE
;
9644 decl
= start_decl (declarator
, declspecs
, 1,
9645 attributes
, prefix_attributes
);
9646 decl_type_access_control (decl
);
9649 /* Look for __unused__ attribute */
9650 if (TREE_USED (TREE_TYPE (decl
)))
9651 TREE_USED (decl
) = 1;
9652 finish_decl (decl
, init
, NULL_TREE
);
9655 cp_error ("invalid declarator");
9658 innermost_code
= TREE_CODE (decl
);
9659 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
9660 ctype
= current_class_type
;
9662 && TREE_OPERAND (decl
, 0)
9663 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
9664 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
9665 == constructor_name_full (ctype
))
9666 || (DECL_NAME (TREE_OPERAND (decl
, 0))
9667 == constructor_name (ctype
)))))
9668 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9669 next
= &TREE_OPERAND (decl
, 0);
9671 if (ctype
!= NULL_TREE
9672 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
9673 && decl
== constructor_name (ctype
))
9675 sfk
= sfk_constructor
;
9676 ctor_return_type
= ctype
;
9681 case TEMPLATE_ID_EXPR
:
9683 tree fns
= TREE_OPERAND (decl
, 0);
9685 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9686 fns
= TREE_OPERAND (fns
, 0);
9689 if (TREE_CODE (dname
) == COMPONENT_REF
)
9690 dname
= TREE_OPERAND (dname
, 1);
9691 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9693 my_friendly_assert (is_overloaded_fn (dname
),
9695 dname
= DECL_NAME (get_first_fn (dname
));
9700 case IDENTIFIER_NODE
:
9701 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9706 if (C_IS_RESERVED_WORD (dname
))
9708 cp_error ("declarator-id missing; using reserved word `%D'",
9710 name
= IDENTIFIER_POINTER (dname
);
9712 else if (!IDENTIFIER_TYPENAME_P (dname
))
9713 name
= IDENTIFIER_POINTER (dname
);
9716 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9717 flags
= TYPENAME_FLAG
;
9718 ctor_return_type
= TREE_TYPE (dname
);
9719 sfk
= sfk_conversion
;
9720 if (IDENTIFIER_GLOBAL_VALUE (dname
)
9721 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (dname
))
9723 name
= IDENTIFIER_POINTER (dname
);
9725 name
= "<invalid operator>";
9732 /* Perform error checking, and decide on a ctype. */
9733 tree cname
= TREE_OPERAND (decl
, 0);
9734 if (cname
== NULL_TREE
)
9736 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9739 in_namespace
= TREE_OPERAND (decl
, 0);
9740 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9742 else if (! is_aggr_type (cname
, 1))
9743 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9744 /* Must test TREE_OPERAND (decl, 1), in case user gives
9745 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9746 else if (TREE_OPERAND (decl
, 1)
9747 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9749 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9750 || TREE_CODE (cname
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
9752 cp_error ("`%T::%D' is not a valid declarator", cname
,
9753 TREE_OPERAND (decl
, 1));
9754 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9755 cname
, TREE_OPERAND (decl
, 1));
9756 return void_type_node
;
9758 else if (ctype
== NULL_TREE
)
9760 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9761 TREE_OPERAND (decl
, 0) = ctype
;
9764 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9766 cp_error ("type `%T' is not derived from type `%T'",
9768 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9774 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9775 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9776 == constructor_name_full (ctype
))
9777 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9778 == constructor_name (ctype
))))
9779 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9780 next
= &TREE_OPERAND (decl
, 1);
9784 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9785 && constructor_name (ctype
) == decl
)
9787 sfk
= sfk_constructor
;
9788 ctor_return_type
= ctype
;
9790 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9791 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9792 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9793 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9795 sfk
= sfk_destructor
;
9796 ctor_return_type
= ctype
;
9798 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9799 next
= &TREE_OPERAND (decl
, 0);
9810 /* Parse error puts this typespec where
9811 a declarator should go. */
9812 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9813 if (TREE_TYPE (decl
) == current_class_type
)
9814 cp_error (" perhaps you want `%T' for a constructor",
9815 current_class_name
);
9816 dname
= DECL_NAME (decl
);
9817 name
= IDENTIFIER_POINTER (dname
);
9819 /* Avoid giving two errors for this. */
9820 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9822 declspecs
= tree_cons (NULL_TREE
, integer_type_node
, declspecs
);
9828 cp_compiler_error ("`%D' as declarator", decl
);
9829 return 0; /* We used to do a 155 abort here. */
9834 /* A function definition's declarator must have the form of
9835 a function declarator. */
9837 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9840 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9841 && innermost_code
!= CALL_EXPR
9842 && ! (ctype
&& declspecs
== NULL_TREE
))
9844 cp_error ("declaration of `%D' as non-function", dname
);
9845 return void_type_node
;
9848 /* Anything declared one level down from the top level
9849 must be one of the parameters of a function
9850 (because the body is at least two levels down). */
9852 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9853 by not allowing C++ class definitions to specify their parameters
9854 with xdecls (must be spec.d in the parmlist).
9856 Since we now wait to push a class scope until we are sure that
9857 we are in a legitimate method context, we must set oldcname
9858 explicitly (since current_class_name is not yet alive).
9860 We also want to avoid calling this a PARM if it is in a namespace. */
9862 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
9864 struct binding_level
*b
= current_binding_level
;
9865 current_binding_level
= b
->level_chain
;
9866 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9867 decl_context
= PARM
;
9868 current_binding_level
= b
;
9872 name
= decl_context
== PARM
? "parameter" : "type name";
9874 /* Look through the decl specs and record which ones appear.
9875 Some typespecs are defined as built-in typenames.
9876 Others, the ones that are modifiers of other types,
9877 are represented by bits in SPECBITS: set the bits for
9878 the modifiers that appear. Storage class keywords are also in SPECBITS.
9880 If there is a typedef name or a type, store the type in TYPE.
9881 This includes builtin typedefs such as `int'.
9883 Set EXPLICIT_INT if the type is `int' or `char' and did not
9884 come from a user typedef.
9886 Set LONGLONG if `long' is mentioned twice.
9888 For C++, constructors and destructors have their own fast treatment. */
9890 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
9895 /* Certain parse errors slip through. For example,
9896 `int class;' is not caught by the parser. Try
9897 weakly to recover here. */
9898 if (TREE_CODE (spec
) != TREE_LIST
)
9901 id
= TREE_VALUE (spec
);
9903 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9905 if (id
== ridpointers
[(int) RID_INT
]
9906 || id
== ridpointers
[(int) RID_CHAR
]
9907 || id
== ridpointers
[(int) RID_BOOL
]
9908 || id
== ridpointers
[(int) RID_WCHAR
])
9912 if (id
== ridpointers
[(int) RID_BOOL
])
9913 error ("`bool' is now a keyword");
9915 cp_error ("extraneous `%T' ignored", id
);
9919 if (id
== ridpointers
[(int) RID_INT
])
9921 else if (id
== ridpointers
[(int) RID_CHAR
])
9923 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
9927 /* C++ aggregate types. */
9928 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
9931 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
9933 type
= IDENTIFIER_TYPE_VALUE (id
);
9937 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
9939 if (ridpointers
[i
] == id
)
9941 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
9943 if (pedantic
&& ! in_system_header
&& warn_long_long
)
9944 pedwarn ("ISO C++ does not support `long long'");
9946 error ("`long long long' is too long for GCC");
9950 else if (RIDBIT_SETP (i
, specbits
))
9951 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
9952 RIDBIT_SET (i
, specbits
);
9957 /* C++ aggregate types. */
9958 else if (TREE_CODE (id
) == TYPE_DECL
)
9961 cp_error ("multiple declarations `%T' and `%T'", type
,
9965 type
= TREE_TYPE (id
);
9966 TREE_VALUE (spec
) = type
;
9971 error ("two or more data types in declaration of `%s'", name
);
9972 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9974 register tree t
= lookup_name (id
, 1);
9975 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
9976 error ("`%s' fails to be a typedef or built in type",
9977 IDENTIFIER_POINTER (id
));
9980 type
= TREE_TYPE (t
);
9982 /* See the code below that used this. */
9983 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
9988 else if (id
!= error_mark_node
)
9989 /* Can't change CLASS nodes into RECORD nodes here! */
9995 typedef_type
= type
;
9997 /* No type at all: default to `int', and set DEFAULTED_INT
9998 because it was not a user-defined typedef. */
10000 if (type
== NULL_TREE
10001 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
10002 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10003 || RIDBIT_SETP (RID_LONG
, specbits
)
10004 || RIDBIT_SETP (RID_SHORT
, specbits
)))
10006 /* These imply 'int'. */
10007 type
= integer_type_node
;
10011 if (sfk
!= sfk_none
)
10012 type
= check_special_function_return_type (sfk
, type
,
10015 else if (type
== NULL_TREE
)
10021 /* We handle `main' specially here, because 'main () { }' is so
10022 common. With no options, it is allowed. With -Wreturn-type,
10023 it is a warning. It is only an error with -pedantic-errors. */
10024 is_main
= (funcdef_flag
10025 && MAIN_NAME_P (dname
)
10026 && ctype
== NULL_TREE
10027 && in_namespace
== NULL_TREE
10028 && current_namespace
== global_namespace
);
10030 if (in_system_header
|| flag_ms_extensions
)
10031 /* Allow it, sigh. */;
10032 else if (pedantic
|| ! is_main
)
10033 cp_pedwarn ("ISO C++ forbids declaration of `%s' with no type",
10035 else if (warn_return_type
)
10036 cp_warning ("ISO C++ forbids declaration of `%s' with no type",
10039 type
= integer_type_node
;
10044 /* Now process the modifiers that were specified
10045 and check for invalid combinations. */
10047 /* Long double is a special combination. */
10049 if (RIDBIT_SETP (RID_LONG
, specbits
)
10050 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
10052 RIDBIT_RESET (RID_LONG
, specbits
);
10053 type
= build_qualified_type (long_double_type_node
,
10054 CP_TYPE_QUALS (type
));
10057 /* Check all other uses of type modifiers. */
10059 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10060 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10061 || RIDBIT_SETP (RID_LONG
, specbits
)
10062 || RIDBIT_SETP (RID_SHORT
, specbits
))
10066 if (TREE_CODE (type
) == REAL_TYPE
)
10067 error ("short, signed or unsigned invalid for `%s'", name
);
10068 else if (TREE_CODE (type
) != INTEGER_TYPE
)
10069 error ("long, short, signed or unsigned invalid for `%s'", name
);
10070 else if (RIDBIT_SETP (RID_LONG
, specbits
)
10071 && RIDBIT_SETP (RID_SHORT
, specbits
))
10072 error ("long and short specified together for `%s'", name
);
10073 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10074 || RIDBIT_SETP (RID_SHORT
, specbits
))
10076 error ("long or short specified with char for `%s'", name
);
10077 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10078 || RIDBIT_SETP (RID_SHORT
, specbits
))
10079 && TREE_CODE (type
) == REAL_TYPE
)
10080 error ("long or short specified with floating type for `%s'", name
);
10081 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10082 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
10083 error ("signed and unsigned given together for `%s'", name
);
10087 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
10089 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
10091 if (flag_pedantic_errors
)
10096 /* Discard the type modifiers if they are invalid. */
10099 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
10100 RIDBIT_RESET (RID_SIGNED
, specbits
);
10101 RIDBIT_RESET (RID_LONG
, specbits
);
10102 RIDBIT_RESET (RID_SHORT
, specbits
);
10107 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
10108 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
10110 error ("complex invalid for `%s'", name
);
10111 RIDBIT_RESET (RID_COMPLEX
, specbits
);
10114 /* Decide whether an integer type is signed or not.
10115 Optionally treat bitfields as signed by default. */
10116 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10119 It is implementation-defined whether a plain (neither
10120 explicitly signed or unsigned) char, short, int, or long
10121 bit-field is signed or unsigned.
10123 Naturally, we extend this to long long as well. Note that
10124 this does not include wchar_t. */
10125 || (bitfield
&& !flag_signed_bitfields
10126 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
10127 /* A typedef for plain `int' without `signed' can be
10128 controlled just like plain `int', but a typedef for
10129 `signed int' cannot be so controlled. */
10131 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
10132 && (TREE_CODE (type
) == INTEGER_TYPE
10133 || TREE_CODE (type
) == CHAR_TYPE
)
10134 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
10137 type
= long_long_unsigned_type_node
;
10138 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10139 type
= long_unsigned_type_node
;
10140 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10141 type
= short_unsigned_type_node
;
10142 else if (type
== char_type_node
)
10143 type
= unsigned_char_type_node
;
10144 else if (typedef_decl
)
10145 type
= unsigned_type (type
);
10147 type
= unsigned_type_node
;
10149 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10150 && type
== char_type_node
)
10151 type
= signed_char_type_node
;
10153 type
= long_long_integer_type_node
;
10154 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10155 type
= long_integer_type_node
;
10156 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10157 type
= short_integer_type_node
;
10159 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
10161 /* If we just have "complex", it is equivalent to
10162 "complex double", but if any modifiers at all are specified it is
10163 the complex form of TYPE. E.g, "complex short" is
10164 "complex short int". */
10166 if (defaulted_int
&& ! longlong
10167 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
10168 || RIDBIT_SETP (RID_SHORT
, specbits
)
10169 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10170 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
10171 type
= complex_double_type_node
;
10172 else if (type
== integer_type_node
)
10173 type
= complex_integer_type_node
;
10174 else if (type
== float_type_node
)
10175 type
= complex_float_type_node
;
10176 else if (type
== double_type_node
)
10177 type
= complex_double_type_node
;
10178 else if (type
== long_double_type_node
)
10179 type
= complex_long_double_type_node
;
10181 type
= build_complex_type (type
);
10184 if (sfk
== sfk_conversion
10185 && (RIDBIT_SETP (RID_CONST
, specbits
)
10186 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
10187 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
10188 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
10191 /* Set CONSTP if this declaration is `const', whether by
10192 explicit specification or via a typedef.
10193 Likewise for VOLATILEP. */
10195 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
10197 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
10199 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
10200 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10201 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10202 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10203 type
= cp_build_qualified_type (type
, type_quals
);
10205 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
10206 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
10207 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
10208 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
10209 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
10211 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10212 staticp
= 1 + (decl_context
== FIELD
);
10214 if (virtualp
&& staticp
== 2)
10216 cp_error ("member `%D' cannot be declared both virtual and static",
10220 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
10221 RIDBIT_RESET (RID_FRIEND
, specbits
);
10223 /* Warn if two storage classes are given. Default to `auto'. */
10225 if (RIDBIT_ANY_SET (specbits
))
10227 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
10228 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
10229 if (decl_context
== PARM
&& nclasses
> 0)
10230 error ("storage class specifiers invalid in parameter declarations");
10231 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10233 if (decl_context
== PARM
)
10234 error ("typedef declaration invalid in parameter declaration");
10237 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
10238 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
10241 /* Give error if `virtual' is used outside of class declaration. */
10243 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
10245 error ("virtual outside class declaration");
10249 /* Static anonymous unions are dealt with here. */
10250 if (staticp
&& decl_context
== TYPENAME
10251 && TREE_CODE (declspecs
) == TREE_LIST
10252 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
10253 decl_context
= FIELD
;
10255 /* Warn about storage classes that are invalid for certain
10256 kinds of declarations (parameters, typenames, etc.). */
10259 error ("multiple storage classes in declaration of `%s'", name
);
10260 else if (decl_context
!= NORMAL
&& nclasses
> 0)
10262 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
10263 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
10264 || RIDBIT_SETP (RID_AUTO
, specbits
)))
10266 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10268 else if (decl_context
== FIELD
10269 /* C++ allows static class elements */
10270 && RIDBIT_SETP (RID_STATIC
, specbits
))
10271 /* C++ also allows inlines and signed and unsigned elements,
10272 but in those cases we don't come in here. */
10276 if (decl_context
== FIELD
)
10278 tree tmp
= NULL_TREE
;
10279 register int op
= 0;
10283 /* Avoid trying to get an operand off an identifier node. */
10284 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10287 tmp
= TREE_OPERAND (declarator
, 0);
10288 op
= IDENTIFIER_OPNAME_P (tmp
);
10289 if (IDENTIFIER_TYPENAME_P (tmp
))
10291 if (IDENTIFIER_GLOBAL_VALUE (tmp
)
10292 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (tmp
))
10294 name
= IDENTIFIER_POINTER (tmp
);
10296 name
= "<invalid operator>";
10299 error ("storage class specified for %s `%s'",
10300 op
? "member operator" : "field",
10305 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10306 error ("storage class specified for parameter `%s'", name
);
10308 error ("storage class specified for typename");
10310 RIDBIT_RESET (RID_REGISTER
, specbits
);
10311 RIDBIT_RESET (RID_AUTO
, specbits
);
10312 RIDBIT_RESET (RID_EXTERN
, specbits
);
10315 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
10317 if (toplevel_bindings_p ())
10319 /* It's common practice (and completely valid) to have a const
10320 be initialized and declared extern. */
10321 if (!(type_quals
& TYPE_QUAL_CONST
))
10322 warning ("`%s' initialized and declared `extern'", name
);
10325 error ("`%s' has both `extern' and initializer", name
);
10327 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
10328 && ! toplevel_bindings_p ())
10329 error ("nested function `%s' declared `extern'", name
);
10330 else if (toplevel_bindings_p ())
10332 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10333 error ("top-level declaration of `%s' specifies `auto'", name
);
10336 if (nclasses
> 0 && friendp
)
10337 error ("storage class specifiers invalid in friend function declarations");
10339 /* Now figure out the structure of the declarator proper.
10340 Descend through it, creating more complex types, until we reach
10341 the declared identifier (or NULL_TREE, in an absolute declarator). */
10343 inner_attrs
= NULL_TREE
;
10346 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
10347 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
10349 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
10350 an INDIRECT_REF (for *...),
10351 a CALL_EXPR (for ...(...)),
10352 an identifier (for the name being declared)
10353 or a null pointer (for the place in an absolute declarator
10354 where the name was omitted).
10355 For the last two cases, we have just exited the loop.
10357 For C++ it could also be
10358 a SCOPE_REF (for class :: ...). In this case, we have converted
10359 sensible names to types, and those are the values we use to
10360 qualify the member name.
10361 an ADDR_EXPR (for &...),
10362 a BIT_NOT_EXPR (for destructors)
10364 At this point, TYPE is the type of elements of an array,
10365 or for a function to return, or for a pointer to point to.
10366 After this sequence of ifs, TYPE is the type of the
10367 array or function or pointer, and DECLARATOR has had its
10368 outermost layer removed. */
10370 if (type
== error_mark_node
)
10372 if (TREE_CODE (declarator
) == SCOPE_REF
)
10373 declarator
= TREE_OPERAND (declarator
, 1);
10375 declarator
= TREE_OPERAND (declarator
, 0);
10378 if (quals
!= NULL_TREE
10379 && (declarator
== NULL_TREE
10380 || TREE_CODE (declarator
) != SCOPE_REF
))
10382 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
10383 ctype
= TYPE_METHOD_BASETYPE (type
);
10384 if (ctype
!= NULL_TREE
)
10386 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
10387 grok_method_quals (ctype
, dummy
, quals
);
10388 type
= TREE_TYPE (dummy
);
10389 ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
)));
10394 /* See the comment for the TREE_LIST case, below. */
10397 else if (inner_attrs
)
10399 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10400 inner_attrs
= NULL_TREE
;
10403 switch (TREE_CODE (declarator
))
10407 /* We encode a declarator with embedded attributes using
10408 a TREE_LIST. The attributes apply to the declarator
10409 directly inside them, so we have to skip an iteration
10410 before applying them to the type. If the declarator just
10411 inside is the declarator-id, we apply the attrs to the
10413 inner_attrs
= TREE_PURPOSE (declarator
);
10415 declarator
= TREE_VALUE (declarator
);
10421 register tree size
;
10423 size
= TREE_OPERAND (declarator
, 1);
10425 /* VC++ spells a zero-sized array with []. */
10426 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
10427 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10428 size
= integer_zero_node
;
10430 declarator
= TREE_OPERAND (declarator
, 0);
10432 type
= create_array_type_for_decl (dname
, type
, size
);
10434 /* VLAs never work as fields. */
10435 if (decl_context
== FIELD
&& !processing_template_decl
10436 && TREE_CODE (type
) == ARRAY_TYPE
10437 && TYPE_DOMAIN (type
) != NULL_TREE
10438 && !TREE_CONSTANT (TYPE_MAX_VALUE (TYPE_DOMAIN (type
))))
10440 cp_error ("size of member `%D' is not constant", dname
);
10441 /* Proceed with arbitrary constant size, so that offset
10442 computations don't get confused. */
10443 type
= create_array_type_for_decl (dname
, TREE_TYPE (type
),
10455 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
10456 tree inner_decl
= TREE_OPERAND (declarator
, 0);
10458 /* Declaring a function type.
10459 Make sure we have a valid type for the function to return. */
10461 /* We now know that the TYPE_QUALS don't apply to the
10462 decl, but to its return type. */
10463 type_quals
= TYPE_UNQUALIFIED
;
10465 /* Warn about some types functions can't return. */
10467 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10469 error ("`%s' declared as function returning a function", name
);
10470 type
= integer_type_node
;
10472 if (TREE_CODE (type
) == ARRAY_TYPE
)
10474 error ("`%s' declared as function returning an array", name
);
10475 type
= integer_type_node
;
10478 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
10479 inner_decl
= TREE_OPERAND (inner_decl
, 1);
10481 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
10482 inner_decl
= dname
;
10484 /* Pick up type qualifiers which should be applied to `this'. */
10485 quals
= CALL_DECLARATOR_QUALS (declarator
);
10487 /* Pick up the exception specifications. */
10488 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
10490 /* Say it's a definition only for the CALL_EXPR
10491 closest to the identifier. */
10494 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
10495 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
10496 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
10498 if (ctype
== NULL_TREE
10499 && decl_context
== FIELD
10501 && (friendp
== 0 || dname
== current_class_name
))
10502 ctype
= current_class_type
;
10504 if (ctype
&& sfk
== sfk_conversion
)
10505 TYPE_HAS_CONVERSION (ctype
) = 1;
10506 if (ctype
&& constructor_name (ctype
) == dname
)
10508 /* We are within a class's scope. If our declarator name
10509 is the same as the class name, and we are defining
10510 a function, then it is a constructor/destructor, and
10511 therefore returns a void type. */
10513 if (flags
== DTOR_FLAG
)
10515 /* ISO C++ 12.4/2. A destructor may not be
10516 declared const or volatile. A destructor may
10519 error ("destructor cannot be static member function");
10522 cp_error ("destructors may not be `%s'",
10523 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10526 if (decl_context
== FIELD
)
10528 if (! member_function_or_else (ctype
,
10529 current_class_type
,
10531 return void_type_node
;
10534 else /* It's a constructor. */
10536 if (explicitp
== 1)
10538 /* ISO C++ 12.1. A constructor may not be
10539 declared const or volatile. A constructor may
10540 not be virtual. A constructor may not be
10543 error ("constructor cannot be static member function");
10546 pedwarn ("constructors cannot be declared virtual");
10551 cp_error ("constructors may not be `%s'",
10552 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10556 RID_BIT_TYPE tmp_bits
;
10557 memcpy (&tmp_bits
, &specbits
, sizeof (RID_BIT_TYPE
));
10558 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10559 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10560 if (RIDBIT_ANY_SET (tmp_bits
))
10561 error ("return value type specifier for constructor ignored");
10563 if (decl_context
== FIELD
)
10565 if (! member_function_or_else (ctype
,
10566 current_class_type
,
10568 return void_type_node
;
10569 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10570 if (sfk
!= sfk_constructor
)
10574 if (decl_context
== FIELD
)
10580 error ("can't initialize friend function `%s'", name
);
10583 /* Cannot be both friend and virtual. */
10584 error ("virtual functions cannot be friends");
10585 RIDBIT_RESET (RID_FRIEND
, specbits
);
10588 if (decl_context
== NORMAL
)
10589 error ("friend declaration not in class definition");
10590 if (current_function_decl
&& funcdef_flag
)
10591 cp_error ("can't define friend function `%s' in a local class definition",
10595 /* Construct the function type and go to the next
10596 inner layer of declarator. */
10598 declarator
= TREE_OPERAND (declarator
, 0);
10600 /* FIXME: This is where default args should be fully
10603 arg_types
= grokparms (inner_parms
);
10605 if (declarator
&& flags
== DTOR_FLAG
)
10607 /* A destructor declared in the body of a class will
10608 be represented as a BIT_NOT_EXPR. But, we just
10609 want the underlying IDENTIFIER. */
10610 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10611 declarator
= TREE_OPERAND (declarator
, 0);
10613 if (arg_types
!= void_list_node
)
10615 cp_error ("destructors may not have parameters");
10616 arg_types
= void_list_node
;
10617 last_function_parms
= NULL_TREE
;
10621 /* ANSI says that `const int foo ();'
10622 does not make the function foo const. */
10623 type
= build_function_type (type
, arg_types
);
10627 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10628 if (TREE_PURPOSE (t
)
10629 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10631 add_defarg_fn (type
);
10640 /* Filter out pointers-to-references and references-to-references.
10641 We can get these if a TYPE_DECL is used. */
10643 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10645 error ("cannot declare %s to references",
10646 TREE_CODE (declarator
) == ADDR_EXPR
10647 ? "references" : "pointers");
10648 declarator
= TREE_OPERAND (declarator
, 0);
10652 if (TREE_CODE (type
) == OFFSET_TYPE
10653 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10654 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10656 cp_error ("cannot declare pointer to `%#T' member",
10658 type
= TREE_TYPE (type
);
10661 /* Merge any constancy or volatility into the target type
10662 for the pointer. */
10664 /* We now know that the TYPE_QUALS don't apply to the decl,
10665 but to the target of the pointer. */
10666 type_quals
= TYPE_UNQUALIFIED
;
10668 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10670 if (TREE_CODE (type
) == VOID_TYPE
)
10671 error ("invalid type: `void &'");
10673 type
= build_reference_type (type
);
10675 else if (TREE_CODE (type
) == METHOD_TYPE
)
10676 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10678 type
= build_pointer_type (type
);
10680 /* Process a list of type modifier keywords (such as
10681 const or volatile) that were given inside the `*' or `&'. */
10683 if (TREE_TYPE (declarator
))
10685 register tree typemodlist
;
10691 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10692 typemodlist
= TREE_CHAIN (typemodlist
))
10694 tree qualifier
= TREE_VALUE (typemodlist
);
10696 if (qualifier
== ridpointers
[(int) RID_CONST
])
10698 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10700 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10705 error ("invalid type modifier within pointer declarator");
10709 pedwarn ("duplicate `const'");
10711 pedwarn ("duplicate `volatile'");
10713 pedwarn ("duplicate `restrict'");
10715 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10716 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10717 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10718 if (TREE_CODE (declarator
) == ADDR_EXPR
10719 && (constp
|| volatilep
))
10722 pedwarn ("discarding `const' applied to a reference");
10724 pedwarn ("discarding `volatile' applied to a reference");
10725 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10727 type
= cp_build_qualified_type (type
, type_quals
);
10729 declarator
= TREE_OPERAND (declarator
, 0);
10735 /* We have converted type names to NULL_TREE if the
10736 name was bogus, or to a _TYPE node, if not.
10738 The variable CTYPE holds the type we will ultimately
10739 resolve to. The code here just needs to build
10740 up appropriate member types. */
10741 tree sname
= TREE_OPERAND (declarator
, 1);
10744 /* Destructors can have their visibilities changed as well. */
10745 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10746 sname
= TREE_OPERAND (sname
, 0);
10748 if (TREE_COMPLEXITY (declarator
) == 0)
10749 /* This needs to be here, in case we are called
10750 multiple times. */ ;
10751 else if (TREE_COMPLEXITY (declarator
) == -1)
10752 /* Namespace member. */
10753 pop_decl_namespace ();
10754 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10755 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10756 else if (! IS_AGGR_TYPE_CODE
10757 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10759 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10761 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10762 that refer to ctype. They couldn't be resolved earlier
10763 because we hadn't pushed into the class yet.
10764 Example: resolve 'B<T>::type' in
10765 'B<typename B<T>::type> B<T>::f () { }'. */
10766 if (current_template_parms
10767 && uses_template_parms (type
)
10768 && uses_template_parms (current_class_type
))
10770 tree args
= current_template_args ();
10771 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10774 /* This pop_nested_class corresponds to the
10775 push_nested_class used to push into class scope for
10776 parsing the argument list of a function decl, in
10778 pop_nested_class ();
10779 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10782 my_friendly_abort (16);
10784 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10786 /* We had a reference to a global decl, or
10787 perhaps we were given a non-aggregate typedef,
10788 in which case we cleared this out, and should just
10789 keep going as though it wasn't there. */
10790 declarator
= sname
;
10793 ctype
= TREE_OPERAND (declarator
, 0);
10796 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10798 /* You're supposed to have one `template <...>'
10799 for every template class, but you don't need one
10800 for a full specialization. For example:
10802 template <class T> struct S{};
10803 template <> struct S<int> { void f(); };
10804 void S<int>::f () {}
10806 is correct; there shouldn't be a `template <>' for
10807 the definition of `S<int>::f'. */
10808 if (CLASSTYPE_TEMPLATE_INFO (t
)
10809 && (CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
10810 || uses_template_parms (CLASSTYPE_TI_ARGS (t
))))
10811 template_count
+= 1;
10813 t
= TYPE_MAIN_DECL (t
);
10814 if (DECL_LANG_SPECIFIC (t
))
10815 t
= DECL_CONTEXT (t
);
10820 if (sname
== NULL_TREE
)
10823 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10825 /* This is the `standard' use of the scoping operator:
10826 basetype :: member . */
10828 if (ctype
== current_class_type
)
10834 Is this ill-formed? */
10837 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10840 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10842 if (current_class_type
== NULL_TREE
|| friendp
)
10843 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10844 TYPE_ARG_TYPES (type
));
10847 cp_error ("cannot declare member function `%T::%s' within `%T'",
10848 ctype
, name
, current_class_type
);
10849 return void_type_node
;
10852 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10853 || COMPLETE_TYPE_P (complete_type (ctype
)))
10855 /* Have to move this code elsewhere in this function.
10856 this code is used for i.e., typedef int A::M; M *pm;
10858 It is? How? jason 10/2/94 */
10860 if (current_class_type
)
10862 cp_error ("cannot declare member `%T::%s' within `%T'",
10863 ctype
, name
, current_class_type
);
10864 return void_type_node
;
10866 type
= build_offset_type (ctype
, type
);
10870 incomplete_type_error (NULL_TREE
, ctype
);
10871 return error_mark_node
;
10874 declarator
= sname
;
10876 else if (TREE_CODE (sname
) == SCOPE_REF
)
10877 my_friendly_abort (17);
10881 declarator
= TREE_OPERAND (declarator
, 1);
10882 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10883 /* In this case, we will deal with it later. */
10887 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10888 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10889 TYPE_ARG_TYPES (type
));
10891 type
= build_offset_type (ctype
, type
);
10898 declarator
= TREE_OPERAND (declarator
, 0);
10903 case ENUMERAL_TYPE
:
10904 declarator
= NULL_TREE
;
10908 declarator
= NULL_TREE
;
10912 my_friendly_abort (158);
10916 /* See the comment for the TREE_LIST case, above. */
10919 if (! ignore_attrs
)
10920 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10922 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
10924 attrlist
= build_tree_list (NULL_TREE
, inner_attrs
);
10927 /* Now TYPE has the actual type. */
10929 if (explicitp
== 1 || (explicitp
&& friendp
))
10931 /* [dcl.fct.spec] The explicit specifier shall only be used in
10932 declarations of constructors within a class definition. */
10933 error ("only declarations of constructors can be `explicit'");
10937 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10939 if (current_class_name
== NULL_TREE
|| decl_context
== PARM
|| friendp
)
10941 error ("non-member `%s' cannot be declared `mutable'", name
);
10942 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10944 else if (decl_context
== TYPENAME
|| RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10946 error ("non-object member `%s' cannot be declared `mutable'", name
);
10947 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10949 else if (TREE_CODE (type
) == FUNCTION_TYPE
10950 || TREE_CODE (type
) == METHOD_TYPE
)
10952 error ("function `%s' cannot be declared `mutable'", name
);
10953 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10957 error ("static `%s' cannot be declared `mutable'", name
);
10958 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10960 else if (type_quals
& TYPE_QUAL_CONST
)
10962 error ("const `%s' cannot be declared `mutable'", name
);
10963 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10967 if (declarator
== NULL_TREE
10968 || TREE_CODE (declarator
) == IDENTIFIER_NODE
10969 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
10970 && (TREE_CODE (type
) == FUNCTION_TYPE
10971 || TREE_CODE (type
) == METHOD_TYPE
)))
10973 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10975 cp_error ("template-id `%D' used as a declarator", declarator
);
10976 declarator
= dname
;
10979 /* Unexpected declarator format. */
10980 my_friendly_abort (990210);
10982 /* If this is declaring a typedef name, return a TYPE_DECL. */
10984 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
10988 /* Note that the grammar rejects storage classes
10989 in typenames, fields or parameters. */
10990 if (current_lang_name
== lang_name_java
)
10991 TYPE_FOR_JAVA (type
) = 1;
10993 if (decl_context
== FIELD
)
10995 if (declarator
== constructor_name (current_class_type
))
10996 cp_pedwarn ("ISO C++ forbids nested type `%D' with same name as enclosing class",
10998 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
11001 decl
= build_decl (TYPE_DECL
, declarator
, type
);
11003 /* If the user declares "typedef struct {...} foo" then the
11004 struct will have an anonymous name. Fill that name in now.
11005 Nothing can refer to it, so nothing needs know about the name
11007 if (type
!= error_mark_node
11009 && TYPE_NAME (type
)
11010 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
11011 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
11012 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
11014 tree oldname
= TYPE_NAME (type
);
11017 /* Replace the anonymous name with the real name everywhere. */
11018 lookup_tag_reverse (type
, declarator
);
11019 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
11020 if (TYPE_NAME (t
) == oldname
)
11021 TYPE_NAME (t
) = decl
;
11023 if (TYPE_LANG_SPECIFIC (type
))
11024 TYPE_WAS_ANONYMOUS (type
) = 1;
11026 /* If this is a typedef within a template class, the nested
11027 type is a (non-primary) template. The name for the
11028 template needs updating as well. */
11029 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
11030 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
11031 = TYPE_IDENTIFIER (type
);
11034 DECL_ASSEMBLER_NAME (decl
) = mangle_type (type
);
11037 /* XXX Temporarily set the scope.
11038 When returning, start_decl expects it as NULL_TREE,
11039 and will then then set it using pushdecl. */
11040 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
11041 if (current_class_type
)
11042 DECL_CONTEXT (decl
) = current_class_type
;
11044 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
11046 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
11047 DECL_ASSEMBLER_NAME (decl
)
11048 = get_identifier (build_overload_name (type
, 1, 1));
11049 DECL_CONTEXT (decl
) = NULL_TREE
;
11052 /* FIXME remangle member functions; member functions of a
11053 type with external linkage have external linkage. */
11056 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11058 cp_error_at ("typedef name may not be class-qualified", decl
);
11063 if (ctype
== NULL_TREE
)
11065 if (TREE_CODE (type
) != METHOD_TYPE
)
11066 cp_error_at ("invalid type qualifier for non-member function type", decl
);
11068 ctype
= TYPE_METHOD_BASETYPE (type
);
11070 if (ctype
!= NULL_TREE
)
11071 grok_method_quals (ctype
, decl
, quals
);
11074 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
11075 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
11076 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
11078 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
11079 inlinep
, friendp
, raises
!= NULL_TREE
);
11082 error ("typedef declaration includes an initializer");
11087 /* Detect the case of an array type of unspecified size
11088 which came, as such, direct from a typedef name.
11089 We must copy the type, so that each identifier gets
11090 a distinct type, so that each identifier's size can be
11091 controlled separately by its own initializer. */
11093 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
11094 && TYPE_DOMAIN (type
) == NULL_TREE
)
11096 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
11099 /* If this is a type name (such as, in a cast or sizeof),
11100 compute the type and return it now. */
11102 if (decl_context
== TYPENAME
)
11104 /* Note that the grammar rejects storage classes
11105 in typenames, fields or parameters. */
11106 if (type_quals
!= TYPE_UNQUALIFIED
)
11107 type_quals
= TYPE_UNQUALIFIED
;
11109 /* Special case: "friend class foo" looks like a TYPENAME context. */
11112 if (type_quals
!= TYPE_UNQUALIFIED
)
11114 cp_error ("type qualifiers specified for friend class declaration");
11115 type_quals
= TYPE_UNQUALIFIED
;
11119 cp_error ("`inline' specified for friend class declaration");
11123 /* Until core issue 180 is resolved, allow 'friend typename A::B'.
11124 But don't allow implicit typenames except with a class-key. */
11125 if (!current_aggr
&& (TREE_CODE (type
) != TYPENAME_TYPE
11126 || IMPLICIT_TYPENAME_P (type
)))
11128 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
11129 cp_pedwarn ("template parameters cannot be friends");
11130 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
11132 friend declaration requires class-key, i.e. `friend class %T::%T'",
11133 constructor_name (current_class_type
),
11134 TYPE_IDENTIFIER (type
));
11137 friend declaration requires class-key, i.e. `friend %#T'",
11141 /* Only try to do this stuff if we didn't already give up. */
11142 if (type
!= integer_type_node
)
11144 decl_type_access_control (TYPE_NAME (type
));
11146 /* A friendly class? */
11147 if (current_class_type
)
11148 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
11150 cp_error ("trying to make class `%T' a friend of global scope",
11153 type
= void_type_node
;
11158 if (ctype
== NULL_TREE
)
11160 if (TREE_CODE (type
) != METHOD_TYPE
)
11161 cp_error ("invalid qualifiers on non-member function type");
11163 ctype
= TYPE_METHOD_BASETYPE (type
);
11167 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
11168 grok_method_quals (ctype
, dummy
, quals
);
11169 type
= TREE_TYPE (dummy
);
11175 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
11176 && decl_context
!= CATCHPARM
11177 && TREE_CODE (type
) != UNION_TYPE
11180 cp_error ("abstract declarator `%T' used as declaration", type
);
11181 declarator
= make_anon_name ();
11184 /* `void' at top level (not within pointer)
11185 is allowed only in typedefs or type names.
11186 We don't complain about parms either, but that is because
11187 a better error message can be made later. */
11189 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
11192 error ("unnamed variable or field declared void");
11193 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
11195 if (IDENTIFIER_OPNAME_P (declarator
))
11196 my_friendly_abort (356);
11198 error ("variable or field `%s' declared void", name
);
11201 error ("variable or field declared void");
11202 type
= integer_type_node
;
11205 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
11206 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
11208 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
11210 if (ctype
|| in_namespace
)
11211 error ("cannot use `::' in parameter declaration");
11213 /* A parameter declared as an array of T is really a pointer to T.
11214 One declared as a function is really a pointer to a function.
11215 One declared as a member is really a pointer to member. */
11217 if (TREE_CODE (type
) == ARRAY_TYPE
)
11219 /* Transfer const-ness of array into that of type pointed to. */
11220 type
= build_pointer_type (TREE_TYPE (type
));
11221 type_quals
= TYPE_UNQUALIFIED
;
11223 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11224 type
= build_pointer_type (type
);
11225 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11226 type
= build_pointer_type (type
);
11230 register tree decl
;
11232 if (decl_context
== PARM
)
11234 decl
= build_decl (PARM_DECL
, declarator
, type
);
11236 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
11237 inlinep
, friendp
, raises
!= NULL_TREE
);
11239 /* Compute the type actually passed in the parmlist,
11240 for the case where there is no prototype.
11241 (For example, shorts and chars are passed as ints.)
11242 When there is a prototype, this is overridden later. */
11244 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
11246 else if (decl_context
== FIELD
)
11248 if (type
== error_mark_node
)
11250 /* Happens when declaring arrays of sizes which
11251 are error_mark_node, for example. */
11254 else if (in_namespace
&& !friendp
)
11256 /* Something like struct S { int N::j; }; */
11257 cp_error ("invalid use of `::'");
11260 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11263 tree function_context
;
11265 /* We catch the others as conflicts with the builtin
11267 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
11269 cp_error ("function `%D' cannot be declared friend",
11276 if (ctype
== NULL_TREE
)
11277 ctype
= current_class_type
;
11279 if (ctype
== NULL_TREE
)
11281 cp_error ("can't make `%D' into a method -- not in a class",
11283 return void_type_node
;
11286 /* ``A union may [ ... ] not [ have ] virtual functions.''
11288 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
11290 cp_error ("function `%D' declared virtual inside a union",
11292 return void_type_node
;
11295 if (declarator
== ansi_opname (NEW_EXPR
)
11296 || declarator
== ansi_opname (VEC_NEW_EXPR
)
11297 || declarator
== ansi_opname (DELETE_EXPR
)
11298 || declarator
== ansi_opname (VEC_DELETE_EXPR
))
11302 cp_error ("`%D' cannot be declared virtual, since it is always static",
11307 else if (staticp
< 2)
11308 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11309 TYPE_ARG_TYPES (type
));
11312 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
11313 function_context
= (ctype
!= NULL_TREE
) ?
11314 decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
11315 publicp
= (! friendp
|| ! staticp
)
11316 && function_context
== NULL_TREE
;
11317 decl
= grokfndecl (ctype
, type
,
11318 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
11319 ? declarator
: dname
,
11321 virtualp
, flags
, quals
, raises
,
11322 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
11323 funcdef_flag
, template_count
, in_namespace
);
11324 if (decl
== NULL_TREE
)
11327 /* This clobbers the attrs stored in `decl' from `attrlist'. */
11328 /* The decl and setting of decl_machine_attr is also turned off. */
11329 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
11332 /* [class.conv.ctor]
11334 A constructor declared without the function-specifier
11335 explicit that can be called with a single parameter
11336 specifies a conversion from the type of its first
11337 parameter to the type of its class. Such a constructor
11338 is called a converting constructor. */
11339 if (explicitp
== 2)
11340 DECL_NONCONVERTING_P (decl
) = 1;
11341 else if (DECL_CONSTRUCTOR_P (decl
))
11343 /* The constructor can be called with exactly one
11344 parameter if there is at least one parameter, and
11345 any subsequent parameters have default arguments.
11346 We don't look at the first parameter, which is
11347 really just the `this' parameter for the new
11350 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
11352 /* Skip the `in_chrg' argument too, if present. */
11353 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
11354 arg_types
= TREE_CHAIN (arg_types
);
11356 if (arg_types
== void_list_node
11358 && TREE_CHAIN (arg_types
)
11359 && TREE_CHAIN (arg_types
) != void_list_node
11360 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
11361 DECL_NONCONVERTING_P (decl
) = 1;
11364 else if (TREE_CODE (type
) == METHOD_TYPE
)
11366 /* We only get here for friend declarations of
11367 members of other classes. */
11368 /* All method decls are public, so tell grokfndecl to set
11369 TREE_PUBLIC, also. */
11370 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
11371 virtualp
, flags
, quals
, raises
,
11372 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
11373 template_count
, in_namespace
);
11374 if (decl
== NULL_TREE
)
11377 else if (!staticp
&& ! processing_template_decl
11378 && !COMPLETE_TYPE_P (complete_type (type
))
11379 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
11382 cp_error ("field `%D' has incomplete type", declarator
);
11384 cp_error ("name `%T' has incomplete type", type
);
11386 /* If we're instantiating a template, tell them which
11387 instantiation made the field's type be incomplete. */
11388 if (current_class_type
11389 && TYPE_NAME (current_class_type
)
11390 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
11391 && declspecs
&& TREE_VALUE (declspecs
)
11392 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
11393 cp_error (" in instantiation of template `%T'",
11394 current_class_type
);
11396 type
= error_mark_node
;
11403 error ("`%s' is neither function nor member function; cannot be declared friend",
11404 IDENTIFIER_POINTER (declarator
));
11412 /* Friends are treated specially. */
11413 if (ctype
== current_class_type
)
11414 warning ("member functions are implicitly friends of their class");
11417 tree t
= NULL_TREE
;
11418 if (decl
&& DECL_NAME (decl
))
11420 if (template_class_depth (current_class_type
) == 0)
11423 = check_explicit_specialization
11425 template_count
, 2 * (funcdef_flag
!= 0) + 4);
11426 if (decl
== error_mark_node
)
11427 return error_mark_node
;
11430 t
= do_friend (ctype
, declarator
, decl
,
11431 last_function_parms
, attrlist
, flags
, quals
,
11434 if (t
&& funcdef_flag
)
11437 return void_type_node
;
11441 /* Structure field. It may not be a function, except for C++ */
11443 if (decl
== NULL_TREE
)
11449 /* An attempt is being made to initialize a non-static
11450 member. But, from [class.mem]:
11452 4 A member-declarator can contain a
11453 constant-initializer only if it declares a static
11454 member (_class.static_) of integral or enumeration
11455 type, see _class.static.data_.
11457 This used to be relatively common practice, but
11458 the rest of the compiler does not correctly
11459 handle the initialization unless the member is
11460 static so we make it static below. */
11461 cp_pedwarn ("ISO C++ forbids initialization of member `%D'",
11463 cp_pedwarn ("making `%D' static", declarator
);
11467 if (uses_template_parms (type
))
11468 /* We'll check at instantiation time. */
11470 else if (check_static_variable_definition (declarator
,
11472 /* If we just return the declaration, crashes
11473 will sometimes occur. We therefore return
11474 void_type_node, as if this was a friend
11475 declaration, to cause callers to completely
11476 ignore this declaration. */
11477 return void_type_node
;
11480 /* 9.2p13 [class.mem] */
11481 if (declarator
== constructor_name (current_class_type
)
11482 /* The standard does not allow non-static data members
11483 here either, but we agreed at the 10/99 meeting
11484 to change that in TC 1 so that they are allowed in
11485 classes with no user-defined constructors. */
11487 cp_pedwarn ("ISO C++ forbids static data member `%D' with same name as enclosing class",
11492 /* C++ allows static class members. All other work
11493 for this is done by grokfield. */
11494 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
11495 TREE_STATIC (decl
) = 1;
11496 /* In class context, 'static' means public access. */
11497 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
11501 decl
= build_decl (FIELD_DECL
, declarator
, type
);
11502 DECL_NONADDRESSABLE_P (decl
) = bitfield
;
11503 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11505 DECL_MUTABLE_P (decl
) = 1;
11506 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11510 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
11511 inlinep
, friendp
, raises
!= NULL_TREE
);
11514 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11516 tree original_name
;
11522 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11523 original_name
= dname
;
11525 original_name
= declarator
;
11527 if (RIDBIT_SETP (RID_AUTO
, specbits
))
11528 error ("storage class `auto' invalid for function `%s'", name
);
11529 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11530 error ("storage class `register' invalid for function `%s'", name
);
11532 /* Function declaration not at top level.
11533 Storage classes other than `extern' are not allowed
11534 and `extern' makes no difference. */
11535 if (! toplevel_bindings_p ()
11536 && (RIDBIT_SETP (RID_STATIC
, specbits
)
11537 || RIDBIT_SETP (RID_INLINE
, specbits
))
11540 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11541 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
11543 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
11546 if (ctype
== NULL_TREE
)
11550 error ("virtual non-class function `%s'", name
);
11554 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
11555 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11556 TYPE_ARG_TYPES (type
));
11558 /* Record presence of `static'. */
11559 publicp
= (ctype
!= NULL_TREE
11560 || RIDBIT_SETP (RID_EXTERN
, specbits
)
11561 || !RIDBIT_SETP (RID_STATIC
, specbits
));
11563 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
11564 virtualp
, flags
, quals
, raises
,
11566 publicp
, inlinep
, funcdef_flag
,
11567 template_count
, in_namespace
);
11568 if (decl
== NULL_TREE
)
11573 int illegal_static
= 0;
11575 /* Don't allow a static member function in a class, and forbid
11576 declaring main to be static. */
11577 if (TREE_CODE (type
) == METHOD_TYPE
)
11579 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11580 illegal_static
= 1;
11582 else if (current_function_decl
)
11584 /* FIXME need arm citation */
11585 error ("cannot declare static function inside another function");
11586 illegal_static
= 1;
11589 if (illegal_static
)
11592 RIDBIT_RESET (RID_STATIC
, specbits
);
11598 /* It's a variable. */
11600 /* An uninitialized decl with `extern' is a reference. */
11601 decl
= grokvardecl (type
, declarator
, &specbits
,
11603 (type_quals
& TYPE_QUAL_CONST
) != 0,
11605 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11606 inlinep
, friendp
, raises
!= NULL_TREE
);
11610 DECL_CONTEXT (decl
) = ctype
;
11613 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11615 RIDBIT_RESET (RID_STATIC
, specbits
);
11617 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11619 cp_error ("static member `%D' declared `register'", decl
);
11620 RIDBIT_RESET (RID_REGISTER
, specbits
);
11622 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11624 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11626 RIDBIT_RESET (RID_EXTERN
, specbits
);
11631 my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE
, specbits
), 19990927);
11633 /* Record `register' declaration for warnings on &
11634 and in case doing stupid register allocation. */
11636 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11637 DECL_REGISTER (decl
) = 1;
11639 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11640 DECL_THIS_EXTERN (decl
) = 1;
11642 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11643 DECL_THIS_STATIC (decl
) = 1;
11645 /* Record constancy and volatility. There's no need to do this
11646 when processing a template; we'll do this for the instantiated
11647 declaration based on the type of DECL. */
11648 if (!processing_template_decl
)
11649 c_apply_type_quals_to_decl (type_quals
, decl
);
11655 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11656 An empty exprlist is a parmlist. An exprlist which
11657 contains only identifiers at the global level
11658 is a parmlist. Otherwise, it is an exprlist. */
11661 parmlist_is_exprlist (exprs
)
11664 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11667 if (toplevel_bindings_p ())
11669 /* At the global level, if these are all identifiers,
11670 then it is a parmlist. */
11673 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11675 exprs
= TREE_CHAIN (exprs
);
11682 /* Subroutine of start_function. Ensure that each of the parameter
11683 types (as listed in PARMS) is complete, as is required for a
11684 function definition. */
11687 require_complete_types_for_parms (parms
)
11690 for (; parms
; parms
= TREE_CHAIN (parms
))
11692 if (VOID_TYPE_P (TREE_TYPE (parms
)))
11693 /* grokparms will have already issued an error */
11694 TREE_TYPE (parms
) = error_mark_node
;
11695 else if (complete_type_or_else (TREE_TYPE (parms
), parms
))
11696 layout_decl (parms
, 0);
11698 TREE_TYPE (parms
) = error_mark_node
;
11702 /* Returns non-zero if T is a local variable. */
11705 local_variable_p (t
)
11708 if ((TREE_CODE (t
) == VAR_DECL
11709 /* A VAR_DECL with a context that is a _TYPE is a static data
11711 && !TYPE_P (CP_DECL_CONTEXT (t
))
11712 /* Any other non-local variable must be at namespace scope. */
11713 && !DECL_NAMESPACE_SCOPE_P (t
))
11714 || (TREE_CODE (t
) == PARM_DECL
))
11720 /* Returns non-zero if T is an automatic local variable or a label.
11721 (These are the declarations that need to be remapped when the code
11722 containing them is duplicated.) */
11725 nonstatic_local_decl_p (t
)
11728 return ((local_variable_p (t
) && !TREE_STATIC (t
))
11729 || TREE_CODE (t
) == LABEL_DECL
11730 || TREE_CODE (t
) == RESULT_DECL
);
11733 /* Like local_variable_p, but suitable for use as a tree-walking
11737 local_variable_p_walkfn (tp
, walk_subtrees
, data
)
11739 int *walk_subtrees ATTRIBUTE_UNUSED
;
11740 void *data ATTRIBUTE_UNUSED
;
11742 return ((local_variable_p (*tp
) && !DECL_ARTIFICIAL (*tp
))
11743 ? *tp
: NULL_TREE
);
11746 /* Check that ARG, which is a default-argument expression for a
11747 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11748 something goes wrong. DECL may also be a _TYPE node, rather than a
11749 DECL, if there is no DECL available. */
11752 check_default_argument (decl
, arg
)
11759 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11760 /* We get a DEFAULT_ARG when looking at an in-class declaration
11761 with a default argument. Ignore the argument for now; we'll
11762 deal with it after the class is complete. */
11765 if (processing_template_decl
|| uses_template_parms (arg
))
11766 /* We don't do anything checking until instantiation-time. Note
11767 that there may be uninstantiated arguments even for an
11768 instantiated function, since default arguments are not
11769 instantiated until they are needed. */
11778 decl_type
= TREE_TYPE (decl
);
11780 if (arg
== error_mark_node
11781 || decl
== error_mark_node
11782 || TREE_TYPE (arg
) == error_mark_node
11783 || decl_type
== error_mark_node
)
11784 /* Something already went wrong. There's no need to check
11786 return error_mark_node
;
11788 /* [dcl.fct.default]
11790 A default argument expression is implicitly converted to the
11792 if (!TREE_TYPE (arg
)
11793 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11796 cp_error ("default argument for `%#D' has type `%T'",
11797 decl
, TREE_TYPE (arg
));
11799 cp_error ("default argument for parameter of type `%T' has type `%T'",
11800 decl_type
, TREE_TYPE (arg
));
11802 return error_mark_node
;
11805 /* [dcl.fct.default]
11807 Local variables shall not be used in default argument
11810 The keyword `this' shall not be used in a default argument of a
11811 member function. */
11812 var
= walk_tree_without_duplicates (&arg
, local_variable_p_walkfn
,
11816 cp_error ("default argument `%E' uses local variable `%D'",
11818 return error_mark_node
;
11825 /* Decode the list of parameter types for a function type.
11826 Given the list of things declared inside the parens,
11827 return a list of types.
11829 We determine whether ellipsis parms are used by PARMLIST_ELLIPSIS_P
11830 flag. If unset, we append void_list_node. A parmlist declared
11831 as `(void)' is accepted as the empty parmlist.
11833 Also set last_function_parms to the chain of PARM_DECLs. */
11836 grokparms (first_parm
)
11839 tree result
= NULL_TREE
;
11840 tree decls
= NULL_TREE
;
11841 int ellipsis
= !first_parm
|| PARMLIST_ELLIPSIS_P (first_parm
);
11845 my_friendly_assert (!first_parm
|| TREE_PARMLIST (first_parm
), 20001115);
11847 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11849 tree type
= NULL_TREE
;
11850 register tree decl
= TREE_VALUE (parm
);
11851 tree init
= TREE_PURPOSE (parm
);
11853 chain
= TREE_CHAIN (parm
);
11854 /* @@ weak defense against parse errors. */
11855 if (TREE_CODE (decl
) != VOID_TYPE
11856 && TREE_CODE (decl
) != TREE_LIST
)
11858 /* Give various messages as the need arises. */
11859 if (TREE_CODE (decl
) == STRING_CST
)
11860 cp_error ("invalid string constant `%E'", decl
);
11861 else if (TREE_CODE (decl
) == INTEGER_CST
)
11862 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11866 if (parm
== void_list_node
)
11869 decl
= grokdeclarator (TREE_VALUE (decl
), TREE_PURPOSE (decl
),
11870 PARM
, init
!= NULL_TREE
, NULL_TREE
);
11871 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
11874 type
= TREE_TYPE (decl
);
11875 if (VOID_TYPE_P (type
))
11877 if (same_type_p (type
, void_type_node
)
11878 && !DECL_NAME (decl
) && !result
&& !chain
&& !ellipsis
)
11879 /* this is a parmlist of `(void)', which is ok. */
11881 incomplete_type_error (decl
, type
);
11882 /* It's not a good idea to actually create parameters of
11883 type `void'; other parts of the compiler assume that a
11884 void type terminates the parameter list. */
11885 type
= error_mark_node
;
11886 TREE_TYPE (decl
) = error_mark_node
;
11889 if (type
!= error_mark_node
)
11891 /* Top-level qualifiers on the parameters are
11892 ignored for function types. */
11893 type
= TYPE_MAIN_VARIANT (type
);
11894 if (TREE_CODE (type
) == METHOD_TYPE
)
11896 cp_error ("parameter `%D' invalidly declared method type", decl
);
11897 type
= build_pointer_type (type
);
11898 TREE_TYPE (decl
) = type
;
11900 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11902 cp_error ("parameter `%D' invalidly declared offset type", decl
);
11903 type
= build_pointer_type (type
);
11904 TREE_TYPE (decl
) = type
;
11906 else if (abstract_virtuals_error (decl
, type
))
11907 any_error
= 1; /* Seems like a good idea. */
11908 else if (POINTER_TYPE_P (type
))
11910 /* [dcl.fct]/6, parameter types cannot contain pointers
11911 (references) to arrays of unknown bound. */
11912 tree t
= TREE_TYPE (type
);
11913 int ptr
= TYPE_PTR_P (type
);
11917 if (TYPE_PTR_P (t
))
11919 else if (TREE_CODE (t
) != ARRAY_TYPE
)
11921 else if (!TYPE_DOMAIN (t
))
11925 if (TREE_CODE (t
) == ARRAY_TYPE
)
11926 cp_error ("parameter `%D' includes %s to array of unknown bound `%T'",
11927 decl
, ptr
? "pointer" : "reference", t
);
11930 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
11931 if (PROMOTE_PROTOTYPES
11932 && (TREE_CODE (type
) == INTEGER_TYPE
11933 || TREE_CODE (type
) == ENUMERAL_TYPE
)
11934 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
11935 DECL_ARG_TYPE (decl
) = integer_type_node
;
11936 if (!any_error
&& init
)
11937 init
= check_default_argument (decl
, init
);
11942 TREE_CHAIN (decl
) = decls
;
11944 result
= tree_cons (init
, type
, result
);
11946 decls
= nreverse (decls
);
11947 result
= nreverse (result
);
11949 result
= chainon (result
, void_list_node
);
11950 last_function_parms
= decls
;
11956 /* D is a constructor or overloaded `operator='. Returns non-zero if
11957 D's arguments allow it to be a copy constructor, or copy assignment
11966 if (!DECL_FUNCTION_MEMBER_P (d
))
11969 t
= FUNCTION_ARG_CHAIN (d
);
11970 if (DECL_CONSTRUCTOR_P (d
) && DECL_HAS_IN_CHARGE_PARM_P (d
))
11971 t
= TREE_CHAIN (t
);
11972 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
11973 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
11974 == DECL_CONTEXT (d
))
11975 && (TREE_CHAIN (t
) == NULL_TREE
11976 || TREE_CHAIN (t
) == void_list_node
11977 || TREE_PURPOSE (TREE_CHAIN (t
))))
11982 /* These memoizing functions keep track of special properties which
11983 a class may have. `grok_ctor_properties' notices whether a class
11984 has a constructor of the form X(X&), and also complains
11985 if the class has a constructor of the form X(X).
11986 `grok_op_properties' takes notice of the various forms of
11987 operator= which are defined, as well as what sorts of type conversion
11988 may apply. Both functions take a FUNCTION_DECL as an argument. */
11991 grok_ctor_properties (ctype
, decl
)
11994 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
11995 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
11997 /* When a type has virtual baseclasses, a magical first int argument is
11998 added to any ctor so we can tell if the class has been initialized
11999 yet. This could screw things up in this function, so we deliberately
12000 ignore the leading int if we're in that situation. */
12001 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
12003 my_friendly_assert (parmtypes
12004 && TREE_VALUE (parmtypes
) == integer_type_node
,
12006 parmtypes
= TREE_CHAIN (parmtypes
);
12007 parmtype
= TREE_VALUE (parmtypes
);
12012 A non-template constructor for class X is a copy constructor if
12013 its first parameter is of type X&, const X&, volatile X& or const
12014 volatile X&, and either there are no other parameters or else all
12015 other parameters have default arguments. */
12016 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
12017 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
12018 && sufficient_parms_p (TREE_CHAIN (parmtypes
))
12019 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12020 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12022 TYPE_HAS_INIT_REF (ctype
) = 1;
12023 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12024 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
12028 A declaration of a constructor for a class X is ill-formed if its
12029 first parameter is of type (optionally cv-qualified) X and either
12030 there are no other parameters or else all other parameters have
12033 We *don't* complain about member template instantiations that
12034 have this form, though; they can occur as we try to decide what
12035 constructor to use during overload resolution. Since overload
12036 resolution will never prefer such a constructor to the
12037 non-template copy constructor (which is either explicitly or
12038 implicitly defined), there's no need to worry about their
12039 existence. Theoretically, they should never even be
12040 instantiated, but that's hard to forestall. */
12041 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
12042 && sufficient_parms_p (TREE_CHAIN (parmtypes
))
12043 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12044 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12046 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
12048 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
12051 else if (TREE_CODE (parmtype
) == VOID_TYPE
12052 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
12053 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
12058 /* An operator with this code is unary, but can also be binary. */
12062 enum tree_code code
;
12064 return (code
== INDIRECT_REF
12065 || code
== ADDR_EXPR
12066 || code
== CONVERT_EXPR
12067 || code
== NEGATE_EXPR
12068 || code
== PREINCREMENT_EXPR
12069 || code
== PREDECREMENT_EXPR
);
12072 /* An operator with this name can only be unary. */
12076 enum tree_code code
;
12078 return (code
== TRUTH_NOT_EXPR
12079 || code
== BIT_NOT_EXPR
12080 || code
== COMPONENT_REF
12081 || code
== TYPE_EXPR
);
12084 /* Do a little sanity-checking on how they declared their operator. */
12087 grok_op_properties (decl
, virtualp
, friendp
)
12089 int virtualp
, friendp
;
12091 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
12093 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
12094 tree name
= DECL_NAME (decl
);
12095 enum tree_code operator_code
;
12098 /* Count the number of arguments. */
12099 for (argtype
= argtypes
, arity
= 0;
12100 argtype
&& argtype
!= void_list_node
;
12101 argtype
= TREE_CHAIN (argtype
))
12104 if (current_class_type
== NULL_TREE
)
12107 if (DECL_CONV_FN_P (decl
))
12108 operator_code
= TYPE_EXPR
;
12112 #define DEF_OPERATOR(NAME, CODE, NEW_MANGLING, OLD_MANGING, ARITY, ASSN_P) \
12113 if (ansi_opname (CODE) == name) \
12115 operator_code = CODE; \
12118 else if (ansi_assopname (CODE) == name) \
12120 operator_code = CODE; \
12121 DECL_ASSIGNMENT_OPERATOR_P (decl) = 1; \
12125 #include "operators.def"
12126 #undef DEF_OPERATOR
12128 my_friendly_abort (20000527);
12131 my_friendly_assert (operator_code
!= LAST_CPLUS_TREE_CODE
, 20000526);
12132 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12136 switch (operator_code
)
12139 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
12143 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
12146 case COMPONENT_REF
:
12148 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
12152 TYPE_HAS_NEW_OPERATOR (current_class_type
) = 1;
12156 TYPE_GETS_DELETE (current_class_type
) |= 1;
12160 TYPE_HAS_ARRAY_NEW_OPERATOR (current_class_type
) = 1;
12163 case VEC_DELETE_EXPR
:
12164 TYPE_GETS_DELETE (current_class_type
) |= 2;
12172 if (operator_code
== NEW_EXPR
|| operator_code
== VEC_NEW_EXPR
)
12174 /* When the compiler encounters the definition of A::operator new, it
12175 doesn't look at the class declaration to find out if it's static. */
12177 revert_static_member_fn (decl
);
12179 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
12181 else if (operator_code
== DELETE_EXPR
|| operator_code
== VEC_DELETE_EXPR
)
12184 revert_static_member_fn (decl
);
12186 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
12190 /* An operator function must either be a non-static member function
12191 or have at least one parameter of a class, a reference to a class,
12192 an enumeration, or a reference to an enumeration. 13.4.0.6 */
12193 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
12195 if (operator_code
== TYPE_EXPR
12196 || operator_code
== CALL_EXPR
12197 || operator_code
== COMPONENT_REF
12198 || operator_code
== ARRAY_REF
12199 || operator_code
== NOP_EXPR
)
12200 cp_error ("`%D' must be a nonstatic member function", decl
);
12205 if (DECL_STATIC_FUNCTION_P (decl
))
12206 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
12209 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
12211 tree arg
= TREE_VALUE (p
);
12212 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
12213 arg
= TREE_TYPE (arg
);
12215 /* This lets bad template code slip through. */
12216 if (IS_AGGR_TYPE (arg
)
12217 || TREE_CODE (arg
) == ENUMERAL_TYPE
12218 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
12219 || TREE_CODE (arg
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
12223 ("`%D' must have an argument of class or enumerated type",
12230 if (operator_code
== CALL_EXPR
)
12231 return; /* No restrictions on args. */
12233 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
12235 tree t
= TREE_TYPE (name
);
12238 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
12239 const char *what
= 0;
12242 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
12244 if (TREE_CODE (t
) == VOID_TYPE
)
12246 else if (t
== current_class_type
)
12247 what
= "the same type";
12248 /* Don't force t to be complete here. */
12249 else if (IS_AGGR_TYPE (t
)
12250 && COMPLETE_TYPE_P (t
)
12251 && DERIVED_FROM_P (t
, current_class_type
))
12252 what
= "a base class";
12255 warning ("conversion to %s%s will never use a type conversion operator",
12256 ref
? "a reference to " : "", what
);
12260 if (DECL_ASSIGNMENT_OPERATOR_P (decl
)
12261 && operator_code
== NOP_EXPR
)
12265 if (arity
!= 2 && methodp
)
12267 cp_error ("`%D' must take exactly one argument", decl
);
12270 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
12274 A user-declared copy assignment operator X::operator= is
12275 a non-static non-template member function of class X with
12276 exactly one parameter of type X, X&, const X&, volatile
12277 X& or const volatile X&. */
12278 if (copy_assignment_arg_p (parmtype
, virtualp
)
12279 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12280 && is_member_template (DECL_TI_TEMPLATE (decl
)))
12283 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
12284 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
12285 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12286 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
12289 else if (operator_code
== COND_EXPR
)
12292 cp_error ("ISO C++ prohibits overloading operator ?:");
12294 else if (ambi_op_p (operator_code
))
12297 /* We pick the one-argument operator codes by default, so
12298 we don't have to change anything. */
12300 else if (arity
== 2)
12302 /* If we thought this was a unary operator, we now know
12303 it to be a binary operator. */
12304 switch (operator_code
)
12307 operator_code
= MULT_EXPR
;
12311 operator_code
= BIT_AND_EXPR
;
12315 operator_code
= PLUS_EXPR
;
12319 operator_code
= MINUS_EXPR
;
12322 case PREINCREMENT_EXPR
:
12323 operator_code
= POSTINCREMENT_EXPR
;
12326 case PREDECREMENT_EXPR
:
12327 operator_code
= POSTDECREMENT_EXPR
;
12331 my_friendly_abort (20000527);
12334 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12336 if ((operator_code
== POSTINCREMENT_EXPR
12337 || operator_code
== POSTDECREMENT_EXPR
)
12338 && ! processing_template_decl
12339 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
12342 cp_error ("postfix `%D' must take `int' as its argument",
12346 ("postfix `%D' must take `int' as its second argument",
12353 cp_error ("`%D' must take either zero or one argument", decl
);
12355 cp_error ("`%D' must take either one or two arguments", decl
);
12358 /* More Effective C++ rule 6. */
12360 && (operator_code
== POSTINCREMENT_EXPR
12361 || operator_code
== POSTDECREMENT_EXPR
12362 || operator_code
== PREINCREMENT_EXPR
12363 || operator_code
== PREDECREMENT_EXPR
))
12365 tree arg
= TREE_VALUE (argtypes
);
12366 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
12367 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
12368 arg
= TREE_TYPE (arg
);
12369 arg
= TYPE_MAIN_VARIANT (arg
);
12370 if (operator_code
== PREINCREMENT_EXPR
12371 || operator_code
== PREDECREMENT_EXPR
)
12373 if (TREE_CODE (ret
) != REFERENCE_TYPE
12374 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
12376 cp_warning ("prefix `%D' should return `%T'", decl
,
12377 build_reference_type (arg
));
12381 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
12382 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
12386 else if (unary_op_p (operator_code
))
12391 cp_error ("`%D' must take `void'", decl
);
12393 cp_error ("`%D' must take exactly one argument", decl
);
12396 else /* if (binary_op_p (operator_code)) */
12401 cp_error ("`%D' must take exactly one argument", decl
);
12403 cp_error ("`%D' must take exactly two arguments", decl
);
12406 /* More Effective C++ rule 7. */
12408 && (operator_code
== TRUTH_ANDIF_EXPR
12409 || operator_code
== TRUTH_ORIF_EXPR
12410 || operator_code
== COMPOUND_EXPR
))
12411 cp_warning ("user-defined `%D' always evaluates both arguments",
12415 /* Effective C++ rule 23. */
12418 && (operator_code
== PLUS_EXPR
12419 || operator_code
== MINUS_EXPR
12420 || operator_code
== TRUNC_DIV_EXPR
12421 || operator_code
== MULT_EXPR
)
12422 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
12423 cp_warning ("`%D' should return by value", decl
);
12426 for (; argtypes
&& argtypes
!= void_list_node
;
12427 argtypes
= TREE_CHAIN (argtypes
))
12428 if (TREE_PURPOSE (argtypes
))
12430 TREE_PURPOSE (argtypes
) = NULL_TREE
;
12431 if (operator_code
== POSTINCREMENT_EXPR
12432 || operator_code
== POSTDECREMENT_EXPR
)
12435 cp_pedwarn ("`%D' cannot have default arguments", decl
);
12438 cp_error ("`%D' cannot have default arguments", decl
);
12444 static const char *
12446 enum tag_types code
;
12459 my_friendly_abort (981122);
12463 /* Get the struct, enum or union (CODE says which) with tag NAME.
12464 Define the tag as a forward-reference if it is not defined.
12466 C++: If a class derivation is given, process it here, and report
12467 an error if multiple derivation declarations are not identical.
12469 If this is a definition, come in through xref_tag and only look in
12470 the current frame for the name (since C++ allows new names in any
12474 xref_tag (code_type_node
, name
, globalize
)
12475 tree code_type_node
;
12479 enum tag_types tag_code
;
12480 enum tree_code code
;
12481 register tree ref
, t
;
12482 struct binding_level
*b
= current_binding_level
;
12484 tree attributes
= NULL_TREE
;
12485 tree context
= NULL_TREE
;
12487 /* If we are called from the parser, code_type_node will sometimes be a
12488 TREE_LIST. This indicates that the user wrote
12489 "class __attribute__ ((foo)) bar". Extract the attributes so we can
12491 if (TREE_CODE (code_type_node
) == TREE_LIST
)
12493 attributes
= TREE_PURPOSE (code_type_node
);
12494 code_type_node
= TREE_VALUE (code_type_node
);
12497 tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12502 code
= RECORD_TYPE
;
12508 code
= ENUMERAL_TYPE
;
12511 my_friendly_abort (18);
12514 /* If a cross reference is requested, look up the type
12515 already defined for this tag and return it. */
12519 name
= TYPE_IDENTIFIER (t
);
12523 t
= IDENTIFIER_TYPE_VALUE (name
);
12525 /* Warn about 'friend struct Inherited;' doing the wrong thing. */
12526 if (t
&& globalize
&& TREE_CODE (t
) == TYPENAME_TYPE
)
12528 static int explained
;
12530 cp_warning ("`%s %T' declares a new type at namespace scope;\n\
12531 to refer to the inherited type, say `%s %T::%T'%s",
12532 tag_name (tag_code
), name
, tag_name (tag_code
),
12533 constructor_name (current_class_type
), TYPE_IDENTIFIER (t
),
12535 (names from dependent base classes are not visible to unqualified name lookup)"
12541 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
12542 && TREE_CODE (t
) != BOUND_TEMPLATE_TEMPLATE_PARM
)
12547 /* If we know we are defining this tag, only look it up in
12548 this scope and don't try to find it as a type. */
12549 ref
= lookup_tag (code
, name
, b
, 1);
12555 /* [dcl.type.elab] If the identifier resolves to a
12556 typedef-name or a template type-parameter, the
12557 elaborated-type-specifier is ill-formed. */
12558 if (t
!= TYPE_MAIN_VARIANT (t
)
12559 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
12560 cp_pedwarn ("using typedef-name `%D' after `%s'",
12561 TYPE_NAME (t
), tag_name (tag_code
));
12562 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12563 cp_error ("using template type parameter `%T' after `%s'",
12564 t
, tag_name (tag_code
));
12569 ref
= lookup_tag (code
, name
, b
, 0);
12573 /* Try finding it as a type declaration. If that wins,
12575 ref
= lookup_name (name
, 1);
12577 if (ref
!= NULL_TREE
12578 && processing_template_decl
12579 && DECL_CLASS_TEMPLATE_P (ref
)
12580 && template_class_depth (current_class_type
) == 0)
12581 /* Since GLOBALIZE is true, we're declaring a global
12582 template, so we want this type. */
12583 ref
= DECL_TEMPLATE_RESULT (ref
);
12585 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12586 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12587 ref
= TREE_TYPE (ref
);
12592 if (ref
&& current_class_type
12593 && template_class_depth (current_class_type
)
12594 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12596 /* Since GLOBALIZE is non-zero, we are not looking at a
12597 definition of this tag. Since, in addition, we are currently
12598 processing a (member) template declaration of a template
12599 class, we must be very careful; consider:
12606 { template <class V>
12607 friend struct S1; };
12609 Here, the S2::S1 declaration should not be confused with the
12610 outer declaration. In particular, the inner version should
12611 have a template parameter of level 2, not level 1. This
12612 would be particularly important if the member declaration
12615 template <class V = U> friend struct S1;
12617 say, when we should tsubst into `U' when instantiating
12618 S2. On the other hand, when presented with:
12628 we must find the inner binding eventually. We
12629 accomplish this by making sure that the new type we
12630 create to represent this declaration has the right
12632 context
= TYPE_CONTEXT (ref
);
12639 /* If no such tag is yet defined, create a forward-reference node
12640 and record it as the "definition".
12641 When a real declaration of this type is found,
12642 the forward-reference will be altered into a real type. */
12643 if (code
== ENUMERAL_TYPE
)
12645 cp_error ("use of enum `%#D' without previous declaration", name
);
12647 ref
= make_node (ENUMERAL_TYPE
);
12649 /* Give the type a default layout like unsigned int
12650 to avoid crashing if it does not get defined. */
12651 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12652 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12653 TYPE_USER_ALIGN (ref
) = 0;
12654 TREE_UNSIGNED (ref
) = 1;
12655 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12656 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12657 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12659 /* Enable us to recognize when a type is created in class context.
12660 To do nested classes correctly, this should probably be cleared
12661 out when we leave this classes scope. Currently this in only
12662 done in `start_enum'. */
12664 pushtag (name
, ref
, globalize
);
12668 struct binding_level
*old_b
= class_binding_level
;
12670 ref
= make_aggr_type (code
);
12671 TYPE_CONTEXT (ref
) = context
;
12673 #ifdef NONNESTED_CLASSES
12674 /* Class types don't nest the way enums do. */
12675 class_binding_level
= (struct binding_level
*)0;
12677 pushtag (name
, ref
, globalize
);
12678 class_binding_level
= old_b
;
12683 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12684 redeclare_class_template (ref
, current_template_parms
);
12687 /* Until the type is defined, tentatively accept whatever
12688 structure tag the user hands us. */
12689 if (!COMPLETE_TYPE_P (ref
)
12690 && ref
!= current_class_type
12691 /* Have to check this, in case we have contradictory tag info. */
12692 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12694 if (tag_code
== class_type
)
12695 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12696 else if (tag_code
== record_type
)
12697 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12700 TREE_TYPE (ref
) = attributes
;
12706 xref_tag_from_type (old
, id
, globalize
)
12710 tree code_type_node
;
12712 if (TREE_CODE (old
) == RECORD_TYPE
)
12713 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12714 ? class_type_node
: record_type_node
);
12716 code_type_node
= union_type_node
;
12718 if (id
== NULL_TREE
)
12719 id
= TYPE_IDENTIFIER (old
);
12721 return xref_tag (code_type_node
, id
, globalize
);
12724 /* REF is a type (named NAME), for which we have just seen some
12725 baseclasses. BINFO is a list of those baseclasses; the
12726 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12727 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12728 struct, or union. */
12731 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12732 tree code_type_node
;
12736 /* In the declaration `A : X, Y, ... Z' we mark all the types
12737 (A, X, Y, ..., Z) so we can check for duplicates. */
12742 enum tag_types tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12744 if (tag_code
== union_type
)
12746 cp_error ("derived union `%T' invalid", ref
);
12750 len
= list_length (binfo
);
12752 /* First, make sure that any templates in base-classes are
12753 instantiated. This ensures that if we call ourselves recursively
12754 we do not get confused about which classes are marked and which
12756 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12757 complete_type (TREE_VALUE (base
));
12759 SET_CLASSTYPE_MARKED (ref
);
12760 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12762 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12764 /* The base of a derived struct is public by default. */
12766 = (TREE_PURPOSE (binfo
) == access_public_node
12767 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12768 || (tag_code
!= class_type
12769 && (TREE_PURPOSE (binfo
) == access_default_node
12770 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12772 = (TREE_PURPOSE (binfo
) == access_protected_node
12773 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12775 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12776 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12777 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12778 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12779 tree basetype
= TREE_VALUE (binfo
);
12782 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12783 basetype
= TREE_TYPE (basetype
);
12785 || (TREE_CODE (basetype
) != RECORD_TYPE
12786 && TREE_CODE (basetype
) != TYPENAME_TYPE
12787 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12788 && TREE_CODE (basetype
) != BOUND_TEMPLATE_TEMPLATE_PARM
))
12790 cp_error ("base type `%T' fails to be a struct or class type",
12791 TREE_VALUE (binfo
));
12795 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12797 /* This code replaces similar code in layout_basetypes.
12798 We put the complete_type first for implicit `typename'. */
12799 if (!COMPLETE_TYPE_P (basetype
)
12800 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12802 cp_error ("base class `%T' has incomplete type", basetype
);
12807 if (CLASSTYPE_MARKED (basetype
))
12809 if (basetype
== ref
)
12810 cp_error ("recursive type `%T' undefined", basetype
);
12812 cp_error ("duplicate base type `%T' invalid", basetype
);
12816 if (TYPE_FOR_JAVA (basetype
)
12817 && (current_lang_stack
12818 == &VARRAY_TREE (current_lang_base
, 0)))
12819 TYPE_FOR_JAVA (ref
) = 1;
12821 /* Note that the BINFO records which describe individual
12822 inheritances are *not* shared in the lattice! They
12823 cannot be shared because a given baseclass may be
12824 inherited with different `accessibility' by different
12825 derived classes. (Each BINFO record describing an
12826 individual inheritance contains flags which say what
12827 the `accessibility' of that particular inheritance is.) */
12830 = make_binfo (size_zero_node
, basetype
,
12831 CLASS_TYPE_P (basetype
)
12832 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
12833 CLASS_TYPE_P (basetype
)
12834 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
12836 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
12837 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
12838 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
12839 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
12840 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
12842 /* We need to unshare the binfos now so that lookups during class
12843 definition work. */
12844 unshare_base_binfos (base_binfo
);
12846 SET_CLASSTYPE_MARKED (basetype
);
12848 /* We are free to modify these bits because they are meaningless
12849 at top level, and BASETYPE is a top-level type. */
12850 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
12852 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
12853 /* Converting to a virtual base class requires looking
12854 up the offset of the virtual base. */
12855 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
12858 if (CLASS_TYPE_P (basetype
))
12860 TYPE_HAS_NEW_OPERATOR (ref
)
12861 |= TYPE_HAS_NEW_OPERATOR (basetype
);
12862 TYPE_HAS_ARRAY_NEW_OPERATOR (ref
)
12863 |= TYPE_HAS_ARRAY_NEW_OPERATOR (basetype
);
12864 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
12865 /* If the base-class uses multiple inheritance, so do we. */
12866 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
12867 |= TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
12868 /* Likewise, if converting to a base of the base may require
12869 code, then we may need to generate code to convert to a
12871 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
)
12872 |= TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (basetype
);
12879 TREE_VEC_LENGTH (binfos
) = i
;
12881 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
12885 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
12886 /* If there is more than one non-empty they cannot be at the same
12888 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
12891 /* Unmark all the types. */
12893 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
12894 CLEAR_CLASSTYPE_MARKED (ref
);
12896 /* Now that we know all the base-classes, set up the list of virtual
12898 get_vbase_types (ref
);
12902 /* Begin compiling the definition of an enumeration type.
12903 NAME is its name (or null if anonymous).
12904 Returns the type object, as yet incomplete.
12905 Also records info about it so that build_enumerator
12906 may be used to declare the individual values as they are read. */
12912 register tree enumtype
= NULL_TREE
;
12913 struct binding_level
*b
= current_binding_level
;
12915 /* If this is the real definition for a previous forward reference,
12916 fill in the contents in the same object that used to be the
12917 forward reference. */
12919 if (name
!= NULL_TREE
)
12920 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
12922 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
12924 cp_error ("multiple definition of `%#T'", enumtype
);
12925 cp_error_at ("previous definition here", enumtype
);
12926 /* Clear out TYPE_VALUES, and start again. */
12927 TYPE_VALUES (enumtype
) = NULL_TREE
;
12931 enumtype
= make_node (ENUMERAL_TYPE
);
12932 pushtag (name
, enumtype
, 0);
12935 if (current_class_type
)
12936 TREE_ADDRESSABLE (b
->tags
) = 1;
12938 GNU_xref_decl (current_function_decl
, enumtype
);
12942 /* After processing and defining all the values of an enumeration type,
12943 install their decls in the enumeration type and finish it off.
12944 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12945 Returns ENUMTYPE. */
12948 finish_enum (enumtype
)
12951 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
12952 /* Calculate the maximum value of any enumerator in this type. */
12954 tree values
= TYPE_VALUES (enumtype
);
12959 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
12964 /* The TREE_VALUE is a CONST_DECL for this enumeration
12966 decl
= TREE_VALUE (pair
);
12970 Following the closing brace of an enum-specifier, each
12971 enumerator has the type of its enumeration. Prior to the
12972 closing brace, the type of each enumerator is the type of
12973 its initializing value. */
12974 TREE_TYPE (decl
) = enumtype
;
12976 /* The DECL_INITIAL will be NULL if we are processing a
12977 template declaration and this enumeration constant had no
12978 explicit initializer. */
12979 value
= DECL_INITIAL (decl
);
12980 if (value
&& !processing_template_decl
)
12982 /* Set the TREE_TYPE for the VALUE as well. That's so
12983 that when we call decl_constant_value we get an
12984 entity of the right type (but with the constant
12985 value). Since we shouldn't ever call
12986 decl_constant_value on a template type, there's no
12987 reason to do that when processing_template_decl.
12988 And, if the expression is something like a
12989 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12990 wreak havoc on the intended type of the expression.
12992 Of course, there's also no point in trying to compute
12993 minimum or maximum values if we're in a template. */
12994 TREE_TYPE (value
) = enumtype
;
12997 minnode
= maxnode
= value
;
12998 else if (tree_int_cst_lt (maxnode
, value
))
13000 else if (tree_int_cst_lt (value
, minnode
))
13004 if (processing_template_decl
)
13005 /* If this is just a template, leave the CONST_DECL
13006 alone. That way tsubst_copy will find CONST_DECLs for
13007 CONST_DECLs, and not INTEGER_CSTs. */
13010 /* In the list we're building up, we want the enumeration
13011 values, not the CONST_DECLs. */
13012 TREE_VALUE (pair
) = value
;
13016 maxnode
= minnode
= integer_zero_node
;
13018 TYPE_VALUES (enumtype
) = nreverse (values
);
13020 if (processing_template_decl
)
13022 tree scope
= current_scope ();
13023 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
13024 add_stmt (build_min (TAG_DEFN
, enumtype
));
13028 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
13029 int lowprec
= min_precision (minnode
, unsignedp
);
13030 int highprec
= min_precision (maxnode
, unsignedp
);
13031 int precision
= MAX (lowprec
, highprec
);
13034 TYPE_SIZE (enumtype
) = NULL_TREE
;
13036 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
13038 TYPE_PRECISION (enumtype
) = precision
;
13040 fixup_unsigned_type (enumtype
);
13042 fixup_signed_type (enumtype
);
13044 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
13045 /* Use the width of the narrowest normal C type which is wide
13047 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
13050 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
13052 TYPE_SIZE (enumtype
) = 0;
13053 layout_type (enumtype
);
13055 /* Fix up all variant types of this enum type. */
13056 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
13057 tem
= TYPE_NEXT_VARIANT (tem
))
13059 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
13060 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
13061 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
13062 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
13063 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
13064 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
13065 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
13066 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
13067 TYPE_USER_ALIGN (tem
) = TYPE_USER_ALIGN (enumtype
);
13068 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
13071 /* Finish debugging output for this type. */
13072 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
13078 /* Build and install a CONST_DECL for an enumeration constant of the
13079 enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided.
13080 Assignment of sequential values by default is handled here. */
13083 build_enumerator (name
, value
, enumtype
)
13093 /* Remove no-op casts from the value. */
13095 STRIP_TYPE_NOPS (value
);
13097 if (! processing_template_decl
)
13099 /* Validate and default VALUE. */
13100 if (value
!= NULL_TREE
)
13102 value
= decl_constant_value (value
);
13104 if (TREE_CODE (value
) == INTEGER_CST
)
13106 value
= default_conversion (value
);
13107 constant_expression_warning (value
);
13111 cp_error ("enumerator value for `%D' not integer constant", name
);
13116 /* Default based on previous value. */
13117 if (value
== NULL_TREE
&& ! processing_template_decl
)
13121 if (TYPE_VALUES (enumtype
))
13123 /* The next value is the previous value ... */
13124 prev_value
= DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype
)));
13125 /* ... plus one. */
13126 value
= cp_build_binary_op (PLUS_EXPR
,
13130 if (tree_int_cst_lt (value
, prev_value
))
13131 cp_error ("overflow in enumeration values at `%D'", name
);
13134 value
= integer_zero_node
;
13137 /* Remove no-op casts from the value. */
13139 STRIP_TYPE_NOPS (value
);
13141 /* To fix MAX_VAL enum consts. (bkoz) */
13142 TREE_TYPE (value
) = integer_type_node
;
13146 /* We always have to copy here; not all INTEGER_CSTs are unshared.
13147 Even in other cases, we will later (in finish_enum) be setting
13148 the type of VALUE. But, we don't need to make a copy if this
13149 VALUE is one of the enumeration constants for this same
13150 enumeration type. */
13151 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
13152 if (TREE_VALUE (values
) == value
)
13154 /* If we didn't break out of the loop, then we do need a copy. */
13155 if (!values
&& value
)
13156 value
= copy_node (value
);
13158 /* C++ associates enums with global, function, or class declarations. */
13159 context
= current_scope ();
13161 /* Build the actual enumeration constant. Note that the enumeration
13162 constants have the type of their initializers until the
13163 enumeration is complete:
13167 Following the closing brace of an enum-specifier, each enumer-
13168 ator has the type of its enumeration. Prior to the closing
13169 brace, the type of each enumerator is the type of its
13170 initializing value.
13172 In finish_enum we will reset the type. Of course, if we're
13173 processing a template, there may be no value. */
13174 type
= value
? TREE_TYPE (value
) : NULL_TREE
;
13176 if (context
&& context
== current_class_type
)
13177 /* This enum declaration is local to the class. We need the full
13178 lang_decl so that we can record DECL_CLASS_CONTEXT, for example. */
13179 decl
= build_lang_decl (CONST_DECL
, name
, type
);
13181 /* It's a global enum, or it's local to a function. (Note local to
13182 a function could mean local to a class method. */
13183 decl
= build_decl (CONST_DECL
, name
, type
);
13185 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
13186 DECL_INITIAL (decl
) = value
;
13187 TREE_READONLY (decl
) = 1;
13189 if (context
&& context
== current_class_type
)
13190 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
13191 on the TYPE_FIELDS list for `S'. (That's so that you can say
13192 things like `S::i' later.) */
13193 finish_member_declaration (decl
);
13197 GNU_xref_decl (current_function_decl
, decl
);
13200 /* Add this enumeration constant to the list for this type. */
13201 TYPE_VALUES (enumtype
) = tree_cons (name
, decl
, TYPE_VALUES (enumtype
));
13205 /* We're defining DECL. Make sure that it's type is OK. */
13208 check_function_type (decl
, current_function_parms
)
13210 tree current_function_parms
;
13212 tree fntype
= TREE_TYPE (decl
);
13213 tree return_type
= complete_type (TREE_TYPE (fntype
));
13215 /* In a function definition, arg types must be complete. */
13216 require_complete_types_for_parms (current_function_parms
);
13218 if (!COMPLETE_OR_VOID_TYPE_P (return_type
))
13220 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
13222 /* Make it return void instead, but don't change the
13223 type of the DECL_RESULT, in case we have a named return value. */
13224 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13226 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
13228 = build_cplus_method_type (ctype
,
13230 FUNCTION_ARG_CHAIN (decl
));
13234 = build_function_type (void_type_node
,
13235 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
13237 = build_exception_variant (fntype
,
13238 TYPE_RAISES_EXCEPTIONS (fntype
));
13241 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
13244 /* Create the FUNCTION_DECL for a function definition.
13245 DECLSPECS and DECLARATOR are the parts of the declaration;
13246 they describe the function's name and the type it returns,
13247 but twisted together in a fashion that parallels the syntax of C.
13249 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
13250 DECLARATOR is really the DECL for the function we are about to
13251 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
13252 indicating that the function is an inline defined in-class.
13254 This function creates a binding context for the function body
13255 as well as setting up the FUNCTION_DECL in current_function_decl.
13257 Returns 1 on success. If the DECLARATOR is not suitable for a function
13258 (it defines a datum instead), we return 0, which tells
13259 yyparse to report a parse error.
13261 For C++, we must first check whether that datum makes any sense.
13262 For example, "class A local_a(1,2);" means that variable local_a
13263 is an aggregate of type A, which should have a constructor
13264 applied to it with the argument list [1, 2]. */
13267 start_function (declspecs
, declarator
, attrs
, flags
)
13268 tree declspecs
, declarator
, attrs
;
13272 tree ctype
= NULL_TREE
;
13275 extern int have_extern_spec
;
13276 extern int used_extern_spec
;
13277 int doing_friend
= 0;
13278 struct binding_level
*bl
;
13279 tree current_function_parms
;
13281 /* Sanity check. */
13282 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
13283 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
13285 /* This should only be done once on the top most decl. */
13286 if (have_extern_spec
&& !used_extern_spec
)
13288 declspecs
= tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
13289 used_extern_spec
= 1;
13292 if (flags
& SF_PRE_PARSED
)
13294 decl1
= declarator
;
13296 fntype
= TREE_TYPE (decl1
);
13297 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13298 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13300 /* ISO C++ 11.4/5. A friend function defined in a class is in
13301 the (lexical) scope of the class in which it is defined. */
13302 if (!ctype
&& DECL_FRIEND_P (decl1
))
13304 ctype
= DECL_FRIEND_CONTEXT (decl1
);
13306 /* CTYPE could be null here if we're dealing with a template;
13307 for example, `inline friend float foo()' inside a template
13308 will have no CTYPE set. */
13309 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
13315 last_function_parms
= DECL_ARGUMENTS (decl1
);
13316 last_function_parm_tags
= NULL_TREE
;
13320 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
13321 /* If the declarator is not suitable for a function definition,
13322 cause a syntax error. */
13323 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
13325 fntype
= TREE_TYPE (decl1
);
13327 restype
= TREE_TYPE (fntype
);
13328 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
13330 cp_error ("semicolon missing after declaration of `%#T'", restype
);
13331 shadow_tag (build_tree_list (NULL_TREE
, restype
));
13332 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
13333 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
13334 fntype
= build_function_type (integer_type_node
,
13335 TYPE_ARG_TYPES (fntype
));
13337 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
13339 TYPE_ARG_TYPES (fntype
));
13340 TREE_TYPE (decl1
) = fntype
;
13343 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13344 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13345 else if (DECL_MAIN_P (decl1
))
13347 /* If this doesn't return integer_type, complain. */
13348 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
13350 if (pedantic
|| warn_return_type
)
13351 pedwarn ("return type for `main' changed to `int'");
13352 TREE_TYPE (decl1
) = fntype
= default_function_type
;
13357 /* Sometimes we don't notice that a function is a static member, and
13358 build a METHOD_TYPE for it. Fix that up now. */
13359 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
)
13360 && TREE_CODE (TREE_TYPE (decl1
)) == METHOD_TYPE
)
13362 revert_static_member_fn (decl1
);
13363 last_function_parms
= TREE_CHAIN (last_function_parms
);
13367 /* Warn if function was previously implicitly declared
13368 (but not if we warned then). */
13369 if (! warn_implicit
13370 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
13371 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
13373 /* Set up current_class_type, and enter the scope of the class, if
13376 push_nested_class (ctype
, 1);
13377 else if (DECL_STATIC_FUNCTION_P (decl1
))
13378 push_nested_class (DECL_CONTEXT (decl1
), 2);
13380 /* Now that we have entered the scope of the class, we must restore
13381 the bindings for any template parameters surrounding DECL1, if it
13382 is an inline member template. (Order is important; consider the
13383 case where a template parameter has the same name as a field of
13384 the class.) It is not until after this point that
13385 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
13386 if (flags
& SF_INCLASS_INLINE
)
13387 maybe_begin_member_template_processing (decl1
);
13389 /* Effective C++ rule 15. */
13391 && DECL_OVERLOADED_OPERATOR_P (decl1
) == NOP_EXPR
13392 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
13393 cp_warning ("`operator=' should return a reference to `*this'");
13395 /* Make the init_value nonzero so pushdecl knows this is not tentative.
13396 error_mark_node is replaced below (in poplevel) with the BLOCK. */
13397 if (!DECL_INITIAL (decl1
))
13398 DECL_INITIAL (decl1
) = error_mark_node
;
13400 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
13401 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
13404 /* This function exists in static storage.
13405 (This does not mean `static' in the C sense!) */
13406 TREE_STATIC (decl1
) = 1;
13408 /* We must call push_template_decl after current_class_type is set
13409 up. (If we are processing inline definitions after exiting a
13410 class scope, current_class_type will be NULL_TREE until set above
13411 by push_nested_class.) */
13412 if (processing_template_decl
)
13413 decl1
= push_template_decl (decl1
);
13415 /* We are now in the scope of the function being defined. */
13416 current_function_decl
= decl1
;
13418 /* Save the parm names or decls from this function's declarator
13419 where store_parm_decls will find them. */
13420 current_function_parms
= last_function_parms
;
13421 current_function_parm_tags
= last_function_parm_tags
;
13423 /* Make sure the parameter and return types are reasonable. When
13424 you declare a function, these types can be incomplete, but they
13425 must be complete when you define the function. */
13426 if (! processing_template_decl
)
13427 check_function_type (decl1
, current_function_parms
);
13429 /* Build the return declaration for the function. */
13430 restype
= TREE_TYPE (fntype
);
13431 if (!processing_template_decl
)
13433 if (!DECL_RESULT (decl1
))
13435 DECL_RESULT (decl1
)
13436 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13437 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype
),
13438 DECL_RESULT (decl1
));
13442 /* Just use `void'. Nobody will ever look at this anyhow. */
13443 DECL_RESULT (decl1
) = build_decl (RESULT_DECL
, 0, void_type_node
);
13445 /* Initialize RTL machinery. We cannot do this until
13446 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
13447 even when processing a template; this is how we get
13448 CFUN set up, and our per-function variables initialized.
13449 FIXME factor out the non-RTL stuff. */
13450 bl
= current_binding_level
;
13451 init_function_start (decl1
, input_filename
, lineno
);
13452 current_binding_level
= bl
;
13454 /* Even though we're inside a function body, we still don't want to
13455 call expand_expr to calculate the size of a variable-sized array.
13456 We haven't necessarily assigned RTL to all variables yet, so it's
13457 not safe to try to expand expressions involving them. */
13458 immediate_size_expand
= 0;
13459 cfun
->x_dont_save_pending_sizes_p
= 1;
13461 /* Start the statement-tree, start the tree now. */
13462 begin_stmt_tree (&DECL_SAVED_TREE (decl1
));
13464 /* Let the user know we're compiling this function. */
13465 announce_function (decl1
);
13467 /* Record the decl so that the function name is defined.
13468 If we already have a decl for this name, and it is a FUNCTION_DECL,
13469 use the old decl. */
13470 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
13472 /* A specialization is not used to guide overload resolution. */
13473 if (!DECL_TEMPLATE_SPECIALIZATION (decl1
)
13474 && ! DECL_FUNCTION_MEMBER_P (decl1
))
13475 decl1
= pushdecl (decl1
);
13478 /* We need to set the DECL_CONTEXT. */
13479 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
13480 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
13481 /* And make sure we have enough default args. */
13482 check_default_args (decl1
);
13484 fntype
= TREE_TYPE (decl1
);
13487 /* Reset these in case the call to pushdecl changed them. */
13488 current_function_decl
= decl1
;
13489 cfun
->decl
= decl1
;
13491 /* If we are (erroneously) defining a function that we have already
13492 defined before, wipe out what we knew before. */
13493 if (!DECL_PENDING_INLINE_P (decl1
)
13494 && DECL_SAVED_FUNCTION_DATA (decl1
))
13496 free (DECL_SAVED_FUNCTION_DATA (decl1
));
13497 DECL_SAVED_FUNCTION_DATA (decl1
) = NULL
;
13500 if (ctype
&& !doing_friend
&& !DECL_STATIC_FUNCTION_P (decl1
))
13502 /* We know that this was set up by `grokclassfn'. We do not
13503 wait until `store_parm_decls', since evil parse errors may
13504 never get us to that point. Here we keep the consistency
13505 between `current_class_type' and `current_class_ptr'. */
13506 tree t
= DECL_ARGUMENTS (decl1
);
13508 my_friendly_assert (t
!= NULL_TREE
&& TREE_CODE (t
) == PARM_DECL
,
13510 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
13513 cp_function_chain
->x_current_class_ref
13514 = build_indirect_ref (t
, NULL_PTR
);
13515 cp_function_chain
->x_current_class_ptr
= t
;
13517 /* Constructors and destructors need to know whether they're "in
13518 charge" of initializing virtual base classes. */
13519 if (DECL_HAS_IN_CHARGE_PARM_P (decl1
))
13520 current_in_charge_parm
= TREE_CHAIN (t
);
13523 if (DECL_INTERFACE_KNOWN (decl1
))
13525 tree ctx
= decl_function_context (decl1
);
13527 if (DECL_NOT_REALLY_EXTERN (decl1
))
13528 DECL_EXTERNAL (decl1
) = 0;
13530 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
13531 && TREE_PUBLIC (ctx
))
13532 /* This is a function in a local class in an extern inline
13534 comdat_linkage (decl1
);
13536 /* If this function belongs to an interface, it is public.
13537 If it belongs to someone else's interface, it is also external.
13538 This only affects inlines and template instantiations. */
13539 else if (interface_unknown
== 0
13540 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13541 || flag_alt_external_templates
))
13543 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
13544 || processing_template_decl
)
13546 DECL_EXTERNAL (decl1
)
13548 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
13549 && !DECL_VINDEX (decl1
)));
13551 /* For WIN32 we also want to put these in linkonce sections. */
13552 maybe_make_one_only (decl1
);
13555 DECL_EXTERNAL (decl1
) = 0;
13556 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
13557 DECL_INTERFACE_KNOWN (decl1
) = 1;
13559 else if (interface_unknown
&& interface_only
13560 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13561 || flag_alt_external_templates
))
13563 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13564 interface, we will have interface_only set but not
13565 interface_known. In that case, we don't want to use the normal
13566 heuristics because someone will supply a #pragma implementation
13567 elsewhere, and deducing it here would produce a conflict. */
13568 comdat_linkage (decl1
);
13569 DECL_EXTERNAL (decl1
) = 0;
13570 DECL_INTERFACE_KNOWN (decl1
) = 1;
13571 DECL_DEFER_OUTPUT (decl1
) = 1;
13575 /* This is a definition, not a reference.
13576 So clear DECL_EXTERNAL. */
13577 DECL_EXTERNAL (decl1
) = 0;
13579 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
13580 && ! DECL_INTERFACE_KNOWN (decl1
)
13581 /* Don't try to defer nested functions for now. */
13582 && ! decl_function_context (decl1
))
13583 DECL_DEFER_OUTPUT (decl1
) = 1;
13585 DECL_INTERFACE_KNOWN (decl1
) = 1;
13589 current_binding_level
->parm_flag
= 1;
13592 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13594 /* We need to do this even if we aren't expanding yet so that
13595 assemble_external works. */
13596 make_decl_rtl (decl1
, NULL
);
13598 /* Promote the value to int before returning it. */
13599 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13600 restype
= type_promotes_to (restype
);
13602 /* If this fcn was already referenced via a block-scope `extern' decl
13603 (or an implicit decl), propagate certain information about the usage. */
13604 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13605 TREE_ADDRESSABLE (decl1
) = 1;
13607 if (DECL_RESULT (decl1
) == NULL_TREE
)
13609 DECL_RESULT (decl1
)
13610 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13611 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13612 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13617 if (DECL_DESTRUCTOR_P (decl1
))
13619 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13620 DECL_CONTEXT (dtor_label
) = current_function_decl
;
13622 /* Under the old ABI we return `this' from constructors, so we make
13623 ordinary `return' statements in constructors jump to CTOR_LABEL;
13624 from there we return `this'. Under the new ABI, we don't bother
13625 with any of this. By not setting CTOR_LABEL the remainder of the
13626 machinery is automatically disabled. */
13627 else if (!flag_new_abi
&& DECL_CONSTRUCTOR_P (decl1
))
13629 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13630 DECL_CONTEXT (ctor_label
) = current_function_decl
;
13633 store_parm_decls (current_function_parms
);
13638 /* Store the parameter declarations into the current function declaration.
13639 This is called after parsing the parameter declarations, before
13640 digesting the body of the function.
13642 Also install to binding contour return value identifier, if any. */
13645 store_parm_decls (current_function_parms
)
13646 tree current_function_parms
;
13648 register tree fndecl
= current_function_decl
;
13649 register tree parm
;
13650 int parms_have_cleanups
= 0;
13651 tree cleanups
= NULL_TREE
;
13653 /* This is a list of types declared among parms in a prototype. */
13654 tree parmtags
= current_function_parm_tags
;
13656 /* This is a chain of any other decls that came in among the parm
13657 declarations. If a parm is declared with enum {foo, bar} x;
13658 then CONST_DECLs for foo and bar are put here. */
13659 tree nonparms
= NULL_TREE
;
13661 if (current_function_parms
)
13663 /* This case is when the function was defined with an ANSI prototype.
13664 The parms already have decls, so we need not do anything here
13665 except record them as in effect
13666 and complain if any redundant old-style parm decls were written. */
13668 tree specparms
= current_function_parms
;
13671 /* Must clear this because it might contain TYPE_DECLs declared
13673 storedecls (NULL_TREE
);
13675 /* If we're doing semantic analysis, then we'll call pushdecl
13676 for each of these. We must do them in reverse order so that
13677 they end in the correct forward order. */
13678 specparms
= nreverse (specparms
);
13680 for (parm
= specparms
; parm
; parm
= next
)
13682 next
= TREE_CHAIN (parm
);
13683 if (TREE_CODE (parm
) == PARM_DECL
)
13687 if (DECL_NAME (parm
) == NULL_TREE
13688 || TREE_CODE (parm
) != VOID_TYPE
)
13691 cp_error ("parameter `%D' declared void", parm
);
13693 cleanup
= (processing_template_decl
13695 : maybe_build_cleanup (parm
));
13698 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13702 /* If we find an enum constant or a type tag,
13703 put it aside for the moment. */
13704 TREE_CHAIN (parm
) = NULL_TREE
;
13705 nonparms
= chainon (nonparms
, parm
);
13709 /* Get the decls in their original chain order and record in the
13710 function. This is all and only the PARM_DECLs that were
13711 pushed into scope by the loop above. */
13712 DECL_ARGUMENTS (fndecl
) = getdecls ();
13713 storetags (chainon (parmtags
, gettags ()));
13716 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13718 /* Now store the final chain of decls for the arguments
13719 as the decl-chain of the current lexical scope.
13720 Put the enumerators in as well, at the front so that
13721 DECL_ARGUMENTS is not modified. */
13722 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13724 /* Now that we have initialized the parms, we can start their
13725 cleanups. We cannot do this before, since expand_decl_cleanup
13726 should not be called before the parm can be used. */
13729 finish_decl_cleanup (TREE_PURPOSE (cleanups
),
13730 TREE_VALUE (cleanups
));
13731 cleanups
= TREE_CHAIN (cleanups
);
13734 /* Create a binding contour which can be used to catch
13735 cleanup-generated temporaries. */
13736 if (parms_have_cleanups
)
13739 /* Do the starting of the exception specifications, if we have any. */
13740 if (flag_exceptions
&& !processing_template_decl
13741 && flag_enforce_eh_specs
13742 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13743 current_eh_spec_try_block
= expand_start_eh_spec ();
13747 /* We have finished doing semantic analysis on DECL, but have not yet
13748 generated RTL for its body. Save away our current state, so that
13749 when we want to generate RTL later we know what to do. */
13752 save_function_data (decl
)
13755 struct cp_language_function
*f
;
13757 /* Save the language-specific per-function data so that we can
13758 get it back when we really expand this function. */
13759 my_friendly_assert (!DECL_PENDING_INLINE_P (decl
),
13763 f
= ((struct cp_language_function
*)
13764 xmalloc (sizeof (struct cp_language_function
)));
13765 memcpy (f
, cp_function_chain
, sizeof (struct cp_language_function
));
13766 DECL_SAVED_FUNCTION_DATA (decl
) = f
;
13768 /* Clear out the bits we don't need. */
13769 f
->base
.x_stmt_tree
.x_last_stmt
= NULL_TREE
;
13770 f
->base
.x_stmt_tree
.x_last_expr_type
= NULL_TREE
;
13771 f
->x_named_label_uses
= NULL
;
13772 f
->bindings
= NULL
;
13774 /* When we get back here again, we will be expanding. */
13775 f
->x_expanding_p
= 1;
13777 /* If we've already decided that we cannot inline this function, we
13778 must remember that fact when we actually go to expand the
13780 f
->cannot_inline
= current_function_cannot_inline
;
13783 /* At the end of every constructor we generate to code to return
13784 `this'. Do that now. */
13787 finish_constructor_body ()
13789 /* Any return from a constructor will end up here. */
13791 add_stmt (build_stmt (LABEL_STMT
, ctor_label
));
13793 /* Clear CTOR_LABEL so that finish_return_stmt knows to really
13794 generate the return, rather than a goto to CTOR_LABEL. */
13795 ctor_label
= NULL_TREE
;
13796 /* In check_return_expr we translate an empty return from a
13797 constructor to a return of `this'. */
13798 finish_return_stmt (NULL_TREE
);
13799 /* Mark the end of the constructor. */
13800 add_stmt (build_stmt (CTOR_STMT
));
13803 /* At the end of every destructor we generate code to restore virtual
13804 function tables to the values desired by base classes and to call
13805 to base class destructors. Do that now. */
13808 finish_destructor_body ()
13810 tree compound_stmt
;
13815 /* Create a block to contain all the extra code. */
13816 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
13818 /* Any return from a destructor will end up here. */
13819 add_stmt (build_stmt (LABEL_STMT
, dtor_label
));
13821 /* Generate the code to call destructor on base class. If this
13822 destructor belongs to a class with virtual functions, then set
13823 the virtual function table pointer to represent the type of our
13826 /* This side-effect makes call to `build_delete' generate the code
13827 we have to have at the end of this destructor. `build_delete'
13828 will set the flag again. */
13829 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
13831 exprstmt
= build_delete (current_class_type
,
13833 sfk_base_destructor
,
13834 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
,
13837 if (exprstmt
!= error_mark_node
13838 && (TREE_CODE (exprstmt
) != NOP_EXPR
13839 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
13840 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
13842 if (exprstmt
!= void_zero_node
)
13843 /* Don't call `expand_expr_stmt' if we're not going to do
13844 anything, since -Wall will give a diagnostic. */
13845 finish_expr_stmt (exprstmt
);
13847 /* Run destructors for all virtual baseclasses. */
13848 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13853 if_stmt
= begin_if_stmt ();
13854 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13855 current_in_charge_parm
,
13859 vbases
= CLASSTYPE_VBASECLASSES (current_class_type
);
13860 /* The CLASSTYPE_VBASECLASSES list is in initialization
13861 order, so we have to march through it in reverse order. */
13862 for (vbases
= nreverse (copy_list (vbases
));
13864 vbases
= TREE_CHAIN (vbases
))
13866 tree vbase
= TREE_VALUE (vbases
);
13867 tree base_type
= BINFO_TYPE (vbase
);
13869 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (base_type
))
13871 tree base_ptr_type
= build_pointer_type (base_type
);
13872 tree expr
= current_class_ptr
;
13874 /* Convert to the basetype here, as we know the layout is
13875 fixed. What is more, if we let build_method_call do it,
13876 it will use the vtable, which may have been clobbered
13877 by the deletion of our primary base. */
13879 expr
= build1 (NOP_EXPR
, base_ptr_type
, expr
);
13880 expr
= build (PLUS_EXPR
, base_ptr_type
, expr
,
13881 BINFO_OFFSET (vbase
));
13882 expr
= build_indirect_ref (expr
, NULL
);
13883 expr
= build_method_call (expr
, base_dtor_identifier
,
13886 finish_expr_stmt (expr
);
13890 finish_then_clause (if_stmt
);
13895 virtual_size
= c_sizeof (current_class_type
);
13897 /* At the end, call delete if that's what's requested. */
13899 /* FDIS sez: At the point of definition of a virtual destructor
13900 (including an implicit definition), non-placement operator delete
13901 shall be looked up in the scope of the destructor's class and if
13902 found shall be accessible and unambiguous.
13904 This is somewhat unclear, but I take it to mean that if the class
13905 only defines placement deletes we don't do anything here. So we
13906 pass LOOKUP_SPECULATIVELY; delete_sanity will complain for us if
13907 they ever try to delete one of these. */
13908 exprstmt
= build_op_delete_call
13909 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
13910 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
13912 if_stmt
= begin_if_stmt ();
13913 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13914 current_in_charge_parm
,
13917 finish_expr_stmt (exprstmt
);
13918 finish_then_clause (if_stmt
);
13921 /* Close the block we started above. */
13922 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
13925 /* Finish up a function declaration and compile that function
13926 all the way to assembler language output. The free the storage
13927 for the function definition.
13929 FLAGS is a bitwise or of the following values:
13931 An extra call to poplevel (and expand_end_bindings) must be
13932 made to take care of the binding contour for the base
13933 initializers. This is only relevant for constructors.
13935 We just finished processing the body of an in-class inline
13936 function definition. (This processing will have taken place
13937 after the class definition is complete.) */
13940 finish_function (flags
)
13943 register tree fndecl
= current_function_decl
;
13944 tree fntype
, ctype
= NULL_TREE
;
13945 int call_poplevel
= (flags
& 1) != 0;
13946 int inclass_inline
= (flags
& 2) != 0;
13949 /* When we get some parse errors, we can end up without a
13950 current_function_decl, so cope. */
13951 if (fndecl
== NULL_TREE
)
13952 return error_mark_node
;
13954 nested
= function_depth
> 1;
13955 fntype
= TREE_TYPE (fndecl
);
13957 /* TREE_READONLY (fndecl) = 1;
13958 This caused &foo to be of type ptr-to-const-function
13959 which then got a warning when stored in a ptr-to-function variable. */
13961 my_friendly_assert (building_stmt_tree (), 20000911);
13963 /* For a cloned function, we've already got all the code we need;
13964 there's no need to add any extra bits. */
13965 if (!DECL_CLONED_FUNCTION_P (fndecl
))
13967 if (DECL_CONSTRUCTOR_P (fndecl
))
13969 finish_constructor_body ();
13973 else if (DECL_DESTRUCTOR_P (fndecl
) && !processing_template_decl
)
13974 finish_destructor_body ();
13975 else if (DECL_MAIN_P (fndecl
))
13977 /* Make it so that `main' always returns 0 by default. */
13979 finish_return_stmt (integer_one_node
);
13981 finish_return_stmt (integer_zero_node
);
13985 /* Finish dealing with exception specifiers. */
13986 if (flag_exceptions
&& !processing_template_decl
13987 && flag_enforce_eh_specs
13988 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13989 expand_end_eh_spec (TYPE_RAISES_EXCEPTIONS
13990 (TREE_TYPE (current_function_decl
)),
13991 current_eh_spec_try_block
);
13994 /* If we're saving up tree structure, tie off the function now. */
13995 finish_stmt_tree (&DECL_SAVED_TREE (fndecl
));
13997 /* This must come after expand_function_end because cleanups might
13998 have declarations (from inline functions) that need to go into
13999 this function's blocks. */
14000 if (current_binding_level
->parm_flag
!= 1)
14001 my_friendly_abort (122);
14002 poplevel (1, 0, 1);
14004 /* Remember that we were in class scope. */
14005 if (current_class_name
)
14006 ctype
= current_class_type
;
14008 /* Must mark the RESULT_DECL as being in this function. */
14009 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
14011 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
14012 to the FUNCTION_DECL node itself. */
14013 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
14015 /* Save away current state, if appropriate. */
14016 if (!processing_template_decl
)
14017 save_function_data (fndecl
);
14019 /* If this function calls `setjmp' it cannot be inlined. When
14020 `longjmp' is called it is not guaranteed to restore the value of
14021 local variables that have been modified since the call to
14022 `setjmp'. So, if were to inline this function into some caller
14023 `c', then when we `longjmp', we might not restore all variables
14024 in `c'. (It might seem, at first blush, that there's no way for
14025 this function to modify local variables in `c', but their
14026 addresses may have been stored somewhere accessible to this
14028 if (!processing_template_decl
&& calls_setjmp_p (fndecl
))
14029 DECL_UNINLINABLE (fndecl
) = 1;
14031 /* Clear out memory we no longer need. */
14032 free_after_parsing (cfun
);
14033 /* Since we never call rest_of_compilation, we never clear
14034 CFUN. Do so explicitly. */
14035 free_after_compilation (cfun
);
14038 /* If this is a in-class inline definition, we may have to pop the
14039 bindings for the template parameters that we added in
14040 maybe_begin_member_template_processing when start_function was
14042 if (inclass_inline
)
14043 maybe_end_member_template_processing ();
14045 /* Leave the scope of the class. */
14047 pop_nested_class ();
14053 /* Let the error reporting routines know that we're outside a
14054 function. For a nested function, this value is used in
14055 pop_cp_function_context and then reset via pop_function_context. */
14056 current_function_decl
= NULL_TREE
;
14061 /* Create the FUNCTION_DECL for a function definition.
14062 DECLSPECS and DECLARATOR are the parts of the declaration;
14063 they describe the return type and the name of the function,
14064 but twisted together in a fashion that parallels the syntax of C.
14066 This function creates a binding context for the function body
14067 as well as setting up the FUNCTION_DECL in current_function_decl.
14069 Returns a FUNCTION_DECL on success.
14071 If the DECLARATOR is not suitable for a function (it defines a datum
14072 instead), we return 0, which tells yyparse to report a parse error.
14074 May return void_type_node indicating that this method is actually
14075 a friend. See grokfield for more details.
14077 Came here with a `.pushlevel' .
14079 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14080 CHANGES TO CODE IN `grokfield'. */
14083 start_method (declspecs
, declarator
, attrlist
)
14084 tree declarator
, declspecs
, attrlist
;
14086 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
14089 /* Something too ugly to handle. */
14090 if (fndecl
== NULL_TREE
)
14093 /* Pass friends other than inline friend functions back. */
14094 if (fndecl
== void_type_node
)
14097 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
14098 /* Not a function, tell parser to report parse error. */
14101 if (DECL_IN_AGGR_P (fndecl
))
14103 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
14105 if (DECL_CONTEXT (fndecl
)
14106 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
14107 cp_error ("`%D' is already defined in class `%T'", fndecl
,
14108 DECL_CONTEXT (fndecl
));
14110 return void_type_node
;
14113 check_template_shadow (fndecl
);
14115 DECL_THIS_INLINE (fndecl
) = 1;
14117 if (flag_default_inline
)
14118 DECL_INLINE (fndecl
) = 1;
14120 /* We process method specializations in finish_struct_1. */
14121 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
14122 fndecl
= push_template_decl (fndecl
);
14124 if (! DECL_FRIEND_P (fndecl
))
14126 if (TREE_CHAIN (fndecl
))
14128 fndecl
= copy_node (fndecl
);
14129 TREE_CHAIN (fndecl
) = NULL_TREE
;
14132 if (DECL_CONSTRUCTOR_P (fndecl
))
14134 if (! grok_ctor_properties (current_class_type
, fndecl
))
14135 return void_type_node
;
14137 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
14138 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
14141 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0);
14143 /* Make a place for the parms */
14145 current_binding_level
->parm_flag
= 1;
14147 DECL_IN_AGGR_P (fndecl
) = 1;
14151 /* Go through the motions of finishing a function definition.
14152 We don't compile this method until after the whole class has
14155 FINISH_METHOD must return something that looks as though it
14156 came from GROKFIELD (since we are defining a method, after all).
14158 This is called after parsing the body of the function definition.
14159 STMTS is the chain of statements that makes up the function body.
14161 DECL is the ..._DECL that `start_method' provided. */
14164 finish_method (decl
)
14167 register tree fndecl
= decl
;
14170 register tree link
;
14172 if (decl
== void_type_node
)
14175 old_initial
= DECL_INITIAL (fndecl
);
14177 /* Undo the level for the parms (from start_method).
14178 This is like poplevel, but it causes nothing to be
14179 saved. Saving information here confuses symbol-table
14180 output routines. Besides, this information will
14181 be correctly output when this method is actually
14184 /* Clear out the meanings of the local variables of this level;
14185 also record in each decl which block it belongs to. */
14187 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
14189 if (DECL_NAME (link
) != NULL_TREE
)
14190 pop_binding (DECL_NAME (link
), link
);
14191 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
14192 DECL_CONTEXT (link
) = NULL_TREE
;
14195 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
14196 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
14197 current_binding_level
->parm_flag
,
14198 current_binding_level
->keep
);
14200 poplevel (0, 0, 0);
14202 DECL_INITIAL (fndecl
) = old_initial
;
14204 /* We used to check if the context of FNDECL was different from
14205 current_class_type as another way to get inside here. This didn't work
14206 for String.cc in libg++. */
14207 if (DECL_FRIEND_P (fndecl
))
14209 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
14210 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
14211 decl
= void_type_node
;
14217 /* Called when a new struct TYPE is defined.
14218 If this structure or union completes the type of any previous
14219 variable declaration, lay it out and output its rtl. */
14222 hack_incomplete_structures (type
)
14226 struct binding_level
*level
;
14228 if (!type
) /* Don't do this for class templates. */
14231 if (namespace_bindings_p ())
14234 list
= &namespace_scope_incomplete
;
14238 level
= innermost_nonclass_level ();
14239 list
= &level
->incomplete
;
14246 tree decl
= TREE_VALUE (*list
);
14247 if ((decl
&& TREE_TYPE (decl
) == type
)
14248 || (TREE_TYPE (decl
)
14249 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14250 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
14252 int toplevel
= toplevel_bindings_p ();
14253 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14254 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
14255 layout_type (TREE_TYPE (decl
));
14256 layout_decl (decl
, 0);
14257 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
14261 expand_decl (decl
);
14262 cleanup
= maybe_build_cleanup (decl
);
14263 expand_decl_init (decl
);
14264 if (! expand_decl_cleanup (decl
, cleanup
))
14265 cp_error ("parser lost in parsing declaration of `%D'",
14268 *list
= TREE_CHAIN (*list
);
14271 list
= &TREE_CHAIN (*list
);
14274 /* Keep looking through artificial binding levels generated
14275 for local variables. */
14276 if (level
&& level
->keep
== 2)
14278 level
= level
->level_chain
;
14279 list
= &level
->incomplete
;
14286 /* If DECL is of a type which needs a cleanup, build that cleanup
14290 maybe_build_cleanup (decl
)
14293 tree type
= TREE_TYPE (decl
);
14295 if (type
!= error_mark_node
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
14297 int flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14300 if (TREE_CODE (type
) == ARRAY_TYPE
)
14304 mark_addressable (decl
);
14305 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14308 /* Optimize for space over speed here. */
14309 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14310 || flag_expensive_optimizations
)
14311 flags
|= LOOKUP_NONVIRTUAL
;
14313 rval
= build_delete (TREE_TYPE (rval
), rval
,
14314 sfk_complete_destructor
, flags
, 0);
14316 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14317 && ! TYPE_HAS_DESTRUCTOR (type
))
14318 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14319 build_tree_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14326 /* When a stmt has been parsed, this function is called. */
14331 /* Always assume this statement was not an expression statement. If
14332 it actually was an expression statement, its our callers
14333 responsibility to fix this up. */
14334 last_expr_type
= NULL_TREE
;
14337 /* DECL was originally constructed as a non-static member function,
14338 but turned out to be static. Update it accordingly. */
14341 revert_static_member_fn (decl
)
14345 tree function
= TREE_TYPE (decl
);
14346 tree args
= TYPE_ARG_TYPES (function
);
14348 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14349 != TYPE_UNQUALIFIED
)
14350 cp_error ("static member function `%#D' declared with type qualifiers",
14353 args
= TREE_CHAIN (args
);
14354 tmp
= build_function_type (TREE_TYPE (function
), args
);
14355 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14356 tmp
= build_exception_variant (tmp
,
14357 TYPE_RAISES_EXCEPTIONS (function
));
14358 TREE_TYPE (decl
) = tmp
;
14359 if (DECL_ARGUMENTS (decl
))
14360 DECL_ARGUMENTS (decl
) = TREE_CHAIN (DECL_ARGUMENTS (decl
));
14361 DECL_STATIC_FUNCTION_P (decl
) = 1;
14364 /* Initialize the variables used during compilation of a C++
14368 push_cp_function_context (f
)
14369 struct function
*f
;
14371 struct cp_language_function
*p
14372 = ((struct cp_language_function
*)
14373 xcalloc (1, sizeof (struct cp_language_function
)));
14374 f
->language
= (struct language_function
*) p
;
14376 /* It takes an explicit call to expand_body to generate RTL for a
14380 /* Whenever we start a new function, we destroy temporaries in the
14382 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
14385 /* Free the language-specific parts of F, now that we've finished
14386 compiling the function. */
14389 pop_cp_function_context (f
)
14390 struct function
*f
;
14393 free (f
->language
);
14397 /* Mark P for GC. */
14400 mark_lang_function (p
)
14401 struct cp_language_function
*p
;
14406 mark_c_language_function (&p
->base
);
14408 ggc_mark_tree (p
->x_ctor_label
);
14409 ggc_mark_tree (p
->x_dtor_label
);
14410 ggc_mark_tree (p
->x_current_class_ptr
);
14411 ggc_mark_tree (p
->x_current_class_ref
);
14412 ggc_mark_tree (p
->x_eh_spec_try_block
);
14414 mark_named_label_lists (&p
->x_named_labels
, &p
->x_named_label_uses
);
14415 mark_binding_level (&p
->bindings
);
14418 /* Mark the language-specific data in F for GC. */
14421 mark_cp_function_context (f
)
14422 struct function
*f
;
14424 mark_lang_function ((struct cp_language_function
*) f
->language
);
14431 enum tree_code code
= TREE_CODE (t
);
14432 if (code
== IDENTIFIER_NODE
)
14434 struct lang_identifier
*li
= (struct lang_identifier
*) t
;
14435 struct lang_id2
*li2
= li
->x
;
14436 ggc_mark_tree (li
->namespace_bindings
);
14437 ggc_mark_tree (li
->bindings
);
14438 ggc_mark_tree (li
->class_value
);
14439 ggc_mark_tree (li
->class_template_info
);
14443 ggc_mark_tree (li2
->label_value
);
14444 ggc_mark_tree (li2
->implicit_decl
);
14445 ggc_mark_tree (li2
->error_locus
);
14448 else if (code
== CPLUS_BINDING
)
14450 if (BINDING_HAS_LEVEL_P (t
))
14451 mark_binding_level (&BINDING_LEVEL (t
));
14453 ggc_mark_tree (BINDING_SCOPE (t
));
14454 ggc_mark_tree (BINDING_VALUE (t
));
14456 else if (code
== OVERLOAD
)
14457 ggc_mark_tree (OVL_FUNCTION (t
));
14458 else if (code
== TEMPLATE_PARM_INDEX
)
14459 ggc_mark_tree (TEMPLATE_PARM_DECL (t
));
14460 else if (TREE_CODE_CLASS (code
) == 'd')
14462 struct lang_decl
*ld
= DECL_LANG_SPECIFIC (t
);
14467 c_mark_lang_decl (&ld
->decl_flags
.base
);
14468 if (!DECL_GLOBAL_CTOR_P (t
)
14469 && !DECL_GLOBAL_DTOR_P (t
)
14470 && !DECL_THUNK_P (t
))
14471 ggc_mark_tree (ld
->decl_flags
.u2
.access
);
14472 else if (DECL_THUNK_P (t
))
14473 ggc_mark_tree (ld
->decl_flags
.u2
.vcall_offset
);
14474 if (TREE_CODE (t
) != NAMESPACE_DECL
)
14475 ggc_mark_tree (ld
->decl_flags
.u
.template_info
);
14477 mark_binding_level (&NAMESPACE_LEVEL (t
));
14478 if (CAN_HAVE_FULL_LANG_DECL_P (t
))
14480 ggc_mark_tree (ld
->befriending_classes
);
14481 ggc_mark_tree (ld
->context
);
14482 ggc_mark_tree (ld
->cloned_function
);
14483 if (!DECL_OVERLOADED_OPERATOR_P (t
))
14484 ggc_mark_tree (ld
->u2
.vtt_parm
);
14485 if (TREE_CODE (t
) == TYPE_DECL
)
14486 ggc_mark_tree (ld
->u
.sorted_fields
);
14487 else if (TREE_CODE (t
) == FUNCTION_DECL
14488 && !DECL_PENDING_INLINE_P (t
))
14489 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t
));
14493 else if (TREE_CODE_CLASS (code
) == 't')
14495 struct lang_type
*lt
= TYPE_LANG_SPECIFIC (t
);
14497 if (lt
&& !(TREE_CODE (t
) == POINTER_TYPE
14498 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
14501 ggc_mark_tree (lt
->primary_base
);
14502 ggc_mark_tree (lt
->vfields
);
14503 ggc_mark_tree (lt
->vbases
);
14504 ggc_mark_tree (lt
->tags
);
14505 ggc_mark_tree (lt
->size
);
14506 ggc_mark_tree (lt
->pure_virtuals
);
14507 ggc_mark_tree (lt
->friend_classes
);
14508 ggc_mark_tree (lt
->rtti
);
14509 ggc_mark_tree (lt
->methods
);
14510 ggc_mark_tree (lt
->template_info
);
14511 ggc_mark_tree (lt
->befriending_classes
);
14514 /* In the case of pointer-to-member function types, the
14515 TYPE_LANG_SPECIFIC is really just a tree. */
14516 ggc_mark_tree ((tree
) lt
);
14520 /* Return the IDENTIFIER_GLOBAL_VALUE of T, for use in common code, since
14521 the definition of IDENTIFIER_GLOBAL_VALUE is different for C and C++. */
14524 identifier_global_value (t
)
14527 return IDENTIFIER_GLOBAL_VALUE (t
);
14530 /* Build the void_list_node (void_type_node having been created). */
14532 build_void_list_node ()
14534 tree t
= build_tree_list (NULL_TREE
, void_type_node
);
14535 TREE_PARMLIST (t
) = 1;
14540 cp_missing_noreturn_ok_p (decl
)
14543 /* A missing noreturn is ok for the `main' function. */
14544 return MAIN_NAME_P (DECL_ASSEMBLER_NAME (decl
));