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. */
47 extern int current_class_depth
;
49 extern tree global_namespace
;
51 extern int (*valid_lang_attribute
) PARAMS ((tree
, tree
, tree
, tree
));
53 #ifndef BOOL_TYPE_SIZE
54 #ifdef SLOW_BYTE_ACCESS
55 /* In the new ABI, `bool' has size and alignment `1', on all
57 #define BOOL_TYPE_SIZE \
58 ((SLOW_BYTE_ACCESS && !flag_new_abi) ? (POINTER_SIZE) : (CHAR_TYPE_SIZE))
60 #define BOOL_TYPE_SIZE CHAR_TYPE_SIZE
64 static tree grokparms
PARAMS ((tree
));
65 static const char *redeclaration_error_message
PARAMS ((tree
, tree
));
67 static void push_binding_level
PARAMS ((struct binding_level
*, int,
69 static void pop_binding_level
PARAMS ((void));
70 static void suspend_binding_level
PARAMS ((void));
71 static void resume_binding_level
PARAMS ((struct binding_level
*));
72 static struct binding_level
*make_binding_level
PARAMS ((void));
73 static void declare_namespace_level
PARAMS ((void));
74 static int decl_jump_unsafe
PARAMS ((tree
));
75 static void storedecls
PARAMS ((tree
));
76 static void require_complete_types_for_parms
PARAMS ((tree
));
77 static int ambi_op_p
PARAMS ((enum tree_code
));
78 static int unary_op_p
PARAMS ((enum tree_code
));
79 static tree store_bindings
PARAMS ((tree
, tree
));
80 static tree lookup_tag_reverse
PARAMS ((tree
, tree
));
81 static tree obscure_complex_init
PARAMS ((tree
, tree
));
82 static tree lookup_name_real
PARAMS ((tree
, int, int, int));
83 static void warn_extern_redeclared_static
PARAMS ((tree
, tree
));
84 static void grok_reference_init
PARAMS ((tree
, tree
, tree
));
85 static tree grokfndecl
PARAMS ((tree
, tree
, tree
, tree
, int,
86 enum overload_flags
, tree
,
87 tree
, int, int, int, int, int, int, tree
));
88 static tree grokvardecl
PARAMS ((tree
, tree
, RID_BIT_TYPE
*, int, int, tree
));
89 static tree lookup_tag
PARAMS ((enum tree_code
, tree
,
90 struct binding_level
*, int));
91 static void set_identifier_type_value_with_scope
92 PARAMS ((tree
, tree
, struct binding_level
*));
93 static void record_unknown_type
PARAMS ((tree
, const char *));
94 static tree build_library_fn_1
PARAMS ((tree
, enum tree_code
, tree
));
95 static int member_function_or_else
PARAMS ((tree
, tree
, enum overload_flags
));
96 static void bad_specifiers
PARAMS ((tree
, const char *, int, int, int, int,
98 static tree maybe_process_template_type_declaration
PARAMS ((tree
, int, struct binding_level
*));
99 static void check_for_uninitialized_const_var
PARAMS ((tree
));
100 static unsigned long typename_hash
PARAMS ((hash_table_key
));
101 static boolean typename_compare
PARAMS ((hash_table_key
, hash_table_key
));
102 static void push_binding
PARAMS ((tree
, tree
, struct binding_level
*));
103 static int add_binding
PARAMS ((tree
, tree
));
104 static void pop_binding
PARAMS ((tree
, tree
));
105 static tree local_variable_p_walkfn
PARAMS ((tree
*, int *, void *));
106 static tree find_binding
PARAMS ((tree
, tree
));
107 static tree select_decl
PARAMS ((tree
, int));
108 static int lookup_flags
PARAMS ((int, int));
109 static tree qualify_lookup
PARAMS ((tree
, int));
110 static tree record_builtin_java_type
PARAMS ((const char *, int));
111 static const char *tag_name
PARAMS ((enum tag_types code
));
112 static void find_class_binding_level
PARAMS ((void));
113 static struct binding_level
*innermost_nonclass_level
PARAMS ((void));
114 static void warn_about_implicit_typename_lookup
PARAMS ((tree
, tree
));
115 static int walk_namespaces_r
PARAMS ((tree
, walk_namespaces_fn
, void *));
116 static int walk_globals_r
PARAMS ((tree
, void *));
117 static void add_decl_to_level
PARAMS ((tree
, struct binding_level
*));
118 static tree make_label_decl
PARAMS ((tree
, int));
119 static void use_label
PARAMS ((tree
));
120 static void check_previous_goto_1
PARAMS ((tree
, struct binding_level
*, tree
,
122 static void check_previous_goto
PARAMS ((struct named_label_use_list
*));
123 static void check_switch_goto
PARAMS ((struct binding_level
*));
124 static void check_previous_gotos
PARAMS ((tree
));
125 static void pop_label
PARAMS ((tree
, tree
));
126 static void pop_labels
PARAMS ((tree
));
127 static void maybe_deduce_size_from_array_init
PARAMS ((tree
, tree
));
128 static void layout_var_decl
PARAMS ((tree
));
129 static void maybe_commonize_var
PARAMS ((tree
));
130 static tree check_initializer
PARAMS ((tree
, tree
));
131 static void make_rtl_for_nonlocal_decl
PARAMS ((tree
, tree
, const char *));
132 static void push_cp_function_context
PARAMS ((struct function
*));
133 static void pop_cp_function_context
PARAMS ((struct function
*));
134 static void mark_binding_level
PARAMS ((void *));
135 static void mark_named_label_lists
PARAMS ((void *, void *));
136 static void mark_cp_function_context
PARAMS ((struct function
*));
137 static void mark_saved_scope
PARAMS ((void *));
138 static void mark_lang_function
PARAMS ((struct cp_language_function
*));
139 static void save_function_data
PARAMS ((tree
));
140 static void check_function_type
PARAMS ((tree
, tree
));
141 static void destroy_local_var
PARAMS ((tree
));
142 static void finish_constructor_body
PARAMS ((void));
143 static void finish_destructor_body
PARAMS ((void));
144 static tree create_array_type_for_decl
PARAMS ((tree
, tree
, tree
));
145 static tree get_atexit_node
PARAMS ((void));
146 static tree get_dso_handle_node
PARAMS ((void));
147 static tree start_cleanup_fn
PARAMS ((void));
148 static void end_cleanup_fn
PARAMS ((void));
149 static tree cp_make_fname_decl
PARAMS ((tree
, const char *, int));
150 static void initialize_predefined_identifiers
PARAMS ((void));
151 static tree check_special_function_return_type
152 PARAMS ((special_function_kind
, tree
, tree
, tree
));
153 static tree push_cp_library_fn
PARAMS ((enum tree_code
, tree
));
154 static tree build_cp_library_fn
PARAMS ((tree
, enum tree_code
, tree
));
155 static void store_parm_decls
PARAMS ((tree
));
156 static int cp_missing_noreturn_ok_p
PARAMS ((tree
));
158 #if defined (DEBUG_CP_BINDING_LEVELS)
159 static void indent
PARAMS ((void));
162 /* Erroneous argument lists can use this *IFF* they do not modify it. */
163 tree error_mark_list
;
165 /* The following symbols are subsumed in the cp_global_trees array, and
166 listed here individually for documentation purposes.
169 tree wchar_decl_node;
171 tree vtable_entry_type;
172 tree delta_type_node;
175 tree __baselist_desc_type_node;
176 tree __i_desc_type_node, __m_desc_type_node;
177 tree __t_desc_array_type, __i_desc_array_type, __m_desc_array_type;
179 tree __t_desc_type_node;
181 tree __tp_desc_type_node;
183 tree ti_desc_type_node;
184 tree bltn_desc_type_node, ptr_desc_type_node;
185 tree ary_desc_type_node, func_desc_type_node, enum_desc_type_node;
186 tree class_desc_type_node, si_class_desc_type_node, vmi_class_desc_type_node;
187 tree ptm_desc_type_node;
188 tree base_desc_type_node;
190 Not needed yet? May be needed one day?
191 tree __bltn_desc_array_type, __user_desc_array_type, __class_desc_array_type;
192 tree __ptr_desc_array_type, __attr_dec_array_type, __func_desc_array_type;
193 tree __ptmf_desc_array_type, __ptmd_desc_array_type;
196 tree class_type_node, record_type_node, union_type_node, enum_type_node;
197 tree unknown_type_node;
199 Array type `vtable_entry_type[]'
202 tree vtbl_ptr_type_node;
209 A FUNCTION_DECL which can call `abort'. Not necessarily the
210 one that the user will declare, but sufficient to be called
211 by routines that want to abort the program.
215 The FUNCTION_DECL for the default `::operator delete'.
217 tree global_delete_fndecl;
220 tree type_info_type_node, tinfo_decl_id, tinfo_decl_type;
225 tree cp_global_trees
[CPTI_MAX
];
227 /* Indicates that there is a type value in some namespace, although
228 that is not necessarily in scope at the moment. */
230 static tree global_type_node
;
232 /* If non-zero, this is the number of times we have entered the `std'
233 namespace when we are treating that namespace as an alias for the
235 static int in_fake_std
;
237 /* Expect only namespace names now. */
238 static int only_namespace_names
;
240 /* Used only for jumps to as-yet undefined labels, since jumps to
241 defined labels can have their validity checked immediately. */
243 struct named_label_use_list
245 struct binding_level
*binding_level
;
248 const char *filename_o_goto
;
250 struct named_label_use_list
*next
;
253 #define named_label_uses cp_function_chain->x_named_label_uses
255 /* A list of objects which have constructors or destructors
256 which reside in the global scope. The decl is stored in
257 the TREE_VALUE slot and the initializer is stored
258 in the TREE_PURPOSE slot. */
259 tree static_aggregates
;
263 /* A node for the integer constants 2, and 3. */
265 tree integer_two_node
, integer_three_node
;
267 /* Parsing a function declarator leaves here a chain of structure
268 and enum types declared in the parmlist. */
270 static tree last_function_parm_tags
;
272 /* Similar, for last_function_parm_tags. */
273 tree last_function_parms
;
274 static tree current_function_parm_tags
;
276 /* A list of all LABEL_DECLs in the function that have names. Here so
277 we can clear out their names' definitions at the end of the
278 function, and so we can check the validity of jumps to these labels. */
280 struct named_label_list
282 struct binding_level
*binding_level
;
288 struct named_label_list
*next
;
291 #define named_labels cp_function_chain->x_named_labels
293 /* Set to 0 at beginning of a function definition, and whenever
294 a label (case or named) is defined. Set to value of expression
295 returned from function when that value can be transformed into
296 a named return value. */
298 tree current_function_return_value
;
300 /* Nonzero means use the ISO C94 dialect of C. */
304 /* Nonzero means use the ISO C99 dialect of C. */
308 /* Nonzero means we are a hosted implementation for code shared with C. */
312 /* Nonzero means add default format_arg attributes for functions not
315 int flag_noniso_default_format_attributes
= 1;
317 /* Nonzero if we want to conserve space in the .o files. We do this
318 by putting uninitialized data and runtime initialized data into
319 .common instead of .data at the expense of not flagging multiple
321 extern int flag_conserve_space
;
323 /* C and C++ flags are in decl2.c. */
325 /* Flag used when debugging spew.c */
327 extern int spew_debug
;
329 /* A expression of value 0 with the same precision as a sizetype
331 tree signed_size_zero_node
;
333 /* The name of the anonymous namespace, throughout this translation
335 tree anonymous_namespace_name
;
337 /* The number of function bodies which we are currently processing.
338 (Zero if we are at namespace scope, one inside the body of a
339 function, two inside the body of a function in a local class, etc.) */
342 /* For each binding contour we allocate a binding_level structure
343 which records the names defined in that contour.
346 1) one for each function definition,
347 where internal declarations of the parameters appear.
348 2) one for each compound statement,
349 to record its declarations.
351 The current meaning of a name can be found by searching the levels
352 from the current one out to the global one.
354 Off to the side, may be the class_binding_level. This exists only
355 to catch class-local declarations. It is otherwise nonexistent.
357 Also there may be binding levels that catch cleanups that must be
358 run when exceptions occur. Thus, to see whether a name is bound in
359 the current scope, it is not enough to look in the
360 CURRENT_BINDING_LEVEL. You should use lookup_name_current_level
363 /* Note that the information in the `names' component of the global contour
364 is duplicated in the IDENTIFIER_GLOBAL_VALUEs of all identifiers. */
368 /* A chain of _DECL nodes for all variables, constants, functions,
369 and typedef types. These are in the reverse of the order
370 supplied. There may be OVERLOADs on this list, too, but they
371 are wrapped in TREE_LISTs; the TREE_VALUE is the OVERLOAD. */
374 /* A list of structure, union and enum definitions, for looking up
376 It is a chain of TREE_LIST nodes, each of whose TREE_PURPOSE is a name,
377 or NULL_TREE; and whose TREE_VALUE is a RECORD_TYPE, UNION_TYPE,
378 or ENUMERAL_TYPE node.
380 C++: the TREE_VALUE nodes can be simple types for
381 component_bindings. */
384 /* A list of USING_DECL nodes. */
387 /* A list of used namespaces. PURPOSE is the namespace,
388 VALUE the common ancestor with this binding_level's namespace. */
389 tree using_directives
;
391 /* If this binding level is the binding level for a class, then
392 class_shadowed is a TREE_LIST. The TREE_PURPOSE of each node
393 is the name of an entity bound in the class. The TREE_TYPE is
394 the DECL bound by this name in the class. */
397 /* Similar to class_shadowed, but for IDENTIFIER_TYPE_VALUE, and
398 is used for all binding levels. In addition the TREE_VALUE is the
399 IDENTIFIER_TYPE_VALUE before we entered the class. */
402 /* A TREE_LIST. Each TREE_VALUE is the LABEL_DECL for a local
403 label in this scope. The TREE_PURPOSE is the previous value of
404 the IDENTIFIER_LABEL VALUE. */
405 tree shadowed_labels
;
407 /* For each level (except not the global one),
408 a chain of BLOCK nodes for all the levels
409 that were entered and exited one level down. */
412 /* The _TYPE node for this level, if parm_flag == 2. */
415 /* The binding level which this one is contained in (inherits from). */
416 struct binding_level
*level_chain
;
418 /* List of decls in `names' that have incomplete
419 structure or union types. */
422 /* List of VAR_DECLS saved from a previous for statement.
423 These would be dead in ISO-conforming code, but might
424 be referenced in ARM-era code. These are stored in a
425 TREE_LIST; the TREE_VALUE is the actual declaration. */
426 tree dead_vars_from_for
;
428 /* 1 for the level that holds the parameters of a function.
429 2 for the level that holds a class declaration. */
430 unsigned parm_flag
: 2;
432 /* 1 means make a BLOCK for this level regardless of all else.
433 2 for temporary binding contours created by the compiler. */
436 /* Nonzero if this level "doesn't exist" for tags. */
437 unsigned tag_transparent
: 1;
439 /* Nonzero if this level can safely have additional
440 cleanup-needing variables added to it. */
441 unsigned more_cleanups_ok
: 1;
442 unsigned have_cleanups
: 1;
444 /* Nonzero if this scope is for storing the decls for template
445 parameters and generic decls; these decls will be discarded and
446 replaced with a TEMPLATE_DECL. */
447 unsigned template_parms_p
: 1;
449 /* Nonzero if this scope corresponds to the `<>' in a
450 `template <>' clause. Whenever this flag is set,
451 TEMPLATE_PARMS_P will be set as well. */
452 unsigned template_spec_p
: 1;
454 /* This is set for a namespace binding level. */
455 unsigned namespace_p
: 1;
457 /* True if this level is that of a for-statement where we need to
458 worry about ambiguous (ARM or ISO) scope rules. */
459 unsigned is_for_scope
: 1;
461 /* True if this level corresponds to an EH region, as for a try block.
462 Currently this information is only available while building the
464 unsigned eh_region
: 1;
466 /* Four bits left for this word. */
468 #if defined(DEBUG_CP_BINDING_LEVELS)
469 /* Binding depth at which this level began. */
470 unsigned binding_depth
;
471 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
474 #define NULL_BINDING_LEVEL ((struct binding_level *) NULL)
476 /* The binding level currently in effect. */
478 #define current_binding_level \
480 ? cp_function_chain->bindings \
481 : scope_chain->bindings)
483 /* The binding level of the current class, if any. */
485 #define class_binding_level scope_chain->class_bindings
487 /* A chain of binding_level structures awaiting reuse. */
489 static struct binding_level
*free_binding_level
;
491 /* The outermost binding level, for names of file scope.
492 This is created when the compiler is started and exists
493 through the entire run. */
495 static struct binding_level
*global_binding_level
;
497 /* Nonzero means unconditionally make a BLOCK for the next level pushed. */
499 static int keep_next_level_flag
;
501 #if defined(DEBUG_CP_BINDING_LEVELS)
502 static int binding_depth
= 0;
503 static int is_class_level
= 0;
510 for (i
= 0; i
< binding_depth
*2; i
++)
513 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
515 static tree pushdecl_with_scope
PARAMS ((tree
, struct binding_level
*));
518 push_binding_level (newlevel
, tag_transparent
, keep
)
519 struct binding_level
*newlevel
;
520 int tag_transparent
, keep
;
522 /* Add this level to the front of the chain (stack) of levels that
524 memset ((char*) newlevel
, 0, sizeof (struct binding_level
));
525 newlevel
->level_chain
= current_binding_level
;
526 current_binding_level
= newlevel
;
527 newlevel
->tag_transparent
= tag_transparent
;
528 newlevel
->more_cleanups_ok
= 1;
530 newlevel
->keep
= keep
;
531 #if defined(DEBUG_CP_BINDING_LEVELS)
532 newlevel
->binding_depth
= binding_depth
;
534 fprintf (stderr
, "push %s level 0x%08x line %d\n",
535 (is_class_level
) ? "class" : "block", newlevel
, lineno
);
538 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
541 /* Find the innermost enclosing class scope, and reset
542 CLASS_BINDING_LEVEL appropriately. */
545 find_class_binding_level ()
547 struct binding_level
*level
= current_binding_level
;
549 while (level
&& level
->parm_flag
!= 2)
550 level
= level
->level_chain
;
551 if (level
&& level
->parm_flag
== 2)
552 class_binding_level
= level
;
554 class_binding_level
= 0;
560 if (global_binding_level
)
562 /* Cannot pop a level, if there are none left to pop. */
563 if (current_binding_level
== global_binding_level
)
564 my_friendly_abort (123);
566 /* Pop the current level, and free the structure for reuse. */
567 #if defined(DEBUG_CP_BINDING_LEVELS)
570 fprintf (stderr
, "pop %s level 0x%08x line %d\n",
571 (is_class_level
) ? "class" : "block",
572 current_binding_level
, lineno
);
573 if (is_class_level
!= (current_binding_level
== class_binding_level
))
576 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
579 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
581 register struct binding_level
*level
= current_binding_level
;
582 current_binding_level
= current_binding_level
->level_chain
;
583 level
->level_chain
= free_binding_level
;
584 #if 0 /* defined(DEBUG_CP_BINDING_LEVELS) */
585 if (level
->binding_depth
!= binding_depth
)
587 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
588 free_binding_level
= level
;
589 find_class_binding_level ();
594 suspend_binding_level ()
596 if (class_binding_level
)
597 current_binding_level
= class_binding_level
;
599 if (global_binding_level
)
601 /* Cannot suspend a level, if there are none left to suspend. */
602 if (current_binding_level
== global_binding_level
)
603 my_friendly_abort (123);
605 /* Suspend the current level. */
606 #if defined(DEBUG_CP_BINDING_LEVELS)
609 fprintf (stderr
, "suspend %s level 0x%08x line %d\n",
610 (is_class_level
) ? "class" : "block",
611 current_binding_level
, lineno
);
612 if (is_class_level
!= (current_binding_level
== class_binding_level
))
615 fprintf (stderr
, "XXX is_class_level != (current_binding_level == class_binding_level)\n");
618 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
619 current_binding_level
= current_binding_level
->level_chain
;
620 find_class_binding_level ();
624 resume_binding_level (b
)
625 struct binding_level
*b
;
627 /* Resuming binding levels is meant only for namespaces,
628 and those cannot nest into classes. */
629 my_friendly_assert(!class_binding_level
, 386);
630 /* Also, resuming a non-directly nested namespace is a no-no. */
631 my_friendly_assert(b
->level_chain
== current_binding_level
, 386);
632 current_binding_level
= b
;
633 #if defined(DEBUG_CP_BINDING_LEVELS)
634 b
->binding_depth
= binding_depth
;
636 fprintf (stderr
, "resume %s level 0x%08x line %d\n",
637 (is_class_level
) ? "class" : "block", b
, lineno
);
640 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
643 /* Create a new `struct binding_level'. */
646 struct binding_level
*
647 make_binding_level ()
650 return (struct binding_level
*) xmalloc (sizeof (struct binding_level
));
653 /* Nonzero if we are currently in the global binding level. */
658 return current_binding_level
== global_binding_level
;
661 /* Return the innermost binding level that is not for a class scope. */
663 static struct binding_level
*
664 innermost_nonclass_level ()
666 struct binding_level
*b
;
668 b
= current_binding_level
;
669 while (b
->parm_flag
== 2)
675 /* Nonzero if we are currently in a toplevel binding level. This
676 means either the global binding level or a namespace in a toplevel
677 binding level. Since there are no non-toplevel namespace levels,
678 this really means any namespace or template parameter level. We
679 also include a class whose context is toplevel. */
682 toplevel_bindings_p ()
684 struct binding_level
*b
= innermost_nonclass_level ();
686 return b
->namespace_p
|| b
->template_parms_p
;
689 /* Nonzero if this is a namespace scope, or if we are defining a class
690 which is itself at namespace scope, or whose enclosing class is
691 such a class, etc. */
694 namespace_bindings_p ()
696 struct binding_level
*b
= innermost_nonclass_level ();
698 return b
->namespace_p
;
701 /* If KEEP is non-zero, make a BLOCK node for the next binding level,
702 unconditionally. Otherwise, use the normal logic to decide whether
703 or not to create a BLOCK. */
706 keep_next_level (keep
)
709 keep_next_level_flag
= keep
;
712 /* Nonzero if the current level needs to have a BLOCK made. */
717 return (current_binding_level
->blocks
!= NULL_TREE
718 || current_binding_level
->keep
719 || current_binding_level
->names
!= NULL_TREE
720 || (current_binding_level
->tags
!= NULL_TREE
721 && !current_binding_level
->tag_transparent
));
725 declare_namespace_level ()
727 current_binding_level
->namespace_p
= 1;
730 /* Returns non-zero if this scope was created to store template
734 template_parm_scope_p ()
736 return current_binding_level
->template_parms_p
;
739 /* Returns the kind of template specialization we are currently
740 processing, given that it's declaration contained N_CLASS_SCOPES
741 explicit scope qualifications. */
744 current_tmpl_spec_kind (n_class_scopes
)
747 int n_template_parm_scopes
= 0;
748 int seen_specialization_p
= 0;
749 int innermost_specialization_p
= 0;
750 struct binding_level
*b
;
752 /* Scan through the template parameter scopes. */
753 for (b
= current_binding_level
; b
->template_parms_p
; b
= b
->level_chain
)
755 /* If we see a specialization scope inside a parameter scope,
756 then something is wrong. That corresponds to a declaration
759 template <class T> template <> ...
761 which is always illegal since [temp.expl.spec] forbids the
762 specialization of a class member template if the enclosing
763 class templates are not explicitly specialized as well. */
764 if (b
->template_spec_p
)
766 if (n_template_parm_scopes
== 0)
767 innermost_specialization_p
= 1;
769 seen_specialization_p
= 1;
771 else if (seen_specialization_p
== 1)
772 return tsk_invalid_member_spec
;
774 ++n_template_parm_scopes
;
777 /* Handle explicit instantiations. */
778 if (processing_explicit_instantiation
)
780 if (n_template_parm_scopes
!= 0)
781 /* We've seen a template parameter list during an explicit
782 instantiation. For example:
784 template <class T> template void f(int);
786 This is erroneous. */
787 return tsk_invalid_expl_inst
;
789 return tsk_expl_inst
;
792 if (n_template_parm_scopes
< n_class_scopes
)
793 /* We've not seen enough template headers to match all the
794 specialized classes present. For example:
796 template <class T> void R<T>::S<T>::f(int);
798 This is illegal; there needs to be one set of template
799 parameters for each class. */
800 return tsk_insufficient_parms
;
801 else if (n_template_parm_scopes
== n_class_scopes
)
802 /* We're processing a non-template declaration (even though it may
803 be a member of a template class.) For example:
805 template <class T> void S<T>::f(int);
807 The `class T' maches the `S<T>', leaving no template headers
808 corresponding to the `f'. */
810 else if (n_template_parm_scopes
> n_class_scopes
+ 1)
811 /* We've got too many template headers. For example:
813 template <> template <class T> void f (T);
815 There need to be more enclosing classes. */
816 return tsk_excessive_parms
;
818 /* This must be a template. It's of the form:
820 template <class T> template <class U> void S<T>::f(U);
822 This is a specialization if the innermost level was a
823 specialization; otherwise it's just a definition of the
825 return innermost_specialization_p
? tsk_expl_spec
: tsk_template
;
829 set_class_shadows (shadows
)
832 class_binding_level
->class_shadowed
= shadows
;
835 /* Enter a new binding level.
836 If TAG_TRANSPARENT is nonzero, do so only for the name space of variables,
837 not for that of tags. */
840 pushlevel (tag_transparent
)
843 struct binding_level
*newlevel
;
845 if (cfun
&& !doing_semantic_analysis_p ())
848 /* Reuse or create a struct for this binding level. */
849 #if defined(DEBUG_CP_BINDING_LEVELS)
851 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
852 if (free_binding_level
)
853 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
855 newlevel
= free_binding_level
;
856 free_binding_level
= free_binding_level
->level_chain
;
859 newlevel
= make_binding_level ();
861 push_binding_level (newlevel
, tag_transparent
, keep_next_level_flag
);
862 GNU_xref_start_scope ((HOST_WIDE_INT
) newlevel
);
863 keep_next_level_flag
= 0;
866 /* Enter a new scope. The KIND indicates what kind of scope is being
877 case sk_template_spec
:
878 current_binding_level
->template_spec_p
= 1;
881 case sk_template_parms
:
882 current_binding_level
->template_parms_p
= 1;
886 my_friendly_abort (20000309);
890 /* Exit the current scope. */
899 note_level_for_for ()
901 current_binding_level
->is_for_scope
= 1;
904 /* Record that the current binding level represents a try block. */
909 current_binding_level
->eh_region
= 1;
912 /* For a binding between a name and an entity at a block scope,
913 this is the `struct binding_level' for the block. */
914 #define BINDING_LEVEL(NODE) \
915 (((struct tree_binding*)NODE)->scope.level)
917 /* A free list of CPLUS_BINDING nodes, connected by their
920 static tree free_bindings
;
922 /* Make DECL the innermost binding for ID. The LEVEL is the binding
923 level at which this declaration is being bound. */
926 push_binding (id
, decl
, level
)
929 struct binding_level
* level
;
935 binding
= free_bindings
;
936 free_bindings
= TREE_CHAIN (binding
);
939 binding
= make_node (CPLUS_BINDING
);
941 /* Now, fill in the binding information. */
942 BINDING_VALUE (binding
) = decl
;
943 BINDING_TYPE (binding
) = NULL_TREE
;
944 BINDING_LEVEL (binding
) = level
;
945 INHERITED_VALUE_BINDING_P (binding
) = 0;
946 LOCAL_BINDING_P (binding
) = (level
!= class_binding_level
);
947 BINDING_HAS_LEVEL_P (binding
) = 1;
949 /* And put it on the front of the list of bindings for ID. */
950 TREE_CHAIN (binding
) = IDENTIFIER_BINDING (id
);
951 IDENTIFIER_BINDING (id
) = binding
;
954 /* ID is already bound in the current scope. But, DECL is an
955 additional binding for ID in the same scope. This is the `struct
956 stat' hack whereby a non-typedef class-name or enum-name can be
957 bound at the same level as some other kind of entity. It's the
958 responsibility of the caller to check that inserting this name is
959 legal here. Returns nonzero if the new binding was successful. */
961 add_binding (id
, decl
)
965 tree binding
= IDENTIFIER_BINDING (id
);
968 if (TREE_CODE (decl
) == TYPE_DECL
&& DECL_ARTIFICIAL (decl
))
969 /* The new name is the type name. */
970 BINDING_TYPE (binding
) = decl
;
971 else if (!BINDING_VALUE (binding
))
972 /* This situation arises when push_class_level_binding moves an
973 inherited type-binding out of the way to make room for a new
975 BINDING_VALUE (binding
) = decl
;
976 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
977 && DECL_ARTIFICIAL (BINDING_VALUE (binding
)))
979 /* The old binding was a type name. It was placed in
980 BINDING_VALUE because it was thought, at the point it was
981 declared, to be the only entity with such a name. Move the
982 type name into the type slot; it is now hidden by the new
984 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
985 BINDING_VALUE (binding
) = decl
;
986 INHERITED_VALUE_BINDING_P (binding
) = 0;
988 else if (TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
989 && TREE_CODE (decl
) == TYPE_DECL
990 && DECL_NAME (decl
) == DECL_NAME (BINDING_VALUE (binding
))
991 && same_type_p (TREE_TYPE (decl
),
992 TREE_TYPE (BINDING_VALUE (binding
))))
993 /* We have two typedef-names, both naming the same type to have
994 the same name. This is OK because of:
998 In a given scope, a typedef specifier can be used to redefine
999 the name of any type declared in that scope to refer to the
1000 type to which it already refers. */
1002 /* There can be two block-scope declarations of the same variable,
1003 so long as they are `extern' declarations. */
1004 else if (TREE_CODE (decl
) == VAR_DECL
1005 && TREE_CODE (BINDING_VALUE (binding
)) == VAR_DECL
1006 && DECL_EXTERNAL (decl
)
1007 && DECL_EXTERNAL (BINDING_VALUE (binding
)))
1009 duplicate_decls (decl
, BINDING_VALUE (binding
));
1014 cp_error ("declaration of `%#D'", decl
);
1015 cp_error_at ("conflicts with previous declaration `%#D'",
1016 BINDING_VALUE (binding
));
1023 /* Add DECL to the list of things declared in B. */
1026 add_decl_to_level (decl
, b
)
1028 struct binding_level
*b
;
1030 /* We build up the list in reverse order, and reverse it later if
1032 TREE_CHAIN (decl
) = b
->names
;
1036 /* Bind DECL to ID in the current_binding_level, assumed to be a local
1037 binding level. If PUSH_USING is set in FLAGS, we know that DECL
1038 doesn't really belong to this binding level, that it got here
1039 through a using-declaration. */
1042 push_local_binding (id
, decl
, flags
)
1047 struct binding_level
*b
;
1049 /* Skip over any local classes. This makes sense if we call
1050 push_local_binding with a friend decl of a local class. */
1051 b
= current_binding_level
;
1052 while (b
->parm_flag
== 2)
1055 if (lookup_name_current_level (id
))
1057 /* Supplement the existing binding. */
1058 if (!add_binding (id
, decl
))
1059 /* It didn't work. Something else must be bound at this
1060 level. Do not add DECL to the list of things to pop
1065 /* Create a new binding. */
1066 push_binding (id
, decl
, b
);
1068 if (TREE_CODE (decl
) == OVERLOAD
|| (flags
& PUSH_USING
))
1069 /* We must put the OVERLOAD into a TREE_LIST since the
1070 TREE_CHAIN of an OVERLOAD is already used. Similarly for
1071 decls that got here through a using-declaration. */
1072 decl
= build_tree_list (NULL_TREE
, decl
);
1074 /* And put DECL on the list of things declared by the current
1076 add_decl_to_level (decl
, b
);
1079 /* Bind DECL to ID in the class_binding_level. Returns nonzero if the
1080 binding was successful. */
1083 push_class_binding (id
, decl
)
1088 tree binding
= IDENTIFIER_BINDING (id
);
1091 /* Note that we declared this value so that we can issue an error if
1092 this an illegal redeclaration of a name already used for some
1094 note_name_declared_in_class (id
, decl
);
1096 if (binding
&& BINDING_LEVEL (binding
) == class_binding_level
)
1097 /* Supplement the existing binding. */
1098 result
= add_binding (id
, decl
);
1100 /* Create a new binding. */
1101 push_binding (id
, decl
, class_binding_level
);
1103 /* Update the IDENTIFIER_CLASS_VALUE for this ID to be the
1104 class-level declaration. Note that we do not use DECL here
1105 because of the possibility of the `struct stat' hack; if DECL is
1106 a class-name or enum-name we might prefer a field-name, or some
1108 IDENTIFIER_CLASS_VALUE (id
) = BINDING_VALUE (IDENTIFIER_BINDING (id
));
1110 /* If this is a binding from a base class, mark it as such. */
1111 binding
= IDENTIFIER_BINDING (id
);
1112 if (BINDING_VALUE (binding
) == decl
&& TREE_CODE (decl
) != TREE_LIST
)
1114 /* Any implicit typename must be from a base-class. The
1115 context for an implicit typename declaration is always
1116 the derived class in which the lookup was done, so the checks
1117 based on the context of DECL below will not trigger. */
1118 if (IMPLICIT_TYPENAME_TYPE_DECL_P (decl
))
1119 INHERITED_VALUE_BINDING_P (binding
) = 1;
1122 if (TREE_CODE (decl
) == OVERLOAD
)
1123 context
= CP_DECL_CONTEXT (OVL_CURRENT (decl
));
1126 my_friendly_assert (DECL_P (decl
), 0);
1127 context
= context_for_name_lookup (decl
);
1130 if (is_properly_derived_from (current_class_type
, context
))
1131 INHERITED_VALUE_BINDING_P (binding
) = 1;
1133 INHERITED_VALUE_BINDING_P (binding
) = 0;
1136 else if (BINDING_VALUE (binding
) == decl
)
1137 /* We only encounter a TREE_LIST when push_class_decls detects an
1138 ambiguity. Such an ambiguity can be overridden by a definition
1140 INHERITED_VALUE_BINDING_P (binding
) = 1;
1145 /* Remove the binding for DECL which should be the innermost binding
1149 pop_binding (id
, decl
)
1155 if (id
== NULL_TREE
)
1156 /* It's easiest to write the loops that call this function without
1157 checking whether or not the entities involved have names. We
1158 get here for such an entity. */
1161 /* Get the innermost binding for ID. */
1162 binding
= IDENTIFIER_BINDING (id
);
1164 /* The name should be bound. */
1165 my_friendly_assert (binding
!= NULL_TREE
, 0);
1167 /* The DECL will be either the ordinary binding or the type
1168 binding for this identifier. Remove that binding. */
1169 if (BINDING_VALUE (binding
) == decl
)
1170 BINDING_VALUE (binding
) = NULL_TREE
;
1171 else if (BINDING_TYPE (binding
) == decl
)
1172 BINDING_TYPE (binding
) = NULL_TREE
;
1174 my_friendly_abort (0);
1176 if (!BINDING_VALUE (binding
) && !BINDING_TYPE (binding
))
1178 /* We're completely done with the innermost binding for this
1179 identifier. Unhook it from the list of bindings. */
1180 IDENTIFIER_BINDING (id
) = TREE_CHAIN (binding
);
1182 /* Add it to the free list. */
1183 TREE_CHAIN (binding
) = free_bindings
;
1184 free_bindings
= binding
;
1186 /* Clear the BINDING_LEVEL so the garbage collector doesn't walk
1188 BINDING_LEVEL (binding
) = NULL
;
1192 /* When a label goes out of scope, check to see if that label was used
1193 in a valid manner, and issue any appropriate warnings or errors. */
1196 pop_label (label
, old_value
)
1200 if (!processing_template_decl
&& doing_semantic_analysis_p ())
1202 if (DECL_INITIAL (label
) == NULL_TREE
)
1204 cp_error_at ("label `%D' used but not defined", label
);
1205 /* Avoid crashing later. */
1206 define_label (input_filename
, 1, DECL_NAME (label
));
1208 else if (warn_unused_label
&& !TREE_USED (label
))
1209 cp_warning_at ("label `%D' defined but not used", label
);
1212 SET_IDENTIFIER_LABEL_VALUE (DECL_NAME (label
), old_value
);
1215 /* At the end of a function, all labels declared within the function
1216 go out of scope. BLOCK is the top-level block for the
1223 struct named_label_list
*link
;
1225 /* Clear out the definitions of all label names, since their scopes
1227 for (link
= named_labels
; link
; link
= link
->next
)
1229 pop_label (link
->label_decl
, link
->old_value
);
1230 /* Put the labels into the "variables" of the top-level block,
1231 so debugger can see them. */
1232 TREE_CHAIN (link
->label_decl
) = BLOCK_VARS (block
);
1233 BLOCK_VARS (block
) = link
->label_decl
;
1236 named_labels
= NULL
;
1239 /* Exit a binding level.
1240 Pop the level off, and restore the state of the identifier-decl mappings
1241 that were in effect when this level was entered.
1243 If KEEP == 1, this level had explicit declarations, so
1244 and create a "block" (a BLOCK node) for the level
1245 to record its declarations and subblocks for symbol table output.
1247 If FUNCTIONBODY is nonzero, this level is the body of a function,
1248 so create a block as if KEEP were set and also clear out all
1251 If REVERSE is nonzero, reverse the order of decls before putting
1252 them into the BLOCK. */
1255 poplevel (keep
, reverse
, functionbody
)
1261 /* The chain of decls was accumulated in reverse order.
1262 Put it into forward order, just for cleanliness. */
1264 int tmp
= functionbody
;
1265 int real_functionbody
;
1268 tree block
= NULL_TREE
;
1270 int leaving_for_scope
;
1272 if (cfun
&& !doing_semantic_analysis_p ())
1275 my_friendly_assert (current_binding_level
->parm_flag
!= 2,
1278 real_functionbody
= (current_binding_level
->keep
== 2
1279 ? ((functionbody
= 0), tmp
) : functionbody
);
1280 tags
= functionbody
>= 0 ? current_binding_level
->tags
: 0;
1281 subblocks
= functionbody
>= 0 ? current_binding_level
->blocks
: 0;
1283 my_friendly_assert (!current_binding_level
->class_shadowed
,
1286 /* We used to use KEEP == 2 to indicate that the new block should go
1287 at the beginning of the list of blocks at this binding level,
1288 rather than the end. This hack is no longer used. */
1289 my_friendly_assert (keep
== 0 || keep
== 1, 0);
1291 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
1292 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
1293 current_binding_level
->parm_flag
,
1294 current_binding_level
->keep
);
1296 if (current_binding_level
->keep
== 1)
1299 /* Any uses of undefined labels, and any defined labels, now operate
1300 under constraints of next binding contour. */
1301 if (cfun
&& !functionbody
)
1303 struct binding_level
*level_chain
;
1304 level_chain
= current_binding_level
->level_chain
;
1307 struct named_label_use_list
*uses
;
1308 struct named_label_list
*labels
;
1309 for (labels
= named_labels
; labels
; labels
= labels
->next
)
1310 if (labels
->binding_level
== current_binding_level
)
1313 if (current_binding_level
->eh_region
)
1314 labels
->eh_region
= 1;
1315 for (decl
= labels
->names_in_scope
; decl
;
1316 decl
= TREE_CHAIN (decl
))
1317 if (decl_jump_unsafe (decl
))
1318 labels
->bad_decls
= tree_cons (NULL_TREE
, decl
,
1320 labels
->binding_level
= level_chain
;
1321 labels
->names_in_scope
= level_chain
->names
;
1324 for (uses
= named_label_uses
; uses
; uses
= uses
->next
)
1325 if (uses
->binding_level
== current_binding_level
)
1327 uses
->binding_level
= level_chain
;
1328 uses
->names_in_scope
= level_chain
->names
;
1333 /* Get the decls in the order they were written.
1334 Usually current_binding_level->names is in reverse order.
1335 But parameter decls were previously put in forward order. */
1338 current_binding_level
->names
1339 = decls
= nreverse (current_binding_level
->names
);
1341 decls
= current_binding_level
->names
;
1343 /* Output any nested inline functions within this block
1344 if they weren't already output. */
1345 for (decl
= decls
; decl
; decl
= TREE_CHAIN (decl
))
1346 if (TREE_CODE (decl
) == FUNCTION_DECL
1347 && ! TREE_ASM_WRITTEN (decl
)
1348 && DECL_INITIAL (decl
) != NULL_TREE
1349 && TREE_ADDRESSABLE (decl
)
1350 && decl_function_context (decl
) == current_function_decl
)
1352 /* If this decl was copied from a file-scope decl
1353 on account of a block-scope extern decl,
1354 propagate TREE_ADDRESSABLE to the file-scope decl. */
1355 if (DECL_ABSTRACT_ORIGIN (decl
) != NULL_TREE
)
1356 TREE_ADDRESSABLE (DECL_ABSTRACT_ORIGIN (decl
)) = 1;
1359 push_function_context ();
1360 output_inline_function (decl
);
1361 pop_function_context ();
1365 /* When not in function-at-a-time mode, expand_end_bindings will
1366 warn about unused variables. But, in function-at-a-time mode
1367 expand_end_bindings is not passed the list of variables in the
1368 current scope, and therefore no warning is emitted. So, we
1369 explicitly warn here. */
1370 if (!processing_template_decl
)
1371 warn_about_unused_variables (getdecls ());
1373 /* If there were any declarations or structure tags in that level,
1374 or if this level is a function body,
1375 create a BLOCK to record them for the life of this function. */
1377 if (keep
== 1 || functionbody
)
1378 block
= make_node (BLOCK
);
1379 if (block
!= NULL_TREE
)
1381 BLOCK_VARS (block
) = decls
;
1382 BLOCK_SUBBLOCKS (block
) = subblocks
;
1385 /* In each subblock, record that this is its superior. */
1387 for (link
= subblocks
; link
; link
= TREE_CHAIN (link
))
1388 BLOCK_SUPERCONTEXT (link
) = block
;
1390 /* We still support the old for-scope rules, whereby the variables
1391 in a for-init statement were in scope after the for-statement
1392 ended. We only use the new rules in flag_new_for_scope is
1395 = current_binding_level
->is_for_scope
&& flag_new_for_scope
== 1;
1397 /* Remove declarations for all the DECLs in this level. */
1398 for (link
= decls
; link
; link
= TREE_CHAIN (link
))
1400 if (leaving_for_scope
&& TREE_CODE (link
) == VAR_DECL
1401 && DECL_NAME (link
))
1404 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (link
)));
1408 ns_binding
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (link
));
1410 ns_binding
= NULL_TREE
;
1413 && (BINDING_LEVEL (outer_binding
)
1414 == current_binding_level
->level_chain
))
1415 /* We have something like:
1420 and we are leaving the `for' scope. There's no reason to
1421 keep the binding of the inner `i' in this case. */
1422 pop_binding (DECL_NAME (link
), link
);
1423 else if ((outer_binding
1424 && (TREE_CODE (BINDING_VALUE (outer_binding
))
1427 && TREE_CODE (ns_binding
) == TYPE_DECL
))
1428 /* Here, we have something like:
1436 We must pop the for-scope binding so we know what's a
1437 type and what isn't. */
1438 pop_binding (DECL_NAME (link
), link
);
1441 /* Mark this VAR_DECL as dead so that we can tell we left it
1442 there only for backward compatibility. */
1443 DECL_DEAD_FOR_LOCAL (link
) = 1;
1445 /* Keep track of what should of have happenned when we
1446 popped the binding. */
1447 if (outer_binding
&& BINDING_VALUE (outer_binding
))
1448 DECL_SHADOWED_FOR_VAR (link
)
1449 = BINDING_VALUE (outer_binding
);
1451 /* Add it to the list of dead variables in the next
1452 outermost binding to that we can remove these when we
1453 leave that binding. */
1454 current_binding_level
->level_chain
->dead_vars_from_for
1455 = tree_cons (NULL_TREE
, link
,
1456 current_binding_level
->level_chain
->
1457 dead_vars_from_for
);
1459 /* Although we don't pop the CPLUS_BINDING, we do clear
1460 its BINDING_LEVEL since the level is going away now. */
1461 BINDING_LEVEL (IDENTIFIER_BINDING (DECL_NAME (link
)))
1467 /* Remove the binding. */
1469 if (TREE_CODE (decl
) == TREE_LIST
)
1470 decl
= TREE_VALUE (decl
);
1472 pop_binding (DECL_NAME (decl
), decl
);
1473 else if (TREE_CODE (decl
) == OVERLOAD
)
1474 pop_binding (DECL_NAME (OVL_FUNCTION (decl
)), decl
);
1476 my_friendly_abort (0);
1480 /* Remove declarations for any `for' variables from inner scopes
1481 that we kept around. */
1482 for (link
= current_binding_level
->dead_vars_from_for
;
1483 link
; link
= TREE_CHAIN (link
))
1484 pop_binding (DECL_NAME (TREE_VALUE (link
)), TREE_VALUE (link
));
1486 /* Restore the IDENTIFIER_TYPE_VALUEs. */
1487 for (link
= current_binding_level
->type_shadowed
;
1488 link
; link
= TREE_CHAIN (link
))
1489 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (link
), TREE_VALUE (link
));
1491 /* Restore the IDENTIFIER_LABEL_VALUEs for local labels. */
1492 for (link
= current_binding_level
->shadowed_labels
;
1494 link
= TREE_CHAIN (link
))
1495 pop_label (TREE_VALUE (link
), TREE_PURPOSE (link
));
1497 /* There may be OVERLOADs (wrapped in TREE_LISTs) on the BLOCK_VARs
1498 list if a `using' declaration put them there. The debugging
1499 back-ends won't understand OVERLOAD, so we remove them here.
1500 Because the BLOCK_VARS are (temporarily) shared with
1501 CURRENT_BINDING_LEVEL->NAMES we must do this fixup after we have
1502 popped all the bindings. */
1507 for (d
= &BLOCK_VARS (block
); *d
; )
1509 if (TREE_CODE (*d
) == TREE_LIST
)
1510 *d
= TREE_CHAIN (*d
);
1512 d
= &TREE_CHAIN (*d
);
1516 /* If the level being exited is the top level of a function,
1517 check over all the labels. */
1520 /* Since this is the top level block of a function, the vars are
1521 the function's parameters. Don't leave them in the BLOCK
1522 because they are found in the FUNCTION_DECL instead. */
1523 BLOCK_VARS (block
) = 0;
1527 tmp
= current_binding_level
->keep
;
1529 pop_binding_level ();
1531 DECL_INITIAL (current_function_decl
) = block
;
1533 current_binding_level
->blocks
1534 = chainon (current_binding_level
->blocks
, block
);
1536 /* If we did not make a block for the level just exited,
1537 any blocks made for inner levels
1538 (since they cannot be recorded as subblocks in that level)
1539 must be carried forward so they will later become subblocks
1540 of something else. */
1542 current_binding_level
->blocks
1543 = chainon (current_binding_level
->blocks
, subblocks
);
1545 /* Each and every BLOCK node created here in `poplevel' is important
1546 (e.g. for proper debugging information) so if we created one
1547 earlier, mark it as "used". */
1549 TREE_USED (block
) = 1;
1551 /* Take care of compiler's internal binding structures. */
1557 = add_scope_stmt (/*begin_p=*/0, /*partial_p=*/1);
1560 SCOPE_STMT_BLOCK (TREE_PURPOSE (scope_stmts
)) = block
;
1561 SCOPE_STMT_BLOCK (TREE_VALUE (scope_stmts
)) = block
;
1564 block
= poplevel (keep
, reverse
, functionbody
);
1570 /* Delete the node BLOCK from the current binding level.
1571 This is used for the block inside a stmt expr ({...})
1572 so that the block can be reinserted where appropriate. */
1575 delete_block (block
)
1579 if (current_binding_level
->blocks
== block
)
1580 current_binding_level
->blocks
= TREE_CHAIN (block
);
1581 for (t
= current_binding_level
->blocks
; t
;)
1583 if (TREE_CHAIN (t
) == block
)
1584 TREE_CHAIN (t
) = TREE_CHAIN (block
);
1588 TREE_CHAIN (block
) = NULL_TREE
;
1589 /* Clear TREE_USED which is always set by poplevel.
1590 The flag is set again if insert_block is called. */
1591 TREE_USED (block
) = 0;
1594 /* Insert BLOCK at the end of the list of subblocks of the
1595 current binding level. This is used when a BIND_EXPR is expanded,
1596 to handle the BLOCK node inside the BIND_EXPR. */
1599 insert_block (block
)
1602 TREE_USED (block
) = 1;
1603 current_binding_level
->blocks
1604 = chainon (current_binding_level
->blocks
, block
);
1607 /* Set the BLOCK node for the innermost scope
1608 (the one we are currently in). */
1612 tree block ATTRIBUTE_UNUSED
;
1614 /* The RTL expansion machinery requires us to provide this callback,
1615 but it is not applicable in function-at-a-time mode. */
1616 my_friendly_assert (cfun
&& !doing_semantic_analysis_p (), 20000911);
1619 /* Do a pushlevel for class declarations. */
1624 register struct binding_level
*newlevel
;
1626 /* Reuse or create a struct for this binding level. */
1627 #if defined(DEBUG_CP_BINDING_LEVELS)
1629 #else /* !defined(DEBUG_CP_BINDING_LEVELS) */
1630 if (free_binding_level
)
1631 #endif /* !defined(DEBUG_CP_BINDING_LEVELS) */
1633 newlevel
= free_binding_level
;
1634 free_binding_level
= free_binding_level
->level_chain
;
1637 newlevel
= make_binding_level ();
1639 #if defined(DEBUG_CP_BINDING_LEVELS)
1641 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1643 push_binding_level (newlevel
, 0, 0);
1645 class_binding_level
= current_binding_level
;
1646 class_binding_level
->parm_flag
= 2;
1647 class_binding_level
->this_class
= current_class_type
;
1650 /* ...and a poplevel for class declarations. */
1655 register struct binding_level
*level
= class_binding_level
;
1658 my_friendly_assert (level
!= 0, 354);
1660 /* If we're leaving a toplevel class, don't bother to do the setting
1661 of IDENTIFIER_CLASS_VALUE to NULL_TREE, since first of all this slot
1662 shouldn't even be used when current_class_type isn't set, and second,
1663 if we don't touch it here, we're able to use the cache effect if the
1664 next time we're entering a class scope, it is the same class. */
1665 if (current_class_depth
!= 1)
1667 struct binding_level
* b
;
1669 /* Clear out our IDENTIFIER_CLASS_VALUEs. */
1670 for (shadowed
= level
->class_shadowed
;
1672 shadowed
= TREE_CHAIN (shadowed
))
1673 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
)) = NULL_TREE
;
1675 /* Find the next enclosing class, and recreate
1676 IDENTIFIER_CLASS_VALUEs appropriate for that class. */
1677 b
= level
->level_chain
;
1678 while (b
&& b
->parm_flag
!= 2)
1682 for (shadowed
= b
->class_shadowed
;
1684 shadowed
= TREE_CHAIN (shadowed
))
1688 t
= IDENTIFIER_BINDING (TREE_PURPOSE (shadowed
));
1689 while (t
&& BINDING_LEVEL (t
) != b
)
1693 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (shadowed
))
1694 = BINDING_VALUE (t
);
1698 /* Remember to save what IDENTIFIER's were bound in this scope so we
1699 can recover from cache misses. */
1701 previous_class_type
= current_class_type
;
1702 previous_class_values
= class_binding_level
->class_shadowed
;
1704 for (shadowed
= level
->type_shadowed
;
1706 shadowed
= TREE_CHAIN (shadowed
))
1707 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (shadowed
), TREE_VALUE (shadowed
));
1709 /* Remove the bindings for all of the class-level declarations. */
1710 for (shadowed
= level
->class_shadowed
;
1712 shadowed
= TREE_CHAIN (shadowed
))
1713 pop_binding (TREE_PURPOSE (shadowed
), TREE_TYPE (shadowed
));
1715 GNU_xref_end_scope ((HOST_WIDE_INT
) class_binding_level
,
1716 (HOST_WIDE_INT
) class_binding_level
->level_chain
,
1717 class_binding_level
->parm_flag
,
1718 class_binding_level
->keep
);
1720 /* Now, pop out of the binding level which we created up in the
1721 `pushlevel_class' routine. */
1722 #if defined(DEBUG_CP_BINDING_LEVELS)
1724 #endif /* defined(DEBUG_CP_BINDING_LEVELS) */
1726 pop_binding_level ();
1729 /* We are entering the scope of a class. Clear IDENTIFIER_CLASS_VALUE
1730 for any names in enclosing classes. */
1733 clear_identifier_class_values ()
1737 if (!class_binding_level
)
1740 for (t
= class_binding_level
->class_shadowed
;
1743 IDENTIFIER_CLASS_VALUE (TREE_PURPOSE (t
)) = NULL_TREE
;
1746 /* Returns non-zero if T is a virtual function table. */
1749 vtable_decl_p (t
, data
)
1751 void *data ATTRIBUTE_UNUSED
;
1753 return (TREE_CODE (t
) == VAR_DECL
&& DECL_VIRTUAL_P (t
));
1756 /* Returns non-zero if T is a TYPE_DECL for a type with virtual
1760 vtype_decl_p (t
, data
)
1762 void *data ATTRIBUTE_UNUSED
;
1764 return (TREE_CODE (t
) == TYPE_DECL
1765 && TREE_CODE (TREE_TYPE (t
)) == RECORD_TYPE
1766 && TYPE_POLYMORPHIC_P (TREE_TYPE (t
)));
1769 /* Return the declarations that are members of the namespace NS. */
1772 cp_namespace_decls (ns
)
1775 return NAMESPACE_LEVEL (ns
)->names
;
1778 /* Walk all the namespaces contained NAMESPACE, including NAMESPACE
1779 itself, calling F for each. The DATA is passed to F as well. */
1782 walk_namespaces_r (namespace, f
, data
)
1784 walk_namespaces_fn f
;
1790 result
|= (*f
) (namespace, data
);
1792 for (current
= cp_namespace_decls (namespace);
1794 current
= TREE_CHAIN (current
))
1796 if (TREE_CODE (current
) != NAMESPACE_DECL
1797 || DECL_NAMESPACE_ALIAS (current
))
1799 if (!DECL_LANG_SPECIFIC (current
))
1802 my_friendly_assert (current
== fake_std_node
, 393);
1806 /* We found a namespace. */
1807 result
|= walk_namespaces_r (current
, f
, data
);
1813 /* Walk all the namespaces, calling F for each. The DATA is passed to
1817 walk_namespaces (f
, data
)
1818 walk_namespaces_fn f
;
1821 return walk_namespaces_r (global_namespace
, f
, data
);
1824 struct walk_globals_data
{
1825 walk_globals_pred p
;
1830 /* Walk the global declarations in NAMESPACE. Whenever one is found
1831 for which P returns non-zero, call F with its address. If any call
1832 to F returns a non-zero value, return a non-zero value. */
1835 walk_globals_r (namespace, data
)
1839 struct walk_globals_data
* wgd
= (struct walk_globals_data
*) data
;
1840 walk_globals_pred p
= wgd
->p
;
1841 walk_globals_fn f
= wgd
->f
;
1842 void *d
= wgd
->data
;
1846 t
= &NAMESPACE_LEVEL (namespace)->names
;
1853 result
|= (*f
) (t
, d
);
1855 /* If F changed *T, then *T still points at the next item to
1858 t
= &TREE_CHAIN (*t
);
1864 /* Walk the global declarations. Whenever one is found for which P
1865 returns non-zero, call F with its address. If any call to F
1866 returns a non-zero value, return a non-zero value. */
1869 walk_globals (p
, f
, data
)
1870 walk_globals_pred p
;
1874 struct walk_globals_data wgd
;
1879 return walk_namespaces (walk_globals_r
, &wgd
);
1882 /* Call wrapup_globals_declarations for the globals in NAMESPACE. If
1883 DATA is non-NULL, this is the last time we will call
1884 wrapup_global_declarations for this NAMESPACE. */
1887 wrapup_globals_for_namespace (namespace, data
)
1891 tree globals
= cp_namespace_decls (namespace);
1892 int len
= list_length (globals
);
1893 tree
*vec
= (tree
*) alloca (sizeof (tree
) * len
);
1897 int last_time
= (data
!= 0);
1899 if (last_time
&& namespace == global_namespace
)
1900 /* Let compile_file handle the global namespace. */
1903 /* Process the decls in reverse order--earliest first.
1904 Put them into VEC from back to front, then take out from front. */
1905 for (i
= 0, decl
= globals
; i
< len
; i
++, decl
= TREE_CHAIN (decl
))
1906 vec
[len
- i
- 1] = decl
;
1910 check_global_declarations (vec
, len
);
1914 /* Temporarily mark vtables as external. That prevents
1915 wrapup_global_declarations from writing them out; we must process
1916 them ourselves in finish_vtable_vardecl. */
1917 for (i
= 0; i
< len
; ++i
)
1918 if (vtable_decl_p (vec
[i
], /*data=*/0) && !DECL_EXTERNAL (vec
[i
]))
1920 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 1;
1921 DECL_EXTERNAL (vec
[i
]) = 1;
1924 /* Write out any globals that need to be output. */
1925 result
= wrapup_global_declarations (vec
, len
);
1927 /* Undo the hack to DECL_EXTERNAL above. */
1928 for (i
= 0; i
< len
; ++i
)
1929 if (vtable_decl_p (vec
[i
], /*data=*/0)
1930 && DECL_NOT_REALLY_EXTERN (vec
[i
]))
1932 DECL_NOT_REALLY_EXTERN (vec
[i
]) = 0;
1933 DECL_EXTERNAL (vec
[i
]) = 0;
1940 /* Mark ARG (which is really a struct binding_level **) for GC. */
1943 mark_binding_level (arg
)
1946 struct binding_level
*lvl
= *(struct binding_level
**)arg
;
1948 for (; lvl
; lvl
= lvl
->level_chain
)
1950 ggc_mark_tree (lvl
->names
);
1951 ggc_mark_tree (lvl
->tags
);
1952 ggc_mark_tree (lvl
->usings
);
1953 ggc_mark_tree (lvl
->using_directives
);
1954 ggc_mark_tree (lvl
->class_shadowed
);
1955 ggc_mark_tree (lvl
->type_shadowed
);
1956 ggc_mark_tree (lvl
->shadowed_labels
);
1957 ggc_mark_tree (lvl
->blocks
);
1958 ggc_mark_tree (lvl
->this_class
);
1959 ggc_mark_tree (lvl
->incomplete
);
1960 ggc_mark_tree (lvl
->dead_vars_from_for
);
1965 mark_named_label_lists (labs
, uses
)
1969 struct named_label_list
*l
= *(struct named_label_list
**)labs
;
1970 struct named_label_use_list
*u
= *(struct named_label_use_list
**)uses
;
1972 for (; l
; l
= l
->next
)
1975 mark_binding_level (l
->binding_level
);
1976 ggc_mark_tree (l
->old_value
);
1977 ggc_mark_tree (l
->label_decl
);
1978 ggc_mark_tree (l
->bad_decls
);
1981 for (; u
; u
= u
->next
)
1985 /* For debugging. */
1986 static int no_print_functions
= 0;
1987 static int no_print_builtins
= 0;
1990 print_binding_level (lvl
)
1991 struct binding_level
*lvl
;
1995 fprintf (stderr
, " blocks=");
1996 fprintf (stderr
, HOST_PTR_PRINTF
, lvl
->blocks
);
1997 fprintf (stderr
, " n_incomplete=%d parm_flag=%d keep=%d",
1998 list_length (lvl
->incomplete
), lvl
->parm_flag
, lvl
->keep
);
1999 if (lvl
->tag_transparent
)
2000 fprintf (stderr
, " tag-transparent");
2001 if (lvl
->more_cleanups_ok
)
2002 fprintf (stderr
, " more-cleanups-ok");
2003 if (lvl
->have_cleanups
)
2004 fprintf (stderr
, " have-cleanups");
2005 fprintf (stderr
, "\n");
2008 fprintf (stderr
, " names:\t");
2009 /* We can probably fit 3 names to a line? */
2010 for (t
= lvl
->names
; t
; t
= TREE_CHAIN (t
))
2012 if (no_print_functions
&& (TREE_CODE (t
) == FUNCTION_DECL
))
2014 if (no_print_builtins
2015 && (TREE_CODE (t
) == TYPE_DECL
)
2016 && (!strcmp (DECL_SOURCE_FILE (t
),"<built-in>")))
2019 /* Function decls tend to have longer names. */
2020 if (TREE_CODE (t
) == FUNCTION_DECL
)
2027 fprintf (stderr
, "\n\t");
2030 print_node_brief (stderr
, "", t
, 0);
2031 if (t
== error_mark_node
)
2035 fprintf (stderr
, "\n");
2039 fprintf (stderr
, " tags:\t");
2041 for (t
= lvl
->tags
; t
; t
= TREE_CHAIN (t
))
2043 if (TREE_PURPOSE (t
) == NULL_TREE
)
2045 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2052 fprintf (stderr
, "\n\t");
2055 if (TREE_PURPOSE (t
) == NULL_TREE
)
2057 print_node_brief (stderr
, "<unnamed-typedef", TREE_VALUE (t
), 0);
2058 fprintf (stderr
, ">");
2060 else if (TREE_PURPOSE (t
) == TYPE_IDENTIFIER (TREE_VALUE (t
)))
2061 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2064 print_node_brief (stderr
, "<typedef", TREE_PURPOSE (t
), 0);
2065 print_node_brief (stderr
, "", TREE_VALUE (t
), 0);
2066 fprintf (stderr
, ">");
2070 fprintf (stderr
, "\n");
2072 if (lvl
->class_shadowed
)
2074 fprintf (stderr
, " class-shadowed:");
2075 for (t
= lvl
->class_shadowed
; t
; t
= TREE_CHAIN (t
))
2077 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2079 fprintf (stderr
, "\n");
2081 if (lvl
->type_shadowed
)
2083 fprintf (stderr
, " type-shadowed:");
2084 for (t
= lvl
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2086 fprintf (stderr
, " %s ", IDENTIFIER_POINTER (TREE_PURPOSE (t
)));
2088 fprintf (stderr
, "\n");
2093 print_other_binding_stack (stack
)
2094 struct binding_level
*stack
;
2096 struct binding_level
*level
;
2097 for (level
= stack
; level
!= global_binding_level
; level
= level
->level_chain
)
2099 fprintf (stderr
, "binding level ");
2100 fprintf (stderr
, HOST_PTR_PRINTF
, level
);
2101 fprintf (stderr
, "\n");
2102 print_binding_level (level
);
2107 print_binding_stack ()
2109 struct binding_level
*b
;
2110 fprintf (stderr
, "current_binding_level=");
2111 fprintf (stderr
, HOST_PTR_PRINTF
, current_binding_level
);
2112 fprintf (stderr
, "\nclass_binding_level=");
2113 fprintf (stderr
, HOST_PTR_PRINTF
, class_binding_level
);
2114 fprintf (stderr
, "\nglobal_binding_level=");
2115 fprintf (stderr
, HOST_PTR_PRINTF
, global_binding_level
);
2116 fprintf (stderr
, "\n");
2117 if (class_binding_level
)
2119 for (b
= class_binding_level
; b
; b
= b
->level_chain
)
2120 if (b
== current_binding_level
)
2123 b
= class_binding_level
;
2125 b
= current_binding_level
;
2128 b
= current_binding_level
;
2129 print_other_binding_stack (b
);
2130 fprintf (stderr
, "global:\n");
2131 print_binding_level (global_binding_level
);
2134 /* Namespace binding access routines: The namespace_bindings field of
2135 the identifier is polymorphic, with three possible values:
2136 NULL_TREE, a list of CPLUS_BINDINGS, or any other tree_node
2137 indicating the BINDING_VALUE of global_namespace. */
2139 /* Check whether the a binding for the name to scope is known.
2140 Assumes that the bindings of the name are already a list
2141 of bindings. Returns the binding found, or NULL_TREE. */
2144 find_binding (name
, scope
)
2148 tree iter
, prev
= NULL_TREE
;
2150 scope
= ORIGINAL_NAMESPACE (scope
);
2152 for (iter
= IDENTIFIER_NAMESPACE_BINDINGS (name
); iter
;
2153 iter
= TREE_CHAIN (iter
))
2155 my_friendly_assert (TREE_CODE (iter
) == CPLUS_BINDING
, 374);
2156 if (BINDING_SCOPE (iter
) == scope
)
2158 /* Move binding found to the front of the list, so
2159 subsequent lookups will find it faster. */
2162 TREE_CHAIN (prev
) = TREE_CHAIN (iter
);
2163 TREE_CHAIN (iter
) = IDENTIFIER_NAMESPACE_BINDINGS (name
);
2164 IDENTIFIER_NAMESPACE_BINDINGS (name
) = iter
;
2173 /* Always returns a binding for name in scope. If the
2174 namespace_bindings is not a list, convert it to one first.
2175 If no binding is found, make a new one. */
2178 binding_for_name (name
, scope
)
2182 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2185 scope
= ORIGINAL_NAMESPACE (scope
);
2187 if (b
&& TREE_CODE (b
) != CPLUS_BINDING
)
2189 /* Get rid of optimization for global scope. */
2190 IDENTIFIER_NAMESPACE_BINDINGS (name
) = NULL_TREE
;
2191 BINDING_VALUE (binding_for_name (name
, global_namespace
)) = b
;
2192 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2194 if (b
&& (result
= find_binding (name
, scope
)))
2196 /* Not found, make a new one. */
2197 result
= make_node (CPLUS_BINDING
);
2198 TREE_CHAIN (result
) = b
;
2199 IDENTIFIER_NAMESPACE_BINDINGS (name
) = result
;
2200 BINDING_SCOPE (result
) = scope
;
2201 BINDING_TYPE (result
) = NULL_TREE
;
2202 BINDING_VALUE (result
) = NULL_TREE
;
2206 /* Return the binding value for name in scope, considering that
2207 namespace_binding may or may not be a list of CPLUS_BINDINGS. */
2210 namespace_binding (name
, scope
)
2214 tree b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2217 if (scope
== NULL_TREE
)
2218 scope
= global_namespace
;
2219 if (TREE_CODE (b
) != CPLUS_BINDING
)
2220 return (scope
== global_namespace
) ? b
: NULL_TREE
;
2221 name
= find_binding (name
,scope
);
2222 if (name
== NULL_TREE
)
2224 return BINDING_VALUE (name
);
2227 /* Set the binding value for name in scope. If modifying the binding
2228 of global_namespace is attempted, try to optimize it. */
2231 set_namespace_binding (name
, scope
, val
)
2238 if (scope
== NULL_TREE
)
2239 scope
= global_namespace
;
2241 if (scope
== global_namespace
)
2243 b
= IDENTIFIER_NAMESPACE_BINDINGS (name
);
2244 if (b
== NULL_TREE
|| TREE_CODE (b
) != CPLUS_BINDING
)
2246 IDENTIFIER_NAMESPACE_BINDINGS (name
) = val
;
2250 b
= binding_for_name (name
, scope
);
2251 BINDING_VALUE (b
) = val
;
2254 /* Push into the scope of the NAME namespace. If NAME is NULL_TREE, then we
2255 select a name that is unique to this compilation unit. */
2258 push_namespace (name
)
2263 int implicit_use
= 0;
2265 if (!global_namespace
)
2267 /* This must be ::. */
2268 my_friendly_assert (name
== get_identifier ("::"), 377);
2273 /* The name of anonymous namespace is unique for the translation
2275 if (!anonymous_namespace_name
)
2276 anonymous_namespace_name
= get_file_function_name ('N');
2277 name
= anonymous_namespace_name
;
2278 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2280 /* Reopening anonymous namespace. */
2284 else if (current_namespace
== global_namespace
2286 && name
== std_identifier
)
2293 /* Check whether this is an extended namespace definition. */
2294 d
= IDENTIFIER_NAMESPACE_VALUE (name
);
2295 if (d
!= NULL_TREE
&& TREE_CODE (d
) == NAMESPACE_DECL
)
2298 if (DECL_NAMESPACE_ALIAS (d
))
2300 cp_error ("namespace alias `%D' not allowed here, assuming `%D'",
2301 d
, DECL_NAMESPACE_ALIAS (d
));
2302 d
= DECL_NAMESPACE_ALIAS (d
);
2309 /* Make a new namespace, binding the name to it. */
2310 d
= build_lang_decl (NAMESPACE_DECL
, name
, void_type_node
);
2311 /* The global namespace is not pushed, and the global binding
2312 level is set elsewhere. */
2315 DECL_CONTEXT (d
) = FROB_CONTEXT (current_namespace
);
2318 declare_namespace_level ();
2319 NAMESPACE_LEVEL (d
) = current_binding_level
;
2323 resume_binding_level (NAMESPACE_LEVEL (d
));
2326 do_using_directive (d
);
2327 /* Enter the name space. */
2328 current_namespace
= d
;
2331 /* Pop from the scope of the current namespace. */
2336 if (current_namespace
== global_namespace
)
2338 my_friendly_assert (in_fake_std
> 0, 980421);
2342 current_namespace
= CP_DECL_CONTEXT (current_namespace
);
2343 /* The binding level is not popped, as it might be re-opened later. */
2344 suspend_binding_level ();
2347 /* Push into the scope of the namespace NS, even if it is deeply
2348 nested within another namespace. */
2351 push_nested_namespace (ns
)
2354 if (ns
== global_namespace
)
2355 push_to_top_level ();
2358 push_nested_namespace (CP_DECL_CONTEXT (ns
));
2359 push_namespace (DECL_NAME (ns
));
2363 /* Pop back from the scope of the namespace NS, which was previously
2364 entered with push_nested_namespace. */
2367 pop_nested_namespace (ns
)
2370 while (ns
!= global_namespace
)
2373 ns
= CP_DECL_CONTEXT (ns
);
2376 pop_from_top_level ();
2380 /* Subroutines for reverting temporarily to top-level for instantiation
2381 of templates and such. We actually need to clear out the class- and
2382 local-value slots of all identifiers, so that only the global values
2383 are at all visible. Simply setting current_binding_level to the global
2384 scope isn't enough, because more binding levels may be pushed. */
2385 struct saved_scope
*scope_chain
;
2387 /* Mark ARG (which is really a struct saved_scope **) for GC. */
2390 mark_saved_scope (arg
)
2393 struct saved_scope
*t
= *(struct saved_scope
**)arg
;
2396 mark_binding_level (&t
->class_bindings
);
2397 ggc_mark_tree (t
->old_bindings
);
2398 ggc_mark_tree (t
->old_namespace
);
2399 ggc_mark_tree (t
->class_name
);
2400 ggc_mark_tree (t
->class_type
);
2401 ggc_mark_tree (t
->access_specifier
);
2402 ggc_mark_tree (t
->function_decl
);
2404 ggc_mark_tree_varray (t
->lang_base
);
2405 ggc_mark_tree (t
->lang_name
);
2406 ggc_mark_tree (t
->template_parms
);
2407 ggc_mark_tree (t
->x_previous_class_type
);
2408 ggc_mark_tree (t
->x_previous_class_values
);
2409 ggc_mark_tree (t
->x_saved_tree
);
2410 ggc_mark_tree (t
->incomplete
);
2411 ggc_mark_tree (t
->lookups
);
2413 mark_stmt_tree (&t
->x_stmt_tree
);
2414 mark_binding_level (&t
->bindings
);
2420 store_bindings (names
, old_bindings
)
2421 tree names
, old_bindings
;
2424 tree search_bindings
= old_bindings
;
2426 for (t
= names
; t
; t
= TREE_CHAIN (t
))
2428 tree binding
, t1
, id
;
2430 if (TREE_CODE (t
) == TREE_LIST
)
2431 id
= TREE_PURPOSE (t
);
2436 /* Note that we may have an IDENTIFIER_CLASS_VALUE even when
2437 we have no IDENTIFIER_BINDING if we have left the class
2438 scope, but cached the class-level declarations. */
2439 || !(IDENTIFIER_BINDING (id
) || IDENTIFIER_CLASS_VALUE (id
)))
2442 for (t1
= search_bindings
; t1
; t1
= TREE_CHAIN (t1
))
2443 if (TREE_VEC_ELT (t1
, 0) == id
)
2446 my_friendly_assert (TREE_CODE (id
) == IDENTIFIER_NODE
, 135);
2447 binding
= make_tree_vec (4);
2448 TREE_VEC_ELT (binding
, 0) = id
;
2449 TREE_VEC_ELT (binding
, 1) = REAL_IDENTIFIER_TYPE_VALUE (id
);
2450 TREE_VEC_ELT (binding
, 2) = IDENTIFIER_BINDING (id
);
2451 TREE_VEC_ELT (binding
, 3) = IDENTIFIER_CLASS_VALUE (id
);
2452 IDENTIFIER_BINDING (id
) = NULL_TREE
;
2453 IDENTIFIER_CLASS_VALUE (id
) = NULL_TREE
;
2454 TREE_CHAIN (binding
) = old_bindings
;
2455 old_bindings
= binding
;
2459 return old_bindings
;
2463 maybe_push_to_top_level (pseudo
)
2466 struct saved_scope
*s
;
2467 struct binding_level
*b
;
2471 s
= (struct saved_scope
*) xcalloc (1, sizeof (struct saved_scope
));
2473 b
= scope_chain
? current_binding_level
: 0;
2475 /* If we're in the middle of some function, save our state. */
2479 push_function_context_to (NULL_TREE
);
2484 old_bindings
= NULL_TREE
;
2485 if (scope_chain
&& previous_class_type
)
2486 old_bindings
= store_bindings (previous_class_values
, old_bindings
);
2488 /* Have to include global_binding_level, because class-level decls
2489 aren't listed anywhere useful. */
2490 for (; b
; b
= b
->level_chain
)
2494 /* Template IDs are inserted into the global level. If they were
2495 inserted into namespace level, finish_file wouldn't find them
2496 when doing pending instantiations. Therefore, don't stop at
2497 namespace level, but continue until :: . */
2498 if (b
== global_binding_level
|| (pseudo
&& b
->template_parms_p
))
2501 old_bindings
= store_bindings (b
->names
, old_bindings
);
2502 /* We also need to check class_shadowed to save class-level type
2503 bindings, since pushclass doesn't fill in b->names. */
2504 if (b
->parm_flag
== 2)
2505 old_bindings
= store_bindings (b
->class_shadowed
, old_bindings
);
2507 /* Unwind type-value slots back to top level. */
2508 for (t
= b
->type_shadowed
; t
; t
= TREE_CHAIN (t
))
2509 SET_IDENTIFIER_TYPE_VALUE (TREE_PURPOSE (t
), TREE_VALUE (t
));
2511 s
->prev
= scope_chain
;
2512 s
->old_bindings
= old_bindings
;
2514 s
->need_pop_function_context
= need_pop
;
2515 s
->function_decl
= current_function_decl
;
2518 current_function_decl
= NULL_TREE
;
2519 VARRAY_TREE_INIT (current_lang_base
, 10, "current_lang_base");
2520 current_lang_stack
= &VARRAY_TREE (current_lang_base
, 0);
2521 current_lang_name
= lang_name_cplusplus
;
2522 current_namespace
= global_namespace
;
2526 push_to_top_level ()
2528 maybe_push_to_top_level (0);
2532 pop_from_top_level ()
2534 struct saved_scope
*s
= scope_chain
;
2537 /* Clear out class-level bindings cache. */
2538 if (previous_class_type
)
2539 invalidate_class_lookup_cache ();
2541 VARRAY_FREE (current_lang_base
);
2543 scope_chain
= s
->prev
;
2544 for (t
= s
->old_bindings
; t
; t
= TREE_CHAIN (t
))
2546 tree id
= TREE_VEC_ELT (t
, 0);
2548 SET_IDENTIFIER_TYPE_VALUE (id
, TREE_VEC_ELT (t
, 1));
2549 IDENTIFIER_BINDING (id
) = TREE_VEC_ELT (t
, 2);
2550 IDENTIFIER_CLASS_VALUE (id
) = TREE_VEC_ELT (t
, 3);
2553 /* If we were in the middle of compiling a function, restore our
2555 if (s
->need_pop_function_context
)
2556 pop_function_context_from (NULL_TREE
);
2557 current_function_decl
= s
->function_decl
;
2562 /* Push a definition of struct, union or enum tag "name".
2563 into binding_level "b". "type" should be the type node,
2564 We assume that the tag "name" is not already defined.
2566 Note that the definition may really be just a forward reference.
2567 In that case, the TYPE_SIZE will be a NULL_TREE.
2569 C++ gratuitously puts all these tags in the name space. */
2571 /* When setting the IDENTIFIER_TYPE_VALUE field of an identifier ID,
2572 record the shadowed value for this binding contour. TYPE is
2573 the type that ID maps to. */
2576 set_identifier_type_value_with_scope (id
, type
, b
)
2579 struct binding_level
*b
;
2581 if (!b
->namespace_p
)
2583 /* Shadow the marker, not the real thing, so that the marker
2584 gets restored later. */
2585 tree old_type_value
= REAL_IDENTIFIER_TYPE_VALUE (id
);
2587 = tree_cons (id
, old_type_value
, b
->type_shadowed
);
2591 tree binding
= binding_for_name (id
, current_namespace
);
2592 BINDING_TYPE (binding
) = type
;
2593 /* Store marker instead of real type. */
2594 type
= global_type_node
;
2596 SET_IDENTIFIER_TYPE_VALUE (id
, type
);
2599 /* As set_identifier_type_value_with_scope, but using current_binding_level. */
2602 set_identifier_type_value (id
, type
)
2606 set_identifier_type_value_with_scope (id
, type
, current_binding_level
);
2609 /* Return the type associated with id. */
2612 identifier_type_value (id
)
2615 /* There is no type with that name, anywhere. */
2616 if (REAL_IDENTIFIER_TYPE_VALUE (id
) == NULL_TREE
)
2618 /* This is not the type marker, but the real thing. */
2619 if (REAL_IDENTIFIER_TYPE_VALUE (id
) != global_type_node
)
2620 return REAL_IDENTIFIER_TYPE_VALUE (id
);
2621 /* Have to search for it. It must be on the global level, now.
2622 Ask lookup_name not to return non-types. */
2623 id
= lookup_name_real (id
, 2, 1, 0);
2625 return TREE_TYPE (id
);
2629 /* Pop off extraneous binding levels left over due to syntax errors.
2631 We don't pop past namespaces, as they might be valid. */
2636 #ifdef DEBUG_CP_BINDING_LEVELS
2637 fprintf (stderr
, "XXX entering pop_everything ()\n");
2639 while (!toplevel_bindings_p ())
2641 if (current_binding_level
->parm_flag
== 2)
2642 pop_nested_class ();
2646 #ifdef DEBUG_CP_BINDING_LEVELS
2647 fprintf (stderr
, "XXX leaving pop_everything ()\n");
2651 /* The type TYPE is being declared. If it is a class template, or a
2652 specialization of a class template, do any processing required and
2653 perform error-checking. If IS_FRIEND is non-zero, this TYPE is
2654 being declared a friend. B is the binding level at which this TYPE
2657 Returns the TYPE_DECL for TYPE, which may have been altered by this
2661 maybe_process_template_type_declaration (type
, globalize
, b
)
2664 struct binding_level
* b
;
2666 tree decl
= TYPE_NAME (type
);
2668 if (processing_template_parmlist
)
2669 /* You can't declare a new template type in a template parameter
2670 list. But, you can declare a non-template type:
2672 template <class A*> struct S;
2674 is a forward-declaration of `A'. */
2678 maybe_check_template_type (type
);
2680 my_friendly_assert (IS_AGGR_TYPE (type
)
2681 || TREE_CODE (type
) == ENUMERAL_TYPE
, 0);
2684 if (processing_template_decl
)
2686 /* This may change after the call to
2687 push_template_decl_real, but we want the original value. */
2688 tree name
= DECL_NAME (decl
);
2690 decl
= push_template_decl_real (decl
, globalize
);
2691 /* If the current binding level is the binding level for the
2692 template parameters (see the comment in
2693 begin_template_parm_list) and the enclosing level is a class
2694 scope, and we're not looking at a friend, push the
2695 declaration of the member class into the class scope. In the
2696 friend case, push_template_decl will already have put the
2697 friend into global scope, if appropriate. */
2698 if (TREE_CODE (type
) != ENUMERAL_TYPE
2699 && !globalize
&& b
->template_parms_p
2700 && b
->level_chain
->parm_flag
== 2)
2702 finish_member_declaration (CLASSTYPE_TI_TEMPLATE (type
));
2703 /* Put this tag on the list of tags for the class, since
2704 that won't happen below because B is not the class
2705 binding level, but is instead the pseudo-global level. */
2706 b
->level_chain
->tags
=
2707 tree_cons (name
, type
, b
->level_chain
->tags
);
2708 if (!COMPLETE_TYPE_P (current_class_type
))
2709 CLASSTYPE_TAGS (current_class_type
) = b
->level_chain
->tags
;
2717 /* In C++, you don't have to write `struct S' to refer to `S'; you
2718 can just use `S'. We accomplish this by creating a TYPE_DECL as
2719 if the user had written `typedef struct S S'. Create and return
2720 the TYPE_DECL for TYPE. */
2723 create_implicit_typedef (name
, type
)
2729 decl
= build_decl (TYPE_DECL
, name
, type
);
2730 DECL_ARTIFICIAL (decl
) = 1;
2731 /* There are other implicit type declarations, like the one *within*
2732 a class that allows you to write `S::S'. We must distinguish
2734 SET_DECL_IMPLICIT_TYPEDEF_P (decl
);
2735 TYPE_NAME (type
) = decl
;
2740 /* Push a tag name NAME for struct/class/union/enum type TYPE.
2741 Normally put it into the inner-most non-tag-transparent scope,
2742 but if GLOBALIZE is true, put it in the inner-most non-class scope.
2743 The latter is needed for implicit declarations. */
2746 pushtag (name
, type
, globalize
)
2750 register struct binding_level
*b
;
2752 b
= current_binding_level
;
2753 while (b
->tag_transparent
2754 || (globalize
&& b
->parm_flag
== 2))
2757 b
->tags
= tree_cons (name
, type
, b
->tags
);
2761 /* Do C++ gratuitous typedefing. */
2762 if (IDENTIFIER_TYPE_VALUE (name
) != type
)
2764 register tree d
= NULL_TREE
;
2766 tree context
= TYPE_CONTEXT (type
);
2770 tree cs
= current_scope ();
2774 else if (cs
!= NULL_TREE
&& TYPE_P (cs
))
2775 /* When declaring a friend class of a local class, we want
2776 to inject the newly named class into the scope
2777 containing the local class, not the namespace scope. */
2778 context
= decl_function_context (get_type_decl (cs
));
2781 context
= current_namespace
;
2783 if ((b
->template_parms_p
&& b
->level_chain
->parm_flag
== 2)
2784 || b
->parm_flag
== 2)
2787 if (current_lang_name
== lang_name_java
)
2788 TYPE_FOR_JAVA (type
) = 1;
2790 d
= create_implicit_typedef (name
, type
);
2791 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
2793 set_identifier_type_value_with_scope (name
, type
, b
);
2795 d
= maybe_process_template_type_declaration (type
,
2798 if (b
->parm_flag
== 2)
2800 if (!PROCESSING_REAL_TEMPLATE_DECL_P ())
2801 /* Put this TYPE_DECL on the TYPE_FIELDS list for the
2802 class. But if it's a member template class, we
2803 want the TEMPLATE_DECL, not the TYPE_DECL, so this
2805 finish_member_declaration (d
);
2807 pushdecl_class_level (d
);
2810 d
= pushdecl_with_scope (d
, b
);
2812 if (ANON_AGGRNAME_P (name
))
2813 DECL_IGNORED_P (d
) = 1;
2815 TYPE_CONTEXT (type
) = DECL_CONTEXT (d
);
2816 DECL_ASSEMBLER_NAME (d
) = DECL_NAME (d
);
2818 /* If this is a local class, keep track of it. We need this
2819 information for name-mangling, and so that it is possible to find
2820 all function definitions in a translation unit in a convenient
2821 way. (It's otherwise tricky to find a member function definition
2822 it's only pointed to from within a local class.) */
2823 if (TYPE_CONTEXT (type
)
2824 && TREE_CODE (TYPE_CONTEXT (type
)) == FUNCTION_DECL
2825 && !processing_template_decl
)
2826 VARRAY_PUSH_TREE (local_classes
, type
);
2828 if (!uses_template_parms (type
))
2831 DECL_ASSEMBLER_NAME (d
) = mangle_type (type
);
2833 DECL_ASSEMBLER_NAME (d
)
2834 = get_identifier (build_overload_name (type
, 1, 1));
2837 if (b
->parm_flag
== 2)
2839 if (!COMPLETE_TYPE_P (current_class_type
))
2840 CLASSTYPE_TAGS (current_class_type
) = b
->tags
;
2844 if (TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
)
2845 /* Use the canonical TYPE_DECL for this node. */
2846 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2849 /* Create a fake NULL-named TYPE_DECL node whose TREE_TYPE
2850 will be the tagged type we just added to the current
2851 binding level. This fake NULL-named TYPE_DECL node helps
2852 dwarfout.c to know when it needs to output a
2853 representation of a tagged type, and it also gives us a
2854 convenient place to record the "scope start" address for
2857 tree d
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
2858 TYPE_STUB_DECL (type
) = pushdecl_with_scope (d
, b
);
2862 /* Counter used to create anonymous type names. */
2864 static int anon_cnt
= 0;
2866 /* Return an IDENTIFIER which can be used as a name for
2867 anonymous structs and unions. */
2874 sprintf (buf
, ANON_AGGRNAME_FORMAT
, anon_cnt
++);
2875 return get_identifier (buf
);
2878 /* Clear the TREE_PURPOSE slot of tags which have anonymous typenames.
2879 This keeps dbxout from getting confused. */
2884 register struct binding_level
*b
;
2886 static int last_cnt
= 0;
2888 /* Fast out if no new anon names were declared. */
2889 if (last_cnt
== anon_cnt
)
2892 b
= current_binding_level
;
2893 while (b
->tag_transparent
)
2898 /* A NULL purpose means we have already processed all tags
2899 from here to the end of the list. */
2900 if (TREE_PURPOSE (tags
) == NULL_TREE
)
2902 if (ANON_AGGRNAME_P (TREE_PURPOSE (tags
)))
2903 TREE_PURPOSE (tags
) = NULL_TREE
;
2904 tags
= TREE_CHAIN (tags
);
2906 last_cnt
= anon_cnt
;
2909 /* Subroutine of duplicate_decls: return truthvalue of whether
2910 or not types of these decls match.
2912 For C++, we must compare the parameter list so that `int' can match
2913 `int&' in a parameter position, but `int&' is not confused with
2917 decls_match (newdecl
, olddecl
)
2918 tree newdecl
, olddecl
;
2922 if (newdecl
== olddecl
)
2925 if (TREE_CODE (newdecl
) != TREE_CODE (olddecl
))
2926 /* If the two DECLs are not even the same kind of thing, we're not
2927 interested in their types. */
2930 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
2932 tree f1
= TREE_TYPE (newdecl
);
2933 tree f2
= TREE_TYPE (olddecl
);
2934 tree p1
= TYPE_ARG_TYPES (f1
);
2935 tree p2
= TYPE_ARG_TYPES (f2
);
2937 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
)
2938 && ! (DECL_EXTERN_C_P (newdecl
)
2939 && DECL_EXTERN_C_P (olddecl
)))
2942 if (TREE_CODE (f1
) != TREE_CODE (f2
))
2945 if (same_type_p (TREE_TYPE (f1
), TREE_TYPE (f2
)))
2947 if (p2
== NULL_TREE
&& DECL_EXTERN_C_P (olddecl
)
2948 && (DECL_BUILT_IN (olddecl
)
2949 #ifndef NO_IMPLICIT_EXTERN_C
2950 || (DECL_IN_SYSTEM_HEADER (newdecl
) && !DECL_CLASS_SCOPE_P (newdecl
))
2951 || (DECL_IN_SYSTEM_HEADER (olddecl
) && !DECL_CLASS_SCOPE_P (olddecl
))
2955 types_match
= self_promoting_args_p (p1
);
2956 if (p1
== void_list_node
)
2957 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2959 #ifndef NO_IMPLICIT_EXTERN_C
2960 else if (p1
== NULL_TREE
2961 && (DECL_EXTERN_C_P (olddecl
)
2962 && DECL_IN_SYSTEM_HEADER (olddecl
)
2963 && !DECL_CLASS_SCOPE_P (olddecl
))
2964 && (DECL_EXTERN_C_P (newdecl
)
2965 && DECL_IN_SYSTEM_HEADER (newdecl
)
2966 && !DECL_CLASS_SCOPE_P (newdecl
)))
2968 types_match
= self_promoting_args_p (p2
);
2969 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
);
2973 types_match
= compparms (p1
, p2
);
2978 else if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
2980 if (!comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
2981 DECL_TEMPLATE_PARMS (olddecl
)))
2984 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
))
2985 != TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)))
2988 if (TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
2991 types_match
= decls_match (DECL_TEMPLATE_RESULT (olddecl
),
2992 DECL_TEMPLATE_RESULT (newdecl
));
2996 if (TREE_TYPE (newdecl
) == error_mark_node
)
2997 types_match
= TREE_TYPE (olddecl
) == error_mark_node
;
2998 else if (TREE_TYPE (olddecl
) == NULL_TREE
)
2999 types_match
= TREE_TYPE (newdecl
) == NULL_TREE
;
3000 else if (TREE_TYPE (newdecl
) == NULL_TREE
)
3003 types_match
= comptypes (TREE_TYPE (newdecl
),
3004 TREE_TYPE (olddecl
),
3005 COMPARE_REDECLARATION
);
3011 /* If NEWDECL is `static' and an `extern' was seen previously,
3012 warn about it. OLDDECL is the previous declaration.
3014 Note that this does not apply to the C++ case of declaring
3015 a variable `extern const' and then later `const'.
3017 Don't complain about built-in functions, since they are beyond
3018 the user's control. */
3021 warn_extern_redeclared_static (newdecl
, olddecl
)
3022 tree newdecl
, olddecl
;
3024 static const char *explicit_extern_static_warning
3025 = "`%D' was declared `extern' and later `static'";
3026 static const char *implicit_extern_static_warning
3027 = "`%D' was declared implicitly `extern' and later `static'";
3031 if (TREE_CODE (newdecl
) == TYPE_DECL
3032 || TREE_CODE (newdecl
) == TEMPLATE_DECL
3033 || TREE_CODE (newdecl
) == CONST_DECL
)
3036 /* Don't get confused by static member functions; that's a different
3038 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3039 && DECL_STATIC_FUNCTION_P (newdecl
))
3042 /* If the old declaration was `static', or the new one isn't, then
3043 then everything is OK. */
3044 if (DECL_THIS_STATIC (olddecl
) || !DECL_THIS_STATIC (newdecl
))
3047 /* It's OK to declare a builtin function as `static'. */
3048 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3049 && DECL_ARTIFICIAL (olddecl
))
3052 name
= DECL_ASSEMBLER_NAME (newdecl
);
3053 cp_pedwarn (IDENTIFIER_IMPLICIT_DECL (name
)
3054 ? implicit_extern_static_warning
3055 : explicit_extern_static_warning
, newdecl
);
3056 cp_pedwarn_at ("previous declaration of `%D'", olddecl
);
3059 /* Handle when a new declaration NEWDECL has the same name as an old
3060 one OLDDECL in the same binding contour. Prints an error message
3063 If safely possible, alter OLDDECL to look like NEWDECL, and return 1.
3064 Otherwise, return 0. */
3067 duplicate_decls (newdecl
, olddecl
)
3068 tree newdecl
, olddecl
;
3070 unsigned olddecl_uid
= DECL_UID (olddecl
);
3071 int olddecl_friend
= 0, types_match
= 0;
3072 int new_defines_function
= 0;
3074 if (newdecl
== olddecl
)
3077 types_match
= decls_match (newdecl
, olddecl
);
3079 /* If either the type of the new decl or the type of the old decl is an
3080 error_mark_node, then that implies that we have already issued an
3081 error (earlier) for some bogus type specification, and in that case,
3082 it is rather pointless to harass the user with yet more error message
3083 about the same declaration, so just pretend the types match here. */
3084 if (TREE_TYPE (newdecl
) == error_mark_node
3085 || TREE_TYPE (olddecl
) == error_mark_node
)
3088 /* Check for redeclaration and other discrepancies. */
3089 if (TREE_CODE (olddecl
) == FUNCTION_DECL
3090 && DECL_ARTIFICIAL (olddecl
))
3092 if (TREE_CODE (newdecl
) != FUNCTION_DECL
)
3094 /* If you declare a built-in or predefined function name as static,
3095 the old definition is overridden, but optionally warn this was a
3096 bad choice of name. */
3097 if (! TREE_PUBLIC (newdecl
))
3100 cp_warning ("shadowing %s function `%#D'",
3101 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3103 /* Discard the old built-in function. */
3106 /* If the built-in is not ansi, then programs can override
3107 it even globally without an error. */
3108 else if (! DECL_BUILT_IN (olddecl
))
3109 cp_warning ("library function `%#D' redeclared as non-function `%#D'",
3113 cp_error ("declaration of `%#D'", newdecl
);
3114 cp_error ("conflicts with built-in declaration `%#D'",
3119 else if (!types_match
)
3121 if ((DECL_EXTERN_C_P (newdecl
)
3122 && DECL_EXTERN_C_P (olddecl
))
3123 || compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3124 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3126 /* A near match; override the builtin. */
3128 if (TREE_PUBLIC (newdecl
))
3130 cp_warning ("new declaration `%#D'", newdecl
);
3131 cp_warning ("ambiguates built-in declaration `%#D'",
3134 else if (warn_shadow
)
3135 cp_warning ("shadowing %s function `%#D'",
3136 DECL_BUILT_IN (olddecl
) ? "built-in" : "library",
3140 /* Discard the old built-in function. */
3144 if (DECL_THIS_STATIC (newdecl
) && !DECL_THIS_STATIC (olddecl
))
3146 /* If a builtin function is redeclared as `static', merge
3147 the declarations, but make the original one static. */
3148 DECL_THIS_STATIC (olddecl
) = 1;
3149 TREE_PUBLIC (olddecl
) = 0;
3151 /* Make the old declaration consistent with the new one so
3152 that all remnants of the builtin-ness of this function
3153 will be banished. */
3154 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3155 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3156 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3157 SET_IDENTIFIER_GLOBAL_VALUE (DECL_ASSEMBLER_NAME (newdecl
),
3161 else if (TREE_CODE (olddecl
) != TREE_CODE (newdecl
))
3163 if ((TREE_CODE (olddecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (olddecl
)
3164 && TREE_CODE (newdecl
) != TYPE_DECL
3165 && ! (TREE_CODE (newdecl
) == TEMPLATE_DECL
3166 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
))
3167 || (TREE_CODE (newdecl
) == TYPE_DECL
&& DECL_ARTIFICIAL (newdecl
)
3168 && TREE_CODE (olddecl
) != TYPE_DECL
3169 && ! (TREE_CODE (olddecl
) == TEMPLATE_DECL
3170 && (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
))
3173 /* We do nothing special here, because C++ does such nasty
3174 things with TYPE_DECLs. Instead, just let the TYPE_DECL
3175 get shadowed, and know that if we need to find a TYPE_DECL
3176 for a given name, we can look in the IDENTIFIER_TYPE_VALUE
3177 slot of the identifier. */
3181 if ((TREE_CODE (newdecl
) == FUNCTION_DECL
3182 && DECL_FUNCTION_TEMPLATE_P (olddecl
))
3183 || (TREE_CODE (olddecl
) == FUNCTION_DECL
3184 && DECL_FUNCTION_TEMPLATE_P (newdecl
)))
3187 cp_error ("`%#D' redeclared as different kind of symbol", newdecl
);
3188 if (TREE_CODE (olddecl
) == TREE_LIST
)
3189 olddecl
= TREE_VALUE (olddecl
);
3190 cp_error_at ("previous declaration of `%#D'", olddecl
);
3192 /* New decl is completely inconsistent with the old one =>
3193 tell caller to replace the old one. */
3197 else if (!types_match
)
3199 if (CP_DECL_CONTEXT (newdecl
) != CP_DECL_CONTEXT (olddecl
))
3200 /* These are certainly not duplicate declarations; they're
3201 from different scopes. */
3204 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3206 /* The name of a class template may not be declared to refer to
3207 any other template, class, function, object, namespace, value,
3208 or type in the same scope. */
3209 if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == TYPE_DECL
3210 || TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == TYPE_DECL
)
3212 cp_error ("declaration of template `%#D'", newdecl
);
3213 cp_error_at ("conflicts with previous declaration `%#D'",
3216 else if (TREE_CODE (DECL_TEMPLATE_RESULT (olddecl
)) == FUNCTION_DECL
3217 && TREE_CODE (DECL_TEMPLATE_RESULT (newdecl
)) == FUNCTION_DECL
3218 && compparms (TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
))),
3219 TYPE_ARG_TYPES (TREE_TYPE (DECL_TEMPLATE_RESULT (newdecl
))))
3220 && comp_template_parms (DECL_TEMPLATE_PARMS (newdecl
),
3221 DECL_TEMPLATE_PARMS (olddecl
)))
3223 cp_error ("new declaration `%#D'", newdecl
);
3224 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3228 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3230 if (DECL_EXTERN_C_P (newdecl
) && DECL_EXTERN_C_P (olddecl
))
3232 cp_error ("declaration of C function `%#D' conflicts with",
3234 cp_error_at ("previous declaration `%#D' here", olddecl
);
3236 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (newdecl
)),
3237 TYPE_ARG_TYPES (TREE_TYPE (olddecl
))))
3239 cp_error ("new declaration `%#D'", newdecl
);
3240 cp_error_at ("ambiguates old declaration `%#D'", olddecl
);
3246 /* Already complained about this, so don't do so again. */
3247 else if (current_class_type
== NULL_TREE
3248 || IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (newdecl
)) != current_class_type
)
3250 cp_error ("conflicting types for `%#D'", newdecl
);
3251 cp_error_at ("previous declaration as `%#D'", olddecl
);
3254 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3255 && ((DECL_TEMPLATE_SPECIALIZATION (olddecl
)
3256 && (!DECL_TEMPLATE_INFO (newdecl
)
3257 || (DECL_TI_TEMPLATE (newdecl
)
3258 != DECL_TI_TEMPLATE (olddecl
))))
3259 || (DECL_TEMPLATE_SPECIALIZATION (newdecl
)
3260 && (!DECL_TEMPLATE_INFO (olddecl
)
3261 || (DECL_TI_TEMPLATE (olddecl
)
3262 != DECL_TI_TEMPLATE (newdecl
))))))
3263 /* It's OK to have a template specialization and a non-template
3264 with the same type, or to have specializations of two
3265 different templates with the same type. Note that if one is a
3266 specialization, and the other is an instantiation of the same
3267 template, that we do not exit at this point. That situation
3268 can occur if we instantiate a template class, and then
3269 specialize one of its methods. This situation is legal, but
3270 the declarations must be merged in the usual way. */
3272 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3273 && ((DECL_TEMPLATE_INSTANTIATION (olddecl
)
3274 && !DECL_USE_TEMPLATE (newdecl
))
3275 || (DECL_TEMPLATE_INSTANTIATION (newdecl
)
3276 && !DECL_USE_TEMPLATE (olddecl
))))
3277 /* One of the declarations is a template instantiation, and the
3278 other is not a template at all. That's OK. */
3280 else if (TREE_CODE (newdecl
) == NAMESPACE_DECL
3281 && DECL_NAMESPACE_ALIAS (newdecl
)
3282 && DECL_NAMESPACE_ALIAS (newdecl
) == DECL_NAMESPACE_ALIAS (olddecl
))
3283 /* Redeclaration of namespace alias, ignore it. */
3287 const char *errmsg
= redeclaration_error_message (newdecl
, olddecl
);
3290 cp_error (errmsg
, newdecl
);
3291 if (DECL_NAME (olddecl
) != NULL_TREE
)
3292 cp_error_at ((DECL_INITIAL (olddecl
)
3293 && namespace_bindings_p ())
3294 ? "`%#D' previously defined here"
3295 : "`%#D' previously declared here", olddecl
);
3297 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3298 && DECL_INITIAL (olddecl
) != NULL_TREE
3299 && TYPE_ARG_TYPES (TREE_TYPE (olddecl
)) == NULL_TREE
3300 && TYPE_ARG_TYPES (TREE_TYPE (newdecl
)) != NULL_TREE
)
3302 /* Prototype decl follows defn w/o prototype. */
3303 cp_warning_at ("prototype for `%#D'", newdecl
);
3304 cp_warning_at ("follows non-prototype definition here", olddecl
);
3306 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
3307 && DECL_LANGUAGE (newdecl
) != DECL_LANGUAGE (olddecl
))
3309 /* extern "C" int foo ();
3310 int foo () { bar (); }
3312 if (current_lang_stack
3313 == &VARRAY_TREE (current_lang_base
, 0))
3314 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3317 cp_error_at ("previous declaration of `%#D' with %L linkage",
3318 olddecl
, DECL_LANGUAGE (olddecl
));
3319 cp_error ("conflicts with new declaration with %L linkage",
3320 DECL_LANGUAGE (newdecl
));
3324 if (DECL_LANG_SPECIFIC (olddecl
) && DECL_USE_TEMPLATE (olddecl
))
3326 else if (TREE_CODE (olddecl
) == FUNCTION_DECL
)
3328 tree t1
= TYPE_ARG_TYPES (TREE_TYPE (olddecl
));
3329 tree t2
= TYPE_ARG_TYPES (TREE_TYPE (newdecl
));
3332 if (TREE_CODE (TREE_TYPE (newdecl
)) == METHOD_TYPE
)
3333 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
);
3335 for (; t1
&& t1
!= void_list_node
;
3336 t1
= TREE_CHAIN (t1
), t2
= TREE_CHAIN (t2
), i
++)
3337 if (TREE_PURPOSE (t1
) && TREE_PURPOSE (t2
))
3339 if (1 == simple_cst_equal (TREE_PURPOSE (t1
),
3344 cp_pedwarn ("default argument given for parameter %d of `%#D'",
3346 cp_pedwarn_at ("after previous specification in `%#D'",
3352 cp_error ("default argument given for parameter %d of `%#D'",
3354 cp_error_at ("after previous specification in `%#D'",
3359 if (DECL_THIS_INLINE (newdecl
) && ! DECL_THIS_INLINE (olddecl
)
3360 && TREE_ADDRESSABLE (olddecl
) && warn_inline
)
3362 cp_warning ("`%#D' was used before it was declared inline",
3364 cp_warning_at ("previous non-inline declaration here",
3370 /* If new decl is `static' and an `extern' was seen previously,
3372 warn_extern_redeclared_static (newdecl
, olddecl
);
3374 /* We have committed to returning 1 at this point. */
3375 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3377 /* Now that functions must hold information normally held
3378 by field decls, there is extra work to do so that
3379 declaration information does not get destroyed during
3381 if (DECL_VINDEX (olddecl
))
3382 DECL_VINDEX (newdecl
) = DECL_VINDEX (olddecl
);
3383 if (DECL_VIRTUAL_CONTEXT (olddecl
))
3384 DECL_VIRTUAL_CONTEXT (newdecl
) = DECL_VIRTUAL_CONTEXT (olddecl
);
3385 if (DECL_CONTEXT (olddecl
))
3386 DECL_CONTEXT (newdecl
) = DECL_CONTEXT (olddecl
);
3387 if (DECL_PENDING_INLINE_INFO (newdecl
) == 0)
3388 DECL_PENDING_INLINE_INFO (newdecl
) = DECL_PENDING_INLINE_INFO (olddecl
);
3389 DECL_STATIC_CONSTRUCTOR (newdecl
) |= DECL_STATIC_CONSTRUCTOR (olddecl
);
3390 DECL_STATIC_DESTRUCTOR (newdecl
) |= DECL_STATIC_DESTRUCTOR (olddecl
);
3391 DECL_PURE_VIRTUAL_P (newdecl
) |= DECL_PURE_VIRTUAL_P (olddecl
);
3392 DECL_VIRTUAL_P (newdecl
) |= DECL_VIRTUAL_P (olddecl
);
3393 DECL_NEEDS_FINAL_OVERRIDER_P (newdecl
) |= DECL_NEEDS_FINAL_OVERRIDER_P (olddecl
);
3394 DECL_THIS_STATIC (newdecl
) |= DECL_THIS_STATIC (olddecl
);
3395 DECL_LANG_SPECIFIC (newdecl
)->u2
= DECL_LANG_SPECIFIC (olddecl
)->u2
;
3396 new_defines_function
= DECL_INITIAL (newdecl
) != NULL_TREE
;
3398 /* Optionally warn about more than one declaration for the same
3399 name, but don't warn about a function declaration followed by a
3401 if (warn_redundant_decls
&& ! DECL_ARTIFICIAL (olddecl
)
3402 && !(new_defines_function
&& DECL_INITIAL (olddecl
) == NULL_TREE
)
3403 /* Don't warn about extern decl followed by definition. */
3404 && !(DECL_EXTERNAL (olddecl
) && ! DECL_EXTERNAL (newdecl
))
3405 /* Don't warn about friends, let add_friend take care of it. */
3406 && ! DECL_FRIEND_P (newdecl
))
3408 cp_warning ("redundant redeclaration of `%D' in same scope", newdecl
);
3409 cp_warning_at ("previous declaration of `%D'", olddecl
);
3413 /* Deal with C++: must preserve virtual function table size. */
3414 if (TREE_CODE (olddecl
) == TYPE_DECL
)
3416 register tree newtype
= TREE_TYPE (newdecl
);
3417 register tree oldtype
= TREE_TYPE (olddecl
);
3419 if (newtype
!= error_mark_node
&& oldtype
!= error_mark_node
3420 && TYPE_LANG_SPECIFIC (newtype
) && TYPE_LANG_SPECIFIC (oldtype
))
3422 CLASSTYPE_VSIZE (newtype
) = CLASSTYPE_VSIZE (oldtype
);
3423 CLASSTYPE_FRIEND_CLASSES (newtype
)
3424 = CLASSTYPE_FRIEND_CLASSES (oldtype
);
3427 DECL_ORIGINAL_TYPE (newdecl
) = DECL_ORIGINAL_TYPE (olddecl
);
3430 /* Copy all the DECL_... slots specified in the new decl
3431 except for any that we copy here from the old type. */
3432 DECL_MACHINE_ATTRIBUTES (newdecl
)
3433 = merge_machine_decl_attributes (olddecl
, newdecl
);
3435 if (TREE_CODE (newdecl
) == TEMPLATE_DECL
)
3437 TREE_TYPE (olddecl
) = TREE_TYPE (DECL_TEMPLATE_RESULT (olddecl
));
3438 DECL_TEMPLATE_SPECIALIZATIONS (olddecl
)
3439 = chainon (DECL_TEMPLATE_SPECIALIZATIONS (olddecl
),
3440 DECL_TEMPLATE_SPECIALIZATIONS (newdecl
));
3447 /* Automatically handles default parameters. */
3448 tree oldtype
= TREE_TYPE (olddecl
);
3451 /* Merge the data types specified in the two decls. */
3452 newtype
= common_type (TREE_TYPE (newdecl
), TREE_TYPE (olddecl
));
3454 /* If common_type produces a non-typedef type, just use the old type. */
3455 if (TREE_CODE (newdecl
) == TYPE_DECL
3456 && newtype
== DECL_ORIGINAL_TYPE (newdecl
))
3459 if (TREE_CODE (newdecl
) == VAR_DECL
)
3460 DECL_THIS_EXTERN (newdecl
) |= DECL_THIS_EXTERN (olddecl
);
3461 /* Do this after calling `common_type' so that default
3462 parameters don't confuse us. */
3463 else if (TREE_CODE (newdecl
) == FUNCTION_DECL
3464 && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
))
3465 != TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
))))
3467 TREE_TYPE (newdecl
) = build_exception_variant (newtype
,
3468 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)));
3469 TREE_TYPE (olddecl
) = build_exception_variant (newtype
,
3470 TYPE_RAISES_EXCEPTIONS (oldtype
));
3472 if ((pedantic
|| ! DECL_IN_SYSTEM_HEADER (olddecl
))
3473 && DECL_SOURCE_LINE (olddecl
) != 0
3475 && !comp_except_specs (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (newdecl
)),
3476 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (olddecl
)), 1))
3478 cp_error ("declaration of `%F' throws different exceptions",
3480 cp_error_at ("than previous declaration `%F'", olddecl
);
3483 TREE_TYPE (newdecl
) = TREE_TYPE (olddecl
) = newtype
;
3485 /* Lay the type out, unless already done. */
3486 if (! same_type_p (newtype
, oldtype
)
3487 && TREE_TYPE (newdecl
) != error_mark_node
3488 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3489 layout_type (TREE_TYPE (newdecl
));
3491 if ((TREE_CODE (newdecl
) == VAR_DECL
3492 || TREE_CODE (newdecl
) == PARM_DECL
3493 || TREE_CODE (newdecl
) == RESULT_DECL
3494 || TREE_CODE (newdecl
) == FIELD_DECL
3495 || TREE_CODE (newdecl
) == TYPE_DECL
)
3496 && !(processing_template_decl
&& uses_template_parms (newdecl
)))
3497 layout_decl (newdecl
, 0);
3499 /* Merge the type qualifiers. */
3500 if (TREE_READONLY (newdecl
))
3501 TREE_READONLY (olddecl
) = 1;
3502 if (TREE_THIS_VOLATILE (newdecl
))
3503 TREE_THIS_VOLATILE (olddecl
) = 1;
3505 /* Merge the initialization information. */
3506 if (DECL_INITIAL (newdecl
) == NULL_TREE
3507 && DECL_INITIAL (olddecl
) != NULL_TREE
)
3509 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3510 DECL_SOURCE_FILE (newdecl
) = DECL_SOURCE_FILE (olddecl
);
3511 DECL_SOURCE_LINE (newdecl
) = DECL_SOURCE_LINE (olddecl
);
3512 if (CAN_HAVE_FULL_LANG_DECL_P (newdecl
)
3513 && DECL_LANG_SPECIFIC (newdecl
)
3514 && DECL_LANG_SPECIFIC (olddecl
))
3515 DECL_SAVED_TREE (newdecl
) = DECL_SAVED_TREE (olddecl
);
3518 /* Merge the section attribute.
3519 We want to issue an error if the sections conflict but that must be
3520 done later in decl_attributes since we are called before attributes
3522 if (DECL_SECTION_NAME (newdecl
) == NULL_TREE
)
3523 DECL_SECTION_NAME (newdecl
) = DECL_SECTION_NAME (olddecl
);
3525 /* Keep the old rtl since we can safely use it. */
3526 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3528 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3530 DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (newdecl
)
3531 |= DECL_NO_INSTRUMENT_FUNCTION_ENTRY_EXIT (olddecl
);
3532 DECL_NO_CHECK_MEMORY_USAGE (newdecl
)
3533 |= DECL_NO_CHECK_MEMORY_USAGE (olddecl
);
3534 DECL_NO_LIMIT_STACK (newdecl
)
3535 |= DECL_NO_LIMIT_STACK (olddecl
);
3538 /* If cannot merge, then use the new type and qualifiers,
3539 and don't preserve the old rtl. */
3542 /* Clean out any memory we had of the old declaration. */
3543 tree oldstatic
= value_member (olddecl
, static_aggregates
);
3545 TREE_VALUE (oldstatic
) = error_mark_node
;
3547 TREE_TYPE (olddecl
) = TREE_TYPE (newdecl
);
3548 TREE_READONLY (olddecl
) = TREE_READONLY (newdecl
);
3549 TREE_THIS_VOLATILE (olddecl
) = TREE_THIS_VOLATILE (newdecl
);
3550 TREE_SIDE_EFFECTS (olddecl
) = TREE_SIDE_EFFECTS (newdecl
);
3553 /* Merge the storage class information. */
3554 DECL_WEAK (newdecl
) |= DECL_WEAK (olddecl
);
3555 DECL_ONE_ONLY (newdecl
) |= DECL_ONE_ONLY (olddecl
);
3556 DECL_DEFER_OUTPUT (newdecl
) |= DECL_DEFER_OUTPUT (olddecl
);
3557 TREE_PUBLIC (newdecl
) = TREE_PUBLIC (olddecl
);
3558 TREE_STATIC (olddecl
) = TREE_STATIC (newdecl
) |= TREE_STATIC (olddecl
);
3559 if (! DECL_EXTERNAL (olddecl
))
3560 DECL_EXTERNAL (newdecl
) = 0;
3562 if (DECL_LANG_SPECIFIC (newdecl
) && DECL_LANG_SPECIFIC (olddecl
))
3564 DECL_INTERFACE_KNOWN (newdecl
) |= DECL_INTERFACE_KNOWN (olddecl
);
3565 DECL_NOT_REALLY_EXTERN (newdecl
) |= DECL_NOT_REALLY_EXTERN (olddecl
);
3566 DECL_COMDAT (newdecl
) |= DECL_COMDAT (olddecl
);
3567 DECL_TEMPLATE_INSTANTIATED (newdecl
)
3568 |= DECL_TEMPLATE_INSTANTIATED (olddecl
);
3569 /* Don't really know how much of the language-specific
3570 values we should copy from old to new. */
3571 DECL_IN_AGGR_P (newdecl
) = DECL_IN_AGGR_P (olddecl
);
3572 DECL_ACCESS (newdecl
) = DECL_ACCESS (olddecl
);
3573 DECL_NONCONVERTING_P (newdecl
) = DECL_NONCONVERTING_P (olddecl
);
3574 DECL_TEMPLATE_INFO (newdecl
) = DECL_TEMPLATE_INFO (olddecl
);
3575 DECL_INITIALIZED_IN_CLASS_P (newdecl
)
3576 |= DECL_INITIALIZED_IN_CLASS_P (olddecl
);
3577 olddecl_friend
= DECL_FRIEND_P (olddecl
);
3579 /* Only functions have DECL_BEFRIENDING_CLASSES. */
3580 if (TREE_CODE (newdecl
) == FUNCTION_DECL
3581 || DECL_FUNCTION_TEMPLATE_P (newdecl
))
3582 DECL_BEFRIENDING_CLASSES (newdecl
)
3583 = chainon (DECL_BEFRIENDING_CLASSES (newdecl
),
3584 DECL_BEFRIENDING_CLASSES (olddecl
));
3587 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3589 if (DECL_TEMPLATE_INSTANTIATION (olddecl
)
3590 && !DECL_TEMPLATE_INSTANTIATION (newdecl
))
3592 /* If newdecl is not a specialization, then it is not a
3593 template-related function at all. And that means that we
3594 shoud have exited above, returning 0. */
3595 my_friendly_assert (DECL_TEMPLATE_SPECIALIZATION (newdecl
),
3598 if (TREE_USED (olddecl
))
3599 /* From [temp.expl.spec]:
3601 If a template, a member template or the member of a class
3602 template is explicitly specialized then that
3603 specialization shall be declared before the first use of
3604 that specialization that would cause an implicit
3605 instantiation to take place, in every translation unit in
3606 which such a use occurs. */
3607 cp_error ("explicit specialization of %D after first use",
3610 SET_DECL_TEMPLATE_SPECIALIZATION (olddecl
);
3612 DECL_THIS_INLINE (newdecl
) |= DECL_THIS_INLINE (olddecl
);
3614 /* If either decl says `inline', this fn is inline, unless its
3615 definition was passed already. */
3616 if (DECL_INLINE (newdecl
) && DECL_INITIAL (olddecl
) == NULL_TREE
)
3617 DECL_INLINE (olddecl
) = 1;
3618 DECL_INLINE (newdecl
) = DECL_INLINE (olddecl
);
3622 DECL_LANGUAGE (olddecl
) = DECL_LANGUAGE (newdecl
);
3623 DECL_ASSEMBLER_NAME (olddecl
) = DECL_ASSEMBLER_NAME (newdecl
);
3624 DECL_RTL (olddecl
) = DECL_RTL (newdecl
);
3626 if (! types_match
|| new_defines_function
)
3628 /* These need to be copied so that the names are available.
3629 Note that if the types do match, we'll preserve inline
3630 info and other bits, but if not, we won't. */
3631 DECL_ARGUMENTS (olddecl
) = DECL_ARGUMENTS (newdecl
);
3632 DECL_RESULT (olddecl
) = DECL_RESULT (newdecl
);
3634 if (new_defines_function
)
3635 /* If defining a function declared with other language
3636 linkage, use the previously declared language linkage. */
3637 DECL_LANGUAGE (newdecl
) = DECL_LANGUAGE (olddecl
);
3638 else if (types_match
)
3640 /* If redeclaring a builtin function, and not a definition,
3641 it stays built in. */
3642 if (DECL_BUILT_IN (olddecl
))
3644 DECL_BUILT_IN_CLASS (newdecl
) = DECL_BUILT_IN_CLASS (olddecl
);
3645 DECL_FUNCTION_CODE (newdecl
) = DECL_FUNCTION_CODE (olddecl
);
3646 /* If we're keeping the built-in definition, keep the rtl,
3647 regardless of declaration matches. */
3648 DECL_RTL (newdecl
) = DECL_RTL (olddecl
);
3651 DECL_FRAME_SIZE (newdecl
) = DECL_FRAME_SIZE (olddecl
);
3653 DECL_RESULT (newdecl
) = DECL_RESULT (olddecl
);
3654 if ((DECL_SAVED_INSNS (newdecl
) = DECL_SAVED_INSNS (olddecl
)))
3655 /* Previously saved insns go together with
3656 the function's previous definition. */
3657 DECL_INITIAL (newdecl
) = DECL_INITIAL (olddecl
);
3658 /* Don't clear out the arguments if we're redefining a function. */
3659 if (DECL_ARGUMENTS (olddecl
))
3660 DECL_ARGUMENTS (newdecl
) = DECL_ARGUMENTS (olddecl
);
3664 if (TREE_CODE (newdecl
) == NAMESPACE_DECL
)
3666 NAMESPACE_LEVEL (newdecl
) = NAMESPACE_LEVEL (olddecl
);
3669 /* Now preserve various other info from the definition. */
3670 TREE_ADDRESSABLE (newdecl
) = TREE_ADDRESSABLE (olddecl
);
3671 TREE_ASM_WRITTEN (newdecl
) = TREE_ASM_WRITTEN (olddecl
);
3672 DECL_COMMON (newdecl
) = DECL_COMMON (olddecl
);
3673 DECL_ASSEMBLER_NAME (newdecl
) = DECL_ASSEMBLER_NAME (olddecl
);
3675 if (TREE_CODE (newdecl
) == FUNCTION_DECL
)
3679 function_size
= sizeof (struct tree_decl
);
3681 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3682 (char *) olddecl
+ sizeof (struct tree_common
),
3683 function_size
- sizeof (struct tree_common
));
3685 if (DECL_TEMPLATE_INSTANTIATION (newdecl
))
3687 /* If newdecl is a template instantiation, it is possible that
3688 the following sequence of events has occurred:
3690 o A friend function was declared in a class template. The
3691 class template was instantiated.
3693 o The instantiation of the friend declaration was
3694 recorded on the instantiation list, and is newdecl.
3696 o Later, however, instantiate_class_template called pushdecl
3697 on the newdecl to perform name injection. But, pushdecl in
3698 turn called duplicate_decls when it discovered that another
3699 declaration of a global function with the same name already
3702 o Here, in duplicate_decls, we decided to clobber newdecl.
3704 If we're going to do that, we'd better make sure that
3705 olddecl, and not newdecl, is on the list of
3706 instantiations so that if we try to do the instantiation
3707 again we won't get the clobbered declaration. */
3709 tree tmpl
= DECL_TI_TEMPLATE (newdecl
);
3710 tree decls
= DECL_TEMPLATE_SPECIALIZATIONS (tmpl
);
3712 for (; decls
; decls
= TREE_CHAIN (decls
))
3713 if (TREE_VALUE (decls
) == newdecl
)
3714 TREE_VALUE (decls
) = olddecl
;
3719 bcopy ((char *) newdecl
+ sizeof (struct tree_common
),
3720 (char *) olddecl
+ sizeof (struct tree_common
),
3721 sizeof (struct tree_decl
) - sizeof (struct tree_common
)
3722 + tree_code_length
[(int)TREE_CODE (newdecl
)] * sizeof (char *));
3725 DECL_UID (olddecl
) = olddecl_uid
;
3727 DECL_FRIEND_P (olddecl
) = 1;
3729 /* NEWDECL contains the merged attribute lists.
3730 Update OLDDECL to be the same. */
3731 DECL_MACHINE_ATTRIBUTES (olddecl
) = DECL_MACHINE_ATTRIBUTES (newdecl
);
3736 /* Record a decl-node X as belonging to the current lexical scope.
3737 Check for errors (such as an incompatible declaration for the same
3738 name already seen in the same scope).
3740 Returns either X or an old decl for the same name.
3741 If an old decl is returned, it may have been smashed
3742 to agree with what X says. */
3750 int need_new_binding
;
3752 /* We shouldn't be calling pushdecl when we're generating RTL for a
3753 function that we already did semantic analysis on previously. */
3754 my_friendly_assert (!cfun
|| doing_semantic_analysis_p (),
3757 need_new_binding
= 1;
3759 if (DECL_TEMPLATE_PARM_P (x
))
3760 /* Template parameters have no context; they are not X::T even
3761 when declared within a class or namespace. */
3765 if (current_function_decl
&& x
!= current_function_decl
3766 /* A local declaration for a function doesn't constitute
3768 && !(TREE_CODE (x
) == FUNCTION_DECL
&& !DECL_INITIAL (x
))
3769 /* A local declaration for an `extern' variable is in the
3770 scope of the current namespace, not the current
3772 && !(TREE_CODE (x
) == VAR_DECL
&& DECL_EXTERNAL (x
))
3773 && !DECL_CONTEXT (x
))
3774 DECL_CONTEXT (x
) = current_function_decl
;
3776 /* If this is the declaration for a namespace-scope function,
3777 but the declaration itself is in a local scope, mark the
3779 if (TREE_CODE (x
) == FUNCTION_DECL
3780 && DECL_NAMESPACE_SCOPE_P (x
)
3781 && current_function_decl
3782 && x
!= current_function_decl
)
3783 DECL_LOCAL_FUNCTION_P (x
) = 1;
3786 name
= DECL_NAME (x
);
3789 int different_binding_level
= 0;
3791 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3792 name
= TREE_OPERAND (name
, 0);
3794 /* In case this decl was explicitly namespace-qualified, look it
3795 up in its namespace context. */
3796 if (TREE_CODE (x
) == VAR_DECL
&& DECL_NAMESPACE_SCOPE_P (x
)
3797 && namespace_bindings_p ())
3798 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3800 t
= lookup_name_current_level (name
);
3802 /* [basic.link] If there is a visible declaration of an entity
3803 with linkage having the same name and type, ignoring entities
3804 declared outside the innermost enclosing namespace scope, the
3805 block scope declaration declares that same entity and
3806 receives the linkage of the previous declaration. */
3807 if (! t
&& current_function_decl
&& x
!= current_function_decl
3808 && (TREE_CODE (x
) == FUNCTION_DECL
|| TREE_CODE (x
) == VAR_DECL
)
3809 && DECL_EXTERNAL (x
))
3811 /* Look in block scope. */
3812 t
= IDENTIFIER_VALUE (name
);
3813 /* Or in the innermost namespace. */
3815 t
= namespace_binding (name
, DECL_CONTEXT (x
));
3816 /* Does it have linkage? Note that if this isn't a DECL, it's an
3817 OVERLOAD, which is OK. */
3818 if (t
&& DECL_P (t
) && ! (TREE_STATIC (t
) || DECL_EXTERNAL (t
)))
3821 different_binding_level
= 1;
3824 /* If we are declaring a function, and the result of name-lookup
3825 was an OVERLOAD, look for an overloaded instance that is
3826 actually the same as the function we are declaring. (If
3827 there is one, we have to merge our declaration with the
3828 previous declaration.) */
3829 if (t
&& TREE_CODE (t
) == OVERLOAD
)
3833 if (TREE_CODE (x
) == FUNCTION_DECL
)
3834 for (match
= t
; match
; match
= OVL_NEXT (match
))
3836 if (DECL_ASSEMBLER_NAME (OVL_CURRENT (t
))
3837 == DECL_ASSEMBLER_NAME (x
))
3841 /* Just choose one. */
3845 t
= OVL_CURRENT (match
);
3850 if (t
== error_mark_node
)
3852 /* error_mark_node is 0 for a while during initialization! */
3854 cp_error_at ("`%#D' used prior to declaration", x
);
3856 else if (t
!= NULL_TREE
)
3858 if (different_binding_level
)
3860 if (decls_match (x
, t
))
3861 /* The standard only says that the local extern
3862 inherits linkage from the previous decl; in
3863 particular, default args are not shared. It would
3864 be nice to propagate inlining info, though. FIXME. */
3865 TREE_PUBLIC (x
) = TREE_PUBLIC (t
);
3867 else if (TREE_CODE (t
) == PARM_DECL
)
3869 if (DECL_CONTEXT (t
) == NULL_TREE
)
3870 /* This is probaby caused by too many errors, but calling
3871 abort will say that if errors have occurred. */
3874 /* Check for duplicate params. */
3875 if (duplicate_decls (x
, t
))
3878 else if ((DECL_EXTERN_C_FUNCTION_P (x
)
3879 || DECL_FUNCTION_TEMPLATE_P (x
))
3880 && is_overloaded_fn (t
))
3881 /* Don't do anything just yet. */;
3882 else if (t
== wchar_decl_node
)
3884 if (pedantic
&& ! DECL_IN_SYSTEM_HEADER (x
))
3885 cp_pedwarn ("redeclaration of wchar_t as `%T'", TREE_TYPE (x
));
3887 /* Throw away the redeclaration. */
3890 else if (TREE_CODE (t
) != TREE_CODE (x
))
3892 if (duplicate_decls (x
, t
))
3895 else if (duplicate_decls (x
, t
))
3897 if (TREE_CODE (t
) == TYPE_DECL
)
3898 SET_IDENTIFIER_TYPE_VALUE (name
, TREE_TYPE (t
));
3899 else if (TREE_CODE (t
) == FUNCTION_DECL
)
3900 check_default_args (t
);
3904 else if (DECL_MAIN_P (x
))
3906 /* A redeclaration of main, but not a duplicate of the
3911 This function shall not be overloaded. */
3912 cp_error_at ("invalid redeclaration of `%D'", t
);
3913 cp_error ("as `%D'", x
);
3914 /* We don't try to push this declaration since that
3920 check_template_shadow (x
);
3922 /* If this is a function conjured up by the backend, massage it
3923 so it looks friendly. */
3924 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_LANG_SPECIFIC (x
))
3926 retrofit_lang_decl (x
);
3927 DECL_LANGUAGE (x
) = lang_c
;
3930 if (DECL_NON_THUNK_FUNCTION_P (x
) && ! DECL_FUNCTION_MEMBER_P (x
))
3932 t
= push_overloaded_decl (x
, PUSH_LOCAL
);
3935 if (!namespace_bindings_p ())
3936 /* We do not need to create a binding for this name;
3937 push_overloaded_decl will have already done so if
3939 need_new_binding
= 0;
3941 else if (DECL_FUNCTION_TEMPLATE_P (x
) && DECL_NAMESPACE_SCOPE_P (x
))
3943 t
= push_overloaded_decl (x
, PUSH_GLOBAL
);
3945 add_decl_to_level (x
, NAMESPACE_LEVEL (CP_DECL_CONTEXT (t
)));
3949 /* If declaring a type as a typedef, copy the type (unless we're
3950 at line 0), and install this TYPE_DECL as the new type's typedef
3951 name. See the extensive comment in ../c-decl.c (pushdecl). */
3952 if (TREE_CODE (x
) == TYPE_DECL
)
3954 tree type
= TREE_TYPE (x
);
3955 if (DECL_SOURCE_LINE (x
) == 0)
3957 if (TYPE_NAME (type
) == 0)
3958 TYPE_NAME (type
) = x
;
3960 else if (type
!= error_mark_node
&& TYPE_NAME (type
) != x
3961 /* We don't want to copy the type when all we're
3962 doing is making a TYPE_DECL for the purposes of
3964 && (!TYPE_NAME (type
)
3965 || TYPE_NAME (type
) != DECL_ABSTRACT_ORIGIN (x
)))
3967 DECL_ORIGINAL_TYPE (x
) = type
;
3968 type
= build_type_copy (type
);
3969 TYPE_STUB_DECL (type
) = TYPE_STUB_DECL (DECL_ORIGINAL_TYPE (x
));
3970 TYPE_NAME (type
) = x
;
3971 TREE_TYPE (x
) = type
;
3974 if (type
!= error_mark_node
3976 && TYPE_IDENTIFIER (type
))
3977 set_identifier_type_value_with_scope (DECL_NAME (x
), type
,
3978 current_binding_level
);
3982 /* Multiple external decls of the same identifier ought to match.
3984 We get warnings about inline functions where they are defined.
3985 We get warnings about other functions from push_overloaded_decl.
3987 Avoid duplicate warnings where they are used. */
3988 if (TREE_PUBLIC (x
) && TREE_CODE (x
) != FUNCTION_DECL
)
3992 decl
= IDENTIFIER_NAMESPACE_VALUE (name
);
3993 if (decl
&& TREE_CODE (decl
) == OVERLOAD
)
3994 decl
= OVL_FUNCTION (decl
);
3996 if (decl
&& decl
!= error_mark_node
3997 && (DECL_EXTERNAL (decl
) || TREE_PUBLIC (decl
))
3998 /* If different sort of thing, we already gave an error. */
3999 && TREE_CODE (decl
) == TREE_CODE (x
)
4000 && !same_type_p (TREE_TYPE (x
), TREE_TYPE (decl
)))
4002 cp_pedwarn ("type mismatch with previous external decl", x
);
4003 cp_pedwarn_at ("previous external decl of `%#D'", decl
);
4007 /* This name is new in its binding level.
4008 Install the new declaration and return it. */
4009 if (namespace_bindings_p ())
4011 /* Install a global value. */
4013 /* If the first global decl has external linkage,
4014 warn if we later see static one. */
4015 if (IDENTIFIER_GLOBAL_VALUE (name
) == NULL_TREE
&& TREE_PUBLIC (x
))
4016 TREE_PUBLIC (name
) = 1;
4018 /* Bind the mangled name for the entity. In the future, we
4019 should not need to do this; mangled names are an
4020 implementation detail of which the front-end should not
4021 need to be aware. */
4022 if (!(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)
4024 /* For an ordinary function, we create a binding from
4025 the mangled name (i.e., NAME) to the DECL. But, for
4026 an `extern "C"' function, the mangled name and the
4027 ordinary name are the same so we need not do this. */
4028 && !DECL_EXTERN_C_FUNCTION_P (x
))
4032 if (TREE_CODE (x
) == TYPE_DECL
|| TREE_CODE (x
) == VAR_DECL
4033 || TREE_CODE (x
) == NAMESPACE_DECL
)
4034 mangled_name
= name
;
4036 mangled_name
= DECL_ASSEMBLER_NAME (x
);
4038 if (TREE_CODE (x
) == FUNCTION_DECL
)
4040 ((IDENTIFIER_GLOBAL_VALUE (mangled_name
) == NULL_TREE
)
4041 || (IDENTIFIER_GLOBAL_VALUE (mangled_name
) == x
), 378);
4042 SET_IDENTIFIER_NAMESPACE_VALUE (mangled_name
, x
);
4045 /* Don't forget if the function was used via an implicit decl. */
4046 if (IDENTIFIER_IMPLICIT_DECL (name
)
4047 && TREE_USED (IDENTIFIER_IMPLICIT_DECL (name
)))
4050 /* Don't forget if its address was taken in that way. */
4051 if (IDENTIFIER_IMPLICIT_DECL (name
)
4052 && TREE_ADDRESSABLE (IDENTIFIER_IMPLICIT_DECL (name
)))
4053 TREE_ADDRESSABLE (x
) = 1;
4055 /* Warn about mismatches against previous implicit decl. */
4056 if (IDENTIFIER_IMPLICIT_DECL (name
) != NULL_TREE
4057 /* If this real decl matches the implicit, don't complain. */
4058 && ! (TREE_CODE (x
) == FUNCTION_DECL
4059 && TREE_TYPE (TREE_TYPE (x
)) == integer_type_node
))
4061 ("`%D' was previously implicitly declared to return `int'", x
);
4063 /* If new decl is `static' and an `extern' was seen previously,
4065 if (x
!= NULL_TREE
&& t
!= NULL_TREE
&& decls_match (x
, t
))
4066 warn_extern_redeclared_static (x
, t
);
4070 /* Here to install a non-global value. */
4071 tree oldlocal
= IDENTIFIER_VALUE (name
);
4072 tree oldglobal
= IDENTIFIER_NAMESPACE_VALUE (name
);
4074 if (need_new_binding
)
4076 push_local_binding (name
, x
, 0);
4077 /* Because push_local_binding will hook X on to the
4078 current_binding_level's name list, we don't want to
4079 do that again below. */
4080 need_new_binding
= 0;
4083 /* If this is a TYPE_DECL, push it into the type value slot. */
4084 if (TREE_CODE (x
) == TYPE_DECL
)
4085 set_identifier_type_value_with_scope (name
, TREE_TYPE (x
),
4086 current_binding_level
);
4088 /* Clear out any TYPE_DECL shadowed by a namespace so that
4089 we won't think this is a type. The C struct hack doesn't
4090 go through namespaces. */
4091 if (TREE_CODE (x
) == NAMESPACE_DECL
)
4092 set_identifier_type_value_with_scope (name
, NULL_TREE
,
4093 current_binding_level
);
4100 && TREE_CODE (oldlocal
) == VAR_DECL
4101 && DECL_DEAD_FOR_LOCAL (oldlocal
))
4102 oldlocal
= DECL_SHADOWED_FOR_VAR (oldlocal
);
4104 if (oldlocal
== NULL_TREE
)
4105 oldlocal
= IDENTIFIER_NAMESPACE_VALUE (DECL_NAME (d
));
4108 /* If this is an extern function declaration, see if we
4109 have a global definition or declaration for the function. */
4110 if (oldlocal
== NULL_TREE
4111 && DECL_EXTERNAL (x
)
4112 && oldglobal
!= NULL_TREE
4113 && TREE_CODE (x
) == FUNCTION_DECL
4114 && TREE_CODE (oldglobal
) == FUNCTION_DECL
)
4116 /* We have one. Their types must agree. */
4117 if (decls_match (x
, oldglobal
))
4121 cp_warning ("extern declaration of `%#D' doesn't match", x
);
4122 cp_warning_at ("global declaration `%#D'", oldglobal
);
4125 /* If we have a local external declaration,
4126 and no file-scope declaration has yet been seen,
4127 then if we later have a file-scope decl it must not be static. */
4128 if (oldlocal
== NULL_TREE
4129 && oldglobal
== NULL_TREE
4130 && DECL_EXTERNAL (x
)
4132 TREE_PUBLIC (name
) = 1;
4134 /* Warn if shadowing an argument at the top level of the body. */
4135 if (oldlocal
!= NULL_TREE
&& !DECL_EXTERNAL (x
)
4136 /* Inline decls shadow nothing. */
4137 && !DECL_FROM_INLINE (x
)
4138 && TREE_CODE (oldlocal
) == PARM_DECL
4139 /* Don't complain if it's from an enclosing function. */
4140 && DECL_CONTEXT (oldlocal
) == current_function_decl
4141 && TREE_CODE (x
) != PARM_DECL
)
4143 /* Go to where the parms should be and see if we
4145 struct binding_level
*b
= current_binding_level
->level_chain
;
4151 if (b
->parm_flag
== 1)
4152 cp_error ("declaration of `%#D' shadows a parameter", name
);
4155 /* Maybe warn if shadowing something else. */
4156 if (warn_shadow
&& !DECL_EXTERNAL (x
)
4157 /* Inline decls shadow nothing. */
4158 && !DECL_FROM_INLINE (x
)
4159 /* No shadow warnings for internally generated vars. */
4160 && ! DECL_ARTIFICIAL (x
)
4161 /* No shadow warnings for vars made for inlining. */
4162 && ! DECL_FROM_INLINE (x
))
4164 if (oldlocal
!= NULL_TREE
&& TREE_CODE (oldlocal
) == PARM_DECL
)
4165 warning ("declaration of `%s' shadows a parameter",
4166 IDENTIFIER_POINTER (name
));
4167 else if (IDENTIFIER_CLASS_VALUE (name
) != NULL_TREE
4168 && current_class_ptr
4169 && !TREE_STATIC (name
))
4170 warning ("declaration of `%s' shadows a member of `this'",
4171 IDENTIFIER_POINTER (name
));
4172 else if (oldlocal
!= NULL_TREE
)
4173 warning ("declaration of `%s' shadows previous local",
4174 IDENTIFIER_POINTER (name
));
4175 else if (oldglobal
!= NULL_TREE
)
4176 /* XXX shadow warnings in outer-more namespaces */
4177 warning ("declaration of `%s' shadows global declaration",
4178 IDENTIFIER_POINTER (name
));
4182 if (TREE_CODE (x
) == FUNCTION_DECL
)
4183 check_default_args (x
);
4185 /* Keep count of variables in this level with incomplete type. */
4186 if (TREE_CODE (x
) == VAR_DECL
4187 && TREE_TYPE (x
) != error_mark_node
4188 && ((!COMPLETE_TYPE_P (TREE_TYPE (x
))
4189 && PROMOTES_TO_AGGR_TYPE (TREE_TYPE (x
), ARRAY_TYPE
))
4190 /* RTTI TD entries are created while defining the type_info. */
4191 || (TYPE_LANG_SPECIFIC (TREE_TYPE (x
))
4192 && TYPE_BEING_DEFINED (TREE_TYPE (x
)))))
4194 if (namespace_bindings_p ())
4195 namespace_scope_incomplete
4196 = tree_cons (NULL_TREE
, x
, namespace_scope_incomplete
);
4198 current_binding_level
->incomplete
4199 = tree_cons (NULL_TREE
, x
, current_binding_level
->incomplete
);
4203 if (need_new_binding
)
4204 add_decl_to_level (x
,
4205 DECL_NAMESPACE_SCOPE_P (x
)
4206 ? NAMESPACE_LEVEL (CP_DECL_CONTEXT (x
))
4207 : current_binding_level
);
4212 /* Same as pushdecl, but define X in binding-level LEVEL. We rely on the
4213 caller to set DECL_CONTEXT properly. */
4216 pushdecl_with_scope (x
, level
)
4218 struct binding_level
*level
;
4220 register struct binding_level
*b
;
4221 tree function_decl
= current_function_decl
;
4223 current_function_decl
= NULL_TREE
;
4224 if (level
->parm_flag
== 2)
4226 b
= class_binding_level
;
4227 class_binding_level
= level
;
4228 pushdecl_class_level (x
);
4229 class_binding_level
= b
;
4233 b
= current_binding_level
;
4234 current_binding_level
= level
;
4236 current_binding_level
= b
;
4238 current_function_decl
= function_decl
;
4242 /* Like pushdecl, only it places X in the current namespace,
4246 pushdecl_namespace_level (x
)
4249 register struct binding_level
*b
= current_binding_level
;
4252 t
= pushdecl_with_scope (x
, NAMESPACE_LEVEL (current_namespace
));
4254 /* Now, the type_shadowed stack may screw us. Munge it so it does
4256 if (TREE_CODE (x
) == TYPE_DECL
)
4258 tree name
= DECL_NAME (x
);
4260 tree
*ptr
= (tree
*)0;
4261 for (; b
!= global_binding_level
; b
= b
->level_chain
)
4263 tree shadowed
= b
->type_shadowed
;
4264 for (; shadowed
; shadowed
= TREE_CHAIN (shadowed
))
4265 if (TREE_PURPOSE (shadowed
) == name
)
4267 ptr
= &TREE_VALUE (shadowed
);
4268 /* Can't break out of the loop here because sometimes
4269 a binding level will have duplicate bindings for
4270 PT names. It's gross, but I haven't time to fix it. */
4273 newval
= TREE_TYPE (x
);
4274 if (ptr
== (tree
*)0)
4276 /* @@ This shouldn't be needed. My test case "zstring.cc" trips
4277 up here if this is changed to an assertion. --KR */
4278 SET_IDENTIFIER_TYPE_VALUE (name
, newval
);
4288 /* Like pushdecl, only it places X in GLOBAL_BINDING_LEVEL,
4292 pushdecl_top_level (x
)
4295 push_to_top_level ();
4296 x
= pushdecl_namespace_level (x
);
4297 pop_from_top_level ();
4301 /* Make the declaration of X appear in CLASS scope. */
4304 pushdecl_class_level (x
)
4307 /* Don't use DECL_ASSEMBLER_NAME here! Everything that looks in class
4308 scope looks for the pre-mangled name. */
4311 if (TREE_CODE (x
) == OVERLOAD
)
4312 x
= OVL_CURRENT (x
);
4313 name
= DECL_NAME (x
);
4317 push_class_level_binding (name
, x
);
4318 if (TREE_CODE (x
) == TYPE_DECL
)
4319 set_identifier_type_value (name
, TREE_TYPE (x
));
4321 else if (ANON_AGGR_TYPE_P (TREE_TYPE (x
)))
4325 for (f
= TYPE_FIELDS (TREE_TYPE (x
));
4328 pushdecl_class_level (f
);
4332 /* Enter DECL into the symbol table, if that's appropriate. Returns
4333 DECL, or a modified version thereof. */
4336 maybe_push_decl (decl
)
4339 tree type
= TREE_TYPE (decl
);
4341 /* Add this decl to the current binding level, but not if it comes
4342 from another scope, e.g. a static member variable. TEM may equal
4343 DECL or it may be a previous decl of the same name. */
4344 if (decl
== error_mark_node
4345 || (TREE_CODE (decl
) != PARM_DECL
4346 && DECL_CONTEXT (decl
) != NULL_TREE
4347 /* Definitions of namespace members outside their namespace are
4349 && TREE_CODE (DECL_CONTEXT (decl
)) != NAMESPACE_DECL
)
4350 || (TREE_CODE (decl
) == TEMPLATE_DECL
&& !namespace_bindings_p ())
4351 || TREE_CODE (type
) == UNKNOWN_TYPE
4352 /* The declaration of a template specialization does not affect
4353 the functions available for overload resolution, so we do not
4355 || (TREE_CODE (decl
) == FUNCTION_DECL
4356 && DECL_TEMPLATE_SPECIALIZATION (decl
)))
4359 return pushdecl (decl
);
4362 /* Make the declaration(s) of X appear in CLASS scope
4363 under the name NAME. */
4366 push_class_level_binding (name
, x
)
4371 /* The class_binding_level will be NULL if x is a template
4372 parameter name in a member template. */
4373 if (!class_binding_level
)
4376 /* Make sure that this new member does not have the same name
4377 as a template parameter. */
4378 if (TYPE_BEING_DEFINED (current_class_type
))
4379 check_template_shadow (x
);
4381 /* If this declaration shadows a declaration from an enclosing
4382 class, then we will need to restore IDENTIFIER_CLASS_VALUE when
4383 we leave this class. Record the shadowed declaration here. */
4384 binding
= IDENTIFIER_BINDING (name
);
4386 && ((TREE_CODE (x
) == OVERLOAD
4387 && BINDING_VALUE (binding
)
4388 && is_overloaded_fn (BINDING_VALUE (binding
)))
4389 || INHERITED_VALUE_BINDING_P (binding
)))
4394 /* If the old binding was from a base class, and was for a tag
4395 name, slide it over to make room for the new binding. The
4396 old binding is still visible if explicitly qualified with a
4398 if (INHERITED_VALUE_BINDING_P (binding
)
4399 && BINDING_VALUE (binding
)
4400 && TREE_CODE (BINDING_VALUE (binding
)) == TYPE_DECL
4401 && DECL_ARTIFICIAL (BINDING_VALUE (binding
))
4402 && !(TREE_CODE (x
) == TYPE_DECL
&& DECL_ARTIFICIAL (x
)))
4404 old_decl
= BINDING_TYPE (binding
);
4405 BINDING_TYPE (binding
) = BINDING_VALUE (binding
);
4406 BINDING_VALUE (binding
) = NULL_TREE
;
4407 INHERITED_VALUE_BINDING_P (binding
) = 0;
4410 old_decl
= BINDING_VALUE (binding
);
4412 /* Find the previous binding of name on the class-shadowed
4413 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
;
4423 IDENTIFIER_CLASS_VALUE (name
) = x
;
4428 /* If we didn't replace an existing binding, put the binding on the
4429 stack of bindings for the identifier, and update the shadowed list. */
4430 if (push_class_binding (name
, x
))
4432 class_binding_level
->class_shadowed
4433 = tree_cons (name
, NULL
,
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,
5445 else if (DECL_FUNCTION_TEMPLATE_P (val
)
5446 || TREE_CODE (val
) == OVERLOAD
)
5447 val
= lookup_template_function (val
,
5448 TREE_OPERAND (template_id
, 1));
5451 cp_error ("`%D::%D' is not a template",
5453 return error_mark_node
;
5457 /* If we have a single function from a using decl, pull it out. */
5458 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
5459 val
= OVL_FUNCTION (val
);
5463 cp_error ("`%D' undeclared in namespace `%D'", name
, namespace);
5464 return error_mark_node
;
5467 /* Hash a TYPENAME_TYPE. K is really of type `tree'. */
5469 static unsigned long
5477 hash
= (((unsigned long) TYPE_CONTEXT (t
))
5478 ^ ((unsigned long) DECL_NAME (TYPE_NAME (t
))));
5483 /* Compare two TYPENAME_TYPEs. K1 and K2 are really of type `tree'. */
5486 typename_compare (k1
, k2
)
5497 d1
= TYPE_NAME (t1
);
5498 d2
= TYPE_NAME (t2
);
5500 return (DECL_NAME (d1
) == DECL_NAME (d2
)
5501 && same_type_p (TYPE_CONTEXT (t1
), TYPE_CONTEXT (t2
))
5502 && ((TREE_TYPE (t1
) != NULL_TREE
)
5503 == (TREE_TYPE (t2
) != NULL_TREE
))
5504 && same_type_p (TREE_TYPE (t1
), TREE_TYPE (t2
))
5505 && TYPENAME_TYPE_FULLNAME (t1
) == TYPENAME_TYPE_FULLNAME (t2
));
5508 /* Build a TYPENAME_TYPE. If the type is `typename T::t', CONTEXT is
5509 the type of `T', NAME is the IDENTIFIER_NODE for `t'. If BASE_TYPE
5510 is non-NULL, this type is being created by the implicit typename
5511 extension, and BASE_TYPE is a type named `t' in some base class of
5512 `T' which depends on template parameters.
5514 Returns the new TYPENAME_TYPE. */
5517 build_typename_type (context
, name
, fullname
, base_type
)
5525 struct hash_entry
*e
;
5527 static struct hash_table ht
;
5531 static struct hash_table
*h
= &ht
;
5533 hash_table_init (&ht
, &hash_newfunc
, &typename_hash
, &typename_compare
);
5534 ggc_add_tree_hash_table_root (&h
, 1);
5537 /* Build the TYPENAME_TYPE. */
5538 t
= make_aggr_type (TYPENAME_TYPE
);
5539 TYPE_CONTEXT (t
) = FROB_CONTEXT (context
);
5540 TYPENAME_TYPE_FULLNAME (t
) = fullname
;
5541 TREE_TYPE (t
) = base_type
;
5543 /* Build the corresponding TYPE_DECL. */
5544 d
= build_decl (TYPE_DECL
, name
, t
);
5545 TYPE_NAME (TREE_TYPE (d
)) = d
;
5546 TYPE_STUB_DECL (TREE_TYPE (d
)) = d
;
5547 DECL_CONTEXT (d
) = FROB_CONTEXT (context
);
5548 DECL_ARTIFICIAL (d
) = 1;
5550 /* See if we already have this type. */
5551 e
= hash_lookup (&ht
, t
, /*create=*/false, /*copy=*/0);
5555 /* Insert the type into the table. */
5556 hash_lookup (&ht
, t
, /*create=*/true, /*copy=*/0);
5561 /* Resolve `typename CONTEXT::NAME'. Returns an appropriate type,
5562 unless an error occurs, in which case error_mark_node is returned.
5563 If COMPLAIN zero, don't complain about any errors that occur. */
5566 make_typename_type (context
, name
, complain
)
5574 if (!(TYPE_LANG_SPECIFIC (name
)
5575 && (CLASSTYPE_IS_TEMPLATE (name
)
5576 || CLASSTYPE_USE_TEMPLATE (name
))))
5577 name
= TYPE_IDENTIFIER (name
);
5579 /* Create a TEMPLATE_ID_EXPR for the type. */
5580 name
= build_nt (TEMPLATE_ID_EXPR
,
5581 CLASSTYPE_TI_TEMPLATE (name
),
5582 CLASSTYPE_TI_ARGS (name
));
5584 else if (TREE_CODE (name
) == TYPE_DECL
)
5585 name
= DECL_NAME (name
);
5589 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5591 name
= TREE_OPERAND (name
, 0);
5592 if (TREE_CODE (name
) == TEMPLATE_DECL
)
5593 name
= TREE_OPERAND (fullname
, 0) = DECL_NAME (name
);
5595 if (TREE_CODE (name
) != IDENTIFIER_NODE
)
5596 my_friendly_abort (2000);
5598 if (TREE_CODE (context
) == NAMESPACE_DECL
)
5600 /* We can get here from typename_sub0 in the explicit_template_type
5601 expansion. Just fail. */
5603 cp_error ("no class template named `%#T' in `%#T'",
5605 return error_mark_node
;
5608 if (! uses_template_parms (context
)
5609 || currently_open_class (context
))
5611 if (TREE_CODE (fullname
) == TEMPLATE_ID_EXPR
)
5613 tree tmpl
= NULL_TREE
;
5614 if (IS_AGGR_TYPE (context
))
5615 tmpl
= lookup_field (context
, name
, 0, 0);
5616 if (!tmpl
|| !DECL_CLASS_TEMPLATE_P (tmpl
))
5619 cp_error ("no class template named `%#T' in `%#T'",
5621 return error_mark_node
;
5624 return lookup_template_class (tmpl
,
5625 TREE_OPERAND (fullname
, 1),
5627 /*entering_scope=*/0,
5634 if (!IS_AGGR_TYPE (context
))
5637 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5638 return error_mark_node
;
5641 t
= lookup_field (context
, name
, 0, 1);
5643 return TREE_TYPE (t
);
5647 /* If the CONTEXT is not a template type, then either the field is
5648 there now or its never going to be. */
5649 if (!uses_template_parms (context
))
5652 cp_error ("no type named `%#T' in `%#T'", name
, context
);
5653 return error_mark_node
;
5657 return build_typename_type (context
, name
, fullname
, NULL_TREE
);
5660 /* Select the right _DECL from multiple choices. */
5663 select_decl (binding
, flags
)
5668 val
= BINDING_VALUE (binding
);
5670 /* When we implicitly declare some builtin entity, we mark it
5671 DECL_ANTICIPATED, so that we know to ignore it until it is
5673 if (val
&& DECL_P (val
)
5674 && DECL_LANG_SPECIFIC (val
)
5675 && DECL_ANTICIPATED (val
))
5678 if (LOOKUP_NAMESPACES_ONLY (flags
))
5680 /* We are not interested in types. */
5681 if (val
&& TREE_CODE (val
) == NAMESPACE_DECL
)
5686 /* If we could have a type and
5687 we have nothing or we need a type and have none. */
5688 if (BINDING_TYPE (binding
)
5689 && (!val
|| ((flags
& LOOKUP_PREFER_TYPES
)
5690 && TREE_CODE (val
) != TYPE_DECL
)))
5691 val
= TYPE_STUB_DECL (BINDING_TYPE (binding
));
5692 /* Don't return non-types if we really prefer types. */
5693 else if (val
&& LOOKUP_TYPES_ONLY (flags
) && TREE_CODE (val
) != TYPE_DECL
5694 && (TREE_CODE (val
) != TEMPLATE_DECL
5695 || !DECL_CLASS_TEMPLATE_P (val
)))
5701 /* Unscoped lookup of a global: iterate over current namespaces,
5702 considering using-directives. If SPACESP is non-NULL, store a list
5703 of the namespaces we've considered in it. */
5706 unqualified_namespace_lookup (name
, flags
, spacesp
)
5711 tree b
= make_node (CPLUS_BINDING
);
5712 tree initial
= current_decl_namespace();
5713 tree scope
= initial
;
5715 struct binding_level
*level
;
5716 tree val
= NULL_TREE
;
5719 *spacesp
= NULL_TREE
;
5721 for (; !val
; scope
= CP_DECL_CONTEXT (scope
))
5724 *spacesp
= tree_cons (scope
, NULL_TREE
, *spacesp
);
5725 val
= binding_for_name (name
, scope
);
5727 /* Initialize binding for this context. */
5728 BINDING_VALUE (b
) = BINDING_VALUE (val
);
5729 BINDING_TYPE (b
) = BINDING_TYPE (val
);
5731 /* Add all _DECLs seen through local using-directives. */
5732 for (level
= current_binding_level
;
5733 !level
->namespace_p
;
5734 level
= level
->level_chain
)
5735 if (!lookup_using_namespace (name
, b
, level
->using_directives
,
5736 scope
, flags
, spacesp
))
5737 /* Give up because of error. */
5738 return error_mark_node
;
5740 /* Add all _DECLs seen through global using-directives. */
5741 /* XXX local and global using lists should work equally. */
5745 if (!lookup_using_namespace (name
, b
, DECL_NAMESPACE_USING (siter
),
5746 scope
, flags
, spacesp
))
5747 /* Give up because of error. */
5748 return error_mark_node
;
5749 if (siter
== scope
) break;
5750 siter
= CP_DECL_CONTEXT (siter
);
5753 val
= select_decl (b
, flags
);
5754 if (scope
== global_namespace
)
5760 /* Combine prefer_type and namespaces_only into flags. */
5763 lookup_flags (prefer_type
, namespaces_only
)
5764 int prefer_type
, namespaces_only
;
5766 if (namespaces_only
)
5767 return LOOKUP_PREFER_NAMESPACES
;
5768 if (prefer_type
> 1)
5769 return LOOKUP_PREFER_TYPES
;
5770 if (prefer_type
> 0)
5771 return LOOKUP_PREFER_BOTH
;
5775 /* Given a lookup that returned VAL, use FLAGS to decide if we want to
5776 ignore it or not. Subroutine of lookup_name_real. */
5779 qualify_lookup (val
, flags
)
5783 if (val
== NULL_TREE
)
5785 if ((flags
& LOOKUP_PREFER_NAMESPACES
) && TREE_CODE (val
) == NAMESPACE_DECL
)
5787 if ((flags
& LOOKUP_PREFER_TYPES
)
5788 && (TREE_CODE (val
) == TYPE_DECL
5789 || ((flags
& LOOKUP_TEMPLATES_EXPECTED
)
5790 && DECL_CLASS_TEMPLATE_P (val
))))
5792 if (flags
& (LOOKUP_PREFER_NAMESPACES
| LOOKUP_PREFER_TYPES
))
5797 /* Any other BINDING overrides an implicit TYPENAME. Warn about
5801 warn_about_implicit_typename_lookup (typename
, binding
)
5805 tree subtype
= TREE_TYPE (TREE_TYPE (typename
));
5806 tree name
= DECL_NAME (typename
);
5808 if (! (TREE_CODE (binding
) == TEMPLATE_DECL
5809 && CLASSTYPE_TEMPLATE_INFO (subtype
)
5810 && CLASSTYPE_TI_TEMPLATE (subtype
) == binding
)
5811 && ! (TREE_CODE (binding
) == TYPE_DECL
5812 && same_type_p (TREE_TYPE (binding
), subtype
)))
5814 cp_warning ("lookup of `%D' finds `%#D'",
5816 cp_warning (" instead of `%D' from dependent base class",
5818 cp_warning (" (use `typename %T::%D' if that's what you meant)",
5819 constructor_name (current_class_type
), name
);
5823 /* Look up NAME in the current binding level and its superiors in the
5824 namespace of variables, functions and typedefs. Return a ..._DECL
5825 node of some kind representing its definition if there is only one
5826 such declaration, or return a TREE_LIST with all the overloaded
5827 definitions if there are many, or return 0 if it is undefined.
5829 If PREFER_TYPE is > 0, we prefer TYPE_DECLs or namespaces.
5830 If PREFER_TYPE is > 1, we reject non-type decls (e.g. namespaces).
5831 If PREFER_TYPE is -2, we're being called from yylex(). (UGLY)
5832 Otherwise we prefer non-TYPE_DECLs.
5834 If NONCLASS is non-zero, we don't look for the NAME in class scope,
5835 using IDENTIFIER_CLASS_VALUE. */
5838 lookup_name_real (name
, prefer_type
, nonclass
, namespaces_only
)
5840 int prefer_type
, nonclass
, namespaces_only
;
5843 tree val
= NULL_TREE
;
5845 tree from_obj
= NULL_TREE
;
5847 int val_is_implicit_typename
= 0;
5849 /* Hack: copy flag set by parser, if set. */
5850 if (only_namespace_names
)
5851 namespaces_only
= 1;
5853 if (prefer_type
== -2)
5855 extern int looking_for_typename
;
5856 tree type
= NULL_TREE
;
5859 prefer_type
= looking_for_typename
;
5861 flags
= lookup_flags (prefer_type
, namespaces_only
);
5862 /* If the next thing is '<', class templates are types. */
5863 if (looking_for_template
)
5864 flags
|= LOOKUP_TEMPLATES_EXPECTED
;
5866 /* std:: becomes :: for now. */
5867 if (got_scope
&& got_scope
== fake_std_node
)
5868 got_scope
= void_type_node
;
5872 else if (got_object
!= error_mark_node
)
5877 if (type
== error_mark_node
)
5878 return error_mark_node
;
5879 if (TREE_CODE (type
) == TYPENAME_TYPE
&& TREE_TYPE (type
))
5880 type
= TREE_TYPE (type
);
5883 type
= complete_type (type
);
5885 if (TREE_CODE (type
) == VOID_TYPE
)
5886 type
= global_namespace
;
5887 if (TREE_CODE (type
) == NAMESPACE_DECL
)
5889 val
= make_node (CPLUS_BINDING
);
5890 flags
|= LOOKUP_COMPLAIN
;
5891 if (!qualified_lookup_using_namespace (name
, type
, val
, flags
))
5893 val
= select_decl (val
, flags
);
5895 else if (! IS_AGGR_TYPE (type
)
5896 || TREE_CODE (type
) == TEMPLATE_TYPE_PARM
5897 || TREE_CODE (type
) == BOUND_TEMPLATE_TEMPLATE_PARM
5898 || TREE_CODE (type
) == TYPENAME_TYPE
)
5899 /* Someone else will give an error about this if needed. */
5901 else if (type
== current_class_type
)
5902 val
= IDENTIFIER_CLASS_VALUE (name
);
5905 val
= lookup_member (type
, name
, 0, prefer_type
);
5906 type_access_control (type
, val
);
5908 /* Restore the containing TYPENAME_TYPE if we looked
5909 through it before. */
5910 if (got_scope
&& got_scope
!= type
5911 && val
&& TREE_CODE (val
) == TYPE_DECL
5912 && TREE_CODE (TREE_TYPE (val
)) == TYPENAME_TYPE
)
5913 TYPE_CONTEXT (TREE_TYPE (val
)) = got_scope
;
5921 else if (got_object
&& val
)
5929 flags
= lookup_flags (prefer_type
, namespaces_only
);
5930 /* If we're not parsing, we need to complain. */
5931 flags
|= LOOKUP_COMPLAIN
;
5934 /* First, look in non-namespace scopes. */
5936 if (current_class_type
== NULL_TREE
)
5939 for (t
= IDENTIFIER_BINDING (name
); t
; t
= TREE_CHAIN (t
))
5943 if (!LOCAL_BINDING_P (t
) && nonclass
)
5944 /* We're not looking for class-scoped bindings, so keep going. */
5947 /* If this is the kind of thing we're looking for, we're done. */
5948 if (qualify_lookup (BINDING_VALUE (t
), flags
))
5949 binding
= BINDING_VALUE (t
);
5950 else if ((flags
& LOOKUP_PREFER_TYPES
)
5951 && qualify_lookup (BINDING_TYPE (t
), flags
))
5952 binding
= BINDING_TYPE (t
);
5954 binding
= NULL_TREE
;
5956 /* Handle access control on types from enclosing or base classes. */
5957 if (binding
&& ! yylex
5958 && BINDING_LEVEL (t
) && BINDING_LEVEL (t
)->parm_flag
== 2)
5959 type_access_control (BINDING_LEVEL (t
)->this_class
, binding
);
5962 && (!val
|| !IMPLICIT_TYPENAME_TYPE_DECL_P (binding
)))
5964 if (val_is_implicit_typename
&& !yylex
)
5965 warn_about_implicit_typename_lookup (val
, binding
);
5967 val_is_implicit_typename
5968 = IMPLICIT_TYPENAME_TYPE_DECL_P (val
);
5969 if (!val_is_implicit_typename
)
5974 /* Now lookup in namespace scopes. */
5975 if (!val
|| val_is_implicit_typename
)
5977 t
= unqualified_namespace_lookup (name
, flags
, 0);
5980 if (val_is_implicit_typename
&& !yylex
)
5981 warn_about_implicit_typename_lookup (val
, t
);
5989 /* This should only warn about types used in qualified-ids. */
5990 if (from_obj
&& from_obj
!= val
)
5992 if (looking_for_typename
&& TREE_CODE (from_obj
) == TYPE_DECL
5993 && TREE_CODE (val
) == TYPE_DECL
5994 && ! same_type_p (TREE_TYPE (from_obj
), TREE_TYPE (val
)))
5996 lookup of `%D' in the scope of `%#T' (`%#T') \
5997 does not match lookup in the current scope (`%#T')",
5998 name
, got_object
, TREE_TYPE (from_obj
),
6001 /* We don't change val to from_obj if got_object depends on
6002 template parms because that breaks implicit typename for
6003 destructor calls. */
6004 if (! uses_template_parms (got_object
))
6008 /* If we have a single function from a using decl, pull it out. */
6009 if (TREE_CODE (val
) == OVERLOAD
&& ! really_overloaded_fn (val
))
6010 val
= OVL_FUNCTION (val
);
6019 lookup_name_nonclass (name
)
6022 return lookup_name_real (name
, 0, 1, 0);
6026 lookup_function_nonclass (name
, args
)
6030 return lookup_arg_dependent (name
, lookup_name_nonclass (name
), args
);
6034 lookup_name_namespace_only (name
)
6037 /* type-or-namespace, nonclass, namespace_only */
6038 return lookup_name_real (name
, 1, 1, 1);
6042 lookup_name (name
, prefer_type
)
6046 return lookup_name_real (name
, prefer_type
, 0, 0);
6049 /* Similar to `lookup_name' but look only in the innermost non-class
6053 lookup_name_current_level (name
)
6056 struct binding_level
*b
;
6059 b
= current_binding_level
;
6060 while (b
->parm_flag
== 2)
6065 t
= IDENTIFIER_NAMESPACE_VALUE (name
);
6067 /* extern "C" function() */
6068 if (t
!= NULL_TREE
&& TREE_CODE (t
) == TREE_LIST
)
6071 else if (IDENTIFIER_BINDING (name
)
6072 && LOCAL_BINDING_P (IDENTIFIER_BINDING (name
)))
6076 if (BINDING_LEVEL (IDENTIFIER_BINDING (name
)) == b
)
6077 return IDENTIFIER_VALUE (name
);
6089 /* Like lookup_name_current_level, but for types. */
6092 lookup_type_current_level (name
)
6095 register tree t
= NULL_TREE
;
6097 my_friendly_assert (! current_binding_level
->namespace_p
, 980716);
6099 if (REAL_IDENTIFIER_TYPE_VALUE (name
) != NULL_TREE
6100 && REAL_IDENTIFIER_TYPE_VALUE (name
) != global_type_node
)
6102 struct binding_level
*b
= current_binding_level
;
6105 if (purpose_member (name
, b
->type_shadowed
))
6106 return REAL_IDENTIFIER_TYPE_VALUE (name
);
6118 begin_only_namespace_names ()
6120 only_namespace_names
= 1;
6124 end_only_namespace_names ()
6126 only_namespace_names
= 0;
6129 /* Push the declarations of builtin types into the namespace.
6130 RID_INDEX is the index of the builtin type
6131 in the array RID_POINTERS. NAME is the name used when looking
6132 up the builtin type. TYPE is the _TYPE node for the builtin type. */
6135 record_builtin_type (rid_index
, name
, type
)
6140 tree rname
= NULL_TREE
, tname
= NULL_TREE
;
6141 tree tdecl
= NULL_TREE
;
6143 if ((int) rid_index
< (int) RID_MAX
)
6144 rname
= ridpointers
[(int) rid_index
];
6146 tname
= get_identifier (name
);
6148 TYPE_BUILT_IN (type
) = 1;
6152 tdecl
= pushdecl (build_decl (TYPE_DECL
, tname
, type
));
6153 set_identifier_type_value (tname
, NULL_TREE
);
6154 if ((int) rid_index
< (int) RID_MAX
)
6155 /* Built-in types live in the global namespace. */
6156 SET_IDENTIFIER_GLOBAL_VALUE (tname
, tdecl
);
6158 if (rname
!= NULL_TREE
)
6160 if (tname
!= NULL_TREE
)
6162 set_identifier_type_value (rname
, NULL_TREE
);
6163 SET_IDENTIFIER_GLOBAL_VALUE (rname
, tdecl
);
6167 tdecl
= pushdecl (build_decl (TYPE_DECL
, rname
, type
));
6168 set_identifier_type_value (rname
, NULL_TREE
);
6173 /* Record one of the standard Java types.
6174 * Declare it as having the given NAME.
6175 * If SIZE > 0, it is the size of one of the integral types;
6176 * otherwise it is the negative of the size of one of the other types. */
6179 record_builtin_java_type (name
, size
)
6185 type
= make_signed_type (size
);
6186 else if (size
> -32)
6187 { /* "__java_char" or ""__java_boolean". */
6188 type
= make_unsigned_type (-size
);
6189 /*if (size == -1) TREE_SET_CODE (type, BOOLEAN_TYPE);*/
6192 { /* "__java_float" or ""__java_double". */
6193 type
= make_node (REAL_TYPE
);
6194 TYPE_PRECISION (type
) = - size
;
6197 record_builtin_type (RID_MAX
, name
, type
);
6198 decl
= TYPE_NAME (type
);
6200 /* Suppress generate debug symbol entries for these types,
6201 since for normal C++ they are just clutter.
6202 However, push_lang_context undoes this if extern "Java" is seen. */
6203 DECL_IGNORED_P (decl
) = 1;
6205 TYPE_FOR_JAVA (type
) = 1;
6209 /* Push a type into the namespace so that the back-ends ignore it. */
6212 record_unknown_type (type
, name
)
6216 tree decl
= pushdecl (build_decl (TYPE_DECL
, get_identifier (name
), type
));
6217 /* Make sure the "unknown type" typedecl gets ignored for debug info. */
6218 DECL_IGNORED_P (decl
) = 1;
6219 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
6220 TYPE_SIZE (type
) = TYPE_SIZE (void_type_node
);
6221 TYPE_ALIGN (type
) = 1;
6222 TYPE_USER_ALIGN (type
) = 0;
6223 TYPE_MODE (type
) = TYPE_MODE (void_type_node
);
6226 /* An string for which we should create an IDENTIFIER_NODE at
6229 typedef struct predefined_identifier
6231 /* The name of the identifier. */
6233 /* The place where the IDENTIFIER_NODE should be stored. */
6235 /* Non-zero if this is the name of a constructor or destructor. */
6237 } predefined_identifier
;
6239 /* Create all the predefined identifiers. */
6242 initialize_predefined_identifiers ()
6244 struct predefined_identifier
*pid
;
6246 /* A table of identifiers to create at startup. */
6247 static predefined_identifier predefined_identifiers
[] = {
6248 { "C++", &lang_name_cplusplus
, 0 },
6249 { "C", &lang_name_c
, 0 },
6250 { "Java", &lang_name_java
, 0 },
6251 { CTOR_NAME
, &ctor_identifier
, 1 },
6252 { "__base_ctor", &base_ctor_identifier
, 1 },
6253 { "__comp_ctor", &complete_ctor_identifier
, 1 },
6254 { DTOR_NAME
, &dtor_identifier
, 1 },
6255 { "__comp_dtor", &complete_dtor_identifier
, 1 },
6256 { "__base_dtor", &base_dtor_identifier
, 1 },
6257 { "__deleting_dtor", &deleting_dtor_identifier
, 1 },
6258 { VTABLE_DELTA2_NAME
, &delta2_identifier
, 0 },
6259 { VTABLE_DELTA_NAME
, &delta_identifier
, 0 },
6260 { IN_CHARGE_NAME
, &in_charge_identifier
, 0 },
6261 { VTABLE_INDEX_NAME
, &index_identifier
, 0 },
6262 { "nelts", &nelts_identifier
, 0 },
6263 { THIS_NAME
, &this_identifier
, 0 },
6264 { VTABLE_PFN_NAME
, &pfn_identifier
, 0 },
6265 { "__pfn_or_delta2", &pfn_or_delta2_identifier
, 0 },
6266 { "_vptr", &vptr_identifier
, 0 },
6267 { "__cp_push_exception", &cp_push_exception_identifier
, 0 },
6268 { "__vtt_parm", &vtt_parm_identifier
, 0 },
6269 { "std", &std_identifier
, 0 },
6273 for (pid
= predefined_identifiers
; pid
->name
; ++pid
)
6275 *pid
->node
= get_identifier (pid
->name
);
6276 if (pid
->ctor_or_dtor_p
)
6277 IDENTIFIER_CTOR_OR_DTOR_P (*pid
->node
) = 1;
6281 /* Create the predefined scalar types of C,
6282 and some nodes representing standard constants (0, 1, (void *)0).
6283 Initialize the global binding level.
6284 Make definitions for built-in primitive functions. */
6287 init_decl_processing ()
6291 /* Check to see that the user did not specify an invalid combination
6292 of command-line options. */
6293 if (flag_new_abi
&& !flag_vtable_thunks
)
6294 error ("the new ABI requires vtable thunks");
6296 /* Create all the identifiers we need. */
6297 initialize_predefined_identifiers ();
6299 /* Fill in back-end hooks. */
6300 init_lang_status
= &push_cp_function_context
;
6301 free_lang_status
= &pop_cp_function_context
;
6302 mark_lang_status
= &mark_cp_function_context
;
6303 lang_safe_from_p
= &c_safe_from_p
;
6304 lang_dump_tree
= &cp_dump_tree
;
6305 lang_missing_noreturn_ok_p
= &cp_missing_noreturn_ok_p
;
6311 /* Create the global variables. */
6312 push_to_top_level ();
6314 /* Enter the global namespace. */
6315 my_friendly_assert (global_namespace
== NULL_TREE
, 375);
6316 push_namespace (get_identifier ("::"));
6317 global_namespace
= current_namespace
;
6318 current_lang_name
= NULL_TREE
;
6320 /* Adjust various flags based on command-line settings. */
6321 if (! flag_permissive
&& ! pedantic
)
6322 flag_pedantic_errors
= 1;
6323 if (!flag_no_inline
)
6324 flag_inline_trees
= 1;
6327 current_lang_name
= lang_name_c
;
6329 current_function_decl
= NULL_TREE
;
6330 current_binding_level
= NULL_BINDING_LEVEL
;
6331 free_binding_level
= NULL_BINDING_LEVEL
;
6333 build_common_tree_nodes (flag_signed_char
);
6335 error_mark_list
= build_tree_list (error_mark_node
, error_mark_node
);
6336 TREE_TYPE (error_mark_list
) = error_mark_node
;
6338 /* Make the binding_level structure for global names. */
6340 global_binding_level
= current_binding_level
;
6341 /* The global level is the namespace level of ::. */
6342 NAMESPACE_LEVEL (global_namespace
) = global_binding_level
;
6343 declare_namespace_level ();
6345 /* Create the `std' namespace. */
6348 push_namespace (std_identifier
);
6349 std_node
= current_namespace
;
6351 fake_std_node
= error_mark_node
;
6355 fake_std_node
= build_decl (NAMESPACE_DECL
,
6358 pushdecl (fake_std_node
);
6361 c_common_nodes_and_builtins ();
6363 java_byte_type_node
= record_builtin_java_type ("__java_byte", 8);
6364 java_short_type_node
= record_builtin_java_type ("__java_short", 16);
6365 java_int_type_node
= record_builtin_java_type ("__java_int", 32);
6366 java_long_type_node
= record_builtin_java_type ("__java_long", 64);
6367 java_float_type_node
= record_builtin_java_type ("__java_float", -32);
6368 java_double_type_node
= record_builtin_java_type ("__java_double", -64);
6369 java_char_type_node
= record_builtin_java_type ("__java_char", -16);
6370 java_boolean_type_node
= record_builtin_java_type ("__java_boolean", -1);
6372 integer_two_node
= build_int_2 (2, 0);
6373 TREE_TYPE (integer_two_node
) = integer_type_node
;
6374 integer_three_node
= build_int_2 (3, 0);
6375 TREE_TYPE (integer_three_node
) = integer_type_node
;
6377 boolean_type_node
= make_unsigned_type (BOOL_TYPE_SIZE
);
6378 TREE_SET_CODE (boolean_type_node
, BOOLEAN_TYPE
);
6379 TYPE_MAX_VALUE (boolean_type_node
) = build_int_2 (1, 0);
6380 TREE_TYPE (TYPE_MAX_VALUE (boolean_type_node
)) = boolean_type_node
;
6381 TYPE_PRECISION (boolean_type_node
) = 1;
6382 record_builtin_type (RID_BOOL
, "bool", boolean_type_node
);
6383 boolean_false_node
= build_int_2 (0, 0);
6384 TREE_TYPE (boolean_false_node
) = boolean_type_node
;
6385 boolean_true_node
= build_int_2 (1, 0);
6386 TREE_TYPE (boolean_true_node
) = boolean_type_node
;
6388 signed_size_zero_node
= build_int_2 (0, 0);
6389 TREE_TYPE (signed_size_zero_node
) = make_signed_type (TYPE_PRECISION (sizetype
));
6391 empty_except_spec
= build_tree_list (NULL_TREE
, NULL_TREE
);
6394 record_builtin_type (RID_MAX
, NULL_PTR
, string_type_node
);
6398 delta_type_node
= ptrdiff_type_node
;
6399 else if (flag_huge_objects
)
6400 delta_type_node
= long_integer_type_node
;
6402 delta_type_node
= short_integer_type_node
;
6405 vtable_index_type
= ptrdiff_type_node
;
6407 vtable_index_type
= delta_type_node
;
6409 vtt_parm_type
= build_pointer_type (const_ptr_type_node
);
6410 lang_type_promotes_to
= convert_type_from_ellipsis
;
6413 = build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6415 /* C++ extensions */
6417 unknown_type_node
= make_node (UNKNOWN_TYPE
);
6418 record_unknown_type (unknown_type_node
, "unknown type");
6420 /* Indirecting an UNKNOWN_TYPE node yields an UNKNOWN_TYPE node. */
6421 TREE_TYPE (unknown_type_node
) = unknown_type_node
;
6423 TREE_TYPE (null_node
) = type_for_size (POINTER_SIZE
, 0);
6425 /* Looking up TYPE_POINTER_TO and TYPE_REFERENCE_TO yield the same
6427 TYPE_POINTER_TO (unknown_type_node
) = unknown_type_node
;
6428 TYPE_REFERENCE_TO (unknown_type_node
) = unknown_type_node
;
6430 if (flag_vtable_thunks
)
6432 /* Make sure we get a unique function type, so we can give
6433 its pointer type a name. (This wins for gdb.) */
6434 tree vfunc_type
= make_node (FUNCTION_TYPE
);
6435 TREE_TYPE (vfunc_type
) = integer_type_node
;
6436 TYPE_ARG_TYPES (vfunc_type
) = NULL_TREE
;
6437 layout_type (vfunc_type
);
6439 vtable_entry_type
= build_pointer_type (vfunc_type
);
6443 vtable_entry_type
= make_aggr_type (RECORD_TYPE
);
6444 fields
[0] = build_decl (FIELD_DECL
, delta_identifier
,
6446 fields
[1] = build_decl (FIELD_DECL
, index_identifier
,
6448 fields
[2] = build_decl (FIELD_DECL
, pfn_identifier
,
6450 finish_builtin_type (vtable_entry_type
, VTBL_PTR_TYPE
, fields
, 2,
6453 /* Make this part of an invisible union. */
6454 fields
[3] = copy_node (fields
[2]);
6455 TREE_TYPE (fields
[3]) = delta_type_node
;
6456 DECL_NAME (fields
[3]) = delta2_identifier
;
6457 DECL_MODE (fields
[3]) = TYPE_MODE (delta_type_node
);
6458 DECL_SIZE (fields
[3]) = TYPE_SIZE (delta_type_node
);
6459 DECL_SIZE_UNIT (fields
[3]) = TYPE_SIZE_UNIT (delta_type_node
);
6460 TREE_UNSIGNED (fields
[3]) = 0;
6461 TREE_CHAIN (fields
[2]) = fields
[3];
6462 vtable_entry_type
= build_qualified_type (vtable_entry_type
,
6465 record_builtin_type (RID_MAX
, VTBL_PTR_TYPE
, vtable_entry_type
);
6468 = build_cplus_array_type (vtable_entry_type
, NULL_TREE
);
6469 layout_type (vtbl_type_node
);
6470 vtbl_type_node
= build_qualified_type (vtbl_type_node
, TYPE_QUAL_CONST
);
6471 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_type_node
);
6472 vtbl_ptr_type_node
= build_pointer_type (vtable_entry_type
);
6473 layout_type (vtbl_ptr_type_node
);
6474 record_builtin_type (RID_MAX
, NULL_PTR
, vtbl_ptr_type_node
);
6478 push_namespace (get_identifier ("__cxxabiv1"));
6479 abi_node
= current_namespace
;
6483 global_type_node
= make_node (LANG_TYPE
);
6484 record_unknown_type (global_type_node
, "global type");
6487 current_lang_name
= lang_name_cplusplus
;
6490 tree bad_alloc_type_node
, newtype
, deltype
;
6492 push_namespace (std_identifier
);
6493 bad_alloc_type_node
= xref_tag
6494 (class_type_node
, get_identifier ("bad_alloc"), 1);
6497 newtype
= build_exception_variant
6498 (ptr_ftype_sizetype
, add_exception_specifier (NULL_TREE
, bad_alloc_type_node
, -1));
6499 deltype
= build_exception_variant (void_ftype_ptr
, empty_except_spec
);
6500 push_cp_library_fn (NEW_EXPR
, newtype
);
6501 push_cp_library_fn (VEC_NEW_EXPR
, newtype
);
6502 global_delete_fndecl
= push_cp_library_fn (DELETE_EXPR
, deltype
);
6503 push_cp_library_fn (VEC_DELETE_EXPR
, deltype
);
6507 = build_library_fn_ptr ((flag_new_abi
6508 ? "__cxa_pure_virtual"
6509 : "__pure_virtual"),
6512 /* Perform other language dependent initializations. */
6513 init_class_processing ();
6514 init_init_processing ();
6515 init_search_processing ();
6516 init_rtti_processing ();
6518 if (flag_exceptions
)
6519 init_exception_processing ();
6522 flag_inline_functions
= 0;
6525 if (! supports_one_only ())
6528 /* Create the global bindings for __FUNCTION__ and __PRETTY_FUNCTION__. */
6529 function_id_node
= get_identifier ("__FUNCTION__");
6530 pretty_function_id_node
= get_identifier ("__PRETTY_FUNCTION__");
6531 func_id_node
= get_identifier ("__func__");
6533 make_fname_decl
= cp_make_fname_decl
;
6534 declare_function_name ();
6536 /* Prepare to check format strings against argument lists. */
6537 init_function_format_info ();
6539 /* Show we use EH for cleanups. */
6540 using_eh_for_cleanups ();
6542 valid_lang_attribute
= cp_valid_lang_attribute
;
6544 /* Maintain consistency. Perhaps we should just complain if they
6545 say -fwritable-strings? */
6546 if (flag_writable_strings
)
6547 flag_const_strings
= 0;
6549 /* Add GC roots for all of our global variables. */
6550 ggc_add_tree_root (c_global_trees
, sizeof c_global_trees
/ sizeof(tree
));
6551 ggc_add_tree_root (cp_global_trees
, sizeof cp_global_trees
/ sizeof(tree
));
6552 ggc_add_tree_root (&integer_three_node
, 1);
6553 ggc_add_tree_root (&integer_two_node
, 1);
6554 ggc_add_tree_root (&signed_size_zero_node
, 1);
6555 ggc_add_tree_root (&size_one_node
, 1);
6556 ggc_add_tree_root (&size_zero_node
, 1);
6557 ggc_add_root (&global_binding_level
, 1, sizeof global_binding_level
,
6558 mark_binding_level
);
6559 ggc_add_root (&scope_chain
, 1, sizeof scope_chain
, &mark_saved_scope
);
6560 ggc_add_tree_root (&static_ctors
, 1);
6561 ggc_add_tree_root (&static_dtors
, 1);
6562 ggc_add_tree_root (&lastiddecl
, 1);
6564 ggc_add_tree_root (&last_function_parm_tags
, 1);
6565 ggc_add_tree_root (¤t_function_return_value
, 1);
6566 ggc_add_tree_root (¤t_function_parm_tags
, 1);
6567 ggc_add_tree_root (&last_function_parms
, 1);
6568 ggc_add_tree_root (&error_mark_list
, 1);
6570 ggc_add_tree_root (&global_namespace
, 1);
6571 ggc_add_tree_root (&global_type_node
, 1);
6572 ggc_add_tree_root (&anonymous_namespace_name
, 1);
6574 ggc_add_tree_root (&got_object
, 1);
6575 ggc_add_tree_root (&got_scope
, 1);
6577 ggc_add_tree_root (¤t_lang_name
, 1);
6578 ggc_add_tree_root (&static_aggregates
, 1);
6579 ggc_add_tree_root (&free_bindings
, 1);
6582 /* Create the VAR_DECL for __FUNCTION__ etc. ID is the name to give the
6583 decl, NAME is the initialization string and TYPE_DEP indicates whether
6584 NAME depended on the type of the function. We make use of that to detect
6585 __PRETTY_FUNCTION__ inside a template fn. Because we build a tree for
6586 the function before emitting any of it, we don't need to treat the
6587 VAR_DECL specially. We can decide whether to emit it later, if it was
6591 cp_make_fname_decl (id
, name
, type_dep
)
6596 tree decl
, type
, init
;
6597 size_t length
= strlen (name
);
6598 tree domain
= NULL_TREE
;
6600 if (!processing_template_decl
)
6603 domain
= build_index_type (size_int (length
));
6605 type
= build_cplus_array_type
6606 (build_qualified_type (char_type_node
, TYPE_QUAL_CONST
),
6609 decl
= build_decl (VAR_DECL
, id
, type
);
6610 TREE_STATIC (decl
) = 1;
6611 TREE_READONLY (decl
) = 1;
6612 DECL_SOURCE_LINE (decl
) = 0;
6613 DECL_ARTIFICIAL (decl
) = 1;
6614 DECL_IN_SYSTEM_HEADER (decl
) = 1;
6616 if (processing_template_decl
)
6617 decl
= push_template_decl (decl
);
6620 init
= build (FUNCTION_NAME
, type
);
6621 DECL_PRETTY_FUNCTION_P (decl
) = 1;
6625 init
= build_string (length
+ 1, name
);
6626 TREE_TYPE (init
) = type
;
6628 DECL_INITIAL (decl
) = init
;
6629 cp_finish_decl (decl
, init
, NULL_TREE
, LOOKUP_ONLYCONVERTING
);
6631 /* We will have to make sure we only emit this, if it is actually used. */
6635 /* Entry point for the benefit of c_common_nodes_and_builtins.
6637 Make a definition for a builtin function named NAME and whose data type
6638 is TYPE. TYPE should be a function type with argument types.
6640 CLASS and CODE tell later passes how to compile calls to this function.
6641 See tree.h for possible values.
6643 If LIBNAME is nonzero, use that for DECL_ASSEMBLER_NAME,
6644 the name to be called if we can't opencode the function. */
6647 builtin_function (name
, type
, code
, class, libname
)
6651 enum built_in_class
class;
6652 const char *libname
;
6654 tree decl
= build_library_fn_1 (get_identifier (name
), ERROR_MARK
, type
);
6655 DECL_BUILT_IN_CLASS (decl
) = class;
6656 DECL_FUNCTION_CODE (decl
) = code
;
6658 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 392);
6660 /* All builtins that don't begin with an `_' should go in the `std'
6662 if (flag_honor_std
&& name
[0] != '_')
6664 push_namespace (std_identifier
);
6665 DECL_CONTEXT (decl
) = std_node
;
6668 if (flag_honor_std
&& name
[0] != '_')
6671 /* Since `pushdecl' relies on DECL_ASSEMBLER_NAME instead of DECL_NAME,
6672 we cannot change DECL_ASSEMBLER_NAME until we have installed this
6673 function in the namespace. */
6675 DECL_ASSEMBLER_NAME (decl
) = get_identifier (libname
);
6676 make_decl_rtl (decl
, NULL
);
6678 /* Warn if a function in the namespace for users
6679 is used without an occasion to consider it declared. */
6680 if (name
[0] != '_' || name
[1] != '_')
6681 DECL_ANTICIPATED (decl
) = 1;
6686 /* Generate a FUNCTION_DECL with the typical flags for a runtime library
6687 function. Not called directly. */
6690 build_library_fn_1 (name
, operator_code
, type
)
6692 enum tree_code operator_code
;
6695 tree fn
= build_lang_decl (FUNCTION_DECL
, name
, type
);
6696 DECL_EXTERNAL (fn
) = 1;
6697 TREE_PUBLIC (fn
) = 1;
6698 DECL_ARTIFICIAL (fn
) = 1;
6699 TREE_NOTHROW (fn
) = 1;
6700 SET_OVERLOADED_OPERATOR_CODE (fn
, operator_code
);
6704 /* Returns the _DECL for a library function with C linkage.
6705 We assume that such functions never throw; if this is incorrect,
6706 callers should unset TREE_NOTHROW. */
6709 build_library_fn (name
, type
)
6713 tree fn
= build_library_fn_1 (name
, ERROR_MARK
, type
);
6714 make_decl_rtl (fn
, NULL
);
6718 /* Returns the _DECL for a library function with C++ linkage. */
6721 build_cp_library_fn (name
, operator_code
, type
)
6723 enum tree_code operator_code
;
6726 tree fn
= build_library_fn_1 (name
, operator_code
, type
);
6727 TREE_NOTHROW (fn
) = TYPE_NOTHROW_P (type
);
6728 DECL_CONTEXT (fn
) = FROB_CONTEXT (current_namespace
);
6729 set_mangled_name_for_decl (fn
);
6730 make_decl_rtl (fn
, NULL
);
6734 /* Like build_library_fn, but takes a C string instead of an
6738 build_library_fn_ptr (name
, type
)
6742 return build_library_fn (get_identifier (name
), type
);
6745 /* Like build_cp_library_fn, but takes a C string instead of an
6749 build_cp_library_fn_ptr (name
, type
)
6753 return build_cp_library_fn (get_identifier (name
), ERROR_MARK
, type
);
6756 /* Like build_library_fn, but also pushes the function so that we will
6757 be able to find it via IDENTIFIER_GLOBAL_VALUE. */
6760 push_library_fn (name
, type
)
6763 tree fn
= build_library_fn (name
, type
);
6764 pushdecl_top_level (fn
);
6768 /* Like build_cp_library_fn, but also pushes the function so that it
6769 will be found by normal lookup. */
6772 push_cp_library_fn (operator_code
, type
)
6773 enum tree_code operator_code
;
6776 tree fn
= build_cp_library_fn (ansi_opname (operator_code
),
6783 /* Like push_library_fn, but takes a TREE_LIST of parm types rather than
6787 push_void_library_fn (name
, parmtypes
)
6788 tree name
, parmtypes
;
6790 tree type
= build_function_type (void_type_node
, parmtypes
);
6791 return push_library_fn (name
, type
);
6794 /* Like push_library_fn, but also note that this function throws
6795 and does not return. Used for __throw_foo and the like. */
6798 push_throw_library_fn (name
, type
)
6801 tree fn
= push_library_fn (name
, type
);
6802 TREE_THIS_VOLATILE (fn
) = 1;
6803 TREE_NOTHROW (fn
) = 0;
6807 /* When we call finish_struct for an anonymous union, we create
6808 default copy constructors and such. But, an anonymous union
6809 shouldn't have such things; this function undoes the damage to the
6810 anonymous union type T.
6812 (The reason that we create the synthesized methods is that we don't
6813 distinguish `union { int i; }' from `typedef union { int i; } U'.
6814 The first is an anonymous union; the second is just an ordinary
6818 fixup_anonymous_aggr (t
)
6823 /* Wipe out memory of synthesized methods */
6824 TYPE_HAS_CONSTRUCTOR (t
) = 0;
6825 TYPE_HAS_DEFAULT_CONSTRUCTOR (t
) = 0;
6826 TYPE_HAS_INIT_REF (t
) = 0;
6827 TYPE_HAS_CONST_INIT_REF (t
) = 0;
6828 TYPE_HAS_ASSIGN_REF (t
) = 0;
6829 TYPE_HAS_CONST_ASSIGN_REF (t
) = 0;
6831 /* Splice the implicitly generated functions out of the TYPE_METHODS
6833 q
= &TYPE_METHODS (t
);
6836 if (DECL_ARTIFICIAL (*q
))
6837 *q
= TREE_CHAIN (*q
);
6839 q
= &TREE_CHAIN (*q
);
6842 /* ISO C++ 9.5.3. Anonymous unions may not have function members. */
6843 if (TYPE_METHODS (t
))
6844 cp_error_at ("an anonymous union cannot have function members", t
);
6847 /* Make sure that a declaration with no declarator is well-formed, i.e.
6848 just defines a tagged type or anonymous union.
6850 Returns the type defined, if any. */
6853 check_tag_decl (declspecs
)
6858 tree ob_modifier
= NULL_TREE
;
6860 register tree t
= NULL_TREE
;
6862 for (link
= declspecs
; link
; link
= TREE_CHAIN (link
))
6864 register tree value
= TREE_VALUE (link
);
6867 || (TREE_CODE (value
) == IDENTIFIER_NODE
6868 && IDENTIFIER_GLOBAL_VALUE (value
)
6869 && TYPE_P (IDENTIFIER_GLOBAL_VALUE (value
))))
6873 if ((TREE_CODE (value
) != TYPENAME_TYPE
&& IS_AGGR_TYPE (value
))
6874 || TREE_CODE (value
) == ENUMERAL_TYPE
)
6876 my_friendly_assert (TYPE_MAIN_DECL (value
) != NULL_TREE
, 261);
6880 else if (value
== ridpointers
[(int) RID_FRIEND
])
6882 if (current_class_type
== NULL_TREE
6883 || current_scope () != current_class_type
)
6884 ob_modifier
= value
;
6888 else if (value
== ridpointers
[(int) RID_STATIC
]
6889 || value
== ridpointers
[(int) RID_EXTERN
]
6890 || value
== ridpointers
[(int) RID_AUTO
]
6891 || value
== ridpointers
[(int) RID_REGISTER
]
6892 || value
== ridpointers
[(int) RID_INLINE
]
6893 || value
== ridpointers
[(int) RID_VIRTUAL
]
6894 || value
== ridpointers
[(int) RID_CONST
]
6895 || value
== ridpointers
[(int) RID_VOLATILE
]
6896 || value
== ridpointers
[(int) RID_EXPLICIT
])
6897 ob_modifier
= value
;
6901 error ("multiple types in one declaration");
6903 if (t
== NULL_TREE
&& ! saw_friend
)
6904 pedwarn ("declaration does not declare anything");
6906 /* Check for an anonymous union. We're careful
6907 accessing TYPE_IDENTIFIER because some built-in types, like
6908 pointer-to-member types, do not have TYPE_NAME. */
6909 else if (t
&& IS_AGGR_TYPE_CODE (TREE_CODE (t
))
6911 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
6913 /* Anonymous unions are objects, so they can have specifiers. */;
6914 SET_ANON_AGGR_TYPE_P (t
);
6916 if (TREE_CODE (t
) != UNION_TYPE
&& pedantic
&& ! in_system_header
)
6917 pedwarn ("ISO C++ prohibits anonymous structs");
6920 else if (ob_modifier
)
6922 if (ob_modifier
== ridpointers
[(int) RID_INLINE
]
6923 || ob_modifier
== ridpointers
[(int) RID_VIRTUAL
])
6924 cp_error ("`%D' can only be specified for functions", ob_modifier
);
6925 else if (ob_modifier
== ridpointers
[(int) RID_FRIEND
])
6926 cp_error ("`%D' can only be specified inside a class", ob_modifier
);
6927 else if (ob_modifier
== ridpointers
[(int) RID_EXPLICIT
])
6928 cp_error ("`%D' can only be specified for constructors",
6931 cp_error ("`%D' can only be specified for objects and functions",
6938 /* Called when a declaration is seen that contains no names to declare.
6939 If its type is a reference to a structure, union or enum inherited
6940 from a containing scope, shadow that tag name for the current scope
6941 with a forward reference.
6942 If its type defines a new named structure or union
6943 or defines an enum, it is valid but we need not do anything here.
6944 Otherwise, it is an error.
6946 C++: may have to grok the declspecs to learn about static,
6947 complain for anonymous unions. */
6950 shadow_tag (declspecs
)
6953 tree t
= check_tag_decl (declspecs
);
6956 maybe_process_partial_specialization (t
);
6958 /* This is where the variables in an anonymous union are
6959 declared. An anonymous union declaration looks like:
6961 because there is no declarator after the union, the parser
6962 sends that declaration here. */
6963 if (t
&& ANON_AGGR_TYPE_P (t
))
6965 fixup_anonymous_aggr (t
);
6967 if (TYPE_FIELDS (t
))
6969 tree decl
= grokdeclarator (NULL_TREE
, declspecs
, NORMAL
, 0,
6971 finish_anon_union (decl
);
6976 /* Decode a "typename", such as "int **", returning a ..._TYPE node. */
6979 groktypename (typename
)
6982 if (TREE_CODE (typename
) != TREE_LIST
)
6984 return grokdeclarator (TREE_VALUE (typename
),
6985 TREE_PURPOSE (typename
),
6986 TYPENAME
, 0, NULL_TREE
);
6989 /* Decode a declarator in an ordinary declaration or data definition.
6990 This is called as soon as the type information and variable name
6991 have been parsed, before parsing the initializer if any.
6992 Here we create the ..._DECL node, fill in its type,
6993 and put it on the list of decls for the current context.
6994 The ..._DECL node is returned as the value.
6996 Exception: for arrays where the length is not specified,
6997 the type is left null, to be filled in by `cp_finish_decl'.
6999 Function definitions do not come here; they go to start_function
7000 instead. However, external and forward declarations of functions
7001 do go through here. Structure field declarations are done by
7002 grokfield and not through here. */
7005 start_decl (declarator
, declspecs
, initialized
, attributes
, prefix_attributes
)
7006 tree declarator
, declspecs
;
7008 tree attributes
, prefix_attributes
;
7011 register tree type
, tem
;
7013 extern int have_extern_spec
;
7014 extern int used_extern_spec
;
7018 /* See code below that used this. */
7019 int init_written
= initialized
;
7022 /* This should only be done once on the top most decl. */
7023 if (have_extern_spec
&& !used_extern_spec
)
7025 declspecs
= tree_cons (NULL_TREE
, get_identifier ("extern"),
7027 used_extern_spec
= 1;
7030 if (attributes
|| prefix_attributes
)
7031 attrlist
= build_tree_list (attributes
, prefix_attributes
);
7033 attrlist
= NULL_TREE
;
7035 decl
= grokdeclarator (declarator
, declspecs
, NORMAL
, initialized
,
7038 if (decl
== NULL_TREE
|| TREE_CODE (decl
) == VOID_TYPE
)
7041 type
= TREE_TYPE (decl
);
7043 if (type
== error_mark_node
)
7046 context
= DECL_CONTEXT (decl
);
7048 if (initialized
&& context
&& TREE_CODE (context
) == NAMESPACE_DECL
7049 && context
!= current_namespace
&& TREE_CODE (decl
) == VAR_DECL
)
7051 /* When parsing the initializer, lookup should use the object's
7053 push_decl_namespace (context
);
7056 /* We are only interested in class contexts, later. */
7057 if (context
&& TREE_CODE (context
) == NAMESPACE_DECL
)
7058 context
= NULL_TREE
;
7061 /* Is it valid for this decl to have an initializer at all?
7062 If not, set INITIALIZED to zero, which will indirectly
7063 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7064 switch (TREE_CODE (decl
))
7067 /* typedef foo = bar means give foo the same type as bar.
7068 We haven't parsed bar yet, so `cp_finish_decl' will fix that up.
7069 Any other case of an initialization in a TYPE_DECL is an error. */
7070 if (pedantic
|| list_length (declspecs
) > 1)
7072 cp_error ("typedef `%D' is initialized", decl
);
7078 cp_error ("function `%#D' is initialized like a variable", decl
);
7088 if (! toplevel_bindings_p ()
7089 && DECL_EXTERNAL (decl
))
7090 cp_warning ("declaration of `%#D' has `extern' and is initialized",
7092 DECL_EXTERNAL (decl
) = 0;
7093 if (toplevel_bindings_p ())
7094 TREE_STATIC (decl
) = 1;
7096 /* Tell `pushdecl' this is an initialized decl
7097 even though we don't yet have the initializer expression.
7098 Also tell `cp_finish_decl' it may store the real initializer. */
7099 DECL_INITIAL (decl
) = error_mark_node
;
7102 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
7103 SET_DEFAULT_DECL_ATTRIBUTES (decl
, attributes
);
7106 /* Set attributes here so if duplicate decl, will have proper attributes. */
7107 cplus_decl_attributes (decl
, attributes
, prefix_attributes
);
7109 if (context
&& COMPLETE_TYPE_P (complete_type (context
)))
7111 push_nested_class (context
, 2);
7113 if (TREE_CODE (decl
) == VAR_DECL
)
7115 tree field
= lookup_field (context
, DECL_NAME (decl
), 0, 0);
7116 if (field
== NULL_TREE
|| TREE_CODE (field
) != VAR_DECL
)
7117 cp_error ("`%#D' is not a static member of `%#T'", decl
, context
);
7120 if (DECL_CONTEXT (field
) != context
)
7122 cp_pedwarn ("ISO C++ does not permit `%T::%D' to be defined as `%T::%D'",
7123 DECL_CONTEXT (field
), DECL_NAME (decl
),
7124 context
, DECL_NAME (decl
));
7125 DECL_CONTEXT (decl
) = DECL_CONTEXT (field
);
7127 /* Static data member are tricky; an in-class initialization
7128 still doesn't provide a definition, so the in-class
7129 declaration will have DECL_EXTERNAL set, but will have an
7130 initialization. Thus, duplicate_decls won't warn
7131 about this situation, and so we check here. */
7132 if (DECL_INITIAL (decl
) && DECL_INITIAL (field
))
7133 cp_error ("duplicate initialization of %D", decl
);
7134 if (duplicate_decls (decl
, field
))
7140 tree field
= check_classfn (context
, decl
);
7141 if (field
&& duplicate_decls (decl
, field
))
7145 /* cp_finish_decl sets DECL_EXTERNAL if DECL_IN_AGGR_P is set. */
7146 DECL_IN_AGGR_P (decl
) = 0;
7147 if ((DECL_LANG_SPECIFIC (decl
) && DECL_USE_TEMPLATE (decl
))
7148 || CLASSTYPE_TEMPLATE_INSTANTIATION (context
))
7150 SET_DECL_TEMPLATE_SPECIALIZATION (decl
);
7151 /* [temp.expl.spec] An explicit specialization of a static data
7152 member of a template is a definition if the declaration
7153 includes an initializer; otherwise, it is a declaration.
7155 We check for processing_specialization so this only applies
7156 to the new specialization syntax. */
7157 if (DECL_INITIAL (decl
) == NULL_TREE
&& processing_specialization
)
7158 DECL_EXTERNAL (decl
) = 1;
7161 if (DECL_EXTERNAL (decl
) && ! DECL_TEMPLATE_SPECIALIZATION (decl
))
7162 cp_pedwarn ("declaration of `%#D' outside of class is not definition",
7166 /* Enter this declaration into the symbol table. */
7167 tem
= maybe_push_decl (decl
);
7169 if (processing_template_decl
)
7170 tem
= push_template_decl (tem
);
7172 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7173 /* Tell the back-end to use or not use .common as appropriate. If we say
7174 -fconserve-space, we want this to save .data space, at the expense of
7175 wrong semantics. If we say -fno-conserve-space, we want this to
7176 produce errors about redefs; to do this we force variables into the
7178 DECL_COMMON (tem
) = flag_conserve_space
|| ! TREE_PUBLIC (tem
);
7181 if (! processing_template_decl
)
7191 tree type
= TREE_TYPE (decl
);
7192 int initialized
= (DECL_INITIAL (decl
) != NULL_TREE
);
7194 if (type
== error_mark_node
)
7197 /* If this type of object needs a cleanup, but we're not allowed to
7198 add any more objects with cleanups to the current scope, create a
7199 new binding level. */
7200 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
)
7201 && current_binding_level
->more_cleanups_ok
== 0)
7203 keep_next_level (2);
7206 add_scope_stmt (/*begin_p=*/1, /*partial_p=*/1);
7210 /* Is it valid for this decl to have an initializer at all?
7211 If not, set INITIALIZED to zero, which will indirectly
7212 tell `cp_finish_decl' to ignore the initializer once it is parsed. */
7214 /* Don't allow initializations for incomplete types except for
7215 arrays which might be completed by the initialization. */
7216 if (COMPLETE_TYPE_P (complete_type (type
)))
7217 ; /* A complete type is ok. */
7218 else if (TREE_CODE (type
) != ARRAY_TYPE
)
7220 cp_error ("variable `%#D' has initializer but incomplete type",
7223 type
= TREE_TYPE (decl
) = error_mark_node
;
7225 else if (!COMPLETE_TYPE_P (complete_type (TREE_TYPE (type
))))
7227 if (DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
))
7228 cp_error ("elements of array `%#D' have incomplete type", decl
);
7229 /* else we already gave an error in start_decl. */
7235 && TREE_CODE (decl
) != TYPE_DECL
7236 && TREE_CODE (decl
) != TEMPLATE_DECL
7237 && type
!= error_mark_node
7238 && IS_AGGR_TYPE (type
)
7239 && ! DECL_EXTERNAL (decl
))
7241 if ((! processing_template_decl
|| ! uses_template_parms (type
))
7242 && !COMPLETE_TYPE_P (complete_type (type
)))
7244 cp_error ("aggregate `%#D' has incomplete type and cannot be initialized",
7246 /* Change the type so that assemble_variable will give
7247 DECL an rtl we can live with: (mem (const_int 0)). */
7248 type
= TREE_TYPE (decl
) = error_mark_node
;
7252 /* If any base type in the hierarchy of TYPE needs a constructor,
7253 then we set initialized to 1. This way any nodes which are
7254 created for the purposes of initializing this aggregate
7255 will live as long as it does. This is necessary for global
7256 aggregates which do not have their initializers processed until
7257 the end of the file. */
7258 initialized
= TYPE_NEEDS_CONSTRUCTING (type
);
7263 DECL_INITIAL (decl
) = NULL_TREE
;
7266 /* Handle initialization of references.
7267 These three arguments are from `cp_finish_decl', and have the
7268 same meaning here that they do there.
7270 Quotes on semantics can be found in ARM 8.4.3. */
7273 grok_reference_init (decl
, type
, init
)
7274 tree decl
, type
, init
;
7278 if (init
== NULL_TREE
)
7280 if ((DECL_LANG_SPECIFIC (decl
) == 0
7281 || DECL_IN_AGGR_P (decl
) == 0)
7282 && ! DECL_THIS_EXTERN (decl
))
7283 cp_error ("`%D' declared as reference but not initialized", decl
);
7287 if (init
== error_mark_node
)
7290 if (TREE_CODE (init
) == CONSTRUCTOR
)
7292 cp_error ("ISO C++ forbids use of initializer list to initialize reference `%D'", decl
);
7296 if (TREE_CODE (init
) == TREE_LIST
)
7297 init
= build_compound_expr (init
);
7299 if (TREE_CODE (TREE_TYPE (init
)) == REFERENCE_TYPE
)
7300 init
= convert_from_reference (init
);
7302 if (TREE_CODE (TREE_TYPE (type
)) != ARRAY_TYPE
7303 && TREE_CODE (TREE_TYPE (init
)) == ARRAY_TYPE
)
7305 /* Note: default conversion is only called in very special cases. */
7306 init
= default_conversion (init
);
7309 /* Convert INIT to the reference type TYPE. This may involve the
7310 creation of a temporary, whose lifetime must be the same as that
7311 of the reference. If so, a DECL_STMT for the temporary will be
7312 added just after the DECL_STMT for DECL. That's why we don't set
7313 DECL_INITIAL for local references (instead assigning to them
7314 explicitly); we need to allow the temporary to be initialized
7316 tmp
= convert_to_reference
7317 (type
, init
, CONV_IMPLICIT
,
7318 LOOKUP_ONLYCONVERTING
|LOOKUP_SPECULATIVELY
|LOOKUP_NORMAL
|DIRECT_BIND
,
7321 if (tmp
== error_mark_node
)
7323 else if (tmp
!= NULL_TREE
)
7326 tmp
= save_expr (tmp
);
7327 if (building_stmt_tree ())
7329 /* Initialize the declaration. */
7330 tmp
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, tmp
);
7331 finish_expr_stmt (tmp
);
7334 DECL_INITIAL (decl
) = tmp
;
7338 cp_error ("cannot initialize `%T' from `%T'", type
, TREE_TYPE (init
));
7342 if (TREE_STATIC (decl
) && ! TREE_CONSTANT (DECL_INITIAL (decl
)))
7344 expand_static_init (decl
, DECL_INITIAL (decl
));
7345 DECL_INITIAL (decl
) = NULL_TREE
;
7350 /* Fill in DECL_INITIAL with some magical value to prevent expand_decl from
7351 mucking with forces it does not comprehend (i.e. initialization with a
7352 constructor). If we are at global scope and won't go into COMMON, fill
7353 it in with a dummy CONSTRUCTOR to force the variable into .data;
7354 otherwise we can use error_mark_node. */
7357 obscure_complex_init (decl
, init
)
7360 if (! flag_no_inline
&& TREE_STATIC (decl
))
7362 if (extract_init (decl
, init
))
7366 #if ! defined (ASM_OUTPUT_BSS) && ! defined (ASM_OUTPUT_ALIGNED_BSS)
7367 if (toplevel_bindings_p () && ! DECL_COMMON (decl
))
7368 DECL_INITIAL (decl
) = build (CONSTRUCTOR
, TREE_TYPE (decl
), NULL_TREE
,
7372 DECL_INITIAL (decl
) = error_mark_node
;
7377 /* When parsing `int a[] = {1, 2};' we don't know the size of the
7378 array until we finish parsing the initializer. If that's the
7379 situation we're in, update DECL accordingly. */
7382 maybe_deduce_size_from_array_init (decl
, init
)
7386 tree type
= TREE_TYPE (decl
);
7388 if (TREE_CODE (type
) == ARRAY_TYPE
7389 && TYPE_DOMAIN (type
) == NULL_TREE
7390 && TREE_CODE (decl
) != TYPE_DECL
)
7392 /* do_default is really a C-ism to deal with tentative definitions.
7393 But let's leave it here to ease the eventual merge. */
7394 int do_default
= !DECL_EXTERNAL (decl
);
7395 tree initializer
= init
? init
: DECL_INITIAL (decl
);
7396 int failure
= complete_array_type (type
, initializer
, do_default
);
7399 cp_error ("initializer fails to determine size of `%D'", decl
);
7404 cp_error ("array size missing in `%D'", decl
);
7405 /* If a `static' var's size isn't known, make it extern as
7406 well as static, so it does not get allocated. If it's not
7407 `static', then don't mark it extern; finish_incomplete_decl
7408 will give it a default size and it will get allocated. */
7409 else if (!pedantic
&& TREE_STATIC (decl
) && !TREE_PUBLIC (decl
))
7410 DECL_EXTERNAL (decl
) = 1;
7413 if (pedantic
&& TYPE_DOMAIN (type
) != NULL_TREE
7414 && tree_int_cst_lt (TYPE_MAX_VALUE (TYPE_DOMAIN (type
)),
7416 cp_error ("zero-size array `%D'", decl
);
7418 layout_decl (decl
, 0);
7422 /* Set DECL_SIZE, DECL_ALIGN, etc. for DECL (a VAR_DECL), and issue
7423 any appropriate error messages regarding the layout. */
7426 layout_var_decl (decl
)
7429 tree type
= TREE_TYPE (decl
);
7431 tree ttype
= target_type (type
);
7434 /* If we haven't already layed out this declaration, do so now.
7435 Note that we must not call complete type for an external object
7436 because it's type might involve templates that we are not
7437 supposed to isntantiate yet. (And it's perfectly legal to say
7438 `extern X x' for some incomplete type `X'.) */
7439 if (!DECL_EXTERNAL (decl
))
7440 complete_type (type
);
7441 if (!DECL_SIZE (decl
) && COMPLETE_TYPE_P (type
))
7442 layout_decl (decl
, 0);
7444 if (!DECL_EXTERNAL (decl
) && DECL_SIZE (decl
) == NULL_TREE
)
7446 /* An automatic variable with an incomplete type: that is an error.
7447 Don't talk about array types here, since we took care of that
7448 message in grokdeclarator. */
7449 cp_error ("storage size of `%D' isn't known", decl
);
7450 TREE_TYPE (decl
) = error_mark_node
;
7453 /* Keep this code around in case we later want to control debug info
7454 based on whether a type is "used". (jason 1999-11-11) */
7456 else if (!DECL_EXTERNAL (decl
) && IS_AGGR_TYPE (ttype
))
7457 /* Let debugger know it should output info for this type. */
7458 note_debug_info_needed (ttype
);
7460 if (TREE_STATIC (decl
) && DECL_CLASS_SCOPE_P (decl
))
7461 note_debug_info_needed (DECL_CONTEXT (decl
));
7464 if ((DECL_EXTERNAL (decl
) || TREE_STATIC (decl
))
7465 && DECL_SIZE (decl
) != NULL_TREE
7466 && ! TREE_CONSTANT (DECL_SIZE (decl
)))
7468 if (TREE_CODE (DECL_SIZE (decl
)) == INTEGER_CST
)
7469 constant_expression_warning (DECL_SIZE (decl
));
7471 cp_error ("storage size of `%D' isn't constant", decl
);
7475 /* If a local static variable is declared in an inline function, or if
7476 we have a weak definition, we must endeavor to create only one
7477 instance of the variable at link-time. */
7480 maybe_commonize_var (decl
)
7483 /* Static data in a function with comdat linkage also has comdat
7485 if (TREE_STATIC (decl
)
7486 /* Don't mess with __FUNCTION__. */
7487 && ! DECL_ARTIFICIAL (decl
)
7488 && current_function_decl
7489 && DECL_CONTEXT (decl
) == current_function_decl
7490 && (DECL_THIS_INLINE (current_function_decl
)
7491 || DECL_TEMPLATE_INSTANTIATION (current_function_decl
))
7492 && TREE_PUBLIC (current_function_decl
))
7494 /* Rather than try to get this right with inlining, we suppress
7495 inlining of such functions. */
7496 current_function_cannot_inline
7497 = "function with static variable cannot be inline";
7498 DECL_UNINLINABLE (current_function_decl
) = 1;
7500 /* If flag_weak, we don't need to mess with this, as we can just
7501 make the function weak, and let it refer to its unique local
7502 copy. This works because we don't allow the function to be
7506 if (DECL_INTERFACE_KNOWN (current_function_decl
))
7508 TREE_PUBLIC (decl
) = 1;
7509 DECL_EXTERNAL (decl
) = DECL_EXTERNAL (current_function_decl
);
7511 else if (DECL_INITIAL (decl
) == NULL_TREE
7512 || DECL_INITIAL (decl
) == error_mark_node
)
7514 TREE_PUBLIC (decl
) = 1;
7515 DECL_COMMON (decl
) = 1;
7517 /* else we lose. We can only do this if we can use common,
7518 which we can't if it has been initialized. */
7520 if (TREE_PUBLIC (decl
))
7523 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
7525 DECL_ASSEMBLER_NAME (decl
)
7526 = build_static_name (current_function_decl
, DECL_NAME (decl
));
7530 cp_warning_at ("sorry: semantics of inline function static data `%#D' are wrong (you'll wind up with multiple copies)", decl
);
7531 cp_warning_at (" you can work around this by removing the initializer", decl
);
7535 else if (DECL_LANG_SPECIFIC (decl
) && DECL_COMDAT (decl
))
7536 /* Set it up again; we might have set DECL_INITIAL since the last
7538 comdat_linkage (decl
);
7541 /* Issue an error message if DECL is an uninitialized const variable. */
7544 check_for_uninitialized_const_var (decl
)
7547 tree type
= TREE_TYPE (decl
);
7549 /* ``Unless explicitly declared extern, a const object does not have
7550 external linkage and must be initialized. ($8.4; $12.1)'' ARM
7552 if (TREE_CODE (decl
) == VAR_DECL
7553 && TREE_CODE (type
) != REFERENCE_TYPE
7554 && CP_TYPE_CONST_P (type
)
7555 && !TYPE_NEEDS_CONSTRUCTING (type
)
7556 && !DECL_INITIAL (decl
))
7557 cp_error ("uninitialized const `%D'", decl
);
7560 /* Verify INIT (the initializer for DECL), and record the
7561 initialization in DECL_INITIAL, if appropriate. Returns a new
7565 check_initializer (decl
, init
)
7571 if (TREE_CODE (decl
) == FIELD_DECL
)
7574 type
= TREE_TYPE (decl
);
7576 /* If `start_decl' didn't like having an initialization, ignore it now. */
7577 if (init
!= NULL_TREE
&& DECL_INITIAL (decl
) == NULL_TREE
)
7580 /* Check the initializer. */
7583 /* Things that are going to be initialized need to have complete
7585 TREE_TYPE (decl
) = type
= complete_type (TREE_TYPE (decl
));
7587 if (type
== error_mark_node
)
7588 /* We will have already complained. */
7590 else if (COMPLETE_TYPE_P (type
) && !TREE_CONSTANT (TYPE_SIZE (type
)))
7592 cp_error ("variable-sized object `%D' may not be initialized", decl
);
7595 else if (TREE_CODE (type
) == ARRAY_TYPE
7596 && !COMPLETE_TYPE_P (TREE_TYPE (type
)))
7598 cp_error ("elements of array `%#D' have incomplete type", decl
);
7601 else if (!COMPLETE_TYPE_P (type
))
7603 cp_error ("`%D' has incomplete type", decl
);
7604 TREE_TYPE (decl
) = error_mark_node
;
7609 if (TREE_CODE (decl
) == CONST_DECL
)
7611 my_friendly_assert (TREE_CODE (decl
) != REFERENCE_TYPE
, 148);
7613 DECL_INITIAL (decl
) = init
;
7615 my_friendly_assert (init
!= NULL_TREE
, 149);
7618 else if (!DECL_EXTERNAL (decl
) && TREE_CODE (type
) == REFERENCE_TYPE
)
7620 if (TREE_STATIC (decl
))
7621 make_decl_rtl (decl
, NULL_PTR
);
7622 grok_reference_init (decl
, type
, init
);
7627 if (TYPE_HAS_CONSTRUCTOR (type
) || TYPE_NEEDS_CONSTRUCTING (type
))
7629 if (TREE_CODE (type
) == ARRAY_TYPE
)
7630 init
= digest_init (type
, init
, (tree
*) 0);
7631 else if (TREE_CODE (init
) == CONSTRUCTOR
7632 && TREE_HAS_CONSTRUCTOR (init
))
7634 if (TYPE_NON_AGGREGATE_CLASS (type
))
7636 cp_error ("`%D' must be initialized by constructor, not by `{...}'",
7638 init
= error_mark_node
;
7641 goto dont_use_constructor
;
7646 dont_use_constructor
:
7647 if (TREE_CODE (init
) != TREE_VEC
)
7648 init
= store_init_value (decl
, init
);
7652 /* We must hide the initializer so that expand_decl
7653 won't try to do something it does not understand. */
7654 init
= obscure_complex_init (decl
, init
);
7656 else if (DECL_EXTERNAL (decl
))
7658 else if (TYPE_P (type
)
7659 && (IS_AGGR_TYPE (type
) || TYPE_NEEDS_CONSTRUCTING (type
)))
7661 tree core_type
= strip_array_types (type
);
7663 if (! TYPE_NEEDS_CONSTRUCTING (core_type
))
7665 if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (core_type
))
7666 cp_error ("structure `%D' with uninitialized const members", decl
);
7667 if (CLASSTYPE_REF_FIELDS_NEED_INIT (core_type
))
7668 cp_error ("structure `%D' with uninitialized reference members",
7672 check_for_uninitialized_const_var (decl
);
7674 if (COMPLETE_TYPE_P (type
) && TYPE_NEEDS_CONSTRUCTING (type
))
7675 init
= obscure_complex_init (decl
, NULL_TREE
);
7679 check_for_uninitialized_const_var (decl
);
7684 /* If DECL is not a local variable, give it RTL. */
7687 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
)
7690 const char *asmspec
;
7692 int toplev
= toplevel_bindings_p ();
7695 /* Handle non-variables up front. */
7696 if (TREE_CODE (decl
) != VAR_DECL
)
7698 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7702 /* If we see a class member here, it should be a static data
7704 if (DECL_LANG_SPECIFIC (decl
) && DECL_IN_AGGR_P (decl
))
7706 my_friendly_assert (TREE_STATIC (decl
), 19990828);
7707 /* An in-class declaration of a static data member should be
7708 external; it is only a declaration, and not a definition. */
7709 if (init
== NULL_TREE
)
7710 my_friendly_assert (DECL_EXTERNAL (decl
), 20000723);
7713 /* Set the DECL_ASSEMBLER_NAME for the variable. */
7715 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
7717 /* We don't create any RTL for local variables. */
7718 if (DECL_FUNCTION_SCOPE_P (decl
) && !TREE_STATIC (decl
))
7721 /* We defer emission of local statics until the corresponding
7722 DECL_STMT is expanded. */
7723 defer_p
= DECL_FUNCTION_SCOPE_P (decl
) || DECL_VIRTUAL_P (decl
);
7725 /* We try to defer namespace-scope static constants so that they are
7726 not emitted into the object file unncessarily. */
7727 if (!DECL_VIRTUAL_P (decl
)
7728 && TREE_READONLY (decl
)
7729 && DECL_INITIAL (decl
) != NULL_TREE
7730 && DECL_INITIAL (decl
) != error_mark_node
7731 && ! EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
))
7733 && !TREE_PUBLIC (decl
))
7735 /* Fool with the linkage according to #pragma interface. */
7736 if (!interface_unknown
)
7738 TREE_PUBLIC (decl
) = 1;
7739 DECL_EXTERNAL (decl
) = interface_only
;
7745 /* If we're deferring the variable, just make RTL. Do not actually
7746 emit the variable. */
7748 make_decl_rtl (decl
, asmspec
);
7749 /* If we're not deferring, go ahead and assemble the variable. */
7751 rest_of_decl_compilation (decl
, asmspec
, toplev
, at_eof
);
7754 /* The old ARM scoping rules injected variables declared in the
7755 initialization statement of a for-statement into the surrounding
7756 scope. We support this usage, in order to be backward-compatible.
7757 DECL is a just-declared VAR_DECL; if necessary inject its
7758 declaration into the surrounding scope. */
7761 maybe_inject_for_scope_var (decl
)
7764 if (!DECL_NAME (decl
))
7767 if (current_binding_level
->is_for_scope
)
7769 struct binding_level
*outer
7770 = current_binding_level
->level_chain
;
7772 /* Check to see if the same name is already bound at the outer
7773 level, either because it was directly declared, or because a
7774 dead for-decl got preserved. In either case, the code would
7775 not have been valid under the ARM scope rules, so clear
7776 is_for_scope for the current_binding_level.
7778 Otherwise, we need to preserve the temp slot for decl to last
7779 into the outer binding level. */
7782 = TREE_CHAIN (IDENTIFIER_BINDING (DECL_NAME (decl
)));
7784 if (outer_binding
&& BINDING_LEVEL (outer_binding
) == outer
7785 && (TREE_CODE (BINDING_VALUE (outer_binding
))
7787 && DECL_DEAD_FOR_LOCAL (BINDING_VALUE (outer_binding
)))
7789 BINDING_VALUE (outer_binding
)
7790 = DECL_SHADOWED_FOR_VAR (BINDING_VALUE (outer_binding
));
7791 current_binding_level
->is_for_scope
= 0;
7793 else if (DECL_IN_MEMORY_P (decl
))
7794 preserve_temp_slots (DECL_RTL (decl
));
7798 /* Generate code to initialize DECL (a local variable). */
7801 initialize_local_var (decl
, init
, flags
)
7806 tree type
= TREE_TYPE (decl
);
7808 /* If the type is bogus, don't bother initializing the variable. */
7809 if (type
== error_mark_node
)
7812 if (DECL_SIZE (decl
) == NULL_TREE
&& !TREE_STATIC (decl
))
7814 /* If we used it already as memory, it must stay in memory. */
7815 DECL_INITIAL (decl
) = NULL_TREE
;
7816 TREE_ADDRESSABLE (decl
) = TREE_USED (decl
);
7819 /* Local statics are handled differently from ordinary automatic
7821 if (TREE_STATIC (decl
))
7823 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
7824 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
7825 expand_static_init (decl
, init
);
7829 if (DECL_SIZE (decl
) && type
!= error_mark_node
)
7833 /* Compute and store the initial value. */
7834 already_used
= TREE_USED (decl
) || TREE_USED (type
);
7836 if (init
|| TYPE_NEEDS_CONSTRUCTING (type
))
7838 int saved_stmts_are_full_exprs_p
;
7840 my_friendly_assert (building_stmt_tree (), 20000906);
7841 saved_stmts_are_full_exprs_p
= stmts_are_full_exprs_p ();
7842 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
7843 finish_expr_stmt (build_aggr_init (decl
, init
, flags
));
7844 current_stmt_tree ()->stmts_are_full_exprs_p
=
7845 saved_stmts_are_full_exprs_p
;
7848 /* Set this to 0 so we can tell whether an aggregate which was
7849 initialized was ever used. Don't do this if it has a
7850 destructor, so we don't complain about the 'resource
7851 allocation is initialization' idiom. Now set
7852 attribute((unused)) on types so decls of that type will be
7853 marked used. (see TREE_USED, above.) */
7854 if (TYPE_NEEDS_CONSTRUCTING (type
)
7856 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type
)
7857 && DECL_NAME (decl
))
7858 TREE_USED (decl
) = 0;
7859 else if (already_used
)
7860 TREE_USED (decl
) = 1;
7864 /* Generate code to destroy DECL (a local variable). */
7867 destroy_local_var (decl
)
7870 tree type
= TREE_TYPE (decl
);
7873 /* Only variables get cleaned up. */
7874 if (TREE_CODE (decl
) != VAR_DECL
)
7877 /* And only things with destructors need cleaning up. */
7878 if (type
== error_mark_node
7879 || TYPE_HAS_TRIVIAL_DESTRUCTOR (type
))
7882 if (TREE_CODE (decl
) == VAR_DECL
&&
7883 (DECL_EXTERNAL (decl
) || TREE_STATIC (decl
)))
7884 /* We don't clean up things that aren't defined in this
7885 translation unit, or that need a static cleanup. The latter
7886 are handled by finish_file. */
7889 /* Compute the cleanup. */
7890 cleanup
= maybe_build_cleanup (decl
);
7892 /* Record the cleanup required for this declaration. */
7893 if (DECL_SIZE (decl
) && TREE_TYPE (decl
) != error_mark_node
7895 finish_decl_cleanup (decl
, cleanup
);
7898 /* Finish processing of a declaration;
7899 install its line number and initial value.
7900 If the length of an array type is not known before,
7901 it must be determined now, from the initial value, or it is an error.
7903 INIT holds the value of an initializer that should be allowed to escape
7906 FLAGS is LOOKUP_ONLYCONVERTING if the = init syntax was used, else 0
7907 if the (init) syntax was used. */
7910 cp_finish_decl (decl
, init
, asmspec_tree
, flags
)
7916 tree ttype
= NULL_TREE
;
7917 const char *asmspec
= NULL
;
7918 int was_readonly
= 0;
7923 error ("assignment (not initialization) in declaration");
7927 /* If a name was specified, get the string. */
7929 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
7931 if (init
&& TREE_CODE (init
) == NAMESPACE_DECL
)
7933 cp_error ("cannot initialize `%D' to namespace `%D'",
7938 if (current_class_type
7939 && CP_DECL_CONTEXT (decl
) == current_class_type
7940 && TYPE_BEING_DEFINED (current_class_type
)
7941 && (DECL_INITIAL (decl
) || init
))
7942 DECL_INITIALIZED_IN_CLASS_P (decl
) = 1;
7944 if (TREE_CODE (decl
) == VAR_DECL
7945 && DECL_CONTEXT (decl
)
7946 && TREE_CODE (DECL_CONTEXT (decl
)) == NAMESPACE_DECL
7947 && DECL_CONTEXT (decl
) != current_namespace
7950 /* Leave the namespace of the object. */
7951 pop_decl_namespace ();
7954 type
= TREE_TYPE (decl
);
7956 if (type
== error_mark_node
)
7959 /* Add this declaration to the statement-tree. */
7960 if (building_stmt_tree ()
7961 && at_function_scope_p ()
7962 && TREE_CODE (decl
) != RESULT_DECL
)
7963 add_decl_stmt (decl
);
7965 if (TYPE_HAS_MUTABLE_P (type
))
7966 TREE_READONLY (decl
) = 0;
7968 if (processing_template_decl
)
7970 if (init
&& DECL_INITIAL (decl
))
7971 DECL_INITIAL (decl
) = init
;
7975 /* Parameters are handled by store_parm_decls, not cp_finish_decl. */
7976 my_friendly_assert (TREE_CODE (decl
) != PARM_DECL
, 19990828);
7978 /* Take care of TYPE_DECLs up front. */
7979 if (TREE_CODE (decl
) == TYPE_DECL
)
7981 if (init
&& DECL_INITIAL (decl
))
7983 /* typedef foo = bar; store the type of bar as the type of foo. */
7984 TREE_TYPE (decl
) = type
= TREE_TYPE (init
);
7985 DECL_INITIAL (decl
) = init
= NULL_TREE
;
7987 if (type
!= error_mark_node
7988 && IS_AGGR_TYPE (type
) && DECL_NAME (decl
))
7990 if (TREE_TYPE (DECL_NAME (decl
)) && TREE_TYPE (decl
) != type
)
7991 cp_warning ("shadowing previous type declaration of `%#D'", decl
);
7992 set_identifier_type_value (DECL_NAME (decl
), type
);
7993 CLASSTYPE_GOT_SEMICOLON (type
) = 1;
7995 GNU_xref_decl (current_function_decl
, decl
);
7997 /* If we have installed this as the canonical typedef for this
7998 type, and that type has not been defined yet, delay emitting
7999 the debug information for it, as we will emit it later. */
8000 if (TYPE_MAIN_DECL (TREE_TYPE (decl
)) == decl
8001 && !COMPLETE_TYPE_P (TREE_TYPE (decl
)))
8002 TYPE_DECL_SUPPRESS_DEBUG (decl
) = 1;
8004 rest_of_decl_compilation (decl
, NULL_PTR
,
8005 DECL_CONTEXT (decl
) == NULL_TREE
, at_eof
);
8009 if (TREE_CODE (decl
) != FUNCTION_DECL
)
8010 ttype
= target_type (type
);
8012 if (! DECL_EXTERNAL (decl
) && TREE_READONLY (decl
)
8013 && TYPE_NEEDS_CONSTRUCTING (type
))
8015 /* Currently, GNU C++ puts constants in text space, making them
8016 impossible to initialize. In the future, one would hope for
8017 an operating system which understood the difference between
8018 initialization and the running of a program. */
8020 TREE_READONLY (decl
) = 0;
8023 if (TREE_CODE (decl
) == FIELD_DECL
&& asmspec
)
8025 /* This must override the asm specifier which was placed by
8026 grokclassfn. Lay this out fresh. */
8027 DECL_RTL (TREE_TYPE (decl
)) = NULL_RTX
;
8028 DECL_ASSEMBLER_NAME (decl
) = get_identifier (asmspec
);
8029 make_decl_rtl (decl
, asmspec
);
8032 /* Deduce size of array from initialization, if not already known. */
8033 maybe_deduce_size_from_array_init (decl
, init
);
8034 init
= check_initializer (decl
, init
);
8036 GNU_xref_decl (current_function_decl
, decl
);
8038 if (TREE_CODE (decl
) == VAR_DECL
)
8039 layout_var_decl (decl
);
8041 /* Output the assembler code and/or RTL code for variables and functions,
8042 unless the type is an undefined structure or union.
8043 If not, it will get done when the type is completed. */
8044 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == FUNCTION_DECL
8045 || TREE_CODE (decl
) == RESULT_DECL
)
8047 if (TREE_CODE (decl
) == VAR_DECL
)
8048 maybe_commonize_var (decl
);
8050 make_rtl_for_nonlocal_decl (decl
, init
, asmspec
);
8052 if (TREE_CODE (type
) == FUNCTION_TYPE
8053 || TREE_CODE (type
) == METHOD_TYPE
)
8054 abstract_virtuals_error (decl
,
8055 strip_array_types (TREE_TYPE (type
)));
8057 abstract_virtuals_error (decl
, strip_array_types (type
));
8059 if (TREE_CODE (decl
) == FUNCTION_DECL
)
8061 else if (DECL_EXTERNAL (decl
)
8062 && ! (DECL_LANG_SPECIFIC (decl
)
8063 && DECL_NOT_REALLY_EXTERN (decl
)))
8066 DECL_INITIAL (decl
) = init
;
8068 else if (TREE_CODE (CP_DECL_CONTEXT (decl
)) == FUNCTION_DECL
)
8070 /* This is a local declaration. */
8071 if (doing_semantic_analysis_p ())
8072 maybe_inject_for_scope_var (decl
);
8073 /* Initialize the local variable. But, if we're building a
8074 statement-tree, we'll do the initialization when we
8076 if (processing_template_decl
)
8078 if (init
|| DECL_INITIAL (decl
) == error_mark_node
)
8079 DECL_INITIAL (decl
) = init
;
8083 /* If we're not building RTL, then we need to do so
8085 my_friendly_assert (building_stmt_tree (), 20000906);
8086 /* Initialize the variable. */
8087 initialize_local_var (decl
, init
, flags
);
8088 /* Clean up the variable. */
8089 destroy_local_var (decl
);
8092 else if (TREE_STATIC (decl
) && type
!= error_mark_node
)
8094 /* Cleanups for static variables are handled by `finish_file'. */
8095 if (TYPE_NEEDS_CONSTRUCTING (type
) || init
!= NULL_TREE
8096 || TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
8097 expand_static_init (decl
, init
);
8101 /* Undo call to `pushclass' that was done in `start_decl'
8102 due to initialization of qualified member variable.
8103 I.e., Foo::x = 10; */
8105 tree context
= CP_DECL_CONTEXT (decl
);
8108 && (TREE_CODE (decl
) == VAR_DECL
8109 /* We also have a pushclass done that we need to undo here
8110 if we're at top level and declare a method. */
8111 || TREE_CODE (decl
) == FUNCTION_DECL
)
8112 /* If size hasn't been set, we're still defining it,
8113 and therefore inside the class body; don't pop
8114 the binding level.. */
8115 && COMPLETE_TYPE_P (context
)
8116 && context
== current_class_type
)
8117 pop_nested_class ();
8124 TREE_READONLY (decl
) = 1;
8127 /* This is here for a midend callback from c-common.c */
8130 finish_decl (decl
, init
, asmspec_tree
)
8134 cp_finish_decl (decl
, init
, asmspec_tree
, 0);
8137 /* Returns a declaration for a VAR_DECL as if:
8139 extern "C" TYPE NAME;
8141 had been seen. Used to create compiler-generated global
8145 declare_global_var (name
, type
)
8151 push_to_top_level ();
8152 decl
= build_decl (VAR_DECL
, name
, type
);
8153 TREE_PUBLIC (decl
) = 1;
8154 DECL_EXTERNAL (decl
) = 1;
8155 DECL_ARTIFICIAL (decl
) = 1;
8157 cp_finish_decl (decl
, NULL_TREE
, NULL_TREE
, 0);
8158 pop_from_top_level ();
8163 /* Returns a pointer to the `atexit' function. Note that if
8164 FLAG_USE_CXA_ATEXIT is non-zero, then this will actually be the new
8165 `__cxa_atexit' function specified in the IA64 C++ ABI. */
8179 if (flag_use_cxa_atexit
)
8181 /* The declaration for `__cxa_atexit' is:
8183 int __cxa_atexit (void (*)(void *), void *, void *)
8185 We build up the argument types and then then function type
8188 /* First, build the pointer-to-function type for the first
8190 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8191 fn_type
= build_function_type (void_type_node
, arg_types
);
8192 fn_ptr_type
= build_pointer_type (fn_type
);
8193 /* Then, build the rest of the argument types. */
8194 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
8195 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, arg_types
);
8196 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, arg_types
);
8197 /* And the final __cxa_atexit type. */
8198 fn_type
= build_function_type (integer_type_node
, arg_types
);
8199 fn_ptr_type
= build_pointer_type (fn_type
);
8200 name
= "__cxa_atexit";
8204 /* The declaration for `atexit' is:
8206 int atexit (void (*)());
8208 We build up the argument types and then then function type
8210 fn_type
= build_function_type (void_type_node
, void_list_node
);
8211 fn_ptr_type
= build_pointer_type (fn_type
);
8212 arg_types
= tree_cons (NULL_TREE
, fn_ptr_type
, void_list_node
);
8213 /* Build the final atexit type. */
8214 fn_type
= build_function_type (integer_type_node
, arg_types
);
8218 /* Now, build the function declaration. */
8219 push_lang_context (lang_name_c
);
8220 atexit_fndecl
= build_library_fn_ptr (name
, fn_type
);
8221 mark_used (atexit_fndecl
);
8222 pop_lang_context ();
8223 atexit_node
= default_conversion (atexit_fndecl
);
8228 /* Returns the __dso_handle VAR_DECL. */
8231 get_dso_handle_node ()
8233 if (dso_handle_node
)
8234 return dso_handle_node
;
8236 /* Declare the variable. */
8237 dso_handle_node
= declare_global_var (get_identifier ("__dso_handle"),
8240 return dso_handle_node
;
8243 /* Begin a new function with internal linkage whose job will be simply
8244 to destroy some particular variable. */
8249 static int counter
= 0;
8250 int old_interface_unknown
= interface_unknown
;
8256 push_to_top_level ();
8258 /* No need to mangle this. */
8259 push_lang_context (lang_name_c
);
8261 interface_unknown
= 1;
8263 /* Build the parameter-types. */
8264 parmtypes
= void_list_node
;
8265 /* Functions passed to __cxa_atexit take an additional parameter.
8266 We'll just ignore it. After we implement the new calling
8267 convention for destructors, we can eliminate the use of
8268 additional cleanup functions entirely in the -fnew-abi case. */
8269 if (flag_use_cxa_atexit
)
8270 parmtypes
= tree_cons (NULL_TREE
, ptr_type_node
, parmtypes
);
8271 /* Build the function type itself. */
8272 fntype
= build_function_type (void_type_node
, parmtypes
);
8273 /* Build the name of the function. */
8274 sprintf (name
, "__tcf_%d", counter
++);
8275 /* Build the function declaration. */
8276 fndecl
= build_lang_decl (FUNCTION_DECL
, get_identifier (name
), fntype
);
8277 /* It's a function with internal linkage, generated by the
8279 TREE_PUBLIC (fndecl
) = 0;
8280 DECL_ARTIFICIAL (fndecl
) = 1;
8281 /* Make the function `inline' so that it is only emitted if it is
8282 actually needed. It is unlikely that it will be inlined, since
8283 it is only called via a function pointer, but we avoid unncessary
8284 emissions this way. */
8285 DECL_INLINE (fndecl
) = 1;
8286 /* Build the parameter. */
8287 if (flag_use_cxa_atexit
)
8291 parmdecl
= build_decl (PARM_DECL
, NULL_TREE
, ptr_type_node
);
8292 DECL_CONTEXT (parmdecl
) = fndecl
;
8293 DECL_ARG_TYPE (parmdecl
) = ptr_type_node
;
8294 TREE_USED (parmdecl
) = 1;
8295 DECL_ARGUMENTS (fndecl
) = parmdecl
;
8299 start_function (/*specs=*/NULL_TREE
, fndecl
, NULL_TREE
, SF_PRE_PARSED
);
8302 interface_unknown
= old_interface_unknown
;
8304 pop_lang_context ();
8306 return current_function_decl
;
8309 /* Finish the cleanup function begun by start_cleanup_fn. */
8316 expand_body (finish_function (0));
8318 pop_from_top_level ();
8321 /* Generate code to handle the destruction of DECL, an object with
8322 static storage duration. */
8325 register_dtor_fn (decl
)
8333 int saved_flag_access_control
;
8335 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl
)))
8338 /* Call build_cleanup before we enter the anonymous function so that
8339 any access checks will be done relative to the current scope,
8340 rather than the scope of the anonymous function. */
8341 build_cleanup (decl
);
8343 /* Now start the function. */
8344 cleanup
= start_cleanup_fn ();
8346 /* Now, recompute the cleanup. It may contain SAVE_EXPRs that refer
8347 to the original function, rather than the anonymous one. That
8348 will make the back-end think that nested functions are in use,
8349 which causes confusion. */
8350 saved_flag_access_control
= flag_access_control
;
8351 flag_access_control
= 0;
8352 fcall
= build_cleanup (decl
);
8353 flag_access_control
= saved_flag_access_control
;
8355 /* Create the body of the anonymous function. */
8356 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
8357 finish_expr_stmt (fcall
);
8358 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
8361 /* Call atexit with the cleanup function. */
8362 mark_addressable (cleanup
);
8363 cleanup
= build_unary_op (ADDR_EXPR
, cleanup
, 0);
8364 if (flag_use_cxa_atexit
)
8366 args
= tree_cons (NULL_TREE
, get_dso_handle_node (), NULL_TREE
);
8367 args
= tree_cons (NULL_TREE
, null_pointer_node
, args
);
8368 args
= tree_cons (NULL_TREE
, cleanup
, args
);
8371 args
= tree_cons (NULL_TREE
, cleanup
, NULL_TREE
);
8372 finish_expr_stmt (build_function_call (get_atexit_node (), args
));
8376 expand_static_init (decl
, init
)
8380 tree oldstatic
= value_member (decl
, static_aggregates
);
8384 if (TREE_PURPOSE (oldstatic
) && init
!= NULL_TREE
)
8385 cp_error ("multiple initializations given for `%D'", decl
);
8387 else if (! toplevel_bindings_p ())
8389 /* Emit code to perform this initialization but once. */
8396 /* Emit code to perform this initialization but once. This code
8399 static int guard = 0;
8401 // Do initialization.
8403 // Register variable for destruction at end of program.
8406 Note that the `temp' variable is only set to 1 *after* the
8407 initialization is complete. This ensures that an exception,
8408 thrown during the construction, will cause the variable to
8409 reinitialized when we pass through this code again, as per:
8413 If the initialization exits by throwing an exception, the
8414 initialization is not complete, so it will be tried again
8415 the next time control enters the declaration.
8417 In theory, this process should be thread-safe, too; multiple
8418 threads should not be able to initialize the variable more
8419 than once. We don't yet attempt to ensure thread-safety. */
8421 /* Create the guard variable. */
8422 guard
= get_guard (decl
);
8424 /* Begin the conditional initialization. */
8425 if_stmt
= begin_if_stmt ();
8426 finish_if_stmt_cond (get_guard_cond (guard
), if_stmt
);
8427 then_clause
= begin_compound_stmt (/*has_no_scope=*/0);
8429 /* Do the initialization itself. */
8430 if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
))
8431 || (init
&& TREE_CODE (init
) == TREE_LIST
))
8432 assignment
= build_aggr_init (decl
, init
, 0);
8434 /* The initialization we're doing here is just a bitwise
8436 assignment
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
8438 assignment
= NULL_TREE
;
8440 /* Once the assignment is complete, set TEMP to 1. Since the
8441 construction of the static object is complete at this point,
8442 we want to make sure TEMP is set to 1 even if a temporary
8443 constructed during the initialization throws an exception
8444 when it is destroyed. So, we combine the initialization and
8445 the assignment to TEMP into a single expression, ensuring
8446 that when we call finish_expr_stmt the cleanups will not be
8447 run until after TEMP is set to 1. */
8448 guard_init
= set_guard (guard
);
8451 assignment
= tree_cons (NULL_TREE
, assignment
,
8452 build_tree_list (NULL_TREE
,
8454 assignment
= build_compound_expr (assignment
);
8457 assignment
= guard_init
;
8458 finish_expr_stmt (assignment
);
8460 /* Use atexit to register a function for destroying this static
8462 register_dtor_fn (decl
);
8464 finish_compound_stmt (/*has_no_scope=*/0, then_clause
);
8465 finish_then_clause (if_stmt
);
8469 static_aggregates
= tree_cons (init
, decl
, static_aggregates
);
8472 /* Finish the declaration of a catch-parameter. */
8475 start_handler_parms (declspecs
, declarator
)
8482 decl
= grokdeclarator (declarator
, declspecs
, CATCHPARM
,
8484 if (decl
== NULL_TREE
)
8485 error ("invalid catch parameter");
8494 /* Make TYPE a complete type based on INITIAL_VALUE.
8495 Return 0 if successful, 1 if INITIAL_VALUE can't be deciphered,
8496 2 if there was no information (in which case assume 0 if DO_DEFAULT). */
8499 complete_array_type (type
, initial_value
, do_default
)
8500 tree type
, initial_value
;
8503 register tree maxindex
= NULL_TREE
;
8508 /* An array of character type can be initialized from a
8509 brace-enclosed string constant. */
8510 if (char_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (type
)))
8511 && TREE_CODE (initial_value
) == CONSTRUCTOR
8512 && CONSTRUCTOR_ELTS (initial_value
)
8513 && (TREE_CODE (TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
)))
8515 && TREE_CHAIN (CONSTRUCTOR_ELTS (initial_value
)) == NULL_TREE
)
8516 initial_value
= TREE_VALUE (CONSTRUCTOR_ELTS (initial_value
));
8518 /* Note MAXINDEX is really the maximum index, one less than the
8520 if (TREE_CODE (initial_value
) == STRING_CST
)
8523 = int_size_in_bytes (TREE_TYPE (TREE_TYPE (initial_value
)));
8524 maxindex
= build_int_2 ((TREE_STRING_LENGTH (initial_value
)
8527 else if (TREE_CODE (initial_value
) == CONSTRUCTOR
)
8529 tree elts
= CONSTRUCTOR_ELTS (initial_value
);
8531 maxindex
= ssize_int (-1);
8532 for (; elts
; elts
= TREE_CHAIN (elts
))
8534 if (TREE_PURPOSE (elts
))
8535 maxindex
= TREE_PURPOSE (elts
);
8537 maxindex
= size_binop (PLUS_EXPR
, maxindex
, ssize_int (1));
8539 maxindex
= copy_node (maxindex
);
8543 /* Make an error message unless that happened already. */
8544 if (initial_value
!= error_mark_node
)
8547 initial_value
= NULL_TREE
;
8549 /* Prevent further error messages. */
8550 maxindex
= build_int_2 (0, 0);
8557 maxindex
= build_int_2 (0, 0);
8566 domain
= build_index_type (maxindex
);
8567 TYPE_DOMAIN (type
) = domain
;
8569 if (! TREE_TYPE (maxindex
))
8570 TREE_TYPE (maxindex
) = domain
;
8572 itype
= TREE_TYPE (initial_value
);
8575 if (itype
&& !TYPE_DOMAIN (itype
))
8576 TYPE_DOMAIN (itype
) = domain
;
8577 /* The type of the main variant should never be used for arrays
8578 of different sizes. It should only ever be completed with the
8579 size of the array. */
8580 if (! TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)))
8581 TYPE_DOMAIN (TYPE_MAIN_VARIANT (type
)) = domain
;
8584 /* Lay out the type now that we can get the real answer. */
8591 /* Return zero if something is declared to be a member of type
8592 CTYPE when in the context of CUR_TYPE. STRING is the error
8593 message to print in that case. Otherwise, quietly return 1. */
8596 member_function_or_else (ctype
, cur_type
, flags
)
8597 tree ctype
, cur_type
;
8598 enum overload_flags flags
;
8600 if (ctype
&& ctype
!= cur_type
)
8602 if (flags
== DTOR_FLAG
)
8603 cp_error ("destructor for alien class `%T' cannot be a member",
8606 cp_error ("constructor for alien class `%T' cannot be a member",
8613 /* Subroutine of `grokdeclarator'. */
8615 /* Generate errors possibly applicable for a given set of specifiers.
8616 This is for ARM $7.1.2. */
8619 bad_specifiers (object
, type
, virtualp
, quals
, inlinep
, friendp
, raises
)
8622 int virtualp
, quals
, friendp
, raises
, inlinep
;
8625 cp_error ("`%D' declared as a `virtual' %s", object
, type
);
8627 cp_error ("`%D' declared as an `inline' %s", object
, type
);
8629 cp_error ("`const' and `volatile' function specifiers on `%D' invalid in %s declaration",
8632 cp_error_at ("`%D' declared as a friend", object
);
8634 cp_error_at ("`%D' declared with an exception specification", object
);
8637 /* CTYPE is class type, or null if non-class.
8638 TYPE is type this FUNCTION_DECL should have, either FUNCTION_TYPE
8640 DECLARATOR is the function's name.
8641 VIRTUALP is truthvalue of whether the function is virtual or not.
8642 FLAGS are to be passed through to `grokclassfn'.
8643 QUALS are qualifiers indicating whether the function is `const'
8645 RAISES is a list of exceptions that this function can raise.
8646 CHECK is 1 if we must find this method in CTYPE, 0 if we should
8647 not look, and -1 if we should not call `grokclassfn' at all.
8649 Returns `NULL_TREE' if something goes wrong, after issuing
8650 applicable error messages. */
8653 grokfndecl (ctype
, type
, declarator
, orig_declarator
, virtualp
, flags
, quals
,
8654 raises
, check
, friendp
, publicp
, inlinep
, funcdef_flag
,
8655 template_count
, in_namespace
)
8658 tree orig_declarator
;
8660 enum overload_flags flags
;
8662 int check
, friendp
, publicp
, inlinep
, funcdef_flag
, template_count
;
8666 int staticp
= ctype
&& TREE_CODE (type
) == FUNCTION_TYPE
;
8667 int has_default_arg
= 0;
8671 cname
= TREE_CODE (TYPE_NAME (ctype
)) == TYPE_DECL
8672 ? TYPE_IDENTIFIER (ctype
) : TYPE_NAME (ctype
);
8678 type
= build_exception_variant (type
, raises
);
8681 decl
= build_lang_decl (FUNCTION_DECL
, declarator
, type
);
8682 /* Propagate volatile out from type to decl. */
8683 if (TYPE_VOLATILE (type
))
8684 TREE_THIS_VOLATILE (decl
) = 1;
8686 /* If this decl has namespace scope, set that up. */
8688 set_decl_namespace (decl
, in_namespace
, friendp
);
8690 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
8692 /* `main' and builtins have implicit 'C' linkage. */
8693 if ((MAIN_NAME_P (declarator
)
8694 || (IDENTIFIER_LENGTH (declarator
) > 10
8695 && IDENTIFIER_POINTER (declarator
)[0] == '_'
8696 && IDENTIFIER_POINTER (declarator
)[1] == '_'
8697 && strncmp (IDENTIFIER_POINTER (declarator
)+2, "builtin_", 8) == 0))
8698 && current_lang_name
== lang_name_cplusplus
8699 && ctype
== NULL_TREE
8700 /* NULL_TREE means global namespace. */
8701 && DECL_CONTEXT (decl
) == NULL_TREE
)
8702 DECL_LANGUAGE (decl
) = lang_c
;
8704 /* Should probably propagate const out from type to decl I bet (mrs). */
8707 DECL_STATIC_FUNCTION_P (decl
) = 1;
8708 DECL_CONTEXT (decl
) = ctype
;
8712 DECL_CONTEXT (decl
) = ctype
;
8714 if (ctype
== NULL_TREE
&& DECL_MAIN_P (decl
))
8716 if (processing_template_decl
)
8717 error ("cannot declare `::main' to be a template");
8719 error ("cannot declare `::main' to be inline");
8721 error ("cannot declare `::main' to be static");
8722 if (!same_type_p (TREE_TYPE (TREE_TYPE (decl
)),
8724 error ("`main' must return `int'");
8729 /* Members of anonymous types and local classes have no linkage; make
8731 if (ctype
&& (ANON_AGGRNAME_P (TYPE_IDENTIFIER (ctype
))
8732 || decl_function_context (TYPE_MAIN_DECL (ctype
))))
8737 /* [basic.link]: A name with no linkage (notably, the name of a class
8738 or enumeration declared in a local scope) shall not be used to
8739 declare an entity with linkage.
8741 Only check this for public decls for now. */
8742 t
= no_linkage_check (TREE_TYPE (decl
));
8745 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
8747 if (DECL_EXTERN_C_P (decl
))
8748 /* Allow this; it's pretty common in C. */;
8750 cp_pedwarn ("non-local function `%#D' uses anonymous type",
8754 cp_pedwarn ("non-local function `%#D' uses local type `%T'",
8759 TREE_PUBLIC (decl
) = publicp
;
8762 DECL_INTERFACE_KNOWN (decl
) = 1;
8763 DECL_NOT_REALLY_EXTERN (decl
) = 1;
8767 DECL_THIS_INLINE (decl
) = DECL_INLINE (decl
) = 1;
8769 DECL_EXTERNAL (decl
) = 1;
8770 if (quals
!= NULL_TREE
&& TREE_CODE (type
) == FUNCTION_TYPE
)
8772 cp_error ("%smember function `%D' cannot have `%T' method qualifier",
8773 (ctype
? "static " : "non-"), decl
, TREE_VALUE (quals
));
8777 if (IDENTIFIER_OPNAME_P (DECL_NAME (decl
)))
8778 grok_op_properties (decl
, virtualp
, check
< 0);
8780 if (ctype
&& decl_function_context (decl
))
8781 DECL_NO_STATIC_CHAIN (decl
) = 1;
8783 for (t
= TYPE_ARG_TYPES (TREE_TYPE (decl
)); t
; t
= TREE_CHAIN (t
))
8784 if (TREE_PURPOSE (t
)
8785 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
8787 has_default_arg
= 1;
8792 && TREE_CODE (orig_declarator
) == TEMPLATE_ID_EXPR
)
8796 ("defining explicit specialization `%D' in friend declaration",
8800 tree fns
= TREE_OPERAND (orig_declarator
, 0);
8801 tree args
= TREE_OPERAND (orig_declarator
, 1);
8803 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
8805 /* Something like `template <class T> friend void f<T>()'. */
8806 cp_error ("invalid use of template-id `%D' in declaration of primary template",
8812 /* A friend declaration of the form friend void f<>(). Record
8813 the information in the TEMPLATE_ID_EXPR. */
8814 SET_DECL_IMPLICIT_INSTANTIATION (decl
);
8816 if (TREE_CODE (fns
) == COMPONENT_REF
)
8818 /* Due to bison parser ickiness, we will have already looked
8819 up an operator_name or PFUNCNAME within the current class
8820 (see template_id in parse.y). If the current class contains
8821 such a name, we'll get a COMPONENT_REF here. Undo that. */
8823 my_friendly_assert (TREE_TYPE (TREE_OPERAND (fns
, 0))
8824 == current_class_type
, 20001120);
8825 fns
= TREE_OPERAND (fns
, 1);
8827 my_friendly_assert (TREE_CODE (fns
) == IDENTIFIER_NODE
8828 || TREE_CODE (fns
) == LOOKUP_EXPR
8829 || TREE_CODE (fns
) == OVERLOAD
, 20001120);
8830 DECL_TEMPLATE_INFO (decl
) = tree_cons (fns
, args
, NULL_TREE
);
8832 if (has_default_arg
)
8834 cp_error ("default arguments are not allowed in declaration of friend template specialization `%D'",
8841 cp_error ("`inline' is not allowed in declaration of friend template specialization `%D'",
8848 if (has_default_arg
)
8849 add_defarg_fn (decl
);
8851 /* Plain overloading: will not be grok'd by grokclassfn. */
8852 if (! ctype
&& ! processing_template_decl
8853 && (! DECL_EXTERN_C_P (decl
) || DECL_OVERLOADED_OPERATOR_P (decl
))
8854 && (! DECL_USE_TEMPLATE (decl
) || name_mangling_version
< 1))
8855 set_mangled_name_for_decl (decl
);
8858 /* Make the init_value nonzero so pushdecl knows this is not
8859 tentative. error_mark_node is replaced later with the BLOCK. */
8860 DECL_INITIAL (decl
) = error_mark_node
;
8862 if (TYPE_NOTHROW_P (type
) || nothrow_libfn_p (decl
))
8863 TREE_NOTHROW (decl
) = 1;
8865 /* Caller will do the rest of this. */
8869 if (flags
== NO_SPECIAL
&& ctype
&& constructor_name (cname
) == declarator
)
8870 DECL_CONSTRUCTOR_P (decl
) = 1;
8872 /* Function gets the ugly name, field gets the nice one. This call
8873 may change the type of the function (because of default
8875 if (ctype
!= NULL_TREE
)
8876 grokclassfn (ctype
, decl
, flags
, quals
);
8878 decl
= check_explicit_specialization (orig_declarator
, decl
,
8880 2 * (funcdef_flag
!= 0) +
8881 4 * (friendp
!= 0));
8882 if (decl
== error_mark_node
)
8885 if (ctype
!= NULL_TREE
8886 && (! TYPE_FOR_JAVA (ctype
) || check_java_method (decl
))
8891 old_decl
= check_classfn (ctype
, decl
);
8893 if (old_decl
&& TREE_CODE (old_decl
) == TEMPLATE_DECL
)
8894 /* Because grokfndecl is always supposed to return a
8895 FUNCTION_DECL, we pull out the DECL_TEMPLATE_RESULT
8896 here. We depend on our callers to figure out that its
8897 really a template that's being returned. */
8898 old_decl
= DECL_TEMPLATE_RESULT (old_decl
);
8900 if (old_decl
&& DECL_STATIC_FUNCTION_P (old_decl
)
8901 && TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
)
8903 /* Remove the `this' parm added by grokclassfn.
8904 XXX Isn't this done in start_function, too? */
8905 revert_static_member_fn (decl
);
8906 last_function_parms
= TREE_CHAIN (last_function_parms
);
8908 if (old_decl
&& DECL_ARTIFICIAL (old_decl
))
8909 cp_error ("definition of implicitly-declared `%D'", old_decl
);
8913 /* Since we've smashed OLD_DECL to its
8914 DECL_TEMPLATE_RESULT, we must do the same to DECL. */
8915 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
8916 decl
= DECL_TEMPLATE_RESULT (decl
);
8918 /* Attempt to merge the declarations. This can fail, in
8919 the case of some illegal specialization declarations. */
8920 if (!duplicate_decls (decl
, old_decl
))
8921 cp_error ("no `%#D' member function declared in class `%T'",
8927 if (DECL_CONSTRUCTOR_P (decl
) && !grok_ctor_properties (ctype
, decl
))
8930 if (ctype
== NULL_TREE
|| check
)
8934 DECL_VIRTUAL_P (decl
) = 1;
8940 grokvardecl (type
, declarator
, specbits_in
, initialized
, constp
, in_namespace
)
8943 RID_BIT_TYPE
*specbits_in
;
8949 RID_BIT_TYPE specbits
;
8951 specbits
= *specbits_in
;
8953 if (TREE_CODE (type
) == OFFSET_TYPE
)
8955 /* If you declare a static member so that it
8956 can be initialized, the code will reach here. */
8957 tree basetype
= TYPE_OFFSET_BASETYPE (type
);
8958 type
= TREE_TYPE (type
);
8959 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8960 DECL_CONTEXT (decl
) = basetype
;
8961 /* DECL_ASSEMBLER_NAME is needed only for full-instantiated
8963 if (!uses_template_parms (decl
))
8966 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
8968 DECL_ASSEMBLER_NAME (decl
) = build_static_name (basetype
,
8977 context
= in_namespace
;
8978 else if (namespace_bindings_p () || RIDBIT_SETP (RID_EXTERN
, specbits
))
8979 context
= current_namespace
;
8981 context
= NULL_TREE
;
8983 if (processing_template_decl
&& context
)
8984 /* For global variables, declared in a template, we need the
8986 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
8988 decl
= build_decl (VAR_DECL
, declarator
, type
);
8991 set_decl_namespace (decl
, context
, 0);
8993 context
= DECL_CONTEXT (decl
);
8994 if (declarator
&& context
&& current_lang_name
!= lang_name_c
)
8997 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
8999 DECL_ASSEMBLER_NAME (decl
)
9000 = build_static_name (context
, declarator
);
9005 set_decl_namespace (decl
, in_namespace
, 0);
9007 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
9009 DECL_THIS_EXTERN (decl
) = 1;
9010 DECL_EXTERNAL (decl
) = !initialized
;
9013 /* In class context, static means one per class,
9014 public access, and static storage. */
9015 if (DECL_CLASS_SCOPE_P (decl
))
9017 TREE_PUBLIC (decl
) = 1;
9018 TREE_STATIC (decl
) = 1;
9019 DECL_EXTERNAL (decl
) = 0;
9021 /* At top level, either `static' or no s.c. makes a definition
9022 (perhaps tentative), and absence of `static' makes it public. */
9023 else if (toplevel_bindings_p ())
9025 TREE_PUBLIC (decl
) = (RIDBIT_NOTSETP (RID_STATIC
, specbits
)
9026 && (DECL_THIS_EXTERN (decl
) || ! constp
));
9027 TREE_STATIC (decl
) = ! DECL_EXTERNAL (decl
);
9029 /* Not at top level, only `static' makes a static definition. */
9032 TREE_STATIC (decl
) = !! RIDBIT_SETP (RID_STATIC
, specbits
);
9033 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
);
9036 if (TREE_PUBLIC (decl
))
9038 /* [basic.link]: A name with no linkage (notably, the name of a class
9039 or enumeration declared in a local scope) shall not be used to
9040 declare an entity with linkage.
9042 Only check this for public decls for now. */
9043 tree t
= no_linkage_check (TREE_TYPE (decl
));
9046 if (ANON_AGGRNAME_P (TYPE_IDENTIFIER (t
)))
9047 /* Ignore for now; `enum { foo } e' is pretty common. */;
9049 cp_pedwarn ("non-local variable `%#D' uses local type `%T'",
9057 /* Create and return a canonical pointer to member function type, for
9058 TYPE, which is a POINTER_TYPE to a METHOD_TYPE. */
9061 build_ptrmemfunc_type (type
)
9067 tree unqualified_variant
= NULL_TREE
;
9069 if (type
== error_mark_node
)
9072 /* If a canonical type already exists for this type, use it. We use
9073 this method instead of type_hash_canon, because it only does a
9074 simple equality check on the list of field members. */
9076 if ((t
= TYPE_GET_PTRMEMFUNC_TYPE (type
)))
9079 /* Make sure that we always have the unqualified pointer-to-member
9081 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9083 = build_ptrmemfunc_type (TYPE_MAIN_VARIANT (type
));
9085 t
= make_aggr_type (RECORD_TYPE
);
9086 /* Let the front-end know this is a pointer to member function... */
9087 TYPE_PTRMEMFUNC_FLAG (t
) = 1;
9088 /* ... and not really an aggregate. */
9089 SET_IS_AGGR_TYPE (t
, 0);
9093 u
= make_aggr_type (UNION_TYPE
);
9094 SET_IS_AGGR_TYPE (u
, 0);
9095 fields
[0] = build_decl (FIELD_DECL
, pfn_identifier
, type
);
9096 fields
[1] = build_decl (FIELD_DECL
, delta2_identifier
,
9098 finish_builtin_type (u
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9099 TYPE_NAME (u
) = NULL_TREE
;
9101 fields
[0] = build_decl (FIELD_DECL
, delta_identifier
,
9103 fields
[1] = build_decl (FIELD_DECL
, index_identifier
,
9105 fields
[2] = build_decl (FIELD_DECL
, pfn_or_delta2_identifier
, u
);
9106 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 2, ptr_type_node
);
9110 fields
[0] = build_decl (FIELD_DECL
, pfn_identifier
, type
);
9111 fields
[1] = build_decl (FIELD_DECL
, delta_identifier
,
9113 finish_builtin_type (t
, "__ptrmemfunc_type", fields
, 1, ptr_type_node
);
9116 /* Zap out the name so that the back-end will give us the debugging
9117 information for this anonymous RECORD_TYPE. */
9118 TYPE_NAME (t
) = NULL_TREE
;
9120 /* If this is not the unqualified form of this pointer-to-member
9121 type, set the TYPE_MAIN_VARIANT for this type to be the
9122 unqualified type. Since they are actually RECORD_TYPEs that are
9123 not variants of each other, we must do this manually. */
9124 if (CP_TYPE_QUALS (type
) != TYPE_UNQUALIFIED
)
9126 t
= build_qualified_type (t
, CP_TYPE_QUALS (type
));
9127 TYPE_MAIN_VARIANT (t
) = unqualified_variant
;
9128 TYPE_NEXT_VARIANT (t
) = TYPE_NEXT_VARIANT (unqualified_variant
);
9129 TYPE_NEXT_VARIANT (unqualified_variant
) = t
;
9132 /* Cache this pointer-to-member type so that we can find it again
9134 TYPE_SET_PTRMEMFUNC_TYPE (type
, t
);
9136 /* Seems to be wanted. */
9137 CLASSTYPE_GOT_SEMICOLON (t
) = 1;
9142 /* DECL is a VAR_DECL defined in-class, whose TYPE is also given.
9143 Check to see that the definition is valid. Issue appropriate error
9144 messages. Return 1 if the definition is particularly bad, or 0
9148 check_static_variable_definition (decl
, type
)
9152 /* Motion 10 at San Diego: If a static const integral data member is
9153 initialized with an integral constant expression, the initializer
9154 may appear either in the declaration (within the class), or in
9155 the definition, but not both. If it appears in the class, the
9156 member is a member constant. The file-scope definition is always
9158 if (CLASS_TYPE_P (type
) || TREE_CODE (type
) == REFERENCE_TYPE
)
9160 cp_error ("invalid in-class initialization of static data member of non-integral type `%T'",
9162 /* If we just return the declaration, crashes will sometimes
9163 occur. We therefore return void_type_node, as if this was a
9164 friend declaration, to cause callers to completely ignore
9165 this declaration. */
9168 else if (!CP_TYPE_CONST_P (type
))
9169 cp_error ("ISO C++ forbids in-class initialization of non-const static member `%D'",
9171 else if (pedantic
&& !INTEGRAL_TYPE_P (type
))
9172 cp_pedwarn ("ISO C++ forbids initialization of member constant `%D' of non-integral type `%T'", decl
, type
);
9177 /* Given the SIZE (i.e., number of elements) in an array, compute an
9178 appropriate index type for the array. If non-NULL, NAME is the
9179 name of the thing being declared. */
9182 compute_array_index_type (name
, size
)
9188 /* The size might be the result of a cast. */
9189 STRIP_TYPE_NOPS (size
);
9191 /* It might be a const variable or enumeration constant. */
9192 size
= decl_constant_value (size
);
9194 /* If this involves a template parameter, it will be a constant at
9195 instantiation time, but we don't know what the value is yet.
9196 Even if no template parameters are involved, we may an expression
9197 that is not a constant; we don't even simplify `1 + 2' when
9198 processing a template. */
9199 if (processing_template_decl
)
9201 /* Resolve a qualified reference to an enumerator or static
9202 const data member of ours. */
9203 if (TREE_CODE (size
) == SCOPE_REF
9204 && TREE_OPERAND (size
, 0) == current_class_type
)
9206 tree t
= lookup_field (current_class_type
,
9207 TREE_OPERAND (size
, 1), 0, 0);
9212 return build_index_type (build_min (MINUS_EXPR
, sizetype
,
9213 size
, integer_one_node
));
9216 /* The array bound must be an integer type. */
9217 if (TREE_CODE (TREE_TYPE (size
)) != INTEGER_TYPE
9218 && TREE_CODE (TREE_TYPE (size
)) != ENUMERAL_TYPE
9219 && TREE_CODE (TREE_TYPE (size
)) != BOOLEAN_TYPE
)
9222 cp_error ("size of array `%D' has non-integer type", name
);
9224 cp_error ("size of array has non-integer type");
9225 size
= integer_one_node
;
9228 /* Normally, the array-bound will be a constant. */
9229 if (TREE_CODE (size
) == INTEGER_CST
)
9231 /* Check to see if the array bound overflowed. Make that an
9232 error, no matter how generous we're being. */
9233 int old_flag_pedantic_errors
= flag_pedantic_errors
;
9234 int old_pedantic
= pedantic
;
9235 pedantic
= flag_pedantic_errors
= 1;
9236 constant_expression_warning (size
);
9237 pedantic
= old_pedantic
;
9238 flag_pedantic_errors
= old_flag_pedantic_errors
;
9240 /* An array must have a positive number of elements. */
9241 if (INT_CST_LT (size
, integer_zero_node
))
9244 cp_error ("size of array `%D' is negative", name
);
9246 cp_error ("size of array is negative");
9247 size
= integer_one_node
;
9249 /* Except that an extension we allow zero-sized arrays. We
9250 always allow them in system headers because glibc uses
9252 else if (integer_zerop (size
) && pedantic
&& !in_system_header
)
9255 cp_pedwarn ("ISO C++ forbids zero-size array `%D'", name
);
9257 cp_pedwarn ("ISO C++ forbids zero-size array");
9260 else if (TREE_CONSTANT (size
))
9262 /* `(int) &fn' is not a valid array bound. */
9264 cp_error ("size of array `%D' is not an integral constant-expression",
9267 cp_error ("size of array is not an integral constant-expression");
9270 /* Compute the index of the largest element in the array. It is
9271 one less than the number of elements in the array. */
9273 = fold (cp_build_binary_op (MINUS_EXPR
,
9274 cp_convert (ssizetype
, size
),
9275 cp_convert (ssizetype
,
9276 integer_one_node
)));
9278 /* Check for variable-sized arrays. We allow such things as an
9279 extension, even though they are not allowed in ANSI/ISO C++. */
9280 if (!TREE_CONSTANT (itype
))
9285 cp_pedwarn ("ISO C++ forbids variable-size array `%D'",
9288 cp_pedwarn ("ISO C++ forbids variable-size array");
9291 /* Create a variable-sized array index type. */
9292 itype
= variable_size (itype
);
9294 /* Make sure that there was no overflow when creating to a signed
9295 index type. (For example, on a 32-bit machine, an array with
9296 size 2^32 - 1 is too big.) */
9297 else if (TREE_OVERFLOW (itype
))
9299 error ("overflow in array dimension");
9300 TREE_OVERFLOW (itype
) = 0;
9303 /* Create and return the appropriate index type. */
9304 return build_index_type (itype
);
9307 /* Returns an ARRAY_TYPE for an array with SIZE elements of the
9308 indicated TYPE. If non-NULL, NAME is the NAME of the declaration
9312 create_array_type_for_decl (name
, type
, size
)
9317 tree itype
= NULL_TREE
;
9318 const char* error_msg
;
9320 /* If things have already gone awry, bail now. */
9321 if (type
== error_mark_node
|| size
== error_mark_node
)
9322 return error_mark_node
;
9324 /* Assume that everything will go OK. */
9327 /* There are some types which cannot be array elements. */
9328 switch (TREE_CODE (type
))
9331 error_msg
= "array of void";
9335 error_msg
= "array of functions";
9338 case REFERENCE_TYPE
:
9339 error_msg
= "array of references";
9343 error_msg
= "array of data members";
9347 error_msg
= "array of function members";
9354 /* If something went wrong, issue an error-message and return. */
9358 cp_error ("declaration of `%D' as %s", name
, error_msg
);
9360 cp_error ("creating %s", error_msg
);
9362 return error_mark_node
;
9367 The constant expressions that specify the bounds of the arrays
9368 can be omitted only for the first member of the sequence. */
9369 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
9371 cp_error ("declaration of `%D' as multidimensional array must have bounds for all dimensions except the first",
9374 return error_mark_node
;
9377 /* Figure out the index type for the array. */
9379 itype
= compute_array_index_type (name
, size
);
9381 return build_cplus_array_type (type
, itype
);
9384 /* Check that it's OK to declare a function with the indicated TYPE.
9385 SFK indicates the kind of special function (if any) that this
9386 function is. CTYPE is the class of which this function is a
9387 member. OPTYPE is the type given in a conversion operator
9388 declaration. Returns the actual return type of the function; that
9389 may be different than TYPE if an error occurs, or for certain
9390 special functions. */
9393 check_special_function_return_type (sfk
, type
, ctype
, optype
)
9394 special_function_kind sfk
;
9401 case sfk_constructor
:
9403 cp_error ("return type specification for constructor invalid");
9405 /* In the old ABI, we return `this'; in the new ABI we don't
9407 type
= flag_new_abi
? void_type_node
: build_pointer_type (ctype
);
9410 case sfk_destructor
:
9412 cp_error ("return type specification for destructor invalid");
9413 type
= void_type_node
;
9416 case sfk_conversion
:
9417 if (type
&& !same_type_p (type
, optype
))
9418 cp_error ("operator `%T' declared to return `%T'", optype
, type
);
9420 cp_pedwarn ("return type specified for `operator %T'", optype
);
9425 my_friendly_abort (20000408);
9432 /* Given declspecs and a declarator,
9433 determine the name and type of the object declared
9434 and construct a ..._DECL node for it.
9435 (In one case we can return a ..._TYPE node instead.
9436 For invalid input we sometimes return 0.)
9438 DECLSPECS is a chain of tree_list nodes whose value fields
9439 are the storage classes and type specifiers.
9441 DECL_CONTEXT says which syntactic context this declaration is in:
9442 NORMAL for most contexts. Make a VAR_DECL or FUNCTION_DECL or TYPE_DECL.
9443 FUNCDEF for a function definition. Like NORMAL but a few different
9444 error messages in each case. Return value may be zero meaning
9445 this definition is too screwy to try to parse.
9446 MEMFUNCDEF for a function definition. Like FUNCDEF but prepares to
9447 handle member functions (which have FIELD context).
9448 Return value may be zero meaning this definition is too screwy to
9450 PARM for a parameter declaration (either within a function prototype
9451 or before a function body). Make a PARM_DECL, or return void_type_node.
9452 CATCHPARM for a parameter declaration before a catch clause.
9453 TYPENAME if for a typename (in a cast or sizeof).
9454 Don't make a DECL node; just return the ..._TYPE node.
9455 FIELD for a struct or union field; make a FIELD_DECL.
9456 BITFIELD for a field with specified width.
9457 INITIALIZED is 1 if the decl has an initializer.
9459 ATTRLIST is a TREE_LIST node with prefix attributes in TREE_VALUE and
9460 normal attributes in TREE_PURPOSE, or NULL_TREE.
9462 In the TYPENAME case, DECLARATOR is really an abstract declarator.
9463 It may also be so in the PARM case, for a prototype where the
9464 argument type is specified but not the name.
9466 This function is where the complicated C meanings of `static'
9467 and `extern' are interpreted.
9469 For C++, if there is any monkey business to do, the function which
9470 calls this one must do it, i.e., prepending instance variables,
9471 renaming overloaded function names, etc.
9473 Note that for this C++, it is an error to define a method within a class
9474 which does not belong to that class.
9476 Except in the case where SCOPE_REFs are implicitly known (such as
9477 methods within a class being redundantly qualified),
9478 declarations which involve SCOPE_REFs are returned as SCOPE_REFs
9479 (class_name::decl_name). The caller must also deal with this.
9481 If a constructor or destructor is seen, and the context is FIELD,
9482 then the type gains the attribute TREE_HAS_x. If such a declaration
9483 is erroneous, NULL_TREE is returned.
9485 QUALS is used only for FUNCDEF and MEMFUNCDEF cases. For a member
9486 function, these are the qualifiers to give to the `this' pointer. We
9487 apply TYPE_QUAL_RESTRICT to the this ptr, not the object.
9489 May return void_type_node if the declarator turned out to be a friend.
9490 See grokfield for details. */
9493 grokdeclarator (declarator
, declspecs
, decl_context
, initialized
, attrlist
)
9496 enum decl_context decl_context
;
9500 RID_BIT_TYPE specbits
;
9503 tree type
= NULL_TREE
;
9509 int virtualp
, explicitp
, friendp
, inlinep
, staticp
;
9510 int explicit_int
= 0;
9511 int explicit_char
= 0;
9512 int defaulted_int
= 0;
9513 tree typedef_decl
= NULL_TREE
;
9515 tree typedef_type
= NULL_TREE
;
9516 int funcdef_flag
= 0;
9517 enum tree_code innermost_code
= ERROR_MARK
;
9520 /* See the code below that used this. */
9521 tree decl_machine_attr
= NULL_TREE
;
9523 /* Set this to error_mark_node for FIELD_DECLs we could not handle properly.
9524 All FIELD_DECLs we build here have `init' put into their DECL_INITIAL. */
9525 tree init
= NULL_TREE
;
9527 /* Keep track of what sort of function is being processed
9528 so that we can warn about default return values, or explicit
9529 return values which do not match prescribed defaults. */
9530 special_function_kind sfk
= sfk_none
;
9532 tree dname
= NULL_TREE
;
9533 tree ctype
= current_class_type
;
9534 tree ctor_return_type
= NULL_TREE
;
9535 enum overload_flags flags
= NO_SPECIAL
;
9536 tree quals
= NULL_TREE
;
9537 tree raises
= NULL_TREE
;
9538 int template_count
= 0;
9539 tree in_namespace
= NULL_TREE
;
9543 RIDBIT_RESET_ALL (specbits
);
9544 if (decl_context
== FUNCDEF
)
9545 funcdef_flag
= 1, decl_context
= NORMAL
;
9546 else if (decl_context
== MEMFUNCDEF
)
9547 funcdef_flag
= -1, decl_context
= FIELD
;
9548 else if (decl_context
== BITFIELD
)
9549 bitfield
= 1, decl_context
= FIELD
;
9551 /* Look inside a declarator for the name being declared
9552 and get it as a string, for an error message. */
9554 tree
*next
= &declarator
;
9558 while (next
&& *next
)
9561 switch (TREE_CODE (decl
))
9564 /* For attributes. */
9565 next
= &TREE_VALUE (decl
);
9570 next
= &TREE_OPERAND (decl
, 0);
9573 case BIT_NOT_EXPR
: /* For C++ destructors! */
9575 tree name
= TREE_OPERAND (decl
, 0);
9576 tree rename
= NULL_TREE
;
9578 my_friendly_assert (flags
== NO_SPECIAL
, 152);
9580 sfk
= sfk_destructor
;
9581 if (TREE_CODE (name
) == TYPE_DECL
)
9582 TREE_OPERAND (decl
, 0) = name
= constructor_name (name
);
9583 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 153);
9584 if (ctype
== NULL_TREE
)
9586 if (current_class_type
== NULL_TREE
)
9588 error ("destructors must be member functions");
9593 tree t
= constructor_name (current_class_name
);
9600 tree t
= constructor_name (ctype
);
9607 cp_error ("destructor `%T' must match class name `%T'",
9609 TREE_OPERAND (decl
, 0) = rename
;
9615 case ADDR_EXPR
: /* C++ reference declaration */
9620 innermost_code
= TREE_CODE (decl
);
9621 next
= &TREE_OPERAND (decl
, 0);
9625 if (parmlist_is_exprlist (CALL_DECLARATOR_PARMS (decl
)))
9627 /* This is actually a variable declaration using
9628 constructor syntax. We need to call start_decl and
9629 cp_finish_decl so we can get the variable
9632 tree attributes
, prefix_attributes
;
9634 *next
= TREE_OPERAND (decl
, 0);
9635 init
= CALL_DECLARATOR_PARMS (decl
);
9639 attributes
= TREE_PURPOSE (attrlist
);
9640 prefix_attributes
= TREE_VALUE (attrlist
);
9644 attributes
= NULL_TREE
;
9645 prefix_attributes
= NULL_TREE
;
9648 decl
= start_decl (declarator
, declspecs
, 1,
9649 attributes
, prefix_attributes
);
9650 decl_type_access_control (decl
);
9653 /* Look for __unused__ attribute */
9654 if (TREE_USED (TREE_TYPE (decl
)))
9655 TREE_USED (decl
) = 1;
9656 finish_decl (decl
, init
, NULL_TREE
);
9659 cp_error ("invalid declarator");
9662 innermost_code
= TREE_CODE (decl
);
9663 if (decl_context
== FIELD
&& ctype
== NULL_TREE
)
9664 ctype
= current_class_type
;
9666 && TREE_OPERAND (decl
, 0)
9667 && (TREE_CODE (TREE_OPERAND (decl
, 0)) == TYPE_DECL
9668 && ((DECL_NAME (TREE_OPERAND (decl
, 0))
9669 == constructor_name_full (ctype
))
9670 || (DECL_NAME (TREE_OPERAND (decl
, 0))
9671 == constructor_name (ctype
)))))
9672 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9673 next
= &TREE_OPERAND (decl
, 0);
9675 if (ctype
!= NULL_TREE
9676 && decl
!= NULL_TREE
&& flags
!= DTOR_FLAG
9677 && decl
== constructor_name (ctype
))
9679 sfk
= sfk_constructor
;
9680 ctor_return_type
= ctype
;
9685 case TEMPLATE_ID_EXPR
:
9687 tree fns
= TREE_OPERAND (decl
, 0);
9689 if (TREE_CODE (fns
) == LOOKUP_EXPR
)
9690 fns
= TREE_OPERAND (fns
, 0);
9693 if (TREE_CODE (dname
) == COMPONENT_REF
)
9694 dname
= TREE_OPERAND (dname
, 1);
9695 if (TREE_CODE (dname
) != IDENTIFIER_NODE
)
9697 my_friendly_assert (is_overloaded_fn (dname
),
9699 dname
= DECL_NAME (get_first_fn (dname
));
9704 case IDENTIFIER_NODE
:
9705 if (TREE_CODE (decl
) == IDENTIFIER_NODE
)
9710 if (C_IS_RESERVED_WORD (dname
))
9712 cp_error ("declarator-id missing; using reserved word `%D'",
9714 name
= IDENTIFIER_POINTER (dname
);
9716 else if (!IDENTIFIER_TYPENAME_P (dname
))
9717 name
= IDENTIFIER_POINTER (dname
);
9720 my_friendly_assert (flags
== NO_SPECIAL
, 154);
9721 flags
= TYPENAME_FLAG
;
9722 ctor_return_type
= TREE_TYPE (dname
);
9723 sfk
= sfk_conversion
;
9724 if (IDENTIFIER_GLOBAL_VALUE (dname
)
9725 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (dname
))
9727 name
= IDENTIFIER_POINTER (dname
);
9729 name
= "<invalid operator>";
9736 /* Perform error checking, and decide on a ctype. */
9737 tree cname
= TREE_OPERAND (decl
, 0);
9738 if (cname
== NULL_TREE
)
9740 else if (TREE_CODE (cname
) == NAMESPACE_DECL
)
9743 in_namespace
= TREE_OPERAND (decl
, 0);
9744 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9746 else if (! is_aggr_type (cname
, 1))
9747 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9748 /* Must test TREE_OPERAND (decl, 1), in case user gives
9749 us `typedef (class::memfunc)(int); memfunc *memfuncptr;' */
9750 else if (TREE_OPERAND (decl
, 1)
9751 && TREE_CODE (TREE_OPERAND (decl
, 1)) == INDIRECT_REF
)
9753 else if (TREE_CODE (cname
) == TEMPLATE_TYPE_PARM
9754 || TREE_CODE (cname
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
9756 cp_error ("`%T::%D' is not a valid declarator", cname
,
9757 TREE_OPERAND (decl
, 1));
9758 cp_error (" perhaps you want `typename %T::%D' to make it a type",
9759 cname
, TREE_OPERAND (decl
, 1));
9760 return void_type_node
;
9762 else if (ctype
== NULL_TREE
)
9764 else if (TREE_COMPLEXITY (decl
) == current_class_depth
)
9765 TREE_OPERAND (decl
, 0) = ctype
;
9768 if (! UNIQUELY_DERIVED_FROM_P (cname
, ctype
))
9770 cp_error ("type `%T' is not derived from type `%T'",
9772 TREE_OPERAND (decl
, 0) = NULL_TREE
;
9778 if (ctype
&& TREE_CODE (TREE_OPERAND (decl
, 1)) == TYPE_DECL
9779 && ((DECL_NAME (TREE_OPERAND (decl
, 1))
9780 == constructor_name_full (ctype
))
9781 || (DECL_NAME (TREE_OPERAND (decl
, 1))
9782 == constructor_name (ctype
))))
9783 TREE_OPERAND (decl
, 1) = constructor_name (ctype
);
9784 next
= &TREE_OPERAND (decl
, 1);
9788 if (TREE_CODE (decl
) == IDENTIFIER_NODE
9789 && constructor_name (ctype
) == decl
)
9791 sfk
= sfk_constructor
;
9792 ctor_return_type
= ctype
;
9794 else if (TREE_CODE (decl
) == BIT_NOT_EXPR
9795 && TREE_CODE (TREE_OPERAND (decl
, 0)) == IDENTIFIER_NODE
9796 && (constructor_name (ctype
) == TREE_OPERAND (decl
, 0)
9797 || constructor_name_full (ctype
) == TREE_OPERAND (decl
, 0)))
9799 sfk
= sfk_destructor
;
9800 ctor_return_type
= ctype
;
9802 TREE_OPERAND (decl
, 0) = constructor_name (ctype
);
9803 next
= &TREE_OPERAND (decl
, 0);
9814 /* Parse error puts this typespec where
9815 a declarator should go. */
9816 cp_error ("`%T' specified as declarator-id", DECL_NAME (decl
));
9817 if (TREE_TYPE (decl
) == current_class_type
)
9818 cp_error (" perhaps you want `%T' for a constructor",
9819 current_class_name
);
9820 dname
= DECL_NAME (decl
);
9821 name
= IDENTIFIER_POINTER (dname
);
9823 /* Avoid giving two errors for this. */
9824 IDENTIFIER_CLASS_VALUE (dname
) = NULL_TREE
;
9826 declspecs
= tree_cons (NULL_TREE
, integer_type_node
, declspecs
);
9832 cp_compiler_error ("`%D' as declarator", decl
);
9833 return 0; /* We used to do a 155 abort here. */
9838 /* A function definition's declarator must have the form of
9839 a function declarator. */
9841 if (funcdef_flag
&& innermost_code
!= CALL_EXPR
)
9844 if (((dname
&& IDENTIFIER_OPNAME_P (dname
)) || flags
== TYPENAME_FLAG
)
9845 && innermost_code
!= CALL_EXPR
9846 && ! (ctype
&& declspecs
== NULL_TREE
))
9848 cp_error ("declaration of `%D' as non-function", dname
);
9849 return void_type_node
;
9852 /* Anything declared one level down from the top level
9853 must be one of the parameters of a function
9854 (because the body is at least two levels down). */
9856 /* This heuristic cannot be applied to C++ nodes! Fixed, however,
9857 by not allowing C++ class definitions to specify their parameters
9858 with xdecls (must be spec.d in the parmlist).
9860 Since we now wait to push a class scope until we are sure that
9861 we are in a legitimate method context, we must set oldcname
9862 explicitly (since current_class_name is not yet alive).
9864 We also want to avoid calling this a PARM if it is in a namespace. */
9866 if (decl_context
== NORMAL
&& !toplevel_bindings_p ())
9868 struct binding_level
*b
= current_binding_level
;
9869 current_binding_level
= b
->level_chain
;
9870 if (current_binding_level
!= 0 && toplevel_bindings_p ())
9871 decl_context
= PARM
;
9872 current_binding_level
= b
;
9876 name
= decl_context
== PARM
? "parameter" : "type name";
9878 /* Look through the decl specs and record which ones appear.
9879 Some typespecs are defined as built-in typenames.
9880 Others, the ones that are modifiers of other types,
9881 are represented by bits in SPECBITS: set the bits for
9882 the modifiers that appear. Storage class keywords are also in SPECBITS.
9884 If there is a typedef name or a type, store the type in TYPE.
9885 This includes builtin typedefs such as `int'.
9887 Set EXPLICIT_INT if the type is `int' or `char' and did not
9888 come from a user typedef.
9890 Set LONGLONG if `long' is mentioned twice.
9892 For C++, constructors and destructors have their own fast treatment. */
9894 for (spec
= declspecs
; spec
; spec
= TREE_CHAIN (spec
))
9899 /* Certain parse errors slip through. For example,
9900 `int class;' is not caught by the parser. Try
9901 weakly to recover here. */
9902 if (TREE_CODE (spec
) != TREE_LIST
)
9905 id
= TREE_VALUE (spec
);
9907 if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9909 if (id
== ridpointers
[(int) RID_INT
]
9910 || id
== ridpointers
[(int) RID_CHAR
]
9911 || id
== ridpointers
[(int) RID_BOOL
]
9912 || id
== ridpointers
[(int) RID_WCHAR
])
9916 if (id
== ridpointers
[(int) RID_BOOL
])
9917 error ("`bool' is now a keyword");
9919 cp_error ("extraneous `%T' ignored", id
);
9923 if (id
== ridpointers
[(int) RID_INT
])
9925 else if (id
== ridpointers
[(int) RID_CHAR
])
9927 type
= TREE_TYPE (IDENTIFIER_GLOBAL_VALUE (id
));
9931 /* C++ aggregate types. */
9932 if (IDENTIFIER_HAS_TYPE_VALUE (id
))
9935 cp_error ("multiple declarations `%T' and `%T'", type
, id
);
9937 type
= IDENTIFIER_TYPE_VALUE (id
);
9941 for (i
= (int) RID_FIRST_MODIFIER
; i
<= (int) RID_LAST_MODIFIER
; i
++)
9943 if (ridpointers
[i
] == id
)
9945 if (i
== (int) RID_LONG
&& RIDBIT_SETP (i
, specbits
))
9947 if (pedantic
&& ! in_system_header
&& warn_long_long
)
9948 pedwarn ("ISO C++ does not support `long long'");
9950 error ("`long long long' is too long for GCC");
9954 else if (RIDBIT_SETP (i
, specbits
))
9955 pedwarn ("duplicate `%s'", IDENTIFIER_POINTER (id
));
9956 RIDBIT_SET (i
, specbits
);
9961 /* C++ aggregate types. */
9962 else if (TREE_CODE (id
) == TYPE_DECL
)
9965 cp_error ("multiple declarations `%T' and `%T'", type
,
9969 type
= TREE_TYPE (id
);
9970 TREE_VALUE (spec
) = type
;
9975 error ("two or more data types in declaration of `%s'", name
);
9976 else if (TREE_CODE (id
) == IDENTIFIER_NODE
)
9978 register tree t
= lookup_name (id
, 1);
9979 if (!t
|| TREE_CODE (t
) != TYPE_DECL
)
9980 error ("`%s' fails to be a typedef or built in type",
9981 IDENTIFIER_POINTER (id
));
9984 type
= TREE_TYPE (t
);
9986 /* See the code below that used this. */
9987 decl_machine_attr
= DECL_MACHINE_ATTRIBUTES (id
);
9992 else if (id
!= error_mark_node
)
9993 /* Can't change CLASS nodes into RECORD nodes here! */
9999 typedef_type
= type
;
10001 /* No type at all: default to `int', and set DEFAULTED_INT
10002 because it was not a user-defined typedef. */
10004 if (type
== NULL_TREE
10005 && (RIDBIT_SETP (RID_SIGNED
, specbits
)
10006 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10007 || RIDBIT_SETP (RID_LONG
, specbits
)
10008 || RIDBIT_SETP (RID_SHORT
, specbits
)))
10010 /* These imply 'int'. */
10011 type
= integer_type_node
;
10015 if (sfk
!= sfk_none
)
10016 type
= check_special_function_return_type (sfk
, type
,
10019 else if (type
== NULL_TREE
)
10025 /* We handle `main' specially here, because 'main () { }' is so
10026 common. With no options, it is allowed. With -Wreturn-type,
10027 it is a warning. It is only an error with -pedantic-errors. */
10028 is_main
= (funcdef_flag
10029 && MAIN_NAME_P (dname
)
10030 && ctype
== NULL_TREE
10031 && in_namespace
== NULL_TREE
10032 && current_namespace
== global_namespace
);
10034 if (in_system_header
|| flag_ms_extensions
)
10035 /* Allow it, sigh. */;
10036 else if (pedantic
|| ! is_main
)
10037 cp_pedwarn ("ISO C++ forbids declaration of `%s' with no type",
10039 else if (warn_return_type
)
10040 cp_warning ("ISO C++ forbids declaration of `%s' with no type",
10043 type
= integer_type_node
;
10048 /* Now process the modifiers that were specified
10049 and check for invalid combinations. */
10051 /* Long double is a special combination. */
10053 if (RIDBIT_SETP (RID_LONG
, specbits
)
10054 && TYPE_MAIN_VARIANT (type
) == double_type_node
)
10056 RIDBIT_RESET (RID_LONG
, specbits
);
10057 type
= build_qualified_type (long_double_type_node
,
10058 CP_TYPE_QUALS (type
));
10061 /* Check all other uses of type modifiers. */
10063 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10064 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10065 || RIDBIT_SETP (RID_LONG
, specbits
)
10066 || RIDBIT_SETP (RID_SHORT
, specbits
))
10070 if (TREE_CODE (type
) == REAL_TYPE
)
10071 error ("short, signed or unsigned invalid for `%s'", name
);
10072 else if (TREE_CODE (type
) != INTEGER_TYPE
)
10073 error ("long, short, signed or unsigned invalid for `%s'", name
);
10074 else if (RIDBIT_SETP (RID_LONG
, specbits
)
10075 && RIDBIT_SETP (RID_SHORT
, specbits
))
10076 error ("long and short specified together for `%s'", name
);
10077 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10078 || RIDBIT_SETP (RID_SHORT
, specbits
))
10080 error ("long or short specified with char for `%s'", name
);
10081 else if ((RIDBIT_SETP (RID_LONG
, specbits
)
10082 || RIDBIT_SETP (RID_SHORT
, specbits
))
10083 && TREE_CODE (type
) == REAL_TYPE
)
10084 error ("long or short specified with floating type for `%s'", name
);
10085 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10086 && RIDBIT_SETP (RID_UNSIGNED
, specbits
))
10087 error ("signed and unsigned given together for `%s'", name
);
10091 if (!explicit_int
&& !defaulted_int
&& !explicit_char
&& pedantic
)
10093 pedwarn ("long, short, signed or unsigned used invalidly for `%s'",
10095 if (flag_pedantic_errors
)
10100 /* Discard the type modifiers if they are invalid. */
10103 RIDBIT_RESET (RID_UNSIGNED
, specbits
);
10104 RIDBIT_RESET (RID_SIGNED
, specbits
);
10105 RIDBIT_RESET (RID_LONG
, specbits
);
10106 RIDBIT_RESET (RID_SHORT
, specbits
);
10111 if (RIDBIT_SETP (RID_COMPLEX
, specbits
)
10112 && TREE_CODE (type
) != INTEGER_TYPE
&& TREE_CODE (type
) != REAL_TYPE
)
10114 error ("complex invalid for `%s'", name
);
10115 RIDBIT_RESET (RID_COMPLEX
, specbits
);
10118 /* Decide whether an integer type is signed or not.
10119 Optionally treat bitfields as signed by default. */
10120 if (RIDBIT_SETP (RID_UNSIGNED
, specbits
)
10123 It is implementation-defined whether a plain (neither
10124 explicitly signed or unsigned) char, short, int, or long
10125 bit-field is signed or unsigned.
10127 Naturally, we extend this to long long as well. Note that
10128 this does not include wchar_t. */
10129 || (bitfield
&& !flag_signed_bitfields
10130 && RIDBIT_NOTSETP (RID_SIGNED
, specbits
)
10131 /* A typedef for plain `int' without `signed' can be
10132 controlled just like plain `int', but a typedef for
10133 `signed int' cannot be so controlled. */
10135 && C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
))
10136 && (TREE_CODE (type
) == INTEGER_TYPE
10137 || TREE_CODE (type
) == CHAR_TYPE
)
10138 && !same_type_p (TYPE_MAIN_VARIANT (type
), wchar_type_node
)))
10141 type
= long_long_unsigned_type_node
;
10142 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10143 type
= long_unsigned_type_node
;
10144 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10145 type
= short_unsigned_type_node
;
10146 else if (type
== char_type_node
)
10147 type
= unsigned_char_type_node
;
10148 else if (typedef_decl
)
10149 type
= unsigned_type (type
);
10151 type
= unsigned_type_node
;
10153 else if (RIDBIT_SETP (RID_SIGNED
, specbits
)
10154 && type
== char_type_node
)
10155 type
= signed_char_type_node
;
10157 type
= long_long_integer_type_node
;
10158 else if (RIDBIT_SETP (RID_LONG
, specbits
))
10159 type
= long_integer_type_node
;
10160 else if (RIDBIT_SETP (RID_SHORT
, specbits
))
10161 type
= short_integer_type_node
;
10163 if (RIDBIT_SETP (RID_COMPLEX
, specbits
))
10165 /* If we just have "complex", it is equivalent to
10166 "complex double", but if any modifiers at all are specified it is
10167 the complex form of TYPE. E.g, "complex short" is
10168 "complex short int". */
10170 if (defaulted_int
&& ! longlong
10171 && ! (RIDBIT_SETP (RID_LONG
, specbits
)
10172 || RIDBIT_SETP (RID_SHORT
, specbits
)
10173 || RIDBIT_SETP (RID_SIGNED
, specbits
)
10174 || RIDBIT_SETP (RID_UNSIGNED
, specbits
)))
10175 type
= complex_double_type_node
;
10176 else if (type
== integer_type_node
)
10177 type
= complex_integer_type_node
;
10178 else if (type
== float_type_node
)
10179 type
= complex_float_type_node
;
10180 else if (type
== double_type_node
)
10181 type
= complex_double_type_node
;
10182 else if (type
== long_double_type_node
)
10183 type
= complex_long_double_type_node
;
10185 type
= build_complex_type (type
);
10188 if (sfk
== sfk_conversion
10189 && (RIDBIT_SETP (RID_CONST
, specbits
)
10190 || RIDBIT_SETP (RID_VOLATILE
, specbits
)
10191 || RIDBIT_SETP (RID_RESTRICT
, specbits
)))
10192 cp_error ("qualifiers are not allowed on declaration of `operator %T'",
10195 /* Set CONSTP if this declaration is `const', whether by
10196 explicit specification or via a typedef.
10197 Likewise for VOLATILEP. */
10199 constp
= !! RIDBIT_SETP (RID_CONST
, specbits
) + CP_TYPE_CONST_P (type
);
10201 !! RIDBIT_SETP (RID_RESTRICT
, specbits
) + CP_TYPE_RESTRICT_P (type
);
10203 !! RIDBIT_SETP (RID_VOLATILE
, specbits
) + CP_TYPE_VOLATILE_P (type
);
10204 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10205 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10206 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10207 type
= cp_build_qualified_type (type
, type_quals
);
10209 inlinep
= !! RIDBIT_SETP (RID_INLINE
, specbits
);
10210 virtualp
= RIDBIT_SETP (RID_VIRTUAL
, specbits
);
10211 RIDBIT_RESET (RID_VIRTUAL
, specbits
);
10212 explicitp
= RIDBIT_SETP (RID_EXPLICIT
, specbits
) != 0;
10213 RIDBIT_RESET (RID_EXPLICIT
, specbits
);
10215 if (RIDBIT_SETP (RID_STATIC
, specbits
))
10216 staticp
= 1 + (decl_context
== FIELD
);
10218 if (virtualp
&& staticp
== 2)
10220 cp_error ("member `%D' cannot be declared both virtual and static",
10224 friendp
= RIDBIT_SETP (RID_FRIEND
, specbits
);
10225 RIDBIT_RESET (RID_FRIEND
, specbits
);
10227 /* Warn if two storage classes are given. Default to `auto'. */
10229 if (RIDBIT_ANY_SET (specbits
))
10231 if (RIDBIT_SETP (RID_STATIC
, specbits
)) nclasses
++;
10232 if (RIDBIT_SETP (RID_EXTERN
, specbits
)) nclasses
++;
10233 if (decl_context
== PARM
&& nclasses
> 0)
10234 error ("storage class specifiers invalid in parameter declarations");
10235 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10237 if (decl_context
== PARM
)
10238 error ("typedef declaration invalid in parameter declaration");
10241 if (RIDBIT_SETP (RID_AUTO
, specbits
)) nclasses
++;
10242 if (RIDBIT_SETP (RID_REGISTER
, specbits
)) nclasses
++;
10245 /* Give error if `virtual' is used outside of class declaration. */
10247 && (current_class_name
== NULL_TREE
|| decl_context
!= FIELD
))
10249 error ("virtual outside class declaration");
10253 /* Static anonymous unions are dealt with here. */
10254 if (staticp
&& decl_context
== TYPENAME
10255 && TREE_CODE (declspecs
) == TREE_LIST
10256 && ANON_AGGR_TYPE_P (TREE_VALUE (declspecs
)))
10257 decl_context
= FIELD
;
10259 /* Warn about storage classes that are invalid for certain
10260 kinds of declarations (parameters, typenames, etc.). */
10263 error ("multiple storage classes in declaration of `%s'", name
);
10264 else if (decl_context
!= NORMAL
&& nclasses
> 0)
10266 if ((decl_context
== PARM
|| decl_context
== CATCHPARM
)
10267 && (RIDBIT_SETP (RID_REGISTER
, specbits
)
10268 || RIDBIT_SETP (RID_AUTO
, specbits
)))
10270 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10272 else if (decl_context
== FIELD
10273 /* C++ allows static class elements */
10274 && RIDBIT_SETP (RID_STATIC
, specbits
))
10275 /* C++ also allows inlines and signed and unsigned elements,
10276 but in those cases we don't come in here. */
10280 if (decl_context
== FIELD
)
10282 tree tmp
= NULL_TREE
;
10283 register int op
= 0;
10287 /* Avoid trying to get an operand off an identifier node. */
10288 if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
10291 tmp
= TREE_OPERAND (declarator
, 0);
10292 op
= IDENTIFIER_OPNAME_P (tmp
);
10293 if (IDENTIFIER_TYPENAME_P (tmp
))
10295 if (IDENTIFIER_GLOBAL_VALUE (tmp
)
10296 && (TREE_CODE (IDENTIFIER_GLOBAL_VALUE (tmp
))
10298 name
= IDENTIFIER_POINTER (tmp
);
10300 name
= "<invalid operator>";
10303 error ("storage class specified for %s `%s'",
10304 op
? "member operator" : "field",
10309 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
10310 error ("storage class specified for parameter `%s'", name
);
10312 error ("storage class specified for typename");
10314 RIDBIT_RESET (RID_REGISTER
, specbits
);
10315 RIDBIT_RESET (RID_AUTO
, specbits
);
10316 RIDBIT_RESET (RID_EXTERN
, specbits
);
10319 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && initialized
&& !funcdef_flag
)
10321 if (toplevel_bindings_p ())
10323 /* It's common practice (and completely valid) to have a const
10324 be initialized and declared extern. */
10325 if (!(type_quals
& TYPE_QUAL_CONST
))
10326 warning ("`%s' initialized and declared `extern'", name
);
10329 error ("`%s' has both `extern' and initializer", name
);
10331 else if (RIDBIT_SETP (RID_EXTERN
, specbits
) && funcdef_flag
10332 && ! toplevel_bindings_p ())
10333 error ("nested function `%s' declared `extern'", name
);
10334 else if (toplevel_bindings_p ())
10336 if (RIDBIT_SETP (RID_AUTO
, specbits
))
10337 error ("top-level declaration of `%s' specifies `auto'", name
);
10340 if (nclasses
> 0 && friendp
)
10341 error ("storage class specifiers invalid in friend function declarations");
10343 /* Now figure out the structure of the declarator proper.
10344 Descend through it, creating more complex types, until we reach
10345 the declared identifier (or NULL_TREE, in an absolute declarator). */
10347 inner_attrs
= NULL_TREE
;
10350 while (declarator
&& TREE_CODE (declarator
) != IDENTIFIER_NODE
10351 && TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
)
10353 /* Each level of DECLARATOR is either an ARRAY_REF (for ...[..]),
10354 an INDIRECT_REF (for *...),
10355 a CALL_EXPR (for ...(...)),
10356 an identifier (for the name being declared)
10357 or a null pointer (for the place in an absolute declarator
10358 where the name was omitted).
10359 For the last two cases, we have just exited the loop.
10361 For C++ it could also be
10362 a SCOPE_REF (for class :: ...). In this case, we have converted
10363 sensible names to types, and those are the values we use to
10364 qualify the member name.
10365 an ADDR_EXPR (for &...),
10366 a BIT_NOT_EXPR (for destructors)
10368 At this point, TYPE is the type of elements of an array,
10369 or for a function to return, or for a pointer to point to.
10370 After this sequence of ifs, TYPE is the type of the
10371 array or function or pointer, and DECLARATOR has had its
10372 outermost layer removed. */
10374 if (type
== error_mark_node
)
10376 if (TREE_CODE (declarator
) == SCOPE_REF
)
10377 declarator
= TREE_OPERAND (declarator
, 1);
10379 declarator
= TREE_OPERAND (declarator
, 0);
10382 if (quals
!= NULL_TREE
10383 && (declarator
== NULL_TREE
10384 || TREE_CODE (declarator
) != SCOPE_REF
))
10386 if (ctype
== NULL_TREE
&& TREE_CODE (type
) == METHOD_TYPE
)
10387 ctype
= TYPE_METHOD_BASETYPE (type
);
10388 if (ctype
!= NULL_TREE
)
10390 tree dummy
= build_decl (TYPE_DECL
, NULL_TREE
, type
);
10391 grok_method_quals (ctype
, dummy
, quals
);
10392 type
= TREE_TYPE (dummy
);
10393 ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type
)));
10398 /* See the comment for the TREE_LIST case, below. */
10401 else if (inner_attrs
)
10403 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10404 inner_attrs
= NULL_TREE
;
10407 switch (TREE_CODE (declarator
))
10411 /* We encode a declarator with embedded attributes using
10412 a TREE_LIST. The attributes apply to the declarator
10413 directly inside them, so we have to skip an iteration
10414 before applying them to the type. If the declarator just
10415 inside is the declarator-id, we apply the attrs to the
10417 inner_attrs
= TREE_PURPOSE (declarator
);
10419 declarator
= TREE_VALUE (declarator
);
10425 register tree size
;
10427 size
= TREE_OPERAND (declarator
, 1);
10429 /* VC++ spells a zero-sized array with []. */
10430 if (size
== NULL_TREE
&& decl_context
== FIELD
&& ! staticp
10431 && ! RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10432 size
= integer_zero_node
;
10434 declarator
= TREE_OPERAND (declarator
, 0);
10436 type
= create_array_type_for_decl (dname
, type
, size
);
10438 /* VLAs never work as fields. */
10439 if (decl_context
== FIELD
&& !processing_template_decl
10440 && TREE_CODE (type
) == ARRAY_TYPE
10441 && TYPE_DOMAIN (type
) != NULL_TREE
10442 && !TREE_CONSTANT (TYPE_MAX_VALUE (TYPE_DOMAIN (type
))))
10444 cp_error ("size of member `%D' is not constant", dname
);
10445 /* Proceed with arbitrary constant size, so that offset
10446 computations don't get confused. */
10447 type
= create_array_type_for_decl (dname
, TREE_TYPE (type
),
10459 tree inner_parms
= CALL_DECLARATOR_PARMS (declarator
);
10460 tree inner_decl
= TREE_OPERAND (declarator
, 0);
10462 /* Declaring a function type.
10463 Make sure we have a valid type for the function to return. */
10465 /* We now know that the TYPE_QUALS don't apply to the
10466 decl, but to its return type. */
10467 type_quals
= TYPE_UNQUALIFIED
;
10469 /* Warn about some types functions can't return. */
10471 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10473 error ("`%s' declared as function returning a function", name
);
10474 type
= integer_type_node
;
10476 if (TREE_CODE (type
) == ARRAY_TYPE
)
10478 error ("`%s' declared as function returning an array", name
);
10479 type
= integer_type_node
;
10482 if (inner_decl
&& TREE_CODE (inner_decl
) == SCOPE_REF
)
10483 inner_decl
= TREE_OPERAND (inner_decl
, 1);
10485 if (inner_decl
&& TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
)
10486 inner_decl
= dname
;
10488 /* Pick up type qualifiers which should be applied to `this'. */
10489 quals
= CALL_DECLARATOR_QUALS (declarator
);
10491 /* Pick up the exception specifications. */
10492 raises
= CALL_DECLARATOR_EXCEPTION_SPEC (declarator
);
10494 /* Say it's a definition only for the CALL_EXPR
10495 closest to the identifier. */
10498 && (TREE_CODE (inner_decl
) == IDENTIFIER_NODE
10499 || TREE_CODE (inner_decl
) == TEMPLATE_ID_EXPR
10500 || TREE_CODE (inner_decl
) == BIT_NOT_EXPR
);
10502 if (ctype
== NULL_TREE
10503 && decl_context
== FIELD
10505 && (friendp
== 0 || dname
== current_class_name
))
10506 ctype
= current_class_type
;
10508 if (ctype
&& sfk
== sfk_conversion
)
10509 TYPE_HAS_CONVERSION (ctype
) = 1;
10510 if (ctype
&& constructor_name (ctype
) == dname
)
10512 /* We are within a class's scope. If our declarator name
10513 is the same as the class name, and we are defining
10514 a function, then it is a constructor/destructor, and
10515 therefore returns a void type. */
10517 if (flags
== DTOR_FLAG
)
10519 /* ISO C++ 12.4/2. A destructor may not be
10520 declared const or volatile. A destructor may
10523 error ("destructor cannot be static member function");
10526 cp_error ("destructors may not be `%s'",
10527 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10530 if (decl_context
== FIELD
)
10532 if (! member_function_or_else (ctype
,
10533 current_class_type
,
10535 return void_type_node
;
10538 else /* It's a constructor. */
10540 if (explicitp
== 1)
10542 /* ISO C++ 12.1. A constructor may not be
10543 declared const or volatile. A constructor may
10544 not be virtual. A constructor may not be
10547 error ("constructor cannot be static member function");
10550 pedwarn ("constructors cannot be declared virtual");
10555 cp_error ("constructors may not be `%s'",
10556 IDENTIFIER_POINTER (TREE_VALUE (quals
)));
10560 RID_BIT_TYPE tmp_bits
;
10561 memcpy (&tmp_bits
, &specbits
, sizeof (RID_BIT_TYPE
));
10562 RIDBIT_RESET (RID_INLINE
, tmp_bits
);
10563 RIDBIT_RESET (RID_STATIC
, tmp_bits
);
10564 if (RIDBIT_ANY_SET (tmp_bits
))
10565 error ("return value type specifier for constructor ignored");
10567 if (decl_context
== FIELD
)
10569 if (! member_function_or_else (ctype
,
10570 current_class_type
,
10572 return void_type_node
;
10573 TYPE_HAS_CONSTRUCTOR (ctype
) = 1;
10574 if (sfk
!= sfk_constructor
)
10578 if (decl_context
== FIELD
)
10584 error ("can't initialize friend function `%s'", name
);
10587 /* Cannot be both friend and virtual. */
10588 error ("virtual functions cannot be friends");
10589 RIDBIT_RESET (RID_FRIEND
, specbits
);
10592 if (decl_context
== NORMAL
)
10593 error ("friend declaration not in class definition");
10594 if (current_function_decl
&& funcdef_flag
)
10595 cp_error ("can't define friend function `%s' in a local class definition",
10599 /* Construct the function type and go to the next
10600 inner layer of declarator. */
10602 declarator
= TREE_OPERAND (declarator
, 0);
10604 /* FIXME: This is where default args should be fully
10607 arg_types
= grokparms (inner_parms
);
10609 if (declarator
&& flags
== DTOR_FLAG
)
10611 /* A destructor declared in the body of a class will
10612 be represented as a BIT_NOT_EXPR. But, we just
10613 want the underlying IDENTIFIER. */
10614 if (TREE_CODE (declarator
) == BIT_NOT_EXPR
)
10615 declarator
= TREE_OPERAND (declarator
, 0);
10617 if (arg_types
!= void_list_node
)
10619 cp_error ("destructors may not have parameters");
10620 arg_types
= void_list_node
;
10621 last_function_parms
= NULL_TREE
;
10625 /* ANSI says that `const int foo ();'
10626 does not make the function foo const. */
10627 type
= build_function_type (type
, arg_types
);
10631 for (t
= arg_types
; t
; t
= TREE_CHAIN (t
))
10632 if (TREE_PURPOSE (t
)
10633 && TREE_CODE (TREE_PURPOSE (t
)) == DEFAULT_ARG
)
10635 add_defarg_fn (type
);
10644 /* Filter out pointers-to-references and references-to-references.
10645 We can get these if a TYPE_DECL is used. */
10647 if (TREE_CODE (type
) == REFERENCE_TYPE
)
10649 error ("cannot declare %s to references",
10650 TREE_CODE (declarator
) == ADDR_EXPR
10651 ? "references" : "pointers");
10652 declarator
= TREE_OPERAND (declarator
, 0);
10656 if (TREE_CODE (type
) == OFFSET_TYPE
10657 && (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
10658 || TREE_CODE (TREE_TYPE (type
)) == REFERENCE_TYPE
))
10660 cp_error ("cannot declare pointer to `%#T' member",
10662 type
= TREE_TYPE (type
);
10665 /* Merge any constancy or volatility into the target type
10666 for the pointer. */
10668 /* We now know that the TYPE_QUALS don't apply to the decl,
10669 but to the target of the pointer. */
10670 type_quals
= TYPE_UNQUALIFIED
;
10672 if (TREE_CODE (declarator
) == ADDR_EXPR
)
10674 if (TREE_CODE (type
) == VOID_TYPE
)
10675 error ("invalid type: `void &'");
10677 type
= build_reference_type (type
);
10679 else if (TREE_CODE (type
) == METHOD_TYPE
)
10680 type
= build_ptrmemfunc_type (build_pointer_type (type
));
10682 type
= build_pointer_type (type
);
10684 /* Process a list of type modifier keywords (such as
10685 const or volatile) that were given inside the `*' or `&'. */
10687 if (TREE_TYPE (declarator
))
10689 register tree typemodlist
;
10695 for (typemodlist
= TREE_TYPE (declarator
); typemodlist
;
10696 typemodlist
= TREE_CHAIN (typemodlist
))
10698 tree qualifier
= TREE_VALUE (typemodlist
);
10700 if (qualifier
== ridpointers
[(int) RID_CONST
])
10702 else if (qualifier
== ridpointers
[(int) RID_VOLATILE
])
10704 else if (qualifier
== ridpointers
[(int) RID_RESTRICT
])
10709 error ("invalid type modifier within pointer declarator");
10713 pedwarn ("duplicate `const'");
10715 pedwarn ("duplicate `volatile'");
10717 pedwarn ("duplicate `restrict'");
10719 type_quals
= ((constp
? TYPE_QUAL_CONST
: 0)
10720 | (restrictp
? TYPE_QUAL_RESTRICT
: 0)
10721 | (volatilep
? TYPE_QUAL_VOLATILE
: 0));
10722 if (TREE_CODE (declarator
) == ADDR_EXPR
10723 && (constp
|| volatilep
))
10726 pedwarn ("discarding `const' applied to a reference");
10728 pedwarn ("discarding `volatile' applied to a reference");
10729 type_quals
&= ~(TYPE_QUAL_CONST
| TYPE_QUAL_VOLATILE
);
10731 type
= cp_build_qualified_type (type
, type_quals
);
10733 declarator
= TREE_OPERAND (declarator
, 0);
10739 /* We have converted type names to NULL_TREE if the
10740 name was bogus, or to a _TYPE node, if not.
10742 The variable CTYPE holds the type we will ultimately
10743 resolve to. The code here just needs to build
10744 up appropriate member types. */
10745 tree sname
= TREE_OPERAND (declarator
, 1);
10748 /* Destructors can have their visibilities changed as well. */
10749 if (TREE_CODE (sname
) == BIT_NOT_EXPR
)
10750 sname
= TREE_OPERAND (sname
, 0);
10752 if (TREE_COMPLEXITY (declarator
) == 0)
10753 /* This needs to be here, in case we are called
10754 multiple times. */ ;
10755 else if (TREE_COMPLEXITY (declarator
) == -1)
10756 /* Namespace member. */
10757 pop_decl_namespace ();
10758 else if (friendp
&& (TREE_COMPLEXITY (declarator
) < 2))
10759 /* Don't fall out into global scope. Hides real bug? --eichin */ ;
10760 else if (! IS_AGGR_TYPE_CODE
10761 (TREE_CODE (TREE_OPERAND (declarator
, 0))))
10763 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
10765 /* Resolve any TYPENAME_TYPEs from the decl-specifier-seq
10766 that refer to ctype. They couldn't be resolved earlier
10767 because we hadn't pushed into the class yet.
10768 Example: resolve 'B<T>::type' in
10769 'B<typename B<T>::type> B<T>::f () { }'. */
10770 if (current_template_parms
10771 && uses_template_parms (type
)
10772 && uses_template_parms (current_class_type
))
10774 tree args
= current_template_args ();
10775 type
= tsubst (type
, args
, /*complain=*/1, NULL_TREE
);
10778 /* This pop_nested_class corresponds to the
10779 push_nested_class used to push into class scope for
10780 parsing the argument list of a function decl, in
10782 pop_nested_class ();
10783 TREE_COMPLEXITY (declarator
) = current_class_depth
;
10786 my_friendly_abort (16);
10788 if (TREE_OPERAND (declarator
, 0) == NULL_TREE
)
10790 /* We had a reference to a global decl, or
10791 perhaps we were given a non-aggregate typedef,
10792 in which case we cleared this out, and should just
10793 keep going as though it wasn't there. */
10794 declarator
= sname
;
10797 ctype
= TREE_OPERAND (declarator
, 0);
10800 while (t
!= NULL_TREE
&& CLASS_TYPE_P (t
))
10802 /* You're supposed to have one `template <...>'
10803 for every template class, but you don't need one
10804 for a full specialization. For example:
10806 template <class T> struct S{};
10807 template <> struct S<int> { void f(); };
10808 void S<int>::f () {}
10810 is correct; there shouldn't be a `template <>' for
10811 the definition of `S<int>::f'. */
10812 if (CLASSTYPE_TEMPLATE_INFO (t
)
10813 && (CLASSTYPE_TEMPLATE_INSTANTIATION (t
)
10814 || uses_template_parms (CLASSTYPE_TI_ARGS (t
)))
10815 && PRIMARY_TEMPLATE_P (CLASSTYPE_TI_TEMPLATE (t
)))
10816 template_count
+= 1;
10818 t
= TYPE_MAIN_DECL (t
);
10819 t
= DECL_CONTEXT (t
);
10822 if (sname
== NULL_TREE
)
10825 if (TREE_CODE (sname
) == IDENTIFIER_NODE
)
10827 /* This is the `standard' use of the scoping operator:
10828 basetype :: member . */
10830 if (ctype
== current_class_type
)
10836 Is this ill-formed? */
10839 cp_pedwarn ("extra qualification `%T::' on member `%s' ignored",
10842 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
10844 if (current_class_type
== NULL_TREE
|| friendp
)
10845 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10846 TYPE_ARG_TYPES (type
));
10849 cp_error ("cannot declare member function `%T::%s' within `%T'",
10850 ctype
, name
, current_class_type
);
10851 return void_type_node
;
10854 else if (RIDBIT_SETP (RID_TYPEDEF
, specbits
)
10855 || COMPLETE_TYPE_P (complete_type (ctype
)))
10857 /* Have to move this code elsewhere in this function.
10858 this code is used for i.e., typedef int A::M; M *pm;
10860 It is? How? jason 10/2/94 */
10862 if (current_class_type
)
10864 cp_error ("cannot declare member `%T::%s' within `%T'",
10865 ctype
, name
, current_class_type
);
10866 return void_type_node
;
10868 type
= build_offset_type (ctype
, type
);
10872 incomplete_type_error (NULL_TREE
, ctype
);
10873 return error_mark_node
;
10876 declarator
= sname
;
10878 else if (TREE_CODE (sname
) == SCOPE_REF
)
10879 my_friendly_abort (17);
10883 declarator
= TREE_OPERAND (declarator
, 1);
10884 if (declarator
&& TREE_CODE (declarator
) == CALL_EXPR
)
10885 /* In this case, we will deal with it later. */
10889 if (TREE_CODE (type
) == FUNCTION_TYPE
)
10890 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
10891 TYPE_ARG_TYPES (type
));
10893 type
= build_offset_type (ctype
, type
);
10900 declarator
= TREE_OPERAND (declarator
, 0);
10905 case ENUMERAL_TYPE
:
10906 declarator
= NULL_TREE
;
10910 declarator
= NULL_TREE
;
10914 my_friendly_abort (158);
10918 /* See the comment for the TREE_LIST case, above. */
10921 if (! ignore_attrs
)
10922 decl_attributes (type
, inner_attrs
, NULL_TREE
);
10924 TREE_VALUE (attrlist
) = chainon (inner_attrs
, TREE_VALUE (attrlist
));
10926 attrlist
= build_tree_list (NULL_TREE
, inner_attrs
);
10929 /* Now TYPE has the actual type. */
10931 if (explicitp
== 1 || (explicitp
&& friendp
))
10933 /* [dcl.fct.spec] The explicit specifier shall only be used in
10934 declarations of constructors within a class definition. */
10935 error ("only declarations of constructors can be `explicit'");
10939 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
10941 if (current_class_name
== NULL_TREE
|| decl_context
== PARM
|| friendp
)
10943 error ("non-member `%s' cannot be declared `mutable'", name
);
10944 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10946 else if (decl_context
== TYPENAME
|| RIDBIT_SETP (RID_TYPEDEF
, specbits
))
10948 error ("non-object member `%s' cannot be declared `mutable'", name
);
10949 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10951 else if (TREE_CODE (type
) == FUNCTION_TYPE
10952 || TREE_CODE (type
) == METHOD_TYPE
)
10954 error ("function `%s' cannot be declared `mutable'", name
);
10955 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10959 error ("static `%s' cannot be declared `mutable'", name
);
10960 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10962 else if (type_quals
& TYPE_QUAL_CONST
)
10964 error ("const `%s' cannot be declared `mutable'", name
);
10965 RIDBIT_RESET (RID_MUTABLE
, specbits
);
10969 if (declarator
== NULL_TREE
10970 || TREE_CODE (declarator
) == IDENTIFIER_NODE
10971 || (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
10972 && (TREE_CODE (type
) == FUNCTION_TYPE
10973 || TREE_CODE (type
) == METHOD_TYPE
)))
10975 else if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
10977 cp_error ("template-id `%D' used as a declarator", declarator
);
10978 declarator
= dname
;
10981 /* Unexpected declarator format. */
10982 my_friendly_abort (990210);
10984 /* If this is declaring a typedef name, return a TYPE_DECL. */
10986 if (RIDBIT_SETP (RID_TYPEDEF
, specbits
) && decl_context
!= TYPENAME
)
10990 /* Note that the grammar rejects storage classes
10991 in typenames, fields or parameters. */
10992 if (current_lang_name
== lang_name_java
)
10993 TYPE_FOR_JAVA (type
) = 1;
10995 if (decl_context
== FIELD
)
10997 if (declarator
== constructor_name (current_class_type
))
10998 cp_pedwarn ("ISO C++ forbids nested type `%D' with same name as enclosing class",
11000 decl
= build_lang_decl (TYPE_DECL
, declarator
, type
);
11003 decl
= build_decl (TYPE_DECL
, declarator
, type
);
11005 /* If the user declares "typedef struct {...} foo" then the
11006 struct will have an anonymous name. Fill that name in now.
11007 Nothing can refer to it, so nothing needs know about the name
11009 if (type
!= error_mark_node
11011 && TYPE_NAME (type
)
11012 && TREE_CODE (TYPE_NAME (type
)) == TYPE_DECL
11013 && ANON_AGGRNAME_P (TYPE_IDENTIFIER (type
))
11014 && CP_TYPE_QUALS (type
) == TYPE_UNQUALIFIED
)
11016 tree oldname
= TYPE_NAME (type
);
11019 /* Replace the anonymous name with the real name everywhere. */
11020 lookup_tag_reverse (type
, declarator
);
11021 for (t
= TYPE_MAIN_VARIANT (type
); t
; t
= TYPE_NEXT_VARIANT (t
))
11022 if (TYPE_NAME (t
) == oldname
)
11023 TYPE_NAME (t
) = decl
;
11025 if (TYPE_LANG_SPECIFIC (type
))
11026 TYPE_WAS_ANONYMOUS (type
) = 1;
11028 /* If this is a typedef within a template class, the nested
11029 type is a (non-primary) template. The name for the
11030 template needs updating as well. */
11031 if (TYPE_LANG_SPECIFIC (type
) && CLASSTYPE_TEMPLATE_INFO (type
))
11032 DECL_NAME (CLASSTYPE_TI_TEMPLATE (type
))
11033 = TYPE_IDENTIFIER (type
);
11036 DECL_ASSEMBLER_NAME (decl
) = mangle_type (type
);
11039 /* XXX Temporarily set the scope.
11040 When returning, start_decl expects it as NULL_TREE,
11041 and will then then set it using pushdecl. */
11042 my_friendly_assert (DECL_CONTEXT (decl
) == NULL_TREE
, 980404);
11043 if (current_class_type
)
11044 DECL_CONTEXT (decl
) = current_class_type
;
11046 DECL_CONTEXT (decl
) = FROB_CONTEXT (current_namespace
);
11048 DECL_ASSEMBLER_NAME (decl
) = DECL_NAME (decl
);
11049 DECL_ASSEMBLER_NAME (decl
)
11050 = get_identifier (build_overload_name (type
, 1, 1));
11051 DECL_CONTEXT (decl
) = NULL_TREE
;
11054 /* FIXME remangle member functions; member functions of a
11055 type with external linkage have external linkage. */
11058 if (TREE_CODE (type
) == OFFSET_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11060 cp_error_at ("typedef name may not be class-qualified", decl
);
11065 if (ctype
== NULL_TREE
)
11067 if (TREE_CODE (type
) != METHOD_TYPE
)
11068 cp_error_at ("invalid type qualifier for non-member function type", decl
);
11070 ctype
= TYPE_METHOD_BASETYPE (type
);
11072 if (ctype
!= NULL_TREE
)
11073 grok_method_quals (ctype
, decl
, quals
);
11076 if (RIDBIT_SETP (RID_SIGNED
, specbits
)
11077 || (typedef_decl
&& C_TYPEDEF_EXPLICITLY_SIGNED (typedef_decl
)))
11078 C_TYPEDEF_EXPLICITLY_SIGNED (decl
) = 1;
11080 bad_specifiers (decl
, "type", virtualp
, quals
!= NULL_TREE
,
11081 inlinep
, friendp
, raises
!= NULL_TREE
);
11084 error ("typedef declaration includes an initializer");
11089 /* Detect the case of an array type of unspecified size
11090 which came, as such, direct from a typedef name.
11091 We must copy the type, so that each identifier gets
11092 a distinct type, so that each identifier's size can be
11093 controlled separately by its own initializer. */
11095 if (type
== typedef_type
&& TREE_CODE (type
) == ARRAY_TYPE
11096 && TYPE_DOMAIN (type
) == NULL_TREE
)
11098 type
= build_cplus_array_type (TREE_TYPE (type
), TYPE_DOMAIN (type
));
11101 /* If this is a type name (such as, in a cast or sizeof),
11102 compute the type and return it now. */
11104 if (decl_context
== TYPENAME
)
11106 /* Note that the grammar rejects storage classes
11107 in typenames, fields or parameters. */
11108 if (type_quals
!= TYPE_UNQUALIFIED
)
11109 type_quals
= TYPE_UNQUALIFIED
;
11111 /* Special case: "friend class foo" looks like a TYPENAME context. */
11114 if (type_quals
!= TYPE_UNQUALIFIED
)
11116 cp_error ("type qualifiers specified for friend class declaration");
11117 type_quals
= TYPE_UNQUALIFIED
;
11121 cp_error ("`inline' specified for friend class declaration");
11125 /* Until core issue 180 is resolved, allow 'friend typename A::B'.
11126 But don't allow implicit typenames except with a class-key. */
11127 if (!current_aggr
&& (TREE_CODE (type
) != TYPENAME_TYPE
11128 || IMPLICIT_TYPENAME_P (type
)))
11130 if (TREE_CODE (type
) == TEMPLATE_TYPE_PARM
)
11131 cp_pedwarn ("template parameters cannot be friends");
11132 else if (TREE_CODE (type
) == TYPENAME_TYPE
)
11134 friend declaration requires class-key, i.e. `friend class %T::%T'",
11135 constructor_name (current_class_type
),
11136 TYPE_IDENTIFIER (type
));
11139 friend declaration requires class-key, i.e. `friend %#T'",
11143 /* Only try to do this stuff if we didn't already give up. */
11144 if (type
!= integer_type_node
)
11146 decl_type_access_control (TYPE_NAME (type
));
11148 /* A friendly class? */
11149 if (current_class_type
)
11150 make_friend_class (current_class_type
, TYPE_MAIN_VARIANT (type
));
11152 cp_error ("trying to make class `%T' a friend of global scope",
11155 type
= void_type_node
;
11160 if (ctype
== NULL_TREE
)
11162 if (TREE_CODE (type
) != METHOD_TYPE
)
11163 cp_error ("invalid qualifiers on non-member function type");
11165 ctype
= TYPE_METHOD_BASETYPE (type
);
11169 tree dummy
= build_decl (TYPE_DECL
, declarator
, type
);
11170 grok_method_quals (ctype
, dummy
, quals
);
11171 type
= TREE_TYPE (dummy
);
11177 else if (declarator
== NULL_TREE
&& decl_context
!= PARM
11178 && decl_context
!= CATCHPARM
11179 && TREE_CODE (type
) != UNION_TYPE
11182 cp_error ("abstract declarator `%T' used as declaration", type
);
11183 declarator
= make_anon_name ();
11186 /* `void' at top level (not within pointer)
11187 is allowed only in typedefs or type names.
11188 We don't complain about parms either, but that is because
11189 a better error message can be made later. */
11191 if (TREE_CODE (type
) == VOID_TYPE
&& decl_context
!= PARM
)
11194 error ("unnamed variable or field declared void");
11195 else if (TREE_CODE (declarator
) == IDENTIFIER_NODE
)
11197 if (IDENTIFIER_OPNAME_P (declarator
))
11198 my_friendly_abort (356);
11200 error ("variable or field `%s' declared void", name
);
11203 error ("variable or field declared void");
11204 type
= integer_type_node
;
11207 /* Now create the decl, which may be a VAR_DECL, a PARM_DECL
11208 or a FUNCTION_DECL, depending on DECL_CONTEXT and TYPE. */
11210 if (decl_context
== PARM
|| decl_context
== CATCHPARM
)
11212 if (ctype
|| in_namespace
)
11213 error ("cannot use `::' in parameter declaration");
11215 /* A parameter declared as an array of T is really a pointer to T.
11216 One declared as a function is really a pointer to a function.
11217 One declared as a member is really a pointer to member. */
11219 if (TREE_CODE (type
) == ARRAY_TYPE
)
11221 /* Transfer const-ness of array into that of type pointed to. */
11222 type
= build_pointer_type (TREE_TYPE (type
));
11223 type_quals
= TYPE_UNQUALIFIED
;
11225 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11226 type
= build_pointer_type (type
);
11227 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11228 type
= build_pointer_type (type
);
11232 register tree decl
;
11234 if (decl_context
== PARM
)
11236 decl
= build_decl (PARM_DECL
, declarator
, type
);
11238 bad_specifiers (decl
, "parameter", virtualp
, quals
!= NULL_TREE
,
11239 inlinep
, friendp
, raises
!= NULL_TREE
);
11241 /* Compute the type actually passed in the parmlist,
11242 for the case where there is no prototype.
11243 (For example, shorts and chars are passed as ints.)
11244 When there is a prototype, this is overridden later. */
11246 DECL_ARG_TYPE (decl
) = type_promotes_to (type
);
11248 else if (decl_context
== FIELD
)
11250 if (type
== error_mark_node
)
11252 /* Happens when declaring arrays of sizes which
11253 are error_mark_node, for example. */
11256 else if (in_namespace
&& !friendp
)
11258 /* Something like struct S { int N::j; }; */
11259 cp_error ("invalid use of `::'");
11262 else if (TREE_CODE (type
) == FUNCTION_TYPE
)
11265 tree function_context
;
11267 /* We catch the others as conflicts with the builtin
11269 if (friendp
&& declarator
== ridpointers
[(int) RID_SIGNED
])
11271 cp_error ("function `%D' cannot be declared friend",
11278 if (ctype
== NULL_TREE
)
11279 ctype
= current_class_type
;
11281 if (ctype
== NULL_TREE
)
11283 cp_error ("can't make `%D' into a method -- not in a class",
11285 return void_type_node
;
11288 /* ``A union may [ ... ] not [ have ] virtual functions.''
11290 if (virtualp
&& TREE_CODE (ctype
) == UNION_TYPE
)
11292 cp_error ("function `%D' declared virtual inside a union",
11294 return void_type_node
;
11297 if (declarator
== ansi_opname (NEW_EXPR
)
11298 || declarator
== ansi_opname (VEC_NEW_EXPR
)
11299 || declarator
== ansi_opname (DELETE_EXPR
)
11300 || declarator
== ansi_opname (VEC_DELETE_EXPR
))
11304 cp_error ("`%D' cannot be declared virtual, since it is always static",
11309 else if (staticp
< 2)
11310 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11311 TYPE_ARG_TYPES (type
));
11314 /* Tell grokfndecl if it needs to set TREE_PUBLIC on the node. */
11315 function_context
= (ctype
!= NULL_TREE
) ?
11316 decl_function_context (TYPE_MAIN_DECL (ctype
)) : NULL_TREE
;
11317 publicp
= (! friendp
|| ! staticp
)
11318 && function_context
== NULL_TREE
;
11319 decl
= grokfndecl (ctype
, type
,
11320 TREE_CODE (declarator
) != TEMPLATE_ID_EXPR
11321 ? declarator
: dname
,
11323 virtualp
, flags
, quals
, raises
,
11324 friendp
? -1 : 0, friendp
, publicp
, inlinep
,
11325 funcdef_flag
, template_count
, in_namespace
);
11326 if (decl
== NULL_TREE
)
11329 /* This clobbers the attrs stored in `decl' from `attrlist'. */
11330 /* The decl and setting of decl_machine_attr is also turned off. */
11331 decl
= build_decl_attribute_variant (decl
, decl_machine_attr
);
11334 /* [class.conv.ctor]
11336 A constructor declared without the function-specifier
11337 explicit that can be called with a single parameter
11338 specifies a conversion from the type of its first
11339 parameter to the type of its class. Such a constructor
11340 is called a converting constructor. */
11341 if (explicitp
== 2)
11342 DECL_NONCONVERTING_P (decl
) = 1;
11343 else if (DECL_CONSTRUCTOR_P (decl
))
11345 /* The constructor can be called with exactly one
11346 parameter if there is at least one parameter, and
11347 any subsequent parameters have default arguments.
11348 We don't look at the first parameter, which is
11349 really just the `this' parameter for the new
11352 TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
)));
11354 /* Skip the `in_chrg' argument too, if present. */
11355 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
11356 arg_types
= TREE_CHAIN (arg_types
);
11358 if (arg_types
== void_list_node
11360 && TREE_CHAIN (arg_types
)
11361 && TREE_CHAIN (arg_types
) != void_list_node
11362 && !TREE_PURPOSE (TREE_CHAIN (arg_types
))))
11363 DECL_NONCONVERTING_P (decl
) = 1;
11366 else if (TREE_CODE (type
) == METHOD_TYPE
)
11368 /* We only get here for friend declarations of
11369 members of other classes. */
11370 /* All method decls are public, so tell grokfndecl to set
11371 TREE_PUBLIC, also. */
11372 decl
= grokfndecl (ctype
, type
, declarator
, declarator
,
11373 virtualp
, flags
, quals
, raises
,
11374 friendp
? -1 : 0, friendp
, 1, 0, funcdef_flag
,
11375 template_count
, in_namespace
);
11376 if (decl
== NULL_TREE
)
11379 else if (!staticp
&& ! processing_template_decl
11380 && !COMPLETE_TYPE_P (complete_type (type
))
11381 && (TREE_CODE (type
) != ARRAY_TYPE
|| initialized
== 0))
11384 cp_error ("field `%D' has incomplete type", declarator
);
11386 cp_error ("name `%T' has incomplete type", type
);
11388 /* If we're instantiating a template, tell them which
11389 instantiation made the field's type be incomplete. */
11390 if (current_class_type
11391 && TYPE_NAME (current_class_type
)
11392 && IDENTIFIER_TEMPLATE (TYPE_IDENTIFIER (current_class_type
))
11393 && declspecs
&& TREE_VALUE (declspecs
)
11394 && TREE_TYPE (TREE_VALUE (declspecs
)) == type
)
11395 cp_error (" in instantiation of template `%T'",
11396 current_class_type
);
11398 type
= error_mark_node
;
11405 error ("`%s' is neither function nor member function; cannot be declared friend",
11406 IDENTIFIER_POINTER (declarator
));
11414 /* Friends are treated specially. */
11415 if (ctype
== current_class_type
)
11416 warning ("member functions are implicitly friends of their class");
11419 tree t
= NULL_TREE
;
11420 if (decl
&& DECL_NAME (decl
))
11422 if (template_class_depth (current_class_type
) == 0)
11425 = check_explicit_specialization
11427 template_count
, 2 * (funcdef_flag
!= 0) + 4);
11428 if (decl
== error_mark_node
)
11429 return error_mark_node
;
11432 t
= do_friend (ctype
, declarator
, decl
,
11433 last_function_parms
, attrlist
, flags
, quals
,
11436 if (t
&& funcdef_flag
)
11439 return void_type_node
;
11443 /* Structure field. It may not be a function, except for C++ */
11445 if (decl
== NULL_TREE
)
11451 /* An attempt is being made to initialize a non-static
11452 member. But, from [class.mem]:
11454 4 A member-declarator can contain a
11455 constant-initializer only if it declares a static
11456 member (_class.static_) of integral or enumeration
11457 type, see _class.static.data_.
11459 This used to be relatively common practice, but
11460 the rest of the compiler does not correctly
11461 handle the initialization unless the member is
11462 static so we make it static below. */
11463 cp_pedwarn ("ISO C++ forbids initialization of member `%D'",
11465 cp_pedwarn ("making `%D' static", declarator
);
11469 if (uses_template_parms (type
))
11470 /* We'll check at instantiation time. */
11472 else if (check_static_variable_definition (declarator
,
11474 /* If we just return the declaration, crashes
11475 will sometimes occur. We therefore return
11476 void_type_node, as if this was a friend
11477 declaration, to cause callers to completely
11478 ignore this declaration. */
11479 return void_type_node
;
11482 /* 9.2p13 [class.mem] */
11483 if (declarator
== constructor_name (current_class_type
)
11484 /* The standard does not allow non-static data members
11485 here either, but we agreed at the 10/99 meeting
11486 to change that in TC 1 so that they are allowed in
11487 classes with no user-defined constructors. */
11489 cp_pedwarn ("ISO C++ forbids static data member `%D' with same name as enclosing class",
11494 /* C++ allows static class members. All other work
11495 for this is done by grokfield. */
11496 decl
= build_lang_decl (VAR_DECL
, declarator
, type
);
11497 TREE_STATIC (decl
) = 1;
11498 /* In class context, 'static' means public access. */
11499 TREE_PUBLIC (decl
) = DECL_EXTERNAL (decl
) = 1;
11503 decl
= build_decl (FIELD_DECL
, declarator
, type
);
11504 DECL_NONADDRESSABLE_P (decl
) = bitfield
;
11505 if (RIDBIT_SETP (RID_MUTABLE
, specbits
))
11507 DECL_MUTABLE_P (decl
) = 1;
11508 RIDBIT_RESET (RID_MUTABLE
, specbits
);
11512 bad_specifiers (decl
, "field", virtualp
, quals
!= NULL_TREE
,
11513 inlinep
, friendp
, raises
!= NULL_TREE
);
11516 else if (TREE_CODE (type
) == FUNCTION_TYPE
|| TREE_CODE (type
) == METHOD_TYPE
)
11518 tree original_name
;
11524 if (TREE_CODE (declarator
) == TEMPLATE_ID_EXPR
)
11525 original_name
= dname
;
11527 original_name
= declarator
;
11529 if (RIDBIT_SETP (RID_AUTO
, specbits
))
11530 error ("storage class `auto' invalid for function `%s'", name
);
11531 else if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11532 error ("storage class `register' invalid for function `%s'", name
);
11534 /* Function declaration not at top level.
11535 Storage classes other than `extern' are not allowed
11536 and `extern' makes no difference. */
11537 if (! toplevel_bindings_p ()
11538 && (RIDBIT_SETP (RID_STATIC
, specbits
)
11539 || RIDBIT_SETP (RID_INLINE
, specbits
))
11542 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11543 pedwarn ("storage class `static' invalid for function `%s' declared out of global scope", name
);
11545 pedwarn ("storage class `inline' invalid for function `%s' declared out of global scope", name
);
11548 if (ctype
== NULL_TREE
)
11552 error ("virtual non-class function `%s'", name
);
11556 else if (TREE_CODE (type
) == FUNCTION_TYPE
&& staticp
< 2)
11557 type
= build_cplus_method_type (ctype
, TREE_TYPE (type
),
11558 TYPE_ARG_TYPES (type
));
11560 /* Record presence of `static'. */
11561 publicp
= (ctype
!= NULL_TREE
11562 || RIDBIT_SETP (RID_EXTERN
, specbits
)
11563 || !RIDBIT_SETP (RID_STATIC
, specbits
));
11565 decl
= grokfndecl (ctype
, type
, original_name
, declarator
,
11566 virtualp
, flags
, quals
, raises
,
11568 publicp
, inlinep
, funcdef_flag
,
11569 template_count
, in_namespace
);
11570 if (decl
== NULL_TREE
)
11575 int illegal_static
= 0;
11577 /* Don't allow a static member function in a class, and forbid
11578 declaring main to be static. */
11579 if (TREE_CODE (type
) == METHOD_TYPE
)
11581 cp_pedwarn ("cannot declare member function `%D' to have static linkage", decl
);
11582 illegal_static
= 1;
11584 else if (current_function_decl
)
11586 /* FIXME need arm citation */
11587 error ("cannot declare static function inside another function");
11588 illegal_static
= 1;
11591 if (illegal_static
)
11594 RIDBIT_RESET (RID_STATIC
, specbits
);
11600 /* It's a variable. */
11602 /* An uninitialized decl with `extern' is a reference. */
11603 decl
= grokvardecl (type
, declarator
, &specbits
,
11605 (type_quals
& TYPE_QUAL_CONST
) != 0,
11607 bad_specifiers (decl
, "variable", virtualp
, quals
!= NULL_TREE
,
11608 inlinep
, friendp
, raises
!= NULL_TREE
);
11612 DECL_CONTEXT (decl
) = ctype
;
11615 cp_pedwarn ("static member `%D' re-declared as static", decl
);
11617 RIDBIT_RESET (RID_STATIC
, specbits
);
11619 if (RIDBIT_SETP (RID_REGISTER
, specbits
) && TREE_STATIC (decl
))
11621 cp_error ("static member `%D' declared `register'", decl
);
11622 RIDBIT_RESET (RID_REGISTER
, specbits
);
11624 if (RIDBIT_SETP (RID_EXTERN
, specbits
) && pedantic
)
11626 cp_pedwarn ("cannot explicitly declare member `%#D' to have extern linkage",
11628 RIDBIT_RESET (RID_EXTERN
, specbits
);
11633 my_friendly_assert (!RIDBIT_SETP (RID_MUTABLE
, specbits
), 19990927);
11635 /* Record `register' declaration for warnings on &
11636 and in case doing stupid register allocation. */
11638 if (RIDBIT_SETP (RID_REGISTER
, specbits
))
11639 DECL_REGISTER (decl
) = 1;
11641 if (RIDBIT_SETP (RID_EXTERN
, specbits
))
11642 DECL_THIS_EXTERN (decl
) = 1;
11644 if (RIDBIT_SETP (RID_STATIC
, specbits
))
11645 DECL_THIS_STATIC (decl
) = 1;
11647 /* Record constancy and volatility. There's no need to do this
11648 when processing a template; we'll do this for the instantiated
11649 declaration based on the type of DECL. */
11650 if (!processing_template_decl
)
11651 c_apply_type_quals_to_decl (type_quals
, decl
);
11657 /* Tell if a parmlist/exprlist looks like an exprlist or a parmlist.
11658 An empty exprlist is a parmlist. An exprlist which
11659 contains only identifiers at the global level
11660 is a parmlist. Otherwise, it is an exprlist. */
11663 parmlist_is_exprlist (exprs
)
11666 if (exprs
== NULL_TREE
|| TREE_PARMLIST (exprs
))
11669 if (toplevel_bindings_p ())
11671 /* At the global level, if these are all identifiers,
11672 then it is a parmlist. */
11675 if (TREE_CODE (TREE_VALUE (exprs
)) != IDENTIFIER_NODE
)
11677 exprs
= TREE_CHAIN (exprs
);
11684 /* Subroutine of start_function. Ensure that each of the parameter
11685 types (as listed in PARMS) is complete, as is required for a
11686 function definition. */
11689 require_complete_types_for_parms (parms
)
11692 for (; parms
; parms
= TREE_CHAIN (parms
))
11694 if (VOID_TYPE_P (TREE_TYPE (parms
)))
11695 /* grokparms will have already issued an error */
11696 TREE_TYPE (parms
) = error_mark_node
;
11697 else if (complete_type_or_else (TREE_TYPE (parms
), parms
))
11698 layout_decl (parms
, 0);
11700 TREE_TYPE (parms
) = error_mark_node
;
11704 /* Returns non-zero if T is a local variable. */
11707 local_variable_p (t
)
11710 if ((TREE_CODE (t
) == VAR_DECL
11711 /* A VAR_DECL with a context that is a _TYPE is a static data
11713 && !TYPE_P (CP_DECL_CONTEXT (t
))
11714 /* Any other non-local variable must be at namespace scope. */
11715 && !DECL_NAMESPACE_SCOPE_P (t
))
11716 || (TREE_CODE (t
) == PARM_DECL
))
11722 /* Returns non-zero if T is an automatic local variable or a label.
11723 (These are the declarations that need to be remapped when the code
11724 containing them is duplicated.) */
11727 nonstatic_local_decl_p (t
)
11730 return ((local_variable_p (t
) && !TREE_STATIC (t
))
11731 || TREE_CODE (t
) == LABEL_DECL
11732 || TREE_CODE (t
) == RESULT_DECL
);
11735 /* Like local_variable_p, but suitable for use as a tree-walking
11739 local_variable_p_walkfn (tp
, walk_subtrees
, data
)
11741 int *walk_subtrees ATTRIBUTE_UNUSED
;
11742 void *data ATTRIBUTE_UNUSED
;
11744 return ((local_variable_p (*tp
) && !DECL_ARTIFICIAL (*tp
))
11745 ? *tp
: NULL_TREE
);
11748 /* Check that ARG, which is a default-argument expression for a
11749 parameter DECL, is legal. Returns ARG, or ERROR_MARK_NODE, if
11750 something goes wrong. DECL may also be a _TYPE node, rather than a
11751 DECL, if there is no DECL available. */
11754 check_default_argument (decl
, arg
)
11761 if (TREE_CODE (arg
) == DEFAULT_ARG
)
11762 /* We get a DEFAULT_ARG when looking at an in-class declaration
11763 with a default argument. Ignore the argument for now; we'll
11764 deal with it after the class is complete. */
11767 if (processing_template_decl
|| uses_template_parms (arg
))
11768 /* We don't do anything checking until instantiation-time. Note
11769 that there may be uninstantiated arguments even for an
11770 instantiated function, since default arguments are not
11771 instantiated until they are needed. */
11780 decl_type
= TREE_TYPE (decl
);
11782 if (arg
== error_mark_node
11783 || decl
== error_mark_node
11784 || TREE_TYPE (arg
) == error_mark_node
11785 || decl_type
== error_mark_node
)
11786 /* Something already went wrong. There's no need to check
11788 return error_mark_node
;
11790 /* [dcl.fct.default]
11792 A default argument expression is implicitly converted to the
11794 if (!TREE_TYPE (arg
)
11795 || !can_convert_arg (decl_type
, TREE_TYPE (arg
), arg
))
11798 cp_error ("default argument for `%#D' has type `%T'",
11799 decl
, TREE_TYPE (arg
));
11801 cp_error ("default argument for parameter of type `%T' has type `%T'",
11802 decl_type
, TREE_TYPE (arg
));
11804 return error_mark_node
;
11807 /* [dcl.fct.default]
11809 Local variables shall not be used in default argument
11812 The keyword `this' shall not be used in a default argument of a
11813 member function. */
11814 var
= walk_tree_without_duplicates (&arg
, local_variable_p_walkfn
,
11818 cp_error ("default argument `%E' uses local variable `%D'",
11820 return error_mark_node
;
11827 /* Decode the list of parameter types for a function type.
11828 Given the list of things declared inside the parens,
11829 return a list of types.
11831 We determine whether ellipsis parms are used by PARMLIST_ELLIPSIS_P
11832 flag. If unset, we append void_list_node. A parmlist declared
11833 as `(void)' is accepted as the empty parmlist.
11835 Also set last_function_parms to the chain of PARM_DECLs. */
11838 grokparms (first_parm
)
11841 tree result
= NULL_TREE
;
11842 tree decls
= NULL_TREE
;
11843 int ellipsis
= !first_parm
|| PARMLIST_ELLIPSIS_P (first_parm
);
11847 my_friendly_assert (!first_parm
|| TREE_PARMLIST (first_parm
), 20001115);
11849 for (parm
= first_parm
; parm
!= NULL_TREE
; parm
= chain
)
11851 tree type
= NULL_TREE
;
11852 register tree decl
= TREE_VALUE (parm
);
11853 tree init
= TREE_PURPOSE (parm
);
11855 chain
= TREE_CHAIN (parm
);
11856 /* @@ weak defense against parse errors. */
11857 if (TREE_CODE (decl
) != VOID_TYPE
11858 && TREE_CODE (decl
) != TREE_LIST
)
11860 /* Give various messages as the need arises. */
11861 if (TREE_CODE (decl
) == STRING_CST
)
11862 cp_error ("invalid string constant `%E'", decl
);
11863 else if (TREE_CODE (decl
) == INTEGER_CST
)
11864 error ("invalid integer constant in parameter list, did you forget to give parameter name?");
11868 if (parm
== void_list_node
)
11871 decl
= grokdeclarator (TREE_VALUE (decl
), TREE_PURPOSE (decl
),
11872 PARM
, init
!= NULL_TREE
, NULL_TREE
);
11873 if (! decl
|| TREE_TYPE (decl
) == error_mark_node
)
11876 type
= TREE_TYPE (decl
);
11877 if (VOID_TYPE_P (type
))
11879 if (same_type_p (type
, void_type_node
)
11880 && !DECL_NAME (decl
) && !result
&& !chain
&& !ellipsis
)
11881 /* this is a parmlist of `(void)', which is ok. */
11883 incomplete_type_error (decl
, type
);
11884 /* It's not a good idea to actually create parameters of
11885 type `void'; other parts of the compiler assume that a
11886 void type terminates the parameter list. */
11887 type
= error_mark_node
;
11888 TREE_TYPE (decl
) = error_mark_node
;
11891 if (type
!= error_mark_node
)
11893 /* Top-level qualifiers on the parameters are
11894 ignored for function types. */
11895 type
= TYPE_MAIN_VARIANT (type
);
11896 if (TREE_CODE (type
) == METHOD_TYPE
)
11898 cp_error ("parameter `%D' invalidly declared method type", decl
);
11899 type
= build_pointer_type (type
);
11900 TREE_TYPE (decl
) = type
;
11902 else if (TREE_CODE (type
) == OFFSET_TYPE
)
11904 cp_error ("parameter `%D' invalidly declared offset type", decl
);
11905 type
= build_pointer_type (type
);
11906 TREE_TYPE (decl
) = type
;
11908 else if (abstract_virtuals_error (decl
, type
))
11909 any_error
= 1; /* Seems like a good idea. */
11910 else if (POINTER_TYPE_P (type
))
11912 /* [dcl.fct]/6, parameter types cannot contain pointers
11913 (references) to arrays of unknown bound. */
11914 tree t
= TREE_TYPE (type
);
11915 int ptr
= TYPE_PTR_P (type
);
11919 if (TYPE_PTR_P (t
))
11921 else if (TREE_CODE (t
) != ARRAY_TYPE
)
11923 else if (!TYPE_DOMAIN (t
))
11927 if (TREE_CODE (t
) == ARRAY_TYPE
)
11928 cp_error ("parameter `%D' includes %s to array of unknown bound `%T'",
11929 decl
, ptr
? "pointer" : "reference", t
);
11932 DECL_ARG_TYPE (decl
) = TREE_TYPE (decl
);
11933 if (PROMOTE_PROTOTYPES
11934 && (TREE_CODE (type
) == INTEGER_TYPE
11935 || TREE_CODE (type
) == ENUMERAL_TYPE
)
11936 && TYPE_PRECISION (type
) < TYPE_PRECISION (integer_type_node
))
11937 DECL_ARG_TYPE (decl
) = integer_type_node
;
11938 if (!any_error
&& init
)
11939 init
= check_default_argument (decl
, init
);
11944 TREE_CHAIN (decl
) = decls
;
11946 result
= tree_cons (init
, type
, result
);
11948 decls
= nreverse (decls
);
11949 result
= nreverse (result
);
11951 result
= chainon (result
, void_list_node
);
11952 last_function_parms
= decls
;
11958 /* D is a constructor or overloaded `operator='. Returns non-zero if
11959 D's arguments allow it to be a copy constructor, or copy assignment
11968 if (!DECL_FUNCTION_MEMBER_P (d
))
11971 t
= FUNCTION_ARG_CHAIN (d
);
11972 if (DECL_CONSTRUCTOR_P (d
) && DECL_HAS_IN_CHARGE_PARM_P (d
))
11973 t
= TREE_CHAIN (t
);
11974 if (t
&& TREE_CODE (TREE_VALUE (t
)) == REFERENCE_TYPE
11975 && (TYPE_MAIN_VARIANT (TREE_TYPE (TREE_VALUE (t
)))
11976 == DECL_CONTEXT (d
))
11977 && (TREE_CHAIN (t
) == NULL_TREE
11978 || TREE_CHAIN (t
) == void_list_node
11979 || TREE_PURPOSE (TREE_CHAIN (t
))))
11984 /* These memoizing functions keep track of special properties which
11985 a class may have. `grok_ctor_properties' notices whether a class
11986 has a constructor of the form X(X&), and also complains
11987 if the class has a constructor of the form X(X).
11988 `grok_op_properties' takes notice of the various forms of
11989 operator= which are defined, as well as what sorts of type conversion
11990 may apply. Both functions take a FUNCTION_DECL as an argument. */
11993 grok_ctor_properties (ctype
, decl
)
11996 tree parmtypes
= FUNCTION_ARG_CHAIN (decl
);
11997 tree parmtype
= parmtypes
? TREE_VALUE (parmtypes
) : void_type_node
;
11999 /* When a type has virtual baseclasses, a magical first int argument is
12000 added to any ctor so we can tell if the class has been initialized
12001 yet. This could screw things up in this function, so we deliberately
12002 ignore the leading int if we're in that situation. */
12003 if (DECL_HAS_IN_CHARGE_PARM_P (decl
))
12005 my_friendly_assert (parmtypes
12006 && TREE_VALUE (parmtypes
) == integer_type_node
,
12008 parmtypes
= TREE_CHAIN (parmtypes
);
12009 parmtype
= TREE_VALUE (parmtypes
);
12014 A non-template constructor for class X is a copy constructor if
12015 its first parameter is of type X&, const X&, volatile X& or const
12016 volatile X&, and either there are no other parameters or else all
12017 other parameters have default arguments. */
12018 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
12019 && TYPE_MAIN_VARIANT (TREE_TYPE (parmtype
)) == ctype
12020 && sufficient_parms_p (TREE_CHAIN (parmtypes
))
12021 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12022 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12024 TYPE_HAS_INIT_REF (ctype
) = 1;
12025 if (CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12026 TYPE_HAS_CONST_INIT_REF (ctype
) = 1;
12030 A declaration of a constructor for a class X is ill-formed if its
12031 first parameter is of type (optionally cv-qualified) X and either
12032 there are no other parameters or else all other parameters have
12035 We *don't* complain about member template instantiations that
12036 have this form, though; they can occur as we try to decide what
12037 constructor to use during overload resolution. Since overload
12038 resolution will never prefer such a constructor to the
12039 non-template copy constructor (which is either explicitly or
12040 implicitly defined), there's no need to worry about their
12041 existence. Theoretically, they should never even be
12042 instantiated, but that's hard to forestall. */
12043 else if (TYPE_MAIN_VARIANT (parmtype
) == ctype
12044 && sufficient_parms_p (TREE_CHAIN (parmtypes
))
12045 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12046 && is_member_template (DECL_TI_TEMPLATE (decl
))))
12048 cp_error ("invalid constructor; you probably meant `%T (const %T&)'",
12050 SET_IDENTIFIER_ERROR_LOCUS (DECL_NAME (decl
), ctype
);
12053 else if (TREE_CODE (parmtype
) == VOID_TYPE
12054 || TREE_PURPOSE (parmtypes
) != NULL_TREE
)
12055 TYPE_HAS_DEFAULT_CONSTRUCTOR (ctype
) = 1;
12060 /* An operator with this code is unary, but can also be binary. */
12064 enum tree_code code
;
12066 return (code
== INDIRECT_REF
12067 || code
== ADDR_EXPR
12068 || code
== CONVERT_EXPR
12069 || code
== NEGATE_EXPR
12070 || code
== PREINCREMENT_EXPR
12071 || code
== PREDECREMENT_EXPR
);
12074 /* An operator with this name can only be unary. */
12078 enum tree_code code
;
12080 return (code
== TRUTH_NOT_EXPR
12081 || code
== BIT_NOT_EXPR
12082 || code
== COMPONENT_REF
12083 || code
== TYPE_EXPR
);
12086 /* Do a little sanity-checking on how they declared their operator. */
12089 grok_op_properties (decl
, virtualp
, friendp
)
12091 int virtualp
, friendp
;
12093 tree argtypes
= TYPE_ARG_TYPES (TREE_TYPE (decl
));
12095 int methodp
= (TREE_CODE (TREE_TYPE (decl
)) == METHOD_TYPE
);
12096 tree name
= DECL_NAME (decl
);
12097 enum tree_code operator_code
;
12100 /* Count the number of arguments. */
12101 for (argtype
= argtypes
, arity
= 0;
12102 argtype
&& argtype
!= void_list_node
;
12103 argtype
= TREE_CHAIN (argtype
))
12106 if (current_class_type
== NULL_TREE
)
12109 if (DECL_CONV_FN_P (decl
))
12110 operator_code
= TYPE_EXPR
;
12114 #define DEF_OPERATOR(NAME, CODE, NEW_MANGLING, OLD_MANGING, ARITY, ASSN_P) \
12115 if (ansi_opname (CODE) == name) \
12117 operator_code = CODE; \
12120 else if (ansi_assopname (CODE) == name) \
12122 operator_code = CODE; \
12123 DECL_ASSIGNMENT_OPERATOR_P (decl) = 1; \
12127 #include "operators.def"
12128 #undef DEF_OPERATOR
12130 my_friendly_abort (20000527);
12133 my_friendly_assert (operator_code
!= LAST_CPLUS_TREE_CODE
, 20000526);
12134 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12138 switch (operator_code
)
12141 TYPE_OVERLOADS_CALL_EXPR (current_class_type
) = 1;
12145 TYPE_OVERLOADS_ARRAY_REF (current_class_type
) = 1;
12148 case COMPONENT_REF
:
12150 TYPE_OVERLOADS_ARROW (current_class_type
) = 1;
12154 TYPE_HAS_NEW_OPERATOR (current_class_type
) = 1;
12158 TYPE_GETS_DELETE (current_class_type
) |= 1;
12162 TYPE_HAS_ARRAY_NEW_OPERATOR (current_class_type
) = 1;
12165 case VEC_DELETE_EXPR
:
12166 TYPE_GETS_DELETE (current_class_type
) |= 2;
12174 if (operator_code
== NEW_EXPR
|| operator_code
== VEC_NEW_EXPR
)
12176 /* When the compiler encounters the definition of A::operator new, it
12177 doesn't look at the class declaration to find out if it's static. */
12179 revert_static_member_fn (decl
);
12181 TREE_TYPE (decl
) = coerce_new_type (TREE_TYPE (decl
));
12183 else if (operator_code
== DELETE_EXPR
|| operator_code
== VEC_DELETE_EXPR
)
12186 revert_static_member_fn (decl
);
12188 TREE_TYPE (decl
) = coerce_delete_type (TREE_TYPE (decl
));
12192 /* An operator function must either be a non-static member function
12193 or have at least one parameter of a class, a reference to a class,
12194 an enumeration, or a reference to an enumeration. 13.4.0.6 */
12195 if (! methodp
|| DECL_STATIC_FUNCTION_P (decl
))
12197 if (operator_code
== TYPE_EXPR
12198 || operator_code
== CALL_EXPR
12199 || operator_code
== COMPONENT_REF
12200 || operator_code
== ARRAY_REF
12201 || operator_code
== NOP_EXPR
)
12202 cp_error ("`%D' must be a nonstatic member function", decl
);
12207 if (DECL_STATIC_FUNCTION_P (decl
))
12208 cp_error ("`%D' must be either a non-static member function or a non-member function", decl
);
12211 for (; TREE_CODE (TREE_VALUE (p
)) != VOID_TYPE
; p
= TREE_CHAIN (p
))
12213 tree arg
= TREE_VALUE (p
);
12214 if (TREE_CODE (arg
) == REFERENCE_TYPE
)
12215 arg
= TREE_TYPE (arg
);
12217 /* This lets bad template code slip through. */
12218 if (IS_AGGR_TYPE (arg
)
12219 || TREE_CODE (arg
) == ENUMERAL_TYPE
12220 || TREE_CODE (arg
) == TEMPLATE_TYPE_PARM
12221 || TREE_CODE (arg
) == BOUND_TEMPLATE_TEMPLATE_PARM
)
12225 ("`%D' must have an argument of class or enumerated type",
12232 if (operator_code
== CALL_EXPR
)
12233 return; /* No restrictions on args. */
12235 if (IDENTIFIER_TYPENAME_P (name
) && ! DECL_TEMPLATE_INFO (decl
))
12237 tree t
= TREE_TYPE (name
);
12240 int ref
= (TREE_CODE (t
) == REFERENCE_TYPE
);
12241 const char *what
= 0;
12244 t
= TYPE_MAIN_VARIANT (TREE_TYPE (t
));
12246 if (TREE_CODE (t
) == VOID_TYPE
)
12248 else if (t
== current_class_type
)
12249 what
= "the same type";
12250 /* Don't force t to be complete here. */
12251 else if (IS_AGGR_TYPE (t
)
12252 && COMPLETE_TYPE_P (t
)
12253 && DERIVED_FROM_P (t
, current_class_type
))
12254 what
= "a base class";
12257 warning ("conversion to %s%s will never use a type conversion operator",
12258 ref
? "a reference to " : "", what
);
12262 if (DECL_ASSIGNMENT_OPERATOR_P (decl
)
12263 && operator_code
== NOP_EXPR
)
12267 if (arity
!= 2 && methodp
)
12269 cp_error ("`%D' must take exactly one argument", decl
);
12272 parmtype
= TREE_VALUE (TREE_CHAIN (argtypes
));
12276 A user-declared copy assignment operator X::operator= is
12277 a non-static non-template member function of class X with
12278 exactly one parameter of type X, X&, const X&, volatile
12279 X& or const volatile X&. */
12280 if (copy_assignment_arg_p (parmtype
, virtualp
)
12281 && !(DECL_TEMPLATE_INSTANTIATION (decl
)
12282 && is_member_template (DECL_TI_TEMPLATE (decl
)))
12285 TYPE_HAS_ASSIGN_REF (current_class_type
) = 1;
12286 if (TREE_CODE (parmtype
) != REFERENCE_TYPE
12287 || CP_TYPE_CONST_P (TREE_TYPE (parmtype
)))
12288 TYPE_HAS_CONST_ASSIGN_REF (current_class_type
) = 1;
12291 else if (operator_code
== COND_EXPR
)
12294 cp_error ("ISO C++ prohibits overloading operator ?:");
12296 else if (ambi_op_p (operator_code
))
12299 /* We pick the one-argument operator codes by default, so
12300 we don't have to change anything. */
12302 else if (arity
== 2)
12304 /* If we thought this was a unary operator, we now know
12305 it to be a binary operator. */
12306 switch (operator_code
)
12309 operator_code
= MULT_EXPR
;
12313 operator_code
= BIT_AND_EXPR
;
12317 operator_code
= PLUS_EXPR
;
12321 operator_code
= MINUS_EXPR
;
12324 case PREINCREMENT_EXPR
:
12325 operator_code
= POSTINCREMENT_EXPR
;
12328 case PREDECREMENT_EXPR
:
12329 operator_code
= POSTDECREMENT_EXPR
;
12333 my_friendly_abort (20000527);
12336 SET_OVERLOADED_OPERATOR_CODE (decl
, operator_code
);
12338 if ((operator_code
== POSTINCREMENT_EXPR
12339 || operator_code
== POSTDECREMENT_EXPR
)
12340 && ! processing_template_decl
12341 && ! same_type_p (TREE_VALUE (TREE_CHAIN (argtypes
)), integer_type_node
))
12344 cp_error ("postfix `%D' must take `int' as its argument",
12348 ("postfix `%D' must take `int' as its second argument",
12355 cp_error ("`%D' must take either zero or one argument", decl
);
12357 cp_error ("`%D' must take either one or two arguments", decl
);
12360 /* More Effective C++ rule 6. */
12362 && (operator_code
== POSTINCREMENT_EXPR
12363 || operator_code
== POSTDECREMENT_EXPR
12364 || operator_code
== PREINCREMENT_EXPR
12365 || operator_code
== PREDECREMENT_EXPR
))
12367 tree arg
= TREE_VALUE (argtypes
);
12368 tree ret
= TREE_TYPE (TREE_TYPE (decl
));
12369 if (methodp
|| TREE_CODE (arg
) == REFERENCE_TYPE
)
12370 arg
= TREE_TYPE (arg
);
12371 arg
= TYPE_MAIN_VARIANT (arg
);
12372 if (operator_code
== PREINCREMENT_EXPR
12373 || operator_code
== PREDECREMENT_EXPR
)
12375 if (TREE_CODE (ret
) != REFERENCE_TYPE
12376 || !same_type_p (TYPE_MAIN_VARIANT (TREE_TYPE (ret
)),
12378 cp_warning ("prefix `%D' should return `%T'", decl
,
12379 build_reference_type (arg
));
12383 if (!same_type_p (TYPE_MAIN_VARIANT (ret
), arg
))
12384 cp_warning ("postfix `%D' should return `%T'", decl
, arg
);
12388 else if (unary_op_p (operator_code
))
12393 cp_error ("`%D' must take `void'", decl
);
12395 cp_error ("`%D' must take exactly one argument", decl
);
12398 else /* if (binary_op_p (operator_code)) */
12403 cp_error ("`%D' must take exactly one argument", decl
);
12405 cp_error ("`%D' must take exactly two arguments", decl
);
12408 /* More Effective C++ rule 7. */
12410 && (operator_code
== TRUTH_ANDIF_EXPR
12411 || operator_code
== TRUTH_ORIF_EXPR
12412 || operator_code
== COMPOUND_EXPR
))
12413 cp_warning ("user-defined `%D' always evaluates both arguments",
12417 /* Effective C++ rule 23. */
12420 && (operator_code
== PLUS_EXPR
12421 || operator_code
== MINUS_EXPR
12422 || operator_code
== TRUNC_DIV_EXPR
12423 || operator_code
== MULT_EXPR
)
12424 && TREE_CODE (TREE_TYPE (TREE_TYPE (decl
))) == REFERENCE_TYPE
)
12425 cp_warning ("`%D' should return by value", decl
);
12428 for (; argtypes
&& argtypes
!= void_list_node
;
12429 argtypes
= TREE_CHAIN (argtypes
))
12430 if (TREE_PURPOSE (argtypes
))
12432 TREE_PURPOSE (argtypes
) = NULL_TREE
;
12433 if (operator_code
== POSTINCREMENT_EXPR
12434 || operator_code
== POSTDECREMENT_EXPR
)
12437 cp_pedwarn ("`%D' cannot have default arguments", decl
);
12440 cp_error ("`%D' cannot have default arguments", decl
);
12446 static const char *
12448 enum tag_types code
;
12461 my_friendly_abort (981122);
12465 /* Get the struct, enum or union (CODE says which) with tag NAME.
12466 Define the tag as a forward-reference if it is not defined.
12468 C++: If a class derivation is given, process it here, and report
12469 an error if multiple derivation declarations are not identical.
12471 If this is a definition, come in through xref_tag and only look in
12472 the current frame for the name (since C++ allows new names in any
12476 xref_tag (code_type_node
, name
, globalize
)
12477 tree code_type_node
;
12481 enum tag_types tag_code
;
12482 enum tree_code code
;
12483 register tree ref
, t
;
12484 struct binding_level
*b
= current_binding_level
;
12486 tree attributes
= NULL_TREE
;
12487 tree context
= NULL_TREE
;
12489 /* If we are called from the parser, code_type_node will sometimes be a
12490 TREE_LIST. This indicates that the user wrote
12491 "class __attribute__ ((foo)) bar". Extract the attributes so we can
12493 if (TREE_CODE (code_type_node
) == TREE_LIST
)
12495 attributes
= TREE_PURPOSE (code_type_node
);
12496 code_type_node
= TREE_VALUE (code_type_node
);
12499 tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12504 code
= RECORD_TYPE
;
12510 code
= ENUMERAL_TYPE
;
12513 my_friendly_abort (18);
12516 /* If a cross reference is requested, look up the type
12517 already defined for this tag and return it. */
12521 name
= TYPE_IDENTIFIER (t
);
12525 t
= IDENTIFIER_TYPE_VALUE (name
);
12527 /* Warn about 'friend struct Inherited;' doing the wrong thing. */
12528 if (t
&& globalize
&& TREE_CODE (t
) == TYPENAME_TYPE
)
12530 static int explained
;
12532 cp_warning ("`%s %T' declares a new type at namespace scope;\n\
12533 to refer to the inherited type, say `%s %T::%T'%s",
12534 tag_name (tag_code
), name
, tag_name (tag_code
),
12535 constructor_name (current_class_type
), TYPE_IDENTIFIER (t
),
12537 (names from dependent base classes are not visible to unqualified name lookup)"
12543 if (t
&& TREE_CODE (t
) != code
&& TREE_CODE (t
) != TEMPLATE_TYPE_PARM
12544 && TREE_CODE (t
) != BOUND_TEMPLATE_TEMPLATE_PARM
)
12549 /* If we know we are defining this tag, only look it up in
12550 this scope and don't try to find it as a type. */
12551 ref
= lookup_tag (code
, name
, b
, 1);
12557 /* [dcl.type.elab] If the identifier resolves to a
12558 typedef-name or a template type-parameter, the
12559 elaborated-type-specifier is ill-formed. */
12560 if (t
!= TYPE_MAIN_VARIANT (t
)
12561 || (CLASS_TYPE_P (t
) && TYPE_WAS_ANONYMOUS (t
)))
12562 cp_pedwarn ("using typedef-name `%D' after `%s'",
12563 TYPE_NAME (t
), tag_name (tag_code
));
12564 else if (TREE_CODE (t
) == TEMPLATE_TYPE_PARM
)
12565 cp_error ("using template type parameter `%T' after `%s'",
12566 t
, tag_name (tag_code
));
12571 ref
= lookup_tag (code
, name
, b
, 0);
12575 /* Try finding it as a type declaration. If that wins,
12577 ref
= lookup_name (name
, 1);
12579 if (ref
!= NULL_TREE
12580 && processing_template_decl
12581 && DECL_CLASS_TEMPLATE_P (ref
)
12582 && template_class_depth (current_class_type
) == 0)
12583 /* Since GLOBALIZE is true, we're declaring a global
12584 template, so we want this type. */
12585 ref
= DECL_TEMPLATE_RESULT (ref
);
12587 if (ref
&& TREE_CODE (ref
) == TYPE_DECL
12588 && TREE_CODE (TREE_TYPE (ref
)) == code
)
12589 ref
= TREE_TYPE (ref
);
12594 if (ref
&& current_class_type
12595 && template_class_depth (current_class_type
)
12596 && PROCESSING_REAL_TEMPLATE_DECL_P ())
12598 /* Since GLOBALIZE is non-zero, we are not looking at a
12599 definition of this tag. Since, in addition, we are currently
12600 processing a (member) template declaration of a template
12601 class, we must be very careful; consider:
12608 { template <class V>
12609 friend struct S1; };
12611 Here, the S2::S1 declaration should not be confused with the
12612 outer declaration. In particular, the inner version should
12613 have a template parameter of level 2, not level 1. This
12614 would be particularly important if the member declaration
12617 template <class V = U> friend struct S1;
12619 say, when we should tsubst into `U' when instantiating
12620 S2. On the other hand, when presented with:
12630 we must find the inner binding eventually. We
12631 accomplish this by making sure that the new type we
12632 create to represent this declaration has the right
12634 context
= TYPE_CONTEXT (ref
);
12641 /* If no such tag is yet defined, create a forward-reference node
12642 and record it as the "definition".
12643 When a real declaration of this type is found,
12644 the forward-reference will be altered into a real type. */
12645 if (code
== ENUMERAL_TYPE
)
12647 cp_error ("use of enum `%#D' without previous declaration", name
);
12649 ref
= make_node (ENUMERAL_TYPE
);
12651 /* Give the type a default layout like unsigned int
12652 to avoid crashing if it does not get defined. */
12653 TYPE_MODE (ref
) = TYPE_MODE (unsigned_type_node
);
12654 TYPE_ALIGN (ref
) = TYPE_ALIGN (unsigned_type_node
);
12655 TYPE_USER_ALIGN (ref
) = 0;
12656 TREE_UNSIGNED (ref
) = 1;
12657 TYPE_PRECISION (ref
) = TYPE_PRECISION (unsigned_type_node
);
12658 TYPE_MIN_VALUE (ref
) = TYPE_MIN_VALUE (unsigned_type_node
);
12659 TYPE_MAX_VALUE (ref
) = TYPE_MAX_VALUE (unsigned_type_node
);
12661 /* Enable us to recognize when a type is created in class context.
12662 To do nested classes correctly, this should probably be cleared
12663 out when we leave this classes scope. Currently this in only
12664 done in `start_enum'. */
12666 pushtag (name
, ref
, globalize
);
12670 struct binding_level
*old_b
= class_binding_level
;
12672 ref
= make_aggr_type (code
);
12673 TYPE_CONTEXT (ref
) = context
;
12675 #ifdef NONNESTED_CLASSES
12676 /* Class types don't nest the way enums do. */
12677 class_binding_level
= (struct binding_level
*)0;
12679 pushtag (name
, ref
, globalize
);
12680 class_binding_level
= old_b
;
12685 if (!globalize
&& processing_template_decl
&& IS_AGGR_TYPE (ref
))
12686 redeclare_class_template (ref
, current_template_parms
);
12689 /* Until the type is defined, tentatively accept whatever
12690 structure tag the user hands us. */
12691 if (!COMPLETE_TYPE_P (ref
)
12692 && ref
!= current_class_type
12693 /* Have to check this, in case we have contradictory tag info. */
12694 && IS_AGGR_TYPE_CODE (TREE_CODE (ref
)))
12696 if (tag_code
== class_type
)
12697 CLASSTYPE_DECLARED_CLASS (ref
) = 1;
12698 else if (tag_code
== record_type
)
12699 CLASSTYPE_DECLARED_CLASS (ref
) = 0;
12702 TREE_TYPE (ref
) = attributes
;
12708 xref_tag_from_type (old
, id
, globalize
)
12712 tree code_type_node
;
12714 if (TREE_CODE (old
) == RECORD_TYPE
)
12715 code_type_node
= (CLASSTYPE_DECLARED_CLASS (old
)
12716 ? class_type_node
: record_type_node
);
12718 code_type_node
= union_type_node
;
12720 if (id
== NULL_TREE
)
12721 id
= TYPE_IDENTIFIER (old
);
12723 return xref_tag (code_type_node
, id
, globalize
);
12726 /* REF is a type (named NAME), for which we have just seen some
12727 baseclasses. BINFO is a list of those baseclasses; the
12728 TREE_PURPOSE is an access_* node, and the TREE_VALUE is the type of
12729 the base-class. CODE_TYPE_NODE indicates whether REF is a class,
12730 struct, or union. */
12733 xref_basetypes (code_type_node
, name
, ref
, binfo
)
12734 tree code_type_node
;
12738 /* In the declaration `A : X, Y, ... Z' we mark all the types
12739 (A, X, Y, ..., Z) so we can check for duplicates. */
12744 enum tag_types tag_code
= (enum tag_types
) tree_low_cst (code_type_node
, 1);
12746 if (tag_code
== union_type
)
12748 cp_error ("derived union `%T' invalid", ref
);
12752 len
= list_length (binfo
);
12754 /* First, make sure that any templates in base-classes are
12755 instantiated. This ensures that if we call ourselves recursively
12756 we do not get confused about which classes are marked and which
12758 for (base
= binfo
; base
; base
= TREE_CHAIN (base
))
12759 complete_type (TREE_VALUE (base
));
12761 SET_CLASSTYPE_MARKED (ref
);
12762 BINFO_BASETYPES (TYPE_BINFO (ref
)) = binfos
= make_tree_vec (len
);
12764 for (i
= 0; binfo
; binfo
= TREE_CHAIN (binfo
))
12766 /* The base of a derived struct is public by default. */
12768 = (TREE_PURPOSE (binfo
) == access_public_node
12769 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12770 || (tag_code
!= class_type
12771 && (TREE_PURPOSE (binfo
) == access_default_node
12772 || TREE_PURPOSE (binfo
) == access_default_virtual_node
)));
12774 = (TREE_PURPOSE (binfo
) == access_protected_node
12775 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
);
12777 = (TREE_PURPOSE (binfo
) == access_private_virtual_node
12778 || TREE_PURPOSE (binfo
) == access_protected_virtual_node
12779 || TREE_PURPOSE (binfo
) == access_public_virtual_node
12780 || TREE_PURPOSE (binfo
) == access_default_virtual_node
);
12781 tree basetype
= TREE_VALUE (binfo
);
12784 if (basetype
&& TREE_CODE (basetype
) == TYPE_DECL
)
12785 basetype
= TREE_TYPE (basetype
);
12787 || (TREE_CODE (basetype
) != RECORD_TYPE
12788 && TREE_CODE (basetype
) != TYPENAME_TYPE
12789 && TREE_CODE (basetype
) != TEMPLATE_TYPE_PARM
12790 && TREE_CODE (basetype
) != BOUND_TEMPLATE_TEMPLATE_PARM
))
12792 cp_error ("base type `%T' fails to be a struct or class type",
12793 TREE_VALUE (binfo
));
12797 GNU_xref_hier (name
, basetype
, via_public
, via_virtual
, 0);
12799 /* This code replaces similar code in layout_basetypes.
12800 We put the complete_type first for implicit `typename'. */
12801 if (!COMPLETE_TYPE_P (basetype
)
12802 && ! (current_template_parms
&& uses_template_parms (basetype
)))
12804 cp_error ("base class `%T' has incomplete type", basetype
);
12809 if (CLASSTYPE_MARKED (basetype
))
12811 if (basetype
== ref
)
12812 cp_error ("recursive type `%T' undefined", basetype
);
12814 cp_error ("duplicate base type `%T' invalid", basetype
);
12818 if (TYPE_FOR_JAVA (basetype
)
12819 && (current_lang_stack
12820 == &VARRAY_TREE (current_lang_base
, 0)))
12821 TYPE_FOR_JAVA (ref
) = 1;
12823 /* Note that the BINFO records which describe individual
12824 inheritances are *not* shared in the lattice! They
12825 cannot be shared because a given baseclass may be
12826 inherited with different `accessibility' by different
12827 derived classes. (Each BINFO record describing an
12828 individual inheritance contains flags which say what
12829 the `accessibility' of that particular inheritance is.) */
12832 = make_binfo (size_zero_node
, basetype
,
12833 CLASS_TYPE_P (basetype
)
12834 ? TYPE_BINFO_VTABLE (basetype
) : NULL_TREE
,
12835 CLASS_TYPE_P (basetype
)
12836 ? TYPE_BINFO_VIRTUALS (basetype
) : NULL_TREE
);
12838 TREE_VEC_ELT (binfos
, i
) = base_binfo
;
12839 TREE_VIA_PUBLIC (base_binfo
) = via_public
;
12840 TREE_VIA_PROTECTED (base_binfo
) = via_protected
;
12841 TREE_VIA_VIRTUAL (base_binfo
) = via_virtual
;
12842 BINFO_INHERITANCE_CHAIN (base_binfo
) = TYPE_BINFO (ref
);
12844 /* We need to unshare the binfos now so that lookups during class
12845 definition work. */
12846 unshare_base_binfos (base_binfo
);
12848 SET_CLASSTYPE_MARKED (basetype
);
12850 /* We are free to modify these bits because they are meaningless
12851 at top level, and BASETYPE is a top-level type. */
12852 if (via_virtual
|| TYPE_USES_VIRTUAL_BASECLASSES (basetype
))
12854 TYPE_USES_VIRTUAL_BASECLASSES (ref
) = 1;
12855 /* Converting to a virtual base class requires looking
12856 up the offset of the virtual base. */
12857 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
12860 if (CLASS_TYPE_P (basetype
))
12862 TYPE_HAS_NEW_OPERATOR (ref
)
12863 |= TYPE_HAS_NEW_OPERATOR (basetype
);
12864 TYPE_HAS_ARRAY_NEW_OPERATOR (ref
)
12865 |= TYPE_HAS_ARRAY_NEW_OPERATOR (basetype
);
12866 TYPE_GETS_DELETE (ref
) |= TYPE_GETS_DELETE (basetype
);
12867 /* If the base-class uses multiple inheritance, so do we. */
12868 TYPE_USES_MULTIPLE_INHERITANCE (ref
)
12869 |= TYPE_USES_MULTIPLE_INHERITANCE (basetype
);
12870 /* Likewise, if converting to a base of the base may require
12871 code, then we may need to generate code to convert to a
12873 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
)
12874 |= TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (basetype
);
12881 TREE_VEC_LENGTH (binfos
) = i
;
12883 BINFO_BASETYPES (TYPE_BINFO (ref
)) = NULL_TREE
;
12887 TYPE_USES_MULTIPLE_INHERITANCE (ref
) = 1;
12888 /* If there is more than one non-empty they cannot be at the same
12890 TYPE_BASE_CONVS_MAY_REQUIRE_CODE_P (ref
) = 1;
12893 /* Unmark all the types. */
12895 CLEAR_CLASSTYPE_MARKED (BINFO_TYPE (TREE_VEC_ELT (binfos
, i
)));
12896 CLEAR_CLASSTYPE_MARKED (ref
);
12898 /* Now that we know all the base-classes, set up the list of virtual
12900 get_vbase_types (ref
);
12904 /* Begin compiling the definition of an enumeration type.
12905 NAME is its name (or null if anonymous).
12906 Returns the type object, as yet incomplete.
12907 Also records info about it so that build_enumerator
12908 may be used to declare the individual values as they are read. */
12914 register tree enumtype
= NULL_TREE
;
12915 struct binding_level
*b
= current_binding_level
;
12917 /* If this is the real definition for a previous forward reference,
12918 fill in the contents in the same object that used to be the
12919 forward reference. */
12921 if (name
!= NULL_TREE
)
12922 enumtype
= lookup_tag (ENUMERAL_TYPE
, name
, b
, 1);
12924 if (enumtype
!= NULL_TREE
&& TREE_CODE (enumtype
) == ENUMERAL_TYPE
)
12926 cp_error ("multiple definition of `%#T'", enumtype
);
12927 cp_error_at ("previous definition here", enumtype
);
12928 /* Clear out TYPE_VALUES, and start again. */
12929 TYPE_VALUES (enumtype
) = NULL_TREE
;
12933 enumtype
= make_node (ENUMERAL_TYPE
);
12934 pushtag (name
, enumtype
, 0);
12937 if (current_class_type
)
12938 TREE_ADDRESSABLE (b
->tags
) = 1;
12940 GNU_xref_decl (current_function_decl
, enumtype
);
12944 /* After processing and defining all the values of an enumeration type,
12945 install their decls in the enumeration type and finish it off.
12946 ENUMTYPE is the type object and VALUES a list of name-value pairs.
12947 Returns ENUMTYPE. */
12950 finish_enum (enumtype
)
12953 register tree minnode
= NULL_TREE
, maxnode
= NULL_TREE
;
12954 /* Calculate the maximum value of any enumerator in this type. */
12956 tree values
= TYPE_VALUES (enumtype
);
12961 for (pair
= values
; pair
; pair
= TREE_CHAIN (pair
))
12966 /* The TREE_VALUE is a CONST_DECL for this enumeration
12968 decl
= TREE_VALUE (pair
);
12972 Following the closing brace of an enum-specifier, each
12973 enumerator has the type of its enumeration. Prior to the
12974 closing brace, the type of each enumerator is the type of
12975 its initializing value. */
12976 TREE_TYPE (decl
) = enumtype
;
12978 /* The DECL_INITIAL will be NULL if we are processing a
12979 template declaration and this enumeration constant had no
12980 explicit initializer. */
12981 value
= DECL_INITIAL (decl
);
12982 if (value
&& !processing_template_decl
)
12984 /* Set the TREE_TYPE for the VALUE as well. That's so
12985 that when we call decl_constant_value we get an
12986 entity of the right type (but with the constant
12987 value). Since we shouldn't ever call
12988 decl_constant_value on a template type, there's no
12989 reason to do that when processing_template_decl.
12990 And, if the expression is something like a
12991 TEMPLATE_PARM_INDEX or a CAST_EXPR doing so will
12992 wreak havoc on the intended type of the expression.
12994 Of course, there's also no point in trying to compute
12995 minimum or maximum values if we're in a template. */
12996 TREE_TYPE (value
) = enumtype
;
12999 minnode
= maxnode
= value
;
13000 else if (tree_int_cst_lt (maxnode
, value
))
13002 else if (tree_int_cst_lt (value
, minnode
))
13006 if (processing_template_decl
)
13007 /* If this is just a template, leave the CONST_DECL
13008 alone. That way tsubst_copy will find CONST_DECLs for
13009 CONST_DECLs, and not INTEGER_CSTs. */
13012 /* In the list we're building up, we want the enumeration
13013 values, not the CONST_DECLs. */
13014 TREE_VALUE (pair
) = value
;
13018 maxnode
= minnode
= integer_zero_node
;
13020 TYPE_VALUES (enumtype
) = nreverse (values
);
13022 if (processing_template_decl
)
13024 tree scope
= current_scope ();
13025 if (scope
&& TREE_CODE (scope
) == FUNCTION_DECL
)
13026 add_stmt (build_min (TAG_DEFN
, enumtype
));
13030 int unsignedp
= tree_int_cst_sgn (minnode
) >= 0;
13031 int lowprec
= min_precision (minnode
, unsignedp
);
13032 int highprec
= min_precision (maxnode
, unsignedp
);
13033 int precision
= MAX (lowprec
, highprec
);
13036 TYPE_SIZE (enumtype
) = NULL_TREE
;
13038 /* Set TYPE_MIN_VALUE and TYPE_MAX_VALUE according to `precision'. */
13040 TYPE_PRECISION (enumtype
) = precision
;
13042 fixup_unsigned_type (enumtype
);
13044 fixup_signed_type (enumtype
);
13046 if (flag_short_enums
|| (precision
> TYPE_PRECISION (integer_type_node
)))
13047 /* Use the width of the narrowest normal C type which is wide
13049 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (type_for_size
13052 TYPE_PRECISION (enumtype
) = TYPE_PRECISION (integer_type_node
);
13054 TYPE_SIZE (enumtype
) = 0;
13055 layout_type (enumtype
);
13057 /* Fix up all variant types of this enum type. */
13058 for (tem
= TYPE_MAIN_VARIANT (enumtype
); tem
;
13059 tem
= TYPE_NEXT_VARIANT (tem
))
13061 TYPE_VALUES (tem
) = TYPE_VALUES (enumtype
);
13062 TYPE_MIN_VALUE (tem
) = TYPE_MIN_VALUE (enumtype
);
13063 TYPE_MAX_VALUE (tem
) = TYPE_MAX_VALUE (enumtype
);
13064 TYPE_SIZE (tem
) = TYPE_SIZE (enumtype
);
13065 TYPE_SIZE_UNIT (tem
) = TYPE_SIZE_UNIT (enumtype
);
13066 TYPE_MODE (tem
) = TYPE_MODE (enumtype
);
13067 TYPE_PRECISION (tem
) = TYPE_PRECISION (enumtype
);
13068 TYPE_ALIGN (tem
) = TYPE_ALIGN (enumtype
);
13069 TYPE_USER_ALIGN (tem
) = TYPE_USER_ALIGN (enumtype
);
13070 TREE_UNSIGNED (tem
) = TREE_UNSIGNED (enumtype
);
13073 /* Finish debugging output for this type. */
13074 rest_of_type_compilation (enumtype
, namespace_bindings_p ());
13080 /* Build and install a CONST_DECL for an enumeration constant of the
13081 enumeration type ENUMTYPE whose NAME and VALUE (if any) are provided.
13082 Assignment of sequential values by default is handled here. */
13085 build_enumerator (name
, value
, enumtype
)
13095 /* Remove no-op casts from the value. */
13097 STRIP_TYPE_NOPS (value
);
13099 if (! processing_template_decl
)
13101 /* Validate and default VALUE. */
13102 if (value
!= NULL_TREE
)
13104 value
= decl_constant_value (value
);
13106 if (TREE_CODE (value
) == INTEGER_CST
)
13108 value
= default_conversion (value
);
13109 constant_expression_warning (value
);
13113 cp_error ("enumerator value for `%D' not integer constant", name
);
13118 /* Default based on previous value. */
13119 if (value
== NULL_TREE
&& ! processing_template_decl
)
13123 if (TYPE_VALUES (enumtype
))
13125 /* The next value is the previous value ... */
13126 prev_value
= DECL_INITIAL (TREE_VALUE (TYPE_VALUES (enumtype
)));
13127 /* ... plus one. */
13128 value
= cp_build_binary_op (PLUS_EXPR
,
13132 if (tree_int_cst_lt (value
, prev_value
))
13133 cp_error ("overflow in enumeration values at `%D'", name
);
13136 value
= integer_zero_node
;
13139 /* Remove no-op casts from the value. */
13141 STRIP_TYPE_NOPS (value
);
13143 /* To fix MAX_VAL enum consts. (bkoz) */
13144 TREE_TYPE (value
) = integer_type_node
;
13148 /* We always have to copy here; not all INTEGER_CSTs are unshared.
13149 Even in other cases, we will later (in finish_enum) be setting
13150 the type of VALUE. But, we don't need to make a copy if this
13151 VALUE is one of the enumeration constants for this same
13152 enumeration type. */
13153 for (values
= TYPE_VALUES (enumtype
); values
; values
= TREE_CHAIN (values
))
13154 if (TREE_VALUE (values
) == value
)
13156 /* If we didn't break out of the loop, then we do need a copy. */
13157 if (!values
&& value
)
13158 value
= copy_node (value
);
13160 /* C++ associates enums with global, function, or class declarations. */
13161 context
= current_scope ();
13163 /* Build the actual enumeration constant. Note that the enumeration
13164 constants have the type of their initializers until the
13165 enumeration is complete:
13169 Following the closing brace of an enum-specifier, each enumer-
13170 ator has the type of its enumeration. Prior to the closing
13171 brace, the type of each enumerator is the type of its
13172 initializing value.
13174 In finish_enum we will reset the type. Of course, if we're
13175 processing a template, there may be no value. */
13176 type
= value
? TREE_TYPE (value
) : NULL_TREE
;
13178 if (context
&& context
== current_class_type
)
13179 /* This enum declaration is local to the class. We need the full
13180 lang_decl so that we can record DECL_CLASS_CONTEXT, for example. */
13181 decl
= build_lang_decl (CONST_DECL
, name
, type
);
13183 /* It's a global enum, or it's local to a function. (Note local to
13184 a function could mean local to a class method. */
13185 decl
= build_decl (CONST_DECL
, name
, type
);
13187 DECL_CONTEXT (decl
) = FROB_CONTEXT (context
);
13188 DECL_INITIAL (decl
) = value
;
13189 TREE_READONLY (decl
) = 1;
13191 if (context
&& context
== current_class_type
)
13192 /* In something like `struct S { enum E { i = 7 }; };' we put `i'
13193 on the TYPE_FIELDS list for `S'. (That's so that you can say
13194 things like `S::i' later.) */
13195 finish_member_declaration (decl
);
13199 GNU_xref_decl (current_function_decl
, decl
);
13202 /* Add this enumeration constant to the list for this type. */
13203 TYPE_VALUES (enumtype
) = tree_cons (name
, decl
, TYPE_VALUES (enumtype
));
13207 /* We're defining DECL. Make sure that it's type is OK. */
13210 check_function_type (decl
, current_function_parms
)
13212 tree current_function_parms
;
13214 tree fntype
= TREE_TYPE (decl
);
13215 tree return_type
= complete_type (TREE_TYPE (fntype
));
13217 /* In a function definition, arg types must be complete. */
13218 require_complete_types_for_parms (current_function_parms
);
13220 if (!COMPLETE_OR_VOID_TYPE_P (return_type
))
13222 cp_error ("return type `%#T' is incomplete", TREE_TYPE (fntype
));
13224 /* Make it return void instead, but don't change the
13225 type of the DECL_RESULT, in case we have a named return value. */
13226 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13228 tree ctype
= TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype
)));
13230 = build_cplus_method_type (ctype
,
13232 FUNCTION_ARG_CHAIN (decl
));
13236 = build_function_type (void_type_node
,
13237 TYPE_ARG_TYPES (TREE_TYPE (decl
)));
13239 = build_exception_variant (fntype
,
13240 TYPE_RAISES_EXCEPTIONS (fntype
));
13243 abstract_virtuals_error (decl
, TREE_TYPE (fntype
));
13246 /* Create the FUNCTION_DECL for a function definition.
13247 DECLSPECS and DECLARATOR are the parts of the declaration;
13248 they describe the function's name and the type it returns,
13249 but twisted together in a fashion that parallels the syntax of C.
13251 FLAGS is a bitwise or of SF_PRE_PARSED (indicating that the
13252 DECLARATOR is really the DECL for the function we are about to
13253 process and that DECLSPECS should be ignored), SF_INCLASS_INLINE
13254 indicating that the function is an inline defined in-class.
13256 This function creates a binding context for the function body
13257 as well as setting up the FUNCTION_DECL in current_function_decl.
13259 Returns 1 on success. If the DECLARATOR is not suitable for a function
13260 (it defines a datum instead), we return 0, which tells
13261 yyparse to report a parse error.
13263 For C++, we must first check whether that datum makes any sense.
13264 For example, "class A local_a(1,2);" means that variable local_a
13265 is an aggregate of type A, which should have a constructor
13266 applied to it with the argument list [1, 2]. */
13269 start_function (declspecs
, declarator
, attrs
, flags
)
13270 tree declspecs
, declarator
, attrs
;
13274 tree ctype
= NULL_TREE
;
13277 extern int have_extern_spec
;
13278 extern int used_extern_spec
;
13279 int doing_friend
= 0;
13280 struct binding_level
*bl
;
13281 tree current_function_parms
;
13283 /* Sanity check. */
13284 my_friendly_assert (TREE_CODE (TREE_VALUE (void_list_node
)) == VOID_TYPE
, 160);
13285 my_friendly_assert (TREE_CHAIN (void_list_node
) == NULL_TREE
, 161);
13287 /* This should only be done once on the top most decl. */
13288 if (have_extern_spec
&& !used_extern_spec
)
13290 declspecs
= tree_cons (NULL_TREE
, get_identifier ("extern"), declspecs
);
13291 used_extern_spec
= 1;
13294 if (flags
& SF_PRE_PARSED
)
13296 decl1
= declarator
;
13298 fntype
= TREE_TYPE (decl1
);
13299 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13300 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13302 /* ISO C++ 11.4/5. A friend function defined in a class is in
13303 the (lexical) scope of the class in which it is defined. */
13304 if (!ctype
&& DECL_FRIEND_P (decl1
))
13306 ctype
= DECL_FRIEND_CONTEXT (decl1
);
13308 /* CTYPE could be null here if we're dealing with a template;
13309 for example, `inline friend float foo()' inside a template
13310 will have no CTYPE set. */
13311 if (ctype
&& TREE_CODE (ctype
) != RECORD_TYPE
)
13317 last_function_parms
= DECL_ARGUMENTS (decl1
);
13318 last_function_parm_tags
= NULL_TREE
;
13322 decl1
= grokdeclarator (declarator
, declspecs
, FUNCDEF
, 1, NULL_TREE
);
13323 /* If the declarator is not suitable for a function definition,
13324 cause a syntax error. */
13325 if (decl1
== NULL_TREE
|| TREE_CODE (decl1
) != FUNCTION_DECL
) return 0;
13327 fntype
= TREE_TYPE (decl1
);
13329 restype
= TREE_TYPE (fntype
);
13330 if (CLASS_TYPE_P (restype
) && !CLASSTYPE_GOT_SEMICOLON (restype
))
13332 cp_error ("semicolon missing after declaration of `%#T'", restype
);
13333 shadow_tag (build_tree_list (NULL_TREE
, restype
));
13334 CLASSTYPE_GOT_SEMICOLON (restype
) = 1;
13335 if (TREE_CODE (fntype
) == FUNCTION_TYPE
)
13336 fntype
= build_function_type (integer_type_node
,
13337 TYPE_ARG_TYPES (fntype
));
13339 fntype
= build_cplus_method_type (build_type_variant (TYPE_METHOD_BASETYPE (fntype
), TREE_READONLY (decl1
), TREE_SIDE_EFFECTS (decl1
)),
13341 TYPE_ARG_TYPES (fntype
));
13342 TREE_TYPE (decl1
) = fntype
;
13345 if (TREE_CODE (fntype
) == METHOD_TYPE
)
13346 ctype
= TYPE_METHOD_BASETYPE (fntype
);
13347 else if (DECL_MAIN_P (decl1
))
13349 /* If this doesn't return integer_type, complain. */
13350 if (TREE_TYPE (TREE_TYPE (decl1
)) != integer_type_node
)
13352 if (pedantic
|| warn_return_type
)
13353 pedwarn ("return type for `main' changed to `int'");
13354 TREE_TYPE (decl1
) = fntype
= default_function_type
;
13359 /* Sometimes we don't notice that a function is a static member, and
13360 build a METHOD_TYPE for it. Fix that up now. */
13361 if (ctype
!= NULL_TREE
&& DECL_STATIC_FUNCTION_P (decl1
)
13362 && TREE_CODE (TREE_TYPE (decl1
)) == METHOD_TYPE
)
13364 revert_static_member_fn (decl1
);
13365 last_function_parms
= TREE_CHAIN (last_function_parms
);
13369 /* Warn if function was previously implicitly declared
13370 (but not if we warned then). */
13371 if (! warn_implicit
13372 && IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)) != NULL_TREE
)
13373 cp_warning_at ("`%D' implicitly declared before its definition", IDENTIFIER_IMPLICIT_DECL (DECL_NAME (decl1
)));
13375 /* Set up current_class_type, and enter the scope of the class, if
13378 push_nested_class (ctype
, 1);
13379 else if (DECL_STATIC_FUNCTION_P (decl1
))
13380 push_nested_class (DECL_CONTEXT (decl1
), 2);
13382 /* Now that we have entered the scope of the class, we must restore
13383 the bindings for any template parameters surrounding DECL1, if it
13384 is an inline member template. (Order is important; consider the
13385 case where a template parameter has the same name as a field of
13386 the class.) It is not until after this point that
13387 PROCESSING_TEMPLATE_DECL is guaranteed to be set up correctly. */
13388 if (flags
& SF_INCLASS_INLINE
)
13389 maybe_begin_member_template_processing (decl1
);
13391 /* Effective C++ rule 15. */
13393 && DECL_OVERLOADED_OPERATOR_P (decl1
) == NOP_EXPR
13394 && TREE_CODE (TREE_TYPE (fntype
)) == VOID_TYPE
)
13395 cp_warning ("`operator=' should return a reference to `*this'");
13397 /* Make the init_value nonzero so pushdecl knows this is not tentative.
13398 error_mark_node is replaced below (in poplevel) with the BLOCK. */
13399 if (!DECL_INITIAL (decl1
))
13400 DECL_INITIAL (decl1
) = error_mark_node
;
13402 #ifdef SET_DEFAULT_DECL_ATTRIBUTES
13403 SET_DEFAULT_DECL_ATTRIBUTES (decl1
, attrs
);
13406 /* This function exists in static storage.
13407 (This does not mean `static' in the C sense!) */
13408 TREE_STATIC (decl1
) = 1;
13410 /* We must call push_template_decl after current_class_type is set
13411 up. (If we are processing inline definitions after exiting a
13412 class scope, current_class_type will be NULL_TREE until set above
13413 by push_nested_class.) */
13414 if (processing_template_decl
)
13415 decl1
= push_template_decl (decl1
);
13417 /* We are now in the scope of the function being defined. */
13418 current_function_decl
= decl1
;
13420 /* Save the parm names or decls from this function's declarator
13421 where store_parm_decls will find them. */
13422 current_function_parms
= last_function_parms
;
13423 current_function_parm_tags
= last_function_parm_tags
;
13425 /* Make sure the parameter and return types are reasonable. When
13426 you declare a function, these types can be incomplete, but they
13427 must be complete when you define the function. */
13428 if (! processing_template_decl
)
13429 check_function_type (decl1
, current_function_parms
);
13431 /* Build the return declaration for the function. */
13432 restype
= TREE_TYPE (fntype
);
13433 if (!processing_template_decl
)
13435 if (!DECL_RESULT (decl1
))
13437 DECL_RESULT (decl1
)
13438 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13439 c_apply_type_quals_to_decl (CP_TYPE_QUALS (restype
),
13440 DECL_RESULT (decl1
));
13444 /* Just use `void'. Nobody will ever look at this anyhow. */
13445 DECL_RESULT (decl1
) = build_decl (RESULT_DECL
, 0, void_type_node
);
13447 /* Initialize RTL machinery. We cannot do this until
13448 CURRENT_FUNCTION_DECL and DECL_RESULT are set up. We do this
13449 even when processing a template; this is how we get
13450 CFUN set up, and our per-function variables initialized.
13451 FIXME factor out the non-RTL stuff. */
13452 bl
= current_binding_level
;
13453 init_function_start (decl1
, input_filename
, lineno
);
13454 current_binding_level
= bl
;
13456 /* Even though we're inside a function body, we still don't want to
13457 call expand_expr to calculate the size of a variable-sized array.
13458 We haven't necessarily assigned RTL to all variables yet, so it's
13459 not safe to try to expand expressions involving them. */
13460 immediate_size_expand
= 0;
13461 cfun
->x_dont_save_pending_sizes_p
= 1;
13463 /* Start the statement-tree, start the tree now. */
13464 begin_stmt_tree (&DECL_SAVED_TREE (decl1
));
13466 /* Let the user know we're compiling this function. */
13467 announce_function (decl1
);
13469 /* Record the decl so that the function name is defined.
13470 If we already have a decl for this name, and it is a FUNCTION_DECL,
13471 use the old decl. */
13472 if (!processing_template_decl
&& !(flags
& SF_PRE_PARSED
))
13474 /* A specialization is not used to guide overload resolution. */
13475 if (!DECL_TEMPLATE_SPECIALIZATION (decl1
)
13476 && ! DECL_FUNCTION_MEMBER_P (decl1
))
13477 decl1
= pushdecl (decl1
);
13480 /* We need to set the DECL_CONTEXT. */
13481 if (!DECL_CONTEXT (decl1
) && DECL_TEMPLATE_INFO (decl1
))
13482 DECL_CONTEXT (decl1
) = DECL_CONTEXT (DECL_TI_TEMPLATE (decl1
));
13483 /* And make sure we have enough default args. */
13484 check_default_args (decl1
);
13486 fntype
= TREE_TYPE (decl1
);
13489 /* Reset these in case the call to pushdecl changed them. */
13490 current_function_decl
= decl1
;
13491 cfun
->decl
= decl1
;
13493 /* If we are (erroneously) defining a function that we have already
13494 defined before, wipe out what we knew before. */
13495 if (!DECL_PENDING_INLINE_P (decl1
)
13496 && DECL_SAVED_FUNCTION_DATA (decl1
))
13498 free (DECL_SAVED_FUNCTION_DATA (decl1
));
13499 DECL_SAVED_FUNCTION_DATA (decl1
) = NULL
;
13502 if (ctype
&& !doing_friend
&& !DECL_STATIC_FUNCTION_P (decl1
))
13504 /* We know that this was set up by `grokclassfn'. We do not
13505 wait until `store_parm_decls', since evil parse errors may
13506 never get us to that point. Here we keep the consistency
13507 between `current_class_type' and `current_class_ptr'. */
13508 tree t
= DECL_ARGUMENTS (decl1
);
13510 my_friendly_assert (t
!= NULL_TREE
&& TREE_CODE (t
) == PARM_DECL
,
13512 my_friendly_assert (TREE_CODE (TREE_TYPE (t
)) == POINTER_TYPE
,
13515 cp_function_chain
->x_current_class_ref
13516 = build_indirect_ref (t
, NULL_PTR
);
13517 cp_function_chain
->x_current_class_ptr
= t
;
13519 /* Constructors and destructors need to know whether they're "in
13520 charge" of initializing virtual base classes. */
13521 if (DECL_HAS_IN_CHARGE_PARM_P (decl1
))
13522 current_in_charge_parm
= TREE_CHAIN (t
);
13525 if (DECL_INTERFACE_KNOWN (decl1
))
13527 tree ctx
= decl_function_context (decl1
);
13529 if (DECL_NOT_REALLY_EXTERN (decl1
))
13530 DECL_EXTERNAL (decl1
) = 0;
13532 if (ctx
!= NULL_TREE
&& DECL_THIS_INLINE (ctx
)
13533 && TREE_PUBLIC (ctx
))
13534 /* This is a function in a local class in an extern inline
13536 comdat_linkage (decl1
);
13538 /* If this function belongs to an interface, it is public.
13539 If it belongs to someone else's interface, it is also external.
13540 This only affects inlines and template instantiations. */
13541 else if (interface_unknown
== 0
13542 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13543 || flag_alt_external_templates
))
13545 if (DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
)
13546 || processing_template_decl
)
13548 DECL_EXTERNAL (decl1
)
13550 || (DECL_THIS_INLINE (decl1
) && ! flag_implement_inlines
13551 && !DECL_VINDEX (decl1
)));
13553 /* For WIN32 we also want to put these in linkonce sections. */
13554 maybe_make_one_only (decl1
);
13557 DECL_EXTERNAL (decl1
) = 0;
13558 DECL_NOT_REALLY_EXTERN (decl1
) = 0;
13559 DECL_INTERFACE_KNOWN (decl1
) = 1;
13561 else if (interface_unknown
&& interface_only
13562 && (! DECL_TEMPLATE_INSTANTIATION (decl1
)
13563 || flag_alt_external_templates
))
13565 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma
13566 interface, we will have interface_only set but not
13567 interface_known. In that case, we don't want to use the normal
13568 heuristics because someone will supply a #pragma implementation
13569 elsewhere, and deducing it here would produce a conflict. */
13570 comdat_linkage (decl1
);
13571 DECL_EXTERNAL (decl1
) = 0;
13572 DECL_INTERFACE_KNOWN (decl1
) = 1;
13573 DECL_DEFER_OUTPUT (decl1
) = 1;
13577 /* This is a definition, not a reference.
13578 So clear DECL_EXTERNAL. */
13579 DECL_EXTERNAL (decl1
) = 0;
13581 if ((DECL_THIS_INLINE (decl1
) || DECL_TEMPLATE_INSTANTIATION (decl1
))
13582 && ! DECL_INTERFACE_KNOWN (decl1
)
13583 /* Don't try to defer nested functions for now. */
13584 && ! decl_function_context (decl1
))
13585 DECL_DEFER_OUTPUT (decl1
) = 1;
13587 DECL_INTERFACE_KNOWN (decl1
) = 1;
13591 current_binding_level
->parm_flag
= 1;
13594 cplus_decl_attributes (decl1
, NULL_TREE
, attrs
);
13596 /* We need to do this even if we aren't expanding yet so that
13597 assemble_external works. */
13598 make_decl_rtl (decl1
, NULL
);
13600 /* Promote the value to int before returning it. */
13601 if (C_PROMOTING_INTEGER_TYPE_P (restype
))
13602 restype
= type_promotes_to (restype
);
13604 /* If this fcn was already referenced via a block-scope `extern' decl
13605 (or an implicit decl), propagate certain information about the usage. */
13606 if (TREE_ADDRESSABLE (DECL_ASSEMBLER_NAME (decl1
)))
13607 TREE_ADDRESSABLE (decl1
) = 1;
13609 if (DECL_RESULT (decl1
) == NULL_TREE
)
13611 DECL_RESULT (decl1
)
13612 = build_decl (RESULT_DECL
, 0, TYPE_MAIN_VARIANT (restype
));
13613 TREE_READONLY (DECL_RESULT (decl1
)) = CP_TYPE_CONST_P (restype
);
13614 TREE_THIS_VOLATILE (DECL_RESULT (decl1
)) = CP_TYPE_VOLATILE_P (restype
);
13619 if (DECL_DESTRUCTOR_P (decl1
))
13621 dtor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13622 DECL_CONTEXT (dtor_label
) = current_function_decl
;
13624 /* Under the old ABI we return `this' from constructors, so we make
13625 ordinary `return' statements in constructors jump to CTOR_LABEL;
13626 from there we return `this'. Under the new ABI, we don't bother
13627 with any of this. By not setting CTOR_LABEL the remainder of the
13628 machinery is automatically disabled. */
13629 else if (!flag_new_abi
&& DECL_CONSTRUCTOR_P (decl1
))
13631 ctor_label
= build_decl (LABEL_DECL
, NULL_TREE
, NULL_TREE
);
13632 DECL_CONTEXT (ctor_label
) = current_function_decl
;
13635 store_parm_decls (current_function_parms
);
13640 /* Store the parameter declarations into the current function declaration.
13641 This is called after parsing the parameter declarations, before
13642 digesting the body of the function.
13644 Also install to binding contour return value identifier, if any. */
13647 store_parm_decls (current_function_parms
)
13648 tree current_function_parms
;
13650 register tree fndecl
= current_function_decl
;
13651 register tree parm
;
13652 int parms_have_cleanups
= 0;
13653 tree cleanups
= NULL_TREE
;
13655 /* This is a list of types declared among parms in a prototype. */
13656 tree parmtags
= current_function_parm_tags
;
13658 /* This is a chain of any other decls that came in among the parm
13659 declarations. If a parm is declared with enum {foo, bar} x;
13660 then CONST_DECLs for foo and bar are put here. */
13661 tree nonparms
= NULL_TREE
;
13663 if (current_function_parms
)
13665 /* This case is when the function was defined with an ANSI prototype.
13666 The parms already have decls, so we need not do anything here
13667 except record them as in effect
13668 and complain if any redundant old-style parm decls were written. */
13670 tree specparms
= current_function_parms
;
13673 /* Must clear this because it might contain TYPE_DECLs declared
13675 storedecls (NULL_TREE
);
13677 /* If we're doing semantic analysis, then we'll call pushdecl
13678 for each of these. We must do them in reverse order so that
13679 they end in the correct forward order. */
13680 specparms
= nreverse (specparms
);
13682 for (parm
= specparms
; parm
; parm
= next
)
13684 next
= TREE_CHAIN (parm
);
13685 if (TREE_CODE (parm
) == PARM_DECL
)
13689 if (DECL_NAME (parm
) == NULL_TREE
13690 || TREE_CODE (parm
) != VOID_TYPE
)
13693 cp_error ("parameter `%D' declared void", parm
);
13695 cleanup
= (processing_template_decl
13697 : maybe_build_cleanup (parm
));
13700 cleanups
= tree_cons (parm
, cleanup
, cleanups
);
13704 /* If we find an enum constant or a type tag,
13705 put it aside for the moment. */
13706 TREE_CHAIN (parm
) = NULL_TREE
;
13707 nonparms
= chainon (nonparms
, parm
);
13711 /* Get the decls in their original chain order and record in the
13712 function. This is all and only the PARM_DECLs that were
13713 pushed into scope by the loop above. */
13714 DECL_ARGUMENTS (fndecl
) = getdecls ();
13715 storetags (chainon (parmtags
, gettags ()));
13718 DECL_ARGUMENTS (fndecl
) = NULL_TREE
;
13720 /* Now store the final chain of decls for the arguments
13721 as the decl-chain of the current lexical scope.
13722 Put the enumerators in as well, at the front so that
13723 DECL_ARGUMENTS is not modified. */
13724 storedecls (chainon (nonparms
, DECL_ARGUMENTS (fndecl
)));
13726 /* Now that we have initialized the parms, we can start their
13727 cleanups. We cannot do this before, since expand_decl_cleanup
13728 should not be called before the parm can be used. */
13731 finish_decl_cleanup (TREE_PURPOSE (cleanups
),
13732 TREE_VALUE (cleanups
));
13733 cleanups
= TREE_CHAIN (cleanups
);
13736 /* Create a binding contour which can be used to catch
13737 cleanup-generated temporaries. */
13738 if (parms_have_cleanups
)
13741 /* Do the starting of the exception specifications, if we have any. */
13742 if (flag_exceptions
&& !processing_template_decl
13743 && flag_enforce_eh_specs
13744 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13745 current_eh_spec_try_block
= expand_start_eh_spec ();
13749 /* We have finished doing semantic analysis on DECL, but have not yet
13750 generated RTL for its body. Save away our current state, so that
13751 when we want to generate RTL later we know what to do. */
13754 save_function_data (decl
)
13757 struct cp_language_function
*f
;
13759 /* Save the language-specific per-function data so that we can
13760 get it back when we really expand this function. */
13761 my_friendly_assert (!DECL_PENDING_INLINE_P (decl
),
13765 f
= ((struct cp_language_function
*)
13766 xmalloc (sizeof (struct cp_language_function
)));
13767 memcpy (f
, cp_function_chain
, sizeof (struct cp_language_function
));
13768 DECL_SAVED_FUNCTION_DATA (decl
) = f
;
13770 /* Clear out the bits we don't need. */
13771 f
->base
.x_stmt_tree
.x_last_stmt
= NULL_TREE
;
13772 f
->base
.x_stmt_tree
.x_last_expr_type
= NULL_TREE
;
13773 f
->x_named_label_uses
= NULL
;
13774 f
->bindings
= NULL
;
13776 /* When we get back here again, we will be expanding. */
13777 f
->x_expanding_p
= 1;
13779 /* If we've already decided that we cannot inline this function, we
13780 must remember that fact when we actually go to expand the
13782 f
->cannot_inline
= current_function_cannot_inline
;
13785 /* At the end of every constructor we generate to code to return
13786 `this'. Do that now. */
13789 finish_constructor_body ()
13791 /* Any return from a constructor will end up here. */
13793 add_stmt (build_stmt (LABEL_STMT
, ctor_label
));
13795 /* Clear CTOR_LABEL so that finish_return_stmt knows to really
13796 generate the return, rather than a goto to CTOR_LABEL. */
13797 ctor_label
= NULL_TREE
;
13798 /* In check_return_expr we translate an empty return from a
13799 constructor to a return of `this'. */
13800 finish_return_stmt (NULL_TREE
);
13801 /* Mark the end of the constructor. */
13802 add_stmt (build_stmt (CTOR_STMT
));
13805 /* At the end of every destructor we generate code to restore virtual
13806 function tables to the values desired by base classes and to call
13807 to base class destructors. Do that now. */
13810 finish_destructor_body ()
13812 tree compound_stmt
;
13817 /* Create a block to contain all the extra code. */
13818 compound_stmt
= begin_compound_stmt (/*has_no_scope=*/0);
13820 /* Any return from a destructor will end up here. */
13821 add_stmt (build_stmt (LABEL_STMT
, dtor_label
));
13823 /* Generate the code to call destructor on base class. If this
13824 destructor belongs to a class with virtual functions, then set
13825 the virtual function table pointer to represent the type of our
13828 /* This side-effect makes call to `build_delete' generate the code
13829 we have to have at the end of this destructor. `build_delete'
13830 will set the flag again. */
13831 TYPE_HAS_DESTRUCTOR (current_class_type
) = 0;
13833 exprstmt
= build_delete (current_class_type
,
13835 sfk_base_destructor
,
13836 LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
|LOOKUP_NORMAL
,
13839 if (exprstmt
!= error_mark_node
13840 && (TREE_CODE (exprstmt
) != NOP_EXPR
13841 || TREE_OPERAND (exprstmt
, 0) != integer_zero_node
13842 || TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
)))
13844 if (exprstmt
!= void_zero_node
)
13845 /* Don't call `expand_expr_stmt' if we're not going to do
13846 anything, since -Wall will give a diagnostic. */
13847 finish_expr_stmt (exprstmt
);
13849 /* Run destructors for all virtual baseclasses. */
13850 if (TYPE_USES_VIRTUAL_BASECLASSES (current_class_type
))
13855 if_stmt
= begin_if_stmt ();
13856 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13857 current_in_charge_parm
,
13861 vbases
= CLASSTYPE_VBASECLASSES (current_class_type
);
13862 /* The CLASSTYPE_VBASECLASSES list is in initialization
13863 order, so we have to march through it in reverse order. */
13864 for (vbases
= nreverse (copy_list (vbases
));
13866 vbases
= TREE_CHAIN (vbases
))
13868 tree vbase
= TREE_VALUE (vbases
);
13869 tree base_type
= BINFO_TYPE (vbase
);
13871 if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (base_type
))
13873 tree base_ptr_type
= build_pointer_type (base_type
);
13874 tree expr
= current_class_ptr
;
13876 /* Convert to the basetype here, as we know the layout is
13877 fixed. What is more, if we let build_method_call do it,
13878 it will use the vtable, which may have been clobbered
13879 by the deletion of our primary base. */
13881 expr
= build1 (NOP_EXPR
, base_ptr_type
, expr
);
13882 expr
= build (PLUS_EXPR
, base_ptr_type
, expr
,
13883 BINFO_OFFSET (vbase
));
13884 expr
= build_indirect_ref (expr
, NULL
);
13885 expr
= build_method_call (expr
, base_dtor_identifier
,
13888 finish_expr_stmt (expr
);
13892 finish_then_clause (if_stmt
);
13897 virtual_size
= c_sizeof (current_class_type
);
13899 /* At the end, call delete if that's what's requested. */
13901 /* FDIS sez: At the point of definition of a virtual destructor
13902 (including an implicit definition), non-placement operator delete
13903 shall be looked up in the scope of the destructor's class and if
13904 found shall be accessible and unambiguous.
13906 This is somewhat unclear, but I take it to mean that if the class
13907 only defines placement deletes we don't do anything here. So we
13908 pass LOOKUP_SPECULATIVELY; delete_sanity will complain for us if
13909 they ever try to delete one of these. */
13910 exprstmt
= build_op_delete_call
13911 (DELETE_EXPR
, current_class_ptr
, virtual_size
,
13912 LOOKUP_NORMAL
| LOOKUP_SPECULATIVELY
, NULL_TREE
);
13914 if_stmt
= begin_if_stmt ();
13915 finish_if_stmt_cond (build (BIT_AND_EXPR
, integer_type_node
,
13916 current_in_charge_parm
,
13919 finish_expr_stmt (exprstmt
);
13920 finish_then_clause (if_stmt
);
13923 /* Close the block we started above. */
13924 finish_compound_stmt (/*has_no_scope=*/0, compound_stmt
);
13927 /* Finish up a function declaration and compile that function
13928 all the way to assembler language output. The free the storage
13929 for the function definition.
13931 FLAGS is a bitwise or of the following values:
13933 An extra call to poplevel (and expand_end_bindings) must be
13934 made to take care of the binding contour for the base
13935 initializers. This is only relevant for constructors.
13937 We just finished processing the body of an in-class inline
13938 function definition. (This processing will have taken place
13939 after the class definition is complete.) */
13942 finish_function (flags
)
13945 register tree fndecl
= current_function_decl
;
13946 tree fntype
, ctype
= NULL_TREE
;
13947 int call_poplevel
= (flags
& 1) != 0;
13948 int inclass_inline
= (flags
& 2) != 0;
13951 /* When we get some parse errors, we can end up without a
13952 current_function_decl, so cope. */
13953 if (fndecl
== NULL_TREE
)
13954 return error_mark_node
;
13956 nested
= function_depth
> 1;
13957 fntype
= TREE_TYPE (fndecl
);
13959 /* TREE_READONLY (fndecl) = 1;
13960 This caused &foo to be of type ptr-to-const-function
13961 which then got a warning when stored in a ptr-to-function variable. */
13963 my_friendly_assert (building_stmt_tree (), 20000911);
13965 /* For a cloned function, we've already got all the code we need;
13966 there's no need to add any extra bits. */
13967 if (!DECL_CLONED_FUNCTION_P (fndecl
))
13969 if (DECL_CONSTRUCTOR_P (fndecl
))
13971 finish_constructor_body ();
13975 else if (DECL_DESTRUCTOR_P (fndecl
) && !processing_template_decl
)
13976 finish_destructor_body ();
13977 else if (DECL_MAIN_P (fndecl
))
13979 /* Make it so that `main' always returns 0 by default. */
13981 finish_return_stmt (integer_one_node
);
13983 finish_return_stmt (integer_zero_node
);
13987 /* Finish dealing with exception specifiers. */
13988 if (flag_exceptions
&& !processing_template_decl
13989 && flag_enforce_eh_specs
13990 && TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl
)))
13991 expand_end_eh_spec (TYPE_RAISES_EXCEPTIONS
13992 (TREE_TYPE (current_function_decl
)),
13993 current_eh_spec_try_block
);
13996 /* If we're saving up tree structure, tie off the function now. */
13997 finish_stmt_tree (&DECL_SAVED_TREE (fndecl
));
13999 /* This must come after expand_function_end because cleanups might
14000 have declarations (from inline functions) that need to go into
14001 this function's blocks. */
14002 if (current_binding_level
->parm_flag
!= 1)
14003 my_friendly_abort (122);
14004 poplevel (1, 0, 1);
14006 /* Remember that we were in class scope. */
14007 if (current_class_name
)
14008 ctype
= current_class_type
;
14010 /* Must mark the RESULT_DECL as being in this function. */
14011 DECL_CONTEXT (DECL_RESULT (fndecl
)) = fndecl
;
14013 /* Set the BLOCK_SUPERCONTEXT of the outermost function scope to point
14014 to the FUNCTION_DECL node itself. */
14015 BLOCK_SUPERCONTEXT (DECL_INITIAL (fndecl
)) = fndecl
;
14017 /* Save away current state, if appropriate. */
14018 if (!processing_template_decl
)
14019 save_function_data (fndecl
);
14021 /* If this function calls `setjmp' it cannot be inlined. When
14022 `longjmp' is called it is not guaranteed to restore the value of
14023 local variables that have been modified since the call to
14024 `setjmp'. So, if were to inline this function into some caller
14025 `c', then when we `longjmp', we might not restore all variables
14026 in `c'. (It might seem, at first blush, that there's no way for
14027 this function to modify local variables in `c', but their
14028 addresses may have been stored somewhere accessible to this
14030 if (!processing_template_decl
&& calls_setjmp_p (fndecl
))
14031 DECL_UNINLINABLE (fndecl
) = 1;
14033 /* Clear out memory we no longer need. */
14034 free_after_parsing (cfun
);
14035 /* Since we never call rest_of_compilation, we never clear
14036 CFUN. Do so explicitly. */
14037 free_after_compilation (cfun
);
14040 /* If this is a in-class inline definition, we may have to pop the
14041 bindings for the template parameters that we added in
14042 maybe_begin_member_template_processing when start_function was
14044 if (inclass_inline
)
14045 maybe_end_member_template_processing ();
14047 /* Leave the scope of the class. */
14049 pop_nested_class ();
14055 /* Let the error reporting routines know that we're outside a
14056 function. For a nested function, this value is used in
14057 pop_cp_function_context and then reset via pop_function_context. */
14058 current_function_decl
= NULL_TREE
;
14063 /* Create the FUNCTION_DECL for a function definition.
14064 DECLSPECS and DECLARATOR are the parts of the declaration;
14065 they describe the return type and the name of the function,
14066 but twisted together in a fashion that parallels the syntax of C.
14068 This function creates a binding context for the function body
14069 as well as setting up the FUNCTION_DECL in current_function_decl.
14071 Returns a FUNCTION_DECL on success.
14073 If the DECLARATOR is not suitable for a function (it defines a datum
14074 instead), we return 0, which tells yyparse to report a parse error.
14076 May return void_type_node indicating that this method is actually
14077 a friend. See grokfield for more details.
14079 Came here with a `.pushlevel' .
14081 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
14082 CHANGES TO CODE IN `grokfield'. */
14085 start_method (declspecs
, declarator
, attrlist
)
14086 tree declarator
, declspecs
, attrlist
;
14088 tree fndecl
= grokdeclarator (declarator
, declspecs
, MEMFUNCDEF
, 0,
14091 /* Something too ugly to handle. */
14092 if (fndecl
== NULL_TREE
)
14095 /* Pass friends other than inline friend functions back. */
14096 if (fndecl
== void_type_node
)
14099 if (TREE_CODE (fndecl
) != FUNCTION_DECL
)
14100 /* Not a function, tell parser to report parse error. */
14103 if (DECL_IN_AGGR_P (fndecl
))
14105 if (IDENTIFIER_ERROR_LOCUS (DECL_ASSEMBLER_NAME (fndecl
)) != current_class_type
)
14107 if (DECL_CONTEXT (fndecl
)
14108 && TREE_CODE( DECL_CONTEXT (fndecl
)) != NAMESPACE_DECL
)
14109 cp_error ("`%D' is already defined in class `%T'", fndecl
,
14110 DECL_CONTEXT (fndecl
));
14112 return void_type_node
;
14115 check_template_shadow (fndecl
);
14117 DECL_THIS_INLINE (fndecl
) = 1;
14119 if (flag_default_inline
)
14120 DECL_INLINE (fndecl
) = 1;
14122 /* We process method specializations in finish_struct_1. */
14123 if (processing_template_decl
&& !DECL_TEMPLATE_SPECIALIZATION (fndecl
))
14124 fndecl
= push_template_decl (fndecl
);
14126 if (! DECL_FRIEND_P (fndecl
))
14128 if (TREE_CHAIN (fndecl
))
14130 fndecl
= copy_node (fndecl
);
14131 TREE_CHAIN (fndecl
) = NULL_TREE
;
14134 if (DECL_CONSTRUCTOR_P (fndecl
))
14136 if (! grok_ctor_properties (current_class_type
, fndecl
))
14137 return void_type_node
;
14139 else if (IDENTIFIER_OPNAME_P (DECL_NAME (fndecl
)))
14140 grok_op_properties (fndecl
, DECL_VIRTUAL_P (fndecl
), 0);
14143 cp_finish_decl (fndecl
, NULL_TREE
, NULL_TREE
, 0);
14145 /* Make a place for the parms */
14147 current_binding_level
->parm_flag
= 1;
14149 DECL_IN_AGGR_P (fndecl
) = 1;
14153 /* Go through the motions of finishing a function definition.
14154 We don't compile this method until after the whole class has
14157 FINISH_METHOD must return something that looks as though it
14158 came from GROKFIELD (since we are defining a method, after all).
14160 This is called after parsing the body of the function definition.
14161 STMTS is the chain of statements that makes up the function body.
14163 DECL is the ..._DECL that `start_method' provided. */
14166 finish_method (decl
)
14169 register tree fndecl
= decl
;
14172 register tree link
;
14174 if (decl
== void_type_node
)
14177 old_initial
= DECL_INITIAL (fndecl
);
14179 /* Undo the level for the parms (from start_method).
14180 This is like poplevel, but it causes nothing to be
14181 saved. Saving information here confuses symbol-table
14182 output routines. Besides, this information will
14183 be correctly output when this method is actually
14186 /* Clear out the meanings of the local variables of this level;
14187 also record in each decl which block it belongs to. */
14189 for (link
= current_binding_level
->names
; link
; link
= TREE_CHAIN (link
))
14191 if (DECL_NAME (link
) != NULL_TREE
)
14192 pop_binding (DECL_NAME (link
), link
);
14193 my_friendly_assert (TREE_CODE (link
) != FUNCTION_DECL
, 163);
14194 DECL_CONTEXT (link
) = NULL_TREE
;
14197 GNU_xref_end_scope ((HOST_WIDE_INT
) current_binding_level
,
14198 (HOST_WIDE_INT
) current_binding_level
->level_chain
,
14199 current_binding_level
->parm_flag
,
14200 current_binding_level
->keep
);
14202 poplevel (0, 0, 0);
14204 DECL_INITIAL (fndecl
) = old_initial
;
14206 /* We used to check if the context of FNDECL was different from
14207 current_class_type as another way to get inside here. This didn't work
14208 for String.cc in libg++. */
14209 if (DECL_FRIEND_P (fndecl
))
14211 CLASSTYPE_INLINE_FRIENDS (current_class_type
)
14212 = tree_cons (NULL_TREE
, fndecl
, CLASSTYPE_INLINE_FRIENDS (current_class_type
));
14213 decl
= void_type_node
;
14219 /* Called when a new struct TYPE is defined.
14220 If this structure or union completes the type of any previous
14221 variable declaration, lay it out and output its rtl. */
14224 hack_incomplete_structures (type
)
14228 struct binding_level
*level
;
14230 if (!type
) /* Don't do this for class templates. */
14233 if (namespace_bindings_p ())
14236 list
= &namespace_scope_incomplete
;
14240 level
= innermost_nonclass_level ();
14241 list
= &level
->incomplete
;
14248 tree decl
= TREE_VALUE (*list
);
14249 if ((decl
&& TREE_TYPE (decl
) == type
)
14250 || (TREE_TYPE (decl
)
14251 && TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14252 && TREE_TYPE (TREE_TYPE (decl
)) == type
))
14254 int toplevel
= toplevel_bindings_p ();
14255 if (TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
14256 && TREE_TYPE (TREE_TYPE (decl
)) == type
)
14257 layout_type (TREE_TYPE (decl
));
14258 layout_decl (decl
, 0);
14259 rest_of_decl_compilation (decl
, NULL_PTR
, toplevel
, 0);
14263 expand_decl (decl
);
14264 cleanup
= maybe_build_cleanup (decl
);
14265 expand_decl_init (decl
);
14266 if (! expand_decl_cleanup (decl
, cleanup
))
14267 cp_error ("parser lost in parsing declaration of `%D'",
14270 *list
= TREE_CHAIN (*list
);
14273 list
= &TREE_CHAIN (*list
);
14276 /* Keep looking through artificial binding levels generated
14277 for local variables. */
14278 if (level
&& level
->keep
== 2)
14280 level
= level
->level_chain
;
14281 list
= &level
->incomplete
;
14288 /* If DECL is of a type which needs a cleanup, build that cleanup
14292 maybe_build_cleanup (decl
)
14295 tree type
= TREE_TYPE (decl
);
14297 if (type
!= error_mark_node
&& TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
14299 int flags
= LOOKUP_NORMAL
|LOOKUP_DESTRUCTOR
;
14302 if (TREE_CODE (type
) == ARRAY_TYPE
)
14306 mark_addressable (decl
);
14307 rval
= build_unary_op (ADDR_EXPR
, decl
, 0);
14310 /* Optimize for space over speed here. */
14311 if (! TYPE_USES_VIRTUAL_BASECLASSES (type
)
14312 || flag_expensive_optimizations
)
14313 flags
|= LOOKUP_NONVIRTUAL
;
14315 rval
= build_delete (TREE_TYPE (rval
), rval
,
14316 sfk_complete_destructor
, flags
, 0);
14318 if (TYPE_USES_VIRTUAL_BASECLASSES (type
)
14319 && ! TYPE_HAS_DESTRUCTOR (type
))
14320 rval
= build_compound_expr (tree_cons (NULL_TREE
, rval
,
14321 build_tree_list (NULL_TREE
, build_vbase_delete (type
, decl
))));
14328 /* When a stmt has been parsed, this function is called. */
14333 /* Always assume this statement was not an expression statement. If
14334 it actually was an expression statement, its our callers
14335 responsibility to fix this up. */
14336 last_expr_type
= NULL_TREE
;
14339 /* DECL was originally constructed as a non-static member function,
14340 but turned out to be static. Update it accordingly. */
14343 revert_static_member_fn (decl
)
14347 tree function
= TREE_TYPE (decl
);
14348 tree args
= TYPE_ARG_TYPES (function
);
14350 if (CP_TYPE_QUALS (TREE_TYPE (TREE_VALUE (args
)))
14351 != TYPE_UNQUALIFIED
)
14352 cp_error ("static member function `%#D' declared with type qualifiers",
14355 args
= TREE_CHAIN (args
);
14356 tmp
= build_function_type (TREE_TYPE (function
), args
);
14357 tmp
= build_qualified_type (tmp
, CP_TYPE_QUALS (function
));
14358 tmp
= build_exception_variant (tmp
,
14359 TYPE_RAISES_EXCEPTIONS (function
));
14360 TREE_TYPE (decl
) = tmp
;
14361 if (DECL_ARGUMENTS (decl
))
14362 DECL_ARGUMENTS (decl
) = TREE_CHAIN (DECL_ARGUMENTS (decl
));
14363 DECL_STATIC_FUNCTION_P (decl
) = 1;
14366 /* Initialize the variables used during compilation of a C++
14370 push_cp_function_context (f
)
14371 struct function
*f
;
14373 struct cp_language_function
*p
14374 = ((struct cp_language_function
*)
14375 xcalloc (1, sizeof (struct cp_language_function
)));
14376 f
->language
= (struct language_function
*) p
;
14378 /* It takes an explicit call to expand_body to generate RTL for a
14382 /* Whenever we start a new function, we destroy temporaries in the
14384 current_stmt_tree ()->stmts_are_full_exprs_p
= 1;
14387 /* Free the language-specific parts of F, now that we've finished
14388 compiling the function. */
14391 pop_cp_function_context (f
)
14392 struct function
*f
;
14395 free (f
->language
);
14399 /* Mark P for GC. */
14402 mark_lang_function (p
)
14403 struct cp_language_function
*p
;
14408 mark_c_language_function (&p
->base
);
14410 ggc_mark_tree (p
->x_ctor_label
);
14411 ggc_mark_tree (p
->x_dtor_label
);
14412 ggc_mark_tree (p
->x_current_class_ptr
);
14413 ggc_mark_tree (p
->x_current_class_ref
);
14414 ggc_mark_tree (p
->x_eh_spec_try_block
);
14416 mark_named_label_lists (&p
->x_named_labels
, &p
->x_named_label_uses
);
14417 mark_binding_level (&p
->bindings
);
14420 /* Mark the language-specific data in F for GC. */
14423 mark_cp_function_context (f
)
14424 struct function
*f
;
14426 mark_lang_function ((struct cp_language_function
*) f
->language
);
14433 enum tree_code code
= TREE_CODE (t
);
14434 if (code
== IDENTIFIER_NODE
)
14436 struct lang_identifier
*li
= (struct lang_identifier
*) t
;
14437 struct lang_id2
*li2
= li
->x
;
14438 ggc_mark_tree (li
->namespace_bindings
);
14439 ggc_mark_tree (li
->bindings
);
14440 ggc_mark_tree (li
->class_value
);
14441 ggc_mark_tree (li
->class_template_info
);
14445 ggc_mark_tree (li2
->label_value
);
14446 ggc_mark_tree (li2
->implicit_decl
);
14447 ggc_mark_tree (li2
->error_locus
);
14450 else if (code
== CPLUS_BINDING
)
14452 if (BINDING_HAS_LEVEL_P (t
))
14453 mark_binding_level (&BINDING_LEVEL (t
));
14455 ggc_mark_tree (BINDING_SCOPE (t
));
14456 ggc_mark_tree (BINDING_VALUE (t
));
14458 else if (code
== OVERLOAD
)
14459 ggc_mark_tree (OVL_FUNCTION (t
));
14460 else if (code
== TEMPLATE_PARM_INDEX
)
14461 ggc_mark_tree (TEMPLATE_PARM_DECL (t
));
14462 else if (TREE_CODE_CLASS (code
) == 'd')
14464 struct lang_decl
*ld
= DECL_LANG_SPECIFIC (t
);
14469 c_mark_lang_decl (&ld
->decl_flags
.base
);
14470 if (!DECL_GLOBAL_CTOR_P (t
)
14471 && !DECL_GLOBAL_DTOR_P (t
)
14472 && !DECL_THUNK_P (t
))
14473 ggc_mark_tree (ld
->decl_flags
.u2
.access
);
14474 else if (DECL_THUNK_P (t
))
14475 ggc_mark_tree (ld
->decl_flags
.u2
.vcall_offset
);
14476 if (TREE_CODE (t
) != NAMESPACE_DECL
)
14477 ggc_mark_tree (ld
->decl_flags
.u
.template_info
);
14479 mark_binding_level (&NAMESPACE_LEVEL (t
));
14480 if (CAN_HAVE_FULL_LANG_DECL_P (t
))
14482 ggc_mark_tree (ld
->befriending_classes
);
14483 ggc_mark_tree (ld
->context
);
14484 ggc_mark_tree (ld
->cloned_function
);
14485 if (!DECL_OVERLOADED_OPERATOR_P (t
))
14486 ggc_mark_tree (ld
->u2
.vtt_parm
);
14487 if (TREE_CODE (t
) == TYPE_DECL
)
14488 ggc_mark_tree (ld
->u
.sorted_fields
);
14489 else if (TREE_CODE (t
) == FUNCTION_DECL
14490 && !DECL_PENDING_INLINE_P (t
))
14491 mark_lang_function (DECL_SAVED_FUNCTION_DATA (t
));
14495 else if (TREE_CODE_CLASS (code
) == 't')
14497 struct lang_type
*lt
= TYPE_LANG_SPECIFIC (t
);
14499 if (lt
&& !(TREE_CODE (t
) == POINTER_TYPE
14500 && TREE_CODE (TREE_TYPE (t
)) == METHOD_TYPE
))
14503 ggc_mark_tree (lt
->primary_base
);
14504 ggc_mark_tree (lt
->vfields
);
14505 ggc_mark_tree (lt
->vbases
);
14506 ggc_mark_tree (lt
->tags
);
14507 ggc_mark_tree (lt
->size
);
14508 ggc_mark_tree (lt
->pure_virtuals
);
14509 ggc_mark_tree (lt
->friend_classes
);
14510 ggc_mark_tree (lt
->rtti
);
14511 ggc_mark_tree (lt
->methods
);
14512 ggc_mark_tree (lt
->template_info
);
14513 ggc_mark_tree (lt
->befriending_classes
);
14516 /* In the case of pointer-to-member function types, the
14517 TYPE_LANG_SPECIFIC is really just a tree. */
14518 ggc_mark_tree ((tree
) lt
);
14522 /* Return the IDENTIFIER_GLOBAL_VALUE of T, for use in common code, since
14523 the definition of IDENTIFIER_GLOBAL_VALUE is different for C and C++. */
14526 identifier_global_value (t
)
14529 return IDENTIFIER_GLOBAL_VALUE (t
);
14532 /* Build the void_list_node (void_type_node having been created). */
14534 build_void_list_node ()
14536 tree t
= build_tree_list (NULL_TREE
, void_type_node
);
14537 TREE_PARMLIST (t
) = 1;
14542 cp_missing_noreturn_ok_p (decl
)
14545 /* A missing noreturn is ok for the `main' function. */
14546 return MAIN_NAME_P (DECL_ASSEMBLER_NAME (decl
));