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_VALUE is
395 the IDENTIFIER_CLASS_VALUE before we entered the class. Thus,
396 when leaving class scope, we can restore the
397 IDENTIFIER_CLASS_VALUE by walking this list. The TREE_TYPE is
398 the DECL bound by this name in the class. */
401 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
402 is used for all binding levels. */
405 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
406 label in this scope. The TREE_PURPOSE is the previous value of
407 the IDENTIFIER_LABEL VALUE. */
408 tree shadowed_labels
;
410 /* For each level (except not the global one),
411 a chain of BLOCK nodes for all the levels
412 that were entered and exited one level down. */
415 /* The _TYPE node for this level, if parm_flag == 2. */
418 /* The binding level which this one is contained in (inherits from). */
419 struct binding_level
*level_chain
;
421 /* List of decls in `names' that have incomplete
422 structure or union types. */
425 /* List of VAR_DECLS saved from a previous for statement.
426 These would be dead in ISO-conforming code, but might
427 be referenced in ARM-era code. These are stored in a
428 TREE_LIST; the TREE_VALUE is the actual declaration. */
429 tree dead_vars_from_for
;
431 /* 1 for the level that holds the parameters of a function.
432 2 for the level that holds a class declaration. */
433 unsigned parm_flag
: 2;
435 /* 1 means make a BLOCK for this level regardless of all else.
436 2 for temporary binding contours created by the compiler. */
439 /* Nonzero if this level "doesn't exist" for tags. */
440 unsigned tag_transparent
: 1;
442 /* Nonzero if this level can safely have additional
443 cleanup-needing variables added to it. */
444 unsigned more_cleanups_ok
: 1;
445 unsigned have_cleanups
: 1;
447 /* Nonzero if this scope is for storing the decls for template
448 parameters and generic decls; these decls will be discarded and
449 replaced with a TEMPLATE_DECL. */
450 unsigned template_parms_p
: 1;
452 /* Nonzero if this scope corresponds to the `<>' in a
453 `template <>' clause. Whenever this flag is set,
454 TEMPLATE_PARMS_P will be set as well. */
455 unsigned template_spec_p
: 1;
457 /* This is set for a namespace binding level. */
458 unsigned namespace_p
: 1;
460 /* True if this level is that of a for-statement where we need to
461 worry about ambiguous (ARM or ISO) scope rules. */
462 unsigned is_for_scope
: 1;
464 /* True if this level corresponds to an EH region, as for a try block.
465 Currently this information is only available while building the
467 unsigned eh_region
: 1;
469 /* Four bits left for this word. */
471 #if defined(DEBUG_CP_BINDING_LEVELS)
472 /* Binding depth at which this level began. */
473 unsigned binding_depth
;
474 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
477 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
479 /* The binding level currently in effect. */
481 #define current_binding_level \
483 ? cp_function_chain->bindings \
484 : scope_chain->bindings)
486 /* The binding level of the current class, if any. */
488 #define class_binding_level scope_chain->class_bindings
490 /* A chain of binding_level structures awaiting reuse. */
492 static struct binding_level
*free_binding_level
;
494 /* The outermost binding level, for names of file scope.
495 This is created when the compiler is started and exists
496 through the entire run. */
498 static struct binding_level
*global_binding_level
;
500 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
502 static int keep_next_level_flag
;
504 #if defined(DEBUG_CP_BINDING_LEVELS)
505 static int binding_depth
= 0;
506 static int is_class_level
= 0;
513 for (i
= 0; i
< binding_depth
*2; i
++)
516 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
518 static tree pushdecl_with_scope
PARAMS ((tree
, struct binding_level
*));
521 push_binding_level (newlevel
, tag_transparent
, keep
)
522 struct binding_level
*newlevel
;
523 int tag_transparent
, keep
;
525 /* Add this level to the front of the chain (stack) of levels that
527 memset ((char*) newlevel
, 0, sizeof (struct binding_level
));
528 newlevel
->level_chain
= current_binding_level
;
529 current_binding_level
= newlevel
;
530 newlevel
->tag_transparent
= tag_transparent
;
531 newlevel
->more_cleanups_ok
= 1;
533 newlevel
->keep
= keep
;
534 #if defined(DEBUG_CP_BINDING_LEVELS)
535 newlevel
->binding_depth
= binding_depth
;
537 fprintf (stderr
, "push %s level 0x%08x line %d\n",
538 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
541 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
544 /* Find the innermost enclosing class scope, and reset
545 CLASS_BINDING_LEVEL appropriately. */
548 find_class_binding_level ()
550 struct binding_level
*level
= current_binding_level
;
552 while (level
&& level
->parm_flag
!= 2)
553 level
= level
->level_chain
;
554 if (level
&& level
->parm_flag
== 2)
555 class_binding_level
= level
;
557 class_binding_level
= 0;
563 if (global_binding_level
)
565 /* Cannot pop a level, if there are none left to pop. */
566 if (current_binding_level
== global_binding_level
)
567 my_friendly_abort (123);
569 /* Pop the current level, and free the structure for reuse. */
570 #if defined(DEBUG_CP_BINDING_LEVELS)
573 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
574 (is_class_level
) ? "class" : "block",
575 current_binding_level
, lineno
);
576 if (is_class_level
!= (current_binding_level
== class_binding_level
))
579 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
582 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
584 register struct binding_level
*level
= current_binding_level
;
585 current_binding_level
= current_binding_level
->level_chain
;
586 level
->level_chain
= free_binding_level
;
587 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
588 if (level
->binding_depth
!= binding_depth
)
590 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
591 free_binding_level
= level
;
592 find_class_binding_level ();
597 suspend_binding_level ()
599 if (class_binding_level
)
600 current_binding_level
= class_binding_level
;
602 if (global_binding_level
)
604 /* Cannot suspend a level, if there are none left to suspend. */
605 if (current_binding_level
== global_binding_level
)
606 my_friendly_abort (123);
608 /* Suspend the current level. */
609 #if defined(DEBUG_CP_BINDING_LEVELS)
612 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
613 (is_class_level
) ? "class" : "block",
614 current_binding_level
, lineno
);
615 if (is_class_level
!= (current_binding_level
== class_binding_level
))
618 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
621 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
622 current_binding_level
= current_binding_level
->level_chain
;
623 find_class_binding_level ();
627 resume_binding_level (b
)
628 struct binding_level
*b
;
630 /* Resuming binding levels is meant only for namespaces,
631 and those cannot nest into classes. */
632 my_friendly_assert(!class_binding_level
, 386);
633 /* Also, resuming a non-directly nested namespace is a no-no. */
634 my_friendly_assert(b
->level_chain
== current_binding_level
, 386);
635 current_binding_level
= b
;
636 #if defined(DEBUG_CP_BINDING_LEVELS)
637 b
->binding_depth
= binding_depth
;
639 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
640 (is_class_level
) ? "class" : "block", b
, lineno
);
643 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
646 /* Create a new `struct binding_level'. */
649 struct binding_level
*
650 make_binding_level ()
653 return (struct binding_level
*) xmalloc (sizeof (struct binding_level
));
656 /* Nonzero if we are currently in the global binding level. */
661 return current_binding_level
== global_binding_level
;
664 /* Return the innermost binding level that is not for a class scope. */
666 static struct binding_level
*
667 innermost_nonclass_level ()
669 struct binding_level
*b
;
671 b
= current_binding_level
;
672 while (b
->parm_flag
== 2)
678 /* Nonzero if we are currently in a toplevel binding level. This
679 means either the global binding level or a namespace in a toplevel
680 binding level. Since there are no non-toplevel namespace levels,
681 this really means any namespace or template parameter level. We
682 also include a class whose context is toplevel. */
685 toplevel_bindings_p ()
687 struct binding_level
*b
= innermost_nonclass_level ();
689 return b
->namespace_p
|| b
->template_parms_p
;
692 /* Nonzero if this is a namespace scope, or if we are defining a class
693 which is itself at namespace scope, or whose enclosing class is
694 such a class, etc. */
697 namespace_bindings_p ()
699 struct binding_level
*b
= innermost_nonclass_level ();
701 return b
->namespace_p
;
704 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
705 unconditionally. Otherwise, use the normal logic to decide whether
706 or not to create a BLOCK. */
709 keep_next_level (keep
)
712 keep_next_level_flag
= keep
;
715 /* Nonzero if the current level needs to have a BLOCK made. */
720 return (current_binding_level
->blocks
!= NULL_TREE
721 || current_binding_level
->keep
722 || current_binding_level
->names
!= NULL_TREE
723 || (current_binding_level
->tags
!= NULL_TREE
724 && !current_binding_level
->tag_transparent
));
728 declare_namespace_level ()
730 current_binding_level
->namespace_p
= 1;
733 /* Returns non-zero if this scope was created to store template
737 template_parm_scope_p ()
739 return current_binding_level
->template_parms_p
;
742 /* Returns the kind of template specialization we are currently
743 processing, given that it's declaration contained N_CLASS_SCOPES
744 explicit scope qualifications. */
747 current_tmpl_spec_kind (n_class_scopes
)
750 int n_template_parm_scopes
= 0;
751 int seen_specialization_p
= 0;
752 int innermost_specialization_p
= 0;
753 struct binding_level
*b
;
755 /* Scan through the template parameter scopes. */
756 for (b
= current_binding_level
; b
->template_parms_p
; b
= b
->level_chain
)
758 /* If we see a specialization scope inside a parameter scope,
759 then something is wrong. That corresponds to a declaration
762 template <class T> template <> ...
764 which is always illegal since [temp.expl.spec] forbids the
765 specialization of a class member template if the enclosing
766 class templates are not explicitly specialized as well. */
767 if (b
->template_spec_p
)
769 if (n_template_parm_scopes
== 0)
770 innermost_specialization_p
= 1;
772 seen_specialization_p
= 1;
774 else if (seen_specialization_p
== 1)
775 return tsk_invalid_member_spec
;
777 ++n_template_parm_scopes
;
780 /* Handle explicit instantiations. */
781 if (processing_explicit_instantiation
)
783 if (n_template_parm_scopes
!= 0)
784 /* We've seen a template parameter list during an explicit
785 instantiation. For example:
787 template <class T> template void f(int);
789 This is erroneous. */
790 return tsk_invalid_expl_inst
;
792 return tsk_expl_inst
;
795 if (n_template_parm_scopes
< n_class_scopes
)
796 /* We've not seen enough template headers to match all the
797 specialized classes present. For example:
799 template <class T> void R<T>::S<T>::f(int);
801 This is illegal; there needs to be one set of template
802 parameters for each class. */
803 return tsk_insufficient_parms
;
804 else if (n_template_parm_scopes
== n_class_scopes
)
805 /* We're processing a non-template declaration (even though it may
806 be a member of a template class.) For example:
808 template <class T> void S<T>::f(int);
810 The `class T' maches the `S<T>', leaving no template headers
811 corresponding to the `f'. */
813 else if (n_template_parm_scopes
> n_class_scopes
+ 1)
814 /* We've got too many template headers. For example:
816 template <> template <class T> void f (T);
818 There need to be more enclosing classes. */
819 return tsk_excessive_parms
;
821 /* This must be a template. It's of the form:
823 template <class T> template <class U> void S<T>::f(U);
825 This is a specialization if the innermost level was a
826 specialization; otherwise it's just a definition of the
828 return innermost_specialization_p
? tsk_expl_spec
: tsk_template
;
832 set_class_shadows (shadows
)
835 class_binding_level
->class_shadowed
= shadows
;
838 /* Enter a new binding level.
839 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
840 not for that of tags. */
843 pushlevel (tag_transparent
)
846 struct binding_level
*newlevel
;
848 if (cfun
&& !doing_semantic_analysis_p ())
851 /* Reuse or create a struct for this binding level. */
852 #if defined(DEBUG_CP_BINDING_LEVELS)
854 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
855 if (free_binding_level
)
856 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
858 newlevel
= free_binding_level
;
859 free_binding_level
= free_binding_level
->level_chain
;
862 newlevel
= make_binding_level ();
864 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
865 GNU_xref_start_scope ((HOST_WIDE_INT
) newlevel
);
866 keep_next_level_flag
= 0;
869 /* Enter a new scope. The KIND indicates what kind of scope is being
880 case sk_template_spec
:
881 current_binding_level
->template_spec_p
= 1;
884 case sk_template_parms
:
885 current_binding_level
->template_parms_p
= 1;
889 my_friendly_abort (20000309);
893 /* Exit the current scope. */
902 note_level_for_for ()
904 current_binding_level
->is_for_scope
= 1;
907 /* Record that the current binding level represents a try block. */
912 current_binding_level
->eh_region
= 1;
915 /* For a binding between a name and an entity at a block scope,
916 this is the `struct binding_level' for the block. */
917 #define BINDING_LEVEL(NODE) \
918 (((struct tree_binding*)NODE)->scope.level)
920 /* A free list of CPLUS_BINDING nodes, connected by their
923 static tree free_bindings
;
925 /* Make DECL the innermost binding for ID. The LEVEL is the binding
926 level at which this declaration is being bound. */
929 push_binding (id
, decl
, level
)
932 struct binding_level
* level
;
938 binding
= free_bindings
;
939 free_bindings
= TREE_CHAIN (binding
);
942 binding
= make_node (CPLUS_BINDING
);
944 /* Now, fill in the binding information. */
945 BINDING_VALUE (binding
) = decl
;
946 BINDING_TYPE (binding
) = NULL_TREE
;
947 BINDING_LEVEL (binding
) = level
;
948 INHERITED_VALUE_BINDING_P (binding
) = 0;
949 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
950 BINDING_HAS_LEVEL_P (binding
) = 1;
952 /* And put it on the front of the list of bindings for ID. */
953 TREE_CHAIN (binding
) = IDENTIFIER_BINDING (id
);
954 IDENTIFIER_BINDING (id
) = binding
;
957 /* ID is already bound in the current scope. But, DECL is an
958 additional binding for ID in the same scope. This is the `struct
959 stat' hack whereby a non-typedef class-name or enum-name can be
960 bound at the same level as some other kind of entity. It's the
961 responsibility of the caller to check that inserting this name is
962 legal here. Returns nonzero if the new binding was successful. */
964 add_binding (id
, decl
)
968 tree binding
= IDENTIFIER_BINDING (id
);
971 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
972 /* The new name is the type name. */
973 BINDING_TYPE (binding
) = decl
;
974 else if (!BINDING_VALUE (binding
))
975 /* This situation arises when push_class_level_binding moves an
976 inherited type-binding out of the way to make room for a new
978 BINDING_VALUE (binding
) = decl
;
979 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
980 && DECL_ARTIFICIAL (BINDING_VALUE (binding
)))
982 /* The old binding was a type name. It was placed in
983 BINDING_VALUE because it was thought, at the point it was
984 declared, to be the only entity with such a name. Move the
985 type name into the type slot; it is now hidden by the new
987 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
988 BINDING_VALUE (binding
) = decl
;
989 INHERITED_VALUE_BINDING_P (binding
) = 0;
991 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
992 && TREE_CODE (decl
) == TYPE_DECL
993 && DECL_NAME (decl
) == DECL_NAME (BINDING_VALUE (binding
))
994 && same_type_p (TREE_TYPE (decl
),
995 TREE_TYPE (BINDING_VALUE (binding
))))
996 /* We have two typedef-names, both naming the same type to have
997 the same name. This is OK because of:
1001 In a given scope, a typedef specifier can be used to redefine
1002 the name of any type declared in that scope to refer to the
1003 type to which it already refers. */
1005 /* There can be two block-scope declarations of the same variable,
1006 so long as they are `extern' declarations. */
1007 else if (TREE_CODE (decl
) == VAR_DECL
1008 && TREE_CODE (BINDING_VALUE (binding
)) == VAR_DECL
1009 && DECL_EXTERNAL (decl
)
1010 && DECL_EXTERNAL (BINDING_VALUE (binding
)))
1012 duplicate_decls (decl
, BINDING_VALUE (binding
));
1017 cp_error ("declaration of `%#D'", decl
);
1018 cp_error_at ("conflicts with previous declaration `%#D'",
1019 BINDING_VALUE (binding
));
1026 /* Add DECL to the list of things declared in B. */
1029 add_decl_to_level (decl
, b
)
1031 struct binding_level
*b
;
1033 /* We build up the list in reverse order, and reverse it later if
1035 TREE_CHAIN (decl
) = b
->names
;
1039 /* Bind DECL to ID in the current_binding_level, assumed to be a local
1040 binding level. If PUSH_USING is set in FLAGS, we know that DECL
1041 doesn't really belong to this binding level, that it got here
1042 through a using-declaration. */
1045 push_local_binding (id
, decl
, flags
)
1050 struct binding_level
*b
;
1052 /* Skip over any local classes. This makes sense if we call
1053 push_local_binding with a friend decl of a local class. */
1054 b
= current_binding_level
;
1055 while (b
->parm_flag
== 2)
1058 if (lookup_name_current_level (id
))
1060 /* Supplement the existing binding. */
1061 if (!add_binding (id
, decl
))
1062 /* It didn't work. Something else must be bound at this
1063 level. Do not add DECL to the list of things to pop
1068 /* Create a new binding. */
1069 push_binding (id
, decl
, b
);
1071 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
1072 /* We must put the OVERLOAD into a TREE_LIST since the
1073 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1074 decls that got here through a using-declaration. */
1075 decl
= build_tree_list (NULL_TREE
, decl
);
1077 /* And put DECL on the list of things declared by the current
1079 add_decl_to_level (decl
, b
);
1082 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
1083 binding was successful. */
1086 push_class_binding (id
, decl
)
1091 tree binding
= IDENTIFIER_BINDING (id
);
1094 /* Note that we declared this value so that we can issue an error if
1095 this an illegal redeclaration of a name already used for some
1097 note_name_declared_in_class (id
, decl
);
1099 if (binding
&& BINDING_LEVEL (binding
) == class_binding_level
)
1100 /* Supplement the existing binding. */
1101 result
= add_binding (id
, decl
);
1103 /* Create a new binding. */
1104 push_binding (id
, decl
, class_binding_level
);
1106 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1107 class-level declaration. Note that we do not use DECL here
1108 because of the possibility of the `struct stat' hack; if DECL is
1109 a class-name or enum-name we might prefer a field-name, or some
1111 IDENTIFIER_CLASS_VALUE (id
) = BINDING_VALUE (IDENTIFIER_BINDING (id
));
1113 /* If this is a binding from a base class, mark it as such. */
1114 binding
= IDENTIFIER_BINDING (id
);
1115 if (BINDING_VALUE (binding
) == decl
&& TREE_CODE (decl
) != TREE_LIST
)
1117 /* Any implicit typename must be from a base-class. The
1118 context for an implicit typename declaration is always
1119 the derived class in which the lookup was done, so the checks
1120 based on the context of DECL below will not trigger. */
1121 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl
))
1122 INHERITED_VALUE_BINDING_P (binding
) = 1;
1125 if (TREE_CODE (decl
) == OVERLOAD
)
1126 context
= CP_DECL_CONTEXT (OVL_CURRENT (decl
));
1129 my_friendly_assert (DECL_P (decl
), 0);
1130 context
= CP_DECL_CONTEXT (decl
);
1133 if (is_properly_derived_from (current_class_type
, context
))
1134 INHERITED_VALUE_BINDING_P (binding
) = 1;
1136 INHERITED_VALUE_BINDING_P (binding
) = 0;
1139 else if (BINDING_VALUE (binding
) == decl
)
1140 /* We only encounter a TREE_LIST when push_class_decls detects an
1141 ambiguity. Such an ambiguity can be overridden by a definition
1143 INHERITED_VALUE_BINDING_P (binding
) = 1;
1148 /* Remove the binding for DECL which should be the innermost binding
1152 pop_binding (id
, decl
)
1158 if (id
== NULL_TREE
)
1159 /* It's easiest to write the loops that call this function without
1160 checking whether or not the entities involved have names. We
1161 get here for such an entity. */
1164 /* Get the innermost binding for ID. */
1165 binding
= IDENTIFIER_BINDING (id
);
1167 /* The name should be bound. */
1168 my_friendly_assert (binding
!= NULL_TREE
, 0);
1170 /* The DECL will be either the ordinary binding or the type
1171 binding for this identifier. Remove that binding. */
1172 if (BINDING_VALUE (binding
) == decl
)
1173 BINDING_VALUE (binding
) = NULL_TREE
;
1174 else if (BINDING_TYPE (binding
) == decl
)
1175 BINDING_TYPE (binding
) = NULL_TREE
;
1177 my_friendly_abort (0);
1179 if (!BINDING_VALUE (binding
) && !BINDING_TYPE (binding
))
1181 /* We're completely done with the innermost binding for this
1182 identifier. Unhook it from the list of bindings. */
1183 IDENTIFIER_BINDING (id
) = TREE_CHAIN (binding
);
1185 /* Add it to the free list. */
1186 TREE_CHAIN (binding
) = free_bindings
;
1187 free_bindings
= binding
;
1189 /* Clear the BINDING_LEVEL so the garbage collector doesn't walk
1191 BINDING_LEVEL (binding
) = NULL
;
1195 /* When a label goes out of scope, check to see if that label was used
1196 in a valid manner, and issue any appropriate warnings or errors. */
1199 pop_label (label
, old_value
)
1203 if (!processing_template_decl
&& doing_semantic_analysis_p ())
1205 if (DECL_INITIAL (label
) == NULL_TREE
)
1207 cp_error_at ("label `%D' used but not defined", label
);
1208 /* Avoid crashing later. */
1209 define_label (input_filename
, 1, DECL_NAME (label
));
1211 else if (warn_unused_label
&& !TREE_USED (label
))
1212 cp_warning_at ("label `%D' defined but not used", label
);
1215 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), old_value
);
1218 /* At the end of a function, all labels declared within the function
1219 go out of scope. BLOCK is the top-level block for the
1226 struct named_label_list
*link
;
1228 /* Clear out the definitions of all label names, since their scopes
1230 for (link
= named_labels
; link
; link
= link
->next
)
1232 pop_label (link
->label_decl
, link
->old_value
);
1233 /* Put the labels into the "variables" of the top-level block,
1234 so debugger can see them. */
1235 TREE_CHAIN (link
->label_decl
) = BLOCK_VARS (block
);
1236 BLOCK_VARS (block
) = link
->label_decl
;
1239 named_labels
= NULL
;
1242 /* Exit a binding level.
1243 Pop the level off, and restore the state of the identifier-decl mappings
1244 that were in effect when this level was entered.
1246 If KEEP == 1, this level had explicit declarations, so
1247 and create a "block" (a BLOCK node) for the level
1248 to record its declarations and subblocks for symbol table output.
1250 If FUNCTIONBODY is nonzero, this level is the body of a function,
1251 so create a block as if KEEP were set and also clear out all
1254 If REVERSE is nonzero, reverse the order of decls before putting
1255 them into the BLOCK. */
1258 poplevel (keep
, reverse
, functionbody
)
1264 /* The chain of decls was accumulated in reverse order.
1265 Put it into forward order, just for cleanliness. */
1267 int tmp
= functionbody
;
1268 int real_functionbody
;
1271 tree block
= NULL_TREE
;
1273 int leaving_for_scope
;
1275 if (cfun
&& !doing_semantic_analysis_p ())
1278 my_friendly_assert (current_binding_level
->parm_flag
!= 2,
1281 real_functionbody
= (current_binding_level
->keep
== 2
1282 ? ((functionbody
= 0), tmp
) : functionbody
);
1283 tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1284 subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1286 my_friendly_assert (!current_binding_level
->class_shadowed
,
1289 /* We used to use KEEP == 2 to indicate that the new block should go
1290 at the beginning of the list of blocks at this binding level,
1291 rather than the end. This hack is no longer used. */
1292 my_friendly_assert (keep
== 0 || keep
== 1, 0);
1294 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1295 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1296 current_binding_level
->parm_flag
,
1297 current_binding_level
->keep
);
1299 if (current_binding_level
->keep
== 1)
1302 /* Any uses of undefined labels, and any defined labels, now operate
1303 under constraints of next binding contour. */
1304 if (cfun
&& !functionbody
)
1306 struct binding_level
*level_chain
;
1307 level_chain
= current_binding_level
->level_chain
;
1310 struct named_label_use_list
*uses
;
1311 struct named_label_list
*labels
;
1312 for (labels
= named_labels
; labels
; labels
= labels
->next
)
1313 if (labels
->binding_level
== current_binding_level
)
1316 if (current_binding_level
->eh_region
)
1317 labels
->eh_region
= 1;
1318 for (decl
= labels
->names_in_scope
; decl
;
1319 decl
= TREE_CHAIN (decl
))
1320 if (decl_jump_unsafe (decl
))
1321 labels
->bad_decls
= tree_cons (NULL_TREE
, decl
,
1323 labels
->binding_level
= level_chain
;
1324 labels
->names_in_scope
= level_chain
->names
;
1327 for (uses
= named_label_uses
; uses
; uses
= uses
->next
)
1328 if (uses
->binding_level
== current_binding_level
)
1330 uses
->binding_level
= level_chain
;
1331 uses
->names_in_scope
= level_chain
->names
;
1336 /* Get the decls in the order they were written.
1337 Usually current_binding_level->names is in reverse order.
1338 But parameter decls were previously put in forward order. */
1341 current_binding_level
->names
1342 = decls
= nreverse (current_binding_level
->names
);
1344 decls
= current_binding_level
->names
;
1346 /* Output any nested inline functions within this block
1347 if they weren't already output. */
1348 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1349 if (TREE_CODE (decl
) == FUNCTION_DECL
1350 && ! TREE_ASM_WRITTEN (decl
)
1351 && DECL_INITIAL (decl
) != NULL_TREE
1352 && TREE_ADDRESSABLE (decl
)
1353 && decl_function_context (decl
) == current_function_decl
)
1355 /* If this decl was copied from a file-scope decl
1356 on account of a block-scope extern decl,
1357 propagate TREE_ADDRESSABLE to the file-scope decl. */
1358 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1359 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1362 push_function_context ();
1363 output_inline_function (decl
);
1364 pop_function_context ();
1368 /* When not in function-at-a-time mode, expand_end_bindings will
1369 warn about unused variables. But, in function-at-a-time mode
1370 expand_end_bindings is not passed the list of variables in the
1371 current scope, and therefore no warning is emitted. So, we
1372 explicitly warn here. */
1373 if (!processing_template_decl
)
1374 warn_about_unused_variables (getdecls ());
1376 /* If there were any declarations or structure tags in that level,
1377 or if this level is a function body,
1378 create a BLOCK to record them for the life of this function. */
1380 if (keep
== 1 || functionbody
)
1381 block
= make_node (BLOCK
);
1382 if (block
!= NULL_TREE
)
1384 BLOCK_VARS (block
) = decls
;
1385 BLOCK_SUBBLOCKS (block
) = subblocks
;
1388 /* In each subblock, record that this is its superior. */
1390 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1391 BLOCK_SUPERCONTEXT (link
) = block
;
1393 /* We still support the old for-scope rules, whereby the variables
1394 in a for-init statement were in scope after the for-statement
1395 ended. We only use the new rules in flag_new_for_scope is
1398 = current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1;
1400 /* Remove declarations for all the DECLs in this level. */
1401 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1403 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
1404 && DECL_NAME (link
))
1407 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link
)));
1411 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
1413 ns_binding
= NULL_TREE
;
1416 && (BINDING_LEVEL (outer_binding
)
1417 == current_binding_level
->level_chain
))
1418 /* We have something like:
1423 and we are leaving the `for' scope. There's no reason to
1424 keep the binding of the inner `i' in this case. */
1425 pop_binding (DECL_NAME (link
), link
);
1426 else if ((outer_binding
1427 && (TREE_CODE (BINDING_VALUE (outer_binding
))
1430 && TREE_CODE (ns_binding
) == TYPE_DECL
))
1431 /* Here, we have something like:
1439 We must pop the for-scope binding so we know what's a
1440 type and what isn't. */
1441 pop_binding (DECL_NAME (link
), link
);
1444 /* Mark this VAR_DECL as dead so that we can tell we left it
1445 there only for backward compatibility. */
1446 DECL_DEAD_FOR_LOCAL (link
) = 1;
1448 /* Keep track of what should of have happenned when we
1449 popped the binding. */
1450 if (outer_binding
&& BINDING_VALUE (outer_binding
))
1451 DECL_SHADOWED_FOR_VAR (link
)
1452 = BINDING_VALUE (outer_binding
);
1454 /* Add it to the list of dead variables in the next
1455 outermost binding to that we can remove these when we
1456 leave that binding. */
1457 current_binding_level
->level_chain
->dead_vars_from_for
1458 = tree_cons (NULL_TREE
, link
,
1459 current_binding_level
->level_chain
->
1460 dead_vars_from_for
);
1462 /* Although we don't pop the CPLUS_BINDING, we do clear
1463 its BINDING_LEVEL since the level is going away now. */
1464 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link
)))
1470 /* Remove the binding. */
1472 if (TREE_CODE (decl
) == TREE_LIST
)
1473 decl
= TREE_VALUE (decl
);
1475 pop_binding (DECL_NAME (decl
), decl
);
1476 else if (TREE_CODE (decl
) == OVERLOAD
)
1477 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
1479 my_friendly_abort (0);
1483 /* Remove declarations for any `for' variables from inner scopes
1484 that we kept around. */
1485 for (link
= current_binding_level
->dead_vars_from_for
;
1486 link
; link
= TREE_CHAIN (link
))
1487 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
1489 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1490 for (link
= current_binding_level
->type_shadowed
;
1491 link
; link
= TREE_CHAIN (link
))
1492 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1494 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1495 for (link
= current_binding_level
->shadowed_labels
;
1497 link
= TREE_CHAIN (link
))
1498 pop_label (TREE_VALUE (link
), TREE_PURPOSE (link
));
1500 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1501 list if a `using' declaration put them there. The debugging
1502 back-ends won't understand OVERLOAD, so we remove them here.
1503 Because the BLOCK_VARS are (temporarily) shared with
1504 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1505 popped all the bindings. */
1510 for (d
= &BLOCK_VARS (block
); *d
; )
1512 if (TREE_CODE (*d
) == TREE_LIST
)
1513 *d
= TREE_CHAIN (*d
);
1515 d
= &TREE_CHAIN (*d
);
1519 /* If the level being exited is the top level of a function,
1520 check over all the labels. */
1523 /* Since this is the top level block of a function, the vars are
1524 the function's parameters. Don't leave them in the BLOCK
1525 because they are found in the FUNCTION_DECL instead. */
1526 BLOCK_VARS (block
) = 0;
1530 tmp
= current_binding_level
->keep
;
1532 pop_binding_level ();
1534 DECL_INITIAL (current_function_decl
) = block
;
1536 current_binding_level
->blocks
1537 = chainon (current_binding_level
->blocks
, block
);
1539 /* If we did not make a block for the level just exited,
1540 any blocks made for inner levels
1541 (since they cannot be recorded as subblocks in that level)
1542 must be carried forward so they will later become subblocks
1543 of something else. */
1545 current_binding_level
->blocks
1546 = chainon (current_binding_level
->blocks
, subblocks
);
1548 /* Each and every BLOCK node created here in `poplevel' is important
1549 (e.g. for proper debugging information) so if we created one
1550 earlier, mark it as "used". */
1552 TREE_USED (block
) = 1;
1554 /* Take care of compiler's internal binding structures. */
1560 = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/1);
1563 SCOPE_STMT_BLOCK (TREE_PURPOSE (scope_stmts
)) = block
;
1564 SCOPE_STMT_BLOCK (TREE_VALUE (scope_stmts
)) = block
;
1567 block
= poplevel (keep
, reverse
, functionbody
);
1573 /* Delete the node BLOCK from the current binding level.
1574 This is used for the block inside a stmt expr ({...})
1575 so that the block can be reinserted where appropriate. */
1578 delete_block (block
)
1582 if (current_binding_level
->blocks
== block
)
1583 current_binding_level
->blocks
= TREE_CHAIN (block
);
1584 for (t
= current_binding_level
->blocks
; t
;)
1586 if (TREE_CHAIN (t
) == block
)
1587 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1591 TREE_CHAIN (block
) = NULL_TREE
;
1592 /* Clear TREE_USED which is always set by poplevel.
1593 The flag is set again if insert_block is called. */
1594 TREE_USED (block
) = 0;
1597 /* Insert BLOCK at the end of the list of subblocks of the
1598 current binding level. This is used when a BIND_EXPR is expanded,
1599 to handle the BLOCK node inside the BIND_EXPR. */
1602 insert_block (block
)
1605 TREE_USED (block
) = 1;
1606 current_binding_level
->blocks
1607 = chainon (current_binding_level
->blocks
, block
);
1610 /* Set the BLOCK node for the innermost scope
1611 (the one we are currently in). */
1615 tree block ATTRIBUTE_UNUSED
;
1617 /* The RTL expansion machinery requires us to provide this callback,
1618 but it is not applicable in function-at-a-time mode. */
1619 my_friendly_assert (cfun
&& !doing_semantic_analysis_p (), 20000911);
1622 /* Do a pushlevel for class declarations. */
1627 register struct binding_level
*newlevel
;
1629 /* Reuse or create a struct for this binding level. */
1630 #if defined(DEBUG_CP_BINDING_LEVELS)
1632 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1633 if (free_binding_level
)
1634 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1636 newlevel
= free_binding_level
;
1637 free_binding_level
= free_binding_level
->level_chain
;
1640 newlevel
= make_binding_level ();
1642 #if defined(DEBUG_CP_BINDING_LEVELS)
1644 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1646 push_binding_level (newlevel
, 0, 0);
1648 class_binding_level
= current_binding_level
;
1649 class_binding_level
->parm_flag
= 2;
1650 class_binding_level
->this_class
= current_class_type
;
1653 /* ...and a poplevel for class declarations. */
1658 register struct binding_level
*level
= class_binding_level
;
1661 my_friendly_assert (level
!= 0, 354);
1663 /* If we're leaving a toplevel class, don't bother to do the setting
1664 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1665 shouldn't even be used when current_class_type isn't set, and second,
1666 if we don't touch it here, we're able to use the cache effect if the
1667 next time we're entering a class scope, it is the same class. */
1668 if (current_class_depth
!= 1)
1670 struct binding_level
* b
;
1672 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1673 for (shadowed
= level
->class_shadowed
;
1675 shadowed
= TREE_CHAIN (shadowed
))
1676 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = NULL_TREE
;
1678 /* Find the next enclosing class, and recreate
1679 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1680 b
= level
->level_chain
;
1681 while (b
&& b
->parm_flag
!= 2)
1685 for (shadowed
= b
->class_shadowed
;
1687 shadowed
= TREE_CHAIN (shadowed
))
1691 t
= IDENTIFIER_BINDING (TREE_PURPOSE (shadowed
));
1692 while (t
&& BINDING_LEVEL (t
) != b
)
1696 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
))
1697 = BINDING_VALUE (t
);
1701 /* Remember to save what IDENTIFIER's were bound in this scope so we
1702 can recover from cache misses. */
1704 previous_class_type
= current_class_type
;
1705 previous_class_values
= class_binding_level
->class_shadowed
;
1707 for (shadowed
= level
->type_shadowed
;
1709 shadowed
= TREE_CHAIN (shadowed
))
1710 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1712 /* Remove the bindings for all of the class-level declarations. */
1713 for (shadowed
= level
->class_shadowed
;
1715 shadowed
= TREE_CHAIN (shadowed
))
1716 pop_binding (TREE_PURPOSE (shadowed
), TREE_TYPE (shadowed
));
1718 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1719 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1720 class_binding_level
->parm_flag
,
1721 class_binding_level
->keep
);
1723 /* Now, pop out of the binding level which we created up in the
1724 `pushlevel_class' routine. */
1725 #if defined(DEBUG_CP_BINDING_LEVELS)
1727 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1729 pop_binding_level ();
1732 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1733 for any names in enclosing classes. */
1736 clear_identifier_class_values ()
1740 if (!class_binding_level
)
1743 for (t
= class_binding_level
->class_shadowed
;
1746 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
1749 /* Returns non-zero if T is a virtual function table. */
1752 vtable_decl_p (t
, data
)
1754 void *data ATTRIBUTE_UNUSED
;
1756 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
1759 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1763 vtype_decl_p (t
, data
)
1765 void *data ATTRIBUTE_UNUSED
;
1767 return (TREE_CODE (t
) == TYPE_DECL
1768 && TREE_CODE (TREE_TYPE (t
)) == RECORD_TYPE
1769 && TYPE_POLYMORPHIC_P (TREE_TYPE (t
)));
1772 /* Return the declarations that are members of the namespace NS. */
1775 cp_namespace_decls (ns
)
1778 return NAMESPACE_LEVEL (ns
)->names
;
1781 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1782 itself, calling F for each. The DATA is passed to F as well. */
1785 walk_namespaces_r (namespace, f
, data
)
1787 walk_namespaces_fn f
;
1793 result
|= (*f
) (namespace, data
);
1795 for (current
= cp_namespace_decls (namespace);
1797 current
= TREE_CHAIN (current
))
1799 if (TREE_CODE (current
) != NAMESPACE_DECL
1800 || DECL_NAMESPACE_ALIAS (current
))
1802 if (!DECL_LANG_SPECIFIC (current
))
1805 my_friendly_assert (current
== fake_std_node
, 393);
1809 /* We found a namespace. */
1810 result
|= walk_namespaces_r (current
, f
, data
);
1816 /* Walk all the namespaces, calling F for each. The DATA is passed to
1820 walk_namespaces (f
, data
)
1821 walk_namespaces_fn f
;
1824 return walk_namespaces_r (global_namespace
, f
, data
);
1827 struct walk_globals_data
{
1828 walk_globals_pred p
;
1833 /* Walk the global declarations in NAMESPACE. Whenever one is found
1834 for which P returns non-zero, call F with its address. If any call
1835 to F returns a non-zero value, return a non-zero value. */
1838 walk_globals_r (namespace, data
)
1842 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1843 walk_globals_pred p
= wgd
->p
;
1844 walk_globals_fn f
= wgd
->f
;
1845 void *d
= wgd
->data
;
1849 t
= &NAMESPACE_LEVEL (namespace)->names
;
1856 result
|= (*f
) (t
, d
);
1858 /* If F changed *T, then *T still points at the next item to
1861 t
= &TREE_CHAIN (*t
);
1867 /* Walk the global declarations. Whenever one is found for which P
1868 returns non-zero, call F with its address. If any call to F
1869 returns a non-zero value, return a non-zero value. */
1872 walk_globals (p
, f
, data
)
1873 walk_globals_pred p
;
1877 struct walk_globals_data wgd
;
1882 return walk_namespaces (walk_globals_r
, &wgd
);
1885 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1886 DATA is non-NULL, this is the last time we will call
1887 wrapup_global_declarations for this NAMESPACE. */
1890 wrapup_globals_for_namespace (namespace, data
)
1894 tree globals
= cp_namespace_decls (namespace);
1895 int len
= list_length (globals
);
1896 tree
*vec
= (tree
*) alloca (sizeof (tree
) * len
);
1900 int last_time
= (data
!= 0);
1902 if (last_time
&& namespace == global_namespace
)
1903 /* Let compile_file handle the global namespace. */
1906 /* Process the decls in reverse order--earliest first.
1907 Put them into VEC from back to front, then take out from front. */
1908 for (i
= 0, decl
= globals
; i
< len
; i
++, decl
= TREE_CHAIN (decl
))
1909 vec
[len
- i
- 1] = decl
;
1913 check_global_declarations (vec
, len
);
1917 /* Temporarily mark vtables as external. That prevents
1918 wrapup_global_declarations from writing them out; we must process
1919 them ourselves in finish_vtable_vardecl. */
1920 for (i
= 0; i
< len
; ++i
)
1921 if (vtable_decl_p (vec
[i
], /*data=*/0) && !DECL_EXTERNAL (vec
[i
]))
1923 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 1;
1924 DECL_EXTERNAL (vec
[i
]) = 1;
1927 /* Write out any globals that need to be output. */
1928 result
= wrapup_global_declarations (vec
, len
);
1930 /* Undo the hack to DECL_EXTERNAL above. */
1931 for (i
= 0; i
< len
; ++i
)
1932 if (vtable_decl_p (vec
[i
], /*data=*/0)
1933 && DECL_NOT_REALLY_EXTERN (vec
[i
]))
1935 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 0;
1936 DECL_EXTERNAL (vec
[i
]) = 0;
1943 /* Mark ARG (which is really a struct binding_level **) for GC. */
1946 mark_binding_level (arg
)
1949 struct binding_level
*lvl
= *(struct binding_level
**)arg
;
1951 for (; lvl
; lvl
= lvl
->level_chain
)
1953 ggc_mark_tree (lvl
->names
);
1954 ggc_mark_tree (lvl
->tags
);
1955 ggc_mark_tree (lvl
->usings
);
1956 ggc_mark_tree (lvl
->using_directives
);
1957 ggc_mark_tree (lvl
->class_shadowed
);
1958 ggc_mark_tree (lvl
->type_shadowed
);
1959 ggc_mark_tree (lvl
->shadowed_labels
);
1960 ggc_mark_tree (lvl
->blocks
);
1961 ggc_mark_tree (lvl
->this_class
);
1962 ggc_mark_tree (lvl
->incomplete
);
1963 ggc_mark_tree (lvl
->dead_vars_from_for
);
1968 mark_named_label_lists (labs
, uses
)
1972 struct named_label_list
*l
= *(struct named_label_list
**)labs
;
1973 struct named_label_use_list
*u
= *(struct named_label_use_list
**)uses
;
1975 for (; l
; l
= l
->next
)
1978 mark_binding_level (l
->binding_level
);
1979 ggc_mark_tree (l
->old_value
);
1980 ggc_mark_tree (l
->label_decl
);
1981 ggc_mark_tree (l
->bad_decls
);
1984 for (; u
; u
= u
->next
)
1988 /* For debugging. */
1989 static int no_print_functions
= 0;
1990 static int no_print_builtins
= 0;
1993 print_binding_level (lvl
)
1994 struct binding_level
*lvl
;
1998 fprintf (stderr
, " blocks=");
1999 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
2000 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
2001 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
2002 if (lvl
->tag_transparent
)
2003 fprintf (stderr
, " tag-transparent");
2004 if (lvl
->more_cleanups_ok
)
2005 fprintf (stderr
, " more-cleanups-ok");
2006 if (lvl
->have_cleanups
)
2007 fprintf (stderr
, " have-cleanups");
2008 fprintf (stderr
, "\n");
2011 fprintf (stderr
, " names:\t");
2012 /* We can probably fit 3 names to a line? */
2013 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
2015 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
2017 if (no_print_builtins
2018 && (TREE_CODE (t
) == TYPE_DECL
)
2019 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
2022 /* Function decls tend to have longer names. */
2023 if (TREE_CODE (t
) == FUNCTION_DECL
)
2030 fprintf (stderr
, "\n\t");
2033 print_node_brief (stderr
, "", t
, 0);
2034 if (t
== error_mark_node
)
2038 fprintf (stderr
, "\n");
2042 fprintf (stderr
, " tags:\t");
2044 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
2046 if (TREE_PURPOSE (t
) == NULL_TREE
)
2048 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2055 fprintf (stderr
, "\n\t");
2058 if (TREE_PURPOSE (t
) == NULL_TREE
)
2060 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
2061 fprintf (stderr
, ">");
2063 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2064 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2067 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
2068 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2069 fprintf (stderr
, ">");
2073 fprintf (stderr
, "\n");
2075 if (lvl
->class_shadowed
)
2077 fprintf (stderr
, " class-shadowed:");
2078 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
2080 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2082 fprintf (stderr
, "\n");
2084 if (lvl
->type_shadowed
)
2086 fprintf (stderr
, " type-shadowed:");
2087 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2089 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2091 fprintf (stderr
, "\n");
2096 print_other_binding_stack (stack
)
2097 struct binding_level
*stack
;
2099 struct binding_level
*level
;
2100 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
2102 fprintf (stderr
, "binding level ");
2103 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
2104 fprintf (stderr
, "\n");
2105 print_binding_level (level
);
2110 print_binding_stack ()
2112 struct binding_level
*b
;
2113 fprintf (stderr
, "current_binding_level=");
2114 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
2115 fprintf (stderr
, "\nclass_binding_level=");
2116 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
2117 fprintf (stderr
, "\nglobal_binding_level=");
2118 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
2119 fprintf (stderr
, "\n");
2120 if (class_binding_level
)
2122 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
2123 if (b
== current_binding_level
)
2126 b
= class_binding_level
;
2128 b
= current_binding_level
;
2131 b
= current_binding_level
;
2132 print_other_binding_stack (b
);
2133 fprintf (stderr
, "global:\n");
2134 print_binding_level (global_binding_level
);
2137 /* Namespace binding access routines: The namespace_bindings field of
2138 the identifier is polymorphic, with three possible values:
2139 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2140 indicating the BINDING_VALUE of global_namespace. */
2142 /* Check whether the a binding for the name to scope is known.
2143 Assumes that the bindings of the name are already a list
2144 of bindings. Returns the binding found, or NULL_TREE. */
2147 find_binding (name
, scope
)
2151 tree iter
, prev
= NULL_TREE
;
2153 scope
= ORIGINAL_NAMESPACE (scope
);
2155 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
2156 iter
= TREE_CHAIN (iter
))
2158 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
2159 if (BINDING_SCOPE (iter
) == scope
)
2161 /* Move binding found to the front of the list, so
2162 subsequent lookups will find it faster. */
2165 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
2166 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
2167 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
2176 /* Always returns a binding for name in scope. If the
2177 namespace_bindings is not a list, convert it to one first.
2178 If no binding is found, make a new one. */
2181 binding_for_name (name
, scope
)
2185 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2188 scope
= ORIGINAL_NAMESPACE (scope
);
2190 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
2192 /* Get rid of optimization for global scope. */
2193 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
2194 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
2195 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2197 if (b
&& (result
= find_binding (name
, scope
)))
2199 /* Not found, make a new one. */
2200 result
= make_node (CPLUS_BINDING
);
2201 TREE_CHAIN (result
) = b
;
2202 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2203 BINDING_SCOPE (result
) = scope
;
2204 BINDING_TYPE (result
) = NULL_TREE
;
2205 BINDING_VALUE (result
) = NULL_TREE
;
2209 /* Return the binding value for name in scope, considering that
2210 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2213 namespace_binding (name
, scope
)
2217 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2220 if (scope
== NULL_TREE
)
2221 scope
= global_namespace
;
2222 if (TREE_CODE (b
) != CPLUS_BINDING
)
2223 return (scope
== global_namespace
) ? b
: NULL_TREE
;
2224 name
= find_binding (name
,scope
);
2225 if (name
== NULL_TREE
)
2227 return BINDING_VALUE (name
);
2230 /* Set the binding value for name in scope. If modifying the binding
2231 of global_namespace is attempted, try to optimize it. */
2234 set_namespace_binding (name
, scope
, val
)
2241 if (scope
== NULL_TREE
)
2242 scope
= global_namespace
;
2244 if (scope
== global_namespace
)
2246 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2247 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
2249 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
2253 b
= binding_for_name (name
, scope
);
2254 BINDING_VALUE (b
) = val
;
2257 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2258 select a name that is unique to this compilation unit. */
2261 push_namespace (name
)
2266 int implicit_use
= 0;
2268 if (!global_namespace
)
2270 /* This must be ::. */
2271 my_friendly_assert (name
== get_identifier ("::"), 377);
2276 /* The name of anonymous namespace is unique for the translation
2278 if (!anonymous_namespace_name
)
2279 anonymous_namespace_name
= get_file_function_name ('N');
2280 name
= anonymous_namespace_name
;
2281 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2283 /* Reopening anonymous namespace. */
2287 else if (current_namespace
== global_namespace
2289 && name
== std_identifier
)
2296 /* Check whether this is an extended namespace definition. */
2297 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2298 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
2301 if (DECL_NAMESPACE_ALIAS (d
))
2303 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2304 d
, DECL_NAMESPACE_ALIAS (d
));
2305 d
= DECL_NAMESPACE_ALIAS (d
);
2312 /* Make a new namespace, binding the name to it. */
2313 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
2314 /* The global namespace is not pushed, and the global binding
2315 level is set elsewhere. */
2318 DECL_CONTEXT (d
) = FROB_CONTEXT (current_namespace
);
2321 declare_namespace_level ();
2322 NAMESPACE_LEVEL (d
) = current_binding_level
;
2326 resume_binding_level (NAMESPACE_LEVEL (d
));
2329 do_using_directive (d
);
2330 /* Enter the name space. */
2331 current_namespace
= d
;
2334 /* Pop from the scope of the current namespace. */
2339 if (current_namespace
== global_namespace
)
2341 my_friendly_assert (in_fake_std
> 0, 980421);
2345 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
2346 /* The binding level is not popped, as it might be re-opened later. */
2347 suspend_binding_level ();
2350 /* Push into the scope of the namespace NS, even if it is deeply
2351 nested within another namespace. */
2354 push_nested_namespace (ns
)
2357 if (ns
== global_namespace
)
2358 push_to_top_level ();
2361 push_nested_namespace (CP_DECL_CONTEXT (ns
));
2362 push_namespace (DECL_NAME (ns
));
2366 /* Pop back from the scope of the namespace NS, which was previously
2367 entered with push_nested_namespace. */
2370 pop_nested_namespace (ns
)
2373 while (ns
!= global_namespace
)
2376 ns
= CP_DECL_CONTEXT (ns
);
2379 pop_from_top_level ();
2383 /* Subroutines for reverting temporarily to top-level for instantiation
2384 of templates and such. We actually need to clear out the class- and
2385 local-value slots of all identifiers, so that only the global values
2386 are at all visible. Simply setting current_binding_level to the global
2387 scope isn't enough, because more binding levels may be pushed. */
2388 struct saved_scope
*scope_chain
;
2390 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2393 mark_saved_scope (arg
)
2396 struct saved_scope
*t
= *(struct saved_scope
**)arg
;
2399 mark_binding_level (&t
->class_bindings
);
2400 ggc_mark_tree (t
->old_bindings
);
2401 ggc_mark_tree (t
->old_namespace
);
2402 ggc_mark_tree (t
->class_name
);
2403 ggc_mark_tree (t
->class_type
);
2404 ggc_mark_tree (t
->access_specifier
);
2405 ggc_mark_tree (t
->function_decl
);
2407 ggc_mark_tree_varray (t
->lang_base
);
2408 ggc_mark_tree (t
->lang_name
);
2409 ggc_mark_tree (t
->template_parms
);
2410 ggc_mark_tree (t
->x_previous_class_type
);
2411 ggc_mark_tree (t
->x_previous_class_values
);
2412 ggc_mark_tree (t
->x_saved_tree
);
2413 ggc_mark_tree (t
->incomplete
);
2414 ggc_mark_tree (t
->lookups
);
2416 mark_stmt_tree (&t
->x_stmt_tree
);
2417 mark_binding_level (&t
->bindings
);
2423 store_bindings (names
, old_bindings
)
2424 tree names
, old_bindings
;
2427 tree search_bindings
= old_bindings
;
2429 for (t
= names
; t
; t
= TREE_CHAIN (t
))
2431 tree binding
, t1
, id
;
2433 if (TREE_CODE (t
) == TREE_LIST
)
2434 id
= TREE_PURPOSE (t
);
2439 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2440 we have no IDENTIFIER_BINDING if we have left the class
2441 scope, but cached the class-level declarations. */
2442 || !(IDENTIFIER_BINDING (id
) || IDENTIFIER_CLASS_VALUE (id
)))
2445 for (t1
= search_bindings
; t1
; t1
= TREE_CHAIN (t1
))
2446 if (TREE_VEC_ELT (t1
, 0) == id
)
2449 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
2450 binding
= make_tree_vec (4);
2451 TREE_VEC_ELT (binding
, 0) = id
;
2452 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
2453 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_BINDING (id
);
2454 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
2455 IDENTIFIER_BINDING (id
) = NULL_TREE
;
2456 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
2457 TREE_CHAIN (binding
) = old_bindings
;
2458 old_bindings
= binding
;
2462 return old_bindings
;
2466 maybe_push_to_top_level (pseudo
)
2469 struct saved_scope
*s
;
2470 struct binding_level
*b
;
2474 s
= (struct saved_scope
*) xcalloc (1, sizeof (struct saved_scope
));
2476 b
= scope_chain
? current_binding_level
: 0;
2478 /* If we're in the middle of some function, save our state. */
2482 push_function_context_to (NULL_TREE
);
2487 old_bindings
= NULL_TREE
;
2488 if (scope_chain
&& previous_class_type
)
2489 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
2491 /* Have to include global_binding_level, because class-level decls
2492 aren't listed anywhere useful. */
2493 for (; b
; b
= b
->level_chain
)
2497 /* Template IDs are inserted into the global level. If they were
2498 inserted into namespace level, finish_file wouldn't find them
2499 when doing pending instantiations. Therefore, don't stop at
2500 namespace level, but continue until :: . */
2501 if (b
== global_binding_level
|| (pseudo
&& b
->template_parms_p
))
2504 old_bindings
= store_bindings (b
->names
, old_bindings
);
2505 /* We also need to check class_shadowed to save class-level type
2506 bindings, since pushclass doesn't fill in b->names. */
2507 if (b
->parm_flag
== 2)
2508 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2510 /* Unwind type-value slots back to top level. */
2511 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2512 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2514 s
->prev
= scope_chain
;
2515 s
->old_bindings
= old_bindings
;
2517 s
->need_pop_function_context
= need_pop
;
2518 s
->function_decl
= current_function_decl
;
2521 current_function_decl
= NULL_TREE
;
2522 VARRAY_TREE_INIT (current_lang_base
, 10, "current_lang_base");
2523 current_lang_stack
= &VARRAY_TREE (current_lang_base
, 0);
2524 current_lang_name
= lang_name_cplusplus
;
2525 current_namespace
= global_namespace
;
2529 push_to_top_level ()
2531 maybe_push_to_top_level (0);
2535 pop_from_top_level ()
2537 struct saved_scope
*s
= scope_chain
;
2540 /* Clear out class-level bindings cache. */
2541 if (previous_class_type
)
2542 invalidate_class_lookup_cache ();
2544 VARRAY_FREE (current_lang_base
);
2546 scope_chain
= s
->prev
;
2547 for (t
= s
->old_bindings
; t
; t
= TREE_CHAIN (t
))
2549 tree id
= TREE_VEC_ELT (t
, 0);
2551 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2552 IDENTIFIER_BINDING (id
) = TREE_VEC_ELT (t
, 2);
2553 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2556 /* If we were in the middle of compiling a function, restore our
2558 if (s
->need_pop_function_context
)
2559 pop_function_context_from (NULL_TREE
);
2560 current_function_decl
= s
->function_decl
;
2565 /* Push a definition of struct, union or enum tag "name".
2566 into binding_level "b". "type" should be the type node,
2567 We assume that the tag "name" is not already defined.
2569 Note that the definition may really be just a forward reference.
2570 In that case, the TYPE_SIZE will be a NULL_TREE.
2572 C++ gratuitously puts all these tags in the name space. */
2574 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2575 record the shadowed value for this binding contour. TYPE is
2576 the type that ID maps to. */
2579 set_identifier_type_value_with_scope (id
, type
, b
)
2582 struct binding_level
*b
;
2584 if (!b
->namespace_p
)
2586 /* Shadow the marker, not the real thing, so that the marker
2587 gets restored later. */
2588 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2590 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2594 tree binding
= binding_for_name (id
, current_namespace
);
2595 BINDING_TYPE (binding
) = type
;
2596 /* Store marker instead of real type. */
2597 type
= global_type_node
;
2599 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2602 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2605 set_identifier_type_value (id
, type
)
2609 set_identifier_type_value_with_scope (id
, type
, current_binding_level
);
2612 /* Return the type associated with id. */
2615 identifier_type_value (id
)
2618 /* There is no type with that name, anywhere. */
2619 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2621 /* This is not the type marker, but the real thing. */
2622 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2623 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2624 /* Have to search for it. It must be on the global level, now.
2625 Ask lookup_name not to return non-types. */
2626 id
= lookup_name_real (id
, 2, 1, 0);
2628 return TREE_TYPE (id
);
2632 /* Pop off extraneous binding levels left over due to syntax errors.
2634 We don't pop past namespaces, as they might be valid. */
2639 #ifdef DEBUG_CP_BINDING_LEVELS
2640 fprintf (stderr
, "XXX entering pop_everything ()\n");
2642 while (!toplevel_bindings_p ())
2644 if (current_binding_level
->parm_flag
== 2)
2645 pop_nested_class ();
2649 #ifdef DEBUG_CP_BINDING_LEVELS
2650 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2654 /* The type TYPE is being declared. If it is a class template, or a
2655 specialization of a class template, do any processing required and
2656 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2657 being declared a friend. B is the binding level at which this TYPE
2660 Returns the TYPE_DECL for TYPE, which may have been altered by this
2664 maybe_process_template_type_declaration (type
, globalize
, b
)
2667 struct binding_level
* b
;
2669 tree decl
= TYPE_NAME (type
);
2671 if (processing_template_parmlist
)
2672 /* You can't declare a new template type in a template parameter
2673 list. But, you can declare a non-template type:
2675 template <class A*> struct S;
2677 is a forward-declaration of `A'. */
2681 maybe_check_template_type (type
);
2683 my_friendly_assert (IS_AGGR_TYPE (type
)
2684 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2687 if (processing_template_decl
)
2689 /* This may change after the call to
2690 push_template_decl_real, but we want the original value. */
2691 tree name
= DECL_NAME (decl
);
2693 decl
= push_template_decl_real (decl
, globalize
);
2694 /* If the current binding level is the binding level for the
2695 template parameters (see the comment in
2696 begin_template_parm_list) and the enclosing level is a class
2697 scope, and we're not looking at a friend, push the
2698 declaration of the member class into the class scope. In the
2699 friend case, push_template_decl will already have put the
2700 friend into global scope, if appropriate. */
2701 if (TREE_CODE (type
) != ENUMERAL_TYPE
2702 && !globalize
&& b
->template_parms_p
2703 && b
->level_chain
->parm_flag
== 2)
2705 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2706 /* Put this tag on the list of tags for the class, since
2707 that won't happen below because B is not the class
2708 binding level, but is instead the pseudo-global level. */
2709 b
->level_chain
->tags
=
2710 tree_cons (name
, type
, b
->level_chain
->tags
);
2711 if (!COMPLETE_TYPE_P (current_class_type
))
2712 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2720 /* In C++, you don't have to write `struct S' to refer to `S'; you
2721 can just use `S'. We accomplish this by creating a TYPE_DECL as
2722 if the user had written `typedef struct S S'. Create and return
2723 the TYPE_DECL for TYPE. */
2726 create_implicit_typedef (name
, type
)
2732 decl
= build_decl (TYPE_DECL
, name
, type
);
2733 DECL_ARTIFICIAL (decl
) = 1;
2734 /* There are other implicit type declarations, like the one *within*
2735 a class that allows you to write `S::S'. We must distinguish
2737 SET_DECL_IMPLICIT_TYPEDEF_P (decl
);
2738 TYPE_NAME (type
) = decl
;
2743 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2744 Normally put it into the inner-most non-tag-transparent scope,
2745 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2746 The latter is needed for implicit declarations. */
2749 pushtag (name
, type
, globalize
)
2753 register struct binding_level
*b
;
2755 b
= current_binding_level
;
2756 while (b
->tag_transparent
2757 || (globalize
&& b
->parm_flag
== 2))
2760 b
->tags
= tree_cons (name
, type
, b
->tags
);
2764 /* Do C++ gratuitous typedefing. */
2765 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2767 register tree d
= NULL_TREE
;
2769 tree context
= TYPE_CONTEXT (type
);
2773 tree cs
= current_scope ();
2777 else if (cs
!= NULL_TREE
&& TYPE_P (cs
))
2778 /* When declaring a friend class of a local class, we want
2779 to inject the newly named class into the scope
2780 containing the local class, not the namespace scope. */
2781 context
= decl_function_context (get_type_decl (cs
));
2784 context
= current_namespace
;
2786 if ((b
->template_parms_p
&& b
->level_chain
->parm_flag
== 2)
2787 || b
->parm_flag
== 2)
2790 if (current_lang_name
== lang_name_java
)
2791 TYPE_FOR_JAVA (type
) = 1;
2793 d
= create_implicit_typedef (name
, type
);
2794 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2796 set_identifier_type_value_with_scope (name
, type
, b
);
2798 d
= maybe_process_template_type_declaration (type
,
2801 if (b
->parm_flag
== 2)
2803 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2804 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2805 class. But if it's a member template class, we
2806 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2808 finish_member_declaration (d
);
2810 pushdecl_class_level (d
);
2813 d
= pushdecl_with_scope (d
, b
);
2815 if (ANON_AGGRNAME_P (name
))
2816 DECL_IGNORED_P (d
) = 1;
2818 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2819 DECL_ASSEMBLER_NAME (d
) = DECL_NAME (d
);
2821 /* If this is a local class, keep track of it. We need this
2822 information for name-mangling, and so that it is possible to find
2823 all function definitions in a translation unit in a convenient
2824 way. (It's otherwise tricky to find a member function definition
2825 it's only pointed to from within a local class.) */
2826 if (TYPE_CONTEXT (type
)
2827 && TREE_CODE (TYPE_CONTEXT (type
)) == FUNCTION_DECL
2828 && !processing_template_decl
)
2829 VARRAY_PUSH_TREE (local_classes
, type
);
2831 if (!uses_template_parms (type
))
2834 DECL_ASSEMBLER_NAME (d
) = mangle_type (type
);
2836 DECL_ASSEMBLER_NAME (d
)
2837 = get_identifier (build_overload_name (type
, 1, 1));
2840 if (b
->parm_flag
== 2)
2842 if (!COMPLETE_TYPE_P (current_class_type
))
2843 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2847 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2848 /* Use the canonical TYPE_DECL for this node. */
2849 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2852 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2853 will be the tagged type we just added to the current
2854 binding level. This fake NULL-named TYPE_DECL node helps
2855 dwarfout.c to know when it needs to output a
2856 representation of a tagged type, and it also gives us a
2857 convenient place to record the "scope start" address for
2860 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2861 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2865 /* Counter used to create anonymous type names. */
2867 static int anon_cnt
= 0;
2869 /* Return an IDENTIFIER which can be used as a name for
2870 anonymous structs and unions. */
2877 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2878 return get_identifier (buf
);
2881 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2882 This keeps dbxout from getting confused. */
2887 register struct binding_level
*b
;
2889 static int last_cnt
= 0;
2891 /* Fast out if no new anon names were declared. */
2892 if (last_cnt
== anon_cnt
)
2895 b
= current_binding_level
;
2896 while (b
->tag_transparent
)
2901 /* A NULL purpose means we have already processed all tags
2902 from here to the end of the list. */
2903 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2905 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2906 TREE_PURPOSE (tags
) = NULL_TREE
;
2907 tags
= TREE_CHAIN (tags
);
2909 last_cnt
= anon_cnt
;
2912 /* Subroutine of duplicate_decls: return truthvalue of whether
2913 or not types of these decls match.
2915 For C++, we must compare the parameter list so that `int' can match
2916 `int&' in a parameter position, but `int&' is not confused with
2920 decls_match (newdecl
, olddecl
)
2921 tree newdecl
, olddecl
;
2925 if (newdecl
== olddecl
)
2928 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
2929 /* If the two DECLs are not even the same kind of thing, we're not
2930 interested in their types. */
2933 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2935 tree f1
= TREE_TYPE (newdecl
);
2936 tree f2
= TREE_TYPE (olddecl
);
2937 tree p1
= TYPE_ARG_TYPES (f1
);
2938 tree p2
= TYPE_ARG_TYPES (f2
);
2940 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
)
2941 && ! (DECL_EXTERN_C_P (newdecl
)
2942 && DECL_EXTERN_C_P (olddecl
)))
2945 if (TREE_CODE (f1
) != TREE_CODE (f2
))
2948 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
2950 if (p2
== NULL_TREE
&& DECL_EXTERN_C_P (olddecl
)
2951 && (DECL_BUILT_IN (olddecl
)
2952 #ifndef NO_IMPLICIT_EXTERN_C
2953 || (DECL_IN_SYSTEM_HEADER (newdecl
) && !DECL_CLASS_SCOPE_P (newdecl
))
2954 || (DECL_IN_SYSTEM_HEADER (olddecl
) && !DECL_CLASS_SCOPE_P (olddecl
))
2958 types_match
= self_promoting_args_p (p1
);
2959 if (p1
== void_list_node
)
2960 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2962 #ifndef NO_IMPLICIT_EXTERN_C
2963 else if (p1
== NULL_TREE
2964 && (DECL_EXTERN_C_P (olddecl
)
2965 && DECL_IN_SYSTEM_HEADER (olddecl
)
2966 && !DECL_CLASS_SCOPE_P (olddecl
))
2967 && (DECL_EXTERN_C_P (newdecl
)
2968 && DECL_IN_SYSTEM_HEADER (newdecl
)
2969 && !DECL_CLASS_SCOPE_P (newdecl
)))
2971 types_match
= self_promoting_args_p (p2
);
2972 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2976 types_match
= compparms (p1
, p2
);
2981 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2983 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
2984 DECL_TEMPLATE_PARMS (olddecl
)))
2987 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
))
2988 != TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)))
2991 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
2994 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
2995 DECL_TEMPLATE_RESULT (newdecl
));
2999 if (TREE_TYPE (newdecl
) == error_mark_node
)
3000 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
3001 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
3002 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
3003 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
3006 types_match
= comptypes (TREE_TYPE (newdecl
),
3007 TREE_TYPE (olddecl
),
3008 COMPARE_REDECLARATION
);
3014 /* If NEWDECL is `static' and an `extern' was seen previously,
3015 warn about it. OLDDECL is the previous declaration.
3017 Note that this does not apply to the C++ case of declaring
3018 a variable `extern const' and then later `const'.
3020 Don't complain about built-in functions, since they are beyond
3021 the user's control. */
3024 warn_extern_redeclared_static (newdecl
, olddecl
)
3025 tree newdecl
, olddecl
;
3027 static const char *explicit_extern_static_warning
3028 = "`%D' was declared `extern' and later `static'";
3029 static const char *implicit_extern_static_warning
3030 = "`%D' was declared implicitly `extern' and later `static'";
3034 if (TREE_CODE (newdecl
) == TYPE_DECL
3035 || TREE_CODE (newdecl
) == TEMPLATE_DECL
3036 || TREE_CODE (newdecl
) == CONST_DECL
)
3039 /* Don't get confused by static member functions; that's a different
3041 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3042 && DECL_STATIC_FUNCTION_P (newdecl
))
3045 /* If the old declaration was `static', or the new one isn't, then
3046 then everything is OK. */
3047 if (DECL_THIS_STATIC (olddecl
) || !DECL_THIS_STATIC (newdecl
))
3050 /* It's OK to declare a builtin function as `static'. */
3051 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3052 && DECL_ARTIFICIAL (olddecl
))
3055 name
= DECL_ASSEMBLER_NAME (newdecl
);
3056 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
3057 ? implicit_extern_static_warning
3058 : explicit_extern_static_warning
, newdecl
);
3059 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
3062 /* Handle when a new declaration NEWDECL has the same name as an old
3063 one OLDDECL in the same binding contour. Prints an error message
3066 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
3067 Otherwise, return 0. */
3070 duplicate_decls (newdecl
, olddecl
)
3071 tree newdecl
, olddecl
;
3073 unsigned olddecl_uid
= DECL_UID (olddecl
);
3074 int olddecl_friend
= 0, types_match
= 0;
3075 int new_defines_function
= 0;
3077 if (newdecl
== olddecl
)
3080 types_match
= decls_match (newdecl
, olddecl
);
3082 /* If either the type of the new decl or the type of the old decl is an
3083 error_mark_node, then that implies that we have already issued an
3084 error (earlier) for some bogus type specification, and in that case,
3085 it is rather pointless to harass the user with yet more error message
3086 about the same declaration, so just pretend the types match here. */
3087 if (TREE_TYPE (newdecl
) == error_mark_node
3088 || TREE_TYPE (olddecl
) == error_mark_node
)
3091 /* Check for redeclaration and other discrepancies. */
3092 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3093 && DECL_ARTIFICIAL (olddecl
))
3095 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
3097 /* If you declare a built-in or predefined function name as static,
3098 the old definition is overridden, but optionally warn this was a
3099 bad choice of name. */
3100 if (! TREE_PUBLIC (newdecl
))
3103 cp_warning ("shadowing %s function `%#D'",
3104 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3106 /* Discard the old built-in function. */
3109 /* If the built-in is not ansi, then programs can override
3110 it even globally without an error. */
3111 else if (! DECL_BUILT_IN (olddecl
))
3112 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
3116 cp_error ("declaration of `%#D'", newdecl
);
3117 cp_error ("conflicts with built-in declaration `%#D'",
3122 else if (!types_match
)
3124 if ((DECL_EXTERN_C_P (newdecl
)
3125 && DECL_EXTERN_C_P (olddecl
))
3126 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3127 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3129 /* A near match; override the builtin. */
3131 if (TREE_PUBLIC (newdecl
))
3133 cp_warning ("new declaration `%#D'", newdecl
);
3134 cp_warning ("ambiguates built-in declaration `%#D'",
3137 else if (warn_shadow
)
3138 cp_warning ("shadowing %s function `%#D'",
3139 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3143 /* Discard the old built-in function. */
3147 if (DECL_THIS_STATIC (newdecl
) && !DECL_THIS_STATIC (olddecl
))
3149 /* If a builtin function is redeclared as `static', merge
3150 the declarations, but make the original one static. */
3151 DECL_THIS_STATIC (olddecl
) = 1;
3152 TREE_PUBLIC (olddecl
) = 0;
3154 /* Make the old declaration consistent with the new one so
3155 that all remnants of the builtin-ness of this function
3156 will be banished. */
3157 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3158 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3159 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3160 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (newdecl
),
3164 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3166 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3167 && TREE_CODE (newdecl
) != TYPE_DECL
3168 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3169 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3170 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3171 && TREE_CODE (olddecl
) != TYPE_DECL
3172 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3173 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3176 /* We do nothing special here, because C++ does such nasty
3177 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3178 get shadowed, and know that if we need to find a TYPE_DECL
3179 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3180 slot of the identifier. */
3184 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3185 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3186 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3187 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3190 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
3191 if (TREE_CODE (olddecl
) == TREE_LIST
)
3192 olddecl
= TREE_VALUE (olddecl
);
3193 cp_error_at ("previous declaration of `%#D'", olddecl
);
3195 /* New decl is completely inconsistent with the old one =>
3196 tell caller to replace the old one. */
3200 else if (!types_match
)
3202 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
))
3203 /* These are certainly not duplicate declarations; they're
3204 from different scopes. */
3207 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3209 /* The name of a class template may not be declared to refer to
3210 any other template, class, function, object, namespace, value,
3211 or type in the same scope. */
3212 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3213 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3215 cp_error ("declaration of template `%#D'", newdecl
);
3216 cp_error_at ("conflicts with previous declaration `%#D'",
3219 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3220 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3221 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3222 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3223 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3224 DECL_TEMPLATE_PARMS (olddecl
)))
3226 cp_error ("new declaration `%#D'", newdecl
);
3227 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3231 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3233 if (DECL_EXTERN_C_P (newdecl
) && DECL_EXTERN_C_P (olddecl
))
3235 cp_error ("declaration of C function `%#D' conflicts with",
3237 cp_error_at ("previous declaration `%#D' here", olddecl
);
3239 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3240 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3242 cp_error ("new declaration `%#D'", newdecl
);
3243 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3249 /* Already complained about this, so don't do so again. */
3250 else if (current_class_type
== NULL_TREE
3251 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3253 cp_error ("conflicting types for `%#D'", newdecl
);
3254 cp_error_at ("previous declaration as `%#D'", olddecl
);
3257 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3258 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3259 && (!DECL_TEMPLATE_INFO (newdecl
)
3260 || (DECL_TI_TEMPLATE (newdecl
)
3261 != DECL_TI_TEMPLATE (olddecl
))))
3262 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3263 && (!DECL_TEMPLATE_INFO (olddecl
)
3264 || (DECL_TI_TEMPLATE (olddecl
)
3265 != DECL_TI_TEMPLATE (newdecl
))))))
3266 /* It's OK to have a template specialization and a non-template
3267 with the same type, or to have specializations of two
3268 different templates with the same type. Note that if one is a
3269 specialization, and the other is an instantiation of the same
3270 template, that we do not exit at this point. That situation
3271 can occur if we instantiate a template class, and then
3272 specialize one of its methods. This situation is legal, but
3273 the declarations must be merged in the usual way. */
3275 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3276 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3277 && !DECL_USE_TEMPLATE (newdecl
))
3278 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3279 && !DECL_USE_TEMPLATE (olddecl
))))
3280 /* One of the declarations is a template instantiation, and the
3281 other is not a template at all. That's OK. */
3283 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3284 && DECL_NAMESPACE_ALIAS (newdecl
)
3285 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3286 /* Redeclaration of namespace alias, ignore it. */
3290 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3293 cp_error (errmsg
, newdecl
);
3294 if (DECL_NAME (olddecl
) != NULL_TREE
)
3295 cp_error_at ((DECL_INITIAL (olddecl
)
3296 && namespace_bindings_p ())
3297 ? "`%#D' previously defined here"
3298 : "`%#D' previously declared here", olddecl
);
3300 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3301 && DECL_INITIAL (olddecl
) != NULL_TREE
3302 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3303 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3305 /* Prototype decl follows defn w/o prototype. */
3306 cp_warning_at ("prototype for `%#D'", newdecl
);
3307 cp_warning_at ("follows non-prototype definition here", olddecl
);
3309 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3310 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3312 /* extern "C" int foo ();
3313 int foo () { bar (); }
3315 if (current_lang_stack
3316 == &VARRAY_TREE (current_lang_base
, 0))
3317 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3320 cp_error_at ("previous declaration of `%#D' with %L linkage",
3321 olddecl
, DECL_LANGUAGE (olddecl
));
3322 cp_error ("conflicts with new declaration with %L linkage",
3323 DECL_LANGUAGE (newdecl
));
3327 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3329 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3331 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3332 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3335 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3336 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3338 for (; t1
&& t1
!= void_list_node
;
3339 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3340 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3342 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3347 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3349 cp_pedwarn_at ("after previous specification in `%#D'",
3355 cp_error ("default argument given for parameter %d of `%#D'",
3357 cp_error_at ("after previous specification in `%#D'",
3362 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
3363 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3365 cp_warning ("`%#D' was used before it was declared inline",
3367 cp_warning_at ("previous non-inline declaration here",
3373 /* If new decl is `static' and an `extern' was seen previously,
3375 warn_extern_redeclared_static (newdecl
, olddecl
);
3377 /* We have committed to returning 1 at this point. */
3378 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3380 /* Now that functions must hold information normally held
3381 by field decls, there is extra work to do so that
3382 declaration information does not get destroyed during
3384 if (DECL_VINDEX (olddecl
))
3385 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3386 if (DECL_VIRTUAL_CONTEXT (olddecl
))
3387 DECL_VIRTUAL_CONTEXT (newdecl
) = DECL_VIRTUAL_CONTEXT (olddecl
);
3388 if (DECL_CONTEXT (olddecl
))
3389 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3390 if (DECL_PENDING_INLINE_INFO (newdecl
) == 0)
3391 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3392 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3393 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3394 DECL_PURE_VIRTUAL_P (newdecl
) |= DECL_PURE_VIRTUAL_P (olddecl
);
3395 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3396 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3397 DECL_THIS_STATIC (newdecl
) |= DECL_THIS_STATIC (olddecl
);
3398 DECL_LANG_SPECIFIC (newdecl
)->u2
= DECL_LANG_SPECIFIC (olddecl
)->u2
;
3399 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3401 /* Optionally warn about more than one declaration for the same
3402 name, but don't warn about a function declaration followed by a
3404 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3405 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3406 /* Don't warn about extern decl followed by definition. */
3407 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3408 /* Don't warn about friends, let add_friend take care of it. */
3409 && ! DECL_FRIEND_P (newdecl
))
3411 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3412 cp_warning_at ("previous declaration of `%D'", olddecl
);
3416 /* Deal with C++: must preserve virtual function table size. */
3417 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3419 register tree newtype
= TREE_TYPE (newdecl
);
3420 register tree oldtype
= TREE_TYPE (olddecl
);
3422 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3423 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3425 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3426 CLASSTYPE_FRIEND_CLASSES (newtype
)
3427 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3430 DECL_ORIGINAL_TYPE (newdecl
) = DECL_ORIGINAL_TYPE (olddecl
);
3433 /* Copy all the DECL_... slots specified in the new decl
3434 except for any that we copy here from the old type. */
3435 DECL_MACHINE_ATTRIBUTES (newdecl
)
3436 = merge_machine_decl_attributes (olddecl
, newdecl
);
3438 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3440 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3441 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3442 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3443 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3450 /* Automatically handles default parameters. */
3451 tree oldtype
= TREE_TYPE (olddecl
);
3454 /* Merge the data types specified in the two decls. */
3455 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3457 /* If common_type produces a non-typedef type, just use the old type. */
3458 if (TREE_CODE (newdecl
) == TYPE_DECL
3459 && newtype
== DECL_ORIGINAL_TYPE (newdecl
))
3462 if (TREE_CODE (newdecl
) == VAR_DECL
)
3463 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3464 /* Do this after calling `common_type' so that default
3465 parameters don't confuse us. */
3466 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3467 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3468 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3470 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3471 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3472 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3473 TYPE_RAISES_EXCEPTIONS (oldtype
));
3475 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3476 && DECL_SOURCE_LINE (olddecl
) != 0
3478 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
3479 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
3481 cp_error ("declaration of `%F' throws different exceptions",
3483 cp_error_at ("than previous declaration `%F'", olddecl
);
3486 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3488 /* Lay the type out, unless already done. */
3489 if (! same_type_p (newtype
, oldtype
)
3490 && TREE_TYPE (newdecl
) != error_mark_node
3491 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3492 layout_type (TREE_TYPE (newdecl
));
3494 if ((TREE_CODE (newdecl
) == VAR_DECL
3495 || TREE_CODE (newdecl
) == PARM_DECL
3496 || TREE_CODE (newdecl
) == RESULT_DECL
3497 || TREE_CODE (newdecl
) == FIELD_DECL
3498 || TREE_CODE (newdecl
) == TYPE_DECL
)
3499 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3500 layout_decl (newdecl
, 0);
3502 /* Merge the type qualifiers. */
3503 if (TREE_READONLY (newdecl
))
3504 TREE_READONLY (olddecl
) = 1;
3505 if (TREE_THIS_VOLATILE (newdecl
))
3506 TREE_THIS_VOLATILE (olddecl
) = 1;
3508 /* Merge the initialization information. */
3509 if (DECL_INITIAL (newdecl
) == NULL_TREE
3510 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3512 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3513 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3514 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3515 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
3516 && DECL_LANG_SPECIFIC (newdecl
)
3517 && DECL_LANG_SPECIFIC (olddecl
))
3518 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3521 /* Merge the section attribute.
3522 We want to issue an error if the sections conflict but that must be
3523 done later in decl_attributes since we are called before attributes
3525 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3526 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3528 /* Keep the old rtl since we can safely use it. */
3529 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3531 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3533 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (newdecl
)
3534 |= DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (olddecl
);
3535 DECL_NO_CHECK_MEMORY_USAGE (newdecl
)
3536 |= DECL_NO_CHECK_MEMORY_USAGE (olddecl
);
3537 DECL_NO_LIMIT_STACK (newdecl
)
3538 |= DECL_NO_LIMIT_STACK (olddecl
);
3541 /* If cannot merge, then use the new type and qualifiers,
3542 and don't preserve the old rtl. */
3545 /* Clean out any memory we had of the old declaration. */
3546 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3548 TREE_VALUE (oldstatic
) = error_mark_node
;
3550 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3551 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3552 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3553 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3556 /* Merge the storage class information. */
3557 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3558 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3559 DECL_DEFER_OUTPUT (newdecl
) |= DECL_DEFER_OUTPUT (olddecl
);
3560 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3561 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3562 if (! DECL_EXTERNAL (olddecl
))
3563 DECL_EXTERNAL (newdecl
) = 0;
3565 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3567 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3568 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3569 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3570 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3571 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3572 /* Don't really know how much of the language-specific
3573 values we should copy from old to new. */
3574 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3575 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3576 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3577 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (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 /* There was already a binding for X containing fewer
4412 functions than are named in X. Find the previous
4413 declaration of X on the class-shadowed list, and update it. */
4414 for (shadow
= class_binding_level
->class_shadowed
;
4416 shadow
= TREE_CHAIN (shadow
))
4417 if (TREE_PURPOSE (shadow
) == name
4418 && TREE_TYPE (shadow
) == old_decl
)
4420 BINDING_VALUE (binding
) = x
;
4421 INHERITED_VALUE_BINDING_P (binding
) = 0;
4422 TREE_TYPE (shadow
) = x
;
4427 /* If we didn't replace an existing binding, put the binding on the
4428 stack of bindings for the identifier, and update
4429 IDENTIFIER_CLASS_VALUE. */
4430 if (push_class_binding (name
, x
))
4432 class_binding_level
->class_shadowed
4433 = tree_cons (name
, IDENTIFIER_CLASS_VALUE (name
),
4434 class_binding_level
->class_shadowed
);
4435 /* Record the value we are binding NAME to so that we can know
4436 what to pop later. */
4437 TREE_TYPE (class_binding_level
->class_shadowed
) = x
;
4441 /* Insert another USING_DECL into the current binding level, returning
4442 this declaration. If this is a redeclaration, do nothing, and
4443 return NULL_TREE if this not in namespace scope (in namespace
4444 scope, a using decl might extend any previous bindings). */
4447 push_using_decl (scope
, name
)
4453 my_friendly_assert (TREE_CODE (scope
) == NAMESPACE_DECL
, 383);
4454 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 384);
4455 for (decl
= current_binding_level
->usings
; decl
; decl
= TREE_CHAIN (decl
))
4456 if (DECL_INITIAL (decl
) == scope
&& DECL_NAME (decl
) == name
)
4459 return namespace_bindings_p () ? decl
: NULL_TREE
;
4460 decl
= build_lang_decl (USING_DECL
, name
, void_type_node
);
4461 DECL_INITIAL (decl
) = scope
;
4462 TREE_CHAIN (decl
) = current_binding_level
->usings
;
4463 current_binding_level
->usings
= decl
;
4467 /* Add namespace to using_directives. Return NULL_TREE if nothing was
4468 changed (i.e. there was already a directive), or the fresh
4469 TREE_LIST otherwise. */
4472 push_using_directive (used
)
4475 tree ud
= current_binding_level
->using_directives
;
4476 tree iter
, ancestor
;
4478 /* Check if we already have this. */
4479 if (purpose_member (used
, ud
) != NULL_TREE
)
4482 /* Recursively add all namespaces used. */
4483 for (iter
= DECL_NAMESPACE_USING (used
); iter
; iter
= TREE_CHAIN (iter
))
4484 push_using_directive (TREE_PURPOSE (iter
));
4486 ancestor
= namespace_ancestor (current_decl_namespace (), used
);
4487 ud
= current_binding_level
->using_directives
;
4488 ud
= tree_cons (used
, ancestor
, ud
);
4489 current_binding_level
->using_directives
= ud
;
4493 /* DECL is a FUNCTION_DECL for a non-member function, which may have
4494 other definitions already in place. We get around this by making
4495 the value of the identifier point to a list of all the things that
4496 want to be referenced by that name. It is then up to the users of
4497 that name to decide what to do with that list.
4499 DECL may also be a TEMPLATE_DECL, with a FUNCTION_DECL in its
4500 DECL_TEMPLATE_RESULT. It is dealt with the same way.
4502 FLAGS is a bitwise-or of the following values:
4503 PUSH_LOCAL: Bind DECL in the current scope, rather than at
4505 PUSH_USING: DECL is being pushed as the result of a using
4508 The value returned may be a previous declaration if we guessed wrong
4509 about what language DECL should belong to (C or C++). Otherwise,
4510 it's always DECL (and never something that's not a _DECL). */
4513 push_overloaded_decl (decl
, flags
)
4517 tree name
= DECL_NAME (decl
);
4520 int doing_global
= (namespace_bindings_p () || !(flags
& PUSH_LOCAL
));
4523 old
= namespace_binding (name
, DECL_CONTEXT (decl
));
4525 old
= lookup_name_current_level (name
);
4529 if (TREE_CODE (old
) == TYPE_DECL
&& DECL_ARTIFICIAL (old
))
4531 tree t
= TREE_TYPE (old
);
4532 if (IS_AGGR_TYPE (t
) && warn_shadow
4533 && (! DECL_IN_SYSTEM_HEADER (decl
)
4534 || ! DECL_IN_SYSTEM_HEADER (old
)))
4535 cp_warning ("`%#D' hides constructor for `%#T'", decl
, t
);
4538 else if (is_overloaded_fn (old
))
4542 for (tmp
= old
; tmp
; tmp
= OVL_NEXT (tmp
))
4544 tree fn
= OVL_CURRENT (tmp
);
4546 if (TREE_CODE (tmp
) == OVERLOAD
&& OVL_USED (tmp
)
4547 && !(flags
& PUSH_USING
)
4548 && compparms (TYPE_ARG_TYPES (TREE_TYPE (fn
)),
4549 TYPE_ARG_TYPES (TREE_TYPE (decl
))))
4550 cp_error ("`%#D' conflicts with previous using declaration `%#D'",
4553 if (duplicate_decls (decl
, fn
))
4557 else if (old
== error_mark_node
)
4558 /* Ignore the undefined symbol marker. */
4562 cp_error_at ("previous non-function declaration `%#D'", old
);
4563 cp_error ("conflicts with function declaration `%#D'", decl
);
4568 if (old
|| TREE_CODE (decl
) == TEMPLATE_DECL
)
4570 if (old
&& TREE_CODE (old
) != OVERLOAD
)
4571 new_binding
= ovl_cons (decl
, ovl_cons (old
, NULL_TREE
));
4573 new_binding
= ovl_cons (decl
, old
);
4574 if (flags
& PUSH_USING
)
4575 OVL_USED (new_binding
) = 1;
4578 /* NAME is not ambiguous. */
4582 set_namespace_binding (name
, current_namespace
, new_binding
);
4585 /* We only create an OVERLOAD if there was a previous binding at
4586 this level, or if decl is a template. In the former case, we
4587 need to remove the old binding and replace it with the new
4588 binding. We must also run through the NAMES on the binding
4589 level where the name was bound to update the chain. */
4591 if (TREE_CODE (new_binding
) == OVERLOAD
&& old
)
4595 for (d
= &BINDING_LEVEL (IDENTIFIER_BINDING (name
))->names
;
4597 d
= &TREE_CHAIN (*d
))
4599 || (TREE_CODE (*d
) == TREE_LIST
4600 && TREE_VALUE (*d
) == old
))
4602 if (TREE_CODE (*d
) == TREE_LIST
)
4603 /* Just replace the old binding with the new. */
4604 TREE_VALUE (*d
) = new_binding
;
4606 /* Build a TREE_LIST to wrap the OVERLOAD. */
4607 *d
= tree_cons (NULL_TREE
, new_binding
,
4610 /* And update the CPLUS_BINDING node. */
4611 BINDING_VALUE (IDENTIFIER_BINDING (name
))
4616 /* We should always find a previous binding in this case. */
4617 my_friendly_abort (0);
4620 /* Install the new binding. */
4621 push_local_binding (name
, new_binding
, flags
);
4627 /* Generate an implicit declaration for identifier FUNCTIONID
4628 as a function of type int (). Print a warning if appropriate. */
4631 implicitly_declare (functionid
)
4636 /* We used to reuse an old implicit decl here,
4637 but this loses with inline functions because it can clobber
4638 the saved decl chains. */
4639 decl
= build_lang_decl (FUNCTION_DECL
, functionid
, default_function_type
);
4641 DECL_EXTERNAL (decl
) = 1;
4642 TREE_PUBLIC (decl
) = 1;
4644 /* ISO standard says implicit declarations are in the innermost block.
4645 So we record the decl in the standard fashion. */
4647 rest_of_decl_compilation (decl
, NULL_PTR
, 0, 0);
4650 /* Only one warning per identifier. */
4651 && IDENTIFIER_IMPLICIT_DECL (functionid
) == NULL_TREE
)
4653 cp_pedwarn ("implicit declaration of function `%#D'", decl
);
4656 SET_IDENTIFIER_IMPLICIT_DECL (functionid
, decl
);
4661 /* Return zero if the declaration NEWDECL is valid
4662 when the declaration OLDDECL (assumed to be for the same name)
4663 has already been seen.
4664 Otherwise return an error message format string with a %s
4665 where the identifier should go. */
4668 redeclaration_error_message (newdecl
, olddecl
)
4669 tree newdecl
, olddecl
;
4671 if (TREE_CODE (newdecl
) == TYPE_DECL
)
4673 /* Because C++ can put things into name space for free,
4674 constructs like "typedef struct foo { ... } foo"
4675 would look like an erroneous redeclaration. */
4676 if (same_type_p (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
)))
4679 return "redefinition of `%#D'";
4681 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
4683 /* If this is a pure function, its olddecl will actually be
4684 the original initialization to `0' (which we force to call
4685 abort()). Don't complain about redefinition in this case. */
4686 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_PURE_VIRTUAL_P (olddecl
))
4689 /* If both functions come from different namespaces, this is not
4690 a redeclaration - this is a conflict with a used function. */
4691 if (DECL_NAMESPACE_SCOPE_P (olddecl
)
4692 && DECL_CONTEXT (olddecl
) != DECL_CONTEXT (newdecl
))
4693 return "`%D' conflicts with used function";
4695 /* We'll complain about linkage mismatches in
4696 warn_extern_redeclared_static. */
4698 /* Defining the same name twice is no good. */
4699 if (DECL_INITIAL (olddecl
) != NULL_TREE
4700 && DECL_INITIAL (newdecl
) != NULL_TREE
)
4702 if (DECL_NAME (olddecl
) == NULL_TREE
)
4703 return "`%#D' not declared in class";
4705 return "redefinition of `%#D'";
4709 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
4711 if ((TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
4712 && (DECL_TEMPLATE_RESULT (newdecl
)
4713 != DECL_TEMPLATE_RESULT (olddecl
))
4714 && DECL_INITIAL (DECL_TEMPLATE_RESULT (newdecl
))
4715 && DECL_INITIAL (DECL_TEMPLATE_RESULT (olddecl
)))
4716 || (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
4717 && COMPLETE_TYPE_P (TREE_TYPE (newdecl
))
4718 && COMPLETE_TYPE_P (TREE_TYPE (olddecl
))))
4719 return "redefinition of `%#D'";
4722 else if (toplevel_bindings_p () || DECL_NAMESPACE_SCOPE_P (newdecl
))
4724 /* Objects declared at top level: */
4725 /* If at least one is a reference, it's ok. */
4726 if (DECL_EXTERNAL (newdecl
) || DECL_EXTERNAL (olddecl
))
4728 /* Reject two definitions. */
4729 return "redefinition of `%#D'";
4733 /* Objects declared with block scope: */
4734 /* Reject two definitions, and reject a definition
4735 together with an external reference. */
4736 if (!(DECL_EXTERNAL (newdecl
) && DECL_EXTERNAL (olddecl
)))
4737 return "redeclaration of `%#D'";
4742 /* Create a new label, named ID. */
4745 make_label_decl (id
, local_p
)
4751 decl
= build_decl (LABEL_DECL
, id
, void_type_node
);
4753 /* Make sure every label has an rtx. */
4756 DECL_CONTEXT (decl
) = current_function_decl
;
4757 DECL_MODE (decl
) = VOIDmode
;
4758 C_DECLARED_LABEL_FLAG (decl
) = local_p
;
4760 /* Say where one reference is to the label, for the sake of the
4761 error if it is not defined. */
4762 DECL_SOURCE_LINE (decl
) = lineno
;
4763 DECL_SOURCE_FILE (decl
) = input_filename
;
4765 /* Record the fact that this identifier is bound to this label. */
4766 SET_IDENTIFIER_LABEL_VALUE (id
, decl
);
4771 /* Record this label on the list of used labels so that we can check
4772 at the end of the function to see whether or not the label was
4773 actually defined, and so we can check when the label is defined whether
4774 this use is valid. */
4780 if (named_label_uses
== NULL
4781 || named_label_uses
->names_in_scope
!= current_binding_level
->names
4782 || named_label_uses
->label_decl
!= decl
)
4784 struct named_label_use_list
*new_ent
;
4785 new_ent
= ((struct named_label_use_list
*)
4786 ggc_alloc (sizeof (struct named_label_use_list
)));
4787 new_ent
->label_decl
= decl
;
4788 new_ent
->names_in_scope
= current_binding_level
->names
;
4789 new_ent
->binding_level
= current_binding_level
;
4790 new_ent
->lineno_o_goto
= lineno
;
4791 new_ent
->filename_o_goto
= input_filename
;
4792 new_ent
->next
= named_label_uses
;
4793 named_label_uses
= new_ent
;
4797 /* Look for a label named ID in the current function. If one cannot
4798 be found, create one. (We keep track of used, but undefined,
4799 labels, and complain about them at the end of a function.) */
4806 struct named_label_list
*ent
;
4808 /* You can't use labels at global scope. */
4809 if (current_function_decl
== NULL_TREE
)
4811 error ("label `%s' referenced outside of any function",
4812 IDENTIFIER_POINTER (id
));
4816 /* See if we've already got this label. */
4817 decl
= IDENTIFIER_LABEL_VALUE (id
);
4818 if (decl
!= NULL_TREE
&& DECL_CONTEXT (decl
) == current_function_decl
)
4821 /* Record this label on the list of labels used in this function.
4822 We do this before calling make_label_decl so that we get the
4823 IDENTIFIER_LABEL_VALUE before the new label is declared. */
4824 ent
= ((struct named_label_list
*)
4825 ggc_alloc_cleared (sizeof (struct named_label_list
)));
4826 ent
->old_value
= IDENTIFIER_LABEL_VALUE (id
);
4827 ent
->next
= named_labels
;
4830 /* We need a new label. */
4831 decl
= make_label_decl (id
, /*local_p=*/0);
4833 /* Now fill in the information we didn't have before. */
4834 ent
->label_decl
= decl
;
4839 /* Declare a local label named ID. */
4842 declare_local_label (id
)
4847 /* Add a new entry to the SHADOWED_LABELS list so that when we leave
4848 this scope we can restore the old value of
4849 IDENTIFIER_TYPE_VALUE. */
4850 current_binding_level
->shadowed_labels
4851 = tree_cons (IDENTIFIER_LABEL_VALUE (id
), NULL_TREE
,
4852 current_binding_level
->shadowed_labels
);
4853 /* Look for the label. */
4854 decl
= make_label_decl (id
, /*local_p=*/1);
4855 /* Now fill in the information we didn't have before. */
4856 TREE_VALUE (current_binding_level
->shadowed_labels
) = decl
;
4861 /* Returns nonzero if it is ill-formed to jump past the declaration of
4862 DECL. Returns 2 if it's also a real problem. */
4865 decl_jump_unsafe (decl
)
4868 if (TREE_CODE (decl
) != VAR_DECL
|| TREE_STATIC (decl
))
4871 if (DECL_INITIAL (decl
) == NULL_TREE
4872 && pod_type_p (TREE_TYPE (decl
)))
4875 /* This is really only important if we're crossing an initialization.
4876 The POD stuff is just pedantry; why should it matter if the class
4877 contains a field of pointer to member type? */
4878 if (DECL_INITIAL (decl
)
4879 || (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))))
4884 /* Check that a single previously seen jump to a newly defined label
4885 is OK. DECL is the LABEL_DECL or 0; LEVEL is the binding_level for
4886 the jump context; NAMES are the names in scope in LEVEL at the jump
4887 context; FILE and LINE are the source position of the jump or 0. */
4890 check_previous_goto_1 (decl
, level
, names
, file
, line
)
4892 struct binding_level
*level
;
4899 struct binding_level
*b
= current_binding_level
;
4900 for (; b
; b
= b
->level_chain
)
4902 tree new_decls
= b
->names
;
4903 tree old_decls
= (b
== level
? names
: NULL_TREE
);
4904 for (; new_decls
!= old_decls
;
4905 new_decls
= TREE_CHAIN (new_decls
))
4907 int problem
= decl_jump_unsafe (new_decls
);
4914 cp_pedwarn ("jump to label `%D'", decl
);
4916 pedwarn ("jump to case label");
4919 pedwarn_with_file_and_line (file
, line
, " from here");
4923 if (problem
> 1 && DECL_ARTIFICIAL (new_decls
))
4924 /* Can't skip init of __exception_info. */
4925 cp_error_at (" enters catch block", new_decls
);
4926 else if (problem
> 1)
4927 cp_error_at (" crosses initialization of `%#D'",
4930 cp_pedwarn_at (" enters scope of non-POD `%#D'",
4936 if (b
->eh_region
&& ! saw_eh
)
4941 cp_pedwarn ("jump to label `%D'", decl
);
4943 pedwarn ("jump to case label");
4946 pedwarn_with_file_and_line (file
, line
, " from here");
4949 error (" enters try block");
4956 check_previous_goto (use
)
4957 struct named_label_use_list
*use
;
4959 check_previous_goto_1 (use
->label_decl
, use
->binding_level
,
4960 use
->names_in_scope
, use
->filename_o_goto
,
4961 use
->lineno_o_goto
);
4965 check_switch_goto (level
)
4966 struct binding_level
*level
;
4968 check_previous_goto_1 (NULL_TREE
, level
, level
->names
, NULL
, 0);
4971 /* Check that any previously seen jumps to a newly defined label DECL
4972 are OK. Called by define_label. */
4975 check_previous_gotos (decl
)
4978 struct named_label_use_list
**usep
;
4980 if (! TREE_USED (decl
))
4983 for (usep
= &named_label_uses
; *usep
; )
4985 struct named_label_use_list
*use
= *usep
;
4986 if (use
->label_decl
== decl
)
4988 check_previous_goto (use
);
4992 usep
= &(use
->next
);
4996 /* Check that a new jump to a label DECL is OK. Called by
4997 finish_goto_stmt. */
5005 struct named_label_list
*lab
;
5007 /* We can't know where a computed goto is jumping. So we assume
5009 if (! DECL_P (decl
))
5012 /* If the label hasn't been defined yet, defer checking. */
5013 if (! DECL_INITIAL (decl
))
5019 for (lab
= named_labels
; lab
; lab
= lab
->next
)
5020 if (decl
== lab
->label_decl
)
5023 /* If the label is not on named_labels it's a gcc local label, so
5024 it must be in an outer scope, so jumping to it is always OK. */
5028 if ((lab
->eh_region
|| lab
->bad_decls
) && !identified
)
5030 cp_pedwarn_at ("jump to label `%D'", decl
);
5031 pedwarn (" from here");
5035 for (bad
= lab
->bad_decls
; bad
; bad
= TREE_CHAIN (bad
))
5037 tree b
= TREE_VALUE (bad
);
5038 int u
= decl_jump_unsafe (b
);
5040 if (u
> 1 && DECL_ARTIFICIAL (b
))
5041 /* Can't skip init of __exception_info. */
5042 cp_error_at (" enters catch block", b
);
5044 cp_error_at (" skips initialization of `%#D'", b
);
5046 cp_pedwarn_at (" enters scope of non-POD `%#D'", b
);
5050 error (" enters try block");
5053 /* Define a label, specifying the location in the source file.
5054 Return the LABEL_DECL node for the label, if the definition is valid.
5055 Otherwise return 0. */
5058 define_label (filename
, line
, name
)
5059 const char *filename
;
5063 tree decl
= lookup_label (name
);
5064 struct named_label_list
*ent
;
5065 register struct binding_level
*p
;
5067 for (ent
= named_labels
; ent
; ent
= ent
->next
)
5068 if (ent
->label_decl
== decl
)
5071 /* After labels, make any new cleanups in the function go into their
5072 own new (temporary) binding contour. */
5073 for (p
= current_binding_level
; !(p
->parm_flag
); p
= p
->level_chain
)
5074 p
->more_cleanups_ok
= 0;
5076 if (name
== get_identifier ("wchar_t"))
5077 cp_pedwarn ("label named wchar_t");
5079 if (DECL_INITIAL (decl
) != NULL_TREE
)
5081 cp_error ("duplicate label `%D'", decl
);
5086 /* Mark label as having been defined. */
5087 DECL_INITIAL (decl
) = error_mark_node
;
5088 /* Say where in the source. */
5089 DECL_SOURCE_FILE (decl
) = filename
;
5090 DECL_SOURCE_LINE (decl
) = line
;
5093 ent
->names_in_scope
= current_binding_level
->names
;
5094 ent
->binding_level
= current_binding_level
;
5096 check_previous_gotos (decl
);
5097 current_function_return_value
= NULL_TREE
;
5104 struct binding_level
*level
;
5105 struct cp_switch
*next
;
5106 /* The SWITCH_STMT being built. */
5108 /* A splay-tree mapping the low element of a case range to the high
5109 element, or NULL_TREE if there is no high element. Used to
5110 determine whether or not a new case label duplicates an old case
5111 label. We need a tree, rather than simply a hash table, because
5112 of the GNU case range extension. */
5116 /* A stack of the currently active switch statements. The innermost
5117 switch statement is on the top of the stack. There is no need to
5118 mark the stack for garbage collection because it is only active
5119 during the processing of the body of a function, and we never
5120 collect at that point. */
5122 static struct cp_switch
*switch_stack
;
5124 /* Called right after a switch-statement condition is parsed.
5125 SWITCH_STMT is the switch statement being parsed. */
5128 push_switch (switch_stmt
)
5132 = (struct cp_switch
*) xmalloc (sizeof (struct cp_switch
));
5133 p
->level
= current_binding_level
;
5134 p
->next
= switch_stack
;
5135 p
->switch_stmt
= switch_stmt
;
5136 p
->cases
= splay_tree_new (case_compare
, NULL
, NULL
);
5143 struct cp_switch
*cs
;
5146 splay_tree_delete (cs
->cases
);
5147 switch_stack
= switch_stack
->next
;
5151 /* Note that we've seen a definition of a case label, and complain if this
5152 is a bad place for one. */
5155 finish_case_label (low_value
, high_value
)
5160 register struct binding_level
*p
;
5165 error ("case label not within a switch statement");
5167 cp_error ("case label `%E' not within a switch statement",
5170 error ("`default' label not within a switch statement");
5174 if (processing_template_decl
)
5178 /* For templates, just add the case label; we'll do semantic
5179 analysis at instantiation-time. */
5180 label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
5181 return add_stmt (build_case_label (low_value
, high_value
, label
));
5184 /* Find the condition on which this switch statement depends. */
5185 cond
= SWITCH_COND (switch_stack
->switch_stmt
);
5186 if (cond
&& TREE_CODE (cond
) == TREE_LIST
)
5187 cond
= TREE_VALUE (cond
);
5189 r
= c_add_case_label (switch_stack
->cases
, cond
, low_value
, high_value
);
5190 if (r
== error_mark_node
)
5193 check_switch_goto (switch_stack
->level
);
5195 /* After labels, make any new cleanups in the function go into their
5196 own new (temporary) binding contour. */
5197 for (p
= current_binding_level
; !(p
->parm_flag
); p
= p
->level_chain
)
5198 p
->more_cleanups_ok
= 0;
5199 current_function_return_value
= NULL_TREE
;
5204 /* Return the list of declarations of the current level.
5205 Note that this list is in reverse order unless/until
5206 you nreverse it; and when you do nreverse it, you must
5207 store the result back using `storedecls' or you will lose. */
5212 return current_binding_level
->names
;
5215 /* Return the list of type-tags (for structs, etc) of the current level. */
5220 return current_binding_level
->tags
;
5223 /* Store the list of declarations of the current level.
5224 This is done for the parameter declarations of a function being defined,
5225 after they are modified in the light of any missing parameters. */
5231 current_binding_level
->names
= decls
;
5234 /* Similarly, store the list of tags of the current level. */
5240 current_binding_level
->tags
= tags
;
5243 /* Given NAME, an IDENTIFIER_NODE,
5244 return the structure (or union or enum) definition for that name.
5245 Searches binding levels from BINDING_LEVEL up to the global level.
5246 If THISLEVEL_ONLY is nonzero, searches only the specified context
5247 (but skips any tag-transparent contexts to find one that is
5248 meaningful for tags).
5249 FORM says which kind of type the caller wants;
5250 it is RECORD_TYPE or UNION_TYPE or ENUMERAL_TYPE.
5251 If the wrong kind of type is found, and it's not a template, an error is
5255 lookup_tag (form
, name
, binding_level
, thislevel_only
)
5256 enum tree_code form
;
5258 struct binding_level
*binding_level
;
5261 register struct binding_level
*level
;
5262 /* Non-zero if, we should look past a template parameter level, even
5263 if THISLEVEL_ONLY. */
5264 int allow_template_parms_p
= 1;
5266 for (level
= binding_level
; level
; level
= level
->level_chain
)
5269 if (ANON_AGGRNAME_P (name
))
5270 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5272 /* There's no need for error checking here, because
5273 anon names are unique throughout the compilation. */
5274 if (TYPE_IDENTIFIER (TREE_VALUE (tail
)) == name
)
5275 return TREE_VALUE (tail
);
5277 else if (level
->namespace_p
)
5278 /* Do namespace lookup. */
5279 for (tail
= current_namespace
; 1; tail
= CP_DECL_CONTEXT (tail
))
5281 tree old
= binding_for_name (name
, tail
);
5283 /* If we just skipped past a template parameter level,
5284 even though THISLEVEL_ONLY, and we find a template
5285 class declaration, then we use the _TYPE node for the
5286 template. See the example below. */
5287 if (thislevel_only
&& !allow_template_parms_p
5288 && old
&& BINDING_VALUE (old
)
5289 && DECL_CLASS_TEMPLATE_P (BINDING_VALUE (old
)))
5290 old
= TREE_TYPE (BINDING_VALUE (old
));
5292 old
= BINDING_TYPE (old
);
5294 /* If it has an original type, it is a typedef, and we
5295 should not return it. */
5296 if (old
&& DECL_ORIGINAL_TYPE (TYPE_NAME (old
)))
5298 if (old
&& TREE_CODE (old
) != form
5299 && !(form
!= ENUMERAL_TYPE
&& TREE_CODE (old
) == TEMPLATE_DECL
))
5301 cp_error ("`%#D' redeclared as %C", old
, form
);
5306 if (thislevel_only
|| tail
== global_namespace
)
5310 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5312 if (TREE_PURPOSE (tail
) == name
)
5314 enum tree_code code
= TREE_CODE (TREE_VALUE (tail
));
5315 /* Should tighten this up; it'll probably permit
5316 UNION_TYPE and a struct template, for example. */
5318 && !(form
!= ENUMERAL_TYPE
&& code
== TEMPLATE_DECL
))
5320 /* Definition isn't the kind we were looking for. */
5321 cp_error ("`%#D' redeclared as %C", TREE_VALUE (tail
),
5325 return TREE_VALUE (tail
);
5328 if (thislevel_only
&& ! level
->tag_transparent
)
5330 if (level
->template_parms_p
&& allow_template_parms_p
)
5332 /* We must deal with cases like this:
5334 template <class T> struct S;
5335 template <class T> struct S {};
5337 When looking up `S', for the second declaration, we
5338 would like to find the first declaration. But, we
5339 are in the pseudo-global level created for the
5340 template parameters, rather than the (surrounding)
5341 namespace level. Thus, we keep going one more level,
5342 even though THISLEVEL_ONLY is non-zero. */
5343 allow_template_parms_p
= 0;
5355 set_current_level_tags_transparency (tags_transparent
)
5356 int tags_transparent
;
5358 current_binding_level
->tag_transparent
= tags_transparent
;
5362 /* Given a type, find the tag that was defined for it and return the tag name.
5363 Otherwise return 0. However, the value can never be 0
5364 in the cases in which this is used.
5366 C++: If NAME is non-zero, this is the new name to install. This is
5367 done when replacing anonymous tags with real tag names. */
5370 lookup_tag_reverse (type
, name
)
5374 register struct binding_level
*level
;
5376 for (level
= current_binding_level
; level
; level
= level
->level_chain
)
5379 for (tail
= level
->tags
; tail
; tail
= TREE_CHAIN (tail
))
5381 if (TREE_VALUE (tail
) == type
)
5384 TREE_PURPOSE (tail
) = name
;
5385 return TREE_PURPOSE (tail
);
5392 /* Look up NAME in the NAMESPACE. */
5395 lookup_namespace_name (namespace, name
)
5396 tree
namespace, name
;
5399 tree template_id
= NULL_TREE
;
5401 my_friendly_assert (TREE_CODE (namespace) == NAMESPACE_DECL
, 370);
5403 if (TREE_CODE (name
) == NAMESPACE_DECL
)
5404 /* This happens for A::B<int> when B is a namespace. */
5406 else if (TREE_CODE (name
) == TEMPLATE_DECL
)
5408 /* This happens for A::B where B is a template, and there are no
5409 template arguments. */
5410 cp_error ("invalid use of `%D'", name
);
5411 return error_mark_node
;
5414 namespace = ORIGINAL_NAMESPACE (namespace);
5416 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5419 name
= TREE_OPERAND (name
, 0);
5420 if (TREE_CODE (name
) == OVERLOAD
)
5421 name
= DECL_NAME (OVL_CURRENT (name
));
5422 else if (DECL_P (name
))
5423 name
= DECL_NAME (name
);
5426 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 373);
5428 val
= make_node (CPLUS_BINDING
);
5429 if (!qualified_lookup_using_namespace (name
, namespace, val
, 0))
5430 return error_mark_node
;
5432 if (BINDING_VALUE (val
))
5434 val
= BINDING_VALUE (val
);
5438 if (DECL_CLASS_TEMPLATE_P (val
))
5439 val
= lookup_template_class (val
,
5440 TREE_OPERAND (template_id
, 1),
5441 /*in_decl=*/NULL_TREE
,
5442 /*context=*/NULL_TREE
,
5443 /*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);
5633 if (!IS_AGGR_TYPE (context
))
5636 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5637 return error_mark_node
;
5640 t
= lookup_field (context
, name
, 0, 1);
5642 return TREE_TYPE (t
);
5646 /* If the CONTEXT is not a template type, then either the field is
5647 there now or its never going to be. */
5648 if (!uses_template_parms (context
))
5651 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5652 return error_mark_node
;
5656 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5659 /* Select the right _DECL from multiple choices. */
5662 select_decl (binding
, flags
)
5667 val
= BINDING_VALUE (binding
);
5669 /* When we implicitly declare some builtin entity, we mark it
5670 DECL_ANTICIPATED, so that we know to ignore it until it is
5672 if (val
&& DECL_P (val
)
5673 && DECL_LANG_SPECIFIC (val
)
5674 && DECL_ANTICIPATED (val
))
5677 if (LOOKUP_NAMESPACES_ONLY (flags
))
5679 /* We are not interested in types. */
5680 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5685 /* If we could have a type and
5686 we have nothing or we need a type and have none. */
5687 if (BINDING_TYPE (binding
)
5688 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5689 && TREE_CODE (val
) != TYPE_DECL
)))
5690 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5691 /* Don't return non-types if we really prefer types. */
5692 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5693 && (TREE_CODE (val
) != TEMPLATE_DECL
5694 || !DECL_CLASS_TEMPLATE_P (val
)))
5700 /* Unscoped lookup of a global: iterate over current namespaces,
5701 considering using-directives. If SPACESP is non-NULL, store a list
5702 of the namespaces we've considered in it. */
5705 unqualified_namespace_lookup (name
, flags
, spacesp
)
5710 tree b
= make_node (CPLUS_BINDING
);
5711 tree initial
= current_decl_namespace();
5712 tree scope
= initial
;
5714 struct binding_level
*level
;
5715 tree val
= NULL_TREE
;
5718 *spacesp
= NULL_TREE
;
5720 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5723 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5724 val
= binding_for_name (name
, scope
);
5726 /* Initialize binding for this context. */
5727 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5728 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5730 /* Add all _DECLs seen through local using-directives. */
5731 for (level
= current_binding_level
;
5732 !level
->namespace_p
;
5733 level
= level
->level_chain
)
5734 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5735 scope
, flags
, spacesp
))
5736 /* Give up because of error. */
5737 return error_mark_node
;
5739 /* Add all _DECLs seen through global using-directives. */
5740 /* XXX local and global using lists should work equally. */
5744 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5745 scope
, flags
, spacesp
))
5746 /* Give up because of error. */
5747 return error_mark_node
;
5748 if (siter
== scope
) break;
5749 siter
= CP_DECL_CONTEXT (siter
);
5752 val
= select_decl (b
, flags
);
5753 if (scope
== global_namespace
)
5759 /* Combine prefer_type and namespaces_only into flags. */
5762 lookup_flags (prefer_type
, namespaces_only
)
5763 int prefer_type
, namespaces_only
;
5765 if (namespaces_only
)
5766 return LOOKUP_PREFER_NAMESPACES
;
5767 if (prefer_type
> 1)
5768 return LOOKUP_PREFER_TYPES
;
5769 if (prefer_type
> 0)
5770 return LOOKUP_PREFER_BOTH
;
5774 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5775 ignore it or not. Subroutine of lookup_name_real. */
5778 qualify_lookup (val
, flags
)
5782 if (val
== NULL_TREE
)
5784 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5786 if ((flags
& LOOKUP_PREFER_TYPES
)
5787 && (TREE_CODE (val
) == TYPE_DECL
5788 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5789 && DECL_CLASS_TEMPLATE_P (val
))))
5791 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5796 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5800 warn_about_implicit_typename_lookup (typename
, binding
)
5804 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5805 tree name
= DECL_NAME (typename
);
5807 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5808 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5809 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5810 && ! (TREE_CODE (binding
) == TYPE_DECL
5811 && same_type_p (TREE_TYPE (binding
), subtype
)))
5813 cp_warning ("lookup of `%D' finds `%#D'",
5815 cp_warning (" instead of `%D' from dependent base class",
5817 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5818 constructor_name (current_class_type
), name
);
5822 /* Look up NAME in the current binding level and its superiors in the
5823 namespace of variables, functions and typedefs. Return a ..._DECL
5824 node of some kind representing its definition if there is only one
5825 such declaration, or return a TREE_LIST with all the overloaded
5826 definitions if there are many, or return 0 if it is undefined.
5828 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5829 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5830 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5831 Otherwise we prefer non-TYPE_DECLs.
5833 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5834 using IDENTIFIER_CLASS_VALUE. */
5837 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5839 int prefer_type
, nonclass
, namespaces_only
;
5842 tree val
= NULL_TREE
;
5844 tree from_obj
= NULL_TREE
;
5846 int val_is_implicit_typename
= 0;
5848 /* Hack: copy flag set by parser, if set. */
5849 if (only_namespace_names
)
5850 namespaces_only
= 1;
5852 if (prefer_type
== -2)
5854 extern int looking_for_typename
;
5855 tree type
= NULL_TREE
;
5858 prefer_type
= looking_for_typename
;
5860 flags
= lookup_flags (prefer_type
, namespaces_only
);
5861 /* If the next thing is '<', class templates are types. */
5862 if (looking_for_template
)
5863 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5865 /* std:: becomes :: for now. */
5866 if (got_scope
&& got_scope
== fake_std_node
)
5867 got_scope
= void_type_node
;
5871 else if (got_object
!= error_mark_node
)
5876 if (type
== error_mark_node
)
5877 return error_mark_node
;
5878 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5879 type
= TREE_TYPE (type
);
5882 type
= complete_type (type
);
5884 if (TREE_CODE (type
) == VOID_TYPE
)
5885 type
= global_namespace
;
5886 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5888 val
= make_node (CPLUS_BINDING
);
5889 flags
|= LOOKUP_COMPLAIN
;
5890 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5892 val
= select_decl (val
, flags
);
5894 else if (! IS_AGGR_TYPE (type
)
5895 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5896 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
5897 || TREE_CODE (type
) == TYPENAME_TYPE
)
5898 /* Someone else will give an error about this if needed. */
5900 else if (type
== current_class_type
)
5901 val
= IDENTIFIER_CLASS_VALUE (name
);
5904 val
= lookup_member (type
, name
, 0, prefer_type
);
5905 type_access_control (type
, val
);
5907 /* Restore the containing TYPENAME_TYPE if we looked
5908 through it before. */
5909 if (got_scope
&& got_scope
!= type
5910 && val
&& TREE_CODE (val
) == TYPE_DECL
5911 && TREE_CODE (TREE_TYPE (val
)) == TYPENAME_TYPE
)
5912 TYPE_CONTEXT (TREE_TYPE (val
)) = got_scope
;
5920 else if (got_object
&& val
)
5928 flags
= lookup_flags (prefer_type
, namespaces_only
);
5929 /* If we're not parsing, we need to complain. */
5930 flags
|= LOOKUP_COMPLAIN
;
5933 /* First, look in non-namespace scopes. */
5935 if (current_class_type
== NULL_TREE
)
5938 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5942 if (!LOCAL_BINDING_P (t
) && nonclass
)
5943 /* We're not looking for class-scoped bindings, so keep going. */
5946 /* If this is the kind of thing we're looking for, we're done. */
5947 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5948 binding
= BINDING_VALUE (t
);
5949 else if ((flags
& LOOKUP_PREFER_TYPES
)
5950 && qualify_lookup (BINDING_TYPE (t
), flags
))
5951 binding
= BINDING_TYPE (t
);
5953 binding
= NULL_TREE
;
5955 /* Handle access control on types from enclosing or base classes. */
5956 if (binding
&& ! yylex
5957 && BINDING_LEVEL (t
) && BINDING_LEVEL (t
)->parm_flag
== 2)
5958 type_access_control (BINDING_LEVEL (t
)->this_class
, binding
);
5961 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5963 if (val_is_implicit_typename
&& !yylex
)
5964 warn_about_implicit_typename_lookup (val
, binding
);
5966 val_is_implicit_typename
5967 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5968 if (!val_is_implicit_typename
)
5973 /* Now lookup in namespace scopes. */
5974 if (!val
|| val_is_implicit_typename
)
5976 t
= unqualified_namespace_lookup (name
, flags
, 0);
5979 if (val_is_implicit_typename
&& !yylex
)
5980 warn_about_implicit_typename_lookup (val
, t
);
5988 /* This should only warn about types used in qualified-ids. */
5989 if (from_obj
&& from_obj
!= val
)
5991 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5992 && TREE_CODE (val
) == TYPE_DECL
5993 && ! same_type_p (TREE_TYPE (from_obj
), TREE_TYPE (val
)))
5995 lookup of `%D' in the scope of `%#T' (`%#T') \
5996 does not match lookup in the current scope (`%#T')",
5997 name
, got_object
, TREE_TYPE (from_obj
),
6000 /* We don't change val to from_obj if got_object depends on
6001 template parms because that breaks implicit typename for
6002 destructor calls. */
6003 if (! uses_template_parms (got_object
))
6007 /* If we have a single function from a using decl, pull it out. */
6008 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
6009 val
= OVL_FUNCTION (val
);
6018 lookup_name_nonclass (name
)
6021 return lookup_name_real (name
, 0, 1, 0);
6025 lookup_function_nonclass (name
, args
)
6029 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
6033 lookup_name_namespace_only (name
)
6036 /* type-or-namespace, nonclass, namespace_only */
6037 return lookup_name_real (name
, 1, 1, 1);
6041 lookup_name (name
, prefer_type
)
6045 return lookup_name_real (name
, prefer_type
, 0, 0);
6048 /* Similar to `lookup_name' but look only in the innermost non-class
6052 lookup_name_current_level (name
)
6055 struct binding_level
*b
;
6058 b
= current_binding_level
;
6059 while (b
->parm_flag
== 2)
6064 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
6066 /* extern "C" function() */
6067 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
6070 else if (IDENTIFIER_BINDING (name
)
6071 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
6075 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
6076 return IDENTIFIER_VALUE (name
);
6088 /* Like lookup_name_current_level, but for types. */
6091 lookup_type_current_level (name
)
6094 register tree t
= NULL_TREE
;
6096 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
6098 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
6099 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
6101 struct binding_level
*b
= current_binding_level
;
6104 if (purpose_member (name
, b
->type_shadowed
))
6105 return REAL_IDENTIFIER_TYPE_VALUE (name
);
6117 begin_only_namespace_names ()
6119 only_namespace_names
= 1;
6123 end_only_namespace_names ()
6125 only_namespace_names
= 0;
6128 /* Push the declarations of builtin types into the namespace.
6129 RID_INDEX is the index of the builtin type
6130 in the array RID_POINTERS. NAME is the name used when looking
6131 up the builtin type. TYPE is the _TYPE node for the builtin type. */
6134 record_builtin_type (rid_index
, name
, type
)
6139 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
6140 tree tdecl
= NULL_TREE
;
6142 if ((int) rid_index
< (int) RID_MAX
)
6143 rname
= ridpointers
[(int) rid_index
];
6145 tname
= get_identifier (name
);
6147 TYPE_BUILT_IN (type
) = 1;
6151 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
6152 set_identifier_type_value (tname
, NULL_TREE
);
6153 if ((int) rid_index
< (int) RID_MAX
)
6154 /* Built-in types live in the global namespace. */
6155 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
6157 if (rname
!= NULL_TREE
)
6159 if (tname
!= NULL_TREE
)
6161 set_identifier_type_value (rname
, NULL_TREE
);
6162 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
6166 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
6167 set_identifier_type_value (rname
, NULL_TREE
);
6172 /* Record one of the standard Java types.
6173 * Declare it as having the given NAME.
6174 * If SIZE > 0, it is the size of one of the integral types;
6175 * otherwise it is the negative of the size of one of the other types. */
6178 record_builtin_java_type (name
, size
)
6184 type
= make_signed_type (size
);
6185 else if (size
> -32)
6186 { /* "__java_char" or ""__java_boolean". */
6187 type
= make_unsigned_type (-size
);
6188 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
6191 { /* "__java_float" or ""__java_double". */
6192 type
= make_node (REAL_TYPE
);
6193 TYPE_PRECISION (type
) = - size
;
6196 record_builtin_type (RID_MAX
, name
, type
);
6197 decl
= TYPE_NAME (type
);
6199 /* Suppress generate debug symbol entries for these types,
6200 since for normal C++ they are just clutter.
6201 However, push_lang_context undoes this if extern "Java" is seen. */
6202 DECL_IGNORED_P (decl
) = 1;
6204 TYPE_FOR_JAVA (type
) = 1;
6208 /* Push a type into the namespace so that the back-ends ignore it. */
6211 record_unknown_type (type
, name
)
6215 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
6216 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
6217 DECL_IGNORED_P (decl
) = 1;
6218 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
6219 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
6220 TYPE_ALIGN (type
) = 1;
6221 TYPE_USER_ALIGN (type
) = 0;
6222 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
6225 /* An string for which we should create an IDENTIFIER_NODE at
6228 typedef struct predefined_identifier
6230 /* The name of the identifier. */
6232 /* The place where the IDENTIFIER_NODE should be stored. */
6234 /* Non-zero if this is the name of a constructor or destructor. */
6236 } predefined_identifier
;
6238 /* Create all the predefined identifiers. */
6241 initialize_predefined_identifiers ()
6243 struct predefined_identifier
*pid
;
6245 /* A table of identifiers to create at startup. */
6246 static predefined_identifier predefined_identifiers
[] = {
6247 { "C++", &lang_name_cplusplus
, 0 },
6248 { "C", &lang_name_c
, 0 },
6249 { "Java", &lang_name_java
, 0 },
6250 { CTOR_NAME
, &ctor_identifier
, 1 },
6251 { "__base_ctor", &base_ctor_identifier
, 1 },
6252 { "__comp_ctor", &complete_ctor_identifier
, 1 },
6253 { DTOR_NAME
, &dtor_identifier
, 1 },
6254 { "__comp_dtor", &complete_dtor_identifier
, 1 },
6255 { "__base_dtor", &base_dtor_identifier
, 1 },
6256 { "__deleting_dtor", &deleting_dtor_identifier
, 1 },
6257 { VTABLE_DELTA2_NAME
, &delta2_identifier
, 0 },
6258 { VTABLE_DELTA_NAME
, &delta_identifier
, 0 },
6259 { IN_CHARGE_NAME
, &in_charge_identifier
, 0 },
6260 { VTABLE_INDEX_NAME
, &index_identifier
, 0 },
6261 { "nelts", &nelts_identifier
, 0 },
6262 { THIS_NAME
, &this_identifier
, 0 },
6263 { VTABLE_PFN_NAME
, &pfn_identifier
, 0 },
6264 { "__pfn_or_delta2", &pfn_or_delta2_identifier
, 0 },
6265 { "_vptr", &vptr_identifier
, 0 },
6266 { "__cp_push_exception", &cp_push_exception_identifier
, 0 },
6267 { "__vtt_parm", &vtt_parm_identifier
, 0 },
6268 { "std", &std_identifier
, 0 },
6272 for (pid
= predefined_identifiers
; pid
->name
; ++pid
)
6274 *pid
->node
= get_identifier (pid
->name
);
6275 if (pid
->ctor_or_dtor_p
)
6276 IDENTIFIER_CTOR_OR_DTOR_P (*pid
->node
) = 1;
6280 /* Create the predefined scalar types of C,
6281 and some nodes representing standard constants (0, 1, (void *)0).
6282 Initialize the global binding level.
6283 Make definitions for built-in primitive functions. */
6286 init_decl_processing ()
6290 /* Check to see that the user did not specify an invalid combination
6291 of command-line options. */
6292 if (flag_new_abi
&& !flag_vtable_thunks
)
6293 fatal ("the new ABI requires vtable thunks");
6295 /* Create all the identifiers we need. */
6296 initialize_predefined_identifiers ();
6298 /* Fill in back-end hooks. */
6299 init_lang_status
= &push_cp_function_context
;
6300 free_lang_status
= &pop_cp_function_context
;
6301 mark_lang_status
= &mark_cp_function_context
;
6302 lang_safe_from_p
= &c_safe_from_p
;
6303 lang_dump_tree
= &cp_dump_tree
;
6304 lang_missing_noreturn_ok_p
= &cp_missing_noreturn_ok_p
;
6310 /* Create the global variables. */
6311 push_to_top_level ();
6313 /* Enter the global namespace. */
6314 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
6315 push_namespace (get_identifier ("::"));
6316 global_namespace
= current_namespace
;
6317 current_lang_name
= NULL_TREE
;
6319 /* Adjust various flags based on command-line settings. */
6320 if (! flag_permissive
&& ! pedantic
)
6321 flag_pedantic_errors
= 1;
6322 if (!flag_no_inline
)
6323 flag_inline_trees
= 1;
6326 current_lang_name
= lang_name_c
;
6328 current_function_decl
= NULL_TREE
;
6329 current_binding_level
= NULL_BINDING_LEVEL
;
6330 free_binding_level
= NULL_BINDING_LEVEL
;
6332 build_common_tree_nodes (flag_signed_char
);
6334 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6335 TREE_TYPE (error_mark_list
) = error_mark_node
;
6337 /* Make the binding_level structure for global names. */
6339 global_binding_level
= current_binding_level
;
6340 /* The global level is the namespace level of ::. */
6341 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6342 declare_namespace_level ();
6344 /* Create the `std' namespace. */
6347 push_namespace (std_identifier
);
6348 std_node
= current_namespace
;
6350 fake_std_node
= error_mark_node
;
6354 fake_std_node
= build_decl (NAMESPACE_DECL
,
6357 pushdecl (fake_std_node
);
6360 c_common_nodes_and_builtins ();
6362 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6363 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6364 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6365 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6366 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6367 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6368 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6369 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6371 integer_two_node
= build_int_2 (2, 0);
6372 TREE_TYPE (integer_two_node
) = integer_type_node
;
6373 integer_three_node
= build_int_2 (3, 0);
6374 TREE_TYPE (integer_three_node
) = integer_type_node
;
6376 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6377 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6378 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6379 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6380 TYPE_PRECISION (boolean_type_node
) = 1;
6381 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6382 boolean_false_node
= build_int_2 (0, 0);
6383 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6384 boolean_true_node
= build_int_2 (1, 0);
6385 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6387 signed_size_zero_node
= build_int_2 (0, 0);
6388 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6390 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6393 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
6397 delta_type_node
= ptrdiff_type_node
;
6398 else if (flag_huge_objects
)
6399 delta_type_node
= long_integer_type_node
;
6401 delta_type_node
= short_integer_type_node
;
6404 vtable_index_type
= ptrdiff_type_node
;
6406 vtable_index_type
= delta_type_node
;
6408 vtt_parm_type
= build_pointer_type (const_ptr_type_node
);
6409 lang_type_promotes_to
= convert_type_from_ellipsis
;
6412 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6414 /* C++ extensions */
6416 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6417 record_unknown_type (unknown_type_node
, "unknown type");
6419 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6420 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6422 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6424 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6426 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6427 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6429 if (flag_vtable_thunks
)
6431 /* Make sure we get a unique function type, so we can give
6432 its pointer type a name. (This wins for gdb.) */
6433 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6434 TREE_TYPE (vfunc_type
) = integer_type_node
;
6435 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6436 layout_type (vfunc_type
);
6438 vtable_entry_type
= build_pointer_type (vfunc_type
);
6442 vtable_entry_type
= make_aggr_type (RECORD_TYPE
);
6443 fields
[0] = build_decl (FIELD_DECL
, delta_identifier
,
6445 fields
[1] = build_decl (FIELD_DECL
, index_identifier
,
6447 fields
[2] = build_decl (FIELD_DECL
, pfn_identifier
,
6449 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6452 /* Make this part of an invisible union. */
6453 fields
[3] = copy_node (fields
[2]);
6454 TREE_TYPE (fields
[3]) = delta_type_node
;
6455 DECL_NAME (fields
[3]) = delta2_identifier
;
6456 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6457 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6458 DECL_SIZE_UNIT (fields
[3]) = TYPE_SIZE_UNIT (delta_type_node
);
6459 TREE_UNSIGNED (fields
[3]) = 0;
6460 TREE_CHAIN (fields
[2]) = fields
[3];
6461 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6464 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6467 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6468 layout_type (vtbl_type_node
);
6469 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6470 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6471 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6472 layout_type (vtbl_ptr_type_node
);
6473 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6477 push_namespace (get_identifier ("__cxxabiv1"));
6478 abi_node
= current_namespace
;
6482 global_type_node
= make_node (LANG_TYPE
);
6483 record_unknown_type (global_type_node
, "global type");
6486 current_lang_name
= lang_name_cplusplus
;
6489 tree bad_alloc_type_node
, newtype
, deltype
;
6491 push_namespace (std_identifier
);
6492 bad_alloc_type_node
= xref_tag
6493 (class_type_node
, get_identifier ("bad_alloc"), 1);
6496 newtype
= build_exception_variant
6497 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6498 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6499 push_cp_library_fn (NEW_EXPR
, newtype
);
6500 push_cp_library_fn (VEC_NEW_EXPR
, newtype
);
6501 global_delete_fndecl
= push_cp_library_fn (DELETE_EXPR
, deltype
);
6502 push_cp_library_fn (VEC_DELETE_EXPR
, deltype
);
6506 = build_library_fn_ptr ((flag_new_abi
6507 ? "__cxa_pure_virtual"
6508 : "__pure_virtual"),
6511 /* Perform other language dependent initializations. */
6512 init_class_processing ();
6513 init_init_processing ();
6514 init_search_processing ();
6515 init_rtti_processing ();
6517 if (flag_exceptions
)
6518 init_exception_processing ();
6521 flag_inline_functions
= 0;
6524 if (! supports_one_only ())
6527 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6528 function_id_node
= get_identifier ("__FUNCTION__");
6529 pretty_function_id_node
= get_identifier ("__PRETTY_FUNCTION__");
6530 func_id_node
= get_identifier ("__func__");
6532 make_fname_decl
= cp_make_fname_decl
;
6533 declare_function_name ();
6535 /* Prepare to check format strings against argument lists. */
6536 init_function_format_info ();
6538 /* Show we use EH for cleanups. */
6539 using_eh_for_cleanups ();
6541 valid_lang_attribute
= cp_valid_lang_attribute
;
6543 /* Maintain consistency. Perhaps we should just complain if they
6544 say -fwritable-strings? */
6545 if (flag_writable_strings
)
6546 flag_const_strings
= 0;
6548 /* Add GC roots for all of our global variables. */
6549 ggc_add_tree_root (c_global_trees
, sizeof c_global_trees
/ sizeof(tree
));
6550 ggc_add_tree_root (cp_global_trees
, sizeof cp_global_trees
/ sizeof(tree
));
6551 ggc_add_tree_root (&integer_three_node
, 1);
6552 ggc_add_tree_root (&integer_two_node
, 1);
6553 ggc_add_tree_root (&signed_size_zero_node
, 1);
6554 ggc_add_tree_root (&size_one_node
, 1);
6555 ggc_add_tree_root (&size_zero_node
, 1);
6556 ggc_add_root (&global_binding_level
, 1, sizeof global_binding_level
,
6557 mark_binding_level
);
6558 ggc_add_root (&scope_chain
, 1, sizeof scope_chain
, &mark_saved_scope
);
6559 ggc_add_tree_root (&static_ctors
, 1);
6560 ggc_add_tree_root (&static_dtors
, 1);
6561 ggc_add_tree_root (&lastiddecl
, 1);
6563 ggc_add_tree_root (&last_function_parm_tags
, 1);
6564 ggc_add_tree_root (¤t_function_return_value
, 1);
6565 ggc_add_tree_root (¤t_function_parm_tags
, 1);
6566 ggc_add_tree_root (&last_function_parms
, 1);
6567 ggc_add_tree_root (&error_mark_list
, 1);
6569 ggc_add_tree_root (&global_namespace
, 1);
6570 ggc_add_tree_root (&global_type_node
, 1);
6571 ggc_add_tree_root (&anonymous_namespace_name
, 1);
6573 ggc_add_tree_root (&got_object
, 1);
6574 ggc_add_tree_root (&got_scope
, 1);
6576 ggc_add_tree_root (¤t_lang_name
, 1);
6577 ggc_add_tree_root (&static_aggregates
, 1);
6578 ggc_add_tree_root (&free_bindings
, 1);
6581 /* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the
6582 decl, NAME is the initialization string and TYPE_DEP indicates whether
6583 NAME depended on the type of the function. We make use of that to detect
6584 __PRETTY_FUNCTION__ inside a template fn. Because we build a tree for
6585 the function before emitting any of it, we don't need to treat the
6586 VAR_DECL specially. We can decide whether to emit it later, if it was
6590 cp_make_fname_decl (id
, name
, type_dep
)
6595 tree decl
, type
, init
;
6596 size_t length
= strlen (name
);
6597 tree domain
= NULL_TREE
;
6599 if (!processing_template_decl
)
6602 domain
= build_index_type (size_int (length
));
6604 type
= build_cplus_array_type
6605 (build_qualified_type (char_type_node
, TYPE_QUAL_CONST
),
6608 decl
= build_decl (VAR_DECL
, id
, type
);
6609 TREE_STATIC (decl
) = 1;
6610 TREE_READONLY (decl
) = 1;
6611 DECL_SOURCE_LINE (decl
) = 0;
6612 DECL_ARTIFICIAL (decl
) = 1;
6613 DECL_IN_SYSTEM_HEADER (decl
) = 1;
6615 if (processing_template_decl
)
6616 decl
= push_template_decl (decl
);
6619 init
= build (FUNCTION_NAME
, type
);
6620 DECL_PRETTY_FUNCTION_P (decl
) = 1;
6624 init
= build_string (length
+ 1, name
);
6625 TREE_TYPE (init
) = type
;
6627 DECL_INITIAL (decl
) = init
;
6628 cp_finish_decl (decl
, init
, NULL_TREE
, LOOKUP_ONLYCONVERTING
);
6630 /* We will have to make sure we only emit this, if it is actually used. */
6634 /* Entry point for the benefit of c_common_nodes_and_builtins.
6636 Make a definition for a builtin function named NAME and whose data type
6637 is TYPE. TYPE should be a function type with argument types.
6639 CLASS and CODE tell later passes how to compile calls to this function.
6640 See tree.h for possible values.
6642 If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6643 the name to be called if we can't opencode the function. */
6646 builtin_function (name
, type
, code
, class, libname
)
6650 enum built_in_class
class;
6651 const char *libname
;
6653 tree decl
= build_library_fn_1 (get_identifier (name
), ERROR_MARK
, type
);
6654 DECL_BUILT_IN_CLASS (decl
) = class;
6655 DECL_FUNCTION_CODE (decl
) = code
;
6657 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6659 /* All builtins that don't begin with an `_' should go in the `std'
6661 if (flag_honor_std
&& name
[0] != '_')
6663 push_namespace (std_identifier
);
6664 DECL_CONTEXT (decl
) = std_node
;
6667 if (flag_honor_std
&& name
[0] != '_')
6670 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6671 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6672 function in the namespace. */
6674 DECL_ASSEMBLER_NAME (decl
) = get_identifier (libname
);
6675 make_function_rtl (decl
);
6677 /* Warn if a function in the namespace for users
6678 is used without an occasion to consider it declared. */
6679 if (name
[0] != '_' || name
[1] != '_')
6680 DECL_ANTICIPATED (decl
) = 1;
6685 /* Generate a FUNCTION_DECL with the typical flags for a runtime library
6686 function. Not called directly. */
6689 build_library_fn_1 (name
, operator_code
, type
)
6691 enum tree_code operator_code
;
6694 tree fn
= build_lang_decl (FUNCTION_DECL
, name
, type
);
6695 DECL_EXTERNAL (fn
) = 1;
6696 TREE_PUBLIC (fn
) = 1;
6697 DECL_ARTIFICIAL (fn
) = 1;
6698 TREE_NOTHROW (fn
) = 1;
6699 SET_OVERLOADED_OPERATOR_CODE (fn
, operator_code
);
6703 /* Returns the _DECL for a library function with C linkage.
6704 We assume that such functions never throw; if this is incorrect,
6705 callers should unset TREE_NOTHROW. */
6708 build_library_fn (name
, type
)
6712 tree fn
= build_library_fn_1 (name
, ERROR_MARK
, type
);
6713 make_function_rtl (fn
);
6717 /* Returns the _DECL for a library function with C++ linkage. */
6720 build_cp_library_fn (name
, operator_code
, type
)
6722 enum tree_code operator_code
;
6725 tree fn
= build_library_fn_1 (name
, operator_code
, type
);
6726 TREE_NOTHROW (fn
) = TYPE_NOTHROW_P (type
);
6727 DECL_CONTEXT (fn
) = FROB_CONTEXT (current_namespace
);
6728 set_mangled_name_for_decl (fn
);
6729 make_function_rtl (fn
);
6733 /* Like build_library_fn, but takes a C string instead of an
6737 build_library_fn_ptr (name
, type
)
6741 return build_library_fn (get_identifier (name
), type
);
6744 /* Like build_cp_library_fn, but takes a C string instead of an
6748 build_cp_library_fn_ptr (name
, type
)
6752 return build_cp_library_fn (get_identifier (name
), ERROR_MARK
, type
);
6755 /* Like build_library_fn, but also pushes the function so that we will
6756 be able to find it via IDENTIFIER_GLOBAL_VALUE. */
6759 push_library_fn (name
, type
)
6762 tree fn
= build_library_fn (name
, type
);
6763 pushdecl_top_level (fn
);
6767 /* Like build_cp_library_fn, but also pushes the function so that it
6768 will be found by normal lookup. */
6771 push_cp_library_fn (operator_code
, type
)
6772 enum tree_code operator_code
;
6775 tree fn
= build_cp_library_fn (ansi_opname (operator_code
),
6782 /* Like push_library_fn, but takes a TREE_LIST of parm types rather than
6786 push_void_library_fn (name
, parmtypes
)
6787 tree name
, parmtypes
;
6789 tree type
= build_function_type (void_type_node
, parmtypes
);
6790 return push_library_fn (name
, type
);
6793 /* Like push_library_fn, but also note that this function throws
6794 and does not return. Used for __throw_foo and the like. */
6797 push_throw_library_fn (name
, type
)
6800 tree fn
= push_library_fn (name
, type
);
6801 TREE_THIS_VOLATILE (fn
) = 1;
6802 TREE_NOTHROW (fn
) = 0;
6806 /* When we call finish_struct for an anonymous union, we create
6807 default copy constructors and such. But, an anonymous union
6808 shouldn't have such things; this function undoes the damage to the
6809 anonymous union type T.
6811 (The reason that we create the synthesized methods is that we don't
6812 distinguish `union { int i; }' from `typedef union { int i; } U'.
6813 The first is an anonymous union; the second is just an ordinary
6817 fixup_anonymous_aggr (t
)
6822 /* Wipe out memory of synthesized methods */
6823 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6824 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6825 TYPE_HAS_INIT_REF (t
) = 0;
6826 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6827 TYPE_HAS_ASSIGN_REF (t
) = 0;
6828 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6830 /* Splice the implicitly generated functions out of the TYPE_METHODS
6832 q
= &TYPE_METHODS (t
);
6835 if (DECL_ARTIFICIAL (*q
))
6836 *q
= TREE_CHAIN (*q
);
6838 q
= &TREE_CHAIN (*q
);
6841 /* ISO C++ 9.5.3. Anonymous unions may not have function members. */
6842 if (TYPE_METHODS (t
))
6843 error ("an anonymous union cannot have function members");
6846 /* Make sure that a declaration with no declarator is well-formed, i.e.
6847 just defines a tagged type or anonymous union.
6849 Returns the type defined, if any. */
6852 check_tag_decl (declspecs
)
6857 tree ob_modifier
= NULL_TREE
;
6859 register tree t
= NULL_TREE
;
6861 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6863 register tree value
= TREE_VALUE (link
);
6866 || (TREE_CODE (value
) == IDENTIFIER_NODE
6867 && IDENTIFIER_GLOBAL_VALUE (value
)
6868 && TYPE_P (IDENTIFIER_GLOBAL_VALUE (value
))))
6872 if ((TREE_CODE (value
) != TYPENAME_TYPE
&& IS_AGGR_TYPE (value
))
6873 || TREE_CODE (value
) == ENUMERAL_TYPE
)
6875 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6879 else if (value
== ridpointers
[(int) RID_FRIEND
])
6881 if (current_class_type
== NULL_TREE
6882 || current_scope () != current_class_type
)
6883 ob_modifier
= value
;
6887 else if (value
== ridpointers
[(int) RID_STATIC
]
6888 || value
== ridpointers
[(int) RID_EXTERN
]
6889 || value
== ridpointers
[(int) RID_AUTO
]
6890 || value
== ridpointers
[(int) RID_REGISTER
]
6891 || value
== ridpointers
[(int) RID_INLINE
]
6892 || value
== ridpointers
[(int) RID_VIRTUAL
]
6893 || value
== ridpointers
[(int) RID_CONST
]
6894 || value
== ridpointers
[(int) RID_VOLATILE
]
6895 || value
== ridpointers
[(int) RID_EXPLICIT
])
6896 ob_modifier
= value
;
6900 error ("multiple types in one declaration");
6902 if (t
== NULL_TREE
&& ! saw_friend
)
6903 pedwarn ("declaration does not declare anything");
6905 /* Check for an anonymous union. We're careful
6906 accessing TYPE_IDENTIFIER because some built-in types, like
6907 pointer-to-member types, do not have TYPE_NAME. */
6908 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
6910 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
6912 /* Anonymous unions are objects, so they can have specifiers. */;
6913 SET_ANON_AGGR_TYPE_P (t
);
6915 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
6916 pedwarn ("ISO C++ prohibits anonymous structs");
6919 else if (ob_modifier
)
6921 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
6922 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
6923 cp_error ("`%D' can only be specified for functions", ob_modifier
);
6924 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
6925 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
6926 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
6927 cp_error ("`%D' can only be specified for constructors",
6930 cp_error ("`%D' can only be specified for objects and functions",
6937 /* Called when a declaration is seen that contains no names to declare.
6938 If its type is a reference to a structure, union or enum inherited
6939 from a containing scope, shadow that tag name for the current scope
6940 with a forward reference.
6941 If its type defines a new named structure or union
6942 or defines an enum, it is valid but we need not do anything here.
6943 Otherwise, it is an error.
6945 C++: may have to grok the declspecs to learn about static,
6946 complain for anonymous unions. */
6949 shadow_tag (declspecs
)
6952 tree t
= check_tag_decl (declspecs
);
6955 maybe_process_partial_specialization (t
);
6957 /* This is where the variables in an anonymous union are
6958 declared. An anonymous union declaration looks like:
6960 because there is no declarator after the union, the parser
6961 sends that declaration here. */
6962 if (t
&& ANON_AGGR_TYPE_P (t
))
6964 fixup_anonymous_aggr (t
);
6966 if (TYPE_FIELDS (t
))
6968 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
6970 finish_anon_union (decl
);
6975 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6978 groktypename (typename
)
6981 if (TREE_CODE (typename
) != TREE_LIST
)
6983 return grokdeclarator (TREE_VALUE (typename
),
6984 TREE_PURPOSE (typename
),
6985 TYPENAME
, 0, NULL_TREE
);
6988 /* Decode a declarator in an ordinary declaration or data definition.
6989 This is called as soon as the type information and variable name
6990 have been parsed, before parsing the initializer if any.
6991 Here we create the ..._DECL node, fill in its type,
6992 and put it on the list of decls for the current context.
6993 The ..._DECL node is returned as the value.
6995 Exception: for arrays where the length is not specified,
6996 the type is left null, to be filled in by `cp_finish_decl'.
6998 Function definitions do not come here; they go to start_function
6999 instead. However, external and forward declarations of functions
7000 do go through here. Structure field declarations are done by
7001 grokfield and not through here. */
7004 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
7005 tree declarator
, declspecs
;
7007 tree attributes
, prefix_attributes
;
7010 register tree type
, tem
;
7012 extern int have_extern_spec
;
7013 extern int used_extern_spec
;
7017 /* See code below that used this. */
7018 int init_written
= initialized
;
7021 /* This should only be done once on the top most decl. */
7022 if (have_extern_spec
&& !used_extern_spec
)
7024 declspecs
= tree_cons (NULL_TREE
, get_identifier ("extern"),
7026 used_extern_spec
= 1;
7029 if (attributes
|| prefix_attributes
)
7030 attrlist
= build_tree_list (attributes
, prefix_attributes
);
7032 attrlist
= NULL_TREE
;
7034 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
7037 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
7040 type
= TREE_TYPE (decl
);
7042 if (type
== error_mark_node
)
7045 context
= DECL_CONTEXT (decl
);
7047 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
7048 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
7050 /* When parsing the initializer, lookup should use the object's
7052 push_decl_namespace (context
);
7055 /* We are only interested in class contexts, later. */
7056 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
7057 context
= NULL_TREE
;
7060 /* Is it valid for this decl to have an initializer at all?
7061 If not, set INITIALIZED to zero, which will indirectly
7062 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7063 switch (TREE_CODE (decl
))
7066 /* typedef foo = bar means give foo the same type as bar.
7067 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
7068 Any other case of an initialization in a TYPE_DECL is an error. */
7069 if (pedantic
|| list_length (declspecs
) > 1)
7071 cp_error ("typedef `%D' is initialized", decl
);
7077 cp_error ("function `%#D' is initialized like a variable", decl
);
7087 if (! toplevel_bindings_p ()
7088 && DECL_EXTERNAL (decl
))
7089 cp_warning ("declaration of `%#D' has `extern' and is initialized",
7091 DECL_EXTERNAL (decl
) = 0;
7092 if (toplevel_bindings_p ())
7093 TREE_STATIC (decl
) = 1;
7095 /* Tell `pushdecl' this is an initialized decl
7096 even though we don't yet have the initializer expression.
7097 Also tell `cp_finish_decl' it may store the real initializer. */
7098 DECL_INITIAL (decl
) = error_mark_node
;
7101 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
7102 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
7105 /* Set attributes here so if duplicate decl, will have proper attributes. */
7106 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
7108 if (context
&& COMPLETE_TYPE_P (complete_type (context
)))
7110 push_nested_class (context
, 2);
7112 if (TREE_CODE (decl
) == VAR_DECL
)
7114 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
7115 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
7116 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
7119 if (DECL_CONTEXT (field
) != context
)
7121 cp_pedwarn ("ISO C++ does not permit `%T::%D' to be defined as `%T::%D'",
7122 DECL_CONTEXT (field
), DECL_NAME (decl
),
7123 context
, DECL_NAME (decl
));
7124 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
7126 /* Static data member are tricky; an in-class initialization
7127 still doesn't provide a definition, so the in-class
7128 declaration will have DECL_EXTERNAL set, but will have an
7129 initialization. Thus, duplicate_decls won't warn
7130 about this situation, and so we check here. */
7131 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
7132 cp_error ("duplicate initialization of %D", decl
);
7133 if (duplicate_decls (decl
, field
))
7139 tree field
= check_classfn (context
, decl
);
7140 if (field
&& duplicate_decls (decl
, field
))
7144 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
7145 DECL_IN_AGGR_P (decl
) = 0;
7146 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
7147 || CLASSTYPE_TEMPLATE_INSTANTIATION (context
))
7149 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
7150 /* [temp.expl.spec] An explicit specialization of a static data
7151 member of a template is a definition if the declaration
7152 includes an initializer; otherwise, it is a declaration.
7154 We check for processing_specialization so this only applies
7155 to the new specialization syntax. */
7156 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
7157 DECL_EXTERNAL (decl
) = 1;
7160 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
7161 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
7165 /* Enter this declaration into the symbol table. */
7166 tem
= maybe_push_decl (decl
);
7168 if (processing_template_decl
)
7169 tem
= push_template_decl (tem
);
7171 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7172 /* Tell the back-end to use or not use .common as appropriate. If we say
7173 -fconserve-space, we want this to save .data space, at the expense of
7174 wrong semantics. If we say -fno-conserve-space, we want this to
7175 produce errors about redefs; to do this we force variables into the
7177 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
7180 if (! processing_template_decl
)
7190 tree type
= TREE_TYPE (decl
);
7191 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
7193 if (type
== error_mark_node
)
7196 /* If this type of object needs a cleanup, but we're not allowed to
7197 add any more objects with cleanups to the current scope, create a
7198 new binding level. */
7199 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
7200 && current_binding_level
->more_cleanups_ok
== 0)
7202 keep_next_level (2);
7205 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/1);
7209 /* Is it valid for this decl to have an initializer at all?
7210 If not, set INITIALIZED to zero, which will indirectly
7211 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7213 /* Don't allow initializations for incomplete types except for
7214 arrays which might be completed by the initialization. */
7215 if (COMPLETE_TYPE_P (complete_type (type
)))
7216 ; /* A complete type is ok. */
7217 else if (TREE_CODE (type
) != ARRAY_TYPE
)
7219 cp_error ("variable `%#D' has initializer but incomplete type",
7222 type
= TREE_TYPE (decl
) = error_mark_node
;
7224 else if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (type
))))
7226 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
7227 cp_error ("elements of array `%#D' have incomplete type", decl
);
7228 /* else we already gave an error in start_decl. */
7234 && TREE_CODE (decl
) != TYPE_DECL
7235 && TREE_CODE (decl
) != TEMPLATE_DECL
7236 && type
!= error_mark_node
7237 && IS_AGGR_TYPE (type
)
7238 && ! DECL_EXTERNAL (decl
))
7240 if ((! processing_template_decl
|| ! uses_template_parms (type
))
7241 && !COMPLETE_TYPE_P (complete_type (type
)))
7243 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
7245 /* Change the type so that assemble_variable will give
7246 DECL an rtl we can live with: (mem (const_int 0)). */
7247 type
= TREE_TYPE (decl
) = error_mark_node
;
7251 /* If any base type in the hierarchy of TYPE needs a constructor,
7252 then we set initialized to 1. This way any nodes which are
7253 created for the purposes of initializing this aggregate
7254 will live as long as it does. This is necessary for global
7255 aggregates which do not have their initializers processed until
7256 the end of the file. */
7257 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
7262 DECL_INITIAL (decl
) = NULL_TREE
;
7265 /* Handle initialization of references.
7266 These three arguments are from `cp_finish_decl', and have the
7267 same meaning here that they do there.
7269 Quotes on semantics can be found in ARM 8.4.3. */
7272 grok_reference_init (decl
, type
, init
)
7273 tree decl
, type
, init
;
7277 if (init
== NULL_TREE
)
7279 if ((DECL_LANG_SPECIFIC (decl
) == 0
7280 || DECL_IN_AGGR_P (decl
) == 0)
7281 && ! DECL_THIS_EXTERN (decl
))
7282 cp_error ("`%D' declared as reference but not initialized", decl
);
7286 if (init
== error_mark_node
)
7289 if (TREE_CODE (init
) == CONSTRUCTOR
)
7291 cp_error ("ISO C++ forbids use of initializer list to initialize reference `%D'", decl
);
7295 if (TREE_CODE (init
) == TREE_LIST
)
7296 init
= build_compound_expr (init
);
7298 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
7299 init
= convert_from_reference (init
);
7301 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
7302 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
7304 /* Note: default conversion is only called in very special cases. */
7305 init
= default_conversion (init
);
7308 /* Convert INIT to the reference type TYPE. This may involve the
7309 creation of a temporary, whose lifetime must be the same as that
7310 of the reference. If so, a DECL_STMT for the temporary will be
7311 added just after the DECL_STMT for DECL. That's why we don't set
7312 DECL_INITIAL for local references (instead assigning to them
7313 explicitly); we need to allow the temporary to be initialized
7315 tmp
= convert_to_reference
7316 (type
, init
, CONV_IMPLICIT
,
7317 LOOKUP_ONLYCONVERTING
|LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
,
7320 if (tmp
== error_mark_node
)
7322 else if (tmp
!= NULL_TREE
)
7325 tmp
= save_expr (tmp
);
7326 if (building_stmt_tree ())
7328 /* Initialize the declaration. */
7329 tmp
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, tmp
);
7330 finish_expr_stmt (tmp
);
7333 DECL_INITIAL (decl
) = tmp
;
7337 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7341 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
7343 expand_static_init (decl
, DECL_INITIAL (decl
));
7344 DECL_INITIAL (decl
) = NULL_TREE
;
7349 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7350 mucking with forces it does not comprehend (i.e. initialization with a
7351 constructor). If we are at global scope and won't go into COMMON, fill
7352 it in with a dummy CONSTRUCTOR to force the variable into .data;
7353 otherwise we can use error_mark_node. */
7356 obscure_complex_init (decl
, init
)
7359 if (! flag_no_inline
&& TREE_STATIC (decl
))
7361 if (extract_init (decl
, init
))
7365 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7366 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7367 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7371 DECL_INITIAL (decl
) = error_mark_node
;
7376 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7377 array until we finish parsing the initializer. If that's the
7378 situation we're in, update DECL accordingly. */
7381 maybe_deduce_size_from_array_init (decl
, init
)
7385 tree type
= TREE_TYPE (decl
);
7387 if (TREE_CODE (type
) == ARRAY_TYPE
7388 && TYPE_DOMAIN (type
) == NULL_TREE
7389 && TREE_CODE (decl
) != TYPE_DECL
)
7391 /* do_default is really a C-ism to deal with tentative definitions.
7392 But let's leave it here to ease the eventual merge. */
7393 int do_default
= !DECL_EXTERNAL (decl
);
7394 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7395 int failure
= complete_array_type (type
, initializer
, do_default
);
7398 cp_error ("initializer fails to determine size of `%D'", decl
);
7403 cp_error ("array size missing in `%D'", decl
);
7404 /* If a `static' var's size isn't known, make it extern as
7405 well as static, so it does not get allocated. If it's not
7406 `static', then don't mark it extern; finish_incomplete_decl
7407 will give it a default size and it will get allocated. */
7408 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7409 DECL_EXTERNAL (decl
) = 1;
7412 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7413 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7415 cp_error ("zero-size array `%D'", decl
);
7417 layout_decl (decl
, 0);
7421 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7422 any appropriate error messages regarding the layout. */
7425 layout_var_decl (decl
)
7428 tree type
= TREE_TYPE (decl
);
7430 tree ttype
= target_type (type
);
7433 /* If we haven't already layed out this declaration, do so now.
7434 Note that we must not call complete type for an external object
7435 because it's type might involve templates that we are not
7436 supposed to isntantiate yet. (And it's perfectly legal to say
7437 `extern X x' for some incomplete type `X'.) */
7438 if (!DECL_EXTERNAL (decl
))
7439 complete_type (type
);
7440 if (!DECL_SIZE (decl
) && COMPLETE_TYPE_P (type
))
7441 layout_decl (decl
, 0);
7443 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7445 /* An automatic variable with an incomplete type: that is an error.
7446 Don't talk about array types here, since we took care of that
7447 message in grokdeclarator. */
7448 cp_error ("storage size of `%D' isn't known", decl
);
7449 TREE_TYPE (decl
) = error_mark_node
;
7452 /* Keep this code around in case we later want to control debug info
7453 based on whether a type is "used". (jason 1999-11-11) */
7455 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7456 /* Let debugger know it should output info for this type. */
7457 note_debug_info_needed (ttype
);
7459 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7460 note_debug_info_needed (DECL_CONTEXT (decl
));
7463 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7464 && DECL_SIZE (decl
) != NULL_TREE
7465 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7467 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7468 constant_expression_warning (DECL_SIZE (decl
));
7470 cp_error ("storage size of `%D' isn't constant", decl
);
7474 /* If a local static variable is declared in an inline function, or if
7475 we have a weak definition, we must endeavor to create only one
7476 instance of the variable at link-time. */
7479 maybe_commonize_var (decl
)
7482 /* Static data in a function with comdat linkage also has comdat
7484 if (TREE_STATIC (decl
)
7485 /* Don't mess with __FUNCTION__. */
7486 && ! DECL_ARTIFICIAL (decl
)
7487 && current_function_decl
7488 && DECL_CONTEXT (decl
) == current_function_decl
7489 && (DECL_THIS_INLINE (current_function_decl
)
7490 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7491 && TREE_PUBLIC (current_function_decl
))
7493 /* Rather than try to get this right with inlining, we suppress
7494 inlining of such functions. */
7495 current_function_cannot_inline
7496 = "function with static variable cannot be inline";
7497 DECL_UNINLINABLE (current_function_decl
) = 1;
7499 /* If flag_weak, we don't need to mess with this, as we can just
7500 make the function weak, and let it refer to its unique local
7501 copy. This works because we don't allow the function to be
7505 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7507 TREE_PUBLIC (decl
) = 1;
7508 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7510 else if (DECL_INITIAL (decl
) == NULL_TREE
7511 || DECL_INITIAL (decl
) == error_mark_node
)
7513 TREE_PUBLIC (decl
) = 1;
7514 DECL_COMMON (decl
) = 1;
7516 /* else we lose. We can only do this if we can use common,
7517 which we can't if it has been initialized. */
7519 if (TREE_PUBLIC (decl
))
7520 DECL_ASSEMBLER_NAME (decl
)
7521 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7524 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7525 cp_warning_at (" you can work around this by removing the initializer", decl
);
7529 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7530 /* Set it up again; we might have set DECL_INITIAL since the last
7532 comdat_linkage (decl
);
7535 /* Issue an error message if DECL is an uninitialized const variable. */
7538 check_for_uninitialized_const_var (decl
)
7541 tree type
= TREE_TYPE (decl
);
7543 /* ``Unless explicitly declared extern, a const object does not have
7544 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7546 if (TREE_CODE (decl
) == VAR_DECL
7547 && TREE_CODE (type
) != REFERENCE_TYPE
7548 && CP_TYPE_CONST_P (type
)
7549 && !TYPE_NEEDS_CONSTRUCTING (type
)
7550 && !DECL_INITIAL (decl
))
7551 cp_error ("uninitialized const `%D'", decl
);
7554 /* Verify INIT (the initializer for DECL), and record the
7555 initialization in DECL_INITIAL, if appropriate. Returns a new
7559 check_initializer (decl
, init
)
7565 if (TREE_CODE (decl
) == FIELD_DECL
)
7568 type
= TREE_TYPE (decl
);
7570 /* If `start_decl' didn't like having an initialization, ignore it now. */
7571 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7574 /* Check the initializer. */
7577 /* Things that are going to be initialized need to have complete
7579 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7581 if (type
== error_mark_node
)
7582 /* We will have already complained. */
7584 else if (COMPLETE_TYPE_P (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7586 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7589 else if (TREE_CODE (type
) == ARRAY_TYPE
7590 && !COMPLETE_TYPE_P (TREE_TYPE (type
)))
7592 cp_error ("elements of array `%#D' have incomplete type", decl
);
7595 else if (!COMPLETE_TYPE_P (type
))
7597 cp_error ("`%D' has incomplete type", decl
);
7598 TREE_TYPE (decl
) = error_mark_node
;
7603 if (TREE_CODE (decl
) == CONST_DECL
)
7605 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7607 DECL_INITIAL (decl
) = init
;
7609 /* This will keep us from needing to worry about our obstacks. */
7610 my_friendly_assert (init
!= NULL_TREE
, 149);
7613 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7615 if (TREE_STATIC (decl
))
7616 make_decl_rtl (decl
, NULL_PTR
, toplevel_bindings_p ());
7617 grok_reference_init (decl
, type
, init
);
7622 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7624 if (TREE_CODE (type
) == ARRAY_TYPE
)
7625 init
= digest_init (type
, init
, (tree
*) 0);
7626 else if (TREE_CODE (init
) == CONSTRUCTOR
7627 && TREE_HAS_CONSTRUCTOR (init
))
7629 if (TYPE_NON_AGGREGATE_CLASS (type
))
7631 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7633 init
= error_mark_node
;
7636 goto dont_use_constructor
;
7641 dont_use_constructor
:
7642 if (TREE_CODE (init
) != TREE_VEC
)
7643 init
= store_init_value (decl
, init
);
7647 /* We must hide the initializer so that expand_decl
7648 won't try to do something it does not understand. */
7649 init
= obscure_complex_init (decl
, init
);
7651 else if (DECL_EXTERNAL (decl
))
7653 else if (TYPE_P (type
)
7654 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7656 tree core_type
= strip_array_types (type
);
7658 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7660 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7661 cp_error ("structure `%D' with uninitialized const members", decl
);
7662 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7663 cp_error ("structure `%D' with uninitialized reference members",
7667 check_for_uninitialized_const_var (decl
);
7669 if (COMPLETE_TYPE_P (type
) && TYPE_NEEDS_CONSTRUCTING (type
))
7670 init
= obscure_complex_init (decl
, NULL_TREE
);
7674 check_for_uninitialized_const_var (decl
);
7679 /* If DECL is not a local variable, give it RTL. */
7682 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
7685 const char *asmspec
;
7687 int toplev
= toplevel_bindings_p ();
7690 /* Handle non-variables up front. */
7691 if (TREE_CODE (decl
) != VAR_DECL
)
7693 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7697 /* If we see a class member here, it should be a static data
7699 if (DECL_LANG_SPECIFIC (decl
) && DECL_IN_AGGR_P (decl
))
7701 my_friendly_assert (TREE_STATIC (decl
), 19990828);
7702 /* An in-class declaration of a static data member should be
7703 external; it is only a declaration, and not a definition. */
7704 if (init
== NULL_TREE
)
7705 my_friendly_assert (DECL_EXTERNAL (decl
), 20000723);
7708 /* Set the DECL_ASSEMBLER_NAME for the variable. */
7710 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7712 /* We don't create any RTL for local variables. */
7713 if (DECL_FUNCTION_SCOPE_P (decl
) && !TREE_STATIC (decl
))
7716 /* We defer emission of local statics until the corresponding
7717 DECL_STMT is expanded. */
7718 defer_p
= DECL_FUNCTION_SCOPE_P (decl
) || DECL_VIRTUAL_P (decl
);
7720 /* We try to defer namespace-scope static constants so that they are
7721 not emitted into the object file unncessarily. */
7722 if (!DECL_VIRTUAL_P (decl
)
7723 && TREE_READONLY (decl
)
7724 && DECL_INITIAL (decl
) != NULL_TREE
7725 && DECL_INITIAL (decl
) != error_mark_node
7726 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
))
7728 && !TREE_PUBLIC (decl
))
7730 /* Fool with the linkage according to #pragma interface. */
7731 if (!interface_unknown
)
7733 TREE_PUBLIC (decl
) = 1;
7734 DECL_EXTERNAL (decl
) = interface_only
;
7740 /* If we're deferring the variable, just make RTL. Do not actually
7741 emit the variable. */
7743 make_decl_rtl (decl
, asmspec
, toplev
);
7744 /* If we're not deferring, go ahead and assemble the variable. */
7746 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7749 /* The old ARM scoping rules injected variables declared in the
7750 initialization statement of a for-statement into the surrounding
7751 scope. We support this usage, in order to be backward-compatible.
7752 DECL is a just-declared VAR_DECL; if necessary inject its
7753 declaration into the surrounding scope. */
7756 maybe_inject_for_scope_var (decl
)
7759 if (!DECL_NAME (decl
))
7762 if (current_binding_level
->is_for_scope
)
7764 struct binding_level
*outer
7765 = current_binding_level
->level_chain
;
7767 /* Check to see if the same name is already bound at the outer
7768 level, either because it was directly declared, or because a
7769 dead for-decl got preserved. In either case, the code would
7770 not have been valid under the ARM scope rules, so clear
7771 is_for_scope for the current_binding_level.
7773 Otherwise, we need to preserve the temp slot for decl to last
7774 into the outer binding level. */
7777 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7779 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7780 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7782 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7784 BINDING_VALUE (outer_binding
)
7785 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7786 current_binding_level
->is_for_scope
= 0;
7788 else if (DECL_IN_MEMORY_P (decl
))
7789 preserve_temp_slots (DECL_RTL (decl
));
7793 /* Generate code to initialize DECL (a local variable). */
7796 initialize_local_var (decl
, init
, flags
)
7801 tree type
= TREE_TYPE (decl
);
7803 /* If the type is bogus, don't bother initializing the variable. */
7804 if (type
== error_mark_node
)
7807 if (DECL_SIZE (decl
) == NULL_TREE
&& !TREE_STATIC (decl
))
7809 /* If we used it already as memory, it must stay in memory. */
7810 DECL_INITIAL (decl
) = NULL_TREE
;
7811 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7814 /* Local statics are handled differently from ordinary automatic
7816 if (TREE_STATIC (decl
))
7818 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7819 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7820 expand_static_init (decl
, init
);
7824 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7828 /* Compute and store the initial value. */
7829 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7831 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7833 int saved_stmts_are_full_exprs_p
;
7835 my_friendly_assert (building_stmt_tree (), 20000906);
7836 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p ();
7837 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
7838 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7839 current_stmt_tree ()->stmts_are_full_exprs_p
=
7840 saved_stmts_are_full_exprs_p
;
7843 /* Set this to 0 so we can tell whether an aggregate which was
7844 initialized was ever used. Don't do this if it has a
7845 destructor, so we don't complain about the 'resource
7846 allocation is initialization' idiom. Now set
7847 attribute((unused)) on types so decls of that type will be
7848 marked used. (see TREE_USED, above.) */
7849 if (TYPE_NEEDS_CONSTRUCTING (type
)
7851 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type
)
7852 && DECL_NAME (decl
))
7853 TREE_USED (decl
) = 0;
7854 else if (already_used
)
7855 TREE_USED (decl
) = 1;
7859 /* Generate code to destroy DECL (a local variable). */
7862 destroy_local_var (decl
)
7865 tree type
= TREE_TYPE (decl
);
7868 /* Only variables get cleaned up. */
7869 if (TREE_CODE (decl
) != VAR_DECL
)
7872 /* And only things with destructors need cleaning up. */
7873 if (type
== error_mark_node
7874 || TYPE_HAS_TRIVIAL_DESTRUCTOR (type
))
7877 if (TREE_CODE (decl
) == VAR_DECL
&&
7878 (DECL_EXTERNAL (decl
) || TREE_STATIC (decl
)))
7879 /* We don't clean up things that aren't defined in this
7880 translation unit, or that need a static cleanup. The latter
7881 are handled by finish_file. */
7884 /* Compute the cleanup. */
7885 cleanup
= maybe_build_cleanup (decl
);
7887 /* Record the cleanup required for this declaration. */
7888 if (DECL_SIZE (decl
) && TREE_TYPE (decl
) != error_mark_node
7890 finish_decl_cleanup (decl
, cleanup
);
7893 /* Finish processing of a declaration;
7894 install its line number and initial value.
7895 If the length of an array type is not known before,
7896 it must be determined now, from the initial value, or it is an error.
7898 INIT holds the value of an initializer that should be allowed to escape
7901 FLAGS is LOOKUP_ONLYCONVERTING if the = init syntax was used, else 0
7902 if the (init) syntax was used. */
7905 cp_finish_decl (decl
, init
, asmspec_tree
, flags
)
7911 tree ttype
= NULL_TREE
;
7912 const char *asmspec
= NULL
;
7913 int was_readonly
= 0;
7918 error ("assignment (not initialization) in declaration");
7922 /* If a name was specified, get the string. */
7924 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
7926 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
7928 cp_error ("cannot initialize `%D' to namespace `%D'",
7933 if (current_class_type
7934 && CP_DECL_CONTEXT (decl
) == current_class_type
7935 && TYPE_BEING_DEFINED (current_class_type
)
7936 && (DECL_INITIAL (decl
) || init
))
7937 DECL_DEFINED_IN_CLASS_P (decl
) = 1;
7939 if (TREE_CODE (decl
) == VAR_DECL
7940 && DECL_CONTEXT (decl
)
7941 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7942 && DECL_CONTEXT (decl
) != current_namespace
7945 /* Leave the namespace of the object. */
7946 pop_decl_namespace ();
7949 type
= TREE_TYPE (decl
);
7951 if (type
== error_mark_node
)
7954 /* Add this declaration to the statement-tree. */
7955 if (building_stmt_tree ()
7956 && at_function_scope_p ()
7957 && TREE_CODE (decl
) != RESULT_DECL
)
7958 add_decl_stmt (decl
);
7960 if (TYPE_HAS_MUTABLE_P (type
))
7961 TREE_READONLY (decl
) = 0;
7963 if (processing_template_decl
)
7965 if (init
&& DECL_INITIAL (decl
))
7966 DECL_INITIAL (decl
) = init
;
7970 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
7971 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
7973 /* Take care of TYPE_DECLs up front. */
7974 if (TREE_CODE (decl
) == TYPE_DECL
)
7976 if (init
&& DECL_INITIAL (decl
))
7978 /* typedef foo = bar; store the type of bar as the type of foo. */
7979 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
7980 DECL_INITIAL (decl
) = init
= NULL_TREE
;
7982 if (type
!= error_mark_node
7983 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
7985 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
7986 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
7987 set_identifier_type_value (DECL_NAME (decl
), type
);
7988 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
7990 GNU_xref_decl (current_function_decl
, decl
);
7992 /* If we have installed this as the canonical typedef for this
7993 type, and that type has not been defined yet, delay emitting
7994 the debug information for it, as we will emit it later. */
7995 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
7996 && !COMPLETE_TYPE_P (TREE_TYPE (decl
)))
7997 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
7999 rest_of_decl_compilation (decl
, NULL_PTR
,
8000 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
8004 if (TREE_CODE (decl
) != FUNCTION_DECL
)
8005 ttype
= target_type (type
);
8007 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
8008 && TYPE_NEEDS_CONSTRUCTING (type
))
8010 /* Currently, GNU C++ puts constants in text space, making them
8011 impossible to initialize. In the future, one would hope for
8012 an operating system which understood the difference between
8013 initialization and the running of a program. */
8015 TREE_READONLY (decl
) = 0;
8018 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
8020 /* This must override the asm specifier which was placed by
8021 grokclassfn. Lay this out fresh. */
8022 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
8023 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
8024 make_decl_rtl (decl
, asmspec
, 0);
8027 /* Deduce size of array from initialization, if not already known. */
8028 maybe_deduce_size_from_array_init (decl
, init
);
8029 init
= check_initializer (decl
, init
);
8031 GNU_xref_decl (current_function_decl
, decl
);
8033 if (TREE_CODE (decl
) == VAR_DECL
)
8034 layout_var_decl (decl
);
8036 /* Output the assembler code and/or RTL code for variables and functions,
8037 unless the type is an undefined structure or union.
8038 If not, it will get done when the type is completed. */
8039 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
8040 || TREE_CODE (decl
) == RESULT_DECL
)
8042 if (TREE_CODE (decl
) == VAR_DECL
)
8043 maybe_commonize_var (decl
);
8045 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
8047 if (TREE_CODE (type
) == FUNCTION_TYPE
8048 || TREE_CODE (type
) == METHOD_TYPE
)
8049 abstract_virtuals_error (decl
,
8050 strip_array_types (TREE_TYPE (type
)));
8052 abstract_virtuals_error (decl
, strip_array_types (type
));
8054 if (TREE_CODE (decl
) == FUNCTION_DECL
)
8056 else if (DECL_EXTERNAL (decl
)
8057 && ! (DECL_LANG_SPECIFIC (decl
)
8058 && DECL_NOT_REALLY_EXTERN (decl
)))
8061 DECL_INITIAL (decl
) = init
;
8063 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
8065 /* This is a local declaration. */
8066 if (doing_semantic_analysis_p ())
8067 maybe_inject_for_scope_var (decl
);
8068 /* Initialize the local variable. But, if we're building a
8069 statement-tree, we'll do the initialization when we
8071 if (processing_template_decl
)
8073 if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
8074 DECL_INITIAL (decl
) = init
;
8078 /* If we're not building RTL, then we need to do so
8080 my_friendly_assert (building_stmt_tree (), 20000906);
8081 /* Initialize the variable. */
8082 initialize_local_var (decl
, init
, flags
);
8083 /* Clean up the variable. */
8084 destroy_local_var (decl
);
8087 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
8089 /* Cleanups for static variables are handled by `finish_file'. */
8090 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
8091 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
8092 expand_static_init (decl
, init
);
8096 /* Undo call to `pushclass' that was done in `start_decl'
8097 due to initialization of qualified member variable.
8098 I.e., Foo::x = 10; */
8100 tree context
= CP_DECL_CONTEXT (decl
);
8103 && (TREE_CODE (decl
) == VAR_DECL
8104 /* We also have a pushclass done that we need to undo here
8105 if we're at top level and declare a method. */
8106 || TREE_CODE (decl
) == FUNCTION_DECL
)
8107 /* If size hasn't been set, we're still defining it,
8108 and therefore inside the class body; don't pop
8109 the binding level.. */
8110 && COMPLETE_TYPE_P (context
)
8111 && context
== current_class_type
)
8112 pop_nested_class ();
8119 TREE_READONLY (decl
) = 1;
8122 /* This is here for a midend callback from c-common.c */
8125 finish_decl (decl
, init
, asmspec_tree
)
8129 cp_finish_decl (decl
, init
, asmspec_tree
, 0);
8132 /* Returns a declaration for a VAR_DECL as if:
8134 extern "C" TYPE NAME;
8136 had been seen. Used to create compiler-generated global
8140 declare_global_var (name
, type
)
8146 push_to_top_level ();
8147 decl
= build_decl (VAR_DECL
, name
, type
);
8148 TREE_PUBLIC (decl
) = 1;
8149 DECL_EXTERNAL (decl
) = 1;
8150 DECL_ARTIFICIAL (decl
) = 1;
8152 cp_finish_decl (decl
, NULL_TREE
, NULL_TREE
, 0);
8153 pop_from_top_level ();
8158 /* Returns a pointer to the `atexit' function. Note that if
8159 FLAG_USE_CXA_ATEXIT is non-zero, then this will actually be the new
8160 `__cxa_atexit' function specified in the IA64 C++ ABI. */
8174 if (flag_use_cxa_atexit
)
8176 /* The declaration for `__cxa_atexit' is:
8178 int __cxa_atexit (void (*)(void *), void *, void *)
8180 We build up the argument types and then then function type
8183 /* First, build the pointer-to-function type for the first
8185 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8186 fn_type
= build_function_type (void_type_node
, arg_types
);
8187 fn_ptr_type
= build_pointer_type (fn_type
);
8188 /* Then, build the rest of the argument types. */
8189 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8190 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, arg_types
);
8191 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, arg_types
);
8192 /* And the final __cxa_atexit type. */
8193 fn_type
= build_function_type (integer_type_node
, arg_types
);
8194 fn_ptr_type
= build_pointer_type (fn_type
);
8195 name
= "__cxa_atexit";
8199 /* The declaration for `atexit' is:
8201 int atexit (void (*)());
8203 We build up the argument types and then then function type
8205 fn_type
= build_function_type (void_type_node
, void_list_node
);
8206 fn_ptr_type
= build_pointer_type (fn_type
);
8207 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, void_list_node
);
8208 /* Build the final atexit type. */
8209 fn_type
= build_function_type (integer_type_node
, arg_types
);
8213 /* Now, build the function declaration. */
8214 push_lang_context (lang_name_c
);
8215 atexit_fndecl
= build_library_fn_ptr (name
, fn_type
);
8216 mark_used (atexit_fndecl
);
8217 pop_lang_context ();
8218 atexit_node
= default_conversion (atexit_fndecl
);
8223 /* Returns the __dso_handle VAR_DECL. */
8226 get_dso_handle_node ()
8228 if (dso_handle_node
)
8229 return dso_handle_node
;
8231 /* Declare the variable. */
8232 dso_handle_node
= declare_global_var (get_identifier ("__dso_handle"),
8235 return dso_handle_node
;
8238 /* Begin a new function with internal linkage whose job will be simply
8239 to destroy some particular variable. */
8244 static int counter
= 0;
8245 int old_interface_unknown
= interface_unknown
;
8251 push_to_top_level ();
8253 /* No need to mangle this. */
8254 push_lang_context (lang_name_c
);
8256 interface_unknown
= 1;
8258 /* Build the parameter-types. */
8259 parmtypes
= void_list_node
;
8260 /* Functions passed to __cxa_atexit take an additional parameter.
8261 We'll just ignore it. After we implement the new calling
8262 convention for destructors, we can eliminate the use of
8263 additional cleanup functions entirely in the -fnew-abi case. */
8264 if (flag_use_cxa_atexit
)
8265 parmtypes
= tree_cons (NULL_TREE
, ptr_type_node
, parmtypes
);
8266 /* Build the function type itself. */
8267 fntype
= build_function_type (void_type_node
, parmtypes
);
8268 /* Build the name of the function. */
8269 sprintf (name
, "__tcf_%d", counter
++);
8270 /* Build the function declaration. */
8271 fndecl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), fntype
);
8272 /* It's a function with internal linkage, generated by the
8274 TREE_PUBLIC (fndecl
) = 0;
8275 DECL_ARTIFICIAL (fndecl
) = 1;
8276 /* Make the function `inline' so that it is only emitted if it is
8277 actually needed. It is unlikely that it will be inlined, since
8278 it is only called via a function pointer, but we avoid unncessary
8279 emissions this way. */
8280 DECL_INLINE (fndecl
) = 1;
8281 /* Build the parameter. */
8282 if (flag_use_cxa_atexit
)
8286 parmdecl
= build_decl (PARM_DECL
, NULL_TREE
, ptr_type_node
);
8287 DECL_CONTEXT (parmdecl
) = fndecl
;
8288 DECL_ARG_TYPE (parmdecl
) = ptr_type_node
;
8289 TREE_USED (parmdecl
) = 1;
8290 DECL_ARGUMENTS (fndecl
) = parmdecl
;
8294 start_function (/*specs=*/NULL_TREE
, fndecl
, NULL_TREE
, SF_PRE_PARSED
);
8297 interface_unknown
= old_interface_unknown
;
8299 pop_lang_context ();
8301 return current_function_decl
;
8304 /* Finish the cleanup function begun by start_cleanup_fn. */
8311 expand_body (finish_function (0));
8313 pop_from_top_level ();
8316 /* Generate code to handle the destruction of DECL, an object with
8317 static storage duration. */
8320 register_dtor_fn (decl
)
8328 int saved_flag_access_control
;
8330 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl
)))
8333 /* Call build_cleanup before we enter the anonymous function so that
8334 any access checks will be done relative to the current scope,
8335 rather than the scope of the anonymous function. */
8336 build_cleanup (decl
);
8338 /* Now start the function. */
8339 cleanup
= start_cleanup_fn ();
8341 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
8342 to the original function, rather than the anonymous one. That
8343 will make the back-end think that nested functions are in use,
8344 which causes confusion. */
8345 saved_flag_access_control
= flag_access_control
;
8346 flag_access_control
= 0;
8347 fcall
= build_cleanup (decl
);
8348 flag_access_control
= saved_flag_access_control
;
8350 /* Create the body of the anonymous function. */
8351 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
8352 finish_expr_stmt (fcall
);
8353 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
8356 /* Call atexit with the cleanup function. */
8357 mark_addressable (cleanup
);
8358 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
8359 if (flag_use_cxa_atexit
)
8361 args
= tree_cons (NULL_TREE
, get_dso_handle_node (), NULL_TREE
);
8362 args
= tree_cons (NULL_TREE
, null_pointer_node
, args
);
8363 args
= tree_cons (NULL_TREE
, cleanup
, args
);
8366 args
= tree_cons (NULL_TREE
, cleanup
, NULL_TREE
);
8367 finish_expr_stmt (build_function_call (get_atexit_node (), args
));
8371 expand_static_init (decl
, init
)
8375 tree oldstatic
= value_member (decl
, static_aggregates
);
8379 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
8380 cp_error ("multiple initializations given for `%D'", decl
);
8382 else if (! toplevel_bindings_p ())
8384 /* Emit code to perform this initialization but once. */
8391 /* Emit code to perform this initialization but once. This code
8394 static int guard = 0;
8396 // Do initialization.
8398 // Register variable for destruction at end of program.
8401 Note that the `temp' variable is only set to 1 *after* the
8402 initialization is complete. This ensures that an exception,
8403 thrown during the construction, will cause the variable to
8404 reinitialized when we pass through this code again, as per:
8408 If the initialization exits by throwing an exception, the
8409 initialization is not complete, so it will be tried again
8410 the next time control enters the declaration.
8412 In theory, this process should be thread-safe, too; multiple
8413 threads should not be able to initialize the variable more
8414 than once. We don't yet attempt to ensure thread-safety. */
8416 /* Create the guard variable. */
8417 guard
= get_guard (decl
);
8419 /* Begin the conditional initialization. */
8420 if_stmt
= begin_if_stmt ();
8421 finish_if_stmt_cond (get_guard_cond (guard
), if_stmt
);
8422 then_clause
= begin_compound_stmt (/*has_no_scope=*/0);
8424 /* Do the initialization itself. */
8425 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
8426 || (init
&& TREE_CODE (init
) == TREE_LIST
))
8427 assignment
= build_aggr_init (decl
, init
, 0);
8429 /* The initialization we're doing here is just a bitwise
8431 assignment
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
8433 assignment
= NULL_TREE
;
8435 /* Once the assignment is complete, set TEMP to 1. Since the
8436 construction of the static object is complete at this point,
8437 we want to make sure TEMP is set to 1 even if a temporary
8438 constructed during the initialization throws an exception
8439 when it is destroyed. So, we combine the initialization and
8440 the assignment to TEMP into a single expression, ensuring
8441 that when we call finish_expr_stmt the cleanups will not be
8442 run until after TEMP is set to 1. */
8443 guard_init
= set_guard (guard
);
8446 assignment
= tree_cons (NULL_TREE
, assignment
,
8447 build_tree_list (NULL_TREE
,
8449 assignment
= build_compound_expr (assignment
);
8452 assignment
= guard_init
;
8453 finish_expr_stmt (assignment
);
8455 /* Use atexit to register a function for destroying this static
8457 register_dtor_fn (decl
);
8459 finish_compound_stmt (/*has_no_scope=*/0, then_clause
);
8460 finish_then_clause (if_stmt
);
8464 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8467 /* Finish the declaration of a catch-parameter. */
8470 start_handler_parms (declspecs
, declarator
)
8477 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8479 if (decl
== NULL_TREE
)
8480 error ("invalid catch parameter");
8489 /* Make TYPE a complete type based on INITIAL_VALUE.
8490 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8491 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8494 complete_array_type (type
, initial_value
, do_default
)
8495 tree type
, initial_value
;
8498 register tree maxindex
= NULL_TREE
;
8503 /* An array of character type can be initialized from a
8504 brace-enclosed string constant. */
8505 if (char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (type
)))
8506 && TREE_CODE (initial_value
) == CONSTRUCTOR
8507 && CONSTRUCTOR_ELTS (initial_value
)
8508 && (TREE_CODE (TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
)))
8510 && TREE_CHAIN (CONSTRUCTOR_ELTS (initial_value
)) == NULL_TREE
)
8511 initial_value
= TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
));
8513 /* Note MAXINDEX is really the maximum index, one less than the
8515 if (TREE_CODE (initial_value
) == STRING_CST
)
8518 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8519 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8522 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8524 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8526 maxindex
= ssize_int (-1);
8527 for (; elts
; elts
= TREE_CHAIN (elts
))
8529 if (TREE_PURPOSE (elts
))
8530 maxindex
= TREE_PURPOSE (elts
);
8532 maxindex
= size_binop (PLUS_EXPR
, maxindex
, ssize_int (1));
8534 maxindex
= copy_node (maxindex
);
8538 /* Make an error message unless that happened already. */
8539 if (initial_value
!= error_mark_node
)
8542 initial_value
= NULL_TREE
;
8544 /* Prevent further error messages. */
8545 maxindex
= build_int_2 (0, 0);
8552 maxindex
= build_int_2 (0, 0);
8561 domain
= build_index_type (maxindex
);
8562 TYPE_DOMAIN (type
) = domain
;
8564 if (! TREE_TYPE (maxindex
))
8565 TREE_TYPE (maxindex
) = domain
;
8567 itype
= TREE_TYPE (initial_value
);
8570 if (itype
&& !TYPE_DOMAIN (itype
))
8571 TYPE_DOMAIN (itype
) = domain
;
8572 /* The type of the main variant should never be used for arrays
8573 of different sizes. It should only ever be completed with the
8574 size of the array. */
8575 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8576 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8579 /* Lay out the type now that we can get the real answer. */
8586 /* Return zero if something is declared to be a member of type
8587 CTYPE when in the context of CUR_TYPE. STRING is the error
8588 message to print in that case. Otherwise, quietly return 1. */
8591 member_function_or_else (ctype
, cur_type
, flags
)
8592 tree ctype
, cur_type
;
8593 enum overload_flags flags
;
8595 if (ctype
&& ctype
!= cur_type
)
8597 if (flags
== DTOR_FLAG
)
8598 cp_error ("destructor for alien class `%T' cannot be a member",
8601 cp_error ("constructor for alien class `%T' cannot be a member",
8608 /* Subroutine of `grokdeclarator'. */
8610 /* Generate errors possibly applicable for a given set of specifiers.
8611 This is for ARM $7.1.2. */
8614 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8617 int virtualp
, quals
, friendp
, raises
, inlinep
;
8620 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8622 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8624 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8627 cp_error_at ("`%D' declared as a friend", object
);
8629 cp_error_at ("`%D' declared with an exception specification", object
);
8632 /* CTYPE is class type, or null if non-class.
8633 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8635 DECLARATOR is the function's name.
8636 VIRTUALP is truthvalue of whether the function is virtual or not.
8637 FLAGS are to be passed through to `grokclassfn'.
8638 QUALS are qualifiers indicating whether the function is `const'
8640 RAISES is a list of exceptions that this function can raise.
8641 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8642 not look, and -1 if we should not call `grokclassfn' at all.
8644 Returns `NULL_TREE' if something goes wrong, after issuing
8645 applicable error messages. */
8648 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8649 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8650 template_count
, in_namespace
)
8653 tree orig_declarator
;
8655 enum overload_flags flags
;
8657 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8661 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8662 int has_default_arg
= 0;
8666 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8667 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8673 type
= build_exception_variant (type
, raises
);
8676 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8677 /* Propagate volatile out from type to decl. */
8678 if (TYPE_VOLATILE (type
))
8679 TREE_THIS_VOLATILE (decl
) = 1;
8681 /* If this decl has namespace scope, set that up. */
8683 set_decl_namespace (decl
, in_namespace
, friendp
);
8685 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8687 /* `main' and builtins have implicit 'C' linkage. */
8688 if ((MAIN_NAME_P (declarator
)
8689 || (IDENTIFIER_LENGTH (declarator
) > 10
8690 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8691 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8692 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8693 && current_lang_name
== lang_name_cplusplus
8694 && ctype
== NULL_TREE
8695 /* NULL_TREE means global namespace. */
8696 && DECL_CONTEXT (decl
) == NULL_TREE
)
8697 DECL_LANGUAGE (decl
) = lang_c
;
8699 /* Should probably propagate const out from type to decl I bet (mrs). */
8702 DECL_STATIC_FUNCTION_P (decl
) = 1;
8703 DECL_CONTEXT (decl
) = ctype
;
8707 DECL_CONTEXT (decl
) = ctype
;
8709 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8711 if (processing_template_decl
)
8712 error ("cannot declare `::main' to be a template");
8714 error ("cannot declare `::main' to be inline");
8716 error ("cannot declare `::main' to be static");
8717 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
8719 error ("`main' must return `int'");
8724 /* Members of anonymous types and local classes have no linkage; make
8726 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8727 || decl_function_context (TYPE_MAIN_DECL (ctype
))))
8732 /* [basic.link]: A name with no linkage (notably, the name of a class
8733 or enumeration declared in a local scope) shall not be used to
8734 declare an entity with linkage.
8736 Only check this for public decls for now. */
8737 t
= no_linkage_check (TREE_TYPE (decl
));
8740 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8742 if (DECL_EXTERN_C_P (decl
))
8743 /* Allow this; it's pretty common in C. */;
8745 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8749 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8754 TREE_PUBLIC (decl
) = publicp
;
8757 DECL_INTERFACE_KNOWN (decl
) = 1;
8758 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8762 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8764 DECL_EXTERNAL (decl
) = 1;
8765 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8767 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8768 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8772 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8773 grok_op_properties (decl
, virtualp
, check
< 0);
8775 if (ctype
&& decl_function_context (decl
))
8776 DECL_NO_STATIC_CHAIN (decl
) = 1;
8778 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8779 if (TREE_PURPOSE (t
)
8780 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8782 has_default_arg
= 1;
8787 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8791 ("defining explicit specialization `%D' in friend declaration",
8795 tree fns
= TREE_OPERAND (orig_declarator
, 0);
8796 tree args
= TREE_OPERAND (orig_declarator
, 1);
8798 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8800 /* Something like `template <class T> friend void f<T>()'. */
8801 cp_error ("invalid use of template-id `%D' in declaration of primary template",
8807 /* A friend declaration of the form friend void f<>(). Record
8808 the information in the TEMPLATE_ID_EXPR. */
8809 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8811 if (TREE_CODE (fns
) == COMPONENT_REF
)
8813 /* Due to bison parser ickiness, we will have already looked
8814 up an operator_name or PFUNCNAME within the current class
8815 (see template_id in parse.y). If the current class contains
8816 such a name, we'll get a COMPONENT_REF here. Undo that. */
8818 my_friendly_assert (TREE_TYPE (TREE_OPERAND (fns
, 0))
8819 == current_class_type
, 20001120);
8820 fns
= TREE_OPERAND (fns
, 1);
8822 my_friendly_assert (TREE_CODE (fns
) == IDENTIFIER_NODE
8823 || TREE_CODE (fns
) == LOOKUP_EXPR
8824 || TREE_CODE (fns
) == OVERLOAD
, 20001120);
8825 DECL_TEMPLATE_INFO (decl
) = tree_cons (fns
, args
, NULL_TREE
);
8827 if (has_default_arg
)
8829 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8836 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8843 if (has_default_arg
)
8844 add_defarg_fn (decl
);
8846 /* Plain overloading: will not be grok'd by grokclassfn. */
8847 if (! ctype
&& ! processing_template_decl
8848 && !DECL_EXTERN_C_P (decl
)
8849 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8850 set_mangled_name_for_decl (decl
);
8853 /* Make the init_value nonzero so pushdecl knows this is not
8854 tentative. error_mark_node is replaced later with the BLOCK. */
8855 DECL_INITIAL (decl
) = error_mark_node
;
8857 if (TYPE_NOTHROW_P (type
) || nothrow_libfn_p (decl
))
8858 TREE_NOTHROW (decl
) = 1;
8860 /* Caller will do the rest of this. */
8864 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8865 DECL_CONSTRUCTOR_P (decl
) = 1;
8867 /* Function gets the ugly name, field gets the nice one. This call
8868 may change the type of the function (because of default
8870 if (ctype
!= NULL_TREE
)
8871 grokclassfn (ctype
, decl
, flags
, quals
);
8873 decl
= check_explicit_specialization (orig_declarator
, decl
,
8875 2 * (funcdef_flag
!= 0) +
8876 4 * (friendp
!= 0));
8877 if (decl
== error_mark_node
)
8880 if (ctype
!= NULL_TREE
8881 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8886 old_decl
= check_classfn (ctype
, decl
);
8888 if (old_decl
&& TREE_CODE (old_decl
) == TEMPLATE_DECL
)
8889 /* Because grokfndecl is always supposed to return a
8890 FUNCTION_DECL, we pull out the DECL_TEMPLATE_RESULT
8891 here. We depend on our callers to figure out that its
8892 really a template that's being returned. */
8893 old_decl
= DECL_TEMPLATE_RESULT (old_decl
);
8895 if (old_decl
&& DECL_STATIC_FUNCTION_P (old_decl
)
8896 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8898 /* Remove the `this' parm added by grokclassfn.
8899 XXX Isn't this done in start_function, too? */
8900 revert_static_member_fn (decl
);
8901 last_function_parms
= TREE_CHAIN (last_function_parms
);
8903 if (old_decl
&& DECL_ARTIFICIAL (old_decl
))
8904 cp_error ("definition of implicitly-declared `%D'", old_decl
);
8908 /* Since we've smashed OLD_DECL to its
8909 DECL_TEMPLATE_RESULT, we must do the same to DECL. */
8910 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
8911 decl
= DECL_TEMPLATE_RESULT (decl
);
8913 /* Attempt to merge the declarations. This can fail, in
8914 the case of some illegal specialization declarations. */
8915 if (!duplicate_decls (decl
, old_decl
))
8916 cp_error ("no `%#D' member function declared in class `%T'",
8922 if (DECL_CONSTRUCTOR_P (decl
) && !grok_ctor_properties (ctype
, decl
))
8925 if (ctype
== NULL_TREE
|| check
)
8929 DECL_VIRTUAL_P (decl
) = 1;
8935 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
8938 RID_BIT_TYPE
*specbits_in
;
8944 RID_BIT_TYPE specbits
;
8946 specbits
= *specbits_in
;
8948 if (TREE_CODE (type
) == OFFSET_TYPE
)
8950 /* If you declare a static member so that it
8951 can be initialized, the code will reach here. */
8952 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
8953 type
= TREE_TYPE (type
);
8954 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8955 DECL_CONTEXT (decl
) = basetype
;
8956 /* DECL_ASSEMBLER_NAME is needed only for full-instantiated
8958 if (!uses_template_parms (decl
))
8961 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
8963 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
,
8972 context
= in_namespace
;
8973 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
8974 context
= current_namespace
;
8976 context
= NULL_TREE
;
8978 if (processing_template_decl
&& context
)
8979 /* For global variables, declared in a template, we need the
8981 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8983 decl
= build_decl (VAR_DECL
, declarator
, type
);
8986 set_decl_namespace (decl
, context
, 0);
8988 context
= DECL_CONTEXT (decl
);
8989 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
8992 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
8994 DECL_ASSEMBLER_NAME (decl
)
8995 = build_static_name (context
, declarator
);
9000 set_decl_namespace (decl
, in_namespace
, 0);
9002 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
9004 DECL_THIS_EXTERN (decl
) = 1;
9005 DECL_EXTERNAL (decl
) = !initialized
;
9008 /* In class context, static means one per class,
9009 public access, and static storage. */
9010 if (DECL_CLASS_SCOPE_P (decl
))
9012 TREE_PUBLIC (decl
) = 1;
9013 TREE_STATIC (decl
) = 1;
9014 DECL_EXTERNAL (decl
) = 0;
9016 /* At top level, either `static' or no s.c. makes a definition
9017 (perhaps tentative), and absence of `static' makes it public. */
9018 else if (toplevel_bindings_p ())
9020 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
9021 && (DECL_THIS_EXTERN (decl
) || ! constp
));
9022 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
9024 /* Not at top level, only `static' makes a static definition. */
9027 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
9028 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
9031 if (TREE_PUBLIC (decl
))
9033 /* [basic.link]: A name with no linkage (notably, the name of a class
9034 or enumeration declared in a local scope) shall not be used to
9035 declare an entity with linkage.
9037 Only check this for public decls for now. */
9038 tree t
= no_linkage_check (TREE_TYPE (decl
));
9041 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
9042 /* Ignore for now; `enum { foo } e' is pretty common. */;
9044 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
9052 /* Create and return a canonical pointer to member function type, for
9053 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
9056 build_ptrmemfunc_type (type
)
9062 tree unqualified_variant
= NULL_TREE
;
9064 if (type
== error_mark_node
)
9067 /* If a canonical type already exists for this type, use it. We use
9068 this method instead of type_hash_canon, because it only does a
9069 simple equality check on the list of field members. */
9071 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
9074 /* Make sure that we always have the unqualified pointer-to-member
9076 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9078 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
9080 t
= make_aggr_type (RECORD_TYPE
);
9081 /* Let the front-end know this is a pointer to member function... */
9082 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
9083 /* ... and not really an aggregate. */
9084 SET_IS_AGGR_TYPE (t
, 0);
9088 u
= make_aggr_type (UNION_TYPE
);
9089 SET_IS_AGGR_TYPE (u
, 0);
9090 fields
[0] = build_decl (FIELD_DECL
, pfn_identifier
, type
);
9091 fields
[1] = build_decl (FIELD_DECL
, delta2_identifier
,
9093 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9094 TYPE_NAME (u
) = NULL_TREE
;
9096 fields
[0] = build_decl (FIELD_DECL
, delta_identifier
,
9098 fields
[1] = build_decl (FIELD_DECL
, index_identifier
,
9100 fields
[2] = build_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
9101 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
9105 fields
[0] = build_decl (FIELD_DECL
, pfn_identifier
, type
);
9106 fields
[1] = build_decl (FIELD_DECL
, delta_identifier
,
9108 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9111 /* Zap out the name so that the back-end will give us the debugging
9112 information for this anonymous RECORD_TYPE. */
9113 TYPE_NAME (t
) = NULL_TREE
;
9115 /* If this is not the unqualified form of this pointer-to-member
9116 type, set the TYPE_MAIN_VARIANT for this type to be the
9117 unqualified type. Since they are actually RECORD_TYPEs that are
9118 not variants of each other, we must do this manually. */
9119 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9121 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
9122 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
9123 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
9124 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
9127 /* Cache this pointer-to-member type so that we can find it again
9129 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
9131 /* Seems to be wanted. */
9132 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
9137 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
9138 Check to see that the definition is valid. Issue appropriate error
9139 messages. Return 1 if the definition is particularly bad, or 0
9143 check_static_variable_definition (decl
, type
)
9147 /* Motion 10 at San Diego: If a static const integral data member is
9148 initialized with an integral constant expression, the initializer
9149 may appear either in the declaration (within the class), or in
9150 the definition, but not both. If it appears in the class, the
9151 member is a member constant. The file-scope definition is always
9153 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
9155 cp_error ("invalid in-class initialization of static data member of non-integral type `%T'",
9157 /* If we just return the declaration, crashes will sometimes
9158 occur. We therefore return void_type_node, as if this was a
9159 friend declaration, to cause callers to completely ignore
9160 this declaration. */
9163 else if (!CP_TYPE_CONST_P (type
))
9164 cp_error ("ISO C++ forbids in-class initialization of non-const static member `%D'",
9166 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
9167 cp_pedwarn ("ISO C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
9172 /* Given the SIZE (i.e., number of elements) in an array, compute an
9173 appropriate index type for the array. If non-NULL, NAME is the
9174 name of the thing being declared. */
9177 compute_array_index_type (name
, size
)
9183 /* The size might be the result of a cast. */
9184 STRIP_TYPE_NOPS (size
);
9186 /* It might be a const variable or enumeration constant. */
9187 size
= decl_constant_value (size
);
9189 /* If this involves a template parameter, it will be a constant at
9190 instantiation time, but we don't know what the value is yet.
9191 Even if no template parameters are involved, we may an expression
9192 that is not a constant; we don't even simplify `1 + 2' when
9193 processing a template. */
9194 if (processing_template_decl
)
9196 /* Resolve a qualified reference to an enumerator or static
9197 const data member of ours. */
9198 if (TREE_CODE (size
) == SCOPE_REF
9199 && TREE_OPERAND (size
, 0) == current_class_type
)
9201 tree t
= lookup_field (current_class_type
,
9202 TREE_OPERAND (size
, 1), 0, 0);
9207 return build_index_type (build_min (MINUS_EXPR
, sizetype
,
9208 size
, integer_one_node
));
9211 /* The array bound must be an integer type. */
9212 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9213 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
9214 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
9217 cp_error ("size of array `%D' has non-integer type", name
);
9219 cp_error ("size of array has non-integer type");
9220 size
= integer_one_node
;
9223 /* Normally, the array-bound will be a constant. */
9224 if (TREE_CODE (size
) == INTEGER_CST
)
9226 /* Check to see if the array bound overflowed. Make that an
9227 error, no matter how generous we're being. */
9228 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9229 int old_pedantic
= pedantic
;
9230 pedantic
= flag_pedantic_errors
= 1;
9231 constant_expression_warning (size
);
9232 pedantic
= old_pedantic
;
9233 flag_pedantic_errors
= old_flag_pedantic_errors
;
9235 /* An array must have a positive number of elements. */
9236 if (INT_CST_LT (size
, integer_zero_node
))
9239 cp_error ("size of array `%D' is negative", name
);
9241 cp_error ("size of array is negative");
9242 size
= integer_one_node
;
9244 /* Except that an extension we allow zero-sized arrays. We
9245 always allow them in system headers because glibc uses
9247 else if (integer_zerop (size
) && pedantic
&& !in_system_header
)
9250 cp_pedwarn ("ISO C++ forbids zero-size array `%D'", name
);
9252 cp_pedwarn ("ISO C++ forbids zero-size array");
9255 else if (TREE_CONSTANT (size
))
9257 /* `(int) &fn' is not a valid array bound. */
9259 cp_error ("size of array `%D' is not an integral constant-expression",
9262 cp_error ("size of array is not an integral constant-expression");
9265 /* Compute the index of the largest element in the array. It is
9266 one less than the number of elements in the array. */
9268 = fold (cp_build_binary_op (MINUS_EXPR
,
9269 cp_convert (ssizetype
, size
),
9270 cp_convert (ssizetype
,
9271 integer_one_node
)));
9273 /* Check for variable-sized arrays. We allow such things as an
9274 extension, even though they are not allowed in ANSI/ISO C++. */
9275 if (!TREE_CONSTANT (itype
))
9280 cp_pedwarn ("ISO C++ forbids variable-size array `%D'",
9283 cp_pedwarn ("ISO C++ forbids variable-size array");
9286 /* Create a variable-sized array index type. */
9287 itype
= variable_size (itype
);
9289 /* Make sure that there was no overflow when creating to a signed
9290 index type. (For example, on a 32-bit machine, an array with
9291 size 2^32 - 1 is too big.) */
9292 else if (TREE_OVERFLOW (itype
))
9294 error ("overflow in array dimension");
9295 TREE_OVERFLOW (itype
) = 0;
9298 /* Create and return the appropriate index type. */
9299 return build_index_type (itype
);
9302 /* Returns an ARRAY_TYPE for an array with SIZE elements of the
9303 indicated TYPE. If non-NULL, NAME is the NAME of the declaration
9307 create_array_type_for_decl (name
, type
, size
)
9312 tree itype
= NULL_TREE
;
9313 const char* error_msg
;
9315 /* If things have already gone awry, bail now. */
9316 if (type
== error_mark_node
|| size
== error_mark_node
)
9317 return error_mark_node
;
9319 /* Assume that everything will go OK. */
9322 /* There are some types which cannot be array elements. */
9323 switch (TREE_CODE (type
))
9326 error_msg
= "array of void";
9330 error_msg
= "array of functions";
9333 case REFERENCE_TYPE
:
9334 error_msg
= "array of references";
9338 error_msg
= "array of data members";
9342 error_msg
= "array of function members";
9349 /* If something went wrong, issue an error-message and return. */
9353 cp_error ("declaration of `%D' as %s", name
, error_msg
);
9355 cp_error ("creating %s", error_msg
);
9357 return error_mark_node
;
9362 The constant expressions that specify the bounds of the arrays
9363 can be omitted only for the first member of the sequence. */
9364 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9366 cp_error ("declaration of `%D' as multidimensional array must have bounds for all dimensions except the first",
9369 return error_mark_node
;
9372 /* Figure out the index type for the array. */
9374 itype
= compute_array_index_type (name
, size
);
9376 return build_cplus_array_type (type
, itype
);
9379 /* Check that it's OK to declare a function with the indicated TYPE.
9380 SFK indicates the kind of special function (if any) that this
9381 function is. CTYPE is the class of which this function is a
9382 member. OPTYPE is the type given in a conversion operator
9383 declaration. Returns the actual return type of the function; that
9384 may be different than TYPE if an error occurs, or for certain
9385 special functions. */
9388 check_special_function_return_type (sfk
, type
, ctype
, optype
)
9389 special_function_kind sfk
;
9396 case sfk_constructor
:
9398 cp_error ("return type specification for constructor invalid");
9400 /* In the old ABI, we return `this'; in the new ABI we don't
9402 type
= flag_new_abi
? void_type_node
: build_pointer_type (ctype
);
9405 case sfk_destructor
:
9407 cp_error ("return type specification for destructor invalid");
9408 type
= void_type_node
;
9411 case sfk_conversion
:
9412 if (type
&& !same_type_p (type
, optype
))
9413 cp_error ("operator `%T' declared to return `%T'", optype
, type
);
9415 cp_pedwarn ("return type specified for `operator %T'", optype
);
9420 my_friendly_abort (20000408);
9427 /* Given declspecs and a declarator,
9428 determine the name and type of the object declared
9429 and construct a ..._DECL node for it.
9430 (In one case we can return a ..._TYPE node instead.
9431 For invalid input we sometimes return 0.)
9433 DECLSPECS is a chain of tree_list nodes whose value fields
9434 are the storage classes and type specifiers.
9436 DECL_CONTEXT says which syntactic context this declaration is in:
9437 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
9438 FUNCDEF for a function definition. Like NORMAL but a few different
9439 error messages in each case. Return value may be zero meaning
9440 this definition is too screwy to try to parse.
9441 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
9442 handle member functions (which have FIELD context).
9443 Return value may be zero meaning this definition is too screwy to
9445 PARM for a parameter declaration (either within a function prototype
9446 or before a function body). Make a PARM_DECL, or return void_type_node.
9447 CATCHPARM for a parameter declaration before a catch clause.
9448 TYPENAME if for a typename (in a cast or sizeof).
9449 Don't make a DECL node; just return the ..._TYPE node.
9450 FIELD for a struct or union field; make a FIELD_DECL.
9451 BITFIELD for a field with specified width.
9452 INITIALIZED is 1 if the decl has an initializer.
9454 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
9455 normal attributes in TREE_PURPOSE, or NULL_TREE.
9457 In the TYPENAME case, DECLARATOR is really an abstract declarator.
9458 It may also be so in the PARM case, for a prototype where the
9459 argument type is specified but not the name.
9461 This function is where the complicated C meanings of `static'
9462 and `extern' are interpreted.
9464 For C++, if there is any monkey business to do, the function which
9465 calls this one must do it, i.e., prepending instance variables,
9466 renaming overloaded function names, etc.
9468 Note that for this C++, it is an error to define a method within a class
9469 which does not belong to that class.
9471 Except in the case where SCOPE_REFs are implicitly known (such as
9472 methods within a class being redundantly qualified),
9473 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
9474 (class_name::decl_name). The caller must also deal with this.
9476 If a constructor or destructor is seen, and the context is FIELD,
9477 then the type gains the attribute TREE_HAS_x. If such a declaration
9478 is erroneous, NULL_TREE is returned.
9480 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
9481 function, these are the qualifiers to give to the `this' pointer. We
9482 apply TYPE_QUAL_RESTRICT to the this ptr, not the object.
9484 May return void_type_node if the declarator turned out to be a friend.
9485 See grokfield for details. */
9488 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
9491 enum decl_context decl_context
;
9495 RID_BIT_TYPE specbits
;
9498 tree type
= NULL_TREE
;
9504 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
9505 int explicit_int
= 0;
9506 int explicit_char
= 0;
9507 int defaulted_int
= 0;
9508 tree typedef_decl
= NULL_TREE
;
9510 tree typedef_type
= NULL_TREE
;
9511 int funcdef_flag
= 0;
9512 enum tree_code innermost_code
= ERROR_MARK
;
9515 /* See the code below that used this. */
9516 tree decl_machine_attr
= NULL_TREE
;
9518 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
9519 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
9520 tree init
= NULL_TREE
;
9522 /* Keep track of what sort of function is being processed
9523 so that we can warn about default return values, or explicit
9524 return values which do not match prescribed defaults. */
9525 special_function_kind sfk
= sfk_none
;
9527 tree dname
= NULL_TREE
;
9528 tree ctype
= current_class_type
;
9529 tree ctor_return_type
= NULL_TREE
;
9530 enum overload_flags flags
= NO_SPECIAL
;
9531 tree quals
= NULL_TREE
;
9532 tree raises
= NULL_TREE
;
9533 int template_count
= 0;
9534 tree in_namespace
= NULL_TREE
;
9538 RIDBIT_RESET_ALL (specbits
);
9539 if (decl_context
== FUNCDEF
)
9540 funcdef_flag
= 1, decl_context
= NORMAL
;
9541 else if (decl_context
== MEMFUNCDEF
)
9542 funcdef_flag
= -1, decl_context
= FIELD
;
9543 else if (decl_context
== BITFIELD
)
9544 bitfield
= 1, decl_context
= FIELD
;
9546 /* Look inside a declarator for the name being declared
9547 and get it as a string, for an error message. */
9549 tree
*next
= &declarator
;
9553 while (next
&& *next
)
9556 switch (TREE_CODE (decl
))
9559 /* For attributes. */
9560 next
= &TREE_VALUE (decl
);
9565 next
= &TREE_OPERAND (decl
, 0);
9568 case BIT_NOT_EXPR
: /* For C++ destructors! */
9570 tree name
= TREE_OPERAND (decl
, 0);
9571 tree rename
= NULL_TREE
;
9573 my_friendly_assert (flags
== NO_SPECIAL
, 152);
9575 sfk
= sfk_destructor
;
9576 if (TREE_CODE (name
) == TYPE_DECL
)
9577 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
9578 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
9579 if (ctype
== NULL_TREE
)
9581 if (current_class_type
== NULL_TREE
)
9583 error ("destructors must be member functions");
9588 tree t
= constructor_name (current_class_name
);
9595 tree t
= constructor_name (ctype
);
9602 cp_error ("destructor `%T' must match class name `%T'",
9604 TREE_OPERAND (decl
, 0) = rename
;
9610 case ADDR_EXPR
: /* C++ reference declaration */
9615 innermost_code
= TREE_CODE (decl
);
9616 next
= &TREE_OPERAND (decl
, 0);
9620 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
9622 /* This is actually a variable declaration using
9623 constructor syntax. We need to call start_decl and
9624 cp_finish_decl so we can get the variable
9627 tree attributes
, prefix_attributes
;
9629 *next
= TREE_OPERAND (decl
, 0);
9630 init
= CALL_DECLARATOR_PARMS (decl
);
9634 attributes
= TREE_PURPOSE (attrlist
);
9635 prefix_attributes
= TREE_VALUE (attrlist
);
9639 attributes
= NULL_TREE
;
9640 prefix_attributes
= NULL_TREE
;
9643 decl
= start_decl (declarator
, declspecs
, 1,
9644 attributes
, prefix_attributes
);
9645 decl_type_access_control (decl
);
9648 /* Look for __unused__ attribute */
9649 if (TREE_USED (TREE_TYPE (decl
)))
9650 TREE_USED (decl
) = 1;
9651 finish_decl (decl
, init
, NULL_TREE
);
9654 cp_error ("invalid declarator");
9657 innermost_code
= TREE_CODE (decl
);
9658 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
9659 ctype
= current_class_type
;
9661 && TREE_OPERAND (decl
, 0)
9662 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
9663 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
9664 == constructor_name_full (ctype
))
9665 || (DECL_NAME (TREE_OPERAND (decl
, 0))
9666 == constructor_name (ctype
)))))
9667 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9668 next
= &TREE_OPERAND (decl
, 0);
9670 if (ctype
!= NULL_TREE
9671 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
9672 && decl
== constructor_name (ctype
))
9674 sfk
= sfk_constructor
;
9675 ctor_return_type
= ctype
;
9680 case TEMPLATE_ID_EXPR
:
9682 tree fns
= TREE_OPERAND (decl
, 0);
9684 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9685 fns
= TREE_OPERAND (fns
, 0);
9688 if (TREE_CODE (dname
) == COMPONENT_REF
)
9689 dname
= TREE_OPERAND (dname
, 1);
9690 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9692 my_friendly_assert (is_overloaded_fn (dname
),
9694 dname
= DECL_NAME (get_first_fn (dname
));
9699 case IDENTIFIER_NODE
:
9700 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9705 if (C_IS_RESERVED_WORD (dname
))
9707 cp_error ("declarator-id missing; using reserved word `%D'",
9709 name
= IDENTIFIER_POINTER (dname
);
9711 else if (!IDENTIFIER_TYPENAME_P (dname
))
9712 name
= IDENTIFIER_POINTER (dname
);
9715 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9716 flags
= TYPENAME_FLAG
;
9717 ctor_return_type
= TREE_TYPE (dname
);
9718 sfk
= sfk_conversion
;
9719 if (IDENTIFIER_GLOBAL_VALUE (dname
)
9720 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (dname
))
9722 name
= IDENTIFIER_POINTER (dname
);
9724 name
= "<invalid operator>";
9731 /* Perform error checking, and decide on a ctype. */
9732 tree cname
= TREE_OPERAND (decl
, 0);
9733 if (cname
== NULL_TREE
)
9735 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9738 in_namespace
= TREE_OPERAND (decl
, 0);
9739 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9741 else if (! is_aggr_type (cname
, 1))
9742 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9743 /* Must test TREE_OPERAND (decl, 1), in case user gives
9744 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9745 else if (TREE_OPERAND (decl
, 1)
9746 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9748 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9749 || TREE_CODE (cname
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
9751 cp_error ("`%T::%D' is not a valid declarator", cname
,
9752 TREE_OPERAND (decl
, 1));
9753 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9754 cname
, TREE_OPERAND (decl
, 1));
9755 return void_type_node
;
9757 else if (ctype
== NULL_TREE
)
9759 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9760 TREE_OPERAND (decl
, 0) = ctype
;
9763 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9765 cp_error ("type `%T' is not derived from type `%T'",
9767 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9773 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9774 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9775 == constructor_name_full (ctype
))
9776 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9777 == constructor_name (ctype
))))
9778 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9779 next
= &TREE_OPERAND (decl
, 1);
9783 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9784 && constructor_name (ctype
) == decl
)
9786 sfk
= sfk_constructor
;
9787 ctor_return_type
= ctype
;
9789 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9790 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9791 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9792 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9794 sfk
= sfk_destructor
;
9795 ctor_return_type
= ctype
;
9797 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9798 next
= &TREE_OPERAND (decl
, 0);
9809 /* Parse error puts this typespec where
9810 a declarator should go. */
9811 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9812 if (TREE_TYPE (decl
) == current_class_type
)
9813 cp_error (" perhaps you want `%T' for a constructor",
9814 current_class_name
);
9815 dname
= DECL_NAME (decl
);
9816 name
= IDENTIFIER_POINTER (dname
);
9818 /* Avoid giving two errors for this. */
9819 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9821 declspecs
= tree_cons (NULL_TREE
, integer_type_node
, declspecs
);
9827 cp_compiler_error ("`%D' as declarator", decl
);
9828 return 0; /* We used to do a 155 abort here. */
9833 /* A function definition's declarator must have the form of
9834 a function declarator. */
9836 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9839 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9840 && innermost_code
!= CALL_EXPR
9841 && ! (ctype
&& declspecs
== NULL_TREE
))
9843 cp_error ("declaration of `%D' as non-function", dname
);
9844 return void_type_node
;
9847 /* Anything declared one level down from the top level
9848 must be one of the parameters of a function
9849 (because the body is at least two levels down). */
9851 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9852 by not allowing C++ class definitions to specify their parameters
9853 with xdecls (must be spec.d in the parmlist).
9855 Since we now wait to push a class scope until we are sure that
9856 we are in a legitimate method context, we must set oldcname
9857 explicitly (since current_class_name is not yet alive).
9859 We also want to avoid calling this a PARM if it is in a namespace. */
9861 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
9863 struct binding_level
*b
= current_binding_level
;
9864 current_binding_level
= b
->level_chain
;
9865 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9866 decl_context
= PARM
;
9867 current_binding_level
= b
;
9871 name
= decl_context
== PARM
? "parameter" : "type name";
9873 /* Look through the decl specs and record which ones appear.
9874 Some typespecs are defined as built-in typenames.
9875 Others, the ones that are modifiers of other types,
9876 are represented by bits in SPECBITS: set the bits for
9877 the modifiers that appear. Storage class keywords are also in SPECBITS.
9879 If there is a typedef name or a type, store the type in TYPE.
9880 This includes builtin typedefs such as `int'.
9882 Set EXPLICIT_INT if the type is `int' or `char' and did not
9883 come from a user typedef.
9885 Set LONGLONG if `long' is mentioned twice.
9887 For C++, constructors and destructors have their own fast treatment. */
9889 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
9894 /* Certain parse errors slip through. For example,
9895 `int class;' is not caught by the parser. Try
9896 weakly to recover here. */
9897 if (TREE_CODE (spec
) != TREE_LIST
)
9900 id
= TREE_VALUE (spec
);
9902 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9904 if (id
== ridpointers
[(int) RID_INT
]
9905 || id
== ridpointers
[(int) RID_CHAR
]
9906 || id
== ridpointers
[(int) RID_BOOL
]
9907 || id
== ridpointers
[(int) RID_WCHAR
])
9911 if (id
== ridpointers
[(int) RID_BOOL
])
9912 error ("`bool' is now a keyword");
9914 cp_error ("extraneous `%T' ignored", id
);
9918 if (id
== ridpointers
[(int) RID_INT
])
9920 else if (id
== ridpointers
[(int) RID_CHAR
])
9922 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
9926 /* C++ aggregate types. */
9927 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
9930 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
9932 type
= IDENTIFIER_TYPE_VALUE (id
);
9936 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
9938 if (ridpointers
[i
] == id
)
9940 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
9942 if (pedantic
&& ! in_system_header
&& warn_long_long
)
9943 pedwarn ("ISO C++ does not support `long long'");
9945 error ("`long long long' is too long for GCC");
9949 else if (RIDBIT_SETP (i
, specbits
))
9950 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
9951 RIDBIT_SET (i
, specbits
);
9956 /* C++ aggregate types. */
9957 else if (TREE_CODE (id
) == TYPE_DECL
)
9960 cp_error ("multiple declarations `%T' and `%T'", type
,
9964 type
= TREE_TYPE (id
);
9965 TREE_VALUE (spec
) = type
;
9970 error ("two or more data types in declaration of `%s'", name
);
9971 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9973 register tree t
= lookup_name (id
, 1);
9974 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
9975 error ("`%s' fails to be a typedef or built in type",
9976 IDENTIFIER_POINTER (id
));
9979 type
= TREE_TYPE (t
);
9981 /* See the code below that used this. */
9982 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
9987 else if (id
!= error_mark_node
)
9988 /* Can't change CLASS nodes into RECORD nodes here! */
9994 typedef_type
= type
;
9996 /* No type at all: default to `int', and set DEFAULTED_INT
9997 because it was not a user-defined typedef. */
9999 if (type
== NULL_TREE
10000 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
10001 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10002 || RIDBIT_SETP (RID_LONG
, specbits
)
10003 || RIDBIT_SETP (RID_SHORT
, specbits
)))
10005 /* These imply 'int'. */
10006 type
= integer_type_node
;
10010 if (sfk
!= sfk_none
)
10011 type
= check_special_function_return_type (sfk
, type
,
10014 else if (type
== NULL_TREE
)
10020 /* We handle `main' specially here, because 'main () { }' is so
10021 common. With no options, it is allowed. With -Wreturn-type,
10022 it is a warning. It is only an error with -pedantic-errors. */
10023 is_main
= (funcdef_flag
10024 && MAIN_NAME_P (dname
)
10025 && ctype
== NULL_TREE
10026 && in_namespace
== NULL_TREE
10027 && current_namespace
== global_namespace
);
10029 if (in_system_header
|| flag_ms_extensions
)
10030 /* Allow it, sigh. */;
10031 else if (pedantic
|| ! is_main
)
10032 cp_pedwarn ("ISO C++ forbids declaration of `%s' with no type",
10034 else if (warn_return_type
)
10035 cp_warning ("ISO C++ forbids declaration of `%s' with no type",
10038 type
= integer_type_node
;
10043 /* Now process the modifiers that were specified
10044 and check for invalid combinations. */
10046 /* Long double is a special combination. */
10048 if (RIDBIT_SETP (RID_LONG
, specbits
)
10049 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
10051 RIDBIT_RESET (RID_LONG
, specbits
);
10052 type
= build_qualified_type (long_double_type_node
,
10053 CP_TYPE_QUALS (type
));
10056 /* Check all other uses of type modifiers. */
10058 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10059 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10060 || RIDBIT_SETP (RID_LONG
, specbits
)
10061 || RIDBIT_SETP (RID_SHORT
, specbits
))
10065 if (TREE_CODE (type
) == REAL_TYPE
)
10066 error ("short, signed or unsigned invalid for `%s'", name
);
10067 else if (TREE_CODE (type
) != INTEGER_TYPE
)
10068 error ("long, short, signed or unsigned invalid for `%s'", name
);
10069 else if (RIDBIT_SETP (RID_LONG
, specbits
)
10070 && RIDBIT_SETP (RID_SHORT
, specbits
))
10071 error ("long and short specified together for `%s'", name
);
10072 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10073 || RIDBIT_SETP (RID_SHORT
, specbits
))
10075 error ("long or short specified with char for `%s'", name
);
10076 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10077 || RIDBIT_SETP (RID_SHORT
, specbits
))
10078 && TREE_CODE (type
) == REAL_TYPE
)
10079 error ("long or short specified with floating type for `%s'", name
);
10080 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10081 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
10082 error ("signed and unsigned given together for `%s'", name
);
10086 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
10088 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
10090 if (flag_pedantic_errors
)
10095 /* Discard the type modifiers if they are invalid. */
10098 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
10099 RIDBIT_RESET (RID_SIGNED
, specbits
);
10100 RIDBIT_RESET (RID_LONG
, specbits
);
10101 RIDBIT_RESET (RID_SHORT
, specbits
);
10106 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
10107 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
10109 error ("complex invalid for `%s'", name
);
10110 RIDBIT_RESET (RID_COMPLEX
, specbits
);
10113 /* Decide whether an integer type is signed or not.
10114 Optionally treat bitfields as signed by default. */
10115 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10118 It is implementation-defined whether a plain (neither
10119 explicitly signed or unsigned) char, short, int, or long
10120 bit-field is signed or unsigned.
10122 Naturally, we extend this to long long as well. Note that
10123 this does not include wchar_t. */
10124 || (bitfield
&& !flag_signed_bitfields
10125 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
10126 /* A typedef for plain `int' without `signed' can be
10127 controlled just like plain `int', but a typedef for
10128 `signed int' cannot be so controlled. */
10130 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
10131 && (TREE_CODE (type
) == INTEGER_TYPE
10132 || TREE_CODE (type
) == CHAR_TYPE
)
10133 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
10136 type
= long_long_unsigned_type_node
;
10137 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10138 type
= long_unsigned_type_node
;
10139 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10140 type
= short_unsigned_type_node
;
10141 else if (type
== char_type_node
)
10142 type
= unsigned_char_type_node
;
10143 else if (typedef_decl
)
10144 type
= unsigned_type (type
);
10146 type
= unsigned_type_node
;
10148 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10149 && type
== char_type_node
)
10150 type
= signed_char_type_node
;
10152 type
= long_long_integer_type_node
;
10153 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10154 type
= long_integer_type_node
;
10155 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10156 type
= short_integer_type_node
;
10158 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
10160 /* If we just have "complex", it is equivalent to
10161 "complex double", but if any modifiers at all are specified it is
10162 the complex form of TYPE. E.g, "complex short" is
10163 "complex short int". */
10165 if (defaulted_int
&& ! longlong
10166 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
10167 || RIDBIT_SETP (RID_SHORT
, specbits
)
10168 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10169 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
10170 type
= complex_double_type_node
;
10171 else if (type
== integer_type_node
)
10172 type
= complex_integer_type_node
;
10173 else if (type
== float_type_node
)
10174 type
= complex_float_type_node
;
10175 else if (type
== double_type_node
)
10176 type
= complex_double_type_node
;
10177 else if (type
== long_double_type_node
)
10178 type
= complex_long_double_type_node
;
10180 type
= build_complex_type (type
);
10183 if (sfk
== sfk_conversion
10184 && (RIDBIT_SETP (RID_CONST
, specbits
)
10185 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
10186 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
10187 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
10190 /* Set CONSTP if this declaration is `const', whether by
10191 explicit specification or via a typedef.
10192 Likewise for VOLATILEP. */
10194 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
10196 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
10198 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
10199 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10200 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10201 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10202 type
= cp_build_qualified_type (type
, type_quals
);
10204 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
10205 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
10206 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
10207 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
10208 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
10210 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10211 staticp
= 1 + (decl_context
== FIELD
);
10213 if (virtualp
&& staticp
== 2)
10215 cp_error ("member `%D' cannot be declared both virtual and static",
10219 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
10220 RIDBIT_RESET (RID_FRIEND
, specbits
);
10222 /* Warn if two storage classes are given. Default to `auto'. */
10224 if (RIDBIT_ANY_SET (specbits
))
10226 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
10227 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
10228 if (decl_context
== PARM
&& nclasses
> 0)
10229 error ("storage class specifiers invalid in parameter declarations");
10230 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10232 if (decl_context
== PARM
)
10233 error ("typedef declaration invalid in parameter declaration");
10236 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
10237 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
10240 /* Give error if `virtual' is used outside of class declaration. */
10242 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
10244 error ("virtual outside class declaration");
10248 /* Static anonymous unions are dealt with here. */
10249 if (staticp
&& decl_context
== TYPENAME
10250 && TREE_CODE (declspecs
) == TREE_LIST
10251 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
10252 decl_context
= FIELD
;
10254 /* Warn about storage classes that are invalid for certain
10255 kinds of declarations (parameters, typenames, etc.). */
10258 error ("multiple storage classes in declaration of `%s'", name
);
10259 else if (decl_context
!= NORMAL
&& nclasses
> 0)
10261 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
10262 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
10263 || RIDBIT_SETP (RID_AUTO
, specbits
)))
10265 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10267 else if (decl_context
== FIELD
10268 /* C++ allows static class elements */
10269 && RIDBIT_SETP (RID_STATIC
, specbits
))
10270 /* C++ also allows inlines and signed and unsigned elements,
10271 but in those cases we don't come in here. */
10275 if (decl_context
== FIELD
)
10277 tree tmp
= NULL_TREE
;
10278 register int op
= 0;
10282 /* Avoid trying to get an operand off an identifier node. */
10283 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10286 tmp
= TREE_OPERAND (declarator
, 0);
10287 op
= IDENTIFIER_OPNAME_P (tmp
);
10288 if (IDENTIFIER_TYPENAME_P (tmp
))
10290 if (IDENTIFIER_GLOBAL_VALUE (tmp
)
10291 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (tmp
))
10293 name
= IDENTIFIER_POINTER (tmp
);
10295 name
= "<invalid operator>";
10298 error ("storage class specified for %s `%s'",
10299 op
? "member operator" : "field",
10304 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10305 error ("storage class specified for parameter `%s'", name
);
10307 error ("storage class specified for typename");
10309 RIDBIT_RESET (RID_REGISTER
, specbits
);
10310 RIDBIT_RESET (RID_AUTO
, specbits
);
10311 RIDBIT_RESET (RID_EXTERN
, specbits
);
10314 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
10316 if (toplevel_bindings_p ())
10318 /* It's common practice (and completely valid) to have a const
10319 be initialized and declared extern. */
10320 if (!(type_quals
& TYPE_QUAL_CONST
))
10321 warning ("`%s' initialized and declared `extern'", name
);
10324 error ("`%s' has both `extern' and initializer", name
);
10326 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
10327 && ! toplevel_bindings_p ())
10328 error ("nested function `%s' declared `extern'", name
);
10329 else if (toplevel_bindings_p ())
10331 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10332 error ("top-level declaration of `%s' specifies `auto'", name
);
10335 if (nclasses
> 0 && friendp
)
10336 error ("storage class specifiers invalid in friend function declarations");
10338 /* Now figure out the structure of the declarator proper.
10339 Descend through it, creating more complex types, until we reach
10340 the declared identifier (or NULL_TREE, in an absolute declarator). */
10342 inner_attrs
= NULL_TREE
;
10345 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
10346 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
10348 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
10349 an INDIRECT_REF (for *...),
10350 a CALL_EXPR (for ...(...)),
10351 an identifier (for the name being declared)
10352 or a null pointer (for the place in an absolute declarator
10353 where the name was omitted).
10354 For the last two cases, we have just exited the loop.
10356 For C++ it could also be
10357 a SCOPE_REF (for class :: ...). In this case, we have converted
10358 sensible names to types, and those are the values we use to
10359 qualify the member name.
10360 an ADDR_EXPR (for &...),
10361 a BIT_NOT_EXPR (for destructors)
10363 At this point, TYPE is the type of elements of an array,
10364 or for a function to return, or for a pointer to point to.
10365 After this sequence of ifs, TYPE is the type of the
10366 array or function or pointer, and DECLARATOR has had its
10367 outermost layer removed. */
10369 if (type
== error_mark_node
)
10371 if (TREE_CODE (declarator
) == SCOPE_REF
)
10372 declarator
= TREE_OPERAND (declarator
, 1);
10374 declarator
= TREE_OPERAND (declarator
, 0);
10377 if (quals
!= NULL_TREE
10378 && (declarator
== NULL_TREE
10379 || TREE_CODE (declarator
) != SCOPE_REF
))
10381 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
10382 ctype
= TYPE_METHOD_BASETYPE (type
);
10383 if (ctype
!= NULL_TREE
)
10385 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
10386 grok_method_quals (ctype
, dummy
, quals
);
10387 type
= TREE_TYPE (dummy
);
10388 ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
)));
10393 /* See the comment for the TREE_LIST case, below. */
10396 else if (inner_attrs
)
10398 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10399 inner_attrs
= NULL_TREE
;
10402 switch (TREE_CODE (declarator
))
10406 /* We encode a declarator with embedded attributes using
10407 a TREE_LIST. The attributes apply to the declarator
10408 directly inside them, so we have to skip an iteration
10409 before applying them to the type. If the declarator just
10410 inside is the declarator-id, we apply the attrs to the
10412 inner_attrs
= TREE_PURPOSE (declarator
);
10414 declarator
= TREE_VALUE (declarator
);
10420 register tree size
;
10422 size
= TREE_OPERAND (declarator
, 1);
10424 /* VC++ spells a zero-sized array with []. */
10425 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
10426 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10427 size
= integer_zero_node
;
10429 declarator
= TREE_OPERAND (declarator
, 0);
10431 type
= create_array_type_for_decl (dname
, type
, size
);
10433 /* VLAs never work as fields. */
10434 if (decl_context
== FIELD
&& !processing_template_decl
10435 && TREE_CODE (type
) == ARRAY_TYPE
10436 && TYPE_DOMAIN (type
) != NULL_TREE
10437 && !TREE_CONSTANT (TYPE_MAX_VALUE (TYPE_DOMAIN (type
))))
10439 cp_error ("size of member `%D' is not constant", dname
);
10440 /* Proceed with arbitrary constant size, so that offset
10441 computations don't get confused. */
10442 type
= create_array_type_for_decl (dname
, TREE_TYPE (type
),
10454 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
10455 tree inner_decl
= TREE_OPERAND (declarator
, 0);
10457 /* Declaring a function type.
10458 Make sure we have a valid type for the function to return. */
10460 /* We now know that the TYPE_QUALS don't apply to the
10461 decl, but to its return type. */
10462 type_quals
= TYPE_UNQUALIFIED
;
10464 /* Warn about some types functions can't return. */
10466 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10468 error ("`%s' declared as function returning a function", name
);
10469 type
= integer_type_node
;
10471 if (TREE_CODE (type
) == ARRAY_TYPE
)
10473 error ("`%s' declared as function returning an array", name
);
10474 type
= integer_type_node
;
10477 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
10478 inner_decl
= TREE_OPERAND (inner_decl
, 1);
10480 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
10481 inner_decl
= dname
;
10483 /* Pick up type qualifiers which should be applied to `this'. */
10484 quals
= CALL_DECLARATOR_QUALS (declarator
);
10486 /* Pick up the exception specifications. */
10487 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
10489 /* Say it's a definition only for the CALL_EXPR
10490 closest to the identifier. */
10493 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
10494 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
10495 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
10497 if (ctype
== NULL_TREE
10498 && decl_context
== FIELD
10500 && (friendp
== 0 || dname
== current_class_name
))
10501 ctype
= current_class_type
;
10503 if (ctype
&& sfk
== sfk_conversion
)
10504 TYPE_HAS_CONVERSION (ctype
) = 1;
10505 if (ctype
&& constructor_name (ctype
) == dname
)
10507 /* We are within a class's scope. If our declarator name
10508 is the same as the class name, and we are defining
10509 a function, then it is a constructor/destructor, and
10510 therefore returns a void type. */
10512 if (flags
== DTOR_FLAG
)
10514 /* ISO C++ 12.4/2. A destructor may not be
10515 declared const or volatile. A destructor may
10518 error ("destructor cannot be static member function");
10521 cp_error ("destructors may not be `%s'",
10522 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10525 if (decl_context
== FIELD
)
10527 if (! member_function_or_else (ctype
,
10528 current_class_type
,
10530 return void_type_node
;
10533 else /* It's a constructor. */
10535 if (explicitp
== 1)
10537 /* ISO C++ 12.1. A constructor may not be
10538 declared const or volatile. A constructor may
10539 not be virtual. A constructor may not be
10542 error ("constructor cannot be static member function");
10545 pedwarn ("constructors cannot be declared virtual");
10550 cp_error ("constructors may not be `%s'",
10551 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10555 RID_BIT_TYPE tmp_bits
;
10556 memcpy (&tmp_bits
, &specbits
, sizeof (RID_BIT_TYPE
));
10557 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10558 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10559 if (RIDBIT_ANY_SET (tmp_bits
))
10560 error ("return value type specifier for constructor ignored");
10562 if (decl_context
== FIELD
)
10564 if (! member_function_or_else (ctype
,
10565 current_class_type
,
10567 return void_type_node
;
10568 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10569 if (sfk
!= sfk_constructor
)
10573 if (decl_context
== FIELD
)
10579 error ("can't initialize friend function `%s'", name
);
10582 /* Cannot be both friend and virtual. */
10583 error ("virtual functions cannot be friends");
10584 RIDBIT_RESET (RID_FRIEND
, specbits
);
10587 if (decl_context
== NORMAL
)
10588 error ("friend declaration not in class definition");
10589 if (current_function_decl
&& funcdef_flag
)
10590 cp_error ("can't define friend function `%s' in a local class definition",
10594 /* Construct the function type and go to the next
10595 inner layer of declarator. */
10597 declarator
= TREE_OPERAND (declarator
, 0);
10599 /* FIXME: This is where default args should be fully
10602 arg_types
= grokparms (inner_parms
);
10604 if (declarator
&& flags
== DTOR_FLAG
)
10606 /* A destructor declared in the body of a class will
10607 be represented as a BIT_NOT_EXPR. But, we just
10608 want the underlying IDENTIFIER. */
10609 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10610 declarator
= TREE_OPERAND (declarator
, 0);
10612 if (arg_types
!= void_list_node
)
10614 cp_error ("destructors may not have parameters");
10615 arg_types
= void_list_node
;
10616 last_function_parms
= NULL_TREE
;
10620 /* ANSI says that `const int foo ();'
10621 does not make the function foo const. */
10622 type
= build_function_type (type
, arg_types
);
10626 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10627 if (TREE_PURPOSE (t
)
10628 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10630 add_defarg_fn (type
);
10639 /* Filter out pointers-to-references and references-to-references.
10640 We can get these if a TYPE_DECL is used. */
10642 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10644 error ("cannot declare %s to references",
10645 TREE_CODE (declarator
) == ADDR_EXPR
10646 ? "references" : "pointers");
10647 declarator
= TREE_OPERAND (declarator
, 0);
10651 if (TREE_CODE (type
) == OFFSET_TYPE
10652 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10653 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10655 cp_error ("cannot declare pointer to `%#T' member",
10657 type
= TREE_TYPE (type
);
10660 /* Merge any constancy or volatility into the target type
10661 for the pointer. */
10663 /* We now know that the TYPE_QUALS don't apply to the decl,
10664 but to the target of the pointer. */
10665 type_quals
= TYPE_UNQUALIFIED
;
10667 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10669 if (TREE_CODE (type
) == VOID_TYPE
)
10670 error ("invalid type: `void &'");
10672 type
= build_reference_type (type
);
10674 else if (TREE_CODE (type
) == METHOD_TYPE
)
10675 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10677 type
= build_pointer_type (type
);
10679 /* Process a list of type modifier keywords (such as
10680 const or volatile) that were given inside the `*' or `&'. */
10682 if (TREE_TYPE (declarator
))
10684 register tree typemodlist
;
10690 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10691 typemodlist
= TREE_CHAIN (typemodlist
))
10693 tree qualifier
= TREE_VALUE (typemodlist
);
10695 if (qualifier
== ridpointers
[(int) RID_CONST
])
10697 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10699 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10704 error ("invalid type modifier within pointer declarator");
10708 pedwarn ("duplicate `const'");
10710 pedwarn ("duplicate `volatile'");
10712 pedwarn ("duplicate `restrict'");
10714 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10715 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10716 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10717 if (TREE_CODE (declarator
) == ADDR_EXPR
10718 && (constp
|| volatilep
))
10721 pedwarn ("discarding `const' applied to a reference");
10723 pedwarn ("discarding `volatile' applied to a reference");
10724 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10726 type
= cp_build_qualified_type (type
, type_quals
);
10728 declarator
= TREE_OPERAND (declarator
, 0);
10734 /* We have converted type names to NULL_TREE if the
10735 name was bogus, or to a _TYPE node, if not.
10737 The variable CTYPE holds the type we will ultimately
10738 resolve to. The code here just needs to build
10739 up appropriate member types. */
10740 tree sname
= TREE_OPERAND (declarator
, 1);
10743 /* Destructors can have their visibilities changed as well. */
10744 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10745 sname
= TREE_OPERAND (sname
, 0);
10747 if (TREE_COMPLEXITY (declarator
) == 0)
10748 /* This needs to be here, in case we are called
10749 multiple times. */ ;
10750 else if (TREE_COMPLEXITY (declarator
) == -1)
10751 /* Namespace member. */
10752 pop_decl_namespace ();
10753 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10754 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10755 else if (! IS_AGGR_TYPE_CODE
10756 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10758 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10760 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10761 that refer to ctype. They couldn't be resolved earlier
10762 because we hadn't pushed into the class yet.
10763 Example: resolve 'B<T>::type' in
10764 'B<typename B<T>::type> B<T>::f () { }'. */
10765 if (current_template_parms
10766 && uses_template_parms (type
)
10767 && uses_template_parms (current_class_type
))
10769 tree args
= current_template_args ();
10770 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10773 /* This pop_nested_class corresponds to the
10774 push_nested_class used to push into class scope for
10775 parsing the argument list of a function decl, in
10777 pop_nested_class ();
10778 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10781 my_friendly_abort (16);
10783 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10785 /* We had a reference to a global decl, or
10786 perhaps we were given a non-aggregate typedef,
10787 in which case we cleared this out, and should just
10788 keep going as though it wasn't there. */
10789 declarator
= sname
;
10792 ctype
= TREE_OPERAND (declarator
, 0);
10795 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10797 /* You're supposed to have one `template <...>'
10798 for every template class, but you don't need one
10799 for a full specialization. For example:
10801 template <class T> struct S{};
10802 template <> struct S<int> { void f(); };
10803 void S<int>::f () {}
10805 is correct; there shouldn't be a `template <>' for
10806 the definition of `S<int>::f'. */
10807 if (CLASSTYPE_TEMPLATE_INFO (t
)
10808 && (CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
10809 || uses_template_parms (CLASSTYPE_TI_ARGS (t
))))
10810 template_count
+= 1;
10812 t
= TYPE_MAIN_DECL (t
);
10813 if (DECL_LANG_SPECIFIC (t
))
10814 t
= DECL_CONTEXT (t
);
10819 if (sname
== NULL_TREE
)
10822 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10824 /* This is the `standard' use of the scoping operator:
10825 basetype :: member . */
10827 if (ctype
== current_class_type
)
10833 Is this ill-formed? */
10836 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10839 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10841 if (current_class_type
== NULL_TREE
|| friendp
)
10842 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10843 TYPE_ARG_TYPES (type
));
10846 cp_error ("cannot declare member function `%T::%s' within `%T'",
10847 ctype
, name
, current_class_type
);
10848 return void_type_node
;
10851 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10852 || COMPLETE_TYPE_P (complete_type (ctype
)))
10854 /* Have to move this code elsewhere in this function.
10855 this code is used for i.e., typedef int A::M; M *pm;
10857 It is? How? jason 10/2/94 */
10859 if (current_class_type
)
10861 cp_error ("cannot declare member `%T::%s' within `%T'",
10862 ctype
, name
, current_class_type
);
10863 return void_type_node
;
10865 type
= build_offset_type (ctype
, type
);
10869 incomplete_type_error (NULL_TREE
, ctype
);
10870 return error_mark_node
;
10873 declarator
= sname
;
10875 else if (TREE_CODE (sname
) == SCOPE_REF
)
10876 my_friendly_abort (17);
10880 declarator
= TREE_OPERAND (declarator
, 1);
10881 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10882 /* In this case, we will deal with it later. */
10886 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10887 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10888 TYPE_ARG_TYPES (type
));
10890 type
= build_offset_type (ctype
, type
);
10897 declarator
= TREE_OPERAND (declarator
, 0);
10902 case ENUMERAL_TYPE
:
10903 declarator
= NULL_TREE
;
10907 declarator
= NULL_TREE
;
10911 my_friendly_abort (158);
10915 /* See the comment for the TREE_LIST case, above. */
10918 if (! ignore_attrs
)
10919 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10921 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
10923 attrlist
= build_tree_list (NULL_TREE
, inner_attrs
);
10926 /* Now TYPE has the actual type. */
10928 if (explicitp
== 1 || (explicitp
&& friendp
))
10930 /* [dcl.fct.spec] The explicit specifier shall only be used in
10931 declarations of constructors within a class definition. */
10932 error ("only declarations of constructors can be `explicit'");
10936 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10938 if (current_class_name
== NULL_TREE
|| decl_context
== PARM
|| friendp
)
10940 error ("non-member `%s' cannot be declared `mutable'", name
);
10941 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10943 else if (decl_context
== TYPENAME
|| RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10945 error ("non-object member `%s' cannot be declared `mutable'", name
);
10946 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10948 else if (TREE_CODE (type
) == FUNCTION_TYPE
10949 || TREE_CODE (type
) == METHOD_TYPE
)
10951 error ("function `%s' cannot be declared `mutable'", name
);
10952 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10956 error ("static `%s' cannot be declared `mutable'", name
);
10957 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10959 else if (type_quals
& TYPE_QUAL_CONST
)
10961 error ("const `%s' cannot be declared `mutable'", name
);
10962 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10966 if (declarator
== NULL_TREE
10967 || TREE_CODE (declarator
) == IDENTIFIER_NODE
10968 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
10969 && (TREE_CODE (type
) == FUNCTION_TYPE
10970 || TREE_CODE (type
) == METHOD_TYPE
)))
10972 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10974 cp_error ("template-id `%D' used as a declarator", declarator
);
10975 declarator
= dname
;
10978 /* Unexpected declarator format. */
10979 my_friendly_abort (990210);
10981 /* If this is declaring a typedef name, return a TYPE_DECL. */
10983 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
10987 /* Note that the grammar rejects storage classes
10988 in typenames, fields or parameters. */
10989 if (current_lang_name
== lang_name_java
)
10990 TYPE_FOR_JAVA (type
) = 1;
10992 if (decl_context
== FIELD
)
10994 if (declarator
== constructor_name (current_class_type
))
10995 cp_pedwarn ("ISO C++ forbids nested type `%D' with same name as enclosing class",
10997 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
11000 decl
= build_decl (TYPE_DECL
, declarator
, type
);
11002 /* If the user declares "typedef struct {...} foo" then the
11003 struct will have an anonymous name. Fill that name in now.
11004 Nothing can refer to it, so nothing needs know about the name
11006 if (type
!= error_mark_node
11008 && TYPE_NAME (type
)
11009 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
11010 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
11011 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
11013 tree oldname
= TYPE_NAME (type
);
11016 /* Replace the anonymous name with the real name everywhere. */
11017 lookup_tag_reverse (type
, declarator
);
11018 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
11019 if (TYPE_NAME (t
) == oldname
)
11020 TYPE_NAME (t
) = decl
;
11022 if (TYPE_LANG_SPECIFIC (type
))
11023 TYPE_WAS_ANONYMOUS (type
) = 1;
11025 /* If this is a typedef within a template class, the nested
11026 type is a (non-primary) template. The name for the
11027 template needs updating as well. */
11028 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
11029 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
11030 = TYPE_IDENTIFIER (type
);
11033 DECL_ASSEMBLER_NAME (decl
) = mangle_type (type
);
11036 /* XXX Temporarily set the scope.
11037 When returning, start_decl expects it as NULL_TREE,
11038 and will then then set it using pushdecl. */
11039 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
11040 if (current_class_type
)
11041 DECL_CONTEXT (decl
) = current_class_type
;
11043 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
11045 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
11046 DECL_ASSEMBLER_NAME (decl
)
11047 = get_identifier (build_overload_name (type
, 1, 1));
11048 DECL_CONTEXT (decl
) = NULL_TREE
;
11051 /* FIXME remangle member functions; member functions of a
11052 type with external linkage have external linkage. */
11055 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11057 cp_error_at ("typedef name may not be class-qualified", decl
);
11062 if (ctype
== NULL_TREE
)
11064 if (TREE_CODE (type
) != METHOD_TYPE
)
11065 cp_error_at ("invalid type qualifier for non-member function type", decl
);
11067 ctype
= TYPE_METHOD_BASETYPE (type
);
11069 if (ctype
!= NULL_TREE
)
11070 grok_method_quals (ctype
, decl
, quals
);
11073 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
11074 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
11075 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
11077 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
11078 inlinep
, friendp
, raises
!= NULL_TREE
);
11081 error ("typedef declaration includes an initializer");
11086 /* Detect the case of an array type of unspecified size
11087 which came, as such, direct from a typedef name.
11088 We must copy the type, so that each identifier gets
11089 a distinct type, so that each identifier's size can be
11090 controlled separately by its own initializer. */
11092 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
11093 && TYPE_DOMAIN (type
) == NULL_TREE
)
11095 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
11098 /* If this is a type name (such as, in a cast or sizeof),
11099 compute the type and return it now. */
11101 if (decl_context
== TYPENAME
)
11103 /* Note that the grammar rejects storage classes
11104 in typenames, fields or parameters. */
11105 if (type_quals
!= TYPE_UNQUALIFIED
)
11106 type_quals
= TYPE_UNQUALIFIED
;
11108 /* Special case: "friend class foo" looks like a TYPENAME context. */
11111 if (type_quals
!= TYPE_UNQUALIFIED
)
11113 cp_error ("type qualifiers specified for friend class declaration");
11114 type_quals
= TYPE_UNQUALIFIED
;
11118 cp_error ("`inline' specified for friend class declaration");
11122 /* Until core issue 180 is resolved, allow 'friend typename A::B'.
11123 But don't allow implicit typenames except with a class-key. */
11124 if (!current_aggr
&& (TREE_CODE (type
) != TYPENAME_TYPE
11125 || IMPLICIT_TYPENAME_P (type
)))
11127 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
11128 cp_pedwarn ("template parameters cannot be friends");
11129 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
11131 friend declaration requires class-key, i.e. `friend class %T::%T'",
11132 constructor_name (current_class_type
),
11133 TYPE_IDENTIFIER (type
));
11136 friend declaration requires class-key, i.e. `friend %#T'",
11140 /* Only try to do this stuff if we didn't already give up. */
11141 if (type
!= integer_type_node
)
11143 decl_type_access_control (TYPE_NAME (type
));
11145 /* A friendly class? */
11146 if (current_class_type
)
11147 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
11149 cp_error ("trying to make class `%T' a friend of global scope",
11152 type
= void_type_node
;
11157 if (ctype
== NULL_TREE
)
11159 if (TREE_CODE (type
) != METHOD_TYPE
)
11160 cp_error ("invalid qualifiers on non-member function type");
11162 ctype
= TYPE_METHOD_BASETYPE (type
);
11166 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
11167 grok_method_quals (ctype
, dummy
, quals
);
11168 type
= TREE_TYPE (dummy
);
11174 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
11175 && decl_context
!= CATCHPARM
11176 && TREE_CODE (type
) != UNION_TYPE
11179 cp_error ("abstract declarator `%T' used as declaration", type
);
11180 declarator
= make_anon_name ();
11183 /* `void' at top level (not within pointer)
11184 is allowed only in typedefs or type names.
11185 We don't complain about parms either, but that is because
11186 a better error message can be made later. */
11188 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
11191 error ("unnamed variable or field declared void");
11192 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
11194 if (IDENTIFIER_OPNAME_P (declarator
))
11195 my_friendly_abort (356);
11197 error ("variable or field `%s' declared void", name
);
11200 error ("variable or field declared void");
11201 type
= integer_type_node
;
11204 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
11205 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
11207 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
11209 if (ctype
|| in_namespace
)
11210 error ("cannot use `::' in parameter declaration");
11212 /* A parameter declared as an array of T is really a pointer to T.
11213 One declared as a function is really a pointer to a function.
11214 One declared as a member is really a pointer to member. */
11216 if (TREE_CODE (type
) == ARRAY_TYPE
)
11218 /* Transfer const-ness of array into that of type pointed to. */
11219 type
= build_pointer_type (TREE_TYPE (type
));
11220 type_quals
= TYPE_UNQUALIFIED
;
11222 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11223 type
= build_pointer_type (type
);
11224 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11225 type
= build_pointer_type (type
);
11229 register tree decl
;
11231 if (decl_context
== PARM
)
11233 decl
= build_decl (PARM_DECL
, declarator
, type
);
11235 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
11236 inlinep
, friendp
, raises
!= NULL_TREE
);
11238 /* Compute the type actually passed in the parmlist,
11239 for the case where there is no prototype.
11240 (For example, shorts and chars are passed as ints.)
11241 When there is a prototype, this is overridden later. */
11243 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
11245 else if (decl_context
== FIELD
)
11247 if (type
== error_mark_node
)
11249 /* Happens when declaring arrays of sizes which
11250 are error_mark_node, for example. */
11253 else if (in_namespace
&& !friendp
)
11255 /* Something like struct S { int N::j; }; */
11256 cp_error ("invalid use of `::'");
11259 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11262 tree function_context
;
11264 /* We catch the others as conflicts with the builtin
11266 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
11268 cp_error ("function `%D' cannot be declared friend",
11275 if (ctype
== NULL_TREE
)
11276 ctype
= current_class_type
;
11278 if (ctype
== NULL_TREE
)
11280 cp_error ("can't make `%D' into a method -- not in a class",
11282 return void_type_node
;
11285 /* ``A union may [ ... ] not [ have ] virtual functions.''
11287 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
11289 cp_error ("function `%D' declared virtual inside a union",
11291 return void_type_node
;
11294 if (declarator
== ansi_opname (NEW_EXPR
)
11295 || declarator
== ansi_opname (VEC_NEW_EXPR
)
11296 || declarator
== ansi_opname (DELETE_EXPR
)
11297 || declarator
== ansi_opname (VEC_DELETE_EXPR
))
11301 cp_error ("`%D' cannot be declared virtual, since it is always static",
11306 else if (staticp
< 2)
11307 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11308 TYPE_ARG_TYPES (type
));
11311 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
11312 function_context
= (ctype
!= NULL_TREE
) ?
11313 decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
11314 publicp
= (! friendp
|| ! staticp
)
11315 && function_context
== NULL_TREE
;
11316 decl
= grokfndecl (ctype
, type
,
11317 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
11318 ? declarator
: dname
,
11320 virtualp
, flags
, quals
, raises
,
11321 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
11322 funcdef_flag
, template_count
, in_namespace
);
11323 if (decl
== NULL_TREE
)
11326 /* This clobbers the attrs stored in `decl' from `attrlist'. */
11327 /* The decl and setting of decl_machine_attr is also turned off. */
11328 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
11331 /* [class.conv.ctor]
11333 A constructor declared without the function-specifier
11334 explicit that can be called with a single parameter
11335 specifies a conversion from the type of its first
11336 parameter to the type of its class. Such a constructor
11337 is called a converting constructor. */
11338 if (explicitp
== 2)
11339 DECL_NONCONVERTING_P (decl
) = 1;
11340 else if (DECL_CONSTRUCTOR_P (decl
))
11342 /* The constructor can be called with exactly one
11343 parameter if there is at least one parameter, and
11344 any subsequent parameters have default arguments.
11345 We don't look at the first parameter, which is
11346 really just the `this' parameter for the new
11349 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
11351 /* Skip the `in_chrg' argument too, if present. */
11352 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
11353 arg_types
= TREE_CHAIN (arg_types
);
11355 if (arg_types
== void_list_node
11357 && TREE_CHAIN (arg_types
)
11358 && TREE_CHAIN (arg_types
) != void_list_node
11359 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
11360 DECL_NONCONVERTING_P (decl
) = 1;
11363 else if (TREE_CODE (type
) == METHOD_TYPE
)
11365 /* We only get here for friend declarations of
11366 members of other classes. */
11367 /* All method decls are public, so tell grokfndecl to set
11368 TREE_PUBLIC, also. */
11369 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
11370 virtualp
, flags
, quals
, raises
,
11371 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
11372 template_count
, in_namespace
);
11373 if (decl
== NULL_TREE
)
11376 else if (!staticp
&& ! processing_template_decl
11377 && !COMPLETE_TYPE_P (complete_type (type
))
11378 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
11381 cp_error ("field `%D' has incomplete type", declarator
);
11383 cp_error ("name `%T' has incomplete type", type
);
11385 /* If we're instantiating a template, tell them which
11386 instantiation made the field's type be incomplete. */
11387 if (current_class_type
11388 && TYPE_NAME (current_class_type
)
11389 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
11390 && declspecs
&& TREE_VALUE (declspecs
)
11391 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
11392 cp_error (" in instantiation of template `%T'",
11393 current_class_type
);
11395 type
= error_mark_node
;
11402 error ("`%s' is neither function nor member function; cannot be declared friend",
11403 IDENTIFIER_POINTER (declarator
));
11411 /* Friends are treated specially. */
11412 if (ctype
== current_class_type
)
11413 warning ("member functions are implicitly friends of their class");
11416 tree t
= NULL_TREE
;
11417 if (decl
&& DECL_NAME (decl
))
11419 if (template_class_depth (current_class_type
) == 0)
11422 = check_explicit_specialization
11424 template_count
, 2 * (funcdef_flag
!= 0) + 4);
11425 if (decl
== error_mark_node
)
11426 return error_mark_node
;
11429 t
= do_friend (ctype
, declarator
, decl
,
11430 last_function_parms
, attrlist
, flags
, quals
,
11433 if (t
&& funcdef_flag
)
11436 return void_type_node
;
11440 /* Structure field. It may not be a function, except for C++ */
11442 if (decl
== NULL_TREE
)
11448 /* An attempt is being made to initialize a non-static
11449 member. But, from [class.mem]:
11451 4 A member-declarator can contain a
11452 constant-initializer only if it declares a static
11453 member (_class.static_) of integral or enumeration
11454 type, see _class.static.data_.
11456 This used to be relatively common practice, but
11457 the rest of the compiler does not correctly
11458 handle the initialization unless the member is
11459 static so we make it static below. */
11460 cp_pedwarn ("ISO C++ forbids initialization of member `%D'",
11462 cp_pedwarn ("making `%D' static", declarator
);
11466 if (uses_template_parms (type
))
11467 /* We'll check at instantiation time. */
11469 else if (check_static_variable_definition (declarator
,
11471 /* If we just return the declaration, crashes
11472 will sometimes occur. We therefore return
11473 void_type_node, as if this was a friend
11474 declaration, to cause callers to completely
11475 ignore this declaration. */
11476 return void_type_node
;
11479 /* 9.2p13 [class.mem] */
11480 if (declarator
== constructor_name (current_class_type
)
11481 /* The standard does not allow non-static data members
11482 here either, but we agreed at the 10/99 meeting
11483 to change that in TC 1 so that they are allowed in
11484 classes with no user-defined constructors. */
11486 cp_pedwarn ("ISO C++ forbids static data member `%D' with same name as enclosing class",
11491 /* C++ allows static class members. All other work
11492 for this is done by grokfield. */
11493 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
11494 TREE_STATIC (decl
) = 1;
11495 /* In class context, 'static' means public access. */
11496 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
11500 decl
= build_decl (FIELD_DECL
, declarator
, type
);
11501 DECL_NONADDRESSABLE_P (decl
) = bitfield
;
11502 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11504 DECL_MUTABLE_P (decl
) = 1;
11505 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11509 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
11510 inlinep
, friendp
, raises
!= NULL_TREE
);
11513 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11515 tree original_name
;
11521 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11522 original_name
= dname
;
11524 original_name
= declarator
;
11526 if (RIDBIT_SETP (RID_AUTO
, specbits
))
11527 error ("storage class `auto' invalid for function `%s'", name
);
11528 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11529 error ("storage class `register' invalid for function `%s'", name
);
11531 /* Function declaration not at top level.
11532 Storage classes other than `extern' are not allowed
11533 and `extern' makes no difference. */
11534 if (! toplevel_bindings_p ()
11535 && (RIDBIT_SETP (RID_STATIC
, specbits
)
11536 || RIDBIT_SETP (RID_INLINE
, specbits
))
11539 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11540 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
11542 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
11545 if (ctype
== NULL_TREE
)
11549 error ("virtual non-class function `%s'", name
);
11553 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
11554 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11555 TYPE_ARG_TYPES (type
));
11557 /* Record presence of `static'. */
11558 publicp
= (ctype
!= NULL_TREE
11559 || RIDBIT_SETP (RID_EXTERN
, specbits
)
11560 || !RIDBIT_SETP (RID_STATIC
, specbits
));
11562 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
11563 virtualp
, flags
, quals
, raises
,
11565 publicp
, inlinep
, funcdef_flag
,
11566 template_count
, in_namespace
);
11567 if (decl
== NULL_TREE
)
11572 int illegal_static
= 0;
11574 /* Don't allow a static member function in a class, and forbid
11575 declaring main to be static. */
11576 if (TREE_CODE (type
) == METHOD_TYPE
)
11578 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11579 illegal_static
= 1;
11581 else if (current_function_decl
)
11583 /* FIXME need arm citation */
11584 error ("cannot declare static function inside another function");
11585 illegal_static
= 1;
11588 if (illegal_static
)
11591 RIDBIT_RESET (RID_STATIC
, specbits
);
11597 /* It's a variable. */
11599 /* An uninitialized decl with `extern' is a reference. */
11600 decl
= grokvardecl (type
, declarator
, &specbits
,
11602 (type_quals
& TYPE_QUAL_CONST
) != 0,
11604 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11605 inlinep
, friendp
, raises
!= NULL_TREE
);
11609 DECL_CONTEXT (decl
) = ctype
;
11612 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11614 RIDBIT_RESET (RID_STATIC
, specbits
);
11616 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11618 cp_error ("static member `%D' declared `register'", decl
);
11619 RIDBIT_RESET (RID_REGISTER
, specbits
);
11621 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11623 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11625 RIDBIT_RESET (RID_EXTERN
, specbits
);
11630 my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE
, specbits
), 19990927);
11632 /* Record `register' declaration for warnings on &
11633 and in case doing stupid register allocation. */
11635 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11636 DECL_REGISTER (decl
) = 1;
11638 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11639 DECL_THIS_EXTERN (decl
) = 1;
11641 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11642 DECL_THIS_STATIC (decl
) = 1;
11644 /* Record constancy and volatility. There's no need to do this
11645 when processing a template; we'll do this for the instantiated
11646 declaration based on the type of DECL. */
11647 if (!processing_template_decl
)
11648 c_apply_type_quals_to_decl (type_quals
, decl
);
11654 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11655 An empty exprlist is a parmlist. An exprlist which
11656 contains only identifiers at the global level
11657 is a parmlist. Otherwise, it is an exprlist. */
11660 parmlist_is_exprlist (exprs
)
11663 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11666 if (toplevel_bindings_p ())
11668 /* At the global level, if these are all identifiers,
11669 then it is a parmlist. */
11672 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11674 exprs
= TREE_CHAIN (exprs
);
11681 /* Subroutine of start_function. Ensure that each of the parameter
11682 types (as listed in PARMS) is complete, as is required for a
11683 function definition. */
11686 require_complete_types_for_parms (parms
)
11689 for (; parms
; parms
= TREE_CHAIN (parms
))
11691 if (VOID_TYPE_P (TREE_TYPE (parms
)))
11692 /* grokparms will have already issued an error */
11693 TREE_TYPE (parms
) = error_mark_node
;
11694 else if (complete_type_or_else (TREE_TYPE (parms
), parms
))
11695 layout_decl (parms
, 0);
11697 TREE_TYPE (parms
) = error_mark_node
;
11701 /* Returns non-zero if T is a local variable. */
11704 local_variable_p (t
)
11707 if ((TREE_CODE (t
) == VAR_DECL
11708 /* A VAR_DECL with a context that is a _TYPE is a static data
11710 && !TYPE_P (CP_DECL_CONTEXT (t
))
11711 /* Any other non-local variable must be at namespace scope. */
11712 && !DECL_NAMESPACE_SCOPE_P (t
))
11713 || (TREE_CODE (t
) == PARM_DECL
))
11719 /* Returns non-zero if T is an automatic local variable or a label.
11720 (These are the declarations that need to be remapped when the code
11721 containing them is duplicated.) */
11724 nonstatic_local_decl_p (t
)
11727 return ((local_variable_p (t
) && !TREE_STATIC (t
))
11728 || TREE_CODE (t
) == LABEL_DECL
11729 || TREE_CODE (t
) == RESULT_DECL
);
11732 /* Like local_variable_p, but suitable for use as a tree-walking
11736 local_variable_p_walkfn (tp
, walk_subtrees
, data
)
11738 int *walk_subtrees ATTRIBUTE_UNUSED
;
11739 void *data ATTRIBUTE_UNUSED
;
11741 return ((local_variable_p (*tp
) && !DECL_ARTIFICIAL (*tp
))
11742 ? *tp
: NULL_TREE
);
11745 /* Check that ARG, which is a default-argument expression for a
11746 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11747 something goes wrong. DECL may also be a _TYPE node, rather than a
11748 DECL, if there is no DECL available. */
11751 check_default_argument (decl
, arg
)
11758 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11759 /* We get a DEFAULT_ARG when looking at an in-class declaration
11760 with a default argument. Ignore the argument for now; we'll
11761 deal with it after the class is complete. */
11764 if (processing_template_decl
|| uses_template_parms (arg
))
11765 /* We don't do anything checking until instantiation-time. Note
11766 that there may be uninstantiated arguments even for an
11767 instantiated function, since default arguments are not
11768 instantiated until they are needed. */
11777 decl_type
= TREE_TYPE (decl
);
11779 if (arg
== error_mark_node
11780 || decl
== error_mark_node
11781 || TREE_TYPE (arg
) == error_mark_node
11782 || decl_type
== error_mark_node
)
11783 /* Something already went wrong. There's no need to check
11785 return error_mark_node
;
11787 /* [dcl.fct.default]
11789 A default argument expression is implicitly converted to the
11791 if (!TREE_TYPE (arg
)
11792 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11795 cp_error ("default argument for `%#D' has type `%T'",
11796 decl
, TREE_TYPE (arg
));
11798 cp_error ("default argument for parameter of type `%T' has type `%T'",
11799 decl_type
, TREE_TYPE (arg
));
11801 return error_mark_node
;
11804 /* [dcl.fct.default]
11806 Local variables shall not be used in default argument
11809 The keyword `this' shall not be used in a default argument of a
11810 member function. */
11811 var
= walk_tree_without_duplicates (&arg
, local_variable_p_walkfn
,
11815 cp_error ("default argument `%E' uses local variable `%D'",
11817 return error_mark_node
;
11824 /* Decode the list of parameter types for a function type.
11825 Given the list of things declared inside the parens,
11826 return a list of types.
11828 We determine whether ellipsis parms are used by PARMLIST_ELLIPSIS_P
11829 flag. If unset, we append void_list_node. A parmlist declared
11830 as `(void)' is accepted as the empty parmlist.
11832 Also set last_function_parms to the chain of PARM_DECLs. */
11835 grokparms (first_parm
)
11838 tree result
= NULL_TREE
;
11839 tree decls
= NULL_TREE
;
11840 int ellipsis
= !first_parm
|| PARMLIST_ELLIPSIS_P (first_parm
);
11844 my_friendly_assert (!first_parm
|| TREE_PARMLIST (first_parm
), 20001115);
11846 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11848 tree type
= NULL_TREE
;
11849 register tree decl
= TREE_VALUE (parm
);
11850 tree init
= TREE_PURPOSE (parm
);
11852 chain
= TREE_CHAIN (parm
);
11853 /* @@ weak defense against parse errors. */
11854 if (TREE_CODE (decl
) != VOID_TYPE
11855 && TREE_CODE (decl
) != TREE_LIST
)
11857 /* Give various messages as the need arises. */
11858 if (TREE_CODE (decl
) == STRING_CST
)
11859 cp_error ("invalid string constant `%E'", decl
);
11860 else if (TREE_CODE (decl
) == INTEGER_CST
)
11861 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11865 if (parm
== void_list_node
)
11868 decl
= grokdeclarator (TREE_VALUE (decl
), TREE_PURPOSE (decl
),
11869 PARM
, init
!= NULL_TREE
, NULL_TREE
);
11870 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
11873 type
= TREE_TYPE (decl
);
11874 if (VOID_TYPE_P (type
))
11876 if (same_type_p (type
, void_type_node
)
11877 && !DECL_NAME (decl
) && !result
&& !chain
&& !ellipsis
)
11878 /* this is a parmlist of `(void)', which is ok. */
11880 incomplete_type_error (decl
, type
);
11881 /* It's not a good idea to actually create parameters of
11882 type `void'; other parts of the compiler assume that a
11883 void type terminates the parameter list. */
11884 type
= error_mark_node
;
11885 TREE_TYPE (decl
) = error_mark_node
;
11888 if (type
!= error_mark_node
)
11890 /* Top-level qualifiers on the parameters are
11891 ignored for function types. */
11892 type
= TYPE_MAIN_VARIANT (type
);
11893 if (TREE_CODE (type
) == METHOD_TYPE
)
11895 cp_error ("parameter `%D' invalidly declared method type", decl
);
11896 type
= build_pointer_type (type
);
11897 TREE_TYPE (decl
) = type
;
11899 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11901 cp_error ("parameter `%D' invalidly declared offset type", decl
);
11902 type
= build_pointer_type (type
);
11903 TREE_TYPE (decl
) = type
;
11905 else if (abstract_virtuals_error (decl
, type
))
11906 any_error
= 1; /* Seems like a good idea. */
11907 else if (POINTER_TYPE_P (type
))
11909 /* [dcl.fct]/6, parameter types cannot contain pointers
11910 (references) to arrays of unknown bound. */
11913 while (POINTER_TYPE_P (t
)
11914 || (TREE_CODE (t
) == ARRAY_TYPE
11915 && TYPE_DOMAIN (t
) != NULL_TREE
))
11917 if (TREE_CODE (t
) == ARRAY_TYPE
)
11918 cp_error ("parameter `%D' includes %s to array of unknown bound `%T'",
11919 decl
, TYPE_PTR_P (type
) ? "pointer" : "reference", t
);
11922 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
11923 if (PROMOTE_PROTOTYPES
11924 && (TREE_CODE (type
) == INTEGER_TYPE
11925 || TREE_CODE (type
) == ENUMERAL_TYPE
)
11926 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
11927 DECL_ARG_TYPE (decl
) = integer_type_node
;
11928 if (!any_error
&& init
)
11929 init
= check_default_argument (decl
, init
);
11934 TREE_CHAIN (decl
) = decls
;
11936 result
= tree_cons (init
, type
, result
);
11938 decls
= nreverse (decls
);
11939 result
= nreverse (result
);
11941 result
= chainon (result
, void_list_node
);
11942 last_function_parms
= decls
;
11947 /* Called from the parser to update an element of TYPE_ARG_TYPES for some
11948 FUNCTION_TYPE with the newly parsed version of its default argument, which
11949 was previously digested as text. See snarf_defarg et al in lex.c. */
11952 replace_defarg (arg
, init
)
11955 if (! processing_template_decl
11956 && ! can_convert_arg (TREE_VALUE (arg
), TREE_TYPE (init
), init
))
11957 cp_pedwarn ("invalid type `%T' for default argument to `%T'",
11958 TREE_TYPE (init
), TREE_VALUE (arg
));
11959 TREE_PURPOSE (arg
) = init
;
11962 /* D is a constructor or overloaded `operator='. Returns non-zero if
11963 D's arguments allow it to be a copy constructor, or copy assignment
11972 if (!DECL_FUNCTION_MEMBER_P (d
))
11975 t
= FUNCTION_ARG_CHAIN (d
);
11976 if (DECL_CONSTRUCTOR_P (d
) && DECL_HAS_IN_CHARGE_PARM_P (d
))
11977 t
= TREE_CHAIN (t
);
11978 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
11979 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
11980 == DECL_CONTEXT (d
))
11981 && (TREE_CHAIN (t
) == NULL_TREE
11982 || TREE_CHAIN (t
) == void_list_node
11983 || TREE_PURPOSE (TREE_CHAIN (t
))))
11988 /* These memoizing functions keep track of special properties which
11989 a class may have. `grok_ctor_properties' notices whether a class
11990 has a constructor of the form X(X&), and also complains
11991 if the class has a constructor of the form X(X).
11992 `grok_op_properties' takes notice of the various forms of
11993 operator= which are defined, as well as what sorts of type conversion
11994 may apply. Both functions take a FUNCTION_DECL as an argument. */
11997 grok_ctor_properties (ctype
, decl
)
12000 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
12001 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
12003 /* When a type has virtual baseclasses, a magical first int argument is
12004 added to any ctor so we can tell if the class has been initialized
12005 yet. This could screw things up in this function, so we deliberately
12006 ignore the leading int if we're in that situation. */
12007 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
12009 my_friendly_assert (parmtypes
12010 && TREE_VALUE (parmtypes
) == integer_type_node
,
12012 parmtypes
= TREE_CHAIN (parmtypes
);
12013 parmtype
= TREE_VALUE (parmtypes
);
12018 A non-template constructor for class X is a copy constructor if
12019 its first parameter is of type X&, const X&, volatile X& or const
12020 volatile X&, and either there are no other parameters or else all
12021 other parameters have default arguments. */
12022 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
12023 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
12024 && sufficient_parms_p (TREE_CHAIN (parmtypes
))
12025 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12026 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12028 TYPE_HAS_INIT_REF (ctype
) = 1;
12029 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12030 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
12034 A declaration of a constructor for a class X is ill-formed if its
12035 first parameter is of type (optionally cv-qualified) X and either
12036 there are no other parameters or else all other parameters have
12039 We *don't* complain about member template instantiations that
12040 have this form, though; they can occur as we try to decide what
12041 constructor to use during overload resolution. Since overload
12042 resolution will never prefer such a constructor to the
12043 non-template copy constructor (which is either explicitly or
12044 implicitly defined), there's no need to worry about their
12045 existence. Theoretically, they should never even be
12046 instantiated, but that's hard to forestall. */
12047 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
12048 && sufficient_parms_p (TREE_CHAIN (parmtypes
))
12049 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12050 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12052 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
12054 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
12057 else if (TREE_CODE (parmtype
) == VOID_TYPE
12058 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
12059 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
12064 /* An operator with this code is unary, but can also be binary. */
12068 enum tree_code code
;
12070 return (code
== INDIRECT_REF
12071 || code
== ADDR_EXPR
12072 || code
== CONVERT_EXPR
12073 || code
== NEGATE_EXPR
12074 || code
== PREINCREMENT_EXPR
12075 || code
== PREDECREMENT_EXPR
);
12078 /* An operator with this name can only be unary. */
12082 enum tree_code code
;
12084 return (code
== TRUTH_NOT_EXPR
12085 || code
== BIT_NOT_EXPR
12086 || code
== COMPONENT_REF
12087 || code
== TYPE_EXPR
);
12090 /* Do a little sanity-checking on how they declared their operator. */
12093 grok_op_properties (decl
, virtualp
, friendp
)
12095 int virtualp
, friendp
;
12097 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
12099 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
12100 tree name
= DECL_NAME (decl
);
12101 enum tree_code operator_code
;
12104 /* Count the number of arguments. */
12105 for (argtype
= argtypes
, arity
= 0;
12106 argtype
&& argtype
!= void_list_node
;
12107 argtype
= TREE_CHAIN (argtype
))
12110 if (current_class_type
== NULL_TREE
)
12113 if (DECL_CONV_FN_P (decl
))
12114 operator_code
= TYPE_EXPR
;
12118 #define DEF_OPERATOR(NAME, CODE, NEW_MANGLING, OLD_MANGING, ARITY, ASSN_P) \
12119 if (ansi_opname (CODE) == name) \
12121 operator_code = CODE; \
12124 else if (ansi_assopname (CODE) == name) \
12126 operator_code = CODE; \
12127 DECL_ASSIGNMENT_OPERATOR_P (decl) = 1; \
12131 #include "operators.def"
12132 #undef DEF_OPERATOR
12134 my_friendly_abort (20000527);
12137 my_friendly_assert (operator_code
!= LAST_CPLUS_TREE_CODE
, 20000526);
12138 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12142 switch (operator_code
)
12145 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
12149 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
12152 case COMPONENT_REF
:
12154 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
12158 TYPE_HAS_NEW_OPERATOR (current_class_type
) = 1;
12162 TYPE_GETS_DELETE (current_class_type
) |= 1;
12166 TYPE_HAS_ARRAY_NEW_OPERATOR (current_class_type
) = 1;
12169 case VEC_DELETE_EXPR
:
12170 TYPE_GETS_DELETE (current_class_type
) |= 2;
12178 if (operator_code
== NEW_EXPR
|| operator_code
== VEC_NEW_EXPR
)
12180 /* When the compiler encounters the definition of A::operator new, it
12181 doesn't look at the class declaration to find out if it's static. */
12183 revert_static_member_fn (decl
);
12185 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
12187 else if (operator_code
== DELETE_EXPR
|| operator_code
== VEC_DELETE_EXPR
)
12190 revert_static_member_fn (decl
);
12192 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
12196 /* An operator function must either be a non-static member function
12197 or have at least one parameter of a class, a reference to a class,
12198 an enumeration, or a reference to an enumeration. 13.4.0.6 */
12199 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
12201 if (operator_code
== TYPE_EXPR
12202 || operator_code
== CALL_EXPR
12203 || operator_code
== COMPONENT_REF
12204 || operator_code
== ARRAY_REF
12205 || operator_code
== NOP_EXPR
)
12206 cp_error ("`%D' must be a nonstatic member function", decl
);
12211 if (DECL_STATIC_FUNCTION_P (decl
))
12212 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
12215 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
12217 tree arg
= TREE_VALUE (p
);
12218 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
12219 arg
= TREE_TYPE (arg
);
12221 /* This lets bad template code slip through. */
12222 if (IS_AGGR_TYPE (arg
)
12223 || TREE_CODE (arg
) == ENUMERAL_TYPE
12224 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
12225 || TREE_CODE (arg
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
12229 ("`%D' must have an argument of class or enumerated type",
12236 if (operator_code
== CALL_EXPR
)
12237 return; /* No restrictions on args. */
12239 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
12241 tree t
= TREE_TYPE (name
);
12244 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
12245 const char *what
= 0;
12248 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
12250 if (TREE_CODE (t
) == VOID_TYPE
)
12252 else if (t
== current_class_type
)
12253 what
= "the same type";
12254 /* Don't force t to be complete here. */
12255 else if (IS_AGGR_TYPE (t
)
12256 && COMPLETE_TYPE_P (t
)
12257 && DERIVED_FROM_P (t
, current_class_type
))
12258 what
= "a base class";
12261 warning ("conversion to %s%s will never use a type conversion operator",
12262 ref
? "a reference to " : "", what
);
12266 if (DECL_ASSIGNMENT_OPERATOR_P (decl
)
12267 && operator_code
== NOP_EXPR
)
12271 if (arity
!= 2 && methodp
)
12273 cp_error ("`%D' must take exactly one argument", decl
);
12276 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
12280 A user-declared copy assignment operator X::operator= is
12281 a non-static non-template member function of class X with
12282 exactly one parameter of type X, X&, const X&, volatile
12283 X& or const volatile X&. */
12284 if (copy_assignment_arg_p (parmtype
, virtualp
)
12285 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12286 && is_member_template (DECL_TI_TEMPLATE (decl
)))
12289 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
12290 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
12291 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12292 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
12295 else if (operator_code
== COND_EXPR
)
12298 cp_error ("ISO C++ prohibits overloading operator ?:");
12300 else if (ambi_op_p (operator_code
))
12303 /* We pick the one-argument operator codes by default, so
12304 we don't have to change anything. */
12306 else if (arity
== 2)
12308 /* If we thought this was a unary operator, we now know
12309 it to be a binary operator. */
12310 switch (operator_code
)
12313 operator_code
= MULT_EXPR
;
12317 operator_code
= BIT_AND_EXPR
;
12321 operator_code
= PLUS_EXPR
;
12325 operator_code
= MINUS_EXPR
;
12328 case PREINCREMENT_EXPR
:
12329 operator_code
= POSTINCREMENT_EXPR
;
12332 case PREDECREMENT_EXPR
:
12333 operator_code
= POSTDECREMENT_EXPR
;
12337 my_friendly_abort (20000527);
12340 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12342 if ((operator_code
== POSTINCREMENT_EXPR
12343 || operator_code
== POSTDECREMENT_EXPR
)
12344 && ! processing_template_decl
12345 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
12348 cp_error ("postfix `%D' must take `int' as its argument",
12352 ("postfix `%D' must take `int' as its second argument",
12359 cp_error ("`%D' must take either zero or one argument", decl
);
12361 cp_error ("`%D' must take either one or two arguments", decl
);
12364 /* More Effective C++ rule 6. */
12366 && (operator_code
== POSTINCREMENT_EXPR
12367 || operator_code
== POSTDECREMENT_EXPR
12368 || operator_code
== PREINCREMENT_EXPR
12369 || operator_code
== PREDECREMENT_EXPR
))
12371 tree arg
= TREE_VALUE (argtypes
);
12372 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
12373 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
12374 arg
= TREE_TYPE (arg
);
12375 arg
= TYPE_MAIN_VARIANT (arg
);
12376 if (operator_code
== PREINCREMENT_EXPR
12377 || operator_code
== PREDECREMENT_EXPR
)
12379 if (TREE_CODE (ret
) != REFERENCE_TYPE
12380 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
12382 cp_warning ("prefix `%D' should return `%T'", decl
,
12383 build_reference_type (arg
));
12387 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
12388 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
12392 else if (unary_op_p (operator_code
))
12397 cp_error ("`%D' must take `void'", decl
);
12399 cp_error ("`%D' must take exactly one argument", decl
);
12402 else /* if (binary_op_p (operator_code)) */
12407 cp_error ("`%D' must take exactly one argument", decl
);
12409 cp_error ("`%D' must take exactly two arguments", decl
);
12412 /* More Effective C++ rule 7. */
12414 && (operator_code
== TRUTH_ANDIF_EXPR
12415 || operator_code
== TRUTH_ORIF_EXPR
12416 || operator_code
== COMPOUND_EXPR
))
12417 cp_warning ("user-defined `%D' always evaluates both arguments",
12421 /* Effective C++ rule 23. */
12424 && (operator_code
== PLUS_EXPR
12425 || operator_code
== MINUS_EXPR
12426 || operator_code
== TRUNC_DIV_EXPR
12427 || operator_code
== MULT_EXPR
)
12428 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
12429 cp_warning ("`%D' should return by value", decl
);
12432 for (; argtypes
&& argtypes
!= void_list_node
;
12433 argtypes
= TREE_CHAIN (argtypes
))
12434 if (TREE_PURPOSE (argtypes
))
12436 TREE_PURPOSE (argtypes
) = NULL_TREE
;
12437 if (operator_code
== POSTINCREMENT_EXPR
12438 || operator_code
== POSTDECREMENT_EXPR
)
12441 cp_pedwarn ("`%D' cannot have default arguments", decl
);
12444 cp_error ("`%D' cannot have default arguments", decl
);
12450 static const char *
12452 enum tag_types code
;
12465 my_friendly_abort (981122);
12469 /* Get the struct, enum or union (CODE says which) with tag NAME.
12470 Define the tag as a forward-reference if it is not defined.
12472 C++: If a class derivation is given, process it here, and report
12473 an error if multiple derivation declarations are not identical.
12475 If this is a definition, come in through xref_tag and only look in
12476 the current frame for the name (since C++ allows new names in any
12480 xref_tag (code_type_node
, name
, globalize
)
12481 tree code_type_node
;
12485 enum tag_types tag_code
;
12486 enum tree_code code
;
12487 register tree ref
, t
;
12488 struct binding_level
*b
= current_binding_level
;
12490 tree attributes
= NULL_TREE
;
12491 tree context
= NULL_TREE
;
12493 /* If we are called from the parser, code_type_node will sometimes be a
12494 TREE_LIST. This indicates that the user wrote
12495 "class __attribute__ ((foo)) bar". Extract the attributes so we can
12497 if (TREE_CODE (code_type_node
) == TREE_LIST
)
12499 attributes
= TREE_PURPOSE (code_type_node
);
12500 code_type_node
= TREE_VALUE (code_type_node
);
12503 tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12508 code
= RECORD_TYPE
;
12514 code
= ENUMERAL_TYPE
;
12517 my_friendly_abort (18);
12520 /* If a cross reference is requested, look up the type
12521 already defined for this tag and return it. */
12525 name
= TYPE_IDENTIFIER (t
);
12529 t
= IDENTIFIER_TYPE_VALUE (name
);
12531 /* Warn about 'friend struct Inherited;' doing the wrong thing. */
12532 if (t
&& globalize
&& TREE_CODE (t
) == TYPENAME_TYPE
)
12534 static int explained
;
12536 cp_warning ("`%s %T' declares a new type at namespace scope;\n\
12537 to refer to the inherited type, say `%s %T::%T'%s",
12538 tag_name (tag_code
), name
, tag_name (tag_code
),
12539 constructor_name (current_class_type
), TYPE_IDENTIFIER (t
),
12541 (names from dependent base classes are not visible to unqualified name lookup)"
12547 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
12548 && TREE_CODE (t
) != BOUND_TEMPLATE_TEMPLATE_PARM
)
12553 /* If we know we are defining this tag, only look it up in
12554 this scope and don't try to find it as a type. */
12555 ref
= lookup_tag (code
, name
, b
, 1);
12561 /* [dcl.type.elab] If the identifier resolves to a
12562 typedef-name or a template type-parameter, the
12563 elaborated-type-specifier is ill-formed. */
12564 if (t
!= TYPE_MAIN_VARIANT (t
)
12565 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
12566 cp_pedwarn ("using typedef-name `%D' after `%s'",
12567 TYPE_NAME (t
), tag_name (tag_code
));
12568 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12569 cp_error ("using template type parameter `%T' after `%s'",
12570 t
, tag_name (tag_code
));
12575 ref
= lookup_tag (code
, name
, b
, 0);
12579 /* Try finding it as a type declaration. If that wins,
12581 ref
= lookup_name (name
, 1);
12583 if (ref
!= NULL_TREE
12584 && processing_template_decl
12585 && DECL_CLASS_TEMPLATE_P (ref
)
12586 && template_class_depth (current_class_type
) == 0)
12587 /* Since GLOBALIZE is true, we're declaring a global
12588 template, so we want this type. */
12589 ref
= DECL_TEMPLATE_RESULT (ref
);
12591 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12592 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12593 ref
= TREE_TYPE (ref
);
12598 if (ref
&& current_class_type
12599 && template_class_depth (current_class_type
)
12600 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12602 /* Since GLOBALIZE is non-zero, we are not looking at a
12603 definition of this tag. Since, in addition, we are currently
12604 processing a (member) template declaration of a template
12605 class, we must be very careful; consider:
12612 { template <class V>
12613 friend struct S1; };
12615 Here, the S2::S1 declaration should not be confused with the
12616 outer declaration. In particular, the inner version should
12617 have a template parameter of level 2, not level 1. This
12618 would be particularly important if the member declaration
12621 template <class V = U> friend struct S1;
12623 say, when we should tsubst into `U' when instantiating
12624 S2. On the other hand, when presented with:
12634 we must find the inner binding eventually. We
12635 accomplish this by making sure that the new type we
12636 create to represent this declaration has the right
12638 context
= TYPE_CONTEXT (ref
);
12645 /* If no such tag is yet defined, create a forward-reference node
12646 and record it as the "definition".
12647 When a real declaration of this type is found,
12648 the forward-reference will be altered into a real type. */
12649 if (code
== ENUMERAL_TYPE
)
12651 cp_error ("use of enum `%#D' without previous declaration", name
);
12653 ref
= make_node (ENUMERAL_TYPE
);
12655 /* Give the type a default layout like unsigned int
12656 to avoid crashing if it does not get defined. */
12657 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12658 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12659 TYPE_USER_ALIGN (ref
) = 0;
12660 TREE_UNSIGNED (ref
) = 1;
12661 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12662 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12663 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12665 /* Enable us to recognize when a type is created in class context.
12666 To do nested classes correctly, this should probably be cleared
12667 out when we leave this classes scope. Currently this in only
12668 done in `start_enum'. */
12670 pushtag (name
, ref
, globalize
);
12674 struct binding_level
*old_b
= class_binding_level
;
12676 ref
= make_aggr_type (code
);
12677 TYPE_CONTEXT (ref
) = context
;
12679 #ifdef NONNESTED_CLASSES
12680 /* Class types don't nest the way enums do. */
12681 class_binding_level
= (struct binding_level
*)0;
12683 pushtag (name
, ref
, globalize
);
12684 class_binding_level
= old_b
;
12689 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12690 redeclare_class_template (ref
, current_template_parms
);
12693 /* Until the type is defined, tentatively accept whatever
12694 structure tag the user hands us. */
12695 if (!COMPLETE_TYPE_P (ref
)
12696 && ref
!= current_class_type
12697 /* Have to check this, in case we have contradictory tag info. */
12698 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12700 if (tag_code
== class_type
)
12701 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12702 else if (tag_code
== record_type
)
12703 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12706 TREE_TYPE (ref
) = attributes
;
12712 xref_tag_from_type (old
, id
, globalize
)
12716 tree code_type_node
;
12718 if (TREE_CODE (old
) == RECORD_TYPE
)
12719 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12720 ? class_type_node
: record_type_node
);
12722 code_type_node
= union_type_node
;
12724 if (id
== NULL_TREE
)
12725 id
= TYPE_IDENTIFIER (old
);
12727 return xref_tag (code_type_node
, id
, globalize
);
12730 /* REF is a type (named NAME), for which we have just seen some
12731 baseclasses. BINFO is a list of those baseclasses; the
12732 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12733 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12734 struct, or union. */
12737 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12738 tree code_type_node
;
12742 /* In the declaration `A : X, Y, ... Z' we mark all the types
12743 (A, X, Y, ..., Z) so we can check for duplicates. */
12748 enum tag_types tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12750 if (tag_code
== union_type
)
12752 cp_error ("derived union `%T' invalid", ref
);
12756 len
= list_length (binfo
);
12758 /* First, make sure that any templates in base-classes are
12759 instantiated. This ensures that if we call ourselves recursively
12760 we do not get confused about which classes are marked and which
12762 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12763 complete_type (TREE_VALUE (base
));
12765 SET_CLASSTYPE_MARKED (ref
);
12766 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12768 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12770 /* The base of a derived struct is public by default. */
12772 = (TREE_PURPOSE (binfo
) == access_public_node
12773 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12774 || (tag_code
!= class_type
12775 && (TREE_PURPOSE (binfo
) == access_default_node
12776 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12778 = (TREE_PURPOSE (binfo
) == access_protected_node
12779 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12781 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12782 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12783 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12784 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12785 tree basetype
= TREE_VALUE (binfo
);
12788 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12789 basetype
= TREE_TYPE (basetype
);
12791 || (TREE_CODE (basetype
) != RECORD_TYPE
12792 && TREE_CODE (basetype
) != TYPENAME_TYPE
12793 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12794 && TREE_CODE (basetype
) != BOUND_TEMPLATE_TEMPLATE_PARM
))
12796 cp_error ("base type `%T' fails to be a struct or class type",
12797 TREE_VALUE (binfo
));
12801 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12803 /* This code replaces similar code in layout_basetypes.
12804 We put the complete_type first for implicit `typename'. */
12805 if (!COMPLETE_TYPE_P (basetype
)
12806 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12808 cp_error ("base class `%T' has incomplete type", basetype
);
12813 if (CLASSTYPE_MARKED (basetype
))
12815 if (basetype
== ref
)
12816 cp_error ("recursive type `%T' undefined", basetype
);
12818 cp_error ("duplicate base type `%T' invalid", basetype
);
12822 if (TYPE_FOR_JAVA (basetype
)
12823 && (current_lang_stack
12824 == &VARRAY_TREE (current_lang_base
, 0)))
12825 TYPE_FOR_JAVA (ref
) = 1;
12827 /* Note that the BINFO records which describe individual
12828 inheritances are *not* shared in the lattice! They
12829 cannot be shared because a given baseclass may be
12830 inherited with different `accessibility' by different
12831 derived classes. (Each BINFO record describing an
12832 individual inheritance contains flags which say what
12833 the `accessibility' of that particular inheritance is.) */
12836 = make_binfo (size_zero_node
, basetype
,
12837 CLASS_TYPE_P (basetype
)
12838 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
12839 CLASS_TYPE_P (basetype
)
12840 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
12842 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
12843 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
12844 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
12845 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
12846 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
12848 /* We need to unshare the binfos now so that lookups during class
12849 definition work. */
12850 unshare_base_binfos (base_binfo
);
12852 SET_CLASSTYPE_MARKED (basetype
);
12854 /* We are free to modify these bits because they are meaningless
12855 at top level, and BASETYPE is a top-level type. */
12856 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
12858 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
12859 /* Converting to a virtual base class requires looking
12860 up the offset of the virtual base. */
12861 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
12864 if (CLASS_TYPE_P (basetype
))
12866 TYPE_HAS_NEW_OPERATOR (ref
)
12867 |= TYPE_HAS_NEW_OPERATOR (basetype
);
12868 TYPE_HAS_ARRAY_NEW_OPERATOR (ref
)
12869 |= TYPE_HAS_ARRAY_NEW_OPERATOR (basetype
);
12870 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
12871 /* If the base-class uses multiple inheritance, so do we. */
12872 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
12873 |= TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
12874 /* Likewise, if converting to a base of the base may require
12875 code, then we may need to generate code to convert to a
12877 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
)
12878 |= TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (basetype
);
12885 TREE_VEC_LENGTH (binfos
) = i
;
12887 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
12891 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
12892 /* If there is more than one non-empty they cannot be at the same
12894 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
12897 /* Unmark all the types. */
12899 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
12900 CLEAR_CLASSTYPE_MARKED (ref
);
12902 /* Now that we know all the base-classes, set up the list of virtual
12904 get_vbase_types (ref
);
12908 /* Begin compiling the definition of an enumeration type.
12909 NAME is its name (or null if anonymous).
12910 Returns the type object, as yet incomplete.
12911 Also records info about it so that build_enumerator
12912 may be used to declare the individual values as they are read. */
12918 register tree enumtype
= NULL_TREE
;
12919 struct binding_level
*b
= current_binding_level
;
12921 /* If this is the real definition for a previous forward reference,
12922 fill in the contents in the same object that used to be the
12923 forward reference. */
12925 if (name
!= NULL_TREE
)
12926 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
12928 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
12930 cp_error ("multiple definition of `%#T'", enumtype
);
12931 cp_error_at ("previous definition here", enumtype
);
12932 /* Clear out TYPE_VALUES, and start again. */
12933 TYPE_VALUES (enumtype
) = NULL_TREE
;
12937 enumtype
= make_node (ENUMERAL_TYPE
);
12938 pushtag (name
, enumtype
, 0);
12941 if (current_class_type
)
12942 TREE_ADDRESSABLE (b
->tags
) = 1;
12944 GNU_xref_decl (current_function_decl
, enumtype
);
12948 /* After processing and defining all the values of an enumeration type,
12949 install their decls in the enumeration type and finish it off.
12950 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12951 Returns ENUMTYPE. */
12954 finish_enum (enumtype
)
12957 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
12958 /* Calculate the maximum value of any enumerator in this type. */
12960 tree values
= TYPE_VALUES (enumtype
);
12965 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
12970 /* The TREE_VALUE is a CONST_DECL for this enumeration
12972 decl
= TREE_VALUE (pair
);
12976 Following the closing brace of an enum-specifier, each
12977 enumerator has the type of its enumeration. Prior to the
12978 closing brace, the type of each enumerator is the type of
12979 its initializing value. */
12980 TREE_TYPE (decl
) = enumtype
;
12982 /* The DECL_INITIAL will be NULL if we are processing a
12983 template declaration and this enumeration constant had no
12984 explicit initializer. */
12985 value
= DECL_INITIAL (decl
);
12986 if (value
&& !processing_template_decl
)
12988 /* Set the TREE_TYPE for the VALUE as well. That's so
12989 that when we call decl_constant_value we get an
12990 entity of the right type (but with the constant
12991 value). Since we shouldn't ever call
12992 decl_constant_value on a template type, there's no
12993 reason to do that when processing_template_decl.
12994 And, if the expression is something like a
12995 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12996 wreak havoc on the intended type of the expression.
12998 Of course, there's also no point in trying to compute
12999 minimum or maximum values if we're in a template. */
13000 TREE_TYPE (value
) = enumtype
;
13003 minnode
= maxnode
= value
;
13004 else if (tree_int_cst_lt (maxnode
, value
))
13006 else if (tree_int_cst_lt (value
, minnode
))
13010 if (processing_template_decl
)
13011 /* If this is just a template, leave the CONST_DECL
13012 alone. That way tsubst_copy will find CONST_DECLs for
13013 CONST_DECLs, and not INTEGER_CSTs. */
13016 /* In the list we're building up, we want the enumeration
13017 values, not the CONST_DECLs. */
13018 TREE_VALUE (pair
) = value
;
13022 maxnode
= minnode
= integer_zero_node
;
13024 TYPE_VALUES (enumtype
) = nreverse (values
);
13026 if (processing_template_decl
)
13028 tree scope
= current_scope ();
13029 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
13030 add_stmt (build_min (TAG_DEFN
, enumtype
));
13034 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
13035 int lowprec
= min_precision (minnode
, unsignedp
);
13036 int highprec
= min_precision (maxnode
, unsignedp
);
13037 int precision
= MAX (lowprec
, highprec
);
13040 TYPE_SIZE (enumtype
) = NULL_TREE
;
13042 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
13044 TYPE_PRECISION (enumtype
) = precision
;
13046 fixup_unsigned_type (enumtype
);
13048 fixup_signed_type (enumtype
);
13050 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
13051 /* Use the width of the narrowest normal C type which is wide
13053 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
13056 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
13058 TYPE_SIZE (enumtype
) = 0;
13059 layout_type (enumtype
);
13061 /* Fix up all variant types of this enum type. */
13062 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
13063 tem
= TYPE_NEXT_VARIANT (tem
))
13065 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
13066 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
13067 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
13068 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
13069 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
13070 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
13071 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
13072 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
13073 TYPE_USER_ALIGN (tem
) = TYPE_USER_ALIGN (enumtype
);
13074 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
13077 /* Finish debugging output for this type. */
13078 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
13084 /* Build and install a CONST_DECL for an enumeration constant of the
13085 enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided.
13086 Assignment of sequential values by default is handled here. */
13089 build_enumerator (name
, value
, enumtype
)
13099 /* Remove no-op casts from the value. */
13101 STRIP_TYPE_NOPS (value
);
13103 if (! processing_template_decl
)
13105 /* Validate and default VALUE. */
13106 if (value
!= NULL_TREE
)
13108 value
= decl_constant_value (value
);
13110 if (TREE_CODE (value
) == INTEGER_CST
)
13112 value
= default_conversion (value
);
13113 constant_expression_warning (value
);
13117 cp_error ("enumerator value for `%D' not integer constant", name
);
13122 /* Default based on previous value. */
13123 if (value
== NULL_TREE
&& ! processing_template_decl
)
13127 if (TYPE_VALUES (enumtype
))
13129 /* The next value is the previous value ... */
13130 prev_value
= DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype
)));
13131 /* ... plus one. */
13132 value
= cp_build_binary_op (PLUS_EXPR
,
13136 if (tree_int_cst_lt (value
, prev_value
))
13137 cp_error ("overflow in enumeration values at `%D'", name
);
13140 value
= integer_zero_node
;
13143 /* Remove no-op casts from the value. */
13145 STRIP_TYPE_NOPS (value
);
13147 /* To fix MAX_VAL enum consts. (bkoz) */
13148 TREE_TYPE (value
) = integer_type_node
;
13152 /* We always have to copy here; not all INTEGER_CSTs are unshared.
13153 Even in other cases, we will later (in finish_enum) be setting
13154 the type of VALUE. But, we don't need to make a copy if this
13155 VALUE is one of the enumeration constants for this same
13156 enumeration type. */
13157 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
13158 if (TREE_VALUE (values
) == value
)
13160 /* If we didn't break out of the loop, then we do need a copy. */
13161 if (!values
&& value
)
13162 value
= copy_node (value
);
13164 /* C++ associates enums with global, function, or class declarations. */
13165 context
= current_scope ();
13167 /* Build the actual enumeration constant. Note that the enumeration
13168 constants have the type of their initializers until the
13169 enumeration is complete:
13173 Following the closing brace of an enum-specifier, each enumer-
13174 ator has the type of its enumeration. Prior to the closing
13175 brace, the type of each enumerator is the type of its
13176 initializing value.
13178 In finish_enum we will reset the type. Of course, if we're
13179 processing a template, there may be no value. */
13180 type
= value
? TREE_TYPE (value
) : NULL_TREE
;
13182 if (context
&& context
== current_class_type
)
13183 /* This enum declaration is local to the class. We need the full
13184 lang_decl so that we can record DECL_CLASS_CONTEXT, for example. */
13185 decl
= build_lang_decl (CONST_DECL
, name
, type
);
13187 /* It's a global enum, or it's local to a function. (Note local to
13188 a function could mean local to a class method. */
13189 decl
= build_decl (CONST_DECL
, name
, type
);
13191 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
13192 DECL_INITIAL (decl
) = value
;
13193 TREE_READONLY (decl
) = 1;
13195 if (context
&& context
== current_class_type
)
13196 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
13197 on the TYPE_FIELDS list for `S'. (That's so that you can say
13198 things like `S::i' later.) */
13199 finish_member_declaration (decl
);
13203 GNU_xref_decl (current_function_decl
, decl
);
13206 /* Add this enumeration constant to the list for this type. */
13207 TYPE_VALUES (enumtype
) = tree_cons (name
, decl
, TYPE_VALUES (enumtype
));
13211 /* We're defining DECL. Make sure that it's type is OK. */
13214 check_function_type (decl
, current_function_parms
)
13216 tree current_function_parms
;
13218 tree fntype
= TREE_TYPE (decl
);
13219 tree return_type
= complete_type (TREE_TYPE (fntype
));
13221 /* In a function definition, arg types must be complete. */
13222 require_complete_types_for_parms (current_function_parms
);
13224 if (!COMPLETE_OR_VOID_TYPE_P (return_type
))
13226 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
13228 /* Make it return void instead, but don't change the
13229 type of the DECL_RESULT, in case we have a named return value. */
13230 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13232 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
13234 = build_cplus_method_type (ctype
,
13236 FUNCTION_ARG_CHAIN (decl
));
13240 = build_function_type (void_type_node
,
13241 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
13243 = build_exception_variant (fntype
,
13244 TYPE_RAISES_EXCEPTIONS (fntype
));
13247 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
13250 /* Create the FUNCTION_DECL for a function definition.
13251 DECLSPECS and DECLARATOR are the parts of the declaration;
13252 they describe the function's name and the type it returns,
13253 but twisted together in a fashion that parallels the syntax of C.
13255 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
13256 DECLARATOR is really the DECL for the function we are about to
13257 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
13258 indicating that the function is an inline defined in-class.
13260 This function creates a binding context for the function body
13261 as well as setting up the FUNCTION_DECL in current_function_decl.
13263 Returns 1 on success. If the DECLARATOR is not suitable for a function
13264 (it defines a datum instead), we return 0, which tells
13265 yyparse to report a parse error.
13267 For C++, we must first check whether that datum makes any sense.
13268 For example, "class A local_a(1,2);" means that variable local_a
13269 is an aggregate of type A, which should have a constructor
13270 applied to it with the argument list [1, 2]. */
13273 start_function (declspecs
, declarator
, attrs
, flags
)
13274 tree declspecs
, declarator
, attrs
;
13278 tree ctype
= NULL_TREE
;
13281 extern int have_extern_spec
;
13282 extern int used_extern_spec
;
13283 int doing_friend
= 0;
13284 struct binding_level
*bl
;
13285 tree current_function_parms
;
13287 /* Sanity check. */
13288 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
13289 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
13291 /* This should only be done once on the top most decl. */
13292 if (have_extern_spec
&& !used_extern_spec
)
13294 declspecs
= tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
13295 used_extern_spec
= 1;
13298 if (flags
& SF_PRE_PARSED
)
13300 decl1
= declarator
;
13302 fntype
= TREE_TYPE (decl1
);
13303 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13304 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13306 /* ISO C++ 11.4/5. A friend function defined in a class is in
13307 the (lexical) scope of the class in which it is defined. */
13308 if (!ctype
&& DECL_FRIEND_P (decl1
))
13310 ctype
= DECL_FRIEND_CONTEXT (decl1
);
13312 /* CTYPE could be null here if we're dealing with a template;
13313 for example, `inline friend float foo()' inside a template
13314 will have no CTYPE set. */
13315 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
13321 last_function_parms
= DECL_ARGUMENTS (decl1
);
13322 last_function_parm_tags
= NULL_TREE
;
13326 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
13327 /* If the declarator is not suitable for a function definition,
13328 cause a syntax error. */
13329 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
13331 fntype
= TREE_TYPE (decl1
);
13333 restype
= TREE_TYPE (fntype
);
13334 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
13336 cp_error ("semicolon missing after declaration of `%#T'", restype
);
13337 shadow_tag (build_tree_list (NULL_TREE
, restype
));
13338 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
13339 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
13340 fntype
= build_function_type (integer_type_node
,
13341 TYPE_ARG_TYPES (fntype
));
13343 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
13345 TYPE_ARG_TYPES (fntype
));
13346 TREE_TYPE (decl1
) = fntype
;
13349 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13350 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13351 else if (DECL_MAIN_P (decl1
))
13353 /* If this doesn't return integer_type, complain. */
13354 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
13356 if (pedantic
|| warn_return_type
)
13357 pedwarn ("return type for `main' changed to `int'");
13358 TREE_TYPE (decl1
) = fntype
= default_function_type
;
13363 /* Sometimes we don't notice that a function is a static member, and
13364 build a METHOD_TYPE for it. Fix that up now. */
13365 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
)
13366 && TREE_CODE (TREE_TYPE (decl1
)) == METHOD_TYPE
)
13368 revert_static_member_fn (decl1
);
13369 last_function_parms
= TREE_CHAIN (last_function_parms
);
13373 /* Warn if function was previously implicitly declared
13374 (but not if we warned then). */
13375 if (! warn_implicit
13376 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
13377 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
13379 /* Set up current_class_type, and enter the scope of the class, if
13382 push_nested_class (ctype
, 1);
13383 else if (DECL_STATIC_FUNCTION_P (decl1
))
13384 push_nested_class (DECL_CONTEXT (decl1
), 2);
13386 /* Now that we have entered the scope of the class, we must restore
13387 the bindings for any template parameters surrounding DECL1, if it
13388 is an inline member template. (Order is important; consider the
13389 case where a template parameter has the same name as a field of
13390 the class.) It is not until after this point that
13391 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
13392 if (flags
& SF_INCLASS_INLINE
)
13393 maybe_begin_member_template_processing (decl1
);
13395 /* Effective C++ rule 15. */
13397 && DECL_OVERLOADED_OPERATOR_P (decl1
) == NOP_EXPR
13398 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
13399 cp_warning ("`operator=' should return a reference to `*this'");
13401 /* Make the init_value nonzero so pushdecl knows this is not tentative.
13402 error_mark_node is replaced below (in poplevel) with the BLOCK. */
13403 if (!DECL_INITIAL (decl1
))
13404 DECL_INITIAL (decl1
) = error_mark_node
;
13406 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
13407 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
13410 /* This function exists in static storage.
13411 (This does not mean `static' in the C sense!) */
13412 TREE_STATIC (decl1
) = 1;
13414 /* We must call push_template_decl after current_class_type is set
13415 up. (If we are processing inline definitions after exiting a
13416 class scope, current_class_type will be NULL_TREE until set above
13417 by push_nested_class.) */
13418 if (processing_template_decl
)
13419 decl1
= push_template_decl (decl1
);
13421 /* We are now in the scope of the function being defined. */
13422 current_function_decl
= decl1
;
13424 /* Save the parm names or decls from this function's declarator
13425 where store_parm_decls will find them. */
13426 current_function_parms
= last_function_parms
;
13427 current_function_parm_tags
= last_function_parm_tags
;
13429 /* Make sure the parameter and return types are reasonable. When
13430 you declare a function, these types can be incomplete, but they
13431 must be complete when you define the function. */
13432 if (! processing_template_decl
)
13433 check_function_type (decl1
, current_function_parms
);
13435 /* Build the return declaration for the function. */
13436 restype
= TREE_TYPE (fntype
);
13437 if (!processing_template_decl
)
13439 if (!DECL_RESULT (decl1
))
13441 DECL_RESULT (decl1
)
13442 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13443 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype
),
13444 DECL_RESULT (decl1
));
13448 /* Just use `void'. Nobody will ever look at this anyhow. */
13449 DECL_RESULT (decl1
) = build_decl (RESULT_DECL
, 0, void_type_node
);
13451 /* Initialize RTL machinery. We cannot do this until
13452 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
13453 even when processing a template; this is how we get
13454 CFUN set up, and our per-function variables initialized.
13455 FIXME factor out the non-RTL stuff. */
13456 bl
= current_binding_level
;
13457 init_function_start (decl1
, input_filename
, lineno
);
13458 current_binding_level
= bl
;
13460 /* Even though we're inside a function body, we still don't want to
13461 call expand_expr to calculate the size of a variable-sized array.
13462 We haven't necessarily assigned RTL to all variables yet, so it's
13463 not safe to try to expand expressions involving them. */
13464 immediate_size_expand
= 0;
13465 cfun
->x_dont_save_pending_sizes_p
= 1;
13467 /* Start the statement-tree, start the tree now. */
13468 begin_stmt_tree (&DECL_SAVED_TREE (decl1
));
13470 /* Let the user know we're compiling this function. */
13471 announce_function (decl1
);
13473 /* Record the decl so that the function name is defined.
13474 If we already have a decl for this name, and it is a FUNCTION_DECL,
13475 use the old decl. */
13476 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
13478 /* A specialization is not used to guide overload resolution. */
13479 if (!DECL_TEMPLATE_SPECIALIZATION (decl1
)
13480 && ! DECL_FUNCTION_MEMBER_P (decl1
))
13481 decl1
= pushdecl (decl1
);
13484 /* We need to set the DECL_CONTEXT. */
13485 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
13486 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
13487 /* And make sure we have enough default args. */
13488 check_default_args (decl1
);
13490 fntype
= TREE_TYPE (decl1
);
13493 /* Reset these in case the call to pushdecl changed them. */
13494 current_function_decl
= decl1
;
13495 cfun
->decl
= decl1
;
13497 /* If we are (erroneously) defining a function that we have already
13498 defined before, wipe out what we knew before. */
13499 if (!DECL_PENDING_INLINE_P (decl1
)
13500 && DECL_SAVED_FUNCTION_DATA (decl1
))
13502 free (DECL_SAVED_FUNCTION_DATA (decl1
));
13503 DECL_SAVED_FUNCTION_DATA (decl1
) = NULL
;
13506 if (ctype
&& !doing_friend
&& !DECL_STATIC_FUNCTION_P (decl1
))
13508 /* We know that this was set up by `grokclassfn'. We do not
13509 wait until `store_parm_decls', since evil parse errors may
13510 never get us to that point. Here we keep the consistency
13511 between `current_class_type' and `current_class_ptr'. */
13512 tree t
= DECL_ARGUMENTS (decl1
);
13514 my_friendly_assert (t
!= NULL_TREE
&& TREE_CODE (t
) == PARM_DECL
,
13516 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
13519 cp_function_chain
->x_current_class_ref
13520 = build_indirect_ref (t
, NULL_PTR
);
13521 cp_function_chain
->x_current_class_ptr
= t
;
13523 /* Constructors and destructors need to know whether they're "in
13524 charge" of initializing virtual base classes. */
13525 if (DECL_HAS_IN_CHARGE_PARM_P (decl1
))
13526 current_in_charge_parm
= TREE_CHAIN (t
);
13529 if (DECL_INTERFACE_KNOWN (decl1
))
13531 tree ctx
= decl_function_context (decl1
);
13533 if (DECL_NOT_REALLY_EXTERN (decl1
))
13534 DECL_EXTERNAL (decl1
) = 0;
13536 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
13537 && TREE_PUBLIC (ctx
))
13538 /* This is a function in a local class in an extern inline
13540 comdat_linkage (decl1
);
13542 /* If this function belongs to an interface, it is public.
13543 If it belongs to someone else's interface, it is also external.
13544 This only affects inlines and template instantiations. */
13545 else if (interface_unknown
== 0
13546 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13547 || flag_alt_external_templates
))
13549 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
13550 || processing_template_decl
)
13552 DECL_EXTERNAL (decl1
)
13554 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
13555 && !DECL_VINDEX (decl1
)));
13557 /* For WIN32 we also want to put these in linkonce sections. */
13558 maybe_make_one_only (decl1
);
13561 DECL_EXTERNAL (decl1
) = 0;
13562 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
13563 DECL_INTERFACE_KNOWN (decl1
) = 1;
13565 else if (interface_unknown
&& interface_only
13566 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13567 || flag_alt_external_templates
))
13569 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13570 interface, we will have interface_only set but not
13571 interface_known. In that case, we don't want to use the normal
13572 heuristics because someone will supply a #pragma implementation
13573 elsewhere, and deducing it here would produce a conflict. */
13574 comdat_linkage (decl1
);
13575 DECL_EXTERNAL (decl1
) = 0;
13576 DECL_INTERFACE_KNOWN (decl1
) = 1;
13577 DECL_DEFER_OUTPUT (decl1
) = 1;
13581 /* This is a definition, not a reference.
13582 So clear DECL_EXTERNAL. */
13583 DECL_EXTERNAL (decl1
) = 0;
13585 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
13586 && ! DECL_INTERFACE_KNOWN (decl1
)
13587 /* Don't try to defer nested functions for now. */
13588 && ! decl_function_context (decl1
))
13589 DECL_DEFER_OUTPUT (decl1
) = 1;
13591 DECL_INTERFACE_KNOWN (decl1
) = 1;
13595 current_binding_level
->parm_flag
= 1;
13598 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13600 /* We need to do this even if we aren't expanding yet so that
13601 assemble_external works. */
13602 make_function_rtl (decl1
);
13604 /* Promote the value to int before returning it. */
13605 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13606 restype
= type_promotes_to (restype
);
13608 /* If this fcn was already referenced via a block-scope `extern' decl
13609 (or an implicit decl), propagate certain information about the usage. */
13610 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13611 TREE_ADDRESSABLE (decl1
) = 1;
13613 if (DECL_RESULT (decl1
) == NULL_TREE
)
13615 DECL_RESULT (decl1
)
13616 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13617 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13618 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13623 if (DECL_DESTRUCTOR_P (decl1
))
13625 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13626 DECL_CONTEXT (dtor_label
) = current_function_decl
;
13628 /* Under the old ABI we return `this' from constructors, so we make
13629 ordinary `return' statements in constructors jump to CTOR_LABEL;
13630 from there we return `this'. Under the new ABI, we don't bother
13631 with any of this. By not setting CTOR_LABEL the remainder of the
13632 machinery is automatically disabled. */
13633 else if (!flag_new_abi
&& DECL_CONSTRUCTOR_P (decl1
))
13635 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13636 DECL_CONTEXT (ctor_label
) = current_function_decl
;
13639 store_parm_decls (current_function_parms
);
13644 /* Store the parameter declarations into the current function declaration.
13645 This is called after parsing the parameter declarations, before
13646 digesting the body of the function.
13648 Also install to binding contour return value identifier, if any. */
13651 store_parm_decls (current_function_parms
)
13652 tree current_function_parms
;
13654 register tree fndecl
= current_function_decl
;
13655 register tree parm
;
13656 int parms_have_cleanups
= 0;
13657 tree cleanups
= NULL_TREE
;
13659 /* This is a list of types declared among parms in a prototype. */
13660 tree parmtags
= current_function_parm_tags
;
13662 /* This is a chain of any other decls that came in among the parm
13663 declarations. If a parm is declared with enum {foo, bar} x;
13664 then CONST_DECLs for foo and bar are put here. */
13665 tree nonparms
= NULL_TREE
;
13667 if (current_function_parms
)
13669 /* This case is when the function was defined with an ANSI prototype.
13670 The parms already have decls, so we need not do anything here
13671 except record them as in effect
13672 and complain if any redundant old-style parm decls were written. */
13674 tree specparms
= current_function_parms
;
13677 /* Must clear this because it might contain TYPE_DECLs declared
13679 storedecls (NULL_TREE
);
13681 /* If we're doing semantic analysis, then we'll call pushdecl
13682 for each of these. We must do them in reverse order so that
13683 they end in the correct forward order. */
13684 specparms
= nreverse (specparms
);
13686 for (parm
= specparms
; parm
; parm
= next
)
13688 next
= TREE_CHAIN (parm
);
13689 if (TREE_CODE (parm
) == PARM_DECL
)
13693 if (DECL_NAME (parm
) == NULL_TREE
13694 || TREE_CODE (parm
) != VOID_TYPE
)
13697 cp_error ("parameter `%D' declared void", parm
);
13699 cleanup
= (processing_template_decl
13701 : maybe_build_cleanup (parm
));
13704 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13708 /* If we find an enum constant or a type tag,
13709 put it aside for the moment. */
13710 TREE_CHAIN (parm
) = NULL_TREE
;
13711 nonparms
= chainon (nonparms
, parm
);
13715 /* Get the decls in their original chain order and record in the
13716 function. This is all and only the PARM_DECLs that were
13717 pushed into scope by the loop above. */
13718 DECL_ARGUMENTS (fndecl
) = getdecls ();
13719 storetags (chainon (parmtags
, gettags ()));
13722 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13724 /* Now store the final chain of decls for the arguments
13725 as the decl-chain of the current lexical scope.
13726 Put the enumerators in as well, at the front so that
13727 DECL_ARGUMENTS is not modified. */
13728 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13730 /* Now that we have initialized the parms, we can start their
13731 cleanups. We cannot do this before, since expand_decl_cleanup
13732 should not be called before the parm can be used. */
13735 finish_decl_cleanup (TREE_PURPOSE (cleanups
),
13736 TREE_VALUE (cleanups
));
13737 cleanups
= TREE_CHAIN (cleanups
);
13740 /* Create a binding contour which can be used to catch
13741 cleanup-generated temporaries. */
13742 if (parms_have_cleanups
)
13745 /* Do the starting of the exception specifications, if we have any. */
13746 if (flag_exceptions
&& !processing_template_decl
13747 && flag_enforce_eh_specs
13748 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13749 current_eh_spec_try_block
= expand_start_eh_spec ();
13753 /* We have finished doing semantic analysis on DECL, but have not yet
13754 generated RTL for its body. Save away our current state, so that
13755 when we want to generate RTL later we know what to do. */
13758 save_function_data (decl
)
13761 struct cp_language_function
*f
;
13763 /* Save the language-specific per-function data so that we can
13764 get it back when we really expand this function. */
13765 my_friendly_assert (!DECL_PENDING_INLINE_P (decl
),
13769 f
= ((struct cp_language_function
*)
13770 xmalloc (sizeof (struct cp_language_function
)));
13771 memcpy (f
, cp_function_chain
, sizeof (struct cp_language_function
));
13772 DECL_SAVED_FUNCTION_DATA (decl
) = f
;
13774 /* Clear out the bits we don't need. */
13775 f
->base
.x_stmt_tree
.x_last_stmt
= NULL_TREE
;
13776 f
->base
.x_stmt_tree
.x_last_expr_type
= NULL_TREE
;
13777 f
->x_named_label_uses
= NULL
;
13778 f
->bindings
= NULL
;
13780 /* When we get back here again, we will be expanding. */
13781 f
->x_expanding_p
= 1;
13783 /* If we've already decided that we cannot inline this function, we
13784 must remember that fact when we actually go to expand the
13786 f
->cannot_inline
= current_function_cannot_inline
;
13789 /* At the end of every constructor we generate to code to return
13790 `this'. Do that now. */
13793 finish_constructor_body ()
13795 /* Any return from a constructor will end up here. */
13797 add_stmt (build_stmt (LABEL_STMT
, ctor_label
));
13799 /* Clear CTOR_LABEL so that finish_return_stmt knows to really
13800 generate the return, rather than a goto to CTOR_LABEL. */
13801 ctor_label
= NULL_TREE
;
13802 /* In check_return_expr we translate an empty return from a
13803 constructor to a return of `this'. */
13804 finish_return_stmt (NULL_TREE
);
13805 /* Mark the end of the constructor. */
13806 add_stmt (build_stmt (CTOR_STMT
));
13809 /* At the end of every destructor we generate code to restore virtual
13810 function tables to the values desired by base classes and to call
13811 to base class destructors. Do that now. */
13814 finish_destructor_body ()
13816 tree compound_stmt
;
13821 /* Create a block to contain all the extra code. */
13822 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
13824 /* Any return from a destructor will end up here. */
13825 add_stmt (build_stmt (LABEL_STMT
, dtor_label
));
13827 /* Generate the code to call destructor on base class. If this
13828 destructor belongs to a class with virtual functions, then set
13829 the virtual function table pointer to represent the type of our
13832 /* This side-effect makes call to `build_delete' generate the code
13833 we have to have at the end of this destructor. `build_delete'
13834 will set the flag again. */
13835 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
13837 exprstmt
= build_delete (current_class_type
,
13839 sfk_base_destructor
,
13840 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
,
13843 if (exprstmt
!= error_mark_node
13844 && (TREE_CODE (exprstmt
) != NOP_EXPR
13845 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
13846 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
13848 if (exprstmt
!= void_zero_node
)
13849 /* Don't call `expand_expr_stmt' if we're not going to do
13850 anything, since -Wall will give a diagnostic. */
13851 finish_expr_stmt (exprstmt
);
13853 /* Run destructors for all virtual baseclasses. */
13854 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13859 if_stmt
= begin_if_stmt ();
13860 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13861 current_in_charge_parm
,
13865 vbases
= CLASSTYPE_VBASECLASSES (current_class_type
);
13866 /* The CLASSTYPE_VBASECLASSES list is in initialization
13867 order, so we have to march through it in reverse order. */
13868 for (vbases
= nreverse (copy_list (vbases
));
13870 vbases
= TREE_CHAIN (vbases
))
13872 tree vbase
= TREE_VALUE (vbases
);
13874 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (BINFO_TYPE (vbase
)))
13876 tree vb
= get_vbase
13877 (BINFO_TYPE (vbase
),
13878 TYPE_BINFO (current_class_type
));
13880 (build_scoped_method_call
13881 (current_class_ref
, vb
, base_dtor_identifier
,
13886 finish_then_clause (if_stmt
);
13891 virtual_size
= c_sizeof (current_class_type
);
13893 /* At the end, call delete if that's what's requested. */
13895 /* FDIS sez: At the point of definition of a virtual destructor
13896 (including an implicit definition), non-placement operator delete
13897 shall be looked up in the scope of the destructor's class and if
13898 found shall be accessible and unambiguous.
13900 This is somewhat unclear, but I take it to mean that if the class
13901 only defines placement deletes we don't do anything here. So we
13902 pass LOOKUP_SPECULATIVELY; delete_sanity will complain for us if
13903 they ever try to delete one of these. */
13904 exprstmt
= build_op_delete_call
13905 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
13906 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
13908 if_stmt
= begin_if_stmt ();
13909 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13910 current_in_charge_parm
,
13913 finish_expr_stmt (exprstmt
);
13914 finish_then_clause (if_stmt
);
13917 /* Close the block we started above. */
13918 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
13921 /* Finish up a function declaration and compile that function
13922 all the way to assembler language output. The free the storage
13923 for the function definition.
13925 FLAGS is a bitwise or of the following values:
13927 An extra call to poplevel (and expand_end_bindings) must be
13928 made to take care of the binding contour for the base
13929 initializers. This is only relevant for constructors.
13931 We just finished processing the body of an in-class inline
13932 function definition. (This processing will have taken place
13933 after the class definition is complete.) */
13936 finish_function (flags
)
13939 register tree fndecl
= current_function_decl
;
13940 tree fntype
, ctype
= NULL_TREE
;
13941 int call_poplevel
= (flags
& 1) != 0;
13942 int inclass_inline
= (flags
& 2) != 0;
13945 /* When we get some parse errors, we can end up without a
13946 current_function_decl, so cope. */
13947 if (fndecl
== NULL_TREE
)
13948 return error_mark_node
;
13950 nested
= function_depth
> 1;
13951 fntype
= TREE_TYPE (fndecl
);
13953 /* TREE_READONLY (fndecl) = 1;
13954 This caused &foo to be of type ptr-to-const-function
13955 which then got a warning when stored in a ptr-to-function variable. */
13957 my_friendly_assert (building_stmt_tree (), 20000911);
13959 /* For a cloned function, we've already got all the code we need;
13960 there's no need to add any extra bits. */
13961 if (!DECL_CLONED_FUNCTION_P (fndecl
))
13963 if (DECL_CONSTRUCTOR_P (fndecl
))
13965 finish_constructor_body ();
13969 else if (DECL_DESTRUCTOR_P (fndecl
) && !processing_template_decl
)
13970 finish_destructor_body ();
13971 else if (DECL_MAIN_P (fndecl
))
13973 /* Make it so that `main' always returns 0 by default. */
13975 finish_return_stmt (integer_one_node
);
13977 finish_return_stmt (integer_zero_node
);
13981 /* Finish dealing with exception specifiers. */
13982 if (flag_exceptions
&& !processing_template_decl
13983 && flag_enforce_eh_specs
13984 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13985 expand_end_eh_spec (TYPE_RAISES_EXCEPTIONS
13986 (TREE_TYPE (current_function_decl
)),
13987 current_eh_spec_try_block
);
13990 /* If we're saving up tree structure, tie off the function now. */
13991 finish_stmt_tree (&DECL_SAVED_TREE (fndecl
));
13993 /* This must come after expand_function_end because cleanups might
13994 have declarations (from inline functions) that need to go into
13995 this function's blocks. */
13996 if (current_binding_level
->parm_flag
!= 1)
13997 my_friendly_abort (122);
13998 poplevel (1, 0, 1);
14000 /* Remember that we were in class scope. */
14001 if (current_class_name
)
14002 ctype
= current_class_type
;
14004 /* Must mark the RESULT_DECL as being in this function. */
14005 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
14007 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
14008 to the FUNCTION_DECL node itself. */
14009 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
14011 /* Save away current state, if appropriate. */
14012 if (!processing_template_decl
)
14013 save_function_data (fndecl
);
14015 /* If this function calls `setjmp' it cannot be inlined. When
14016 `longjmp' is called it is not guaranteed to restore the value of
14017 local variables that have been modified since the call to
14018 `setjmp'. So, if were to inline this function into some caller
14019 `c', then when we `longjmp', we might not restore all variables
14020 in `c'. (It might seem, at first blush, that there's no way for
14021 this function to modify local variables in `c', but their
14022 addresses may have been stored somewhere accessible to this
14024 if (!processing_template_decl
&& calls_setjmp_p (fndecl
))
14025 DECL_UNINLINABLE (fndecl
) = 1;
14027 /* Clear out memory we no longer need. */
14028 free_after_parsing (cfun
);
14029 /* Since we never call rest_of_compilation, we never clear
14030 CFUN. Do so explicitly. */
14031 free_after_compilation (cfun
);
14034 /* If this is a in-class inline definition, we may have to pop the
14035 bindings for the template parameters that we added in
14036 maybe_begin_member_template_processing when start_function was
14038 if (inclass_inline
)
14039 maybe_end_member_template_processing ();
14041 /* Leave the scope of the class. */
14043 pop_nested_class ();
14049 /* Let the error reporting routines know that we're outside a
14050 function. For a nested function, this value is used in
14051 pop_cp_function_context and then reset via pop_function_context. */
14052 current_function_decl
= NULL_TREE
;
14057 /* Create the FUNCTION_DECL for a function definition.
14058 DECLSPECS and DECLARATOR are the parts of the declaration;
14059 they describe the return type and the name of the function,
14060 but twisted together in a fashion that parallels the syntax of C.
14062 This function creates a binding context for the function body
14063 as well as setting up the FUNCTION_DECL in current_function_decl.
14065 Returns a FUNCTION_DECL on success.
14067 If the DECLARATOR is not suitable for a function (it defines a datum
14068 instead), we return 0, which tells yyparse to report a parse error.
14070 May return void_type_node indicating that this method is actually
14071 a friend. See grokfield for more details.
14073 Came here with a `.pushlevel' .
14075 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14076 CHANGES TO CODE IN `grokfield'. */
14079 start_method (declspecs
, declarator
, attrlist
)
14080 tree declarator
, declspecs
, attrlist
;
14082 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
14085 /* Something too ugly to handle. */
14086 if (fndecl
== NULL_TREE
)
14089 /* Pass friends other than inline friend functions back. */
14090 if (fndecl
== void_type_node
)
14093 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
14094 /* Not a function, tell parser to report parse error. */
14097 if (DECL_IN_AGGR_P (fndecl
))
14099 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
14101 if (DECL_CONTEXT (fndecl
)
14102 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
14103 cp_error ("`%D' is already defined in class `%T'", fndecl
,
14104 DECL_CONTEXT (fndecl
));
14106 return void_type_node
;
14109 check_template_shadow (fndecl
);
14111 DECL_THIS_INLINE (fndecl
) = 1;
14113 if (flag_default_inline
)
14114 DECL_INLINE (fndecl
) = 1;
14116 /* We process method specializations in finish_struct_1. */
14117 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
14118 fndecl
= push_template_decl (fndecl
);
14120 if (! DECL_FRIEND_P (fndecl
))
14122 if (TREE_CHAIN (fndecl
))
14124 fndecl
= copy_node (fndecl
);
14125 TREE_CHAIN (fndecl
) = NULL_TREE
;
14128 if (DECL_CONSTRUCTOR_P (fndecl
))
14130 if (! grok_ctor_properties (current_class_type
, fndecl
))
14131 return void_type_node
;
14133 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
14134 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
14137 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0);
14139 /* Make a place for the parms */
14141 current_binding_level
->parm_flag
= 1;
14143 DECL_IN_AGGR_P (fndecl
) = 1;
14147 /* Go through the motions of finishing a function definition.
14148 We don't compile this method until after the whole class has
14151 FINISH_METHOD must return something that looks as though it
14152 came from GROKFIELD (since we are defining a method, after all).
14154 This is called after parsing the body of the function definition.
14155 STMTS is the chain of statements that makes up the function body.
14157 DECL is the ..._DECL that `start_method' provided. */
14160 finish_method (decl
)
14163 register tree fndecl
= decl
;
14166 register tree link
;
14168 if (decl
== void_type_node
)
14171 old_initial
= DECL_INITIAL (fndecl
);
14173 /* Undo the level for the parms (from start_method).
14174 This is like poplevel, but it causes nothing to be
14175 saved. Saving information here confuses symbol-table
14176 output routines. Besides, this information will
14177 be correctly output when this method is actually
14180 /* Clear out the meanings of the local variables of this level;
14181 also record in each decl which block it belongs to. */
14183 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
14185 if (DECL_NAME (link
) != NULL_TREE
)
14186 pop_binding (DECL_NAME (link
), link
);
14187 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
14188 DECL_CONTEXT (link
) = NULL_TREE
;
14191 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
14192 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
14193 current_binding_level
->parm_flag
,
14194 current_binding_level
->keep
);
14196 poplevel (0, 0, 0);
14198 DECL_INITIAL (fndecl
) = old_initial
;
14200 /* We used to check if the context of FNDECL was different from
14201 current_class_type as another way to get inside here. This didn't work
14202 for String.cc in libg++. */
14203 if (DECL_FRIEND_P (fndecl
))
14205 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
14206 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
14207 decl
= void_type_node
;
14213 /* Called when a new struct TYPE is defined.
14214 If this structure or union completes the type of any previous
14215 variable declaration, lay it out and output its rtl. */
14218 hack_incomplete_structures (type
)
14222 struct binding_level
*level
;
14224 if (!type
) /* Don't do this for class templates. */
14227 if (namespace_bindings_p ())
14230 list
= &namespace_scope_incomplete
;
14234 level
= innermost_nonclass_level ();
14235 list
= &level
->incomplete
;
14242 tree decl
= TREE_VALUE (*list
);
14243 if ((decl
&& TREE_TYPE (decl
) == type
)
14244 || (TREE_TYPE (decl
)
14245 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14246 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
14248 int toplevel
= toplevel_bindings_p ();
14249 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14250 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
14251 layout_type (TREE_TYPE (decl
));
14252 layout_decl (decl
, 0);
14253 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
14257 expand_decl (decl
);
14258 cleanup
= maybe_build_cleanup (decl
);
14259 expand_decl_init (decl
);
14260 if (! expand_decl_cleanup (decl
, cleanup
))
14261 cp_error ("parser lost in parsing declaration of `%D'",
14264 *list
= TREE_CHAIN (*list
);
14267 list
= &TREE_CHAIN (*list
);
14270 /* Keep looking through artificial binding levels generated
14271 for local variables. */
14272 if (level
&& level
->keep
== 2)
14274 level
= level
->level_chain
;
14275 list
= &level
->incomplete
;
14282 /* If DECL is of a type which needs a cleanup, build that cleanup
14286 maybe_build_cleanup (decl
)
14289 tree type
= TREE_TYPE (decl
);
14291 if (type
!= error_mark_node
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
14293 int flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14296 if (TREE_CODE (type
) == ARRAY_TYPE
)
14300 mark_addressable (decl
);
14301 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14304 /* Optimize for space over speed here. */
14305 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14306 || flag_expensive_optimizations
)
14307 flags
|= LOOKUP_NONVIRTUAL
;
14309 rval
= build_delete (TREE_TYPE (rval
), rval
,
14310 sfk_complete_destructor
, flags
, 0);
14312 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14313 && ! TYPE_HAS_DESTRUCTOR (type
))
14314 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14315 build_tree_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14322 /* When a stmt has been parsed, this function is called. */
14327 /* Always assume this statement was not an expression statement. If
14328 it actually was an expression statement, its our callers
14329 responsibility to fix this up. */
14330 last_expr_type
= NULL_TREE
;
14333 /* DECL was originally constructed as a non-static member function,
14334 but turned out to be static. Update it accordingly. */
14337 revert_static_member_fn (decl
)
14341 tree function
= TREE_TYPE (decl
);
14342 tree args
= TYPE_ARG_TYPES (function
);
14344 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14345 != TYPE_UNQUALIFIED
)
14346 cp_error ("static member function `%#D' declared with type qualifiers",
14349 args
= TREE_CHAIN (args
);
14350 tmp
= build_function_type (TREE_TYPE (function
), args
);
14351 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14352 tmp
= build_exception_variant (tmp
,
14353 TYPE_RAISES_EXCEPTIONS (function
));
14354 TREE_TYPE (decl
) = tmp
;
14355 if (DECL_ARGUMENTS (decl
))
14356 DECL_ARGUMENTS (decl
) = TREE_CHAIN (DECL_ARGUMENTS (decl
));
14357 DECL_STATIC_FUNCTION_P (decl
) = 1;
14360 /* Initialize the variables used during compilation of a C++
14364 push_cp_function_context (f
)
14365 struct function
*f
;
14367 struct cp_language_function
*p
14368 = ((struct cp_language_function
*)
14369 xcalloc (1, sizeof (struct cp_language_function
)));
14370 f
->language
= (struct language_function
*) p
;
14372 /* It takes an explicit call to expand_body to generate RTL for a
14376 /* Whenever we start a new function, we destroy temporaries in the
14378 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
14381 /* Free the language-specific parts of F, now that we've finished
14382 compiling the function. */
14385 pop_cp_function_context (f
)
14386 struct function
*f
;
14389 free (f
->language
);
14393 /* Mark P for GC. */
14396 mark_lang_function (p
)
14397 struct cp_language_function
*p
;
14402 mark_c_language_function (&p
->base
);
14404 ggc_mark_tree (p
->x_ctor_label
);
14405 ggc_mark_tree (p
->x_dtor_label
);
14406 ggc_mark_tree (p
->x_current_class_ptr
);
14407 ggc_mark_tree (p
->x_current_class_ref
);
14408 ggc_mark_tree (p
->x_eh_spec_try_block
);
14410 mark_named_label_lists (&p
->x_named_labels
, &p
->x_named_label_uses
);
14411 mark_binding_level (&p
->bindings
);
14414 /* Mark the language-specific data in F for GC. */
14417 mark_cp_function_context (f
)
14418 struct function
*f
;
14420 mark_lang_function ((struct cp_language_function
*) f
->language
);
14427 enum tree_code code
= TREE_CODE (t
);
14428 if (code
== IDENTIFIER_NODE
)
14430 struct lang_identifier
*li
= (struct lang_identifier
*) t
;
14431 struct lang_id2
*li2
= li
->x
;
14432 ggc_mark_tree (li
->namespace_bindings
);
14433 ggc_mark_tree (li
->bindings
);
14434 ggc_mark_tree (li
->class_value
);
14435 ggc_mark_tree (li
->class_template_info
);
14439 ggc_mark_tree (li2
->label_value
);
14440 ggc_mark_tree (li2
->implicit_decl
);
14441 ggc_mark_tree (li2
->error_locus
);
14444 else if (code
== CPLUS_BINDING
)
14446 if (BINDING_HAS_LEVEL_P (t
))
14447 mark_binding_level (&BINDING_LEVEL (t
));
14449 ggc_mark_tree (BINDING_SCOPE (t
));
14450 ggc_mark_tree (BINDING_VALUE (t
));
14452 else if (code
== OVERLOAD
)
14453 ggc_mark_tree (OVL_FUNCTION (t
));
14454 else if (code
== TEMPLATE_PARM_INDEX
)
14455 ggc_mark_tree (TEMPLATE_PARM_DECL (t
));
14456 else if (TREE_CODE_CLASS (code
) == 'd')
14458 struct lang_decl
*ld
= DECL_LANG_SPECIFIC (t
);
14463 c_mark_lang_decl (&ld
->decl_flags
.base
);
14464 if (!DECL_GLOBAL_CTOR_P (t
)
14465 && !DECL_GLOBAL_DTOR_P (t
)
14466 && !DECL_THUNK_P (t
))
14467 ggc_mark_tree (ld
->decl_flags
.u2
.access
);
14468 else if (DECL_THUNK_P (t
))
14469 ggc_mark_tree (ld
->decl_flags
.u2
.vcall_offset
);
14470 if (TREE_CODE (t
) != NAMESPACE_DECL
)
14471 ggc_mark_tree (ld
->decl_flags
.u
.template_info
);
14473 mark_binding_level (&NAMESPACE_LEVEL (t
));
14474 if (CAN_HAVE_FULL_LANG_DECL_P (t
))
14476 ggc_mark_tree (ld
->befriending_classes
);
14477 ggc_mark_tree (ld
->context
);
14478 ggc_mark_tree (ld
->cloned_function
);
14479 if (!DECL_OVERLOADED_OPERATOR_P (t
))
14480 ggc_mark_tree (ld
->u2
.vtt_parm
);
14481 if (TREE_CODE (t
) == TYPE_DECL
)
14482 ggc_mark_tree (ld
->u
.sorted_fields
);
14483 else if (TREE_CODE (t
) == FUNCTION_DECL
14484 && !DECL_PENDING_INLINE_P (t
))
14485 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t
));
14489 else if (TREE_CODE_CLASS (code
) == 't')
14491 struct lang_type
*lt
= TYPE_LANG_SPECIFIC (t
);
14493 if (lt
&& !(TREE_CODE (t
) == POINTER_TYPE
14494 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
14497 ggc_mark_tree (lt
->primary_base
);
14498 ggc_mark_tree (lt
->vfields
);
14499 ggc_mark_tree (lt
->vbases
);
14500 ggc_mark_tree (lt
->tags
);
14501 ggc_mark_tree (lt
->size
);
14502 ggc_mark_tree (lt
->pure_virtuals
);
14503 ggc_mark_tree (lt
->friend_classes
);
14504 ggc_mark_tree (lt
->rtti
);
14505 ggc_mark_tree (lt
->methods
);
14506 ggc_mark_tree (lt
->template_info
);
14507 ggc_mark_tree (lt
->befriending_classes
);
14510 /* In the case of pointer-to-member function types, the
14511 TYPE_LANG_SPECIFIC is really just a tree. */
14512 ggc_mark_tree ((tree
) lt
);
14516 /* Return the IDENTIFIER_GLOBAL_VALUE of T, for use in common code, since
14517 the definition of IDENTIFIER_GLOBAL_VALUE is different for C and C++. */
14520 identifier_global_value (t
)
14523 return IDENTIFIER_GLOBAL_VALUE (t
);
14526 /* Build the void_list_node (void_type_node having been created). */
14528 build_void_list_node ()
14530 tree t
= build_tree_list (NULL_TREE
, void_type_node
);
14531 TREE_PARMLIST (t
) = 1;
14536 cp_missing_noreturn_ok_p (decl
)
14539 /* A missing noreturn is ok for the `main' function. */
14540 return MAIN_NAME_P (DECL_ASSEMBLER_NAME (decl
));